monotonic sort certification: sorts are no longer minimized at the kernel boundary, only when reading input from the end-user;
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 * Use of cumulative prems via "!" in some proof methods has been
68 discontinued (legacy feature).
70 * References 'trace_simp' and 'debug_simp' have been replaced by
71 configuration options stored in the context. Enabling tracing
72 (the case of debugging is similar) in proofs works via
74 using [[trace_simp=true]]
76 Tracing is then active for all invocations of the simplifier
77 in subsequent goal refinement steps. Tracing may also still be
78 enabled or disabled via the ProofGeneral settings menu.
80 * Separate commands 'hide_class', 'hide_type', 'hide_const',
81 'hide_fact' replace the former 'hide' KIND command. Minor
87 * Code generator: simple concept for abstract datatypes obeying invariants.
89 * Local theory specifications may depend on extra type variables that
90 are not present in the result type -- arguments TYPE('a) :: 'a itself
91 are added internally. For example:
93 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
95 * Code generator: details of internal data cache have no impact on
96 the user space functionality any longer.
98 * Methods unfold_locales and intro_locales ignore non-locale subgoals. This
99 is more appropriate for interpretations with 'where'. INCOMPATIBILITY.
101 * Discontinued unnamed infix syntax (legacy feature for many years) --
102 need to specify constant name and syntax separately. Internal ML
103 datatype constructors have been renamed from InfixName to Infix etc.
104 Minor INCOMPATIBILITY.
106 * Command 'example_proof' opens an empty proof body. This allows to
107 experiment with Isar, without producing any persistent result.
109 * Commands 'type_notation' and 'no_type_notation' declare type syntax
110 within a local theory context, with explicit checking of the
111 constructors involved (in contrast to the raw 'syntax' versions).
113 * Commands 'types' and 'typedecl' now work within a local theory
114 context -- without introducing dependencies on parameters or
115 assumptions, which is not possible in Isabelle/Pure.
117 * Proof terms: Type substitutions on proof constants now use canonical
118 order of type variables. INCOMPATIBILITY: Tools working with proof
119 terms may need to be adapted.
124 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
125 provides abstract red-black tree type which is backed by RBT_Impl
126 as implementation. INCOMPATIBILTY.
128 * Command 'typedef' now works within a local theory context -- without
129 introducing dependencies on parameters or assumptions, which is not
130 possible in Isabelle/Pure/HOL. Note that the logical environment may
131 contain multiple interpretations of local typedefs (with different
132 non-emptiness proofs), even in a global theory context.
134 * Theory Library/Coinductive_List has been removed -- superceded by
135 AFP/thys/Coinductive.
137 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
138 Min, Max from theory Finite_Set. INCOMPATIBILITY.
140 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
143 * New set of rules "ac_simps" provides combined assoc / commute rewrites
144 for all interpretations of the appropriate generic locales.
146 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
147 into theories "Rings" and "Fields"; for more appropriate and more
148 consistent names suitable for name prefixes within the HOL theories.
151 * Some generic constants have been put to appropriate theories:
152 * less_eq, less: Orderings
153 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
154 * inverse, divide: Rings
157 * More consistent naming of type classes involving orderings (and lattices):
159 lower_semilattice ~> semilattice_inf
160 upper_semilattice ~> semilattice_sup
162 dense_linear_order ~> dense_linorder
164 pordered_ab_group_add ~> ordered_ab_group_add
165 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
166 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
167 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
168 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
169 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
170 pordered_cancel_semiring ~> ordered_cancel_semiring
171 pordered_comm_monoid_add ~> ordered_comm_monoid_add
172 pordered_comm_ring ~> ordered_comm_ring
173 pordered_comm_semiring ~> ordered_comm_semiring
174 pordered_ring ~> ordered_ring
175 pordered_ring_abs ~> ordered_ring_abs
176 pordered_semiring ~> ordered_semiring
178 ordered_ab_group_add ~> linordered_ab_group_add
179 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
180 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
181 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
182 ordered_field ~> linordered_field
183 ordered_field_no_lb ~> linordered_field_no_lb
184 ordered_field_no_ub ~> linordered_field_no_ub
185 ordered_field_dense_linear_order ~> dense_linordered_field
186 ordered_idom ~> linordered_idom
187 ordered_ring ~> linordered_ring
188 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
189 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
190 ordered_ring_strict ~> linordered_ring_strict
191 ordered_semidom ~> linordered_semidom
192 ordered_semiring ~> linordered_semiring
193 ordered_semiring_1 ~> linordered_semiring_1
194 ordered_semiring_1_strict ~> linordered_semiring_1_strict
195 ordered_semiring_strict ~> linordered_semiring_strict
197 The following slightly odd type classes have been moved to
198 a separate theory Library/Lattice_Algebras.thy:
200 lordered_ab_group_add ~> lattice_ab_group_add
201 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
202 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
203 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
204 lordered_ring ~> lattice_ring
208 * Refined field classes:
209 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
210 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
211 * numerous lemmas have been ported from field to division_ring;
214 * Refined algebra theorem collections:
215 * dropped theorem group group_simps, use algebra_simps instead;
216 * dropped theorem group ring_simps, use field_simps instead;
217 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
218 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
221 * Theory Finite_Set and List: some lemmas have been generalized from
224 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
225 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
226 inter_Inter_fold_inter ~> inf_Inf_fold_inf
227 union_Union_fold_union ~> sup_Sup_fold_sup
228 Inter_fold_inter ~> Inf_fold_inf
229 Union_fold_union ~> Sup_fold_sup
230 inter_INTER_fold_inter ~> inf_INFI_fold_inf
231 union_UNION_fold_union ~> sup_SUPR_fold_sup
232 INTER_fold_inter ~> INFI_fold_inf
233 UNION_fold_union ~> SUPR_fold_sup
235 * Theory Complete_Lattice: lemmas top_def and bot_def have been
236 replaced by the more convenient lemmas Inf_empty and Sup_empty.
237 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
238 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
239 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
240 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
242 * HOLogic.strip_psplit: types are returned in syntactic order, similar
243 to other strip and tuple operations. INCOMPATIBILITY.
245 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
246 * pointwise ordering is instance of class order with standard syntax <= and <;
247 * multiset ordering has syntax <=# and <#; partial order properties are provided
248 by means of interpretation with prefix multiset_order;
249 * less duplication, less historical organization of sections,
250 conversion from associations lists to multisets, rudimentary code generation;
251 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
254 * Code generation: ML and OCaml code is decorated with signatures.
256 * Theory List: added transpose.
258 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
259 clash with new theory Quotient in Main HOL.
261 * Library/Nat_Bijection.thy is a collection of bijective functions
262 between nat and other types, which supersedes the older libraries
263 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
266 Nat_Int_Bij.nat2_to_nat ~> prod_encode
267 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
268 Nat_Int_Bij.int_to_nat_bij ~> int_encode
269 Nat_Int_Bij.nat_to_int_bij ~> int_decode
270 Countable.pair_encode ~> prod_encode
271 NatIso.prod2nat ~> prod_encode
272 NatIso.nat2prod ~> prod_decode
273 NatIso.sum2nat ~> sum_encode
274 NatIso.nat2sum ~> sum_decode
275 NatIso.list2nat ~> list_encode
276 NatIso.nat2list ~> list_decode
277 NatIso.set2nat ~> set_encode
278 NatIso.nat2set ~> set_decode
281 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
282 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
283 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
284 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
285 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
286 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
287 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
288 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
289 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
290 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
291 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
292 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
293 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
298 * Sorts.certify_sort and derived "cert" operations for types and terms
299 no longer minimize sorts. Thus certification at the boundary of the
300 inference kernel becomes invariant under addition of class relations,
301 which is an important monotonicity principle. Sorts are now minimized
302 in the syntax layer only, at the boundary between the end-user and the
303 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
304 explicitly in rare situations.
306 * Antiquotations for basic formal entities:
308 @{class NAME} -- type class
309 @{class_syntax NAME} -- syntax representation of the above
311 @{type_name NAME} -- logical type
312 @{type_abbrev NAME} -- type abbreviation
313 @{nonterminal NAME} -- type of concrete syntactic category
314 @{type_syntax NAME} -- syntax representation of any of the above
316 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
317 @{const_abbrev NAME} -- abbreviated constant
318 @{const_syntax NAME} -- syntax representation of any of the above
320 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
321 syntax constant (cf. 'syntax' command).
323 * Antiquotation @{make_string} inlines a function to print arbitrary
324 values similar to the ML toplevel. The result is compiler dependent
325 and may fall back on "?" in certain situations.
327 * Renamed old-style Drule.standard to Drule.export_without_context, to
328 emphasize that this is in no way a standard operation.
331 * Curried take and drop in library.ML; negative length is interpreted
332 as infinity (as in chop). INCOMPATIBILITY.
334 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
335 usual for resolution. Rare INCOMPATIBILITY.
337 * Discontinued old TheoryDataFun with its copy/init operation -- data
338 needs to be pure. Functor Theory_Data_PP retains the traditional
339 Pretty.pp argument to merge, which is absent in the standard
342 * Renamed varify/unvarify operations to varify_global/unvarify_global
343 to emphasize that these only work in a global situation (which is
346 * Configuration options now admit dynamic default values, depending on
347 the context or even global references.
352 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
353 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
354 proof terms are enabled unconditionally in the new HOL-Proofs image.
356 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
357 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
360 * Old lib/scripts/polyml-platform is superseded by the
361 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
362 variant, even on a 64 bit machine. The following example setting
363 prefers 64 bit if available:
365 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
369 New in Isabelle2009-1 (December 2009)
370 -------------------------------------
374 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
375 one backslash should be used, even in ML sources.
380 * Locale interpretation propagates mixins along the locale hierarchy.
381 The currently only available mixins are the equations used to map
382 local definitions to terms of the target domain of an interpretation.
384 * Reactivated diagnostic command 'print_interps'. Use "print_interps
385 loc" to print all interpretations of locale "loc" in the theory.
386 Interpretations in proofs are not shown.
388 * Thoroughly revised locales tutorial. New section on conditional
391 * On instantiation of classes, remaining undefined class parameters
392 are formally declared. INCOMPATIBILITY.
395 *** Document preparation ***
397 * New generalized style concept for printing terms: @{foo (style) ...}
398 instead of @{foo_style style ...} (old form is still retained for
399 backward compatibility). Styles can be also applied for
400 antiquotations prop, term_type and typeof.
405 * New proof method "smt" for a combination of first-order logic with
406 equality, linear and nonlinear (natural/integer/real) arithmetic, and
407 fixed-size bitvectors; there is also basic support for higher-order
408 features (esp. lambda abstractions). It is an incomplete decision
409 procedure based on external SMT solvers using the oracle mechanism;
410 for the SMT solver Z3, this method is proof-producing. Certificates
411 are provided to avoid calling the external solvers solely for
412 re-checking proofs. Due to a remote SMT service there is no need for
413 installing SMT solvers locally. See src/HOL/SMT.
415 * New commands to load and prove verification conditions generated by
416 the Boogie program verifier or derived systems (e.g. the Verifying C
417 Compiler (VCC) or Spec#). See src/HOL/Boogie.
419 * New counterexample generator tool 'nitpick' based on the Kodkod
420 relational model finder. See src/HOL/Tools/Nitpick and
421 src/HOL/Nitpick_Examples.
423 * New commands 'code_pred' and 'values' to invoke the predicate
424 compiler and to enumerate values of inductive predicates.
426 * A tabled implementation of the reflexive transitive closure.
428 * New implementation of quickcheck uses generic code generator;
429 default generators are provided for all suitable HOL types, records
430 and datatypes. Old quickcheck can be re-activated importing theory
431 Library/SML_Quickcheck.
433 * New testing tool Mirabelle for automated proof tools. Applies
434 several tools and tactics like sledgehammer, metis, or quickcheck, to
435 every proof step in a theory. To be used in batch mode via the
438 * New proof method "sos" (sum of squares) for nonlinear real
439 arithmetic (originally due to John Harison). It requires theory
440 Library/Sum_Of_Squares. It is not a complete decision procedure but
441 works well in practice on quantifier-free real arithmetic with +, -,
442 *, ^, =, <= and <, i.e. boolean combinations of equalities and
443 inequalities between polynomials. It makes use of external
444 semidefinite programming solvers. Method "sos" generates a
445 certificate that can be pasted into the proof thus avoiding the need
446 to call an external tool every time the proof is checked. See
447 src/HOL/Library/Sum_Of_Squares.
449 * New method "linarith" invokes existing linear arithmetic decision
452 * New command 'atp_minimal' reduces result produced by Sledgehammer.
454 * New Sledgehammer option "Full Types" in Proof General settings menu.
455 Causes full type information to be output to the ATPs. This slows
456 ATPs down considerably but eliminates a source of unsound "proofs"
459 * New method "metisFT": A version of metis that uses full type
460 information in order to avoid failures of proof reconstruction.
462 * New evaluator "approximate" approximates an real valued term using
463 the same method as the approximation method.
465 * Method "approximate" now supports arithmetic expressions as
466 boundaries of intervals and implements interval splitting and Taylor
469 * ML antiquotation @{code_datatype} inserts definition of a datatype
470 generated by the code generator; e.g. see src/HOL/Predicate.thy.
472 * New theory SupInf of the supremum and infimum operators for sets of
475 * New theory Probability, which contains a development of measure
476 theory, eventually leading to Lebesgue integration and probability.
478 * Extended Multivariate Analysis to include derivation and Brouwer's
481 * Reorganization of number theory, INCOMPATIBILITY:
482 - new number theory development for nat and int, in theories Divides
483 and GCD as well as in new session Number_Theory
484 - some constants and facts now suffixed with _nat and _int
486 - former session NumberTheory now named Old_Number_Theory, including
487 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
488 - moved theory Pocklington from src/HOL/Library to
489 src/HOL/Old_Number_Theory
491 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
492 lcm of finite and infinite sets. It is shown that they form a complete
495 * Class semiring_div requires superclass no_zero_divisors and proof of
496 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
497 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
498 generalized to class semiring_div, subsuming former theorems
499 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
500 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
503 * Refinements to lattice classes and sets:
504 - less default intro/elim rules in locale variant, more default
505 intro/elim rules in class variant: more uniformity
506 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
508 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
510 - renamed ACI to inf_sup_aci
511 - new class "boolean_algebra"
512 - class "complete_lattice" moved to separate theory
513 "Complete_Lattice"; corresponding constants (and abbreviations)
514 renamed and with authentic syntax:
515 Set.Inf ~> Complete_Lattice.Inf
516 Set.Sup ~> Complete_Lattice.Sup
517 Set.INFI ~> Complete_Lattice.INFI
518 Set.SUPR ~> Complete_Lattice.SUPR
519 Set.Inter ~> Complete_Lattice.Inter
520 Set.Union ~> Complete_Lattice.Union
521 Set.INTER ~> Complete_Lattice.INTER
522 Set.UNION ~> Complete_Lattice.UNION
523 - authentic syntax for
526 - mere abbreviations:
529 Set.inter (for inf, formerly Set.Int)
530 Set.union (for sup, formerly Set.Un)
531 Complete_Lattice.Inter (for Inf)
532 Complete_Lattice.Union (for Sup)
533 Complete_Lattice.INTER (for INFI)
534 Complete_Lattice.UNION (for SUPR)
535 - object-logic definitions as far as appropriate
537 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
538 Un_subset_iff are explicitly deleted as default simp rules; then also
539 their lattice counterparts le_inf_iff and le_sup_iff have to be
540 deleted to achieve the desired effect.
542 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
543 rules by default any longer; the same applies to min_max.inf_absorb1
544 etc. INCOMPATIBILITY.
546 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
547 pred_set_conv by default. INCOMPATIBILITY.
549 * Power operations on relations and functions are now one dedicated
550 constant "compow" with infix syntax "^^". Power operation on
551 multiplicative monoids retains syntax "^" and is now defined generic
552 in class power. INCOMPATIBILITY.
554 * Relation composition "R O S" now has a more standard argument order:
555 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
556 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
557 break, since the O_assoc rule was not rewritten like this. Fix using
558 O_assoc[symmetric]. The same applies to the curried version "R OO S".
560 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
561 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
564 * Most rules produced by inductive and datatype package have mandatory
565 prefixes. INCOMPATIBILITY.
567 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
568 the attribute of the same name. Each of the theorems in the list
569 DERIV_intros assumes composition with an additional function and
570 matches a variable to the derivative, which has to be solved by the
571 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
572 of most elementary terms. Former Maclauren.DERIV_tac and
573 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
576 * Code generator attributes follow the usual underscore convention:
577 code_unfold replaces code unfold
578 code_post replaces code post
583 sizechange -> size_change
584 induct_scheme -> induction_schema
587 * Discontinued abbreviation "arbitrary" of constant "undefined".
588 INCOMPATIBILITY, use "undefined" directly.
591 Suc_eq_add_numeral_1 -> Suc_eq_plus1
592 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
593 Suc_plus1 -> Suc_eq_plus1
594 *anti_sym -> *antisym*
595 vector_less_eq_def -> vector_le_def
598 * Added theorem List.map_map as [simp]. Removed List.map_compose.
601 * Removed predicate "M hassize n" (<--> card M = n & finite M).
607 * Theory Representable defines a class "rep" of domains that are
608 representable (via an ep-pair) in the universal domain type "udom".
609 Instances are provided for all type constructors defined in HOLCF.
611 * The 'new_domain' command is a purely definitional version of the
612 domain package, for representable domains. Syntax is identical to the
613 old domain package. The 'new_domain' package also supports indirect
614 recursion using previously-defined type constructors. See
615 src/HOLCF/ex/New_Domain.thy for examples.
617 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
618 on the left-hand side of an equation, and then performs
619 simplification. Rewriting is done using rules declared with the
620 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
621 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
623 * The pattern-match compiler in 'fixrec' can now handle constructors
624 with HOL function types. Pattern-match combinators for the Pair
625 constructor are pre-configured.
627 * The 'fixrec' package now produces better fixed-point induction rules
628 for mutually-recursive definitions: Induction rules have conclusions
629 of the form "P foo bar" instead of "P <foo, bar>".
631 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
632 been renamed to "below". The name "below" now replaces "less" in many
633 theorem names. (Legacy theorem names using "less" are still supported
636 * The 'fixrec' package now supports "bottom patterns". Bottom
637 patterns can be used to generate strictness rules, or to make
638 functions more strict (much like the bang-patterns supported by the
639 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
645 * Support for Poly/ML 5.3.0, with improved reporting of compiler
646 errors and run-time exceptions, including detailed source positions.
648 * Structure Name_Space (formerly NameSpace) now manages uniquely
649 identified entries, with some additional information such as source
650 position, logical grouping etc.
652 * Theory and context data is now introduced by the simplified and
653 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
654 to be pure, but the old TheoryDataFun for mutable data (with explicit
655 copy operation) is still available for some time.
657 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
658 provides a high-level programming interface to synchronized state
659 variables with atomic update. This works via pure function
660 application within a critical section -- its runtime should be as
661 short as possible; beware of deadlocks if critical code is nested,
662 either directly or indirectly via other synchronized variables!
664 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
665 wraps raw ML references, explicitly indicating their non-thread-safe
666 behaviour. The Isar toplevel keeps this structure open, to
667 accommodate Proof General as well as quick and dirty interactive
668 experiments with references.
670 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
671 parallel tactical reasoning.
673 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
674 are similar to SUBPROOF, but are slightly more flexible: only the
675 specified parts of the subgoal are imported into the context, and the
676 body tactic may introduce new subgoals and schematic variables.
678 * Old tactical METAHYPS, which does not observe the proof context, has
679 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
680 or Subgoal.FOCUS etc.
682 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
683 functors have their own ML name space there is no point to mark them
684 separately.) Minor INCOMPATIBILITY.
686 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
688 * Renamed several structures FooBar to Foo_Bar. Occasional,
691 * Operations of structure Skip_Proof no longer require quick_and_dirty
692 mode, which avoids critical setmp.
694 * Eliminated old Attrib.add_attributes, Method.add_methods and related
695 combinators for "args". INCOMPATIBILITY, need to use simplified
696 Attrib/Method.setup introduced in Isabelle2009.
698 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
699 back on global_simpset_of, global_claset_of, global_clasimpset_of as
700 last resort. INCOMPATIBILITY.
702 * Display.pretty_thm now requires a proper context (cf. former
703 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
704 or even Display.pretty_thm_without_context as last resort.
707 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
708 Syntax.pretty_typ/term directly, preferably with proper context
709 instead of global theory.
714 * Further fine tuning of parallel proof checking, scales up to 8 cores
715 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
718 * Support for additional "Isabelle components" via etc/components, see
719 also the system manual.
721 * The isabelle makeall tool now operates on all components with
722 IsaMakefile, not just hardwired "logics".
724 * Removed "compress" option from isabelle-process and isabelle usedir;
725 this is always enabled.
727 * Discontinued support for Poly/ML 4.x versions.
729 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
730 on a given logic image. This requires the lighttpd webserver and is
731 currently supported on Linux only.
735 New in Isabelle2009 (April 2009)
736 --------------------------------
740 * Simplified main Isabelle executables, with less surprises on
741 case-insensitive file-systems (such as Mac OS).
743 - The main Isabelle tool wrapper is now called "isabelle" instead of
746 - The former "isabelle" alias for "isabelle-process" has been
747 removed (should rarely occur to regular users).
749 - The former "isabelle-interface" and its alias "Isabelle" have been
750 removed (interfaces are now regular Isabelle tools).
752 Within scripts and make files, the Isabelle environment variables
753 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
754 respectively. (The latter are still available as legacy feature.)
756 The old isabelle-interface wrapper could react in confusing ways if
757 the interface was uninstalled or changed otherwise. Individual
758 interface tool configuration is now more explicit, see also the
759 Isabelle system manual. In particular, Proof General is now available
760 via "isabelle emacs".
762 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
763 purge installed copies of Isabelle executables and re-run "isabelle
764 install -p ...", or use symlinks.
766 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
767 old ~/isabelle, which was slightly non-standard and apt to cause
768 surprises on case-insensitive file-systems (such as Mac OS).
770 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
771 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
772 care is required when using older releases of Isabelle. Note that
773 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
774 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
776 * Proofs of fully specified statements are run in parallel on
777 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
778 a regular 4-core machine, if the initial heap space is made reasonably
779 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
781 * The main reference manuals ("isar-ref", "implementation", and
782 "system") have been updated and extended. Formally checked references
783 as hyperlinks are now available uniformly.
788 * Complete re-implementation of locales. INCOMPATIBILITY in several
789 respects. The most important changes are listed below. See the
790 Tutorial on Locales ("locales" manual) for details.
792 - In locale expressions, instantiation replaces renaming. Parameters
793 must be declared in a for clause. To aid compatibility with previous
794 parameter inheritance, in locale declarations, parameters that are not
795 'touched' (instantiation position "_" or omitted) are implicitly added
796 with their syntax at the beginning of the for clause.
798 - Syntax from abbreviations and definitions in locales is available in
799 locale expressions and context elements. The latter is particularly
800 useful in locale declarations.
802 - More flexible mechanisms to qualify names generated by locale
803 expressions. Qualifiers (prefixes) may be specified in locale
804 expressions, and can be marked as mandatory (syntax: "name!:") or
805 optional (syntax "name?:"). The default depends for plain "name:"
806 depends on the situation where a locale expression is used: in
807 commands 'locale' and 'sublocale' prefixes are optional, in
808 'interpretation' and 'interpret' prefixes are mandatory. The old
809 implicit qualifiers derived from the parameter names of a locale are
812 - Command "sublocale l < e" replaces "interpretation l < e". The
813 instantiation clause in "interpretation" and "interpret" (square
814 brackets) is no longer available. Use locale expressions.
816 - When converting proof scripts, mandatory qualifiers in
817 'interpretation' and 'interpret' should be retained by default, even
818 if this is an INCOMPATIBILITY compared to former behavior. In the
819 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
820 in locale expressions range over a single locale instance only.
822 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
823 In existing theorem specifications replace the includes element by the
824 respective context elements of the included locale, omitting those
825 that are already present in the theorem specification. Multiple
826 assume elements of a locale should be replaced by a single one
827 involving the locale predicate. In the proof body, declarations (most
828 notably theorems) may be regained by interpreting the respective
829 locales in the proof context as required (command "interpret").
831 If using "includes" in replacement of a target solely because the
832 parameter types in the theorem are not as general as in the target,
833 consider declaring a new locale with additional type constraints on
834 the parameters (context element "constrains").
836 - Discontinued "locale (open)". INCOMPATIBILITY.
838 - Locale interpretation commands no longer attempt to simplify goal.
839 INCOMPATIBILITY: in rare situations the generated goal differs. Use
840 methods intro_locales and unfold_locales to clarify.
842 - Locale interpretation commands no longer accept interpretation
843 attributes. INCOMPATIBILITY.
845 * Class declaration: so-called "base sort" must not be given in import
846 list any longer, but is inferred from the specification. Particularly
853 class foo = type + ...
855 * Class target: global versions of theorems stemming do not carry a
856 parameter prefix any longer. INCOMPATIBILITY.
858 * Class 'instance' command no longer accepts attached definitions.
859 INCOMPATIBILITY, use proper 'instantiation' target instead.
861 * Recovered hiding of consts, which was accidentally broken in
862 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
863 makes c inaccessible; consider using ``hide (open) const c'' instead.
865 * Slightly more coherent Pure syntax, with updated documentation in
866 isar-ref manual. Removed locales meta_term_syntax and
867 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
868 INCOMPATIBILITY in rare situations. Note that &&& should not be used
869 directly in regular applications.
871 * There is a new syntactic category "float_const" for signed decimal
872 fractions (e.g. 123.45 or -123.45).
874 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
875 interface with 'setup' command instead.
877 * Command 'local_setup' is similar to 'setup', but operates on a local
880 * The 'axiomatization' command now only works within a global theory
881 context. INCOMPATIBILITY.
883 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
884 hypotheses. Sorts required in the course of reasoning need to be
885 covered by the constraints in the initial statement, completed by the
886 type instance information of the background theory. Non-trivial sort
887 hypotheses, which rarely occur in practice, may be specified via
888 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
890 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
892 The result contains an implicit sort hypotheses as before --
893 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
896 * Generalized Isar history, with support for linear undo, direct state
899 * Changed defaults for unify configuration options:
901 unify_trace_bound = 50 (formerly 25)
902 unify_search_bound = 60 (formerly 30)
904 * Different bookkeeping for code equations (INCOMPATIBILITY):
906 a) On theory merge, the last set of code equations for a particular
907 constant is taken (in accordance with the policy applied by other
908 parts of the code generator framework).
910 b) Code equations stemming from explicit declarations (e.g. code
911 attribute) gain priority over default code equations stemming
912 from definition, primrec, fun etc.
914 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
916 * Unified theorem tables for both code generators. Thus [code
917 func] has disappeared and only [code] remains. INCOMPATIBILITY.
919 * Command 'find_consts' searches for constants based on type and name
922 find_consts "_ => bool"
924 By default, matching is against subtypes, but it may be restricted to
925 the whole type. Searching by name is possible. Multiple queries are
926 conjunctive and queries may be negated by prefixing them with a
929 find_consts strict: "_ => bool" name: "Int" -"int => int"
931 * New 'find_theorems' criterion "solves" matches theorems that
932 directly solve the current goal (modulo higher-order unification).
934 * Auto solve feature for main theorem statements: whenever a new goal
935 is stated, "find_theorems solves" is called; any theorems that could
936 solve the lemma directly are listed as part of the goal state.
937 Cf. associated options in Proof General Isabelle settings menu,
938 enabled by default, with reasonable timeout for pathological cases of
939 higher-order unification.
942 *** Document preparation ***
944 * Antiquotation @{lemma} now imitates a regular terminal proof,
945 demanding keyword 'by' and supporting the full method expression
946 syntax just like the Isar command 'by'.
951 * Integrated main parts of former image HOL-Complex with HOL. Entry
952 points Main and Complex_Main remain as before.
954 * Logic image HOL-Plain provides a minimal HOL with the most important
955 tools available (inductive, datatype, primrec, ...). This facilitates
956 experimentation and tool development. Note that user applications
957 (and library theories) should never refer to anything below theory
960 * Logic image HOL-Main stops at theory Main, and thus facilitates
961 experimentation due to shorter build times.
963 * Logic image HOL-NSA contains theories of nonstandard analysis which
964 were previously part of former HOL-Complex. Entry point Hyperreal
965 remains valid, but theories formerly using Complex_Main should now use
966 new entry point Hypercomplex.
968 * Generic ATP manager for Sledgehammer, based on ML threads instead of
969 Posix processes. Avoids potentially expensive forking of the ML
970 process. New thread-based implementation also works on non-Unix
971 platforms (Cygwin). Provers are no longer hardwired, but defined
972 within the theory via plain ML wrapper functions. Basic Sledgehammer
973 commands are covered in the isar-ref manual.
975 * Wrapper scripts for remote SystemOnTPTP service allows to use
976 sledgehammer without local ATP installation (Vampire etc.). Other
977 provers may be included via suitable ML wrappers, see also
978 src/HOL/ATP_Linkup.thy.
980 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
983 * The metis method no longer fails because the theorem is too trivial
984 (contains the empty clause).
986 * The metis method now fails in the usual manner, rather than raising
987 an exception, if it determines that it cannot prove the theorem.
989 * Method "coherent" implements a prover for coherent logic (see also
990 src/Tools/coherent.ML).
992 * Constants "undefined" and "default" replace "arbitrary". Usually
993 "undefined" is the right choice to replace "arbitrary", though
994 logically there is no difference. INCOMPATIBILITY.
996 * Command "value" now integrates different evaluation mechanisms. The
997 result of the first successful evaluation mechanism is printed. In
998 square brackets a particular named evaluation mechanisms may be
999 specified (currently, [SML], [code] or [nbe]). See further
1000 src/HOL/ex/Eval_Examples.thy.
1002 * Normalization by evaluation now allows non-leftlinear equations.
1003 Declare with attribute [code nbe].
1005 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1006 as the structured Isar versions "cases" and "induct", cf. the
1007 corresponding "cases" and "induct" attributes. Mutual induction rules
1008 are now presented as a list of individual projections
1009 (e.g. foo_bar.inducts for types foo and bar); the old format with
1010 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1011 rare situations a different rule is selected --- notably nested tuple
1012 elimination instead of former prod.exhaust: use explicit (case_tac t
1013 rule: prod.exhaust) here.
1015 * Attributes "cases", "induct", "coinduct" support "del" option.
1017 * Removed fact "case_split_thm", which duplicates "case_split".
1019 * The option datatype has been moved to a new theory Option. Renamed
1020 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1022 * New predicate "strict_mono" classifies strict functions on partial
1023 orders. With strict functions on linear orders, reasoning about
1024 (in)equalities is facilitated by theorems "strict_mono_eq",
1025 "strict_mono_less_eq" and "strict_mono_less".
1027 * Some set operations are now proper qualified constants with
1028 authentic syntax. INCOMPATIBILITY:
1039 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1042 * Auxiliary class "itself" has disappeared -- classes without any
1043 parameter are treated as expected by the 'class' command.
1045 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1047 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1048 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1050 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1051 method "approximation". It proves formulas on real values by using
1052 interval arithmetic. In the formulas are also the transcendental
1053 functions sin, cos, tan, atan, ln, exp and the constant pi are
1054 allowed. For examples see
1055 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1057 * Theory "Reflection" now resides in HOL/Library.
1059 * Entry point to Word library now simply named "Word".
1062 * Made source layout more coherent with logical distribution
1065 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1066 src/HOL/Library/Code_Message.thy ~> src/HOL/
1067 src/HOL/Library/GCD.thy ~> src/HOL/
1068 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1069 src/HOL/Library/Parity.thy ~> src/HOL/
1070 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1071 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1072 src/HOL/Real/Lubs.thy ~> src/HOL/
1073 src/HOL/Real/PReal.thy ~> src/HOL/
1074 src/HOL/Real/Rational.thy ~> src/HOL/
1075 src/HOL/Real/RComplete.thy ~> src/HOL/
1076 src/HOL/Real/RealDef.thy ~> src/HOL/
1077 src/HOL/Real/RealPow.thy ~> src/HOL/
1078 src/HOL/Real/Real.thy ~> src/HOL/
1079 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1080 src/HOL/Complex/Complex.thy ~> src/HOL/
1081 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1082 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1083 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1084 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1085 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1086 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1087 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1088 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1089 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1090 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1091 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1092 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1093 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1094 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1095 src/HOL/Real/Float ~> src/HOL/Library/
1096 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1097 src/HOL/Real/RealVector.thy ~> src/HOL/
1099 src/HOL/arith_data.ML ~> src/HOL/Tools
1100 src/HOL/hologic.ML ~> src/HOL/Tools
1101 src/HOL/simpdata.ML ~> src/HOL/Tools
1102 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1103 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1104 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1105 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1106 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1107 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1108 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1110 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1111 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1112 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1113 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1114 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1115 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1117 * If methods "eval" and "evaluation" encounter a structured proof
1118 state with !!/==>, only the conclusion is evaluated to True (if
1119 possible), avoiding strange error messages.
1121 * Method "sizechange" automates termination proofs using (a
1122 modification of) the size-change principle. Requires SAT solver. See
1123 src/HOL/ex/Termination.thy for examples.
1125 * Simplifier: simproc for let expressions now unfolds if bound
1126 variable occurs at most once in let expression body. INCOMPATIBILITY.
1128 * Method "arith": Linear arithmetic now ignores all inequalities when
1129 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1131 * New attribute "arith" for facts that should always be used
1132 automatically by arithmetic. It is intended to be used locally in
1135 assumes [arith]: "x > 0"
1137 Global usage is discouraged because of possible performance impact.
1139 * New classes "top" and "bot" with corresponding operations "top" and
1140 "bot" in theory Orderings; instantiation of class "complete_lattice"
1141 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1143 * Changed definition lemma "less_fun_def" in order to provide an
1144 instance for preorders on functions; use lemma "less_le" instead.
1147 * Theory Orderings: class "wellorder" moved here, with explicit
1148 induction rule "less_induct" as assumption. For instantiation of
1149 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1152 * Theory Orderings: added class "preorder" as superclass of "order".
1153 INCOMPATIBILITY: Instantiation proofs for order, linorder
1154 etc. slightly changed. Some theorems named order_class.* now named
1157 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1160 * Theory Finite_Set: added a new fold combinator of type
1162 ('a => 'b => 'b) => 'b => 'a set => 'b
1164 Occasionally this is more convenient than the old fold combinator
1165 which is now defined in terms of the new one and renamed to
1168 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1169 and "ring_simps" have been replaced by "algebra_simps" (which can be
1170 extended with further lemmas!). At the moment both still exist but
1171 the former will disappear at some point.
1173 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1174 class recpower. Type-specific simp rules for various recpower types
1175 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1177 rat_power_0 -> power_0
1178 rat_power_Suc -> power_Suc
1179 realpow_0 -> power_0
1180 realpow_Suc -> power_Suc
1181 complexpow_0 -> power_0
1182 complexpow_Suc -> power_Suc
1183 power_poly_0 -> power_0
1184 power_poly_Suc -> power_Suc
1186 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1187 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1188 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1189 of lemmas from Divides has been generalized from nat to class
1190 semiring_div. INCOMPATIBILITY. This involves the following theorem
1191 renames resulting from duplicate elimination:
1193 dvd_def_mod ~> dvd_eq_mod_eq_0
1194 zero_dvd_iff ~> dvd_0_left_iff
1195 dvd_0 ~> dvd_0_right
1196 DIVISION_BY_ZERO_DIV ~> div_by_0
1197 DIVISION_BY_ZERO_MOD ~> mod_by_0
1198 mult_div ~> div_mult_self2_is_id
1199 mult_mod ~> mod_mult_self2_is_0
1201 * Theory IntDiv: removed many lemmas that are instances of class-based
1202 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1203 rename old lemmas as follows:
1205 dvd_diff -> nat_dvd_diff
1206 dvd_zminus_iff -> dvd_minus_iff
1207 mod_add1_eq -> mod_add_eq
1208 mod_mult1_eq -> mod_mult_right_eq
1209 mod_mult1_eq' -> mod_mult_left_eq
1210 mod_mult_distrib_mod -> mod_mult_eq
1211 nat_mod_add_left_eq -> mod_add_left_eq
1212 nat_mod_add_right_eq -> mod_add_right_eq
1213 nat_mod_div_trivial -> mod_div_trivial
1214 nat_mod_mod_trivial -> mod_mod_trivial
1215 zdiv_zadd_self1 -> div_add_self1
1216 zdiv_zadd_self2 -> div_add_self2
1217 zdiv_zmult_self1 -> div_mult_self2_is_id
1218 zdiv_zmult_self2 -> div_mult_self1_is_id
1219 zdvd_triv_left -> dvd_triv_left
1220 zdvd_triv_right -> dvd_triv_right
1221 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1222 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1223 zmod_zadd_left_eq -> mod_add_left_eq
1224 zmod_zadd_right_eq -> mod_add_right_eq
1225 zmod_zadd_self1 -> mod_add_self1
1226 zmod_zadd_self2 -> mod_add_self2
1227 zmod_zadd1_eq -> mod_add_eq
1228 zmod_zdiff1_eq -> mod_diff_eq
1229 zmod_zdvd_zmod -> mod_mod_cancel
1230 zmod_zmod_cancel -> mod_mod_cancel
1231 zmod_zmult_self1 -> mod_mult_self2_is_0
1232 zmod_zmult_self2 -> mod_mult_self1_is_0
1235 zdvd_abs1 -> abs_dvd_iff
1236 zdvd_abs2 -> dvd_abs_iff
1237 zdvd_refl -> dvd_refl
1238 zdvd_trans -> dvd_trans
1239 zdvd_zadd -> dvd_add
1240 zdvd_zdiff -> dvd_diff
1241 zdvd_zminus_iff -> dvd_minus_iff
1242 zdvd_zminus2_iff -> minus_dvd_iff
1243 zdvd_zmultD -> dvd_mult_right
1244 zdvd_zmultD2 -> dvd_mult_left
1245 zdvd_zmult_mono -> mult_dvd_mono
1246 zdvd_0_right -> dvd_0_right
1247 zdvd_0_left -> dvd_0_left_iff
1248 zdvd_1_left -> one_dvd
1249 zminus_dvd_iff -> minus_dvd_iff
1251 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1253 * The real numbers offer decimal input syntax: 12.34 is translated
1254 into 1234/10^2. This translation is not reversed upon output.
1256 * Theory Library/Polynomial defines an abstract type 'a poly of
1257 univariate polynomials with coefficients of type 'a. In addition to
1258 the standard ring operations, it also supports div and mod. Code
1259 generation is also supported, using list-style constructors.
1261 * Theory Library/Inner_Product defines a class of real_inner for real
1262 inner product spaces, with an overloaded operation inner :: 'a => 'a
1263 => real. Class real_inner is a subclass of real_normed_vector from
1266 * Theory Library/Product_Vector provides instances for the product
1267 type 'a * 'b of several classes from RealVector and Inner_Product.
1268 Definitions of addition, subtraction, scalar multiplication, norms,
1269 and inner products are included.
1271 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1272 addition to the field operations, numerals and case syntax are also
1275 * Theory Library/Diagonalize provides constructive version of Cantor's
1276 first diagonalization argument.
1278 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1279 zlcm (for int); carried together from various gcd/lcm developements in
1280 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1281 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1282 may recover tupled syntax as follows:
1284 hide (open) const gcd
1285 abbreviation gcd where
1286 "gcd == (%(a, b). GCD.gcd a b)"
1288 GCD.gcd ("gcd '(_, _')")
1290 The same works for lcm, zgcd, zlcm.
1292 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1293 instantiations for algebraic structures. Removed some duplicate
1294 theorems. Changes in simp rules. INCOMPATIBILITY.
1296 * ML antiquotation @{code} takes a constant as argument and generates
1297 corresponding code in background and inserts name of the corresponding
1298 resulting ML value/function/datatype constructor binding in place.
1299 All occurrences of @{code} with a single ML block are generated
1300 simultaneously. Provides a generic and safe interface for
1301 instrumentalizing code generation. See
1302 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1303 In future you ought to refrain from ad-hoc compiling generated SML
1304 code on the ML toplevel. Note that (for technical reasons) @{code}
1305 cannot refer to constants for which user-defined serializations are
1306 set. Refer to the corresponding ML counterpart directly in that
1309 * Command 'rep_datatype': instead of theorem names the command now
1310 takes a list of terms denoting the constructors of the type to be
1311 represented as datatype. The characteristic theorems have to be
1312 proven. INCOMPATIBILITY. Also observe that the following theorems
1313 have disappeared in favour of existing ones:
1315 unit_induct ~> unit.induct
1316 prod_induct ~> prod.induct
1317 sum_induct ~> sum.induct
1318 Suc_Suc_eq ~> nat.inject
1319 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1324 * New locales for orders and lattices where the equivalence relation
1325 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1326 locales use a record structure with field eq for the equivalence.
1328 * New theory of factorial domains.
1330 * Units_l_inv and Units_r_inv are now simp rules by default.
1331 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1332 and/or r_inv will now also require deletion of these lemmas.
1334 * Renamed the following theorems, INCOMPATIBILITY:
1336 UpperD ~> Upper_memD
1337 LowerD ~> Lower_memD
1338 least_carrier ~> least_closed
1339 greatest_carrier ~> greatest_closed
1340 greatest_Lower_above ~> greatest_Lower_below
1341 one_zero ~> carrier_one_zero
1342 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1347 * Nominal datatypes can now contain type-variables.
1349 * Commands 'nominal_inductive' and 'equivariance' work with local
1352 * Nominal primrec can now works with local theory targets and its
1353 specification syntax now conforms to the general format as seen in
1356 * Method "perm_simp" honours the standard simplifier attributes
1357 (no_asm), (no_asm_use) etc.
1359 * The new predicate #* is defined like freshness, except that on the
1360 left hand side can be a set or list of atoms.
1362 * Experimental command 'nominal_inductive2' derives strong induction
1363 principles for inductive definitions. In contrast to
1364 'nominal_inductive', which can only deal with a fixed number of
1365 binders, it can deal with arbitrary expressions standing for sets of
1366 atoms to be avoided. The only inductive definition we have at the
1367 moment that needs this generalisation is the typing rule for Lets in
1370 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1371 -----------------------------------------------------------------
1372 Gamma |- Let x be t1 in t2 : T2
1374 In this rule one wants to avoid all the binders that are introduced by
1375 "close Gamma T1". We are looking for other examples where this
1376 feature might be useful. Please let us know.
1381 * Reimplemented the simplification procedure for proving continuity
1382 subgoals. The new simproc is extensible; users can declare additional
1383 continuity introduction rules with the attribute [cont2cont].
1385 * The continuity simproc now uses a different introduction rule for
1386 solving continuity subgoals on terms with lambda abstractions. In
1387 some rare cases the new simproc may fail to solve subgoals that the
1388 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1389 Potential INCOMPATIBILITY.
1391 * Command 'fixrec': specification syntax now conforms to the general
1392 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1393 examples. INCOMPATIBILITY.
1398 * Proof of Zorn's Lemma for partial orders.
1403 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1404 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1405 depends on multithreading, so timouts will not work before Poly/ML
1408 * High-level support for concurrent ML programming, see
1409 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1410 particularly convenient to organize independent functional
1411 computations. The concept of "synchronized variables" provides a
1412 higher-order interface for components with shared state, avoiding the
1413 delicate details of mutexes and condition variables. (Requires
1414 Poly/ML 5.2.1 or later.)
1416 * ML bindings produced via Isar commands are stored within the Isar
1417 context (theory or proof). Consequently, commands like 'use' and 'ML'
1418 become thread-safe and work with undo as expected (concerning
1419 top-level bindings, not side-effects on global references).
1420 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1421 compiler at runtime; really global bindings need to be given outside a
1422 theory. (Requires Poly/ML 5.2 or later.)
1424 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1425 context. Top-level ML bindings are stored within the proof context in
1426 a purely sequential fashion, disregarding the nested proof structure.
1427 ML bindings introduced by 'ML_prf' are discarded at the end of the
1428 proof. (Requires Poly/ML 5.2 or later.)
1430 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1431 and Method.setup, as well as Isar commands 'attribute_setup' and
1432 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1433 existing code accordingly, or use plain 'setup' together with old
1436 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1437 to 'a -> thm, while results are always tagged with an authentic oracle
1438 name. The Isar command 'oracle' is now polymorphic, no argument type
1439 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1440 accordingly. Note that extra performance may be gained by producing
1441 the cterm carefully, avoiding slow Thm.cterm_of.
1443 * Simplified interface for defining document antiquotations via
1444 ThyOutput.antiquotation, ThyOutput.output, and optionally
1445 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1446 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1449 * More systematic treatment of long names, abstract name bindings, and
1450 name space operations. Basic operations on qualified names have been
1451 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1452 Long_Name.append. Old type bstring has been mostly replaced by
1453 abstract type binding (see structure Binding), which supports precise
1454 qualification by packages and local theory targets, as well as proper
1455 tracking of source positions. INCOMPATIBILITY, need to wrap old
1456 bstring values into Binding.name, or better pass through abstract
1457 bindings everywhere. See further src/Pure/General/long_name.ML,
1458 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1460 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1461 LocalTheory.note etc.) now refer to the *full* internal name, not the
1462 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1464 * Disposed old type and term read functions (Sign.read_def_typ,
1465 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1466 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1467 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1468 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1469 resort for legacy applications.
1471 * Disposed old declarations, tactics, tactic combinators that refer to
1472 the simpset or claset of an implicit theory (such as Addsimps,
1473 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1474 embedded ML text, or local_simpset_of with a proper context passed as
1475 explicit runtime argument.
1477 * Rules and tactics that read instantiations (read_instantiate,
1478 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1479 context, which is required for parsing and type-checking. Moreover,
1480 the variables are specified as plain indexnames, not string encodings
1481 thereof. INCOMPATIBILITY.
1483 * Generic Toplevel.add_hook interface allows to analyze the result of
1484 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1485 for theorem dependency output of transactions resulting in a new
1488 * ML antiquotations: block-structured compilation context indicated by
1489 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1491 @{binding name} - basic name binding
1492 @{let ?pat = term} - term abbreviation (HO matching)
1493 @{note name = fact} - fact abbreviation
1494 @{thm fact} - singleton fact (with attributes)
1495 @{thms fact} - general fact (with attributes)
1496 @{lemma prop by method} - singleton goal
1497 @{lemma prop by meth1 meth2} - singleton goal
1498 @{lemma prop1 ... propN by method} - general goal
1499 @{lemma prop1 ... propN by meth1 meth2} - general goal
1500 @{lemma (open) ...} - open derivation
1505 * The Isabelle "emacs" tool provides a specific interface to invoke
1506 Proof General / Emacs, with more explicit failure if that is not
1507 installed (the old isabelle-interface script silently falls back on
1508 isabelle-process). The PROOFGENERAL_HOME setting determines the
1509 installation location of the Proof General distribution.
1511 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1512 the Isabelle process into a JVM/Scala application. See
1513 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1514 process wrapper has been discontinued.)
1516 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1518 * Various status messages (with exact source position information) are
1519 emitted, if proper markup print mode is enabled. This allows
1520 user-interface components to provide detailed feedback on internal
1525 New in Isabelle2008 (June 2008)
1526 -------------------------------
1530 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1531 and updated, with formally checked references as hyperlinks.
1533 * Theory loader: use_thy (and similar operations) no longer set the
1534 implicit ML context, which was occasionally hard to predict and in
1535 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1536 provides a proper context already.
1538 * Theory loader: old-style ML proof scripts being *attached* to a thy
1539 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1540 'use' within a theory file will do the job.
1542 * Name space merge now observes canonical order, i.e. the second space
1543 is inserted into the first one, while existing entries in the first
1544 space take precedence. INCOMPATIBILITY in rare situations, may try to
1545 swap theory imports.
1547 * Syntax: symbol \<chi> is now considered a letter. Potential
1548 INCOMPATIBILITY in identifier syntax etc.
1550 * Outer syntax: string tokens no longer admit escaped white space,
1551 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1552 white space without escapes.
1554 * Outer syntax: string tokens may contain arbitrary character codes
1555 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1561 * Context-dependent token translations. Default setup reverts locally
1562 fixed variables, and adds hilite markup for undeclared frees.
1564 * Unused theorems can be found using the new command 'unused_thms'.
1565 There are three ways of invoking it:
1568 Only finds unused theorems in the current theory.
1570 (2) unused_thms thy_1 ... thy_n -
1571 Finds unused theorems in the current theory and all of its ancestors,
1572 excluding the theories thy_1 ... thy_n and all of their ancestors.
1574 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1575 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1576 their ancestors, excluding the theories thy_1 ... thy_n and all of
1579 In order to increase the readability of the list produced by
1580 unused_thms, theorems that have been created by a particular instance
1581 of a theory command such as 'inductive' or 'function' are considered
1582 to belong to the same "group", meaning that if at least one theorem in
1583 this group is used, the other theorems in the same group are no longer
1584 reported as unused. Moreover, if all theorems in the group are
1585 unused, only one theorem in the group is displayed.
1587 Note that proof objects have to be switched on in order for
1588 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1589 usually the case when using Proof General with the default settings).
1591 * Authentic naming of facts disallows ad-hoc overwriting of previous
1592 theorems within the same name space. INCOMPATIBILITY, need to remove
1593 duplicate fact bindings, or even accidental fact duplications. Note
1594 that tools may maintain dynamically scoped facts systematically, using
1595 PureThy.add_thms_dynamic.
1597 * Command 'hide' now allows to hide from "fact" name space as well.
1599 * Eliminated destructive theorem database, simpset, claset, and
1600 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1601 update of theories within ML code.
1603 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1604 INCOMPATIBILITY, object-logics depending on former Pure require
1605 additional setup PureThy.old_appl_syntax_setup; object-logics
1606 depending on former CPure need to refer to Pure.
1608 * Commands 'use' and 'ML' are now purely functional, operating on
1609 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1610 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1613 * Command 'setup': discontinued implicit version with ML reference.
1615 * Instantiation target allows for simultaneous specification of class
1616 instance operations together with an instantiation proof.
1617 Type-checking phase allows to refer to class operations uniformly.
1618 See src/HOL/Complex/Complex.thy for an Isar example and
1619 src/HOL/Library/Eval.thy for an ML example.
1621 * Indexing of literal facts: be more serious about including only
1622 facts from the visible specification/proof context, but not the
1623 background context (locale etc.). Affects `prop` notation and method
1624 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1627 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1628 "(open)" option, which used to expose internal bound variables to the
1631 * Isar statements: removed obsolete case "rule_context".
1632 INCOMPATIBILITY, better use explicit fixes/assumes.
1634 * Locale proofs: default proof step now includes 'unfold_locales';
1635 hence 'proof' without argument may be used to unfold locale
1639 *** Document preparation ***
1641 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1642 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1643 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1644 spot); renamed link color from "darkblue" to "linkcolor" (default
1645 value unchanged, can be redefined via \definecolor); no longer sets
1646 "a4paper" option (unnecessary or even intrusive).
1648 * Antiquotation @{lemma A method} proves proposition A by the given
1649 method (either a method name or a method name plus (optional) method
1650 arguments in parentheses) and prints A just like @{prop A}.
1655 * New primrec package. Specification syntax conforms in style to
1656 definition/function/.... No separate induction rule is provided. The
1657 "primrec" command distinguishes old-style and new-style specifications
1658 by syntax. The former primrec package is now named OldPrimrecPackage.
1659 When adjusting theories, beware: constants stemming from new-style
1660 primrec specifications have authentic syntax.
1662 * Metis prover is now an order of magnitude faster, and also works
1663 with multithreading.
1665 * Metis: the maximum number of clauses that can be produced from a
1666 theorem is now given by the attribute max_clauses. Theorems that
1667 exceed this number are ignored, with a warning printed.
1669 * Sledgehammer no longer produces structured proofs by default. To
1670 enable, declare [[sledgehammer_full = true]]. Attributes
1671 reconstruction_modulus, reconstruction_sorts renamed
1672 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1674 * Method "induct_scheme" derives user-specified induction rules
1675 from well-founded induction and completeness of patterns. This factors
1676 out some operations that are done internally by the function package
1677 and makes them available separately. See
1678 src/HOL/ex/Induction_Scheme.thy for examples.
1680 * More flexible generation of measure functions for termination
1681 proofs: Measure functions can be declared by proving a rule of the
1682 form "is_measure f" and giving it the [measure_function] attribute.
1683 The "is_measure" predicate is logically meaningless (always true), and
1684 just guides the heuristic. To find suitable measure functions, the
1685 termination prover sets up the goal "is_measure ?f" of the appropriate
1686 type and generates all solutions by prolog-style backwards proof using
1689 This setup also deals with rules like
1691 "is_measure f ==> is_measure (list_size f)"
1693 which accommodates nested datatypes that recurse through lists.
1694 Similar rules are predeclared for products and option types.
1696 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1700 - Definitions of overloaded constants on sets have to be replaced by
1701 definitions on => and bool.
1703 - Some definitions of overloaded operators on sets can now be proved
1704 using the definitions of the operators on => and bool. Therefore,
1705 the following theorems have been renamed:
1707 subset_def -> subset_eq
1708 psubset_def -> psubset_eq
1709 set_diff_def -> set_diff_eq
1710 Compl_def -> Compl_eq
1711 Sup_set_def -> Sup_set_eq
1712 Inf_set_def -> Inf_set_eq
1713 sup_set_def -> sup_set_eq
1714 inf_set_def -> inf_set_eq
1716 - Due to the incompleteness of the HO unification algorithm, some
1717 rules such as subst may require manual instantiation, if some of
1718 the unknowns in the rule is a set.
1720 - Higher order unification and forward proofs:
1723 have "P (S::'a set)" <...>
1724 then have "EX S. P S" ..
1726 no longer works (due to the incompleteness of the HO unification
1727 algorithm) and must be replaced by the pattern
1734 - Calculational reasoning with subst (or similar rules):
1737 have "P (S::'a set)" <...>
1738 also have "S = T" <...>
1739 finally have "P T" .
1741 no longer works (for similar reasons as the previous example) and
1742 must be replaced by something like
1744 have "P (S::'a set)" <...>
1745 moreover have "S = T" <...>
1746 ultimately have "P T" by simp
1748 - Tactics or packages written in ML code:
1749 Code performing pattern matching on types via
1751 Type ("set", [T]) => ...
1753 must be rewritten. Moreover, functions like strip_type or
1754 binder_types no longer return the right value when applied to a
1757 T1 => ... => Tn => U => bool
1761 T1 => ... => Tn => U set
1763 * Merged theories Wellfounded_Recursion, Accessible_Part and
1764 Wellfounded_Relations to theory Wellfounded.
1766 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1768 * Class finite no longer treats UNIV as class parameter. Use class
1769 enum from theory Library/Enum instead to achieve a similar effect.
1772 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1773 and "Cons". INCOMPATIBILITY.
1775 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1776 Potential INCOMPATIBILITY.
1778 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1779 injective_fst_snd removed, use split_eta and prod_eqI instead.
1780 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1782 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1783 the same name in theory Orderings:
1793 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1794 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1795 and different variable names.
1797 * Library/Option_ord.thy: Canonical order on option type.
1799 * Library/RBT.thy: Red-black trees, an efficient implementation of
1802 * Library/Countable.thy: Type class for countable types.
1804 * Theory Int: The representation of numerals has changed. The infix
1805 operator BIT and the bit datatype with constructors B0 and B1 have
1806 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1807 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1808 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1811 * Theory Nat: definition of <= and < on natural numbers no longer
1812 depend on well-founded relations. INCOMPATIBILITY. Definitions
1813 le_def and less_def have disappeared. Consider lemmas not_less
1814 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1816 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1817 (whose purpose mainly is for various fold_set functionals) have been
1818 abandoned in favor of the existing algebraic classes
1819 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1820 lower_semilattice (resp. upper_semilattice) and linorder.
1823 * Theory Transitive_Closure: induct and cases rules now declare proper
1824 case_names ("base" and "step"). INCOMPATIBILITY.
1826 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1827 lattices. The form set-specific version is available as
1828 Inductive.lfp_ordinal_induct_set.
1830 * Renamed theorems "power.simps" to "power_int.simps".
1833 * Class semiring_div provides basic abstract properties of semirings
1834 with division and modulo operations. Subsumes former class dvd_mod.
1836 * Merged theories IntDef, Numeral and IntArith into unified theory
1837 Int. INCOMPATIBILITY.
1839 * Theory Library/Code_Index: type "index" now represents natural
1840 numbers rather than integers. INCOMPATIBILITY.
1842 * New class "uminus" with operation "uminus" (split of from class
1843 "minus" which now only has operation "minus", binary).
1846 * Constants "card", "internal_split", "option_map" now with authentic
1847 syntax. INCOMPATIBILITY.
1849 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1850 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1851 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1852 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1853 Sup_set_def, le_def, less_def, option_map_def now with object
1854 equality. INCOMPATIBILITY.
1856 * Records. Removed K_record, and replaced it by pure lambda term
1857 %x. c. The simplifier setup is now more robust against eta expansion.
1858 INCOMPATIBILITY: in cases explicitly referring to K_record.
1860 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1862 * Library/ListVector: new theory of arithmetic vector operations.
1864 * Library/Order_Relation: new theory of various orderings as sets of
1865 pairs. Defines preorders, partial orders, linear orders and
1866 well-orders on sets and on types.
1871 * Renamed some theories to allow to loading both ZF and HOL in the
1874 Datatype -> Datatype_ZF
1875 Inductive -> Inductive_ZF
1882 INCOMPATIBILITY: ZF theories that import individual theories below
1883 Main might need to be adapted. Regular theory Main is still
1884 available, as trivial extension of Main_ZF.
1889 * ML within Isar: antiquotation @{const name} or @{const
1890 name(typargs)} produces statically-checked Const term.
1892 * Functor NamedThmsFun: data is available to the user as dynamic fact
1893 (of the same name). Removed obsolete print command.
1895 * Removed obsolete "use_legacy_bindings" function.
1897 * The ``print mode'' is now a thread-local value derived from a global
1898 template (the former print_mode reference), thus access becomes
1899 non-critical. The global print_mode reference is for session
1900 management only; user-code should use print_mode_value,
1901 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1903 * Functions system/system_out provide a robust way to invoke external
1904 shell commands, with propagation of interrupts (requires Poly/ML
1905 5.2.1). Do not use OS.Process.system etc. from the basis library!
1910 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1911 in accordance with Proof General 3.7, which prefers GNU emacs.
1913 * isatool tty runs Isabelle process with plain tty interaction;
1914 optional line editor may be specified via ISABELLE_LINE_EDITOR
1915 setting, the default settings attempt to locate "ledit" and "rlwrap".
1917 * isatool browser now works with Cygwin as well, using general
1918 "javapath" function defined in Isabelle process environment.
1920 * YXML notation provides a simple and efficient alternative to
1921 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1922 isatool yxml as described in the Isabelle system manual.
1924 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1925 provides general wrapper for managing an Isabelle process in a robust
1926 fashion, with ``cooked'' output from stdin/stderr.
1928 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1929 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1931 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1932 way of changing the user's settings is via
1933 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1936 * Multithreading.max_threads := 0 refers to the number of actual CPU
1937 cores of the underlying machine, which is a good starting point for
1938 optimal performance tuning. The corresponding usedir option -M allows
1939 "max" as an alias for "0". WARNING: does not work on certain versions
1940 of Mac OS (with Poly/ML 5.1).
1942 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1943 adverse effect of Isabelle flooding interactive front-ends (notably
1944 ProofGeneral / XEmacs).
1948 New in Isabelle2007 (November 2007)
1949 -----------------------------------
1953 * More uniform information about legacy features, notably a
1954 warning/error of "Legacy feature: ...", depending on the state of the
1955 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1956 legacy features will disappear eventually.
1958 * Theory syntax: the header format ``theory A = B + C:'' has been
1959 discontinued in favour of ``theory A imports B C begin''. Use isatool
1960 fixheaders to convert existing theory files. INCOMPATIBILITY.
1962 * Theory syntax: the old non-Isar theory file format has been
1963 discontinued altogether. Note that ML proof scripts may still be used
1964 with Isar theories; migration is usually quite simple with the ML
1965 function use_legacy_bindings. INCOMPATIBILITY.
1967 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1968 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1971 * Theory loader: be more serious about observing the static theory
1972 header specifications (including optional directories), but not the
1973 accidental file locations of previously successful loads. The strict
1974 update policy of former update_thy is now already performed by
1975 use_thy, so the former has been removed; use_thys updates several
1976 theories simultaneously, just as 'imports' within a theory header
1977 specification, but without merging the results. Potential
1978 INCOMPATIBILITY: may need to refine theory headers and commands
1979 ROOT.ML which depend on load order.
1981 * Theory loader: optional support for content-based file
1982 identification, instead of the traditional scheme of full physical
1983 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1984 (cf. the system manual). The new scheme allows to work with
1985 non-finished theories in persistent session images, such that source
1986 files may be moved later on without requiring reloads.
1988 * Theory loader: old-style ML proof scripts being *attached* to a thy
1989 file (with the same base name as the theory) are considered a legacy
1990 feature, which will disappear eventually. Even now, the theory loader
1991 no longer maintains dependencies on such files.
1993 * Syntax: the scope for resolving ambiguities via type-inference is
1994 now limited to individual terms, instead of whole simultaneous
1995 specifications as before. This greatly reduces the complexity of the
1996 syntax module and improves flexibility by separating parsing and
1997 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
1998 'fixes' etc.) are required in rare situations.
2000 * Syntax: constants introduced by new-style packages ('definition',
2001 'abbreviation' etc.) are passed through the syntax module in
2002 ``authentic mode''. This means that associated mixfix annotations
2003 really stick to such constants, independently of potential name space
2004 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2005 trees are represented slightly differently, may need to adapt syntax
2006 translations accordingly. Use CONST marker in 'translations' and
2007 @{const_syntax} antiquotation in 'parse_translation' etc.
2009 * Legacy goal package: reduced interface to the bare minimum required
2010 to keep existing proof scripts running. Most other user-level
2011 functions are now part of the OldGoals structure, which is *not* open
2012 by default (consider isatool expandshort before open OldGoals).
2013 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2014 these tend to cause confusion about the actual goal (!) context being
2015 used here, which is not necessarily the same as the_context().
2017 * Command 'find_theorems': supports "*" wild-card in "name:"
2018 criterion; "with_dups" option. Certain ProofGeneral versions might
2019 support a specific search form (see ProofGeneral/CHANGES).
2021 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2022 by default, which means that "prems" (and also "fixed variables") are
2023 suppressed from proof state output. Note that the ProofGeneral
2024 settings mechanism allows to change and save options persistently, but
2025 older versions of Isabelle will fail to start up if a negative prems
2028 * Local theory targets may be specified by non-nested blocks of
2029 ``context/locale/class ... begin'' followed by ``end''. The body may
2030 contain definitions, theorems etc., including any derived mechanism
2031 that has been implemented on top of these primitives. This concept
2032 generalizes the existing ``theorem (in ...)'' towards more versatility
2035 * Proof General interface: proper undo of final 'end' command;
2036 discontinued Isabelle/classic mode (ML proof scripts).
2039 *** Document preparation ***
2041 * Added antiquotation @{theory name} which prints the given name,
2042 after checking that it refers to a valid ancestor theory in the
2045 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2046 check the given source text as ML type/structure, printing verbatim.
2048 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2049 "c args == rhs" given in the current context. (Any number of
2050 arguments may be given on the LHS.)
2055 * The 'class' package offers a combination of axclass and locale to
2056 achieve Haskell-like type classes in Isabelle. Definitions and
2057 theorems within a class context produce both relative results (with
2058 implicit parameters according to the locale context), and polymorphic
2059 constants with qualified polymorphism (according to the class
2060 context). Within the body context of a 'class' target, a separate
2061 syntax layer ("user space type system") takes care of converting
2062 between global polymorphic consts and internal locale representation.
2063 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2064 "isatool doc classes" provides a tutorial.
2066 * Generic code generator framework allows to generate executable
2067 code for ML and Haskell (including Isabelle classes). A short usage
2070 internal compilation:
2071 export_code <list of constants (term syntax)> in SML
2072 writing SML code to a file:
2073 export_code <list of constants (term syntax)> in SML <filename>
2074 writing OCaml code to a file:
2075 export_code <list of constants (term syntax)> in OCaml <filename>
2076 writing Haskell code to a bunch of files:
2077 export_code <list of constants (term syntax)> in Haskell <filename>
2079 evaluating closed propositions to True/False using code generation:
2082 Reasonable default setup of framework in HOL.
2084 Theorem attributs for selecting and transforming function equations theorems:
2086 [code fun]: select a theorem as function equation for a specific constant
2087 [code fun del]: deselect a theorem as function equation for a specific constant
2088 [code inline]: select an equation theorem for unfolding (inlining) in place
2089 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2091 User-defined serializations (target in {SML, OCaml, Haskell}):
2093 code_const <and-list of constants (term syntax)>
2094 {(target) <and-list of const target syntax>}+
2096 code_type <and-list of type constructors>
2097 {(target) <and-list of type target syntax>}+
2099 code_instance <and-list of instances>
2101 where instance ::= <type constructor> :: <class>
2103 code_class <and_list of classes>
2104 {(target) <and-list of class target syntax>}+
2105 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2107 code_instance and code_class only are effective to target Haskell.
2109 For example usage see src/HOL/ex/Codegenerator.thy and
2110 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2111 generation from Isabelle/HOL theories is available via "isatool doc
2114 * Code generator: consts in 'consts_code' Isar commands are now
2115 referred to by usual term syntax (including optional type
2118 * Command 'no_translations' removes translation rules from theory
2121 * Overloaded definitions are now actually checked for acyclic
2122 dependencies. The overloading scheme is slightly more general than
2123 that of Haskell98, although Isabelle does not demand an exact
2124 correspondence to type class and instance declarations.
2125 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2126 exotic versions of overloading -- at the discretion of the user!
2128 Polymorphic constants are represented via type arguments, i.e. the
2129 instantiation that matches an instance against the most general
2130 declaration given in the signature. For example, with the declaration
2131 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2132 as c(nat). Overloading is essentially simultaneous structural
2133 recursion over such type arguments. Incomplete specification patterns
2134 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2135 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2136 Command 'print_theory' outputs the normalized system of recursive
2137 equations, see section "definitions".
2139 * Configuration options are maintained within the theory or proof
2140 context (with name and type bool/int/string), providing a very simple
2141 interface to a poor-man's version of general context data. Tools may
2142 declare options in ML (e.g. using Attrib.config_int) and then refer to
2143 these values using Config.get etc. Users may change options via an
2144 associated attribute of the same name. This form of context
2145 declaration works particularly well with commands 'declare' or
2146 'using', for example ``declare [[foo = 42]]''. Thus it has become
2147 very easy to avoid global references, which would not observe Isar
2148 toplevel undo/redo and fail to work with multithreading.
2150 Various global ML references of Pure and HOL have been turned into
2151 configuration options:
2153 Unify.search_bound unify_search_bound
2154 Unify.trace_bound unify_trace_bound
2155 Unify.trace_simp unify_trace_simp
2156 Unify.trace_types unify_trace_types
2157 Simplifier.simp_depth_limit simp_depth_limit
2158 Blast.depth_limit blast_depth_limit
2159 DatatypeProp.dtK datatype_distinctness_limit
2160 fast_arith_neq_limit fast_arith_neq_limit
2161 fast_arith_split_limit fast_arith_split_limit
2163 * Named collections of theorems may be easily installed as context
2164 data using the functor NamedThmsFun (see also
2165 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2166 attributes; there is also a toplevel print command. This facility is
2167 just a common case of general context data, which is the preferred way
2168 for anything more complex than just a list of facts in canonical
2171 * Isar: command 'declaration' augments a local theory by generic
2172 declaration functions written in ML. This enables arbitrary content
2173 being added to the context, depending on a morphism that tells the
2174 difference of the original declaration context wrt. the application
2175 context encountered later on.
2177 * Isar: proper interfaces for simplification procedures. Command
2178 'simproc_setup' declares named simprocs (with match patterns, and body
2179 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2180 context. ML antiquotation @{simproc name} retrieves named simprocs.
2182 * Isar: an extra pair of brackets around attribute declarations
2183 abbreviates a theorem reference involving an internal dummy fact,
2184 which will be ignored later --- only the effect of the attribute on
2185 the background context will persist. This form of in-place
2186 declarations is particularly useful with commands like 'declare' and
2187 'using', for example ``have A using [[simproc a]] by simp''.
2189 * Isar: method "assumption" (and implicit closing of subproofs) now
2190 takes simple non-atomic goal assumptions into account: after applying
2191 an assumption as a rule the resulting subgoals are solved by atomic
2192 assumption steps. This is particularly useful to finish 'obtain'
2193 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2194 without referring to the original premise "!!x. P x ==> thesis" in the
2195 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2198 * Isar: implicit use of prems from the Isar proof context is
2199 considered a legacy feature. Common applications like ``have A .''
2200 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2201 referencing facts explicitly here improves readability and
2202 maintainability of proof texts.
2204 * Isar: improper proof element 'guess' is like 'obtain', but derives
2205 the obtained context from the course of reasoning! For example:
2207 assume "EX x y. A x & B y" -- "any previous fact"
2208 then guess x and y by clarify
2210 This technique is potentially adventurous, depending on the facts and
2211 proof tools being involved here.
2213 * Isar: known facts from the proof context may be specified as literal
2214 propositions, using ASCII back-quote syntax. This works wherever
2215 named facts used to be allowed so far, in proof commands, proof
2216 methods, attributes etc. Literal facts are retrieved from the context
2217 according to unification of type and term parameters. For example,
2218 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2219 theorems in the current context, then these are valid literal facts:
2220 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2222 There is also a proof method "fact" which does the same composition
2223 for explicit goal states, e.g. the following proof texts coincide with
2224 certain special cases of literal facts:
2226 have "A" by fact == note `A`
2227 have "A ==> B" by fact == note `A ==> B`
2228 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2229 have "P a ==> Q a" by fact == note `P a ==> Q a`
2231 * Isar: ":" (colon) is no longer a symbolic identifier character in
2232 outer syntax. Thus symbolic identifiers may be used without
2233 additional white space in declarations like this: ``assume *: A''.
2235 * Isar: 'print_facts' prints all local facts of the current context,
2236 both named and unnamed ones.
2238 * Isar: 'def' now admits simultaneous definitions, e.g.:
2240 def x == "t" and y == "u"
2242 * Isar: added command 'unfolding', which is structurally similar to
2243 'using', but affects both the goal state and facts by unfolding given
2244 rewrite rules. Thus many occurrences of the 'unfold' method or
2245 'unfolded' attribute may be replaced by first-class proof text.
2247 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2248 and command 'unfolding' now all support object-level equalities
2249 (potentially conditional). The underlying notion of rewrite rule is
2250 analogous to the 'rule_format' attribute, but *not* that of the
2251 Simplifier (which is usually more generous).
2253 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2254 premises of a theorem by n. Useful in conjunction with drule.
2256 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2257 method expression within a sandbox consisting of the first N
2258 sub-goals, which need to exist. For example, ``simp_all [3]''
2259 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2260 simplifies all new goals that emerge from applying rule foo to the
2261 originally first one.
2263 * Isar: schematic goals are no longer restricted to higher-order
2264 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2267 * Isar: the conclusion of a long theorem statement is now either
2268 'shows' (a simultaneous conjunction, as before), or 'obtains'
2269 (essentially a disjunction of cases with local parameters and
2270 assumptions). The latter allows to express general elimination rules
2271 adequately; in this notation common elimination rules look like this:
2273 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2275 obtains x where "P x"
2277 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2281 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2287 The subsequent classical rules even refer to the formal "thesis"
2290 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2293 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2294 obtains "thesis ==> something"
2296 The actual proof of an 'obtains' statement is analogous to that of the
2297 Isar proof element 'obtain', only that there may be several cases.
2298 Optional case names may be specified in parentheses; these will be
2299 available both in the present proof and as annotations in the
2300 resulting rule, for later use with the 'cases' method (cf. attribute
2303 * Isar: the assumptions of a long theorem statement are available as
2304 "assms" fact in the proof context. This is more appropriate than the
2305 (historical) "prems", which refers to all assumptions of the current
2306 context, including those from the target locale, proof body etc.
2308 * Isar: 'print_statement' prints theorems from the current theory or
2309 proof context in long statement form, according to the syntax of a
2312 * Isar: 'obtain' takes an optional case name for the local context
2313 introduction rule (default "that").
2315 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2316 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2319 * Pure: syntax "CONST name" produces a fully internalized constant
2320 according to the current context. This is particularly useful for
2321 syntax translations that should refer to internal constant
2322 representations independently of name spaces.
2324 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2325 instead of "FOO ". This allows multiple binder declarations to coexist
2326 in the same context. INCOMPATIBILITY.
2328 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2329 primitive that also works in a locale context (both for constants and
2330 fixed variables). Type declaration and internal syntactic representation
2331 of given constants retrieved from the context. Likewise, the
2332 'no_notation' command allows to remove given syntax annotations from the
2335 * Isar/locales: new derived specification elements 'axiomatization',
2336 'definition', 'abbreviation', which support type-inference, admit
2337 object-level specifications (equality, equivalence). See also the
2338 isar-ref manual. Examples:
2341 eq (infix "===" 50) where
2342 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2344 definition "f x y = x + y + 1"
2345 definition g where "g x = f x x"
2348 neq (infix "=!=" 50) where
2349 "x =!= y == ~ (x === y)"
2351 These specifications may be also used in a locale context. Then the
2352 constants being introduced depend on certain fixed parameters, and the
2353 constant name is qualified by the locale base name. An internal
2354 abbreviation takes care for convenient input and output, making the
2355 parameters implicit and using the original short name. See also
2356 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2357 entities from a monomorphic theory.
2359 Presently, abbreviations are only available 'in' a target locale, but
2360 not inherited by general import expressions. Also note that
2361 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2362 'translations' in common applications. The "no_abbrevs" print mode
2363 prevents folding of abbreviations in term output.
2365 Concrete syntax is attached to specified constants in internal form,
2366 independently of name spaces. The parse tree representation is
2367 slightly different -- use 'notation' instead of raw 'syntax', and
2368 'translations' with explicit "CONST" markup to accommodate this.
2370 * Pure/Isar: unified syntax for new-style specification mechanisms
2371 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2372 full type inference and dummy patterns ("_"). For example:
2374 definition "K x _ = x"
2376 inductive conj for A B
2377 where "A ==> B ==> conj A B"
2379 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2380 the current context. Print mode "no_abbrevs" prevents inversion of
2381 abbreviations on output.
2383 * Isar/locales: improved parameter handling: use of locales "var" and
2384 "struct" no longer necessary; - parameter renamings are no longer
2385 required to be injective. For example, this allows to define
2386 endomorphisms as locale endom = homom mult mult h.
2388 * Isar/locales: changed the way locales with predicates are defined.
2389 Instead of accumulating the specification, the imported expression is
2390 now an interpretation. INCOMPATIBILITY: different normal form of
2391 locale expressions. In particular, in interpretations of locales with
2392 predicates, goals repesenting already interpreted fragments are not
2393 removed automatically. Use methods `intro_locales' and
2394 `unfold_locales'; see below.
2396 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2397 provide backward reasoning on locales predicates. The methods are
2398 aware of interpretations and discharge corresponding goals.
2399 `intro_locales' is less aggressive then `unfold_locales' and does not
2400 unfold predicates to assumptions.
2402 * Isar/locales: the order in which locale fragments are accumulated
2403 has changed. This enables to override declarations from fragments due
2404 to interpretations -- for example, unwanted simp rules.
2406 * Isar/locales: interpretation in theories and proof contexts has been
2407 extended. One may now specify (and prove) equations, which are
2408 unfolded in interpreted theorems. This is useful for replacing
2409 defined concepts (constants depending on locale parameters) by
2410 concepts already existing in the target context. Example:
2412 interpretation partial_order ["op <= :: [int, int] => bool"]
2413 where "partial_order.less (op <=) (x::int) y = (x < y)"
2415 Typically, the constant `partial_order.less' is created by a
2416 definition specification element in the context of locale
2419 * Method "induct": improved internal context management to support
2420 local fixes and defines on-the-fly. Thus explicit meta-level
2421 connectives !! and ==> are rarely required anymore in inductive goals
2422 (using object-logic connectives for this purpose has been long
2423 obsolete anyway). Common proof patterns are explained in
2424 src/HOL/Induct/Common_Patterns.thy, see also
2425 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2428 * Method "induct": improved handling of simultaneous goals. Instead of
2429 introducing object-level conjunction, the statement is now split into
2430 several conclusions, while the corresponding symbolic cases are nested
2431 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2432 see src/HOL/Induct/Common_Patterns.thy, for example.
2434 * Method "induct": mutual induction rules are now specified as a list
2435 of rule sharing the same induction cases. HOL packages usually provide
2436 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2437 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2438 mutual induction rules differently, i.e. like this:
2440 (induct rule: foo_bar.inducts)
2441 (induct set: foo bar)
2442 (induct pred: foo bar)
2443 (induct type: foo bar)
2445 The ML function ProjectRule.projections turns old-style rules into the
2448 * Method "coinduct": dual of induction, see
2449 src/HOL/Library/Coinductive_List.thy for various examples.
2451 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2452 considered a legacy feature.
2454 * Attribute "symmetric" produces result with standardized schematic
2455 variables (index 0). Potential INCOMPATIBILITY.
2457 * Simplifier: by default the simplifier trace only shows top level
2458 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2459 default. Thus there is less danger of being flooded by the trace. The
2460 trace indicates where parts have been suppressed.
2462 * Provers/classical: removed obsolete classical version of elim_format
2463 attribute; classical elim/dest rules are now treated uniformly when
2464 manipulating the claset.
2466 * Provers/classical: stricter checks to ensure that supplied intro,
2467 dest and elim rules are well-formed; dest and elim rules must have at
2470 * Provers/classical: attributes dest/elim/intro take an optional
2471 weight argument for the rule (just as the Pure versions). Weights are
2472 ignored by automated tools, but determine the search order of single
2475 * Syntax: input syntax now supports dummy variable binding "%_. b",
2476 where the body does not mention the bound variable. Note that dummy
2477 patterns implicitly depend on their context of bounds, which makes
2478 "{_. _}" match any set comprehension as expected. Potential
2479 INCOMPATIBILITY -- parse translations need to cope with syntactic
2480 constant "_idtdummy" in the binding position.
2482 * Syntax: removed obsolete syntactic constant "_K" and its associated
2483 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2484 for example "A -> B" => "Pi A (%_. B)".
2486 * Pure: 'class_deps' command visualizes the subclass relation, using
2487 the graph browser tool.
2489 * Pure: 'print_theory' now suppresses certain internal declarations by
2490 default; use '!' option for full details.
2495 * Method "metis" proves goals by applying the Metis general-purpose
2496 resolution prover (see also http://gilith.com/software/metis/).
2497 Examples are in the directory MetisExamples. WARNING: the
2498 Isabelle/HOL-Metis integration does not yet work properly with
2501 * Command 'sledgehammer' invokes external automatic theorem provers as
2502 background processes. It generates calls to the "metis" method if
2503 successful. These can be pasted into the proof. Users do not have to
2504 wait for the automatic provers to return. WARNING: does not really
2505 work with multi-threading.
2507 * New "auto_quickcheck" feature tests outermost goal statements for
2508 potential counter-examples. Controlled by ML references
2509 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2510 5000 milliseconds). Fails silently if statements is outside of
2511 executable fragment, or any other codgenerator problem occurs.
2513 * New constant "undefined" with axiom "undefined x = undefined".
2515 * Added class "HOL.eq", allowing for code generation with polymorphic
2518 * Some renaming of class constants due to canonical name prefixing in
2519 the new 'class' package:
2521 HOL.abs ~> HOL.abs_class.abs
2522 HOL.divide ~> HOL.divide_class.divide
2523 0 ~> HOL.zero_class.zero
2524 1 ~> HOL.one_class.one
2525 op + ~> HOL.plus_class.plus
2526 op - ~> HOL.minus_class.minus
2527 uminus ~> HOL.minus_class.uminus
2528 op * ~> HOL.times_class.times
2529 op < ~> HOL.ord_class.less
2530 op <= > HOL.ord_class.less_eq
2531 Nat.power ~> Power.power_class.power
2532 Nat.size ~> Nat.size_class.size
2533 Numeral.number_of ~> Numeral.number_class.number_of
2534 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2535 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2536 Orderings.min ~> Orderings.ord_class.min
2537 Orderings.max ~> Orderings.ord_class.max
2538 Divides.op div ~> Divides.div_class.div
2539 Divides.op mod ~> Divides.div_class.mod
2540 Divides.op dvd ~> Divides.div_class.dvd
2542 INCOMPATIBILITY. Adaptions may be required in the following cases:
2544 a) User-defined constants using any of the names "plus", "minus",
2545 "times", "less" or "less_eq". The standard syntax translations for
2546 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2549 b) Variables named "plus", "minus", "times", "less", "less_eq"
2550 INCOMPATIBILITY: use more specific names.
2552 c) Permutative equations (e.g. "a + b = b + a")
2553 Since the change of names also changes the order of terms, permutative
2554 rewrite rules may get applied in a different order. Experience shows
2555 that this is rarely the case (only two adaptions in the whole Isabelle
2556 distribution). INCOMPATIBILITY: rewrite proofs
2558 d) ML code directly refering to constant names
2559 This in general only affects hand-written proof tactics, simprocs and
2560 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2561 Consider using @{const_name} antiquotation.
2563 * New class "default" with associated constant "default".
2565 * Function "sgn" is now overloaded and available on int, real, complex
2566 (and other numeric types), using class "sgn". Two possible defs of
2567 sgn are given as equational assumptions in the classes sgn_if and
2568 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2571 * Locale "partial_order" now unified with class "order" (cf. theory
2572 Orderings), added parameter "less". INCOMPATIBILITY.
2574 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2575 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2576 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2578 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2579 changed order of proof goals in instance proofs.
2581 * The transitivity reasoner for partial and linear orders is set up
2582 for classes "order" and "linorder". Instances of the reasoner are available
2583 in all contexts importing or interpreting the corresponding locales.
2584 Method "order" invokes the reasoner separately; the reasoner
2585 is also integrated with the Simplifier as a solver. Diagnostic
2586 command 'print_orders' shows the available instances of the reasoner
2587 in the current context.
2589 * Localized monotonicity predicate in theory "Orderings"; integrated
2590 lemmas max_of_mono and min_of_mono with this predicate.
2593 * Formulation of theorem "dense" changed slightly due to integration
2594 with new class dense_linear_order.
2596 * Uniform lattice theory development in HOL.
2598 constants "meet" and "join" now named "inf" and "sup"
2599 constant "Meet" now named "Inf"
2601 classes "meet_semilorder" and "join_semilorder" now named
2602 "lower_semilattice" and "upper_semilattice"
2603 class "lorder" now named "lattice"
2604 class "comp_lat" now named "complete_lattice"
2606 Instantiation of lattice classes allows explicit definitions
2607 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2609 INCOMPATIBILITY. Theorem renames:
2611 meet_left_le ~> inf_le1
2612 meet_right_le ~> inf_le2
2613 join_left_le ~> sup_ge1
2614 join_right_le ~> sup_ge2
2615 meet_join_le ~> inf_sup_ord
2618 le_meet ~> le_inf_iff
2619 le_join ~> ge_sup_conv
2620 meet_idempotent ~> inf_idem
2621 join_idempotent ~> sup_idem
2622 meet_comm ~> inf_commute
2623 join_comm ~> sup_commute
2624 meet_leI1 ~> le_infI1
2625 meet_leI2 ~> le_infI2
2626 le_joinI1 ~> le_supI1
2627 le_joinI2 ~> le_supI2
2628 meet_assoc ~> inf_assoc
2629 join_assoc ~> sup_assoc
2630 meet_left_comm ~> inf_left_commute
2631 meet_left_idempotent ~> inf_left_idem
2632 join_left_comm ~> sup_left_commute
2633 join_left_idempotent ~> sup_left_idem
2636 le_def_meet ~> le_iff_inf
2637 le_def_join ~> le_iff_sup
2638 join_absorp2 ~> sup_absorb2
2639 join_absorp1 ~> sup_absorb1
2640 meet_absorp1 ~> inf_absorb1
2641 meet_absorp2 ~> inf_absorb2
2642 meet_join_absorp ~> inf_sup_absorb
2643 join_meet_absorp ~> sup_inf_absorb
2644 distrib_join_le ~> distrib_sup_le
2645 distrib_meet_le ~> distrib_inf_le
2647 add_meet_distrib_left ~> add_inf_distrib_left
2648 add_join_distrib_left ~> add_sup_distrib_left
2649 is_join_neg_meet ~> is_join_neg_inf
2650 is_meet_neg_join ~> is_meet_neg_sup
2651 add_meet_distrib_right ~> add_inf_distrib_right
2652 add_join_distrib_right ~> add_sup_distrib_right
2653 add_meet_join_distribs ~> add_sup_inf_distribs
2654 join_eq_neg_meet ~> sup_eq_neg_inf
2655 meet_eq_neg_join ~> inf_eq_neg_sup
2656 add_eq_meet_join ~> add_eq_inf_sup
2657 meet_0_imp_0 ~> inf_0_imp_0
2658 join_0_imp_0 ~> sup_0_imp_0
2659 meet_0_eq_0 ~> inf_0_eq_0
2660 join_0_eq_0 ~> sup_0_eq_0
2661 neg_meet_eq_join ~> neg_inf_eq_sup
2662 neg_join_eq_meet ~> neg_sup_eq_inf
2663 join_eq_if ~> sup_eq_if
2665 mono_meet ~> mono_inf
2666 mono_join ~> mono_sup
2667 meet_bool_eq ~> inf_bool_eq
2668 join_bool_eq ~> sup_bool_eq
2669 meet_fun_eq ~> inf_fun_eq
2670 join_fun_eq ~> sup_fun_eq
2671 meet_set_eq ~> inf_set_eq
2672 join_set_eq ~> sup_set_eq
2673 meet1_iff ~> inf1_iff
2674 meet2_iff ~> inf2_iff
2683 join1_iff ~> sup1_iff
2684 join2_iff ~> sup2_iff
2694 is_meet_Meet ~> is_meet_Inf
2695 Meet_bool_def ~> Inf_bool_def
2696 Meet_fun_def ~> Inf_fun_def
2697 Meet_greatest ~> Inf_greatest
2698 Meet_lower ~> Inf_lower
2699 Meet_set_def ~> Inf_set_def
2702 Sup_bool_eq ~> Sup_bool_def
2703 Sup_fun_eq ~> Sup_fun_def
2704 Sup_set_eq ~> Sup_set_def
2706 listsp_meetI ~> listsp_infI
2707 listsp_meet_eq ~> listsp_inf_eq
2712 * Added syntactic class "size"; overloaded constant "size" now has
2713 type "'a::size ==> bool"
2715 * Internal reorganisation of `size' of datatypes: size theorems
2716 "foo.size" are no longer subsumed by "foo.simps" (but are still
2717 simplification rules by default!); theorems "prod.size" now named
2720 * Class "div" now inherits from class "times" rather than "type".
2723 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2724 Linorder etc. have disappeared; operations defined in terms of
2725 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2727 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2729 * HOL-Word: New extensive library and type for generic, fixed size
2730 machine words, with arithemtic, bit-wise, shifting and rotating
2731 operations, reflection into int, nat, and bool lists, automation for
2732 linear arithmetic (by automatic reflection into nat or int), including
2733 lemmas on overflow and monotonicity. Instantiated to all appropriate
2734 arithmetic type classes, supporting automatic simplification of
2735 numerals on all operations.
2737 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2739 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2741 * Code generator library theories:
2742 - Code_Integer represents HOL integers by big integer literals in target
2744 - Code_Char represents HOL characters by character literals in target
2746 - Code_Char_chr like Code_Char, but also offers treatment of character
2747 codes; includes Code_Integer.
2748 - Executable_Set allows to generate code for finite sets using lists.
2749 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2751 - Executable_Real implements a subset of real numbers, namly those
2752 representable by rational numbers.
2753 - Efficient_Nat implements natural numbers by integers, which in general will
2754 result in higher efficency; pattern matching with 0/Suc is eliminated;
2755 includes Code_Integer.
2756 - Code_Index provides an additional datatype index which is mapped to
2757 target-language built-in integers.
2758 - Code_Message provides an additional datatype message_string which is isomorphic to
2759 strings; messages are mapped to target-language strings.
2761 * New package for inductive predicates
2763 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2766 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2767 for z_1 :: U_1 and ... and z_n :: U_m
2769 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2772 with full support for type-inference, rather than
2774 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2776 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2777 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2779 inductive "s z_1 ... z_m"
2781 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2784 For backward compatibility, there is a wrapper allowing inductive
2785 sets to be defined with the new package via
2788 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2789 for z_1 :: U_1 and ... and z_n :: U_m
2791 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2797 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2798 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2799 for z_1 :: U_1 and ... and z_n :: U_m
2801 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2802 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2805 if the additional syntax "p ..." is required.
2807 Numerous examples can be found in the subdirectories src/HOL/Auth,
2808 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2812 - Since declaration and definition of inductive sets or predicates
2813 is no longer separated, abbreviations involving the newly
2814 introduced sets or predicates must be specified together with the
2815 introduction rules after the 'where' keyword (see above), rather
2816 than before the actual inductive definition.
2818 - The variables in induction and elimination rules are now
2819 quantified in the order of their occurrence in the introduction
2820 rules, rather than in alphabetical order. Since this may break
2821 some proofs, these proofs either have to be repaired, e.g. by
2822 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2823 statements of the form
2825 case (rule_i a_i_1 ... a_i_{k_i})
2827 or the old order of quantification has to be restored by explicitly adding
2828 meta-level quantifiers in the introduction rules, i.e.
2830 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2832 - The format of the elimination rules is now
2834 p z_1 ... z_m x_1 ... x_n ==>
2835 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2840 (x_1, ..., x_n) : s z_1 ... z_m ==>
2841 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2844 for sets rather than
2846 x : s z_1 ... z_m ==>
2847 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2850 This may require terms in goals to be expanded to n-tuples
2851 (e.g. using case_tac or simplification with the split_paired_all
2852 rule) before the above elimination rule is applicable.
2854 - The elimination or case analysis rules for (mutually) inductive
2855 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2856 list of rules "p_1_..._p_k.elims" is no longer available.
2858 * New package "function"/"fun" for general recursive functions,
2859 supporting mutual and nested recursion, definitions in local contexts,
2860 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2861 for small examples, and the separate tutorial on the function
2862 package. The old recdef "package" is still available as before, but
2863 users are encouraged to use the new package.
2865 * Method "lexicographic_order" automatically synthesizes termination
2866 relations as lexicographic combinations of size measures.
2868 * Case-expressions allow arbitrary constructor-patterns (including
2869 "_") and take their order into account, like in functional
2870 programming. Internally, this is translated into nested
2871 case-expressions; missing cases are added and mapped to the predefined
2872 constant "undefined". In complicated cases printing may no longer show
2873 the original input but the internal form. Lambda-abstractions allow
2874 the same form of pattern matching: "% pat1 => e1 | ..." is an
2875 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2878 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2879 is an abbreviation for "of_nat :: nat => int". The simplification
2880 rules for "of_nat" have been changed to work like "int" did
2881 previously. Potential INCOMPATIBILITY:
2882 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2883 - of_nat_diff and of_nat_mult are no longer default simp rules
2885 * Method "algebra" solves polynomial equations over (semi)rings using
2886 Groebner bases. The (semi)ring structure is defined by locales and the
2887 tool setup depends on that generic context. Installing the method for
2888 a specific type involves instantiating the locale and possibly adding
2889 declarations for computation on the coefficients. The method is
2890 already instantiated for natural numbers and for the axiomatic class
2891 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2892 CALCULEMUS 2007 for the general principles underlying this
2893 architecture of context-aware proof-tools.
2895 * Method "ferrack" implements quantifier elimination over
2896 special-purpose dense linear orders using locales (analogous to
2897 "algebra"). The method is already installed for class
2898 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2901 * Former constant "List.op @" now named "List.append". Use ML
2902 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2903 circumvent possible incompatibilities when working on ML level.
2905 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2907 * New function listsum :: 'a list => 'a for arbitrary monoids.
2908 Special syntax: "SUM x <- xs. f x" (and latex variants)
2910 * New syntax for Haskell-like list comprehension (input only), eg.
2911 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2913 * The special syntax for function "filter" has changed from [x :
2914 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2915 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2917 * [a..b] is now defined for arbitrary linear orders. It used to be
2918 defined on nat only, as an abbreviation for [a..<Suc b]
2921 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2923 * New functions "sorted" and "sort" in src/HOL/List.thy.
2925 * New lemma collection field_simps (an extension of ring_simps) for
2926 manipulating (in)equations involving division. Multiplies with all
2927 denominators that can be proved to be non-zero (in equations) or
2928 positive/negative (in inequations).
2930 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2931 have been improved and renamed to ring_simps, group_simps and
2932 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2933 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2935 * Theory Library/Commutative_Ring: switched from recdef to function
2936 package; constants add, mul, pow now curried. Infix syntax for
2937 algebraic operations.
2939 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2942 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2945 * HOL/records: generalised field-update to take a function on the
2946 field rather than the new value: r(|A := x|) is translated to A_update
2947 (K x) r The K-combinator that is internally used is called K_record.
2948 INCOMPATIBILITY: Usage of the plain update functions has to be
2951 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2952 * x = 0, which are required for a semiring. Richer structures do not
2953 inherit from semiring_0 anymore, because this property is a theorem
2954 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2955 there is more to prove, but this is mostly trivial.
2957 * Class "recpower" is generalized to arbitrary monoids, not just
2958 commutative semirings. INCOMPATIBILITY: may need to incorporate
2959 commutativity or semiring properties additionally.
2961 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2962 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2963 better use 'abbreviation'.
2965 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2967 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2968 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2969 significant changes for setting up numeral syntax for types:
2970 - New constants Numeral.pred and Numeral.succ instead
2971 of former Numeral.bin_pred and Numeral.bin_succ.
2972 - Use integer operations instead of bin_add, bin_mult and so on.
2973 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2974 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2976 See src/HOL/Integ/IntArith.thy for an example setup.
2978 * Command 'normal_form' computes the normal form of a term that may
2979 contain free variables. For example ``normal_form "rev [a, b, c]"''
2980 produces ``[b, c, a]'' (without proof). This command is suitable for
2981 heavy-duty computations because the functions are compiled to ML
2982 first. Correspondingly, a method "normalization" is provided. See
2983 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2985 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2986 25 like -->); output depends on the "iff" print_mode, the default is
2987 "A = B" (with priority 50).
2989 * Relations less (<) and less_eq (<=) are also available on type bool.
2990 Modified syntax to disallow nesting without explicit parentheses,
2991 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2994 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2996 * Relation composition operator "op O" now has precedence 75 and binds
2997 stronger than union and intersection. INCOMPATIBILITY.
2999 * The old set interval syntax "{m..n(}" (and relatives) has been
3000 removed. Use "{m..<n}" (and relatives) instead.
3002 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3003 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3004 ``declare [[simproc del: neq]]''.
3006 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3009 * Theorem Cons_eq_map_conv no longer declared as "simp".
3011 * Theorem setsum_mult renamed to setsum_right_distrib.
3013 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3016 * Reimplemented methods "sat" and "satx", with several improvements:
3017 goals no longer need to be stated as "<prems> ==> False", equivalences
3018 (i.e. "=" on type bool) are handled, variable names of the form
3019 "lit_<n>" are no longer reserved, significant speedup.
3021 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3022 zChaff is still supported as well.
3024 * 'inductive' and 'datatype': provide projections of mutual rules,
3025 bundled as foo_bar.inducts;
3027 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3030 * Library: moved theory Accessible_Part to main HOL.
3032 * Library: added theory Coinductive_List of potentially infinite lists
3033 as greatest fixed-point.
3035 * Library: added theory AssocList which implements (finite) maps as
3038 * Method "evaluation" solves goals (i.e. a boolean expression)
3039 efficiently by compiling it to ML. The goal is "proved" (via an
3040 oracle) if it evaluates to True.
3042 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3043 also when invoked by the simplifier. This results in the Simplifier
3044 being more powerful on arithmetic goals. INCOMPATIBILITY.
3045 Configuration option fast_arith_split_limit=0 recovers the old
3048 * Support for hex (0x20) and binary (0b1001) numerals.
3050 * New method: reify eqs (t), where eqs are equations for an
3051 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3052 parameter, computes a term s::'b and a list xs::'a list and proves the
3053 theorem I xs s = t. This is also known as reification or quoting. The
3054 resulting theorem is applied to the subgoal to substitute t with I xs
3055 s. If t is omitted, the subgoal itself is reified.
3057 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3058 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3059 where f is supposed to be a computable function (in the sense of code
3060 generattion). The method uses reify to compute s and xs as above then
3061 applies corr_thm and uses normalization by evaluation to "prove" f s =
3062 r and finally gets the theorem t = r, which is again applied to the
3063 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3065 * Reflection: Automatic reification now handels binding, an example is
3066 available in src/HOL/ex/ReflectionEx.thy
3068 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3069 command 'statespace' that is similar to 'record', but introduces an
3070 abstract specification based on the locale infrastructure instead of
3071 HOL types. This leads to extra flexibility in composing state spaces,
3072 in particular multiple inheritance and renaming of components.
3077 * Hyperreal: Functions root and sqrt are now defined on negative real
3078 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3079 Nonnegativity side conditions have been removed from many lemmas, so
3080 that more subgoals may now be solved by simplification; potential
3083 * Real: new type classes formalize real normed vector spaces and
3084 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3085 and norm :: 'a => real.
3087 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3088 reals into other types. The overloaded constant Reals :: 'a set is now
3089 defined as range of_real; potential INCOMPATIBILITY.
3091 * Real: proper support for ML code generation, including 'quickcheck'.
3092 Reals are implemented as arbitrary precision rationals.
3094 * Hyperreal: Several constants that previously worked only for the
3095 reals have been generalized, so they now work over arbitrary vector
3096 spaces. Type annotations may need to be added in some cases; potential
3099 Infinitesimal :: ('a::real_normed_vector) star set
3100 HFinite :: ('a::real_normed_vector) star set
3101 HInfinite :: ('a::real_normed_vector) star set
3102 approx :: ('a::real_normed_vector) star => 'a star => bool
3103 monad :: ('a::real_normed_vector) star => 'a star set
3104 galaxy :: ('a::real_normed_vector) star => 'a star set
3105 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3106 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3107 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3108 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3109 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3110 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3111 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3112 sgn :: 'a::real_normed_vector => 'a
3113 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3115 * Complex: Some complex-specific constants are now abbreviations for
3116 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3117 hnorm. Other constants have been entirely removed in favor of the
3118 polymorphic versions (INCOMPATIBILITY):
3122 HInfinite <-- CInfinite
3123 Infinitesimal <-- CInfinitesimal
3126 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3127 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3128 (ns)deriv <-- (ns)cderiv
3133 * Formalisation of ideals and the quotient construction over rings.
3135 * Order and lattice theory no longer based on records.
3138 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3139 greatest_closed. INCOMPATIBILITY.
3141 * Method algebra is now set up via an attribute. For examples see
3142 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3143 of algebraic structures.
3145 * Renamed theory CRing to Ring.
3150 * Substantial, yet incomplete support for nominal datatypes (binding
3151 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3152 src/HOL/Nominal/Examples. Prospective users should consult
3153 http://isabelle.in.tum.de/nominal/
3158 * ML basics: just one true type int, which coincides with IntInf.int
3161 * ML within Isar: antiquotations allow to embed statically-checked
3162 formal entities in the source, referring to the context available at
3163 compile-time. For example:
3165 ML {* @{sort "{zero,one}"} *}
3166 ML {* @{typ "'a => 'b"} *}
3167 ML {* @{term "%x. x"} *}
3168 ML {* @{prop "x == y"} *}
3169 ML {* @{ctyp "'a => 'b"} *}
3170 ML {* @{cterm "%x. x"} *}
3171 ML {* @{cprop "x == y"} *}
3172 ML {* @{thm asm_rl} *}
3173 ML {* @{thms asm_rl} *}
3174 ML {* @{type_name c} *}
3175 ML {* @{type_syntax c} *}
3176 ML {* @{const_name c} *}
3177 ML {* @{const_syntax c} *}
3180 ML {* @{theory Pure} *}
3181 ML {* @{theory_ref} *}
3182 ML {* @{theory_ref Pure} *}
3185 ML {* @{clasimpset} *}
3187 The same works for sources being ``used'' within an Isar context.
3189 * ML in Isar: improved error reporting; extra verbosity with
3190 ML_Context.trace enabled.
3192 * Pure/General/table.ML: the join operations now works via exceptions
3193 DUP/SAME instead of type option. This is simpler in simple cases, and
3194 admits slightly more efficient complex applications.
3196 * Pure: 'advanced' translation functions (parse_translation etc.) now
3197 use Context.generic instead of just theory.
3199 * Pure: datatype Context.generic joins theory/Proof.context and
3200 provides some facilities for code that works in either kind of
3201 context, notably GenericDataFun for uniform theory and proof data.
3203 * Pure: simplified internal attribute type, which is now always
3204 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3205 local (Proof.context) attributes have been discontinued, while
3206 minimizing code duplication. Thm.rule_attribute and
3207 Thm.declaration_attribute build canonical attributes; see also structure
3208 Context for further operations on Context.generic, notably
3209 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3210 declarations and definitions.
3212 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3213 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3214 init only required for impure data. INCOMPATIBILITY: empty really need
3215 to be empty (no dependencies on theory content!)
3217 * Pure/kernel: consts certification ignores sort constraints given in
3218 signature declarations. (This information is not relevant to the
3219 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3220 potential INCOMPATIBILITY.
3222 * Pure: axiomatic type classes are now purely definitional, with
3223 explicit proofs of class axioms and super class relations performed
3224 internally. See Pure/axclass.ML for the main internal interfaces --
3225 notably AxClass.define_class supercedes AxClass.add_axclass, and
3226 AxClass.axiomatize_class/classrel/arity supersede
3227 Sign.add_classes/classrel/arities.
3229 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3230 global/local versions on theory vs. Proof.context have been
3231 discontinued; Attrib.syntax and Method.syntax have been adapted
3232 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3233 attributes, methods, etc.
3235 * Pure: several functions of signature "... -> theory -> theory * ..."
3236 have been reoriented to "... -> theory -> ... * theory" in order to
3237 allow natural usage in combination with the ||>, ||>>, |-> and
3238 fold_map combinators.
3240 * Pure: official theorem names (closed derivations) and additional
3241 comments (tags) are now strictly separate. Name hints -- which are
3242 maintained as tags -- may be attached any time without affecting the
3245 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3246 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3247 achieve the old behaviour.
3249 * Pure: the "Goal" constant is now called "prop", supporting a
3250 slightly more general idea of ``protecting'' meta-level rule
3253 * Pure: Logic.(un)varify only works in a global context, which is now
3254 enforced instead of silently assumed. INCOMPATIBILITY, may use
3255 Logic.legacy_(un)varify as temporary workaround.
3257 * Pure: structure Name provides scalable operations for generating
3258 internal variable names, notably Name.variants etc. This replaces
3259 some popular functions from term.ML:
3261 Term.variant -> Name.variant
3262 Term.variantlist -> Name.variant_list
3263 Term.invent_names -> Name.invent_list
3265 Note that low-level renaming rarely occurs in new code -- operations
3266 from structure Variable are used instead (see below).
3268 * Pure: structure Variable provides fundamental operations for proper
3269 treatment of fixed/schematic variables in a context. For example,
3270 Variable.import introduces fixes for schematics of given facts and
3271 Variable.export reverses the effect (up to renaming) -- this replaces
3272 various freeze_thaw operations.
3274 * Pure: structure Goal provides simple interfaces for
3275 init/conclude/finish and tactical prove operations (replacing former
3276 Tactic.prove). Goal.prove is the canonical way to prove results
3277 within a given context; Goal.prove_global is a degraded version for
3278 theory level goals, including a global Drule.standard. Note that
3279 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3280 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3281 in a locale context).
3283 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3284 and type checking (Syntax.check_term etc.), with common combinations
3285 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3286 which are considered legacy and await removal.
3288 * Pure/Syntax: generic interfaces for type unchecking
3289 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3290 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3291 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3292 available for convenience, but refer to the very same operations using
3293 a mere theory instead of a full context.
3295 * Isar: simplified treatment of user-level errors, using exception
3296 ERROR of string uniformly. Function error now merely raises ERROR,
3297 without any side effect on output channels. The Isar toplevel takes
3298 care of proper display of ERROR exceptions. ML code may use plain
3299 handle/can/try; cat_error may be used to concatenate errors like this:
3301 ... handle ERROR msg => cat_error msg "..."
3303 Toplevel ML code (run directly or through the Isar toplevel) may be
3304 embedded into the Isar toplevel with exception display/debug like
3307 Isar.toplevel (fn () => ...)
3309 INCOMPATIBILITY, removed special transform_error facilities, removed
3310 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3311 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3312 -- use plain ERROR instead.
3314 * Isar: theory setup now has type (theory -> theory), instead of a
3315 list. INCOMPATIBILITY, may use #> to compose setup functions.
3317 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3318 ProofContext.debug/verbose flags.
3320 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3321 theory before entering a proof state. Transactions now always see a
3322 quasi-functional intermediate checkpoint, both in interactive and
3325 * Isar: simplified interfaces for outer syntax. Renamed
3326 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3327 OuterSyntax.add_parsers -- this functionality is now included in
3328 OuterSyntax.command etc. INCOMPATIBILITY.
3330 * Simplifier: the simpset of a running simplification process now
3331 contains a proof context (cf. Simplifier.the_context), which is the
3332 very context that the initial simpset has been retrieved from (by
3333 simpset_of/local_simpset_of). Consequently, all plug-in components
3334 (solver, looper etc.) may depend on arbitrary proof data.
3336 * Simplifier.inherit_context inherits the proof context (plus the
3337 local bounds) of the current simplification process; any simproc
3338 etc. that calls the Simplifier recursively should do this! Removed
3339 former Simplifier.inherit_bounds, which is already included here --
3340 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3341 specify an explicit context using Simplifier.context/theory_context.
3343 * Simplifier/Classical Reasoner: more abstract interfaces
3344 change_simpset/claset for modifying the simpset/claset reference of a
3345 theory; raw versions simpset/claset_ref etc. have been discontinued --
3348 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3354 * settings: the default heap location within ISABELLE_HOME_USER now
3355 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3356 Isabelle installations.
3358 * isabelle-process: option -S (secure mode) disables some critical
3359 operations, notably runtime compilation and evaluation of ML source
3362 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3364 * Support for parallel execution, using native multicore support of
3365 Poly/ML 5.1. The theory loader exploits parallelism when processing
3366 independent theories, according to the given theory header
3367 specifications. The maximum number of worker threads is specified via
3368 usedir option -M or the "max-threads" setting in Proof General. A
3369 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3370 to 6 on a 8-core machine. User-code needs to observe certain
3371 guidelines for thread-safe programming, see appendix A in the Isar
3372 Implementation manual.
3376 New in Isabelle2005 (October 2005)
3377 ----------------------------------
3381 * Theory headers: the new header syntax for Isar theories is
3384 imports <theory1> ... <theoryN>
3385 uses <file1> ... <fileM>
3388 where the 'uses' part is optional. The previous syntax
3390 theory <name> = <theory1> + ... + <theoryN>:
3392 will disappear in the next release. Use isatool fixheaders to convert
3393 existing theory files. Note that there is no change in ancient
3394 non-Isar theories now, but these will disappear soon.
3396 * Theory loader: parent theories can now also be referred to via
3397 relative and absolute paths.
3399 * Command 'find_theorems' searches for a list of criteria instead of a
3400 list of constants. Known criteria are: intro, elim, dest, name:string,
3401 simp:term, and any term. Criteria can be preceded by '-' to select
3402 theorems that do not match. Intro, elim, dest select theorems that
3403 match the current goal, name:s selects theorems whose fully qualified
3404 name contain s, and simp:term selects all simplification rules whose
3405 lhs match term. Any other term is interpreted as pattern and selects
3406 all theorems matching the pattern. Available in ProofGeneral under
3407 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3409 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3411 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3412 matching the current goal as introduction rule and not having "HOL."
3413 in their name (i.e. not being defined in theory HOL).
3415 * Command 'thms_containing' has been discontinued in favour of
3416 'find_theorems'; INCOMPATIBILITY.
3418 * Communication with Proof General is now 8bit clean, which means that
3419 Unicode text in UTF-8 encoding may be used within theory texts (both
3420 formal and informal parts). Cf. option -U of the Isabelle Proof
3421 General interface. Here are some simple examples (cf. src/HOL/ex):
3423 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3424 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3426 * Improved efficiency of the Simplifier and, to a lesser degree, the
3427 Classical Reasoner. Typical big applications run around 2 times
3431 *** Document preparation ***
3433 * Commands 'display_drafts' and 'print_drafts' perform simple output
3434 of raw sources. Only those symbols that do not require additional
3435 LaTeX packages (depending on comments in isabellesym.sty) are
3436 displayed properly, everything else is left verbatim. isatool display
3437 and isatool print are used as front ends (these are subject to the
3438 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3440 * Command tags control specific markup of certain regions of text,
3441 notably folding and hiding. Predefined tags include "theory" (for
3442 theory begin and end), "proof" for proof commands, and "ML" for
3443 commands involving ML code; the additional tags "visible" and
3444 "invisible" are unused by default. Users may give explicit tag
3445 specifications in the text, e.g. ''by %invisible (auto)''. The
3446 interpretation of tags is determined by the LaTeX job during document
3447 preparation: see option -V of isatool usedir, or options -n and -t of
3448 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3451 Several document versions may be produced at the same time via isatool
3452 usedir (the generated index.html will link all of them). Typical
3453 specifications include ''-V document=theory,proof,ML'' to present
3454 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3455 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3456 these parts without any formal replacement text. The Isabelle site
3457 default settings produce ''document'' and ''outline'' versions as
3460 * Several new antiquotations:
3462 @{term_type term} prints a term with its type annotated;
3464 @{typeof term} prints the type of a term;
3466 @{const const} is the same as @{term const}, but checks that the
3467 argument is a known logical constant;
3469 @{term_style style term} and @{thm_style style thm} print a term or
3470 theorem applying a "style" to it
3474 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3475 definitions, equations, inequations etc., 'concl' printing only the
3476 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3477 to print the specified premise. TermStyle.add_style provides an ML
3478 interface for introducing further styles. See also the "LaTeX Sugar"
3479 document practical applications. The ML antiquotation prints
3480 type-checked ML expressions verbatim.
3482 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3483 and 'text' support optional locale specification '(in loc)', which
3484 specifies the default context for interpreting antiquotations. For
3485 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3487 * Option 'locale=NAME' of antiquotations specifies an alternative
3488 context interpreting the subsequent argument. For example: @{thm
3489 [locale=lattice] inf_assoc}.
3491 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3494 * Proper output of antiquotations for theory commands involving a
3495 proof context (such as 'locale' or 'theorem (in loc) ...').
3497 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3498 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3500 * isatool usedir: new option -C (default true) controls whether option
3501 -D should include a copy of the original document directory; -C false
3502 prevents unwanted effects such as copying of administrative CVS data.
3507 * Considerably improved version of 'constdefs' command. Now performs
3508 automatic type-inference of declared constants; additional support for
3509 local structure declarations (cf. locales and HOL records), see also
3510 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3511 sequential dependencies of definitions within a single 'constdefs'
3512 section; moreover, the declared name needs to be an identifier. If
3513 all fails, consider to fall back on 'consts' and 'defs' separately.
3515 * Improved indexed syntax and implicit structures. First of all,
3516 indexed syntax provides a notational device for subscripted
3517 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3518 expressions. Secondly, in a local context with structure
3519 declarations, number indexes \<^sub>n or the empty index (default
3520 number 1) refer to a certain fixed variable implicitly; option
3521 show_structs controls printing of implicit structures. Typical
3522 applications of these concepts involve record types and locales.
3524 * New command 'no_syntax' removes grammar declarations (and
3525 translations) resulting from the given syntax specification, which is
3526 interpreted in the same manner as for the 'syntax' command.
3528 * 'Advanced' translation functions (parse_translation etc.) may depend
3529 on the signature of the theory context being presently used for
3530 parsing/printing, see also isar-ref manual.
3532 * Improved 'oracle' command provides a type-safe interface to turn an
3533 ML expression of type theory -> T -> term into a primitive rule of
3534 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3535 is already included here); see also FOL/ex/IffExample.thy;
3538 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3539 before); "cI" is no longer bound, use "c.intro" instead.
3540 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3541 axclasses vs. locales.
3543 * Improved internal renaming of symbolic identifiers -- attach primes
3544 instead of base 26 numbers.
3546 * New flag show_question_marks controls printing of leading question
3547 marks in schematic variable names.
3549 * In schematic variable names, *any* symbol following \<^isub> or
3550 \<^isup> is now treated as part of the base name. For example, the
3551 following works without printing of awkward ".0" indexes:
3553 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3556 * Inner syntax includes (*(*nested*) comments*).
3558 * Pretty printer now supports unbreakable blocks, specified in mixfix
3559 annotations as "(00...)".
3561 * Clear separation of logical types and nonterminals, where the latter
3562 may only occur in 'syntax' specifications or type abbreviations.
3563 Before that distinction was only partially implemented via type class
3564 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3565 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3566 exotic syntax specifications may require further adaption
3567 (e.g. Cube/Cube.thy).
3569 * Removed obsolete type class "logic", use the top sort {} instead.
3570 Note that non-logical types should be declared as 'nonterminals'
3571 rather than 'types'. INCOMPATIBILITY for new object-logic
3574 * Attributes 'induct' and 'cases': type or set names may now be
3575 locally fixed variables as well.
3577 * Simplifier: can now control the depth to which conditional rewriting
3578 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3581 * Simplifier: simplification procedures may now take the current
3582 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3583 interface), which is very useful for calling the Simplifier
3584 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3585 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3586 low-level mk_simproc no longer applies Logic.varify internally, to
3587 allow for use in a context of fixed variables.
3589 * thin_tac now works even if the assumption being deleted contains !!
3590 or ==>. More generally, erule now works even if the major premise of
3591 the elimination rule contains !! or ==>.
3593 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3595 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3596 from Pure, which contains all common declarations already. Both
3597 theories are defined via plain Isabelle/Isar .thy files.
3598 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3599 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3600 use isatool fixcpure to adapt your theory and ML sources.
3602 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3603 selections of theorems in named facts via index ranges.
3605 * 'print_theorems': in theory mode, really print the difference
3606 wrt. the last state (works for interactive theory development only),
3607 in proof mode print all local facts (cf. 'print_facts');
3609 * 'hide': option '(open)' hides only base names.
3611 * More efficient treatment of intermediate checkpoints in interactive
3614 * Code generator is now invoked via code_module (incremental code
3615 generation) and code_library (modular code generation, ML structures
3616 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3617 must be quoted when used as identifiers.
3619 * New 'value' command for reading, evaluating and printing terms using
3620 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3621 quoted when used as identifier.
3626 * New commands for the interpretation of locale expressions in
3627 theories (1), locales (2) and proof contexts (3). These generate
3628 proof obligations from the expression specification. After the
3629 obligations have been discharged, theorems of the expression are added
3630 to the theory, target locale or proof context. The synopsis of the
3631 commands is a follows:
3633 (1) interpretation expr inst
3634 (2) interpretation target < expr
3635 (3) interpret expr inst
3637 Interpretation in theories and proof contexts require a parameter
3638 instantiation of terms from the current context. This is applied to
3639 specifications and theorems of the interpreted expression.
3640 Interpretation in locales only permits parameter renaming through the
3641 locale expression. Interpretation is smart in that interpretations
3642 that are active already do not occur in proof obligations, neither are
3643 instantiated theorems stored in duplicate. Use 'print_interps' to
3644 inspect active interpretations of a particular locale. For details,
3645 see the Isar Reference manual. Examples can be found in
3646 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3648 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3649 'interpret' instead.
3651 * New context element 'constrains' for adding type constraints to
3654 * Context expressions: renaming of parameters with syntax
3657 * Locale declaration: 'includes' disallowed.
3659 * Proper static binding of attribute syntax -- i.e. types / terms /
3660 facts mentioned as arguments are always those of the locale definition
3661 context, independently of the context of later invocations. Moreover,
3662 locale operations (renaming and type / term instantiation) are applied
3663 to attribute arguments as expected.
3665 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3666 actual attributes; rare situations may require Attrib.attribute to
3667 embed those attributes into Attrib.src that lack concrete syntax.
3668 Attribute implementations need to cooperate properly with the static
3669 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3670 Attrib.XXX_thm etc. already do the right thing without further
3671 intervention. Only unusual applications -- such as "where" or "of"
3672 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3673 on the context and the facts involved -- may have to assign parsed
3674 values to argument tokens explicitly.
3676 * Changed parameter management in theorem generation for long goal
3677 statements with 'includes'. INCOMPATIBILITY: produces a different
3678 theorem statement in rare situations.
3680 * Locale inspection command 'print_locale' omits notes elements. Use
3681 'print_locale!' to have them included in the output.
3686 * Provers/hypsubst.ML: improved version of the subst method, for
3687 single-step rewriting: it now works in bound variable contexts. New is
3688 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3689 rewrite a different subterm than the original subst method, which is
3690 still available as 'simplesubst'.
3692 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3695 * Provers/trancl.ML: new transitivity reasoner for transitive and
3696 reflexive-transitive closure of relations.
3698 * Provers/blast.ML: new reference depth_limit to make blast's depth
3699 limit (previously hard-coded with a value of 20) user-definable.
3701 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3702 is peformed already. Object-logics merely need to finish their
3703 initial simpset configuration as before. INCOMPATIBILITY.
3708 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3711 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3713 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3714 and x-symbol; use option '-m epsilon' to get it actually printed.
3715 Moreover, the mathematically important symbolic identifier \<epsilon>
3716 becomes available as variable, constant etc. INCOMPATIBILITY,
3718 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3719 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3720 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3721 support corresponding Isar calculations.
3723 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3726 * theory SetInterval: changed the syntax for open intervals:
3735 The old syntax is still supported but will disappear in the next
3736 release. For conversion use the following Emacs search and replace
3737 patterns (these are not perfect but work quite well):
3739 {)\([^\.]*\)\.\. -> {\1<\.\.}
3740 \.\.\([^(}]*\)(} -> \.\.<\1}
3742 * Theory Commutative_Ring (in Library): method comm_ring for proving
3743 equalities in commutative rings; method 'algebra' provides a generic
3746 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3747 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3748 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3751 Some new syntax forms are available:
3753 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3754 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3755 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3756 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3758 The latter form "\<Sum>x < k. e" used to be based on a separate
3759 function "Summation", which has been discontinued.
3761 * theory Finite_Set: in structured induction proofs, the insert case
3762 is now 'case (insert x F)' instead of the old counterintuitive 'case
3765 * The 'refute' command has been extended to support a much larger
3766 fragment of HOL, including axiomatic type classes, constdefs and
3767 typedefs, inductive datatypes and recursion.
3769 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3770 Requires zChaff with proof generation to be installed. See
3771 HOL/ex/SAT_Examples.thy for examples.
3773 * Datatype induction via method 'induct' now preserves the name of the
3774 induction variable. For example, when proving P(xs::'a list) by
3775 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3776 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3777 in unstructured proof scripts.
3779 * Reworked implementation of records. Improved scalability for
3780 records with many fields, avoiding performance problems for type
3781 inference. Records are no longer composed of nested field types, but
3782 of nested extension types. Therefore the record type only grows linear
3783 in the number of extensions and not in the number of fields. The
3784 top-level (users) view on records is preserved. Potential
3785 INCOMPATIBILITY only in strange cases, where the theory depends on the
3786 old record representation. The type generated for a record is called
3787 <record_name>_ext_type.
3789 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3790 proofs triggered by a record definition or a simproc (if
3791 quick_and_dirty is enabled). Definitions of large records can take
3794 New simproc record_upd_simproc for simplification of multiple record
3795 updates enabled by default. Moreover, trivial updates are also
3796 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3797 occasionally, since simplification is more powerful by default.
3799 * typedef: proper support for polymorphic sets, which contain extra
3800 type-variables in the term.
3802 * Simplifier: automatically reasons about transitivity chains
3803 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3804 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3805 old proofs break occasionally as simplification may now solve more
3806 goals than previously.
3808 * Simplifier: converts x <= y into x = y if assumption y <= x is
3809 present. Works for all partial orders (class "order"), in particular
3810 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3813 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3814 bound variable or a constant then the let is unfolded. Otherwise
3815 first a is simplified to b, and then f b is simplified to g. If
3816 possible we abstract b from g arriving at "let x = b in h x",
3817 otherwise we unfold the let and arrive at g. The simproc can be
3818 enabled/disabled by the reference use_let_simproc. Potential
3819 INCOMPATIBILITY since simplification is more powerful by default.
3821 * Classical reasoning: the meson method now accepts theorems as arguments.
3823 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3824 jobs to provide advice on the provability of subgoals.
3826 * Theory OrderedGroup and Ring_and_Field: various additions and
3827 improvements to faciliate calculations involving equalities and
3830 The following theorems have been eliminated or modified
3833 abs_eq now named abs_of_nonneg
3834 abs_of_ge_0 now named abs_of_nonneg
3835 abs_minus_eq now named abs_of_nonpos
3836 imp_abs_id now named abs_of_nonneg
3837 imp_abs_neg_id now named abs_of_nonpos
3838 mult_pos now named mult_pos_pos
3839 mult_pos_le now named mult_nonneg_nonneg
3840 mult_pos_neg_le now named mult_nonneg_nonpos
3841 mult_pos_neg2_le now named mult_nonneg_nonpos2
3842 mult_neg now named mult_neg_neg
3843 mult_neg_le now named mult_nonpos_nonpos
3845 * The following lemmas in Ring_and_Field have been added to the simplifier:
3848 not_square_less_zero
3850 The following lemmas have been deleted from Real/RealPow:
3860 * Theory Parity: added rules for simplifying exponents.
3864 The following theorems have been eliminated or modified
3867 list_all_Nil now named list_all.simps(1)
3868 list_all_Cons now named list_all.simps(2)
3869 list_all_conv now named list_all_iff
3870 set_mem_eq now named mem_iff
3872 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3873 asymptotic "big O" calculations. See the notes in BigO.thy.
3878 * Theory RealDef: better support for embedding natural numbers and
3879 integers in the reals.
3881 The following theorems have been eliminated or modified
3884 exp_ge_add_one_self now requires no hypotheses
3885 real_of_int_add reversed direction of equality (use [symmetric])
3886 real_of_int_minus reversed direction of equality (use [symmetric])
3887 real_of_int_diff reversed direction of equality (use [symmetric])
3888 real_of_int_mult reversed direction of equality (use [symmetric])
3890 * Theory RComplete: expanded support for floor and ceiling functions.
3892 * Theory Ln is new, with properties of the natural logarithm
3894 * Hyperreal: There is a new type constructor "star" for making
3895 nonstandard types. The old type names are now type synonyms:
3899 hcomplex = complex star
3901 * Hyperreal: Many groups of similarly-defined constants have been
3902 replaced by polymorphic versions (INCOMPATIBILITY):
3904 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3906 starset <-- starsetNat, starsetC
3907 *s* <-- *sNat*, *sc*
3908 starset_n <-- starsetNat_n, starsetC_n
3909 *sn* <-- *sNatn*, *scn*
3910 InternalSets <-- InternalNatSets, InternalCSets
3912 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3913 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3914 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3915 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3916 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3918 * Hyperreal: Many type-specific theorems have been removed in favor of
3919 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3921 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3922 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3923 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3924 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3925 right_minus <-- hypreal_add_minus
3926 left_minus <-- {hypreal,hcomplex}_add_minus_left
3927 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3928 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3929 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3930 mult_1_right <-- hcomplex_mult_one_right
3931 mult_zero_left <-- hcomplex_mult_zero_left
3932 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3933 right_distrib <-- hypnat_add_mult_distrib2
3934 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3935 right_inverse <-- hypreal_mult_inverse
3936 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3937 order_refl <-- {hypreal,hypnat}_le_refl
3938 order_trans <-- {hypreal,hypnat}_le_trans
3939 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3940 order_less_le <-- {hypreal,hypnat}_less_le
3941 linorder_linear <-- {hypreal,hypnat}_le_linear
3942 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3943 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3944 add_nonneg_nonneg <-- hypreal_le_add_order
3946 * Hyperreal: Separate theorems having to do with type-specific
3947 versions of constants have been merged into theorems that apply to the
3948 new polymorphic constants (INCOMPATIBILITY):
3950 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3951 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3952 STAR_Un <-- {STAR,NatStar,STARC}_Un
3953 STAR_Int <-- {STAR,NatStar,STARC}_Int
3954 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3955 STAR_subset <-- {STAR,NatStar,STARC}_subset
3956 STAR_mem <-- {STAR,NatStar,STARC}_mem
3957 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3958 STAR_diff <-- {STAR,STARC}_diff
3959 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3960 STARC_hcomplex_of_complex}_image_subset
3961 starset_n_Un <-- starset{Nat,C}_n_Un
3962 starset_n_Int <-- starset{Nat,C}_n_Int
3963 starset_n_Compl <-- starset{Nat,C}_n_Compl
3964 starset_n_diff <-- starset{Nat,C}_n_diff
3965 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3966 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3967 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3968 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3969 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3970 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3971 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3972 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3973 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3974 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3975 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3976 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3977 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3978 starfun_diff <-- starfun{C,RC,CR}_diff
3979 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3980 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3981 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3982 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3983 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3984 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3985 starfun_Id <-- starfunC_Id
3986 starfun_approx <-- starfun{Nat,CR}_approx
3987 starfun_capprox <-- starfun{C,RC}_capprox
3988 starfun_abs <-- starfunNat_rabs
3989 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3990 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3991 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3992 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3993 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3994 starfun_add_approx <-- starfunCR_add_approx
3995 starfun_inverse_inverse <-- starfunC_inverse_inverse
3996 starfun_divide <-- starfun{C,CR,RC}_divide
3997 starfun_n <-- starfun{Nat,C}_n
3998 starfun_n_mult <-- starfun{Nat,C}_n_mult
3999 starfun_n_add <-- starfun{Nat,C}_n_add
4000 starfun_n_add_minus <-- starfunNat_n_add_minus
4001 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4002 starfun_n_minus <-- starfun{Nat,C}_n_minus
4003 starfun_n_eq <-- starfun{Nat,C}_n_eq
4005 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4006 star_n_minus <-- {hypreal,hcomplex}_minus
4007 star_n_diff <-- {hypreal,hcomplex}_diff
4008 star_n_mult <-- {hypreal,hcomplex}_mult
4009 star_n_inverse <-- {hypreal,hcomplex}_inverse
4010 star_n_le <-- {hypreal,hypnat}_le
4011 star_n_less <-- {hypreal,hypnat}_less
4012 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4013 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4014 star_n_abs <-- hypreal_hrabs
4015 star_n_divide <-- hcomplex_divide
4017 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4018 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4019 star_of_diff <-- hypreal_of_real_diff
4020 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4021 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4022 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4023 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4024 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4025 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4026 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4027 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4028 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4029 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4030 star_of_number_of <-- {hypreal,hcomplex}_number_of
4031 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4032 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4033 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4034 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4035 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4036 star_of_power <-- hypreal_of_real_power
4037 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4039 * Hyperreal: new method "transfer" that implements the transfer
4040 principle of nonstandard analysis. With a subgoal that mentions
4041 nonstandard types like "'a star", the command "apply transfer"
4042 replaces it with an equivalent one that mentions only standard types.
4043 To be successful, all free variables must have standard types; non-
4044 standard variables must have explicit universal quantifiers.
4046 * Hyperreal: A theory of Taylor series.
4051 * Discontinued special version of 'constdefs' (which used to support
4052 continuous functions) in favor of the general Pure one with full
4055 * New simplification procedure for solving continuity conditions; it
4056 is much faster on terms with many nested lambda abstractions (cubic
4057 instead of exponential time).
4059 * New syntax for domain package: selector names are now optional.
4060 Parentheses should be omitted unless argument is lazy, for example:
4062 domain 'a stream = cons "'a" (lazy "'a stream")
4064 * New command 'fixrec' for defining recursive functions with pattern
4065 matching; defining multiple functions with mutual recursion is also
4066 supported. Patterns may include the constants cpair, spair, up, sinl,
4067 sinr, or any data constructor defined by the domain package. The given
4068 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4069 syntax and examples.
4071 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4072 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4073 but the proof obligation additionally includes an admissibility
4074 requirement. The packages generate instances of class cpo or pcpo,
4075 with continuity and strictness theorems for Rep and Abs.
4077 * HOLCF: Many theorems have been renamed according to a more standard naming
4078 scheme (INCOMPATIBILITY):
4080 foo_inject: "foo$x = foo$y ==> x = y"
4081 foo_eq: "(foo$x = foo$y) = (x = y)"
4082 foo_less: "(foo$x << foo$y) = (x << y)"
4083 foo_strict: "foo$UU = UU"
4084 foo_defined: "... ==> foo$x ~= UU"
4085 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4090 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4091 including the First Isomorphism Theorem (on quotienting by the kernel
4094 * ZF/Simplifier: install second copy of type solver that actually
4095 makes use of TC rules declared to Isar proof contexts (or locales);
4096 the old version is still required for ML proof scripts.
4101 * Converted to Isar theory format; use locales instead of axiomatic
4107 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4110 * Pure/library.ML no longer defines its own option datatype, but uses
4111 that of the SML basis, which has constructors NONE and SOME instead of
4112 None and Some, as well as exception Option.Option instead of OPTION.
4113 The functions the, if_none, is_some, is_none have been adapted
4114 accordingly, while Option.map replaces apsome.
4116 * Pure/library.ML: the exception LIST has been given up in favour of
4117 the standard exceptions Empty and Subscript, as well as
4118 Library.UnequalLengths. Function like Library.hd and Library.tl are
4119 superceded by the standard hd and tl functions etc.
4121 A number of basic list functions are no longer exported to the ML
4122 toplevel, as they are variants of predefined functions. The following
4123 suggests how one can translate existing code:
4125 rev_append xs ys = List.revAppend (xs, ys)
4126 nth_elem (i, xs) = List.nth (xs, i)
4127 last_elem xs = List.last xs
4128 flat xss = List.concat xss
4129 seq fs = List.app fs
4130 partition P xs = List.partition P xs
4131 mapfilter f xs = List.mapPartial f xs
4133 * Pure/library.ML: several combinators for linear functional
4134 transformations, notably reverse application and composition:
4137 (x, y) |-> f f #-> g
4139 * Pure/library.ML: introduced/changed precedence of infix operators:
4141 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4143 infix 3 o oo ooo oooo;
4144 infix 4 ~~ upto downto;
4146 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4149 * Pure/library.ML: natural list combinators fold, fold_rev, and
4150 fold_map support linear functional transformations and nesting. For
4153 fold f [x1, ..., xN] y =
4154 y |> f x1 |> ... |> f xN
4156 (fold o fold) f [xs1, ..., xsN] y =
4157 y |> fold f xs1 |> ... |> fold f xsN
4159 fold f [x1, ..., xN] =
4162 (fold o fold) f [xs1, ..., xsN] =
4163 fold f xs1 #> ... #> fold f xsN
4165 * Pure/library.ML: the following selectors on type 'a option are
4168 the: 'a option -> 'a (*partial*)
4169 these: 'a option -> 'a where 'a = 'b list
4170 the_default: 'a -> 'a option -> 'a
4171 the_list: 'a option -> 'a list
4173 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4174 basic operations for association lists, following natural argument
4175 order; moreover the explicit equality predicate passed here avoids
4176 potentially expensive polymorphic runtime equality checks.
4177 The old functions may be expressed as follows:
4179 assoc = uncurry (AList.lookup (op =))
4180 assocs = these oo AList.lookup (op =)
4181 overwrite = uncurry (AList.update (op =)) o swap
4183 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4185 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4186 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4188 replacing make_keylist and keyfilter (occassionally used)
4191 make_keylist = AList.make
4192 keyfilter = AList.find (op =)
4194 * eq_fst and eq_snd now take explicit equality parameter, thus
4195 avoiding eqtypes. Naive rewrites:
4197 eq_fst = eq_fst (op =)
4198 eq_snd = eq_snd (op =)
4200 * Removed deprecated apl and apr (rarely used).
4203 apl (n, op) =>>= curry op n
4204 apr (op, m) =>>= fn n => op (n, m)
4206 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4207 provides a reasonably efficient light-weight implementation of sets as
4210 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4211 few new operations; existing lookup and update are now curried to
4212 follow natural argument order (for use with fold etc.);
4213 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4215 * Pure/General: output via the Isabelle channels of
4216 writeln/warning/error etc. is now passed through Output.output, with a
4217 hook for arbitrary transformations depending on the print_mode
4218 (cf. Output.add_mode -- the first active mode that provides a output
4219 function wins). Already formatted output may be embedded into further
4220 text via Output.raw; the result of Pretty.string_of/str_of and derived
4221 functions (string_of_term/cterm/thm etc.) is already marked raw to
4222 accommodate easy composition of diagnostic messages etc. Programmers
4223 rarely need to care about Output.output or Output.raw at all, with
4224 some notable exceptions: Output.output is required when bypassing the
4225 standard channels (writeln etc.), or in token translations to produce
4226 properly formatted results; Output.raw is required when capturing
4227 already output material that will eventually be presented to the user
4228 a second time. For the default print mode, both Output.output and
4229 Output.raw have no effect.
4231 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4232 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4233 cumulative results are displayed at the end of a batch session.
4235 * Pure/General: File.sysify_path and File.quote_sysify path have been
4236 replaced by File.platform_path and File.shell_path (with appropriate
4237 hooks). This provides a clean interface for unusual systems where the
4238 internal and external process view of file names are different.
4240 * Pure: more efficient orders for basic syntactic entities: added
4241 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4242 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4243 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4244 orders now -- potential INCOMPATIBILITY for code that depends on a
4245 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4246 Library.sort_strings on result).
4248 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4249 fold_types traverse types/terms from left to right, observing natural
4250 argument order. Supercedes previous foldl_XXX versions, add_frees,
4251 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4253 * Pure: name spaces have been refined, with significant changes of the
4254 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4255 to extern(_table). The plain name entry path is superceded by a
4256 general 'naming' context, which also includes the 'policy' to produce
4257 a fully qualified name and external accesses of a fully qualified
4258 name; NameSpace.extend is superceded by context dependent
4259 Sign.declare_name. Several theory and proof context operations modify
4260 the naming context. Especially note Theory.restore_naming and
4261 ProofContext.restore_naming to get back to a sane state; note that
4262 Theory.add_path is no longer sufficient to recover from
4263 Theory.absolute_path in particular.
4265 * Pure: new flags short_names (default false) and unique_names
4266 (default true) for controlling output of qualified names. If
4267 short_names is set, names are printed unqualified. If unique_names is
4268 reset, the name prefix is reduced to the minimum required to achieve
4269 the original result when interning again, even if there is an overlap
4270 with earlier declarations.
4272 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4273 now 'extend', and 'merge' gets an additional Pretty.pp argument
4274 (useful for printing error messages). INCOMPATIBILITY.
4276 * Pure: major reorganization of the theory context. Type Sign.sg and
4277 Theory.theory are now identified, referring to the universal
4278 Context.theory (see Pure/context.ML). Actual signature and theory
4279 content is managed as theory data. The old code and interfaces were
4280 spread over many files and structures; the new arrangement introduces
4281 considerable INCOMPATIBILITY to gain more clarity:
4283 Context -- theory management operations (name, identity, inclusion,
4284 parents, ancestors, merge, etc.), plus generic theory data;
4286 Sign -- logical signature and syntax operations (declaring consts,
4287 types, etc.), plus certify/read for common entities;
4289 Theory -- logical theory operations (stating axioms, definitions,
4290 oracles), plus a copy of logical signature operations (consts,
4291 types, etc.); also a few basic management operations (Theory.copy,
4294 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4295 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4296 for convenience -- they merely return the theory.
4298 * Pure: type Type.tsig is superceded by theory in most interfaces.
4300 * Pure: the Isar proof context type is already defined early in Pure
4301 as Context.proof (note that ProofContext.context and Proof.context are
4302 aliases, where the latter is the preferred name). This enables other
4303 Isabelle components to refer to that type even before Isar is present.
4305 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4306 typeK, constK, axiomK, oracleK), but provide explicit operations for
4307 any of these kinds. For example, Sign.intern typeK is now
4308 Sign.intern_type, Theory.hide_space Sign.typeK is now
4309 Theory.hide_types. Also note that former
4310 Theory.hide_classes/types/consts are now
4311 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4312 internalize their arguments! INCOMPATIBILITY.
4314 * Pure: get_thm interface (of PureThy and ProofContext) expects
4315 datatype thmref (with constructors Name and NameSelection) instead of
4316 plain string -- INCOMPATIBILITY;
4318 * Pure: cases produced by proof methods specify options, where NONE
4319 means to remove case bindings -- INCOMPATIBILITY in
4322 * Pure: the following operations retrieve axioms or theorems from a
4323 theory node or theory hierarchy, respectively:
4325 Theory.axioms_of: theory -> (string * term) list
4326 Theory.all_axioms_of: theory -> (string * term) list
4327 PureThy.thms_of: theory -> (string * thm) list
4328 PureThy.all_thms_of: theory -> (string * thm) list
4330 * Pure: print_tac now outputs the goal through the trace channel.
4332 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4333 Reference Toplevel.debug (default false) controls detailed printing
4334 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4335 controls execution profiling -- set to 1 for time and 2 for space
4336 (both increase the runtime).
4338 * Isar session: The initial use of ROOT.ML is now always timed,
4339 i.e. the log will show the actual process times, in contrast to the
4340 elapsed wall-clock time that the outer shell wrapper produces.
4342 * Simplifier: improved handling of bound variables (nameless
4343 representation, avoid allocating new strings). Simprocs that invoke
4344 the Simplifier recursively should use Simplifier.inherit_bounds to
4345 avoid local name clashes. Failure to do so produces warnings
4346 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4347 for further details.
4349 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4350 bindings for all theorems stored within a given theory; this may help
4351 in porting non-Isar theories to Isar ones, while keeping ML proof
4352 scripts for the time being.
4354 * ML operator HTML.with_charset specifies the charset begin used for
4355 generated HTML files. For example:
4357 HTML.with_charset "utf-8" use_thy "Hebrew";
4358 HTML.with_charset "utf-8" use_thy "Chinese";
4363 * Allow symlinks to all proper Isabelle executables (Isabelle,
4364 isabelle, isatool etc.).
4366 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4367 isatool doc, isatool mkdir, display_drafts etc.).
4369 * isatool usedir: option -f allows specification of the ML file to be
4370 used by Isabelle; default is ROOT.ML.
4372 * New isatool version outputs the version identifier of the Isabelle
4373 distribution being used.
4375 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4376 (containing Boolean satisfiability problems) into Isabelle/HOL
4381 New in Isabelle2004 (April 2004)
4382 --------------------------------
4386 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4387 Replaces linorder.ML.
4389 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4390 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4391 (\<a>...\<z>), are now considered normal letters, and can therefore
4392 be used anywhere where an ASCII letter (a...zA...Z) has until
4393 now. COMPATIBILITY: This obviously changes the parsing of some
4394 terms, especially where a symbol has been used as a binder, say
4395 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4396 as an identifier. Fix it by inserting a space around former
4397 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4398 existing theory and ML files.
4400 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4402 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4403 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4404 a normal (but invisible) letter. For multiple letter subscripts repeat
4405 \<^isub> like this: x\<^isub>1\<^isub>2.
4407 * Pure: There are now sub-/superscripts that can span more than one
4408 character. Text between \<^bsub> and \<^esub> is set in subscript in
4409 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4410 superscript. The new control characters are not identifier parts.
4412 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4413 content of "..." to the latex file instead of \isacntrl... . The "..."
4414 may consist of any printable characters excluding the end bracket >.
4416 * Pure: Using new Isar command "finalconsts" (or the ML functions
4417 Theory.add_finals or Theory.add_finals_i) it is now possible to
4418 declare constants "final", which prevents their being given a definition
4419 later. It is useful for constants whose behaviour is fixed axiomatically
4420 rather than definitionally, such as the meta-logic connectives.
4422 * Pure: 'instance' now handles general arities with general sorts
4423 (i.e. intersections of classes),
4425 * Presentation: generated HTML now uses a CSS style sheet to make layout
4426 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4427 It can be changed to alter the colors/layout of generated pages.
4432 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4433 cut_tac, subgoal_tac and thin_tac:
4434 - Now understand static (Isar) contexts. As a consequence, users of Isar
4435 locales are no longer forced to write Isar proof scripts.
4436 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4438 - INCOMPATIBILITY: names of variables to be instantiated may no
4439 longer be enclosed in quotes. Instead, precede variable name with `?'.
4440 This is consistent with the instantiation attribute "where".
4442 * Attributes "where" and "of":
4443 - Now take type variables of instantiated theorem into account when reading
4444 the instantiation string. This fixes a bug that caused instantiated
4445 theorems to have too special types in some circumstances.
4446 - "where" permits explicit instantiations of type variables.
4448 * Calculation commands "moreover" and "also" no longer interfere with
4449 current facts ("this"), admitting arbitrary combinations with "then"
4453 - Goal statements involving the context element "includes" no longer
4454 generate theorems with internal delta predicates (those ending on
4455 "_axioms") in the premise.
4456 Resolve particular premise with <locale>.intro to obtain old form.
4457 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4458 specification and "includes" elements in goal statement.
4459 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4460 [intro?] and [elim?] (respectively) by default.
4461 - Experimental command for instantiation of locales in proof contexts:
4462 instantiate <label>[<attrs>]: <loc>
4463 Instantiates locale <loc> and adds all its theorems to the current context
4464 taking into account their attributes. Label and attrs are optional
4465 modifiers, like in theorem declarations. If present, names of
4466 instantiated theorems are qualified with <label>, and the attributes
4467 <attrs> are applied after any attributes these theorems might have already.
4468 If the locale has assumptions, a chained fact of the form
4469 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4470 are derived. The command does not support old-style locales declared
4471 with "locale (open)".
4472 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4474 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4480 * Proof import: new image HOL4 contains the imported library from
4481 the HOL4 system with about 2500 theorems. It is imported by
4482 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4483 can be used like any other Isabelle image. See
4484 HOL/Import/HOL/README for more information.
4487 - Much improved handling of linear and partial orders.
4488 Reasoners for linear and partial orders are set up for type classes
4489 "linorder" and "order" respectively, and are added to the default simpset
4490 as solvers. This means that the simplifier can build transitivity chains
4491 to solve goals from the assumptions.
4492 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4493 of blast or auto after simplification become unnecessary because the goal
4494 is solved by simplification already.
4496 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4497 all proved in axiomatic type classes for semirings, rings and fields.
4500 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4501 now formalized using the Ring_and_Field theory mentioned above.
4502 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4503 than before, because now they are set up once in a generic manner.
4504 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4505 Look for the general versions in Ring_and_Field (and Power if they concern
4508 * Type "rat" of the rational numbers is now available in HOL-Complex.
4511 - Record types are now by default printed with their type abbreviation
4512 instead of the list of all field types. This can be configured via
4513 the reference "print_record_type_abbr".
4514 - Simproc "record_upd_simproc" for simplification of multiple updates added
4515 (not enabled by default).
4516 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4517 EX x. x = sel r to True (not enabled by default).
4518 - Tactic "record_split_simp_tac" to split and simplify records added.
4520 * 'specification' command added, allowing for definition by
4521 specification. There is also an 'ax_specification' command that
4522 introduces the new constants axiomatically.
4524 * arith(_tac) is now able to generate counterexamples for reals as well.
4526 * HOL-Algebra: new locale "ring" for non-commutative rings.
4528 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4529 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4531 * HOL-Matrix: a first theory for matrices in HOL with an application of
4532 matrix theory to linear programming.
4534 * Unions and Intersections:
4535 The latex output syntax of UN and INT has been changed
4536 from "\Union x \in A. B" to "\Union_{x \in A} B"
4537 i.e. the index formulae has become a subscript.
4538 Similarly for "\Union x. B", and for \Inter instead of \Union.
4540 * Unions and Intersections over Intervals:
4541 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4542 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4543 like in normal math, and corresponding versions for < and for intersection.
4545 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4546 lexicographic dictonary ordering has been added as "lexord".
4548 * ML: the legacy theory structures Int and List have been removed. They had
4549 conflicted with ML Basis Library structures having the same names.
4551 * 'refute' command added to search for (finite) countermodels. Only works
4552 for a fragment of HOL. The installation of an external SAT solver is
4553 highly recommended. See "HOL/Refute.thy" for details.
4555 * 'quickcheck' command: Allows to find counterexamples by evaluating
4556 formulae under an assignment of free variables to random values.
4557 In contrast to 'refute', it can deal with inductive datatypes,
4558 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4564 * Streams now come with concatenation and are part of the HOLCF image
4568 New in Isabelle2003 (May 2003)
4569 ------------------------------
4573 * Provers/simplifier:
4575 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4576 Assumptions are now subject to complete mutual simplification,
4577 not just from left to right. The simplifier now preserves
4578 the order of assumptions.
4580 Potential INCOMPATIBILITY:
4582 -- simp sometimes diverges where the old version did
4583 not, e.g. invoking simp on the goal
4585 [| P (f x); y = x; f x = f y |] ==> Q
4587 now gives rise to the infinite reduction sequence
4589 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4591 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4594 -- Tactics combining classical reasoner and simplification (such as auto)
4595 are also affected by this change, because many of them rely on
4596 simp. They may sometimes diverge as well or yield a different numbers
4597 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4598 in case of problems. Sometimes subsequent calls to the classical
4599 reasoner will fail because a preceeding call to the simplifier too
4600 eagerly simplified the goal, e.g. deleted redundant premises.
4602 - The simplifier trace now shows the names of the applied rewrite rules
4604 - You can limit the number of recursive invocations of the simplifier
4605 during conditional rewriting (where the simplifie tries to solve the
4606 conditions before applying the rewrite rule):
4607 ML "simp_depth_limit := n"
4608 where n is an integer. Thus you can force termination where previously
4609 the simplifier would diverge.
4611 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4613 - No longer aborts on failed congruence proof. Instead, the
4614 congruence is ignored.
4616 * Pure: New generic framework for extracting programs from constructive
4617 proofs. See HOL/Extraction.thy for an example instantiation, as well
4618 as HOL/Extraction for some case studies.
4620 * Pure: The main goal of the proof state is no longer shown by default, only
4621 the subgoals. This behaviour is controlled by a new flag.
4622 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4623 (ML: Proof.show_main_goal).
4625 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4626 rules whose conclusion matches subgoal 1:
4627 PG menu: Isabelle/Isar -> Show me -> matching rules
4628 The rules are ordered by how closely they match the subgoal.
4629 In particular, rules that solve a subgoal outright are displayed first
4630 (or rather last, the way they are printed).
4631 (ML: ProofGeneral.print_intros())
4633 * Pure: New flag trace_unify_fail causes unification to print
4634 diagnostic information (PG: in trace buffer) when it fails. This is
4635 useful for figuring out why single step proofs like rule, erule or
4638 * Pure: Locale specifications now produce predicate definitions
4639 according to the body of text (covering assumptions modulo local
4640 definitions); predicate "loc_axioms" covers newly introduced text,
4641 while "loc" is cumulative wrt. all included locale expressions; the
4642 latter view is presented only on export into the global theory
4643 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4644 on the old view without predicates;
4646 * Pure: predefined locales "var" and "struct" are useful for sharing
4647 parameters (as in CASL, for example); just specify something like
4648 ``var x + var y + struct M'' as import;
4650 * Pure: improved thms_containing: proper indexing of facts instead of
4651 raw theorems; check validity of results wrt. current name space;
4652 include local facts of proof configuration (also covers active
4653 locales), cover fixed variables in index; may use "_" in term
4654 specification; an optional limit for the number of printed facts may
4655 be given (the default is 40);
4657 * Pure: disallow duplicate fact bindings within new-style theory files
4660 * Provers: improved induct method: assumptions introduced by case
4661 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4662 the goal statement); "foo" still refers to all facts collectively;
4664 * Provers: the function blast.overloaded has been removed: all constants
4665 are regarded as potentially overloaded, which improves robustness in exchange
4666 for slight decrease in efficiency;
4668 * Provers/linorder: New generic prover for transitivity reasoning over
4669 linear orders. Note: this prover is not efficient!
4671 * Isar: preview of problems to finish 'show' now produce an error
4672 rather than just a warning (in interactive mode);
4679 - Produces a counter example if it cannot prove a goal.
4680 Note that the counter example may be spurious if the goal is not a formula
4681 of quantifier-free linear arithmetic.
4682 In ProofGeneral the counter example appears in the trace buffer.
4684 - Knows about div k and mod k where k is a numeral of type nat or int.
4686 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4687 linear arithmetic fails. This takes account of quantifiers and divisibility.
4688 Presburger arithmetic can also be called explicitly via presburger(_tac).
4690 * simp's arithmetic capabilities have been enhanced a bit: it now
4691 takes ~= in premises into account (by performing a case split);
4693 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4694 are distributed over a sum of terms;
4696 * New tactic "trans_tac" and method "trans" instantiate
4697 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4700 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4701 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4703 * 'typedef' command has new option "open" to suppress the set
4706 * functions Min and Max on finite sets have been introduced (theory
4709 * attribute [symmetric] now works for relations as well; it turns
4710 (x,y) : R^-1 into (y,x) : R, and vice versa;
4712 * induct over a !!-quantified statement (say !!x1..xn):
4713 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4715 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4716 %x. None. Warning: empty_def now refers to the previously hidden definition
4719 * Algebra: formalization of classical algebra. Intended as base for
4720 any algebraic development in Isabelle. Currently covers group theory
4721 (up to Sylow's theorem) and ring theory (Universal Property of
4722 Univariate Polynomials). Contributions welcome;
4724 * GroupTheory: deleted, since its material has been moved to Algebra;
4726 * Complex: new directory of the complex numbers with numeric constants,
4727 nonstandard complex numbers, and some complex analysis, standard and
4728 nonstandard (Jacques Fleuriot);
4730 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4732 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4735 * Real/HahnBanach: updated and adapted to locales;
4737 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4740 * UNITY: added the Meier-Sanders theory of progress sets;
4742 * MicroJava: bytecode verifier and lightweight bytecode verifier
4743 as abstract algorithms, instantiated to the JVM;
4745 * Bali: Java source language formalization. Type system, operational
4746 semantics, axiomatic semantics. Supported language features:
4747 classes, interfaces, objects,virtual methods, static methods,
4748 static/instance fields, arrays, access modifiers, definite
4749 assignment, exceptions.
4754 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4757 * Main ZF: virtually all theories converted to new-style format;
4762 * Pure: Tactic.prove provides sane interface for internal proofs;
4763 omits the infamous "standard" operation, so this is more appropriate
4764 than prove_goalw_cterm in many situations (e.g. in simprocs);
4766 * Pure: improved error reporting of simprocs;
4768 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4772 *** Document preparation ***
4774 * uses \par instead of \\ for line breaks in theory text. This may
4775 shift some page breaks in large documents. To get the old behaviour
4776 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4778 * minimized dependencies of isabelle.sty and isabellesym.sty on
4781 * \<euro> now needs package babel/greek instead of marvosym (which
4784 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4789 New in Isabelle2002 (March 2002)
4790 --------------------------------
4792 *** Document preparation ***
4794 * greatly simplified document preparation setup, including more
4795 graceful interpretation of isatool usedir -i/-d/-D options, and more
4796 instructive isatool mkdir; users should basically be able to get
4797 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4798 users may run a separate document processing stage manually like this:
4799 "isatool usedir -D output HOL Test && isatool document Test/output";
4801 * theory dependency graph may now be incorporated into documents;
4802 isatool usedir -g true will produce session_graph.eps/.pdf for use
4803 with \includegraphics of LaTeX;
4805 * proper spacing of consecutive markup elements, especially text
4806 blocks after section headings;
4808 * support bold style (for single symbols only), input syntax is like
4809 this: "\<^bold>\<alpha>" or "\<^bold>A";
4811 * \<bullet> is now output as bold \cdot by default, which looks much
4812 better in printed text;
4814 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4815 note that these symbols are currently unavailable in Proof General /
4816 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4818 * isatool latex no longer depends on changed TEXINPUTS, instead
4819 isatool document copies the Isabelle style files to the target
4825 * Pure/Provers: improved proof by cases and induction;
4826 - 'case' command admits impromptu naming of parameters (such as
4828 - 'induct' method divinates rule instantiation from the inductive
4829 claim; no longer requires excessive ?P bindings for proper
4830 instantiation of cases;
4831 - 'induct' method properly enumerates all possibilities of set/type
4832 rules; as a consequence facts may be also passed through *type*
4833 rules without further ado;
4834 - 'induct' method now derives symbolic cases from the *rulified*
4835 rule (before it used to rulify cases stemming from the internal
4836 atomized version); this means that the context of a non-atomic
4837 statement becomes is included in the hypothesis, avoiding the
4838 slightly cumbersome show "PROP ?case" form;
4839 - 'induct' may now use elim-style induction rules without chaining
4840 facts, using ``missing'' premises from the goal state; this allows
4841 rules stemming from inductive sets to be applied in unstructured
4842 scripts, while still benefitting from proper handling of non-atomic
4843 statements; NB: major inductive premises need to be put first, all
4844 the rest of the goal is passed through the induction;
4845 - 'induct' proper support for mutual induction involving non-atomic
4846 rule statements (uses the new concept of simultaneous goals, see
4848 - append all possible rule selections, but only use the first
4849 success (no backtracking);
4850 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4851 - undeclared rule case names default to numbers 1, 2, 3, ...;
4852 - added 'print_induct_rules' (covered by help item in recent Proof
4854 - moved induct/cases attributes to Pure, methods to Provers;
4855 - generic method setup instantiated for FOL and HOL;
4857 * Pure: support multiple simultaneous goal statements, for example
4858 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4859 meta-level mechanism, this acts as if several individual goals had
4860 been stated separately; in particular common proof methods need to be
4861 repeated in order to cover all claims; note that a single elimination
4862 step is *not* sufficient to establish the two conjunctions, so this
4865 assume "A & B" then have A and B .. (*".." fails*)
4867 better use "obtain" in situations as above; alternative refer to
4868 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4870 * Pure: proper integration with ``locales''; unlike the original
4871 version by Florian Kammller, Isar locales package high-level proof
4872 contexts rather than raw logical ones (e.g. we admit to include
4873 attributes everywhere); operations on locales include merge and
4874 rename; support for implicit arguments (``structures''); simultaneous
4875 type-inference over imports and text; see also HOL/ex/Locales.thy for
4878 * Pure: the following commands have been ``localized'', supporting a
4879 target locale specification "(in name)": 'lemma', 'theorem',
4880 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4881 stored both within the locale and at the theory level (exported and
4882 qualified by the locale name);
4884 * Pure: theory goals may now be specified in ``long'' form, with
4885 ad-hoc contexts consisting of arbitrary locale elements. for example
4886 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4887 definitions may be given, too); the result is a meta-level rule with
4888 the context elements being discharged in the obvious way;
4890 * Pure: new proof command 'using' allows to augment currently used
4891 facts after a goal statement ('using' is syntactically analogous to
4892 'apply', but acts on the goal's facts only); this allows chained facts
4893 to be separated into parts given before and after a claim, as in
4894 ``from a and b have C using d and e <proof>'';
4896 * Pure: renamed "antecedent" case to "rule_context";
4898 * Pure: new 'judgment' command records explicit information about the
4899 object-logic embedding (used by several tools internally); no longer
4900 use hard-wired "Trueprop";
4902 * Pure: added 'corollary' command;
4904 * Pure: fixed 'token_translation' command;
4906 * Pure: removed obsolete 'exported' attribute;
4908 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4909 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4910 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4912 * Pure: method 'atomize' presents local goal premises as object-level
4913 statements (atomic meta-level propositions); setup controlled via
4914 rewrite rules declarations of 'atomize' attribute; example
4915 application: 'induct' method with proper rule statements in improper
4918 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4919 now consider the syntactic context of assumptions, giving a better
4920 chance to get type-inference of the arguments right (this is
4921 especially important for locales);
4923 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4926 * Pure/obtain: the formal conclusion "thesis", being marked as
4927 ``internal'', may no longer be reference directly in the text;
4928 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4931 * Pure: generic 'sym' attribute which declares a rule both as pure
4932 'elim?' and for the 'symmetric' operation;
4934 * Pure: marginal comments ``--'' may now occur just anywhere in the
4935 text; the fixed correlation with particular command syntax has been
4938 * Pure: new method 'rules' is particularly well-suited for proof
4939 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4940 but often produces more compact proof terms with less detours;
4942 * Pure/Provers/classical: simplified integration with pure rule
4943 attributes and methods; the classical "intro?/elim?/dest?"
4944 declarations coincide with the pure ones; the "rule" method no longer
4945 includes classically swapped intros; "intro" and "elim" methods no
4946 longer pick rules from the context; also got rid of ML declarations
4947 AddXIs/AddXEs/AddXDs; all of this has some potential for
4950 * Provers/classical: attribute 'swapped' produces classical inversions
4951 of introduction rules;
4953 * Provers/simplifier: 'simplified' attribute may refer to explicit
4954 rules instead of full simplifier context; 'iff' attribute handles
4957 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4959 * HOL: 'recdef' now fails on unfinished automated proofs, use
4960 "(permissive)" option to recover old behavior;
4962 * HOL: 'inductive' no longer features separate (collective) attributes
4963 for 'intros' (was found too confusing);
4965 * HOL: properly declared induction rules less_induct and
4971 * HOL: moved over to sane numeral syntax; the new policy is as
4974 - 0 and 1 are polymorphic constants, which are defined on any
4975 numeric type (nat, int, real etc.);
4977 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4978 binary representation internally;
4980 - type nat has special constructor Suc, and generally prefers Suc 0
4981 over 1::nat and Suc (Suc 0) over 2::nat;
4983 This change may cause significant problems of INCOMPATIBILITY; here
4984 are some hints on converting existing sources:
4986 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4987 entities, so expressions involving "-" (unary or binary minus) need
4988 to be spaced properly;
4990 - existing occurrences of "1" may need to be constraint "1::nat" or
4991 even replaced by Suc 0; similar for old "2";
4993 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4995 - remove all special provisions on numerals in proofs;
4997 * HOL: simp rules nat_number expand numerals on nat to Suc/0
4998 representation (depends on bin_arith_simps in the default context);
5000 * HOL: symbolic syntax for x^2 (numeral 2);
5002 * HOL: the class of all HOL types is now called "type" rather than
5003 "term"; INCOMPATIBILITY, need to adapt references to this type class
5004 in axclass/classes, instance/arities, and (usually rare) occurrences
5005 in typings (of consts etc.); internally the class is called
5006 "HOL.type", ML programs should refer to HOLogic.typeS;
5008 * HOL/record package improvements:
5009 - new derived operations "fields" to build a partial record section,
5010 "extend" to promote a fixed record to a record scheme, and
5011 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5012 declared as simp by default;
5013 - shared operations ("more", "fields", etc.) now need to be always
5014 qualified) --- potential INCOMPATIBILITY;
5015 - removed "make_scheme" operations (use "make" with "extend") --
5017 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5018 - provides cases/induct rules for use with corresponding Isar
5019 methods (for concrete records, record schemes, concrete more
5020 parts, and schematic more parts -- in that order);
5021 - internal definitions directly based on a light-weight abstract
5022 theory of product types over typedef rather than datatype;
5024 * HOL: generic code generator for generating executable ML code from
5025 specifications; specific support for HOL constructs such as inductive
5026 datatypes and sets, as well as recursive functions; can be invoked
5027 via 'generate_code' theory section;
5029 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5031 * HOL: consolidated and renamed several theories. In particular:
5032 Ord.thy has been absorbed into HOL.thy
5033 String.thy has been absorbed into List.thy
5035 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5036 (beware of argument permutation!);
5038 * HOL: linorder_less_split superseded by linorder_cases;
5040 * HOL/List: "nodups" renamed to "distinct";
5042 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5043 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5044 - Ex_def has changed, now need to use some_eq_ex
5046 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5047 in this (rare) case use:
5049 delSWrapper "split_all_tac"
5050 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5052 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5055 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5056 Isabelle's type classes, ^ on functions and relations has too general
5057 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5058 necessary to attach explicit type constraints;
5060 * HOL/Relation: the prefix name of the infix "O" has been changed from
5061 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5062 renamed accordingly (eg "compI" -> "rel_compI").
5064 * HOL: syntax translations now work properly with numerals and records
5067 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5068 of "lam" -- INCOMPATIBILITY;
5070 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5071 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5072 renamed "Product_Type.unit";
5074 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5076 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5077 the "cases" method);
5079 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5082 * HOL/IMP: updated and converted to new-style theory format; several
5083 parts turned into readable document, with proper Isar proof texts and
5084 some explanations (by Gerwin Klein);
5086 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5088 * HOL-Hyperreal is now a logic image;
5093 * Isar: consts/constdefs supports mixfix syntax for continuous
5096 * Isar: domain package adapted to new-style theory format, e.g. see
5099 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5100 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5101 lift.induct_tac, always use UU instead of Undef;
5103 * HOLCF/IMP: updated and converted to new-style theory;
5108 * Isar: proper integration of logic-specific tools and packages,
5109 including theory commands '(co)inductive', '(co)datatype',
5110 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5111 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5113 * theory Main no longer includes AC; for the Axiom of Choice, base
5114 your theory on Main_ZFC;
5116 * the integer library now covers quotients and remainders, with many
5117 laws relating division to addition, multiplication, etc.;
5119 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5120 typeless version of the formalism;
5122 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5125 * ZF/Induct: new directory for examples of inductive definitions,
5126 including theory Multiset for multiset orderings; converted to
5127 new-style theory format;
5129 * ZF: many new theorems about lists, ordinals, etc.;
5134 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5135 variable proof controls level of detail: 0 = no proofs (only oracle
5136 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5137 also ref manual for further ML interfaces;
5139 * Pure/axclass: removed obsolete ML interface
5140 goal_subclass/goal_arity;
5142 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5143 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5144 separate tokens, so expressions involving minus need to be spaced
5147 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5148 rather than "infixl" or "infixr";
5150 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5151 sort constraint specifications in type inference; e.g. "x::_::foo"
5152 ensures that the type of "x" is of sort "foo" (but not necessarily a
5155 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5156 control output of nested => (types); the default behavior is
5159 * Pure/syntax: builtin parse translation for "_constify" turns valued
5160 tokens into AST constants;
5162 * Pure/syntax: prefer later declarations of translations and print
5163 translation functions; potential INCOMPATIBILITY: need to reverse
5164 multiple declarations for same syntax element constant;
5166 * Pure/show_hyps reset by default (in accordance to existing Isar
5169 * Provers/classical: renamed addaltern to addafter, addSaltern to
5172 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5175 * system: tested support for MacOS X; should be able to get Isabelle +
5176 Proof General to work in a plain Terminal after installing Poly/ML
5177 (e.g. from the Isabelle distribution area) and GNU bash alone
5178 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5179 support requires further installations, e.g. from
5180 http://fink.sourceforge.net/);
5182 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5184 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5185 of 40 MB), cf. ML_OPTIONS;
5187 * system: Proof General keywords specification is now part of the
5188 Isabelle distribution (see etc/isar-keywords.el);
5190 * system: support for persistent Proof General sessions (refrain from
5191 outdating all loaded theories on startup); user may create writable
5192 logic images like this: ``isabelle -q HOL Test'';
5194 * system: smart selection of Isabelle process versus Isabelle
5195 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5196 run both "isabelle" and "Isabelle" even if file names are badly
5197 damaged (executable inspects the case of the first letter of its own
5198 name); added separate "isabelle-process" and "isabelle-interface";
5200 * system: refrain from any attempt at filtering input streams; no
5201 longer support ``8bit'' encoding of old isabelle font, instead proper
5202 iso-latin characters may now be used; the related isatools
5203 "symbolinput" and "nonascii" have disappeared as well;
5205 * system: removed old "xterm" interface (the print modes "xterm" and
5206 "xterm_color" are still available for direct use in a suitable
5211 New in Isabelle99-2 (February 2001)
5212 -----------------------------------
5214 *** Overview of INCOMPATIBILITIES ***
5216 * HOL: please note that theories in the Library and elsewhere often use the
5217 new-style (Isar) format; to refer to their theorems in an ML script you must
5218 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5220 * HOL: inductive package no longer splits induction rule aggressively,
5221 but only as far as specified by the introductions given; the old
5222 format may be recovered via ML function complete_split_rule or attribute
5223 'split_rule (complete)';
5225 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5226 gfp_Tarski to gfp_unfold;
5228 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5230 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5231 relation); infix "^^" has been renamed "``"; infix "``" has been
5232 renamed "`"; "univalent" has been renamed "single_valued";
5234 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5237 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5239 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5241 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5242 consequence, it is no longer monotonic wrt. the local goal context
5243 (which is now passed through the inductive cases);
5245 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5246 \<gg> to \<ggreater>;
5249 *** Document preparation ***
5251 * \isabellestyle{NAME} selects version of Isabelle output (currently
5252 available: are "it" for near math-mode best-style output, "sl" for
5253 slanted text style, and "tt" for plain type-writer; if no
5254 \isabellestyle command is given, output is according to slanted
5257 * support sub/super scripts (for single symbols only), input syntax is
5258 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5260 * some more standard symbols; see Appendix A of the system manual for
5261 the complete list of symbols defined in isabellesym.sty;
5263 * improved isabelle style files; more abstract symbol implementation
5264 (should now use \isamath{...} and \isatext{...} in custom symbol
5267 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5268 state; Note that presentation of goal states does not conform to
5269 actual human-readable proof documents. Please do not include goal
5270 states into document output unless you really know what you are doing!
5272 * proper indentation of antiquoted output with proportional LaTeX
5275 * no_document ML operator temporarily disables LaTeX document
5278 * isatool unsymbolize tunes sources for plain ASCII communication;
5283 * Pure: Isar now suffers initial goal statements to contain unbound
5284 schematic variables (this does not conform to actual readable proof
5285 documents, due to unpredictable outcome and non-compositional proof
5286 checking); users who know what they are doing may use schematic goals
5287 for Prolog-style synthesis of proven results;
5289 * Pure: assumption method (an implicit finishing) now handles actual
5292 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5293 initial goal, declare "that" only as Pure intro (only for single
5294 steps); the "that" rule assumption may now be involved in implicit
5295 finishing, thus ".." becomes a feasible for trivial obtains;
5297 * Pure: default proof step now includes 'intro_classes'; thus trivial
5298 instance proofs may be performed by "..";
5300 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5303 * Pure: more robust selection of calculational rules;
5305 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5306 rule (as well as the assumption rule);
5308 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5309 lemmas, using the graph browser tool;
5311 * Pure: predict failure of "show" in interactive mode;
5313 * Pure: 'thms_containing' now takes actual terms as arguments;
5315 * HOL: improved method 'induct' --- now handles non-atomic goals
5316 (potential INCOMPATIBILITY); tuned error handling;
5318 * HOL: cases and induct rules now provide explicit hints about the
5319 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5320 any remaining facts are inserted into the goal verbatim;
5322 * HOL: local contexts (aka cases) may now contain term bindings as
5323 well; the 'cases' and 'induct' methods new provide a ?case binding for
5324 the result to be shown in each case;
5326 * HOL: added 'recdef_tc' command;
5328 * isatool convert assists in eliminating legacy ML scripts;
5333 * HOL/Library: a collection of generic theories to be used together
5334 with main HOL; the theory loader path already includes this directory
5335 by default; the following existing theories have been moved here:
5336 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5337 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5339 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5340 modelling and verification task performed in Isabelle/HOL +
5341 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5343 * HOL/Algebra: special summation operator SUM no longer exists, it has
5344 been replaced by setsum; infix 'assoc' now has priority 50 (like
5345 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5346 'domain', this makes the theory consistent with mathematical
5349 * HOL basics: added overloaded operations "inverse" and "divide"
5350 (infix "/"), syntax for generic "abs" operation, generic summation
5353 * HOL/typedef: simplified package, provide more useful rules (see also
5356 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5357 now expressed as a proper nested rule (old-style tactic scripts may
5358 require atomize_strip_tac to cope with non-atomic premises);
5360 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5361 to "split_conv" (old name still available for compatibility);
5363 * HOL: improved concrete syntax for strings (e.g. allows translation
5364 rules with string literals);
5366 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5367 and Fleuriot's mechanization of analysis, including the transcendental
5368 functions for the reals;
5370 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5375 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5376 "lam" is displayed as TWO lambda-symbols
5378 * CTT: theory Main now available, containing everything (that is, Bool
5384 * Pure: the Simplifier has been implemented properly as a derived rule
5385 outside of the actual kernel (at last!); the overall performance
5386 penalty in practical applications is about 50%, while reliability of
5387 the Isabelle inference kernel has been greatly improved;
5389 * print modes "brackets" and "no_brackets" control output of nested =>
5390 (types) and ==> (props); the default behaviour is "brackets";
5392 * Provers: fast_tac (and friends) now handle actual object-logic rules
5393 as assumptions as well;
5395 * system: support Poly/ML 4.0;
5397 * system: isatool install handles KDE version 1 or 2;
5401 New in Isabelle99-1 (October 2000)
5402 ----------------------------------
5404 *** Overview of INCOMPATIBILITIES ***
5406 * HOL: simplification of natural numbers is much changed; to partly
5407 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5408 issue the following ML commands:
5410 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5411 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5413 * HOL: simplification no longer dives into case-expressions; this is
5414 controlled by "t.weak_case_cong" for each datatype t;
5416 * HOL: nat_less_induct renamed to less_induct;
5418 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5419 fixsome to patch .thy and .ML sources automatically;
5421 select_equality -> some_equality
5422 select_eq_Ex -> some_eq_ex
5423 selectI2EX -> someI2_ex
5426 select1_equality -> some1_equality
5427 Eps_sym_eq -> some_sym_eq_trivial
5428 Eps_eq -> some_eq_trivial
5430 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5432 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5435 * HOL: the recursion equations generated by 'recdef' are now called
5436 f.simps instead of f.rules;
5438 * HOL: qed_spec_mp now also handles bounded ALL as well;
5440 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5441 sometimes be needed;
5443 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5445 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5447 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5448 product is now "<*>" instead of "Times"; the lexicographic product is
5449 now "<*lex*>" instead of "**";
5451 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5452 of main HOL, but was unused); better use HOL's datatype package;
5454 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5455 the old syntax may be recovered as follows:
5458 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5459 (infixl "\\<oplus>" 100)
5461 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5463 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5464 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5467 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5468 changed from A/r to A//r;
5470 * ZF: new treatment of arithmetic (nat & int) may break some old
5473 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5474 rulify -> rule_format, elimify -> elim_format, ...);
5476 * Isar/Provers: intro/elim/dest attributes changed; renamed
5477 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5478 should have to change intro!! to intro? only); replaced "delrule" by
5481 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5483 * Provers: strengthened force_tac by using new first_best_tac;
5485 * LaTeX document preparation: several changes of isabelle.sty (see
5489 *** Document preparation ***
5491 * formal comments (text blocks etc.) in new-style theories may now
5492 contain antiquotations of thm/prop/term/typ/text to be presented
5493 according to latex print mode; concrete syntax is like this:
5494 @{term[show_types] "f(x) = a + x"};
5496 * isatool mkdir provides easy setup of Isabelle session directories,
5497 including proper document sources;
5499 * generated LaTeX sources are now deleted after successful run
5500 (isatool document -c); may retain a copy somewhere else via -D option
5503 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5504 style files, achieving self-contained LaTeX sources and simplifying
5507 * old-style theories now produce (crude) LaTeX output as well;
5509 * browser info session directories are now self-contained (may be put
5510 on WWW server seperately); improved graphs of nested sessions; removed
5511 graph for 'all sessions';
5513 * several improvements in isabelle style files; \isabellestyle{it}
5514 produces fake math mode output; \isamarkupheader is now \section by
5515 default; see lib/texinputs/isabelle.sty etc.;
5520 * Isar/Pure: local results and corresponding term bindings are now
5521 subject to Hindley-Milner polymorphism (similar to ML); this
5522 accommodates incremental type-inference very nicely;
5524 * Isar/Pure: new derived language element 'obtain' supports
5525 generalized existence reasoning;
5527 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5528 support accumulation of results, without applying any rules yet;
5529 useful to collect intermediate results without explicit name
5530 references, and for use with transitivity rules with more than 2
5533 * Isar/Pure: scalable support for case-analysis type proofs: new
5534 'case' language element refers to local contexts symbolically, as
5535 produced by certain proof methods; internally, case names are attached
5536 to theorems as "tags";
5538 * Isar/Pure: theory command 'hide' removes declarations from
5539 class/type/const name spaces;
5541 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5542 indicate potential overloading;
5544 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5546 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5547 "{a,b,c}" instead of {a,b,c};
5549 * Isar/Pure now provides its own version of intro/elim/dest
5550 attributes; useful for building new logics, but beware of confusion
5551 with the version in Provers/classical;
5553 * Isar/Pure: the local context of (non-atomic) goals is provided via
5554 case name 'antecedent';
5556 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5557 to the current context is now done automatically);
5559 * Isar/Pure: theory command 'method_setup' provides a simple interface
5560 for definining proof methods in ML;
5562 * Isar/Provers: intro/elim/dest attributes changed; renamed
5563 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5564 most cases, one should have to change intro!! to intro? only);
5565 replaced "delrule" by "rule del";
5567 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5568 'symmetric' attribute (the latter supercedes [RS sym]);
5570 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5571 method modifier); 'simp' method: 'only:' modifier removes loopers as
5572 well (including splits);
5574 * Isar/Provers: Simplifier and Classical methods now support all kind
5575 of modifiers used in the past, including 'cong', 'iff', etc.
5577 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5578 of Simplifier and Classical reasoner);
5580 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5581 now support named cases; major packages (inductive, datatype, primrec,
5582 recdef) support case names and properly name parameters;
5584 * Isar/HOL: new transitivity rules for substitution in inequalities --
5585 monotonicity conditions are extracted to be proven at end of
5588 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5591 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5592 split_if split_if_asm; datatype package provides theorems foo.splits =
5593 foo.split foo.split_asm for each datatype;
5595 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5596 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5597 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5598 use "(cases (simplified))" method in proper proof texts);
5600 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5602 * Isar: names of theorems etc. may be natural numbers as well;
5604 * Isar: 'pr' command: optional arguments for goals_limit and
5605 ProofContext.prems_limit; no longer prints theory contexts, but only
5608 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5609 additional print modes to be specified; e.g. "pr(latex)" will print
5610 proof state according to the Isabelle LaTeX style;
5612 * Isar: improved support for emulating tactic scripts, including proof
5613 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5614 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5615 (for HOL datatypes);
5617 * Isar: simplified (more robust) goal selection of proof methods: 1st
5618 goal, all goals, or explicit goal specifier (tactic emulation); thus
5619 'proof method scripts' have to be in depth-first order;
5621 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5623 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5624 should instead use individual commands for printing items
5625 (print_commands, print_methods etc.);
5627 * Isar: added 'nothing' --- the empty list of theorems;
5632 * HOL/MicroJava: formalization of a fragment of Java, together with a
5633 corresponding virtual machine and a specification of its bytecode
5634 verifier and a lightweight bytecode verifier, including proofs of
5635 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5636 Cornelia Pusch (see also the homepage of project Bali at
5637 http://isabelle.in.tum.de/Bali/);
5639 * HOL/Algebra: new theory of rings and univariate polynomials, by
5642 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5643 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5646 * HOL/Lattice: fundamental concepts of lattice theory and order
5647 structures, including duals, properties of bounds versus algebraic
5648 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5649 Theorem for complete lattices etc.; may also serve as a demonstration
5650 for abstract algebraic reasoning using axiomatic type classes, and
5651 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5653 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5656 * HOL/IMPP: extension of IMP with local variables and mutually
5657 recursive procedures, by David von Oheimb;
5659 * HOL/Lambda: converted into new-style theory and document;
5661 * HOL/ex/Multiquote: example of multiple nested quotations and
5662 anti-quotations -- basically a generalized version of de-Bruijn
5663 representation; very useful in avoiding lifting of operations;
5665 * HOL/record: added general record equality rule to simpset; fixed
5666 select-update simplification procedure to handle extended records as
5667 well; admit "r" as field name;
5669 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5670 other numeric types and also as the identity of groups, rings, etc.;
5672 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5673 Types nat and int belong to this axclass;
5675 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5676 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5677 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5678 two terms #m*u and #n*u are replaced by #(m+n)*u
5679 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5680 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5681 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5683 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5684 powerful prover for predicate logic but knows nothing of clasets; see
5685 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5687 * HOL: new version of "case_tac" subsumes both boolean case split and
5688 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5689 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5691 * HOL: simplification no longer dives into case-expressions: only the
5692 selector expression is simplified, but not the remaining arms; to
5693 enable full simplification of case-expressions for datatype t, you may
5694 remove t.weak_case_cong from the simpset, either globally (Delcongs
5695 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5697 * HOL/recdef: the recursion equations generated by 'recdef' for
5698 function 'f' are now called f.simps instead of f.rules; if all
5699 termination conditions are proved automatically, these simplification
5700 rules are added to the simpset, as in primrec; rules may be named
5701 individually as well, resulting in a separate list of theorems for
5704 * HOL/While is a new theory that provides a while-combinator. It
5705 permits the definition of tail-recursive functions without the
5706 provision of a termination measure. The latter is necessary once the
5707 invariant proof rule for while is applied.
5709 * HOL: new (overloaded) notation for the set of elements below/above
5710 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5712 * HOL: theorems impI, allI, ballI bound as "strip";
5714 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5715 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5716 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5718 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5720 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5721 main HOL, but was unused);
5723 * HOL: fewer consts declared as global (e.g. have to refer to
5724 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5726 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5727 in case of overlap with user translations (e.g. judgements over
5728 tuples); (note that the underlying logical represenation is still
5734 * ZF: simplification automatically cancels common terms in arithmetic
5735 expressions over nat and int;
5737 * ZF: new treatment of nat to minimize type-checking: all operators
5738 coerce their operands to a natural number using the function natify,
5739 making the algebraic laws unconditional;
5741 * ZF: as above, for int: operators coerce their operands to an integer
5742 using the function intify;
5744 * ZF: the integer library now contains many of the usual laws for the
5745 orderings, including $<=, and monotonicity laws for $+ and $*;
5747 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5750 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5751 to the simplifier and classical reasoner simultaneously;
5756 * Provers: blast_tac now handles actual object-logic rules as
5757 assumptions; note that auto_tac uses blast_tac internally as well;
5759 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5760 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5762 * Provers: delrules now handles destruct rules as well (no longer need
5763 explicit make_elim);
5765 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5766 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5767 use instead the strong form,
5768 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5769 in HOL, FOL and ZF the function cla_make_elim will create such rules
5770 from destruct-rules;
5772 * Provers: Simplifier.easy_setup provides a fast path to basic
5773 Simplifier setup for new object-logics;
5775 * Pure: AST translation rules no longer require constant head on LHS;
5777 * Pure: improved name spaces: ambiguous output is qualified; support
5778 for hiding of names;
5780 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5781 XSYMBOL_HOME; no longer need to do manual configuration in most
5784 * system: compression of ML heaps images may now be controlled via -c
5785 option of isabelle and isatool usedir (currently only observed by
5788 * system: isatool installfonts may handle X-Symbol fonts as well (very
5789 useful for remote X11);
5791 * system: provide TAGS file for Isabelle sources;
5793 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5796 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5797 timing flag supersedes proof_timing and Toplevel.trace;
5799 * ML: new combinators |>> and |>>> for incremental transformations
5800 with secondary results (e.g. certain theory extensions):
5802 * ML: PureThy.add_defs gets additional argument to indicate potential
5803 overloading (usually false);
5805 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5810 New in Isabelle99 (October 1999)
5811 --------------------------------
5813 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5815 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5816 are no longer simplified. (This allows the simplifier to unfold recursive
5817 functional programs.) To restore the old behaviour, declare
5819 Delcongs [if_weak_cong];
5821 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5824 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5826 * HOL/datatype: mutual_induct_tac no longer exists --
5827 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5829 * HOL/typedef: fixed type inference for representing set; type
5830 arguments now have to occur explicitly on the rhs as type constraints;
5832 * ZF: The con_defs part of an inductive definition may no longer refer
5833 to constants declared in the same theory;
5835 * HOL, ZF: the function mk_cases, generated by the inductive
5836 definition package, has lost an argument. To simplify its result, it
5837 uses the default simpset instead of a supplied list of theorems.
5839 * HOL/List: the constructors of type list are now Nil and Cons;
5841 * Simplifier: the type of the infix ML functions
5842 setSSolver addSSolver setSolver addSolver
5843 is now simpset * solver -> simpset where `solver' is a new abstract type
5844 for packaging solvers. A solver is created via
5845 mk_solver: string -> (thm list -> int -> tactic) -> solver
5846 where the string argument is only a comment.
5851 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5852 decision procedure for linear arithmetic. Currently it is used for
5853 types `nat', `int', and `real' in HOL (see below); it can, should and
5854 will be instantiated for other types and logics as well.
5856 * The simplifier now accepts rewrite rules with flexible heads, eg
5857 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5858 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5864 * New Isabelle/Isar subsystem provides an alternative to traditional
5865 tactical theorem proving; together with the ProofGeneral/isar user
5866 interface it offers an interactive environment for developing human
5867 readable proof documents (Isar == Intelligible semi-automated
5868 reasoning); for further information see isatool doc isar-ref,
5869 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5871 * improved and simplified presentation of theories: better HTML markup
5872 (including colors), graph views in several sizes; isatool usedir now
5873 provides a proper interface for user theories (via -P option); actual
5874 document preparation based on (PDF)LaTeX is available as well (for
5875 new-style theories only); see isatool doc system for more information;
5877 * native support for Proof General, both for classic Isabelle and
5880 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5881 using the graph browser tool;
5883 * Isabelle manuals now also available as PDF;
5885 * theory loader rewritten from scratch (may not be fully
5886 bug-compatible); old loadpath variable has been replaced by show_path,
5887 add_path, del_path, reset_path functions; new operations such as
5888 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5891 * improved isatool install: option -k creates KDE application icon,
5892 option -p DIR installs standalone binaries;
5894 * added ML_PLATFORM setting (useful for cross-platform installations);
5895 more robust handling of platform specific ML images for SML/NJ;
5897 * the settings environment is now statically scoped, i.e. it is never
5898 created again in sub-processes invoked from isabelle, isatool, or
5901 * path element specification '~~' refers to '$ISABELLE_HOME';
5903 * in locales, the "assumes" and "defines" parts may be omitted if
5906 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5909 * new print_mode "HTML";
5911 * new flag show_tags controls display of tags of theorems (which are
5912 basically just comments that may be attached by some tools);
5914 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5915 mode and goal output format:
5917 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5919 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5921 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5922 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5924 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5926 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5928 * function bind_thms stores lists of theorems (cf. bind_thm);
5930 * new shorthand tactics ftac, eatac, datac, fatac;
5932 * qed (and friends) now accept "" as result name; in that case the
5933 theorem is not stored, but proper checks and presentation of the
5936 * theorem database now also indexes constants "Trueprop", "all",
5937 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5942 ** HOL arithmetic **
5944 * There are now decision procedures for linear arithmetic over nat and
5947 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5948 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5949 are treated as atomic; subformulae not involving type `nat' or `int'
5950 are ignored; quantified subformulae are ignored unless they are
5951 positive universal or negative existential. The tactic has to be
5952 invoked by hand and can be a little bit slow. In particular, the
5953 running time is exponential in the number of occurrences of `min' and
5954 `max', and `-' on `nat'.
5956 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5957 (negated) (in)equalities among the premises and the conclusion into
5958 account (i.e. no compound formulae) and does not know about `min' and
5959 `max', and `-' on `nat'. It is fast and is used automatically by the
5962 NB: At the moment, these decision procedures do not cope with mixed
5963 nat/int formulae where the two parts interact, such as `m < n ==>
5966 * HOL/Numeral provides a generic theory of numerals (encoded
5967 efficiently as bit strings); setup for types nat/int/real is in place;
5968 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5969 int, existing theories and proof scripts may require a few additional
5972 * integer division and remainder can now be performed on constant
5975 * many properties of integer multiplication, division and remainder
5978 * An interface to the Stanford Validity Checker (SVC) is available through the
5979 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5980 are proved automatically. SVC must be installed separately, and its results
5981 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5982 invocation of the underlying oracle). For SVC see
5983 http://verify.stanford.edu/SVC
5985 * IsaMakefile: the HOL-Real target now builds an actual image;
5990 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5991 (in Isabelle/Isar) -- by Gertrud Bauer;
5993 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5994 analysis for assembly languages with subtypes;
5996 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5997 -- avoids syntactic ambiguities and treats state, transition, and
5998 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
5999 changed syntax and (many) tactics;
6001 * HOL/inductive: Now also handles more general introduction rules such
6002 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6003 theorems are now maintained within the theory (maintained via the
6006 * HOL/datatype: Now also handles arbitrarily branching datatypes
6007 (using function types) such as
6009 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6011 * HOL/record: record_simproc (part of the default simpset) takes care
6012 of selectors applied to updated records; record_split_tac is no longer
6013 part of the default claset; update_defs may now be removed from the
6014 simpset in many cases; COMPATIBILITY: old behavior achieved by
6016 claset_ref () := claset() addSWrapper record_split_wrapper;
6017 Delsimprocs [record_simproc]
6019 * HOL/typedef: fixed type inference for representing set; type
6020 arguments now have to occur explicitly on the rhs as type constraints;
6022 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6023 names rather than an ML expression;
6025 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6026 supplied later. Program schemes can be defined, such as
6027 "While B C s = (if B s then While B C (C s) else s)"
6028 where the well-founded relation can be chosen after B and C have been given.
6030 * HOL/List: the constructors of type list are now Nil and Cons;
6031 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6032 course, ML tools referring to List.list.op # etc. have to be adapted;
6034 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6035 disabled by default; run isabelle with option -m HOL to get back to
6036 the original Gordon/HOL-style output;
6038 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6039 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6041 * HOL basic syntax simplified (more orthogonal): all variants of
6042 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6043 Eps operator is provided as well: "SOME x. P[x]";
6045 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6047 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6048 thus available for user theories;
6050 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6051 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6054 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6055 several times and then mp;
6060 * the notation <<...>> is now available as a notation for sequences of
6063 * the simplifier is now installed
6065 * the axiom system has been generalized (thanks to Soren Heilmann)
6067 * the classical reasoner now has a default rule database
6072 * new primrec section allows primitive recursive functions to be given
6073 directly (as in HOL) over datatypes and the natural numbers;
6075 * new tactics induct_tac and exhaust_tac for induction (or case
6076 analysis) over datatypes and the natural numbers;
6078 * the datatype declaration of type T now defines the recursor T_rec;
6080 * simplification automatically does freeness reasoning for datatype
6083 * automatic type-inference, with AddTCs command to insert new
6084 type-checking rules;
6086 * datatype introduction rules are now added as Safe Introduction rules
6089 * the syntax "if P then x else y" is now available in addition to
6093 *** Internal programming interfaces ***
6095 * tuned simplifier trace output; new flag debug_simp;
6097 * structures Vartab / Termtab (instances of TableFun) offer efficient
6098 tables indexed by indexname_ord / term_ord (compatible with aconv);
6100 * AxClass.axclass_tac lost the theory argument;
6102 * tuned current_goals_markers semantics: begin / end goal avoids
6103 printing empty lines;
6105 * removed prs and prs_fn hook, which was broken because it did not
6106 include \n in its semantics, forcing writeln to add one
6107 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6108 string -> unit if you really want to output text without newline;
6110 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6111 plain output, interface builders may have to enable 'isabelle_font'
6112 mode to get Isabelle font glyphs as before;
6114 * refined token_translation interface; INCOMPATIBILITY: output length
6115 now of type real instead of int;
6117 * theory loader actions may be traced via new ThyInfo.add_hook
6118 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6119 your own database of information attached to *whole* theories -- as
6120 opposed to intra-theory data slots offered via TheoryDataFun;
6122 * proper handling of dangling sort hypotheses (at last!);
6123 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6124 extra sort hypotheses that can be witnessed from the type signature;
6125 the force_strip_shyps flag is gone, any remaining shyps are simply
6126 left in the theorem (with a warning issued by strip_shyps_warning);
6130 New in Isabelle98-1 (October 1998)
6131 ----------------------------------
6133 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6135 * several changes of automated proof tools;
6137 * HOL: major changes to the inductive and datatype packages, including
6138 some minor incompatibilities of theory syntax;
6140 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6143 * HOL: removed duplicate thms in Arith:
6144 less_imp_add_less should be replaced by trans_less_add1
6145 le_imp_add_le should be replaced by trans_le_add1
6147 * HOL: unary minus is now overloaded (new type constraints may be
6150 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6151 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6152 now taken as an integer constant.
6154 * Pure: ML function 'theory_of' renamed to 'theory';
6160 1. Asm_full_simp_tac is now more aggressive.
6161 1. It will sometimes reorient premises if that increases their power to
6163 2. It does no longer proceed strictly from left to right but may also
6164 rotate premises to achieve further simplification.
6165 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6166 old Asm_full_simp_tac in that it does not rotate premises.
6167 2. The simplifier now knows a little bit about nat-arithmetic.
6169 * Classical reasoner: wrapper mechanism for the classical reasoner now
6170 allows for selected deletion of wrappers, by introduction of names for
6171 wrapper functionals. This implies that addbefore, addSbefore,
6172 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6173 and that adding two tactics with the same name overwrites the first
6174 one (emitting a warning).
6175 type wrapper = (int -> tactic) -> (int -> tactic)
6176 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6177 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6178 delWrapper, delSWrapper: claset * string -> claset
6179 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6181 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6182 semantics; addbefore now affects only the unsafe part of step_tac
6183 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6184 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6187 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6188 compWrapper; added safe wrapper (and access functions for it);
6190 * HOL/split_all_tac is now much faster and fails if there is nothing
6191 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6192 and the names of the automatically generated variables have changed.
6193 split_all_tac has moved within claset() from unsafe wrappers to safe
6194 wrappers, which means that !!-bound variables are split much more
6195 aggressively, and safe_tac and clarify_tac now split such variables.
6196 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6197 Note: the same holds for record_split_tac, which does the job of
6198 split_all_tac for record fields.
6200 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6201 permanently to the default simpset using Addsplits just like
6202 Addsimps. They can be removed via Delsplits just like
6203 Delsimps. Lower-case versions are also available.
6205 * HOL/Simplifier: The rule split_if is now part of the default
6206 simpset. This means that the simplifier will eliminate all occurrences
6207 of if-then-else in the conclusion of a goal. To prevent this, you can
6208 either remove split_if completely from the default simpset by
6209 `Delsplits [split_if]' or remove it in a specific call of the
6210 simplifier using `... delsplits [split_if]'. You can also add/delete
6211 other case splitting rules to/from the default simpset: every datatype
6212 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6213 t is the name of the datatype).
6215 * Classical reasoner / Simplifier combination: new force_tac (and
6216 derivatives Force_tac, force) combines rewriting and classical
6217 reasoning (and whatever other tools) similarly to auto_tac, but is
6218 aimed to solve the given subgoal completely.
6223 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6224 and `goalw': the theory is no longer needed as an explicit argument -
6225 the current theory context is used; assumptions are no longer returned
6226 at the ML-level unless one of them starts with ==> or !!; it is
6227 recommended to convert to these new commands using isatool fixgoal
6228 (backup your sources first!);
6230 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6231 the current theory context, and 'theory' to lookup stored theories;
6233 * new theory section 'locale' for declaring constants, assumptions and
6234 definitions that have local scope;
6236 * new theory section 'nonterminals' for purely syntactic types;
6238 * new theory section 'setup' for generic ML setup functions
6239 (e.g. package initialization);
6241 * the distribution now includes Isabelle icons: see
6242 lib/logo/isabelle-{small,tiny}.xpm;
6244 * isatool install - install binaries with absolute references to
6247 * isatool logo -- create instances of the Isabelle logo (as EPS);
6249 * print mode 'emacs' reserved for Isamode;
6251 * support multiple print (ast) translations per constant name;
6253 * theorems involving oracles are now printed with a suffixed [!];
6258 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6260 * HOL/inductive package reorganized and improved: now supports mutual
6266 oddI "n : EVEN ==> Suc n : ODD"
6267 evenI "n : ODD ==> Suc n : EVEN"
6269 new theorem list "elims" contains an elimination rule for each of the
6270 recursive sets; inductive definitions now handle disjunctive premises
6271 correctly (also ZF);
6273 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6274 "mutual_induct" no longer exists - the induction rule is always
6275 contained in "induct";
6278 * HOL/datatype package re-implemented and greatly improved: now
6279 supports mutually recursive datatypes such as
6282 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6283 | SUM ('a aexp) ('a aexp)
6284 | DIFF ('a aexp) ('a aexp)
6287 'a bexp = LESS ('a aexp) ('a aexp)
6288 | AND ('a bexp) ('a bexp)
6289 | OR ('a bexp) ('a bexp)
6291 as well as indirectly recursive datatypes such as
6294 ('a, 'b) term = Var 'a
6295 | App 'b ((('a, 'b) term) list)
6297 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6298 induction on mutually / indirectly recursive datatypes.
6300 Primrec equations are now stored in theory and can be accessed via
6301 <function_name>.simps.
6305 - Theories using datatypes must now have theory Datatype as an
6307 - The specific <typename>.induct_tac no longer exists - use the
6308 generic induct_tac instead.
6309 - natE has been renamed to nat.exhaust - use exhaust_tac
6310 instead of res_inst_tac ... natE. Note that the variable
6311 names in nat.exhaust differ from the names in natE, this
6312 may cause some "fragile" proofs to fail.
6313 - The theorems split_<typename>_case and split_<typename>_case_asm
6314 have been renamed to <typename>.split and <typename>.split_asm.
6315 - Since default sorts of type variables are now handled correctly,
6316 some datatype definitions may have to be annotated with explicit
6318 - Primrec definitions no longer require function name and type
6319 of recursive argument.
6321 Consider using isatool fixdatatype to adapt your theories and proof
6322 scripts to the new package (backup your sources first!).
6325 * HOL/record package: considerably improved implementation; now
6326 includes concrete syntax for record types, terms, updates; theorems
6327 for surjective pairing and splitting !!-bound record variables; proof
6328 support is as follows:
6330 1) standard conversions (selectors or updates applied to record
6331 constructor terms) are part of the standard simpset;
6333 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6334 made part of standard simpset and claset via addIffs;
6336 3) a tactic for record field splitting (record_split_tac) is part of
6337 the standard claset (addSWrapper);
6339 To get a better idea about these rules you may retrieve them via
6340 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6341 the name of your record type.
6343 The split tactic 3) conceptually simplifies by the following rule:
6345 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6347 Thus any record variable that is bound by meta-all will automatically
6348 blow up into some record constructor term, consequently the
6349 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6350 solve record problems automatically.
6353 * reorganized the main HOL image: HOL/Integ and String loaded by
6354 default; theory Main includes everything;
6356 * automatic simplification of integer sums and comparisons, using cancellation;
6358 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6360 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6362 * many new identities for unions, intersections, set difference, etc.;
6364 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6365 called split_if, split_split, split_sum_case and split_nat_case (to go
6366 with add/delsplits);
6368 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6369 (?x::unit) = (); this is made part of the default simpset, which COULD
6370 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6371 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6372 unit_abs_eta_conv is added in order to counter the effect of
6373 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6376 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6379 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6380 It and 'sym RS equals0D' are now in the default claset, giving automatic
6381 disjointness reasoning but breaking a few old proofs.
6383 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6384 to 'converse' from 'inverse' (for compatibility with ZF and some
6387 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6388 the well-founded relation;
6390 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6391 Compl A. The "Compl" syntax remains available as input syntax for this
6394 * HOL/Update: new theory of function updates:
6395 f(a:=b) == %x. if x=a then b else f x
6396 may also be iterated as in f(a:=b,c:=d,...);
6398 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6401 - new function list_update written xs[i:=v] that updates the i-th
6402 list position. May also be iterated as in xs[i:=a,j:=b,...].
6403 - new function `upt' written [i..j(] which generates the list
6404 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6405 bound write [i..j], which is a shorthand for [i..j+1(].
6406 - new lexicographic orderings and corresponding wellfoundedness theorems.
6409 - removed 'pred' (predecessor) function;
6410 - generalized some theorems about n-1;
6411 - many new laws about "div" and "mod";
6412 - new laws about greatest common divisors (see theory ex/Primes);
6414 * HOL/Relation: renamed the relational operator r^-1 "converse"
6415 instead of "inverse";
6417 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6418 of the multiset ordering;
6420 * directory HOL/Real: a construction of the reals using Dedekind cuts
6421 (not included by default);
6423 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6425 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6426 programs, i.e. different program variables may have different types.
6428 * calling (stac rew i) now fails if "rew" has no effect on the goal
6429 [previously, this check worked only if the rewrite rule was unconditional]
6430 Now rew can involve either definitions or equalities (either == or =).
6435 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6436 only the theorems proved on ZF.ML;
6438 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6439 It and 'sym RS equals0D' are now in the default claset, giving automatic
6440 disjointness reasoning but breaking a few old proofs.
6442 * ZF/Update: new theory of function updates
6443 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6444 may also be iterated as in f(a:=b,c:=d,...);
6446 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6448 * calling (stac rew i) now fails if "rew" has no effect on the goal
6449 [previously, this check worked only if the rewrite rule was unconditional]
6450 Now rew can involve either definitions or equalities (either == or =).
6452 * case_tac provided for compatibility with HOL
6453 (like the old excluded_middle_tac, but with subgoals swapped)
6456 *** Internal programming interfaces ***
6458 * Pure: several new basic modules made available for general use, see
6459 also src/Pure/README;
6461 * improved the theory data mechanism to support encapsulation (data
6462 kind name replaced by private Object.kind, acting as authorization
6463 key); new type-safe user interface via functor TheoryDataFun; generic
6464 print_data function becomes basically useless;
6466 * removed global_names compatibility flag -- all theory declarations
6467 are qualified by default;
6469 * module Pure/Syntax now offers quote / antiquote translation
6470 functions (useful for Hoare logic etc. with implicit dependencies);
6471 see HOL/ex/Antiquote for an example use;
6473 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6476 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6479 * Display.print_goals function moved to Locale.print_goals;
6481 * standard print function for goals supports current_goals_markers
6482 variable for marking begin of proof, end of proof, start of goal; the
6483 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6484 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6489 New in Isabelle98 (January 1998)
6490 --------------------------------
6492 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6494 * changed lexical syntax of terms / types: dots made part of long
6495 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6497 * simpset (and claset) reference variable replaced by functions
6498 simpset / simpset_ref;
6500 * no longer supports theory aliases (via merge) and non-trivial
6501 implicit merge of thms' signatures;
6503 * most internal names of constants changed due to qualified names;
6505 * changed Pure/Sequence interface (see Pure/seq.ML);
6508 *** General Changes ***
6510 * hierachically structured name spaces (for consts, types, axms, thms
6511 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6512 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6513 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6514 long_names for fully qualified output names; NOTE: ML programs
6515 (special tactics, packages etc.) referring to internal names may have
6516 to be adapted to cope with fully qualified names; in case of severe
6517 backward campatibility problems try setting 'global_names' at compile
6518 time to have enrything declared within a flat name space; one may also
6519 fine tune name declarations in theories via the 'global' and 'local'
6522 * reimplemented the implicit simpset and claset using the new anytype
6523 data filed in signatures; references simpset:simpset ref etc. are
6524 replaced by functions simpset:unit->simpset and
6525 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6526 to patch your ML files accordingly;
6528 * HTML output now includes theory graph data for display with Java
6529 applet or isatool browser; data generated automatically via isatool
6530 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6532 * defs may now be conditional; improved rewrite_goals_tac to handle
6533 conditional equations;
6535 * defs now admits additional type arguments, using TYPE('a) syntax;
6537 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6538 creates a new theory node; implicit merge of thms' signatures is
6539 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6540 transfer:theory->thm->thm in (rare) cases;
6542 * improved handling of draft signatures / theories; draft thms (and
6543 ctyps, cterms) are automatically promoted to real ones;
6545 * slightly changed interfaces for oracles: admit many per theory, named
6546 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6548 * print_goals: optional output of const types (set show_consts and
6551 * improved output of warnings (###) and errors (***);
6553 * subgoal_tac displays a warning if the new subgoal has type variables;
6555 * removed old README and Makefiles;
6557 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6559 * removed obsolete init_pps and init_database;
6561 * deleted the obsolete tactical STATE, which was declared by
6562 fun STATE tacfun st = tacfun st st;
6564 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6565 (which abbreviates $HOME);
6567 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6568 use isatool fixseq to adapt your ML programs (this works for fully
6569 qualified references to the Sequence structure only!);
6571 * use_thy no longer requires writable current directory; it always
6572 reloads .ML *and* .thy file, if either one is out of date;
6575 *** Classical Reasoner ***
6577 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6578 tactics that use classical reasoning to simplify a subgoal without
6579 splitting it into several subgoals;
6581 * Safe_tac: like safe_tac but uses the default claset;
6586 * added simplification meta rules:
6587 (asm_)(full_)simplify: simpset -> thm -> thm;
6589 * simplifier.ML no longer part of Pure -- has to be loaded by object
6592 * added prems argument to simplification procedures;
6594 * HOL, FOL, ZF: added infix function `addsplits':
6595 instead of `<simpset> setloop (split_tac <thms>)'
6596 you can simply write `<simpset> addsplits <thms>'
6601 * TYPE('a) syntax for type reflection terms;
6603 * no longer handles consts with name "" -- declare as 'syntax' instead;
6605 * pretty printer: changed order of mixfix annotation preference (again!);
6607 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6612 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6613 with `addloop' of the simplifier to faciliate case splitting in premises.
6615 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6617 * HOL/Auth: new protocol proofs including some for the Internet
6620 * HOL/Map: new theory of `maps' a la VDM;
6622 * HOL/simplifier: simplification procedures nat_cancel_sums for
6623 cancelling out common nat summands from =, <, <= (in)equalities, or
6624 differences; simplification procedures nat_cancel_factor for
6625 cancelling common factor from =, <, <= (in)equalities over natural
6626 sums; nat_cancel contains both kinds of procedures, it is installed by
6627 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6629 * HOL/simplifier: terms of the form
6630 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6632 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6633 and those of the form
6634 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6636 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6639 Each datatype `t' now comes with a theorem `split_t_case' of the form
6641 P(t_case f1 ... fn x) =
6642 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6644 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6647 and a theorem `split_t_case_asm' of the form
6649 P(t_case f1 ... fn x) =
6650 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6652 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6654 which can be added to a simpset via `addsplits'. The existing theorems
6655 expand_list_case and expand_option_case have been renamed to
6656 split_list_case and split_option_case.
6659 - `pred n' is automatically converted to `n-1'.
6660 Users are strongly encouraged not to use `pred' any longer,
6661 because it will disappear altogether at some point.
6662 - Users are strongly encouraged to write "0 < n" rather than
6663 "n ~= 0". Theorems and proof tools have been modified towards this
6667 the function "set_of_list" has been renamed "set" (and its theorems too);
6668 the function "nth" now takes its arguments in the reverse order and
6669 has acquired the infix notation "!" as in "xs!n".
6671 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6673 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6674 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6676 * HOL/record: extensible records with schematic structural subtyping
6677 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6678 still lacks various theorems and concrete record syntax;
6683 * removed "axioms" and "generated by" sections;
6685 * replaced "ops" section by extended "consts" section, which is capable of
6686 handling the continuous function space "->" directly;
6689 . proves theorems immediately and stores them in the theory,
6690 . creates hierachical name space,
6691 . now uses normal mixfix annotations (instead of cinfix...),
6692 . minor changes to some names and values (for consistency),
6693 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6694 . separator between mutual domain defs: changed "," to "and",
6695 . improved handling of sort constraints; now they have to
6696 appear on the left-hand side of the equations only;
6698 * fixed LAM <x,y,zs>.b syntax;
6700 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6701 adm (%x. P (t x)), where P is chainfinite and t continuous;
6706 * FOL: 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 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6710 in HOL, they strip ALL and --> from proved theorems;
6714 New in Isabelle94-8 (May 1997)
6715 ------------------------------
6717 *** General Changes ***
6719 * new utilities to build / run / maintain Isabelle etc. (in parts
6720 still somewhat experimental); old Makefiles etc. still functional;
6722 * new 'Isabelle System Manual';
6724 * INSTALL text, together with ./configure and ./build scripts;
6726 * reimplemented type inference for greater efficiency, better error
6727 messages and clean internal interface;
6729 * prlim command for dealing with lots of subgoals (an easier way of
6730 setting goals_limit);
6735 * supports alternative (named) syntax tables (parser and pretty
6736 printer); internal interface is provided by add_modesyntax(_i);
6738 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6739 be used in conjunction with the Isabelle symbol font; uses the
6740 "symbols" syntax table;
6742 * added token_translation interface (may translate name tokens in
6743 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6744 the current print_mode); IMPORTANT: user print translation functions
6745 are responsible for marking newly introduced bounds
6746 (Syntax.mark_boundT);
6748 * token translations for modes "xterm" and "xterm_color" that display
6749 names in bold, underline etc. or colors (which requires a color
6752 * infixes may now be declared with names independent of their syntax;
6754 * added typed_print_translation (like print_translation, but may
6755 access type of constant);
6758 *** Classical Reasoner ***
6760 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6761 some limitations. Blast_tac...
6762 + ignores addss, addbefore, addafter; this restriction is intrinsic
6763 + ignores elimination rules that don't have the correct format
6764 (the conclusion MUST be a formula variable)
6765 + ignores types, which can make HOL proofs fail
6766 + rules must not require higher-order unification, e.g. apply_type in ZF
6767 [message "Function Var's argument not a bound variable" relates to this]
6768 + its proof strategy is more general but can actually be slower
6770 * substitution with equality assumptions no longer permutes other
6773 * minor changes in semantics of addafter (now called addaltern); renamed
6774 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6775 (and access functions for it);
6777 * improved combination of classical reasoner and simplifier:
6778 + functions for handling clasimpsets
6779 + improvement of addss: now the simplifier is called _after_ the
6781 + safe variant of addss called addSss: uses safe simplifications
6782 _during_ the safe steps. It is more complete as it allows multiple
6783 instantiations of unknowns (e.g. with slow_tac).
6787 * added interface for simplification procedures (functions that
6788 produce *proven* rewrite rules on the fly, depending on current
6791 * ordering on terms as parameter (used for ordered rewriting);
6793 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6795 * the solver is now split into a safe and an unsafe part.
6796 This should be invisible for the normal user, except that the
6797 functions setsolver and addsolver have been renamed to setSolver and
6798 addSolver; added safe_asm_full_simp_tac;
6803 * a generic induction tactic `induct_tac' which works for all datatypes and
6804 also for type `nat';
6806 * a generic case distinction tactic `exhaust_tac' which works for all
6807 datatypes and also for type `nat';
6809 * each datatype comes with a function `size';
6811 * patterns in case expressions allow tuple patterns as arguments to
6812 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6814 * primrec now also works with type nat;
6816 * recdef: a new declaration form, allows general recursive functions to be
6817 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6819 * the constant for negation has been renamed from "not" to "Not" to
6820 harmonize with FOL, ZF, LK, etc.;
6822 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6825 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6827 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6828 problems in commutative rings, using axiomatic type classes for + and *;
6830 * more examples in HOL/MiniML and HOL/Auth;
6832 * more default rewrite rules for quantifiers, union/intersection;
6834 * a new constant `arbitrary == @x.False';
6836 * HOLCF/IOA replaces old HOL/IOA;
6838 * HOLCF changes: derived all rules and arities
6839 + axiomatic type classes instead of classes
6840 + typedef instead of faking type definitions
6841 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6842 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6843 + eliminated the types void, one, tr
6844 + use unit lift and bool lift (with translations) instead of one and tr
6845 + eliminated blift from Lift3.thy (use Def instead of blift)
6846 all eliminated rules are derived as theorems --> no visible changes ;
6851 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6852 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6853 as ZF_cs addSIs [equalityI];
6857 New in Isabelle94-7 (November 96)
6858 ---------------------------------
6860 * allowing negative levels (as offsets) in prlev and choplev;
6862 * super-linear speedup for large simplifications;
6864 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6865 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6866 FAIL); can suppress it using the command Delsimps (ex_simps @
6867 all_simps); De Morgan laws are also now included, by default;
6869 * improved printing of ==> : ~:
6871 * new object-logic "Sequents" adds linear logic, while replacing LK
6872 and Modal (thanks to Sara Kalvala);
6874 * HOL/Auth: correctness proofs for authentication protocols;
6876 * HOL: new auto_tac combines rewriting and classical reasoning (many
6877 examples on HOL/Auth);
6879 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6880 the rewriter and classical reasoner simultaneously;
6882 * function uresult no longer returns theorems in "standard" format;
6883 regain previous version by: val uresult = standard o uresult;
6890 * oracles -- these establish an interface between Isabelle and trusted
6891 external reasoners, which may deliver results as theorems;
6893 * proof objects (in particular record all uses of oracles);
6895 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6897 * "constdefs" section in theory files;
6899 * "primrec" section (HOL) no longer requires names;
6901 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6908 * reduced space requirements;
6910 * automatic HTML generation from theories;
6912 * theory files no longer require "..." (quotes) around most types;
6914 * new examples, including two proofs of the Church-Rosser theorem;
6916 * non-curried (1994) version of HOL is no longer distributed;
6923 * greatly reduced space requirements;
6925 * theory files (.thy) no longer require \...\ escapes at line breaks;
6927 * searchable theorem database (see the section "Retrieving theorems" on
6928 page 8 of the Reference Manual);
6930 * new examples, including Grabczewski's monumental case study of the
6933 * The previous version of HOL renamed to Old_HOL;
6935 * The new version of HOL (previously called CHOL) uses a curried syntax
6936 for functions. Application looks like f a b instead of f(a,b);
6938 * Mutually recursive inductive definitions finally work in HOL;
6940 * In ZF, pattern-matching on tuples is now available in all abstractions and
6941 translates to the operator "split";
6948 * new infix operator, addss, allowing the classical reasoner to
6949 perform simplification at each step of its search. Example:
6950 fast_tac (cs addss ss)
6952 * a new logic, CHOL, the same as HOL, but with a curried syntax
6953 for functions. Application looks like f a b instead of f(a,b). Also pairs
6954 look like (a,b) instead of <a,b>;
6956 * PLEASE NOTE: CHOL will eventually replace HOL!
6958 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6959 It translates to the operator "split". A new theory of integers is available;
6961 * In ZF, integer numerals now denote two's-complement binary integers.
6962 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6964 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6965 of the Axiom of Choice;
6972 * Significantly faster resolution;
6974 * the different sections in a .thy file can now be mixed and repeated
6977 * Database of theorems for FOL, HOL and ZF. New
6978 commands including qed, qed_goal and bind_thm store theorems in the database.
6980 * Simple database queries: return a named theorem (get_thm) or all theorems of
6981 a given theory (thms_of), or find out what theory a theorem was proved in
6984 * Bugs fixed in the inductive definition and datatype packages;
6986 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6987 and HOL_dup_cs obsolete;
6989 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6992 * Simpler definition of function space in ZF;
6994 * new results about cardinal and ordinal arithmetic in ZF;
6996 * 'subtype' facility in HOL for introducing new types as subsets of existing
6999 :mode=text:wrap=hard:maxLineLen=72: