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. Use semiring classes directly. INCOMPATIBILITY.
154 * Theory 'Finite_Set': various folding_* locales facilitate the application
155 of the various fold combinators on finite sets.
157 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
158 provides abstract red-black tree type which is backed by RBT_Impl
159 as implementation. INCOMPATIBILTY.
161 * Command 'typedef' now works within a local theory context -- without
162 introducing dependencies on parameters or assumptions, which is not
163 possible in Isabelle/Pure/HOL. Note that the logical environment may
164 contain multiple interpretations of local typedefs (with different
165 non-emptiness proofs), even in a global theory context.
167 * Theory Library/Coinductive_List has been removed -- superseded by
168 AFP/thys/Coinductive.
170 * Theory PReal, including the type "preal" and related operations, has
171 been removed. INCOMPATIBILITY.
173 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
174 Min, Max from theory Finite_Set. INCOMPATIBILITY.
176 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
179 * New set of rules "ac_simps" provides combined assoc / commute rewrites
180 for all interpretations of the appropriate generic locales.
182 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
183 into theories "Rings" and "Fields"; for more appropriate and more
184 consistent names suitable for name prefixes within the HOL theories.
187 * Some generic constants have been put to appropriate theories:
188 * less_eq, less: Orderings
189 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
190 * inverse, divide: Rings
193 * More consistent naming of type classes involving orderings (and lattices):
195 lower_semilattice ~> semilattice_inf
196 upper_semilattice ~> semilattice_sup
198 dense_linear_order ~> dense_linorder
200 pordered_ab_group_add ~> ordered_ab_group_add
201 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
202 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
203 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
204 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
205 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
206 pordered_cancel_semiring ~> ordered_cancel_semiring
207 pordered_comm_monoid_add ~> ordered_comm_monoid_add
208 pordered_comm_ring ~> ordered_comm_ring
209 pordered_comm_semiring ~> ordered_comm_semiring
210 pordered_ring ~> ordered_ring
211 pordered_ring_abs ~> ordered_ring_abs
212 pordered_semiring ~> ordered_semiring
214 ordered_ab_group_add ~> linordered_ab_group_add
215 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
216 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
217 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
218 ordered_field ~> linordered_field
219 ordered_field_no_lb ~> linordered_field_no_lb
220 ordered_field_no_ub ~> linordered_field_no_ub
221 ordered_field_dense_linear_order ~> dense_linordered_field
222 ordered_idom ~> linordered_idom
223 ordered_ring ~> linordered_ring
224 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
225 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
226 ordered_ring_strict ~> linordered_ring_strict
227 ordered_semidom ~> linordered_semidom
228 ordered_semiring ~> linordered_semiring
229 ordered_semiring_1 ~> linordered_semiring_1
230 ordered_semiring_1_strict ~> linordered_semiring_1_strict
231 ordered_semiring_strict ~> linordered_semiring_strict
233 The following slightly odd type classes have been moved to
234 a separate theory Library/Lattice_Algebras.thy:
236 lordered_ab_group_add ~> lattice_ab_group_add
237 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
238 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
239 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
240 lordered_ring ~> lattice_ring
244 * Refined field classes:
245 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
246 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
247 * numerous lemmas have been ported from field to division_ring;
250 * Refined algebra theorem collections:
251 * dropped theorem group group_simps, use algebra_simps instead;
252 * dropped theorem group ring_simps, use field_simps instead;
253 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
254 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
257 * Theory Finite_Set and List: some lemmas have been generalized from
260 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
261 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
262 inter_Inter_fold_inter ~> inf_Inf_fold_inf
263 union_Union_fold_union ~> sup_Sup_fold_sup
264 Inter_fold_inter ~> Inf_fold_inf
265 Union_fold_union ~> Sup_fold_sup
266 inter_INTER_fold_inter ~> inf_INFI_fold_inf
267 union_UNION_fold_union ~> sup_SUPR_fold_sup
268 INTER_fold_inter ~> INFI_fold_inf
269 UNION_fold_union ~> SUPR_fold_sup
271 * Theory Complete_Lattice: lemmas top_def and bot_def have been
272 replaced by the more convenient lemmas Inf_empty and Sup_empty.
273 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
274 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
275 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
276 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
278 * HOLogic.strip_psplit: types are returned in syntactic order, similar
279 to other strip and tuple operations. INCOMPATIBILITY.
281 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
282 * pointwise ordering is instance of class order with standard syntax <= and <;
283 * multiset ordering has syntax <=# and <#; partial order properties are provided
284 by means of interpretation with prefix multiset_order;
285 * less duplication, less historical organization of sections,
286 conversion from associations lists to multisets, rudimentary code generation;
287 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
290 * Code generation: ML and OCaml code is decorated with signatures.
292 * Theory List: added transpose.
294 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
295 clash with new theory Quotient in Main HOL.
297 * Library/Nat_Bijection.thy is a collection of bijective functions
298 between nat and other types, which supersedes the older libraries
299 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
302 Nat_Int_Bij.nat2_to_nat ~> prod_encode
303 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
304 Nat_Int_Bij.int_to_nat_bij ~> int_encode
305 Nat_Int_Bij.nat_to_int_bij ~> int_decode
306 Countable.pair_encode ~> prod_encode
307 NatIso.prod2nat ~> prod_encode
308 NatIso.nat2prod ~> prod_decode
309 NatIso.sum2nat ~> sum_encode
310 NatIso.nat2sum ~> sum_decode
311 NatIso.list2nat ~> list_encode
312 NatIso.nat2list ~> list_decode
313 NatIso.set2nat ~> set_encode
314 NatIso.nat2set ~> set_decode
317 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
318 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
319 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
320 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
321 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
322 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
323 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
324 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
325 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
326 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
327 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
328 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
329 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
334 * Variable names in lemmas generated by the domain package have
335 changed; the naming scheme is now consistent with the HOL datatype
336 package. Some proof scripts may be affected, INCOMPATIBILITY.
338 * The domain package no longer defines the function "foo_copy" for
339 recursive domain "foo". The reach lemma is now stated directly in
340 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
341 be reformulated in terms of "foo_take", INCOMPATIBILITY.
343 * Most definedness lemmas generated by the domain package (previously
344 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
345 like "foo$x = UU <-> x = UU", which works better as a simp rule.
346 Proof scripts that used definedness lemmas as intro rules may break,
347 potential INCOMPATIBILITY.
349 * Induction and casedist rules generated by the domain package now
350 declare proper case_names (one called "bottom", and one named for each
351 constructor). INCOMPATIBILITY.
353 * For mutually-recursive domains, separate "reach" and "take_lemma"
354 rules are generated for each domain, INCOMPATIBILITY.
356 foo_bar.reach ~> foo.reach bar.reach
357 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
359 * Some lemmas generated by the domain package have been renamed for
360 consistency with the datatype package, INCOMPATIBILITY.
362 foo.ind ~> foo.induct
363 foo.finite_ind ~> foo.finite_induct
364 foo.coind ~> foo.coinduct
365 foo.casedist ~> foo.exhaust
366 foo.exhaust ~> foo.nchotomy
368 * For consistency with other definition packages, the fixrec package
369 now generates qualified theorem names, INCOMPATIBILITY.
371 foo_simps ~> foo.simps
372 foo_unfold ~> foo.unfold
373 foo_induct ~> foo.induct
375 * The "contlub" predicate has been removed. Proof scripts should use
376 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
378 * The "admw" predicate has been removed, INCOMPATIBILITY.
380 * The constants cpair, cfst, and csnd have been removed in favor of
381 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
386 * Sorts.certify_sort and derived "cert" operations for types and terms
387 no longer minimize sorts. Thus certification at the boundary of the
388 inference kernel becomes invariant under addition of class relations,
389 which is an important monotonicity principle. Sorts are now minimized
390 in the syntax layer only, at the boundary between the end-user and the
391 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
392 explicitly in rare situations.
394 * Antiquotations for basic formal entities:
396 @{class NAME} -- type class
397 @{class_syntax NAME} -- syntax representation of the above
399 @{type_name NAME} -- logical type
400 @{type_abbrev NAME} -- type abbreviation
401 @{nonterminal NAME} -- type of concrete syntactic category
402 @{type_syntax NAME} -- syntax representation of any of the above
404 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
405 @{const_abbrev NAME} -- abbreviated constant
406 @{const_syntax NAME} -- syntax representation of any of the above
408 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
409 syntax constant (cf. 'syntax' command).
411 * Antiquotation @{make_string} inlines a function to print arbitrary
412 values similar to the ML toplevel. The result is compiler dependent
413 and may fall back on "?" in certain situations.
415 * Renamed old-style Drule.standard to Drule.export_without_context, to
416 emphasize that this is in no way a standard operation.
419 * Curried take and drop in library.ML; negative length is interpreted
420 as infinity (as in chop). INCOMPATIBILITY.
422 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
423 usual for resolution. Rare INCOMPATIBILITY.
425 * Discontinued old TheoryDataFun with its copy/init operation -- data
426 needs to be pure. Functor Theory_Data_PP retains the traditional
427 Pretty.pp argument to merge, which is absent in the standard
430 * Renamed varify/unvarify operations to varify_global/unvarify_global
431 to emphasize that these only work in a global situation (which is
434 * Configuration options now admit dynamic default values, depending on
435 the context or even global references.
437 * Most operations that refer to a global context are named
438 accordingly, e.g. Simplifier.global_context or
439 ProofContext.init_global. There are some situations where a global
440 context actually works, but under normal circumstances one needs to
441 pass the proper local context through the code!
446 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
447 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
448 proof terms are enabled unconditionally in the new HOL-Proofs image.
450 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
451 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
454 * Old lib/scripts/polyml-platform is superseded by the
455 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
456 variant, even on a 64 bit machine. The following example setting
457 prefers 64 bit if available:
459 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
463 New in Isabelle2009-1 (December 2009)
464 -------------------------------------
468 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
469 one backslash should be used, even in ML sources.
474 * Locale interpretation propagates mixins along the locale hierarchy.
475 The currently only available mixins are the equations used to map
476 local definitions to terms of the target domain of an interpretation.
478 * Reactivated diagnostic command 'print_interps'. Use "print_interps
479 loc" to print all interpretations of locale "loc" in the theory.
480 Interpretations in proofs are not shown.
482 * Thoroughly revised locales tutorial. New section on conditional
485 * On instantiation of classes, remaining undefined class parameters
486 are formally declared. INCOMPATIBILITY.
489 *** Document preparation ***
491 * New generalized style concept for printing terms: @{foo (style) ...}
492 instead of @{foo_style style ...} (old form is still retained for
493 backward compatibility). Styles can be also applied for
494 antiquotations prop, term_type and typeof.
499 * New proof method "smt" for a combination of first-order logic with
500 equality, linear and nonlinear (natural/integer/real) arithmetic, and
501 fixed-size bitvectors; there is also basic support for higher-order
502 features (esp. lambda abstractions). It is an incomplete decision
503 procedure based on external SMT solvers using the oracle mechanism;
504 for the SMT solver Z3, this method is proof-producing. Certificates
505 are provided to avoid calling the external solvers solely for
506 re-checking proofs. Due to a remote SMT service there is no need for
507 installing SMT solvers locally. See src/HOL/SMT.
509 * New commands to load and prove verification conditions generated by
510 the Boogie program verifier or derived systems (e.g. the Verifying C
511 Compiler (VCC) or Spec#). See src/HOL/Boogie.
513 * New counterexample generator tool 'nitpick' based on the Kodkod
514 relational model finder. See src/HOL/Tools/Nitpick and
515 src/HOL/Nitpick_Examples.
517 * New commands 'code_pred' and 'values' to invoke the predicate
518 compiler and to enumerate values of inductive predicates.
520 * A tabled implementation of the reflexive transitive closure.
522 * New implementation of quickcheck uses generic code generator;
523 default generators are provided for all suitable HOL types, records
524 and datatypes. Old quickcheck can be re-activated importing theory
525 Library/SML_Quickcheck.
527 * New testing tool Mirabelle for automated proof tools. Applies
528 several tools and tactics like sledgehammer, metis, or quickcheck, to
529 every proof step in a theory. To be used in batch mode via the
532 * New proof method "sos" (sum of squares) for nonlinear real
533 arithmetic (originally due to John Harison). It requires theory
534 Library/Sum_Of_Squares. It is not a complete decision procedure but
535 works well in practice on quantifier-free real arithmetic with +, -,
536 *, ^, =, <= and <, i.e. boolean combinations of equalities and
537 inequalities between polynomials. It makes use of external
538 semidefinite programming solvers. Method "sos" generates a
539 certificate that can be pasted into the proof thus avoiding the need
540 to call an external tool every time the proof is checked. See
541 src/HOL/Library/Sum_Of_Squares.
543 * New method "linarith" invokes existing linear arithmetic decision
546 * New command 'atp_minimal' reduces result produced by Sledgehammer.
548 * New Sledgehammer option "Full Types" in Proof General settings menu.
549 Causes full type information to be output to the ATPs. This slows
550 ATPs down considerably but eliminates a source of unsound "proofs"
553 * New method "metisFT": A version of metis that uses full type
554 information in order to avoid failures of proof reconstruction.
556 * New evaluator "approximate" approximates an real valued term using
557 the same method as the approximation method.
559 * Method "approximate" now supports arithmetic expressions as
560 boundaries of intervals and implements interval splitting and Taylor
563 * ML antiquotation @{code_datatype} inserts definition of a datatype
564 generated by the code generator; e.g. see src/HOL/Predicate.thy.
566 * New theory SupInf of the supremum and infimum operators for sets of
569 * New theory Probability, which contains a development of measure
570 theory, eventually leading to Lebesgue integration and probability.
572 * Extended Multivariate Analysis to include derivation and Brouwer's
575 * Reorganization of number theory, INCOMPATIBILITY:
576 - new number theory development for nat and int, in theories Divides
577 and GCD as well as in new session Number_Theory
578 - some constants and facts now suffixed with _nat and _int
580 - former session NumberTheory now named Old_Number_Theory, including
581 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
582 - moved theory Pocklington from src/HOL/Library to
583 src/HOL/Old_Number_Theory
585 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
586 lcm of finite and infinite sets. It is shown that they form a complete
589 * Class semiring_div requires superclass no_zero_divisors and proof of
590 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
591 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
592 generalized to class semiring_div, subsuming former theorems
593 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
594 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
597 * Refinements to lattice classes and sets:
598 - less default intro/elim rules in locale variant, more default
599 intro/elim rules in class variant: more uniformity
600 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
602 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
604 - renamed ACI to inf_sup_aci
605 - new class "boolean_algebra"
606 - class "complete_lattice" moved to separate theory
607 "Complete_Lattice"; corresponding constants (and abbreviations)
608 renamed and with authentic syntax:
609 Set.Inf ~> Complete_Lattice.Inf
610 Set.Sup ~> Complete_Lattice.Sup
611 Set.INFI ~> Complete_Lattice.INFI
612 Set.SUPR ~> Complete_Lattice.SUPR
613 Set.Inter ~> Complete_Lattice.Inter
614 Set.Union ~> Complete_Lattice.Union
615 Set.INTER ~> Complete_Lattice.INTER
616 Set.UNION ~> Complete_Lattice.UNION
617 - authentic syntax for
620 - mere abbreviations:
623 Set.inter (for inf, formerly Set.Int)
624 Set.union (for sup, formerly Set.Un)
625 Complete_Lattice.Inter (for Inf)
626 Complete_Lattice.Union (for Sup)
627 Complete_Lattice.INTER (for INFI)
628 Complete_Lattice.UNION (for SUPR)
629 - object-logic definitions as far as appropriate
631 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
632 Un_subset_iff are explicitly deleted as default simp rules; then also
633 their lattice counterparts le_inf_iff and le_sup_iff have to be
634 deleted to achieve the desired effect.
636 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
637 rules by default any longer; the same applies to min_max.inf_absorb1
638 etc. INCOMPATIBILITY.
640 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
641 pred_set_conv by default. INCOMPATIBILITY.
643 * Power operations on relations and functions are now one dedicated
644 constant "compow" with infix syntax "^^". Power operation on
645 multiplicative monoids retains syntax "^" and is now defined generic
646 in class power. INCOMPATIBILITY.
648 * Relation composition "R O S" now has a more standard argument order:
649 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
650 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
651 break, since the O_assoc rule was not rewritten like this. Fix using
652 O_assoc[symmetric]. The same applies to the curried version "R OO S".
654 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
655 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
658 * Most rules produced by inductive and datatype package have mandatory
659 prefixes. INCOMPATIBILITY.
661 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
662 the attribute of the same name. Each of the theorems in the list
663 DERIV_intros assumes composition with an additional function and
664 matches a variable to the derivative, which has to be solved by the
665 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
666 of most elementary terms. Former Maclauren.DERIV_tac and
667 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
670 * Code generator attributes follow the usual underscore convention:
671 code_unfold replaces code unfold
672 code_post replaces code post
677 sizechange -> size_change
678 induct_scheme -> induction_schema
681 * Discontinued abbreviation "arbitrary" of constant "undefined".
682 INCOMPATIBILITY, use "undefined" directly.
685 Suc_eq_add_numeral_1 -> Suc_eq_plus1
686 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
687 Suc_plus1 -> Suc_eq_plus1
688 *anti_sym -> *antisym*
689 vector_less_eq_def -> vector_le_def
692 * Added theorem List.map_map as [simp]. Removed List.map_compose.
695 * Removed predicate "M hassize n" (<--> card M = n & finite M).
701 * Theory Representable defines a class "rep" of domains that are
702 representable (via an ep-pair) in the universal domain type "udom".
703 Instances are provided for all type constructors defined in HOLCF.
705 * The 'new_domain' command is a purely definitional version of the
706 domain package, for representable domains. Syntax is identical to the
707 old domain package. The 'new_domain' package also supports indirect
708 recursion using previously-defined type constructors. See
709 src/HOLCF/ex/New_Domain.thy for examples.
711 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
712 on the left-hand side of an equation, and then performs
713 simplification. Rewriting is done using rules declared with the
714 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
715 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
717 * The pattern-match compiler in 'fixrec' can now handle constructors
718 with HOL function types. Pattern-match combinators for the Pair
719 constructor are pre-configured.
721 * The 'fixrec' package now produces better fixed-point induction rules
722 for mutually-recursive definitions: Induction rules have conclusions
723 of the form "P foo bar" instead of "P <foo, bar>".
725 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
726 been renamed to "below". The name "below" now replaces "less" in many
727 theorem names. (Legacy theorem names using "less" are still supported
730 * The 'fixrec' package now supports "bottom patterns". Bottom
731 patterns can be used to generate strictness rules, or to make
732 functions more strict (much like the bang-patterns supported by the
733 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
739 * Support for Poly/ML 5.3.0, with improved reporting of compiler
740 errors and run-time exceptions, including detailed source positions.
742 * Structure Name_Space (formerly NameSpace) now manages uniquely
743 identified entries, with some additional information such as source
744 position, logical grouping etc.
746 * Theory and context data is now introduced by the simplified and
747 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
748 to be pure, but the old TheoryDataFun for mutable data (with explicit
749 copy operation) is still available for some time.
751 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
752 provides a high-level programming interface to synchronized state
753 variables with atomic update. This works via pure function
754 application within a critical section -- its runtime should be as
755 short as possible; beware of deadlocks if critical code is nested,
756 either directly or indirectly via other synchronized variables!
758 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
759 wraps raw ML references, explicitly indicating their non-thread-safe
760 behaviour. The Isar toplevel keeps this structure open, to
761 accommodate Proof General as well as quick and dirty interactive
762 experiments with references.
764 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
765 parallel tactical reasoning.
767 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
768 are similar to SUBPROOF, but are slightly more flexible: only the
769 specified parts of the subgoal are imported into the context, and the
770 body tactic may introduce new subgoals and schematic variables.
772 * Old tactical METAHYPS, which does not observe the proof context, has
773 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
774 or Subgoal.FOCUS etc.
776 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
777 functors have their own ML name space there is no point to mark them
778 separately.) Minor INCOMPATIBILITY.
780 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
782 * Renamed several structures FooBar to Foo_Bar. Occasional,
785 * Operations of structure Skip_Proof no longer require quick_and_dirty
786 mode, which avoids critical setmp.
788 * Eliminated old Attrib.add_attributes, Method.add_methods and related
789 combinators for "args". INCOMPATIBILITY, need to use simplified
790 Attrib/Method.setup introduced in Isabelle2009.
792 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
793 back on global_simpset_of, global_claset_of, global_clasimpset_of as
794 last resort. INCOMPATIBILITY.
796 * Display.pretty_thm now requires a proper context (cf. former
797 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
798 or even Display.pretty_thm_without_context as last resort.
801 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
802 Syntax.pretty_typ/term directly, preferably with proper context
803 instead of global theory.
808 * Further fine tuning of parallel proof checking, scales up to 8 cores
809 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
812 * Support for additional "Isabelle components" via etc/components, see
813 also the system manual.
815 * The isabelle makeall tool now operates on all components with
816 IsaMakefile, not just hardwired "logics".
818 * Removed "compress" option from isabelle-process and isabelle usedir;
819 this is always enabled.
821 * Discontinued support for Poly/ML 4.x versions.
823 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
824 on a given logic image. This requires the lighttpd webserver and is
825 currently supported on Linux only.
829 New in Isabelle2009 (April 2009)
830 --------------------------------
834 * Simplified main Isabelle executables, with less surprises on
835 case-insensitive file-systems (such as Mac OS).
837 - The main Isabelle tool wrapper is now called "isabelle" instead of
840 - The former "isabelle" alias for "isabelle-process" has been
841 removed (should rarely occur to regular users).
843 - The former "isabelle-interface" and its alias "Isabelle" have been
844 removed (interfaces are now regular Isabelle tools).
846 Within scripts and make files, the Isabelle environment variables
847 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
848 respectively. (The latter are still available as legacy feature.)
850 The old isabelle-interface wrapper could react in confusing ways if
851 the interface was uninstalled or changed otherwise. Individual
852 interface tool configuration is now more explicit, see also the
853 Isabelle system manual. In particular, Proof General is now available
854 via "isabelle emacs".
856 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
857 purge installed copies of Isabelle executables and re-run "isabelle
858 install -p ...", or use symlinks.
860 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
861 old ~/isabelle, which was slightly non-standard and apt to cause
862 surprises on case-insensitive file-systems (such as Mac OS).
864 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
865 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
866 care is required when using older releases of Isabelle. Note that
867 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
868 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
870 * Proofs of fully specified statements are run in parallel on
871 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
872 a regular 4-core machine, if the initial heap space is made reasonably
873 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
875 * The main reference manuals ("isar-ref", "implementation", and
876 "system") have been updated and extended. Formally checked references
877 as hyperlinks are now available uniformly.
882 * Complete re-implementation of locales. INCOMPATIBILITY in several
883 respects. The most important changes are listed below. See the
884 Tutorial on Locales ("locales" manual) for details.
886 - In locale expressions, instantiation replaces renaming. Parameters
887 must be declared in a for clause. To aid compatibility with previous
888 parameter inheritance, in locale declarations, parameters that are not
889 'touched' (instantiation position "_" or omitted) are implicitly added
890 with their syntax at the beginning of the for clause.
892 - Syntax from abbreviations and definitions in locales is available in
893 locale expressions and context elements. The latter is particularly
894 useful in locale declarations.
896 - More flexible mechanisms to qualify names generated by locale
897 expressions. Qualifiers (prefixes) may be specified in locale
898 expressions, and can be marked as mandatory (syntax: "name!:") or
899 optional (syntax "name?:"). The default depends for plain "name:"
900 depends on the situation where a locale expression is used: in
901 commands 'locale' and 'sublocale' prefixes are optional, in
902 'interpretation' and 'interpret' prefixes are mandatory. The old
903 implicit qualifiers derived from the parameter names of a locale are
906 - Command "sublocale l < e" replaces "interpretation l < e". The
907 instantiation clause in "interpretation" and "interpret" (square
908 brackets) is no longer available. Use locale expressions.
910 - When converting proof scripts, mandatory qualifiers in
911 'interpretation' and 'interpret' should be retained by default, even
912 if this is an INCOMPATIBILITY compared to former behavior. In the
913 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
914 in locale expressions range over a single locale instance only.
916 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
917 In existing theorem specifications replace the includes element by the
918 respective context elements of the included locale, omitting those
919 that are already present in the theorem specification. Multiple
920 assume elements of a locale should be replaced by a single one
921 involving the locale predicate. In the proof body, declarations (most
922 notably theorems) may be regained by interpreting the respective
923 locales in the proof context as required (command "interpret").
925 If using "includes" in replacement of a target solely because the
926 parameter types in the theorem are not as general as in the target,
927 consider declaring a new locale with additional type constraints on
928 the parameters (context element "constrains").
930 - Discontinued "locale (open)". INCOMPATIBILITY.
932 - Locale interpretation commands no longer attempt to simplify goal.
933 INCOMPATIBILITY: in rare situations the generated goal differs. Use
934 methods intro_locales and unfold_locales to clarify.
936 - Locale interpretation commands no longer accept interpretation
937 attributes. INCOMPATIBILITY.
939 * Class declaration: so-called "base sort" must not be given in import
940 list any longer, but is inferred from the specification. Particularly
947 class foo = type + ...
949 * Class target: global versions of theorems stemming do not carry a
950 parameter prefix any longer. INCOMPATIBILITY.
952 * Class 'instance' command no longer accepts attached definitions.
953 INCOMPATIBILITY, use proper 'instantiation' target instead.
955 * Recovered hiding of consts, which was accidentally broken in
956 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
957 makes c inaccessible; consider using ``hide (open) const c'' instead.
959 * Slightly more coherent Pure syntax, with updated documentation in
960 isar-ref manual. Removed locales meta_term_syntax and
961 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
962 INCOMPATIBILITY in rare situations. Note that &&& should not be used
963 directly in regular applications.
965 * There is a new syntactic category "float_const" for signed decimal
966 fractions (e.g. 123.45 or -123.45).
968 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
969 interface with 'setup' command instead.
971 * Command 'local_setup' is similar to 'setup', but operates on a local
974 * The 'axiomatization' command now only works within a global theory
975 context. INCOMPATIBILITY.
977 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
978 hypotheses. Sorts required in the course of reasoning need to be
979 covered by the constraints in the initial statement, completed by the
980 type instance information of the background theory. Non-trivial sort
981 hypotheses, which rarely occur in practice, may be specified via
982 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
984 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
986 The result contains an implicit sort hypotheses as before --
987 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
990 * Generalized Isar history, with support for linear undo, direct state
993 * Changed defaults for unify configuration options:
995 unify_trace_bound = 50 (formerly 25)
996 unify_search_bound = 60 (formerly 30)
998 * Different bookkeeping for code equations (INCOMPATIBILITY):
1000 a) On theory merge, the last set of code equations for a particular
1001 constant is taken (in accordance with the policy applied by other
1002 parts of the code generator framework).
1004 b) Code equations stemming from explicit declarations (e.g. code
1005 attribute) gain priority over default code equations stemming
1006 from definition, primrec, fun etc.
1008 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1010 * Unified theorem tables for both code generators. Thus [code
1011 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1013 * Command 'find_consts' searches for constants based on type and name
1016 find_consts "_ => bool"
1018 By default, matching is against subtypes, but it may be restricted to
1019 the whole type. Searching by name is possible. Multiple queries are
1020 conjunctive and queries may be negated by prefixing them with a
1023 find_consts strict: "_ => bool" name: "Int" -"int => int"
1025 * New 'find_theorems' criterion "solves" matches theorems that
1026 directly solve the current goal (modulo higher-order unification).
1028 * Auto solve feature for main theorem statements: whenever a new goal
1029 is stated, "find_theorems solves" is called; any theorems that could
1030 solve the lemma directly are listed as part of the goal state.
1031 Cf. associated options in Proof General Isabelle settings menu,
1032 enabled by default, with reasonable timeout for pathological cases of
1033 higher-order unification.
1036 *** Document preparation ***
1038 * Antiquotation @{lemma} now imitates a regular terminal proof,
1039 demanding keyword 'by' and supporting the full method expression
1040 syntax just like the Isar command 'by'.
1045 * Integrated main parts of former image HOL-Complex with HOL. Entry
1046 points Main and Complex_Main remain as before.
1048 * Logic image HOL-Plain provides a minimal HOL with the most important
1049 tools available (inductive, datatype, primrec, ...). This facilitates
1050 experimentation and tool development. Note that user applications
1051 (and library theories) should never refer to anything below theory
1054 * Logic image HOL-Main stops at theory Main, and thus facilitates
1055 experimentation due to shorter build times.
1057 * Logic image HOL-NSA contains theories of nonstandard analysis which
1058 were previously part of former HOL-Complex. Entry point Hyperreal
1059 remains valid, but theories formerly using Complex_Main should now use
1060 new entry point Hypercomplex.
1062 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1063 Posix processes. Avoids potentially expensive forking of the ML
1064 process. New thread-based implementation also works on non-Unix
1065 platforms (Cygwin). Provers are no longer hardwired, but defined
1066 within the theory via plain ML wrapper functions. Basic Sledgehammer
1067 commands are covered in the isar-ref manual.
1069 * Wrapper scripts for remote SystemOnTPTP service allows to use
1070 sledgehammer without local ATP installation (Vampire etc.). Other
1071 provers may be included via suitable ML wrappers, see also
1072 src/HOL/ATP_Linkup.thy.
1074 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1077 * The metis method no longer fails because the theorem is too trivial
1078 (contains the empty clause).
1080 * The metis method now fails in the usual manner, rather than raising
1081 an exception, if it determines that it cannot prove the theorem.
1083 * Method "coherent" implements a prover for coherent logic (see also
1084 src/Tools/coherent.ML).
1086 * Constants "undefined" and "default" replace "arbitrary". Usually
1087 "undefined" is the right choice to replace "arbitrary", though
1088 logically there is no difference. INCOMPATIBILITY.
1090 * Command "value" now integrates different evaluation mechanisms. The
1091 result of the first successful evaluation mechanism is printed. In
1092 square brackets a particular named evaluation mechanisms may be
1093 specified (currently, [SML], [code] or [nbe]). See further
1094 src/HOL/ex/Eval_Examples.thy.
1096 * Normalization by evaluation now allows non-leftlinear equations.
1097 Declare with attribute [code nbe].
1099 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1100 as the structured Isar versions "cases" and "induct", cf. the
1101 corresponding "cases" and "induct" attributes. Mutual induction rules
1102 are now presented as a list of individual projections
1103 (e.g. foo_bar.inducts for types foo and bar); the old format with
1104 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1105 rare situations a different rule is selected --- notably nested tuple
1106 elimination instead of former prod.exhaust: use explicit (case_tac t
1107 rule: prod.exhaust) here.
1109 * Attributes "cases", "induct", "coinduct" support "del" option.
1111 * Removed fact "case_split_thm", which duplicates "case_split".
1113 * The option datatype has been moved to a new theory Option. Renamed
1114 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1116 * New predicate "strict_mono" classifies strict functions on partial
1117 orders. With strict functions on linear orders, reasoning about
1118 (in)equalities is facilitated by theorems "strict_mono_eq",
1119 "strict_mono_less_eq" and "strict_mono_less".
1121 * Some set operations are now proper qualified constants with
1122 authentic syntax. INCOMPATIBILITY:
1133 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1136 * Auxiliary class "itself" has disappeared -- classes without any
1137 parameter are treated as expected by the 'class' command.
1139 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1141 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1142 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1144 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1145 method "approximation". It proves formulas on real values by using
1146 interval arithmetic. In the formulas are also the transcendental
1147 functions sin, cos, tan, atan, ln, exp and the constant pi are
1148 allowed. For examples see
1149 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1151 * Theory "Reflection" now resides in HOL/Library.
1153 * Entry point to Word library now simply named "Word".
1156 * Made source layout more coherent with logical distribution
1159 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1160 src/HOL/Library/Code_Message.thy ~> src/HOL/
1161 src/HOL/Library/GCD.thy ~> src/HOL/
1162 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1163 src/HOL/Library/Parity.thy ~> src/HOL/
1164 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1165 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1166 src/HOL/Real/Lubs.thy ~> src/HOL/
1167 src/HOL/Real/PReal.thy ~> src/HOL/
1168 src/HOL/Real/Rational.thy ~> src/HOL/
1169 src/HOL/Real/RComplete.thy ~> src/HOL/
1170 src/HOL/Real/RealDef.thy ~> src/HOL/
1171 src/HOL/Real/RealPow.thy ~> src/HOL/
1172 src/HOL/Real/Real.thy ~> src/HOL/
1173 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1174 src/HOL/Complex/Complex.thy ~> src/HOL/
1175 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1176 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1177 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1178 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1179 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1180 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1181 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1182 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1183 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1184 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1185 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1186 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1187 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1188 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1189 src/HOL/Real/Float ~> src/HOL/Library/
1190 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1191 src/HOL/Real/RealVector.thy ~> src/HOL/
1193 src/HOL/arith_data.ML ~> src/HOL/Tools
1194 src/HOL/hologic.ML ~> src/HOL/Tools
1195 src/HOL/simpdata.ML ~> src/HOL/Tools
1196 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1197 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1198 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1199 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1200 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1201 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1202 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1204 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1205 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1206 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1207 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1208 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1209 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1211 * If methods "eval" and "evaluation" encounter a structured proof
1212 state with !!/==>, only the conclusion is evaluated to True (if
1213 possible), avoiding strange error messages.
1215 * Method "sizechange" automates termination proofs using (a
1216 modification of) the size-change principle. Requires SAT solver. See
1217 src/HOL/ex/Termination.thy for examples.
1219 * Simplifier: simproc for let expressions now unfolds if bound
1220 variable occurs at most once in let expression body. INCOMPATIBILITY.
1222 * Method "arith": Linear arithmetic now ignores all inequalities when
1223 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1225 * New attribute "arith" for facts that should always be used
1226 automatically by arithmetic. It is intended to be used locally in
1229 assumes [arith]: "x > 0"
1231 Global usage is discouraged because of possible performance impact.
1233 * New classes "top" and "bot" with corresponding operations "top" and
1234 "bot" in theory Orderings; instantiation of class "complete_lattice"
1235 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1237 * Changed definition lemma "less_fun_def" in order to provide an
1238 instance for preorders on functions; use lemma "less_le" instead.
1241 * Theory Orderings: class "wellorder" moved here, with explicit
1242 induction rule "less_induct" as assumption. For instantiation of
1243 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1246 * Theory Orderings: added class "preorder" as superclass of "order".
1247 INCOMPATIBILITY: Instantiation proofs for order, linorder
1248 etc. slightly changed. Some theorems named order_class.* now named
1251 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1254 * Theory Finite_Set: added a new fold combinator of type
1256 ('a => 'b => 'b) => 'b => 'a set => 'b
1258 Occasionally this is more convenient than the old fold combinator
1259 which is now defined in terms of the new one and renamed to
1262 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1263 and "ring_simps" have been replaced by "algebra_simps" (which can be
1264 extended with further lemmas!). At the moment both still exist but
1265 the former will disappear at some point.
1267 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1268 class recpower. Type-specific simp rules for various recpower types
1269 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1271 rat_power_0 -> power_0
1272 rat_power_Suc -> power_Suc
1273 realpow_0 -> power_0
1274 realpow_Suc -> power_Suc
1275 complexpow_0 -> power_0
1276 complexpow_Suc -> power_Suc
1277 power_poly_0 -> power_0
1278 power_poly_Suc -> power_Suc
1280 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1281 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1282 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1283 of lemmas from Divides has been generalized from nat to class
1284 semiring_div. INCOMPATIBILITY. This involves the following theorem
1285 renames resulting from duplicate elimination:
1287 dvd_def_mod ~> dvd_eq_mod_eq_0
1288 zero_dvd_iff ~> dvd_0_left_iff
1289 dvd_0 ~> dvd_0_right
1290 DIVISION_BY_ZERO_DIV ~> div_by_0
1291 DIVISION_BY_ZERO_MOD ~> mod_by_0
1292 mult_div ~> div_mult_self2_is_id
1293 mult_mod ~> mod_mult_self2_is_0
1295 * Theory IntDiv: removed many lemmas that are instances of class-based
1296 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1297 rename old lemmas as follows:
1299 dvd_diff -> nat_dvd_diff
1300 dvd_zminus_iff -> dvd_minus_iff
1301 mod_add1_eq -> mod_add_eq
1302 mod_mult1_eq -> mod_mult_right_eq
1303 mod_mult1_eq' -> mod_mult_left_eq
1304 mod_mult_distrib_mod -> mod_mult_eq
1305 nat_mod_add_left_eq -> mod_add_left_eq
1306 nat_mod_add_right_eq -> mod_add_right_eq
1307 nat_mod_div_trivial -> mod_div_trivial
1308 nat_mod_mod_trivial -> mod_mod_trivial
1309 zdiv_zadd_self1 -> div_add_self1
1310 zdiv_zadd_self2 -> div_add_self2
1311 zdiv_zmult_self1 -> div_mult_self2_is_id
1312 zdiv_zmult_self2 -> div_mult_self1_is_id
1313 zdvd_triv_left -> dvd_triv_left
1314 zdvd_triv_right -> dvd_triv_right
1315 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1316 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1317 zmod_zadd_left_eq -> mod_add_left_eq
1318 zmod_zadd_right_eq -> mod_add_right_eq
1319 zmod_zadd_self1 -> mod_add_self1
1320 zmod_zadd_self2 -> mod_add_self2
1321 zmod_zadd1_eq -> mod_add_eq
1322 zmod_zdiff1_eq -> mod_diff_eq
1323 zmod_zdvd_zmod -> mod_mod_cancel
1324 zmod_zmod_cancel -> mod_mod_cancel
1325 zmod_zmult_self1 -> mod_mult_self2_is_0
1326 zmod_zmult_self2 -> mod_mult_self1_is_0
1329 zdvd_abs1 -> abs_dvd_iff
1330 zdvd_abs2 -> dvd_abs_iff
1331 zdvd_refl -> dvd_refl
1332 zdvd_trans -> dvd_trans
1333 zdvd_zadd -> dvd_add
1334 zdvd_zdiff -> dvd_diff
1335 zdvd_zminus_iff -> dvd_minus_iff
1336 zdvd_zminus2_iff -> minus_dvd_iff
1337 zdvd_zmultD -> dvd_mult_right
1338 zdvd_zmultD2 -> dvd_mult_left
1339 zdvd_zmult_mono -> mult_dvd_mono
1340 zdvd_0_right -> dvd_0_right
1341 zdvd_0_left -> dvd_0_left_iff
1342 zdvd_1_left -> one_dvd
1343 zminus_dvd_iff -> minus_dvd_iff
1345 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1347 * The real numbers offer decimal input syntax: 12.34 is translated
1348 into 1234/10^2. This translation is not reversed upon output.
1350 * Theory Library/Polynomial defines an abstract type 'a poly of
1351 univariate polynomials with coefficients of type 'a. In addition to
1352 the standard ring operations, it also supports div and mod. Code
1353 generation is also supported, using list-style constructors.
1355 * Theory Library/Inner_Product defines a class of real_inner for real
1356 inner product spaces, with an overloaded operation inner :: 'a => 'a
1357 => real. Class real_inner is a subclass of real_normed_vector from
1360 * Theory Library/Product_Vector provides instances for the product
1361 type 'a * 'b of several classes from RealVector and Inner_Product.
1362 Definitions of addition, subtraction, scalar multiplication, norms,
1363 and inner products are included.
1365 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1366 addition to the field operations, numerals and case syntax are also
1369 * Theory Library/Diagonalize provides constructive version of Cantor's
1370 first diagonalization argument.
1372 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1373 zlcm (for int); carried together from various gcd/lcm developements in
1374 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1375 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1376 may recover tupled syntax as follows:
1378 hide (open) const gcd
1379 abbreviation gcd where
1380 "gcd == (%(a, b). GCD.gcd a b)"
1382 GCD.gcd ("gcd '(_, _')")
1384 The same works for lcm, zgcd, zlcm.
1386 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1387 instantiations for algebraic structures. Removed some duplicate
1388 theorems. Changes in simp rules. INCOMPATIBILITY.
1390 * ML antiquotation @{code} takes a constant as argument and generates
1391 corresponding code in background and inserts name of the corresponding
1392 resulting ML value/function/datatype constructor binding in place.
1393 All occurrences of @{code} with a single ML block are generated
1394 simultaneously. Provides a generic and safe interface for
1395 instrumentalizing code generation. See
1396 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1397 In future you ought to refrain from ad-hoc compiling generated SML
1398 code on the ML toplevel. Note that (for technical reasons) @{code}
1399 cannot refer to constants for which user-defined serializations are
1400 set. Refer to the corresponding ML counterpart directly in that
1403 * Command 'rep_datatype': instead of theorem names the command now
1404 takes a list of terms denoting the constructors of the type to be
1405 represented as datatype. The characteristic theorems have to be
1406 proven. INCOMPATIBILITY. Also observe that the following theorems
1407 have disappeared in favour of existing ones:
1409 unit_induct ~> unit.induct
1410 prod_induct ~> prod.induct
1411 sum_induct ~> sum.induct
1412 Suc_Suc_eq ~> nat.inject
1413 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1418 * New locales for orders and lattices where the equivalence relation
1419 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1420 locales use a record structure with field eq for the equivalence.
1422 * New theory of factorial domains.
1424 * Units_l_inv and Units_r_inv are now simp rules by default.
1425 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1426 and/or r_inv will now also require deletion of these lemmas.
1428 * Renamed the following theorems, INCOMPATIBILITY:
1430 UpperD ~> Upper_memD
1431 LowerD ~> Lower_memD
1432 least_carrier ~> least_closed
1433 greatest_carrier ~> greatest_closed
1434 greatest_Lower_above ~> greatest_Lower_below
1435 one_zero ~> carrier_one_zero
1436 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1441 * Nominal datatypes can now contain type-variables.
1443 * Commands 'nominal_inductive' and 'equivariance' work with local
1446 * Nominal primrec can now works with local theory targets and its
1447 specification syntax now conforms to the general format as seen in
1450 * Method "perm_simp" honours the standard simplifier attributes
1451 (no_asm), (no_asm_use) etc.
1453 * The new predicate #* is defined like freshness, except that on the
1454 left hand side can be a set or list of atoms.
1456 * Experimental command 'nominal_inductive2' derives strong induction
1457 principles for inductive definitions. In contrast to
1458 'nominal_inductive', which can only deal with a fixed number of
1459 binders, it can deal with arbitrary expressions standing for sets of
1460 atoms to be avoided. The only inductive definition we have at the
1461 moment that needs this generalisation is the typing rule for Lets in
1464 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1465 -----------------------------------------------------------------
1466 Gamma |- Let x be t1 in t2 : T2
1468 In this rule one wants to avoid all the binders that are introduced by
1469 "close Gamma T1". We are looking for other examples where this
1470 feature might be useful. Please let us know.
1475 * Reimplemented the simplification procedure for proving continuity
1476 subgoals. The new simproc is extensible; users can declare additional
1477 continuity introduction rules with the attribute [cont2cont].
1479 * The continuity simproc now uses a different introduction rule for
1480 solving continuity subgoals on terms with lambda abstractions. In
1481 some rare cases the new simproc may fail to solve subgoals that the
1482 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1483 Potential INCOMPATIBILITY.
1485 * Command 'fixrec': specification syntax now conforms to the general
1486 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1487 examples. INCOMPATIBILITY.
1492 * Proof of Zorn's Lemma for partial orders.
1497 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1498 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1499 depends on multithreading, so timouts will not work before Poly/ML
1502 * High-level support for concurrent ML programming, see
1503 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1504 particularly convenient to organize independent functional
1505 computations. The concept of "synchronized variables" provides a
1506 higher-order interface for components with shared state, avoiding the
1507 delicate details of mutexes and condition variables. (Requires
1508 Poly/ML 5.2.1 or later.)
1510 * ML bindings produced via Isar commands are stored within the Isar
1511 context (theory or proof). Consequently, commands like 'use' and 'ML'
1512 become thread-safe and work with undo as expected (concerning
1513 top-level bindings, not side-effects on global references).
1514 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1515 compiler at runtime; really global bindings need to be given outside a
1516 theory. (Requires Poly/ML 5.2 or later.)
1518 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1519 context. Top-level ML bindings are stored within the proof context in
1520 a purely sequential fashion, disregarding the nested proof structure.
1521 ML bindings introduced by 'ML_prf' are discarded at the end of the
1522 proof. (Requires Poly/ML 5.2 or later.)
1524 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1525 and Method.setup, as well as Isar commands 'attribute_setup' and
1526 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1527 existing code accordingly, or use plain 'setup' together with old
1530 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1531 to 'a -> thm, while results are always tagged with an authentic oracle
1532 name. The Isar command 'oracle' is now polymorphic, no argument type
1533 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1534 accordingly. Note that extra performance may be gained by producing
1535 the cterm carefully, avoiding slow Thm.cterm_of.
1537 * Simplified interface for defining document antiquotations via
1538 ThyOutput.antiquotation, ThyOutput.output, and optionally
1539 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1540 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1543 * More systematic treatment of long names, abstract name bindings, and
1544 name space operations. Basic operations on qualified names have been
1545 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1546 Long_Name.append. Old type bstring has been mostly replaced by
1547 abstract type binding (see structure Binding), which supports precise
1548 qualification by packages and local theory targets, as well as proper
1549 tracking of source positions. INCOMPATIBILITY, need to wrap old
1550 bstring values into Binding.name, or better pass through abstract
1551 bindings everywhere. See further src/Pure/General/long_name.ML,
1552 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1554 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1555 LocalTheory.note etc.) now refer to the *full* internal name, not the
1556 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1558 * Disposed old type and term read functions (Sign.read_def_typ,
1559 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1560 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1561 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1562 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1563 resort for legacy applications.
1565 * Disposed old declarations, tactics, tactic combinators that refer to
1566 the simpset or claset of an implicit theory (such as Addsimps,
1567 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1568 embedded ML text, or local_simpset_of with a proper context passed as
1569 explicit runtime argument.
1571 * Rules and tactics that read instantiations (read_instantiate,
1572 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1573 context, which is required for parsing and type-checking. Moreover,
1574 the variables are specified as plain indexnames, not string encodings
1575 thereof. INCOMPATIBILITY.
1577 * Generic Toplevel.add_hook interface allows to analyze the result of
1578 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1579 for theorem dependency output of transactions resulting in a new
1582 * ML antiquotations: block-structured compilation context indicated by
1583 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1585 @{binding name} - basic name binding
1586 @{let ?pat = term} - term abbreviation (HO matching)
1587 @{note name = fact} - fact abbreviation
1588 @{thm fact} - singleton fact (with attributes)
1589 @{thms fact} - general fact (with attributes)
1590 @{lemma prop by method} - singleton goal
1591 @{lemma prop by meth1 meth2} - singleton goal
1592 @{lemma prop1 ... propN by method} - general goal
1593 @{lemma prop1 ... propN by meth1 meth2} - general goal
1594 @{lemma (open) ...} - open derivation
1599 * The Isabelle "emacs" tool provides a specific interface to invoke
1600 Proof General / Emacs, with more explicit failure if that is not
1601 installed (the old isabelle-interface script silently falls back on
1602 isabelle-process). The PROOFGENERAL_HOME setting determines the
1603 installation location of the Proof General distribution.
1605 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1606 the Isabelle process into a JVM/Scala application. See
1607 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1608 process wrapper has been discontinued.)
1610 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1612 * Various status messages (with exact source position information) are
1613 emitted, if proper markup print mode is enabled. This allows
1614 user-interface components to provide detailed feedback on internal
1619 New in Isabelle2008 (June 2008)
1620 -------------------------------
1624 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1625 and updated, with formally checked references as hyperlinks.
1627 * Theory loader: use_thy (and similar operations) no longer set the
1628 implicit ML context, which was occasionally hard to predict and in
1629 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1630 provides a proper context already.
1632 * Theory loader: old-style ML proof scripts being *attached* to a thy
1633 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1634 'use' within a theory file will do the job.
1636 * Name space merge now observes canonical order, i.e. the second space
1637 is inserted into the first one, while existing entries in the first
1638 space take precedence. INCOMPATIBILITY in rare situations, may try to
1639 swap theory imports.
1641 * Syntax: symbol \<chi> is now considered a letter. Potential
1642 INCOMPATIBILITY in identifier syntax etc.
1644 * Outer syntax: string tokens no longer admit escaped white space,
1645 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1646 white space without escapes.
1648 * Outer syntax: string tokens may contain arbitrary character codes
1649 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1655 * Context-dependent token translations. Default setup reverts locally
1656 fixed variables, and adds hilite markup for undeclared frees.
1658 * Unused theorems can be found using the new command 'unused_thms'.
1659 There are three ways of invoking it:
1662 Only finds unused theorems in the current theory.
1664 (2) unused_thms thy_1 ... thy_n -
1665 Finds unused theorems in the current theory and all of its ancestors,
1666 excluding the theories thy_1 ... thy_n and all of their ancestors.
1668 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1669 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1670 their ancestors, excluding the theories thy_1 ... thy_n and all of
1673 In order to increase the readability of the list produced by
1674 unused_thms, theorems that have been created by a particular instance
1675 of a theory command such as 'inductive' or 'function' are considered
1676 to belong to the same "group", meaning that if at least one theorem in
1677 this group is used, the other theorems in the same group are no longer
1678 reported as unused. Moreover, if all theorems in the group are
1679 unused, only one theorem in the group is displayed.
1681 Note that proof objects have to be switched on in order for
1682 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1683 usually the case when using Proof General with the default settings).
1685 * Authentic naming of facts disallows ad-hoc overwriting of previous
1686 theorems within the same name space. INCOMPATIBILITY, need to remove
1687 duplicate fact bindings, or even accidental fact duplications. Note
1688 that tools may maintain dynamically scoped facts systematically, using
1689 PureThy.add_thms_dynamic.
1691 * Command 'hide' now allows to hide from "fact" name space as well.
1693 * Eliminated destructive theorem database, simpset, claset, and
1694 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1695 update of theories within ML code.
1697 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1698 INCOMPATIBILITY, object-logics depending on former Pure require
1699 additional setup PureThy.old_appl_syntax_setup; object-logics
1700 depending on former CPure need to refer to Pure.
1702 * Commands 'use' and 'ML' are now purely functional, operating on
1703 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1704 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1707 * Command 'setup': discontinued implicit version with ML reference.
1709 * Instantiation target allows for simultaneous specification of class
1710 instance operations together with an instantiation proof.
1711 Type-checking phase allows to refer to class operations uniformly.
1712 See src/HOL/Complex/Complex.thy for an Isar example and
1713 src/HOL/Library/Eval.thy for an ML example.
1715 * Indexing of literal facts: be more serious about including only
1716 facts from the visible specification/proof context, but not the
1717 background context (locale etc.). Affects `prop` notation and method
1718 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1721 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1722 "(open)" option, which used to expose internal bound variables to the
1725 * Isar statements: removed obsolete case "rule_context".
1726 INCOMPATIBILITY, better use explicit fixes/assumes.
1728 * Locale proofs: default proof step now includes 'unfold_locales';
1729 hence 'proof' without argument may be used to unfold locale
1733 *** Document preparation ***
1735 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1736 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1737 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1738 spot); renamed link color from "darkblue" to "linkcolor" (default
1739 value unchanged, can be redefined via \definecolor); no longer sets
1740 "a4paper" option (unnecessary or even intrusive).
1742 * Antiquotation @{lemma A method} proves proposition A by the given
1743 method (either a method name or a method name plus (optional) method
1744 arguments in parentheses) and prints A just like @{prop A}.
1749 * New primrec package. Specification syntax conforms in style to
1750 definition/function/.... No separate induction rule is provided. The
1751 "primrec" command distinguishes old-style and new-style specifications
1752 by syntax. The former primrec package is now named OldPrimrecPackage.
1753 When adjusting theories, beware: constants stemming from new-style
1754 primrec specifications have authentic syntax.
1756 * Metis prover is now an order of magnitude faster, and also works
1757 with multithreading.
1759 * Metis: the maximum number of clauses that can be produced from a
1760 theorem is now given by the attribute max_clauses. Theorems that
1761 exceed this number are ignored, with a warning printed.
1763 * Sledgehammer no longer produces structured proofs by default. To
1764 enable, declare [[sledgehammer_full = true]]. Attributes
1765 reconstruction_modulus, reconstruction_sorts renamed
1766 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1768 * Method "induct_scheme" derives user-specified induction rules
1769 from well-founded induction and completeness of patterns. This factors
1770 out some operations that are done internally by the function package
1771 and makes them available separately. See
1772 src/HOL/ex/Induction_Scheme.thy for examples.
1774 * More flexible generation of measure functions for termination
1775 proofs: Measure functions can be declared by proving a rule of the
1776 form "is_measure f" and giving it the [measure_function] attribute.
1777 The "is_measure" predicate is logically meaningless (always true), and
1778 just guides the heuristic. To find suitable measure functions, the
1779 termination prover sets up the goal "is_measure ?f" of the appropriate
1780 type and generates all solutions by prolog-style backwards proof using
1783 This setup also deals with rules like
1785 "is_measure f ==> is_measure (list_size f)"
1787 which accommodates nested datatypes that recurse through lists.
1788 Similar rules are predeclared for products and option types.
1790 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1794 - Definitions of overloaded constants on sets have to be replaced by
1795 definitions on => and bool.
1797 - Some definitions of overloaded operators on sets can now be proved
1798 using the definitions of the operators on => and bool. Therefore,
1799 the following theorems have been renamed:
1801 subset_def -> subset_eq
1802 psubset_def -> psubset_eq
1803 set_diff_def -> set_diff_eq
1804 Compl_def -> Compl_eq
1805 Sup_set_def -> Sup_set_eq
1806 Inf_set_def -> Inf_set_eq
1807 sup_set_def -> sup_set_eq
1808 inf_set_def -> inf_set_eq
1810 - Due to the incompleteness of the HO unification algorithm, some
1811 rules such as subst may require manual instantiation, if some of
1812 the unknowns in the rule is a set.
1814 - Higher order unification and forward proofs:
1817 have "P (S::'a set)" <...>
1818 then have "EX S. P S" ..
1820 no longer works (due to the incompleteness of the HO unification
1821 algorithm) and must be replaced by the pattern
1828 - Calculational reasoning with subst (or similar rules):
1831 have "P (S::'a set)" <...>
1832 also have "S = T" <...>
1833 finally have "P T" .
1835 no longer works (for similar reasons as the previous example) and
1836 must be replaced by something like
1838 have "P (S::'a set)" <...>
1839 moreover have "S = T" <...>
1840 ultimately have "P T" by simp
1842 - Tactics or packages written in ML code:
1843 Code performing pattern matching on types via
1845 Type ("set", [T]) => ...
1847 must be rewritten. Moreover, functions like strip_type or
1848 binder_types no longer return the right value when applied to a
1851 T1 => ... => Tn => U => bool
1855 T1 => ... => Tn => U set
1857 * Merged theories Wellfounded_Recursion, Accessible_Part and
1858 Wellfounded_Relations to theory Wellfounded.
1860 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1862 * Class finite no longer treats UNIV as class parameter. Use class
1863 enum from theory Library/Enum instead to achieve a similar effect.
1866 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1867 and "Cons". INCOMPATIBILITY.
1869 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1870 Potential INCOMPATIBILITY.
1872 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1873 injective_fst_snd removed, use split_eta and prod_eqI instead.
1874 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1876 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1877 the same name in theory Orderings:
1887 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1888 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1889 and different variable names.
1891 * Library/Option_ord.thy: Canonical order on option type.
1893 * Library/RBT.thy: Red-black trees, an efficient implementation of
1896 * Library/Countable.thy: Type class for countable types.
1898 * Theory Int: The representation of numerals has changed. The infix
1899 operator BIT and the bit datatype with constructors B0 and B1 have
1900 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1901 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1902 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1905 * Theory Nat: definition of <= and < on natural numbers no longer
1906 depend on well-founded relations. INCOMPATIBILITY. Definitions
1907 le_def and less_def have disappeared. Consider lemmas not_less
1908 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1910 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1911 (whose purpose mainly is for various fold_set functionals) have been
1912 abandoned in favor of the existing algebraic classes
1913 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1914 lower_semilattice (resp. upper_semilattice) and linorder.
1917 * Theory Transitive_Closure: induct and cases rules now declare proper
1918 case_names ("base" and "step"). INCOMPATIBILITY.
1920 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1921 lattices. The form set-specific version is available as
1922 Inductive.lfp_ordinal_induct_set.
1924 * Renamed theorems "power.simps" to "power_int.simps".
1927 * Class semiring_div provides basic abstract properties of semirings
1928 with division and modulo operations. Subsumes former class dvd_mod.
1930 * Merged theories IntDef, Numeral and IntArith into unified theory
1931 Int. INCOMPATIBILITY.
1933 * Theory Library/Code_Index: type "index" now represents natural
1934 numbers rather than integers. INCOMPATIBILITY.
1936 * New class "uminus" with operation "uminus" (split of from class
1937 "minus" which now only has operation "minus", binary).
1940 * Constants "card", "internal_split", "option_map" now with authentic
1941 syntax. INCOMPATIBILITY.
1943 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1944 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1945 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1946 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1947 Sup_set_def, le_def, less_def, option_map_def now with object
1948 equality. INCOMPATIBILITY.
1950 * Records. Removed K_record, and replaced it by pure lambda term
1951 %x. c. The simplifier setup is now more robust against eta expansion.
1952 INCOMPATIBILITY: in cases explicitly referring to K_record.
1954 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1956 * Library/ListVector: new theory of arithmetic vector operations.
1958 * Library/Order_Relation: new theory of various orderings as sets of
1959 pairs. Defines preorders, partial orders, linear orders and
1960 well-orders on sets and on types.
1965 * Renamed some theories to allow to loading both ZF and HOL in the
1968 Datatype -> Datatype_ZF
1969 Inductive -> Inductive_ZF
1976 INCOMPATIBILITY: ZF theories that import individual theories below
1977 Main might need to be adapted. Regular theory Main is still
1978 available, as trivial extension of Main_ZF.
1983 * ML within Isar: antiquotation @{const name} or @{const
1984 name(typargs)} produces statically-checked Const term.
1986 * Functor NamedThmsFun: data is available to the user as dynamic fact
1987 (of the same name). Removed obsolete print command.
1989 * Removed obsolete "use_legacy_bindings" function.
1991 * The ``print mode'' is now a thread-local value derived from a global
1992 template (the former print_mode reference), thus access becomes
1993 non-critical. The global print_mode reference is for session
1994 management only; user-code should use print_mode_value,
1995 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1997 * Functions system/system_out provide a robust way to invoke external
1998 shell commands, with propagation of interrupts (requires Poly/ML
1999 5.2.1). Do not use OS.Process.system etc. from the basis library!
2004 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2005 in accordance with Proof General 3.7, which prefers GNU emacs.
2007 * isatool tty runs Isabelle process with plain tty interaction;
2008 optional line editor may be specified via ISABELLE_LINE_EDITOR
2009 setting, the default settings attempt to locate "ledit" and "rlwrap".
2011 * isatool browser now works with Cygwin as well, using general
2012 "javapath" function defined in Isabelle process environment.
2014 * YXML notation provides a simple and efficient alternative to
2015 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2016 isatool yxml as described in the Isabelle system manual.
2018 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2019 provides general wrapper for managing an Isabelle process in a robust
2020 fashion, with ``cooked'' output from stdin/stderr.
2022 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2023 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2025 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2026 way of changing the user's settings is via
2027 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2030 * Multithreading.max_threads := 0 refers to the number of actual CPU
2031 cores of the underlying machine, which is a good starting point for
2032 optimal performance tuning. The corresponding usedir option -M allows
2033 "max" as an alias for "0". WARNING: does not work on certain versions
2034 of Mac OS (with Poly/ML 5.1).
2036 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2037 adverse effect of Isabelle flooding interactive front-ends (notably
2038 ProofGeneral / XEmacs).
2042 New in Isabelle2007 (November 2007)
2043 -----------------------------------
2047 * More uniform information about legacy features, notably a
2048 warning/error of "Legacy feature: ...", depending on the state of the
2049 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2050 legacy features will disappear eventually.
2052 * Theory syntax: the header format ``theory A = B + C:'' has been
2053 discontinued in favour of ``theory A imports B C begin''. Use isatool
2054 fixheaders to convert existing theory files. INCOMPATIBILITY.
2056 * Theory syntax: the old non-Isar theory file format has been
2057 discontinued altogether. Note that ML proof scripts may still be used
2058 with Isar theories; migration is usually quite simple with the ML
2059 function use_legacy_bindings. INCOMPATIBILITY.
2061 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2062 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2065 * Theory loader: be more serious about observing the static theory
2066 header specifications (including optional directories), but not the
2067 accidental file locations of previously successful loads. The strict
2068 update policy of former update_thy is now already performed by
2069 use_thy, so the former has been removed; use_thys updates several
2070 theories simultaneously, just as 'imports' within a theory header
2071 specification, but without merging the results. Potential
2072 INCOMPATIBILITY: may need to refine theory headers and commands
2073 ROOT.ML which depend on load order.
2075 * Theory loader: optional support for content-based file
2076 identification, instead of the traditional scheme of full physical
2077 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2078 (cf. the system manual). The new scheme allows to work with
2079 non-finished theories in persistent session images, such that source
2080 files may be moved later on without requiring reloads.
2082 * Theory loader: old-style ML proof scripts being *attached* to a thy
2083 file (with the same base name as the theory) are considered a legacy
2084 feature, which will disappear eventually. Even now, the theory loader
2085 no longer maintains dependencies on such files.
2087 * Syntax: the scope for resolving ambiguities via type-inference is
2088 now limited to individual terms, instead of whole simultaneous
2089 specifications as before. This greatly reduces the complexity of the
2090 syntax module and improves flexibility by separating parsing and
2091 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2092 'fixes' etc.) are required in rare situations.
2094 * Syntax: constants introduced by new-style packages ('definition',
2095 'abbreviation' etc.) are passed through the syntax module in
2096 ``authentic mode''. This means that associated mixfix annotations
2097 really stick to such constants, independently of potential name space
2098 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2099 trees are represented slightly differently, may need to adapt syntax
2100 translations accordingly. Use CONST marker in 'translations' and
2101 @{const_syntax} antiquotation in 'parse_translation' etc.
2103 * Legacy goal package: reduced interface to the bare minimum required
2104 to keep existing proof scripts running. Most other user-level
2105 functions are now part of the OldGoals structure, which is *not* open
2106 by default (consider isatool expandshort before open OldGoals).
2107 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2108 these tend to cause confusion about the actual goal (!) context being
2109 used here, which is not necessarily the same as the_context().
2111 * Command 'find_theorems': supports "*" wild-card in "name:"
2112 criterion; "with_dups" option. Certain ProofGeneral versions might
2113 support a specific search form (see ProofGeneral/CHANGES).
2115 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2116 by default, which means that "prems" (and also "fixed variables") are
2117 suppressed from proof state output. Note that the ProofGeneral
2118 settings mechanism allows to change and save options persistently, but
2119 older versions of Isabelle will fail to start up if a negative prems
2122 * Local theory targets may be specified by non-nested blocks of
2123 ``context/locale/class ... begin'' followed by ``end''. The body may
2124 contain definitions, theorems etc., including any derived mechanism
2125 that has been implemented on top of these primitives. This concept
2126 generalizes the existing ``theorem (in ...)'' towards more versatility
2129 * Proof General interface: proper undo of final 'end' command;
2130 discontinued Isabelle/classic mode (ML proof scripts).
2133 *** Document preparation ***
2135 * Added antiquotation @{theory name} which prints the given name,
2136 after checking that it refers to a valid ancestor theory in the
2139 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2140 check the given source text as ML type/structure, printing verbatim.
2142 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2143 "c args == rhs" given in the current context. (Any number of
2144 arguments may be given on the LHS.)
2149 * The 'class' package offers a combination of axclass and locale to
2150 achieve Haskell-like type classes in Isabelle. Definitions and
2151 theorems within a class context produce both relative results (with
2152 implicit parameters according to the locale context), and polymorphic
2153 constants with qualified polymorphism (according to the class
2154 context). Within the body context of a 'class' target, a separate
2155 syntax layer ("user space type system") takes care of converting
2156 between global polymorphic consts and internal locale representation.
2157 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2158 "isatool doc classes" provides a tutorial.
2160 * Generic code generator framework allows to generate executable
2161 code for ML and Haskell (including Isabelle classes). A short usage
2164 internal compilation:
2165 export_code <list of constants (term syntax)> in SML
2166 writing SML code to a file:
2167 export_code <list of constants (term syntax)> in SML <filename>
2168 writing OCaml code to a file:
2169 export_code <list of constants (term syntax)> in OCaml <filename>
2170 writing Haskell code to a bunch of files:
2171 export_code <list of constants (term syntax)> in Haskell <filename>
2173 evaluating closed propositions to True/False using code generation:
2176 Reasonable default setup of framework in HOL.
2178 Theorem attributs for selecting and transforming function equations theorems:
2180 [code fun]: select a theorem as function equation for a specific constant
2181 [code fun del]: deselect a theorem as function equation for a specific constant
2182 [code inline]: select an equation theorem for unfolding (inlining) in place
2183 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2185 User-defined serializations (target in {SML, OCaml, Haskell}):
2187 code_const <and-list of constants (term syntax)>
2188 {(target) <and-list of const target syntax>}+
2190 code_type <and-list of type constructors>
2191 {(target) <and-list of type target syntax>}+
2193 code_instance <and-list of instances>
2195 where instance ::= <type constructor> :: <class>
2197 code_class <and_list of classes>
2198 {(target) <and-list of class target syntax>}+
2199 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2201 code_instance and code_class only are effective to target Haskell.
2203 For example usage see src/HOL/ex/Codegenerator.thy and
2204 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2205 generation from Isabelle/HOL theories is available via "isatool doc
2208 * Code generator: consts in 'consts_code' Isar commands are now
2209 referred to by usual term syntax (including optional type
2212 * Command 'no_translations' removes translation rules from theory
2215 * Overloaded definitions are now actually checked for acyclic
2216 dependencies. The overloading scheme is slightly more general than
2217 that of Haskell98, although Isabelle does not demand an exact
2218 correspondence to type class and instance declarations.
2219 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2220 exotic versions of overloading -- at the discretion of the user!
2222 Polymorphic constants are represented via type arguments, i.e. the
2223 instantiation that matches an instance against the most general
2224 declaration given in the signature. For example, with the declaration
2225 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2226 as c(nat). Overloading is essentially simultaneous structural
2227 recursion over such type arguments. Incomplete specification patterns
2228 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2229 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2230 Command 'print_theory' outputs the normalized system of recursive
2231 equations, see section "definitions".
2233 * Configuration options are maintained within the theory or proof
2234 context (with name and type bool/int/string), providing a very simple
2235 interface to a poor-man's version of general context data. Tools may
2236 declare options in ML (e.g. using Attrib.config_int) and then refer to
2237 these values using Config.get etc. Users may change options via an
2238 associated attribute of the same name. This form of context
2239 declaration works particularly well with commands 'declare' or
2240 'using', for example ``declare [[foo = 42]]''. Thus it has become
2241 very easy to avoid global references, which would not observe Isar
2242 toplevel undo/redo and fail to work with multithreading.
2244 Various global ML references of Pure and HOL have been turned into
2245 configuration options:
2247 Unify.search_bound unify_search_bound
2248 Unify.trace_bound unify_trace_bound
2249 Unify.trace_simp unify_trace_simp
2250 Unify.trace_types unify_trace_types
2251 Simplifier.simp_depth_limit simp_depth_limit
2252 Blast.depth_limit blast_depth_limit
2253 DatatypeProp.dtK datatype_distinctness_limit
2254 fast_arith_neq_limit fast_arith_neq_limit
2255 fast_arith_split_limit fast_arith_split_limit
2257 * Named collections of theorems may be easily installed as context
2258 data using the functor NamedThmsFun (see also
2259 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2260 attributes; there is also a toplevel print command. This facility is
2261 just a common case of general context data, which is the preferred way
2262 for anything more complex than just a list of facts in canonical
2265 * Isar: command 'declaration' augments a local theory by generic
2266 declaration functions written in ML. This enables arbitrary content
2267 being added to the context, depending on a morphism that tells the
2268 difference of the original declaration context wrt. the application
2269 context encountered later on.
2271 * Isar: proper interfaces for simplification procedures. Command
2272 'simproc_setup' declares named simprocs (with match patterns, and body
2273 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2274 context. ML antiquotation @{simproc name} retrieves named simprocs.
2276 * Isar: an extra pair of brackets around attribute declarations
2277 abbreviates a theorem reference involving an internal dummy fact,
2278 which will be ignored later --- only the effect of the attribute on
2279 the background context will persist. This form of in-place
2280 declarations is particularly useful with commands like 'declare' and
2281 'using', for example ``have A using [[simproc a]] by simp''.
2283 * Isar: method "assumption" (and implicit closing of subproofs) now
2284 takes simple non-atomic goal assumptions into account: after applying
2285 an assumption as a rule the resulting subgoals are solved by atomic
2286 assumption steps. This is particularly useful to finish 'obtain'
2287 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2288 without referring to the original premise "!!x. P x ==> thesis" in the
2289 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2292 * Isar: implicit use of prems from the Isar proof context is
2293 considered a legacy feature. Common applications like ``have A .''
2294 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2295 referencing facts explicitly here improves readability and
2296 maintainability of proof texts.
2298 * Isar: improper proof element 'guess' is like 'obtain', but derives
2299 the obtained context from the course of reasoning! For example:
2301 assume "EX x y. A x & B y" -- "any previous fact"
2302 then guess x and y by clarify
2304 This technique is potentially adventurous, depending on the facts and
2305 proof tools being involved here.
2307 * Isar: known facts from the proof context may be specified as literal
2308 propositions, using ASCII back-quote syntax. This works wherever
2309 named facts used to be allowed so far, in proof commands, proof
2310 methods, attributes etc. Literal facts are retrieved from the context
2311 according to unification of type and term parameters. For example,
2312 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2313 theorems in the current context, then these are valid literal facts:
2314 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2316 There is also a proof method "fact" which does the same composition
2317 for explicit goal states, e.g. the following proof texts coincide with
2318 certain special cases of literal facts:
2320 have "A" by fact == note `A`
2321 have "A ==> B" by fact == note `A ==> B`
2322 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2323 have "P a ==> Q a" by fact == note `P a ==> Q a`
2325 * Isar: ":" (colon) is no longer a symbolic identifier character in
2326 outer syntax. Thus symbolic identifiers may be used without
2327 additional white space in declarations like this: ``assume *: A''.
2329 * Isar: 'print_facts' prints all local facts of the current context,
2330 both named and unnamed ones.
2332 * Isar: 'def' now admits simultaneous definitions, e.g.:
2334 def x == "t" and y == "u"
2336 * Isar: added command 'unfolding', which is structurally similar to
2337 'using', but affects both the goal state and facts by unfolding given
2338 rewrite rules. Thus many occurrences of the 'unfold' method or
2339 'unfolded' attribute may be replaced by first-class proof text.
2341 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2342 and command 'unfolding' now all support object-level equalities
2343 (potentially conditional). The underlying notion of rewrite rule is
2344 analogous to the 'rule_format' attribute, but *not* that of the
2345 Simplifier (which is usually more generous).
2347 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2348 premises of a theorem by n. Useful in conjunction with drule.
2350 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2351 method expression within a sandbox consisting of the first N
2352 sub-goals, which need to exist. For example, ``simp_all [3]''
2353 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2354 simplifies all new goals that emerge from applying rule foo to the
2355 originally first one.
2357 * Isar: schematic goals are no longer restricted to higher-order
2358 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2361 * Isar: the conclusion of a long theorem statement is now either
2362 'shows' (a simultaneous conjunction, as before), or 'obtains'
2363 (essentially a disjunction of cases with local parameters and
2364 assumptions). The latter allows to express general elimination rules
2365 adequately; in this notation common elimination rules look like this:
2367 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2369 obtains x where "P x"
2371 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2375 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2381 The subsequent classical rules even refer to the formal "thesis"
2384 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2387 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2388 obtains "thesis ==> something"
2390 The actual proof of an 'obtains' statement is analogous to that of the
2391 Isar proof element 'obtain', only that there may be several cases.
2392 Optional case names may be specified in parentheses; these will be
2393 available both in the present proof and as annotations in the
2394 resulting rule, for later use with the 'cases' method (cf. attribute
2397 * Isar: the assumptions of a long theorem statement are available as
2398 "assms" fact in the proof context. This is more appropriate than the
2399 (historical) "prems", which refers to all assumptions of the current
2400 context, including those from the target locale, proof body etc.
2402 * Isar: 'print_statement' prints theorems from the current theory or
2403 proof context in long statement form, according to the syntax of a
2406 * Isar: 'obtain' takes an optional case name for the local context
2407 introduction rule (default "that").
2409 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2410 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2413 * Pure: syntax "CONST name" produces a fully internalized constant
2414 according to the current context. This is particularly useful for
2415 syntax translations that should refer to internal constant
2416 representations independently of name spaces.
2418 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2419 instead of "FOO ". This allows multiple binder declarations to coexist
2420 in the same context. INCOMPATIBILITY.
2422 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2423 primitive that also works in a locale context (both for constants and
2424 fixed variables). Type declaration and internal syntactic representation
2425 of given constants retrieved from the context. Likewise, the
2426 'no_notation' command allows to remove given syntax annotations from the
2429 * Isar/locales: new derived specification elements 'axiomatization',
2430 'definition', 'abbreviation', which support type-inference, admit
2431 object-level specifications (equality, equivalence). See also the
2432 isar-ref manual. Examples:
2435 eq (infix "===" 50) where
2436 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2438 definition "f x y = x + y + 1"
2439 definition g where "g x = f x x"
2442 neq (infix "=!=" 50) where
2443 "x =!= y == ~ (x === y)"
2445 These specifications may be also used in a locale context. Then the
2446 constants being introduced depend on certain fixed parameters, and the
2447 constant name is qualified by the locale base name. An internal
2448 abbreviation takes care for convenient input and output, making the
2449 parameters implicit and using the original short name. See also
2450 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2451 entities from a monomorphic theory.
2453 Presently, abbreviations are only available 'in' a target locale, but
2454 not inherited by general import expressions. Also note that
2455 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2456 'translations' in common applications. The "no_abbrevs" print mode
2457 prevents folding of abbreviations in term output.
2459 Concrete syntax is attached to specified constants in internal form,
2460 independently of name spaces. The parse tree representation is
2461 slightly different -- use 'notation' instead of raw 'syntax', and
2462 'translations' with explicit "CONST" markup to accommodate this.
2464 * Pure/Isar: unified syntax for new-style specification mechanisms
2465 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2466 full type inference and dummy patterns ("_"). For example:
2468 definition "K x _ = x"
2470 inductive conj for A B
2471 where "A ==> B ==> conj A B"
2473 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2474 the current context. Print mode "no_abbrevs" prevents inversion of
2475 abbreviations on output.
2477 * Isar/locales: improved parameter handling: use of locales "var" and
2478 "struct" no longer necessary; - parameter renamings are no longer
2479 required to be injective. For example, this allows to define
2480 endomorphisms as locale endom = homom mult mult h.
2482 * Isar/locales: changed the way locales with predicates are defined.
2483 Instead of accumulating the specification, the imported expression is
2484 now an interpretation. INCOMPATIBILITY: different normal form of
2485 locale expressions. In particular, in interpretations of locales with
2486 predicates, goals repesenting already interpreted fragments are not
2487 removed automatically. Use methods `intro_locales' and
2488 `unfold_locales'; see below.
2490 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2491 provide backward reasoning on locales predicates. The methods are
2492 aware of interpretations and discharge corresponding goals.
2493 `intro_locales' is less aggressive then `unfold_locales' and does not
2494 unfold predicates to assumptions.
2496 * Isar/locales: the order in which locale fragments are accumulated
2497 has changed. This enables to override declarations from fragments due
2498 to interpretations -- for example, unwanted simp rules.
2500 * Isar/locales: interpretation in theories and proof contexts has been
2501 extended. One may now specify (and prove) equations, which are
2502 unfolded in interpreted theorems. This is useful for replacing
2503 defined concepts (constants depending on locale parameters) by
2504 concepts already existing in the target context. Example:
2506 interpretation partial_order ["op <= :: [int, int] => bool"]
2507 where "partial_order.less (op <=) (x::int) y = (x < y)"
2509 Typically, the constant `partial_order.less' is created by a
2510 definition specification element in the context of locale
2513 * Method "induct": improved internal context management to support
2514 local fixes and defines on-the-fly. Thus explicit meta-level
2515 connectives !! and ==> are rarely required anymore in inductive goals
2516 (using object-logic connectives for this purpose has been long
2517 obsolete anyway). Common proof patterns are explained in
2518 src/HOL/Induct/Common_Patterns.thy, see also
2519 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2522 * Method "induct": improved handling of simultaneous goals. Instead of
2523 introducing object-level conjunction, the statement is now split into
2524 several conclusions, while the corresponding symbolic cases are nested
2525 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2526 see src/HOL/Induct/Common_Patterns.thy, for example.
2528 * Method "induct": mutual induction rules are now specified as a list
2529 of rule sharing the same induction cases. HOL packages usually provide
2530 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2531 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2532 mutual induction rules differently, i.e. like this:
2534 (induct rule: foo_bar.inducts)
2535 (induct set: foo bar)
2536 (induct pred: foo bar)
2537 (induct type: foo bar)
2539 The ML function ProjectRule.projections turns old-style rules into the
2542 * Method "coinduct": dual of induction, see
2543 src/HOL/Library/Coinductive_List.thy for various examples.
2545 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2546 considered a legacy feature.
2548 * Attribute "symmetric" produces result with standardized schematic
2549 variables (index 0). Potential INCOMPATIBILITY.
2551 * Simplifier: by default the simplifier trace only shows top level
2552 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2553 default. Thus there is less danger of being flooded by the trace. The
2554 trace indicates where parts have been suppressed.
2556 * Provers/classical: removed obsolete classical version of elim_format
2557 attribute; classical elim/dest rules are now treated uniformly when
2558 manipulating the claset.
2560 * Provers/classical: stricter checks to ensure that supplied intro,
2561 dest and elim rules are well-formed; dest and elim rules must have at
2564 * Provers/classical: attributes dest/elim/intro take an optional
2565 weight argument for the rule (just as the Pure versions). Weights are
2566 ignored by automated tools, but determine the search order of single
2569 * Syntax: input syntax now supports dummy variable binding "%_. b",
2570 where the body does not mention the bound variable. Note that dummy
2571 patterns implicitly depend on their context of bounds, which makes
2572 "{_. _}" match any set comprehension as expected. Potential
2573 INCOMPATIBILITY -- parse translations need to cope with syntactic
2574 constant "_idtdummy" in the binding position.
2576 * Syntax: removed obsolete syntactic constant "_K" and its associated
2577 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2578 for example "A -> B" => "Pi A (%_. B)".
2580 * Pure: 'class_deps' command visualizes the subclass relation, using
2581 the graph browser tool.
2583 * Pure: 'print_theory' now suppresses certain internal declarations by
2584 default; use '!' option for full details.
2589 * Method "metis" proves goals by applying the Metis general-purpose
2590 resolution prover (see also http://gilith.com/software/metis/).
2591 Examples are in the directory MetisExamples. WARNING: the
2592 Isabelle/HOL-Metis integration does not yet work properly with
2595 * Command 'sledgehammer' invokes external automatic theorem provers as
2596 background processes. It generates calls to the "metis" method if
2597 successful. These can be pasted into the proof. Users do not have to
2598 wait for the automatic provers to return. WARNING: does not really
2599 work with multi-threading.
2601 * New "auto_quickcheck" feature tests outermost goal statements for
2602 potential counter-examples. Controlled by ML references
2603 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2604 5000 milliseconds). Fails silently if statements is outside of
2605 executable fragment, or any other codgenerator problem occurs.
2607 * New constant "undefined" with axiom "undefined x = undefined".
2609 * Added class "HOL.eq", allowing for code generation with polymorphic
2612 * Some renaming of class constants due to canonical name prefixing in
2613 the new 'class' package:
2615 HOL.abs ~> HOL.abs_class.abs
2616 HOL.divide ~> HOL.divide_class.divide
2617 0 ~> HOL.zero_class.zero
2618 1 ~> HOL.one_class.one
2619 op + ~> HOL.plus_class.plus
2620 op - ~> HOL.minus_class.minus
2621 uminus ~> HOL.minus_class.uminus
2622 op * ~> HOL.times_class.times
2623 op < ~> HOL.ord_class.less
2624 op <= > HOL.ord_class.less_eq
2625 Nat.power ~> Power.power_class.power
2626 Nat.size ~> Nat.size_class.size
2627 Numeral.number_of ~> Numeral.number_class.number_of
2628 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2629 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2630 Orderings.min ~> Orderings.ord_class.min
2631 Orderings.max ~> Orderings.ord_class.max
2632 Divides.op div ~> Divides.div_class.div
2633 Divides.op mod ~> Divides.div_class.mod
2634 Divides.op dvd ~> Divides.div_class.dvd
2636 INCOMPATIBILITY. Adaptions may be required in the following cases:
2638 a) User-defined constants using any of the names "plus", "minus",
2639 "times", "less" or "less_eq". The standard syntax translations for
2640 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2643 b) Variables named "plus", "minus", "times", "less", "less_eq"
2644 INCOMPATIBILITY: use more specific names.
2646 c) Permutative equations (e.g. "a + b = b + a")
2647 Since the change of names also changes the order of terms, permutative
2648 rewrite rules may get applied in a different order. Experience shows
2649 that this is rarely the case (only two adaptions in the whole Isabelle
2650 distribution). INCOMPATIBILITY: rewrite proofs
2652 d) ML code directly refering to constant names
2653 This in general only affects hand-written proof tactics, simprocs and
2654 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2655 Consider using @{const_name} antiquotation.
2657 * New class "default" with associated constant "default".
2659 * Function "sgn" is now overloaded and available on int, real, complex
2660 (and other numeric types), using class "sgn". Two possible defs of
2661 sgn are given as equational assumptions in the classes sgn_if and
2662 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2665 * Locale "partial_order" now unified with class "order" (cf. theory
2666 Orderings), added parameter "less". INCOMPATIBILITY.
2668 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2669 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2670 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2672 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2673 changed order of proof goals in instance proofs.
2675 * The transitivity reasoner for partial and linear orders is set up
2676 for classes "order" and "linorder". Instances of the reasoner are available
2677 in all contexts importing or interpreting the corresponding locales.
2678 Method "order" invokes the reasoner separately; the reasoner
2679 is also integrated with the Simplifier as a solver. Diagnostic
2680 command 'print_orders' shows the available instances of the reasoner
2681 in the current context.
2683 * Localized monotonicity predicate in theory "Orderings"; integrated
2684 lemmas max_of_mono and min_of_mono with this predicate.
2687 * Formulation of theorem "dense" changed slightly due to integration
2688 with new class dense_linear_order.
2690 * Uniform lattice theory development in HOL.
2692 constants "meet" and "join" now named "inf" and "sup"
2693 constant "Meet" now named "Inf"
2695 classes "meet_semilorder" and "join_semilorder" now named
2696 "lower_semilattice" and "upper_semilattice"
2697 class "lorder" now named "lattice"
2698 class "comp_lat" now named "complete_lattice"
2700 Instantiation of lattice classes allows explicit definitions
2701 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2703 INCOMPATIBILITY. Theorem renames:
2705 meet_left_le ~> inf_le1
2706 meet_right_le ~> inf_le2
2707 join_left_le ~> sup_ge1
2708 join_right_le ~> sup_ge2
2709 meet_join_le ~> inf_sup_ord
2712 le_meet ~> le_inf_iff
2713 le_join ~> ge_sup_conv
2714 meet_idempotent ~> inf_idem
2715 join_idempotent ~> sup_idem
2716 meet_comm ~> inf_commute
2717 join_comm ~> sup_commute
2718 meet_leI1 ~> le_infI1
2719 meet_leI2 ~> le_infI2
2720 le_joinI1 ~> le_supI1
2721 le_joinI2 ~> le_supI2
2722 meet_assoc ~> inf_assoc
2723 join_assoc ~> sup_assoc
2724 meet_left_comm ~> inf_left_commute
2725 meet_left_idempotent ~> inf_left_idem
2726 join_left_comm ~> sup_left_commute
2727 join_left_idempotent ~> sup_left_idem
2730 le_def_meet ~> le_iff_inf
2731 le_def_join ~> le_iff_sup
2732 join_absorp2 ~> sup_absorb2
2733 join_absorp1 ~> sup_absorb1
2734 meet_absorp1 ~> inf_absorb1
2735 meet_absorp2 ~> inf_absorb2
2736 meet_join_absorp ~> inf_sup_absorb
2737 join_meet_absorp ~> sup_inf_absorb
2738 distrib_join_le ~> distrib_sup_le
2739 distrib_meet_le ~> distrib_inf_le
2741 add_meet_distrib_left ~> add_inf_distrib_left
2742 add_join_distrib_left ~> add_sup_distrib_left
2743 is_join_neg_meet ~> is_join_neg_inf
2744 is_meet_neg_join ~> is_meet_neg_sup
2745 add_meet_distrib_right ~> add_inf_distrib_right
2746 add_join_distrib_right ~> add_sup_distrib_right
2747 add_meet_join_distribs ~> add_sup_inf_distribs
2748 join_eq_neg_meet ~> sup_eq_neg_inf
2749 meet_eq_neg_join ~> inf_eq_neg_sup
2750 add_eq_meet_join ~> add_eq_inf_sup
2751 meet_0_imp_0 ~> inf_0_imp_0
2752 join_0_imp_0 ~> sup_0_imp_0
2753 meet_0_eq_0 ~> inf_0_eq_0
2754 join_0_eq_0 ~> sup_0_eq_0
2755 neg_meet_eq_join ~> neg_inf_eq_sup
2756 neg_join_eq_meet ~> neg_sup_eq_inf
2757 join_eq_if ~> sup_eq_if
2759 mono_meet ~> mono_inf
2760 mono_join ~> mono_sup
2761 meet_bool_eq ~> inf_bool_eq
2762 join_bool_eq ~> sup_bool_eq
2763 meet_fun_eq ~> inf_fun_eq
2764 join_fun_eq ~> sup_fun_eq
2765 meet_set_eq ~> inf_set_eq
2766 join_set_eq ~> sup_set_eq
2767 meet1_iff ~> inf1_iff
2768 meet2_iff ~> inf2_iff
2777 join1_iff ~> sup1_iff
2778 join2_iff ~> sup2_iff
2788 is_meet_Meet ~> is_meet_Inf
2789 Meet_bool_def ~> Inf_bool_def
2790 Meet_fun_def ~> Inf_fun_def
2791 Meet_greatest ~> Inf_greatest
2792 Meet_lower ~> Inf_lower
2793 Meet_set_def ~> Inf_set_def
2796 Sup_bool_eq ~> Sup_bool_def
2797 Sup_fun_eq ~> Sup_fun_def
2798 Sup_set_eq ~> Sup_set_def
2800 listsp_meetI ~> listsp_infI
2801 listsp_meet_eq ~> listsp_inf_eq
2806 * Added syntactic class "size"; overloaded constant "size" now has
2807 type "'a::size ==> bool"
2809 * Internal reorganisation of `size' of datatypes: size theorems
2810 "foo.size" are no longer subsumed by "foo.simps" (but are still
2811 simplification rules by default!); theorems "prod.size" now named
2814 * Class "div" now inherits from class "times" rather than "type".
2817 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2818 Linorder etc. have disappeared; operations defined in terms of
2819 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2821 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2823 * HOL-Word: New extensive library and type for generic, fixed size
2824 machine words, with arithemtic, bit-wise, shifting and rotating
2825 operations, reflection into int, nat, and bool lists, automation for
2826 linear arithmetic (by automatic reflection into nat or int), including
2827 lemmas on overflow and monotonicity. Instantiated to all appropriate
2828 arithmetic type classes, supporting automatic simplification of
2829 numerals on all operations.
2831 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2833 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2835 * Code generator library theories:
2836 - Code_Integer represents HOL integers by big integer literals in target
2838 - Code_Char represents HOL characters by character literals in target
2840 - Code_Char_chr like Code_Char, but also offers treatment of character
2841 codes; includes Code_Integer.
2842 - Executable_Set allows to generate code for finite sets using lists.
2843 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2845 - Executable_Real implements a subset of real numbers, namly those
2846 representable by rational numbers.
2847 - Efficient_Nat implements natural numbers by integers, which in general will
2848 result in higher efficency; pattern matching with 0/Suc is eliminated;
2849 includes Code_Integer.
2850 - Code_Index provides an additional datatype index which is mapped to
2851 target-language built-in integers.
2852 - Code_Message provides an additional datatype message_string which is isomorphic to
2853 strings; messages are mapped to target-language strings.
2855 * New package for inductive predicates
2857 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2860 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2861 for z_1 :: U_1 and ... and z_n :: U_m
2863 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2866 with full support for type-inference, rather than
2868 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2870 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2871 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2873 inductive "s z_1 ... z_m"
2875 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2878 For backward compatibility, there is a wrapper allowing inductive
2879 sets to be defined with the new package via
2882 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2883 for z_1 :: U_1 and ... and z_n :: U_m
2885 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2891 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2892 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2893 for z_1 :: U_1 and ... and z_n :: U_m
2895 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2896 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2899 if the additional syntax "p ..." is required.
2901 Numerous examples can be found in the subdirectories src/HOL/Auth,
2902 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2906 - Since declaration and definition of inductive sets or predicates
2907 is no longer separated, abbreviations involving the newly
2908 introduced sets or predicates must be specified together with the
2909 introduction rules after the 'where' keyword (see above), rather
2910 than before the actual inductive definition.
2912 - The variables in induction and elimination rules are now
2913 quantified in the order of their occurrence in the introduction
2914 rules, rather than in alphabetical order. Since this may break
2915 some proofs, these proofs either have to be repaired, e.g. by
2916 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2917 statements of the form
2919 case (rule_i a_i_1 ... a_i_{k_i})
2921 or the old order of quantification has to be restored by explicitly adding
2922 meta-level quantifiers in the introduction rules, i.e.
2924 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2926 - The format of the elimination rules is now
2928 p z_1 ... z_m x_1 ... x_n ==>
2929 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2934 (x_1, ..., x_n) : s z_1 ... z_m ==>
2935 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2938 for sets rather than
2940 x : s z_1 ... z_m ==>
2941 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2944 This may require terms in goals to be expanded to n-tuples
2945 (e.g. using case_tac or simplification with the split_paired_all
2946 rule) before the above elimination rule is applicable.
2948 - The elimination or case analysis rules for (mutually) inductive
2949 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2950 list of rules "p_1_..._p_k.elims" is no longer available.
2952 * New package "function"/"fun" for general recursive functions,
2953 supporting mutual and nested recursion, definitions in local contexts,
2954 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2955 for small examples, and the separate tutorial on the function
2956 package. The old recdef "package" is still available as before, but
2957 users are encouraged to use the new package.
2959 * Method "lexicographic_order" automatically synthesizes termination
2960 relations as lexicographic combinations of size measures.
2962 * Case-expressions allow arbitrary constructor-patterns (including
2963 "_") and take their order into account, like in functional
2964 programming. Internally, this is translated into nested
2965 case-expressions; missing cases are added and mapped to the predefined
2966 constant "undefined". In complicated cases printing may no longer show
2967 the original input but the internal form. Lambda-abstractions allow
2968 the same form of pattern matching: "% pat1 => e1 | ..." is an
2969 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2972 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2973 is an abbreviation for "of_nat :: nat => int". The simplification
2974 rules for "of_nat" have been changed to work like "int" did
2975 previously. Potential INCOMPATIBILITY:
2976 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2977 - of_nat_diff and of_nat_mult are no longer default simp rules
2979 * Method "algebra" solves polynomial equations over (semi)rings using
2980 Groebner bases. The (semi)ring structure is defined by locales and the
2981 tool setup depends on that generic context. Installing the method for
2982 a specific type involves instantiating the locale and possibly adding
2983 declarations for computation on the coefficients. The method is
2984 already instantiated for natural numbers and for the axiomatic class
2985 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2986 CALCULEMUS 2007 for the general principles underlying this
2987 architecture of context-aware proof-tools.
2989 * Method "ferrack" implements quantifier elimination over
2990 special-purpose dense linear orders using locales (analogous to
2991 "algebra"). The method is already installed for class
2992 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2995 * Former constant "List.op @" now named "List.append". Use ML
2996 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2997 circumvent possible incompatibilities when working on ML level.
2999 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3001 * New function listsum :: 'a list => 'a for arbitrary monoids.
3002 Special syntax: "SUM x <- xs. f x" (and latex variants)
3004 * New syntax for Haskell-like list comprehension (input only), eg.
3005 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3007 * The special syntax for function "filter" has changed from [x :
3008 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3009 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3011 * [a..b] is now defined for arbitrary linear orders. It used to be
3012 defined on nat only, as an abbreviation for [a..<Suc b]
3015 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3017 * New functions "sorted" and "sort" in src/HOL/List.thy.
3019 * New lemma collection field_simps (an extension of ring_simps) for
3020 manipulating (in)equations involving division. Multiplies with all
3021 denominators that can be proved to be non-zero (in equations) or
3022 positive/negative (in inequations).
3024 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3025 have been improved and renamed to ring_simps, group_simps and
3026 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3027 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3029 * Theory Library/Commutative_Ring: switched from recdef to function
3030 package; constants add, mul, pow now curried. Infix syntax for
3031 algebraic operations.
3033 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3036 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3039 * HOL/records: generalised field-update to take a function on the
3040 field rather than the new value: r(|A := x|) is translated to A_update
3041 (K x) r The K-combinator that is internally used is called K_record.
3042 INCOMPATIBILITY: Usage of the plain update functions has to be
3045 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3046 * x = 0, which are required for a semiring. Richer structures do not
3047 inherit from semiring_0 anymore, because this property is a theorem
3048 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3049 there is more to prove, but this is mostly trivial.
3051 * Class "recpower" is generalized to arbitrary monoids, not just
3052 commutative semirings. INCOMPATIBILITY: may need to incorporate
3053 commutativity or semiring properties additionally.
3055 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3056 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3057 better use 'abbreviation'.
3059 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3061 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3062 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3063 significant changes for setting up numeral syntax for types:
3064 - New constants Numeral.pred and Numeral.succ instead
3065 of former Numeral.bin_pred and Numeral.bin_succ.
3066 - Use integer operations instead of bin_add, bin_mult and so on.
3067 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3068 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3070 See src/HOL/Integ/IntArith.thy for an example setup.
3072 * Command 'normal_form' computes the normal form of a term that may
3073 contain free variables. For example ``normal_form "rev [a, b, c]"''
3074 produces ``[b, c, a]'' (without proof). This command is suitable for
3075 heavy-duty computations because the functions are compiled to ML
3076 first. Correspondingly, a method "normalization" is provided. See
3077 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3079 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3080 25 like -->); output depends on the "iff" print_mode, the default is
3081 "A = B" (with priority 50).
3083 * Relations less (<) and less_eq (<=) are also available on type bool.
3084 Modified syntax to disallow nesting without explicit parentheses,
3085 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3088 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3090 * Relation composition operator "op O" now has precedence 75 and binds
3091 stronger than union and intersection. INCOMPATIBILITY.
3093 * The old set interval syntax "{m..n(}" (and relatives) has been
3094 removed. Use "{m..<n}" (and relatives) instead.
3096 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3097 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3098 ``declare [[simproc del: neq]]''.
3100 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3103 * Theorem Cons_eq_map_conv no longer declared as "simp".
3105 * Theorem setsum_mult renamed to setsum_right_distrib.
3107 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3110 * Reimplemented methods "sat" and "satx", with several improvements:
3111 goals no longer need to be stated as "<prems> ==> False", equivalences
3112 (i.e. "=" on type bool) are handled, variable names of the form
3113 "lit_<n>" are no longer reserved, significant speedup.
3115 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3116 zChaff is still supported as well.
3118 * 'inductive' and 'datatype': provide projections of mutual rules,
3119 bundled as foo_bar.inducts;
3121 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3124 * Library: moved theory Accessible_Part to main HOL.
3126 * Library: added theory Coinductive_List of potentially infinite lists
3127 as greatest fixed-point.
3129 * Library: added theory AssocList which implements (finite) maps as
3132 * Method "evaluation" solves goals (i.e. a boolean expression)
3133 efficiently by compiling it to ML. The goal is "proved" (via an
3134 oracle) if it evaluates to True.
3136 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3137 also when invoked by the simplifier. This results in the Simplifier
3138 being more powerful on arithmetic goals. INCOMPATIBILITY.
3139 Configuration option fast_arith_split_limit=0 recovers the old
3142 * Support for hex (0x20) and binary (0b1001) numerals.
3144 * New method: reify eqs (t), where eqs are equations for an
3145 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3146 parameter, computes a term s::'b and a list xs::'a list and proves the
3147 theorem I xs s = t. This is also known as reification or quoting. The
3148 resulting theorem is applied to the subgoal to substitute t with I xs
3149 s. If t is omitted, the subgoal itself is reified.
3151 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3152 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3153 where f is supposed to be a computable function (in the sense of code
3154 generattion). The method uses reify to compute s and xs as above then
3155 applies corr_thm and uses normalization by evaluation to "prove" f s =
3156 r and finally gets the theorem t = r, which is again applied to the
3157 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3159 * Reflection: Automatic reification now handels binding, an example is
3160 available in src/HOL/ex/ReflectionEx.thy
3162 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3163 command 'statespace' that is similar to 'record', but introduces an
3164 abstract specification based on the locale infrastructure instead of
3165 HOL types. This leads to extra flexibility in composing state spaces,
3166 in particular multiple inheritance and renaming of components.
3171 * Hyperreal: Functions root and sqrt are now defined on negative real
3172 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3173 Nonnegativity side conditions have been removed from many lemmas, so
3174 that more subgoals may now be solved by simplification; potential
3177 * Real: new type classes formalize real normed vector spaces and
3178 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3179 and norm :: 'a => real.
3181 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3182 reals into other types. The overloaded constant Reals :: 'a set is now
3183 defined as range of_real; potential INCOMPATIBILITY.
3185 * Real: proper support for ML code generation, including 'quickcheck'.
3186 Reals are implemented as arbitrary precision rationals.
3188 * Hyperreal: Several constants that previously worked only for the
3189 reals have been generalized, so they now work over arbitrary vector
3190 spaces. Type annotations may need to be added in some cases; potential
3193 Infinitesimal :: ('a::real_normed_vector) star set
3194 HFinite :: ('a::real_normed_vector) star set
3195 HInfinite :: ('a::real_normed_vector) star set
3196 approx :: ('a::real_normed_vector) star => 'a star => bool
3197 monad :: ('a::real_normed_vector) star => 'a star set
3198 galaxy :: ('a::real_normed_vector) star => 'a star set
3199 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3200 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3201 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3202 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3203 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3204 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3205 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3206 sgn :: 'a::real_normed_vector => 'a
3207 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3209 * Complex: Some complex-specific constants are now abbreviations for
3210 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3211 hnorm. Other constants have been entirely removed in favor of the
3212 polymorphic versions (INCOMPATIBILITY):
3216 HInfinite <-- CInfinite
3217 Infinitesimal <-- CInfinitesimal
3220 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3221 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3222 (ns)deriv <-- (ns)cderiv
3227 * Formalisation of ideals and the quotient construction over rings.
3229 * Order and lattice theory no longer based on records.
3232 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3233 greatest_closed. INCOMPATIBILITY.
3235 * Method algebra is now set up via an attribute. For examples see
3236 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3237 of algebraic structures.
3239 * Renamed theory CRing to Ring.
3244 * Substantial, yet incomplete support for nominal datatypes (binding
3245 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3246 src/HOL/Nominal/Examples. Prospective users should consult
3247 http://isabelle.in.tum.de/nominal/
3252 * ML basics: just one true type int, which coincides with IntInf.int
3255 * ML within Isar: antiquotations allow to embed statically-checked
3256 formal entities in the source, referring to the context available at
3257 compile-time. For example:
3259 ML {* @{sort "{zero,one}"} *}
3260 ML {* @{typ "'a => 'b"} *}
3261 ML {* @{term "%x. x"} *}
3262 ML {* @{prop "x == y"} *}
3263 ML {* @{ctyp "'a => 'b"} *}
3264 ML {* @{cterm "%x. x"} *}
3265 ML {* @{cprop "x == y"} *}
3266 ML {* @{thm asm_rl} *}
3267 ML {* @{thms asm_rl} *}
3268 ML {* @{type_name c} *}
3269 ML {* @{type_syntax c} *}
3270 ML {* @{const_name c} *}
3271 ML {* @{const_syntax c} *}
3274 ML {* @{theory Pure} *}
3275 ML {* @{theory_ref} *}
3276 ML {* @{theory_ref Pure} *}
3279 ML {* @{clasimpset} *}
3281 The same works for sources being ``used'' within an Isar context.
3283 * ML in Isar: improved error reporting; extra verbosity with
3284 ML_Context.trace enabled.
3286 * Pure/General/table.ML: the join operations now works via exceptions
3287 DUP/SAME instead of type option. This is simpler in simple cases, and
3288 admits slightly more efficient complex applications.
3290 * Pure: 'advanced' translation functions (parse_translation etc.) now
3291 use Context.generic instead of just theory.
3293 * Pure: datatype Context.generic joins theory/Proof.context and
3294 provides some facilities for code that works in either kind of
3295 context, notably GenericDataFun for uniform theory and proof data.
3297 * Pure: simplified internal attribute type, which is now always
3298 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3299 local (Proof.context) attributes have been discontinued, while
3300 minimizing code duplication. Thm.rule_attribute and
3301 Thm.declaration_attribute build canonical attributes; see also structure
3302 Context for further operations on Context.generic, notably
3303 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3304 declarations and definitions.
3306 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3307 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3308 init only required for impure data. INCOMPATIBILITY: empty really need
3309 to be empty (no dependencies on theory content!)
3311 * Pure/kernel: consts certification ignores sort constraints given in
3312 signature declarations. (This information is not relevant to the
3313 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3314 potential INCOMPATIBILITY.
3316 * Pure: axiomatic type classes are now purely definitional, with
3317 explicit proofs of class axioms and super class relations performed
3318 internally. See Pure/axclass.ML for the main internal interfaces --
3319 notably AxClass.define_class supersedes AxClass.add_axclass, and
3320 AxClass.axiomatize_class/classrel/arity supersede
3321 Sign.add_classes/classrel/arities.
3323 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3324 global/local versions on theory vs. Proof.context have been
3325 discontinued; Attrib.syntax and Method.syntax have been adapted
3326 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3327 attributes, methods, etc.
3329 * Pure: several functions of signature "... -> theory -> theory * ..."
3330 have been reoriented to "... -> theory -> ... * theory" in order to
3331 allow natural usage in combination with the ||>, ||>>, |-> and
3332 fold_map combinators.
3334 * Pure: official theorem names (closed derivations) and additional
3335 comments (tags) are now strictly separate. Name hints -- which are
3336 maintained as tags -- may be attached any time without affecting the
3339 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3340 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3341 achieve the old behaviour.
3343 * Pure: the "Goal" constant is now called "prop", supporting a
3344 slightly more general idea of ``protecting'' meta-level rule
3347 * Pure: Logic.(un)varify only works in a global context, which is now
3348 enforced instead of silently assumed. INCOMPATIBILITY, may use
3349 Logic.legacy_(un)varify as temporary workaround.
3351 * Pure: structure Name provides scalable operations for generating
3352 internal variable names, notably Name.variants etc. This replaces
3353 some popular functions from term.ML:
3355 Term.variant -> Name.variant
3356 Term.variantlist -> Name.variant_list
3357 Term.invent_names -> Name.invent_list
3359 Note that low-level renaming rarely occurs in new code -- operations
3360 from structure Variable are used instead (see below).
3362 * Pure: structure Variable provides fundamental operations for proper
3363 treatment of fixed/schematic variables in a context. For example,
3364 Variable.import introduces fixes for schematics of given facts and
3365 Variable.export reverses the effect (up to renaming) -- this replaces
3366 various freeze_thaw operations.
3368 * Pure: structure Goal provides simple interfaces for
3369 init/conclude/finish and tactical prove operations (replacing former
3370 Tactic.prove). Goal.prove is the canonical way to prove results
3371 within a given context; Goal.prove_global is a degraded version for
3372 theory level goals, including a global Drule.standard. Note that
3373 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3374 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3375 in a locale context).
3377 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3378 and type checking (Syntax.check_term etc.), with common combinations
3379 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3380 which are considered legacy and await removal.
3382 * Pure/Syntax: generic interfaces for type unchecking
3383 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3384 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3385 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3386 available for convenience, but refer to the very same operations using
3387 a mere theory instead of a full context.
3389 * Isar: simplified treatment of user-level errors, using exception
3390 ERROR of string uniformly. Function error now merely raises ERROR,
3391 without any side effect on output channels. The Isar toplevel takes
3392 care of proper display of ERROR exceptions. ML code may use plain
3393 handle/can/try; cat_error may be used to concatenate errors like this:
3395 ... handle ERROR msg => cat_error msg "..."
3397 Toplevel ML code (run directly or through the Isar toplevel) may be
3398 embedded into the Isar toplevel with exception display/debug like
3401 Isar.toplevel (fn () => ...)
3403 INCOMPATIBILITY, removed special transform_error facilities, removed
3404 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3405 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3406 -- use plain ERROR instead.
3408 * Isar: theory setup now has type (theory -> theory), instead of a
3409 list. INCOMPATIBILITY, may use #> to compose setup functions.
3411 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3412 ProofContext.debug/verbose flags.
3414 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3415 theory before entering a proof state. Transactions now always see a
3416 quasi-functional intermediate checkpoint, both in interactive and
3419 * Isar: simplified interfaces for outer syntax. Renamed
3420 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3421 OuterSyntax.add_parsers -- this functionality is now included in
3422 OuterSyntax.command etc. INCOMPATIBILITY.
3424 * Simplifier: the simpset of a running simplification process now
3425 contains a proof context (cf. Simplifier.the_context), which is the
3426 very context that the initial simpset has been retrieved from (by
3427 simpset_of/local_simpset_of). Consequently, all plug-in components
3428 (solver, looper etc.) may depend on arbitrary proof data.
3430 * Simplifier.inherit_context inherits the proof context (plus the
3431 local bounds) of the current simplification process; any simproc
3432 etc. that calls the Simplifier recursively should do this! Removed
3433 former Simplifier.inherit_bounds, which is already included here --
3434 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3435 specify an explicit context using Simplifier.context/theory_context.
3437 * Simplifier/Classical Reasoner: more abstract interfaces
3438 change_simpset/claset for modifying the simpset/claset reference of a
3439 theory; raw versions simpset/claset_ref etc. have been discontinued --
3442 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3448 * settings: the default heap location within ISABELLE_HOME_USER now
3449 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3450 Isabelle installations.
3452 * isabelle-process: option -S (secure mode) disables some critical
3453 operations, notably runtime compilation and evaluation of ML source
3456 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3458 * Support for parallel execution, using native multicore support of
3459 Poly/ML 5.1. The theory loader exploits parallelism when processing
3460 independent theories, according to the given theory header
3461 specifications. The maximum number of worker threads is specified via
3462 usedir option -M or the "max-threads" setting in Proof General. A
3463 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3464 to 6 on a 8-core machine. User-code needs to observe certain
3465 guidelines for thread-safe programming, see appendix A in the Isar
3466 Implementation manual.
3470 New in Isabelle2005 (October 2005)
3471 ----------------------------------
3475 * Theory headers: the new header syntax for Isar theories is
3478 imports <theory1> ... <theoryN>
3479 uses <file1> ... <fileM>
3482 where the 'uses' part is optional. The previous syntax
3484 theory <name> = <theory1> + ... + <theoryN>:
3486 will disappear in the next release. Use isatool fixheaders to convert
3487 existing theory files. Note that there is no change in ancient
3488 non-Isar theories now, but these will disappear soon.
3490 * Theory loader: parent theories can now also be referred to via
3491 relative and absolute paths.
3493 * Command 'find_theorems' searches for a list of criteria instead of a
3494 list of constants. Known criteria are: intro, elim, dest, name:string,
3495 simp:term, and any term. Criteria can be preceded by '-' to select
3496 theorems that do not match. Intro, elim, dest select theorems that
3497 match the current goal, name:s selects theorems whose fully qualified
3498 name contain s, and simp:term selects all simplification rules whose
3499 lhs match term. Any other term is interpreted as pattern and selects
3500 all theorems matching the pattern. Available in ProofGeneral under
3501 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3503 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3505 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3506 matching the current goal as introduction rule and not having "HOL."
3507 in their name (i.e. not being defined in theory HOL).
3509 * Command 'thms_containing' has been discontinued in favour of
3510 'find_theorems'; INCOMPATIBILITY.
3512 * Communication with Proof General is now 8bit clean, which means that
3513 Unicode text in UTF-8 encoding may be used within theory texts (both
3514 formal and informal parts). Cf. option -U of the Isabelle Proof
3515 General interface. Here are some simple examples (cf. src/HOL/ex):
3517 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3518 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3520 * Improved efficiency of the Simplifier and, to a lesser degree, the
3521 Classical Reasoner. Typical big applications run around 2 times
3525 *** Document preparation ***
3527 * Commands 'display_drafts' and 'print_drafts' perform simple output
3528 of raw sources. Only those symbols that do not require additional
3529 LaTeX packages (depending on comments in isabellesym.sty) are
3530 displayed properly, everything else is left verbatim. isatool display
3531 and isatool print are used as front ends (these are subject to the
3532 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3534 * Command tags control specific markup of certain regions of text,
3535 notably folding and hiding. Predefined tags include "theory" (for
3536 theory begin and end), "proof" for proof commands, and "ML" for
3537 commands involving ML code; the additional tags "visible" and
3538 "invisible" are unused by default. Users may give explicit tag
3539 specifications in the text, e.g. ''by %invisible (auto)''. The
3540 interpretation of tags is determined by the LaTeX job during document
3541 preparation: see option -V of isatool usedir, or options -n and -t of
3542 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3545 Several document versions may be produced at the same time via isatool
3546 usedir (the generated index.html will link all of them). Typical
3547 specifications include ''-V document=theory,proof,ML'' to present
3548 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3549 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3550 these parts without any formal replacement text. The Isabelle site
3551 default settings produce ''document'' and ''outline'' versions as
3554 * Several new antiquotations:
3556 @{term_type term} prints a term with its type annotated;
3558 @{typeof term} prints the type of a term;
3560 @{const const} is the same as @{term const}, but checks that the
3561 argument is a known logical constant;
3563 @{term_style style term} and @{thm_style style thm} print a term or
3564 theorem applying a "style" to it
3568 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3569 definitions, equations, inequations etc., 'concl' printing only the
3570 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3571 to print the specified premise. TermStyle.add_style provides an ML
3572 interface for introducing further styles. See also the "LaTeX Sugar"
3573 document practical applications. The ML antiquotation prints
3574 type-checked ML expressions verbatim.
3576 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3577 and 'text' support optional locale specification '(in loc)', which
3578 specifies the default context for interpreting antiquotations. For
3579 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3581 * Option 'locale=NAME' of antiquotations specifies an alternative
3582 context interpreting the subsequent argument. For example: @{thm
3583 [locale=lattice] inf_assoc}.
3585 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3588 * Proper output of antiquotations for theory commands involving a
3589 proof context (such as 'locale' or 'theorem (in loc) ...').
3591 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3592 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3594 * isatool usedir: new option -C (default true) controls whether option
3595 -D should include a copy of the original document directory; -C false
3596 prevents unwanted effects such as copying of administrative CVS data.
3601 * Considerably improved version of 'constdefs' command. Now performs
3602 automatic type-inference of declared constants; additional support for
3603 local structure declarations (cf. locales and HOL records), see also
3604 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3605 sequential dependencies of definitions within a single 'constdefs'
3606 section; moreover, the declared name needs to be an identifier. If
3607 all fails, consider to fall back on 'consts' and 'defs' separately.
3609 * Improved indexed syntax and implicit structures. First of all,
3610 indexed syntax provides a notational device for subscripted
3611 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3612 expressions. Secondly, in a local context with structure
3613 declarations, number indexes \<^sub>n or the empty index (default
3614 number 1) refer to a certain fixed variable implicitly; option
3615 show_structs controls printing of implicit structures. Typical
3616 applications of these concepts involve record types and locales.
3618 * New command 'no_syntax' removes grammar declarations (and
3619 translations) resulting from the given syntax specification, which is
3620 interpreted in the same manner as for the 'syntax' command.
3622 * 'Advanced' translation functions (parse_translation etc.) may depend
3623 on the signature of the theory context being presently used for
3624 parsing/printing, see also isar-ref manual.
3626 * Improved 'oracle' command provides a type-safe interface to turn an
3627 ML expression of type theory -> T -> term into a primitive rule of
3628 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3629 is already included here); see also FOL/ex/IffExample.thy;
3632 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3633 before); "cI" is no longer bound, use "c.intro" instead.
3634 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3635 axclasses vs. locales.
3637 * Improved internal renaming of symbolic identifiers -- attach primes
3638 instead of base 26 numbers.
3640 * New flag show_question_marks controls printing of leading question
3641 marks in schematic variable names.
3643 * In schematic variable names, *any* symbol following \<^isub> or
3644 \<^isup> is now treated as part of the base name. For example, the
3645 following works without printing of awkward ".0" indexes:
3647 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3650 * Inner syntax includes (*(*nested*) comments*).
3652 * Pretty printer now supports unbreakable blocks, specified in mixfix
3653 annotations as "(00...)".
3655 * Clear separation of logical types and nonterminals, where the latter
3656 may only occur in 'syntax' specifications or type abbreviations.
3657 Before that distinction was only partially implemented via type class
3658 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3659 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3660 exotic syntax specifications may require further adaption
3661 (e.g. Cube/Cube.thy).
3663 * Removed obsolete type class "logic", use the top sort {} instead.
3664 Note that non-logical types should be declared as 'nonterminals'
3665 rather than 'types'. INCOMPATIBILITY for new object-logic
3668 * Attributes 'induct' and 'cases': type or set names may now be
3669 locally fixed variables as well.
3671 * Simplifier: can now control the depth to which conditional rewriting
3672 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3675 * Simplifier: simplification procedures may now take the current
3676 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3677 interface), which is very useful for calling the Simplifier
3678 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3679 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3680 low-level mk_simproc no longer applies Logic.varify internally, to
3681 allow for use in a context of fixed variables.
3683 * thin_tac now works even if the assumption being deleted contains !!
3684 or ==>. More generally, erule now works even if the major premise of
3685 the elimination rule contains !! or ==>.
3687 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3689 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3690 from Pure, which contains all common declarations already. Both
3691 theories are defined via plain Isabelle/Isar .thy files.
3692 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3693 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3694 use isatool fixcpure to adapt your theory and ML sources.
3696 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3697 selections of theorems in named facts via index ranges.
3699 * 'print_theorems': in theory mode, really print the difference
3700 wrt. the last state (works for interactive theory development only),
3701 in proof mode print all local facts (cf. 'print_facts');
3703 * 'hide': option '(open)' hides only base names.
3705 * More efficient treatment of intermediate checkpoints in interactive
3708 * Code generator is now invoked via code_module (incremental code
3709 generation) and code_library (modular code generation, ML structures
3710 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3711 must be quoted when used as identifiers.
3713 * New 'value' command for reading, evaluating and printing terms using
3714 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3715 quoted when used as identifier.
3720 * New commands for the interpretation of locale expressions in
3721 theories (1), locales (2) and proof contexts (3). These generate
3722 proof obligations from the expression specification. After the
3723 obligations have been discharged, theorems of the expression are added
3724 to the theory, target locale or proof context. The synopsis of the
3725 commands is a follows:
3727 (1) interpretation expr inst
3728 (2) interpretation target < expr
3729 (3) interpret expr inst
3731 Interpretation in theories and proof contexts require a parameter
3732 instantiation of terms from the current context. This is applied to
3733 specifications and theorems of the interpreted expression.
3734 Interpretation in locales only permits parameter renaming through the
3735 locale expression. Interpretation is smart in that interpretations
3736 that are active already do not occur in proof obligations, neither are
3737 instantiated theorems stored in duplicate. Use 'print_interps' to
3738 inspect active interpretations of a particular locale. For details,
3739 see the Isar Reference manual. Examples can be found in
3740 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3742 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3743 'interpret' instead.
3745 * New context element 'constrains' for adding type constraints to
3748 * Context expressions: renaming of parameters with syntax
3751 * Locale declaration: 'includes' disallowed.
3753 * Proper static binding of attribute syntax -- i.e. types / terms /
3754 facts mentioned as arguments are always those of the locale definition
3755 context, independently of the context of later invocations. Moreover,
3756 locale operations (renaming and type / term instantiation) are applied
3757 to attribute arguments as expected.
3759 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3760 actual attributes; rare situations may require Attrib.attribute to
3761 embed those attributes into Attrib.src that lack concrete syntax.
3762 Attribute implementations need to cooperate properly with the static
3763 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3764 Attrib.XXX_thm etc. already do the right thing without further
3765 intervention. Only unusual applications -- such as "where" or "of"
3766 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3767 on the context and the facts involved -- may have to assign parsed
3768 values to argument tokens explicitly.
3770 * Changed parameter management in theorem generation for long goal
3771 statements with 'includes'. INCOMPATIBILITY: produces a different
3772 theorem statement in rare situations.
3774 * Locale inspection command 'print_locale' omits notes elements. Use
3775 'print_locale!' to have them included in the output.
3780 * Provers/hypsubst.ML: improved version of the subst method, for
3781 single-step rewriting: it now works in bound variable contexts. New is
3782 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3783 rewrite a different subterm than the original subst method, which is
3784 still available as 'simplesubst'.
3786 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3789 * Provers/trancl.ML: new transitivity reasoner for transitive and
3790 reflexive-transitive closure of relations.
3792 * Provers/blast.ML: new reference depth_limit to make blast's depth
3793 limit (previously hard-coded with a value of 20) user-definable.
3795 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3796 is peformed already. Object-logics merely need to finish their
3797 initial simpset configuration as before. INCOMPATIBILITY.
3802 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3805 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3807 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3808 and x-symbol; use option '-m epsilon' to get it actually printed.
3809 Moreover, the mathematically important symbolic identifier \<epsilon>
3810 becomes available as variable, constant etc. INCOMPATIBILITY,
3812 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3813 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3814 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3815 support corresponding Isar calculations.
3817 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3820 * theory SetInterval: changed the syntax for open intervals:
3829 The old syntax is still supported but will disappear in the next
3830 release. For conversion use the following Emacs search and replace
3831 patterns (these are not perfect but work quite well):
3833 {)\([^\.]*\)\.\. -> {\1<\.\.}
3834 \.\.\([^(}]*\)(} -> \.\.<\1}
3836 * Theory Commutative_Ring (in Library): method comm_ring for proving
3837 equalities in commutative rings; method 'algebra' provides a generic
3840 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3841 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3842 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3845 Some new syntax forms are available:
3847 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3848 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3849 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3850 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3852 The latter form "\<Sum>x < k. e" used to be based on a separate
3853 function "Summation", which has been discontinued.
3855 * theory Finite_Set: in structured induction proofs, the insert case
3856 is now 'case (insert x F)' instead of the old counterintuitive 'case
3859 * The 'refute' command has been extended to support a much larger
3860 fragment of HOL, including axiomatic type classes, constdefs and
3861 typedefs, inductive datatypes and recursion.
3863 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3864 Requires zChaff with proof generation to be installed. See
3865 HOL/ex/SAT_Examples.thy for examples.
3867 * Datatype induction via method 'induct' now preserves the name of the
3868 induction variable. For example, when proving P(xs::'a list) by
3869 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3870 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3871 in unstructured proof scripts.
3873 * Reworked implementation of records. Improved scalability for
3874 records with many fields, avoiding performance problems for type
3875 inference. Records are no longer composed of nested field types, but
3876 of nested extension types. Therefore the record type only grows linear
3877 in the number of extensions and not in the number of fields. The
3878 top-level (users) view on records is preserved. Potential
3879 INCOMPATIBILITY only in strange cases, where the theory depends on the
3880 old record representation. The type generated for a record is called
3881 <record_name>_ext_type.
3883 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3884 proofs triggered by a record definition or a simproc (if
3885 quick_and_dirty is enabled). Definitions of large records can take
3888 New simproc record_upd_simproc for simplification of multiple record
3889 updates enabled by default. Moreover, trivial updates are also
3890 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3891 occasionally, since simplification is more powerful by default.
3893 * typedef: proper support for polymorphic sets, which contain extra
3894 type-variables in the term.
3896 * Simplifier: automatically reasons about transitivity chains
3897 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3898 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3899 old proofs break occasionally as simplification may now solve more
3900 goals than previously.
3902 * Simplifier: converts x <= y into x = y if assumption y <= x is
3903 present. Works for all partial orders (class "order"), in particular
3904 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3907 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3908 bound variable or a constant then the let is unfolded. Otherwise
3909 first a is simplified to b, and then f b is simplified to g. If
3910 possible we abstract b from g arriving at "let x = b in h x",
3911 otherwise we unfold the let and arrive at g. The simproc can be
3912 enabled/disabled by the reference use_let_simproc. Potential
3913 INCOMPATIBILITY since simplification is more powerful by default.
3915 * Classical reasoning: the meson method now accepts theorems as arguments.
3917 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3918 jobs to provide advice on the provability of subgoals.
3920 * Theory OrderedGroup and Ring_and_Field: various additions and
3921 improvements to faciliate calculations involving equalities and
3924 The following theorems have been eliminated or modified
3927 abs_eq now named abs_of_nonneg
3928 abs_of_ge_0 now named abs_of_nonneg
3929 abs_minus_eq now named abs_of_nonpos
3930 imp_abs_id now named abs_of_nonneg
3931 imp_abs_neg_id now named abs_of_nonpos
3932 mult_pos now named mult_pos_pos
3933 mult_pos_le now named mult_nonneg_nonneg
3934 mult_pos_neg_le now named mult_nonneg_nonpos
3935 mult_pos_neg2_le now named mult_nonneg_nonpos2
3936 mult_neg now named mult_neg_neg
3937 mult_neg_le now named mult_nonpos_nonpos
3939 * The following lemmas in Ring_and_Field have been added to the simplifier:
3942 not_square_less_zero
3944 The following lemmas have been deleted from Real/RealPow:
3954 * Theory Parity: added rules for simplifying exponents.
3958 The following theorems have been eliminated or modified
3961 list_all_Nil now named list_all.simps(1)
3962 list_all_Cons now named list_all.simps(2)
3963 list_all_conv now named list_all_iff
3964 set_mem_eq now named mem_iff
3966 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3967 asymptotic "big O" calculations. See the notes in BigO.thy.
3972 * Theory RealDef: better support for embedding natural numbers and
3973 integers in the reals.
3975 The following theorems have been eliminated or modified
3978 exp_ge_add_one_self now requires no hypotheses
3979 real_of_int_add reversed direction of equality (use [symmetric])
3980 real_of_int_minus reversed direction of equality (use [symmetric])
3981 real_of_int_diff reversed direction of equality (use [symmetric])
3982 real_of_int_mult reversed direction of equality (use [symmetric])
3984 * Theory RComplete: expanded support for floor and ceiling functions.
3986 * Theory Ln is new, with properties of the natural logarithm
3988 * Hyperreal: There is a new type constructor "star" for making
3989 nonstandard types. The old type names are now type synonyms:
3993 hcomplex = complex star
3995 * Hyperreal: Many groups of similarly-defined constants have been
3996 replaced by polymorphic versions (INCOMPATIBILITY):
3998 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4000 starset <-- starsetNat, starsetC
4001 *s* <-- *sNat*, *sc*
4002 starset_n <-- starsetNat_n, starsetC_n
4003 *sn* <-- *sNatn*, *scn*
4004 InternalSets <-- InternalNatSets, InternalCSets
4006 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4007 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4008 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4009 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4010 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4012 * Hyperreal: Many type-specific theorems have been removed in favor of
4013 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4015 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4016 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4017 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4018 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4019 right_minus <-- hypreal_add_minus
4020 left_minus <-- {hypreal,hcomplex}_add_minus_left
4021 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4022 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4023 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4024 mult_1_right <-- hcomplex_mult_one_right
4025 mult_zero_left <-- hcomplex_mult_zero_left
4026 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4027 right_distrib <-- hypnat_add_mult_distrib2
4028 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4029 right_inverse <-- hypreal_mult_inverse
4030 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4031 order_refl <-- {hypreal,hypnat}_le_refl
4032 order_trans <-- {hypreal,hypnat}_le_trans
4033 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4034 order_less_le <-- {hypreal,hypnat}_less_le
4035 linorder_linear <-- {hypreal,hypnat}_le_linear
4036 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4037 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4038 add_nonneg_nonneg <-- hypreal_le_add_order
4040 * Hyperreal: Separate theorems having to do with type-specific
4041 versions of constants have been merged into theorems that apply to the
4042 new polymorphic constants (INCOMPATIBILITY):
4044 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4045 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4046 STAR_Un <-- {STAR,NatStar,STARC}_Un
4047 STAR_Int <-- {STAR,NatStar,STARC}_Int
4048 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4049 STAR_subset <-- {STAR,NatStar,STARC}_subset
4050 STAR_mem <-- {STAR,NatStar,STARC}_mem
4051 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4052 STAR_diff <-- {STAR,STARC}_diff
4053 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4054 STARC_hcomplex_of_complex}_image_subset
4055 starset_n_Un <-- starset{Nat,C}_n_Un
4056 starset_n_Int <-- starset{Nat,C}_n_Int
4057 starset_n_Compl <-- starset{Nat,C}_n_Compl
4058 starset_n_diff <-- starset{Nat,C}_n_diff
4059 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4060 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4061 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4062 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4063 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4064 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4065 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4066 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4067 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4068 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4069 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4070 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4071 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4072 starfun_diff <-- starfun{C,RC,CR}_diff
4073 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4074 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4075 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4076 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4077 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4078 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4079 starfun_Id <-- starfunC_Id
4080 starfun_approx <-- starfun{Nat,CR}_approx
4081 starfun_capprox <-- starfun{C,RC}_capprox
4082 starfun_abs <-- starfunNat_rabs
4083 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4084 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4085 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4086 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4087 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4088 starfun_add_approx <-- starfunCR_add_approx
4089 starfun_inverse_inverse <-- starfunC_inverse_inverse
4090 starfun_divide <-- starfun{C,CR,RC}_divide
4091 starfun_n <-- starfun{Nat,C}_n
4092 starfun_n_mult <-- starfun{Nat,C}_n_mult
4093 starfun_n_add <-- starfun{Nat,C}_n_add
4094 starfun_n_add_minus <-- starfunNat_n_add_minus
4095 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4096 starfun_n_minus <-- starfun{Nat,C}_n_minus
4097 starfun_n_eq <-- starfun{Nat,C}_n_eq
4099 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4100 star_n_minus <-- {hypreal,hcomplex}_minus
4101 star_n_diff <-- {hypreal,hcomplex}_diff
4102 star_n_mult <-- {hypreal,hcomplex}_mult
4103 star_n_inverse <-- {hypreal,hcomplex}_inverse
4104 star_n_le <-- {hypreal,hypnat}_le
4105 star_n_less <-- {hypreal,hypnat}_less
4106 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4107 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4108 star_n_abs <-- hypreal_hrabs
4109 star_n_divide <-- hcomplex_divide
4111 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4112 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4113 star_of_diff <-- hypreal_of_real_diff
4114 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4115 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4116 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4117 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4118 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4119 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4120 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4121 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4122 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4123 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4124 star_of_number_of <-- {hypreal,hcomplex}_number_of
4125 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4126 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4127 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4128 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4129 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4130 star_of_power <-- hypreal_of_real_power
4131 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4133 * Hyperreal: new method "transfer" that implements the transfer
4134 principle of nonstandard analysis. With a subgoal that mentions
4135 nonstandard types like "'a star", the command "apply transfer"
4136 replaces it with an equivalent one that mentions only standard types.
4137 To be successful, all free variables must have standard types; non-
4138 standard variables must have explicit universal quantifiers.
4140 * Hyperreal: A theory of Taylor series.
4145 * Discontinued special version of 'constdefs' (which used to support
4146 continuous functions) in favor of the general Pure one with full
4149 * New simplification procedure for solving continuity conditions; it
4150 is much faster on terms with many nested lambda abstractions (cubic
4151 instead of exponential time).
4153 * New syntax for domain package: selector names are now optional.
4154 Parentheses should be omitted unless argument is lazy, for example:
4156 domain 'a stream = cons "'a" (lazy "'a stream")
4158 * New command 'fixrec' for defining recursive functions with pattern
4159 matching; defining multiple functions with mutual recursion is also
4160 supported. Patterns may include the constants cpair, spair, up, sinl,
4161 sinr, or any data constructor defined by the domain package. The given
4162 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4163 syntax and examples.
4165 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4166 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4167 but the proof obligation additionally includes an admissibility
4168 requirement. The packages generate instances of class cpo or pcpo,
4169 with continuity and strictness theorems for Rep and Abs.
4171 * HOLCF: Many theorems have been renamed according to a more standard naming
4172 scheme (INCOMPATIBILITY):
4174 foo_inject: "foo$x = foo$y ==> x = y"
4175 foo_eq: "(foo$x = foo$y) = (x = y)"
4176 foo_less: "(foo$x << foo$y) = (x << y)"
4177 foo_strict: "foo$UU = UU"
4178 foo_defined: "... ==> foo$x ~= UU"
4179 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4184 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4185 including the First Isomorphism Theorem (on quotienting by the kernel
4188 * ZF/Simplifier: install second copy of type solver that actually
4189 makes use of TC rules declared to Isar proof contexts (or locales);
4190 the old version is still required for ML proof scripts.
4195 * Converted to Isar theory format; use locales instead of axiomatic
4201 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4204 * Pure/library.ML no longer defines its own option datatype, but uses
4205 that of the SML basis, which has constructors NONE and SOME instead of
4206 None and Some, as well as exception Option.Option instead of OPTION.
4207 The functions the, if_none, is_some, is_none have been adapted
4208 accordingly, while Option.map replaces apsome.
4210 * Pure/library.ML: the exception LIST has been given up in favour of
4211 the standard exceptions Empty and Subscript, as well as
4212 Library.UnequalLengths. Function like Library.hd and Library.tl are
4213 superseded by the standard hd and tl functions etc.
4215 A number of basic list functions are no longer exported to the ML
4216 toplevel, as they are variants of predefined functions. The following
4217 suggests how one can translate existing code:
4219 rev_append xs ys = List.revAppend (xs, ys)
4220 nth_elem (i, xs) = List.nth (xs, i)
4221 last_elem xs = List.last xs
4222 flat xss = List.concat xss
4223 seq fs = List.app fs
4224 partition P xs = List.partition P xs
4225 mapfilter f xs = List.mapPartial f xs
4227 * Pure/library.ML: several combinators for linear functional
4228 transformations, notably reverse application and composition:
4231 (x, y) |-> f f #-> g
4233 * Pure/library.ML: introduced/changed precedence of infix operators:
4235 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4237 infix 3 o oo ooo oooo;
4238 infix 4 ~~ upto downto;
4240 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4243 * Pure/library.ML: natural list combinators fold, fold_rev, and
4244 fold_map support linear functional transformations and nesting. For
4247 fold f [x1, ..., xN] y =
4248 y |> f x1 |> ... |> f xN
4250 (fold o fold) f [xs1, ..., xsN] y =
4251 y |> fold f xs1 |> ... |> fold f xsN
4253 fold f [x1, ..., xN] =
4256 (fold o fold) f [xs1, ..., xsN] =
4257 fold f xs1 #> ... #> fold f xsN
4259 * Pure/library.ML: the following selectors on type 'a option are
4262 the: 'a option -> 'a (*partial*)
4263 these: 'a option -> 'a where 'a = 'b list
4264 the_default: 'a -> 'a option -> 'a
4265 the_list: 'a option -> 'a list
4267 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4268 basic operations for association lists, following natural argument
4269 order; moreover the explicit equality predicate passed here avoids
4270 potentially expensive polymorphic runtime equality checks.
4271 The old functions may be expressed as follows:
4273 assoc = uncurry (AList.lookup (op =))
4274 assocs = these oo AList.lookup (op =)
4275 overwrite = uncurry (AList.update (op =)) o swap
4277 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4279 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4280 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4282 replacing make_keylist and keyfilter (occassionally used)
4285 make_keylist = AList.make
4286 keyfilter = AList.find (op =)
4288 * eq_fst and eq_snd now take explicit equality parameter, thus
4289 avoiding eqtypes. Naive rewrites:
4291 eq_fst = eq_fst (op =)
4292 eq_snd = eq_snd (op =)
4294 * Removed deprecated apl and apr (rarely used).
4297 apl (n, op) =>>= curry op n
4298 apr (op, m) =>>= fn n => op (n, m)
4300 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4301 provides a reasonably efficient light-weight implementation of sets as
4304 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4305 few new operations; existing lookup and update are now curried to
4306 follow natural argument order (for use with fold etc.);
4307 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4309 * Pure/General: output via the Isabelle channels of
4310 writeln/warning/error etc. is now passed through Output.output, with a
4311 hook for arbitrary transformations depending on the print_mode
4312 (cf. Output.add_mode -- the first active mode that provides a output
4313 function wins). Already formatted output may be embedded into further
4314 text via Output.raw; the result of Pretty.string_of/str_of and derived
4315 functions (string_of_term/cterm/thm etc.) is already marked raw to
4316 accommodate easy composition of diagnostic messages etc. Programmers
4317 rarely need to care about Output.output or Output.raw at all, with
4318 some notable exceptions: Output.output is required when bypassing the
4319 standard channels (writeln etc.), or in token translations to produce
4320 properly formatted results; Output.raw is required when capturing
4321 already output material that will eventually be presented to the user
4322 a second time. For the default print mode, both Output.output and
4323 Output.raw have no effect.
4325 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4326 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4327 cumulative results are displayed at the end of a batch session.
4329 * Pure/General: File.sysify_path and File.quote_sysify path have been
4330 replaced by File.platform_path and File.shell_path (with appropriate
4331 hooks). This provides a clean interface for unusual systems where the
4332 internal and external process view of file names are different.
4334 * Pure: more efficient orders for basic syntactic entities: added
4335 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4336 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4337 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4338 orders now -- potential INCOMPATIBILITY for code that depends on a
4339 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4340 Library.sort_strings on result).
4342 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4343 fold_types traverse types/terms from left to right, observing natural
4344 argument order. Supersedes previous foldl_XXX versions, add_frees,
4345 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4347 * Pure: name spaces have been refined, with significant changes of the
4348 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4349 to extern(_table). The plain name entry path is superseded by a
4350 general 'naming' context, which also includes the 'policy' to produce
4351 a fully qualified name and external accesses of a fully qualified
4352 name; NameSpace.extend is superseded by context dependent
4353 Sign.declare_name. Several theory and proof context operations modify
4354 the naming context. Especially note Theory.restore_naming and
4355 ProofContext.restore_naming to get back to a sane state; note that
4356 Theory.add_path is no longer sufficient to recover from
4357 Theory.absolute_path in particular.
4359 * Pure: new flags short_names (default false) and unique_names
4360 (default true) for controlling output of qualified names. If
4361 short_names is set, names are printed unqualified. If unique_names is
4362 reset, the name prefix is reduced to the minimum required to achieve
4363 the original result when interning again, even if there is an overlap
4364 with earlier declarations.
4366 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4367 now 'extend', and 'merge' gets an additional Pretty.pp argument
4368 (useful for printing error messages). INCOMPATIBILITY.
4370 * Pure: major reorganization of the theory context. Type Sign.sg and
4371 Theory.theory are now identified, referring to the universal
4372 Context.theory (see Pure/context.ML). Actual signature and theory
4373 content is managed as theory data. The old code and interfaces were
4374 spread over many files and structures; the new arrangement introduces
4375 considerable INCOMPATIBILITY to gain more clarity:
4377 Context -- theory management operations (name, identity, inclusion,
4378 parents, ancestors, merge, etc.), plus generic theory data;
4380 Sign -- logical signature and syntax operations (declaring consts,
4381 types, etc.), plus certify/read for common entities;
4383 Theory -- logical theory operations (stating axioms, definitions,
4384 oracles), plus a copy of logical signature operations (consts,
4385 types, etc.); also a few basic management operations (Theory.copy,
4388 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4389 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4390 for convenience -- they merely return the theory.
4392 * Pure: type Type.tsig is superseded by theory in most interfaces.
4394 * Pure: the Isar proof context type is already defined early in Pure
4395 as Context.proof (note that ProofContext.context and Proof.context are
4396 aliases, where the latter is the preferred name). This enables other
4397 Isabelle components to refer to that type even before Isar is present.
4399 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4400 typeK, constK, axiomK, oracleK), but provide explicit operations for
4401 any of these kinds. For example, Sign.intern typeK is now
4402 Sign.intern_type, Theory.hide_space Sign.typeK is now
4403 Theory.hide_types. Also note that former
4404 Theory.hide_classes/types/consts are now
4405 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4406 internalize their arguments! INCOMPATIBILITY.
4408 * Pure: get_thm interface (of PureThy and ProofContext) expects
4409 datatype thmref (with constructors Name and NameSelection) instead of
4410 plain string -- INCOMPATIBILITY;
4412 * Pure: cases produced by proof methods specify options, where NONE
4413 means to remove case bindings -- INCOMPATIBILITY in
4416 * Pure: the following operations retrieve axioms or theorems from a
4417 theory node or theory hierarchy, respectively:
4419 Theory.axioms_of: theory -> (string * term) list
4420 Theory.all_axioms_of: theory -> (string * term) list
4421 PureThy.thms_of: theory -> (string * thm) list
4422 PureThy.all_thms_of: theory -> (string * thm) list
4424 * Pure: print_tac now outputs the goal through the trace channel.
4426 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4427 Reference Toplevel.debug (default false) controls detailed printing
4428 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4429 controls execution profiling -- set to 1 for time and 2 for space
4430 (both increase the runtime).
4432 * Isar session: The initial use of ROOT.ML is now always timed,
4433 i.e. the log will show the actual process times, in contrast to the
4434 elapsed wall-clock time that the outer shell wrapper produces.
4436 * Simplifier: improved handling of bound variables (nameless
4437 representation, avoid allocating new strings). Simprocs that invoke
4438 the Simplifier recursively should use Simplifier.inherit_bounds to
4439 avoid local name clashes. Failure to do so produces warnings
4440 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4441 for further details.
4443 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4444 bindings for all theorems stored within a given theory; this may help
4445 in porting non-Isar theories to Isar ones, while keeping ML proof
4446 scripts for the time being.
4448 * ML operator HTML.with_charset specifies the charset begin used for
4449 generated HTML files. For example:
4451 HTML.with_charset "utf-8" use_thy "Hebrew";
4452 HTML.with_charset "utf-8" use_thy "Chinese";
4457 * Allow symlinks to all proper Isabelle executables (Isabelle,
4458 isabelle, isatool etc.).
4460 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4461 isatool doc, isatool mkdir, display_drafts etc.).
4463 * isatool usedir: option -f allows specification of the ML file to be
4464 used by Isabelle; default is ROOT.ML.
4466 * New isatool version outputs the version identifier of the Isabelle
4467 distribution being used.
4469 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4470 (containing Boolean satisfiability problems) into Isabelle/HOL
4475 New in Isabelle2004 (April 2004)
4476 --------------------------------
4480 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4481 Replaces linorder.ML.
4483 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4484 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4485 (\<a>...\<z>), are now considered normal letters, and can therefore
4486 be used anywhere where an ASCII letter (a...zA...Z) has until
4487 now. COMPATIBILITY: This obviously changes the parsing of some
4488 terms, especially where a symbol has been used as a binder, say
4489 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4490 as an identifier. Fix it by inserting a space around former
4491 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4492 existing theory and ML files.
4494 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4496 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4497 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4498 a normal (but invisible) letter. For multiple letter subscripts repeat
4499 \<^isub> like this: x\<^isub>1\<^isub>2.
4501 * Pure: There are now sub-/superscripts that can span more than one
4502 character. Text between \<^bsub> and \<^esub> is set in subscript in
4503 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4504 superscript. The new control characters are not identifier parts.
4506 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4507 content of "..." to the latex file instead of \isacntrl... . The "..."
4508 may consist of any printable characters excluding the end bracket >.
4510 * Pure: Using new Isar command "finalconsts" (or the ML functions
4511 Theory.add_finals or Theory.add_finals_i) it is now possible to
4512 declare constants "final", which prevents their being given a definition
4513 later. It is useful for constants whose behaviour is fixed axiomatically
4514 rather than definitionally, such as the meta-logic connectives.
4516 * Pure: 'instance' now handles general arities with general sorts
4517 (i.e. intersections of classes),
4519 * Presentation: generated HTML now uses a CSS style sheet to make layout
4520 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4521 It can be changed to alter the colors/layout of generated pages.
4526 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4527 cut_tac, subgoal_tac and thin_tac:
4528 - Now understand static (Isar) contexts. As a consequence, users of Isar
4529 locales are no longer forced to write Isar proof scripts.
4530 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4532 - INCOMPATIBILITY: names of variables to be instantiated may no
4533 longer be enclosed in quotes. Instead, precede variable name with `?'.
4534 This is consistent with the instantiation attribute "where".
4536 * Attributes "where" and "of":
4537 - Now take type variables of instantiated theorem into account when reading
4538 the instantiation string. This fixes a bug that caused instantiated
4539 theorems to have too special types in some circumstances.
4540 - "where" permits explicit instantiations of type variables.
4542 * Calculation commands "moreover" and "also" no longer interfere with
4543 current facts ("this"), admitting arbitrary combinations with "then"
4547 - Goal statements involving the context element "includes" no longer
4548 generate theorems with internal delta predicates (those ending on
4549 "_axioms") in the premise.
4550 Resolve particular premise with <locale>.intro to obtain old form.
4551 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4552 specification and "includes" elements in goal statement.
4553 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4554 [intro?] and [elim?] (respectively) by default.
4555 - Experimental command for instantiation of locales in proof contexts:
4556 instantiate <label>[<attrs>]: <loc>
4557 Instantiates locale <loc> and adds all its theorems to the current context
4558 taking into account their attributes. Label and attrs are optional
4559 modifiers, like in theorem declarations. If present, names of
4560 instantiated theorems are qualified with <label>, and the attributes
4561 <attrs> are applied after any attributes these theorems might have already.
4562 If the locale has assumptions, a chained fact of the form
4563 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4564 are derived. The command does not support old-style locales declared
4565 with "locale (open)".
4566 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4568 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4574 * Proof import: new image HOL4 contains the imported library from
4575 the HOL4 system with about 2500 theorems. It is imported by
4576 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4577 can be used like any other Isabelle image. See
4578 HOL/Import/HOL/README for more information.
4581 - Much improved handling of linear and partial orders.
4582 Reasoners for linear and partial orders are set up for type classes
4583 "linorder" and "order" respectively, and are added to the default simpset
4584 as solvers. This means that the simplifier can build transitivity chains
4585 to solve goals from the assumptions.
4586 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4587 of blast or auto after simplification become unnecessary because the goal
4588 is solved by simplification already.
4590 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4591 all proved in axiomatic type classes for semirings, rings and fields.
4594 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4595 now formalized using the Ring_and_Field theory mentioned above.
4596 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4597 than before, because now they are set up once in a generic manner.
4598 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4599 Look for the general versions in Ring_and_Field (and Power if they concern
4602 * Type "rat" of the rational numbers is now available in HOL-Complex.
4605 - Record types are now by default printed with their type abbreviation
4606 instead of the list of all field types. This can be configured via
4607 the reference "print_record_type_abbr".
4608 - Simproc "record_upd_simproc" for simplification of multiple updates added
4609 (not enabled by default).
4610 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4611 EX x. x = sel r to True (not enabled by default).
4612 - Tactic "record_split_simp_tac" to split and simplify records added.
4614 * 'specification' command added, allowing for definition by
4615 specification. There is also an 'ax_specification' command that
4616 introduces the new constants axiomatically.
4618 * arith(_tac) is now able to generate counterexamples for reals as well.
4620 * HOL-Algebra: new locale "ring" for non-commutative rings.
4622 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4623 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4625 * HOL-Matrix: a first theory for matrices in HOL with an application of
4626 matrix theory to linear programming.
4628 * Unions and Intersections:
4629 The latex output syntax of UN and INT has been changed
4630 from "\Union x \in A. B" to "\Union_{x \in A} B"
4631 i.e. the index formulae has become a subscript.
4632 Similarly for "\Union x. B", and for \Inter instead of \Union.
4634 * Unions and Intersections over Intervals:
4635 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4636 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4637 like in normal math, and corresponding versions for < and for intersection.
4639 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4640 lexicographic dictonary ordering has been added as "lexord".
4642 * ML: the legacy theory structures Int and List have been removed. They had
4643 conflicted with ML Basis Library structures having the same names.
4645 * 'refute' command added to search for (finite) countermodels. Only works
4646 for a fragment of HOL. The installation of an external SAT solver is
4647 highly recommended. See "HOL/Refute.thy" for details.
4649 * 'quickcheck' command: Allows to find counterexamples by evaluating
4650 formulae under an assignment of free variables to random values.
4651 In contrast to 'refute', it can deal with inductive datatypes,
4652 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4658 * Streams now come with concatenation and are part of the HOLCF image
4662 New in Isabelle2003 (May 2003)
4663 ------------------------------
4667 * Provers/simplifier:
4669 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4670 Assumptions are now subject to complete mutual simplification,
4671 not just from left to right. The simplifier now preserves
4672 the order of assumptions.
4674 Potential INCOMPATIBILITY:
4676 -- simp sometimes diverges where the old version did
4677 not, e.g. invoking simp on the goal
4679 [| P (f x); y = x; f x = f y |] ==> Q
4681 now gives rise to the infinite reduction sequence
4683 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4685 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4688 -- Tactics combining classical reasoner and simplification (such as auto)
4689 are also affected by this change, because many of them rely on
4690 simp. They may sometimes diverge as well or yield a different numbers
4691 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4692 in case of problems. Sometimes subsequent calls to the classical
4693 reasoner will fail because a preceeding call to the simplifier too
4694 eagerly simplified the goal, e.g. deleted redundant premises.
4696 - The simplifier trace now shows the names of the applied rewrite rules
4698 - You can limit the number of recursive invocations of the simplifier
4699 during conditional rewriting (where the simplifie tries to solve the
4700 conditions before applying the rewrite rule):
4701 ML "simp_depth_limit := n"
4702 where n is an integer. Thus you can force termination where previously
4703 the simplifier would diverge.
4705 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4707 - No longer aborts on failed congruence proof. Instead, the
4708 congruence is ignored.
4710 * Pure: New generic framework for extracting programs from constructive
4711 proofs. See HOL/Extraction.thy for an example instantiation, as well
4712 as HOL/Extraction for some case studies.
4714 * Pure: The main goal of the proof state is no longer shown by default, only
4715 the subgoals. This behaviour is controlled by a new flag.
4716 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4717 (ML: Proof.show_main_goal).
4719 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4720 rules whose conclusion matches subgoal 1:
4721 PG menu: Isabelle/Isar -> Show me -> matching rules
4722 The rules are ordered by how closely they match the subgoal.
4723 In particular, rules that solve a subgoal outright are displayed first
4724 (or rather last, the way they are printed).
4725 (ML: ProofGeneral.print_intros())
4727 * Pure: New flag trace_unify_fail causes unification to print
4728 diagnostic information (PG: in trace buffer) when it fails. This is
4729 useful for figuring out why single step proofs like rule, erule or
4732 * Pure: Locale specifications now produce predicate definitions
4733 according to the body of text (covering assumptions modulo local
4734 definitions); predicate "loc_axioms" covers newly introduced text,
4735 while "loc" is cumulative wrt. all included locale expressions; the
4736 latter view is presented only on export into the global theory
4737 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4738 on the old view without predicates;
4740 * Pure: predefined locales "var" and "struct" are useful for sharing
4741 parameters (as in CASL, for example); just specify something like
4742 ``var x + var y + struct M'' as import;
4744 * Pure: improved thms_containing: proper indexing of facts instead of
4745 raw theorems; check validity of results wrt. current name space;
4746 include local facts of proof configuration (also covers active
4747 locales), cover fixed variables in index; may use "_" in term
4748 specification; an optional limit for the number of printed facts may
4749 be given (the default is 40);
4751 * Pure: disallow duplicate fact bindings within new-style theory files
4754 * Provers: improved induct method: assumptions introduced by case
4755 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4756 the goal statement); "foo" still refers to all facts collectively;
4758 * Provers: the function blast.overloaded has been removed: all constants
4759 are regarded as potentially overloaded, which improves robustness in exchange
4760 for slight decrease in efficiency;
4762 * Provers/linorder: New generic prover for transitivity reasoning over
4763 linear orders. Note: this prover is not efficient!
4765 * Isar: preview of problems to finish 'show' now produce an error
4766 rather than just a warning (in interactive mode);
4773 - Produces a counter example if it cannot prove a goal.
4774 Note that the counter example may be spurious if the goal is not a formula
4775 of quantifier-free linear arithmetic.
4776 In ProofGeneral the counter example appears in the trace buffer.
4778 - Knows about div k and mod k where k is a numeral of type nat or int.
4780 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4781 linear arithmetic fails. This takes account of quantifiers and divisibility.
4782 Presburger arithmetic can also be called explicitly via presburger(_tac).
4784 * simp's arithmetic capabilities have been enhanced a bit: it now
4785 takes ~= in premises into account (by performing a case split);
4787 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4788 are distributed over a sum of terms;
4790 * New tactic "trans_tac" and method "trans" instantiate
4791 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4794 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4795 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4797 * 'typedef' command has new option "open" to suppress the set
4800 * functions Min and Max on finite sets have been introduced (theory
4803 * attribute [symmetric] now works for relations as well; it turns
4804 (x,y) : R^-1 into (y,x) : R, and vice versa;
4806 * induct over a !!-quantified statement (say !!x1..xn):
4807 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4809 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4810 %x. None. Warning: empty_def now refers to the previously hidden definition
4813 * Algebra: formalization of classical algebra. Intended as base for
4814 any algebraic development in Isabelle. Currently covers group theory
4815 (up to Sylow's theorem) and ring theory (Universal Property of
4816 Univariate Polynomials). Contributions welcome;
4818 * GroupTheory: deleted, since its material has been moved to Algebra;
4820 * Complex: new directory of the complex numbers with numeric constants,
4821 nonstandard complex numbers, and some complex analysis, standard and
4822 nonstandard (Jacques Fleuriot);
4824 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4826 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4829 * Real/HahnBanach: updated and adapted to locales;
4831 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4834 * UNITY: added the Meier-Sanders theory of progress sets;
4836 * MicroJava: bytecode verifier and lightweight bytecode verifier
4837 as abstract algorithms, instantiated to the JVM;
4839 * Bali: Java source language formalization. Type system, operational
4840 semantics, axiomatic semantics. Supported language features:
4841 classes, interfaces, objects,virtual methods, static methods,
4842 static/instance fields, arrays, access modifiers, definite
4843 assignment, exceptions.
4848 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4851 * Main ZF: virtually all theories converted to new-style format;
4856 * Pure: Tactic.prove provides sane interface for internal proofs;
4857 omits the infamous "standard" operation, so this is more appropriate
4858 than prove_goalw_cterm in many situations (e.g. in simprocs);
4860 * Pure: improved error reporting of simprocs;
4862 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4866 *** Document preparation ***
4868 * uses \par instead of \\ for line breaks in theory text. This may
4869 shift some page breaks in large documents. To get the old behaviour
4870 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4872 * minimized dependencies of isabelle.sty and isabellesym.sty on
4875 * \<euro> now needs package babel/greek instead of marvosym (which
4878 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4883 New in Isabelle2002 (March 2002)
4884 --------------------------------
4886 *** Document preparation ***
4888 * greatly simplified document preparation setup, including more
4889 graceful interpretation of isatool usedir -i/-d/-D options, and more
4890 instructive isatool mkdir; users should basically be able to get
4891 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4892 users may run a separate document processing stage manually like this:
4893 "isatool usedir -D output HOL Test && isatool document Test/output";
4895 * theory dependency graph may now be incorporated into documents;
4896 isatool usedir -g true will produce session_graph.eps/.pdf for use
4897 with \includegraphics of LaTeX;
4899 * proper spacing of consecutive markup elements, especially text
4900 blocks after section headings;
4902 * support bold style (for single symbols only), input syntax is like
4903 this: "\<^bold>\<alpha>" or "\<^bold>A";
4905 * \<bullet> is now output as bold \cdot by default, which looks much
4906 better in printed text;
4908 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4909 note that these symbols are currently unavailable in Proof General /
4910 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4912 * isatool latex no longer depends on changed TEXINPUTS, instead
4913 isatool document copies the Isabelle style files to the target
4919 * Pure/Provers: improved proof by cases and induction;
4920 - 'case' command admits impromptu naming of parameters (such as
4922 - 'induct' method divinates rule instantiation from the inductive
4923 claim; no longer requires excessive ?P bindings for proper
4924 instantiation of cases;
4925 - 'induct' method properly enumerates all possibilities of set/type
4926 rules; as a consequence facts may be also passed through *type*
4927 rules without further ado;
4928 - 'induct' method now derives symbolic cases from the *rulified*
4929 rule (before it used to rulify cases stemming from the internal
4930 atomized version); this means that the context of a non-atomic
4931 statement becomes is included in the hypothesis, avoiding the
4932 slightly cumbersome show "PROP ?case" form;
4933 - 'induct' may now use elim-style induction rules without chaining
4934 facts, using ``missing'' premises from the goal state; this allows
4935 rules stemming from inductive sets to be applied in unstructured
4936 scripts, while still benefitting from proper handling of non-atomic
4937 statements; NB: major inductive premises need to be put first, all
4938 the rest of the goal is passed through the induction;
4939 - 'induct' proper support for mutual induction involving non-atomic
4940 rule statements (uses the new concept of simultaneous goals, see
4942 - append all possible rule selections, but only use the first
4943 success (no backtracking);
4944 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4945 - undeclared rule case names default to numbers 1, 2, 3, ...;
4946 - added 'print_induct_rules' (covered by help item in recent Proof
4948 - moved induct/cases attributes to Pure, methods to Provers;
4949 - generic method setup instantiated for FOL and HOL;
4951 * Pure: support multiple simultaneous goal statements, for example
4952 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4953 meta-level mechanism, this acts as if several individual goals had
4954 been stated separately; in particular common proof methods need to be
4955 repeated in order to cover all claims; note that a single elimination
4956 step is *not* sufficient to establish the two conjunctions, so this
4959 assume "A & B" then have A and B .. (*".." fails*)
4961 better use "obtain" in situations as above; alternative refer to
4962 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4964 * Pure: proper integration with ``locales''; unlike the original
4965 version by Florian Kammller, Isar locales package high-level proof
4966 contexts rather than raw logical ones (e.g. we admit to include
4967 attributes everywhere); operations on locales include merge and
4968 rename; support for implicit arguments (``structures''); simultaneous
4969 type-inference over imports and text; see also HOL/ex/Locales.thy for
4972 * Pure: the following commands have been ``localized'', supporting a
4973 target locale specification "(in name)": 'lemma', 'theorem',
4974 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4975 stored both within the locale and at the theory level (exported and
4976 qualified by the locale name);
4978 * Pure: theory goals may now be specified in ``long'' form, with
4979 ad-hoc contexts consisting of arbitrary locale elements. for example
4980 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4981 definitions may be given, too); the result is a meta-level rule with
4982 the context elements being discharged in the obvious way;
4984 * Pure: new proof command 'using' allows to augment currently used
4985 facts after a goal statement ('using' is syntactically analogous to
4986 'apply', but acts on the goal's facts only); this allows chained facts
4987 to be separated into parts given before and after a claim, as in
4988 ``from a and b have C using d and e <proof>'';
4990 * Pure: renamed "antecedent" case to "rule_context";
4992 * Pure: new 'judgment' command records explicit information about the
4993 object-logic embedding (used by several tools internally); no longer
4994 use hard-wired "Trueprop";
4996 * Pure: added 'corollary' command;
4998 * Pure: fixed 'token_translation' command;
5000 * Pure: removed obsolete 'exported' attribute;
5002 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5003 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5004 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5006 * Pure: method 'atomize' presents local goal premises as object-level
5007 statements (atomic meta-level propositions); setup controlled via
5008 rewrite rules declarations of 'atomize' attribute; example
5009 application: 'induct' method with proper rule statements in improper
5012 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5013 now consider the syntactic context of assumptions, giving a better
5014 chance to get type-inference of the arguments right (this is
5015 especially important for locales);
5017 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5020 * Pure/obtain: the formal conclusion "thesis", being marked as
5021 ``internal'', may no longer be reference directly in the text;
5022 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5025 * Pure: generic 'sym' attribute which declares a rule both as pure
5026 'elim?' and for the 'symmetric' operation;
5028 * Pure: marginal comments ``--'' may now occur just anywhere in the
5029 text; the fixed correlation with particular command syntax has been
5032 * Pure: new method 'rules' is particularly well-suited for proof
5033 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5034 but often produces more compact proof terms with less detours;
5036 * Pure/Provers/classical: simplified integration with pure rule
5037 attributes and methods; the classical "intro?/elim?/dest?"
5038 declarations coincide with the pure ones; the "rule" method no longer
5039 includes classically swapped intros; "intro" and "elim" methods no
5040 longer pick rules from the context; also got rid of ML declarations
5041 AddXIs/AddXEs/AddXDs; all of this has some potential for
5044 * Provers/classical: attribute 'swapped' produces classical inversions
5045 of introduction rules;
5047 * Provers/simplifier: 'simplified' attribute may refer to explicit
5048 rules instead of full simplifier context; 'iff' attribute handles
5051 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5053 * HOL: 'recdef' now fails on unfinished automated proofs, use
5054 "(permissive)" option to recover old behavior;
5056 * HOL: 'inductive' no longer features separate (collective) attributes
5057 for 'intros' (was found too confusing);
5059 * HOL: properly declared induction rules less_induct and
5065 * HOL: moved over to sane numeral syntax; the new policy is as
5068 - 0 and 1 are polymorphic constants, which are defined on any
5069 numeric type (nat, int, real etc.);
5071 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5072 binary representation internally;
5074 - type nat has special constructor Suc, and generally prefers Suc 0
5075 over 1::nat and Suc (Suc 0) over 2::nat;
5077 This change may cause significant problems of INCOMPATIBILITY; here
5078 are some hints on converting existing sources:
5080 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5081 entities, so expressions involving "-" (unary or binary minus) need
5082 to be spaced properly;
5084 - existing occurrences of "1" may need to be constraint "1::nat" or
5085 even replaced by Suc 0; similar for old "2";
5087 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5089 - remove all special provisions on numerals in proofs;
5091 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5092 representation (depends on bin_arith_simps in the default context);
5094 * HOL: symbolic syntax for x^2 (numeral 2);
5096 * HOL: the class of all HOL types is now called "type" rather than
5097 "term"; INCOMPATIBILITY, need to adapt references to this type class
5098 in axclass/classes, instance/arities, and (usually rare) occurrences
5099 in typings (of consts etc.); internally the class is called
5100 "HOL.type", ML programs should refer to HOLogic.typeS;
5102 * HOL/record package improvements:
5103 - new derived operations "fields" to build a partial record section,
5104 "extend" to promote a fixed record to a record scheme, and
5105 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5106 declared as simp by default;
5107 - shared operations ("more", "fields", etc.) now need to be always
5108 qualified) --- potential INCOMPATIBILITY;
5109 - removed "make_scheme" operations (use "make" with "extend") --
5111 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5112 - provides cases/induct rules for use with corresponding Isar
5113 methods (for concrete records, record schemes, concrete more
5114 parts, and schematic more parts -- in that order);
5115 - internal definitions directly based on a light-weight abstract
5116 theory of product types over typedef rather than datatype;
5118 * HOL: generic code generator for generating executable ML code from
5119 specifications; specific support for HOL constructs such as inductive
5120 datatypes and sets, as well as recursive functions; can be invoked
5121 via 'generate_code' theory section;
5123 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5125 * HOL: consolidated and renamed several theories. In particular:
5126 Ord.thy has been absorbed into HOL.thy
5127 String.thy has been absorbed into List.thy
5129 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5130 (beware of argument permutation!);
5132 * HOL: linorder_less_split superseded by linorder_cases;
5134 * HOL/List: "nodups" renamed to "distinct";
5136 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5137 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5138 - Ex_def has changed, now need to use some_eq_ex
5140 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5141 in this (rare) case use:
5143 delSWrapper "split_all_tac"
5144 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5146 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5149 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5150 Isabelle's type classes, ^ on functions and relations has too general
5151 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5152 necessary to attach explicit type constraints;
5154 * HOL/Relation: the prefix name of the infix "O" has been changed from
5155 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5156 renamed accordingly (eg "compI" -> "rel_compI").
5158 * HOL: syntax translations now work properly with numerals and records
5161 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5162 of "lam" -- INCOMPATIBILITY;
5164 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5165 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5166 renamed "Product_Type.unit";
5168 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5170 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5171 the "cases" method);
5173 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5176 * HOL/IMP: updated and converted to new-style theory format; several
5177 parts turned into readable document, with proper Isar proof texts and
5178 some explanations (by Gerwin Klein);
5180 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5182 * HOL-Hyperreal is now a logic image;
5187 * Isar: consts/constdefs supports mixfix syntax for continuous
5190 * Isar: domain package adapted to new-style theory format, e.g. see
5193 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5194 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5195 lift.induct_tac, always use UU instead of Undef;
5197 * HOLCF/IMP: updated and converted to new-style theory;
5202 * Isar: proper integration of logic-specific tools and packages,
5203 including theory commands '(co)inductive', '(co)datatype',
5204 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5205 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5207 * theory Main no longer includes AC; for the Axiom of Choice, base
5208 your theory on Main_ZFC;
5210 * the integer library now covers quotients and remainders, with many
5211 laws relating division to addition, multiplication, etc.;
5213 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5214 typeless version of the formalism;
5216 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5219 * ZF/Induct: new directory for examples of inductive definitions,
5220 including theory Multiset for multiset orderings; converted to
5221 new-style theory format;
5223 * ZF: many new theorems about lists, ordinals, etc.;
5228 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5229 variable proof controls level of detail: 0 = no proofs (only oracle
5230 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5231 also ref manual for further ML interfaces;
5233 * Pure/axclass: removed obsolete ML interface
5234 goal_subclass/goal_arity;
5236 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5237 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5238 separate tokens, so expressions involving minus need to be spaced
5241 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5242 rather than "infixl" or "infixr";
5244 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5245 sort constraint specifications in type inference; e.g. "x::_::foo"
5246 ensures that the type of "x" is of sort "foo" (but not necessarily a
5249 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5250 control output of nested => (types); the default behavior is
5253 * Pure/syntax: builtin parse translation for "_constify" turns valued
5254 tokens into AST constants;
5256 * Pure/syntax: prefer later declarations of translations and print
5257 translation functions; potential INCOMPATIBILITY: need to reverse
5258 multiple declarations for same syntax element constant;
5260 * Pure/show_hyps reset by default (in accordance to existing Isar
5263 * Provers/classical: renamed addaltern to addafter, addSaltern to
5266 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5269 * system: tested support for MacOS X; should be able to get Isabelle +
5270 Proof General to work in a plain Terminal after installing Poly/ML
5271 (e.g. from the Isabelle distribution area) and GNU bash alone
5272 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5273 support requires further installations, e.g. from
5274 http://fink.sourceforge.net/);
5276 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5278 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5279 of 40 MB), cf. ML_OPTIONS;
5281 * system: Proof General keywords specification is now part of the
5282 Isabelle distribution (see etc/isar-keywords.el);
5284 * system: support for persistent Proof General sessions (refrain from
5285 outdating all loaded theories on startup); user may create writable
5286 logic images like this: ``isabelle -q HOL Test'';
5288 * system: smart selection of Isabelle process versus Isabelle
5289 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5290 run both "isabelle" and "Isabelle" even if file names are badly
5291 damaged (executable inspects the case of the first letter of its own
5292 name); added separate "isabelle-process" and "isabelle-interface";
5294 * system: refrain from any attempt at filtering input streams; no
5295 longer support ``8bit'' encoding of old isabelle font, instead proper
5296 iso-latin characters may now be used; the related isatools
5297 "symbolinput" and "nonascii" have disappeared as well;
5299 * system: removed old "xterm" interface (the print modes "xterm" and
5300 "xterm_color" are still available for direct use in a suitable
5305 New in Isabelle99-2 (February 2001)
5306 -----------------------------------
5308 *** Overview of INCOMPATIBILITIES ***
5310 * HOL: please note that theories in the Library and elsewhere often use the
5311 new-style (Isar) format; to refer to their theorems in an ML script you must
5312 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5314 * HOL: inductive package no longer splits induction rule aggressively,
5315 but only as far as specified by the introductions given; the old
5316 format may be recovered via ML function complete_split_rule or attribute
5317 'split_rule (complete)';
5319 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5320 gfp_Tarski to gfp_unfold;
5322 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5324 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5325 relation); infix "^^" has been renamed "``"; infix "``" has been
5326 renamed "`"; "univalent" has been renamed "single_valued";
5328 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5331 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5333 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5335 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5336 consequence, it is no longer monotonic wrt. the local goal context
5337 (which is now passed through the inductive cases);
5339 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5340 \<gg> to \<ggreater>;
5343 *** Document preparation ***
5345 * \isabellestyle{NAME} selects version of Isabelle output (currently
5346 available: are "it" for near math-mode best-style output, "sl" for
5347 slanted text style, and "tt" for plain type-writer; if no
5348 \isabellestyle command is given, output is according to slanted
5351 * support sub/super scripts (for single symbols only), input syntax is
5352 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5354 * some more standard symbols; see Appendix A of the system manual for
5355 the complete list of symbols defined in isabellesym.sty;
5357 * improved isabelle style files; more abstract symbol implementation
5358 (should now use \isamath{...} and \isatext{...} in custom symbol
5361 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5362 state; Note that presentation of goal states does not conform to
5363 actual human-readable proof documents. Please do not include goal
5364 states into document output unless you really know what you are doing!
5366 * proper indentation of antiquoted output with proportional LaTeX
5369 * no_document ML operator temporarily disables LaTeX document
5372 * isatool unsymbolize tunes sources for plain ASCII communication;
5377 * Pure: Isar now suffers initial goal statements to contain unbound
5378 schematic variables (this does not conform to actual readable proof
5379 documents, due to unpredictable outcome and non-compositional proof
5380 checking); users who know what they are doing may use schematic goals
5381 for Prolog-style synthesis of proven results;
5383 * Pure: assumption method (an implicit finishing) now handles actual
5386 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5387 initial goal, declare "that" only as Pure intro (only for single
5388 steps); the "that" rule assumption may now be involved in implicit
5389 finishing, thus ".." becomes a feasible for trivial obtains;
5391 * Pure: default proof step now includes 'intro_classes'; thus trivial
5392 instance proofs may be performed by "..";
5394 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5397 * Pure: more robust selection of calculational rules;
5399 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5400 rule (as well as the assumption rule);
5402 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5403 lemmas, using the graph browser tool;
5405 * Pure: predict failure of "show" in interactive mode;
5407 * Pure: 'thms_containing' now takes actual terms as arguments;
5409 * HOL: improved method 'induct' --- now handles non-atomic goals
5410 (potential INCOMPATIBILITY); tuned error handling;
5412 * HOL: cases and induct rules now provide explicit hints about the
5413 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5414 any remaining facts are inserted into the goal verbatim;
5416 * HOL: local contexts (aka cases) may now contain term bindings as
5417 well; the 'cases' and 'induct' methods new provide a ?case binding for
5418 the result to be shown in each case;
5420 * HOL: added 'recdef_tc' command;
5422 * isatool convert assists in eliminating legacy ML scripts;
5427 * HOL/Library: a collection of generic theories to be used together
5428 with main HOL; the theory loader path already includes this directory
5429 by default; the following existing theories have been moved here:
5430 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5431 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5433 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5434 modelling and verification task performed in Isabelle/HOL +
5435 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5437 * HOL/Algebra: special summation operator SUM no longer exists, it has
5438 been replaced by setsum; infix 'assoc' now has priority 50 (like
5439 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5440 'domain', this makes the theory consistent with mathematical
5443 * HOL basics: added overloaded operations "inverse" and "divide"
5444 (infix "/"), syntax for generic "abs" operation, generic summation
5447 * HOL/typedef: simplified package, provide more useful rules (see also
5450 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5451 now expressed as a proper nested rule (old-style tactic scripts may
5452 require atomize_strip_tac to cope with non-atomic premises);
5454 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5455 to "split_conv" (old name still available for compatibility);
5457 * HOL: improved concrete syntax for strings (e.g. allows translation
5458 rules with string literals);
5460 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5461 and Fleuriot's mechanization of analysis, including the transcendental
5462 functions for the reals;
5464 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5469 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5470 "lam" is displayed as TWO lambda-symbols
5472 * CTT: theory Main now available, containing everything (that is, Bool
5478 * Pure: the Simplifier has been implemented properly as a derived rule
5479 outside of the actual kernel (at last!); the overall performance
5480 penalty in practical applications is about 50%, while reliability of
5481 the Isabelle inference kernel has been greatly improved;
5483 * print modes "brackets" and "no_brackets" control output of nested =>
5484 (types) and ==> (props); the default behaviour is "brackets";
5486 * Provers: fast_tac (and friends) now handle actual object-logic rules
5487 as assumptions as well;
5489 * system: support Poly/ML 4.0;
5491 * system: isatool install handles KDE version 1 or 2;
5495 New in Isabelle99-1 (October 2000)
5496 ----------------------------------
5498 *** Overview of INCOMPATIBILITIES ***
5500 * HOL: simplification of natural numbers is much changed; to partly
5501 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5502 issue the following ML commands:
5504 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5505 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5507 * HOL: simplification no longer dives into case-expressions; this is
5508 controlled by "t.weak_case_cong" for each datatype t;
5510 * HOL: nat_less_induct renamed to less_induct;
5512 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5513 fixsome to patch .thy and .ML sources automatically;
5515 select_equality -> some_equality
5516 select_eq_Ex -> some_eq_ex
5517 selectI2EX -> someI2_ex
5520 select1_equality -> some1_equality
5521 Eps_sym_eq -> some_sym_eq_trivial
5522 Eps_eq -> some_eq_trivial
5524 * HOL: exhaust_tac on datatypes superseded by new generic case_tac;
5526 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5529 * HOL: the recursion equations generated by 'recdef' are now called
5530 f.simps instead of f.rules;
5532 * HOL: qed_spec_mp now also handles bounded ALL as well;
5534 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5535 sometimes be needed;
5537 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5539 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5541 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5542 product is now "<*>" instead of "Times"; the lexicographic product is
5543 now "<*lex*>" instead of "**";
5545 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5546 of main HOL, but was unused); better use HOL's datatype package;
5548 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5549 the old syntax may be recovered as follows:
5552 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5553 (infixl "\\<oplus>" 100)
5555 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5557 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5558 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5561 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5562 changed from A/r to A//r;
5564 * ZF: new treatment of arithmetic (nat & int) may break some old
5567 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5568 rulify -> rule_format, elimify -> elim_format, ...);
5570 * Isar/Provers: intro/elim/dest attributes changed; renamed
5571 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5572 should have to change intro!! to intro? only); replaced "delrule" by
5575 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5577 * Provers: strengthened force_tac by using new first_best_tac;
5579 * LaTeX document preparation: several changes of isabelle.sty (see
5583 *** Document preparation ***
5585 * formal comments (text blocks etc.) in new-style theories may now
5586 contain antiquotations of thm/prop/term/typ/text to be presented
5587 according to latex print mode; concrete syntax is like this:
5588 @{term[show_types] "f(x) = a + x"};
5590 * isatool mkdir provides easy setup of Isabelle session directories,
5591 including proper document sources;
5593 * generated LaTeX sources are now deleted after successful run
5594 (isatool document -c); may retain a copy somewhere else via -D option
5597 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5598 style files, achieving self-contained LaTeX sources and simplifying
5601 * old-style theories now produce (crude) LaTeX output as well;
5603 * browser info session directories are now self-contained (may be put
5604 on WWW server seperately); improved graphs of nested sessions; removed
5605 graph for 'all sessions';
5607 * several improvements in isabelle style files; \isabellestyle{it}
5608 produces fake math mode output; \isamarkupheader is now \section by
5609 default; see lib/texinputs/isabelle.sty etc.;
5614 * Isar/Pure: local results and corresponding term bindings are now
5615 subject to Hindley-Milner polymorphism (similar to ML); this
5616 accommodates incremental type-inference very nicely;
5618 * Isar/Pure: new derived language element 'obtain' supports
5619 generalized existence reasoning;
5621 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5622 support accumulation of results, without applying any rules yet;
5623 useful to collect intermediate results without explicit name
5624 references, and for use with transitivity rules with more than 2
5627 * Isar/Pure: scalable support for case-analysis type proofs: new
5628 'case' language element refers to local contexts symbolically, as
5629 produced by certain proof methods; internally, case names are attached
5630 to theorems as "tags";
5632 * Isar/Pure: theory command 'hide' removes declarations from
5633 class/type/const name spaces;
5635 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5636 indicate potential overloading;
5638 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5640 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5641 "{a,b,c}" instead of {a,b,c};
5643 * Isar/Pure now provides its own version of intro/elim/dest
5644 attributes; useful for building new logics, but beware of confusion
5645 with the version in Provers/classical;
5647 * Isar/Pure: the local context of (non-atomic) goals is provided via
5648 case name 'antecedent';
5650 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5651 to the current context is now done automatically);
5653 * Isar/Pure: theory command 'method_setup' provides a simple interface
5654 for definining proof methods in ML;
5656 * Isar/Provers: intro/elim/dest attributes changed; renamed
5657 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5658 most cases, one should have to change intro!! to intro? only);
5659 replaced "delrule" by "rule del";
5661 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5662 'symmetric' attribute (the latter supersedes [RS sym]);
5664 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5665 method modifier); 'simp' method: 'only:' modifier removes loopers as
5666 well (including splits);
5668 * Isar/Provers: Simplifier and Classical methods now support all kind
5669 of modifiers used in the past, including 'cong', 'iff', etc.
5671 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5672 of Simplifier and Classical reasoner);
5674 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5675 now support named cases; major packages (inductive, datatype, primrec,
5676 recdef) support case names and properly name parameters;
5678 * Isar/HOL: new transitivity rules for substitution in inequalities --
5679 monotonicity conditions are extracted to be proven at end of
5682 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5685 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5686 split_if split_if_asm; datatype package provides theorems foo.splits =
5687 foo.split foo.split_asm for each datatype;
5689 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5690 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5691 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5692 use "(cases (simplified))" method in proper proof texts);
5694 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5696 * Isar: names of theorems etc. may be natural numbers as well;
5698 * Isar: 'pr' command: optional arguments for goals_limit and
5699 ProofContext.prems_limit; no longer prints theory contexts, but only
5702 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5703 additional print modes to be specified; e.g. "pr(latex)" will print
5704 proof state according to the Isabelle LaTeX style;
5706 * Isar: improved support for emulating tactic scripts, including proof
5707 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5708 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5709 (for HOL datatypes);
5711 * Isar: simplified (more robust) goal selection of proof methods: 1st
5712 goal, all goals, or explicit goal specifier (tactic emulation); thus
5713 'proof method scripts' have to be in depth-first order;
5715 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5717 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5718 should instead use individual commands for printing items
5719 (print_commands, print_methods etc.);
5721 * Isar: added 'nothing' --- the empty list of theorems;
5726 * HOL/MicroJava: formalization of a fragment of Java, together with a
5727 corresponding virtual machine and a specification of its bytecode
5728 verifier and a lightweight bytecode verifier, including proofs of
5729 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5730 Cornelia Pusch (see also the homepage of project Bali at
5731 http://isabelle.in.tum.de/Bali/);
5733 * HOL/Algebra: new theory of rings and univariate polynomials, by
5736 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5737 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5740 * HOL/Lattice: fundamental concepts of lattice theory and order
5741 structures, including duals, properties of bounds versus algebraic
5742 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5743 Theorem for complete lattices etc.; may also serve as a demonstration
5744 for abstract algebraic reasoning using axiomatic type classes, and
5745 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5747 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5750 * HOL/IMPP: extension of IMP with local variables and mutually
5751 recursive procedures, by David von Oheimb;
5753 * HOL/Lambda: converted into new-style theory and document;
5755 * HOL/ex/Multiquote: example of multiple nested quotations and
5756 anti-quotations -- basically a generalized version of de-Bruijn
5757 representation; very useful in avoiding lifting of operations;
5759 * HOL/record: added general record equality rule to simpset; fixed
5760 select-update simplification procedure to handle extended records as
5761 well; admit "r" as field name;
5763 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5764 other numeric types and also as the identity of groups, rings, etc.;
5766 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5767 Types nat and int belong to this axclass;
5769 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5770 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5771 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5772 two terms #m*u and #n*u are replaced by #(m+n)*u
5773 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5774 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5775 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5777 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5778 powerful prover for predicate logic but knows nothing of clasets; see
5779 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5781 * HOL: new version of "case_tac" subsumes both boolean case split and
5782 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5783 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5785 * HOL: simplification no longer dives into case-expressions: only the
5786 selector expression is simplified, but not the remaining arms; to
5787 enable full simplification of case-expressions for datatype t, you may
5788 remove t.weak_case_cong from the simpset, either globally (Delcongs
5789 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5791 * HOL/recdef: the recursion equations generated by 'recdef' for
5792 function 'f' are now called f.simps instead of f.rules; if all
5793 termination conditions are proved automatically, these simplification
5794 rules are added to the simpset, as in primrec; rules may be named
5795 individually as well, resulting in a separate list of theorems for
5798 * HOL/While is a new theory that provides a while-combinator. It
5799 permits the definition of tail-recursive functions without the
5800 provision of a termination measure. The latter is necessary once the
5801 invariant proof rule for while is applied.
5803 * HOL: new (overloaded) notation for the set of elements below/above
5804 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5806 * HOL: theorems impI, allI, ballI bound as "strip";
5808 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5809 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5810 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5812 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5814 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5815 main HOL, but was unused);
5817 * HOL: fewer consts declared as global (e.g. have to refer to
5818 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5820 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5821 in case of overlap with user translations (e.g. judgements over
5822 tuples); (note that the underlying logical represenation is still
5828 * ZF: simplification automatically cancels common terms in arithmetic
5829 expressions over nat and int;
5831 * ZF: new treatment of nat to minimize type-checking: all operators
5832 coerce their operands to a natural number using the function natify,
5833 making the algebraic laws unconditional;
5835 * ZF: as above, for int: operators coerce their operands to an integer
5836 using the function intify;
5838 * ZF: the integer library now contains many of the usual laws for the
5839 orderings, including $<=, and monotonicity laws for $+ and $*;
5841 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5844 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5845 to the simplifier and classical reasoner simultaneously;
5850 * Provers: blast_tac now handles actual object-logic rules as
5851 assumptions; note that auto_tac uses blast_tac internally as well;
5853 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5854 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5856 * Provers: delrules now handles destruct rules as well (no longer need
5857 explicit make_elim);
5859 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5860 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5861 use instead the strong form,
5862 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5863 in HOL, FOL and ZF the function cla_make_elim will create such rules
5864 from destruct-rules;
5866 * Provers: Simplifier.easy_setup provides a fast path to basic
5867 Simplifier setup for new object-logics;
5869 * Pure: AST translation rules no longer require constant head on LHS;
5871 * Pure: improved name spaces: ambiguous output is qualified; support
5872 for hiding of names;
5874 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5875 XSYMBOL_HOME; no longer need to do manual configuration in most
5878 * system: compression of ML heaps images may now be controlled via -c
5879 option of isabelle and isatool usedir (currently only observed by
5882 * system: isatool installfonts may handle X-Symbol fonts as well (very
5883 useful for remote X11);
5885 * system: provide TAGS file for Isabelle sources;
5887 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5890 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5891 timing flag supersedes proof_timing and Toplevel.trace;
5893 * ML: new combinators |>> and |>>> for incremental transformations
5894 with secondary results (e.g. certain theory extensions):
5896 * ML: PureThy.add_defs gets additional argument to indicate potential
5897 overloading (usually false);
5899 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5904 New in Isabelle99 (October 1999)
5905 --------------------------------
5907 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5909 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5910 are no longer simplified. (This allows the simplifier to unfold recursive
5911 functional programs.) To restore the old behaviour, declare
5913 Delcongs [if_weak_cong];
5915 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5918 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5920 * HOL/datatype: mutual_induct_tac no longer exists --
5921 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5923 * HOL/typedef: fixed type inference for representing set; type
5924 arguments now have to occur explicitly on the rhs as type constraints;
5926 * ZF: The con_defs part of an inductive definition may no longer refer
5927 to constants declared in the same theory;
5929 * HOL, ZF: the function mk_cases, generated by the inductive
5930 definition package, has lost an argument. To simplify its result, it
5931 uses the default simpset instead of a supplied list of theorems.
5933 * HOL/List: the constructors of type list are now Nil and Cons;
5935 * Simplifier: the type of the infix ML functions
5936 setSSolver addSSolver setSolver addSolver
5937 is now simpset * solver -> simpset where `solver' is a new abstract type
5938 for packaging solvers. A solver is created via
5939 mk_solver: string -> (thm list -> int -> tactic) -> solver
5940 where the string argument is only a comment.
5945 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5946 decision procedure for linear arithmetic. Currently it is used for
5947 types `nat', `int', and `real' in HOL (see below); it can, should and
5948 will be instantiated for other types and logics as well.
5950 * The simplifier now accepts rewrite rules with flexible heads, eg
5951 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5952 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5958 * New Isabelle/Isar subsystem provides an alternative to traditional
5959 tactical theorem proving; together with the ProofGeneral/isar user
5960 interface it offers an interactive environment for developing human
5961 readable proof documents (Isar == Intelligible semi-automated
5962 reasoning); for further information see isatool doc isar-ref,
5963 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5965 * improved and simplified presentation of theories: better HTML markup
5966 (including colors), graph views in several sizes; isatool usedir now
5967 provides a proper interface for user theories (via -P option); actual
5968 document preparation based on (PDF)LaTeX is available as well (for
5969 new-style theories only); see isatool doc system for more information;
5971 * native support for Proof General, both for classic Isabelle and
5974 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5975 using the graph browser tool;
5977 * Isabelle manuals now also available as PDF;
5979 * theory loader rewritten from scratch (may not be fully
5980 bug-compatible); old loadpath variable has been replaced by show_path,
5981 add_path, del_path, reset_path functions; new operations such as
5982 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5985 * improved isatool install: option -k creates KDE application icon,
5986 option -p DIR installs standalone binaries;
5988 * added ML_PLATFORM setting (useful for cross-platform installations);
5989 more robust handling of platform specific ML images for SML/NJ;
5991 * the settings environment is now statically scoped, i.e. it is never
5992 created again in sub-processes invoked from isabelle, isatool, or
5995 * path element specification '~~' refers to '$ISABELLE_HOME';
5997 * in locales, the "assumes" and "defines" parts may be omitted if
6000 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6003 * new print_mode "HTML";
6005 * new flag show_tags controls display of tags of theorems (which are
6006 basically just comments that may be attached by some tools);
6008 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6009 mode and goal output format:
6011 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6013 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6015 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6016 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6018 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6020 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6022 * function bind_thms stores lists of theorems (cf. bind_thm);
6024 * new shorthand tactics ftac, eatac, datac, fatac;
6026 * qed (and friends) now accept "" as result name; in that case the
6027 theorem is not stored, but proper checks and presentation of the
6030 * theorem database now also indexes constants "Trueprop", "all",
6031 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6036 ** HOL arithmetic **
6038 * There are now decision procedures for linear arithmetic over nat and
6041 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6042 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6043 are treated as atomic; subformulae not involving type `nat' or `int'
6044 are ignored; quantified subformulae are ignored unless they are
6045 positive universal or negative existential. The tactic has to be
6046 invoked by hand and can be a little bit slow. In particular, the
6047 running time is exponential in the number of occurrences of `min' and
6048 `max', and `-' on `nat'.
6050 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6051 (negated) (in)equalities among the premises and the conclusion into
6052 account (i.e. no compound formulae) and does not know about `min' and
6053 `max', and `-' on `nat'. It is fast and is used automatically by the
6056 NB: At the moment, these decision procedures do not cope with mixed
6057 nat/int formulae where the two parts interact, such as `m < n ==>
6060 * HOL/Numeral provides a generic theory of numerals (encoded
6061 efficiently as bit strings); setup for types nat/int/real is in place;
6062 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6063 int, existing theories and proof scripts may require a few additional
6066 * integer division and remainder can now be performed on constant
6069 * many properties of integer multiplication, division and remainder
6072 * An interface to the Stanford Validity Checker (SVC) is available through the
6073 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6074 are proved automatically. SVC must be installed separately, and its results
6075 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6076 invocation of the underlying oracle). For SVC see
6077 http://verify.stanford.edu/SVC
6079 * IsaMakefile: the HOL-Real target now builds an actual image;
6084 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6085 (in Isabelle/Isar) -- by Gertrud Bauer;
6087 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6088 analysis for assembly languages with subtypes;
6090 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6091 -- avoids syntactic ambiguities and treats state, transition, and
6092 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6093 changed syntax and (many) tactics;
6095 * HOL/inductive: Now also handles more general introduction rules such
6096 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6097 theorems are now maintained within the theory (maintained via the
6100 * HOL/datatype: Now also handles arbitrarily branching datatypes
6101 (using function types) such as
6103 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6105 * HOL/record: record_simproc (part of the default simpset) takes care
6106 of selectors applied to updated records; record_split_tac is no longer
6107 part of the default claset; update_defs may now be removed from the
6108 simpset in many cases; COMPATIBILITY: old behavior achieved by
6110 claset_ref () := claset() addSWrapper record_split_wrapper;
6111 Delsimprocs [record_simproc]
6113 * HOL/typedef: fixed type inference for representing set; type
6114 arguments now have to occur explicitly on the rhs as type constraints;
6116 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6117 names rather than an ML expression;
6119 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6120 supplied later. Program schemes can be defined, such as
6121 "While B C s = (if B s then While B C (C s) else s)"
6122 where the well-founded relation can be chosen after B and C have been given.
6124 * HOL/List: the constructors of type list are now Nil and Cons;
6125 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6126 course, ML tools referring to List.list.op # etc. have to be adapted;
6128 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6129 disabled by default; run isabelle with option -m HOL to get back to
6130 the original Gordon/HOL-style output;
6132 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6133 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6135 * HOL basic syntax simplified (more orthogonal): all variants of
6136 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6137 Eps operator is provided as well: "SOME x. P[x]";
6139 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6141 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6142 thus available for user theories;
6144 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6145 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6148 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6149 several times and then mp;
6154 * the notation <<...>> is now available as a notation for sequences of
6157 * the simplifier is now installed
6159 * the axiom system has been generalized (thanks to Soren Heilmann)
6161 * the classical reasoner now has a default rule database
6166 * new primrec section allows primitive recursive functions to be given
6167 directly (as in HOL) over datatypes and the natural numbers;
6169 * new tactics induct_tac and exhaust_tac for induction (or case
6170 analysis) over datatypes and the natural numbers;
6172 * the datatype declaration of type T now defines the recursor T_rec;
6174 * simplification automatically does freeness reasoning for datatype
6177 * automatic type-inference, with AddTCs command to insert new
6178 type-checking rules;
6180 * datatype introduction rules are now added as Safe Introduction rules
6183 * the syntax "if P then x else y" is now available in addition to
6187 *** Internal programming interfaces ***
6189 * tuned simplifier trace output; new flag debug_simp;
6191 * structures Vartab / Termtab (instances of TableFun) offer efficient
6192 tables indexed by indexname_ord / term_ord (compatible with aconv);
6194 * AxClass.axclass_tac lost the theory argument;
6196 * tuned current_goals_markers semantics: begin / end goal avoids
6197 printing empty lines;
6199 * removed prs and prs_fn hook, which was broken because it did not
6200 include \n in its semantics, forcing writeln to add one
6201 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6202 string -> unit if you really want to output text without newline;
6204 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6205 plain output, interface builders may have to enable 'isabelle_font'
6206 mode to get Isabelle font glyphs as before;
6208 * refined token_translation interface; INCOMPATIBILITY: output length
6209 now of type real instead of int;
6211 * theory loader actions may be traced via new ThyInfo.add_hook
6212 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6213 your own database of information attached to *whole* theories -- as
6214 opposed to intra-theory data slots offered via TheoryDataFun;
6216 * proper handling of dangling sort hypotheses (at last!);
6217 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6218 extra sort hypotheses that can be witnessed from the type signature;
6219 the force_strip_shyps flag is gone, any remaining shyps are simply
6220 left in the theorem (with a warning issued by strip_shyps_warning);
6224 New in Isabelle98-1 (October 1998)
6225 ----------------------------------
6227 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6229 * several changes of automated proof tools;
6231 * HOL: major changes to the inductive and datatype packages, including
6232 some minor incompatibilities of theory syntax;
6234 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6237 * HOL: removed duplicate thms in Arith:
6238 less_imp_add_less should be replaced by trans_less_add1
6239 le_imp_add_le should be replaced by trans_le_add1
6241 * HOL: unary minus is now overloaded (new type constraints may be
6244 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6245 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6246 now taken as an integer constant.
6248 * Pure: ML function 'theory_of' renamed to 'theory';
6254 1. Asm_full_simp_tac is now more aggressive.
6255 1. It will sometimes reorient premises if that increases their power to
6257 2. It does no longer proceed strictly from left to right but may also
6258 rotate premises to achieve further simplification.
6259 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6260 old Asm_full_simp_tac in that it does not rotate premises.
6261 2. The simplifier now knows a little bit about nat-arithmetic.
6263 * Classical reasoner: wrapper mechanism for the classical reasoner now
6264 allows for selected deletion of wrappers, by introduction of names for
6265 wrapper functionals. This implies that addbefore, addSbefore,
6266 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6267 and that adding two tactics with the same name overwrites the first
6268 one (emitting a warning).
6269 type wrapper = (int -> tactic) -> (int -> tactic)
6270 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6271 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6272 delWrapper, delSWrapper: claset * string -> claset
6273 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6275 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6276 semantics; addbefore now affects only the unsafe part of step_tac
6277 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6278 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6281 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6282 compWrapper; added safe wrapper (and access functions for it);
6284 * HOL/split_all_tac is now much faster and fails if there is nothing
6285 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6286 and the names of the automatically generated variables have changed.
6287 split_all_tac has moved within claset() from unsafe wrappers to safe
6288 wrappers, which means that !!-bound variables are split much more
6289 aggressively, and safe_tac and clarify_tac now split such variables.
6290 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6291 Note: the same holds for record_split_tac, which does the job of
6292 split_all_tac for record fields.
6294 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6295 permanently to the default simpset using Addsplits just like
6296 Addsimps. They can be removed via Delsplits just like
6297 Delsimps. Lower-case versions are also available.
6299 * HOL/Simplifier: The rule split_if is now part of the default
6300 simpset. This means that the simplifier will eliminate all occurrences
6301 of if-then-else in the conclusion of a goal. To prevent this, you can
6302 either remove split_if completely from the default simpset by
6303 `Delsplits [split_if]' or remove it in a specific call of the
6304 simplifier using `... delsplits [split_if]'. You can also add/delete
6305 other case splitting rules to/from the default simpset: every datatype
6306 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6307 t is the name of the datatype).
6309 * Classical reasoner / Simplifier combination: new force_tac (and
6310 derivatives Force_tac, force) combines rewriting and classical
6311 reasoning (and whatever other tools) similarly to auto_tac, but is
6312 aimed to solve the given subgoal completely.
6317 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6318 and `goalw': the theory is no longer needed as an explicit argument -
6319 the current theory context is used; assumptions are no longer returned
6320 at the ML-level unless one of them starts with ==> or !!; it is
6321 recommended to convert to these new commands using isatool fixgoal
6322 (backup your sources first!);
6324 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6325 the current theory context, and 'theory' to lookup stored theories;
6327 * new theory section 'locale' for declaring constants, assumptions and
6328 definitions that have local scope;
6330 * new theory section 'nonterminals' for purely syntactic types;
6332 * new theory section 'setup' for generic ML setup functions
6333 (e.g. package initialization);
6335 * the distribution now includes Isabelle icons: see
6336 lib/logo/isabelle-{small,tiny}.xpm;
6338 * isatool install - install binaries with absolute references to
6341 * isatool logo -- create instances of the Isabelle logo (as EPS);
6343 * print mode 'emacs' reserved for Isamode;
6345 * support multiple print (ast) translations per constant name;
6347 * theorems involving oracles are now printed with a suffixed [!];
6352 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6354 * HOL/inductive package reorganized and improved: now supports mutual
6360 oddI "n : EVEN ==> Suc n : ODD"
6361 evenI "n : ODD ==> Suc n : EVEN"
6363 new theorem list "elims" contains an elimination rule for each of the
6364 recursive sets; inductive definitions now handle disjunctive premises
6365 correctly (also ZF);
6367 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6368 "mutual_induct" no longer exists - the induction rule is always
6369 contained in "induct";
6372 * HOL/datatype package re-implemented and greatly improved: now
6373 supports mutually recursive datatypes such as
6376 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6377 | SUM ('a aexp) ('a aexp)
6378 | DIFF ('a aexp) ('a aexp)
6381 'a bexp = LESS ('a aexp) ('a aexp)
6382 | AND ('a bexp) ('a bexp)
6383 | OR ('a bexp) ('a bexp)
6385 as well as indirectly recursive datatypes such as
6388 ('a, 'b) term = Var 'a
6389 | App 'b ((('a, 'b) term) list)
6391 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6392 induction on mutually / indirectly recursive datatypes.
6394 Primrec equations are now stored in theory and can be accessed via
6395 <function_name>.simps.
6399 - Theories using datatypes must now have theory Datatype as an
6401 - The specific <typename>.induct_tac no longer exists - use the
6402 generic induct_tac instead.
6403 - natE has been renamed to nat.exhaust - use exhaust_tac
6404 instead of res_inst_tac ... natE. Note that the variable
6405 names in nat.exhaust differ from the names in natE, this
6406 may cause some "fragile" proofs to fail.
6407 - The theorems split_<typename>_case and split_<typename>_case_asm
6408 have been renamed to <typename>.split and <typename>.split_asm.
6409 - Since default sorts of type variables are now handled correctly,
6410 some datatype definitions may have to be annotated with explicit
6412 - Primrec definitions no longer require function name and type
6413 of recursive argument.
6415 Consider using isatool fixdatatype to adapt your theories and proof
6416 scripts to the new package (backup your sources first!).
6419 * HOL/record package: considerably improved implementation; now
6420 includes concrete syntax for record types, terms, updates; theorems
6421 for surjective pairing and splitting !!-bound record variables; proof
6422 support is as follows:
6424 1) standard conversions (selectors or updates applied to record
6425 constructor terms) are part of the standard simpset;
6427 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6428 made part of standard simpset and claset via addIffs;
6430 3) a tactic for record field splitting (record_split_tac) is part of
6431 the standard claset (addSWrapper);
6433 To get a better idea about these rules you may retrieve them via
6434 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6435 the name of your record type.
6437 The split tactic 3) conceptually simplifies by the following rule:
6439 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6441 Thus any record variable that is bound by meta-all will automatically
6442 blow up into some record constructor term, consequently the
6443 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6444 solve record problems automatically.
6447 * reorganized the main HOL image: HOL/Integ and String loaded by
6448 default; theory Main includes everything;
6450 * automatic simplification of integer sums and comparisons, using cancellation;
6452 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6454 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6456 * many new identities for unions, intersections, set difference, etc.;
6458 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6459 called split_if, split_split, split_sum_case and split_nat_case (to go
6460 with add/delsplits);
6462 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6463 (?x::unit) = (); this is made part of the default simpset, which COULD
6464 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6465 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6466 unit_abs_eta_conv is added in order to counter the effect of
6467 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6470 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6473 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6474 It and 'sym RS equals0D' are now in the default claset, giving automatic
6475 disjointness reasoning but breaking a few old proofs.
6477 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6478 to 'converse' from 'inverse' (for compatibility with ZF and some
6481 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6482 the well-founded relation;
6484 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6485 Compl A. The "Compl" syntax remains available as input syntax for this
6488 * HOL/Update: new theory of function updates:
6489 f(a:=b) == %x. if x=a then b else f x
6490 may also be iterated as in f(a:=b,c:=d,...);
6492 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6495 - new function list_update written xs[i:=v] that updates the i-th
6496 list position. May also be iterated as in xs[i:=a,j:=b,...].
6497 - new function `upt' written [i..j(] which generates the list
6498 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6499 bound write [i..j], which is a shorthand for [i..j+1(].
6500 - new lexicographic orderings and corresponding wellfoundedness theorems.
6503 - removed 'pred' (predecessor) function;
6504 - generalized some theorems about n-1;
6505 - many new laws about "div" and "mod";
6506 - new laws about greatest common divisors (see theory ex/Primes);
6508 * HOL/Relation: renamed the relational operator r^-1 "converse"
6509 instead of "inverse";
6511 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6512 of the multiset ordering;
6514 * directory HOL/Real: a construction of the reals using Dedekind cuts
6515 (not included by default);
6517 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6519 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6520 programs, i.e. different program variables may have different types.
6522 * calling (stac rew i) now fails if "rew" has no effect on the goal
6523 [previously, this check worked only if the rewrite rule was unconditional]
6524 Now rew can involve either definitions or equalities (either == or =).
6529 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6530 only the theorems proved on ZF.ML;
6532 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6533 It and 'sym RS equals0D' are now in the default claset, giving automatic
6534 disjointness reasoning but breaking a few old proofs.
6536 * ZF/Update: new theory of function updates
6537 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6538 may also be iterated as in f(a:=b,c:=d,...);
6540 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6542 * calling (stac rew i) now fails if "rew" has no effect on the goal
6543 [previously, this check worked only if the rewrite rule was unconditional]
6544 Now rew can involve either definitions or equalities (either == or =).
6546 * case_tac provided for compatibility with HOL
6547 (like the old excluded_middle_tac, but with subgoals swapped)
6550 *** Internal programming interfaces ***
6552 * Pure: several new basic modules made available for general use, see
6553 also src/Pure/README;
6555 * improved the theory data mechanism to support encapsulation (data
6556 kind name replaced by private Object.kind, acting as authorization
6557 key); new type-safe user interface via functor TheoryDataFun; generic
6558 print_data function becomes basically useless;
6560 * removed global_names compatibility flag -- all theory declarations
6561 are qualified by default;
6563 * module Pure/Syntax now offers quote / antiquote translation
6564 functions (useful for Hoare logic etc. with implicit dependencies);
6565 see HOL/ex/Antiquote for an example use;
6567 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6570 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6573 * Display.print_goals function moved to Locale.print_goals;
6575 * standard print function for goals supports current_goals_markers
6576 variable for marking begin of proof, end of proof, start of goal; the
6577 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6578 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6583 New in Isabelle98 (January 1998)
6584 --------------------------------
6586 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6588 * changed lexical syntax of terms / types: dots made part of long
6589 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6591 * simpset (and claset) reference variable replaced by functions
6592 simpset / simpset_ref;
6594 * no longer supports theory aliases (via merge) and non-trivial
6595 implicit merge of thms' signatures;
6597 * most internal names of constants changed due to qualified names;
6599 * changed Pure/Sequence interface (see Pure/seq.ML);
6602 *** General Changes ***
6604 * hierachically structured name spaces (for consts, types, axms, thms
6605 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6606 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6607 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6608 long_names for fully qualified output names; NOTE: ML programs
6609 (special tactics, packages etc.) referring to internal names may have
6610 to be adapted to cope with fully qualified names; in case of severe
6611 backward campatibility problems try setting 'global_names' at compile
6612 time to have enrything declared within a flat name space; one may also
6613 fine tune name declarations in theories via the 'global' and 'local'
6616 * reimplemented the implicit simpset and claset using the new anytype
6617 data filed in signatures; references simpset:simpset ref etc. are
6618 replaced by functions simpset:unit->simpset and
6619 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6620 to patch your ML files accordingly;
6622 * HTML output now includes theory graph data for display with Java
6623 applet or isatool browser; data generated automatically via isatool
6624 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6626 * defs may now be conditional; improved rewrite_goals_tac to handle
6627 conditional equations;
6629 * defs now admits additional type arguments, using TYPE('a) syntax;
6631 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6632 creates a new theory node; implicit merge of thms' signatures is
6633 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6634 transfer:theory->thm->thm in (rare) cases;
6636 * improved handling of draft signatures / theories; draft thms (and
6637 ctyps, cterms) are automatically promoted to real ones;
6639 * slightly changed interfaces for oracles: admit many per theory, named
6640 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6642 * print_goals: optional output of const types (set show_consts and
6645 * improved output of warnings (###) and errors (***);
6647 * subgoal_tac displays a warning if the new subgoal has type variables;
6649 * removed old README and Makefiles;
6651 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6653 * removed obsolete init_pps and init_database;
6655 * deleted the obsolete tactical STATE, which was declared by
6656 fun STATE tacfun st = tacfun st st;
6658 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6659 (which abbreviates $HOME);
6661 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6662 use isatool fixseq to adapt your ML programs (this works for fully
6663 qualified references to the Sequence structure only!);
6665 * use_thy no longer requires writable current directory; it always
6666 reloads .ML *and* .thy file, if either one is out of date;
6669 *** Classical Reasoner ***
6671 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6672 tactics that use classical reasoning to simplify a subgoal without
6673 splitting it into several subgoals;
6675 * Safe_tac: like safe_tac but uses the default claset;
6680 * added simplification meta rules:
6681 (asm_)(full_)simplify: simpset -> thm -> thm;
6683 * simplifier.ML no longer part of Pure -- has to be loaded by object
6686 * added prems argument to simplification procedures;
6688 * HOL, FOL, ZF: added infix function `addsplits':
6689 instead of `<simpset> setloop (split_tac <thms>)'
6690 you can simply write `<simpset> addsplits <thms>'
6695 * TYPE('a) syntax for type reflection terms;
6697 * no longer handles consts with name "" -- declare as 'syntax' instead;
6699 * pretty printer: changed order of mixfix annotation preference (again!);
6701 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6706 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6707 with `addloop' of the simplifier to faciliate case splitting in premises.
6709 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6711 * HOL/Auth: new protocol proofs including some for the Internet
6714 * HOL/Map: new theory of `maps' a la VDM;
6716 * HOL/simplifier: simplification procedures nat_cancel_sums for
6717 cancelling out common nat summands from =, <, <= (in)equalities, or
6718 differences; simplification procedures nat_cancel_factor for
6719 cancelling common factor from =, <, <= (in)equalities over natural
6720 sums; nat_cancel contains both kinds of procedures, it is installed by
6721 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6723 * HOL/simplifier: terms of the form
6724 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6726 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6727 and those of the form
6728 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6730 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6733 Each datatype `t' now comes with a theorem `split_t_case' of the form
6735 P(t_case f1 ... fn x) =
6736 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6738 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6741 and a theorem `split_t_case_asm' of the form
6743 P(t_case f1 ... fn x) =
6744 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6746 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6748 which can be added to a simpset via `addsplits'. The existing theorems
6749 expand_list_case and expand_option_case have been renamed to
6750 split_list_case and split_option_case.
6753 - `pred n' is automatically converted to `n-1'.
6754 Users are strongly encouraged not to use `pred' any longer,
6755 because it will disappear altogether at some point.
6756 - Users are strongly encouraged to write "0 < n" rather than
6757 "n ~= 0". Theorems and proof tools have been modified towards this
6761 the function "set_of_list" has been renamed "set" (and its theorems too);
6762 the function "nth" now takes its arguments in the reverse order and
6763 has acquired the infix notation "!" as in "xs!n".
6765 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6767 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6768 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6770 * HOL/record: extensible records with schematic structural subtyping
6771 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6772 still lacks various theorems and concrete record syntax;
6777 * removed "axioms" and "generated by" sections;
6779 * replaced "ops" section by extended "consts" section, which is capable of
6780 handling the continuous function space "->" directly;
6783 . proves theorems immediately and stores them in the theory,
6784 . creates hierachical name space,
6785 . now uses normal mixfix annotations (instead of cinfix...),
6786 . minor changes to some names and values (for consistency),
6787 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6788 . separator between mutual domain defs: changed "," to "and",
6789 . improved handling of sort constraints; now they have to
6790 appear on the left-hand side of the equations only;
6792 * fixed LAM <x,y,zs>.b syntax;
6794 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6795 adm (%x. P (t x)), where P is chainfinite and t continuous;
6800 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6801 with `addloop' of the simplifier to faciliate case splitting in premises.
6803 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6804 in HOL, they strip ALL and --> from proved theorems;
6808 New in Isabelle94-8 (May 1997)
6809 ------------------------------
6811 *** General Changes ***
6813 * new utilities to build / run / maintain Isabelle etc. (in parts
6814 still somewhat experimental); old Makefiles etc. still functional;
6816 * new 'Isabelle System Manual';
6818 * INSTALL text, together with ./configure and ./build scripts;
6820 * reimplemented type inference for greater efficiency, better error
6821 messages and clean internal interface;
6823 * prlim command for dealing with lots of subgoals (an easier way of
6824 setting goals_limit);
6829 * supports alternative (named) syntax tables (parser and pretty
6830 printer); internal interface is provided by add_modesyntax(_i);
6832 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6833 be used in conjunction with the Isabelle symbol font; uses the
6834 "symbols" syntax table;
6836 * added token_translation interface (may translate name tokens in
6837 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6838 the current print_mode); IMPORTANT: user print translation functions
6839 are responsible for marking newly introduced bounds
6840 (Syntax.mark_boundT);
6842 * token translations for modes "xterm" and "xterm_color" that display
6843 names in bold, underline etc. or colors (which requires a color
6846 * infixes may now be declared with names independent of their syntax;
6848 * added typed_print_translation (like print_translation, but may
6849 access type of constant);
6852 *** Classical Reasoner ***
6854 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6855 some limitations. Blast_tac...
6856 + ignores addss, addbefore, addafter; this restriction is intrinsic
6857 + ignores elimination rules that don't have the correct format
6858 (the conclusion MUST be a formula variable)
6859 + ignores types, which can make HOL proofs fail
6860 + rules must not require higher-order unification, e.g. apply_type in ZF
6861 [message "Function Var's argument not a bound variable" relates to this]
6862 + its proof strategy is more general but can actually be slower
6864 * substitution with equality assumptions no longer permutes other
6867 * minor changes in semantics of addafter (now called addaltern); renamed
6868 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6869 (and access functions for it);
6871 * improved combination of classical reasoner and simplifier:
6872 + functions for handling clasimpsets
6873 + improvement of addss: now the simplifier is called _after_ the
6875 + safe variant of addss called addSss: uses safe simplifications
6876 _during_ the safe steps. It is more complete as it allows multiple
6877 instantiations of unknowns (e.g. with slow_tac).
6881 * added interface for simplification procedures (functions that
6882 produce *proven* rewrite rules on the fly, depending on current
6885 * ordering on terms as parameter (used for ordered rewriting);
6887 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6889 * the solver is now split into a safe and an unsafe part.
6890 This should be invisible for the normal user, except that the
6891 functions setsolver and addsolver have been renamed to setSolver and
6892 addSolver; added safe_asm_full_simp_tac;
6897 * a generic induction tactic `induct_tac' which works for all datatypes and
6898 also for type `nat';
6900 * a generic case distinction tactic `exhaust_tac' which works for all
6901 datatypes and also for type `nat';
6903 * each datatype comes with a function `size';
6905 * patterns in case expressions allow tuple patterns as arguments to
6906 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6908 * primrec now also works with type nat;
6910 * recdef: a new declaration form, allows general recursive functions to be
6911 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6913 * the constant for negation has been renamed from "not" to "Not" to
6914 harmonize with FOL, ZF, LK, etc.;
6916 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6919 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6921 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6922 problems in commutative rings, using axiomatic type classes for + and *;
6924 * more examples in HOL/MiniML and HOL/Auth;
6926 * more default rewrite rules for quantifiers, union/intersection;
6928 * a new constant `arbitrary == @x.False';
6930 * HOLCF/IOA replaces old HOL/IOA;
6932 * HOLCF changes: derived all rules and arities
6933 + axiomatic type classes instead of classes
6934 + typedef instead of faking type definitions
6935 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6936 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6937 + eliminated the types void, one, tr
6938 + use unit lift and bool lift (with translations) instead of one and tr
6939 + eliminated blift from Lift3.thy (use Def instead of blift)
6940 all eliminated rules are derived as theorems --> no visible changes ;
6945 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6946 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6947 as ZF_cs addSIs [equalityI];
6951 New in Isabelle94-7 (November 96)
6952 ---------------------------------
6954 * allowing negative levels (as offsets) in prlev and choplev;
6956 * super-linear speedup for large simplifications;
6958 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6959 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6960 FAIL); can suppress it using the command Delsimps (ex_simps @
6961 all_simps); De Morgan laws are also now included, by default;
6963 * improved printing of ==> : ~:
6965 * new object-logic "Sequents" adds linear logic, while replacing LK
6966 and Modal (thanks to Sara Kalvala);
6968 * HOL/Auth: correctness proofs for authentication protocols;
6970 * HOL: new auto_tac combines rewriting and classical reasoning (many
6971 examples on HOL/Auth);
6973 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6974 the rewriter and classical reasoner simultaneously;
6976 * function uresult no longer returns theorems in "standard" format;
6977 regain previous version by: val uresult = standard o uresult;
6984 * oracles -- these establish an interface between Isabelle and trusted
6985 external reasoners, which may deliver results as theorems;
6987 * proof objects (in particular record all uses of oracles);
6989 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6991 * "constdefs" section in theory files;
6993 * "primrec" section (HOL) no longer requires names;
6995 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7002 * reduced space requirements;
7004 * automatic HTML generation from theories;
7006 * theory files no longer require "..." (quotes) around most types;
7008 * new examples, including two proofs of the Church-Rosser theorem;
7010 * non-curried (1994) version of HOL is no longer distributed;
7017 * greatly reduced space requirements;
7019 * theory files (.thy) no longer require \...\ escapes at line breaks;
7021 * searchable theorem database (see the section "Retrieving theorems" on
7022 page 8 of the Reference Manual);
7024 * new examples, including Grabczewski's monumental case study of the
7027 * The previous version of HOL renamed to Old_HOL;
7029 * The new version of HOL (previously called CHOL) uses a curried syntax
7030 for functions. Application looks like f a b instead of f(a,b);
7032 * Mutually recursive inductive definitions finally work in HOL;
7034 * In ZF, pattern-matching on tuples is now available in all abstractions and
7035 translates to the operator "split";
7042 * new infix operator, addss, allowing the classical reasoner to
7043 perform simplification at each step of its search. Example:
7044 fast_tac (cs addss ss)
7046 * a new logic, CHOL, the same as HOL, but with a curried syntax
7047 for functions. Application looks like f a b instead of f(a,b). Also pairs
7048 look like (a,b) instead of <a,b>;
7050 * PLEASE NOTE: CHOL will eventually replace HOL!
7052 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7053 It translates to the operator "split". A new theory of integers is available;
7055 * In ZF, integer numerals now denote two's-complement binary integers.
7056 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7058 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7059 of the Axiom of Choice;
7066 * Significantly faster resolution;
7068 * the different sections in a .thy file can now be mixed and repeated
7071 * Database of theorems for FOL, HOL and ZF. New
7072 commands including qed, qed_goal and bind_thm store theorems in the database.
7074 * Simple database queries: return a named theorem (get_thm) or all theorems of
7075 a given theory (thms_of), or find out what theory a theorem was proved in
7078 * Bugs fixed in the inductive definition and datatype packages;
7080 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7081 and HOL_dup_cs obsolete;
7083 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7086 * Simpler definition of function space in ZF;
7088 * new results about cardinal and ordinal arithmetic in ZF;
7090 * 'subtype' facility in HOL for introducing new types as subsets of existing
7093 :mode=text:wrap=hard:maxLineLen=72: