1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Schematic theorem statements need to be explicitly markup as such,
10 via commands 'schematic_lemma', 'schematic_theorem',
11 'schematic_corollary'. Thus the relevance of the proof is made
12 syntactically clear, which impacts performance in a parallel or
13 asynchronous interactive environment. Minor INCOMPATIBILITY.
15 * Authentic syntax for *all* logical entities (type classes, type
16 constructors, term constants): provides simple and robust
17 correspondence between formal entities and concrete syntax. Within
18 the parse tree / AST representations, "constants" are decorated by
19 their category (class, type, const) and spelled out explicitly with
20 their full internal name.
22 Substantial INCOMPATIBILITY concerning low-level syntax declarations
23 and translations (translation rules and translation functions in ML).
24 Some hints on upgrading:
26 - Many existing uses of 'syntax' and 'translations' can be replaced
27 by more modern 'type_notation', 'notation' and 'abbreviation',
28 which are independent of this issue.
30 - 'translations' require markup within the AST; the term syntax
31 provides the following special forms:
33 CONST c -- produces syntax version of constant c from context
34 XCONST c -- literally c, checked as constant from context
35 c -- literally c, if declared by 'syntax'
37 Plain identifiers are treated as AST variables -- occasionally the
38 system indicates accidental variables via the error "rhs contains
41 Type classes and type constructors are marked according to their
42 concrete syntax. Some old translations rules need to be written
43 for the "type" category, using type constructor application
44 instead of pseudo-term application of the default category
47 - 'parse_translation' etc. in ML may use the following
50 @{class_syntax c} -- type class c within parse tree / AST
51 @{term_syntax c} -- type constructor c within parse tree / AST
52 @{const_syntax c} -- ML version of "CONST c" above
53 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
55 - Literal types within 'typed_print_translations', i.e. those *not*
56 represented as pseudo-terms are represented verbatim. Use @{class
57 c} or @{type_name c} here instead of the above syntax
60 Note that old non-authentic syntax was based on unqualified base
61 names, so all of the above "constant" names would coincide. Recall
62 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
63 diagnose syntax problems.
65 * Type constructors admit general mixfix syntax, not just infix.
67 * Concrete syntax may be attached to local entities without a proof
68 body, too. This works via regular mixfix annotations for 'fix',
69 'def', 'obtain' etc. or via the explicit 'write' command, which is
70 similar to the 'notation' command in theory specifications.
72 * Use of cumulative prems via "!" in some proof methods has been
73 discontinued (legacy feature).
75 * References 'trace_simp' and 'debug_simp' have been replaced by
76 configuration options stored in the context. Enabling tracing
77 (the case of debugging is similar) in proofs works via
79 using [[trace_simp=true]]
81 Tracing is then active for all invocations of the simplifier
82 in subsequent goal refinement steps. Tracing may also still be
83 enabled or disabled via the ProofGeneral settings menu.
85 * Separate commands 'hide_class', 'hide_type', 'hide_const',
86 'hide_fact' replace the former 'hide' KIND command. Minor
92 * Predicates of locales introduces by classes carry a mandatory "class"
93 prefix. INCOMPATIBILITY.
95 * 'code_reflect' allows to incorporate generated ML code into
96 runtime environment; replaces immature code_datatype antiquotation.
99 * Empty class specifications observe default sort. INCOMPATIBILITY.
101 * Old 'axclass' has been discontinued. Use 'class' instead. INCOMPATIBILITY.
103 * Code generator: simple concept for abstract datatypes obeying invariants.
105 * Local theory specifications may depend on extra type variables that
106 are not present in the result type -- arguments TYPE('a) :: 'a itself
107 are added internally. For example:
109 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
111 * Code generator: details of internal data cache have no impact on
112 the user space functionality any longer.
114 * Methods unfold_locales and intro_locales ignore non-locale subgoals. This
115 is more appropriate for interpretations with 'where'. INCOMPATIBILITY.
117 * Discontinued unnamed infix syntax (legacy feature for many years) --
118 need to specify constant name and syntax separately. Internal ML
119 datatype constructors have been renamed from InfixName to Infix etc.
120 Minor INCOMPATIBILITY.
122 * Command 'example_proof' opens an empty proof body. This allows to
123 experiment with Isar, without producing any persistent result.
125 * Commands 'type_notation' and 'no_type_notation' declare type syntax
126 within a local theory context, with explicit checking of the
127 constructors involved (in contrast to the raw 'syntax' versions).
129 * Commands 'types' and 'typedecl' now work within a local theory
130 context -- without introducing dependencies on parameters or
131 assumptions, which is not possible in Isabelle/Pure.
133 * Command 'defaultsort' is renamed to 'default_sort', it works within
134 a local theory context. Minor INCOMPATIBILITY.
136 * Proof terms: Type substitutions on proof constants now use canonical
137 order of type variables. INCOMPATIBILITY: Tools working with proof
138 terms may need to be adapted.
143 * Theory 'Finite_Set': various folding_* locales facilitate the application
144 of the various fold combinators on finite sets.
146 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
147 provides abstract red-black tree type which is backed by RBT_Impl
148 as implementation. INCOMPATIBILTY.
150 * Command 'typedef' now works within a local theory context -- without
151 introducing dependencies on parameters or assumptions, which is not
152 possible in Isabelle/Pure/HOL. Note that the logical environment may
153 contain multiple interpretations of local typedefs (with different
154 non-emptiness proofs), even in a global theory context.
156 * Theory Library/Coinductive_List has been removed -- superceded by
157 AFP/thys/Coinductive.
159 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
160 Min, Max from theory Finite_Set. INCOMPATIBILITY.
162 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
165 * New set of rules "ac_simps" provides combined assoc / commute rewrites
166 for all interpretations of the appropriate generic locales.
168 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
169 into theories "Rings" and "Fields"; for more appropriate and more
170 consistent names suitable for name prefixes within the HOL theories.
173 * Some generic constants have been put to appropriate theories:
174 * less_eq, less: Orderings
175 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
176 * inverse, divide: Rings
179 * More consistent naming of type classes involving orderings (and lattices):
181 lower_semilattice ~> semilattice_inf
182 upper_semilattice ~> semilattice_sup
184 dense_linear_order ~> dense_linorder
186 pordered_ab_group_add ~> ordered_ab_group_add
187 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
188 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
189 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
190 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
191 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
192 pordered_cancel_semiring ~> ordered_cancel_semiring
193 pordered_comm_monoid_add ~> ordered_comm_monoid_add
194 pordered_comm_ring ~> ordered_comm_ring
195 pordered_comm_semiring ~> ordered_comm_semiring
196 pordered_ring ~> ordered_ring
197 pordered_ring_abs ~> ordered_ring_abs
198 pordered_semiring ~> ordered_semiring
200 ordered_ab_group_add ~> linordered_ab_group_add
201 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
202 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
203 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
204 ordered_field ~> linordered_field
205 ordered_field_no_lb ~> linordered_field_no_lb
206 ordered_field_no_ub ~> linordered_field_no_ub
207 ordered_field_dense_linear_order ~> dense_linordered_field
208 ordered_idom ~> linordered_idom
209 ordered_ring ~> linordered_ring
210 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
211 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
212 ordered_ring_strict ~> linordered_ring_strict
213 ordered_semidom ~> linordered_semidom
214 ordered_semiring ~> linordered_semiring
215 ordered_semiring_1 ~> linordered_semiring_1
216 ordered_semiring_1_strict ~> linordered_semiring_1_strict
217 ordered_semiring_strict ~> linordered_semiring_strict
219 The following slightly odd type classes have been moved to
220 a separate theory Library/Lattice_Algebras.thy:
222 lordered_ab_group_add ~> lattice_ab_group_add
223 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
224 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
225 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
226 lordered_ring ~> lattice_ring
230 * Refined field classes:
231 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
232 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
233 * numerous lemmas have been ported from field to division_ring;
236 * Refined algebra theorem collections:
237 * dropped theorem group group_simps, use algebra_simps instead;
238 * dropped theorem group ring_simps, use field_simps instead;
239 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
240 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
243 * Theory Finite_Set and List: some lemmas have been generalized from
246 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
247 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
248 inter_Inter_fold_inter ~> inf_Inf_fold_inf
249 union_Union_fold_union ~> sup_Sup_fold_sup
250 Inter_fold_inter ~> Inf_fold_inf
251 Union_fold_union ~> Sup_fold_sup
252 inter_INTER_fold_inter ~> inf_INFI_fold_inf
253 union_UNION_fold_union ~> sup_SUPR_fold_sup
254 INTER_fold_inter ~> INFI_fold_inf
255 UNION_fold_union ~> SUPR_fold_sup
257 * Theory Complete_Lattice: lemmas top_def and bot_def have been
258 replaced by the more convenient lemmas Inf_empty and Sup_empty.
259 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
260 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
261 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
262 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
264 * HOLogic.strip_psplit: types are returned in syntactic order, similar
265 to other strip and tuple operations. INCOMPATIBILITY.
267 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
268 * pointwise ordering is instance of class order with standard syntax <= and <;
269 * multiset ordering has syntax <=# and <#; partial order properties are provided
270 by means of interpretation with prefix multiset_order;
271 * less duplication, less historical organization of sections,
272 conversion from associations lists to multisets, rudimentary code generation;
273 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
276 * Code generation: ML and OCaml code is decorated with signatures.
278 * Theory List: added transpose.
280 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
281 clash with new theory Quotient in Main HOL.
283 * Library/Nat_Bijection.thy is a collection of bijective functions
284 between nat and other types, which supersedes the older libraries
285 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
288 Nat_Int_Bij.nat2_to_nat ~> prod_encode
289 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
290 Nat_Int_Bij.int_to_nat_bij ~> int_encode
291 Nat_Int_Bij.nat_to_int_bij ~> int_decode
292 Countable.pair_encode ~> prod_encode
293 NatIso.prod2nat ~> prod_encode
294 NatIso.nat2prod ~> prod_decode
295 NatIso.sum2nat ~> sum_encode
296 NatIso.nat2sum ~> sum_decode
297 NatIso.list2nat ~> list_encode
298 NatIso.nat2list ~> list_decode
299 NatIso.set2nat ~> set_encode
300 NatIso.nat2set ~> set_decode
303 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
304 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
305 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
306 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
307 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
308 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
309 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
310 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
311 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
312 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
313 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
314 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
315 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
320 * Sorts.certify_sort and derived "cert" operations for types and terms
321 no longer minimize sorts. Thus certification at the boundary of the
322 inference kernel becomes invariant under addition of class relations,
323 which is an important monotonicity principle. Sorts are now minimized
324 in the syntax layer only, at the boundary between the end-user and the
325 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
326 explicitly in rare situations.
328 * Antiquotations for basic formal entities:
330 @{class NAME} -- type class
331 @{class_syntax NAME} -- syntax representation of the above
333 @{type_name NAME} -- logical type
334 @{type_abbrev NAME} -- type abbreviation
335 @{nonterminal NAME} -- type of concrete syntactic category
336 @{type_syntax NAME} -- syntax representation of any of the above
338 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
339 @{const_abbrev NAME} -- abbreviated constant
340 @{const_syntax NAME} -- syntax representation of any of the above
342 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
343 syntax constant (cf. 'syntax' command).
345 * Antiquotation @{make_string} inlines a function to print arbitrary
346 values similar to the ML toplevel. The result is compiler dependent
347 and may fall back on "?" in certain situations.
349 * Renamed old-style Drule.standard to Drule.export_without_context, to
350 emphasize that this is in no way a standard operation.
353 * Curried take and drop in library.ML; negative length is interpreted
354 as infinity (as in chop). INCOMPATIBILITY.
356 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
357 usual for resolution. Rare INCOMPATIBILITY.
359 * Discontinued old TheoryDataFun with its copy/init operation -- data
360 needs to be pure. Functor Theory_Data_PP retains the traditional
361 Pretty.pp argument to merge, which is absent in the standard
364 * Renamed varify/unvarify operations to varify_global/unvarify_global
365 to emphasize that these only work in a global situation (which is
368 * Configuration options now admit dynamic default values, depending on
369 the context or even global references.
374 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
375 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
376 proof terms are enabled unconditionally in the new HOL-Proofs image.
378 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
379 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
382 * Old lib/scripts/polyml-platform is superseded by the
383 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
384 variant, even on a 64 bit machine. The following example setting
385 prefers 64 bit if available:
387 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
391 New in Isabelle2009-1 (December 2009)
392 -------------------------------------
396 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
397 one backslash should be used, even in ML sources.
402 * Locale interpretation propagates mixins along the locale hierarchy.
403 The currently only available mixins are the equations used to map
404 local definitions to terms of the target domain of an interpretation.
406 * Reactivated diagnostic command 'print_interps'. Use "print_interps
407 loc" to print all interpretations of locale "loc" in the theory.
408 Interpretations in proofs are not shown.
410 * Thoroughly revised locales tutorial. New section on conditional
413 * On instantiation of classes, remaining undefined class parameters
414 are formally declared. INCOMPATIBILITY.
417 *** Document preparation ***
419 * New generalized style concept for printing terms: @{foo (style) ...}
420 instead of @{foo_style style ...} (old form is still retained for
421 backward compatibility). Styles can be also applied for
422 antiquotations prop, term_type and typeof.
427 * New proof method "smt" for a combination of first-order logic with
428 equality, linear and nonlinear (natural/integer/real) arithmetic, and
429 fixed-size bitvectors; there is also basic support for higher-order
430 features (esp. lambda abstractions). It is an incomplete decision
431 procedure based on external SMT solvers using the oracle mechanism;
432 for the SMT solver Z3, this method is proof-producing. Certificates
433 are provided to avoid calling the external solvers solely for
434 re-checking proofs. Due to a remote SMT service there is no need for
435 installing SMT solvers locally. See src/HOL/SMT.
437 * New commands to load and prove verification conditions generated by
438 the Boogie program verifier or derived systems (e.g. the Verifying C
439 Compiler (VCC) or Spec#). See src/HOL/Boogie.
441 * New counterexample generator tool 'nitpick' based on the Kodkod
442 relational model finder. See src/HOL/Tools/Nitpick and
443 src/HOL/Nitpick_Examples.
445 * New commands 'code_pred' and 'values' to invoke the predicate
446 compiler and to enumerate values of inductive predicates.
448 * A tabled implementation of the reflexive transitive closure.
450 * New implementation of quickcheck uses generic code generator;
451 default generators are provided for all suitable HOL types, records
452 and datatypes. Old quickcheck can be re-activated importing theory
453 Library/SML_Quickcheck.
455 * New testing tool Mirabelle for automated proof tools. Applies
456 several tools and tactics like sledgehammer, metis, or quickcheck, to
457 every proof step in a theory. To be used in batch mode via the
460 * New proof method "sos" (sum of squares) for nonlinear real
461 arithmetic (originally due to John Harison). It requires theory
462 Library/Sum_Of_Squares. It is not a complete decision procedure but
463 works well in practice on quantifier-free real arithmetic with +, -,
464 *, ^, =, <= and <, i.e. boolean combinations of equalities and
465 inequalities between polynomials. It makes use of external
466 semidefinite programming solvers. Method "sos" generates a
467 certificate that can be pasted into the proof thus avoiding the need
468 to call an external tool every time the proof is checked. See
469 src/HOL/Library/Sum_Of_Squares.
471 * New method "linarith" invokes existing linear arithmetic decision
474 * New command 'atp_minimal' reduces result produced by Sledgehammer.
476 * New Sledgehammer option "Full Types" in Proof General settings menu.
477 Causes full type information to be output to the ATPs. This slows
478 ATPs down considerably but eliminates a source of unsound "proofs"
481 * New method "metisFT": A version of metis that uses full type
482 information in order to avoid failures of proof reconstruction.
484 * New evaluator "approximate" approximates an real valued term using
485 the same method as the approximation method.
487 * Method "approximate" now supports arithmetic expressions as
488 boundaries of intervals and implements interval splitting and Taylor
491 * ML antiquotation @{code_datatype} inserts definition of a datatype
492 generated by the code generator; e.g. see src/HOL/Predicate.thy.
494 * New theory SupInf of the supremum and infimum operators for sets of
497 * New theory Probability, which contains a development of measure
498 theory, eventually leading to Lebesgue integration and probability.
500 * Extended Multivariate Analysis to include derivation and Brouwer's
503 * Reorganization of number theory, INCOMPATIBILITY:
504 - new number theory development for nat and int, in theories Divides
505 and GCD as well as in new session Number_Theory
506 - some constants and facts now suffixed with _nat and _int
508 - former session NumberTheory now named Old_Number_Theory, including
509 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
510 - moved theory Pocklington from src/HOL/Library to
511 src/HOL/Old_Number_Theory
513 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
514 lcm of finite and infinite sets. It is shown that they form a complete
517 * Class semiring_div requires superclass no_zero_divisors and proof of
518 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
519 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
520 generalized to class semiring_div, subsuming former theorems
521 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
522 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
525 * Refinements to lattice classes and sets:
526 - less default intro/elim rules in locale variant, more default
527 intro/elim rules in class variant: more uniformity
528 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
530 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
532 - renamed ACI to inf_sup_aci
533 - new class "boolean_algebra"
534 - class "complete_lattice" moved to separate theory
535 "Complete_Lattice"; corresponding constants (and abbreviations)
536 renamed and with authentic syntax:
537 Set.Inf ~> Complete_Lattice.Inf
538 Set.Sup ~> Complete_Lattice.Sup
539 Set.INFI ~> Complete_Lattice.INFI
540 Set.SUPR ~> Complete_Lattice.SUPR
541 Set.Inter ~> Complete_Lattice.Inter
542 Set.Union ~> Complete_Lattice.Union
543 Set.INTER ~> Complete_Lattice.INTER
544 Set.UNION ~> Complete_Lattice.UNION
545 - authentic syntax for
548 - mere abbreviations:
551 Set.inter (for inf, formerly Set.Int)
552 Set.union (for sup, formerly Set.Un)
553 Complete_Lattice.Inter (for Inf)
554 Complete_Lattice.Union (for Sup)
555 Complete_Lattice.INTER (for INFI)
556 Complete_Lattice.UNION (for SUPR)
557 - object-logic definitions as far as appropriate
559 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
560 Un_subset_iff are explicitly deleted as default simp rules; then also
561 their lattice counterparts le_inf_iff and le_sup_iff have to be
562 deleted to achieve the desired effect.
564 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
565 rules by default any longer; the same applies to min_max.inf_absorb1
566 etc. INCOMPATIBILITY.
568 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
569 pred_set_conv by default. INCOMPATIBILITY.
571 * Power operations on relations and functions are now one dedicated
572 constant "compow" with infix syntax "^^". Power operation on
573 multiplicative monoids retains syntax "^" and is now defined generic
574 in class power. INCOMPATIBILITY.
576 * Relation composition "R O S" now has a more standard argument order:
577 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
578 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
579 break, since the O_assoc rule was not rewritten like this. Fix using
580 O_assoc[symmetric]. The same applies to the curried version "R OO S".
582 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
583 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
586 * Most rules produced by inductive and datatype package have mandatory
587 prefixes. INCOMPATIBILITY.
589 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
590 the attribute of the same name. Each of the theorems in the list
591 DERIV_intros assumes composition with an additional function and
592 matches a variable to the derivative, which has to be solved by the
593 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
594 of most elementary terms. Former Maclauren.DERIV_tac and
595 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
598 * Code generator attributes follow the usual underscore convention:
599 code_unfold replaces code unfold
600 code_post replaces code post
605 sizechange -> size_change
606 induct_scheme -> induction_schema
609 * Discontinued abbreviation "arbitrary" of constant "undefined".
610 INCOMPATIBILITY, use "undefined" directly.
613 Suc_eq_add_numeral_1 -> Suc_eq_plus1
614 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
615 Suc_plus1 -> Suc_eq_plus1
616 *anti_sym -> *antisym*
617 vector_less_eq_def -> vector_le_def
620 * Added theorem List.map_map as [simp]. Removed List.map_compose.
623 * Removed predicate "M hassize n" (<--> card M = n & finite M).
629 * Theory Representable defines a class "rep" of domains that are
630 representable (via an ep-pair) in the universal domain type "udom".
631 Instances are provided for all type constructors defined in HOLCF.
633 * The 'new_domain' command is a purely definitional version of the
634 domain package, for representable domains. Syntax is identical to the
635 old domain package. The 'new_domain' package also supports indirect
636 recursion using previously-defined type constructors. See
637 src/HOLCF/ex/New_Domain.thy for examples.
639 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
640 on the left-hand side of an equation, and then performs
641 simplification. Rewriting is done using rules declared with the
642 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
643 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
645 * The pattern-match compiler in 'fixrec' can now handle constructors
646 with HOL function types. Pattern-match combinators for the Pair
647 constructor are pre-configured.
649 * The 'fixrec' package now produces better fixed-point induction rules
650 for mutually-recursive definitions: Induction rules have conclusions
651 of the form "P foo bar" instead of "P <foo, bar>".
653 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
654 been renamed to "below". The name "below" now replaces "less" in many
655 theorem names. (Legacy theorem names using "less" are still supported
658 * The 'fixrec' package now supports "bottom patterns". Bottom
659 patterns can be used to generate strictness rules, or to make
660 functions more strict (much like the bang-patterns supported by the
661 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
667 * Support for Poly/ML 5.3.0, with improved reporting of compiler
668 errors and run-time exceptions, including detailed source positions.
670 * Structure Name_Space (formerly NameSpace) now manages uniquely
671 identified entries, with some additional information such as source
672 position, logical grouping etc.
674 * Theory and context data is now introduced by the simplified and
675 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
676 to be pure, but the old TheoryDataFun for mutable data (with explicit
677 copy operation) is still available for some time.
679 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
680 provides a high-level programming interface to synchronized state
681 variables with atomic update. This works via pure function
682 application within a critical section -- its runtime should be as
683 short as possible; beware of deadlocks if critical code is nested,
684 either directly or indirectly via other synchronized variables!
686 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
687 wraps raw ML references, explicitly indicating their non-thread-safe
688 behaviour. The Isar toplevel keeps this structure open, to
689 accommodate Proof General as well as quick and dirty interactive
690 experiments with references.
692 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
693 parallel tactical reasoning.
695 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
696 are similar to SUBPROOF, but are slightly more flexible: only the
697 specified parts of the subgoal are imported into the context, and the
698 body tactic may introduce new subgoals and schematic variables.
700 * Old tactical METAHYPS, which does not observe the proof context, has
701 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
702 or Subgoal.FOCUS etc.
704 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
705 functors have their own ML name space there is no point to mark them
706 separately.) Minor INCOMPATIBILITY.
708 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
710 * Renamed several structures FooBar to Foo_Bar. Occasional,
713 * Operations of structure Skip_Proof no longer require quick_and_dirty
714 mode, which avoids critical setmp.
716 * Eliminated old Attrib.add_attributes, Method.add_methods and related
717 combinators for "args". INCOMPATIBILITY, need to use simplified
718 Attrib/Method.setup introduced in Isabelle2009.
720 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
721 back on global_simpset_of, global_claset_of, global_clasimpset_of as
722 last resort. INCOMPATIBILITY.
724 * Display.pretty_thm now requires a proper context (cf. former
725 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
726 or even Display.pretty_thm_without_context as last resort.
729 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
730 Syntax.pretty_typ/term directly, preferably with proper context
731 instead of global theory.
736 * Further fine tuning of parallel proof checking, scales up to 8 cores
737 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
740 * Support for additional "Isabelle components" via etc/components, see
741 also the system manual.
743 * The isabelle makeall tool now operates on all components with
744 IsaMakefile, not just hardwired "logics".
746 * Removed "compress" option from isabelle-process and isabelle usedir;
747 this is always enabled.
749 * Discontinued support for Poly/ML 4.x versions.
751 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
752 on a given logic image. This requires the lighttpd webserver and is
753 currently supported on Linux only.
757 New in Isabelle2009 (April 2009)
758 --------------------------------
762 * Simplified main Isabelle executables, with less surprises on
763 case-insensitive file-systems (such as Mac OS).
765 - The main Isabelle tool wrapper is now called "isabelle" instead of
768 - The former "isabelle" alias for "isabelle-process" has been
769 removed (should rarely occur to regular users).
771 - The former "isabelle-interface" and its alias "Isabelle" have been
772 removed (interfaces are now regular Isabelle tools).
774 Within scripts and make files, the Isabelle environment variables
775 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
776 respectively. (The latter are still available as legacy feature.)
778 The old isabelle-interface wrapper could react in confusing ways if
779 the interface was uninstalled or changed otherwise. Individual
780 interface tool configuration is now more explicit, see also the
781 Isabelle system manual. In particular, Proof General is now available
782 via "isabelle emacs".
784 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
785 purge installed copies of Isabelle executables and re-run "isabelle
786 install -p ...", or use symlinks.
788 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
789 old ~/isabelle, which was slightly non-standard and apt to cause
790 surprises on case-insensitive file-systems (such as Mac OS).
792 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
793 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
794 care is required when using older releases of Isabelle. Note that
795 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
796 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
798 * Proofs of fully specified statements are run in parallel on
799 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
800 a regular 4-core machine, if the initial heap space is made reasonably
801 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
803 * The main reference manuals ("isar-ref", "implementation", and
804 "system") have been updated and extended. Formally checked references
805 as hyperlinks are now available uniformly.
810 * Complete re-implementation of locales. INCOMPATIBILITY in several
811 respects. The most important changes are listed below. See the
812 Tutorial on Locales ("locales" manual) for details.
814 - In locale expressions, instantiation replaces renaming. Parameters
815 must be declared in a for clause. To aid compatibility with previous
816 parameter inheritance, in locale declarations, parameters that are not
817 'touched' (instantiation position "_" or omitted) are implicitly added
818 with their syntax at the beginning of the for clause.
820 - Syntax from abbreviations and definitions in locales is available in
821 locale expressions and context elements. The latter is particularly
822 useful in locale declarations.
824 - More flexible mechanisms to qualify names generated by locale
825 expressions. Qualifiers (prefixes) may be specified in locale
826 expressions, and can be marked as mandatory (syntax: "name!:") or
827 optional (syntax "name?:"). The default depends for plain "name:"
828 depends on the situation where a locale expression is used: in
829 commands 'locale' and 'sublocale' prefixes are optional, in
830 'interpretation' and 'interpret' prefixes are mandatory. The old
831 implicit qualifiers derived from the parameter names of a locale are
834 - Command "sublocale l < e" replaces "interpretation l < e". The
835 instantiation clause in "interpretation" and "interpret" (square
836 brackets) is no longer available. Use locale expressions.
838 - When converting proof scripts, mandatory qualifiers in
839 'interpretation' and 'interpret' should be retained by default, even
840 if this is an INCOMPATIBILITY compared to former behavior. In the
841 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
842 in locale expressions range over a single locale instance only.
844 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
845 In existing theorem specifications replace the includes element by the
846 respective context elements of the included locale, omitting those
847 that are already present in the theorem specification. Multiple
848 assume elements of a locale should be replaced by a single one
849 involving the locale predicate. In the proof body, declarations (most
850 notably theorems) may be regained by interpreting the respective
851 locales in the proof context as required (command "interpret").
853 If using "includes" in replacement of a target solely because the
854 parameter types in the theorem are not as general as in the target,
855 consider declaring a new locale with additional type constraints on
856 the parameters (context element "constrains").
858 - Discontinued "locale (open)". INCOMPATIBILITY.
860 - Locale interpretation commands no longer attempt to simplify goal.
861 INCOMPATIBILITY: in rare situations the generated goal differs. Use
862 methods intro_locales and unfold_locales to clarify.
864 - Locale interpretation commands no longer accept interpretation
865 attributes. INCOMPATIBILITY.
867 * Class declaration: so-called "base sort" must not be given in import
868 list any longer, but is inferred from the specification. Particularly
875 class foo = type + ...
877 * Class target: global versions of theorems stemming do not carry a
878 parameter prefix any longer. INCOMPATIBILITY.
880 * Class 'instance' command no longer accepts attached definitions.
881 INCOMPATIBILITY, use proper 'instantiation' target instead.
883 * Recovered hiding of consts, which was accidentally broken in
884 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
885 makes c inaccessible; consider using ``hide (open) const c'' instead.
887 * Slightly more coherent Pure syntax, with updated documentation in
888 isar-ref manual. Removed locales meta_term_syntax and
889 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
890 INCOMPATIBILITY in rare situations. Note that &&& should not be used
891 directly in regular applications.
893 * There is a new syntactic category "float_const" for signed decimal
894 fractions (e.g. 123.45 or -123.45).
896 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
897 interface with 'setup' command instead.
899 * Command 'local_setup' is similar to 'setup', but operates on a local
902 * The 'axiomatization' command now only works within a global theory
903 context. INCOMPATIBILITY.
905 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
906 hypotheses. Sorts required in the course of reasoning need to be
907 covered by the constraints in the initial statement, completed by the
908 type instance information of the background theory. Non-trivial sort
909 hypotheses, which rarely occur in practice, may be specified via
910 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
912 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
914 The result contains an implicit sort hypotheses as before --
915 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
918 * Generalized Isar history, with support for linear undo, direct state
921 * Changed defaults for unify configuration options:
923 unify_trace_bound = 50 (formerly 25)
924 unify_search_bound = 60 (formerly 30)
926 * Different bookkeeping for code equations (INCOMPATIBILITY):
928 a) On theory merge, the last set of code equations for a particular
929 constant is taken (in accordance with the policy applied by other
930 parts of the code generator framework).
932 b) Code equations stemming from explicit declarations (e.g. code
933 attribute) gain priority over default code equations stemming
934 from definition, primrec, fun etc.
936 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
938 * Unified theorem tables for both code generators. Thus [code
939 func] has disappeared and only [code] remains. INCOMPATIBILITY.
941 * Command 'find_consts' searches for constants based on type and name
944 find_consts "_ => bool"
946 By default, matching is against subtypes, but it may be restricted to
947 the whole type. Searching by name is possible. Multiple queries are
948 conjunctive and queries may be negated by prefixing them with a
951 find_consts strict: "_ => bool" name: "Int" -"int => int"
953 * New 'find_theorems' criterion "solves" matches theorems that
954 directly solve the current goal (modulo higher-order unification).
956 * Auto solve feature for main theorem statements: whenever a new goal
957 is stated, "find_theorems solves" is called; any theorems that could
958 solve the lemma directly are listed as part of the goal state.
959 Cf. associated options in Proof General Isabelle settings menu,
960 enabled by default, with reasonable timeout for pathological cases of
961 higher-order unification.
964 *** Document preparation ***
966 * Antiquotation @{lemma} now imitates a regular terminal proof,
967 demanding keyword 'by' and supporting the full method expression
968 syntax just like the Isar command 'by'.
973 * Integrated main parts of former image HOL-Complex with HOL. Entry
974 points Main and Complex_Main remain as before.
976 * Logic image HOL-Plain provides a minimal HOL with the most important
977 tools available (inductive, datatype, primrec, ...). This facilitates
978 experimentation and tool development. Note that user applications
979 (and library theories) should never refer to anything below theory
982 * Logic image HOL-Main stops at theory Main, and thus facilitates
983 experimentation due to shorter build times.
985 * Logic image HOL-NSA contains theories of nonstandard analysis which
986 were previously part of former HOL-Complex. Entry point Hyperreal
987 remains valid, but theories formerly using Complex_Main should now use
988 new entry point Hypercomplex.
990 * Generic ATP manager for Sledgehammer, based on ML threads instead of
991 Posix processes. Avoids potentially expensive forking of the ML
992 process. New thread-based implementation also works on non-Unix
993 platforms (Cygwin). Provers are no longer hardwired, but defined
994 within the theory via plain ML wrapper functions. Basic Sledgehammer
995 commands are covered in the isar-ref manual.
997 * Wrapper scripts for remote SystemOnTPTP service allows to use
998 sledgehammer without local ATP installation (Vampire etc.). Other
999 provers may be included via suitable ML wrappers, see also
1000 src/HOL/ATP_Linkup.thy.
1002 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1005 * The metis method no longer fails because the theorem is too trivial
1006 (contains the empty clause).
1008 * The metis method now fails in the usual manner, rather than raising
1009 an exception, if it determines that it cannot prove the theorem.
1011 * Method "coherent" implements a prover for coherent logic (see also
1012 src/Tools/coherent.ML).
1014 * Constants "undefined" and "default" replace "arbitrary". Usually
1015 "undefined" is the right choice to replace "arbitrary", though
1016 logically there is no difference. INCOMPATIBILITY.
1018 * Command "value" now integrates different evaluation mechanisms. The
1019 result of the first successful evaluation mechanism is printed. In
1020 square brackets a particular named evaluation mechanisms may be
1021 specified (currently, [SML], [code] or [nbe]). See further
1022 src/HOL/ex/Eval_Examples.thy.
1024 * Normalization by evaluation now allows non-leftlinear equations.
1025 Declare with attribute [code nbe].
1027 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1028 as the structured Isar versions "cases" and "induct", cf. the
1029 corresponding "cases" and "induct" attributes. Mutual induction rules
1030 are now presented as a list of individual projections
1031 (e.g. foo_bar.inducts for types foo and bar); the old format with
1032 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1033 rare situations a different rule is selected --- notably nested tuple
1034 elimination instead of former prod.exhaust: use explicit (case_tac t
1035 rule: prod.exhaust) here.
1037 * Attributes "cases", "induct", "coinduct" support "del" option.
1039 * Removed fact "case_split_thm", which duplicates "case_split".
1041 * The option datatype has been moved to a new theory Option. Renamed
1042 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1044 * New predicate "strict_mono" classifies strict functions on partial
1045 orders. With strict functions on linear orders, reasoning about
1046 (in)equalities is facilitated by theorems "strict_mono_eq",
1047 "strict_mono_less_eq" and "strict_mono_less".
1049 * Some set operations are now proper qualified constants with
1050 authentic syntax. INCOMPATIBILITY:
1061 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1064 * Auxiliary class "itself" has disappeared -- classes without any
1065 parameter are treated as expected by the 'class' command.
1067 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1069 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1070 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1072 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1073 method "approximation". It proves formulas on real values by using
1074 interval arithmetic. In the formulas are also the transcendental
1075 functions sin, cos, tan, atan, ln, exp and the constant pi are
1076 allowed. For examples see
1077 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1079 * Theory "Reflection" now resides in HOL/Library.
1081 * Entry point to Word library now simply named "Word".
1084 * Made source layout more coherent with logical distribution
1087 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1088 src/HOL/Library/Code_Message.thy ~> src/HOL/
1089 src/HOL/Library/GCD.thy ~> src/HOL/
1090 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1091 src/HOL/Library/Parity.thy ~> src/HOL/
1092 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1093 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1094 src/HOL/Real/Lubs.thy ~> src/HOL/
1095 src/HOL/Real/PReal.thy ~> src/HOL/
1096 src/HOL/Real/Rational.thy ~> src/HOL/
1097 src/HOL/Real/RComplete.thy ~> src/HOL/
1098 src/HOL/Real/RealDef.thy ~> src/HOL/
1099 src/HOL/Real/RealPow.thy ~> src/HOL/
1100 src/HOL/Real/Real.thy ~> src/HOL/
1101 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1102 src/HOL/Complex/Complex.thy ~> src/HOL/
1103 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1104 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1105 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1106 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1107 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1108 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1109 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1110 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1111 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1112 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1113 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1114 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1115 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1116 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1117 src/HOL/Real/Float ~> src/HOL/Library/
1118 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1119 src/HOL/Real/RealVector.thy ~> src/HOL/
1121 src/HOL/arith_data.ML ~> src/HOL/Tools
1122 src/HOL/hologic.ML ~> src/HOL/Tools
1123 src/HOL/simpdata.ML ~> src/HOL/Tools
1124 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1125 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1126 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1127 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1128 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1129 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1130 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1132 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1133 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1134 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1135 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1136 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1137 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1139 * If methods "eval" and "evaluation" encounter a structured proof
1140 state with !!/==>, only the conclusion is evaluated to True (if
1141 possible), avoiding strange error messages.
1143 * Method "sizechange" automates termination proofs using (a
1144 modification of) the size-change principle. Requires SAT solver. See
1145 src/HOL/ex/Termination.thy for examples.
1147 * Simplifier: simproc for let expressions now unfolds if bound
1148 variable occurs at most once in let expression body. INCOMPATIBILITY.
1150 * Method "arith": Linear arithmetic now ignores all inequalities when
1151 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1153 * New attribute "arith" for facts that should always be used
1154 automatically by arithmetic. It is intended to be used locally in
1157 assumes [arith]: "x > 0"
1159 Global usage is discouraged because of possible performance impact.
1161 * New classes "top" and "bot" with corresponding operations "top" and
1162 "bot" in theory Orderings; instantiation of class "complete_lattice"
1163 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1165 * Changed definition lemma "less_fun_def" in order to provide an
1166 instance for preorders on functions; use lemma "less_le" instead.
1169 * Theory Orderings: class "wellorder" moved here, with explicit
1170 induction rule "less_induct" as assumption. For instantiation of
1171 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1174 * Theory Orderings: added class "preorder" as superclass of "order".
1175 INCOMPATIBILITY: Instantiation proofs for order, linorder
1176 etc. slightly changed. Some theorems named order_class.* now named
1179 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1182 * Theory Finite_Set: added a new fold combinator of type
1184 ('a => 'b => 'b) => 'b => 'a set => 'b
1186 Occasionally this is more convenient than the old fold combinator
1187 which is now defined in terms of the new one and renamed to
1190 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1191 and "ring_simps" have been replaced by "algebra_simps" (which can be
1192 extended with further lemmas!). At the moment both still exist but
1193 the former will disappear at some point.
1195 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1196 class recpower. Type-specific simp rules for various recpower types
1197 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1199 rat_power_0 -> power_0
1200 rat_power_Suc -> power_Suc
1201 realpow_0 -> power_0
1202 realpow_Suc -> power_Suc
1203 complexpow_0 -> power_0
1204 complexpow_Suc -> power_Suc
1205 power_poly_0 -> power_0
1206 power_poly_Suc -> power_Suc
1208 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1209 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1210 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1211 of lemmas from Divides has been generalized from nat to class
1212 semiring_div. INCOMPATIBILITY. This involves the following theorem
1213 renames resulting from duplicate elimination:
1215 dvd_def_mod ~> dvd_eq_mod_eq_0
1216 zero_dvd_iff ~> dvd_0_left_iff
1217 dvd_0 ~> dvd_0_right
1218 DIVISION_BY_ZERO_DIV ~> div_by_0
1219 DIVISION_BY_ZERO_MOD ~> mod_by_0
1220 mult_div ~> div_mult_self2_is_id
1221 mult_mod ~> mod_mult_self2_is_0
1223 * Theory IntDiv: removed many lemmas that are instances of class-based
1224 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1225 rename old lemmas as follows:
1227 dvd_diff -> nat_dvd_diff
1228 dvd_zminus_iff -> dvd_minus_iff
1229 mod_add1_eq -> mod_add_eq
1230 mod_mult1_eq -> mod_mult_right_eq
1231 mod_mult1_eq' -> mod_mult_left_eq
1232 mod_mult_distrib_mod -> mod_mult_eq
1233 nat_mod_add_left_eq -> mod_add_left_eq
1234 nat_mod_add_right_eq -> mod_add_right_eq
1235 nat_mod_div_trivial -> mod_div_trivial
1236 nat_mod_mod_trivial -> mod_mod_trivial
1237 zdiv_zadd_self1 -> div_add_self1
1238 zdiv_zadd_self2 -> div_add_self2
1239 zdiv_zmult_self1 -> div_mult_self2_is_id
1240 zdiv_zmult_self2 -> div_mult_self1_is_id
1241 zdvd_triv_left -> dvd_triv_left
1242 zdvd_triv_right -> dvd_triv_right
1243 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1244 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1245 zmod_zadd_left_eq -> mod_add_left_eq
1246 zmod_zadd_right_eq -> mod_add_right_eq
1247 zmod_zadd_self1 -> mod_add_self1
1248 zmod_zadd_self2 -> mod_add_self2
1249 zmod_zadd1_eq -> mod_add_eq
1250 zmod_zdiff1_eq -> mod_diff_eq
1251 zmod_zdvd_zmod -> mod_mod_cancel
1252 zmod_zmod_cancel -> mod_mod_cancel
1253 zmod_zmult_self1 -> mod_mult_self2_is_0
1254 zmod_zmult_self2 -> mod_mult_self1_is_0
1257 zdvd_abs1 -> abs_dvd_iff
1258 zdvd_abs2 -> dvd_abs_iff
1259 zdvd_refl -> dvd_refl
1260 zdvd_trans -> dvd_trans
1261 zdvd_zadd -> dvd_add
1262 zdvd_zdiff -> dvd_diff
1263 zdvd_zminus_iff -> dvd_minus_iff
1264 zdvd_zminus2_iff -> minus_dvd_iff
1265 zdvd_zmultD -> dvd_mult_right
1266 zdvd_zmultD2 -> dvd_mult_left
1267 zdvd_zmult_mono -> mult_dvd_mono
1268 zdvd_0_right -> dvd_0_right
1269 zdvd_0_left -> dvd_0_left_iff
1270 zdvd_1_left -> one_dvd
1271 zminus_dvd_iff -> minus_dvd_iff
1273 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1275 * The real numbers offer decimal input syntax: 12.34 is translated
1276 into 1234/10^2. This translation is not reversed upon output.
1278 * Theory Library/Polynomial defines an abstract type 'a poly of
1279 univariate polynomials with coefficients of type 'a. In addition to
1280 the standard ring operations, it also supports div and mod. Code
1281 generation is also supported, using list-style constructors.
1283 * Theory Library/Inner_Product defines a class of real_inner for real
1284 inner product spaces, with an overloaded operation inner :: 'a => 'a
1285 => real. Class real_inner is a subclass of real_normed_vector from
1288 * Theory Library/Product_Vector provides instances for the product
1289 type 'a * 'b of several classes from RealVector and Inner_Product.
1290 Definitions of addition, subtraction, scalar multiplication, norms,
1291 and inner products are included.
1293 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1294 addition to the field operations, numerals and case syntax are also
1297 * Theory Library/Diagonalize provides constructive version of Cantor's
1298 first diagonalization argument.
1300 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1301 zlcm (for int); carried together from various gcd/lcm developements in
1302 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1303 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1304 may recover tupled syntax as follows:
1306 hide (open) const gcd
1307 abbreviation gcd where
1308 "gcd == (%(a, b). GCD.gcd a b)"
1310 GCD.gcd ("gcd '(_, _')")
1312 The same works for lcm, zgcd, zlcm.
1314 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1315 instantiations for algebraic structures. Removed some duplicate
1316 theorems. Changes in simp rules. INCOMPATIBILITY.
1318 * ML antiquotation @{code} takes a constant as argument and generates
1319 corresponding code in background and inserts name of the corresponding
1320 resulting ML value/function/datatype constructor binding in place.
1321 All occurrences of @{code} with a single ML block are generated
1322 simultaneously. Provides a generic and safe interface for
1323 instrumentalizing code generation. See
1324 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1325 In future you ought to refrain from ad-hoc compiling generated SML
1326 code on the ML toplevel. Note that (for technical reasons) @{code}
1327 cannot refer to constants for which user-defined serializations are
1328 set. Refer to the corresponding ML counterpart directly in that
1331 * Command 'rep_datatype': instead of theorem names the command now
1332 takes a list of terms denoting the constructors of the type to be
1333 represented as datatype. The characteristic theorems have to be
1334 proven. INCOMPATIBILITY. Also observe that the following theorems
1335 have disappeared in favour of existing ones:
1337 unit_induct ~> unit.induct
1338 prod_induct ~> prod.induct
1339 sum_induct ~> sum.induct
1340 Suc_Suc_eq ~> nat.inject
1341 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1346 * New locales for orders and lattices where the equivalence relation
1347 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1348 locales use a record structure with field eq for the equivalence.
1350 * New theory of factorial domains.
1352 * Units_l_inv and Units_r_inv are now simp rules by default.
1353 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1354 and/or r_inv will now also require deletion of these lemmas.
1356 * Renamed the following theorems, INCOMPATIBILITY:
1358 UpperD ~> Upper_memD
1359 LowerD ~> Lower_memD
1360 least_carrier ~> least_closed
1361 greatest_carrier ~> greatest_closed
1362 greatest_Lower_above ~> greatest_Lower_below
1363 one_zero ~> carrier_one_zero
1364 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1369 * Nominal datatypes can now contain type-variables.
1371 * Commands 'nominal_inductive' and 'equivariance' work with local
1374 * Nominal primrec can now works with local theory targets and its
1375 specification syntax now conforms to the general format as seen in
1378 * Method "perm_simp" honours the standard simplifier attributes
1379 (no_asm), (no_asm_use) etc.
1381 * The new predicate #* is defined like freshness, except that on the
1382 left hand side can be a set or list of atoms.
1384 * Experimental command 'nominal_inductive2' derives strong induction
1385 principles for inductive definitions. In contrast to
1386 'nominal_inductive', which can only deal with a fixed number of
1387 binders, it can deal with arbitrary expressions standing for sets of
1388 atoms to be avoided. The only inductive definition we have at the
1389 moment that needs this generalisation is the typing rule for Lets in
1392 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1393 -----------------------------------------------------------------
1394 Gamma |- Let x be t1 in t2 : T2
1396 In this rule one wants to avoid all the binders that are introduced by
1397 "close Gamma T1". We are looking for other examples where this
1398 feature might be useful. Please let us know.
1403 * Reimplemented the simplification procedure for proving continuity
1404 subgoals. The new simproc is extensible; users can declare additional
1405 continuity introduction rules with the attribute [cont2cont].
1407 * The continuity simproc now uses a different introduction rule for
1408 solving continuity subgoals on terms with lambda abstractions. In
1409 some rare cases the new simproc may fail to solve subgoals that the
1410 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1411 Potential INCOMPATIBILITY.
1413 * Command 'fixrec': specification syntax now conforms to the general
1414 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1415 examples. INCOMPATIBILITY.
1420 * Proof of Zorn's Lemma for partial orders.
1425 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1426 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1427 depends on multithreading, so timouts will not work before Poly/ML
1430 * High-level support for concurrent ML programming, see
1431 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1432 particularly convenient to organize independent functional
1433 computations. The concept of "synchronized variables" provides a
1434 higher-order interface for components with shared state, avoiding the
1435 delicate details of mutexes and condition variables. (Requires
1436 Poly/ML 5.2.1 or later.)
1438 * ML bindings produced via Isar commands are stored within the Isar
1439 context (theory or proof). Consequently, commands like 'use' and 'ML'
1440 become thread-safe and work with undo as expected (concerning
1441 top-level bindings, not side-effects on global references).
1442 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1443 compiler at runtime; really global bindings need to be given outside a
1444 theory. (Requires Poly/ML 5.2 or later.)
1446 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1447 context. Top-level ML bindings are stored within the proof context in
1448 a purely sequential fashion, disregarding the nested proof structure.
1449 ML bindings introduced by 'ML_prf' are discarded at the end of the
1450 proof. (Requires Poly/ML 5.2 or later.)
1452 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1453 and Method.setup, as well as Isar commands 'attribute_setup' and
1454 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1455 existing code accordingly, or use plain 'setup' together with old
1458 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1459 to 'a -> thm, while results are always tagged with an authentic oracle
1460 name. The Isar command 'oracle' is now polymorphic, no argument type
1461 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1462 accordingly. Note that extra performance may be gained by producing
1463 the cterm carefully, avoiding slow Thm.cterm_of.
1465 * Simplified interface for defining document antiquotations via
1466 ThyOutput.antiquotation, ThyOutput.output, and optionally
1467 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1468 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1471 * More systematic treatment of long names, abstract name bindings, and
1472 name space operations. Basic operations on qualified names have been
1473 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1474 Long_Name.append. Old type bstring has been mostly replaced by
1475 abstract type binding (see structure Binding), which supports precise
1476 qualification by packages and local theory targets, as well as proper
1477 tracking of source positions. INCOMPATIBILITY, need to wrap old
1478 bstring values into Binding.name, or better pass through abstract
1479 bindings everywhere. See further src/Pure/General/long_name.ML,
1480 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1482 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1483 LocalTheory.note etc.) now refer to the *full* internal name, not the
1484 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1486 * Disposed old type and term read functions (Sign.read_def_typ,
1487 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1488 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1489 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1490 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1491 resort for legacy applications.
1493 * Disposed old declarations, tactics, tactic combinators that refer to
1494 the simpset or claset of an implicit theory (such as Addsimps,
1495 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1496 embedded ML text, or local_simpset_of with a proper context passed as
1497 explicit runtime argument.
1499 * Rules and tactics that read instantiations (read_instantiate,
1500 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1501 context, which is required for parsing and type-checking. Moreover,
1502 the variables are specified as plain indexnames, not string encodings
1503 thereof. INCOMPATIBILITY.
1505 * Generic Toplevel.add_hook interface allows to analyze the result of
1506 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1507 for theorem dependency output of transactions resulting in a new
1510 * ML antiquotations: block-structured compilation context indicated by
1511 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1513 @{binding name} - basic name binding
1514 @{let ?pat = term} - term abbreviation (HO matching)
1515 @{note name = fact} - fact abbreviation
1516 @{thm fact} - singleton fact (with attributes)
1517 @{thms fact} - general fact (with attributes)
1518 @{lemma prop by method} - singleton goal
1519 @{lemma prop by meth1 meth2} - singleton goal
1520 @{lemma prop1 ... propN by method} - general goal
1521 @{lemma prop1 ... propN by meth1 meth2} - general goal
1522 @{lemma (open) ...} - open derivation
1527 * The Isabelle "emacs" tool provides a specific interface to invoke
1528 Proof General / Emacs, with more explicit failure if that is not
1529 installed (the old isabelle-interface script silently falls back on
1530 isabelle-process). The PROOFGENERAL_HOME setting determines the
1531 installation location of the Proof General distribution.
1533 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1534 the Isabelle process into a JVM/Scala application. See
1535 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1536 process wrapper has been discontinued.)
1538 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1540 * Various status messages (with exact source position information) are
1541 emitted, if proper markup print mode is enabled. This allows
1542 user-interface components to provide detailed feedback on internal
1547 New in Isabelle2008 (June 2008)
1548 -------------------------------
1552 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1553 and updated, with formally checked references as hyperlinks.
1555 * Theory loader: use_thy (and similar operations) no longer set the
1556 implicit ML context, which was occasionally hard to predict and in
1557 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1558 provides a proper context already.
1560 * Theory loader: old-style ML proof scripts being *attached* to a thy
1561 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1562 'use' within a theory file will do the job.
1564 * Name space merge now observes canonical order, i.e. the second space
1565 is inserted into the first one, while existing entries in the first
1566 space take precedence. INCOMPATIBILITY in rare situations, may try to
1567 swap theory imports.
1569 * Syntax: symbol \<chi> is now considered a letter. Potential
1570 INCOMPATIBILITY in identifier syntax etc.
1572 * Outer syntax: string tokens no longer admit escaped white space,
1573 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1574 white space without escapes.
1576 * Outer syntax: string tokens may contain arbitrary character codes
1577 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1583 * Context-dependent token translations. Default setup reverts locally
1584 fixed variables, and adds hilite markup for undeclared frees.
1586 * Unused theorems can be found using the new command 'unused_thms'.
1587 There are three ways of invoking it:
1590 Only finds unused theorems in the current theory.
1592 (2) unused_thms thy_1 ... thy_n -
1593 Finds unused theorems in the current theory and all of its ancestors,
1594 excluding the theories thy_1 ... thy_n and all of their ancestors.
1596 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1597 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1598 their ancestors, excluding the theories thy_1 ... thy_n and all of
1601 In order to increase the readability of the list produced by
1602 unused_thms, theorems that have been created by a particular instance
1603 of a theory command such as 'inductive' or 'function' are considered
1604 to belong to the same "group", meaning that if at least one theorem in
1605 this group is used, the other theorems in the same group are no longer
1606 reported as unused. Moreover, if all theorems in the group are
1607 unused, only one theorem in the group is displayed.
1609 Note that proof objects have to be switched on in order for
1610 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1611 usually the case when using Proof General with the default settings).
1613 * Authentic naming of facts disallows ad-hoc overwriting of previous
1614 theorems within the same name space. INCOMPATIBILITY, need to remove
1615 duplicate fact bindings, or even accidental fact duplications. Note
1616 that tools may maintain dynamically scoped facts systematically, using
1617 PureThy.add_thms_dynamic.
1619 * Command 'hide' now allows to hide from "fact" name space as well.
1621 * Eliminated destructive theorem database, simpset, claset, and
1622 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1623 update of theories within ML code.
1625 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1626 INCOMPATIBILITY, object-logics depending on former Pure require
1627 additional setup PureThy.old_appl_syntax_setup; object-logics
1628 depending on former CPure need to refer to Pure.
1630 * Commands 'use' and 'ML' are now purely functional, operating on
1631 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1632 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1635 * Command 'setup': discontinued implicit version with ML reference.
1637 * Instantiation target allows for simultaneous specification of class
1638 instance operations together with an instantiation proof.
1639 Type-checking phase allows to refer to class operations uniformly.
1640 See src/HOL/Complex/Complex.thy for an Isar example and
1641 src/HOL/Library/Eval.thy for an ML example.
1643 * Indexing of literal facts: be more serious about including only
1644 facts from the visible specification/proof context, but not the
1645 background context (locale etc.). Affects `prop` notation and method
1646 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1649 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1650 "(open)" option, which used to expose internal bound variables to the
1653 * Isar statements: removed obsolete case "rule_context".
1654 INCOMPATIBILITY, better use explicit fixes/assumes.
1656 * Locale proofs: default proof step now includes 'unfold_locales';
1657 hence 'proof' without argument may be used to unfold locale
1661 *** Document preparation ***
1663 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1664 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1665 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1666 spot); renamed link color from "darkblue" to "linkcolor" (default
1667 value unchanged, can be redefined via \definecolor); no longer sets
1668 "a4paper" option (unnecessary or even intrusive).
1670 * Antiquotation @{lemma A method} proves proposition A by the given
1671 method (either a method name or a method name plus (optional) method
1672 arguments in parentheses) and prints A just like @{prop A}.
1677 * New primrec package. Specification syntax conforms in style to
1678 definition/function/.... No separate induction rule is provided. The
1679 "primrec" command distinguishes old-style and new-style specifications
1680 by syntax. The former primrec package is now named OldPrimrecPackage.
1681 When adjusting theories, beware: constants stemming from new-style
1682 primrec specifications have authentic syntax.
1684 * Metis prover is now an order of magnitude faster, and also works
1685 with multithreading.
1687 * Metis: the maximum number of clauses that can be produced from a
1688 theorem is now given by the attribute max_clauses. Theorems that
1689 exceed this number are ignored, with a warning printed.
1691 * Sledgehammer no longer produces structured proofs by default. To
1692 enable, declare [[sledgehammer_full = true]]. Attributes
1693 reconstruction_modulus, reconstruction_sorts renamed
1694 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1696 * Method "induct_scheme" derives user-specified induction rules
1697 from well-founded induction and completeness of patterns. This factors
1698 out some operations that are done internally by the function package
1699 and makes them available separately. See
1700 src/HOL/ex/Induction_Scheme.thy for examples.
1702 * More flexible generation of measure functions for termination
1703 proofs: Measure functions can be declared by proving a rule of the
1704 form "is_measure f" and giving it the [measure_function] attribute.
1705 The "is_measure" predicate is logically meaningless (always true), and
1706 just guides the heuristic. To find suitable measure functions, the
1707 termination prover sets up the goal "is_measure ?f" of the appropriate
1708 type and generates all solutions by prolog-style backwards proof using
1711 This setup also deals with rules like
1713 "is_measure f ==> is_measure (list_size f)"
1715 which accommodates nested datatypes that recurse through lists.
1716 Similar rules are predeclared for products and option types.
1718 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1722 - Definitions of overloaded constants on sets have to be replaced by
1723 definitions on => and bool.
1725 - Some definitions of overloaded operators on sets can now be proved
1726 using the definitions of the operators on => and bool. Therefore,
1727 the following theorems have been renamed:
1729 subset_def -> subset_eq
1730 psubset_def -> psubset_eq
1731 set_diff_def -> set_diff_eq
1732 Compl_def -> Compl_eq
1733 Sup_set_def -> Sup_set_eq
1734 Inf_set_def -> Inf_set_eq
1735 sup_set_def -> sup_set_eq
1736 inf_set_def -> inf_set_eq
1738 - Due to the incompleteness of the HO unification algorithm, some
1739 rules such as subst may require manual instantiation, if some of
1740 the unknowns in the rule is a set.
1742 - Higher order unification and forward proofs:
1745 have "P (S::'a set)" <...>
1746 then have "EX S. P S" ..
1748 no longer works (due to the incompleteness of the HO unification
1749 algorithm) and must be replaced by the pattern
1756 - Calculational reasoning with subst (or similar rules):
1759 have "P (S::'a set)" <...>
1760 also have "S = T" <...>
1761 finally have "P T" .
1763 no longer works (for similar reasons as the previous example) and
1764 must be replaced by something like
1766 have "P (S::'a set)" <...>
1767 moreover have "S = T" <...>
1768 ultimately have "P T" by simp
1770 - Tactics or packages written in ML code:
1771 Code performing pattern matching on types via
1773 Type ("set", [T]) => ...
1775 must be rewritten. Moreover, functions like strip_type or
1776 binder_types no longer return the right value when applied to a
1779 T1 => ... => Tn => U => bool
1783 T1 => ... => Tn => U set
1785 * Merged theories Wellfounded_Recursion, Accessible_Part and
1786 Wellfounded_Relations to theory Wellfounded.
1788 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1790 * Class finite no longer treats UNIV as class parameter. Use class
1791 enum from theory Library/Enum instead to achieve a similar effect.
1794 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1795 and "Cons". INCOMPATIBILITY.
1797 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1798 Potential INCOMPATIBILITY.
1800 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1801 injective_fst_snd removed, use split_eta and prod_eqI instead.
1802 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1804 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1805 the same name in theory Orderings:
1815 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1816 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1817 and different variable names.
1819 * Library/Option_ord.thy: Canonical order on option type.
1821 * Library/RBT.thy: Red-black trees, an efficient implementation of
1824 * Library/Countable.thy: Type class for countable types.
1826 * Theory Int: The representation of numerals has changed. The infix
1827 operator BIT and the bit datatype with constructors B0 and B1 have
1828 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1829 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1830 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1833 * Theory Nat: definition of <= and < on natural numbers no longer
1834 depend on well-founded relations. INCOMPATIBILITY. Definitions
1835 le_def and less_def have disappeared. Consider lemmas not_less
1836 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1838 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1839 (whose purpose mainly is for various fold_set functionals) have been
1840 abandoned in favor of the existing algebraic classes
1841 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1842 lower_semilattice (resp. upper_semilattice) and linorder.
1845 * Theory Transitive_Closure: induct and cases rules now declare proper
1846 case_names ("base" and "step"). INCOMPATIBILITY.
1848 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1849 lattices. The form set-specific version is available as
1850 Inductive.lfp_ordinal_induct_set.
1852 * Renamed theorems "power.simps" to "power_int.simps".
1855 * Class semiring_div provides basic abstract properties of semirings
1856 with division and modulo operations. Subsumes former class dvd_mod.
1858 * Merged theories IntDef, Numeral and IntArith into unified theory
1859 Int. INCOMPATIBILITY.
1861 * Theory Library/Code_Index: type "index" now represents natural
1862 numbers rather than integers. INCOMPATIBILITY.
1864 * New class "uminus" with operation "uminus" (split of from class
1865 "minus" which now only has operation "minus", binary).
1868 * Constants "card", "internal_split", "option_map" now with authentic
1869 syntax. INCOMPATIBILITY.
1871 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1872 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1873 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1874 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1875 Sup_set_def, le_def, less_def, option_map_def now with object
1876 equality. INCOMPATIBILITY.
1878 * Records. Removed K_record, and replaced it by pure lambda term
1879 %x. c. The simplifier setup is now more robust against eta expansion.
1880 INCOMPATIBILITY: in cases explicitly referring to K_record.
1882 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1884 * Library/ListVector: new theory of arithmetic vector operations.
1886 * Library/Order_Relation: new theory of various orderings as sets of
1887 pairs. Defines preorders, partial orders, linear orders and
1888 well-orders on sets and on types.
1893 * Renamed some theories to allow to loading both ZF and HOL in the
1896 Datatype -> Datatype_ZF
1897 Inductive -> Inductive_ZF
1904 INCOMPATIBILITY: ZF theories that import individual theories below
1905 Main might need to be adapted. Regular theory Main is still
1906 available, as trivial extension of Main_ZF.
1911 * ML within Isar: antiquotation @{const name} or @{const
1912 name(typargs)} produces statically-checked Const term.
1914 * Functor NamedThmsFun: data is available to the user as dynamic fact
1915 (of the same name). Removed obsolete print command.
1917 * Removed obsolete "use_legacy_bindings" function.
1919 * The ``print mode'' is now a thread-local value derived from a global
1920 template (the former print_mode reference), thus access becomes
1921 non-critical. The global print_mode reference is for session
1922 management only; user-code should use print_mode_value,
1923 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1925 * Functions system/system_out provide a robust way to invoke external
1926 shell commands, with propagation of interrupts (requires Poly/ML
1927 5.2.1). Do not use OS.Process.system etc. from the basis library!
1932 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1933 in accordance with Proof General 3.7, which prefers GNU emacs.
1935 * isatool tty runs Isabelle process with plain tty interaction;
1936 optional line editor may be specified via ISABELLE_LINE_EDITOR
1937 setting, the default settings attempt to locate "ledit" and "rlwrap".
1939 * isatool browser now works with Cygwin as well, using general
1940 "javapath" function defined in Isabelle process environment.
1942 * YXML notation provides a simple and efficient alternative to
1943 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1944 isatool yxml as described in the Isabelle system manual.
1946 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1947 provides general wrapper for managing an Isabelle process in a robust
1948 fashion, with ``cooked'' output from stdin/stderr.
1950 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1951 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1953 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1954 way of changing the user's settings is via
1955 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1958 * Multithreading.max_threads := 0 refers to the number of actual CPU
1959 cores of the underlying machine, which is a good starting point for
1960 optimal performance tuning. The corresponding usedir option -M allows
1961 "max" as an alias for "0". WARNING: does not work on certain versions
1962 of Mac OS (with Poly/ML 5.1).
1964 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1965 adverse effect of Isabelle flooding interactive front-ends (notably
1966 ProofGeneral / XEmacs).
1970 New in Isabelle2007 (November 2007)
1971 -----------------------------------
1975 * More uniform information about legacy features, notably a
1976 warning/error of "Legacy feature: ...", depending on the state of the
1977 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1978 legacy features will disappear eventually.
1980 * Theory syntax: the header format ``theory A = B + C:'' has been
1981 discontinued in favour of ``theory A imports B C begin''. Use isatool
1982 fixheaders to convert existing theory files. INCOMPATIBILITY.
1984 * Theory syntax: the old non-Isar theory file format has been
1985 discontinued altogether. Note that ML proof scripts may still be used
1986 with Isar theories; migration is usually quite simple with the ML
1987 function use_legacy_bindings. INCOMPATIBILITY.
1989 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1990 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1993 * Theory loader: be more serious about observing the static theory
1994 header specifications (including optional directories), but not the
1995 accidental file locations of previously successful loads. The strict
1996 update policy of former update_thy is now already performed by
1997 use_thy, so the former has been removed; use_thys updates several
1998 theories simultaneously, just as 'imports' within a theory header
1999 specification, but without merging the results. Potential
2000 INCOMPATIBILITY: may need to refine theory headers and commands
2001 ROOT.ML which depend on load order.
2003 * Theory loader: optional support for content-based file
2004 identification, instead of the traditional scheme of full physical
2005 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2006 (cf. the system manual). The new scheme allows to work with
2007 non-finished theories in persistent session images, such that source
2008 files may be moved later on without requiring reloads.
2010 * Theory loader: old-style ML proof scripts being *attached* to a thy
2011 file (with the same base name as the theory) are considered a legacy
2012 feature, which will disappear eventually. Even now, the theory loader
2013 no longer maintains dependencies on such files.
2015 * Syntax: the scope for resolving ambiguities via type-inference is
2016 now limited to individual terms, instead of whole simultaneous
2017 specifications as before. This greatly reduces the complexity of the
2018 syntax module and improves flexibility by separating parsing and
2019 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2020 'fixes' etc.) are required in rare situations.
2022 * Syntax: constants introduced by new-style packages ('definition',
2023 'abbreviation' etc.) are passed through the syntax module in
2024 ``authentic mode''. This means that associated mixfix annotations
2025 really stick to such constants, independently of potential name space
2026 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2027 trees are represented slightly differently, may need to adapt syntax
2028 translations accordingly. Use CONST marker in 'translations' and
2029 @{const_syntax} antiquotation in 'parse_translation' etc.
2031 * Legacy goal package: reduced interface to the bare minimum required
2032 to keep existing proof scripts running. Most other user-level
2033 functions are now part of the OldGoals structure, which is *not* open
2034 by default (consider isatool expandshort before open OldGoals).
2035 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2036 these tend to cause confusion about the actual goal (!) context being
2037 used here, which is not necessarily the same as the_context().
2039 * Command 'find_theorems': supports "*" wild-card in "name:"
2040 criterion; "with_dups" option. Certain ProofGeneral versions might
2041 support a specific search form (see ProofGeneral/CHANGES).
2043 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2044 by default, which means that "prems" (and also "fixed variables") are
2045 suppressed from proof state output. Note that the ProofGeneral
2046 settings mechanism allows to change and save options persistently, but
2047 older versions of Isabelle will fail to start up if a negative prems
2050 * Local theory targets may be specified by non-nested blocks of
2051 ``context/locale/class ... begin'' followed by ``end''. The body may
2052 contain definitions, theorems etc., including any derived mechanism
2053 that has been implemented on top of these primitives. This concept
2054 generalizes the existing ``theorem (in ...)'' towards more versatility
2057 * Proof General interface: proper undo of final 'end' command;
2058 discontinued Isabelle/classic mode (ML proof scripts).
2061 *** Document preparation ***
2063 * Added antiquotation @{theory name} which prints the given name,
2064 after checking that it refers to a valid ancestor theory in the
2067 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2068 check the given source text as ML type/structure, printing verbatim.
2070 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2071 "c args == rhs" given in the current context. (Any number of
2072 arguments may be given on the LHS.)
2077 * The 'class' package offers a combination of axclass and locale to
2078 achieve Haskell-like type classes in Isabelle. Definitions and
2079 theorems within a class context produce both relative results (with
2080 implicit parameters according to the locale context), and polymorphic
2081 constants with qualified polymorphism (according to the class
2082 context). Within the body context of a 'class' target, a separate
2083 syntax layer ("user space type system") takes care of converting
2084 between global polymorphic consts and internal locale representation.
2085 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2086 "isatool doc classes" provides a tutorial.
2088 * Generic code generator framework allows to generate executable
2089 code for ML and Haskell (including Isabelle classes). A short usage
2092 internal compilation:
2093 export_code <list of constants (term syntax)> in SML
2094 writing SML code to a file:
2095 export_code <list of constants (term syntax)> in SML <filename>
2096 writing OCaml code to a file:
2097 export_code <list of constants (term syntax)> in OCaml <filename>
2098 writing Haskell code to a bunch of files:
2099 export_code <list of constants (term syntax)> in Haskell <filename>
2101 evaluating closed propositions to True/False using code generation:
2104 Reasonable default setup of framework in HOL.
2106 Theorem attributs for selecting and transforming function equations theorems:
2108 [code fun]: select a theorem as function equation for a specific constant
2109 [code fun del]: deselect a theorem as function equation for a specific constant
2110 [code inline]: select an equation theorem for unfolding (inlining) in place
2111 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2113 User-defined serializations (target in {SML, OCaml, Haskell}):
2115 code_const <and-list of constants (term syntax)>
2116 {(target) <and-list of const target syntax>}+
2118 code_type <and-list of type constructors>
2119 {(target) <and-list of type target syntax>}+
2121 code_instance <and-list of instances>
2123 where instance ::= <type constructor> :: <class>
2125 code_class <and_list of classes>
2126 {(target) <and-list of class target syntax>}+
2127 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2129 code_instance and code_class only are effective to target Haskell.
2131 For example usage see src/HOL/ex/Codegenerator.thy and
2132 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2133 generation from Isabelle/HOL theories is available via "isatool doc
2136 * Code generator: consts in 'consts_code' Isar commands are now
2137 referred to by usual term syntax (including optional type
2140 * Command 'no_translations' removes translation rules from theory
2143 * Overloaded definitions are now actually checked for acyclic
2144 dependencies. The overloading scheme is slightly more general than
2145 that of Haskell98, although Isabelle does not demand an exact
2146 correspondence to type class and instance declarations.
2147 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2148 exotic versions of overloading -- at the discretion of the user!
2150 Polymorphic constants are represented via type arguments, i.e. the
2151 instantiation that matches an instance against the most general
2152 declaration given in the signature. For example, with the declaration
2153 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2154 as c(nat). Overloading is essentially simultaneous structural
2155 recursion over such type arguments. Incomplete specification patterns
2156 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2157 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2158 Command 'print_theory' outputs the normalized system of recursive
2159 equations, see section "definitions".
2161 * Configuration options are maintained within the theory or proof
2162 context (with name and type bool/int/string), providing a very simple
2163 interface to a poor-man's version of general context data. Tools may
2164 declare options in ML (e.g. using Attrib.config_int) and then refer to
2165 these values using Config.get etc. Users may change options via an
2166 associated attribute of the same name. This form of context
2167 declaration works particularly well with commands 'declare' or
2168 'using', for example ``declare [[foo = 42]]''. Thus it has become
2169 very easy to avoid global references, which would not observe Isar
2170 toplevel undo/redo and fail to work with multithreading.
2172 Various global ML references of Pure and HOL have been turned into
2173 configuration options:
2175 Unify.search_bound unify_search_bound
2176 Unify.trace_bound unify_trace_bound
2177 Unify.trace_simp unify_trace_simp
2178 Unify.trace_types unify_trace_types
2179 Simplifier.simp_depth_limit simp_depth_limit
2180 Blast.depth_limit blast_depth_limit
2181 DatatypeProp.dtK datatype_distinctness_limit
2182 fast_arith_neq_limit fast_arith_neq_limit
2183 fast_arith_split_limit fast_arith_split_limit
2185 * Named collections of theorems may be easily installed as context
2186 data using the functor NamedThmsFun (see also
2187 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2188 attributes; there is also a toplevel print command. This facility is
2189 just a common case of general context data, which is the preferred way
2190 for anything more complex than just a list of facts in canonical
2193 * Isar: command 'declaration' augments a local theory by generic
2194 declaration functions written in ML. This enables arbitrary content
2195 being added to the context, depending on a morphism that tells the
2196 difference of the original declaration context wrt. the application
2197 context encountered later on.
2199 * Isar: proper interfaces for simplification procedures. Command
2200 'simproc_setup' declares named simprocs (with match patterns, and body
2201 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2202 context. ML antiquotation @{simproc name} retrieves named simprocs.
2204 * Isar: an extra pair of brackets around attribute declarations
2205 abbreviates a theorem reference involving an internal dummy fact,
2206 which will be ignored later --- only the effect of the attribute on
2207 the background context will persist. This form of in-place
2208 declarations is particularly useful with commands like 'declare' and
2209 'using', for example ``have A using [[simproc a]] by simp''.
2211 * Isar: method "assumption" (and implicit closing of subproofs) now
2212 takes simple non-atomic goal assumptions into account: after applying
2213 an assumption as a rule the resulting subgoals are solved by atomic
2214 assumption steps. This is particularly useful to finish 'obtain'
2215 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2216 without referring to the original premise "!!x. P x ==> thesis" in the
2217 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2220 * Isar: implicit use of prems from the Isar proof context is
2221 considered a legacy feature. Common applications like ``have A .''
2222 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2223 referencing facts explicitly here improves readability and
2224 maintainability of proof texts.
2226 * Isar: improper proof element 'guess' is like 'obtain', but derives
2227 the obtained context from the course of reasoning! For example:
2229 assume "EX x y. A x & B y" -- "any previous fact"
2230 then guess x and y by clarify
2232 This technique is potentially adventurous, depending on the facts and
2233 proof tools being involved here.
2235 * Isar: known facts from the proof context may be specified as literal
2236 propositions, using ASCII back-quote syntax. This works wherever
2237 named facts used to be allowed so far, in proof commands, proof
2238 methods, attributes etc. Literal facts are retrieved from the context
2239 according to unification of type and term parameters. For example,
2240 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2241 theorems in the current context, then these are valid literal facts:
2242 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2244 There is also a proof method "fact" which does the same composition
2245 for explicit goal states, e.g. the following proof texts coincide with
2246 certain special cases of literal facts:
2248 have "A" by fact == note `A`
2249 have "A ==> B" by fact == note `A ==> B`
2250 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2251 have "P a ==> Q a" by fact == note `P a ==> Q a`
2253 * Isar: ":" (colon) is no longer a symbolic identifier character in
2254 outer syntax. Thus symbolic identifiers may be used without
2255 additional white space in declarations like this: ``assume *: A''.
2257 * Isar: 'print_facts' prints all local facts of the current context,
2258 both named and unnamed ones.
2260 * Isar: 'def' now admits simultaneous definitions, e.g.:
2262 def x == "t" and y == "u"
2264 * Isar: added command 'unfolding', which is structurally similar to
2265 'using', but affects both the goal state and facts by unfolding given
2266 rewrite rules. Thus many occurrences of the 'unfold' method or
2267 'unfolded' attribute may be replaced by first-class proof text.
2269 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2270 and command 'unfolding' now all support object-level equalities
2271 (potentially conditional). The underlying notion of rewrite rule is
2272 analogous to the 'rule_format' attribute, but *not* that of the
2273 Simplifier (which is usually more generous).
2275 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2276 premises of a theorem by n. Useful in conjunction with drule.
2278 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2279 method expression within a sandbox consisting of the first N
2280 sub-goals, which need to exist. For example, ``simp_all [3]''
2281 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2282 simplifies all new goals that emerge from applying rule foo to the
2283 originally first one.
2285 * Isar: schematic goals are no longer restricted to higher-order
2286 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2289 * Isar: the conclusion of a long theorem statement is now either
2290 'shows' (a simultaneous conjunction, as before), or 'obtains'
2291 (essentially a disjunction of cases with local parameters and
2292 assumptions). The latter allows to express general elimination rules
2293 adequately; in this notation common elimination rules look like this:
2295 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2297 obtains x where "P x"
2299 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2303 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2309 The subsequent classical rules even refer to the formal "thesis"
2312 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2315 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2316 obtains "thesis ==> something"
2318 The actual proof of an 'obtains' statement is analogous to that of the
2319 Isar proof element 'obtain', only that there may be several cases.
2320 Optional case names may be specified in parentheses; these will be
2321 available both in the present proof and as annotations in the
2322 resulting rule, for later use with the 'cases' method (cf. attribute
2325 * Isar: the assumptions of a long theorem statement are available as
2326 "assms" fact in the proof context. This is more appropriate than the
2327 (historical) "prems", which refers to all assumptions of the current
2328 context, including those from the target locale, proof body etc.
2330 * Isar: 'print_statement' prints theorems from the current theory or
2331 proof context in long statement form, according to the syntax of a
2334 * Isar: 'obtain' takes an optional case name for the local context
2335 introduction rule (default "that").
2337 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2338 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2341 * Pure: syntax "CONST name" produces a fully internalized constant
2342 according to the current context. This is particularly useful for
2343 syntax translations that should refer to internal constant
2344 representations independently of name spaces.
2346 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2347 instead of "FOO ". This allows multiple binder declarations to coexist
2348 in the same context. INCOMPATIBILITY.
2350 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2351 primitive that also works in a locale context (both for constants and
2352 fixed variables). Type declaration and internal syntactic representation
2353 of given constants retrieved from the context. Likewise, the
2354 'no_notation' command allows to remove given syntax annotations from the
2357 * Isar/locales: new derived specification elements 'axiomatization',
2358 'definition', 'abbreviation', which support type-inference, admit
2359 object-level specifications (equality, equivalence). See also the
2360 isar-ref manual. Examples:
2363 eq (infix "===" 50) where
2364 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2366 definition "f x y = x + y + 1"
2367 definition g where "g x = f x x"
2370 neq (infix "=!=" 50) where
2371 "x =!= y == ~ (x === y)"
2373 These specifications may be also used in a locale context. Then the
2374 constants being introduced depend on certain fixed parameters, and the
2375 constant name is qualified by the locale base name. An internal
2376 abbreviation takes care for convenient input and output, making the
2377 parameters implicit and using the original short name. See also
2378 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2379 entities from a monomorphic theory.
2381 Presently, abbreviations are only available 'in' a target locale, but
2382 not inherited by general import expressions. Also note that
2383 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2384 'translations' in common applications. The "no_abbrevs" print mode
2385 prevents folding of abbreviations in term output.
2387 Concrete syntax is attached to specified constants in internal form,
2388 independently of name spaces. The parse tree representation is
2389 slightly different -- use 'notation' instead of raw 'syntax', and
2390 'translations' with explicit "CONST" markup to accommodate this.
2392 * Pure/Isar: unified syntax for new-style specification mechanisms
2393 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2394 full type inference and dummy patterns ("_"). For example:
2396 definition "K x _ = x"
2398 inductive conj for A B
2399 where "A ==> B ==> conj A B"
2401 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2402 the current context. Print mode "no_abbrevs" prevents inversion of
2403 abbreviations on output.
2405 * Isar/locales: improved parameter handling: use of locales "var" and
2406 "struct" no longer necessary; - parameter renamings are no longer
2407 required to be injective. For example, this allows to define
2408 endomorphisms as locale endom = homom mult mult h.
2410 * Isar/locales: changed the way locales with predicates are defined.
2411 Instead of accumulating the specification, the imported expression is
2412 now an interpretation. INCOMPATIBILITY: different normal form of
2413 locale expressions. In particular, in interpretations of locales with
2414 predicates, goals repesenting already interpreted fragments are not
2415 removed automatically. Use methods `intro_locales' and
2416 `unfold_locales'; see below.
2418 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2419 provide backward reasoning on locales predicates. The methods are
2420 aware of interpretations and discharge corresponding goals.
2421 `intro_locales' is less aggressive then `unfold_locales' and does not
2422 unfold predicates to assumptions.
2424 * Isar/locales: the order in which locale fragments are accumulated
2425 has changed. This enables to override declarations from fragments due
2426 to interpretations -- for example, unwanted simp rules.
2428 * Isar/locales: interpretation in theories and proof contexts has been
2429 extended. One may now specify (and prove) equations, which are
2430 unfolded in interpreted theorems. This is useful for replacing
2431 defined concepts (constants depending on locale parameters) by
2432 concepts already existing in the target context. Example:
2434 interpretation partial_order ["op <= :: [int, int] => bool"]
2435 where "partial_order.less (op <=) (x::int) y = (x < y)"
2437 Typically, the constant `partial_order.less' is created by a
2438 definition specification element in the context of locale
2441 * Method "induct": improved internal context management to support
2442 local fixes and defines on-the-fly. Thus explicit meta-level
2443 connectives !! and ==> are rarely required anymore in inductive goals
2444 (using object-logic connectives for this purpose has been long
2445 obsolete anyway). Common proof patterns are explained in
2446 src/HOL/Induct/Common_Patterns.thy, see also
2447 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2450 * Method "induct": improved handling of simultaneous goals. Instead of
2451 introducing object-level conjunction, the statement is now split into
2452 several conclusions, while the corresponding symbolic cases are nested
2453 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2454 see src/HOL/Induct/Common_Patterns.thy, for example.
2456 * Method "induct": mutual induction rules are now specified as a list
2457 of rule sharing the same induction cases. HOL packages usually provide
2458 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2459 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2460 mutual induction rules differently, i.e. like this:
2462 (induct rule: foo_bar.inducts)
2463 (induct set: foo bar)
2464 (induct pred: foo bar)
2465 (induct type: foo bar)
2467 The ML function ProjectRule.projections turns old-style rules into the
2470 * Method "coinduct": dual of induction, see
2471 src/HOL/Library/Coinductive_List.thy for various examples.
2473 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2474 considered a legacy feature.
2476 * Attribute "symmetric" produces result with standardized schematic
2477 variables (index 0). Potential INCOMPATIBILITY.
2479 * Simplifier: by default the simplifier trace only shows top level
2480 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2481 default. Thus there is less danger of being flooded by the trace. The
2482 trace indicates where parts have been suppressed.
2484 * Provers/classical: removed obsolete classical version of elim_format
2485 attribute; classical elim/dest rules are now treated uniformly when
2486 manipulating the claset.
2488 * Provers/classical: stricter checks to ensure that supplied intro,
2489 dest and elim rules are well-formed; dest and elim rules must have at
2492 * Provers/classical: attributes dest/elim/intro take an optional
2493 weight argument for the rule (just as the Pure versions). Weights are
2494 ignored by automated tools, but determine the search order of single
2497 * Syntax: input syntax now supports dummy variable binding "%_. b",
2498 where the body does not mention the bound variable. Note that dummy
2499 patterns implicitly depend on their context of bounds, which makes
2500 "{_. _}" match any set comprehension as expected. Potential
2501 INCOMPATIBILITY -- parse translations need to cope with syntactic
2502 constant "_idtdummy" in the binding position.
2504 * Syntax: removed obsolete syntactic constant "_K" and its associated
2505 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2506 for example "A -> B" => "Pi A (%_. B)".
2508 * Pure: 'class_deps' command visualizes the subclass relation, using
2509 the graph browser tool.
2511 * Pure: 'print_theory' now suppresses certain internal declarations by
2512 default; use '!' option for full details.
2517 * Method "metis" proves goals by applying the Metis general-purpose
2518 resolution prover (see also http://gilith.com/software/metis/).
2519 Examples are in the directory MetisExamples. WARNING: the
2520 Isabelle/HOL-Metis integration does not yet work properly with
2523 * Command 'sledgehammer' invokes external automatic theorem provers as
2524 background processes. It generates calls to the "metis" method if
2525 successful. These can be pasted into the proof. Users do not have to
2526 wait for the automatic provers to return. WARNING: does not really
2527 work with multi-threading.
2529 * New "auto_quickcheck" feature tests outermost goal statements for
2530 potential counter-examples. Controlled by ML references
2531 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2532 5000 milliseconds). Fails silently if statements is outside of
2533 executable fragment, or any other codgenerator problem occurs.
2535 * New constant "undefined" with axiom "undefined x = undefined".
2537 * Added class "HOL.eq", allowing for code generation with polymorphic
2540 * Some renaming of class constants due to canonical name prefixing in
2541 the new 'class' package:
2543 HOL.abs ~> HOL.abs_class.abs
2544 HOL.divide ~> HOL.divide_class.divide
2545 0 ~> HOL.zero_class.zero
2546 1 ~> HOL.one_class.one
2547 op + ~> HOL.plus_class.plus
2548 op - ~> HOL.minus_class.minus
2549 uminus ~> HOL.minus_class.uminus
2550 op * ~> HOL.times_class.times
2551 op < ~> HOL.ord_class.less
2552 op <= > HOL.ord_class.less_eq
2553 Nat.power ~> Power.power_class.power
2554 Nat.size ~> Nat.size_class.size
2555 Numeral.number_of ~> Numeral.number_class.number_of
2556 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2557 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2558 Orderings.min ~> Orderings.ord_class.min
2559 Orderings.max ~> Orderings.ord_class.max
2560 Divides.op div ~> Divides.div_class.div
2561 Divides.op mod ~> Divides.div_class.mod
2562 Divides.op dvd ~> Divides.div_class.dvd
2564 INCOMPATIBILITY. Adaptions may be required in the following cases:
2566 a) User-defined constants using any of the names "plus", "minus",
2567 "times", "less" or "less_eq". The standard syntax translations for
2568 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2571 b) Variables named "plus", "minus", "times", "less", "less_eq"
2572 INCOMPATIBILITY: use more specific names.
2574 c) Permutative equations (e.g. "a + b = b + a")
2575 Since the change of names also changes the order of terms, permutative
2576 rewrite rules may get applied in a different order. Experience shows
2577 that this is rarely the case (only two adaptions in the whole Isabelle
2578 distribution). INCOMPATIBILITY: rewrite proofs
2580 d) ML code directly refering to constant names
2581 This in general only affects hand-written proof tactics, simprocs and
2582 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2583 Consider using @{const_name} antiquotation.
2585 * New class "default" with associated constant "default".
2587 * Function "sgn" is now overloaded and available on int, real, complex
2588 (and other numeric types), using class "sgn". Two possible defs of
2589 sgn are given as equational assumptions in the classes sgn_if and
2590 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2593 * Locale "partial_order" now unified with class "order" (cf. theory
2594 Orderings), added parameter "less". INCOMPATIBILITY.
2596 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2597 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2598 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2600 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2601 changed order of proof goals in instance proofs.
2603 * The transitivity reasoner for partial and linear orders is set up
2604 for classes "order" and "linorder". Instances of the reasoner are available
2605 in all contexts importing or interpreting the corresponding locales.
2606 Method "order" invokes the reasoner separately; the reasoner
2607 is also integrated with the Simplifier as a solver. Diagnostic
2608 command 'print_orders' shows the available instances of the reasoner
2609 in the current context.
2611 * Localized monotonicity predicate in theory "Orderings"; integrated
2612 lemmas max_of_mono and min_of_mono with this predicate.
2615 * Formulation of theorem "dense" changed slightly due to integration
2616 with new class dense_linear_order.
2618 * Uniform lattice theory development in HOL.
2620 constants "meet" and "join" now named "inf" and "sup"
2621 constant "Meet" now named "Inf"
2623 classes "meet_semilorder" and "join_semilorder" now named
2624 "lower_semilattice" and "upper_semilattice"
2625 class "lorder" now named "lattice"
2626 class "comp_lat" now named "complete_lattice"
2628 Instantiation of lattice classes allows explicit definitions
2629 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2631 INCOMPATIBILITY. Theorem renames:
2633 meet_left_le ~> inf_le1
2634 meet_right_le ~> inf_le2
2635 join_left_le ~> sup_ge1
2636 join_right_le ~> sup_ge2
2637 meet_join_le ~> inf_sup_ord
2640 le_meet ~> le_inf_iff
2641 le_join ~> ge_sup_conv
2642 meet_idempotent ~> inf_idem
2643 join_idempotent ~> sup_idem
2644 meet_comm ~> inf_commute
2645 join_comm ~> sup_commute
2646 meet_leI1 ~> le_infI1
2647 meet_leI2 ~> le_infI2
2648 le_joinI1 ~> le_supI1
2649 le_joinI2 ~> le_supI2
2650 meet_assoc ~> inf_assoc
2651 join_assoc ~> sup_assoc
2652 meet_left_comm ~> inf_left_commute
2653 meet_left_idempotent ~> inf_left_idem
2654 join_left_comm ~> sup_left_commute
2655 join_left_idempotent ~> sup_left_idem
2658 le_def_meet ~> le_iff_inf
2659 le_def_join ~> le_iff_sup
2660 join_absorp2 ~> sup_absorb2
2661 join_absorp1 ~> sup_absorb1
2662 meet_absorp1 ~> inf_absorb1
2663 meet_absorp2 ~> inf_absorb2
2664 meet_join_absorp ~> inf_sup_absorb
2665 join_meet_absorp ~> sup_inf_absorb
2666 distrib_join_le ~> distrib_sup_le
2667 distrib_meet_le ~> distrib_inf_le
2669 add_meet_distrib_left ~> add_inf_distrib_left
2670 add_join_distrib_left ~> add_sup_distrib_left
2671 is_join_neg_meet ~> is_join_neg_inf
2672 is_meet_neg_join ~> is_meet_neg_sup
2673 add_meet_distrib_right ~> add_inf_distrib_right
2674 add_join_distrib_right ~> add_sup_distrib_right
2675 add_meet_join_distribs ~> add_sup_inf_distribs
2676 join_eq_neg_meet ~> sup_eq_neg_inf
2677 meet_eq_neg_join ~> inf_eq_neg_sup
2678 add_eq_meet_join ~> add_eq_inf_sup
2679 meet_0_imp_0 ~> inf_0_imp_0
2680 join_0_imp_0 ~> sup_0_imp_0
2681 meet_0_eq_0 ~> inf_0_eq_0
2682 join_0_eq_0 ~> sup_0_eq_0
2683 neg_meet_eq_join ~> neg_inf_eq_sup
2684 neg_join_eq_meet ~> neg_sup_eq_inf
2685 join_eq_if ~> sup_eq_if
2687 mono_meet ~> mono_inf
2688 mono_join ~> mono_sup
2689 meet_bool_eq ~> inf_bool_eq
2690 join_bool_eq ~> sup_bool_eq
2691 meet_fun_eq ~> inf_fun_eq
2692 join_fun_eq ~> sup_fun_eq
2693 meet_set_eq ~> inf_set_eq
2694 join_set_eq ~> sup_set_eq
2695 meet1_iff ~> inf1_iff
2696 meet2_iff ~> inf2_iff
2705 join1_iff ~> sup1_iff
2706 join2_iff ~> sup2_iff
2716 is_meet_Meet ~> is_meet_Inf
2717 Meet_bool_def ~> Inf_bool_def
2718 Meet_fun_def ~> Inf_fun_def
2719 Meet_greatest ~> Inf_greatest
2720 Meet_lower ~> Inf_lower
2721 Meet_set_def ~> Inf_set_def
2724 Sup_bool_eq ~> Sup_bool_def
2725 Sup_fun_eq ~> Sup_fun_def
2726 Sup_set_eq ~> Sup_set_def
2728 listsp_meetI ~> listsp_infI
2729 listsp_meet_eq ~> listsp_inf_eq
2734 * Added syntactic class "size"; overloaded constant "size" now has
2735 type "'a::size ==> bool"
2737 * Internal reorganisation of `size' of datatypes: size theorems
2738 "foo.size" are no longer subsumed by "foo.simps" (but are still
2739 simplification rules by default!); theorems "prod.size" now named
2742 * Class "div" now inherits from class "times" rather than "type".
2745 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2746 Linorder etc. have disappeared; operations defined in terms of
2747 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2749 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2751 * HOL-Word: New extensive library and type for generic, fixed size
2752 machine words, with arithemtic, bit-wise, shifting and rotating
2753 operations, reflection into int, nat, and bool lists, automation for
2754 linear arithmetic (by automatic reflection into nat or int), including
2755 lemmas on overflow and monotonicity. Instantiated to all appropriate
2756 arithmetic type classes, supporting automatic simplification of
2757 numerals on all operations.
2759 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2761 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2763 * Code generator library theories:
2764 - Code_Integer represents HOL integers by big integer literals in target
2766 - Code_Char represents HOL characters by character literals in target
2768 - Code_Char_chr like Code_Char, but also offers treatment of character
2769 codes; includes Code_Integer.
2770 - Executable_Set allows to generate code for finite sets using lists.
2771 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2773 - Executable_Real implements a subset of real numbers, namly those
2774 representable by rational numbers.
2775 - Efficient_Nat implements natural numbers by integers, which in general will
2776 result in higher efficency; pattern matching with 0/Suc is eliminated;
2777 includes Code_Integer.
2778 - Code_Index provides an additional datatype index which is mapped to
2779 target-language built-in integers.
2780 - Code_Message provides an additional datatype message_string which is isomorphic to
2781 strings; messages are mapped to target-language strings.
2783 * New package for inductive predicates
2785 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2788 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2789 for z_1 :: U_1 and ... and z_n :: U_m
2791 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2794 with full support for type-inference, rather than
2796 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2798 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2799 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2801 inductive "s z_1 ... z_m"
2803 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2806 For backward compatibility, there is a wrapper allowing inductive
2807 sets to be defined with the new package via
2810 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2811 for z_1 :: U_1 and ... and z_n :: U_m
2813 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2819 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2820 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2821 for z_1 :: U_1 and ... and z_n :: U_m
2823 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2824 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2827 if the additional syntax "p ..." is required.
2829 Numerous examples can be found in the subdirectories src/HOL/Auth,
2830 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2834 - Since declaration and definition of inductive sets or predicates
2835 is no longer separated, abbreviations involving the newly
2836 introduced sets or predicates must be specified together with the
2837 introduction rules after the 'where' keyword (see above), rather
2838 than before the actual inductive definition.
2840 - The variables in induction and elimination rules are now
2841 quantified in the order of their occurrence in the introduction
2842 rules, rather than in alphabetical order. Since this may break
2843 some proofs, these proofs either have to be repaired, e.g. by
2844 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2845 statements of the form
2847 case (rule_i a_i_1 ... a_i_{k_i})
2849 or the old order of quantification has to be restored by explicitly adding
2850 meta-level quantifiers in the introduction rules, i.e.
2852 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2854 - The format of the elimination rules is now
2856 p z_1 ... z_m x_1 ... x_n ==>
2857 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2862 (x_1, ..., x_n) : s z_1 ... z_m ==>
2863 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2866 for sets rather than
2868 x : s z_1 ... z_m ==>
2869 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2872 This may require terms in goals to be expanded to n-tuples
2873 (e.g. using case_tac or simplification with the split_paired_all
2874 rule) before the above elimination rule is applicable.
2876 - The elimination or case analysis rules for (mutually) inductive
2877 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2878 list of rules "p_1_..._p_k.elims" is no longer available.
2880 * New package "function"/"fun" for general recursive functions,
2881 supporting mutual and nested recursion, definitions in local contexts,
2882 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2883 for small examples, and the separate tutorial on the function
2884 package. The old recdef "package" is still available as before, but
2885 users are encouraged to use the new package.
2887 * Method "lexicographic_order" automatically synthesizes termination
2888 relations as lexicographic combinations of size measures.
2890 * Case-expressions allow arbitrary constructor-patterns (including
2891 "_") and take their order into account, like in functional
2892 programming. Internally, this is translated into nested
2893 case-expressions; missing cases are added and mapped to the predefined
2894 constant "undefined". In complicated cases printing may no longer show
2895 the original input but the internal form. Lambda-abstractions allow
2896 the same form of pattern matching: "% pat1 => e1 | ..." is an
2897 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2900 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2901 is an abbreviation for "of_nat :: nat => int". The simplification
2902 rules for "of_nat" have been changed to work like "int" did
2903 previously. Potential INCOMPATIBILITY:
2904 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2905 - of_nat_diff and of_nat_mult are no longer default simp rules
2907 * Method "algebra" solves polynomial equations over (semi)rings using
2908 Groebner bases. The (semi)ring structure is defined by locales and the
2909 tool setup depends on that generic context. Installing the method for
2910 a specific type involves instantiating the locale and possibly adding
2911 declarations for computation on the coefficients. The method is
2912 already instantiated for natural numbers and for the axiomatic class
2913 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2914 CALCULEMUS 2007 for the general principles underlying this
2915 architecture of context-aware proof-tools.
2917 * Method "ferrack" implements quantifier elimination over
2918 special-purpose dense linear orders using locales (analogous to
2919 "algebra"). The method is already installed for class
2920 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2923 * Former constant "List.op @" now named "List.append". Use ML
2924 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2925 circumvent possible incompatibilities when working on ML level.
2927 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2929 * New function listsum :: 'a list => 'a for arbitrary monoids.
2930 Special syntax: "SUM x <- xs. f x" (and latex variants)
2932 * New syntax for Haskell-like list comprehension (input only), eg.
2933 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2935 * The special syntax for function "filter" has changed from [x :
2936 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2937 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2939 * [a..b] is now defined for arbitrary linear orders. It used to be
2940 defined on nat only, as an abbreviation for [a..<Suc b]
2943 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2945 * New functions "sorted" and "sort" in src/HOL/List.thy.
2947 * New lemma collection field_simps (an extension of ring_simps) for
2948 manipulating (in)equations involving division. Multiplies with all
2949 denominators that can be proved to be non-zero (in equations) or
2950 positive/negative (in inequations).
2952 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2953 have been improved and renamed to ring_simps, group_simps and
2954 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2955 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2957 * Theory Library/Commutative_Ring: switched from recdef to function
2958 package; constants add, mul, pow now curried. Infix syntax for
2959 algebraic operations.
2961 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2964 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2967 * HOL/records: generalised field-update to take a function on the
2968 field rather than the new value: r(|A := x|) is translated to A_update
2969 (K x) r The K-combinator that is internally used is called K_record.
2970 INCOMPATIBILITY: Usage of the plain update functions has to be
2973 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2974 * x = 0, which are required for a semiring. Richer structures do not
2975 inherit from semiring_0 anymore, because this property is a theorem
2976 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2977 there is more to prove, but this is mostly trivial.
2979 * Class "recpower" is generalized to arbitrary monoids, not just
2980 commutative semirings. INCOMPATIBILITY: may need to incorporate
2981 commutativity or semiring properties additionally.
2983 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2984 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2985 better use 'abbreviation'.
2987 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2989 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2990 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2991 significant changes for setting up numeral syntax for types:
2992 - New constants Numeral.pred and Numeral.succ instead
2993 of former Numeral.bin_pred and Numeral.bin_succ.
2994 - Use integer operations instead of bin_add, bin_mult and so on.
2995 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2996 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2998 See src/HOL/Integ/IntArith.thy for an example setup.
3000 * Command 'normal_form' computes the normal form of a term that may
3001 contain free variables. For example ``normal_form "rev [a, b, c]"''
3002 produces ``[b, c, a]'' (without proof). This command is suitable for
3003 heavy-duty computations because the functions are compiled to ML
3004 first. Correspondingly, a method "normalization" is provided. See
3005 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3007 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3008 25 like -->); output depends on the "iff" print_mode, the default is
3009 "A = B" (with priority 50).
3011 * Relations less (<) and less_eq (<=) are also available on type bool.
3012 Modified syntax to disallow nesting without explicit parentheses,
3013 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3016 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3018 * Relation composition operator "op O" now has precedence 75 and binds
3019 stronger than union and intersection. INCOMPATIBILITY.
3021 * The old set interval syntax "{m..n(}" (and relatives) has been
3022 removed. Use "{m..<n}" (and relatives) instead.
3024 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3025 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3026 ``declare [[simproc del: neq]]''.
3028 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3031 * Theorem Cons_eq_map_conv no longer declared as "simp".
3033 * Theorem setsum_mult renamed to setsum_right_distrib.
3035 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3038 * Reimplemented methods "sat" and "satx", with several improvements:
3039 goals no longer need to be stated as "<prems> ==> False", equivalences
3040 (i.e. "=" on type bool) are handled, variable names of the form
3041 "lit_<n>" are no longer reserved, significant speedup.
3043 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3044 zChaff is still supported as well.
3046 * 'inductive' and 'datatype': provide projections of mutual rules,
3047 bundled as foo_bar.inducts;
3049 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3052 * Library: moved theory Accessible_Part to main HOL.
3054 * Library: added theory Coinductive_List of potentially infinite lists
3055 as greatest fixed-point.
3057 * Library: added theory AssocList which implements (finite) maps as
3060 * Method "evaluation" solves goals (i.e. a boolean expression)
3061 efficiently by compiling it to ML. The goal is "proved" (via an
3062 oracle) if it evaluates to True.
3064 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3065 also when invoked by the simplifier. This results in the Simplifier
3066 being more powerful on arithmetic goals. INCOMPATIBILITY.
3067 Configuration option fast_arith_split_limit=0 recovers the old
3070 * Support for hex (0x20) and binary (0b1001) numerals.
3072 * New method: reify eqs (t), where eqs are equations for an
3073 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3074 parameter, computes a term s::'b and a list xs::'a list and proves the
3075 theorem I xs s = t. This is also known as reification or quoting. The
3076 resulting theorem is applied to the subgoal to substitute t with I xs
3077 s. If t is omitted, the subgoal itself is reified.
3079 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3080 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3081 where f is supposed to be a computable function (in the sense of code
3082 generattion). The method uses reify to compute s and xs as above then
3083 applies corr_thm and uses normalization by evaluation to "prove" f s =
3084 r and finally gets the theorem t = r, which is again applied to the
3085 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3087 * Reflection: Automatic reification now handels binding, an example is
3088 available in src/HOL/ex/ReflectionEx.thy
3090 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3091 command 'statespace' that is similar to 'record', but introduces an
3092 abstract specification based on the locale infrastructure instead of
3093 HOL types. This leads to extra flexibility in composing state spaces,
3094 in particular multiple inheritance and renaming of components.
3099 * Hyperreal: Functions root and sqrt are now defined on negative real
3100 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3101 Nonnegativity side conditions have been removed from many lemmas, so
3102 that more subgoals may now be solved by simplification; potential
3105 * Real: new type classes formalize real normed vector spaces and
3106 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3107 and norm :: 'a => real.
3109 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3110 reals into other types. The overloaded constant Reals :: 'a set is now
3111 defined as range of_real; potential INCOMPATIBILITY.
3113 * Real: proper support for ML code generation, including 'quickcheck'.
3114 Reals are implemented as arbitrary precision rationals.
3116 * Hyperreal: Several constants that previously worked only for the
3117 reals have been generalized, so they now work over arbitrary vector
3118 spaces. Type annotations may need to be added in some cases; potential
3121 Infinitesimal :: ('a::real_normed_vector) star set
3122 HFinite :: ('a::real_normed_vector) star set
3123 HInfinite :: ('a::real_normed_vector) star set
3124 approx :: ('a::real_normed_vector) star => 'a star => bool
3125 monad :: ('a::real_normed_vector) star => 'a star set
3126 galaxy :: ('a::real_normed_vector) star => 'a star set
3127 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3128 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3129 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3130 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3131 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3132 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3133 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3134 sgn :: 'a::real_normed_vector => 'a
3135 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3137 * Complex: Some complex-specific constants are now abbreviations for
3138 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3139 hnorm. Other constants have been entirely removed in favor of the
3140 polymorphic versions (INCOMPATIBILITY):
3144 HInfinite <-- CInfinite
3145 Infinitesimal <-- CInfinitesimal
3148 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3149 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3150 (ns)deriv <-- (ns)cderiv
3155 * Formalisation of ideals and the quotient construction over rings.
3157 * Order and lattice theory no longer based on records.
3160 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3161 greatest_closed. INCOMPATIBILITY.
3163 * Method algebra is now set up via an attribute. For examples see
3164 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3165 of algebraic structures.
3167 * Renamed theory CRing to Ring.
3172 * Substantial, yet incomplete support for nominal datatypes (binding
3173 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3174 src/HOL/Nominal/Examples. Prospective users should consult
3175 http://isabelle.in.tum.de/nominal/
3180 * ML basics: just one true type int, which coincides with IntInf.int
3183 * ML within Isar: antiquotations allow to embed statically-checked
3184 formal entities in the source, referring to the context available at
3185 compile-time. For example:
3187 ML {* @{sort "{zero,one}"} *}
3188 ML {* @{typ "'a => 'b"} *}
3189 ML {* @{term "%x. x"} *}
3190 ML {* @{prop "x == y"} *}
3191 ML {* @{ctyp "'a => 'b"} *}
3192 ML {* @{cterm "%x. x"} *}
3193 ML {* @{cprop "x == y"} *}
3194 ML {* @{thm asm_rl} *}
3195 ML {* @{thms asm_rl} *}
3196 ML {* @{type_name c} *}
3197 ML {* @{type_syntax c} *}
3198 ML {* @{const_name c} *}
3199 ML {* @{const_syntax c} *}
3202 ML {* @{theory Pure} *}
3203 ML {* @{theory_ref} *}
3204 ML {* @{theory_ref Pure} *}
3207 ML {* @{clasimpset} *}
3209 The same works for sources being ``used'' within an Isar context.
3211 * ML in Isar: improved error reporting; extra verbosity with
3212 ML_Context.trace enabled.
3214 * Pure/General/table.ML: the join operations now works via exceptions
3215 DUP/SAME instead of type option. This is simpler in simple cases, and
3216 admits slightly more efficient complex applications.
3218 * Pure: 'advanced' translation functions (parse_translation etc.) now
3219 use Context.generic instead of just theory.
3221 * Pure: datatype Context.generic joins theory/Proof.context and
3222 provides some facilities for code that works in either kind of
3223 context, notably GenericDataFun for uniform theory and proof data.
3225 * Pure: simplified internal attribute type, which is now always
3226 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3227 local (Proof.context) attributes have been discontinued, while
3228 minimizing code duplication. Thm.rule_attribute and
3229 Thm.declaration_attribute build canonical attributes; see also structure
3230 Context for further operations on Context.generic, notably
3231 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3232 declarations and definitions.
3234 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3235 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3236 init only required for impure data. INCOMPATIBILITY: empty really need
3237 to be empty (no dependencies on theory content!)
3239 * Pure/kernel: consts certification ignores sort constraints given in
3240 signature declarations. (This information is not relevant to the
3241 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3242 potential INCOMPATIBILITY.
3244 * Pure: axiomatic type classes are now purely definitional, with
3245 explicit proofs of class axioms and super class relations performed
3246 internally. See Pure/axclass.ML for the main internal interfaces --
3247 notably AxClass.define_class supercedes AxClass.add_axclass, and
3248 AxClass.axiomatize_class/classrel/arity supersede
3249 Sign.add_classes/classrel/arities.
3251 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3252 global/local versions on theory vs. Proof.context have been
3253 discontinued; Attrib.syntax and Method.syntax have been adapted
3254 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3255 attributes, methods, etc.
3257 * Pure: several functions of signature "... -> theory -> theory * ..."
3258 have been reoriented to "... -> theory -> ... * theory" in order to
3259 allow natural usage in combination with the ||>, ||>>, |-> and
3260 fold_map combinators.
3262 * Pure: official theorem names (closed derivations) and additional
3263 comments (tags) are now strictly separate. Name hints -- which are
3264 maintained as tags -- may be attached any time without affecting the
3267 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3268 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3269 achieve the old behaviour.
3271 * Pure: the "Goal" constant is now called "prop", supporting a
3272 slightly more general idea of ``protecting'' meta-level rule
3275 * Pure: Logic.(un)varify only works in a global context, which is now
3276 enforced instead of silently assumed. INCOMPATIBILITY, may use
3277 Logic.legacy_(un)varify as temporary workaround.
3279 * Pure: structure Name provides scalable operations for generating
3280 internal variable names, notably Name.variants etc. This replaces
3281 some popular functions from term.ML:
3283 Term.variant -> Name.variant
3284 Term.variantlist -> Name.variant_list
3285 Term.invent_names -> Name.invent_list
3287 Note that low-level renaming rarely occurs in new code -- operations
3288 from structure Variable are used instead (see below).
3290 * Pure: structure Variable provides fundamental operations for proper
3291 treatment of fixed/schematic variables in a context. For example,
3292 Variable.import introduces fixes for schematics of given facts and
3293 Variable.export reverses the effect (up to renaming) -- this replaces
3294 various freeze_thaw operations.
3296 * Pure: structure Goal provides simple interfaces for
3297 init/conclude/finish and tactical prove operations (replacing former
3298 Tactic.prove). Goal.prove is the canonical way to prove results
3299 within a given context; Goal.prove_global is a degraded version for
3300 theory level goals, including a global Drule.standard. Note that
3301 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3302 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3303 in a locale context).
3305 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3306 and type checking (Syntax.check_term etc.), with common combinations
3307 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3308 which are considered legacy and await removal.
3310 * Pure/Syntax: generic interfaces for type unchecking
3311 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3312 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3313 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3314 available for convenience, but refer to the very same operations using
3315 a mere theory instead of a full context.
3317 * Isar: simplified treatment of user-level errors, using exception
3318 ERROR of string uniformly. Function error now merely raises ERROR,
3319 without any side effect on output channels. The Isar toplevel takes
3320 care of proper display of ERROR exceptions. ML code may use plain
3321 handle/can/try; cat_error may be used to concatenate errors like this:
3323 ... handle ERROR msg => cat_error msg "..."
3325 Toplevel ML code (run directly or through the Isar toplevel) may be
3326 embedded into the Isar toplevel with exception display/debug like
3329 Isar.toplevel (fn () => ...)
3331 INCOMPATIBILITY, removed special transform_error facilities, removed
3332 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3333 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3334 -- use plain ERROR instead.
3336 * Isar: theory setup now has type (theory -> theory), instead of a
3337 list. INCOMPATIBILITY, may use #> to compose setup functions.
3339 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3340 ProofContext.debug/verbose flags.
3342 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3343 theory before entering a proof state. Transactions now always see a
3344 quasi-functional intermediate checkpoint, both in interactive and
3347 * Isar: simplified interfaces for outer syntax. Renamed
3348 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3349 OuterSyntax.add_parsers -- this functionality is now included in
3350 OuterSyntax.command etc. INCOMPATIBILITY.
3352 * Simplifier: the simpset of a running simplification process now
3353 contains a proof context (cf. Simplifier.the_context), which is the
3354 very context that the initial simpset has been retrieved from (by
3355 simpset_of/local_simpset_of). Consequently, all plug-in components
3356 (solver, looper etc.) may depend on arbitrary proof data.
3358 * Simplifier.inherit_context inherits the proof context (plus the
3359 local bounds) of the current simplification process; any simproc
3360 etc. that calls the Simplifier recursively should do this! Removed
3361 former Simplifier.inherit_bounds, which is already included here --
3362 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3363 specify an explicit context using Simplifier.context/theory_context.
3365 * Simplifier/Classical Reasoner: more abstract interfaces
3366 change_simpset/claset for modifying the simpset/claset reference of a
3367 theory; raw versions simpset/claset_ref etc. have been discontinued --
3370 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3376 * settings: the default heap location within ISABELLE_HOME_USER now
3377 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3378 Isabelle installations.
3380 * isabelle-process: option -S (secure mode) disables some critical
3381 operations, notably runtime compilation and evaluation of ML source
3384 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3386 * Support for parallel execution, using native multicore support of
3387 Poly/ML 5.1. The theory loader exploits parallelism when processing
3388 independent theories, according to the given theory header
3389 specifications. The maximum number of worker threads is specified via
3390 usedir option -M or the "max-threads" setting in Proof General. A
3391 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3392 to 6 on a 8-core machine. User-code needs to observe certain
3393 guidelines for thread-safe programming, see appendix A in the Isar
3394 Implementation manual.
3398 New in Isabelle2005 (October 2005)
3399 ----------------------------------
3403 * Theory headers: the new header syntax for Isar theories is
3406 imports <theory1> ... <theoryN>
3407 uses <file1> ... <fileM>
3410 where the 'uses' part is optional. The previous syntax
3412 theory <name> = <theory1> + ... + <theoryN>:
3414 will disappear in the next release. Use isatool fixheaders to convert
3415 existing theory files. Note that there is no change in ancient
3416 non-Isar theories now, but these will disappear soon.
3418 * Theory loader: parent theories can now also be referred to via
3419 relative and absolute paths.
3421 * Command 'find_theorems' searches for a list of criteria instead of a
3422 list of constants. Known criteria are: intro, elim, dest, name:string,
3423 simp:term, and any term. Criteria can be preceded by '-' to select
3424 theorems that do not match. Intro, elim, dest select theorems that
3425 match the current goal, name:s selects theorems whose fully qualified
3426 name contain s, and simp:term selects all simplification rules whose
3427 lhs match term. Any other term is interpreted as pattern and selects
3428 all theorems matching the pattern. Available in ProofGeneral under
3429 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3431 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3433 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3434 matching the current goal as introduction rule and not having "HOL."
3435 in their name (i.e. not being defined in theory HOL).
3437 * Command 'thms_containing' has been discontinued in favour of
3438 'find_theorems'; INCOMPATIBILITY.
3440 * Communication with Proof General is now 8bit clean, which means that
3441 Unicode text in UTF-8 encoding may be used within theory texts (both
3442 formal and informal parts). Cf. option -U of the Isabelle Proof
3443 General interface. Here are some simple examples (cf. src/HOL/ex):
3445 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3446 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3448 * Improved efficiency of the Simplifier and, to a lesser degree, the
3449 Classical Reasoner. Typical big applications run around 2 times
3453 *** Document preparation ***
3455 * Commands 'display_drafts' and 'print_drafts' perform simple output
3456 of raw sources. Only those symbols that do not require additional
3457 LaTeX packages (depending on comments in isabellesym.sty) are
3458 displayed properly, everything else is left verbatim. isatool display
3459 and isatool print are used as front ends (these are subject to the
3460 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3462 * Command tags control specific markup of certain regions of text,
3463 notably folding and hiding. Predefined tags include "theory" (for
3464 theory begin and end), "proof" for proof commands, and "ML" for
3465 commands involving ML code; the additional tags "visible" and
3466 "invisible" are unused by default. Users may give explicit tag
3467 specifications in the text, e.g. ''by %invisible (auto)''. The
3468 interpretation of tags is determined by the LaTeX job during document
3469 preparation: see option -V of isatool usedir, or options -n and -t of
3470 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3473 Several document versions may be produced at the same time via isatool
3474 usedir (the generated index.html will link all of them). Typical
3475 specifications include ''-V document=theory,proof,ML'' to present
3476 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3477 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3478 these parts without any formal replacement text. The Isabelle site
3479 default settings produce ''document'' and ''outline'' versions as
3482 * Several new antiquotations:
3484 @{term_type term} prints a term with its type annotated;
3486 @{typeof term} prints the type of a term;
3488 @{const const} is the same as @{term const}, but checks that the
3489 argument is a known logical constant;
3491 @{term_style style term} and @{thm_style style thm} print a term or
3492 theorem applying a "style" to it
3496 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3497 definitions, equations, inequations etc., 'concl' printing only the
3498 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3499 to print the specified premise. TermStyle.add_style provides an ML
3500 interface for introducing further styles. See also the "LaTeX Sugar"
3501 document practical applications. The ML antiquotation prints
3502 type-checked ML expressions verbatim.
3504 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3505 and 'text' support optional locale specification '(in loc)', which
3506 specifies the default context for interpreting antiquotations. For
3507 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3509 * Option 'locale=NAME' of antiquotations specifies an alternative
3510 context interpreting the subsequent argument. For example: @{thm
3511 [locale=lattice] inf_assoc}.
3513 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3516 * Proper output of antiquotations for theory commands involving a
3517 proof context (such as 'locale' or 'theorem (in loc) ...').
3519 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3520 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3522 * isatool usedir: new option -C (default true) controls whether option
3523 -D should include a copy of the original document directory; -C false
3524 prevents unwanted effects such as copying of administrative CVS data.
3529 * Considerably improved version of 'constdefs' command. Now performs
3530 automatic type-inference of declared constants; additional support for
3531 local structure declarations (cf. locales and HOL records), see also
3532 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3533 sequential dependencies of definitions within a single 'constdefs'
3534 section; moreover, the declared name needs to be an identifier. If
3535 all fails, consider to fall back on 'consts' and 'defs' separately.
3537 * Improved indexed syntax and implicit structures. First of all,
3538 indexed syntax provides a notational device for subscripted
3539 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3540 expressions. Secondly, in a local context with structure
3541 declarations, number indexes \<^sub>n or the empty index (default
3542 number 1) refer to a certain fixed variable implicitly; option
3543 show_structs controls printing of implicit structures. Typical
3544 applications of these concepts involve record types and locales.
3546 * New command 'no_syntax' removes grammar declarations (and
3547 translations) resulting from the given syntax specification, which is
3548 interpreted in the same manner as for the 'syntax' command.
3550 * 'Advanced' translation functions (parse_translation etc.) may depend
3551 on the signature of the theory context being presently used for
3552 parsing/printing, see also isar-ref manual.
3554 * Improved 'oracle' command provides a type-safe interface to turn an
3555 ML expression of type theory -> T -> term into a primitive rule of
3556 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3557 is already included here); see also FOL/ex/IffExample.thy;
3560 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3561 before); "cI" is no longer bound, use "c.intro" instead.
3562 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3563 axclasses vs. locales.
3565 * Improved internal renaming of symbolic identifiers -- attach primes
3566 instead of base 26 numbers.
3568 * New flag show_question_marks controls printing of leading question
3569 marks in schematic variable names.
3571 * In schematic variable names, *any* symbol following \<^isub> or
3572 \<^isup> is now treated as part of the base name. For example, the
3573 following works without printing of awkward ".0" indexes:
3575 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3578 * Inner syntax includes (*(*nested*) comments*).
3580 * Pretty printer now supports unbreakable blocks, specified in mixfix
3581 annotations as "(00...)".
3583 * Clear separation of logical types and nonterminals, where the latter
3584 may only occur in 'syntax' specifications or type abbreviations.
3585 Before that distinction was only partially implemented via type class
3586 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3587 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3588 exotic syntax specifications may require further adaption
3589 (e.g. Cube/Cube.thy).
3591 * Removed obsolete type class "logic", use the top sort {} instead.
3592 Note that non-logical types should be declared as 'nonterminals'
3593 rather than 'types'. INCOMPATIBILITY for new object-logic
3596 * Attributes 'induct' and 'cases': type or set names may now be
3597 locally fixed variables as well.
3599 * Simplifier: can now control the depth to which conditional rewriting
3600 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3603 * Simplifier: simplification procedures may now take the current
3604 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3605 interface), which is very useful for calling the Simplifier
3606 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3607 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3608 low-level mk_simproc no longer applies Logic.varify internally, to
3609 allow for use in a context of fixed variables.
3611 * thin_tac now works even if the assumption being deleted contains !!
3612 or ==>. More generally, erule now works even if the major premise of
3613 the elimination rule contains !! or ==>.
3615 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3617 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3618 from Pure, which contains all common declarations already. Both
3619 theories are defined via plain Isabelle/Isar .thy files.
3620 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3621 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3622 use isatool fixcpure to adapt your theory and ML sources.
3624 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3625 selections of theorems in named facts via index ranges.
3627 * 'print_theorems': in theory mode, really print the difference
3628 wrt. the last state (works for interactive theory development only),
3629 in proof mode print all local facts (cf. 'print_facts');
3631 * 'hide': option '(open)' hides only base names.
3633 * More efficient treatment of intermediate checkpoints in interactive
3636 * Code generator is now invoked via code_module (incremental code
3637 generation) and code_library (modular code generation, ML structures
3638 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3639 must be quoted when used as identifiers.
3641 * New 'value' command for reading, evaluating and printing terms using
3642 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3643 quoted when used as identifier.
3648 * New commands for the interpretation of locale expressions in
3649 theories (1), locales (2) and proof contexts (3). These generate
3650 proof obligations from the expression specification. After the
3651 obligations have been discharged, theorems of the expression are added
3652 to the theory, target locale or proof context. The synopsis of the
3653 commands is a follows:
3655 (1) interpretation expr inst
3656 (2) interpretation target < expr
3657 (3) interpret expr inst
3659 Interpretation in theories and proof contexts require a parameter
3660 instantiation of terms from the current context. This is applied to
3661 specifications and theorems of the interpreted expression.
3662 Interpretation in locales only permits parameter renaming through the
3663 locale expression. Interpretation is smart in that interpretations
3664 that are active already do not occur in proof obligations, neither are
3665 instantiated theorems stored in duplicate. Use 'print_interps' to
3666 inspect active interpretations of a particular locale. For details,
3667 see the Isar Reference manual. Examples can be found in
3668 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3670 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3671 'interpret' instead.
3673 * New context element 'constrains' for adding type constraints to
3676 * Context expressions: renaming of parameters with syntax
3679 * Locale declaration: 'includes' disallowed.
3681 * Proper static binding of attribute syntax -- i.e. types / terms /
3682 facts mentioned as arguments are always those of the locale definition
3683 context, independently of the context of later invocations. Moreover,
3684 locale operations (renaming and type / term instantiation) are applied
3685 to attribute arguments as expected.
3687 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3688 actual attributes; rare situations may require Attrib.attribute to
3689 embed those attributes into Attrib.src that lack concrete syntax.
3690 Attribute implementations need to cooperate properly with the static
3691 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3692 Attrib.XXX_thm etc. already do the right thing without further
3693 intervention. Only unusual applications -- such as "where" or "of"
3694 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3695 on the context and the facts involved -- may have to assign parsed
3696 values to argument tokens explicitly.
3698 * Changed parameter management in theorem generation for long goal
3699 statements with 'includes'. INCOMPATIBILITY: produces a different
3700 theorem statement in rare situations.
3702 * Locale inspection command 'print_locale' omits notes elements. Use
3703 'print_locale!' to have them included in the output.
3708 * Provers/hypsubst.ML: improved version of the subst method, for
3709 single-step rewriting: it now works in bound variable contexts. New is
3710 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3711 rewrite a different subterm than the original subst method, which is
3712 still available as 'simplesubst'.
3714 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3717 * Provers/trancl.ML: new transitivity reasoner for transitive and
3718 reflexive-transitive closure of relations.
3720 * Provers/blast.ML: new reference depth_limit to make blast's depth
3721 limit (previously hard-coded with a value of 20) user-definable.
3723 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3724 is peformed already. Object-logics merely need to finish their
3725 initial simpset configuration as before. INCOMPATIBILITY.
3730 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3733 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3735 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3736 and x-symbol; use option '-m epsilon' to get it actually printed.
3737 Moreover, the mathematically important symbolic identifier \<epsilon>
3738 becomes available as variable, constant etc. INCOMPATIBILITY,
3740 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3741 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3742 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3743 support corresponding Isar calculations.
3745 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3748 * theory SetInterval: changed the syntax for open intervals:
3757 The old syntax is still supported but will disappear in the next
3758 release. For conversion use the following Emacs search and replace
3759 patterns (these are not perfect but work quite well):
3761 {)\([^\.]*\)\.\. -> {\1<\.\.}
3762 \.\.\([^(}]*\)(} -> \.\.<\1}
3764 * Theory Commutative_Ring (in Library): method comm_ring for proving
3765 equalities in commutative rings; method 'algebra' provides a generic
3768 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3769 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3770 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3773 Some new syntax forms are available:
3775 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3776 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3777 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3778 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3780 The latter form "\<Sum>x < k. e" used to be based on a separate
3781 function "Summation", which has been discontinued.
3783 * theory Finite_Set: in structured induction proofs, the insert case
3784 is now 'case (insert x F)' instead of the old counterintuitive 'case
3787 * The 'refute' command has been extended to support a much larger
3788 fragment of HOL, including axiomatic type classes, constdefs and
3789 typedefs, inductive datatypes and recursion.
3791 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3792 Requires zChaff with proof generation to be installed. See
3793 HOL/ex/SAT_Examples.thy for examples.
3795 * Datatype induction via method 'induct' now preserves the name of the
3796 induction variable. For example, when proving P(xs::'a list) by
3797 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3798 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3799 in unstructured proof scripts.
3801 * Reworked implementation of records. Improved scalability for
3802 records with many fields, avoiding performance problems for type
3803 inference. Records are no longer composed of nested field types, but
3804 of nested extension types. Therefore the record type only grows linear
3805 in the number of extensions and not in the number of fields. The
3806 top-level (users) view on records is preserved. Potential
3807 INCOMPATIBILITY only in strange cases, where the theory depends on the
3808 old record representation. The type generated for a record is called
3809 <record_name>_ext_type.
3811 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3812 proofs triggered by a record definition or a simproc (if
3813 quick_and_dirty is enabled). Definitions of large records can take
3816 New simproc record_upd_simproc for simplification of multiple record
3817 updates enabled by default. Moreover, trivial updates are also
3818 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3819 occasionally, since simplification is more powerful by default.
3821 * typedef: proper support for polymorphic sets, which contain extra
3822 type-variables in the term.
3824 * Simplifier: automatically reasons about transitivity chains
3825 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3826 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3827 old proofs break occasionally as simplification may now solve more
3828 goals than previously.
3830 * Simplifier: converts x <= y into x = y if assumption y <= x is
3831 present. Works for all partial orders (class "order"), in particular
3832 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3835 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3836 bound variable or a constant then the let is unfolded. Otherwise
3837 first a is simplified to b, and then f b is simplified to g. If
3838 possible we abstract b from g arriving at "let x = b in h x",
3839 otherwise we unfold the let and arrive at g. The simproc can be
3840 enabled/disabled by the reference use_let_simproc. Potential
3841 INCOMPATIBILITY since simplification is more powerful by default.
3843 * Classical reasoning: the meson method now accepts theorems as arguments.
3845 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3846 jobs to provide advice on the provability of subgoals.
3848 * Theory OrderedGroup and Ring_and_Field: various additions and
3849 improvements to faciliate calculations involving equalities and
3852 The following theorems have been eliminated or modified
3855 abs_eq now named abs_of_nonneg
3856 abs_of_ge_0 now named abs_of_nonneg
3857 abs_minus_eq now named abs_of_nonpos
3858 imp_abs_id now named abs_of_nonneg
3859 imp_abs_neg_id now named abs_of_nonpos
3860 mult_pos now named mult_pos_pos
3861 mult_pos_le now named mult_nonneg_nonneg
3862 mult_pos_neg_le now named mult_nonneg_nonpos
3863 mult_pos_neg2_le now named mult_nonneg_nonpos2
3864 mult_neg now named mult_neg_neg
3865 mult_neg_le now named mult_nonpos_nonpos
3867 * The following lemmas in Ring_and_Field have been added to the simplifier:
3870 not_square_less_zero
3872 The following lemmas have been deleted from Real/RealPow:
3882 * Theory Parity: added rules for simplifying exponents.
3886 The following theorems have been eliminated or modified
3889 list_all_Nil now named list_all.simps(1)
3890 list_all_Cons now named list_all.simps(2)
3891 list_all_conv now named list_all_iff
3892 set_mem_eq now named mem_iff
3894 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3895 asymptotic "big O" calculations. See the notes in BigO.thy.
3900 * Theory RealDef: better support for embedding natural numbers and
3901 integers in the reals.
3903 The following theorems have been eliminated or modified
3906 exp_ge_add_one_self now requires no hypotheses
3907 real_of_int_add reversed direction of equality (use [symmetric])
3908 real_of_int_minus reversed direction of equality (use [symmetric])
3909 real_of_int_diff reversed direction of equality (use [symmetric])
3910 real_of_int_mult reversed direction of equality (use [symmetric])
3912 * Theory RComplete: expanded support for floor and ceiling functions.
3914 * Theory Ln is new, with properties of the natural logarithm
3916 * Hyperreal: There is a new type constructor "star" for making
3917 nonstandard types. The old type names are now type synonyms:
3921 hcomplex = complex star
3923 * Hyperreal: Many groups of similarly-defined constants have been
3924 replaced by polymorphic versions (INCOMPATIBILITY):
3926 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3928 starset <-- starsetNat, starsetC
3929 *s* <-- *sNat*, *sc*
3930 starset_n <-- starsetNat_n, starsetC_n
3931 *sn* <-- *sNatn*, *scn*
3932 InternalSets <-- InternalNatSets, InternalCSets
3934 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3935 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3936 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3937 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3938 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3940 * Hyperreal: Many type-specific theorems have been removed in favor of
3941 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3943 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3944 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3945 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3946 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3947 right_minus <-- hypreal_add_minus
3948 left_minus <-- {hypreal,hcomplex}_add_minus_left
3949 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3950 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3951 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3952 mult_1_right <-- hcomplex_mult_one_right
3953 mult_zero_left <-- hcomplex_mult_zero_left
3954 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3955 right_distrib <-- hypnat_add_mult_distrib2
3956 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3957 right_inverse <-- hypreal_mult_inverse
3958 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3959 order_refl <-- {hypreal,hypnat}_le_refl
3960 order_trans <-- {hypreal,hypnat}_le_trans
3961 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3962 order_less_le <-- {hypreal,hypnat}_less_le
3963 linorder_linear <-- {hypreal,hypnat}_le_linear
3964 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3965 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3966 add_nonneg_nonneg <-- hypreal_le_add_order
3968 * Hyperreal: Separate theorems having to do with type-specific
3969 versions of constants have been merged into theorems that apply to the
3970 new polymorphic constants (INCOMPATIBILITY):
3972 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3973 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3974 STAR_Un <-- {STAR,NatStar,STARC}_Un
3975 STAR_Int <-- {STAR,NatStar,STARC}_Int
3976 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3977 STAR_subset <-- {STAR,NatStar,STARC}_subset
3978 STAR_mem <-- {STAR,NatStar,STARC}_mem
3979 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3980 STAR_diff <-- {STAR,STARC}_diff
3981 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3982 STARC_hcomplex_of_complex}_image_subset
3983 starset_n_Un <-- starset{Nat,C}_n_Un
3984 starset_n_Int <-- starset{Nat,C}_n_Int
3985 starset_n_Compl <-- starset{Nat,C}_n_Compl
3986 starset_n_diff <-- starset{Nat,C}_n_diff
3987 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3988 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3989 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3990 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3991 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3992 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3993 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3994 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3995 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3996 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3997 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3998 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3999 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4000 starfun_diff <-- starfun{C,RC,CR}_diff
4001 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4002 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4003 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4004 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4005 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4006 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4007 starfun_Id <-- starfunC_Id
4008 starfun_approx <-- starfun{Nat,CR}_approx
4009 starfun_capprox <-- starfun{C,RC}_capprox
4010 starfun_abs <-- starfunNat_rabs
4011 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4012 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4013 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4014 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4015 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4016 starfun_add_approx <-- starfunCR_add_approx
4017 starfun_inverse_inverse <-- starfunC_inverse_inverse
4018 starfun_divide <-- starfun{C,CR,RC}_divide
4019 starfun_n <-- starfun{Nat,C}_n
4020 starfun_n_mult <-- starfun{Nat,C}_n_mult
4021 starfun_n_add <-- starfun{Nat,C}_n_add
4022 starfun_n_add_minus <-- starfunNat_n_add_minus
4023 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4024 starfun_n_minus <-- starfun{Nat,C}_n_minus
4025 starfun_n_eq <-- starfun{Nat,C}_n_eq
4027 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4028 star_n_minus <-- {hypreal,hcomplex}_minus
4029 star_n_diff <-- {hypreal,hcomplex}_diff
4030 star_n_mult <-- {hypreal,hcomplex}_mult
4031 star_n_inverse <-- {hypreal,hcomplex}_inverse
4032 star_n_le <-- {hypreal,hypnat}_le
4033 star_n_less <-- {hypreal,hypnat}_less
4034 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4035 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4036 star_n_abs <-- hypreal_hrabs
4037 star_n_divide <-- hcomplex_divide
4039 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4040 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4041 star_of_diff <-- hypreal_of_real_diff
4042 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4043 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4044 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4045 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4046 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4047 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4048 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4049 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4050 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4051 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4052 star_of_number_of <-- {hypreal,hcomplex}_number_of
4053 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4054 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4055 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4056 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4057 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4058 star_of_power <-- hypreal_of_real_power
4059 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4061 * Hyperreal: new method "transfer" that implements the transfer
4062 principle of nonstandard analysis. With a subgoal that mentions
4063 nonstandard types like "'a star", the command "apply transfer"
4064 replaces it with an equivalent one that mentions only standard types.
4065 To be successful, all free variables must have standard types; non-
4066 standard variables must have explicit universal quantifiers.
4068 * Hyperreal: A theory of Taylor series.
4073 * Discontinued special version of 'constdefs' (which used to support
4074 continuous functions) in favor of the general Pure one with full
4077 * New simplification procedure for solving continuity conditions; it
4078 is much faster on terms with many nested lambda abstractions (cubic
4079 instead of exponential time).
4081 * New syntax for domain package: selector names are now optional.
4082 Parentheses should be omitted unless argument is lazy, for example:
4084 domain 'a stream = cons "'a" (lazy "'a stream")
4086 * New command 'fixrec' for defining recursive functions with pattern
4087 matching; defining multiple functions with mutual recursion is also
4088 supported. Patterns may include the constants cpair, spair, up, sinl,
4089 sinr, or any data constructor defined by the domain package. The given
4090 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4091 syntax and examples.
4093 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4094 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4095 but the proof obligation additionally includes an admissibility
4096 requirement. The packages generate instances of class cpo or pcpo,
4097 with continuity and strictness theorems for Rep and Abs.
4099 * HOLCF: Many theorems have been renamed according to a more standard naming
4100 scheme (INCOMPATIBILITY):
4102 foo_inject: "foo$x = foo$y ==> x = y"
4103 foo_eq: "(foo$x = foo$y) = (x = y)"
4104 foo_less: "(foo$x << foo$y) = (x << y)"
4105 foo_strict: "foo$UU = UU"
4106 foo_defined: "... ==> foo$x ~= UU"
4107 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4112 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4113 including the First Isomorphism Theorem (on quotienting by the kernel
4116 * ZF/Simplifier: install second copy of type solver that actually
4117 makes use of TC rules declared to Isar proof contexts (or locales);
4118 the old version is still required for ML proof scripts.
4123 * Converted to Isar theory format; use locales instead of axiomatic
4129 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4132 * Pure/library.ML no longer defines its own option datatype, but uses
4133 that of the SML basis, which has constructors NONE and SOME instead of
4134 None and Some, as well as exception Option.Option instead of OPTION.
4135 The functions the, if_none, is_some, is_none have been adapted
4136 accordingly, while Option.map replaces apsome.
4138 * Pure/library.ML: the exception LIST has been given up in favour of
4139 the standard exceptions Empty and Subscript, as well as
4140 Library.UnequalLengths. Function like Library.hd and Library.tl are
4141 superceded by the standard hd and tl functions etc.
4143 A number of basic list functions are no longer exported to the ML
4144 toplevel, as they are variants of predefined functions. The following
4145 suggests how one can translate existing code:
4147 rev_append xs ys = List.revAppend (xs, ys)
4148 nth_elem (i, xs) = List.nth (xs, i)
4149 last_elem xs = List.last xs
4150 flat xss = List.concat xss
4151 seq fs = List.app fs
4152 partition P xs = List.partition P xs
4153 mapfilter f xs = List.mapPartial f xs
4155 * Pure/library.ML: several combinators for linear functional
4156 transformations, notably reverse application and composition:
4159 (x, y) |-> f f #-> g
4161 * Pure/library.ML: introduced/changed precedence of infix operators:
4163 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4165 infix 3 o oo ooo oooo;
4166 infix 4 ~~ upto downto;
4168 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4171 * Pure/library.ML: natural list combinators fold, fold_rev, and
4172 fold_map support linear functional transformations and nesting. For
4175 fold f [x1, ..., xN] y =
4176 y |> f x1 |> ... |> f xN
4178 (fold o fold) f [xs1, ..., xsN] y =
4179 y |> fold f xs1 |> ... |> fold f xsN
4181 fold f [x1, ..., xN] =
4184 (fold o fold) f [xs1, ..., xsN] =
4185 fold f xs1 #> ... #> fold f xsN
4187 * Pure/library.ML: the following selectors on type 'a option are
4190 the: 'a option -> 'a (*partial*)
4191 these: 'a option -> 'a where 'a = 'b list
4192 the_default: 'a -> 'a option -> 'a
4193 the_list: 'a option -> 'a list
4195 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4196 basic operations for association lists, following natural argument
4197 order; moreover the explicit equality predicate passed here avoids
4198 potentially expensive polymorphic runtime equality checks.
4199 The old functions may be expressed as follows:
4201 assoc = uncurry (AList.lookup (op =))
4202 assocs = these oo AList.lookup (op =)
4203 overwrite = uncurry (AList.update (op =)) o swap
4205 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4207 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4208 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4210 replacing make_keylist and keyfilter (occassionally used)
4213 make_keylist = AList.make
4214 keyfilter = AList.find (op =)
4216 * eq_fst and eq_snd now take explicit equality parameter, thus
4217 avoiding eqtypes. Naive rewrites:
4219 eq_fst = eq_fst (op =)
4220 eq_snd = eq_snd (op =)
4222 * Removed deprecated apl and apr (rarely used).
4225 apl (n, op) =>>= curry op n
4226 apr (op, m) =>>= fn n => op (n, m)
4228 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4229 provides a reasonably efficient light-weight implementation of sets as
4232 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4233 few new operations; existing lookup and update are now curried to
4234 follow natural argument order (for use with fold etc.);
4235 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4237 * Pure/General: output via the Isabelle channels of
4238 writeln/warning/error etc. is now passed through Output.output, with a
4239 hook for arbitrary transformations depending on the print_mode
4240 (cf. Output.add_mode -- the first active mode that provides a output
4241 function wins). Already formatted output may be embedded into further
4242 text via Output.raw; the result of Pretty.string_of/str_of and derived
4243 functions (string_of_term/cterm/thm etc.) is already marked raw to
4244 accommodate easy composition of diagnostic messages etc. Programmers
4245 rarely need to care about Output.output or Output.raw at all, with
4246 some notable exceptions: Output.output is required when bypassing the
4247 standard channels (writeln etc.), or in token translations to produce
4248 properly formatted results; Output.raw is required when capturing
4249 already output material that will eventually be presented to the user
4250 a second time. For the default print mode, both Output.output and
4251 Output.raw have no effect.
4253 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4254 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4255 cumulative results are displayed at the end of a batch session.
4257 * Pure/General: File.sysify_path and File.quote_sysify path have been
4258 replaced by File.platform_path and File.shell_path (with appropriate
4259 hooks). This provides a clean interface for unusual systems where the
4260 internal and external process view of file names are different.
4262 * Pure: more efficient orders for basic syntactic entities: added
4263 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4264 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4265 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4266 orders now -- potential INCOMPATIBILITY for code that depends on a
4267 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4268 Library.sort_strings on result).
4270 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4271 fold_types traverse types/terms from left to right, observing natural
4272 argument order. Supercedes previous foldl_XXX versions, add_frees,
4273 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4275 * Pure: name spaces have been refined, with significant changes of the
4276 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4277 to extern(_table). The plain name entry path is superceded by a
4278 general 'naming' context, which also includes the 'policy' to produce
4279 a fully qualified name and external accesses of a fully qualified
4280 name; NameSpace.extend is superceded by context dependent
4281 Sign.declare_name. Several theory and proof context operations modify
4282 the naming context. Especially note Theory.restore_naming and
4283 ProofContext.restore_naming to get back to a sane state; note that
4284 Theory.add_path is no longer sufficient to recover from
4285 Theory.absolute_path in particular.
4287 * Pure: new flags short_names (default false) and unique_names
4288 (default true) for controlling output of qualified names. If
4289 short_names is set, names are printed unqualified. If unique_names is
4290 reset, the name prefix is reduced to the minimum required to achieve
4291 the original result when interning again, even if there is an overlap
4292 with earlier declarations.
4294 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4295 now 'extend', and 'merge' gets an additional Pretty.pp argument
4296 (useful for printing error messages). INCOMPATIBILITY.
4298 * Pure: major reorganization of the theory context. Type Sign.sg and
4299 Theory.theory are now identified, referring to the universal
4300 Context.theory (see Pure/context.ML). Actual signature and theory
4301 content is managed as theory data. The old code and interfaces were
4302 spread over many files and structures; the new arrangement introduces
4303 considerable INCOMPATIBILITY to gain more clarity:
4305 Context -- theory management operations (name, identity, inclusion,
4306 parents, ancestors, merge, etc.), plus generic theory data;
4308 Sign -- logical signature and syntax operations (declaring consts,
4309 types, etc.), plus certify/read for common entities;
4311 Theory -- logical theory operations (stating axioms, definitions,
4312 oracles), plus a copy of logical signature operations (consts,
4313 types, etc.); also a few basic management operations (Theory.copy,
4316 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4317 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4318 for convenience -- they merely return the theory.
4320 * Pure: type Type.tsig is superceded by theory in most interfaces.
4322 * Pure: the Isar proof context type is already defined early in Pure
4323 as Context.proof (note that ProofContext.context and Proof.context are
4324 aliases, where the latter is the preferred name). This enables other
4325 Isabelle components to refer to that type even before Isar is present.
4327 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4328 typeK, constK, axiomK, oracleK), but provide explicit operations for
4329 any of these kinds. For example, Sign.intern typeK is now
4330 Sign.intern_type, Theory.hide_space Sign.typeK is now
4331 Theory.hide_types. Also note that former
4332 Theory.hide_classes/types/consts are now
4333 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4334 internalize their arguments! INCOMPATIBILITY.
4336 * Pure: get_thm interface (of PureThy and ProofContext) expects
4337 datatype thmref (with constructors Name and NameSelection) instead of
4338 plain string -- INCOMPATIBILITY;
4340 * Pure: cases produced by proof methods specify options, where NONE
4341 means to remove case bindings -- INCOMPATIBILITY in
4344 * Pure: the following operations retrieve axioms or theorems from a
4345 theory node or theory hierarchy, respectively:
4347 Theory.axioms_of: theory -> (string * term) list
4348 Theory.all_axioms_of: theory -> (string * term) list
4349 PureThy.thms_of: theory -> (string * thm) list
4350 PureThy.all_thms_of: theory -> (string * thm) list
4352 * Pure: print_tac now outputs the goal through the trace channel.
4354 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4355 Reference Toplevel.debug (default false) controls detailed printing
4356 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4357 controls execution profiling -- set to 1 for time and 2 for space
4358 (both increase the runtime).
4360 * Isar session: The initial use of ROOT.ML is now always timed,
4361 i.e. the log will show the actual process times, in contrast to the
4362 elapsed wall-clock time that the outer shell wrapper produces.
4364 * Simplifier: improved handling of bound variables (nameless
4365 representation, avoid allocating new strings). Simprocs that invoke
4366 the Simplifier recursively should use Simplifier.inherit_bounds to
4367 avoid local name clashes. Failure to do so produces warnings
4368 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4369 for further details.
4371 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4372 bindings for all theorems stored within a given theory; this may help
4373 in porting non-Isar theories to Isar ones, while keeping ML proof
4374 scripts for the time being.
4376 * ML operator HTML.with_charset specifies the charset begin used for
4377 generated HTML files. For example:
4379 HTML.with_charset "utf-8" use_thy "Hebrew";
4380 HTML.with_charset "utf-8" use_thy "Chinese";
4385 * Allow symlinks to all proper Isabelle executables (Isabelle,
4386 isabelle, isatool etc.).
4388 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4389 isatool doc, isatool mkdir, display_drafts etc.).
4391 * isatool usedir: option -f allows specification of the ML file to be
4392 used by Isabelle; default is ROOT.ML.
4394 * New isatool version outputs the version identifier of the Isabelle
4395 distribution being used.
4397 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4398 (containing Boolean satisfiability problems) into Isabelle/HOL
4403 New in Isabelle2004 (April 2004)
4404 --------------------------------
4408 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4409 Replaces linorder.ML.
4411 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4412 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4413 (\<a>...\<z>), are now considered normal letters, and can therefore
4414 be used anywhere where an ASCII letter (a...zA...Z) has until
4415 now. COMPATIBILITY: This obviously changes the parsing of some
4416 terms, especially where a symbol has been used as a binder, say
4417 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4418 as an identifier. Fix it by inserting a space around former
4419 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4420 existing theory and ML files.
4422 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4424 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4425 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4426 a normal (but invisible) letter. For multiple letter subscripts repeat
4427 \<^isub> like this: x\<^isub>1\<^isub>2.
4429 * Pure: There are now sub-/superscripts that can span more than one
4430 character. Text between \<^bsub> and \<^esub> is set in subscript in
4431 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4432 superscript. The new control characters are not identifier parts.
4434 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4435 content of "..." to the latex file instead of \isacntrl... . The "..."
4436 may consist of any printable characters excluding the end bracket >.
4438 * Pure: Using new Isar command "finalconsts" (or the ML functions
4439 Theory.add_finals or Theory.add_finals_i) it is now possible to
4440 declare constants "final", which prevents their being given a definition
4441 later. It is useful for constants whose behaviour is fixed axiomatically
4442 rather than definitionally, such as the meta-logic connectives.
4444 * Pure: 'instance' now handles general arities with general sorts
4445 (i.e. intersections of classes),
4447 * Presentation: generated HTML now uses a CSS style sheet to make layout
4448 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4449 It can be changed to alter the colors/layout of generated pages.
4454 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4455 cut_tac, subgoal_tac and thin_tac:
4456 - Now understand static (Isar) contexts. As a consequence, users of Isar
4457 locales are no longer forced to write Isar proof scripts.
4458 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4460 - INCOMPATIBILITY: names of variables to be instantiated may no
4461 longer be enclosed in quotes. Instead, precede variable name with `?'.
4462 This is consistent with the instantiation attribute "where".
4464 * Attributes "where" and "of":
4465 - Now take type variables of instantiated theorem into account when reading
4466 the instantiation string. This fixes a bug that caused instantiated
4467 theorems to have too special types in some circumstances.
4468 - "where" permits explicit instantiations of type variables.
4470 * Calculation commands "moreover" and "also" no longer interfere with
4471 current facts ("this"), admitting arbitrary combinations with "then"
4475 - Goal statements involving the context element "includes" no longer
4476 generate theorems with internal delta predicates (those ending on
4477 "_axioms") in the premise.
4478 Resolve particular premise with <locale>.intro to obtain old form.
4479 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4480 specification and "includes" elements in goal statement.
4481 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4482 [intro?] and [elim?] (respectively) by default.
4483 - Experimental command for instantiation of locales in proof contexts:
4484 instantiate <label>[<attrs>]: <loc>
4485 Instantiates locale <loc> and adds all its theorems to the current context
4486 taking into account their attributes. Label and attrs are optional
4487 modifiers, like in theorem declarations. If present, names of
4488 instantiated theorems are qualified with <label>, and the attributes
4489 <attrs> are applied after any attributes these theorems might have already.
4490 If the locale has assumptions, a chained fact of the form
4491 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4492 are derived. The command does not support old-style locales declared
4493 with "locale (open)".
4494 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4496 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4502 * Proof import: new image HOL4 contains the imported library from
4503 the HOL4 system with about 2500 theorems. It is imported by
4504 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4505 can be used like any other Isabelle image. See
4506 HOL/Import/HOL/README for more information.
4509 - Much improved handling of linear and partial orders.
4510 Reasoners for linear and partial orders are set up for type classes
4511 "linorder" and "order" respectively, and are added to the default simpset
4512 as solvers. This means that the simplifier can build transitivity chains
4513 to solve goals from the assumptions.
4514 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4515 of blast or auto after simplification become unnecessary because the goal
4516 is solved by simplification already.
4518 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4519 all proved in axiomatic type classes for semirings, rings and fields.
4522 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4523 now formalized using the Ring_and_Field theory mentioned above.
4524 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4525 than before, because now they are set up once in a generic manner.
4526 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4527 Look for the general versions in Ring_and_Field (and Power if they concern
4530 * Type "rat" of the rational numbers is now available in HOL-Complex.
4533 - Record types are now by default printed with their type abbreviation
4534 instead of the list of all field types. This can be configured via
4535 the reference "print_record_type_abbr".
4536 - Simproc "record_upd_simproc" for simplification of multiple updates added
4537 (not enabled by default).
4538 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4539 EX x. x = sel r to True (not enabled by default).
4540 - Tactic "record_split_simp_tac" to split and simplify records added.
4542 * 'specification' command added, allowing for definition by
4543 specification. There is also an 'ax_specification' command that
4544 introduces the new constants axiomatically.
4546 * arith(_tac) is now able to generate counterexamples for reals as well.
4548 * HOL-Algebra: new locale "ring" for non-commutative rings.
4550 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4551 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4553 * HOL-Matrix: a first theory for matrices in HOL with an application of
4554 matrix theory to linear programming.
4556 * Unions and Intersections:
4557 The latex output syntax of UN and INT has been changed
4558 from "\Union x \in A. B" to "\Union_{x \in A} B"
4559 i.e. the index formulae has become a subscript.
4560 Similarly for "\Union x. B", and for \Inter instead of \Union.
4562 * Unions and Intersections over Intervals:
4563 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4564 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4565 like in normal math, and corresponding versions for < and for intersection.
4567 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4568 lexicographic dictonary ordering has been added as "lexord".
4570 * ML: the legacy theory structures Int and List have been removed. They had
4571 conflicted with ML Basis Library structures having the same names.
4573 * 'refute' command added to search for (finite) countermodels. Only works
4574 for a fragment of HOL. The installation of an external SAT solver is
4575 highly recommended. See "HOL/Refute.thy" for details.
4577 * 'quickcheck' command: Allows to find counterexamples by evaluating
4578 formulae under an assignment of free variables to random values.
4579 In contrast to 'refute', it can deal with inductive datatypes,
4580 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4586 * Streams now come with concatenation and are part of the HOLCF image
4590 New in Isabelle2003 (May 2003)
4591 ------------------------------
4595 * Provers/simplifier:
4597 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4598 Assumptions are now subject to complete mutual simplification,
4599 not just from left to right. The simplifier now preserves
4600 the order of assumptions.
4602 Potential INCOMPATIBILITY:
4604 -- simp sometimes diverges where the old version did
4605 not, e.g. invoking simp on the goal
4607 [| P (f x); y = x; f x = f y |] ==> Q
4609 now gives rise to the infinite reduction sequence
4611 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4613 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4616 -- Tactics combining classical reasoner and simplification (such as auto)
4617 are also affected by this change, because many of them rely on
4618 simp. They may sometimes diverge as well or yield a different numbers
4619 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4620 in case of problems. Sometimes subsequent calls to the classical
4621 reasoner will fail because a preceeding call to the simplifier too
4622 eagerly simplified the goal, e.g. deleted redundant premises.
4624 - The simplifier trace now shows the names of the applied rewrite rules
4626 - You can limit the number of recursive invocations of the simplifier
4627 during conditional rewriting (where the simplifie tries to solve the
4628 conditions before applying the rewrite rule):
4629 ML "simp_depth_limit := n"
4630 where n is an integer. Thus you can force termination where previously
4631 the simplifier would diverge.
4633 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4635 - No longer aborts on failed congruence proof. Instead, the
4636 congruence is ignored.
4638 * Pure: New generic framework for extracting programs from constructive
4639 proofs. See HOL/Extraction.thy for an example instantiation, as well
4640 as HOL/Extraction for some case studies.
4642 * Pure: The main goal of the proof state is no longer shown by default, only
4643 the subgoals. This behaviour is controlled by a new flag.
4644 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4645 (ML: Proof.show_main_goal).
4647 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4648 rules whose conclusion matches subgoal 1:
4649 PG menu: Isabelle/Isar -> Show me -> matching rules
4650 The rules are ordered by how closely they match the subgoal.
4651 In particular, rules that solve a subgoal outright are displayed first
4652 (or rather last, the way they are printed).
4653 (ML: ProofGeneral.print_intros())
4655 * Pure: New flag trace_unify_fail causes unification to print
4656 diagnostic information (PG: in trace buffer) when it fails. This is
4657 useful for figuring out why single step proofs like rule, erule or
4660 * Pure: Locale specifications now produce predicate definitions
4661 according to the body of text (covering assumptions modulo local
4662 definitions); predicate "loc_axioms" covers newly introduced text,
4663 while "loc" is cumulative wrt. all included locale expressions; the
4664 latter view is presented only on export into the global theory
4665 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4666 on the old view without predicates;
4668 * Pure: predefined locales "var" and "struct" are useful for sharing
4669 parameters (as in CASL, for example); just specify something like
4670 ``var x + var y + struct M'' as import;
4672 * Pure: improved thms_containing: proper indexing of facts instead of
4673 raw theorems; check validity of results wrt. current name space;
4674 include local facts of proof configuration (also covers active
4675 locales), cover fixed variables in index; may use "_" in term
4676 specification; an optional limit for the number of printed facts may
4677 be given (the default is 40);
4679 * Pure: disallow duplicate fact bindings within new-style theory files
4682 * Provers: improved induct method: assumptions introduced by case
4683 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4684 the goal statement); "foo" still refers to all facts collectively;
4686 * Provers: the function blast.overloaded has been removed: all constants
4687 are regarded as potentially overloaded, which improves robustness in exchange
4688 for slight decrease in efficiency;
4690 * Provers/linorder: New generic prover for transitivity reasoning over
4691 linear orders. Note: this prover is not efficient!
4693 * Isar: preview of problems to finish 'show' now produce an error
4694 rather than just a warning (in interactive mode);
4701 - Produces a counter example if it cannot prove a goal.
4702 Note that the counter example may be spurious if the goal is not a formula
4703 of quantifier-free linear arithmetic.
4704 In ProofGeneral the counter example appears in the trace buffer.
4706 - Knows about div k and mod k where k is a numeral of type nat or int.
4708 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4709 linear arithmetic fails. This takes account of quantifiers and divisibility.
4710 Presburger arithmetic can also be called explicitly via presburger(_tac).
4712 * simp's arithmetic capabilities have been enhanced a bit: it now
4713 takes ~= in premises into account (by performing a case split);
4715 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4716 are distributed over a sum of terms;
4718 * New tactic "trans_tac" and method "trans" instantiate
4719 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4722 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4723 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4725 * 'typedef' command has new option "open" to suppress the set
4728 * functions Min and Max on finite sets have been introduced (theory
4731 * attribute [symmetric] now works for relations as well; it turns
4732 (x,y) : R^-1 into (y,x) : R, and vice versa;
4734 * induct over a !!-quantified statement (say !!x1..xn):
4735 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4737 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4738 %x. None. Warning: empty_def now refers to the previously hidden definition
4741 * Algebra: formalization of classical algebra. Intended as base for
4742 any algebraic development in Isabelle. Currently covers group theory
4743 (up to Sylow's theorem) and ring theory (Universal Property of
4744 Univariate Polynomials). Contributions welcome;
4746 * GroupTheory: deleted, since its material has been moved to Algebra;
4748 * Complex: new directory of the complex numbers with numeric constants,
4749 nonstandard complex numbers, and some complex analysis, standard and
4750 nonstandard (Jacques Fleuriot);
4752 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4754 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4757 * Real/HahnBanach: updated and adapted to locales;
4759 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4762 * UNITY: added the Meier-Sanders theory of progress sets;
4764 * MicroJava: bytecode verifier and lightweight bytecode verifier
4765 as abstract algorithms, instantiated to the JVM;
4767 * Bali: Java source language formalization. Type system, operational
4768 semantics, axiomatic semantics. Supported language features:
4769 classes, interfaces, objects,virtual methods, static methods,
4770 static/instance fields, arrays, access modifiers, definite
4771 assignment, exceptions.
4776 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4779 * Main ZF: virtually all theories converted to new-style format;
4784 * Pure: Tactic.prove provides sane interface for internal proofs;
4785 omits the infamous "standard" operation, so this is more appropriate
4786 than prove_goalw_cterm in many situations (e.g. in simprocs);
4788 * Pure: improved error reporting of simprocs;
4790 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4794 *** Document preparation ***
4796 * uses \par instead of \\ for line breaks in theory text. This may
4797 shift some page breaks in large documents. To get the old behaviour
4798 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4800 * minimized dependencies of isabelle.sty and isabellesym.sty on
4803 * \<euro> now needs package babel/greek instead of marvosym (which
4806 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4811 New in Isabelle2002 (March 2002)
4812 --------------------------------
4814 *** Document preparation ***
4816 * greatly simplified document preparation setup, including more
4817 graceful interpretation of isatool usedir -i/-d/-D options, and more
4818 instructive isatool mkdir; users should basically be able to get
4819 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4820 users may run a separate document processing stage manually like this:
4821 "isatool usedir -D output HOL Test && isatool document Test/output";
4823 * theory dependency graph may now be incorporated into documents;
4824 isatool usedir -g true will produce session_graph.eps/.pdf for use
4825 with \includegraphics of LaTeX;
4827 * proper spacing of consecutive markup elements, especially text
4828 blocks after section headings;
4830 * support bold style (for single symbols only), input syntax is like
4831 this: "\<^bold>\<alpha>" or "\<^bold>A";
4833 * \<bullet> is now output as bold \cdot by default, which looks much
4834 better in printed text;
4836 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4837 note that these symbols are currently unavailable in Proof General /
4838 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4840 * isatool latex no longer depends on changed TEXINPUTS, instead
4841 isatool document copies the Isabelle style files to the target
4847 * Pure/Provers: improved proof by cases and induction;
4848 - 'case' command admits impromptu naming of parameters (such as
4850 - 'induct' method divinates rule instantiation from the inductive
4851 claim; no longer requires excessive ?P bindings for proper
4852 instantiation of cases;
4853 - 'induct' method properly enumerates all possibilities of set/type
4854 rules; as a consequence facts may be also passed through *type*
4855 rules without further ado;
4856 - 'induct' method now derives symbolic cases from the *rulified*
4857 rule (before it used to rulify cases stemming from the internal
4858 atomized version); this means that the context of a non-atomic
4859 statement becomes is included in the hypothesis, avoiding the
4860 slightly cumbersome show "PROP ?case" form;
4861 - 'induct' may now use elim-style induction rules without chaining
4862 facts, using ``missing'' premises from the goal state; this allows
4863 rules stemming from inductive sets to be applied in unstructured
4864 scripts, while still benefitting from proper handling of non-atomic
4865 statements; NB: major inductive premises need to be put first, all
4866 the rest of the goal is passed through the induction;
4867 - 'induct' proper support for mutual induction involving non-atomic
4868 rule statements (uses the new concept of simultaneous goals, see
4870 - append all possible rule selections, but only use the first
4871 success (no backtracking);
4872 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4873 - undeclared rule case names default to numbers 1, 2, 3, ...;
4874 - added 'print_induct_rules' (covered by help item in recent Proof
4876 - moved induct/cases attributes to Pure, methods to Provers;
4877 - generic method setup instantiated for FOL and HOL;
4879 * Pure: support multiple simultaneous goal statements, for example
4880 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4881 meta-level mechanism, this acts as if several individual goals had
4882 been stated separately; in particular common proof methods need to be
4883 repeated in order to cover all claims; note that a single elimination
4884 step is *not* sufficient to establish the two conjunctions, so this
4887 assume "A & B" then have A and B .. (*".." fails*)
4889 better use "obtain" in situations as above; alternative refer to
4890 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4892 * Pure: proper integration with ``locales''; unlike the original
4893 version by Florian Kammller, Isar locales package high-level proof
4894 contexts rather than raw logical ones (e.g. we admit to include
4895 attributes everywhere); operations on locales include merge and
4896 rename; support for implicit arguments (``structures''); simultaneous
4897 type-inference over imports and text; see also HOL/ex/Locales.thy for
4900 * Pure: the following commands have been ``localized'', supporting a
4901 target locale specification "(in name)": 'lemma', 'theorem',
4902 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4903 stored both within the locale and at the theory level (exported and
4904 qualified by the locale name);
4906 * Pure: theory goals may now be specified in ``long'' form, with
4907 ad-hoc contexts consisting of arbitrary locale elements. for example
4908 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4909 definitions may be given, too); the result is a meta-level rule with
4910 the context elements being discharged in the obvious way;
4912 * Pure: new proof command 'using' allows to augment currently used
4913 facts after a goal statement ('using' is syntactically analogous to
4914 'apply', but acts on the goal's facts only); this allows chained facts
4915 to be separated into parts given before and after a claim, as in
4916 ``from a and b have C using d and e <proof>'';
4918 * Pure: renamed "antecedent" case to "rule_context";
4920 * Pure: new 'judgment' command records explicit information about the
4921 object-logic embedding (used by several tools internally); no longer
4922 use hard-wired "Trueprop";
4924 * Pure: added 'corollary' command;
4926 * Pure: fixed 'token_translation' command;
4928 * Pure: removed obsolete 'exported' attribute;
4930 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4931 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4932 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4934 * Pure: method 'atomize' presents local goal premises as object-level
4935 statements (atomic meta-level propositions); setup controlled via
4936 rewrite rules declarations of 'atomize' attribute; example
4937 application: 'induct' method with proper rule statements in improper
4940 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4941 now consider the syntactic context of assumptions, giving a better
4942 chance to get type-inference of the arguments right (this is
4943 especially important for locales);
4945 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4948 * Pure/obtain: the formal conclusion "thesis", being marked as
4949 ``internal'', may no longer be reference directly in the text;
4950 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4953 * Pure: generic 'sym' attribute which declares a rule both as pure
4954 'elim?' and for the 'symmetric' operation;
4956 * Pure: marginal comments ``--'' may now occur just anywhere in the
4957 text; the fixed correlation with particular command syntax has been
4960 * Pure: new method 'rules' is particularly well-suited for proof
4961 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4962 but often produces more compact proof terms with less detours;
4964 * Pure/Provers/classical: simplified integration with pure rule
4965 attributes and methods; the classical "intro?/elim?/dest?"
4966 declarations coincide with the pure ones; the "rule" method no longer
4967 includes classically swapped intros; "intro" and "elim" methods no
4968 longer pick rules from the context; also got rid of ML declarations
4969 AddXIs/AddXEs/AddXDs; all of this has some potential for
4972 * Provers/classical: attribute 'swapped' produces classical inversions
4973 of introduction rules;
4975 * Provers/simplifier: 'simplified' attribute may refer to explicit
4976 rules instead of full simplifier context; 'iff' attribute handles
4979 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4981 * HOL: 'recdef' now fails on unfinished automated proofs, use
4982 "(permissive)" option to recover old behavior;
4984 * HOL: 'inductive' no longer features separate (collective) attributes
4985 for 'intros' (was found too confusing);
4987 * HOL: properly declared induction rules less_induct and
4993 * HOL: moved over to sane numeral syntax; the new policy is as
4996 - 0 and 1 are polymorphic constants, which are defined on any
4997 numeric type (nat, int, real etc.);
4999 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5000 binary representation internally;
5002 - type nat has special constructor Suc, and generally prefers Suc 0
5003 over 1::nat and Suc (Suc 0) over 2::nat;
5005 This change may cause significant problems of INCOMPATIBILITY; here
5006 are some hints on converting existing sources:
5008 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5009 entities, so expressions involving "-" (unary or binary minus) need
5010 to be spaced properly;
5012 - existing occurrences of "1" may need to be constraint "1::nat" or
5013 even replaced by Suc 0; similar for old "2";
5015 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5017 - remove all special provisions on numerals in proofs;
5019 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5020 representation (depends on bin_arith_simps in the default context);
5022 * HOL: symbolic syntax for x^2 (numeral 2);
5024 * HOL: the class of all HOL types is now called "type" rather than
5025 "term"; INCOMPATIBILITY, need to adapt references to this type class
5026 in axclass/classes, instance/arities, and (usually rare) occurrences
5027 in typings (of consts etc.); internally the class is called
5028 "HOL.type", ML programs should refer to HOLogic.typeS;
5030 * HOL/record package improvements:
5031 - new derived operations "fields" to build a partial record section,
5032 "extend" to promote a fixed record to a record scheme, and
5033 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5034 declared as simp by default;
5035 - shared operations ("more", "fields", etc.) now need to be always
5036 qualified) --- potential INCOMPATIBILITY;
5037 - removed "make_scheme" operations (use "make" with "extend") --
5039 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5040 - provides cases/induct rules for use with corresponding Isar
5041 methods (for concrete records, record schemes, concrete more
5042 parts, and schematic more parts -- in that order);
5043 - internal definitions directly based on a light-weight abstract
5044 theory of product types over typedef rather than datatype;
5046 * HOL: generic code generator for generating executable ML code from
5047 specifications; specific support for HOL constructs such as inductive
5048 datatypes and sets, as well as recursive functions; can be invoked
5049 via 'generate_code' theory section;
5051 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5053 * HOL: consolidated and renamed several theories. In particular:
5054 Ord.thy has been absorbed into HOL.thy
5055 String.thy has been absorbed into List.thy
5057 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5058 (beware of argument permutation!);
5060 * HOL: linorder_less_split superseded by linorder_cases;
5062 * HOL/List: "nodups" renamed to "distinct";
5064 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5065 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5066 - Ex_def has changed, now need to use some_eq_ex
5068 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5069 in this (rare) case use:
5071 delSWrapper "split_all_tac"
5072 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5074 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5077 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5078 Isabelle's type classes, ^ on functions and relations has too general
5079 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5080 necessary to attach explicit type constraints;
5082 * HOL/Relation: the prefix name of the infix "O" has been changed from
5083 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5084 renamed accordingly (eg "compI" -> "rel_compI").
5086 * HOL: syntax translations now work properly with numerals and records
5089 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5090 of "lam" -- INCOMPATIBILITY;
5092 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5093 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5094 renamed "Product_Type.unit";
5096 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5098 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5099 the "cases" method);
5101 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5104 * HOL/IMP: updated and converted to new-style theory format; several
5105 parts turned into readable document, with proper Isar proof texts and
5106 some explanations (by Gerwin Klein);
5108 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5110 * HOL-Hyperreal is now a logic image;
5115 * Isar: consts/constdefs supports mixfix syntax for continuous
5118 * Isar: domain package adapted to new-style theory format, e.g. see
5121 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5122 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5123 lift.induct_tac, always use UU instead of Undef;
5125 * HOLCF/IMP: updated and converted to new-style theory;
5130 * Isar: proper integration of logic-specific tools and packages,
5131 including theory commands '(co)inductive', '(co)datatype',
5132 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5133 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5135 * theory Main no longer includes AC; for the Axiom of Choice, base
5136 your theory on Main_ZFC;
5138 * the integer library now covers quotients and remainders, with many
5139 laws relating division to addition, multiplication, etc.;
5141 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5142 typeless version of the formalism;
5144 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5147 * ZF/Induct: new directory for examples of inductive definitions,
5148 including theory Multiset for multiset orderings; converted to
5149 new-style theory format;
5151 * ZF: many new theorems about lists, ordinals, etc.;
5156 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5157 variable proof controls level of detail: 0 = no proofs (only oracle
5158 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5159 also ref manual for further ML interfaces;
5161 * Pure/axclass: removed obsolete ML interface
5162 goal_subclass/goal_arity;
5164 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5165 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5166 separate tokens, so expressions involving minus need to be spaced
5169 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5170 rather than "infixl" or "infixr";
5172 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5173 sort constraint specifications in type inference; e.g. "x::_::foo"
5174 ensures that the type of "x" is of sort "foo" (but not necessarily a
5177 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5178 control output of nested => (types); the default behavior is
5181 * Pure/syntax: builtin parse translation for "_constify" turns valued
5182 tokens into AST constants;
5184 * Pure/syntax: prefer later declarations of translations and print
5185 translation functions; potential INCOMPATIBILITY: need to reverse
5186 multiple declarations for same syntax element constant;
5188 * Pure/show_hyps reset by default (in accordance to existing Isar
5191 * Provers/classical: renamed addaltern to addafter, addSaltern to
5194 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5197 * system: tested support for MacOS X; should be able to get Isabelle +
5198 Proof General to work in a plain Terminal after installing Poly/ML
5199 (e.g. from the Isabelle distribution area) and GNU bash alone
5200 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5201 support requires further installations, e.g. from
5202 http://fink.sourceforge.net/);
5204 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5206 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5207 of 40 MB), cf. ML_OPTIONS;
5209 * system: Proof General keywords specification is now part of the
5210 Isabelle distribution (see etc/isar-keywords.el);
5212 * system: support for persistent Proof General sessions (refrain from
5213 outdating all loaded theories on startup); user may create writable
5214 logic images like this: ``isabelle -q HOL Test'';
5216 * system: smart selection of Isabelle process versus Isabelle
5217 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5218 run both "isabelle" and "Isabelle" even if file names are badly
5219 damaged (executable inspects the case of the first letter of its own
5220 name); added separate "isabelle-process" and "isabelle-interface";
5222 * system: refrain from any attempt at filtering input streams; no
5223 longer support ``8bit'' encoding of old isabelle font, instead proper
5224 iso-latin characters may now be used; the related isatools
5225 "symbolinput" and "nonascii" have disappeared as well;
5227 * system: removed old "xterm" interface (the print modes "xterm" and
5228 "xterm_color" are still available for direct use in a suitable
5233 New in Isabelle99-2 (February 2001)
5234 -----------------------------------
5236 *** Overview of INCOMPATIBILITIES ***
5238 * HOL: please note that theories in the Library and elsewhere often use the
5239 new-style (Isar) format; to refer to their theorems in an ML script you must
5240 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5242 * HOL: inductive package no longer splits induction rule aggressively,
5243 but only as far as specified by the introductions given; the old
5244 format may be recovered via ML function complete_split_rule or attribute
5245 'split_rule (complete)';
5247 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5248 gfp_Tarski to gfp_unfold;
5250 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5252 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5253 relation); infix "^^" has been renamed "``"; infix "``" has been
5254 renamed "`"; "univalent" has been renamed "single_valued";
5256 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5259 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5261 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5263 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5264 consequence, it is no longer monotonic wrt. the local goal context
5265 (which is now passed through the inductive cases);
5267 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5268 \<gg> to \<ggreater>;
5271 *** Document preparation ***
5273 * \isabellestyle{NAME} selects version of Isabelle output (currently
5274 available: are "it" for near math-mode best-style output, "sl" for
5275 slanted text style, and "tt" for plain type-writer; if no
5276 \isabellestyle command is given, output is according to slanted
5279 * support sub/super scripts (for single symbols only), input syntax is
5280 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5282 * some more standard symbols; see Appendix A of the system manual for
5283 the complete list of symbols defined in isabellesym.sty;
5285 * improved isabelle style files; more abstract symbol implementation
5286 (should now use \isamath{...} and \isatext{...} in custom symbol
5289 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5290 state; Note that presentation of goal states does not conform to
5291 actual human-readable proof documents. Please do not include goal
5292 states into document output unless you really know what you are doing!
5294 * proper indentation of antiquoted output with proportional LaTeX
5297 * no_document ML operator temporarily disables LaTeX document
5300 * isatool unsymbolize tunes sources for plain ASCII communication;
5305 * Pure: Isar now suffers initial goal statements to contain unbound
5306 schematic variables (this does not conform to actual readable proof
5307 documents, due to unpredictable outcome and non-compositional proof
5308 checking); users who know what they are doing may use schematic goals
5309 for Prolog-style synthesis of proven results;
5311 * Pure: assumption method (an implicit finishing) now handles actual
5314 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5315 initial goal, declare "that" only as Pure intro (only for single
5316 steps); the "that" rule assumption may now be involved in implicit
5317 finishing, thus ".." becomes a feasible for trivial obtains;
5319 * Pure: default proof step now includes 'intro_classes'; thus trivial
5320 instance proofs may be performed by "..";
5322 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5325 * Pure: more robust selection of calculational rules;
5327 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5328 rule (as well as the assumption rule);
5330 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5331 lemmas, using the graph browser tool;
5333 * Pure: predict failure of "show" in interactive mode;
5335 * Pure: 'thms_containing' now takes actual terms as arguments;
5337 * HOL: improved method 'induct' --- now handles non-atomic goals
5338 (potential INCOMPATIBILITY); tuned error handling;
5340 * HOL: cases and induct rules now provide explicit hints about the
5341 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5342 any remaining facts are inserted into the goal verbatim;
5344 * HOL: local contexts (aka cases) may now contain term bindings as
5345 well; the 'cases' and 'induct' methods new provide a ?case binding for
5346 the result to be shown in each case;
5348 * HOL: added 'recdef_tc' command;
5350 * isatool convert assists in eliminating legacy ML scripts;
5355 * HOL/Library: a collection of generic theories to be used together
5356 with main HOL; the theory loader path already includes this directory
5357 by default; the following existing theories have been moved here:
5358 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5359 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5361 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5362 modelling and verification task performed in Isabelle/HOL +
5363 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5365 * HOL/Algebra: special summation operator SUM no longer exists, it has
5366 been replaced by setsum; infix 'assoc' now has priority 50 (like
5367 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5368 'domain', this makes the theory consistent with mathematical
5371 * HOL basics: added overloaded operations "inverse" and "divide"
5372 (infix "/"), syntax for generic "abs" operation, generic summation
5375 * HOL/typedef: simplified package, provide more useful rules (see also
5378 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5379 now expressed as a proper nested rule (old-style tactic scripts may
5380 require atomize_strip_tac to cope with non-atomic premises);
5382 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5383 to "split_conv" (old name still available for compatibility);
5385 * HOL: improved concrete syntax for strings (e.g. allows translation
5386 rules with string literals);
5388 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5389 and Fleuriot's mechanization of analysis, including the transcendental
5390 functions for the reals;
5392 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5397 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5398 "lam" is displayed as TWO lambda-symbols
5400 * CTT: theory Main now available, containing everything (that is, Bool
5406 * Pure: the Simplifier has been implemented properly as a derived rule
5407 outside of the actual kernel (at last!); the overall performance
5408 penalty in practical applications is about 50%, while reliability of
5409 the Isabelle inference kernel has been greatly improved;
5411 * print modes "brackets" and "no_brackets" control output of nested =>
5412 (types) and ==> (props); the default behaviour is "brackets";
5414 * Provers: fast_tac (and friends) now handle actual object-logic rules
5415 as assumptions as well;
5417 * system: support Poly/ML 4.0;
5419 * system: isatool install handles KDE version 1 or 2;
5423 New in Isabelle99-1 (October 2000)
5424 ----------------------------------
5426 *** Overview of INCOMPATIBILITIES ***
5428 * HOL: simplification of natural numbers is much changed; to partly
5429 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5430 issue the following ML commands:
5432 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5433 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5435 * HOL: simplification no longer dives into case-expressions; this is
5436 controlled by "t.weak_case_cong" for each datatype t;
5438 * HOL: nat_less_induct renamed to less_induct;
5440 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5441 fixsome to patch .thy and .ML sources automatically;
5443 select_equality -> some_equality
5444 select_eq_Ex -> some_eq_ex
5445 selectI2EX -> someI2_ex
5448 select1_equality -> some1_equality
5449 Eps_sym_eq -> some_sym_eq_trivial
5450 Eps_eq -> some_eq_trivial
5452 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5454 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5457 * HOL: the recursion equations generated by 'recdef' are now called
5458 f.simps instead of f.rules;
5460 * HOL: qed_spec_mp now also handles bounded ALL as well;
5462 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5463 sometimes be needed;
5465 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5467 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5469 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5470 product is now "<*>" instead of "Times"; the lexicographic product is
5471 now "<*lex*>" instead of "**";
5473 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5474 of main HOL, but was unused); better use HOL's datatype package;
5476 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5477 the old syntax may be recovered as follows:
5480 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5481 (infixl "\\<oplus>" 100)
5483 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5485 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5486 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5489 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5490 changed from A/r to A//r;
5492 * ZF: new treatment of arithmetic (nat & int) may break some old
5495 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5496 rulify -> rule_format, elimify -> elim_format, ...);
5498 * Isar/Provers: intro/elim/dest attributes changed; renamed
5499 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5500 should have to change intro!! to intro? only); replaced "delrule" by
5503 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5505 * Provers: strengthened force_tac by using new first_best_tac;
5507 * LaTeX document preparation: several changes of isabelle.sty (see
5511 *** Document preparation ***
5513 * formal comments (text blocks etc.) in new-style theories may now
5514 contain antiquotations of thm/prop/term/typ/text to be presented
5515 according to latex print mode; concrete syntax is like this:
5516 @{term[show_types] "f(x) = a + x"};
5518 * isatool mkdir provides easy setup of Isabelle session directories,
5519 including proper document sources;
5521 * generated LaTeX sources are now deleted after successful run
5522 (isatool document -c); may retain a copy somewhere else via -D option
5525 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5526 style files, achieving self-contained LaTeX sources and simplifying
5529 * old-style theories now produce (crude) LaTeX output as well;
5531 * browser info session directories are now self-contained (may be put
5532 on WWW server seperately); improved graphs of nested sessions; removed
5533 graph for 'all sessions';
5535 * several improvements in isabelle style files; \isabellestyle{it}
5536 produces fake math mode output; \isamarkupheader is now \section by
5537 default; see lib/texinputs/isabelle.sty etc.;
5542 * Isar/Pure: local results and corresponding term bindings are now
5543 subject to Hindley-Milner polymorphism (similar to ML); this
5544 accommodates incremental type-inference very nicely;
5546 * Isar/Pure: new derived language element 'obtain' supports
5547 generalized existence reasoning;
5549 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5550 support accumulation of results, without applying any rules yet;
5551 useful to collect intermediate results without explicit name
5552 references, and for use with transitivity rules with more than 2
5555 * Isar/Pure: scalable support for case-analysis type proofs: new
5556 'case' language element refers to local contexts symbolically, as
5557 produced by certain proof methods; internally, case names are attached
5558 to theorems as "tags";
5560 * Isar/Pure: theory command 'hide' removes declarations from
5561 class/type/const name spaces;
5563 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5564 indicate potential overloading;
5566 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5568 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5569 "{a,b,c}" instead of {a,b,c};
5571 * Isar/Pure now provides its own version of intro/elim/dest
5572 attributes; useful for building new logics, but beware of confusion
5573 with the version in Provers/classical;
5575 * Isar/Pure: the local context of (non-atomic) goals is provided via
5576 case name 'antecedent';
5578 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5579 to the current context is now done automatically);
5581 * Isar/Pure: theory command 'method_setup' provides a simple interface
5582 for definining proof methods in ML;
5584 * Isar/Provers: intro/elim/dest attributes changed; renamed
5585 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5586 most cases, one should have to change intro!! to intro? only);
5587 replaced "delrule" by "rule del";
5589 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5590 'symmetric' attribute (the latter supercedes [RS sym]);
5592 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5593 method modifier); 'simp' method: 'only:' modifier removes loopers as
5594 well (including splits);
5596 * Isar/Provers: Simplifier and Classical methods now support all kind
5597 of modifiers used in the past, including 'cong', 'iff', etc.
5599 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5600 of Simplifier and Classical reasoner);
5602 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5603 now support named cases; major packages (inductive, datatype, primrec,
5604 recdef) support case names and properly name parameters;
5606 * Isar/HOL: new transitivity rules for substitution in inequalities --
5607 monotonicity conditions are extracted to be proven at end of
5610 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5613 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5614 split_if split_if_asm; datatype package provides theorems foo.splits =
5615 foo.split foo.split_asm for each datatype;
5617 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5618 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5619 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5620 use "(cases (simplified))" method in proper proof texts);
5622 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5624 * Isar: names of theorems etc. may be natural numbers as well;
5626 * Isar: 'pr' command: optional arguments for goals_limit and
5627 ProofContext.prems_limit; no longer prints theory contexts, but only
5630 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5631 additional print modes to be specified; e.g. "pr(latex)" will print
5632 proof state according to the Isabelle LaTeX style;
5634 * Isar: improved support for emulating tactic scripts, including proof
5635 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5636 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5637 (for HOL datatypes);
5639 * Isar: simplified (more robust) goal selection of proof methods: 1st
5640 goal, all goals, or explicit goal specifier (tactic emulation); thus
5641 'proof method scripts' have to be in depth-first order;
5643 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5645 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5646 should instead use individual commands for printing items
5647 (print_commands, print_methods etc.);
5649 * Isar: added 'nothing' --- the empty list of theorems;
5654 * HOL/MicroJava: formalization of a fragment of Java, together with a
5655 corresponding virtual machine and a specification of its bytecode
5656 verifier and a lightweight bytecode verifier, including proofs of
5657 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5658 Cornelia Pusch (see also the homepage of project Bali at
5659 http://isabelle.in.tum.de/Bali/);
5661 * HOL/Algebra: new theory of rings and univariate polynomials, by
5664 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5665 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5668 * HOL/Lattice: fundamental concepts of lattice theory and order
5669 structures, including duals, properties of bounds versus algebraic
5670 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5671 Theorem for complete lattices etc.; may also serve as a demonstration
5672 for abstract algebraic reasoning using axiomatic type classes, and
5673 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5675 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5678 * HOL/IMPP: extension of IMP with local variables and mutually
5679 recursive procedures, by David von Oheimb;
5681 * HOL/Lambda: converted into new-style theory and document;
5683 * HOL/ex/Multiquote: example of multiple nested quotations and
5684 anti-quotations -- basically a generalized version of de-Bruijn
5685 representation; very useful in avoiding lifting of operations;
5687 * HOL/record: added general record equality rule to simpset; fixed
5688 select-update simplification procedure to handle extended records as
5689 well; admit "r" as field name;
5691 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5692 other numeric types and also as the identity of groups, rings, etc.;
5694 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5695 Types nat and int belong to this axclass;
5697 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5698 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5699 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5700 two terms #m*u and #n*u are replaced by #(m+n)*u
5701 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5702 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5703 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5705 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5706 powerful prover for predicate logic but knows nothing of clasets; see
5707 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5709 * HOL: new version of "case_tac" subsumes both boolean case split and
5710 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5711 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5713 * HOL: simplification no longer dives into case-expressions: only the
5714 selector expression is simplified, but not the remaining arms; to
5715 enable full simplification of case-expressions for datatype t, you may
5716 remove t.weak_case_cong from the simpset, either globally (Delcongs
5717 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5719 * HOL/recdef: the recursion equations generated by 'recdef' for
5720 function 'f' are now called f.simps instead of f.rules; if all
5721 termination conditions are proved automatically, these simplification
5722 rules are added to the simpset, as in primrec; rules may be named
5723 individually as well, resulting in a separate list of theorems for
5726 * HOL/While is a new theory that provides a while-combinator. It
5727 permits the definition of tail-recursive functions without the
5728 provision of a termination measure. The latter is necessary once the
5729 invariant proof rule for while is applied.
5731 * HOL: new (overloaded) notation for the set of elements below/above
5732 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5734 * HOL: theorems impI, allI, ballI bound as "strip";
5736 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5737 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5738 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5740 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5742 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5743 main HOL, but was unused);
5745 * HOL: fewer consts declared as global (e.g. have to refer to
5746 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5748 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5749 in case of overlap with user translations (e.g. judgements over
5750 tuples); (note that the underlying logical represenation is still
5756 * ZF: simplification automatically cancels common terms in arithmetic
5757 expressions over nat and int;
5759 * ZF: new treatment of nat to minimize type-checking: all operators
5760 coerce their operands to a natural number using the function natify,
5761 making the algebraic laws unconditional;
5763 * ZF: as above, for int: operators coerce their operands to an integer
5764 using the function intify;
5766 * ZF: the integer library now contains many of the usual laws for the
5767 orderings, including $<=, and monotonicity laws for $+ and $*;
5769 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5772 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5773 to the simplifier and classical reasoner simultaneously;
5778 * Provers: blast_tac now handles actual object-logic rules as
5779 assumptions; note that auto_tac uses blast_tac internally as well;
5781 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5782 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5784 * Provers: delrules now handles destruct rules as well (no longer need
5785 explicit make_elim);
5787 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5788 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5789 use instead the strong form,
5790 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5791 in HOL, FOL and ZF the function cla_make_elim will create such rules
5792 from destruct-rules;
5794 * Provers: Simplifier.easy_setup provides a fast path to basic
5795 Simplifier setup for new object-logics;
5797 * Pure: AST translation rules no longer require constant head on LHS;
5799 * Pure: improved name spaces: ambiguous output is qualified; support
5800 for hiding of names;
5802 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5803 XSYMBOL_HOME; no longer need to do manual configuration in most
5806 * system: compression of ML heaps images may now be controlled via -c
5807 option of isabelle and isatool usedir (currently only observed by
5810 * system: isatool installfonts may handle X-Symbol fonts as well (very
5811 useful for remote X11);
5813 * system: provide TAGS file for Isabelle sources;
5815 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5818 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5819 timing flag supersedes proof_timing and Toplevel.trace;
5821 * ML: new combinators |>> and |>>> for incremental transformations
5822 with secondary results (e.g. certain theory extensions):
5824 * ML: PureThy.add_defs gets additional argument to indicate potential
5825 overloading (usually false);
5827 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5832 New in Isabelle99 (October 1999)
5833 --------------------------------
5835 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5837 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5838 are no longer simplified. (This allows the simplifier to unfold recursive
5839 functional programs.) To restore the old behaviour, declare
5841 Delcongs [if_weak_cong];
5843 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5846 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5848 * HOL/datatype: mutual_induct_tac no longer exists --
5849 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5851 * HOL/typedef: fixed type inference for representing set; type
5852 arguments now have to occur explicitly on the rhs as type constraints;
5854 * ZF: The con_defs part of an inductive definition may no longer refer
5855 to constants declared in the same theory;
5857 * HOL, ZF: the function mk_cases, generated by the inductive
5858 definition package, has lost an argument. To simplify its result, it
5859 uses the default simpset instead of a supplied list of theorems.
5861 * HOL/List: the constructors of type list are now Nil and Cons;
5863 * Simplifier: the type of the infix ML functions
5864 setSSolver addSSolver setSolver addSolver
5865 is now simpset * solver -> simpset where `solver' is a new abstract type
5866 for packaging solvers. A solver is created via
5867 mk_solver: string -> (thm list -> int -> tactic) -> solver
5868 where the string argument is only a comment.
5873 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5874 decision procedure for linear arithmetic. Currently it is used for
5875 types `nat', `int', and `real' in HOL (see below); it can, should and
5876 will be instantiated for other types and logics as well.
5878 * The simplifier now accepts rewrite rules with flexible heads, eg
5879 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5880 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5886 * New Isabelle/Isar subsystem provides an alternative to traditional
5887 tactical theorem proving; together with the ProofGeneral/isar user
5888 interface it offers an interactive environment for developing human
5889 readable proof documents (Isar == Intelligible semi-automated
5890 reasoning); for further information see isatool doc isar-ref,
5891 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5893 * improved and simplified presentation of theories: better HTML markup
5894 (including colors), graph views in several sizes; isatool usedir now
5895 provides a proper interface for user theories (via -P option); actual
5896 document preparation based on (PDF)LaTeX is available as well (for
5897 new-style theories only); see isatool doc system for more information;
5899 * native support for Proof General, both for classic Isabelle and
5902 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5903 using the graph browser tool;
5905 * Isabelle manuals now also available as PDF;
5907 * theory loader rewritten from scratch (may not be fully
5908 bug-compatible); old loadpath variable has been replaced by show_path,
5909 add_path, del_path, reset_path functions; new operations such as
5910 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5913 * improved isatool install: option -k creates KDE application icon,
5914 option -p DIR installs standalone binaries;
5916 * added ML_PLATFORM setting (useful for cross-platform installations);
5917 more robust handling of platform specific ML images for SML/NJ;
5919 * the settings environment is now statically scoped, i.e. it is never
5920 created again in sub-processes invoked from isabelle, isatool, or
5923 * path element specification '~~' refers to '$ISABELLE_HOME';
5925 * in locales, the "assumes" and "defines" parts may be omitted if
5928 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5931 * new print_mode "HTML";
5933 * new flag show_tags controls display of tags of theorems (which are
5934 basically just comments that may be attached by some tools);
5936 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5937 mode and goal output format:
5939 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5941 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5943 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5944 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5946 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5948 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5950 * function bind_thms stores lists of theorems (cf. bind_thm);
5952 * new shorthand tactics ftac, eatac, datac, fatac;
5954 * qed (and friends) now accept "" as result name; in that case the
5955 theorem is not stored, but proper checks and presentation of the
5958 * theorem database now also indexes constants "Trueprop", "all",
5959 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5964 ** HOL arithmetic **
5966 * There are now decision procedures for linear arithmetic over nat and
5969 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5970 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5971 are treated as atomic; subformulae not involving type `nat' or `int'
5972 are ignored; quantified subformulae are ignored unless they are
5973 positive universal or negative existential. The tactic has to be
5974 invoked by hand and can be a little bit slow. In particular, the
5975 running time is exponential in the number of occurrences of `min' and
5976 `max', and `-' on `nat'.
5978 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5979 (negated) (in)equalities among the premises and the conclusion into
5980 account (i.e. no compound formulae) and does not know about `min' and
5981 `max', and `-' on `nat'. It is fast and is used automatically by the
5984 NB: At the moment, these decision procedures do not cope with mixed
5985 nat/int formulae where the two parts interact, such as `m < n ==>
5988 * HOL/Numeral provides a generic theory of numerals (encoded
5989 efficiently as bit strings); setup for types nat/int/real is in place;
5990 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5991 int, existing theories and proof scripts may require a few additional
5994 * integer division and remainder can now be performed on constant
5997 * many properties of integer multiplication, division and remainder
6000 * An interface to the Stanford Validity Checker (SVC) is available through the
6001 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6002 are proved automatically. SVC must be installed separately, and its results
6003 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6004 invocation of the underlying oracle). For SVC see
6005 http://verify.stanford.edu/SVC
6007 * IsaMakefile: the HOL-Real target now builds an actual image;
6012 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6013 (in Isabelle/Isar) -- by Gertrud Bauer;
6015 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6016 analysis for assembly languages with subtypes;
6018 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6019 -- avoids syntactic ambiguities and treats state, transition, and
6020 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6021 changed syntax and (many) tactics;
6023 * HOL/inductive: Now also handles more general introduction rules such
6024 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6025 theorems are now maintained within the theory (maintained via the
6028 * HOL/datatype: Now also handles arbitrarily branching datatypes
6029 (using function types) such as
6031 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6033 * HOL/record: record_simproc (part of the default simpset) takes care
6034 of selectors applied to updated records; record_split_tac is no longer
6035 part of the default claset; update_defs may now be removed from the
6036 simpset in many cases; COMPATIBILITY: old behavior achieved by
6038 claset_ref () := claset() addSWrapper record_split_wrapper;
6039 Delsimprocs [record_simproc]
6041 * HOL/typedef: fixed type inference for representing set; type
6042 arguments now have to occur explicitly on the rhs as type constraints;
6044 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6045 names rather than an ML expression;
6047 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6048 supplied later. Program schemes can be defined, such as
6049 "While B C s = (if B s then While B C (C s) else s)"
6050 where the well-founded relation can be chosen after B and C have been given.
6052 * HOL/List: the constructors of type list are now Nil and Cons;
6053 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6054 course, ML tools referring to List.list.op # etc. have to be adapted;
6056 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6057 disabled by default; run isabelle with option -m HOL to get back to
6058 the original Gordon/HOL-style output;
6060 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6061 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6063 * HOL basic syntax simplified (more orthogonal): all variants of
6064 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6065 Eps operator is provided as well: "SOME x. P[x]";
6067 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6069 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6070 thus available for user theories;
6072 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6073 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6076 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6077 several times and then mp;
6082 * the notation <<...>> is now available as a notation for sequences of
6085 * the simplifier is now installed
6087 * the axiom system has been generalized (thanks to Soren Heilmann)
6089 * the classical reasoner now has a default rule database
6094 * new primrec section allows primitive recursive functions to be given
6095 directly (as in HOL) over datatypes and the natural numbers;
6097 * new tactics induct_tac and exhaust_tac for induction (or case
6098 analysis) over datatypes and the natural numbers;
6100 * the datatype declaration of type T now defines the recursor T_rec;
6102 * simplification automatically does freeness reasoning for datatype
6105 * automatic type-inference, with AddTCs command to insert new
6106 type-checking rules;
6108 * datatype introduction rules are now added as Safe Introduction rules
6111 * the syntax "if P then x else y" is now available in addition to
6115 *** Internal programming interfaces ***
6117 * tuned simplifier trace output; new flag debug_simp;
6119 * structures Vartab / Termtab (instances of TableFun) offer efficient
6120 tables indexed by indexname_ord / term_ord (compatible with aconv);
6122 * AxClass.axclass_tac lost the theory argument;
6124 * tuned current_goals_markers semantics: begin / end goal avoids
6125 printing empty lines;
6127 * removed prs and prs_fn hook, which was broken because it did not
6128 include \n in its semantics, forcing writeln to add one
6129 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6130 string -> unit if you really want to output text without newline;
6132 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6133 plain output, interface builders may have to enable 'isabelle_font'
6134 mode to get Isabelle font glyphs as before;
6136 * refined token_translation interface; INCOMPATIBILITY: output length
6137 now of type real instead of int;
6139 * theory loader actions may be traced via new ThyInfo.add_hook
6140 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6141 your own database of information attached to *whole* theories -- as
6142 opposed to intra-theory data slots offered via TheoryDataFun;
6144 * proper handling of dangling sort hypotheses (at last!);
6145 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6146 extra sort hypotheses that can be witnessed from the type signature;
6147 the force_strip_shyps flag is gone, any remaining shyps are simply
6148 left in the theorem (with a warning issued by strip_shyps_warning);
6152 New in Isabelle98-1 (October 1998)
6153 ----------------------------------
6155 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6157 * several changes of automated proof tools;
6159 * HOL: major changes to the inductive and datatype packages, including
6160 some minor incompatibilities of theory syntax;
6162 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6165 * HOL: removed duplicate thms in Arith:
6166 less_imp_add_less should be replaced by trans_less_add1
6167 le_imp_add_le should be replaced by trans_le_add1
6169 * HOL: unary minus is now overloaded (new type constraints may be
6172 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6173 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6174 now taken as an integer constant.
6176 * Pure: ML function 'theory_of' renamed to 'theory';
6182 1. Asm_full_simp_tac is now more aggressive.
6183 1. It will sometimes reorient premises if that increases their power to
6185 2. It does no longer proceed strictly from left to right but may also
6186 rotate premises to achieve further simplification.
6187 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6188 old Asm_full_simp_tac in that it does not rotate premises.
6189 2. The simplifier now knows a little bit about nat-arithmetic.
6191 * Classical reasoner: wrapper mechanism for the classical reasoner now
6192 allows for selected deletion of wrappers, by introduction of names for
6193 wrapper functionals. This implies that addbefore, addSbefore,
6194 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6195 and that adding two tactics with the same name overwrites the first
6196 one (emitting a warning).
6197 type wrapper = (int -> tactic) -> (int -> tactic)
6198 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6199 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6200 delWrapper, delSWrapper: claset * string -> claset
6201 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6203 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6204 semantics; addbefore now affects only the unsafe part of step_tac
6205 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6206 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6209 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6210 compWrapper; added safe wrapper (and access functions for it);
6212 * HOL/split_all_tac is now much faster and fails if there is nothing
6213 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6214 and the names of the automatically generated variables have changed.
6215 split_all_tac has moved within claset() from unsafe wrappers to safe
6216 wrappers, which means that !!-bound variables are split much more
6217 aggressively, and safe_tac and clarify_tac now split such variables.
6218 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6219 Note: the same holds for record_split_tac, which does the job of
6220 split_all_tac for record fields.
6222 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6223 permanently to the default simpset using Addsplits just like
6224 Addsimps. They can be removed via Delsplits just like
6225 Delsimps. Lower-case versions are also available.
6227 * HOL/Simplifier: The rule split_if is now part of the default
6228 simpset. This means that the simplifier will eliminate all occurrences
6229 of if-then-else in the conclusion of a goal. To prevent this, you can
6230 either remove split_if completely from the default simpset by
6231 `Delsplits [split_if]' or remove it in a specific call of the
6232 simplifier using `... delsplits [split_if]'. You can also add/delete
6233 other case splitting rules to/from the default simpset: every datatype
6234 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6235 t is the name of the datatype).
6237 * Classical reasoner / Simplifier combination: new force_tac (and
6238 derivatives Force_tac, force) combines rewriting and classical
6239 reasoning (and whatever other tools) similarly to auto_tac, but is
6240 aimed to solve the given subgoal completely.
6245 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6246 and `goalw': the theory is no longer needed as an explicit argument -
6247 the current theory context is used; assumptions are no longer returned
6248 at the ML-level unless one of them starts with ==> or !!; it is
6249 recommended to convert to these new commands using isatool fixgoal
6250 (backup your sources first!);
6252 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6253 the current theory context, and 'theory' to lookup stored theories;
6255 * new theory section 'locale' for declaring constants, assumptions and
6256 definitions that have local scope;
6258 * new theory section 'nonterminals' for purely syntactic types;
6260 * new theory section 'setup' for generic ML setup functions
6261 (e.g. package initialization);
6263 * the distribution now includes Isabelle icons: see
6264 lib/logo/isabelle-{small,tiny}.xpm;
6266 * isatool install - install binaries with absolute references to
6269 * isatool logo -- create instances of the Isabelle logo (as EPS);
6271 * print mode 'emacs' reserved for Isamode;
6273 * support multiple print (ast) translations per constant name;
6275 * theorems involving oracles are now printed with a suffixed [!];
6280 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6282 * HOL/inductive package reorganized and improved: now supports mutual
6288 oddI "n : EVEN ==> Suc n : ODD"
6289 evenI "n : ODD ==> Suc n : EVEN"
6291 new theorem list "elims" contains an elimination rule for each of the
6292 recursive sets; inductive definitions now handle disjunctive premises
6293 correctly (also ZF);
6295 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6296 "mutual_induct" no longer exists - the induction rule is always
6297 contained in "induct";
6300 * HOL/datatype package re-implemented and greatly improved: now
6301 supports mutually recursive datatypes such as
6304 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6305 | SUM ('a aexp) ('a aexp)
6306 | DIFF ('a aexp) ('a aexp)
6309 'a bexp = LESS ('a aexp) ('a aexp)
6310 | AND ('a bexp) ('a bexp)
6311 | OR ('a bexp) ('a bexp)
6313 as well as indirectly recursive datatypes such as
6316 ('a, 'b) term = Var 'a
6317 | App 'b ((('a, 'b) term) list)
6319 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6320 induction on mutually / indirectly recursive datatypes.
6322 Primrec equations are now stored in theory and can be accessed via
6323 <function_name>.simps.
6327 - Theories using datatypes must now have theory Datatype as an
6329 - The specific <typename>.induct_tac no longer exists - use the
6330 generic induct_tac instead.
6331 - natE has been renamed to nat.exhaust - use exhaust_tac
6332 instead of res_inst_tac ... natE. Note that the variable
6333 names in nat.exhaust differ from the names in natE, this
6334 may cause some "fragile" proofs to fail.
6335 - The theorems split_<typename>_case and split_<typename>_case_asm
6336 have been renamed to <typename>.split and <typename>.split_asm.
6337 - Since default sorts of type variables are now handled correctly,
6338 some datatype definitions may have to be annotated with explicit
6340 - Primrec definitions no longer require function name and type
6341 of recursive argument.
6343 Consider using isatool fixdatatype to adapt your theories and proof
6344 scripts to the new package (backup your sources first!).
6347 * HOL/record package: considerably improved implementation; now
6348 includes concrete syntax for record types, terms, updates; theorems
6349 for surjective pairing and splitting !!-bound record variables; proof
6350 support is as follows:
6352 1) standard conversions (selectors or updates applied to record
6353 constructor terms) are part of the standard simpset;
6355 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6356 made part of standard simpset and claset via addIffs;
6358 3) a tactic for record field splitting (record_split_tac) is part of
6359 the standard claset (addSWrapper);
6361 To get a better idea about these rules you may retrieve them via
6362 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6363 the name of your record type.
6365 The split tactic 3) conceptually simplifies by the following rule:
6367 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6369 Thus any record variable that is bound by meta-all will automatically
6370 blow up into some record constructor term, consequently the
6371 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6372 solve record problems automatically.
6375 * reorganized the main HOL image: HOL/Integ and String loaded by
6376 default; theory Main includes everything;
6378 * automatic simplification of integer sums and comparisons, using cancellation;
6380 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6382 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6384 * many new identities for unions, intersections, set difference, etc.;
6386 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6387 called split_if, split_split, split_sum_case and split_nat_case (to go
6388 with add/delsplits);
6390 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6391 (?x::unit) = (); this is made part of the default simpset, which COULD
6392 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6393 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6394 unit_abs_eta_conv is added in order to counter the effect of
6395 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6398 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6401 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6402 It and 'sym RS equals0D' are now in the default claset, giving automatic
6403 disjointness reasoning but breaking a few old proofs.
6405 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6406 to 'converse' from 'inverse' (for compatibility with ZF and some
6409 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6410 the well-founded relation;
6412 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6413 Compl A. The "Compl" syntax remains available as input syntax for this
6416 * HOL/Update: new theory of function updates:
6417 f(a:=b) == %x. if x=a then b else f x
6418 may also be iterated as in f(a:=b,c:=d,...);
6420 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6423 - new function list_update written xs[i:=v] that updates the i-th
6424 list position. May also be iterated as in xs[i:=a,j:=b,...].
6425 - new function `upt' written [i..j(] which generates the list
6426 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6427 bound write [i..j], which is a shorthand for [i..j+1(].
6428 - new lexicographic orderings and corresponding wellfoundedness theorems.
6431 - removed 'pred' (predecessor) function;
6432 - generalized some theorems about n-1;
6433 - many new laws about "div" and "mod";
6434 - new laws about greatest common divisors (see theory ex/Primes);
6436 * HOL/Relation: renamed the relational operator r^-1 "converse"
6437 instead of "inverse";
6439 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6440 of the multiset ordering;
6442 * directory HOL/Real: a construction of the reals using Dedekind cuts
6443 (not included by default);
6445 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6447 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6448 programs, i.e. different program variables may have different types.
6450 * calling (stac rew i) now fails if "rew" has no effect on the goal
6451 [previously, this check worked only if the rewrite rule was unconditional]
6452 Now rew can involve either definitions or equalities (either == or =).
6457 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6458 only the theorems proved on ZF.ML;
6460 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6461 It and 'sym RS equals0D' are now in the default claset, giving automatic
6462 disjointness reasoning but breaking a few old proofs.
6464 * ZF/Update: new theory of function updates
6465 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6466 may also be iterated as in f(a:=b,c:=d,...);
6468 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6470 * calling (stac rew i) now fails if "rew" has no effect on the goal
6471 [previously, this check worked only if the rewrite rule was unconditional]
6472 Now rew can involve either definitions or equalities (either == or =).
6474 * case_tac provided for compatibility with HOL
6475 (like the old excluded_middle_tac, but with subgoals swapped)
6478 *** Internal programming interfaces ***
6480 * Pure: several new basic modules made available for general use, see
6481 also src/Pure/README;
6483 * improved the theory data mechanism to support encapsulation (data
6484 kind name replaced by private Object.kind, acting as authorization
6485 key); new type-safe user interface via functor TheoryDataFun; generic
6486 print_data function becomes basically useless;
6488 * removed global_names compatibility flag -- all theory declarations
6489 are qualified by default;
6491 * module Pure/Syntax now offers quote / antiquote translation
6492 functions (useful for Hoare logic etc. with implicit dependencies);
6493 see HOL/ex/Antiquote for an example use;
6495 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6498 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6501 * Display.print_goals function moved to Locale.print_goals;
6503 * standard print function for goals supports current_goals_markers
6504 variable for marking begin of proof, end of proof, start of goal; the
6505 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6506 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6511 New in Isabelle98 (January 1998)
6512 --------------------------------
6514 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6516 * changed lexical syntax of terms / types: dots made part of long
6517 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6519 * simpset (and claset) reference variable replaced by functions
6520 simpset / simpset_ref;
6522 * no longer supports theory aliases (via merge) and non-trivial
6523 implicit merge of thms' signatures;
6525 * most internal names of constants changed due to qualified names;
6527 * changed Pure/Sequence interface (see Pure/seq.ML);
6530 *** General Changes ***
6532 * hierachically structured name spaces (for consts, types, axms, thms
6533 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6534 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6535 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6536 long_names for fully qualified output names; NOTE: ML programs
6537 (special tactics, packages etc.) referring to internal names may have
6538 to be adapted to cope with fully qualified names; in case of severe
6539 backward campatibility problems try setting 'global_names' at compile
6540 time to have enrything declared within a flat name space; one may also
6541 fine tune name declarations in theories via the 'global' and 'local'
6544 * reimplemented the implicit simpset and claset using the new anytype
6545 data filed in signatures; references simpset:simpset ref etc. are
6546 replaced by functions simpset:unit->simpset and
6547 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6548 to patch your ML files accordingly;
6550 * HTML output now includes theory graph data for display with Java
6551 applet or isatool browser; data generated automatically via isatool
6552 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6554 * defs may now be conditional; improved rewrite_goals_tac to handle
6555 conditional equations;
6557 * defs now admits additional type arguments, using TYPE('a) syntax;
6559 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6560 creates a new theory node; implicit merge of thms' signatures is
6561 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6562 transfer:theory->thm->thm in (rare) cases;
6564 * improved handling of draft signatures / theories; draft thms (and
6565 ctyps, cterms) are automatically promoted to real ones;
6567 * slightly changed interfaces for oracles: admit many per theory, named
6568 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6570 * print_goals: optional output of const types (set show_consts and
6573 * improved output of warnings (###) and errors (***);
6575 * subgoal_tac displays a warning if the new subgoal has type variables;
6577 * removed old README and Makefiles;
6579 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6581 * removed obsolete init_pps and init_database;
6583 * deleted the obsolete tactical STATE, which was declared by
6584 fun STATE tacfun st = tacfun st st;
6586 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6587 (which abbreviates $HOME);
6589 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6590 use isatool fixseq to adapt your ML programs (this works for fully
6591 qualified references to the Sequence structure only!);
6593 * use_thy no longer requires writable current directory; it always
6594 reloads .ML *and* .thy file, if either one is out of date;
6597 *** Classical Reasoner ***
6599 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6600 tactics that use classical reasoning to simplify a subgoal without
6601 splitting it into several subgoals;
6603 * Safe_tac: like safe_tac but uses the default claset;
6608 * added simplification meta rules:
6609 (asm_)(full_)simplify: simpset -> thm -> thm;
6611 * simplifier.ML no longer part of Pure -- has to be loaded by object
6614 * added prems argument to simplification procedures;
6616 * HOL, FOL, ZF: added infix function `addsplits':
6617 instead of `<simpset> setloop (split_tac <thms>)'
6618 you can simply write `<simpset> addsplits <thms>'
6623 * TYPE('a) syntax for type reflection terms;
6625 * no longer handles consts with name "" -- declare as 'syntax' instead;
6627 * pretty printer: changed order of mixfix annotation preference (again!);
6629 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6634 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6635 with `addloop' of the simplifier to faciliate case splitting in premises.
6637 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6639 * HOL/Auth: new protocol proofs including some for the Internet
6642 * HOL/Map: new theory of `maps' a la VDM;
6644 * HOL/simplifier: simplification procedures nat_cancel_sums for
6645 cancelling out common nat summands from =, <, <= (in)equalities, or
6646 differences; simplification procedures nat_cancel_factor for
6647 cancelling common factor from =, <, <= (in)equalities over natural
6648 sums; nat_cancel contains both kinds of procedures, it is installed by
6649 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6651 * HOL/simplifier: terms of the form
6652 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6654 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6655 and those of the form
6656 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6658 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6661 Each datatype `t' now comes with a theorem `split_t_case' of the form
6663 P(t_case f1 ... fn x) =
6664 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6666 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6669 and a theorem `split_t_case_asm' of the form
6671 P(t_case f1 ... fn x) =
6672 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6674 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6676 which can be added to a simpset via `addsplits'. The existing theorems
6677 expand_list_case and expand_option_case have been renamed to
6678 split_list_case and split_option_case.
6681 - `pred n' is automatically converted to `n-1'.
6682 Users are strongly encouraged not to use `pred' any longer,
6683 because it will disappear altogether at some point.
6684 - Users are strongly encouraged to write "0 < n" rather than
6685 "n ~= 0". Theorems and proof tools have been modified towards this
6689 the function "set_of_list" has been renamed "set" (and its theorems too);
6690 the function "nth" now takes its arguments in the reverse order and
6691 has acquired the infix notation "!" as in "xs!n".
6693 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6695 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6696 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6698 * HOL/record: extensible records with schematic structural subtyping
6699 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6700 still lacks various theorems and concrete record syntax;
6705 * removed "axioms" and "generated by" sections;
6707 * replaced "ops" section by extended "consts" section, which is capable of
6708 handling the continuous function space "->" directly;
6711 . proves theorems immediately and stores them in the theory,
6712 . creates hierachical name space,
6713 . now uses normal mixfix annotations (instead of cinfix...),
6714 . minor changes to some names and values (for consistency),
6715 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6716 . separator between mutual domain defs: changed "," to "and",
6717 . improved handling of sort constraints; now they have to
6718 appear on the left-hand side of the equations only;
6720 * fixed LAM <x,y,zs>.b syntax;
6722 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6723 adm (%x. P (t x)), where P is chainfinite and t continuous;
6728 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6729 with `addloop' of the simplifier to faciliate case splitting in premises.
6731 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6732 in HOL, they strip ALL and --> from proved theorems;
6736 New in Isabelle94-8 (May 1997)
6737 ------------------------------
6739 *** General Changes ***
6741 * new utilities to build / run / maintain Isabelle etc. (in parts
6742 still somewhat experimental); old Makefiles etc. still functional;
6744 * new 'Isabelle System Manual';
6746 * INSTALL text, together with ./configure and ./build scripts;
6748 * reimplemented type inference for greater efficiency, better error
6749 messages and clean internal interface;
6751 * prlim command for dealing with lots of subgoals (an easier way of
6752 setting goals_limit);
6757 * supports alternative (named) syntax tables (parser and pretty
6758 printer); internal interface is provided by add_modesyntax(_i);
6760 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6761 be used in conjunction with the Isabelle symbol font; uses the
6762 "symbols" syntax table;
6764 * added token_translation interface (may translate name tokens in
6765 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6766 the current print_mode); IMPORTANT: user print translation functions
6767 are responsible for marking newly introduced bounds
6768 (Syntax.mark_boundT);
6770 * token translations for modes "xterm" and "xterm_color" that display
6771 names in bold, underline etc. or colors (which requires a color
6774 * infixes may now be declared with names independent of their syntax;
6776 * added typed_print_translation (like print_translation, but may
6777 access type of constant);
6780 *** Classical Reasoner ***
6782 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6783 some limitations. Blast_tac...
6784 + ignores addss, addbefore, addafter; this restriction is intrinsic
6785 + ignores elimination rules that don't have the correct format
6786 (the conclusion MUST be a formula variable)
6787 + ignores types, which can make HOL proofs fail
6788 + rules must not require higher-order unification, e.g. apply_type in ZF
6789 [message "Function Var's argument not a bound variable" relates to this]
6790 + its proof strategy is more general but can actually be slower
6792 * substitution with equality assumptions no longer permutes other
6795 * minor changes in semantics of addafter (now called addaltern); renamed
6796 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6797 (and access functions for it);
6799 * improved combination of classical reasoner and simplifier:
6800 + functions for handling clasimpsets
6801 + improvement of addss: now the simplifier is called _after_ the
6803 + safe variant of addss called addSss: uses safe simplifications
6804 _during_ the safe steps. It is more complete as it allows multiple
6805 instantiations of unknowns (e.g. with slow_tac).
6809 * added interface for simplification procedures (functions that
6810 produce *proven* rewrite rules on the fly, depending on current
6813 * ordering on terms as parameter (used for ordered rewriting);
6815 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6817 * the solver is now split into a safe and an unsafe part.
6818 This should be invisible for the normal user, except that the
6819 functions setsolver and addsolver have been renamed to setSolver and
6820 addSolver; added safe_asm_full_simp_tac;
6825 * a generic induction tactic `induct_tac' which works for all datatypes and
6826 also for type `nat';
6828 * a generic case distinction tactic `exhaust_tac' which works for all
6829 datatypes and also for type `nat';
6831 * each datatype comes with a function `size';
6833 * patterns in case expressions allow tuple patterns as arguments to
6834 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6836 * primrec now also works with type nat;
6838 * recdef: a new declaration form, allows general recursive functions to be
6839 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6841 * the constant for negation has been renamed from "not" to "Not" to
6842 harmonize with FOL, ZF, LK, etc.;
6844 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6847 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6849 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6850 problems in commutative rings, using axiomatic type classes for + and *;
6852 * more examples in HOL/MiniML and HOL/Auth;
6854 * more default rewrite rules for quantifiers, union/intersection;
6856 * a new constant `arbitrary == @x.False';
6858 * HOLCF/IOA replaces old HOL/IOA;
6860 * HOLCF changes: derived all rules and arities
6861 + axiomatic type classes instead of classes
6862 + typedef instead of faking type definitions
6863 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6864 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6865 + eliminated the types void, one, tr
6866 + use unit lift and bool lift (with translations) instead of one and tr
6867 + eliminated blift from Lift3.thy (use Def instead of blift)
6868 all eliminated rules are derived as theorems --> no visible changes ;
6873 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6874 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6875 as ZF_cs addSIs [equalityI];
6879 New in Isabelle94-7 (November 96)
6880 ---------------------------------
6882 * allowing negative levels (as offsets) in prlev and choplev;
6884 * super-linear speedup for large simplifications;
6886 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6887 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6888 FAIL); can suppress it using the command Delsimps (ex_simps @
6889 all_simps); De Morgan laws are also now included, by default;
6891 * improved printing of ==> : ~:
6893 * new object-logic "Sequents" adds linear logic, while replacing LK
6894 and Modal (thanks to Sara Kalvala);
6896 * HOL/Auth: correctness proofs for authentication protocols;
6898 * HOL: new auto_tac combines rewriting and classical reasoning (many
6899 examples on HOL/Auth);
6901 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6902 the rewriter and classical reasoner simultaneously;
6904 * function uresult no longer returns theorems in "standard" format;
6905 regain previous version by: val uresult = standard o uresult;
6912 * oracles -- these establish an interface between Isabelle and trusted
6913 external reasoners, which may deliver results as theorems;
6915 * proof objects (in particular record all uses of oracles);
6917 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6919 * "constdefs" section in theory files;
6921 * "primrec" section (HOL) no longer requires names;
6923 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6930 * reduced space requirements;
6932 * automatic HTML generation from theories;
6934 * theory files no longer require "..." (quotes) around most types;
6936 * new examples, including two proofs of the Church-Rosser theorem;
6938 * non-curried (1994) version of HOL is no longer distributed;
6945 * greatly reduced space requirements;
6947 * theory files (.thy) no longer require \...\ escapes at line breaks;
6949 * searchable theorem database (see the section "Retrieving theorems" on
6950 page 8 of the Reference Manual);
6952 * new examples, including Grabczewski's monumental case study of the
6955 * The previous version of HOL renamed to Old_HOL;
6957 * The new version of HOL (previously called CHOL) uses a curried syntax
6958 for functions. Application looks like f a b instead of f(a,b);
6960 * Mutually recursive inductive definitions finally work in HOL;
6962 * In ZF, pattern-matching on tuples is now available in all abstractions and
6963 translates to the operator "split";
6970 * new infix operator, addss, allowing the classical reasoner to
6971 perform simplification at each step of its search. Example:
6972 fast_tac (cs addss ss)
6974 * a new logic, CHOL, the same as HOL, but with a curried syntax
6975 for functions. Application looks like f a b instead of f(a,b). Also pairs
6976 look like (a,b) instead of <a,b>;
6978 * PLEASE NOTE: CHOL will eventually replace HOL!
6980 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6981 It translates to the operator "split". A new theory of integers is available;
6983 * In ZF, integer numerals now denote two's-complement binary integers.
6984 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6986 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6987 of the Axiom of Choice;
6994 * Significantly faster resolution;
6996 * the different sections in a .thy file can now be mixed and repeated
6999 * Database of theorems for FOL, HOL and ZF. New
7000 commands including qed, qed_goal and bind_thm store theorems in the database.
7002 * Simple database queries: return a named theorem (get_thm) or all theorems of
7003 a given theory (thms_of), or find out what theory a theorem was proved in
7006 * Bugs fixed in the inductive definition and datatype packages;
7008 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7009 and HOL_dup_cs obsolete;
7011 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7014 * Simpler definition of function space in ZF;
7016 * new results about cardinal and ordinal arithmetic in ZF;
7018 * 'subtype' facility in HOL for introducing new types as subsets of existing
7021 :mode=text:wrap=hard:maxLineLen=72: