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 * Empty class specifications observe default sort. INCOMPATIBILITY.
89 * Old 'axclass' has been discontinued. Use 'class' instead. INCOMPATIBILITY.
91 * Code generator: simple concept for abstract datatypes obeying invariants.
93 * Local theory specifications may depend on extra type variables that
94 are not present in the result type -- arguments TYPE('a) :: 'a itself
95 are added internally. For example:
97 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
99 * Code generator: details of internal data cache have no impact on
100 the user space functionality any longer.
102 * Methods unfold_locales and intro_locales ignore non-locale subgoals. This
103 is more appropriate for interpretations with 'where'. INCOMPATIBILITY.
105 * Discontinued unnamed infix syntax (legacy feature for many years) --
106 need to specify constant name and syntax separately. Internal ML
107 datatype constructors have been renamed from InfixName to Infix etc.
108 Minor INCOMPATIBILITY.
110 * Command 'example_proof' opens an empty proof body. This allows to
111 experiment with Isar, without producing any persistent result.
113 * Commands 'type_notation' and 'no_type_notation' declare type syntax
114 within a local theory context, with explicit checking of the
115 constructors involved (in contrast to the raw 'syntax' versions).
117 * Commands 'types' and 'typedecl' now work within a local theory
118 context -- without introducing dependencies on parameters or
119 assumptions, which is not possible in Isabelle/Pure.
121 * Proof terms: Type substitutions on proof constants now use canonical
122 order of type variables. INCOMPATIBILITY: Tools working with proof
123 terms may need to be adapted.
128 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
129 provides abstract red-black tree type which is backed by RBT_Impl
130 as implementation. INCOMPATIBILTY.
132 * Command 'typedef' now works within a local theory context -- without
133 introducing dependencies on parameters or assumptions, which is not
134 possible in Isabelle/Pure/HOL. Note that the logical environment may
135 contain multiple interpretations of local typedefs (with different
136 non-emptiness proofs), even in a global theory context.
138 * Theory Library/Coinductive_List has been removed -- superceded by
139 AFP/thys/Coinductive.
141 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
142 Min, Max from theory Finite_Set. INCOMPATIBILITY.
144 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
147 * New set of rules "ac_simps" provides combined assoc / commute rewrites
148 for all interpretations of the appropriate generic locales.
150 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
151 into theories "Rings" and "Fields"; for more appropriate and more
152 consistent names suitable for name prefixes within the HOL theories.
155 * Some generic constants have been put to appropriate theories:
156 * less_eq, less: Orderings
157 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
158 * inverse, divide: Rings
161 * More consistent naming of type classes involving orderings (and lattices):
163 lower_semilattice ~> semilattice_inf
164 upper_semilattice ~> semilattice_sup
166 dense_linear_order ~> dense_linorder
168 pordered_ab_group_add ~> ordered_ab_group_add
169 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
170 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
171 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
172 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
173 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
174 pordered_cancel_semiring ~> ordered_cancel_semiring
175 pordered_comm_monoid_add ~> ordered_comm_monoid_add
176 pordered_comm_ring ~> ordered_comm_ring
177 pordered_comm_semiring ~> ordered_comm_semiring
178 pordered_ring ~> ordered_ring
179 pordered_ring_abs ~> ordered_ring_abs
180 pordered_semiring ~> ordered_semiring
182 ordered_ab_group_add ~> linordered_ab_group_add
183 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
184 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
185 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
186 ordered_field ~> linordered_field
187 ordered_field_no_lb ~> linordered_field_no_lb
188 ordered_field_no_ub ~> linordered_field_no_ub
189 ordered_field_dense_linear_order ~> dense_linordered_field
190 ordered_idom ~> linordered_idom
191 ordered_ring ~> linordered_ring
192 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
193 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
194 ordered_ring_strict ~> linordered_ring_strict
195 ordered_semidom ~> linordered_semidom
196 ordered_semiring ~> linordered_semiring
197 ordered_semiring_1 ~> linordered_semiring_1
198 ordered_semiring_1_strict ~> linordered_semiring_1_strict
199 ordered_semiring_strict ~> linordered_semiring_strict
201 The following slightly odd type classes have been moved to
202 a separate theory Library/Lattice_Algebras.thy:
204 lordered_ab_group_add ~> lattice_ab_group_add
205 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
206 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
207 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
208 lordered_ring ~> lattice_ring
212 * Refined field classes:
213 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
214 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
215 * numerous lemmas have been ported from field to division_ring;
218 * Refined algebra theorem collections:
219 * dropped theorem group group_simps, use algebra_simps instead;
220 * dropped theorem group ring_simps, use field_simps instead;
221 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
222 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
225 * Theory Finite_Set and List: some lemmas have been generalized from
228 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
229 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
230 inter_Inter_fold_inter ~> inf_Inf_fold_inf
231 union_Union_fold_union ~> sup_Sup_fold_sup
232 Inter_fold_inter ~> Inf_fold_inf
233 Union_fold_union ~> Sup_fold_sup
234 inter_INTER_fold_inter ~> inf_INFI_fold_inf
235 union_UNION_fold_union ~> sup_SUPR_fold_sup
236 INTER_fold_inter ~> INFI_fold_inf
237 UNION_fold_union ~> SUPR_fold_sup
239 * Theory Complete_Lattice: lemmas top_def and bot_def have been
240 replaced by the more convenient lemmas Inf_empty and Sup_empty.
241 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
242 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
243 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
244 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
246 * HOLogic.strip_psplit: types are returned in syntactic order, similar
247 to other strip and tuple operations. INCOMPATIBILITY.
249 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
250 * pointwise ordering is instance of class order with standard syntax <= and <;
251 * multiset ordering has syntax <=# and <#; partial order properties are provided
252 by means of interpretation with prefix multiset_order;
253 * less duplication, less historical organization of sections,
254 conversion from associations lists to multisets, rudimentary code generation;
255 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
258 * Code generation: ML and OCaml code is decorated with signatures.
260 * Theory List: added transpose.
262 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
263 clash with new theory Quotient in Main HOL.
265 * Library/Nat_Bijection.thy is a collection of bijective functions
266 between nat and other types, which supersedes the older libraries
267 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
270 Nat_Int_Bij.nat2_to_nat ~> prod_encode
271 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
272 Nat_Int_Bij.int_to_nat_bij ~> int_encode
273 Nat_Int_Bij.nat_to_int_bij ~> int_decode
274 Countable.pair_encode ~> prod_encode
275 NatIso.prod2nat ~> prod_encode
276 NatIso.nat2prod ~> prod_decode
277 NatIso.sum2nat ~> sum_encode
278 NatIso.nat2sum ~> sum_decode
279 NatIso.list2nat ~> list_encode
280 NatIso.nat2list ~> list_decode
281 NatIso.set2nat ~> set_encode
282 NatIso.nat2set ~> set_decode
285 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
286 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
287 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
288 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
289 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
290 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
291 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
292 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
293 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
294 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
295 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
296 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
297 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
302 * Sorts.certify_sort and derived "cert" operations for types and terms
303 no longer minimize sorts. Thus certification at the boundary of the
304 inference kernel becomes invariant under addition of class relations,
305 which is an important monotonicity principle. Sorts are now minimized
306 in the syntax layer only, at the boundary between the end-user and the
307 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
308 explicitly in rare situations.
310 * Antiquotations for basic formal entities:
312 @{class NAME} -- type class
313 @{class_syntax NAME} -- syntax representation of the above
315 @{type_name NAME} -- logical type
316 @{type_abbrev NAME} -- type abbreviation
317 @{nonterminal NAME} -- type of concrete syntactic category
318 @{type_syntax NAME} -- syntax representation of any of the above
320 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
321 @{const_abbrev NAME} -- abbreviated constant
322 @{const_syntax NAME} -- syntax representation of any of the above
324 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
325 syntax constant (cf. 'syntax' command).
327 * Antiquotation @{make_string} inlines a function to print arbitrary
328 values similar to the ML toplevel. The result is compiler dependent
329 and may fall back on "?" in certain situations.
331 * Renamed old-style Drule.standard to Drule.export_without_context, to
332 emphasize that this is in no way a standard operation.
335 * Curried take and drop in library.ML; negative length is interpreted
336 as infinity (as in chop). INCOMPATIBILITY.
338 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
339 usual for resolution. Rare INCOMPATIBILITY.
341 * Discontinued old TheoryDataFun with its copy/init operation -- data
342 needs to be pure. Functor Theory_Data_PP retains the traditional
343 Pretty.pp argument to merge, which is absent in the standard
346 * Renamed varify/unvarify operations to varify_global/unvarify_global
347 to emphasize that these only work in a global situation (which is
350 * Configuration options now admit dynamic default values, depending on
351 the context or even global references.
356 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
357 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
358 proof terms are enabled unconditionally in the new HOL-Proofs image.
360 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
361 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
364 * Old lib/scripts/polyml-platform is superseded by the
365 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
366 variant, even on a 64 bit machine. The following example setting
367 prefers 64 bit if available:
369 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
373 New in Isabelle2009-1 (December 2009)
374 -------------------------------------
378 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
379 one backslash should be used, even in ML sources.
384 * Locale interpretation propagates mixins along the locale hierarchy.
385 The currently only available mixins are the equations used to map
386 local definitions to terms of the target domain of an interpretation.
388 * Reactivated diagnostic command 'print_interps'. Use "print_interps
389 loc" to print all interpretations of locale "loc" in the theory.
390 Interpretations in proofs are not shown.
392 * Thoroughly revised locales tutorial. New section on conditional
395 * On instantiation of classes, remaining undefined class parameters
396 are formally declared. INCOMPATIBILITY.
399 *** Document preparation ***
401 * New generalized style concept for printing terms: @{foo (style) ...}
402 instead of @{foo_style style ...} (old form is still retained for
403 backward compatibility). Styles can be also applied for
404 antiquotations prop, term_type and typeof.
409 * New proof method "smt" for a combination of first-order logic with
410 equality, linear and nonlinear (natural/integer/real) arithmetic, and
411 fixed-size bitvectors; there is also basic support for higher-order
412 features (esp. lambda abstractions). It is an incomplete decision
413 procedure based on external SMT solvers using the oracle mechanism;
414 for the SMT solver Z3, this method is proof-producing. Certificates
415 are provided to avoid calling the external solvers solely for
416 re-checking proofs. Due to a remote SMT service there is no need for
417 installing SMT solvers locally. See src/HOL/SMT.
419 * New commands to load and prove verification conditions generated by
420 the Boogie program verifier or derived systems (e.g. the Verifying C
421 Compiler (VCC) or Spec#). See src/HOL/Boogie.
423 * New counterexample generator tool 'nitpick' based on the Kodkod
424 relational model finder. See src/HOL/Tools/Nitpick and
425 src/HOL/Nitpick_Examples.
427 * New commands 'code_pred' and 'values' to invoke the predicate
428 compiler and to enumerate values of inductive predicates.
430 * A tabled implementation of the reflexive transitive closure.
432 * New implementation of quickcheck uses generic code generator;
433 default generators are provided for all suitable HOL types, records
434 and datatypes. Old quickcheck can be re-activated importing theory
435 Library/SML_Quickcheck.
437 * New testing tool Mirabelle for automated proof tools. Applies
438 several tools and tactics like sledgehammer, metis, or quickcheck, to
439 every proof step in a theory. To be used in batch mode via the
442 * New proof method "sos" (sum of squares) for nonlinear real
443 arithmetic (originally due to John Harison). It requires theory
444 Library/Sum_Of_Squares. It is not a complete decision procedure but
445 works well in practice on quantifier-free real arithmetic with +, -,
446 *, ^, =, <= and <, i.e. boolean combinations of equalities and
447 inequalities between polynomials. It makes use of external
448 semidefinite programming solvers. Method "sos" generates a
449 certificate that can be pasted into the proof thus avoiding the need
450 to call an external tool every time the proof is checked. See
451 src/HOL/Library/Sum_Of_Squares.
453 * New method "linarith" invokes existing linear arithmetic decision
456 * New command 'atp_minimal' reduces result produced by Sledgehammer.
458 * New Sledgehammer option "Full Types" in Proof General settings menu.
459 Causes full type information to be output to the ATPs. This slows
460 ATPs down considerably but eliminates a source of unsound "proofs"
463 * New method "metisFT": A version of metis that uses full type
464 information in order to avoid failures of proof reconstruction.
466 * New evaluator "approximate" approximates an real valued term using
467 the same method as the approximation method.
469 * Method "approximate" now supports arithmetic expressions as
470 boundaries of intervals and implements interval splitting and Taylor
473 * ML antiquotation @{code_datatype} inserts definition of a datatype
474 generated by the code generator; e.g. see src/HOL/Predicate.thy.
476 * New theory SupInf of the supremum and infimum operators for sets of
479 * New theory Probability, which contains a development of measure
480 theory, eventually leading to Lebesgue integration and probability.
482 * Extended Multivariate Analysis to include derivation and Brouwer's
485 * Reorganization of number theory, INCOMPATIBILITY:
486 - new number theory development for nat and int, in theories Divides
487 and GCD as well as in new session Number_Theory
488 - some constants and facts now suffixed with _nat and _int
490 - former session NumberTheory now named Old_Number_Theory, including
491 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
492 - moved theory Pocklington from src/HOL/Library to
493 src/HOL/Old_Number_Theory
495 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
496 lcm of finite and infinite sets. It is shown that they form a complete
499 * Class semiring_div requires superclass no_zero_divisors and proof of
500 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
501 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
502 generalized to class semiring_div, subsuming former theorems
503 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
504 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
507 * Refinements to lattice classes and sets:
508 - less default intro/elim rules in locale variant, more default
509 intro/elim rules in class variant: more uniformity
510 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
512 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
514 - renamed ACI to inf_sup_aci
515 - new class "boolean_algebra"
516 - class "complete_lattice" moved to separate theory
517 "Complete_Lattice"; corresponding constants (and abbreviations)
518 renamed and with authentic syntax:
519 Set.Inf ~> Complete_Lattice.Inf
520 Set.Sup ~> Complete_Lattice.Sup
521 Set.INFI ~> Complete_Lattice.INFI
522 Set.SUPR ~> Complete_Lattice.SUPR
523 Set.Inter ~> Complete_Lattice.Inter
524 Set.Union ~> Complete_Lattice.Union
525 Set.INTER ~> Complete_Lattice.INTER
526 Set.UNION ~> Complete_Lattice.UNION
527 - authentic syntax for
530 - mere abbreviations:
533 Set.inter (for inf, formerly Set.Int)
534 Set.union (for sup, formerly Set.Un)
535 Complete_Lattice.Inter (for Inf)
536 Complete_Lattice.Union (for Sup)
537 Complete_Lattice.INTER (for INFI)
538 Complete_Lattice.UNION (for SUPR)
539 - object-logic definitions as far as appropriate
541 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
542 Un_subset_iff are explicitly deleted as default simp rules; then also
543 their lattice counterparts le_inf_iff and le_sup_iff have to be
544 deleted to achieve the desired effect.
546 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
547 rules by default any longer; the same applies to min_max.inf_absorb1
548 etc. INCOMPATIBILITY.
550 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
551 pred_set_conv by default. INCOMPATIBILITY.
553 * Power operations on relations and functions are now one dedicated
554 constant "compow" with infix syntax "^^". Power operation on
555 multiplicative monoids retains syntax "^" and is now defined generic
556 in class power. INCOMPATIBILITY.
558 * Relation composition "R O S" now has a more standard argument order:
559 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
560 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
561 break, since the O_assoc rule was not rewritten like this. Fix using
562 O_assoc[symmetric]. The same applies to the curried version "R OO S".
564 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
565 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
568 * Most rules produced by inductive and datatype package have mandatory
569 prefixes. INCOMPATIBILITY.
571 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
572 the attribute of the same name. Each of the theorems in the list
573 DERIV_intros assumes composition with an additional function and
574 matches a variable to the derivative, which has to be solved by the
575 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
576 of most elementary terms. Former Maclauren.DERIV_tac and
577 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
580 * Code generator attributes follow the usual underscore convention:
581 code_unfold replaces code unfold
582 code_post replaces code post
587 sizechange -> size_change
588 induct_scheme -> induction_schema
591 * Discontinued abbreviation "arbitrary" of constant "undefined".
592 INCOMPATIBILITY, use "undefined" directly.
595 Suc_eq_add_numeral_1 -> Suc_eq_plus1
596 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
597 Suc_plus1 -> Suc_eq_plus1
598 *anti_sym -> *antisym*
599 vector_less_eq_def -> vector_le_def
602 * Added theorem List.map_map as [simp]. Removed List.map_compose.
605 * Removed predicate "M hassize n" (<--> card M = n & finite M).
611 * Theory Representable defines a class "rep" of domains that are
612 representable (via an ep-pair) in the universal domain type "udom".
613 Instances are provided for all type constructors defined in HOLCF.
615 * The 'new_domain' command is a purely definitional version of the
616 domain package, for representable domains. Syntax is identical to the
617 old domain package. The 'new_domain' package also supports indirect
618 recursion using previously-defined type constructors. See
619 src/HOLCF/ex/New_Domain.thy for examples.
621 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
622 on the left-hand side of an equation, and then performs
623 simplification. Rewriting is done using rules declared with the
624 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
625 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
627 * The pattern-match compiler in 'fixrec' can now handle constructors
628 with HOL function types. Pattern-match combinators for the Pair
629 constructor are pre-configured.
631 * The 'fixrec' package now produces better fixed-point induction rules
632 for mutually-recursive definitions: Induction rules have conclusions
633 of the form "P foo bar" instead of "P <foo, bar>".
635 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
636 been renamed to "below". The name "below" now replaces "less" in many
637 theorem names. (Legacy theorem names using "less" are still supported
640 * The 'fixrec' package now supports "bottom patterns". Bottom
641 patterns can be used to generate strictness rules, or to make
642 functions more strict (much like the bang-patterns supported by the
643 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
649 * Support for Poly/ML 5.3.0, with improved reporting of compiler
650 errors and run-time exceptions, including detailed source positions.
652 * Structure Name_Space (formerly NameSpace) now manages uniquely
653 identified entries, with some additional information such as source
654 position, logical grouping etc.
656 * Theory and context data is now introduced by the simplified and
657 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
658 to be pure, but the old TheoryDataFun for mutable data (with explicit
659 copy operation) is still available for some time.
661 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
662 provides a high-level programming interface to synchronized state
663 variables with atomic update. This works via pure function
664 application within a critical section -- its runtime should be as
665 short as possible; beware of deadlocks if critical code is nested,
666 either directly or indirectly via other synchronized variables!
668 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
669 wraps raw ML references, explicitly indicating their non-thread-safe
670 behaviour. The Isar toplevel keeps this structure open, to
671 accommodate Proof General as well as quick and dirty interactive
672 experiments with references.
674 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
675 parallel tactical reasoning.
677 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
678 are similar to SUBPROOF, but are slightly more flexible: only the
679 specified parts of the subgoal are imported into the context, and the
680 body tactic may introduce new subgoals and schematic variables.
682 * Old tactical METAHYPS, which does not observe the proof context, has
683 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
684 or Subgoal.FOCUS etc.
686 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
687 functors have their own ML name space there is no point to mark them
688 separately.) Minor INCOMPATIBILITY.
690 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
692 * Renamed several structures FooBar to Foo_Bar. Occasional,
695 * Operations of structure Skip_Proof no longer require quick_and_dirty
696 mode, which avoids critical setmp.
698 * Eliminated old Attrib.add_attributes, Method.add_methods and related
699 combinators for "args". INCOMPATIBILITY, need to use simplified
700 Attrib/Method.setup introduced in Isabelle2009.
702 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
703 back on global_simpset_of, global_claset_of, global_clasimpset_of as
704 last resort. INCOMPATIBILITY.
706 * Display.pretty_thm now requires a proper context (cf. former
707 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
708 or even Display.pretty_thm_without_context as last resort.
711 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
712 Syntax.pretty_typ/term directly, preferably with proper context
713 instead of global theory.
718 * Further fine tuning of parallel proof checking, scales up to 8 cores
719 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
722 * Support for additional "Isabelle components" via etc/components, see
723 also the system manual.
725 * The isabelle makeall tool now operates on all components with
726 IsaMakefile, not just hardwired "logics".
728 * Removed "compress" option from isabelle-process and isabelle usedir;
729 this is always enabled.
731 * Discontinued support for Poly/ML 4.x versions.
733 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
734 on a given logic image. This requires the lighttpd webserver and is
735 currently supported on Linux only.
739 New in Isabelle2009 (April 2009)
740 --------------------------------
744 * Simplified main Isabelle executables, with less surprises on
745 case-insensitive file-systems (such as Mac OS).
747 - The main Isabelle tool wrapper is now called "isabelle" instead of
750 - The former "isabelle" alias for "isabelle-process" has been
751 removed (should rarely occur to regular users).
753 - The former "isabelle-interface" and its alias "Isabelle" have been
754 removed (interfaces are now regular Isabelle tools).
756 Within scripts and make files, the Isabelle environment variables
757 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
758 respectively. (The latter are still available as legacy feature.)
760 The old isabelle-interface wrapper could react in confusing ways if
761 the interface was uninstalled or changed otherwise. Individual
762 interface tool configuration is now more explicit, see also the
763 Isabelle system manual. In particular, Proof General is now available
764 via "isabelle emacs".
766 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
767 purge installed copies of Isabelle executables and re-run "isabelle
768 install -p ...", or use symlinks.
770 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
771 old ~/isabelle, which was slightly non-standard and apt to cause
772 surprises on case-insensitive file-systems (such as Mac OS).
774 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
775 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
776 care is required when using older releases of Isabelle. Note that
777 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
778 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
780 * Proofs of fully specified statements are run in parallel on
781 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
782 a regular 4-core machine, if the initial heap space is made reasonably
783 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
785 * The main reference manuals ("isar-ref", "implementation", and
786 "system") have been updated and extended. Formally checked references
787 as hyperlinks are now available uniformly.
792 * Complete re-implementation of locales. INCOMPATIBILITY in several
793 respects. The most important changes are listed below. See the
794 Tutorial on Locales ("locales" manual) for details.
796 - In locale expressions, instantiation replaces renaming. Parameters
797 must be declared in a for clause. To aid compatibility with previous
798 parameter inheritance, in locale declarations, parameters that are not
799 'touched' (instantiation position "_" or omitted) are implicitly added
800 with their syntax at the beginning of the for clause.
802 - Syntax from abbreviations and definitions in locales is available in
803 locale expressions and context elements. The latter is particularly
804 useful in locale declarations.
806 - More flexible mechanisms to qualify names generated by locale
807 expressions. Qualifiers (prefixes) may be specified in locale
808 expressions, and can be marked as mandatory (syntax: "name!:") or
809 optional (syntax "name?:"). The default depends for plain "name:"
810 depends on the situation where a locale expression is used: in
811 commands 'locale' and 'sublocale' prefixes are optional, in
812 'interpretation' and 'interpret' prefixes are mandatory. The old
813 implicit qualifiers derived from the parameter names of a locale are
816 - Command "sublocale l < e" replaces "interpretation l < e". The
817 instantiation clause in "interpretation" and "interpret" (square
818 brackets) is no longer available. Use locale expressions.
820 - When converting proof scripts, mandatory qualifiers in
821 'interpretation' and 'interpret' should be retained by default, even
822 if this is an INCOMPATIBILITY compared to former behavior. In the
823 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
824 in locale expressions range over a single locale instance only.
826 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
827 In existing theorem specifications replace the includes element by the
828 respective context elements of the included locale, omitting those
829 that are already present in the theorem specification. Multiple
830 assume elements of a locale should be replaced by a single one
831 involving the locale predicate. In the proof body, declarations (most
832 notably theorems) may be regained by interpreting the respective
833 locales in the proof context as required (command "interpret").
835 If using "includes" in replacement of a target solely because the
836 parameter types in the theorem are not as general as in the target,
837 consider declaring a new locale with additional type constraints on
838 the parameters (context element "constrains").
840 - Discontinued "locale (open)". INCOMPATIBILITY.
842 - Locale interpretation commands no longer attempt to simplify goal.
843 INCOMPATIBILITY: in rare situations the generated goal differs. Use
844 methods intro_locales and unfold_locales to clarify.
846 - Locale interpretation commands no longer accept interpretation
847 attributes. INCOMPATIBILITY.
849 * Class declaration: so-called "base sort" must not be given in import
850 list any longer, but is inferred from the specification. Particularly
857 class foo = type + ...
859 * Class target: global versions of theorems stemming do not carry a
860 parameter prefix any longer. INCOMPATIBILITY.
862 * Class 'instance' command no longer accepts attached definitions.
863 INCOMPATIBILITY, use proper 'instantiation' target instead.
865 * Recovered hiding of consts, which was accidentally broken in
866 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
867 makes c inaccessible; consider using ``hide (open) const c'' instead.
869 * Slightly more coherent Pure syntax, with updated documentation in
870 isar-ref manual. Removed locales meta_term_syntax and
871 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
872 INCOMPATIBILITY in rare situations. Note that &&& should not be used
873 directly in regular applications.
875 * There is a new syntactic category "float_const" for signed decimal
876 fractions (e.g. 123.45 or -123.45).
878 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
879 interface with 'setup' command instead.
881 * Command 'local_setup' is similar to 'setup', but operates on a local
884 * The 'axiomatization' command now only works within a global theory
885 context. INCOMPATIBILITY.
887 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
888 hypotheses. Sorts required in the course of reasoning need to be
889 covered by the constraints in the initial statement, completed by the
890 type instance information of the background theory. Non-trivial sort
891 hypotheses, which rarely occur in practice, may be specified via
892 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
894 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
896 The result contains an implicit sort hypotheses as before --
897 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
900 * Generalized Isar history, with support for linear undo, direct state
903 * Changed defaults for unify configuration options:
905 unify_trace_bound = 50 (formerly 25)
906 unify_search_bound = 60 (formerly 30)
908 * Different bookkeeping for code equations (INCOMPATIBILITY):
910 a) On theory merge, the last set of code equations for a particular
911 constant is taken (in accordance with the policy applied by other
912 parts of the code generator framework).
914 b) Code equations stemming from explicit declarations (e.g. code
915 attribute) gain priority over default code equations stemming
916 from definition, primrec, fun etc.
918 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
920 * Unified theorem tables for both code generators. Thus [code
921 func] has disappeared and only [code] remains. INCOMPATIBILITY.
923 * Command 'find_consts' searches for constants based on type and name
926 find_consts "_ => bool"
928 By default, matching is against subtypes, but it may be restricted to
929 the whole type. Searching by name is possible. Multiple queries are
930 conjunctive and queries may be negated by prefixing them with a
933 find_consts strict: "_ => bool" name: "Int" -"int => int"
935 * New 'find_theorems' criterion "solves" matches theorems that
936 directly solve the current goal (modulo higher-order unification).
938 * Auto solve feature for main theorem statements: whenever a new goal
939 is stated, "find_theorems solves" is called; any theorems that could
940 solve the lemma directly are listed as part of the goal state.
941 Cf. associated options in Proof General Isabelle settings menu,
942 enabled by default, with reasonable timeout for pathological cases of
943 higher-order unification.
946 *** Document preparation ***
948 * Antiquotation @{lemma} now imitates a regular terminal proof,
949 demanding keyword 'by' and supporting the full method expression
950 syntax just like the Isar command 'by'.
955 * Integrated main parts of former image HOL-Complex with HOL. Entry
956 points Main and Complex_Main remain as before.
958 * Logic image HOL-Plain provides a minimal HOL with the most important
959 tools available (inductive, datatype, primrec, ...). This facilitates
960 experimentation and tool development. Note that user applications
961 (and library theories) should never refer to anything below theory
964 * Logic image HOL-Main stops at theory Main, and thus facilitates
965 experimentation due to shorter build times.
967 * Logic image HOL-NSA contains theories of nonstandard analysis which
968 were previously part of former HOL-Complex. Entry point Hyperreal
969 remains valid, but theories formerly using Complex_Main should now use
970 new entry point Hypercomplex.
972 * Generic ATP manager for Sledgehammer, based on ML threads instead of
973 Posix processes. Avoids potentially expensive forking of the ML
974 process. New thread-based implementation also works on non-Unix
975 platforms (Cygwin). Provers are no longer hardwired, but defined
976 within the theory via plain ML wrapper functions. Basic Sledgehammer
977 commands are covered in the isar-ref manual.
979 * Wrapper scripts for remote SystemOnTPTP service allows to use
980 sledgehammer without local ATP installation (Vampire etc.). Other
981 provers may be included via suitable ML wrappers, see also
982 src/HOL/ATP_Linkup.thy.
984 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
987 * The metis method no longer fails because the theorem is too trivial
988 (contains the empty clause).
990 * The metis method now fails in the usual manner, rather than raising
991 an exception, if it determines that it cannot prove the theorem.
993 * Method "coherent" implements a prover for coherent logic (see also
994 src/Tools/coherent.ML).
996 * Constants "undefined" and "default" replace "arbitrary". Usually
997 "undefined" is the right choice to replace "arbitrary", though
998 logically there is no difference. INCOMPATIBILITY.
1000 * Command "value" now integrates different evaluation mechanisms. The
1001 result of the first successful evaluation mechanism is printed. In
1002 square brackets a particular named evaluation mechanisms may be
1003 specified (currently, [SML], [code] or [nbe]). See further
1004 src/HOL/ex/Eval_Examples.thy.
1006 * Normalization by evaluation now allows non-leftlinear equations.
1007 Declare with attribute [code nbe].
1009 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1010 as the structured Isar versions "cases" and "induct", cf. the
1011 corresponding "cases" and "induct" attributes. Mutual induction rules
1012 are now presented as a list of individual projections
1013 (e.g. foo_bar.inducts for types foo and bar); the old format with
1014 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1015 rare situations a different rule is selected --- notably nested tuple
1016 elimination instead of former prod.exhaust: use explicit (case_tac t
1017 rule: prod.exhaust) here.
1019 * Attributes "cases", "induct", "coinduct" support "del" option.
1021 * Removed fact "case_split_thm", which duplicates "case_split".
1023 * The option datatype has been moved to a new theory Option. Renamed
1024 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1026 * New predicate "strict_mono" classifies strict functions on partial
1027 orders. With strict functions on linear orders, reasoning about
1028 (in)equalities is facilitated by theorems "strict_mono_eq",
1029 "strict_mono_less_eq" and "strict_mono_less".
1031 * Some set operations are now proper qualified constants with
1032 authentic syntax. INCOMPATIBILITY:
1043 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1046 * Auxiliary class "itself" has disappeared -- classes without any
1047 parameter are treated as expected by the 'class' command.
1049 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1051 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1052 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1054 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1055 method "approximation". It proves formulas on real values by using
1056 interval arithmetic. In the formulas are also the transcendental
1057 functions sin, cos, tan, atan, ln, exp and the constant pi are
1058 allowed. For examples see
1059 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1061 * Theory "Reflection" now resides in HOL/Library.
1063 * Entry point to Word library now simply named "Word".
1066 * Made source layout more coherent with logical distribution
1069 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1070 src/HOL/Library/Code_Message.thy ~> src/HOL/
1071 src/HOL/Library/GCD.thy ~> src/HOL/
1072 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1073 src/HOL/Library/Parity.thy ~> src/HOL/
1074 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1075 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1076 src/HOL/Real/Lubs.thy ~> src/HOL/
1077 src/HOL/Real/PReal.thy ~> src/HOL/
1078 src/HOL/Real/Rational.thy ~> src/HOL/
1079 src/HOL/Real/RComplete.thy ~> src/HOL/
1080 src/HOL/Real/RealDef.thy ~> src/HOL/
1081 src/HOL/Real/RealPow.thy ~> src/HOL/
1082 src/HOL/Real/Real.thy ~> src/HOL/
1083 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1084 src/HOL/Complex/Complex.thy ~> src/HOL/
1085 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1086 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1087 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1088 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1089 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1090 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1091 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1092 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1093 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1094 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1095 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1096 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1097 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1098 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1099 src/HOL/Real/Float ~> src/HOL/Library/
1100 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1101 src/HOL/Real/RealVector.thy ~> src/HOL/
1103 src/HOL/arith_data.ML ~> src/HOL/Tools
1104 src/HOL/hologic.ML ~> src/HOL/Tools
1105 src/HOL/simpdata.ML ~> src/HOL/Tools
1106 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1107 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1108 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1109 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1110 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1111 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1112 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1114 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1115 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1116 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1117 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1118 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1119 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1121 * If methods "eval" and "evaluation" encounter a structured proof
1122 state with !!/==>, only the conclusion is evaluated to True (if
1123 possible), avoiding strange error messages.
1125 * Method "sizechange" automates termination proofs using (a
1126 modification of) the size-change principle. Requires SAT solver. See
1127 src/HOL/ex/Termination.thy for examples.
1129 * Simplifier: simproc for let expressions now unfolds if bound
1130 variable occurs at most once in let expression body. INCOMPATIBILITY.
1132 * Method "arith": Linear arithmetic now ignores all inequalities when
1133 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1135 * New attribute "arith" for facts that should always be used
1136 automatically by arithmetic. It is intended to be used locally in
1139 assumes [arith]: "x > 0"
1141 Global usage is discouraged because of possible performance impact.
1143 * New classes "top" and "bot" with corresponding operations "top" and
1144 "bot" in theory Orderings; instantiation of class "complete_lattice"
1145 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1147 * Changed definition lemma "less_fun_def" in order to provide an
1148 instance for preorders on functions; use lemma "less_le" instead.
1151 * Theory Orderings: class "wellorder" moved here, with explicit
1152 induction rule "less_induct" as assumption. For instantiation of
1153 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1156 * Theory Orderings: added class "preorder" as superclass of "order".
1157 INCOMPATIBILITY: Instantiation proofs for order, linorder
1158 etc. slightly changed. Some theorems named order_class.* now named
1161 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1164 * Theory Finite_Set: added a new fold combinator of type
1166 ('a => 'b => 'b) => 'b => 'a set => 'b
1168 Occasionally this is more convenient than the old fold combinator
1169 which is now defined in terms of the new one and renamed to
1172 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1173 and "ring_simps" have been replaced by "algebra_simps" (which can be
1174 extended with further lemmas!). At the moment both still exist but
1175 the former will disappear at some point.
1177 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1178 class recpower. Type-specific simp rules for various recpower types
1179 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1181 rat_power_0 -> power_0
1182 rat_power_Suc -> power_Suc
1183 realpow_0 -> power_0
1184 realpow_Suc -> power_Suc
1185 complexpow_0 -> power_0
1186 complexpow_Suc -> power_Suc
1187 power_poly_0 -> power_0
1188 power_poly_Suc -> power_Suc
1190 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1191 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1192 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1193 of lemmas from Divides has been generalized from nat to class
1194 semiring_div. INCOMPATIBILITY. This involves the following theorem
1195 renames resulting from duplicate elimination:
1197 dvd_def_mod ~> dvd_eq_mod_eq_0
1198 zero_dvd_iff ~> dvd_0_left_iff
1199 dvd_0 ~> dvd_0_right
1200 DIVISION_BY_ZERO_DIV ~> div_by_0
1201 DIVISION_BY_ZERO_MOD ~> mod_by_0
1202 mult_div ~> div_mult_self2_is_id
1203 mult_mod ~> mod_mult_self2_is_0
1205 * Theory IntDiv: removed many lemmas that are instances of class-based
1206 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1207 rename old lemmas as follows:
1209 dvd_diff -> nat_dvd_diff
1210 dvd_zminus_iff -> dvd_minus_iff
1211 mod_add1_eq -> mod_add_eq
1212 mod_mult1_eq -> mod_mult_right_eq
1213 mod_mult1_eq' -> mod_mult_left_eq
1214 mod_mult_distrib_mod -> mod_mult_eq
1215 nat_mod_add_left_eq -> mod_add_left_eq
1216 nat_mod_add_right_eq -> mod_add_right_eq
1217 nat_mod_div_trivial -> mod_div_trivial
1218 nat_mod_mod_trivial -> mod_mod_trivial
1219 zdiv_zadd_self1 -> div_add_self1
1220 zdiv_zadd_self2 -> div_add_self2
1221 zdiv_zmult_self1 -> div_mult_self2_is_id
1222 zdiv_zmult_self2 -> div_mult_self1_is_id
1223 zdvd_triv_left -> dvd_triv_left
1224 zdvd_triv_right -> dvd_triv_right
1225 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1226 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1227 zmod_zadd_left_eq -> mod_add_left_eq
1228 zmod_zadd_right_eq -> mod_add_right_eq
1229 zmod_zadd_self1 -> mod_add_self1
1230 zmod_zadd_self2 -> mod_add_self2
1231 zmod_zadd1_eq -> mod_add_eq
1232 zmod_zdiff1_eq -> mod_diff_eq
1233 zmod_zdvd_zmod -> mod_mod_cancel
1234 zmod_zmod_cancel -> mod_mod_cancel
1235 zmod_zmult_self1 -> mod_mult_self2_is_0
1236 zmod_zmult_self2 -> mod_mult_self1_is_0
1239 zdvd_abs1 -> abs_dvd_iff
1240 zdvd_abs2 -> dvd_abs_iff
1241 zdvd_refl -> dvd_refl
1242 zdvd_trans -> dvd_trans
1243 zdvd_zadd -> dvd_add
1244 zdvd_zdiff -> dvd_diff
1245 zdvd_zminus_iff -> dvd_minus_iff
1246 zdvd_zminus2_iff -> minus_dvd_iff
1247 zdvd_zmultD -> dvd_mult_right
1248 zdvd_zmultD2 -> dvd_mult_left
1249 zdvd_zmult_mono -> mult_dvd_mono
1250 zdvd_0_right -> dvd_0_right
1251 zdvd_0_left -> dvd_0_left_iff
1252 zdvd_1_left -> one_dvd
1253 zminus_dvd_iff -> minus_dvd_iff
1255 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1257 * The real numbers offer decimal input syntax: 12.34 is translated
1258 into 1234/10^2. This translation is not reversed upon output.
1260 * Theory Library/Polynomial defines an abstract type 'a poly of
1261 univariate polynomials with coefficients of type 'a. In addition to
1262 the standard ring operations, it also supports div and mod. Code
1263 generation is also supported, using list-style constructors.
1265 * Theory Library/Inner_Product defines a class of real_inner for real
1266 inner product spaces, with an overloaded operation inner :: 'a => 'a
1267 => real. Class real_inner is a subclass of real_normed_vector from
1270 * Theory Library/Product_Vector provides instances for the product
1271 type 'a * 'b of several classes from RealVector and Inner_Product.
1272 Definitions of addition, subtraction, scalar multiplication, norms,
1273 and inner products are included.
1275 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1276 addition to the field operations, numerals and case syntax are also
1279 * Theory Library/Diagonalize provides constructive version of Cantor's
1280 first diagonalization argument.
1282 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1283 zlcm (for int); carried together from various gcd/lcm developements in
1284 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1285 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1286 may recover tupled syntax as follows:
1288 hide (open) const gcd
1289 abbreviation gcd where
1290 "gcd == (%(a, b). GCD.gcd a b)"
1292 GCD.gcd ("gcd '(_, _')")
1294 The same works for lcm, zgcd, zlcm.
1296 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1297 instantiations for algebraic structures. Removed some duplicate
1298 theorems. Changes in simp rules. INCOMPATIBILITY.
1300 * ML antiquotation @{code} takes a constant as argument and generates
1301 corresponding code in background and inserts name of the corresponding
1302 resulting ML value/function/datatype constructor binding in place.
1303 All occurrences of @{code} with a single ML block are generated
1304 simultaneously. Provides a generic and safe interface for
1305 instrumentalizing code generation. See
1306 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1307 In future you ought to refrain from ad-hoc compiling generated SML
1308 code on the ML toplevel. Note that (for technical reasons) @{code}
1309 cannot refer to constants for which user-defined serializations are
1310 set. Refer to the corresponding ML counterpart directly in that
1313 * Command 'rep_datatype': instead of theorem names the command now
1314 takes a list of terms denoting the constructors of the type to be
1315 represented as datatype. The characteristic theorems have to be
1316 proven. INCOMPATIBILITY. Also observe that the following theorems
1317 have disappeared in favour of existing ones:
1319 unit_induct ~> unit.induct
1320 prod_induct ~> prod.induct
1321 sum_induct ~> sum.induct
1322 Suc_Suc_eq ~> nat.inject
1323 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1328 * New locales for orders and lattices where the equivalence relation
1329 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1330 locales use a record structure with field eq for the equivalence.
1332 * New theory of factorial domains.
1334 * Units_l_inv and Units_r_inv are now simp rules by default.
1335 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1336 and/or r_inv will now also require deletion of these lemmas.
1338 * Renamed the following theorems, INCOMPATIBILITY:
1340 UpperD ~> Upper_memD
1341 LowerD ~> Lower_memD
1342 least_carrier ~> least_closed
1343 greatest_carrier ~> greatest_closed
1344 greatest_Lower_above ~> greatest_Lower_below
1345 one_zero ~> carrier_one_zero
1346 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1351 * Nominal datatypes can now contain type-variables.
1353 * Commands 'nominal_inductive' and 'equivariance' work with local
1356 * Nominal primrec can now works with local theory targets and its
1357 specification syntax now conforms to the general format as seen in
1360 * Method "perm_simp" honours the standard simplifier attributes
1361 (no_asm), (no_asm_use) etc.
1363 * The new predicate #* is defined like freshness, except that on the
1364 left hand side can be a set or list of atoms.
1366 * Experimental command 'nominal_inductive2' derives strong induction
1367 principles for inductive definitions. In contrast to
1368 'nominal_inductive', which can only deal with a fixed number of
1369 binders, it can deal with arbitrary expressions standing for sets of
1370 atoms to be avoided. The only inductive definition we have at the
1371 moment that needs this generalisation is the typing rule for Lets in
1374 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1375 -----------------------------------------------------------------
1376 Gamma |- Let x be t1 in t2 : T2
1378 In this rule one wants to avoid all the binders that are introduced by
1379 "close Gamma T1". We are looking for other examples where this
1380 feature might be useful. Please let us know.
1385 * Reimplemented the simplification procedure for proving continuity
1386 subgoals. The new simproc is extensible; users can declare additional
1387 continuity introduction rules with the attribute [cont2cont].
1389 * The continuity simproc now uses a different introduction rule for
1390 solving continuity subgoals on terms with lambda abstractions. In
1391 some rare cases the new simproc may fail to solve subgoals that the
1392 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1393 Potential INCOMPATIBILITY.
1395 * Command 'fixrec': specification syntax now conforms to the general
1396 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1397 examples. INCOMPATIBILITY.
1402 * Proof of Zorn's Lemma for partial orders.
1407 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1408 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1409 depends on multithreading, so timouts will not work before Poly/ML
1412 * High-level support for concurrent ML programming, see
1413 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1414 particularly convenient to organize independent functional
1415 computations. The concept of "synchronized variables" provides a
1416 higher-order interface for components with shared state, avoiding the
1417 delicate details of mutexes and condition variables. (Requires
1418 Poly/ML 5.2.1 or later.)
1420 * ML bindings produced via Isar commands are stored within the Isar
1421 context (theory or proof). Consequently, commands like 'use' and 'ML'
1422 become thread-safe and work with undo as expected (concerning
1423 top-level bindings, not side-effects on global references).
1424 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1425 compiler at runtime; really global bindings need to be given outside a
1426 theory. (Requires Poly/ML 5.2 or later.)
1428 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1429 context. Top-level ML bindings are stored within the proof context in
1430 a purely sequential fashion, disregarding the nested proof structure.
1431 ML bindings introduced by 'ML_prf' are discarded at the end of the
1432 proof. (Requires Poly/ML 5.2 or later.)
1434 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1435 and Method.setup, as well as Isar commands 'attribute_setup' and
1436 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1437 existing code accordingly, or use plain 'setup' together with old
1440 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1441 to 'a -> thm, while results are always tagged with an authentic oracle
1442 name. The Isar command 'oracle' is now polymorphic, no argument type
1443 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1444 accordingly. Note that extra performance may be gained by producing
1445 the cterm carefully, avoiding slow Thm.cterm_of.
1447 * Simplified interface for defining document antiquotations via
1448 ThyOutput.antiquotation, ThyOutput.output, and optionally
1449 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1450 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1453 * More systematic treatment of long names, abstract name bindings, and
1454 name space operations. Basic operations on qualified names have been
1455 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1456 Long_Name.append. Old type bstring has been mostly replaced by
1457 abstract type binding (see structure Binding), which supports precise
1458 qualification by packages and local theory targets, as well as proper
1459 tracking of source positions. INCOMPATIBILITY, need to wrap old
1460 bstring values into Binding.name, or better pass through abstract
1461 bindings everywhere. See further src/Pure/General/long_name.ML,
1462 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1464 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1465 LocalTheory.note etc.) now refer to the *full* internal name, not the
1466 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1468 * Disposed old type and term read functions (Sign.read_def_typ,
1469 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1470 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1471 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1472 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1473 resort for legacy applications.
1475 * Disposed old declarations, tactics, tactic combinators that refer to
1476 the simpset or claset of an implicit theory (such as Addsimps,
1477 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1478 embedded ML text, or local_simpset_of with a proper context passed as
1479 explicit runtime argument.
1481 * Rules and tactics that read instantiations (read_instantiate,
1482 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1483 context, which is required for parsing and type-checking. Moreover,
1484 the variables are specified as plain indexnames, not string encodings
1485 thereof. INCOMPATIBILITY.
1487 * Generic Toplevel.add_hook interface allows to analyze the result of
1488 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1489 for theorem dependency output of transactions resulting in a new
1492 * ML antiquotations: block-structured compilation context indicated by
1493 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1495 @{binding name} - basic name binding
1496 @{let ?pat = term} - term abbreviation (HO matching)
1497 @{note name = fact} - fact abbreviation
1498 @{thm fact} - singleton fact (with attributes)
1499 @{thms fact} - general fact (with attributes)
1500 @{lemma prop by method} - singleton goal
1501 @{lemma prop by meth1 meth2} - singleton goal
1502 @{lemma prop1 ... propN by method} - general goal
1503 @{lemma prop1 ... propN by meth1 meth2} - general goal
1504 @{lemma (open) ...} - open derivation
1509 * The Isabelle "emacs" tool provides a specific interface to invoke
1510 Proof General / Emacs, with more explicit failure if that is not
1511 installed (the old isabelle-interface script silently falls back on
1512 isabelle-process). The PROOFGENERAL_HOME setting determines the
1513 installation location of the Proof General distribution.
1515 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1516 the Isabelle process into a JVM/Scala application. See
1517 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1518 process wrapper has been discontinued.)
1520 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1522 * Various status messages (with exact source position information) are
1523 emitted, if proper markup print mode is enabled. This allows
1524 user-interface components to provide detailed feedback on internal
1529 New in Isabelle2008 (June 2008)
1530 -------------------------------
1534 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1535 and updated, with formally checked references as hyperlinks.
1537 * Theory loader: use_thy (and similar operations) no longer set the
1538 implicit ML context, which was occasionally hard to predict and in
1539 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1540 provides a proper context already.
1542 * Theory loader: old-style ML proof scripts being *attached* to a thy
1543 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1544 'use' within a theory file will do the job.
1546 * Name space merge now observes canonical order, i.e. the second space
1547 is inserted into the first one, while existing entries in the first
1548 space take precedence. INCOMPATIBILITY in rare situations, may try to
1549 swap theory imports.
1551 * Syntax: symbol \<chi> is now considered a letter. Potential
1552 INCOMPATIBILITY in identifier syntax etc.
1554 * Outer syntax: string tokens no longer admit escaped white space,
1555 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1556 white space without escapes.
1558 * Outer syntax: string tokens may contain arbitrary character codes
1559 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1565 * Context-dependent token translations. Default setup reverts locally
1566 fixed variables, and adds hilite markup for undeclared frees.
1568 * Unused theorems can be found using the new command 'unused_thms'.
1569 There are three ways of invoking it:
1572 Only finds unused theorems in the current theory.
1574 (2) unused_thms thy_1 ... thy_n -
1575 Finds unused theorems in the current theory and all of its ancestors,
1576 excluding the theories thy_1 ... thy_n and all of their ancestors.
1578 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1579 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1580 their ancestors, excluding the theories thy_1 ... thy_n and all of
1583 In order to increase the readability of the list produced by
1584 unused_thms, theorems that have been created by a particular instance
1585 of a theory command such as 'inductive' or 'function' are considered
1586 to belong to the same "group", meaning that if at least one theorem in
1587 this group is used, the other theorems in the same group are no longer
1588 reported as unused. Moreover, if all theorems in the group are
1589 unused, only one theorem in the group is displayed.
1591 Note that proof objects have to be switched on in order for
1592 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1593 usually the case when using Proof General with the default settings).
1595 * Authentic naming of facts disallows ad-hoc overwriting of previous
1596 theorems within the same name space. INCOMPATIBILITY, need to remove
1597 duplicate fact bindings, or even accidental fact duplications. Note
1598 that tools may maintain dynamically scoped facts systematically, using
1599 PureThy.add_thms_dynamic.
1601 * Command 'hide' now allows to hide from "fact" name space as well.
1603 * Eliminated destructive theorem database, simpset, claset, and
1604 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1605 update of theories within ML code.
1607 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1608 INCOMPATIBILITY, object-logics depending on former Pure require
1609 additional setup PureThy.old_appl_syntax_setup; object-logics
1610 depending on former CPure need to refer to Pure.
1612 * Commands 'use' and 'ML' are now purely functional, operating on
1613 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1614 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1617 * Command 'setup': discontinued implicit version with ML reference.
1619 * Instantiation target allows for simultaneous specification of class
1620 instance operations together with an instantiation proof.
1621 Type-checking phase allows to refer to class operations uniformly.
1622 See src/HOL/Complex/Complex.thy for an Isar example and
1623 src/HOL/Library/Eval.thy for an ML example.
1625 * Indexing of literal facts: be more serious about including only
1626 facts from the visible specification/proof context, but not the
1627 background context (locale etc.). Affects `prop` notation and method
1628 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1631 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1632 "(open)" option, which used to expose internal bound variables to the
1635 * Isar statements: removed obsolete case "rule_context".
1636 INCOMPATIBILITY, better use explicit fixes/assumes.
1638 * Locale proofs: default proof step now includes 'unfold_locales';
1639 hence 'proof' without argument may be used to unfold locale
1643 *** Document preparation ***
1645 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1646 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1647 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1648 spot); renamed link color from "darkblue" to "linkcolor" (default
1649 value unchanged, can be redefined via \definecolor); no longer sets
1650 "a4paper" option (unnecessary or even intrusive).
1652 * Antiquotation @{lemma A method} proves proposition A by the given
1653 method (either a method name or a method name plus (optional) method
1654 arguments in parentheses) and prints A just like @{prop A}.
1659 * New primrec package. Specification syntax conforms in style to
1660 definition/function/.... No separate induction rule is provided. The
1661 "primrec" command distinguishes old-style and new-style specifications
1662 by syntax. The former primrec package is now named OldPrimrecPackage.
1663 When adjusting theories, beware: constants stemming from new-style
1664 primrec specifications have authentic syntax.
1666 * Metis prover is now an order of magnitude faster, and also works
1667 with multithreading.
1669 * Metis: the maximum number of clauses that can be produced from a
1670 theorem is now given by the attribute max_clauses. Theorems that
1671 exceed this number are ignored, with a warning printed.
1673 * Sledgehammer no longer produces structured proofs by default. To
1674 enable, declare [[sledgehammer_full = true]]. Attributes
1675 reconstruction_modulus, reconstruction_sorts renamed
1676 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1678 * Method "induct_scheme" derives user-specified induction rules
1679 from well-founded induction and completeness of patterns. This factors
1680 out some operations that are done internally by the function package
1681 and makes them available separately. See
1682 src/HOL/ex/Induction_Scheme.thy for examples.
1684 * More flexible generation of measure functions for termination
1685 proofs: Measure functions can be declared by proving a rule of the
1686 form "is_measure f" and giving it the [measure_function] attribute.
1687 The "is_measure" predicate is logically meaningless (always true), and
1688 just guides the heuristic. To find suitable measure functions, the
1689 termination prover sets up the goal "is_measure ?f" of the appropriate
1690 type and generates all solutions by prolog-style backwards proof using
1693 This setup also deals with rules like
1695 "is_measure f ==> is_measure (list_size f)"
1697 which accommodates nested datatypes that recurse through lists.
1698 Similar rules are predeclared for products and option types.
1700 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1704 - Definitions of overloaded constants on sets have to be replaced by
1705 definitions on => and bool.
1707 - Some definitions of overloaded operators on sets can now be proved
1708 using the definitions of the operators on => and bool. Therefore,
1709 the following theorems have been renamed:
1711 subset_def -> subset_eq
1712 psubset_def -> psubset_eq
1713 set_diff_def -> set_diff_eq
1714 Compl_def -> Compl_eq
1715 Sup_set_def -> Sup_set_eq
1716 Inf_set_def -> Inf_set_eq
1717 sup_set_def -> sup_set_eq
1718 inf_set_def -> inf_set_eq
1720 - Due to the incompleteness of the HO unification algorithm, some
1721 rules such as subst may require manual instantiation, if some of
1722 the unknowns in the rule is a set.
1724 - Higher order unification and forward proofs:
1727 have "P (S::'a set)" <...>
1728 then have "EX S. P S" ..
1730 no longer works (due to the incompleteness of the HO unification
1731 algorithm) and must be replaced by the pattern
1738 - Calculational reasoning with subst (or similar rules):
1741 have "P (S::'a set)" <...>
1742 also have "S = T" <...>
1743 finally have "P T" .
1745 no longer works (for similar reasons as the previous example) and
1746 must be replaced by something like
1748 have "P (S::'a set)" <...>
1749 moreover have "S = T" <...>
1750 ultimately have "P T" by simp
1752 - Tactics or packages written in ML code:
1753 Code performing pattern matching on types via
1755 Type ("set", [T]) => ...
1757 must be rewritten. Moreover, functions like strip_type or
1758 binder_types no longer return the right value when applied to a
1761 T1 => ... => Tn => U => bool
1765 T1 => ... => Tn => U set
1767 * Merged theories Wellfounded_Recursion, Accessible_Part and
1768 Wellfounded_Relations to theory Wellfounded.
1770 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1772 * Class finite no longer treats UNIV as class parameter. Use class
1773 enum from theory Library/Enum instead to achieve a similar effect.
1776 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1777 and "Cons". INCOMPATIBILITY.
1779 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1780 Potential INCOMPATIBILITY.
1782 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1783 injective_fst_snd removed, use split_eta and prod_eqI instead.
1784 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1786 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1787 the same name in theory Orderings:
1797 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1798 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1799 and different variable names.
1801 * Library/Option_ord.thy: Canonical order on option type.
1803 * Library/RBT.thy: Red-black trees, an efficient implementation of
1806 * Library/Countable.thy: Type class for countable types.
1808 * Theory Int: The representation of numerals has changed. The infix
1809 operator BIT and the bit datatype with constructors B0 and B1 have
1810 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1811 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1812 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1815 * Theory Nat: definition of <= and < on natural numbers no longer
1816 depend on well-founded relations. INCOMPATIBILITY. Definitions
1817 le_def and less_def have disappeared. Consider lemmas not_less
1818 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1820 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1821 (whose purpose mainly is for various fold_set functionals) have been
1822 abandoned in favor of the existing algebraic classes
1823 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1824 lower_semilattice (resp. upper_semilattice) and linorder.
1827 * Theory Transitive_Closure: induct and cases rules now declare proper
1828 case_names ("base" and "step"). INCOMPATIBILITY.
1830 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1831 lattices. The form set-specific version is available as
1832 Inductive.lfp_ordinal_induct_set.
1834 * Renamed theorems "power.simps" to "power_int.simps".
1837 * Class semiring_div provides basic abstract properties of semirings
1838 with division and modulo operations. Subsumes former class dvd_mod.
1840 * Merged theories IntDef, Numeral and IntArith into unified theory
1841 Int. INCOMPATIBILITY.
1843 * Theory Library/Code_Index: type "index" now represents natural
1844 numbers rather than integers. INCOMPATIBILITY.
1846 * New class "uminus" with operation "uminus" (split of from class
1847 "minus" which now only has operation "minus", binary).
1850 * Constants "card", "internal_split", "option_map" now with authentic
1851 syntax. INCOMPATIBILITY.
1853 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1854 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1855 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1856 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1857 Sup_set_def, le_def, less_def, option_map_def now with object
1858 equality. INCOMPATIBILITY.
1860 * Records. Removed K_record, and replaced it by pure lambda term
1861 %x. c. The simplifier setup is now more robust against eta expansion.
1862 INCOMPATIBILITY: in cases explicitly referring to K_record.
1864 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1866 * Library/ListVector: new theory of arithmetic vector operations.
1868 * Library/Order_Relation: new theory of various orderings as sets of
1869 pairs. Defines preorders, partial orders, linear orders and
1870 well-orders on sets and on types.
1875 * Renamed some theories to allow to loading both ZF and HOL in the
1878 Datatype -> Datatype_ZF
1879 Inductive -> Inductive_ZF
1886 INCOMPATIBILITY: ZF theories that import individual theories below
1887 Main might need to be adapted. Regular theory Main is still
1888 available, as trivial extension of Main_ZF.
1893 * ML within Isar: antiquotation @{const name} or @{const
1894 name(typargs)} produces statically-checked Const term.
1896 * Functor NamedThmsFun: data is available to the user as dynamic fact
1897 (of the same name). Removed obsolete print command.
1899 * Removed obsolete "use_legacy_bindings" function.
1901 * The ``print mode'' is now a thread-local value derived from a global
1902 template (the former print_mode reference), thus access becomes
1903 non-critical. The global print_mode reference is for session
1904 management only; user-code should use print_mode_value,
1905 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1907 * Functions system/system_out provide a robust way to invoke external
1908 shell commands, with propagation of interrupts (requires Poly/ML
1909 5.2.1). Do not use OS.Process.system etc. from the basis library!
1914 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1915 in accordance with Proof General 3.7, which prefers GNU emacs.
1917 * isatool tty runs Isabelle process with plain tty interaction;
1918 optional line editor may be specified via ISABELLE_LINE_EDITOR
1919 setting, the default settings attempt to locate "ledit" and "rlwrap".
1921 * isatool browser now works with Cygwin as well, using general
1922 "javapath" function defined in Isabelle process environment.
1924 * YXML notation provides a simple and efficient alternative to
1925 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1926 isatool yxml as described in the Isabelle system manual.
1928 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1929 provides general wrapper for managing an Isabelle process in a robust
1930 fashion, with ``cooked'' output from stdin/stderr.
1932 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1933 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1935 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1936 way of changing the user's settings is via
1937 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1940 * Multithreading.max_threads := 0 refers to the number of actual CPU
1941 cores of the underlying machine, which is a good starting point for
1942 optimal performance tuning. The corresponding usedir option -M allows
1943 "max" as an alias for "0". WARNING: does not work on certain versions
1944 of Mac OS (with Poly/ML 5.1).
1946 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1947 adverse effect of Isabelle flooding interactive front-ends (notably
1948 ProofGeneral / XEmacs).
1952 New in Isabelle2007 (November 2007)
1953 -----------------------------------
1957 * More uniform information about legacy features, notably a
1958 warning/error of "Legacy feature: ...", depending on the state of the
1959 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1960 legacy features will disappear eventually.
1962 * Theory syntax: the header format ``theory A = B + C:'' has been
1963 discontinued in favour of ``theory A imports B C begin''. Use isatool
1964 fixheaders to convert existing theory files. INCOMPATIBILITY.
1966 * Theory syntax: the old non-Isar theory file format has been
1967 discontinued altogether. Note that ML proof scripts may still be used
1968 with Isar theories; migration is usually quite simple with the ML
1969 function use_legacy_bindings. INCOMPATIBILITY.
1971 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1972 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1975 * Theory loader: be more serious about observing the static theory
1976 header specifications (including optional directories), but not the
1977 accidental file locations of previously successful loads. The strict
1978 update policy of former update_thy is now already performed by
1979 use_thy, so the former has been removed; use_thys updates several
1980 theories simultaneously, just as 'imports' within a theory header
1981 specification, but without merging the results. Potential
1982 INCOMPATIBILITY: may need to refine theory headers and commands
1983 ROOT.ML which depend on load order.
1985 * Theory loader: optional support for content-based file
1986 identification, instead of the traditional scheme of full physical
1987 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1988 (cf. the system manual). The new scheme allows to work with
1989 non-finished theories in persistent session images, such that source
1990 files may be moved later on without requiring reloads.
1992 * Theory loader: old-style ML proof scripts being *attached* to a thy
1993 file (with the same base name as the theory) are considered a legacy
1994 feature, which will disappear eventually. Even now, the theory loader
1995 no longer maintains dependencies on such files.
1997 * Syntax: the scope for resolving ambiguities via type-inference is
1998 now limited to individual terms, instead of whole simultaneous
1999 specifications as before. This greatly reduces the complexity of the
2000 syntax module and improves flexibility by separating parsing and
2001 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2002 'fixes' etc.) are required in rare situations.
2004 * Syntax: constants introduced by new-style packages ('definition',
2005 'abbreviation' etc.) are passed through the syntax module in
2006 ``authentic mode''. This means that associated mixfix annotations
2007 really stick to such constants, independently of potential name space
2008 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2009 trees are represented slightly differently, may need to adapt syntax
2010 translations accordingly. Use CONST marker in 'translations' and
2011 @{const_syntax} antiquotation in 'parse_translation' etc.
2013 * Legacy goal package: reduced interface to the bare minimum required
2014 to keep existing proof scripts running. Most other user-level
2015 functions are now part of the OldGoals structure, which is *not* open
2016 by default (consider isatool expandshort before open OldGoals).
2017 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2018 these tend to cause confusion about the actual goal (!) context being
2019 used here, which is not necessarily the same as the_context().
2021 * Command 'find_theorems': supports "*" wild-card in "name:"
2022 criterion; "with_dups" option. Certain ProofGeneral versions might
2023 support a specific search form (see ProofGeneral/CHANGES).
2025 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2026 by default, which means that "prems" (and also "fixed variables") are
2027 suppressed from proof state output. Note that the ProofGeneral
2028 settings mechanism allows to change and save options persistently, but
2029 older versions of Isabelle will fail to start up if a negative prems
2032 * Local theory targets may be specified by non-nested blocks of
2033 ``context/locale/class ... begin'' followed by ``end''. The body may
2034 contain definitions, theorems etc., including any derived mechanism
2035 that has been implemented on top of these primitives. This concept
2036 generalizes the existing ``theorem (in ...)'' towards more versatility
2039 * Proof General interface: proper undo of final 'end' command;
2040 discontinued Isabelle/classic mode (ML proof scripts).
2043 *** Document preparation ***
2045 * Added antiquotation @{theory name} which prints the given name,
2046 after checking that it refers to a valid ancestor theory in the
2049 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2050 check the given source text as ML type/structure, printing verbatim.
2052 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2053 "c args == rhs" given in the current context. (Any number of
2054 arguments may be given on the LHS.)
2059 * The 'class' package offers a combination of axclass and locale to
2060 achieve Haskell-like type classes in Isabelle. Definitions and
2061 theorems within a class context produce both relative results (with
2062 implicit parameters according to the locale context), and polymorphic
2063 constants with qualified polymorphism (according to the class
2064 context). Within the body context of a 'class' target, a separate
2065 syntax layer ("user space type system") takes care of converting
2066 between global polymorphic consts and internal locale representation.
2067 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2068 "isatool doc classes" provides a tutorial.
2070 * Generic code generator framework allows to generate executable
2071 code for ML and Haskell (including Isabelle classes). A short usage
2074 internal compilation:
2075 export_code <list of constants (term syntax)> in SML
2076 writing SML code to a file:
2077 export_code <list of constants (term syntax)> in SML <filename>
2078 writing OCaml code to a file:
2079 export_code <list of constants (term syntax)> in OCaml <filename>
2080 writing Haskell code to a bunch of files:
2081 export_code <list of constants (term syntax)> in Haskell <filename>
2083 evaluating closed propositions to True/False using code generation:
2086 Reasonable default setup of framework in HOL.
2088 Theorem attributs for selecting and transforming function equations theorems:
2090 [code fun]: select a theorem as function equation for a specific constant
2091 [code fun del]: deselect a theorem as function equation for a specific constant
2092 [code inline]: select an equation theorem for unfolding (inlining) in place
2093 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2095 User-defined serializations (target in {SML, OCaml, Haskell}):
2097 code_const <and-list of constants (term syntax)>
2098 {(target) <and-list of const target syntax>}+
2100 code_type <and-list of type constructors>
2101 {(target) <and-list of type target syntax>}+
2103 code_instance <and-list of instances>
2105 where instance ::= <type constructor> :: <class>
2107 code_class <and_list of classes>
2108 {(target) <and-list of class target syntax>}+
2109 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2111 code_instance and code_class only are effective to target Haskell.
2113 For example usage see src/HOL/ex/Codegenerator.thy and
2114 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2115 generation from Isabelle/HOL theories is available via "isatool doc
2118 * Code generator: consts in 'consts_code' Isar commands are now
2119 referred to by usual term syntax (including optional type
2122 * Command 'no_translations' removes translation rules from theory
2125 * Overloaded definitions are now actually checked for acyclic
2126 dependencies. The overloading scheme is slightly more general than
2127 that of Haskell98, although Isabelle does not demand an exact
2128 correspondence to type class and instance declarations.
2129 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2130 exotic versions of overloading -- at the discretion of the user!
2132 Polymorphic constants are represented via type arguments, i.e. the
2133 instantiation that matches an instance against the most general
2134 declaration given in the signature. For example, with the declaration
2135 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2136 as c(nat). Overloading is essentially simultaneous structural
2137 recursion over such type arguments. Incomplete specification patterns
2138 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2139 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2140 Command 'print_theory' outputs the normalized system of recursive
2141 equations, see section "definitions".
2143 * Configuration options are maintained within the theory or proof
2144 context (with name and type bool/int/string), providing a very simple
2145 interface to a poor-man's version of general context data. Tools may
2146 declare options in ML (e.g. using Attrib.config_int) and then refer to
2147 these values using Config.get etc. Users may change options via an
2148 associated attribute of the same name. This form of context
2149 declaration works particularly well with commands 'declare' or
2150 'using', for example ``declare [[foo = 42]]''. Thus it has become
2151 very easy to avoid global references, which would not observe Isar
2152 toplevel undo/redo and fail to work with multithreading.
2154 Various global ML references of Pure and HOL have been turned into
2155 configuration options:
2157 Unify.search_bound unify_search_bound
2158 Unify.trace_bound unify_trace_bound
2159 Unify.trace_simp unify_trace_simp
2160 Unify.trace_types unify_trace_types
2161 Simplifier.simp_depth_limit simp_depth_limit
2162 Blast.depth_limit blast_depth_limit
2163 DatatypeProp.dtK datatype_distinctness_limit
2164 fast_arith_neq_limit fast_arith_neq_limit
2165 fast_arith_split_limit fast_arith_split_limit
2167 * Named collections of theorems may be easily installed as context
2168 data using the functor NamedThmsFun (see also
2169 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2170 attributes; there is also a toplevel print command. This facility is
2171 just a common case of general context data, which is the preferred way
2172 for anything more complex than just a list of facts in canonical
2175 * Isar: command 'declaration' augments a local theory by generic
2176 declaration functions written in ML. This enables arbitrary content
2177 being added to the context, depending on a morphism that tells the
2178 difference of the original declaration context wrt. the application
2179 context encountered later on.
2181 * Isar: proper interfaces for simplification procedures. Command
2182 'simproc_setup' declares named simprocs (with match patterns, and body
2183 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2184 context. ML antiquotation @{simproc name} retrieves named simprocs.
2186 * Isar: an extra pair of brackets around attribute declarations
2187 abbreviates a theorem reference involving an internal dummy fact,
2188 which will be ignored later --- only the effect of the attribute on
2189 the background context will persist. This form of in-place
2190 declarations is particularly useful with commands like 'declare' and
2191 'using', for example ``have A using [[simproc a]] by simp''.
2193 * Isar: method "assumption" (and implicit closing of subproofs) now
2194 takes simple non-atomic goal assumptions into account: after applying
2195 an assumption as a rule the resulting subgoals are solved by atomic
2196 assumption steps. This is particularly useful to finish 'obtain'
2197 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2198 without referring to the original premise "!!x. P x ==> thesis" in the
2199 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2202 * Isar: implicit use of prems from the Isar proof context is
2203 considered a legacy feature. Common applications like ``have A .''
2204 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2205 referencing facts explicitly here improves readability and
2206 maintainability of proof texts.
2208 * Isar: improper proof element 'guess' is like 'obtain', but derives
2209 the obtained context from the course of reasoning! For example:
2211 assume "EX x y. A x & B y" -- "any previous fact"
2212 then guess x and y by clarify
2214 This technique is potentially adventurous, depending on the facts and
2215 proof tools being involved here.
2217 * Isar: known facts from the proof context may be specified as literal
2218 propositions, using ASCII back-quote syntax. This works wherever
2219 named facts used to be allowed so far, in proof commands, proof
2220 methods, attributes etc. Literal facts are retrieved from the context
2221 according to unification of type and term parameters. For example,
2222 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2223 theorems in the current context, then these are valid literal facts:
2224 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2226 There is also a proof method "fact" which does the same composition
2227 for explicit goal states, e.g. the following proof texts coincide with
2228 certain special cases of literal facts:
2230 have "A" by fact == note `A`
2231 have "A ==> B" by fact == note `A ==> B`
2232 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2233 have "P a ==> Q a" by fact == note `P a ==> Q a`
2235 * Isar: ":" (colon) is no longer a symbolic identifier character in
2236 outer syntax. Thus symbolic identifiers may be used without
2237 additional white space in declarations like this: ``assume *: A''.
2239 * Isar: 'print_facts' prints all local facts of the current context,
2240 both named and unnamed ones.
2242 * Isar: 'def' now admits simultaneous definitions, e.g.:
2244 def x == "t" and y == "u"
2246 * Isar: added command 'unfolding', which is structurally similar to
2247 'using', but affects both the goal state and facts by unfolding given
2248 rewrite rules. Thus many occurrences of the 'unfold' method or
2249 'unfolded' attribute may be replaced by first-class proof text.
2251 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2252 and command 'unfolding' now all support object-level equalities
2253 (potentially conditional). The underlying notion of rewrite rule is
2254 analogous to the 'rule_format' attribute, but *not* that of the
2255 Simplifier (which is usually more generous).
2257 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2258 premises of a theorem by n. Useful in conjunction with drule.
2260 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2261 method expression within a sandbox consisting of the first N
2262 sub-goals, which need to exist. For example, ``simp_all [3]''
2263 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2264 simplifies all new goals that emerge from applying rule foo to the
2265 originally first one.
2267 * Isar: schematic goals are no longer restricted to higher-order
2268 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2271 * Isar: the conclusion of a long theorem statement is now either
2272 'shows' (a simultaneous conjunction, as before), or 'obtains'
2273 (essentially a disjunction of cases with local parameters and
2274 assumptions). The latter allows to express general elimination rules
2275 adequately; in this notation common elimination rules look like this:
2277 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2279 obtains x where "P x"
2281 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2285 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2291 The subsequent classical rules even refer to the formal "thesis"
2294 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2297 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2298 obtains "thesis ==> something"
2300 The actual proof of an 'obtains' statement is analogous to that of the
2301 Isar proof element 'obtain', only that there may be several cases.
2302 Optional case names may be specified in parentheses; these will be
2303 available both in the present proof and as annotations in the
2304 resulting rule, for later use with the 'cases' method (cf. attribute
2307 * Isar: the assumptions of a long theorem statement are available as
2308 "assms" fact in the proof context. This is more appropriate than the
2309 (historical) "prems", which refers to all assumptions of the current
2310 context, including those from the target locale, proof body etc.
2312 * Isar: 'print_statement' prints theorems from the current theory or
2313 proof context in long statement form, according to the syntax of a
2316 * Isar: 'obtain' takes an optional case name for the local context
2317 introduction rule (default "that").
2319 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2320 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2323 * Pure: syntax "CONST name" produces a fully internalized constant
2324 according to the current context. This is particularly useful for
2325 syntax translations that should refer to internal constant
2326 representations independently of name spaces.
2328 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2329 instead of "FOO ". This allows multiple binder declarations to coexist
2330 in the same context. INCOMPATIBILITY.
2332 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2333 primitive that also works in a locale context (both for constants and
2334 fixed variables). Type declaration and internal syntactic representation
2335 of given constants retrieved from the context. Likewise, the
2336 'no_notation' command allows to remove given syntax annotations from the
2339 * Isar/locales: new derived specification elements 'axiomatization',
2340 'definition', 'abbreviation', which support type-inference, admit
2341 object-level specifications (equality, equivalence). See also the
2342 isar-ref manual. Examples:
2345 eq (infix "===" 50) where
2346 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2348 definition "f x y = x + y + 1"
2349 definition g where "g x = f x x"
2352 neq (infix "=!=" 50) where
2353 "x =!= y == ~ (x === y)"
2355 These specifications may be also used in a locale context. Then the
2356 constants being introduced depend on certain fixed parameters, and the
2357 constant name is qualified by the locale base name. An internal
2358 abbreviation takes care for convenient input and output, making the
2359 parameters implicit and using the original short name. See also
2360 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2361 entities from a monomorphic theory.
2363 Presently, abbreviations are only available 'in' a target locale, but
2364 not inherited by general import expressions. Also note that
2365 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2366 'translations' in common applications. The "no_abbrevs" print mode
2367 prevents folding of abbreviations in term output.
2369 Concrete syntax is attached to specified constants in internal form,
2370 independently of name spaces. The parse tree representation is
2371 slightly different -- use 'notation' instead of raw 'syntax', and
2372 'translations' with explicit "CONST" markup to accommodate this.
2374 * Pure/Isar: unified syntax for new-style specification mechanisms
2375 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2376 full type inference and dummy patterns ("_"). For example:
2378 definition "K x _ = x"
2380 inductive conj for A B
2381 where "A ==> B ==> conj A B"
2383 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2384 the current context. Print mode "no_abbrevs" prevents inversion of
2385 abbreviations on output.
2387 * Isar/locales: improved parameter handling: use of locales "var" and
2388 "struct" no longer necessary; - parameter renamings are no longer
2389 required to be injective. For example, this allows to define
2390 endomorphisms as locale endom = homom mult mult h.
2392 * Isar/locales: changed the way locales with predicates are defined.
2393 Instead of accumulating the specification, the imported expression is
2394 now an interpretation. INCOMPATIBILITY: different normal form of
2395 locale expressions. In particular, in interpretations of locales with
2396 predicates, goals repesenting already interpreted fragments are not
2397 removed automatically. Use methods `intro_locales' and
2398 `unfold_locales'; see below.
2400 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2401 provide backward reasoning on locales predicates. The methods are
2402 aware of interpretations and discharge corresponding goals.
2403 `intro_locales' is less aggressive then `unfold_locales' and does not
2404 unfold predicates to assumptions.
2406 * Isar/locales: the order in which locale fragments are accumulated
2407 has changed. This enables to override declarations from fragments due
2408 to interpretations -- for example, unwanted simp rules.
2410 * Isar/locales: interpretation in theories and proof contexts has been
2411 extended. One may now specify (and prove) equations, which are
2412 unfolded in interpreted theorems. This is useful for replacing
2413 defined concepts (constants depending on locale parameters) by
2414 concepts already existing in the target context. Example:
2416 interpretation partial_order ["op <= :: [int, int] => bool"]
2417 where "partial_order.less (op <=) (x::int) y = (x < y)"
2419 Typically, the constant `partial_order.less' is created by a
2420 definition specification element in the context of locale
2423 * Method "induct": improved internal context management to support
2424 local fixes and defines on-the-fly. Thus explicit meta-level
2425 connectives !! and ==> are rarely required anymore in inductive goals
2426 (using object-logic connectives for this purpose has been long
2427 obsolete anyway). Common proof patterns are explained in
2428 src/HOL/Induct/Common_Patterns.thy, see also
2429 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2432 * Method "induct": improved handling of simultaneous goals. Instead of
2433 introducing object-level conjunction, the statement is now split into
2434 several conclusions, while the corresponding symbolic cases are nested
2435 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2436 see src/HOL/Induct/Common_Patterns.thy, for example.
2438 * Method "induct": mutual induction rules are now specified as a list
2439 of rule sharing the same induction cases. HOL packages usually provide
2440 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2441 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2442 mutual induction rules differently, i.e. like this:
2444 (induct rule: foo_bar.inducts)
2445 (induct set: foo bar)
2446 (induct pred: foo bar)
2447 (induct type: foo bar)
2449 The ML function ProjectRule.projections turns old-style rules into the
2452 * Method "coinduct": dual of induction, see
2453 src/HOL/Library/Coinductive_List.thy for various examples.
2455 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2456 considered a legacy feature.
2458 * Attribute "symmetric" produces result with standardized schematic
2459 variables (index 0). Potential INCOMPATIBILITY.
2461 * Simplifier: by default the simplifier trace only shows top level
2462 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2463 default. Thus there is less danger of being flooded by the trace. The
2464 trace indicates where parts have been suppressed.
2466 * Provers/classical: removed obsolete classical version of elim_format
2467 attribute; classical elim/dest rules are now treated uniformly when
2468 manipulating the claset.
2470 * Provers/classical: stricter checks to ensure that supplied intro,
2471 dest and elim rules are well-formed; dest and elim rules must have at
2474 * Provers/classical: attributes dest/elim/intro take an optional
2475 weight argument for the rule (just as the Pure versions). Weights are
2476 ignored by automated tools, but determine the search order of single
2479 * Syntax: input syntax now supports dummy variable binding "%_. b",
2480 where the body does not mention the bound variable. Note that dummy
2481 patterns implicitly depend on their context of bounds, which makes
2482 "{_. _}" match any set comprehension as expected. Potential
2483 INCOMPATIBILITY -- parse translations need to cope with syntactic
2484 constant "_idtdummy" in the binding position.
2486 * Syntax: removed obsolete syntactic constant "_K" and its associated
2487 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2488 for example "A -> B" => "Pi A (%_. B)".
2490 * Pure: 'class_deps' command visualizes the subclass relation, using
2491 the graph browser tool.
2493 * Pure: 'print_theory' now suppresses certain internal declarations by
2494 default; use '!' option for full details.
2499 * Method "metis" proves goals by applying the Metis general-purpose
2500 resolution prover (see also http://gilith.com/software/metis/).
2501 Examples are in the directory MetisExamples. WARNING: the
2502 Isabelle/HOL-Metis integration does not yet work properly with
2505 * Command 'sledgehammer' invokes external automatic theorem provers as
2506 background processes. It generates calls to the "metis" method if
2507 successful. These can be pasted into the proof. Users do not have to
2508 wait for the automatic provers to return. WARNING: does not really
2509 work with multi-threading.
2511 * New "auto_quickcheck" feature tests outermost goal statements for
2512 potential counter-examples. Controlled by ML references
2513 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2514 5000 milliseconds). Fails silently if statements is outside of
2515 executable fragment, or any other codgenerator problem occurs.
2517 * New constant "undefined" with axiom "undefined x = undefined".
2519 * Added class "HOL.eq", allowing for code generation with polymorphic
2522 * Some renaming of class constants due to canonical name prefixing in
2523 the new 'class' package:
2525 HOL.abs ~> HOL.abs_class.abs
2526 HOL.divide ~> HOL.divide_class.divide
2527 0 ~> HOL.zero_class.zero
2528 1 ~> HOL.one_class.one
2529 op + ~> HOL.plus_class.plus
2530 op - ~> HOL.minus_class.minus
2531 uminus ~> HOL.minus_class.uminus
2532 op * ~> HOL.times_class.times
2533 op < ~> HOL.ord_class.less
2534 op <= > HOL.ord_class.less_eq
2535 Nat.power ~> Power.power_class.power
2536 Nat.size ~> Nat.size_class.size
2537 Numeral.number_of ~> Numeral.number_class.number_of
2538 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2539 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2540 Orderings.min ~> Orderings.ord_class.min
2541 Orderings.max ~> Orderings.ord_class.max
2542 Divides.op div ~> Divides.div_class.div
2543 Divides.op mod ~> Divides.div_class.mod
2544 Divides.op dvd ~> Divides.div_class.dvd
2546 INCOMPATIBILITY. Adaptions may be required in the following cases:
2548 a) User-defined constants using any of the names "plus", "minus",
2549 "times", "less" or "less_eq". The standard syntax translations for
2550 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2553 b) Variables named "plus", "minus", "times", "less", "less_eq"
2554 INCOMPATIBILITY: use more specific names.
2556 c) Permutative equations (e.g. "a + b = b + a")
2557 Since the change of names also changes the order of terms, permutative
2558 rewrite rules may get applied in a different order. Experience shows
2559 that this is rarely the case (only two adaptions in the whole Isabelle
2560 distribution). INCOMPATIBILITY: rewrite proofs
2562 d) ML code directly refering to constant names
2563 This in general only affects hand-written proof tactics, simprocs and
2564 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2565 Consider using @{const_name} antiquotation.
2567 * New class "default" with associated constant "default".
2569 * Function "sgn" is now overloaded and available on int, real, complex
2570 (and other numeric types), using class "sgn". Two possible defs of
2571 sgn are given as equational assumptions in the classes sgn_if and
2572 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2575 * Locale "partial_order" now unified with class "order" (cf. theory
2576 Orderings), added parameter "less". INCOMPATIBILITY.
2578 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2579 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2580 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2582 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2583 changed order of proof goals in instance proofs.
2585 * The transitivity reasoner for partial and linear orders is set up
2586 for classes "order" and "linorder". Instances of the reasoner are available
2587 in all contexts importing or interpreting the corresponding locales.
2588 Method "order" invokes the reasoner separately; the reasoner
2589 is also integrated with the Simplifier as a solver. Diagnostic
2590 command 'print_orders' shows the available instances of the reasoner
2591 in the current context.
2593 * Localized monotonicity predicate in theory "Orderings"; integrated
2594 lemmas max_of_mono and min_of_mono with this predicate.
2597 * Formulation of theorem "dense" changed slightly due to integration
2598 with new class dense_linear_order.
2600 * Uniform lattice theory development in HOL.
2602 constants "meet" and "join" now named "inf" and "sup"
2603 constant "Meet" now named "Inf"
2605 classes "meet_semilorder" and "join_semilorder" now named
2606 "lower_semilattice" and "upper_semilattice"
2607 class "lorder" now named "lattice"
2608 class "comp_lat" now named "complete_lattice"
2610 Instantiation of lattice classes allows explicit definitions
2611 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2613 INCOMPATIBILITY. Theorem renames:
2615 meet_left_le ~> inf_le1
2616 meet_right_le ~> inf_le2
2617 join_left_le ~> sup_ge1
2618 join_right_le ~> sup_ge2
2619 meet_join_le ~> inf_sup_ord
2622 le_meet ~> le_inf_iff
2623 le_join ~> ge_sup_conv
2624 meet_idempotent ~> inf_idem
2625 join_idempotent ~> sup_idem
2626 meet_comm ~> inf_commute
2627 join_comm ~> sup_commute
2628 meet_leI1 ~> le_infI1
2629 meet_leI2 ~> le_infI2
2630 le_joinI1 ~> le_supI1
2631 le_joinI2 ~> le_supI2
2632 meet_assoc ~> inf_assoc
2633 join_assoc ~> sup_assoc
2634 meet_left_comm ~> inf_left_commute
2635 meet_left_idempotent ~> inf_left_idem
2636 join_left_comm ~> sup_left_commute
2637 join_left_idempotent ~> sup_left_idem
2640 le_def_meet ~> le_iff_inf
2641 le_def_join ~> le_iff_sup
2642 join_absorp2 ~> sup_absorb2
2643 join_absorp1 ~> sup_absorb1
2644 meet_absorp1 ~> inf_absorb1
2645 meet_absorp2 ~> inf_absorb2
2646 meet_join_absorp ~> inf_sup_absorb
2647 join_meet_absorp ~> sup_inf_absorb
2648 distrib_join_le ~> distrib_sup_le
2649 distrib_meet_le ~> distrib_inf_le
2651 add_meet_distrib_left ~> add_inf_distrib_left
2652 add_join_distrib_left ~> add_sup_distrib_left
2653 is_join_neg_meet ~> is_join_neg_inf
2654 is_meet_neg_join ~> is_meet_neg_sup
2655 add_meet_distrib_right ~> add_inf_distrib_right
2656 add_join_distrib_right ~> add_sup_distrib_right
2657 add_meet_join_distribs ~> add_sup_inf_distribs
2658 join_eq_neg_meet ~> sup_eq_neg_inf
2659 meet_eq_neg_join ~> inf_eq_neg_sup
2660 add_eq_meet_join ~> add_eq_inf_sup
2661 meet_0_imp_0 ~> inf_0_imp_0
2662 join_0_imp_0 ~> sup_0_imp_0
2663 meet_0_eq_0 ~> inf_0_eq_0
2664 join_0_eq_0 ~> sup_0_eq_0
2665 neg_meet_eq_join ~> neg_inf_eq_sup
2666 neg_join_eq_meet ~> neg_sup_eq_inf
2667 join_eq_if ~> sup_eq_if
2669 mono_meet ~> mono_inf
2670 mono_join ~> mono_sup
2671 meet_bool_eq ~> inf_bool_eq
2672 join_bool_eq ~> sup_bool_eq
2673 meet_fun_eq ~> inf_fun_eq
2674 join_fun_eq ~> sup_fun_eq
2675 meet_set_eq ~> inf_set_eq
2676 join_set_eq ~> sup_set_eq
2677 meet1_iff ~> inf1_iff
2678 meet2_iff ~> inf2_iff
2687 join1_iff ~> sup1_iff
2688 join2_iff ~> sup2_iff
2698 is_meet_Meet ~> is_meet_Inf
2699 Meet_bool_def ~> Inf_bool_def
2700 Meet_fun_def ~> Inf_fun_def
2701 Meet_greatest ~> Inf_greatest
2702 Meet_lower ~> Inf_lower
2703 Meet_set_def ~> Inf_set_def
2706 Sup_bool_eq ~> Sup_bool_def
2707 Sup_fun_eq ~> Sup_fun_def
2708 Sup_set_eq ~> Sup_set_def
2710 listsp_meetI ~> listsp_infI
2711 listsp_meet_eq ~> listsp_inf_eq
2716 * Added syntactic class "size"; overloaded constant "size" now has
2717 type "'a::size ==> bool"
2719 * Internal reorganisation of `size' of datatypes: size theorems
2720 "foo.size" are no longer subsumed by "foo.simps" (but are still
2721 simplification rules by default!); theorems "prod.size" now named
2724 * Class "div" now inherits from class "times" rather than "type".
2727 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2728 Linorder etc. have disappeared; operations defined in terms of
2729 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2731 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2733 * HOL-Word: New extensive library and type for generic, fixed size
2734 machine words, with arithemtic, bit-wise, shifting and rotating
2735 operations, reflection into int, nat, and bool lists, automation for
2736 linear arithmetic (by automatic reflection into nat or int), including
2737 lemmas on overflow and monotonicity. Instantiated to all appropriate
2738 arithmetic type classes, supporting automatic simplification of
2739 numerals on all operations.
2741 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2743 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2745 * Code generator library theories:
2746 - Code_Integer represents HOL integers by big integer literals in target
2748 - Code_Char represents HOL characters by character literals in target
2750 - Code_Char_chr like Code_Char, but also offers treatment of character
2751 codes; includes Code_Integer.
2752 - Executable_Set allows to generate code for finite sets using lists.
2753 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2755 - Executable_Real implements a subset of real numbers, namly those
2756 representable by rational numbers.
2757 - Efficient_Nat implements natural numbers by integers, which in general will
2758 result in higher efficency; pattern matching with 0/Suc is eliminated;
2759 includes Code_Integer.
2760 - Code_Index provides an additional datatype index which is mapped to
2761 target-language built-in integers.
2762 - Code_Message provides an additional datatype message_string which is isomorphic to
2763 strings; messages are mapped to target-language strings.
2765 * New package for inductive predicates
2767 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2770 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2771 for z_1 :: U_1 and ... and z_n :: U_m
2773 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2776 with full support for type-inference, rather than
2778 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2780 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2781 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2783 inductive "s z_1 ... z_m"
2785 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2788 For backward compatibility, there is a wrapper allowing inductive
2789 sets to be defined with the new package via
2792 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2793 for z_1 :: U_1 and ... and z_n :: U_m
2795 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2801 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2802 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2803 for z_1 :: U_1 and ... and z_n :: U_m
2805 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2806 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2809 if the additional syntax "p ..." is required.
2811 Numerous examples can be found in the subdirectories src/HOL/Auth,
2812 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2816 - Since declaration and definition of inductive sets or predicates
2817 is no longer separated, abbreviations involving the newly
2818 introduced sets or predicates must be specified together with the
2819 introduction rules after the 'where' keyword (see above), rather
2820 than before the actual inductive definition.
2822 - The variables in induction and elimination rules are now
2823 quantified in the order of their occurrence in the introduction
2824 rules, rather than in alphabetical order. Since this may break
2825 some proofs, these proofs either have to be repaired, e.g. by
2826 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2827 statements of the form
2829 case (rule_i a_i_1 ... a_i_{k_i})
2831 or the old order of quantification has to be restored by explicitly adding
2832 meta-level quantifiers in the introduction rules, i.e.
2834 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2836 - The format of the elimination rules is now
2838 p z_1 ... z_m x_1 ... x_n ==>
2839 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2844 (x_1, ..., x_n) : s z_1 ... z_m ==>
2845 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2848 for sets rather than
2850 x : s z_1 ... z_m ==>
2851 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2854 This may require terms in goals to be expanded to n-tuples
2855 (e.g. using case_tac or simplification with the split_paired_all
2856 rule) before the above elimination rule is applicable.
2858 - The elimination or case analysis rules for (mutually) inductive
2859 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2860 list of rules "p_1_..._p_k.elims" is no longer available.
2862 * New package "function"/"fun" for general recursive functions,
2863 supporting mutual and nested recursion, definitions in local contexts,
2864 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2865 for small examples, and the separate tutorial on the function
2866 package. The old recdef "package" is still available as before, but
2867 users are encouraged to use the new package.
2869 * Method "lexicographic_order" automatically synthesizes termination
2870 relations as lexicographic combinations of size measures.
2872 * Case-expressions allow arbitrary constructor-patterns (including
2873 "_") and take their order into account, like in functional
2874 programming. Internally, this is translated into nested
2875 case-expressions; missing cases are added and mapped to the predefined
2876 constant "undefined". In complicated cases printing may no longer show
2877 the original input but the internal form. Lambda-abstractions allow
2878 the same form of pattern matching: "% pat1 => e1 | ..." is an
2879 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2882 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2883 is an abbreviation for "of_nat :: nat => int". The simplification
2884 rules for "of_nat" have been changed to work like "int" did
2885 previously. Potential INCOMPATIBILITY:
2886 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2887 - of_nat_diff and of_nat_mult are no longer default simp rules
2889 * Method "algebra" solves polynomial equations over (semi)rings using
2890 Groebner bases. The (semi)ring structure is defined by locales and the
2891 tool setup depends on that generic context. Installing the method for
2892 a specific type involves instantiating the locale and possibly adding
2893 declarations for computation on the coefficients. The method is
2894 already instantiated for natural numbers and for the axiomatic class
2895 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2896 CALCULEMUS 2007 for the general principles underlying this
2897 architecture of context-aware proof-tools.
2899 * Method "ferrack" implements quantifier elimination over
2900 special-purpose dense linear orders using locales (analogous to
2901 "algebra"). The method is already installed for class
2902 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2905 * Former constant "List.op @" now named "List.append". Use ML
2906 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2907 circumvent possible incompatibilities when working on ML level.
2909 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2911 * New function listsum :: 'a list => 'a for arbitrary monoids.
2912 Special syntax: "SUM x <- xs. f x" (and latex variants)
2914 * New syntax for Haskell-like list comprehension (input only), eg.
2915 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2917 * The special syntax for function "filter" has changed from [x :
2918 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2919 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2921 * [a..b] is now defined for arbitrary linear orders. It used to be
2922 defined on nat only, as an abbreviation for [a..<Suc b]
2925 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2927 * New functions "sorted" and "sort" in src/HOL/List.thy.
2929 * New lemma collection field_simps (an extension of ring_simps) for
2930 manipulating (in)equations involving division. Multiplies with all
2931 denominators that can be proved to be non-zero (in equations) or
2932 positive/negative (in inequations).
2934 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2935 have been improved and renamed to ring_simps, group_simps and
2936 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2937 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2939 * Theory Library/Commutative_Ring: switched from recdef to function
2940 package; constants add, mul, pow now curried. Infix syntax for
2941 algebraic operations.
2943 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2946 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2949 * HOL/records: generalised field-update to take a function on the
2950 field rather than the new value: r(|A := x|) is translated to A_update
2951 (K x) r The K-combinator that is internally used is called K_record.
2952 INCOMPATIBILITY: Usage of the plain update functions has to be
2955 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2956 * x = 0, which are required for a semiring. Richer structures do not
2957 inherit from semiring_0 anymore, because this property is a theorem
2958 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2959 there is more to prove, but this is mostly trivial.
2961 * Class "recpower" is generalized to arbitrary monoids, not just
2962 commutative semirings. INCOMPATIBILITY: may need to incorporate
2963 commutativity or semiring properties additionally.
2965 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2966 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2967 better use 'abbreviation'.
2969 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2971 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2972 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2973 significant changes for setting up numeral syntax for types:
2974 - New constants Numeral.pred and Numeral.succ instead
2975 of former Numeral.bin_pred and Numeral.bin_succ.
2976 - Use integer operations instead of bin_add, bin_mult and so on.
2977 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2978 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2980 See src/HOL/Integ/IntArith.thy for an example setup.
2982 * Command 'normal_form' computes the normal form of a term that may
2983 contain free variables. For example ``normal_form "rev [a, b, c]"''
2984 produces ``[b, c, a]'' (without proof). This command is suitable for
2985 heavy-duty computations because the functions are compiled to ML
2986 first. Correspondingly, a method "normalization" is provided. See
2987 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2989 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2990 25 like -->); output depends on the "iff" print_mode, the default is
2991 "A = B" (with priority 50).
2993 * Relations less (<) and less_eq (<=) are also available on type bool.
2994 Modified syntax to disallow nesting without explicit parentheses,
2995 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2998 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3000 * Relation composition operator "op O" now has precedence 75 and binds
3001 stronger than union and intersection. INCOMPATIBILITY.
3003 * The old set interval syntax "{m..n(}" (and relatives) has been
3004 removed. Use "{m..<n}" (and relatives) instead.
3006 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3007 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3008 ``declare [[simproc del: neq]]''.
3010 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3013 * Theorem Cons_eq_map_conv no longer declared as "simp".
3015 * Theorem setsum_mult renamed to setsum_right_distrib.
3017 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3020 * Reimplemented methods "sat" and "satx", with several improvements:
3021 goals no longer need to be stated as "<prems> ==> False", equivalences
3022 (i.e. "=" on type bool) are handled, variable names of the form
3023 "lit_<n>" are no longer reserved, significant speedup.
3025 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3026 zChaff is still supported as well.
3028 * 'inductive' and 'datatype': provide projections of mutual rules,
3029 bundled as foo_bar.inducts;
3031 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3034 * Library: moved theory Accessible_Part to main HOL.
3036 * Library: added theory Coinductive_List of potentially infinite lists
3037 as greatest fixed-point.
3039 * Library: added theory AssocList which implements (finite) maps as
3042 * Method "evaluation" solves goals (i.e. a boolean expression)
3043 efficiently by compiling it to ML. The goal is "proved" (via an
3044 oracle) if it evaluates to True.
3046 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3047 also when invoked by the simplifier. This results in the Simplifier
3048 being more powerful on arithmetic goals. INCOMPATIBILITY.
3049 Configuration option fast_arith_split_limit=0 recovers the old
3052 * Support for hex (0x20) and binary (0b1001) numerals.
3054 * New method: reify eqs (t), where eqs are equations for an
3055 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3056 parameter, computes a term s::'b and a list xs::'a list and proves the
3057 theorem I xs s = t. This is also known as reification or quoting. The
3058 resulting theorem is applied to the subgoal to substitute t with I xs
3059 s. If t is omitted, the subgoal itself is reified.
3061 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3062 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3063 where f is supposed to be a computable function (in the sense of code
3064 generattion). The method uses reify to compute s and xs as above then
3065 applies corr_thm and uses normalization by evaluation to "prove" f s =
3066 r and finally gets the theorem t = r, which is again applied to the
3067 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3069 * Reflection: Automatic reification now handels binding, an example is
3070 available in src/HOL/ex/ReflectionEx.thy
3072 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3073 command 'statespace' that is similar to 'record', but introduces an
3074 abstract specification based on the locale infrastructure instead of
3075 HOL types. This leads to extra flexibility in composing state spaces,
3076 in particular multiple inheritance and renaming of components.
3081 * Hyperreal: Functions root and sqrt are now defined on negative real
3082 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3083 Nonnegativity side conditions have been removed from many lemmas, so
3084 that more subgoals may now be solved by simplification; potential
3087 * Real: new type classes formalize real normed vector spaces and
3088 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3089 and norm :: 'a => real.
3091 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3092 reals into other types. The overloaded constant Reals :: 'a set is now
3093 defined as range of_real; potential INCOMPATIBILITY.
3095 * Real: proper support for ML code generation, including 'quickcheck'.
3096 Reals are implemented as arbitrary precision rationals.
3098 * Hyperreal: Several constants that previously worked only for the
3099 reals have been generalized, so they now work over arbitrary vector
3100 spaces. Type annotations may need to be added in some cases; potential
3103 Infinitesimal :: ('a::real_normed_vector) star set
3104 HFinite :: ('a::real_normed_vector) star set
3105 HInfinite :: ('a::real_normed_vector) star set
3106 approx :: ('a::real_normed_vector) star => 'a star => bool
3107 monad :: ('a::real_normed_vector) star => 'a star set
3108 galaxy :: ('a::real_normed_vector) star => 'a star set
3109 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3110 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3111 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3112 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3113 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3114 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3115 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3116 sgn :: 'a::real_normed_vector => 'a
3117 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3119 * Complex: Some complex-specific constants are now abbreviations for
3120 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3121 hnorm. Other constants have been entirely removed in favor of the
3122 polymorphic versions (INCOMPATIBILITY):
3126 HInfinite <-- CInfinite
3127 Infinitesimal <-- CInfinitesimal
3130 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3131 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3132 (ns)deriv <-- (ns)cderiv
3137 * Formalisation of ideals and the quotient construction over rings.
3139 * Order and lattice theory no longer based on records.
3142 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3143 greatest_closed. INCOMPATIBILITY.
3145 * Method algebra is now set up via an attribute. For examples see
3146 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3147 of algebraic structures.
3149 * Renamed theory CRing to Ring.
3154 * Substantial, yet incomplete support for nominal datatypes (binding
3155 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3156 src/HOL/Nominal/Examples. Prospective users should consult
3157 http://isabelle.in.tum.de/nominal/
3162 * ML basics: just one true type int, which coincides with IntInf.int
3165 * ML within Isar: antiquotations allow to embed statically-checked
3166 formal entities in the source, referring to the context available at
3167 compile-time. For example:
3169 ML {* @{sort "{zero,one}"} *}
3170 ML {* @{typ "'a => 'b"} *}
3171 ML {* @{term "%x. x"} *}
3172 ML {* @{prop "x == y"} *}
3173 ML {* @{ctyp "'a => 'b"} *}
3174 ML {* @{cterm "%x. x"} *}
3175 ML {* @{cprop "x == y"} *}
3176 ML {* @{thm asm_rl} *}
3177 ML {* @{thms asm_rl} *}
3178 ML {* @{type_name c} *}
3179 ML {* @{type_syntax c} *}
3180 ML {* @{const_name c} *}
3181 ML {* @{const_syntax c} *}
3184 ML {* @{theory Pure} *}
3185 ML {* @{theory_ref} *}
3186 ML {* @{theory_ref Pure} *}
3189 ML {* @{clasimpset} *}
3191 The same works for sources being ``used'' within an Isar context.
3193 * ML in Isar: improved error reporting; extra verbosity with
3194 ML_Context.trace enabled.
3196 * Pure/General/table.ML: the join operations now works via exceptions
3197 DUP/SAME instead of type option. This is simpler in simple cases, and
3198 admits slightly more efficient complex applications.
3200 * Pure: 'advanced' translation functions (parse_translation etc.) now
3201 use Context.generic instead of just theory.
3203 * Pure: datatype Context.generic joins theory/Proof.context and
3204 provides some facilities for code that works in either kind of
3205 context, notably GenericDataFun for uniform theory and proof data.
3207 * Pure: simplified internal attribute type, which is now always
3208 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3209 local (Proof.context) attributes have been discontinued, while
3210 minimizing code duplication. Thm.rule_attribute and
3211 Thm.declaration_attribute build canonical attributes; see also structure
3212 Context for further operations on Context.generic, notably
3213 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3214 declarations and definitions.
3216 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3217 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3218 init only required for impure data. INCOMPATIBILITY: empty really need
3219 to be empty (no dependencies on theory content!)
3221 * Pure/kernel: consts certification ignores sort constraints given in
3222 signature declarations. (This information is not relevant to the
3223 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3224 potential INCOMPATIBILITY.
3226 * Pure: axiomatic type classes are now purely definitional, with
3227 explicit proofs of class axioms and super class relations performed
3228 internally. See Pure/axclass.ML for the main internal interfaces --
3229 notably AxClass.define_class supercedes AxClass.add_axclass, and
3230 AxClass.axiomatize_class/classrel/arity supersede
3231 Sign.add_classes/classrel/arities.
3233 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3234 global/local versions on theory vs. Proof.context have been
3235 discontinued; Attrib.syntax and Method.syntax have been adapted
3236 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3237 attributes, methods, etc.
3239 * Pure: several functions of signature "... -> theory -> theory * ..."
3240 have been reoriented to "... -> theory -> ... * theory" in order to
3241 allow natural usage in combination with the ||>, ||>>, |-> and
3242 fold_map combinators.
3244 * Pure: official theorem names (closed derivations) and additional
3245 comments (tags) are now strictly separate. Name hints -- which are
3246 maintained as tags -- may be attached any time without affecting the
3249 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3250 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3251 achieve the old behaviour.
3253 * Pure: the "Goal" constant is now called "prop", supporting a
3254 slightly more general idea of ``protecting'' meta-level rule
3257 * Pure: Logic.(un)varify only works in a global context, which is now
3258 enforced instead of silently assumed. INCOMPATIBILITY, may use
3259 Logic.legacy_(un)varify as temporary workaround.
3261 * Pure: structure Name provides scalable operations for generating
3262 internal variable names, notably Name.variants etc. This replaces
3263 some popular functions from term.ML:
3265 Term.variant -> Name.variant
3266 Term.variantlist -> Name.variant_list
3267 Term.invent_names -> Name.invent_list
3269 Note that low-level renaming rarely occurs in new code -- operations
3270 from structure Variable are used instead (see below).
3272 * Pure: structure Variable provides fundamental operations for proper
3273 treatment of fixed/schematic variables in a context. For example,
3274 Variable.import introduces fixes for schematics of given facts and
3275 Variable.export reverses the effect (up to renaming) -- this replaces
3276 various freeze_thaw operations.
3278 * Pure: structure Goal provides simple interfaces for
3279 init/conclude/finish and tactical prove operations (replacing former
3280 Tactic.prove). Goal.prove is the canonical way to prove results
3281 within a given context; Goal.prove_global is a degraded version for
3282 theory level goals, including a global Drule.standard. Note that
3283 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3284 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3285 in a locale context).
3287 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3288 and type checking (Syntax.check_term etc.), with common combinations
3289 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3290 which are considered legacy and await removal.
3292 * Pure/Syntax: generic interfaces for type unchecking
3293 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3294 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3295 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3296 available for convenience, but refer to the very same operations using
3297 a mere theory instead of a full context.
3299 * Isar: simplified treatment of user-level errors, using exception
3300 ERROR of string uniformly. Function error now merely raises ERROR,
3301 without any side effect on output channels. The Isar toplevel takes
3302 care of proper display of ERROR exceptions. ML code may use plain
3303 handle/can/try; cat_error may be used to concatenate errors like this:
3305 ... handle ERROR msg => cat_error msg "..."
3307 Toplevel ML code (run directly or through the Isar toplevel) may be
3308 embedded into the Isar toplevel with exception display/debug like
3311 Isar.toplevel (fn () => ...)
3313 INCOMPATIBILITY, removed special transform_error facilities, removed
3314 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3315 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3316 -- use plain ERROR instead.
3318 * Isar: theory setup now has type (theory -> theory), instead of a
3319 list. INCOMPATIBILITY, may use #> to compose setup functions.
3321 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3322 ProofContext.debug/verbose flags.
3324 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3325 theory before entering a proof state. Transactions now always see a
3326 quasi-functional intermediate checkpoint, both in interactive and
3329 * Isar: simplified interfaces for outer syntax. Renamed
3330 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3331 OuterSyntax.add_parsers -- this functionality is now included in
3332 OuterSyntax.command etc. INCOMPATIBILITY.
3334 * Simplifier: the simpset of a running simplification process now
3335 contains a proof context (cf. Simplifier.the_context), which is the
3336 very context that the initial simpset has been retrieved from (by
3337 simpset_of/local_simpset_of). Consequently, all plug-in components
3338 (solver, looper etc.) may depend on arbitrary proof data.
3340 * Simplifier.inherit_context inherits the proof context (plus the
3341 local bounds) of the current simplification process; any simproc
3342 etc. that calls the Simplifier recursively should do this! Removed
3343 former Simplifier.inherit_bounds, which is already included here --
3344 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3345 specify an explicit context using Simplifier.context/theory_context.
3347 * Simplifier/Classical Reasoner: more abstract interfaces
3348 change_simpset/claset for modifying the simpset/claset reference of a
3349 theory; raw versions simpset/claset_ref etc. have been discontinued --
3352 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3358 * settings: the default heap location within ISABELLE_HOME_USER now
3359 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3360 Isabelle installations.
3362 * isabelle-process: option -S (secure mode) disables some critical
3363 operations, notably runtime compilation and evaluation of ML source
3366 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3368 * Support for parallel execution, using native multicore support of
3369 Poly/ML 5.1. The theory loader exploits parallelism when processing
3370 independent theories, according to the given theory header
3371 specifications. The maximum number of worker threads is specified via
3372 usedir option -M or the "max-threads" setting in Proof General. A
3373 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3374 to 6 on a 8-core machine. User-code needs to observe certain
3375 guidelines for thread-safe programming, see appendix A in the Isar
3376 Implementation manual.
3380 New in Isabelle2005 (October 2005)
3381 ----------------------------------
3385 * Theory headers: the new header syntax for Isar theories is
3388 imports <theory1> ... <theoryN>
3389 uses <file1> ... <fileM>
3392 where the 'uses' part is optional. The previous syntax
3394 theory <name> = <theory1> + ... + <theoryN>:
3396 will disappear in the next release. Use isatool fixheaders to convert
3397 existing theory files. Note that there is no change in ancient
3398 non-Isar theories now, but these will disappear soon.
3400 * Theory loader: parent theories can now also be referred to via
3401 relative and absolute paths.
3403 * Command 'find_theorems' searches for a list of criteria instead of a
3404 list of constants. Known criteria are: intro, elim, dest, name:string,
3405 simp:term, and any term. Criteria can be preceded by '-' to select
3406 theorems that do not match. Intro, elim, dest select theorems that
3407 match the current goal, name:s selects theorems whose fully qualified
3408 name contain s, and simp:term selects all simplification rules whose
3409 lhs match term. Any other term is interpreted as pattern and selects
3410 all theorems matching the pattern. Available in ProofGeneral under
3411 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3413 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3415 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3416 matching the current goal as introduction rule and not having "HOL."
3417 in their name (i.e. not being defined in theory HOL).
3419 * Command 'thms_containing' has been discontinued in favour of
3420 'find_theorems'; INCOMPATIBILITY.
3422 * Communication with Proof General is now 8bit clean, which means that
3423 Unicode text in UTF-8 encoding may be used within theory texts (both
3424 formal and informal parts). Cf. option -U of the Isabelle Proof
3425 General interface. Here are some simple examples (cf. src/HOL/ex):
3427 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3428 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3430 * Improved efficiency of the Simplifier and, to a lesser degree, the
3431 Classical Reasoner. Typical big applications run around 2 times
3435 *** Document preparation ***
3437 * Commands 'display_drafts' and 'print_drafts' perform simple output
3438 of raw sources. Only those symbols that do not require additional
3439 LaTeX packages (depending on comments in isabellesym.sty) are
3440 displayed properly, everything else is left verbatim. isatool display
3441 and isatool print are used as front ends (these are subject to the
3442 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3444 * Command tags control specific markup of certain regions of text,
3445 notably folding and hiding. Predefined tags include "theory" (for
3446 theory begin and end), "proof" for proof commands, and "ML" for
3447 commands involving ML code; the additional tags "visible" and
3448 "invisible" are unused by default. Users may give explicit tag
3449 specifications in the text, e.g. ''by %invisible (auto)''. The
3450 interpretation of tags is determined by the LaTeX job during document
3451 preparation: see option -V of isatool usedir, or options -n and -t of
3452 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3455 Several document versions may be produced at the same time via isatool
3456 usedir (the generated index.html will link all of them). Typical
3457 specifications include ''-V document=theory,proof,ML'' to present
3458 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3459 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3460 these parts without any formal replacement text. The Isabelle site
3461 default settings produce ''document'' and ''outline'' versions as
3464 * Several new antiquotations:
3466 @{term_type term} prints a term with its type annotated;
3468 @{typeof term} prints the type of a term;
3470 @{const const} is the same as @{term const}, but checks that the
3471 argument is a known logical constant;
3473 @{term_style style term} and @{thm_style style thm} print a term or
3474 theorem applying a "style" to it
3478 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3479 definitions, equations, inequations etc., 'concl' printing only the
3480 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3481 to print the specified premise. TermStyle.add_style provides an ML
3482 interface for introducing further styles. See also the "LaTeX Sugar"
3483 document practical applications. The ML antiquotation prints
3484 type-checked ML expressions verbatim.
3486 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3487 and 'text' support optional locale specification '(in loc)', which
3488 specifies the default context for interpreting antiquotations. For
3489 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3491 * Option 'locale=NAME' of antiquotations specifies an alternative
3492 context interpreting the subsequent argument. For example: @{thm
3493 [locale=lattice] inf_assoc}.
3495 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3498 * Proper output of antiquotations for theory commands involving a
3499 proof context (such as 'locale' or 'theorem (in loc) ...').
3501 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3502 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3504 * isatool usedir: new option -C (default true) controls whether option
3505 -D should include a copy of the original document directory; -C false
3506 prevents unwanted effects such as copying of administrative CVS data.
3511 * Considerably improved version of 'constdefs' command. Now performs
3512 automatic type-inference of declared constants; additional support for
3513 local structure declarations (cf. locales and HOL records), see also
3514 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3515 sequential dependencies of definitions within a single 'constdefs'
3516 section; moreover, the declared name needs to be an identifier. If
3517 all fails, consider to fall back on 'consts' and 'defs' separately.
3519 * Improved indexed syntax and implicit structures. First of all,
3520 indexed syntax provides a notational device for subscripted
3521 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3522 expressions. Secondly, in a local context with structure
3523 declarations, number indexes \<^sub>n or the empty index (default
3524 number 1) refer to a certain fixed variable implicitly; option
3525 show_structs controls printing of implicit structures. Typical
3526 applications of these concepts involve record types and locales.
3528 * New command 'no_syntax' removes grammar declarations (and
3529 translations) resulting from the given syntax specification, which is
3530 interpreted in the same manner as for the 'syntax' command.
3532 * 'Advanced' translation functions (parse_translation etc.) may depend
3533 on the signature of the theory context being presently used for
3534 parsing/printing, see also isar-ref manual.
3536 * Improved 'oracle' command provides a type-safe interface to turn an
3537 ML expression of type theory -> T -> term into a primitive rule of
3538 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3539 is already included here); see also FOL/ex/IffExample.thy;
3542 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3543 before); "cI" is no longer bound, use "c.intro" instead.
3544 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3545 axclasses vs. locales.
3547 * Improved internal renaming of symbolic identifiers -- attach primes
3548 instead of base 26 numbers.
3550 * New flag show_question_marks controls printing of leading question
3551 marks in schematic variable names.
3553 * In schematic variable names, *any* symbol following \<^isub> or
3554 \<^isup> is now treated as part of the base name. For example, the
3555 following works without printing of awkward ".0" indexes:
3557 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3560 * Inner syntax includes (*(*nested*) comments*).
3562 * Pretty printer now supports unbreakable blocks, specified in mixfix
3563 annotations as "(00...)".
3565 * Clear separation of logical types and nonterminals, where the latter
3566 may only occur in 'syntax' specifications or type abbreviations.
3567 Before that distinction was only partially implemented via type class
3568 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3569 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3570 exotic syntax specifications may require further adaption
3571 (e.g. Cube/Cube.thy).
3573 * Removed obsolete type class "logic", use the top sort {} instead.
3574 Note that non-logical types should be declared as 'nonterminals'
3575 rather than 'types'. INCOMPATIBILITY for new object-logic
3578 * Attributes 'induct' and 'cases': type or set names may now be
3579 locally fixed variables as well.
3581 * Simplifier: can now control the depth to which conditional rewriting
3582 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3585 * Simplifier: simplification procedures may now take the current
3586 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3587 interface), which is very useful for calling the Simplifier
3588 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3589 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3590 low-level mk_simproc no longer applies Logic.varify internally, to
3591 allow for use in a context of fixed variables.
3593 * thin_tac now works even if the assumption being deleted contains !!
3594 or ==>. More generally, erule now works even if the major premise of
3595 the elimination rule contains !! or ==>.
3597 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3599 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3600 from Pure, which contains all common declarations already. Both
3601 theories are defined via plain Isabelle/Isar .thy files.
3602 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3603 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3604 use isatool fixcpure to adapt your theory and ML sources.
3606 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3607 selections of theorems in named facts via index ranges.
3609 * 'print_theorems': in theory mode, really print the difference
3610 wrt. the last state (works for interactive theory development only),
3611 in proof mode print all local facts (cf. 'print_facts');
3613 * 'hide': option '(open)' hides only base names.
3615 * More efficient treatment of intermediate checkpoints in interactive
3618 * Code generator is now invoked via code_module (incremental code
3619 generation) and code_library (modular code generation, ML structures
3620 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3621 must be quoted when used as identifiers.
3623 * New 'value' command for reading, evaluating and printing terms using
3624 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3625 quoted when used as identifier.
3630 * New commands for the interpretation of locale expressions in
3631 theories (1), locales (2) and proof contexts (3). These generate
3632 proof obligations from the expression specification. After the
3633 obligations have been discharged, theorems of the expression are added
3634 to the theory, target locale or proof context. The synopsis of the
3635 commands is a follows:
3637 (1) interpretation expr inst
3638 (2) interpretation target < expr
3639 (3) interpret expr inst
3641 Interpretation in theories and proof contexts require a parameter
3642 instantiation of terms from the current context. This is applied to
3643 specifications and theorems of the interpreted expression.
3644 Interpretation in locales only permits parameter renaming through the
3645 locale expression. Interpretation is smart in that interpretations
3646 that are active already do not occur in proof obligations, neither are
3647 instantiated theorems stored in duplicate. Use 'print_interps' to
3648 inspect active interpretations of a particular locale. For details,
3649 see the Isar Reference manual. Examples can be found in
3650 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3652 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3653 'interpret' instead.
3655 * New context element 'constrains' for adding type constraints to
3658 * Context expressions: renaming of parameters with syntax
3661 * Locale declaration: 'includes' disallowed.
3663 * Proper static binding of attribute syntax -- i.e. types / terms /
3664 facts mentioned as arguments are always those of the locale definition
3665 context, independently of the context of later invocations. Moreover,
3666 locale operations (renaming and type / term instantiation) are applied
3667 to attribute arguments as expected.
3669 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3670 actual attributes; rare situations may require Attrib.attribute to
3671 embed those attributes into Attrib.src that lack concrete syntax.
3672 Attribute implementations need to cooperate properly with the static
3673 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3674 Attrib.XXX_thm etc. already do the right thing without further
3675 intervention. Only unusual applications -- such as "where" or "of"
3676 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3677 on the context and the facts involved -- may have to assign parsed
3678 values to argument tokens explicitly.
3680 * Changed parameter management in theorem generation for long goal
3681 statements with 'includes'. INCOMPATIBILITY: produces a different
3682 theorem statement in rare situations.
3684 * Locale inspection command 'print_locale' omits notes elements. Use
3685 'print_locale!' to have them included in the output.
3690 * Provers/hypsubst.ML: improved version of the subst method, for
3691 single-step rewriting: it now works in bound variable contexts. New is
3692 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3693 rewrite a different subterm than the original subst method, which is
3694 still available as 'simplesubst'.
3696 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3699 * Provers/trancl.ML: new transitivity reasoner for transitive and
3700 reflexive-transitive closure of relations.
3702 * Provers/blast.ML: new reference depth_limit to make blast's depth
3703 limit (previously hard-coded with a value of 20) user-definable.
3705 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3706 is peformed already. Object-logics merely need to finish their
3707 initial simpset configuration as before. INCOMPATIBILITY.
3712 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3715 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3717 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3718 and x-symbol; use option '-m epsilon' to get it actually printed.
3719 Moreover, the mathematically important symbolic identifier \<epsilon>
3720 becomes available as variable, constant etc. INCOMPATIBILITY,
3722 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3723 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3724 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3725 support corresponding Isar calculations.
3727 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3730 * theory SetInterval: changed the syntax for open intervals:
3739 The old syntax is still supported but will disappear in the next
3740 release. For conversion use the following Emacs search and replace
3741 patterns (these are not perfect but work quite well):
3743 {)\([^\.]*\)\.\. -> {\1<\.\.}
3744 \.\.\([^(}]*\)(} -> \.\.<\1}
3746 * Theory Commutative_Ring (in Library): method comm_ring for proving
3747 equalities in commutative rings; method 'algebra' provides a generic
3750 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3751 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3752 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3755 Some new syntax forms are available:
3757 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3758 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3759 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3760 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3762 The latter form "\<Sum>x < k. e" used to be based on a separate
3763 function "Summation", which has been discontinued.
3765 * theory Finite_Set: in structured induction proofs, the insert case
3766 is now 'case (insert x F)' instead of the old counterintuitive 'case
3769 * The 'refute' command has been extended to support a much larger
3770 fragment of HOL, including axiomatic type classes, constdefs and
3771 typedefs, inductive datatypes and recursion.
3773 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3774 Requires zChaff with proof generation to be installed. See
3775 HOL/ex/SAT_Examples.thy for examples.
3777 * Datatype induction via method 'induct' now preserves the name of the
3778 induction variable. For example, when proving P(xs::'a list) by
3779 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3780 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3781 in unstructured proof scripts.
3783 * Reworked implementation of records. Improved scalability for
3784 records with many fields, avoiding performance problems for type
3785 inference. Records are no longer composed of nested field types, but
3786 of nested extension types. Therefore the record type only grows linear
3787 in the number of extensions and not in the number of fields. The
3788 top-level (users) view on records is preserved. Potential
3789 INCOMPATIBILITY only in strange cases, where the theory depends on the
3790 old record representation. The type generated for a record is called
3791 <record_name>_ext_type.
3793 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3794 proofs triggered by a record definition or a simproc (if
3795 quick_and_dirty is enabled). Definitions of large records can take
3798 New simproc record_upd_simproc for simplification of multiple record
3799 updates enabled by default. Moreover, trivial updates are also
3800 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3801 occasionally, since simplification is more powerful by default.
3803 * typedef: proper support for polymorphic sets, which contain extra
3804 type-variables in the term.
3806 * Simplifier: automatically reasons about transitivity chains
3807 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3808 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3809 old proofs break occasionally as simplification may now solve more
3810 goals than previously.
3812 * Simplifier: converts x <= y into x = y if assumption y <= x is
3813 present. Works for all partial orders (class "order"), in particular
3814 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3817 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3818 bound variable or a constant then the let is unfolded. Otherwise
3819 first a is simplified to b, and then f b is simplified to g. If
3820 possible we abstract b from g arriving at "let x = b in h x",
3821 otherwise we unfold the let and arrive at g. The simproc can be
3822 enabled/disabled by the reference use_let_simproc. Potential
3823 INCOMPATIBILITY since simplification is more powerful by default.
3825 * Classical reasoning: the meson method now accepts theorems as arguments.
3827 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3828 jobs to provide advice on the provability of subgoals.
3830 * Theory OrderedGroup and Ring_and_Field: various additions and
3831 improvements to faciliate calculations involving equalities and
3834 The following theorems have been eliminated or modified
3837 abs_eq now named abs_of_nonneg
3838 abs_of_ge_0 now named abs_of_nonneg
3839 abs_minus_eq now named abs_of_nonpos
3840 imp_abs_id now named abs_of_nonneg
3841 imp_abs_neg_id now named abs_of_nonpos
3842 mult_pos now named mult_pos_pos
3843 mult_pos_le now named mult_nonneg_nonneg
3844 mult_pos_neg_le now named mult_nonneg_nonpos
3845 mult_pos_neg2_le now named mult_nonneg_nonpos2
3846 mult_neg now named mult_neg_neg
3847 mult_neg_le now named mult_nonpos_nonpos
3849 * The following lemmas in Ring_and_Field have been added to the simplifier:
3852 not_square_less_zero
3854 The following lemmas have been deleted from Real/RealPow:
3864 * Theory Parity: added rules for simplifying exponents.
3868 The following theorems have been eliminated or modified
3871 list_all_Nil now named list_all.simps(1)
3872 list_all_Cons now named list_all.simps(2)
3873 list_all_conv now named list_all_iff
3874 set_mem_eq now named mem_iff
3876 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3877 asymptotic "big O" calculations. See the notes in BigO.thy.
3882 * Theory RealDef: better support for embedding natural numbers and
3883 integers in the reals.
3885 The following theorems have been eliminated or modified
3888 exp_ge_add_one_self now requires no hypotheses
3889 real_of_int_add reversed direction of equality (use [symmetric])
3890 real_of_int_minus reversed direction of equality (use [symmetric])
3891 real_of_int_diff reversed direction of equality (use [symmetric])
3892 real_of_int_mult reversed direction of equality (use [symmetric])
3894 * Theory RComplete: expanded support for floor and ceiling functions.
3896 * Theory Ln is new, with properties of the natural logarithm
3898 * Hyperreal: There is a new type constructor "star" for making
3899 nonstandard types. The old type names are now type synonyms:
3903 hcomplex = complex star
3905 * Hyperreal: Many groups of similarly-defined constants have been
3906 replaced by polymorphic versions (INCOMPATIBILITY):
3908 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3910 starset <-- starsetNat, starsetC
3911 *s* <-- *sNat*, *sc*
3912 starset_n <-- starsetNat_n, starsetC_n
3913 *sn* <-- *sNatn*, *scn*
3914 InternalSets <-- InternalNatSets, InternalCSets
3916 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3917 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3918 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3919 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3920 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3922 * Hyperreal: Many type-specific theorems have been removed in favor of
3923 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3925 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3926 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3927 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3928 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3929 right_minus <-- hypreal_add_minus
3930 left_minus <-- {hypreal,hcomplex}_add_minus_left
3931 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3932 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3933 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3934 mult_1_right <-- hcomplex_mult_one_right
3935 mult_zero_left <-- hcomplex_mult_zero_left
3936 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3937 right_distrib <-- hypnat_add_mult_distrib2
3938 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3939 right_inverse <-- hypreal_mult_inverse
3940 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3941 order_refl <-- {hypreal,hypnat}_le_refl
3942 order_trans <-- {hypreal,hypnat}_le_trans
3943 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3944 order_less_le <-- {hypreal,hypnat}_less_le
3945 linorder_linear <-- {hypreal,hypnat}_le_linear
3946 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3947 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3948 add_nonneg_nonneg <-- hypreal_le_add_order
3950 * Hyperreal: Separate theorems having to do with type-specific
3951 versions of constants have been merged into theorems that apply to the
3952 new polymorphic constants (INCOMPATIBILITY):
3954 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3955 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3956 STAR_Un <-- {STAR,NatStar,STARC}_Un
3957 STAR_Int <-- {STAR,NatStar,STARC}_Int
3958 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3959 STAR_subset <-- {STAR,NatStar,STARC}_subset
3960 STAR_mem <-- {STAR,NatStar,STARC}_mem
3961 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3962 STAR_diff <-- {STAR,STARC}_diff
3963 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3964 STARC_hcomplex_of_complex}_image_subset
3965 starset_n_Un <-- starset{Nat,C}_n_Un
3966 starset_n_Int <-- starset{Nat,C}_n_Int
3967 starset_n_Compl <-- starset{Nat,C}_n_Compl
3968 starset_n_diff <-- starset{Nat,C}_n_diff
3969 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3970 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3971 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3972 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3973 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3974 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3975 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3976 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3977 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3978 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3979 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3980 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3981 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3982 starfun_diff <-- starfun{C,RC,CR}_diff
3983 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3984 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3985 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3986 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3987 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3988 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3989 starfun_Id <-- starfunC_Id
3990 starfun_approx <-- starfun{Nat,CR}_approx
3991 starfun_capprox <-- starfun{C,RC}_capprox
3992 starfun_abs <-- starfunNat_rabs
3993 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3994 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3995 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3996 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3997 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3998 starfun_add_approx <-- starfunCR_add_approx
3999 starfun_inverse_inverse <-- starfunC_inverse_inverse
4000 starfun_divide <-- starfun{C,CR,RC}_divide
4001 starfun_n <-- starfun{Nat,C}_n
4002 starfun_n_mult <-- starfun{Nat,C}_n_mult
4003 starfun_n_add <-- starfun{Nat,C}_n_add
4004 starfun_n_add_minus <-- starfunNat_n_add_minus
4005 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4006 starfun_n_minus <-- starfun{Nat,C}_n_minus
4007 starfun_n_eq <-- starfun{Nat,C}_n_eq
4009 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4010 star_n_minus <-- {hypreal,hcomplex}_minus
4011 star_n_diff <-- {hypreal,hcomplex}_diff
4012 star_n_mult <-- {hypreal,hcomplex}_mult
4013 star_n_inverse <-- {hypreal,hcomplex}_inverse
4014 star_n_le <-- {hypreal,hypnat}_le
4015 star_n_less <-- {hypreal,hypnat}_less
4016 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4017 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4018 star_n_abs <-- hypreal_hrabs
4019 star_n_divide <-- hcomplex_divide
4021 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4022 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4023 star_of_diff <-- hypreal_of_real_diff
4024 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4025 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4026 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4027 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4028 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4029 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4030 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4031 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4032 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4033 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4034 star_of_number_of <-- {hypreal,hcomplex}_number_of
4035 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4036 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4037 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4038 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4039 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4040 star_of_power <-- hypreal_of_real_power
4041 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4043 * Hyperreal: new method "transfer" that implements the transfer
4044 principle of nonstandard analysis. With a subgoal that mentions
4045 nonstandard types like "'a star", the command "apply transfer"
4046 replaces it with an equivalent one that mentions only standard types.
4047 To be successful, all free variables must have standard types; non-
4048 standard variables must have explicit universal quantifiers.
4050 * Hyperreal: A theory of Taylor series.
4055 * Discontinued special version of 'constdefs' (which used to support
4056 continuous functions) in favor of the general Pure one with full
4059 * New simplification procedure for solving continuity conditions; it
4060 is much faster on terms with many nested lambda abstractions (cubic
4061 instead of exponential time).
4063 * New syntax for domain package: selector names are now optional.
4064 Parentheses should be omitted unless argument is lazy, for example:
4066 domain 'a stream = cons "'a" (lazy "'a stream")
4068 * New command 'fixrec' for defining recursive functions with pattern
4069 matching; defining multiple functions with mutual recursion is also
4070 supported. Patterns may include the constants cpair, spair, up, sinl,
4071 sinr, or any data constructor defined by the domain package. The given
4072 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4073 syntax and examples.
4075 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4076 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4077 but the proof obligation additionally includes an admissibility
4078 requirement. The packages generate instances of class cpo or pcpo,
4079 with continuity and strictness theorems for Rep and Abs.
4081 * HOLCF: Many theorems have been renamed according to a more standard naming
4082 scheme (INCOMPATIBILITY):
4084 foo_inject: "foo$x = foo$y ==> x = y"
4085 foo_eq: "(foo$x = foo$y) = (x = y)"
4086 foo_less: "(foo$x << foo$y) = (x << y)"
4087 foo_strict: "foo$UU = UU"
4088 foo_defined: "... ==> foo$x ~= UU"
4089 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4094 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4095 including the First Isomorphism Theorem (on quotienting by the kernel
4098 * ZF/Simplifier: install second copy of type solver that actually
4099 makes use of TC rules declared to Isar proof contexts (or locales);
4100 the old version is still required for ML proof scripts.
4105 * Converted to Isar theory format; use locales instead of axiomatic
4111 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4114 * Pure/library.ML no longer defines its own option datatype, but uses
4115 that of the SML basis, which has constructors NONE and SOME instead of
4116 None and Some, as well as exception Option.Option instead of OPTION.
4117 The functions the, if_none, is_some, is_none have been adapted
4118 accordingly, while Option.map replaces apsome.
4120 * Pure/library.ML: the exception LIST has been given up in favour of
4121 the standard exceptions Empty and Subscript, as well as
4122 Library.UnequalLengths. Function like Library.hd and Library.tl are
4123 superceded by the standard hd and tl functions etc.
4125 A number of basic list functions are no longer exported to the ML
4126 toplevel, as they are variants of predefined functions. The following
4127 suggests how one can translate existing code:
4129 rev_append xs ys = List.revAppend (xs, ys)
4130 nth_elem (i, xs) = List.nth (xs, i)
4131 last_elem xs = List.last xs
4132 flat xss = List.concat xss
4133 seq fs = List.app fs
4134 partition P xs = List.partition P xs
4135 mapfilter f xs = List.mapPartial f xs
4137 * Pure/library.ML: several combinators for linear functional
4138 transformations, notably reverse application and composition:
4141 (x, y) |-> f f #-> g
4143 * Pure/library.ML: introduced/changed precedence of infix operators:
4145 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4147 infix 3 o oo ooo oooo;
4148 infix 4 ~~ upto downto;
4150 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4153 * Pure/library.ML: natural list combinators fold, fold_rev, and
4154 fold_map support linear functional transformations and nesting. For
4157 fold f [x1, ..., xN] y =
4158 y |> f x1 |> ... |> f xN
4160 (fold o fold) f [xs1, ..., xsN] y =
4161 y |> fold f xs1 |> ... |> fold f xsN
4163 fold f [x1, ..., xN] =
4166 (fold o fold) f [xs1, ..., xsN] =
4167 fold f xs1 #> ... #> fold f xsN
4169 * Pure/library.ML: the following selectors on type 'a option are
4172 the: 'a option -> 'a (*partial*)
4173 these: 'a option -> 'a where 'a = 'b list
4174 the_default: 'a -> 'a option -> 'a
4175 the_list: 'a option -> 'a list
4177 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4178 basic operations for association lists, following natural argument
4179 order; moreover the explicit equality predicate passed here avoids
4180 potentially expensive polymorphic runtime equality checks.
4181 The old functions may be expressed as follows:
4183 assoc = uncurry (AList.lookup (op =))
4184 assocs = these oo AList.lookup (op =)
4185 overwrite = uncurry (AList.update (op =)) o swap
4187 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4189 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4190 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4192 replacing make_keylist and keyfilter (occassionally used)
4195 make_keylist = AList.make
4196 keyfilter = AList.find (op =)
4198 * eq_fst and eq_snd now take explicit equality parameter, thus
4199 avoiding eqtypes. Naive rewrites:
4201 eq_fst = eq_fst (op =)
4202 eq_snd = eq_snd (op =)
4204 * Removed deprecated apl and apr (rarely used).
4207 apl (n, op) =>>= curry op n
4208 apr (op, m) =>>= fn n => op (n, m)
4210 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4211 provides a reasonably efficient light-weight implementation of sets as
4214 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4215 few new operations; existing lookup and update are now curried to
4216 follow natural argument order (for use with fold etc.);
4217 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4219 * Pure/General: output via the Isabelle channels of
4220 writeln/warning/error etc. is now passed through Output.output, with a
4221 hook for arbitrary transformations depending on the print_mode
4222 (cf. Output.add_mode -- the first active mode that provides a output
4223 function wins). Already formatted output may be embedded into further
4224 text via Output.raw; the result of Pretty.string_of/str_of and derived
4225 functions (string_of_term/cterm/thm etc.) is already marked raw to
4226 accommodate easy composition of diagnostic messages etc. Programmers
4227 rarely need to care about Output.output or Output.raw at all, with
4228 some notable exceptions: Output.output is required when bypassing the
4229 standard channels (writeln etc.), or in token translations to produce
4230 properly formatted results; Output.raw is required when capturing
4231 already output material that will eventually be presented to the user
4232 a second time. For the default print mode, both Output.output and
4233 Output.raw have no effect.
4235 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4236 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4237 cumulative results are displayed at the end of a batch session.
4239 * Pure/General: File.sysify_path and File.quote_sysify path have been
4240 replaced by File.platform_path and File.shell_path (with appropriate
4241 hooks). This provides a clean interface for unusual systems where the
4242 internal and external process view of file names are different.
4244 * Pure: more efficient orders for basic syntactic entities: added
4245 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4246 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4247 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4248 orders now -- potential INCOMPATIBILITY for code that depends on a
4249 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4250 Library.sort_strings on result).
4252 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4253 fold_types traverse types/terms from left to right, observing natural
4254 argument order. Supercedes previous foldl_XXX versions, add_frees,
4255 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4257 * Pure: name spaces have been refined, with significant changes of the
4258 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4259 to extern(_table). The plain name entry path is superceded by a
4260 general 'naming' context, which also includes the 'policy' to produce
4261 a fully qualified name and external accesses of a fully qualified
4262 name; NameSpace.extend is superceded by context dependent
4263 Sign.declare_name. Several theory and proof context operations modify
4264 the naming context. Especially note Theory.restore_naming and
4265 ProofContext.restore_naming to get back to a sane state; note that
4266 Theory.add_path is no longer sufficient to recover from
4267 Theory.absolute_path in particular.
4269 * Pure: new flags short_names (default false) and unique_names
4270 (default true) for controlling output of qualified names. If
4271 short_names is set, names are printed unqualified. If unique_names is
4272 reset, the name prefix is reduced to the minimum required to achieve
4273 the original result when interning again, even if there is an overlap
4274 with earlier declarations.
4276 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4277 now 'extend', and 'merge' gets an additional Pretty.pp argument
4278 (useful for printing error messages). INCOMPATIBILITY.
4280 * Pure: major reorganization of the theory context. Type Sign.sg and
4281 Theory.theory are now identified, referring to the universal
4282 Context.theory (see Pure/context.ML). Actual signature and theory
4283 content is managed as theory data. The old code and interfaces were
4284 spread over many files and structures; the new arrangement introduces
4285 considerable INCOMPATIBILITY to gain more clarity:
4287 Context -- theory management operations (name, identity, inclusion,
4288 parents, ancestors, merge, etc.), plus generic theory data;
4290 Sign -- logical signature and syntax operations (declaring consts,
4291 types, etc.), plus certify/read for common entities;
4293 Theory -- logical theory operations (stating axioms, definitions,
4294 oracles), plus a copy of logical signature operations (consts,
4295 types, etc.); also a few basic management operations (Theory.copy,
4298 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4299 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4300 for convenience -- they merely return the theory.
4302 * Pure: type Type.tsig is superceded by theory in most interfaces.
4304 * Pure: the Isar proof context type is already defined early in Pure
4305 as Context.proof (note that ProofContext.context and Proof.context are
4306 aliases, where the latter is the preferred name). This enables other
4307 Isabelle components to refer to that type even before Isar is present.
4309 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4310 typeK, constK, axiomK, oracleK), but provide explicit operations for
4311 any of these kinds. For example, Sign.intern typeK is now
4312 Sign.intern_type, Theory.hide_space Sign.typeK is now
4313 Theory.hide_types. Also note that former
4314 Theory.hide_classes/types/consts are now
4315 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4316 internalize their arguments! INCOMPATIBILITY.
4318 * Pure: get_thm interface (of PureThy and ProofContext) expects
4319 datatype thmref (with constructors Name and NameSelection) instead of
4320 plain string -- INCOMPATIBILITY;
4322 * Pure: cases produced by proof methods specify options, where NONE
4323 means to remove case bindings -- INCOMPATIBILITY in
4326 * Pure: the following operations retrieve axioms or theorems from a
4327 theory node or theory hierarchy, respectively:
4329 Theory.axioms_of: theory -> (string * term) list
4330 Theory.all_axioms_of: theory -> (string * term) list
4331 PureThy.thms_of: theory -> (string * thm) list
4332 PureThy.all_thms_of: theory -> (string * thm) list
4334 * Pure: print_tac now outputs the goal through the trace channel.
4336 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4337 Reference Toplevel.debug (default false) controls detailed printing
4338 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4339 controls execution profiling -- set to 1 for time and 2 for space
4340 (both increase the runtime).
4342 * Isar session: The initial use of ROOT.ML is now always timed,
4343 i.e. the log will show the actual process times, in contrast to the
4344 elapsed wall-clock time that the outer shell wrapper produces.
4346 * Simplifier: improved handling of bound variables (nameless
4347 representation, avoid allocating new strings). Simprocs that invoke
4348 the Simplifier recursively should use Simplifier.inherit_bounds to
4349 avoid local name clashes. Failure to do so produces warnings
4350 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4351 for further details.
4353 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4354 bindings for all theorems stored within a given theory; this may help
4355 in porting non-Isar theories to Isar ones, while keeping ML proof
4356 scripts for the time being.
4358 * ML operator HTML.with_charset specifies the charset begin used for
4359 generated HTML files. For example:
4361 HTML.with_charset "utf-8" use_thy "Hebrew";
4362 HTML.with_charset "utf-8" use_thy "Chinese";
4367 * Allow symlinks to all proper Isabelle executables (Isabelle,
4368 isabelle, isatool etc.).
4370 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4371 isatool doc, isatool mkdir, display_drafts etc.).
4373 * isatool usedir: option -f allows specification of the ML file to be
4374 used by Isabelle; default is ROOT.ML.
4376 * New isatool version outputs the version identifier of the Isabelle
4377 distribution being used.
4379 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4380 (containing Boolean satisfiability problems) into Isabelle/HOL
4385 New in Isabelle2004 (April 2004)
4386 --------------------------------
4390 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4391 Replaces linorder.ML.
4393 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4394 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4395 (\<a>...\<z>), are now considered normal letters, and can therefore
4396 be used anywhere where an ASCII letter (a...zA...Z) has until
4397 now. COMPATIBILITY: This obviously changes the parsing of some
4398 terms, especially where a symbol has been used as a binder, say
4399 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4400 as an identifier. Fix it by inserting a space around former
4401 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4402 existing theory and ML files.
4404 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4406 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4407 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4408 a normal (but invisible) letter. For multiple letter subscripts repeat
4409 \<^isub> like this: x\<^isub>1\<^isub>2.
4411 * Pure: There are now sub-/superscripts that can span more than one
4412 character. Text between \<^bsub> and \<^esub> is set in subscript in
4413 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4414 superscript. The new control characters are not identifier parts.
4416 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4417 content of "..." to the latex file instead of \isacntrl... . The "..."
4418 may consist of any printable characters excluding the end bracket >.
4420 * Pure: Using new Isar command "finalconsts" (or the ML functions
4421 Theory.add_finals or Theory.add_finals_i) it is now possible to
4422 declare constants "final", which prevents their being given a definition
4423 later. It is useful for constants whose behaviour is fixed axiomatically
4424 rather than definitionally, such as the meta-logic connectives.
4426 * Pure: 'instance' now handles general arities with general sorts
4427 (i.e. intersections of classes),
4429 * Presentation: generated HTML now uses a CSS style sheet to make layout
4430 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4431 It can be changed to alter the colors/layout of generated pages.
4436 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4437 cut_tac, subgoal_tac and thin_tac:
4438 - Now understand static (Isar) contexts. As a consequence, users of Isar
4439 locales are no longer forced to write Isar proof scripts.
4440 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4442 - INCOMPATIBILITY: names of variables to be instantiated may no
4443 longer be enclosed in quotes. Instead, precede variable name with `?'.
4444 This is consistent with the instantiation attribute "where".
4446 * Attributes "where" and "of":
4447 - Now take type variables of instantiated theorem into account when reading
4448 the instantiation string. This fixes a bug that caused instantiated
4449 theorems to have too special types in some circumstances.
4450 - "where" permits explicit instantiations of type variables.
4452 * Calculation commands "moreover" and "also" no longer interfere with
4453 current facts ("this"), admitting arbitrary combinations with "then"
4457 - Goal statements involving the context element "includes" no longer
4458 generate theorems with internal delta predicates (those ending on
4459 "_axioms") in the premise.
4460 Resolve particular premise with <locale>.intro to obtain old form.
4461 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4462 specification and "includes" elements in goal statement.
4463 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4464 [intro?] and [elim?] (respectively) by default.
4465 - Experimental command for instantiation of locales in proof contexts:
4466 instantiate <label>[<attrs>]: <loc>
4467 Instantiates locale <loc> and adds all its theorems to the current context
4468 taking into account their attributes. Label and attrs are optional
4469 modifiers, like in theorem declarations. If present, names of
4470 instantiated theorems are qualified with <label>, and the attributes
4471 <attrs> are applied after any attributes these theorems might have already.
4472 If the locale has assumptions, a chained fact of the form
4473 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4474 are derived. The command does not support old-style locales declared
4475 with "locale (open)".
4476 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4478 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4484 * Proof import: new image HOL4 contains the imported library from
4485 the HOL4 system with about 2500 theorems. It is imported by
4486 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4487 can be used like any other Isabelle image. See
4488 HOL/Import/HOL/README for more information.
4491 - Much improved handling of linear and partial orders.
4492 Reasoners for linear and partial orders are set up for type classes
4493 "linorder" and "order" respectively, and are added to the default simpset
4494 as solvers. This means that the simplifier can build transitivity chains
4495 to solve goals from the assumptions.
4496 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4497 of blast or auto after simplification become unnecessary because the goal
4498 is solved by simplification already.
4500 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4501 all proved in axiomatic type classes for semirings, rings and fields.
4504 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4505 now formalized using the Ring_and_Field theory mentioned above.
4506 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4507 than before, because now they are set up once in a generic manner.
4508 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4509 Look for the general versions in Ring_and_Field (and Power if they concern
4512 * Type "rat" of the rational numbers is now available in HOL-Complex.
4515 - Record types are now by default printed with their type abbreviation
4516 instead of the list of all field types. This can be configured via
4517 the reference "print_record_type_abbr".
4518 - Simproc "record_upd_simproc" for simplification of multiple updates added
4519 (not enabled by default).
4520 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4521 EX x. x = sel r to True (not enabled by default).
4522 - Tactic "record_split_simp_tac" to split and simplify records added.
4524 * 'specification' command added, allowing for definition by
4525 specification. There is also an 'ax_specification' command that
4526 introduces the new constants axiomatically.
4528 * arith(_tac) is now able to generate counterexamples for reals as well.
4530 * HOL-Algebra: new locale "ring" for non-commutative rings.
4532 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4533 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4535 * HOL-Matrix: a first theory for matrices in HOL with an application of
4536 matrix theory to linear programming.
4538 * Unions and Intersections:
4539 The latex output syntax of UN and INT has been changed
4540 from "\Union x \in A. B" to "\Union_{x \in A} B"
4541 i.e. the index formulae has become a subscript.
4542 Similarly for "\Union x. B", and for \Inter instead of \Union.
4544 * Unions and Intersections over Intervals:
4545 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4546 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4547 like in normal math, and corresponding versions for < and for intersection.
4549 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4550 lexicographic dictonary ordering has been added as "lexord".
4552 * ML: the legacy theory structures Int and List have been removed. They had
4553 conflicted with ML Basis Library structures having the same names.
4555 * 'refute' command added to search for (finite) countermodels. Only works
4556 for a fragment of HOL. The installation of an external SAT solver is
4557 highly recommended. See "HOL/Refute.thy" for details.
4559 * 'quickcheck' command: Allows to find counterexamples by evaluating
4560 formulae under an assignment of free variables to random values.
4561 In contrast to 'refute', it can deal with inductive datatypes,
4562 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4568 * Streams now come with concatenation and are part of the HOLCF image
4572 New in Isabelle2003 (May 2003)
4573 ------------------------------
4577 * Provers/simplifier:
4579 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4580 Assumptions are now subject to complete mutual simplification,
4581 not just from left to right. The simplifier now preserves
4582 the order of assumptions.
4584 Potential INCOMPATIBILITY:
4586 -- simp sometimes diverges where the old version did
4587 not, e.g. invoking simp on the goal
4589 [| P (f x); y = x; f x = f y |] ==> Q
4591 now gives rise to the infinite reduction sequence
4593 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4595 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4598 -- Tactics combining classical reasoner and simplification (such as auto)
4599 are also affected by this change, because many of them rely on
4600 simp. They may sometimes diverge as well or yield a different numbers
4601 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4602 in case of problems. Sometimes subsequent calls to the classical
4603 reasoner will fail because a preceeding call to the simplifier too
4604 eagerly simplified the goal, e.g. deleted redundant premises.
4606 - The simplifier trace now shows the names of the applied rewrite rules
4608 - You can limit the number of recursive invocations of the simplifier
4609 during conditional rewriting (where the simplifie tries to solve the
4610 conditions before applying the rewrite rule):
4611 ML "simp_depth_limit := n"
4612 where n is an integer. Thus you can force termination where previously
4613 the simplifier would diverge.
4615 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4617 - No longer aborts on failed congruence proof. Instead, the
4618 congruence is ignored.
4620 * Pure: New generic framework for extracting programs from constructive
4621 proofs. See HOL/Extraction.thy for an example instantiation, as well
4622 as HOL/Extraction for some case studies.
4624 * Pure: The main goal of the proof state is no longer shown by default, only
4625 the subgoals. This behaviour is controlled by a new flag.
4626 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4627 (ML: Proof.show_main_goal).
4629 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4630 rules whose conclusion matches subgoal 1:
4631 PG menu: Isabelle/Isar -> Show me -> matching rules
4632 The rules are ordered by how closely they match the subgoal.
4633 In particular, rules that solve a subgoal outright are displayed first
4634 (or rather last, the way they are printed).
4635 (ML: ProofGeneral.print_intros())
4637 * Pure: New flag trace_unify_fail causes unification to print
4638 diagnostic information (PG: in trace buffer) when it fails. This is
4639 useful for figuring out why single step proofs like rule, erule or
4642 * Pure: Locale specifications now produce predicate definitions
4643 according to the body of text (covering assumptions modulo local
4644 definitions); predicate "loc_axioms" covers newly introduced text,
4645 while "loc" is cumulative wrt. all included locale expressions; the
4646 latter view is presented only on export into the global theory
4647 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4648 on the old view without predicates;
4650 * Pure: predefined locales "var" and "struct" are useful for sharing
4651 parameters (as in CASL, for example); just specify something like
4652 ``var x + var y + struct M'' as import;
4654 * Pure: improved thms_containing: proper indexing of facts instead of
4655 raw theorems; check validity of results wrt. current name space;
4656 include local facts of proof configuration (also covers active
4657 locales), cover fixed variables in index; may use "_" in term
4658 specification; an optional limit for the number of printed facts may
4659 be given (the default is 40);
4661 * Pure: disallow duplicate fact bindings within new-style theory files
4664 * Provers: improved induct method: assumptions introduced by case
4665 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4666 the goal statement); "foo" still refers to all facts collectively;
4668 * Provers: the function blast.overloaded has been removed: all constants
4669 are regarded as potentially overloaded, which improves robustness in exchange
4670 for slight decrease in efficiency;
4672 * Provers/linorder: New generic prover for transitivity reasoning over
4673 linear orders. Note: this prover is not efficient!
4675 * Isar: preview of problems to finish 'show' now produce an error
4676 rather than just a warning (in interactive mode);
4683 - Produces a counter example if it cannot prove a goal.
4684 Note that the counter example may be spurious if the goal is not a formula
4685 of quantifier-free linear arithmetic.
4686 In ProofGeneral the counter example appears in the trace buffer.
4688 - Knows about div k and mod k where k is a numeral of type nat or int.
4690 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4691 linear arithmetic fails. This takes account of quantifiers and divisibility.
4692 Presburger arithmetic can also be called explicitly via presburger(_tac).
4694 * simp's arithmetic capabilities have been enhanced a bit: it now
4695 takes ~= in premises into account (by performing a case split);
4697 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4698 are distributed over a sum of terms;
4700 * New tactic "trans_tac" and method "trans" instantiate
4701 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4704 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4705 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4707 * 'typedef' command has new option "open" to suppress the set
4710 * functions Min and Max on finite sets have been introduced (theory
4713 * attribute [symmetric] now works for relations as well; it turns
4714 (x,y) : R^-1 into (y,x) : R, and vice versa;
4716 * induct over a !!-quantified statement (say !!x1..xn):
4717 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4719 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4720 %x. None. Warning: empty_def now refers to the previously hidden definition
4723 * Algebra: formalization of classical algebra. Intended as base for
4724 any algebraic development in Isabelle. Currently covers group theory
4725 (up to Sylow's theorem) and ring theory (Universal Property of
4726 Univariate Polynomials). Contributions welcome;
4728 * GroupTheory: deleted, since its material has been moved to Algebra;
4730 * Complex: new directory of the complex numbers with numeric constants,
4731 nonstandard complex numbers, and some complex analysis, standard and
4732 nonstandard (Jacques Fleuriot);
4734 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4736 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4739 * Real/HahnBanach: updated and adapted to locales;
4741 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4744 * UNITY: added the Meier-Sanders theory of progress sets;
4746 * MicroJava: bytecode verifier and lightweight bytecode verifier
4747 as abstract algorithms, instantiated to the JVM;
4749 * Bali: Java source language formalization. Type system, operational
4750 semantics, axiomatic semantics. Supported language features:
4751 classes, interfaces, objects,virtual methods, static methods,
4752 static/instance fields, arrays, access modifiers, definite
4753 assignment, exceptions.
4758 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4761 * Main ZF: virtually all theories converted to new-style format;
4766 * Pure: Tactic.prove provides sane interface for internal proofs;
4767 omits the infamous "standard" operation, so this is more appropriate
4768 than prove_goalw_cterm in many situations (e.g. in simprocs);
4770 * Pure: improved error reporting of simprocs;
4772 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4776 *** Document preparation ***
4778 * uses \par instead of \\ for line breaks in theory text. This may
4779 shift some page breaks in large documents. To get the old behaviour
4780 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4782 * minimized dependencies of isabelle.sty and isabellesym.sty on
4785 * \<euro> now needs package babel/greek instead of marvosym (which
4788 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4793 New in Isabelle2002 (March 2002)
4794 --------------------------------
4796 *** Document preparation ***
4798 * greatly simplified document preparation setup, including more
4799 graceful interpretation of isatool usedir -i/-d/-D options, and more
4800 instructive isatool mkdir; users should basically be able to get
4801 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4802 users may run a separate document processing stage manually like this:
4803 "isatool usedir -D output HOL Test && isatool document Test/output";
4805 * theory dependency graph may now be incorporated into documents;
4806 isatool usedir -g true will produce session_graph.eps/.pdf for use
4807 with \includegraphics of LaTeX;
4809 * proper spacing of consecutive markup elements, especially text
4810 blocks after section headings;
4812 * support bold style (for single symbols only), input syntax is like
4813 this: "\<^bold>\<alpha>" or "\<^bold>A";
4815 * \<bullet> is now output as bold \cdot by default, which looks much
4816 better in printed text;
4818 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4819 note that these symbols are currently unavailable in Proof General /
4820 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4822 * isatool latex no longer depends on changed TEXINPUTS, instead
4823 isatool document copies the Isabelle style files to the target
4829 * Pure/Provers: improved proof by cases and induction;
4830 - 'case' command admits impromptu naming of parameters (such as
4832 - 'induct' method divinates rule instantiation from the inductive
4833 claim; no longer requires excessive ?P bindings for proper
4834 instantiation of cases;
4835 - 'induct' method properly enumerates all possibilities of set/type
4836 rules; as a consequence facts may be also passed through *type*
4837 rules without further ado;
4838 - 'induct' method now derives symbolic cases from the *rulified*
4839 rule (before it used to rulify cases stemming from the internal
4840 atomized version); this means that the context of a non-atomic
4841 statement becomes is included in the hypothesis, avoiding the
4842 slightly cumbersome show "PROP ?case" form;
4843 - 'induct' may now use elim-style induction rules without chaining
4844 facts, using ``missing'' premises from the goal state; this allows
4845 rules stemming from inductive sets to be applied in unstructured
4846 scripts, while still benefitting from proper handling of non-atomic
4847 statements; NB: major inductive premises need to be put first, all
4848 the rest of the goal is passed through the induction;
4849 - 'induct' proper support for mutual induction involving non-atomic
4850 rule statements (uses the new concept of simultaneous goals, see
4852 - append all possible rule selections, but only use the first
4853 success (no backtracking);
4854 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4855 - undeclared rule case names default to numbers 1, 2, 3, ...;
4856 - added 'print_induct_rules' (covered by help item in recent Proof
4858 - moved induct/cases attributes to Pure, methods to Provers;
4859 - generic method setup instantiated for FOL and HOL;
4861 * Pure: support multiple simultaneous goal statements, for example
4862 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4863 meta-level mechanism, this acts as if several individual goals had
4864 been stated separately; in particular common proof methods need to be
4865 repeated in order to cover all claims; note that a single elimination
4866 step is *not* sufficient to establish the two conjunctions, so this
4869 assume "A & B" then have A and B .. (*".." fails*)
4871 better use "obtain" in situations as above; alternative refer to
4872 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4874 * Pure: proper integration with ``locales''; unlike the original
4875 version by Florian Kammller, Isar locales package high-level proof
4876 contexts rather than raw logical ones (e.g. we admit to include
4877 attributes everywhere); operations on locales include merge and
4878 rename; support for implicit arguments (``structures''); simultaneous
4879 type-inference over imports and text; see also HOL/ex/Locales.thy for
4882 * Pure: the following commands have been ``localized'', supporting a
4883 target locale specification "(in name)": 'lemma', 'theorem',
4884 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4885 stored both within the locale and at the theory level (exported and
4886 qualified by the locale name);
4888 * Pure: theory goals may now be specified in ``long'' form, with
4889 ad-hoc contexts consisting of arbitrary locale elements. for example
4890 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4891 definitions may be given, too); the result is a meta-level rule with
4892 the context elements being discharged in the obvious way;
4894 * Pure: new proof command 'using' allows to augment currently used
4895 facts after a goal statement ('using' is syntactically analogous to
4896 'apply', but acts on the goal's facts only); this allows chained facts
4897 to be separated into parts given before and after a claim, as in
4898 ``from a and b have C using d and e <proof>'';
4900 * Pure: renamed "antecedent" case to "rule_context";
4902 * Pure: new 'judgment' command records explicit information about the
4903 object-logic embedding (used by several tools internally); no longer
4904 use hard-wired "Trueprop";
4906 * Pure: added 'corollary' command;
4908 * Pure: fixed 'token_translation' command;
4910 * Pure: removed obsolete 'exported' attribute;
4912 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4913 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4914 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4916 * Pure: method 'atomize' presents local goal premises as object-level
4917 statements (atomic meta-level propositions); setup controlled via
4918 rewrite rules declarations of 'atomize' attribute; example
4919 application: 'induct' method with proper rule statements in improper
4922 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4923 now consider the syntactic context of assumptions, giving a better
4924 chance to get type-inference of the arguments right (this is
4925 especially important for locales);
4927 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4930 * Pure/obtain: the formal conclusion "thesis", being marked as
4931 ``internal'', may no longer be reference directly in the text;
4932 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4935 * Pure: generic 'sym' attribute which declares a rule both as pure
4936 'elim?' and for the 'symmetric' operation;
4938 * Pure: marginal comments ``--'' may now occur just anywhere in the
4939 text; the fixed correlation with particular command syntax has been
4942 * Pure: new method 'rules' is particularly well-suited for proof
4943 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4944 but often produces more compact proof terms with less detours;
4946 * Pure/Provers/classical: simplified integration with pure rule
4947 attributes and methods; the classical "intro?/elim?/dest?"
4948 declarations coincide with the pure ones; the "rule" method no longer
4949 includes classically swapped intros; "intro" and "elim" methods no
4950 longer pick rules from the context; also got rid of ML declarations
4951 AddXIs/AddXEs/AddXDs; all of this has some potential for
4954 * Provers/classical: attribute 'swapped' produces classical inversions
4955 of introduction rules;
4957 * Provers/simplifier: 'simplified' attribute may refer to explicit
4958 rules instead of full simplifier context; 'iff' attribute handles
4961 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4963 * HOL: 'recdef' now fails on unfinished automated proofs, use
4964 "(permissive)" option to recover old behavior;
4966 * HOL: 'inductive' no longer features separate (collective) attributes
4967 for 'intros' (was found too confusing);
4969 * HOL: properly declared induction rules less_induct and
4975 * HOL: moved over to sane numeral syntax; the new policy is as
4978 - 0 and 1 are polymorphic constants, which are defined on any
4979 numeric type (nat, int, real etc.);
4981 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4982 binary representation internally;
4984 - type nat has special constructor Suc, and generally prefers Suc 0
4985 over 1::nat and Suc (Suc 0) over 2::nat;
4987 This change may cause significant problems of INCOMPATIBILITY; here
4988 are some hints on converting existing sources:
4990 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4991 entities, so expressions involving "-" (unary or binary minus) need
4992 to be spaced properly;
4994 - existing occurrences of "1" may need to be constraint "1::nat" or
4995 even replaced by Suc 0; similar for old "2";
4997 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4999 - remove all special provisions on numerals in proofs;
5001 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5002 representation (depends on bin_arith_simps in the default context);
5004 * HOL: symbolic syntax for x^2 (numeral 2);
5006 * HOL: the class of all HOL types is now called "type" rather than
5007 "term"; INCOMPATIBILITY, need to adapt references to this type class
5008 in axclass/classes, instance/arities, and (usually rare) occurrences
5009 in typings (of consts etc.); internally the class is called
5010 "HOL.type", ML programs should refer to HOLogic.typeS;
5012 * HOL/record package improvements:
5013 - new derived operations "fields" to build a partial record section,
5014 "extend" to promote a fixed record to a record scheme, and
5015 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5016 declared as simp by default;
5017 - shared operations ("more", "fields", etc.) now need to be always
5018 qualified) --- potential INCOMPATIBILITY;
5019 - removed "make_scheme" operations (use "make" with "extend") --
5021 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5022 - provides cases/induct rules for use with corresponding Isar
5023 methods (for concrete records, record schemes, concrete more
5024 parts, and schematic more parts -- in that order);
5025 - internal definitions directly based on a light-weight abstract
5026 theory of product types over typedef rather than datatype;
5028 * HOL: generic code generator for generating executable ML code from
5029 specifications; specific support for HOL constructs such as inductive
5030 datatypes and sets, as well as recursive functions; can be invoked
5031 via 'generate_code' theory section;
5033 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5035 * HOL: consolidated and renamed several theories. In particular:
5036 Ord.thy has been absorbed into HOL.thy
5037 String.thy has been absorbed into List.thy
5039 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5040 (beware of argument permutation!);
5042 * HOL: linorder_less_split superseded by linorder_cases;
5044 * HOL/List: "nodups" renamed to "distinct";
5046 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5047 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5048 - Ex_def has changed, now need to use some_eq_ex
5050 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5051 in this (rare) case use:
5053 delSWrapper "split_all_tac"
5054 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5056 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5059 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5060 Isabelle's type classes, ^ on functions and relations has too general
5061 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5062 necessary to attach explicit type constraints;
5064 * HOL/Relation: the prefix name of the infix "O" has been changed from
5065 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5066 renamed accordingly (eg "compI" -> "rel_compI").
5068 * HOL: syntax translations now work properly with numerals and records
5071 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5072 of "lam" -- INCOMPATIBILITY;
5074 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5075 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5076 renamed "Product_Type.unit";
5078 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5080 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5081 the "cases" method);
5083 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5086 * HOL/IMP: updated and converted to new-style theory format; several
5087 parts turned into readable document, with proper Isar proof texts and
5088 some explanations (by Gerwin Klein);
5090 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5092 * HOL-Hyperreal is now a logic image;
5097 * Isar: consts/constdefs supports mixfix syntax for continuous
5100 * Isar: domain package adapted to new-style theory format, e.g. see
5103 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5104 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5105 lift.induct_tac, always use UU instead of Undef;
5107 * HOLCF/IMP: updated and converted to new-style theory;
5112 * Isar: proper integration of logic-specific tools and packages,
5113 including theory commands '(co)inductive', '(co)datatype',
5114 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5115 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5117 * theory Main no longer includes AC; for the Axiom of Choice, base
5118 your theory on Main_ZFC;
5120 * the integer library now covers quotients and remainders, with many
5121 laws relating division to addition, multiplication, etc.;
5123 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5124 typeless version of the formalism;
5126 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5129 * ZF/Induct: new directory for examples of inductive definitions,
5130 including theory Multiset for multiset orderings; converted to
5131 new-style theory format;
5133 * ZF: many new theorems about lists, ordinals, etc.;
5138 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5139 variable proof controls level of detail: 0 = no proofs (only oracle
5140 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5141 also ref manual for further ML interfaces;
5143 * Pure/axclass: removed obsolete ML interface
5144 goal_subclass/goal_arity;
5146 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5147 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5148 separate tokens, so expressions involving minus need to be spaced
5151 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5152 rather than "infixl" or "infixr";
5154 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5155 sort constraint specifications in type inference; e.g. "x::_::foo"
5156 ensures that the type of "x" is of sort "foo" (but not necessarily a
5159 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5160 control output of nested => (types); the default behavior is
5163 * Pure/syntax: builtin parse translation for "_constify" turns valued
5164 tokens into AST constants;
5166 * Pure/syntax: prefer later declarations of translations and print
5167 translation functions; potential INCOMPATIBILITY: need to reverse
5168 multiple declarations for same syntax element constant;
5170 * Pure/show_hyps reset by default (in accordance to existing Isar
5173 * Provers/classical: renamed addaltern to addafter, addSaltern to
5176 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5179 * system: tested support for MacOS X; should be able to get Isabelle +
5180 Proof General to work in a plain Terminal after installing Poly/ML
5181 (e.g. from the Isabelle distribution area) and GNU bash alone
5182 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5183 support requires further installations, e.g. from
5184 http://fink.sourceforge.net/);
5186 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5188 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5189 of 40 MB), cf. ML_OPTIONS;
5191 * system: Proof General keywords specification is now part of the
5192 Isabelle distribution (see etc/isar-keywords.el);
5194 * system: support for persistent Proof General sessions (refrain from
5195 outdating all loaded theories on startup); user may create writable
5196 logic images like this: ``isabelle -q HOL Test'';
5198 * system: smart selection of Isabelle process versus Isabelle
5199 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5200 run both "isabelle" and "Isabelle" even if file names are badly
5201 damaged (executable inspects the case of the first letter of its own
5202 name); added separate "isabelle-process" and "isabelle-interface";
5204 * system: refrain from any attempt at filtering input streams; no
5205 longer support ``8bit'' encoding of old isabelle font, instead proper
5206 iso-latin characters may now be used; the related isatools
5207 "symbolinput" and "nonascii" have disappeared as well;
5209 * system: removed old "xterm" interface (the print modes "xterm" and
5210 "xterm_color" are still available for direct use in a suitable
5215 New in Isabelle99-2 (February 2001)
5216 -----------------------------------
5218 *** Overview of INCOMPATIBILITIES ***
5220 * HOL: please note that theories in the Library and elsewhere often use the
5221 new-style (Isar) format; to refer to their theorems in an ML script you must
5222 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5224 * HOL: inductive package no longer splits induction rule aggressively,
5225 but only as far as specified by the introductions given; the old
5226 format may be recovered via ML function complete_split_rule or attribute
5227 'split_rule (complete)';
5229 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5230 gfp_Tarski to gfp_unfold;
5232 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5234 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5235 relation); infix "^^" has been renamed "``"; infix "``" has been
5236 renamed "`"; "univalent" has been renamed "single_valued";
5238 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5241 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5243 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5245 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5246 consequence, it is no longer monotonic wrt. the local goal context
5247 (which is now passed through the inductive cases);
5249 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5250 \<gg> to \<ggreater>;
5253 *** Document preparation ***
5255 * \isabellestyle{NAME} selects version of Isabelle output (currently
5256 available: are "it" for near math-mode best-style output, "sl" for
5257 slanted text style, and "tt" for plain type-writer; if no
5258 \isabellestyle command is given, output is according to slanted
5261 * support sub/super scripts (for single symbols only), input syntax is
5262 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5264 * some more standard symbols; see Appendix A of the system manual for
5265 the complete list of symbols defined in isabellesym.sty;
5267 * improved isabelle style files; more abstract symbol implementation
5268 (should now use \isamath{...} and \isatext{...} in custom symbol
5271 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5272 state; Note that presentation of goal states does not conform to
5273 actual human-readable proof documents. Please do not include goal
5274 states into document output unless you really know what you are doing!
5276 * proper indentation of antiquoted output with proportional LaTeX
5279 * no_document ML operator temporarily disables LaTeX document
5282 * isatool unsymbolize tunes sources for plain ASCII communication;
5287 * Pure: Isar now suffers initial goal statements to contain unbound
5288 schematic variables (this does not conform to actual readable proof
5289 documents, due to unpredictable outcome and non-compositional proof
5290 checking); users who know what they are doing may use schematic goals
5291 for Prolog-style synthesis of proven results;
5293 * Pure: assumption method (an implicit finishing) now handles actual
5296 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5297 initial goal, declare "that" only as Pure intro (only for single
5298 steps); the "that" rule assumption may now be involved in implicit
5299 finishing, thus ".." becomes a feasible for trivial obtains;
5301 * Pure: default proof step now includes 'intro_classes'; thus trivial
5302 instance proofs may be performed by "..";
5304 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5307 * Pure: more robust selection of calculational rules;
5309 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5310 rule (as well as the assumption rule);
5312 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5313 lemmas, using the graph browser tool;
5315 * Pure: predict failure of "show" in interactive mode;
5317 * Pure: 'thms_containing' now takes actual terms as arguments;
5319 * HOL: improved method 'induct' --- now handles non-atomic goals
5320 (potential INCOMPATIBILITY); tuned error handling;
5322 * HOL: cases and induct rules now provide explicit hints about the
5323 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5324 any remaining facts are inserted into the goal verbatim;
5326 * HOL: local contexts (aka cases) may now contain term bindings as
5327 well; the 'cases' and 'induct' methods new provide a ?case binding for
5328 the result to be shown in each case;
5330 * HOL: added 'recdef_tc' command;
5332 * isatool convert assists in eliminating legacy ML scripts;
5337 * HOL/Library: a collection of generic theories to be used together
5338 with main HOL; the theory loader path already includes this directory
5339 by default; the following existing theories have been moved here:
5340 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5341 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5343 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5344 modelling and verification task performed in Isabelle/HOL +
5345 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5347 * HOL/Algebra: special summation operator SUM no longer exists, it has
5348 been replaced by setsum; infix 'assoc' now has priority 50 (like
5349 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5350 'domain', this makes the theory consistent with mathematical
5353 * HOL basics: added overloaded operations "inverse" and "divide"
5354 (infix "/"), syntax for generic "abs" operation, generic summation
5357 * HOL/typedef: simplified package, provide more useful rules (see also
5360 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5361 now expressed as a proper nested rule (old-style tactic scripts may
5362 require atomize_strip_tac to cope with non-atomic premises);
5364 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5365 to "split_conv" (old name still available for compatibility);
5367 * HOL: improved concrete syntax for strings (e.g. allows translation
5368 rules with string literals);
5370 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5371 and Fleuriot's mechanization of analysis, including the transcendental
5372 functions for the reals;
5374 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5379 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5380 "lam" is displayed as TWO lambda-symbols
5382 * CTT: theory Main now available, containing everything (that is, Bool
5388 * Pure: the Simplifier has been implemented properly as a derived rule
5389 outside of the actual kernel (at last!); the overall performance
5390 penalty in practical applications is about 50%, while reliability of
5391 the Isabelle inference kernel has been greatly improved;
5393 * print modes "brackets" and "no_brackets" control output of nested =>
5394 (types) and ==> (props); the default behaviour is "brackets";
5396 * Provers: fast_tac (and friends) now handle actual object-logic rules
5397 as assumptions as well;
5399 * system: support Poly/ML 4.0;
5401 * system: isatool install handles KDE version 1 or 2;
5405 New in Isabelle99-1 (October 2000)
5406 ----------------------------------
5408 *** Overview of INCOMPATIBILITIES ***
5410 * HOL: simplification of natural numbers is much changed; to partly
5411 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5412 issue the following ML commands:
5414 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5415 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5417 * HOL: simplification no longer dives into case-expressions; this is
5418 controlled by "t.weak_case_cong" for each datatype t;
5420 * HOL: nat_less_induct renamed to less_induct;
5422 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5423 fixsome to patch .thy and .ML sources automatically;
5425 select_equality -> some_equality
5426 select_eq_Ex -> some_eq_ex
5427 selectI2EX -> someI2_ex
5430 select1_equality -> some1_equality
5431 Eps_sym_eq -> some_sym_eq_trivial
5432 Eps_eq -> some_eq_trivial
5434 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5436 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5439 * HOL: the recursion equations generated by 'recdef' are now called
5440 f.simps instead of f.rules;
5442 * HOL: qed_spec_mp now also handles bounded ALL as well;
5444 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5445 sometimes be needed;
5447 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5449 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5451 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5452 product is now "<*>" instead of "Times"; the lexicographic product is
5453 now "<*lex*>" instead of "**";
5455 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5456 of main HOL, but was unused); better use HOL's datatype package;
5458 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5459 the old syntax may be recovered as follows:
5462 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5463 (infixl "\\<oplus>" 100)
5465 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5467 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5468 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5471 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5472 changed from A/r to A//r;
5474 * ZF: new treatment of arithmetic (nat & int) may break some old
5477 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5478 rulify -> rule_format, elimify -> elim_format, ...);
5480 * Isar/Provers: intro/elim/dest attributes changed; renamed
5481 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5482 should have to change intro!! to intro? only); replaced "delrule" by
5485 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5487 * Provers: strengthened force_tac by using new first_best_tac;
5489 * LaTeX document preparation: several changes of isabelle.sty (see
5493 *** Document preparation ***
5495 * formal comments (text blocks etc.) in new-style theories may now
5496 contain antiquotations of thm/prop/term/typ/text to be presented
5497 according to latex print mode; concrete syntax is like this:
5498 @{term[show_types] "f(x) = a + x"};
5500 * isatool mkdir provides easy setup of Isabelle session directories,
5501 including proper document sources;
5503 * generated LaTeX sources are now deleted after successful run
5504 (isatool document -c); may retain a copy somewhere else via -D option
5507 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5508 style files, achieving self-contained LaTeX sources and simplifying
5511 * old-style theories now produce (crude) LaTeX output as well;
5513 * browser info session directories are now self-contained (may be put
5514 on WWW server seperately); improved graphs of nested sessions; removed
5515 graph for 'all sessions';
5517 * several improvements in isabelle style files; \isabellestyle{it}
5518 produces fake math mode output; \isamarkupheader is now \section by
5519 default; see lib/texinputs/isabelle.sty etc.;
5524 * Isar/Pure: local results and corresponding term bindings are now
5525 subject to Hindley-Milner polymorphism (similar to ML); this
5526 accommodates incremental type-inference very nicely;
5528 * Isar/Pure: new derived language element 'obtain' supports
5529 generalized existence reasoning;
5531 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5532 support accumulation of results, without applying any rules yet;
5533 useful to collect intermediate results without explicit name
5534 references, and for use with transitivity rules with more than 2
5537 * Isar/Pure: scalable support for case-analysis type proofs: new
5538 'case' language element refers to local contexts symbolically, as
5539 produced by certain proof methods; internally, case names are attached
5540 to theorems as "tags";
5542 * Isar/Pure: theory command 'hide' removes declarations from
5543 class/type/const name spaces;
5545 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5546 indicate potential overloading;
5548 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5550 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5551 "{a,b,c}" instead of {a,b,c};
5553 * Isar/Pure now provides its own version of intro/elim/dest
5554 attributes; useful for building new logics, but beware of confusion
5555 with the version in Provers/classical;
5557 * Isar/Pure: the local context of (non-atomic) goals is provided via
5558 case name 'antecedent';
5560 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5561 to the current context is now done automatically);
5563 * Isar/Pure: theory command 'method_setup' provides a simple interface
5564 for definining proof methods in ML;
5566 * Isar/Provers: intro/elim/dest attributes changed; renamed
5567 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5568 most cases, one should have to change intro!! to intro? only);
5569 replaced "delrule" by "rule del";
5571 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5572 'symmetric' attribute (the latter supercedes [RS sym]);
5574 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5575 method modifier); 'simp' method: 'only:' modifier removes loopers as
5576 well (including splits);
5578 * Isar/Provers: Simplifier and Classical methods now support all kind
5579 of modifiers used in the past, including 'cong', 'iff', etc.
5581 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5582 of Simplifier and Classical reasoner);
5584 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5585 now support named cases; major packages (inductive, datatype, primrec,
5586 recdef) support case names and properly name parameters;
5588 * Isar/HOL: new transitivity rules for substitution in inequalities --
5589 monotonicity conditions are extracted to be proven at end of
5592 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5595 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5596 split_if split_if_asm; datatype package provides theorems foo.splits =
5597 foo.split foo.split_asm for each datatype;
5599 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5600 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5601 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5602 use "(cases (simplified))" method in proper proof texts);
5604 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5606 * Isar: names of theorems etc. may be natural numbers as well;
5608 * Isar: 'pr' command: optional arguments for goals_limit and
5609 ProofContext.prems_limit; no longer prints theory contexts, but only
5612 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5613 additional print modes to be specified; e.g. "pr(latex)" will print
5614 proof state according to the Isabelle LaTeX style;
5616 * Isar: improved support for emulating tactic scripts, including proof
5617 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5618 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5619 (for HOL datatypes);
5621 * Isar: simplified (more robust) goal selection of proof methods: 1st
5622 goal, all goals, or explicit goal specifier (tactic emulation); thus
5623 'proof method scripts' have to be in depth-first order;
5625 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5627 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5628 should instead use individual commands for printing items
5629 (print_commands, print_methods etc.);
5631 * Isar: added 'nothing' --- the empty list of theorems;
5636 * HOL/MicroJava: formalization of a fragment of Java, together with a
5637 corresponding virtual machine and a specification of its bytecode
5638 verifier and a lightweight bytecode verifier, including proofs of
5639 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5640 Cornelia Pusch (see also the homepage of project Bali at
5641 http://isabelle.in.tum.de/Bali/);
5643 * HOL/Algebra: new theory of rings and univariate polynomials, by
5646 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5647 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5650 * HOL/Lattice: fundamental concepts of lattice theory and order
5651 structures, including duals, properties of bounds versus algebraic
5652 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5653 Theorem for complete lattices etc.; may also serve as a demonstration
5654 for abstract algebraic reasoning using axiomatic type classes, and
5655 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5657 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5660 * HOL/IMPP: extension of IMP with local variables and mutually
5661 recursive procedures, by David von Oheimb;
5663 * HOL/Lambda: converted into new-style theory and document;
5665 * HOL/ex/Multiquote: example of multiple nested quotations and
5666 anti-quotations -- basically a generalized version of de-Bruijn
5667 representation; very useful in avoiding lifting of operations;
5669 * HOL/record: added general record equality rule to simpset; fixed
5670 select-update simplification procedure to handle extended records as
5671 well; admit "r" as field name;
5673 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5674 other numeric types and also as the identity of groups, rings, etc.;
5676 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5677 Types nat and int belong to this axclass;
5679 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5680 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5681 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5682 two terms #m*u and #n*u are replaced by #(m+n)*u
5683 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5684 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5685 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5687 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5688 powerful prover for predicate logic but knows nothing of clasets; see
5689 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5691 * HOL: new version of "case_tac" subsumes both boolean case split and
5692 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5693 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5695 * HOL: simplification no longer dives into case-expressions: only the
5696 selector expression is simplified, but not the remaining arms; to
5697 enable full simplification of case-expressions for datatype t, you may
5698 remove t.weak_case_cong from the simpset, either globally (Delcongs
5699 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5701 * HOL/recdef: the recursion equations generated by 'recdef' for
5702 function 'f' are now called f.simps instead of f.rules; if all
5703 termination conditions are proved automatically, these simplification
5704 rules are added to the simpset, as in primrec; rules may be named
5705 individually as well, resulting in a separate list of theorems for
5708 * HOL/While is a new theory that provides a while-combinator. It
5709 permits the definition of tail-recursive functions without the
5710 provision of a termination measure. The latter is necessary once the
5711 invariant proof rule for while is applied.
5713 * HOL: new (overloaded) notation for the set of elements below/above
5714 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5716 * HOL: theorems impI, allI, ballI bound as "strip";
5718 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5719 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5720 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5722 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5724 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5725 main HOL, but was unused);
5727 * HOL: fewer consts declared as global (e.g. have to refer to
5728 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5730 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5731 in case of overlap with user translations (e.g. judgements over
5732 tuples); (note that the underlying logical represenation is still
5738 * ZF: simplification automatically cancels common terms in arithmetic
5739 expressions over nat and int;
5741 * ZF: new treatment of nat to minimize type-checking: all operators
5742 coerce their operands to a natural number using the function natify,
5743 making the algebraic laws unconditional;
5745 * ZF: as above, for int: operators coerce their operands to an integer
5746 using the function intify;
5748 * ZF: the integer library now contains many of the usual laws for the
5749 orderings, including $<=, and monotonicity laws for $+ and $*;
5751 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5754 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5755 to the simplifier and classical reasoner simultaneously;
5760 * Provers: blast_tac now handles actual object-logic rules as
5761 assumptions; note that auto_tac uses blast_tac internally as well;
5763 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5764 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5766 * Provers: delrules now handles destruct rules as well (no longer need
5767 explicit make_elim);
5769 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5770 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5771 use instead the strong form,
5772 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5773 in HOL, FOL and ZF the function cla_make_elim will create such rules
5774 from destruct-rules;
5776 * Provers: Simplifier.easy_setup provides a fast path to basic
5777 Simplifier setup for new object-logics;
5779 * Pure: AST translation rules no longer require constant head on LHS;
5781 * Pure: improved name spaces: ambiguous output is qualified; support
5782 for hiding of names;
5784 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5785 XSYMBOL_HOME; no longer need to do manual configuration in most
5788 * system: compression of ML heaps images may now be controlled via -c
5789 option of isabelle and isatool usedir (currently only observed by
5792 * system: isatool installfonts may handle X-Symbol fonts as well (very
5793 useful for remote X11);
5795 * system: provide TAGS file for Isabelle sources;
5797 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5800 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5801 timing flag supersedes proof_timing and Toplevel.trace;
5803 * ML: new combinators |>> and |>>> for incremental transformations
5804 with secondary results (e.g. certain theory extensions):
5806 * ML: PureThy.add_defs gets additional argument to indicate potential
5807 overloading (usually false);
5809 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5814 New in Isabelle99 (October 1999)
5815 --------------------------------
5817 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5819 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5820 are no longer simplified. (This allows the simplifier to unfold recursive
5821 functional programs.) To restore the old behaviour, declare
5823 Delcongs [if_weak_cong];
5825 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5828 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5830 * HOL/datatype: mutual_induct_tac no longer exists --
5831 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5833 * HOL/typedef: fixed type inference for representing set; type
5834 arguments now have to occur explicitly on the rhs as type constraints;
5836 * ZF: The con_defs part of an inductive definition may no longer refer
5837 to constants declared in the same theory;
5839 * HOL, ZF: the function mk_cases, generated by the inductive
5840 definition package, has lost an argument. To simplify its result, it
5841 uses the default simpset instead of a supplied list of theorems.
5843 * HOL/List: the constructors of type list are now Nil and Cons;
5845 * Simplifier: the type of the infix ML functions
5846 setSSolver addSSolver setSolver addSolver
5847 is now simpset * solver -> simpset where `solver' is a new abstract type
5848 for packaging solvers. A solver is created via
5849 mk_solver: string -> (thm list -> int -> tactic) -> solver
5850 where the string argument is only a comment.
5855 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5856 decision procedure for linear arithmetic. Currently it is used for
5857 types `nat', `int', and `real' in HOL (see below); it can, should and
5858 will be instantiated for other types and logics as well.
5860 * The simplifier now accepts rewrite rules with flexible heads, eg
5861 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5862 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5868 * New Isabelle/Isar subsystem provides an alternative to traditional
5869 tactical theorem proving; together with the ProofGeneral/isar user
5870 interface it offers an interactive environment for developing human
5871 readable proof documents (Isar == Intelligible semi-automated
5872 reasoning); for further information see isatool doc isar-ref,
5873 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5875 * improved and simplified presentation of theories: better HTML markup
5876 (including colors), graph views in several sizes; isatool usedir now
5877 provides a proper interface for user theories (via -P option); actual
5878 document preparation based on (PDF)LaTeX is available as well (for
5879 new-style theories only); see isatool doc system for more information;
5881 * native support for Proof General, both for classic Isabelle and
5884 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5885 using the graph browser tool;
5887 * Isabelle manuals now also available as PDF;
5889 * theory loader rewritten from scratch (may not be fully
5890 bug-compatible); old loadpath variable has been replaced by show_path,
5891 add_path, del_path, reset_path functions; new operations such as
5892 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5895 * improved isatool install: option -k creates KDE application icon,
5896 option -p DIR installs standalone binaries;
5898 * added ML_PLATFORM setting (useful for cross-platform installations);
5899 more robust handling of platform specific ML images for SML/NJ;
5901 * the settings environment is now statically scoped, i.e. it is never
5902 created again in sub-processes invoked from isabelle, isatool, or
5905 * path element specification '~~' refers to '$ISABELLE_HOME';
5907 * in locales, the "assumes" and "defines" parts may be omitted if
5910 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5913 * new print_mode "HTML";
5915 * new flag show_tags controls display of tags of theorems (which are
5916 basically just comments that may be attached by some tools);
5918 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5919 mode and goal output format:
5921 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5923 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5925 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5926 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5928 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5930 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5932 * function bind_thms stores lists of theorems (cf. bind_thm);
5934 * new shorthand tactics ftac, eatac, datac, fatac;
5936 * qed (and friends) now accept "" as result name; in that case the
5937 theorem is not stored, but proper checks and presentation of the
5940 * theorem database now also indexes constants "Trueprop", "all",
5941 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5946 ** HOL arithmetic **
5948 * There are now decision procedures for linear arithmetic over nat and
5951 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5952 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5953 are treated as atomic; subformulae not involving type `nat' or `int'
5954 are ignored; quantified subformulae are ignored unless they are
5955 positive universal or negative existential. The tactic has to be
5956 invoked by hand and can be a little bit slow. In particular, the
5957 running time is exponential in the number of occurrences of `min' and
5958 `max', and `-' on `nat'.
5960 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5961 (negated) (in)equalities among the premises and the conclusion into
5962 account (i.e. no compound formulae) and does not know about `min' and
5963 `max', and `-' on `nat'. It is fast and is used automatically by the
5966 NB: At the moment, these decision procedures do not cope with mixed
5967 nat/int formulae where the two parts interact, such as `m < n ==>
5970 * HOL/Numeral provides a generic theory of numerals (encoded
5971 efficiently as bit strings); setup for types nat/int/real is in place;
5972 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5973 int, existing theories and proof scripts may require a few additional
5976 * integer division and remainder can now be performed on constant
5979 * many properties of integer multiplication, division and remainder
5982 * An interface to the Stanford Validity Checker (SVC) is available through the
5983 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5984 are proved automatically. SVC must be installed separately, and its results
5985 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5986 invocation of the underlying oracle). For SVC see
5987 http://verify.stanford.edu/SVC
5989 * IsaMakefile: the HOL-Real target now builds an actual image;
5994 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5995 (in Isabelle/Isar) -- by Gertrud Bauer;
5997 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5998 analysis for assembly languages with subtypes;
6000 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6001 -- avoids syntactic ambiguities and treats state, transition, and
6002 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6003 changed syntax and (many) tactics;
6005 * HOL/inductive: Now also handles more general introduction rules such
6006 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6007 theorems are now maintained within the theory (maintained via the
6010 * HOL/datatype: Now also handles arbitrarily branching datatypes
6011 (using function types) such as
6013 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6015 * HOL/record: record_simproc (part of the default simpset) takes care
6016 of selectors applied to updated records; record_split_tac is no longer
6017 part of the default claset; update_defs may now be removed from the
6018 simpset in many cases; COMPATIBILITY: old behavior achieved by
6020 claset_ref () := claset() addSWrapper record_split_wrapper;
6021 Delsimprocs [record_simproc]
6023 * HOL/typedef: fixed type inference for representing set; type
6024 arguments now have to occur explicitly on the rhs as type constraints;
6026 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6027 names rather than an ML expression;
6029 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6030 supplied later. Program schemes can be defined, such as
6031 "While B C s = (if B s then While B C (C s) else s)"
6032 where the well-founded relation can be chosen after B and C have been given.
6034 * HOL/List: the constructors of type list are now Nil and Cons;
6035 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6036 course, ML tools referring to List.list.op # etc. have to be adapted;
6038 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6039 disabled by default; run isabelle with option -m HOL to get back to
6040 the original Gordon/HOL-style output;
6042 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6043 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6045 * HOL basic syntax simplified (more orthogonal): all variants of
6046 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6047 Eps operator is provided as well: "SOME x. P[x]";
6049 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6051 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6052 thus available for user theories;
6054 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6055 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6058 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6059 several times and then mp;
6064 * the notation <<...>> is now available as a notation for sequences of
6067 * the simplifier is now installed
6069 * the axiom system has been generalized (thanks to Soren Heilmann)
6071 * the classical reasoner now has a default rule database
6076 * new primrec section allows primitive recursive functions to be given
6077 directly (as in HOL) over datatypes and the natural numbers;
6079 * new tactics induct_tac and exhaust_tac for induction (or case
6080 analysis) over datatypes and the natural numbers;
6082 * the datatype declaration of type T now defines the recursor T_rec;
6084 * simplification automatically does freeness reasoning for datatype
6087 * automatic type-inference, with AddTCs command to insert new
6088 type-checking rules;
6090 * datatype introduction rules are now added as Safe Introduction rules
6093 * the syntax "if P then x else y" is now available in addition to
6097 *** Internal programming interfaces ***
6099 * tuned simplifier trace output; new flag debug_simp;
6101 * structures Vartab / Termtab (instances of TableFun) offer efficient
6102 tables indexed by indexname_ord / term_ord (compatible with aconv);
6104 * AxClass.axclass_tac lost the theory argument;
6106 * tuned current_goals_markers semantics: begin / end goal avoids
6107 printing empty lines;
6109 * removed prs and prs_fn hook, which was broken because it did not
6110 include \n in its semantics, forcing writeln to add one
6111 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6112 string -> unit if you really want to output text without newline;
6114 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6115 plain output, interface builders may have to enable 'isabelle_font'
6116 mode to get Isabelle font glyphs as before;
6118 * refined token_translation interface; INCOMPATIBILITY: output length
6119 now of type real instead of int;
6121 * theory loader actions may be traced via new ThyInfo.add_hook
6122 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6123 your own database of information attached to *whole* theories -- as
6124 opposed to intra-theory data slots offered via TheoryDataFun;
6126 * proper handling of dangling sort hypotheses (at last!);
6127 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6128 extra sort hypotheses that can be witnessed from the type signature;
6129 the force_strip_shyps flag is gone, any remaining shyps are simply
6130 left in the theorem (with a warning issued by strip_shyps_warning);
6134 New in Isabelle98-1 (October 1998)
6135 ----------------------------------
6137 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6139 * several changes of automated proof tools;
6141 * HOL: major changes to the inductive and datatype packages, including
6142 some minor incompatibilities of theory syntax;
6144 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6147 * HOL: removed duplicate thms in Arith:
6148 less_imp_add_less should be replaced by trans_less_add1
6149 le_imp_add_le should be replaced by trans_le_add1
6151 * HOL: unary minus is now overloaded (new type constraints may be
6154 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6155 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6156 now taken as an integer constant.
6158 * Pure: ML function 'theory_of' renamed to 'theory';
6164 1. Asm_full_simp_tac is now more aggressive.
6165 1. It will sometimes reorient premises if that increases their power to
6167 2. It does no longer proceed strictly from left to right but may also
6168 rotate premises to achieve further simplification.
6169 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6170 old Asm_full_simp_tac in that it does not rotate premises.
6171 2. The simplifier now knows a little bit about nat-arithmetic.
6173 * Classical reasoner: wrapper mechanism for the classical reasoner now
6174 allows for selected deletion of wrappers, by introduction of names for
6175 wrapper functionals. This implies that addbefore, addSbefore,
6176 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6177 and that adding two tactics with the same name overwrites the first
6178 one (emitting a warning).
6179 type wrapper = (int -> tactic) -> (int -> tactic)
6180 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6181 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6182 delWrapper, delSWrapper: claset * string -> claset
6183 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6185 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6186 semantics; addbefore now affects only the unsafe part of step_tac
6187 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6188 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6191 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6192 compWrapper; added safe wrapper (and access functions for it);
6194 * HOL/split_all_tac is now much faster and fails if there is nothing
6195 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6196 and the names of the automatically generated variables have changed.
6197 split_all_tac has moved within claset() from unsafe wrappers to safe
6198 wrappers, which means that !!-bound variables are split much more
6199 aggressively, and safe_tac and clarify_tac now split such variables.
6200 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6201 Note: the same holds for record_split_tac, which does the job of
6202 split_all_tac for record fields.
6204 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6205 permanently to the default simpset using Addsplits just like
6206 Addsimps. They can be removed via Delsplits just like
6207 Delsimps. Lower-case versions are also available.
6209 * HOL/Simplifier: The rule split_if is now part of the default
6210 simpset. This means that the simplifier will eliminate all occurrences
6211 of if-then-else in the conclusion of a goal. To prevent this, you can
6212 either remove split_if completely from the default simpset by
6213 `Delsplits [split_if]' or remove it in a specific call of the
6214 simplifier using `... delsplits [split_if]'. You can also add/delete
6215 other case splitting rules to/from the default simpset: every datatype
6216 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6217 t is the name of the datatype).
6219 * Classical reasoner / Simplifier combination: new force_tac (and
6220 derivatives Force_tac, force) combines rewriting and classical
6221 reasoning (and whatever other tools) similarly to auto_tac, but is
6222 aimed to solve the given subgoal completely.
6227 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6228 and `goalw': the theory is no longer needed as an explicit argument -
6229 the current theory context is used; assumptions are no longer returned
6230 at the ML-level unless one of them starts with ==> or !!; it is
6231 recommended to convert to these new commands using isatool fixgoal
6232 (backup your sources first!);
6234 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6235 the current theory context, and 'theory' to lookup stored theories;
6237 * new theory section 'locale' for declaring constants, assumptions and
6238 definitions that have local scope;
6240 * new theory section 'nonterminals' for purely syntactic types;
6242 * new theory section 'setup' for generic ML setup functions
6243 (e.g. package initialization);
6245 * the distribution now includes Isabelle icons: see
6246 lib/logo/isabelle-{small,tiny}.xpm;
6248 * isatool install - install binaries with absolute references to
6251 * isatool logo -- create instances of the Isabelle logo (as EPS);
6253 * print mode 'emacs' reserved for Isamode;
6255 * support multiple print (ast) translations per constant name;
6257 * theorems involving oracles are now printed with a suffixed [!];
6262 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6264 * HOL/inductive package reorganized and improved: now supports mutual
6270 oddI "n : EVEN ==> Suc n : ODD"
6271 evenI "n : ODD ==> Suc n : EVEN"
6273 new theorem list "elims" contains an elimination rule for each of the
6274 recursive sets; inductive definitions now handle disjunctive premises
6275 correctly (also ZF);
6277 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6278 "mutual_induct" no longer exists - the induction rule is always
6279 contained in "induct";
6282 * HOL/datatype package re-implemented and greatly improved: now
6283 supports mutually recursive datatypes such as
6286 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6287 | SUM ('a aexp) ('a aexp)
6288 | DIFF ('a aexp) ('a aexp)
6291 'a bexp = LESS ('a aexp) ('a aexp)
6292 | AND ('a bexp) ('a bexp)
6293 | OR ('a bexp) ('a bexp)
6295 as well as indirectly recursive datatypes such as
6298 ('a, 'b) term = Var 'a
6299 | App 'b ((('a, 'b) term) list)
6301 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6302 induction on mutually / indirectly recursive datatypes.
6304 Primrec equations are now stored in theory and can be accessed via
6305 <function_name>.simps.
6309 - Theories using datatypes must now have theory Datatype as an
6311 - The specific <typename>.induct_tac no longer exists - use the
6312 generic induct_tac instead.
6313 - natE has been renamed to nat.exhaust - use exhaust_tac
6314 instead of res_inst_tac ... natE. Note that the variable
6315 names in nat.exhaust differ from the names in natE, this
6316 may cause some "fragile" proofs to fail.
6317 - The theorems split_<typename>_case and split_<typename>_case_asm
6318 have been renamed to <typename>.split and <typename>.split_asm.
6319 - Since default sorts of type variables are now handled correctly,
6320 some datatype definitions may have to be annotated with explicit
6322 - Primrec definitions no longer require function name and type
6323 of recursive argument.
6325 Consider using isatool fixdatatype to adapt your theories and proof
6326 scripts to the new package (backup your sources first!).
6329 * HOL/record package: considerably improved implementation; now
6330 includes concrete syntax for record types, terms, updates; theorems
6331 for surjective pairing and splitting !!-bound record variables; proof
6332 support is as follows:
6334 1) standard conversions (selectors or updates applied to record
6335 constructor terms) are part of the standard simpset;
6337 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6338 made part of standard simpset and claset via addIffs;
6340 3) a tactic for record field splitting (record_split_tac) is part of
6341 the standard claset (addSWrapper);
6343 To get a better idea about these rules you may retrieve them via
6344 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6345 the name of your record type.
6347 The split tactic 3) conceptually simplifies by the following rule:
6349 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6351 Thus any record variable that is bound by meta-all will automatically
6352 blow up into some record constructor term, consequently the
6353 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6354 solve record problems automatically.
6357 * reorganized the main HOL image: HOL/Integ and String loaded by
6358 default; theory Main includes everything;
6360 * automatic simplification of integer sums and comparisons, using cancellation;
6362 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6364 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6366 * many new identities for unions, intersections, set difference, etc.;
6368 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6369 called split_if, split_split, split_sum_case and split_nat_case (to go
6370 with add/delsplits);
6372 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6373 (?x::unit) = (); this is made part of the default simpset, which COULD
6374 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6375 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6376 unit_abs_eta_conv is added in order to counter the effect of
6377 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6380 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6383 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6384 It and 'sym RS equals0D' are now in the default claset, giving automatic
6385 disjointness reasoning but breaking a few old proofs.
6387 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6388 to 'converse' from 'inverse' (for compatibility with ZF and some
6391 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6392 the well-founded relation;
6394 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6395 Compl A. The "Compl" syntax remains available as input syntax for this
6398 * HOL/Update: new theory of function updates:
6399 f(a:=b) == %x. if x=a then b else f x
6400 may also be iterated as in f(a:=b,c:=d,...);
6402 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6405 - new function list_update written xs[i:=v] that updates the i-th
6406 list position. May also be iterated as in xs[i:=a,j:=b,...].
6407 - new function `upt' written [i..j(] which generates the list
6408 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6409 bound write [i..j], which is a shorthand for [i..j+1(].
6410 - new lexicographic orderings and corresponding wellfoundedness theorems.
6413 - removed 'pred' (predecessor) function;
6414 - generalized some theorems about n-1;
6415 - many new laws about "div" and "mod";
6416 - new laws about greatest common divisors (see theory ex/Primes);
6418 * HOL/Relation: renamed the relational operator r^-1 "converse"
6419 instead of "inverse";
6421 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6422 of the multiset ordering;
6424 * directory HOL/Real: a construction of the reals using Dedekind cuts
6425 (not included by default);
6427 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6429 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6430 programs, i.e. different program variables may have different types.
6432 * calling (stac rew i) now fails if "rew" has no effect on the goal
6433 [previously, this check worked only if the rewrite rule was unconditional]
6434 Now rew can involve either definitions or equalities (either == or =).
6439 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6440 only the theorems proved on ZF.ML;
6442 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6443 It and 'sym RS equals0D' are now in the default claset, giving automatic
6444 disjointness reasoning but breaking a few old proofs.
6446 * ZF/Update: new theory of function updates
6447 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6448 may also be iterated as in f(a:=b,c:=d,...);
6450 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6452 * calling (stac rew i) now fails if "rew" has no effect on the goal
6453 [previously, this check worked only if the rewrite rule was unconditional]
6454 Now rew can involve either definitions or equalities (either == or =).
6456 * case_tac provided for compatibility with HOL
6457 (like the old excluded_middle_tac, but with subgoals swapped)
6460 *** Internal programming interfaces ***
6462 * Pure: several new basic modules made available for general use, see
6463 also src/Pure/README;
6465 * improved the theory data mechanism to support encapsulation (data
6466 kind name replaced by private Object.kind, acting as authorization
6467 key); new type-safe user interface via functor TheoryDataFun; generic
6468 print_data function becomes basically useless;
6470 * removed global_names compatibility flag -- all theory declarations
6471 are qualified by default;
6473 * module Pure/Syntax now offers quote / antiquote translation
6474 functions (useful for Hoare logic etc. with implicit dependencies);
6475 see HOL/ex/Antiquote for an example use;
6477 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6480 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6483 * Display.print_goals function moved to Locale.print_goals;
6485 * standard print function for goals supports current_goals_markers
6486 variable for marking begin of proof, end of proof, start of goal; the
6487 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6488 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6493 New in Isabelle98 (January 1998)
6494 --------------------------------
6496 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6498 * changed lexical syntax of terms / types: dots made part of long
6499 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6501 * simpset (and claset) reference variable replaced by functions
6502 simpset / simpset_ref;
6504 * no longer supports theory aliases (via merge) and non-trivial
6505 implicit merge of thms' signatures;
6507 * most internal names of constants changed due to qualified names;
6509 * changed Pure/Sequence interface (see Pure/seq.ML);
6512 *** General Changes ***
6514 * hierachically structured name spaces (for consts, types, axms, thms
6515 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6516 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6517 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6518 long_names for fully qualified output names; NOTE: ML programs
6519 (special tactics, packages etc.) referring to internal names may have
6520 to be adapted to cope with fully qualified names; in case of severe
6521 backward campatibility problems try setting 'global_names' at compile
6522 time to have enrything declared within a flat name space; one may also
6523 fine tune name declarations in theories via the 'global' and 'local'
6526 * reimplemented the implicit simpset and claset using the new anytype
6527 data filed in signatures; references simpset:simpset ref etc. are
6528 replaced by functions simpset:unit->simpset and
6529 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6530 to patch your ML files accordingly;
6532 * HTML output now includes theory graph data for display with Java
6533 applet or isatool browser; data generated automatically via isatool
6534 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6536 * defs may now be conditional; improved rewrite_goals_tac to handle
6537 conditional equations;
6539 * defs now admits additional type arguments, using TYPE('a) syntax;
6541 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6542 creates a new theory node; implicit merge of thms' signatures is
6543 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6544 transfer:theory->thm->thm in (rare) cases;
6546 * improved handling of draft signatures / theories; draft thms (and
6547 ctyps, cterms) are automatically promoted to real ones;
6549 * slightly changed interfaces for oracles: admit many per theory, named
6550 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6552 * print_goals: optional output of const types (set show_consts and
6555 * improved output of warnings (###) and errors (***);
6557 * subgoal_tac displays a warning if the new subgoal has type variables;
6559 * removed old README and Makefiles;
6561 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6563 * removed obsolete init_pps and init_database;
6565 * deleted the obsolete tactical STATE, which was declared by
6566 fun STATE tacfun st = tacfun st st;
6568 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6569 (which abbreviates $HOME);
6571 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6572 use isatool fixseq to adapt your ML programs (this works for fully
6573 qualified references to the Sequence structure only!);
6575 * use_thy no longer requires writable current directory; it always
6576 reloads .ML *and* .thy file, if either one is out of date;
6579 *** Classical Reasoner ***
6581 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6582 tactics that use classical reasoning to simplify a subgoal without
6583 splitting it into several subgoals;
6585 * Safe_tac: like safe_tac but uses the default claset;
6590 * added simplification meta rules:
6591 (asm_)(full_)simplify: simpset -> thm -> thm;
6593 * simplifier.ML no longer part of Pure -- has to be loaded by object
6596 * added prems argument to simplification procedures;
6598 * HOL, FOL, ZF: added infix function `addsplits':
6599 instead of `<simpset> setloop (split_tac <thms>)'
6600 you can simply write `<simpset> addsplits <thms>'
6605 * TYPE('a) syntax for type reflection terms;
6607 * no longer handles consts with name "" -- declare as 'syntax' instead;
6609 * pretty printer: changed order of mixfix annotation preference (again!);
6611 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6616 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6617 with `addloop' of the simplifier to faciliate case splitting in premises.
6619 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6621 * HOL/Auth: new protocol proofs including some for the Internet
6624 * HOL/Map: new theory of `maps' a la VDM;
6626 * HOL/simplifier: simplification procedures nat_cancel_sums for
6627 cancelling out common nat summands from =, <, <= (in)equalities, or
6628 differences; simplification procedures nat_cancel_factor for
6629 cancelling common factor from =, <, <= (in)equalities over natural
6630 sums; nat_cancel contains both kinds of procedures, it is installed by
6631 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6633 * HOL/simplifier: terms of the form
6634 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6636 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6637 and those of the form
6638 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6640 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6643 Each datatype `t' now comes with a theorem `split_t_case' of the form
6645 P(t_case f1 ... fn x) =
6646 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6648 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6651 and a theorem `split_t_case_asm' of the form
6653 P(t_case f1 ... fn x) =
6654 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6656 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6658 which can be added to a simpset via `addsplits'. The existing theorems
6659 expand_list_case and expand_option_case have been renamed to
6660 split_list_case and split_option_case.
6663 - `pred n' is automatically converted to `n-1'.
6664 Users are strongly encouraged not to use `pred' any longer,
6665 because it will disappear altogether at some point.
6666 - Users are strongly encouraged to write "0 < n" rather than
6667 "n ~= 0". Theorems and proof tools have been modified towards this
6671 the function "set_of_list" has been renamed "set" (and its theorems too);
6672 the function "nth" now takes its arguments in the reverse order and
6673 has acquired the infix notation "!" as in "xs!n".
6675 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6677 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6678 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6680 * HOL/record: extensible records with schematic structural subtyping
6681 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6682 still lacks various theorems and concrete record syntax;
6687 * removed "axioms" and "generated by" sections;
6689 * replaced "ops" section by extended "consts" section, which is capable of
6690 handling the continuous function space "->" directly;
6693 . proves theorems immediately and stores them in the theory,
6694 . creates hierachical name space,
6695 . now uses normal mixfix annotations (instead of cinfix...),
6696 . minor changes to some names and values (for consistency),
6697 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6698 . separator between mutual domain defs: changed "," to "and",
6699 . improved handling of sort constraints; now they have to
6700 appear on the left-hand side of the equations only;
6702 * fixed LAM <x,y,zs>.b syntax;
6704 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6705 adm (%x. P (t x)), where P is chainfinite and t continuous;
6710 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6711 with `addloop' of the simplifier to faciliate case splitting in premises.
6713 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6714 in HOL, they strip ALL and --> from proved theorems;
6718 New in Isabelle94-8 (May 1997)
6719 ------------------------------
6721 *** General Changes ***
6723 * new utilities to build / run / maintain Isabelle etc. (in parts
6724 still somewhat experimental); old Makefiles etc. still functional;
6726 * new 'Isabelle System Manual';
6728 * INSTALL text, together with ./configure and ./build scripts;
6730 * reimplemented type inference for greater efficiency, better error
6731 messages and clean internal interface;
6733 * prlim command for dealing with lots of subgoals (an easier way of
6734 setting goals_limit);
6739 * supports alternative (named) syntax tables (parser and pretty
6740 printer); internal interface is provided by add_modesyntax(_i);
6742 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6743 be used in conjunction with the Isabelle symbol font; uses the
6744 "symbols" syntax table;
6746 * added token_translation interface (may translate name tokens in
6747 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6748 the current print_mode); IMPORTANT: user print translation functions
6749 are responsible for marking newly introduced bounds
6750 (Syntax.mark_boundT);
6752 * token translations for modes "xterm" and "xterm_color" that display
6753 names in bold, underline etc. or colors (which requires a color
6756 * infixes may now be declared with names independent of their syntax;
6758 * added typed_print_translation (like print_translation, but may
6759 access type of constant);
6762 *** Classical Reasoner ***
6764 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6765 some limitations. Blast_tac...
6766 + ignores addss, addbefore, addafter; this restriction is intrinsic
6767 + ignores elimination rules that don't have the correct format
6768 (the conclusion MUST be a formula variable)
6769 + ignores types, which can make HOL proofs fail
6770 + rules must not require higher-order unification, e.g. apply_type in ZF
6771 [message "Function Var's argument not a bound variable" relates to this]
6772 + its proof strategy is more general but can actually be slower
6774 * substitution with equality assumptions no longer permutes other
6777 * minor changes in semantics of addafter (now called addaltern); renamed
6778 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6779 (and access functions for it);
6781 * improved combination of classical reasoner and simplifier:
6782 + functions for handling clasimpsets
6783 + improvement of addss: now the simplifier is called _after_ the
6785 + safe variant of addss called addSss: uses safe simplifications
6786 _during_ the safe steps. It is more complete as it allows multiple
6787 instantiations of unknowns (e.g. with slow_tac).
6791 * added interface for simplification procedures (functions that
6792 produce *proven* rewrite rules on the fly, depending on current
6795 * ordering on terms as parameter (used for ordered rewriting);
6797 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6799 * the solver is now split into a safe and an unsafe part.
6800 This should be invisible for the normal user, except that the
6801 functions setsolver and addsolver have been renamed to setSolver and
6802 addSolver; added safe_asm_full_simp_tac;
6807 * a generic induction tactic `induct_tac' which works for all datatypes and
6808 also for type `nat';
6810 * a generic case distinction tactic `exhaust_tac' which works for all
6811 datatypes and also for type `nat';
6813 * each datatype comes with a function `size';
6815 * patterns in case expressions allow tuple patterns as arguments to
6816 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6818 * primrec now also works with type nat;
6820 * recdef: a new declaration form, allows general recursive functions to be
6821 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6823 * the constant for negation has been renamed from "not" to "Not" to
6824 harmonize with FOL, ZF, LK, etc.;
6826 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6829 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6831 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6832 problems in commutative rings, using axiomatic type classes for + and *;
6834 * more examples in HOL/MiniML and HOL/Auth;
6836 * more default rewrite rules for quantifiers, union/intersection;
6838 * a new constant `arbitrary == @x.False';
6840 * HOLCF/IOA replaces old HOL/IOA;
6842 * HOLCF changes: derived all rules and arities
6843 + axiomatic type classes instead of classes
6844 + typedef instead of faking type definitions
6845 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6846 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6847 + eliminated the types void, one, tr
6848 + use unit lift and bool lift (with translations) instead of one and tr
6849 + eliminated blift from Lift3.thy (use Def instead of blift)
6850 all eliminated rules are derived as theorems --> no visible changes ;
6855 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6856 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6857 as ZF_cs addSIs [equalityI];
6861 New in Isabelle94-7 (November 96)
6862 ---------------------------------
6864 * allowing negative levels (as offsets) in prlev and choplev;
6866 * super-linear speedup for large simplifications;
6868 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6869 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6870 FAIL); can suppress it using the command Delsimps (ex_simps @
6871 all_simps); De Morgan laws are also now included, by default;
6873 * improved printing of ==> : ~:
6875 * new object-logic "Sequents" adds linear logic, while replacing LK
6876 and Modal (thanks to Sara Kalvala);
6878 * HOL/Auth: correctness proofs for authentication protocols;
6880 * HOL: new auto_tac combines rewriting and classical reasoning (many
6881 examples on HOL/Auth);
6883 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6884 the rewriter and classical reasoner simultaneously;
6886 * function uresult no longer returns theorems in "standard" format;
6887 regain previous version by: val uresult = standard o uresult;
6894 * oracles -- these establish an interface between Isabelle and trusted
6895 external reasoners, which may deliver results as theorems;
6897 * proof objects (in particular record all uses of oracles);
6899 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6901 * "constdefs" section in theory files;
6903 * "primrec" section (HOL) no longer requires names;
6905 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6912 * reduced space requirements;
6914 * automatic HTML generation from theories;
6916 * theory files no longer require "..." (quotes) around most types;
6918 * new examples, including two proofs of the Church-Rosser theorem;
6920 * non-curried (1994) version of HOL is no longer distributed;
6927 * greatly reduced space requirements;
6929 * theory files (.thy) no longer require \...\ escapes at line breaks;
6931 * searchable theorem database (see the section "Retrieving theorems" on
6932 page 8 of the Reference Manual);
6934 * new examples, including Grabczewski's monumental case study of the
6937 * The previous version of HOL renamed to Old_HOL;
6939 * The new version of HOL (previously called CHOL) uses a curried syntax
6940 for functions. Application looks like f a b instead of f(a,b);
6942 * Mutually recursive inductive definitions finally work in HOL;
6944 * In ZF, pattern-matching on tuples is now available in all abstractions and
6945 translates to the operator "split";
6952 * new infix operator, addss, allowing the classical reasoner to
6953 perform simplification at each step of its search. Example:
6954 fast_tac (cs addss ss)
6956 * a new logic, CHOL, the same as HOL, but with a curried syntax
6957 for functions. Application looks like f a b instead of f(a,b). Also pairs
6958 look like (a,b) instead of <a,b>;
6960 * PLEASE NOTE: CHOL will eventually replace HOL!
6962 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6963 It translates to the operator "split". A new theory of integers is available;
6965 * In ZF, integer numerals now denote two's-complement binary integers.
6966 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6968 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6969 of the Axiom of Choice;
6976 * Significantly faster resolution;
6978 * the different sections in a .thy file can now be mixed and repeated
6981 * Database of theorems for FOL, HOL and ZF. New
6982 commands including qed, qed_goal and bind_thm store theorems in the database.
6984 * Simple database queries: return a named theorem (get_thm) or all theorems of
6985 a given theory (thms_of), or find out what theory a theorem was proved in
6988 * Bugs fixed in the inductive definition and datatype packages;
6990 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6991 and HOL_dup_cs obsolete;
6993 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6996 * Simpler definition of function space in ZF;
6998 * new results about cardinal and ordinal arithmetic in ZF;
7000 * 'subtype' facility in HOL for introducing new types as subsets of existing
7003 :mode=text:wrap=hard:maxLineLen=72: