1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Schematic theorem statements need to be explicitly markup as such,
10 via commands 'schematic_lemma', 'schematic_theorem',
11 'schematic_corollary'. Thus the relevance of the proof is made
12 syntactically clear, which impacts performance in a parallel or
13 asynchronous interactive environment. Minor INCOMPATIBILITY.
15 * Authentic syntax for *all* logical entities (type classes, type
16 constructors, term constants): provides simple and robust
17 correspondence between formal entities and concrete syntax. Within
18 the parse tree / AST representations, "constants" are decorated by
19 their category (class, type, const) and spelled out explicitly with
20 their full internal name.
22 Substantial INCOMPATIBILITY concerning low-level syntax declarations
23 and translations (translation rules and translation functions in ML).
24 Some hints on upgrading:
26 - Many existing uses of 'syntax' and 'translations' can be replaced
27 by more modern 'type_notation', 'notation' and 'abbreviation',
28 which are independent of this issue.
30 - 'translations' require markup within the AST; the term syntax
31 provides the following special forms:
33 CONST c -- produces syntax version of constant c from context
34 XCONST c -- literally c, checked as constant from context
35 c -- literally c, if declared by 'syntax'
37 Plain identifiers are treated as AST variables -- occasionally the
38 system indicates accidental variables via the error "rhs contains
41 Type classes and type constructors are marked according to their
42 concrete syntax. Some old translations rules need to be written
43 for the "type" category, using type constructor application
44 instead of pseudo-term application of the default category
47 - 'parse_translation' etc. in ML may use the following
50 @{class_syntax c} -- type class c within parse tree / AST
51 @{term_syntax c} -- type constructor c within parse tree / AST
52 @{const_syntax c} -- ML version of "CONST c" above
53 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
55 - Literal types within 'typed_print_translations', i.e. those *not*
56 represented as pseudo-terms are represented verbatim. Use @{class
57 c} or @{type_name c} here instead of the above syntax
60 Note that old non-authentic syntax was based on unqualified base
61 names, so all of the above "constant" names would coincide. Recall
62 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
63 diagnose syntax problems.
65 * Type constructors admit general mixfix syntax, not just infix.
67 * Use of cumulative prems via "!" in some proof methods has been
68 discontinued (legacy feature).
70 * References 'trace_simp' and 'debug_simp' have been replaced by
71 configuration options stored in the context. Enabling tracing
72 (the case of debugging is similar) in proofs works via
74 using [[trace_simp=true]]
76 Tracing is then active for all invocations of the simplifier
77 in subsequent goal refinement steps. Tracing may also still be
78 enabled or disabled via the ProofGeneral settings menu.
80 * Separate commands 'hide_class', 'hide_type', 'hide_const',
81 'hide_fact' replace the former 'hide' KIND command. Minor
87 * Code generator: simple concept for abstract datatypes obeying invariants.
89 * Local theory specifications may depend on extra type variables that
90 are not present in the result type -- arguments TYPE('a) :: 'a itself
91 are added internally. For example:
93 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
95 * Code generator: details of internal data cache have no impact on
96 the user space functionality any longer.
98 * Methods unfold_locales and intro_locales ignore non-locale subgoals. This
99 is more appropriate for interpretations with 'where'. INCOMPATIBILITY.
101 * Discontinued unnamed infix syntax (legacy feature for many years) --
102 need to specify constant name and syntax separately. Internal ML
103 datatype constructors have been renamed from InfixName to Infix etc.
104 Minor INCOMPATIBILITY.
106 * Command 'example_proof' opens an empty proof body. This allows to
107 experiment with Isar, without producing any persistent result.
109 * Commands 'type_notation' and 'no_type_notation' declare type syntax
110 within a local theory context, with explicit checking of the
111 constructors involved (in contrast to the raw 'syntax' versions).
113 * Commands 'types' and 'typedecl' now work within a local theory
114 context -- without introducing dependencies on parameters or
115 assumptions, which is not possible in Isabelle/Pure.
117 * Proof terms: Type substitutions on proof constants now use canonical
118 order of type variables. INCOMPATIBILITY: Tools working with proof
119 terms may need to be adapted.
125 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
126 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
127 * numerous lemmas have been ported from field to division_ring;
128 * dropped theorem group group_simps, use algebra_simps instead;
129 * dropped theorem group ring_simps, use field_simps instead;
130 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
131 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
135 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
136 provides abstract red-black tree type which is backed by RBT_Impl
137 as implementation. INCOMPATIBILTY.
139 * Command 'typedef' now works within a local theory context -- without
140 introducing dependencies on parameters or assumptions, which is not
141 possible in Isabelle/Pure/HOL. Note that the logical environment may
142 contain multiple interpretations of local typedefs (with different
143 non-emptiness proofs), even in a global theory context.
145 * Theory Library/Coinductive_List has been removed -- superceded by
146 AFP/thys/Coinductive.
148 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
149 Min, Max from theory Finite_Set. INCOMPATIBILITY.
151 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
154 * New set of rules "ac_simps" provides combined assoc / commute rewrites
155 for all interpretations of the appropriate generic locales.
157 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
158 into theories "Rings" and "Fields"; for more appropriate and more
159 consistent names suitable for name prefixes within the HOL theories.
162 * Some generic constants have been put to appropriate theories:
164 less_eq, less: Orderings
165 zero, one, plus, minus, uminus, times, abs, sgn: Groups
166 inverse, divide: Rings
170 * Class division_ring also requires proof of fact divide_inverse. However instantiation
171 of parameter divide has also been required previously. INCOMPATIBILITY.
173 * More consistent naming of type classes involving orderings (and lattices):
175 lower_semilattice ~> semilattice_inf
176 upper_semilattice ~> semilattice_sup
178 dense_linear_order ~> dense_linorder
180 pordered_ab_group_add ~> ordered_ab_group_add
181 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
182 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
183 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
184 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
185 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
186 pordered_cancel_semiring ~> ordered_cancel_semiring
187 pordered_comm_monoid_add ~> ordered_comm_monoid_add
188 pordered_comm_ring ~> ordered_comm_ring
189 pordered_comm_semiring ~> ordered_comm_semiring
190 pordered_ring ~> ordered_ring
191 pordered_ring_abs ~> ordered_ring_abs
192 pordered_semiring ~> ordered_semiring
194 ordered_ab_group_add ~> linordered_ab_group_add
195 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
196 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
197 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
198 ordered_field ~> linordered_field
199 ordered_field_no_lb ~> linordered_field_no_lb
200 ordered_field_no_ub ~> linordered_field_no_ub
201 ordered_field_dense_linear_order ~> dense_linordered_field
202 ordered_idom ~> linordered_idom
203 ordered_ring ~> linordered_ring
204 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
205 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
206 ordered_ring_strict ~> linordered_ring_strict
207 ordered_semidom ~> linordered_semidom
208 ordered_semiring ~> linordered_semiring
209 ordered_semiring_1 ~> linordered_semiring_1
210 ordered_semiring_1_strict ~> linordered_semiring_1_strict
211 ordered_semiring_strict ~> linordered_semiring_strict
213 The following slightly odd type classes have been moved to
214 a separate theory Library/Lattice_Algebras.thy:
216 lordered_ab_group_add ~> lattice_ab_group_add
217 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
218 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
219 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
220 lordered_ring ~> lattice_ring
224 * HOLogic.strip_psplit: types are returned in syntactic order, similar
225 to other strip and tuple operations. INCOMPATIBILITY.
227 * Various old-style primrec specifications in the HOL theories have been
228 replaced by new-style primrec, especially in theory List. The corresponding
229 constants now have authentic syntax. INCOMPATIBILITY.
231 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
232 * pointwise ordering is instance of class order with standard syntax <= and <;
233 * multiset ordering has syntax <=# and <#; partial order properties are provided
234 by means of interpretation with prefix multiset_order.
235 Less duplication, less historical organization of sections,
236 conversion from associations lists to multisets, rudimentary code generation.
237 Use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
240 * Reorganized theory Sum_Type; Inl and Inr now have authentic syntax.
243 * Code generation: ML and OCaml code is decorated with signatures.
245 * Theory Complete_Lattice: lemmas top_def and bot_def have been
246 replaced by the more convenient lemmas Inf_empty and Sup_empty.
247 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
248 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
249 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
250 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
252 * Theory Finite_Set and List: some lemmas have been generalized from
255 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
256 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
257 inter_Inter_fold_inter ~> inf_Inf_fold_inf
258 union_Union_fold_union ~> sup_Sup_fold_sup
259 Inter_fold_inter ~> Inf_fold_inf
260 Union_fold_union ~> Sup_fold_sup
261 inter_INTER_fold_inter ~> inf_INFI_fold_inf
262 union_UNION_fold_union ~> sup_SUPR_fold_sup
263 INTER_fold_inter ~> INFI_fold_inf
264 UNION_fold_union ~> SUPR_fold_sup
266 * Theory List: added transpose.
268 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
269 clash with new theory Quotient in Main HOL.
271 * Library/Nat_Bijection.thy is a collection of bijective functions
272 between nat and other types, which supersedes the older libraries
273 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
276 Nat_Int_Bij.nat2_to_nat ~> prod_encode
277 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
278 Nat_Int_Bij.int_to_nat_bij ~> int_encode
279 Nat_Int_Bij.nat_to_int_bij ~> int_decode
280 Countable.pair_encode ~> prod_encode
281 NatIso.prod2nat ~> prod_encode
282 NatIso.nat2prod ~> prod_decode
283 NatIso.sum2nat ~> sum_encode
284 NatIso.nat2sum ~> sum_decode
285 NatIso.list2nat ~> list_encode
286 NatIso.nat2list ~> list_decode
287 NatIso.set2nat ~> set_encode
288 NatIso.nat2set ~> set_decode
291 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
292 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
293 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
294 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
295 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
296 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
297 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
298 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
299 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
300 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
301 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
302 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
303 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
308 * Antiquotations for basic formal entities:
310 @{class NAME} -- type class
311 @{class_syntax NAME} -- syntax representation of the above
313 @{type_name NAME} -- logical type
314 @{type_abbrev NAME} -- type abbreviation
315 @{nonterminal NAME} -- type of concrete syntactic category
316 @{type_syntax NAME} -- syntax representation of any of the above
318 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
319 @{const_abbrev NAME} -- abbreviated constant
320 @{const_syntax NAME} -- syntax representation of any of the above
322 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
323 syntax constant (cf. 'syntax' command).
325 * Antiquotation @{make_string} inlines a function to print arbitrary
326 values similar to the ML toplevel. The result is compiler dependent
327 and may fall back on "?" in certain situations.
329 * Renamed old-style Drule.standard to Drule.export_without_context, to
330 emphasize that this is in no way a standard operation.
333 * Curried take and drop in library.ML; negative length is interpreted
334 as infinity (as in chop). INCOMPATIBILITY.
336 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
337 usual for resolution. Rare INCOMPATIBILITY.
339 * Discontinued old TheoryDataFun with its copy/init operation -- data
340 needs to be pure. Functor Theory_Data_PP retains the traditional
341 Pretty.pp argument to merge, which is absent in the standard
344 * Renamed varify/unvarify operations to varify_global/unvarify_global
345 to emphasize that these only work in a global situation (which is
348 * Configuration options now admit dynamic default values, depending on
349 the context or even global references.
354 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
355 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
356 proof terms are enabled unconditionally in the new HOL-Proofs image.
358 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
359 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
362 * Old lib/scripts/polyml-platform is superseded by the
363 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
364 variant, even on a 64 bit machine. The following example setting
365 prefers 64 bit if available:
367 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
371 New in Isabelle2009-1 (December 2009)
372 -------------------------------------
376 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
377 one backslash should be used, even in ML sources.
382 * Locale interpretation propagates mixins along the locale hierarchy.
383 The currently only available mixins are the equations used to map
384 local definitions to terms of the target domain of an interpretation.
386 * Reactivated diagnostic command 'print_interps'. Use "print_interps
387 loc" to print all interpretations of locale "loc" in the theory.
388 Interpretations in proofs are not shown.
390 * Thoroughly revised locales tutorial. New section on conditional
393 * On instantiation of classes, remaining undefined class parameters
394 are formally declared. INCOMPATIBILITY.
397 *** Document preparation ***
399 * New generalized style concept for printing terms: @{foo (style) ...}
400 instead of @{foo_style style ...} (old form is still retained for
401 backward compatibility). Styles can be also applied for
402 antiquotations prop, term_type and typeof.
407 * New proof method "smt" for a combination of first-order logic with
408 equality, linear and nonlinear (natural/integer/real) arithmetic, and
409 fixed-size bitvectors; there is also basic support for higher-order
410 features (esp. lambda abstractions). It is an incomplete decision
411 procedure based on external SMT solvers using the oracle mechanism;
412 for the SMT solver Z3, this method is proof-producing. Certificates
413 are provided to avoid calling the external solvers solely for
414 re-checking proofs. Due to a remote SMT service there is no need for
415 installing SMT solvers locally. See src/HOL/SMT.
417 * New commands to load and prove verification conditions generated by
418 the Boogie program verifier or derived systems (e.g. the Verifying C
419 Compiler (VCC) or Spec#). See src/HOL/Boogie.
421 * New counterexample generator tool 'nitpick' based on the Kodkod
422 relational model finder. See src/HOL/Tools/Nitpick and
423 src/HOL/Nitpick_Examples.
425 * New commands 'code_pred' and 'values' to invoke the predicate
426 compiler and to enumerate values of inductive predicates.
428 * A tabled implementation of the reflexive transitive closure.
430 * New implementation of quickcheck uses generic code generator;
431 default generators are provided for all suitable HOL types, records
432 and datatypes. Old quickcheck can be re-activated importing theory
433 Library/SML_Quickcheck.
435 * New testing tool Mirabelle for automated proof tools. Applies
436 several tools and tactics like sledgehammer, metis, or quickcheck, to
437 every proof step in a theory. To be used in batch mode via the
440 * New proof method "sos" (sum of squares) for nonlinear real
441 arithmetic (originally due to John Harison). It requires theory
442 Library/Sum_Of_Squares. It is not a complete decision procedure but
443 works well in practice on quantifier-free real arithmetic with +, -,
444 *, ^, =, <= and <, i.e. boolean combinations of equalities and
445 inequalities between polynomials. It makes use of external
446 semidefinite programming solvers. Method "sos" generates a
447 certificate that can be pasted into the proof thus avoiding the need
448 to call an external tool every time the proof is checked. See
449 src/HOL/Library/Sum_Of_Squares.
451 * New method "linarith" invokes existing linear arithmetic decision
454 * New command 'atp_minimal' reduces result produced by Sledgehammer.
456 * New Sledgehammer option "Full Types" in Proof General settings menu.
457 Causes full type information to be output to the ATPs. This slows
458 ATPs down considerably but eliminates a source of unsound "proofs"
461 * New method "metisFT": A version of metis that uses full type
462 information in order to avoid failures of proof reconstruction.
464 * New evaluator "approximate" approximates an real valued term using
465 the same method as the approximation method.
467 * Method "approximate" now supports arithmetic expressions as
468 boundaries of intervals and implements interval splitting and Taylor
471 * ML antiquotation @{code_datatype} inserts definition of a datatype
472 generated by the code generator; e.g. see src/HOL/Predicate.thy.
474 * New theory SupInf of the supremum and infimum operators for sets of
477 * New theory Probability, which contains a development of measure
478 theory, eventually leading to Lebesgue integration and probability.
480 * Extended Multivariate Analysis to include derivation and Brouwer's
483 * Reorganization of number theory, INCOMPATIBILITY:
484 - new number theory development for nat and int, in theories Divides
485 and GCD as well as in new session Number_Theory
486 - some constants and facts now suffixed with _nat and _int
488 - former session NumberTheory now named Old_Number_Theory, including
489 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
490 - moved theory Pocklington from src/HOL/Library to
491 src/HOL/Old_Number_Theory
493 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
494 lcm of finite and infinite sets. It is shown that they form a complete
497 * Class semiring_div requires superclass no_zero_divisors and proof of
498 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
499 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
500 generalized to class semiring_div, subsuming former theorems
501 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
502 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
505 * Refinements to lattice classes and sets:
506 - less default intro/elim rules in locale variant, more default
507 intro/elim rules in class variant: more uniformity
508 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
510 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
512 - renamed ACI to inf_sup_aci
513 - new class "boolean_algebra"
514 - class "complete_lattice" moved to separate theory
515 "Complete_Lattice"; corresponding constants (and abbreviations)
516 renamed and with authentic syntax:
517 Set.Inf ~> Complete_Lattice.Inf
518 Set.Sup ~> Complete_Lattice.Sup
519 Set.INFI ~> Complete_Lattice.INFI
520 Set.SUPR ~> Complete_Lattice.SUPR
521 Set.Inter ~> Complete_Lattice.Inter
522 Set.Union ~> Complete_Lattice.Union
523 Set.INTER ~> Complete_Lattice.INTER
524 Set.UNION ~> Complete_Lattice.UNION
525 - authentic syntax for
528 - mere abbreviations:
531 Set.inter (for inf, formerly Set.Int)
532 Set.union (for sup, formerly Set.Un)
533 Complete_Lattice.Inter (for Inf)
534 Complete_Lattice.Union (for Sup)
535 Complete_Lattice.INTER (for INFI)
536 Complete_Lattice.UNION (for SUPR)
537 - object-logic definitions as far as appropriate
539 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
540 Un_subset_iff are explicitly deleted as default simp rules; then also
541 their lattice counterparts le_inf_iff and le_sup_iff have to be
542 deleted to achieve the desired effect.
544 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
545 rules by default any longer; the same applies to min_max.inf_absorb1
546 etc. INCOMPATIBILITY.
548 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
549 pred_set_conv by default. INCOMPATIBILITY.
551 * Power operations on relations and functions are now one dedicated
552 constant "compow" with infix syntax "^^". Power operation on
553 multiplicative monoids retains syntax "^" and is now defined generic
554 in class power. INCOMPATIBILITY.
556 * Relation composition "R O S" now has a more standard argument order:
557 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
558 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
559 break, since the O_assoc rule was not rewritten like this. Fix using
560 O_assoc[symmetric]. The same applies to the curried version "R OO S".
562 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
563 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
566 * Most rules produced by inductive and datatype package have mandatory
567 prefixes. INCOMPATIBILITY.
569 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
570 the attribute of the same name. Each of the theorems in the list
571 DERIV_intros assumes composition with an additional function and
572 matches a variable to the derivative, which has to be solved by the
573 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
574 of most elementary terms. Former Maclauren.DERIV_tac and
575 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
578 * Code generator attributes follow the usual underscore convention:
579 code_unfold replaces code unfold
580 code_post replaces code post
585 sizechange -> size_change
586 induct_scheme -> induction_schema
589 * Discontinued abbreviation "arbitrary" of constant "undefined".
590 INCOMPATIBILITY, use "undefined" directly.
593 Suc_eq_add_numeral_1 -> Suc_eq_plus1
594 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
595 Suc_plus1 -> Suc_eq_plus1
596 *anti_sym -> *antisym*
597 vector_less_eq_def -> vector_le_def
600 * Added theorem List.map_map as [simp]. Removed List.map_compose.
603 * Removed predicate "M hassize n" (<--> card M = n & finite M).
609 * Theory Representable defines a class "rep" of domains that are
610 representable (via an ep-pair) in the universal domain type "udom".
611 Instances are provided for all type constructors defined in HOLCF.
613 * The 'new_domain' command is a purely definitional version of the
614 domain package, for representable domains. Syntax is identical to the
615 old domain package. The 'new_domain' package also supports indirect
616 recursion using previously-defined type constructors. See
617 src/HOLCF/ex/New_Domain.thy for examples.
619 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
620 on the left-hand side of an equation, and then performs
621 simplification. Rewriting is done using rules declared with the
622 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
623 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
625 * The pattern-match compiler in 'fixrec' can now handle constructors
626 with HOL function types. Pattern-match combinators for the Pair
627 constructor are pre-configured.
629 * The 'fixrec' package now produces better fixed-point induction rules
630 for mutually-recursive definitions: Induction rules have conclusions
631 of the form "P foo bar" instead of "P <foo, bar>".
633 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
634 been renamed to "below". The name "below" now replaces "less" in many
635 theorem names. (Legacy theorem names using "less" are still supported
638 * The 'fixrec' package now supports "bottom patterns". Bottom
639 patterns can be used to generate strictness rules, or to make
640 functions more strict (much like the bang-patterns supported by the
641 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
647 * Support for Poly/ML 5.3.0, with improved reporting of compiler
648 errors and run-time exceptions, including detailed source positions.
650 * Structure Name_Space (formerly NameSpace) now manages uniquely
651 identified entries, with some additional information such as source
652 position, logical grouping etc.
654 * Theory and context data is now introduced by the simplified and
655 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
656 to be pure, but the old TheoryDataFun for mutable data (with explicit
657 copy operation) is still available for some time.
659 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
660 provides a high-level programming interface to synchronized state
661 variables with atomic update. This works via pure function
662 application within a critical section -- its runtime should be as
663 short as possible; beware of deadlocks if critical code is nested,
664 either directly or indirectly via other synchronized variables!
666 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
667 wraps raw ML references, explicitly indicating their non-thread-safe
668 behaviour. The Isar toplevel keeps this structure open, to
669 accommodate Proof General as well as quick and dirty interactive
670 experiments with references.
672 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
673 parallel tactical reasoning.
675 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
676 are similar to SUBPROOF, but are slightly more flexible: only the
677 specified parts of the subgoal are imported into the context, and the
678 body tactic may introduce new subgoals and schematic variables.
680 * Old tactical METAHYPS, which does not observe the proof context, has
681 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
682 or Subgoal.FOCUS etc.
684 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
685 functors have their own ML name space there is no point to mark them
686 separately.) Minor INCOMPATIBILITY.
688 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
690 * Renamed several structures FooBar to Foo_Bar. Occasional,
693 * Operations of structure Skip_Proof no longer require quick_and_dirty
694 mode, which avoids critical setmp.
696 * Eliminated old Attrib.add_attributes, Method.add_methods and related
697 combinators for "args". INCOMPATIBILITY, need to use simplified
698 Attrib/Method.setup introduced in Isabelle2009.
700 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
701 back on global_simpset_of, global_claset_of, global_clasimpset_of as
702 last resort. INCOMPATIBILITY.
704 * Display.pretty_thm now requires a proper context (cf. former
705 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
706 or even Display.pretty_thm_without_context as last resort.
709 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
710 Syntax.pretty_typ/term directly, preferably with proper context
711 instead of global theory.
716 * Further fine tuning of parallel proof checking, scales up to 8 cores
717 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
720 * Support for additional "Isabelle components" via etc/components, see
721 also the system manual.
723 * The isabelle makeall tool now operates on all components with
724 IsaMakefile, not just hardwired "logics".
726 * Removed "compress" option from isabelle-process and isabelle usedir;
727 this is always enabled.
729 * Discontinued support for Poly/ML 4.x versions.
731 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
732 on a given logic image. This requires the lighttpd webserver and is
733 currently supported on Linux only.
737 New in Isabelle2009 (April 2009)
738 --------------------------------
742 * Simplified main Isabelle executables, with less surprises on
743 case-insensitive file-systems (such as Mac OS).
745 - The main Isabelle tool wrapper is now called "isabelle" instead of
748 - The former "isabelle" alias for "isabelle-process" has been
749 removed (should rarely occur to regular users).
751 - The former "isabelle-interface" and its alias "Isabelle" have been
752 removed (interfaces are now regular Isabelle tools).
754 Within scripts and make files, the Isabelle environment variables
755 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
756 respectively. (The latter are still available as legacy feature.)
758 The old isabelle-interface wrapper could react in confusing ways if
759 the interface was uninstalled or changed otherwise. Individual
760 interface tool configuration is now more explicit, see also the
761 Isabelle system manual. In particular, Proof General is now available
762 via "isabelle emacs".
764 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
765 purge installed copies of Isabelle executables and re-run "isabelle
766 install -p ...", or use symlinks.
768 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
769 old ~/isabelle, which was slightly non-standard and apt to cause
770 surprises on case-insensitive file-systems (such as Mac OS).
772 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
773 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
774 care is required when using older releases of Isabelle. Note that
775 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
776 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
778 * Proofs of fully specified statements are run in parallel on
779 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
780 a regular 4-core machine, if the initial heap space is made reasonably
781 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
783 * The main reference manuals ("isar-ref", "implementation", and
784 "system") have been updated and extended. Formally checked references
785 as hyperlinks are now available uniformly.
790 * Complete re-implementation of locales. INCOMPATIBILITY in several
791 respects. The most important changes are listed below. See the
792 Tutorial on Locales ("locales" manual) for details.
794 - In locale expressions, instantiation replaces renaming. Parameters
795 must be declared in a for clause. To aid compatibility with previous
796 parameter inheritance, in locale declarations, parameters that are not
797 'touched' (instantiation position "_" or omitted) are implicitly added
798 with their syntax at the beginning of the for clause.
800 - Syntax from abbreviations and definitions in locales is available in
801 locale expressions and context elements. The latter is particularly
802 useful in locale declarations.
804 - More flexible mechanisms to qualify names generated by locale
805 expressions. Qualifiers (prefixes) may be specified in locale
806 expressions, and can be marked as mandatory (syntax: "name!:") or
807 optional (syntax "name?:"). The default depends for plain "name:"
808 depends on the situation where a locale expression is used: in
809 commands 'locale' and 'sublocale' prefixes are optional, in
810 'interpretation' and 'interpret' prefixes are mandatory. The old
811 implicit qualifiers derived from the parameter names of a locale are
814 - Command "sublocale l < e" replaces "interpretation l < e". The
815 instantiation clause in "interpretation" and "interpret" (square
816 brackets) is no longer available. Use locale expressions.
818 - When converting proof scripts, mandatory qualifiers in
819 'interpretation' and 'interpret' should be retained by default, even
820 if this is an INCOMPATIBILITY compared to former behavior. In the
821 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
822 in locale expressions range over a single locale instance only.
824 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
825 In existing theorem specifications replace the includes element by the
826 respective context elements of the included locale, omitting those
827 that are already present in the theorem specification. Multiple
828 assume elements of a locale should be replaced by a single one
829 involving the locale predicate. In the proof body, declarations (most
830 notably theorems) may be regained by interpreting the respective
831 locales in the proof context as required (command "interpret").
833 If using "includes" in replacement of a target solely because the
834 parameter types in the theorem are not as general as in the target,
835 consider declaring a new locale with additional type constraints on
836 the parameters (context element "constrains").
838 - Discontinued "locale (open)". INCOMPATIBILITY.
840 - Locale interpretation commands no longer attempt to simplify goal.
841 INCOMPATIBILITY: in rare situations the generated goal differs. Use
842 methods intro_locales and unfold_locales to clarify.
844 - Locale interpretation commands no longer accept interpretation
845 attributes. INCOMPATIBILITY.
847 * Class declaration: so-called "base sort" must not be given in import
848 list any longer, but is inferred from the specification. Particularly
855 class foo = type + ...
857 * Class target: global versions of theorems stemming do not carry a
858 parameter prefix any longer. INCOMPATIBILITY.
860 * Class 'instance' command no longer accepts attached definitions.
861 INCOMPATIBILITY, use proper 'instantiation' target instead.
863 * Recovered hiding of consts, which was accidentally broken in
864 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
865 makes c inaccessible; consider using ``hide (open) const c'' instead.
867 * Slightly more coherent Pure syntax, with updated documentation in
868 isar-ref manual. Removed locales meta_term_syntax and
869 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
870 INCOMPATIBILITY in rare situations. Note that &&& should not be used
871 directly in regular applications.
873 * There is a new syntactic category "float_const" for signed decimal
874 fractions (e.g. 123.45 or -123.45).
876 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
877 interface with 'setup' command instead.
879 * Command 'local_setup' is similar to 'setup', but operates on a local
882 * The 'axiomatization' command now only works within a global theory
883 context. INCOMPATIBILITY.
885 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
886 hypotheses. Sorts required in the course of reasoning need to be
887 covered by the constraints in the initial statement, completed by the
888 type instance information of the background theory. Non-trivial sort
889 hypotheses, which rarely occur in practice, may be specified via
890 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
892 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
894 The result contains an implicit sort hypotheses as before --
895 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
898 * Generalized Isar history, with support for linear undo, direct state
901 * Changed defaults for unify configuration options:
903 unify_trace_bound = 50 (formerly 25)
904 unify_search_bound = 60 (formerly 30)
906 * Different bookkeeping for code equations (INCOMPATIBILITY):
908 a) On theory merge, the last set of code equations for a particular
909 constant is taken (in accordance with the policy applied by other
910 parts of the code generator framework).
912 b) Code equations stemming from explicit declarations (e.g. code
913 attribute) gain priority over default code equations stemming
914 from definition, primrec, fun etc.
916 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
918 * Unified theorem tables for both code generators. Thus [code
919 func] has disappeared and only [code] remains. INCOMPATIBILITY.
921 * Command 'find_consts' searches for constants based on type and name
924 find_consts "_ => bool"
926 By default, matching is against subtypes, but it may be restricted to
927 the whole type. Searching by name is possible. Multiple queries are
928 conjunctive and queries may be negated by prefixing them with a
931 find_consts strict: "_ => bool" name: "Int" -"int => int"
933 * New 'find_theorems' criterion "solves" matches theorems that
934 directly solve the current goal (modulo higher-order unification).
936 * Auto solve feature for main theorem statements: whenever a new goal
937 is stated, "find_theorems solves" is called; any theorems that could
938 solve the lemma directly are listed as part of the goal state.
939 Cf. associated options in Proof General Isabelle settings menu,
940 enabled by default, with reasonable timeout for pathological cases of
941 higher-order unification.
944 *** Document preparation ***
946 * Antiquotation @{lemma} now imitates a regular terminal proof,
947 demanding keyword 'by' and supporting the full method expression
948 syntax just like the Isar command 'by'.
953 * Integrated main parts of former image HOL-Complex with HOL. Entry
954 points Main and Complex_Main remain as before.
956 * Logic image HOL-Plain provides a minimal HOL with the most important
957 tools available (inductive, datatype, primrec, ...). This facilitates
958 experimentation and tool development. Note that user applications
959 (and library theories) should never refer to anything below theory
962 * Logic image HOL-Main stops at theory Main, and thus facilitates
963 experimentation due to shorter build times.
965 * Logic image HOL-NSA contains theories of nonstandard analysis which
966 were previously part of former HOL-Complex. Entry point Hyperreal
967 remains valid, but theories formerly using Complex_Main should now use
968 new entry point Hypercomplex.
970 * Generic ATP manager for Sledgehammer, based on ML threads instead of
971 Posix processes. Avoids potentially expensive forking of the ML
972 process. New thread-based implementation also works on non-Unix
973 platforms (Cygwin). Provers are no longer hardwired, but defined
974 within the theory via plain ML wrapper functions. Basic Sledgehammer
975 commands are covered in the isar-ref manual.
977 * Wrapper scripts for remote SystemOnTPTP service allows to use
978 sledgehammer without local ATP installation (Vampire etc.). Other
979 provers may be included via suitable ML wrappers, see also
980 src/HOL/ATP_Linkup.thy.
982 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
985 * The metis method no longer fails because the theorem is too trivial
986 (contains the empty clause).
988 * The metis method now fails in the usual manner, rather than raising
989 an exception, if it determines that it cannot prove the theorem.
991 * Method "coherent" implements a prover for coherent logic (see also
992 src/Tools/coherent.ML).
994 * Constants "undefined" and "default" replace "arbitrary". Usually
995 "undefined" is the right choice to replace "arbitrary", though
996 logically there is no difference. INCOMPATIBILITY.
998 * Command "value" now integrates different evaluation mechanisms. The
999 result of the first successful evaluation mechanism is printed. In
1000 square brackets a particular named evaluation mechanisms may be
1001 specified (currently, [SML], [code] or [nbe]). See further
1002 src/HOL/ex/Eval_Examples.thy.
1004 * Normalization by evaluation now allows non-leftlinear equations.
1005 Declare with attribute [code nbe].
1007 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1008 as the structured Isar versions "cases" and "induct", cf. the
1009 corresponding "cases" and "induct" attributes. Mutual induction rules
1010 are now presented as a list of individual projections
1011 (e.g. foo_bar.inducts for types foo and bar); the old format with
1012 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1013 rare situations a different rule is selected --- notably nested tuple
1014 elimination instead of former prod.exhaust: use explicit (case_tac t
1015 rule: prod.exhaust) here.
1017 * Attributes "cases", "induct", "coinduct" support "del" option.
1019 * Removed fact "case_split_thm", which duplicates "case_split".
1021 * The option datatype has been moved to a new theory Option. Renamed
1022 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1024 * New predicate "strict_mono" classifies strict functions on partial
1025 orders. With strict functions on linear orders, reasoning about
1026 (in)equalities is facilitated by theorems "strict_mono_eq",
1027 "strict_mono_less_eq" and "strict_mono_less".
1029 * Some set operations are now proper qualified constants with
1030 authentic syntax. INCOMPATIBILITY:
1041 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1044 * Auxiliary class "itself" has disappeared -- classes without any
1045 parameter are treated as expected by the 'class' command.
1047 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1049 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1050 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1052 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1053 method "approximation". It proves formulas on real values by using
1054 interval arithmetic. In the formulas are also the transcendental
1055 functions sin, cos, tan, atan, ln, exp and the constant pi are
1056 allowed. For examples see
1057 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1059 * Theory "Reflection" now resides in HOL/Library.
1061 * Entry point to Word library now simply named "Word".
1064 * Made source layout more coherent with logical distribution
1067 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1068 src/HOL/Library/Code_Message.thy ~> src/HOL/
1069 src/HOL/Library/GCD.thy ~> src/HOL/
1070 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1071 src/HOL/Library/Parity.thy ~> src/HOL/
1072 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1073 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1074 src/HOL/Real/Lubs.thy ~> src/HOL/
1075 src/HOL/Real/PReal.thy ~> src/HOL/
1076 src/HOL/Real/Rational.thy ~> src/HOL/
1077 src/HOL/Real/RComplete.thy ~> src/HOL/
1078 src/HOL/Real/RealDef.thy ~> src/HOL/
1079 src/HOL/Real/RealPow.thy ~> src/HOL/
1080 src/HOL/Real/Real.thy ~> src/HOL/
1081 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1082 src/HOL/Complex/Complex.thy ~> src/HOL/
1083 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1084 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1085 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1086 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1087 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1088 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1089 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1090 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1091 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1092 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1093 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1094 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1095 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1096 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1097 src/HOL/Real/Float ~> src/HOL/Library/
1098 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1099 src/HOL/Real/RealVector.thy ~> src/HOL/
1101 src/HOL/arith_data.ML ~> src/HOL/Tools
1102 src/HOL/hologic.ML ~> src/HOL/Tools
1103 src/HOL/simpdata.ML ~> src/HOL/Tools
1104 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1105 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1106 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1107 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1108 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1109 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1110 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1112 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1113 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1114 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1115 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1116 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1117 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1119 * If methods "eval" and "evaluation" encounter a structured proof
1120 state with !!/==>, only the conclusion is evaluated to True (if
1121 possible), avoiding strange error messages.
1123 * Method "sizechange" automates termination proofs using (a
1124 modification of) the size-change principle. Requires SAT solver. See
1125 src/HOL/ex/Termination.thy for examples.
1127 * Simplifier: simproc for let expressions now unfolds if bound
1128 variable occurs at most once in let expression body. INCOMPATIBILITY.
1130 * Method "arith": Linear arithmetic now ignores all inequalities when
1131 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1133 * New attribute "arith" for facts that should always be used
1134 automatically by arithmetic. It is intended to be used locally in
1137 assumes [arith]: "x > 0"
1139 Global usage is discouraged because of possible performance impact.
1141 * New classes "top" and "bot" with corresponding operations "top" and
1142 "bot" in theory Orderings; instantiation of class "complete_lattice"
1143 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1145 * Changed definition lemma "less_fun_def" in order to provide an
1146 instance for preorders on functions; use lemma "less_le" instead.
1149 * Theory Orderings: class "wellorder" moved here, with explicit
1150 induction rule "less_induct" as assumption. For instantiation of
1151 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1154 * Theory Orderings: added class "preorder" as superclass of "order".
1155 INCOMPATIBILITY: Instantiation proofs for order, linorder
1156 etc. slightly changed. Some theorems named order_class.* now named
1159 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1162 * Theory Finite_Set: added a new fold combinator of type
1164 ('a => 'b => 'b) => 'b => 'a set => 'b
1166 Occasionally this is more convenient than the old fold combinator
1167 which is now defined in terms of the new one and renamed to
1170 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1171 and "ring_simps" have been replaced by "algebra_simps" (which can be
1172 extended with further lemmas!). At the moment both still exist but
1173 the former will disappear at some point.
1175 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1176 class recpower. Type-specific simp rules for various recpower types
1177 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1179 rat_power_0 -> power_0
1180 rat_power_Suc -> power_Suc
1181 realpow_0 -> power_0
1182 realpow_Suc -> power_Suc
1183 complexpow_0 -> power_0
1184 complexpow_Suc -> power_Suc
1185 power_poly_0 -> power_0
1186 power_poly_Suc -> power_Suc
1188 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1189 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1190 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1191 of lemmas from Divides has been generalized from nat to class
1192 semiring_div. INCOMPATIBILITY. This involves the following theorem
1193 renames resulting from duplicate elimination:
1195 dvd_def_mod ~> dvd_eq_mod_eq_0
1196 zero_dvd_iff ~> dvd_0_left_iff
1197 dvd_0 ~> dvd_0_right
1198 DIVISION_BY_ZERO_DIV ~> div_by_0
1199 DIVISION_BY_ZERO_MOD ~> mod_by_0
1200 mult_div ~> div_mult_self2_is_id
1201 mult_mod ~> mod_mult_self2_is_0
1203 * Theory IntDiv: removed many lemmas that are instances of class-based
1204 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1205 rename old lemmas as follows:
1207 dvd_diff -> nat_dvd_diff
1208 dvd_zminus_iff -> dvd_minus_iff
1209 mod_add1_eq -> mod_add_eq
1210 mod_mult1_eq -> mod_mult_right_eq
1211 mod_mult1_eq' -> mod_mult_left_eq
1212 mod_mult_distrib_mod -> mod_mult_eq
1213 nat_mod_add_left_eq -> mod_add_left_eq
1214 nat_mod_add_right_eq -> mod_add_right_eq
1215 nat_mod_div_trivial -> mod_div_trivial
1216 nat_mod_mod_trivial -> mod_mod_trivial
1217 zdiv_zadd_self1 -> div_add_self1
1218 zdiv_zadd_self2 -> div_add_self2
1219 zdiv_zmult_self1 -> div_mult_self2_is_id
1220 zdiv_zmult_self2 -> div_mult_self1_is_id
1221 zdvd_triv_left -> dvd_triv_left
1222 zdvd_triv_right -> dvd_triv_right
1223 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1224 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1225 zmod_zadd_left_eq -> mod_add_left_eq
1226 zmod_zadd_right_eq -> mod_add_right_eq
1227 zmod_zadd_self1 -> mod_add_self1
1228 zmod_zadd_self2 -> mod_add_self2
1229 zmod_zadd1_eq -> mod_add_eq
1230 zmod_zdiff1_eq -> mod_diff_eq
1231 zmod_zdvd_zmod -> mod_mod_cancel
1232 zmod_zmod_cancel -> mod_mod_cancel
1233 zmod_zmult_self1 -> mod_mult_self2_is_0
1234 zmod_zmult_self2 -> mod_mult_self1_is_0
1237 zdvd_abs1 -> abs_dvd_iff
1238 zdvd_abs2 -> dvd_abs_iff
1239 zdvd_refl -> dvd_refl
1240 zdvd_trans -> dvd_trans
1241 zdvd_zadd -> dvd_add
1242 zdvd_zdiff -> dvd_diff
1243 zdvd_zminus_iff -> dvd_minus_iff
1244 zdvd_zminus2_iff -> minus_dvd_iff
1245 zdvd_zmultD -> dvd_mult_right
1246 zdvd_zmultD2 -> dvd_mult_left
1247 zdvd_zmult_mono -> mult_dvd_mono
1248 zdvd_0_right -> dvd_0_right
1249 zdvd_0_left -> dvd_0_left_iff
1250 zdvd_1_left -> one_dvd
1251 zminus_dvd_iff -> minus_dvd_iff
1253 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1255 * The real numbers offer decimal input syntax: 12.34 is translated
1256 into 1234/10^2. This translation is not reversed upon output.
1258 * Theory Library/Polynomial defines an abstract type 'a poly of
1259 univariate polynomials with coefficients of type 'a. In addition to
1260 the standard ring operations, it also supports div and mod. Code
1261 generation is also supported, using list-style constructors.
1263 * Theory Library/Inner_Product defines a class of real_inner for real
1264 inner product spaces, with an overloaded operation inner :: 'a => 'a
1265 => real. Class real_inner is a subclass of real_normed_vector from
1268 * Theory Library/Product_Vector provides instances for the product
1269 type 'a * 'b of several classes from RealVector and Inner_Product.
1270 Definitions of addition, subtraction, scalar multiplication, norms,
1271 and inner products are included.
1273 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1274 addition to the field operations, numerals and case syntax are also
1277 * Theory Library/Diagonalize provides constructive version of Cantor's
1278 first diagonalization argument.
1280 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1281 zlcm (for int); carried together from various gcd/lcm developements in
1282 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1283 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1284 may recover tupled syntax as follows:
1286 hide (open) const gcd
1287 abbreviation gcd where
1288 "gcd == (%(a, b). GCD.gcd a b)"
1290 GCD.gcd ("gcd '(_, _')")
1292 The same works for lcm, zgcd, zlcm.
1294 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1295 instantiations for algebraic structures. Removed some duplicate
1296 theorems. Changes in simp rules. INCOMPATIBILITY.
1298 * ML antiquotation @{code} takes a constant as argument and generates
1299 corresponding code in background and inserts name of the corresponding
1300 resulting ML value/function/datatype constructor binding in place.
1301 All occurrences of @{code} with a single ML block are generated
1302 simultaneously. Provides a generic and safe interface for
1303 instrumentalizing code generation. See
1304 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1305 In future you ought to refrain from ad-hoc compiling generated SML
1306 code on the ML toplevel. Note that (for technical reasons) @{code}
1307 cannot refer to constants for which user-defined serializations are
1308 set. Refer to the corresponding ML counterpart directly in that
1311 * Command 'rep_datatype': instead of theorem names the command now
1312 takes a list of terms denoting the constructors of the type to be
1313 represented as datatype. The characteristic theorems have to be
1314 proven. INCOMPATIBILITY. Also observe that the following theorems
1315 have disappeared in favour of existing ones:
1317 unit_induct ~> unit.induct
1318 prod_induct ~> prod.induct
1319 sum_induct ~> sum.induct
1320 Suc_Suc_eq ~> nat.inject
1321 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1326 * New locales for orders and lattices where the equivalence relation
1327 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1328 locales use a record structure with field eq for the equivalence.
1330 * New theory of factorial domains.
1332 * Units_l_inv and Units_r_inv are now simp rules by default.
1333 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1334 and/or r_inv will now also require deletion of these lemmas.
1336 * Renamed the following theorems, INCOMPATIBILITY:
1338 UpperD ~> Upper_memD
1339 LowerD ~> Lower_memD
1340 least_carrier ~> least_closed
1341 greatest_carrier ~> greatest_closed
1342 greatest_Lower_above ~> greatest_Lower_below
1343 one_zero ~> carrier_one_zero
1344 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1349 * Nominal datatypes can now contain type-variables.
1351 * Commands 'nominal_inductive' and 'equivariance' work with local
1354 * Nominal primrec can now works with local theory targets and its
1355 specification syntax now conforms to the general format as seen in
1358 * Method "perm_simp" honours the standard simplifier attributes
1359 (no_asm), (no_asm_use) etc.
1361 * The new predicate #* is defined like freshness, except that on the
1362 left hand side can be a set or list of atoms.
1364 * Experimental command 'nominal_inductive2' derives strong induction
1365 principles for inductive definitions. In contrast to
1366 'nominal_inductive', which can only deal with a fixed number of
1367 binders, it can deal with arbitrary expressions standing for sets of
1368 atoms to be avoided. The only inductive definition we have at the
1369 moment that needs this generalisation is the typing rule for Lets in
1372 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1373 -----------------------------------------------------------------
1374 Gamma |- Let x be t1 in t2 : T2
1376 In this rule one wants to avoid all the binders that are introduced by
1377 "close Gamma T1". We are looking for other examples where this
1378 feature might be useful. Please let us know.
1383 * Reimplemented the simplification procedure for proving continuity
1384 subgoals. The new simproc is extensible; users can declare additional
1385 continuity introduction rules with the attribute [cont2cont].
1387 * The continuity simproc now uses a different introduction rule for
1388 solving continuity subgoals on terms with lambda abstractions. In
1389 some rare cases the new simproc may fail to solve subgoals that the
1390 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1391 Potential INCOMPATIBILITY.
1393 * Command 'fixrec': specification syntax now conforms to the general
1394 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1395 examples. INCOMPATIBILITY.
1400 * Proof of Zorn's Lemma for partial orders.
1405 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1406 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1407 depends on multithreading, so timouts will not work before Poly/ML
1410 * High-level support for concurrent ML programming, see
1411 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1412 particularly convenient to organize independent functional
1413 computations. The concept of "synchronized variables" provides a
1414 higher-order interface for components with shared state, avoiding the
1415 delicate details of mutexes and condition variables. (Requires
1416 Poly/ML 5.2.1 or later.)
1418 * ML bindings produced via Isar commands are stored within the Isar
1419 context (theory or proof). Consequently, commands like 'use' and 'ML'
1420 become thread-safe and work with undo as expected (concerning
1421 top-level bindings, not side-effects on global references).
1422 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1423 compiler at runtime; really global bindings need to be given outside a
1424 theory. (Requires Poly/ML 5.2 or later.)
1426 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1427 context. Top-level ML bindings are stored within the proof context in
1428 a purely sequential fashion, disregarding the nested proof structure.
1429 ML bindings introduced by 'ML_prf' are discarded at the end of the
1430 proof. (Requires Poly/ML 5.2 or later.)
1432 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1433 and Method.setup, as well as Isar commands 'attribute_setup' and
1434 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1435 existing code accordingly, or use plain 'setup' together with old
1438 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1439 to 'a -> thm, while results are always tagged with an authentic oracle
1440 name. The Isar command 'oracle' is now polymorphic, no argument type
1441 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1442 accordingly. Note that extra performance may be gained by producing
1443 the cterm carefully, avoiding slow Thm.cterm_of.
1445 * Simplified interface for defining document antiquotations via
1446 ThyOutput.antiquotation, ThyOutput.output, and optionally
1447 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1448 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1451 * More systematic treatment of long names, abstract name bindings, and
1452 name space operations. Basic operations on qualified names have been
1453 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1454 Long_Name.append. Old type bstring has been mostly replaced by
1455 abstract type binding (see structure Binding), which supports precise
1456 qualification by packages and local theory targets, as well as proper
1457 tracking of source positions. INCOMPATIBILITY, need to wrap old
1458 bstring values into Binding.name, or better pass through abstract
1459 bindings everywhere. See further src/Pure/General/long_name.ML,
1460 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1462 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1463 LocalTheory.note etc.) now refer to the *full* internal name, not the
1464 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1466 * Disposed old type and term read functions (Sign.read_def_typ,
1467 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1468 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1469 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1470 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1471 resort for legacy applications.
1473 * Disposed old declarations, tactics, tactic combinators that refer to
1474 the simpset or claset of an implicit theory (such as Addsimps,
1475 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1476 embedded ML text, or local_simpset_of with a proper context passed as
1477 explicit runtime argument.
1479 * Rules and tactics that read instantiations (read_instantiate,
1480 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1481 context, which is required for parsing and type-checking. Moreover,
1482 the variables are specified as plain indexnames, not string encodings
1483 thereof. INCOMPATIBILITY.
1485 * Generic Toplevel.add_hook interface allows to analyze the result of
1486 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1487 for theorem dependency output of transactions resulting in a new
1490 * ML antiquotations: block-structured compilation context indicated by
1491 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1493 @{binding name} - basic name binding
1494 @{let ?pat = term} - term abbreviation (HO matching)
1495 @{note name = fact} - fact abbreviation
1496 @{thm fact} - singleton fact (with attributes)
1497 @{thms fact} - general fact (with attributes)
1498 @{lemma prop by method} - singleton goal
1499 @{lemma prop by meth1 meth2} - singleton goal
1500 @{lemma prop1 ... propN by method} - general goal
1501 @{lemma prop1 ... propN by meth1 meth2} - general goal
1502 @{lemma (open) ...} - open derivation
1507 * The Isabelle "emacs" tool provides a specific interface to invoke
1508 Proof General / Emacs, with more explicit failure if that is not
1509 installed (the old isabelle-interface script silently falls back on
1510 isabelle-process). The PROOFGENERAL_HOME setting determines the
1511 installation location of the Proof General distribution.
1513 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1514 the Isabelle process into a JVM/Scala application. See
1515 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1516 process wrapper has been discontinued.)
1518 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1520 * Various status messages (with exact source position information) are
1521 emitted, if proper markup print mode is enabled. This allows
1522 user-interface components to provide detailed feedback on internal
1527 New in Isabelle2008 (June 2008)
1528 -------------------------------
1532 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1533 and updated, with formally checked references as hyperlinks.
1535 * Theory loader: use_thy (and similar operations) no longer set the
1536 implicit ML context, which was occasionally hard to predict and in
1537 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1538 provides a proper context already.
1540 * Theory loader: old-style ML proof scripts being *attached* to a thy
1541 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1542 'use' within a theory file will do the job.
1544 * Name space merge now observes canonical order, i.e. the second space
1545 is inserted into the first one, while existing entries in the first
1546 space take precedence. INCOMPATIBILITY in rare situations, may try to
1547 swap theory imports.
1549 * Syntax: symbol \<chi> is now considered a letter. Potential
1550 INCOMPATIBILITY in identifier syntax etc.
1552 * Outer syntax: string tokens no longer admit escaped white space,
1553 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1554 white space without escapes.
1556 * Outer syntax: string tokens may contain arbitrary character codes
1557 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1563 * Context-dependent token translations. Default setup reverts locally
1564 fixed variables, and adds hilite markup for undeclared frees.
1566 * Unused theorems can be found using the new command 'unused_thms'.
1567 There are three ways of invoking it:
1570 Only finds unused theorems in the current theory.
1572 (2) unused_thms thy_1 ... thy_n -
1573 Finds unused theorems in the current theory and all of its ancestors,
1574 excluding the theories thy_1 ... thy_n and all of their ancestors.
1576 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1577 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1578 their ancestors, excluding the theories thy_1 ... thy_n and all of
1581 In order to increase the readability of the list produced by
1582 unused_thms, theorems that have been created by a particular instance
1583 of a theory command such as 'inductive' or 'function' are considered
1584 to belong to the same "group", meaning that if at least one theorem in
1585 this group is used, the other theorems in the same group are no longer
1586 reported as unused. Moreover, if all theorems in the group are
1587 unused, only one theorem in the group is displayed.
1589 Note that proof objects have to be switched on in order for
1590 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1591 usually the case when using Proof General with the default settings).
1593 * Authentic naming of facts disallows ad-hoc overwriting of previous
1594 theorems within the same name space. INCOMPATIBILITY, need to remove
1595 duplicate fact bindings, or even accidental fact duplications. Note
1596 that tools may maintain dynamically scoped facts systematically, using
1597 PureThy.add_thms_dynamic.
1599 * Command 'hide' now allows to hide from "fact" name space as well.
1601 * Eliminated destructive theorem database, simpset, claset, and
1602 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1603 update of theories within ML code.
1605 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1606 INCOMPATIBILITY, object-logics depending on former Pure require
1607 additional setup PureThy.old_appl_syntax_setup; object-logics
1608 depending on former CPure need to refer to Pure.
1610 * Commands 'use' and 'ML' are now purely functional, operating on
1611 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1612 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1615 * Command 'setup': discontinued implicit version with ML reference.
1617 * Instantiation target allows for simultaneous specification of class
1618 instance operations together with an instantiation proof.
1619 Type-checking phase allows to refer to class operations uniformly.
1620 See src/HOL/Complex/Complex.thy for an Isar example and
1621 src/HOL/Library/Eval.thy for an ML example.
1623 * Indexing of literal facts: be more serious about including only
1624 facts from the visible specification/proof context, but not the
1625 background context (locale etc.). Affects `prop` notation and method
1626 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1629 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1630 "(open)" option, which used to expose internal bound variables to the
1633 * Isar statements: removed obsolete case "rule_context".
1634 INCOMPATIBILITY, better use explicit fixes/assumes.
1636 * Locale proofs: default proof step now includes 'unfold_locales';
1637 hence 'proof' without argument may be used to unfold locale
1641 *** Document preparation ***
1643 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1644 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1645 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1646 spot); renamed link color from "darkblue" to "linkcolor" (default
1647 value unchanged, can be redefined via \definecolor); no longer sets
1648 "a4paper" option (unnecessary or even intrusive).
1650 * Antiquotation @{lemma A method} proves proposition A by the given
1651 method (either a method name or a method name plus (optional) method
1652 arguments in parentheses) and prints A just like @{prop A}.
1657 * New primrec package. Specification syntax conforms in style to
1658 definition/function/.... No separate induction rule is provided. The
1659 "primrec" command distinguishes old-style and new-style specifications
1660 by syntax. The former primrec package is now named OldPrimrecPackage.
1661 When adjusting theories, beware: constants stemming from new-style
1662 primrec specifications have authentic syntax.
1664 * Metis prover is now an order of magnitude faster, and also works
1665 with multithreading.
1667 * Metis: the maximum number of clauses that can be produced from a
1668 theorem is now given by the attribute max_clauses. Theorems that
1669 exceed this number are ignored, with a warning printed.
1671 * Sledgehammer no longer produces structured proofs by default. To
1672 enable, declare [[sledgehammer_full = true]]. Attributes
1673 reconstruction_modulus, reconstruction_sorts renamed
1674 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1676 * Method "induct_scheme" derives user-specified induction rules
1677 from well-founded induction and completeness of patterns. This factors
1678 out some operations that are done internally by the function package
1679 and makes them available separately. See
1680 src/HOL/ex/Induction_Scheme.thy for examples.
1682 * More flexible generation of measure functions for termination
1683 proofs: Measure functions can be declared by proving a rule of the
1684 form "is_measure f" and giving it the [measure_function] attribute.
1685 The "is_measure" predicate is logically meaningless (always true), and
1686 just guides the heuristic. To find suitable measure functions, the
1687 termination prover sets up the goal "is_measure ?f" of the appropriate
1688 type and generates all solutions by prolog-style backwards proof using
1691 This setup also deals with rules like
1693 "is_measure f ==> is_measure (list_size f)"
1695 which accommodates nested datatypes that recurse through lists.
1696 Similar rules are predeclared for products and option types.
1698 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1702 - Definitions of overloaded constants on sets have to be replaced by
1703 definitions on => and bool.
1705 - Some definitions of overloaded operators on sets can now be proved
1706 using the definitions of the operators on => and bool. Therefore,
1707 the following theorems have been renamed:
1709 subset_def -> subset_eq
1710 psubset_def -> psubset_eq
1711 set_diff_def -> set_diff_eq
1712 Compl_def -> Compl_eq
1713 Sup_set_def -> Sup_set_eq
1714 Inf_set_def -> Inf_set_eq
1715 sup_set_def -> sup_set_eq
1716 inf_set_def -> inf_set_eq
1718 - Due to the incompleteness of the HO unification algorithm, some
1719 rules such as subst may require manual instantiation, if some of
1720 the unknowns in the rule is a set.
1722 - Higher order unification and forward proofs:
1725 have "P (S::'a set)" <...>
1726 then have "EX S. P S" ..
1728 no longer works (due to the incompleteness of the HO unification
1729 algorithm) and must be replaced by the pattern
1736 - Calculational reasoning with subst (or similar rules):
1739 have "P (S::'a set)" <...>
1740 also have "S = T" <...>
1741 finally have "P T" .
1743 no longer works (for similar reasons as the previous example) and
1744 must be replaced by something like
1746 have "P (S::'a set)" <...>
1747 moreover have "S = T" <...>
1748 ultimately have "P T" by simp
1750 - Tactics or packages written in ML code:
1751 Code performing pattern matching on types via
1753 Type ("set", [T]) => ...
1755 must be rewritten. Moreover, functions like strip_type or
1756 binder_types no longer return the right value when applied to a
1759 T1 => ... => Tn => U => bool
1763 T1 => ... => Tn => U set
1765 * Merged theories Wellfounded_Recursion, Accessible_Part and
1766 Wellfounded_Relations to theory Wellfounded.
1768 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1770 * Class finite no longer treats UNIV as class parameter. Use class
1771 enum from theory Library/Enum instead to achieve a similar effect.
1774 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1775 and "Cons". INCOMPATIBILITY.
1777 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1778 Potential INCOMPATIBILITY.
1780 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1781 injective_fst_snd removed, use split_eta and prod_eqI instead.
1782 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1784 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1785 the same name in theory Orderings:
1795 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1796 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1797 and different variable names.
1799 * Library/Option_ord.thy: Canonical order on option type.
1801 * Library/RBT.thy: Red-black trees, an efficient implementation of
1804 * Library/Countable.thy: Type class for countable types.
1806 * Theory Int: The representation of numerals has changed. The infix
1807 operator BIT and the bit datatype with constructors B0 and B1 have
1808 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1809 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1810 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1813 * Theory Nat: definition of <= and < on natural numbers no longer
1814 depend on well-founded relations. INCOMPATIBILITY. Definitions
1815 le_def and less_def have disappeared. Consider lemmas not_less
1816 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1818 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1819 (whose purpose mainly is for various fold_set functionals) have been
1820 abandoned in favor of the existing algebraic classes
1821 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1822 lower_semilattice (resp. upper_semilattice) and linorder.
1825 * Theory Transitive_Closure: induct and cases rules now declare proper
1826 case_names ("base" and "step"). INCOMPATIBILITY.
1828 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1829 lattices. The form set-specific version is available as
1830 Inductive.lfp_ordinal_induct_set.
1832 * Renamed theorems "power.simps" to "power_int.simps".
1835 * Class semiring_div provides basic abstract properties of semirings
1836 with division and modulo operations. Subsumes former class dvd_mod.
1838 * Merged theories IntDef, Numeral and IntArith into unified theory
1839 Int. INCOMPATIBILITY.
1841 * Theory Library/Code_Index: type "index" now represents natural
1842 numbers rather than integers. INCOMPATIBILITY.
1844 * New class "uminus" with operation "uminus" (split of from class
1845 "minus" which now only has operation "minus", binary).
1848 * Constants "card", "internal_split", "option_map" now with authentic
1849 syntax. INCOMPATIBILITY.
1851 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1852 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1853 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1854 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1855 Sup_set_def, le_def, less_def, option_map_def now with object
1856 equality. INCOMPATIBILITY.
1858 * Records. Removed K_record, and replaced it by pure lambda term
1859 %x. c. The simplifier setup is now more robust against eta expansion.
1860 INCOMPATIBILITY: in cases explicitly referring to K_record.
1862 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1864 * Library/ListVector: new theory of arithmetic vector operations.
1866 * Library/Order_Relation: new theory of various orderings as sets of
1867 pairs. Defines preorders, partial orders, linear orders and
1868 well-orders on sets and on types.
1873 * Renamed some theories to allow to loading both ZF and HOL in the
1876 Datatype -> Datatype_ZF
1877 Inductive -> Inductive_ZF
1884 INCOMPATIBILITY: ZF theories that import individual theories below
1885 Main might need to be adapted. Regular theory Main is still
1886 available, as trivial extension of Main_ZF.
1891 * ML within Isar: antiquotation @{const name} or @{const
1892 name(typargs)} produces statically-checked Const term.
1894 * Functor NamedThmsFun: data is available to the user as dynamic fact
1895 (of the same name). Removed obsolete print command.
1897 * Removed obsolete "use_legacy_bindings" function.
1899 * The ``print mode'' is now a thread-local value derived from a global
1900 template (the former print_mode reference), thus access becomes
1901 non-critical. The global print_mode reference is for session
1902 management only; user-code should use print_mode_value,
1903 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1905 * Functions system/system_out provide a robust way to invoke external
1906 shell commands, with propagation of interrupts (requires Poly/ML
1907 5.2.1). Do not use OS.Process.system etc. from the basis library!
1912 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1913 in accordance with Proof General 3.7, which prefers GNU emacs.
1915 * isatool tty runs Isabelle process with plain tty interaction;
1916 optional line editor may be specified via ISABELLE_LINE_EDITOR
1917 setting, the default settings attempt to locate "ledit" and "rlwrap".
1919 * isatool browser now works with Cygwin as well, using general
1920 "javapath" function defined in Isabelle process environment.
1922 * YXML notation provides a simple and efficient alternative to
1923 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1924 isatool yxml as described in the Isabelle system manual.
1926 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1927 provides general wrapper for managing an Isabelle process in a robust
1928 fashion, with ``cooked'' output from stdin/stderr.
1930 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1931 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1933 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1934 way of changing the user's settings is via
1935 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1938 * Multithreading.max_threads := 0 refers to the number of actual CPU
1939 cores of the underlying machine, which is a good starting point for
1940 optimal performance tuning. The corresponding usedir option -M allows
1941 "max" as an alias for "0". WARNING: does not work on certain versions
1942 of Mac OS (with Poly/ML 5.1).
1944 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1945 adverse effect of Isabelle flooding interactive front-ends (notably
1946 ProofGeneral / XEmacs).
1950 New in Isabelle2007 (November 2007)
1951 -----------------------------------
1955 * More uniform information about legacy features, notably a
1956 warning/error of "Legacy feature: ...", depending on the state of the
1957 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1958 legacy features will disappear eventually.
1960 * Theory syntax: the header format ``theory A = B + C:'' has been
1961 discontinued in favour of ``theory A imports B C begin''. Use isatool
1962 fixheaders to convert existing theory files. INCOMPATIBILITY.
1964 * Theory syntax: the old non-Isar theory file format has been
1965 discontinued altogether. Note that ML proof scripts may still be used
1966 with Isar theories; migration is usually quite simple with the ML
1967 function use_legacy_bindings. INCOMPATIBILITY.
1969 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1970 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
1973 * Theory loader: be more serious about observing the static theory
1974 header specifications (including optional directories), but not the
1975 accidental file locations of previously successful loads. The strict
1976 update policy of former update_thy is now already performed by
1977 use_thy, so the former has been removed; use_thys updates several
1978 theories simultaneously, just as 'imports' within a theory header
1979 specification, but without merging the results. Potential
1980 INCOMPATIBILITY: may need to refine theory headers and commands
1981 ROOT.ML which depend on load order.
1983 * Theory loader: optional support for content-based file
1984 identification, instead of the traditional scheme of full physical
1985 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
1986 (cf. the system manual). The new scheme allows to work with
1987 non-finished theories in persistent session images, such that source
1988 files may be moved later on without requiring reloads.
1990 * Theory loader: old-style ML proof scripts being *attached* to a thy
1991 file (with the same base name as the theory) are considered a legacy
1992 feature, which will disappear eventually. Even now, the theory loader
1993 no longer maintains dependencies on such files.
1995 * Syntax: the scope for resolving ambiguities via type-inference is
1996 now limited to individual terms, instead of whole simultaneous
1997 specifications as before. This greatly reduces the complexity of the
1998 syntax module and improves flexibility by separating parsing and
1999 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2000 'fixes' etc.) are required in rare situations.
2002 * Syntax: constants introduced by new-style packages ('definition',
2003 'abbreviation' etc.) are passed through the syntax module in
2004 ``authentic mode''. This means that associated mixfix annotations
2005 really stick to such constants, independently of potential name space
2006 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2007 trees are represented slightly differently, may need to adapt syntax
2008 translations accordingly. Use CONST marker in 'translations' and
2009 @{const_syntax} antiquotation in 'parse_translation' etc.
2011 * Legacy goal package: reduced interface to the bare minimum required
2012 to keep existing proof scripts running. Most other user-level
2013 functions are now part of the OldGoals structure, which is *not* open
2014 by default (consider isatool expandshort before open OldGoals).
2015 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2016 these tend to cause confusion about the actual goal (!) context being
2017 used here, which is not necessarily the same as the_context().
2019 * Command 'find_theorems': supports "*" wild-card in "name:"
2020 criterion; "with_dups" option. Certain ProofGeneral versions might
2021 support a specific search form (see ProofGeneral/CHANGES).
2023 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2024 by default, which means that "prems" (and also "fixed variables") are
2025 suppressed from proof state output. Note that the ProofGeneral
2026 settings mechanism allows to change and save options persistently, but
2027 older versions of Isabelle will fail to start up if a negative prems
2030 * Local theory targets may be specified by non-nested blocks of
2031 ``context/locale/class ... begin'' followed by ``end''. The body may
2032 contain definitions, theorems etc., including any derived mechanism
2033 that has been implemented on top of these primitives. This concept
2034 generalizes the existing ``theorem (in ...)'' towards more versatility
2037 * Proof General interface: proper undo of final 'end' command;
2038 discontinued Isabelle/classic mode (ML proof scripts).
2041 *** Document preparation ***
2043 * Added antiquotation @{theory name} which prints the given name,
2044 after checking that it refers to a valid ancestor theory in the
2047 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2048 check the given source text as ML type/structure, printing verbatim.
2050 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2051 "c args == rhs" given in the current context. (Any number of
2052 arguments may be given on the LHS.)
2057 * The 'class' package offers a combination of axclass and locale to
2058 achieve Haskell-like type classes in Isabelle. Definitions and
2059 theorems within a class context produce both relative results (with
2060 implicit parameters according to the locale context), and polymorphic
2061 constants with qualified polymorphism (according to the class
2062 context). Within the body context of a 'class' target, a separate
2063 syntax layer ("user space type system") takes care of converting
2064 between global polymorphic consts and internal locale representation.
2065 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2066 "isatool doc classes" provides a tutorial.
2068 * Generic code generator framework allows to generate executable
2069 code for ML and Haskell (including Isabelle classes). A short usage
2072 internal compilation:
2073 export_code <list of constants (term syntax)> in SML
2074 writing SML code to a file:
2075 export_code <list of constants (term syntax)> in SML <filename>
2076 writing OCaml code to a file:
2077 export_code <list of constants (term syntax)> in OCaml <filename>
2078 writing Haskell code to a bunch of files:
2079 export_code <list of constants (term syntax)> in Haskell <filename>
2081 evaluating closed propositions to True/False using code generation:
2084 Reasonable default setup of framework in HOL.
2086 Theorem attributs for selecting and transforming function equations theorems:
2088 [code fun]: select a theorem as function equation for a specific constant
2089 [code fun del]: deselect a theorem as function equation for a specific constant
2090 [code inline]: select an equation theorem for unfolding (inlining) in place
2091 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2093 User-defined serializations (target in {SML, OCaml, Haskell}):
2095 code_const <and-list of constants (term syntax)>
2096 {(target) <and-list of const target syntax>}+
2098 code_type <and-list of type constructors>
2099 {(target) <and-list of type target syntax>}+
2101 code_instance <and-list of instances>
2103 where instance ::= <type constructor> :: <class>
2105 code_class <and_list of classes>
2106 {(target) <and-list of class target syntax>}+
2107 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2109 code_instance and code_class only are effective to target Haskell.
2111 For example usage see src/HOL/ex/Codegenerator.thy and
2112 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2113 generation from Isabelle/HOL theories is available via "isatool doc
2116 * Code generator: consts in 'consts_code' Isar commands are now
2117 referred to by usual term syntax (including optional type
2120 * Command 'no_translations' removes translation rules from theory
2123 * Overloaded definitions are now actually checked for acyclic
2124 dependencies. The overloading scheme is slightly more general than
2125 that of Haskell98, although Isabelle does not demand an exact
2126 correspondence to type class and instance declarations.
2127 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2128 exotic versions of overloading -- at the discretion of the user!
2130 Polymorphic constants are represented via type arguments, i.e. the
2131 instantiation that matches an instance against the most general
2132 declaration given in the signature. For example, with the declaration
2133 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2134 as c(nat). Overloading is essentially simultaneous structural
2135 recursion over such type arguments. Incomplete specification patterns
2136 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2137 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2138 Command 'print_theory' outputs the normalized system of recursive
2139 equations, see section "definitions".
2141 * Configuration options are maintained within the theory or proof
2142 context (with name and type bool/int/string), providing a very simple
2143 interface to a poor-man's version of general context data. Tools may
2144 declare options in ML (e.g. using Attrib.config_int) and then refer to
2145 these values using Config.get etc. Users may change options via an
2146 associated attribute of the same name. This form of context
2147 declaration works particularly well with commands 'declare' or
2148 'using', for example ``declare [[foo = 42]]''. Thus it has become
2149 very easy to avoid global references, which would not observe Isar
2150 toplevel undo/redo and fail to work with multithreading.
2152 Various global ML references of Pure and HOL have been turned into
2153 configuration options:
2155 Unify.search_bound unify_search_bound
2156 Unify.trace_bound unify_trace_bound
2157 Unify.trace_simp unify_trace_simp
2158 Unify.trace_types unify_trace_types
2159 Simplifier.simp_depth_limit simp_depth_limit
2160 Blast.depth_limit blast_depth_limit
2161 DatatypeProp.dtK datatype_distinctness_limit
2162 fast_arith_neq_limit fast_arith_neq_limit
2163 fast_arith_split_limit fast_arith_split_limit
2165 * Named collections of theorems may be easily installed as context
2166 data using the functor NamedThmsFun (see also
2167 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2168 attributes; there is also a toplevel print command. This facility is
2169 just a common case of general context data, which is the preferred way
2170 for anything more complex than just a list of facts in canonical
2173 * Isar: command 'declaration' augments a local theory by generic
2174 declaration functions written in ML. This enables arbitrary content
2175 being added to the context, depending on a morphism that tells the
2176 difference of the original declaration context wrt. the application
2177 context encountered later on.
2179 * Isar: proper interfaces for simplification procedures. Command
2180 'simproc_setup' declares named simprocs (with match patterns, and body
2181 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2182 context. ML antiquotation @{simproc name} retrieves named simprocs.
2184 * Isar: an extra pair of brackets around attribute declarations
2185 abbreviates a theorem reference involving an internal dummy fact,
2186 which will be ignored later --- only the effect of the attribute on
2187 the background context will persist. This form of in-place
2188 declarations is particularly useful with commands like 'declare' and
2189 'using', for example ``have A using [[simproc a]] by simp''.
2191 * Isar: method "assumption" (and implicit closing of subproofs) now
2192 takes simple non-atomic goal assumptions into account: after applying
2193 an assumption as a rule the resulting subgoals are solved by atomic
2194 assumption steps. This is particularly useful to finish 'obtain'
2195 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2196 without referring to the original premise "!!x. P x ==> thesis" in the
2197 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2200 * Isar: implicit use of prems from the Isar proof context is
2201 considered a legacy feature. Common applications like ``have A .''
2202 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2203 referencing facts explicitly here improves readability and
2204 maintainability of proof texts.
2206 * Isar: improper proof element 'guess' is like 'obtain', but derives
2207 the obtained context from the course of reasoning! For example:
2209 assume "EX x y. A x & B y" -- "any previous fact"
2210 then guess x and y by clarify
2212 This technique is potentially adventurous, depending on the facts and
2213 proof tools being involved here.
2215 * Isar: known facts from the proof context may be specified as literal
2216 propositions, using ASCII back-quote syntax. This works wherever
2217 named facts used to be allowed so far, in proof commands, proof
2218 methods, attributes etc. Literal facts are retrieved from the context
2219 according to unification of type and term parameters. For example,
2220 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2221 theorems in the current context, then these are valid literal facts:
2222 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2224 There is also a proof method "fact" which does the same composition
2225 for explicit goal states, e.g. the following proof texts coincide with
2226 certain special cases of literal facts:
2228 have "A" by fact == note `A`
2229 have "A ==> B" by fact == note `A ==> B`
2230 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2231 have "P a ==> Q a" by fact == note `P a ==> Q a`
2233 * Isar: ":" (colon) is no longer a symbolic identifier character in
2234 outer syntax. Thus symbolic identifiers may be used without
2235 additional white space in declarations like this: ``assume *: A''.
2237 * Isar: 'print_facts' prints all local facts of the current context,
2238 both named and unnamed ones.
2240 * Isar: 'def' now admits simultaneous definitions, e.g.:
2242 def x == "t" and y == "u"
2244 * Isar: added command 'unfolding', which is structurally similar to
2245 'using', but affects both the goal state and facts by unfolding given
2246 rewrite rules. Thus many occurrences of the 'unfold' method or
2247 'unfolded' attribute may be replaced by first-class proof text.
2249 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2250 and command 'unfolding' now all support object-level equalities
2251 (potentially conditional). The underlying notion of rewrite rule is
2252 analogous to the 'rule_format' attribute, but *not* that of the
2253 Simplifier (which is usually more generous).
2255 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2256 premises of a theorem by n. Useful in conjunction with drule.
2258 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2259 method expression within a sandbox consisting of the first N
2260 sub-goals, which need to exist. For example, ``simp_all [3]''
2261 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2262 simplifies all new goals that emerge from applying rule foo to the
2263 originally first one.
2265 * Isar: schematic goals are no longer restricted to higher-order
2266 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2269 * Isar: the conclusion of a long theorem statement is now either
2270 'shows' (a simultaneous conjunction, as before), or 'obtains'
2271 (essentially a disjunction of cases with local parameters and
2272 assumptions). The latter allows to express general elimination rules
2273 adequately; in this notation common elimination rules look like this:
2275 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2277 obtains x where "P x"
2279 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2283 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2289 The subsequent classical rules even refer to the formal "thesis"
2292 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2295 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2296 obtains "thesis ==> something"
2298 The actual proof of an 'obtains' statement is analogous to that of the
2299 Isar proof element 'obtain', only that there may be several cases.
2300 Optional case names may be specified in parentheses; these will be
2301 available both in the present proof and as annotations in the
2302 resulting rule, for later use with the 'cases' method (cf. attribute
2305 * Isar: the assumptions of a long theorem statement are available as
2306 "assms" fact in the proof context. This is more appropriate than the
2307 (historical) "prems", which refers to all assumptions of the current
2308 context, including those from the target locale, proof body etc.
2310 * Isar: 'print_statement' prints theorems from the current theory or
2311 proof context in long statement form, according to the syntax of a
2314 * Isar: 'obtain' takes an optional case name for the local context
2315 introduction rule (default "that").
2317 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2318 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2321 * Pure: syntax "CONST name" produces a fully internalized constant
2322 according to the current context. This is particularly useful for
2323 syntax translations that should refer to internal constant
2324 representations independently of name spaces.
2326 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2327 instead of "FOO ". This allows multiple binder declarations to coexist
2328 in the same context. INCOMPATIBILITY.
2330 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2331 primitive that also works in a locale context (both for constants and
2332 fixed variables). Type declaration and internal syntactic representation
2333 of given constants retrieved from the context. Likewise, the
2334 'no_notation' command allows to remove given syntax annotations from the
2337 * Isar/locales: new derived specification elements 'axiomatization',
2338 'definition', 'abbreviation', which support type-inference, admit
2339 object-level specifications (equality, equivalence). See also the
2340 isar-ref manual. Examples:
2343 eq (infix "===" 50) where
2344 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2346 definition "f x y = x + y + 1"
2347 definition g where "g x = f x x"
2350 neq (infix "=!=" 50) where
2351 "x =!= y == ~ (x === y)"
2353 These specifications may be also used in a locale context. Then the
2354 constants being introduced depend on certain fixed parameters, and the
2355 constant name is qualified by the locale base name. An internal
2356 abbreviation takes care for convenient input and output, making the
2357 parameters implicit and using the original short name. See also
2358 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2359 entities from a monomorphic theory.
2361 Presently, abbreviations are only available 'in' a target locale, but
2362 not inherited by general import expressions. Also note that
2363 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2364 'translations' in common applications. The "no_abbrevs" print mode
2365 prevents folding of abbreviations in term output.
2367 Concrete syntax is attached to specified constants in internal form,
2368 independently of name spaces. The parse tree representation is
2369 slightly different -- use 'notation' instead of raw 'syntax', and
2370 'translations' with explicit "CONST" markup to accommodate this.
2372 * Pure/Isar: unified syntax for new-style specification mechanisms
2373 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2374 full type inference and dummy patterns ("_"). For example:
2376 definition "K x _ = x"
2378 inductive conj for A B
2379 where "A ==> B ==> conj A B"
2381 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2382 the current context. Print mode "no_abbrevs" prevents inversion of
2383 abbreviations on output.
2385 * Isar/locales: improved parameter handling: use of locales "var" and
2386 "struct" no longer necessary; - parameter renamings are no longer
2387 required to be injective. For example, this allows to define
2388 endomorphisms as locale endom = homom mult mult h.
2390 * Isar/locales: changed the way locales with predicates are defined.
2391 Instead of accumulating the specification, the imported expression is
2392 now an interpretation. INCOMPATIBILITY: different normal form of
2393 locale expressions. In particular, in interpretations of locales with
2394 predicates, goals repesenting already interpreted fragments are not
2395 removed automatically. Use methods `intro_locales' and
2396 `unfold_locales'; see below.
2398 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2399 provide backward reasoning on locales predicates. The methods are
2400 aware of interpretations and discharge corresponding goals.
2401 `intro_locales' is less aggressive then `unfold_locales' and does not
2402 unfold predicates to assumptions.
2404 * Isar/locales: the order in which locale fragments are accumulated
2405 has changed. This enables to override declarations from fragments due
2406 to interpretations -- for example, unwanted simp rules.
2408 * Isar/locales: interpretation in theories and proof contexts has been
2409 extended. One may now specify (and prove) equations, which are
2410 unfolded in interpreted theorems. This is useful for replacing
2411 defined concepts (constants depending on locale parameters) by
2412 concepts already existing in the target context. Example:
2414 interpretation partial_order ["op <= :: [int, int] => bool"]
2415 where "partial_order.less (op <=) (x::int) y = (x < y)"
2417 Typically, the constant `partial_order.less' is created by a
2418 definition specification element in the context of locale
2421 * Method "induct": improved internal context management to support
2422 local fixes and defines on-the-fly. Thus explicit meta-level
2423 connectives !! and ==> are rarely required anymore in inductive goals
2424 (using object-logic connectives for this purpose has been long
2425 obsolete anyway). Common proof patterns are explained in
2426 src/HOL/Induct/Common_Patterns.thy, see also
2427 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2430 * Method "induct": improved handling of simultaneous goals. Instead of
2431 introducing object-level conjunction, the statement is now split into
2432 several conclusions, while the corresponding symbolic cases are nested
2433 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2434 see src/HOL/Induct/Common_Patterns.thy, for example.
2436 * Method "induct": mutual induction rules are now specified as a list
2437 of rule sharing the same induction cases. HOL packages usually provide
2438 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2439 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2440 mutual induction rules differently, i.e. like this:
2442 (induct rule: foo_bar.inducts)
2443 (induct set: foo bar)
2444 (induct pred: foo bar)
2445 (induct type: foo bar)
2447 The ML function ProjectRule.projections turns old-style rules into the
2450 * Method "coinduct": dual of induction, see
2451 src/HOL/Library/Coinductive_List.thy for various examples.
2453 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2454 considered a legacy feature.
2456 * Attribute "symmetric" produces result with standardized schematic
2457 variables (index 0). Potential INCOMPATIBILITY.
2459 * Simplifier: by default the simplifier trace only shows top level
2460 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2461 default. Thus there is less danger of being flooded by the trace. The
2462 trace indicates where parts have been suppressed.
2464 * Provers/classical: removed obsolete classical version of elim_format
2465 attribute; classical elim/dest rules are now treated uniformly when
2466 manipulating the claset.
2468 * Provers/classical: stricter checks to ensure that supplied intro,
2469 dest and elim rules are well-formed; dest and elim rules must have at
2472 * Provers/classical: attributes dest/elim/intro take an optional
2473 weight argument for the rule (just as the Pure versions). Weights are
2474 ignored by automated tools, but determine the search order of single
2477 * Syntax: input syntax now supports dummy variable binding "%_. b",
2478 where the body does not mention the bound variable. Note that dummy
2479 patterns implicitly depend on their context of bounds, which makes
2480 "{_. _}" match any set comprehension as expected. Potential
2481 INCOMPATIBILITY -- parse translations need to cope with syntactic
2482 constant "_idtdummy" in the binding position.
2484 * Syntax: removed obsolete syntactic constant "_K" and its associated
2485 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2486 for example "A -> B" => "Pi A (%_. B)".
2488 * Pure: 'class_deps' command visualizes the subclass relation, using
2489 the graph browser tool.
2491 * Pure: 'print_theory' now suppresses certain internal declarations by
2492 default; use '!' option for full details.
2497 * Method "metis" proves goals by applying the Metis general-purpose
2498 resolution prover (see also http://gilith.com/software/metis/).
2499 Examples are in the directory MetisExamples. WARNING: the
2500 Isabelle/HOL-Metis integration does not yet work properly with
2503 * Command 'sledgehammer' invokes external automatic theorem provers as
2504 background processes. It generates calls to the "metis" method if
2505 successful. These can be pasted into the proof. Users do not have to
2506 wait for the automatic provers to return. WARNING: does not really
2507 work with multi-threading.
2509 * New "auto_quickcheck" feature tests outermost goal statements for
2510 potential counter-examples. Controlled by ML references
2511 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2512 5000 milliseconds). Fails silently if statements is outside of
2513 executable fragment, or any other codgenerator problem occurs.
2515 * New constant "undefined" with axiom "undefined x = undefined".
2517 * Added class "HOL.eq", allowing for code generation with polymorphic
2520 * Some renaming of class constants due to canonical name prefixing in
2521 the new 'class' package:
2523 HOL.abs ~> HOL.abs_class.abs
2524 HOL.divide ~> HOL.divide_class.divide
2525 0 ~> HOL.zero_class.zero
2526 1 ~> HOL.one_class.one
2527 op + ~> HOL.plus_class.plus
2528 op - ~> HOL.minus_class.minus
2529 uminus ~> HOL.minus_class.uminus
2530 op * ~> HOL.times_class.times
2531 op < ~> HOL.ord_class.less
2532 op <= > HOL.ord_class.less_eq
2533 Nat.power ~> Power.power_class.power
2534 Nat.size ~> Nat.size_class.size
2535 Numeral.number_of ~> Numeral.number_class.number_of
2536 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2537 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2538 Orderings.min ~> Orderings.ord_class.min
2539 Orderings.max ~> Orderings.ord_class.max
2540 Divides.op div ~> Divides.div_class.div
2541 Divides.op mod ~> Divides.div_class.mod
2542 Divides.op dvd ~> Divides.div_class.dvd
2544 INCOMPATIBILITY. Adaptions may be required in the following cases:
2546 a) User-defined constants using any of the names "plus", "minus",
2547 "times", "less" or "less_eq". The standard syntax translations for
2548 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2551 b) Variables named "plus", "minus", "times", "less", "less_eq"
2552 INCOMPATIBILITY: use more specific names.
2554 c) Permutative equations (e.g. "a + b = b + a")
2555 Since the change of names also changes the order of terms, permutative
2556 rewrite rules may get applied in a different order. Experience shows
2557 that this is rarely the case (only two adaptions in the whole Isabelle
2558 distribution). INCOMPATIBILITY: rewrite proofs
2560 d) ML code directly refering to constant names
2561 This in general only affects hand-written proof tactics, simprocs and
2562 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2563 Consider using @{const_name} antiquotation.
2565 * New class "default" with associated constant "default".
2567 * Function "sgn" is now overloaded and available on int, real, complex
2568 (and other numeric types), using class "sgn". Two possible defs of
2569 sgn are given as equational assumptions in the classes sgn_if and
2570 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2573 * Locale "partial_order" now unified with class "order" (cf. theory
2574 Orderings), added parameter "less". INCOMPATIBILITY.
2576 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2577 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2578 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2580 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2581 changed order of proof goals in instance proofs.
2583 * The transitivity reasoner for partial and linear orders is set up
2584 for classes "order" and "linorder". Instances of the reasoner are available
2585 in all contexts importing or interpreting the corresponding locales.
2586 Method "order" invokes the reasoner separately; the reasoner
2587 is also integrated with the Simplifier as a solver. Diagnostic
2588 command 'print_orders' shows the available instances of the reasoner
2589 in the current context.
2591 * Localized monotonicity predicate in theory "Orderings"; integrated
2592 lemmas max_of_mono and min_of_mono with this predicate.
2595 * Formulation of theorem "dense" changed slightly due to integration
2596 with new class dense_linear_order.
2598 * Uniform lattice theory development in HOL.
2600 constants "meet" and "join" now named "inf" and "sup"
2601 constant "Meet" now named "Inf"
2603 classes "meet_semilorder" and "join_semilorder" now named
2604 "lower_semilattice" and "upper_semilattice"
2605 class "lorder" now named "lattice"
2606 class "comp_lat" now named "complete_lattice"
2608 Instantiation of lattice classes allows explicit definitions
2609 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2611 INCOMPATIBILITY. Theorem renames:
2613 meet_left_le ~> inf_le1
2614 meet_right_le ~> inf_le2
2615 join_left_le ~> sup_ge1
2616 join_right_le ~> sup_ge2
2617 meet_join_le ~> inf_sup_ord
2620 le_meet ~> le_inf_iff
2621 le_join ~> ge_sup_conv
2622 meet_idempotent ~> inf_idem
2623 join_idempotent ~> sup_idem
2624 meet_comm ~> inf_commute
2625 join_comm ~> sup_commute
2626 meet_leI1 ~> le_infI1
2627 meet_leI2 ~> le_infI2
2628 le_joinI1 ~> le_supI1
2629 le_joinI2 ~> le_supI2
2630 meet_assoc ~> inf_assoc
2631 join_assoc ~> sup_assoc
2632 meet_left_comm ~> inf_left_commute
2633 meet_left_idempotent ~> inf_left_idem
2634 join_left_comm ~> sup_left_commute
2635 join_left_idempotent ~> sup_left_idem
2638 le_def_meet ~> le_iff_inf
2639 le_def_join ~> le_iff_sup
2640 join_absorp2 ~> sup_absorb2
2641 join_absorp1 ~> sup_absorb1
2642 meet_absorp1 ~> inf_absorb1
2643 meet_absorp2 ~> inf_absorb2
2644 meet_join_absorp ~> inf_sup_absorb
2645 join_meet_absorp ~> sup_inf_absorb
2646 distrib_join_le ~> distrib_sup_le
2647 distrib_meet_le ~> distrib_inf_le
2649 add_meet_distrib_left ~> add_inf_distrib_left
2650 add_join_distrib_left ~> add_sup_distrib_left
2651 is_join_neg_meet ~> is_join_neg_inf
2652 is_meet_neg_join ~> is_meet_neg_sup
2653 add_meet_distrib_right ~> add_inf_distrib_right
2654 add_join_distrib_right ~> add_sup_distrib_right
2655 add_meet_join_distribs ~> add_sup_inf_distribs
2656 join_eq_neg_meet ~> sup_eq_neg_inf
2657 meet_eq_neg_join ~> inf_eq_neg_sup
2658 add_eq_meet_join ~> add_eq_inf_sup
2659 meet_0_imp_0 ~> inf_0_imp_0
2660 join_0_imp_0 ~> sup_0_imp_0
2661 meet_0_eq_0 ~> inf_0_eq_0
2662 join_0_eq_0 ~> sup_0_eq_0
2663 neg_meet_eq_join ~> neg_inf_eq_sup
2664 neg_join_eq_meet ~> neg_sup_eq_inf
2665 join_eq_if ~> sup_eq_if
2667 mono_meet ~> mono_inf
2668 mono_join ~> mono_sup
2669 meet_bool_eq ~> inf_bool_eq
2670 join_bool_eq ~> sup_bool_eq
2671 meet_fun_eq ~> inf_fun_eq
2672 join_fun_eq ~> sup_fun_eq
2673 meet_set_eq ~> inf_set_eq
2674 join_set_eq ~> sup_set_eq
2675 meet1_iff ~> inf1_iff
2676 meet2_iff ~> inf2_iff
2685 join1_iff ~> sup1_iff
2686 join2_iff ~> sup2_iff
2696 is_meet_Meet ~> is_meet_Inf
2697 Meet_bool_def ~> Inf_bool_def
2698 Meet_fun_def ~> Inf_fun_def
2699 Meet_greatest ~> Inf_greatest
2700 Meet_lower ~> Inf_lower
2701 Meet_set_def ~> Inf_set_def
2704 Sup_bool_eq ~> Sup_bool_def
2705 Sup_fun_eq ~> Sup_fun_def
2706 Sup_set_eq ~> Sup_set_def
2708 listsp_meetI ~> listsp_infI
2709 listsp_meet_eq ~> listsp_inf_eq
2714 * Added syntactic class "size"; overloaded constant "size" now has
2715 type "'a::size ==> bool"
2717 * Internal reorganisation of `size' of datatypes: size theorems
2718 "foo.size" are no longer subsumed by "foo.simps" (but are still
2719 simplification rules by default!); theorems "prod.size" now named
2722 * Class "div" now inherits from class "times" rather than "type".
2725 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2726 Linorder etc. have disappeared; operations defined in terms of
2727 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2729 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2731 * HOL-Word: New extensive library and type for generic, fixed size
2732 machine words, with arithemtic, bit-wise, shifting and rotating
2733 operations, reflection into int, nat, and bool lists, automation for
2734 linear arithmetic (by automatic reflection into nat or int), including
2735 lemmas on overflow and monotonicity. Instantiated to all appropriate
2736 arithmetic type classes, supporting automatic simplification of
2737 numerals on all operations.
2739 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2741 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2743 * Code generator library theories:
2744 - Code_Integer represents HOL integers by big integer literals in target
2746 - Code_Char represents HOL characters by character literals in target
2748 - Code_Char_chr like Code_Char, but also offers treatment of character
2749 codes; includes Code_Integer.
2750 - Executable_Set allows to generate code for finite sets using lists.
2751 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2753 - Executable_Real implements a subset of real numbers, namly those
2754 representable by rational numbers.
2755 - Efficient_Nat implements natural numbers by integers, which in general will
2756 result in higher efficency; pattern matching with 0/Suc is eliminated;
2757 includes Code_Integer.
2758 - Code_Index provides an additional datatype index which is mapped to
2759 target-language built-in integers.
2760 - Code_Message provides an additional datatype message_string which is isomorphic to
2761 strings; messages are mapped to target-language strings.
2763 * New package for inductive predicates
2765 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2768 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2769 for z_1 :: U_1 and ... and z_n :: U_m
2771 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2774 with full support for type-inference, rather than
2776 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2778 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2779 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2781 inductive "s z_1 ... z_m"
2783 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2786 For backward compatibility, there is a wrapper allowing inductive
2787 sets to be defined with the new package via
2790 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2791 for z_1 :: U_1 and ... and z_n :: U_m
2793 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2799 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2800 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2801 for z_1 :: U_1 and ... and z_n :: U_m
2803 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2804 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2807 if the additional syntax "p ..." is required.
2809 Numerous examples can be found in the subdirectories src/HOL/Auth,
2810 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2814 - Since declaration and definition of inductive sets or predicates
2815 is no longer separated, abbreviations involving the newly
2816 introduced sets or predicates must be specified together with the
2817 introduction rules after the 'where' keyword (see above), rather
2818 than before the actual inductive definition.
2820 - The variables in induction and elimination rules are now
2821 quantified in the order of their occurrence in the introduction
2822 rules, rather than in alphabetical order. Since this may break
2823 some proofs, these proofs either have to be repaired, e.g. by
2824 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2825 statements of the form
2827 case (rule_i a_i_1 ... a_i_{k_i})
2829 or the old order of quantification has to be restored by explicitly adding
2830 meta-level quantifiers in the introduction rules, i.e.
2832 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2834 - The format of the elimination rules is now
2836 p z_1 ... z_m x_1 ... x_n ==>
2837 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2842 (x_1, ..., x_n) : s z_1 ... z_m ==>
2843 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2846 for sets rather than
2848 x : s z_1 ... z_m ==>
2849 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2852 This may require terms in goals to be expanded to n-tuples
2853 (e.g. using case_tac or simplification with the split_paired_all
2854 rule) before the above elimination rule is applicable.
2856 - The elimination or case analysis rules for (mutually) inductive
2857 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2858 list of rules "p_1_..._p_k.elims" is no longer available.
2860 * New package "function"/"fun" for general recursive functions,
2861 supporting mutual and nested recursion, definitions in local contexts,
2862 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2863 for small examples, and the separate tutorial on the function
2864 package. The old recdef "package" is still available as before, but
2865 users are encouraged to use the new package.
2867 * Method "lexicographic_order" automatically synthesizes termination
2868 relations as lexicographic combinations of size measures.
2870 * Case-expressions allow arbitrary constructor-patterns (including
2871 "_") and take their order into account, like in functional
2872 programming. Internally, this is translated into nested
2873 case-expressions; missing cases are added and mapped to the predefined
2874 constant "undefined". In complicated cases printing may no longer show
2875 the original input but the internal form. Lambda-abstractions allow
2876 the same form of pattern matching: "% pat1 => e1 | ..." is an
2877 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2880 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2881 is an abbreviation for "of_nat :: nat => int". The simplification
2882 rules for "of_nat" have been changed to work like "int" did
2883 previously. Potential INCOMPATIBILITY:
2884 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2885 - of_nat_diff and of_nat_mult are no longer default simp rules
2887 * Method "algebra" solves polynomial equations over (semi)rings using
2888 Groebner bases. The (semi)ring structure is defined by locales and the
2889 tool setup depends on that generic context. Installing the method for
2890 a specific type involves instantiating the locale and possibly adding
2891 declarations for computation on the coefficients. The method is
2892 already instantiated for natural numbers and for the axiomatic class
2893 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2894 CALCULEMUS 2007 for the general principles underlying this
2895 architecture of context-aware proof-tools.
2897 * Method "ferrack" implements quantifier elimination over
2898 special-purpose dense linear orders using locales (analogous to
2899 "algebra"). The method is already installed for class
2900 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2903 * Former constant "List.op @" now named "List.append". Use ML
2904 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2905 circumvent possible incompatibilities when working on ML level.
2907 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2909 * New function listsum :: 'a list => 'a for arbitrary monoids.
2910 Special syntax: "SUM x <- xs. f x" (and latex variants)
2912 * New syntax for Haskell-like list comprehension (input only), eg.
2913 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2915 * The special syntax for function "filter" has changed from [x :
2916 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2917 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2919 * [a..b] is now defined for arbitrary linear orders. It used to be
2920 defined on nat only, as an abbreviation for [a..<Suc b]
2923 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2925 * New functions "sorted" and "sort" in src/HOL/List.thy.
2927 * New lemma collection field_simps (an extension of ring_simps) for
2928 manipulating (in)equations involving division. Multiplies with all
2929 denominators that can be proved to be non-zero (in equations) or
2930 positive/negative (in inequations).
2932 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2933 have been improved and renamed to ring_simps, group_simps and
2934 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2935 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2937 * Theory Library/Commutative_Ring: switched from recdef to function
2938 package; constants add, mul, pow now curried. Infix syntax for
2939 algebraic operations.
2941 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2944 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2947 * HOL/records: generalised field-update to take a function on the
2948 field rather than the new value: r(|A := x|) is translated to A_update
2949 (K x) r The K-combinator that is internally used is called K_record.
2950 INCOMPATIBILITY: Usage of the plain update functions has to be
2953 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2954 * x = 0, which are required for a semiring. Richer structures do not
2955 inherit from semiring_0 anymore, because this property is a theorem
2956 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2957 there is more to prove, but this is mostly trivial.
2959 * Class "recpower" is generalized to arbitrary monoids, not just
2960 commutative semirings. INCOMPATIBILITY: may need to incorporate
2961 commutativity or semiring properties additionally.
2963 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2964 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2965 better use 'abbreviation'.
2967 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2969 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2970 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2971 significant changes for setting up numeral syntax for types:
2972 - New constants Numeral.pred and Numeral.succ instead
2973 of former Numeral.bin_pred and Numeral.bin_succ.
2974 - Use integer operations instead of bin_add, bin_mult and so on.
2975 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
2976 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
2978 See src/HOL/Integ/IntArith.thy for an example setup.
2980 * Command 'normal_form' computes the normal form of a term that may
2981 contain free variables. For example ``normal_form "rev [a, b, c]"''
2982 produces ``[b, c, a]'' (without proof). This command is suitable for
2983 heavy-duty computations because the functions are compiled to ML
2984 first. Correspondingly, a method "normalization" is provided. See
2985 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
2987 * Alternative iff syntax "A <-> B" for equality on bool (with priority
2988 25 like -->); output depends on the "iff" print_mode, the default is
2989 "A = B" (with priority 50).
2991 * Relations less (<) and less_eq (<=) are also available on type bool.
2992 Modified syntax to disallow nesting without explicit parentheses,
2993 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
2996 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
2998 * Relation composition operator "op O" now has precedence 75 and binds
2999 stronger than union and intersection. INCOMPATIBILITY.
3001 * The old set interval syntax "{m..n(}" (and relatives) has been
3002 removed. Use "{m..<n}" (and relatives) instead.
3004 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3005 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3006 ``declare [[simproc del: neq]]''.
3008 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3011 * Theorem Cons_eq_map_conv no longer declared as "simp".
3013 * Theorem setsum_mult renamed to setsum_right_distrib.
3015 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3018 * Reimplemented methods "sat" and "satx", with several improvements:
3019 goals no longer need to be stated as "<prems> ==> False", equivalences
3020 (i.e. "=" on type bool) are handled, variable names of the form
3021 "lit_<n>" are no longer reserved, significant speedup.
3023 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3024 zChaff is still supported as well.
3026 * 'inductive' and 'datatype': provide projections of mutual rules,
3027 bundled as foo_bar.inducts;
3029 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3032 * Library: moved theory Accessible_Part to main HOL.
3034 * Library: added theory Coinductive_List of potentially infinite lists
3035 as greatest fixed-point.
3037 * Library: added theory AssocList which implements (finite) maps as
3040 * Method "evaluation" solves goals (i.e. a boolean expression)
3041 efficiently by compiling it to ML. The goal is "proved" (via an
3042 oracle) if it evaluates to True.
3044 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3045 also when invoked by the simplifier. This results in the Simplifier
3046 being more powerful on arithmetic goals. INCOMPATIBILITY.
3047 Configuration option fast_arith_split_limit=0 recovers the old
3050 * Support for hex (0x20) and binary (0b1001) numerals.
3052 * New method: reify eqs (t), where eqs are equations for an
3053 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3054 parameter, computes a term s::'b and a list xs::'a list and proves the
3055 theorem I xs s = t. This is also known as reification or quoting. The
3056 resulting theorem is applied to the subgoal to substitute t with I xs
3057 s. If t is omitted, the subgoal itself is reified.
3059 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3060 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3061 where f is supposed to be a computable function (in the sense of code
3062 generattion). The method uses reify to compute s and xs as above then
3063 applies corr_thm and uses normalization by evaluation to "prove" f s =
3064 r and finally gets the theorem t = r, which is again applied to the
3065 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3067 * Reflection: Automatic reification now handels binding, an example is
3068 available in src/HOL/ex/ReflectionEx.thy
3070 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3071 command 'statespace' that is similar to 'record', but introduces an
3072 abstract specification based on the locale infrastructure instead of
3073 HOL types. This leads to extra flexibility in composing state spaces,
3074 in particular multiple inheritance and renaming of components.
3079 * Hyperreal: Functions root and sqrt are now defined on negative real
3080 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3081 Nonnegativity side conditions have been removed from many lemmas, so
3082 that more subgoals may now be solved by simplification; potential
3085 * Real: new type classes formalize real normed vector spaces and
3086 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3087 and norm :: 'a => real.
3089 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3090 reals into other types. The overloaded constant Reals :: 'a set is now
3091 defined as range of_real; potential INCOMPATIBILITY.
3093 * Real: proper support for ML code generation, including 'quickcheck'.
3094 Reals are implemented as arbitrary precision rationals.
3096 * Hyperreal: Several constants that previously worked only for the
3097 reals have been generalized, so they now work over arbitrary vector
3098 spaces. Type annotations may need to be added in some cases; potential
3101 Infinitesimal :: ('a::real_normed_vector) star set
3102 HFinite :: ('a::real_normed_vector) star set
3103 HInfinite :: ('a::real_normed_vector) star set
3104 approx :: ('a::real_normed_vector) star => 'a star => bool
3105 monad :: ('a::real_normed_vector) star => 'a star set
3106 galaxy :: ('a::real_normed_vector) star => 'a star set
3107 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3108 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3109 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3110 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3111 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3112 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3113 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3114 sgn :: 'a::real_normed_vector => 'a
3115 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3117 * Complex: Some complex-specific constants are now abbreviations for
3118 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3119 hnorm. Other constants have been entirely removed in favor of the
3120 polymorphic versions (INCOMPATIBILITY):
3124 HInfinite <-- CInfinite
3125 Infinitesimal <-- CInfinitesimal
3128 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3129 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3130 (ns)deriv <-- (ns)cderiv
3135 * Formalisation of ideals and the quotient construction over rings.
3137 * Order and lattice theory no longer based on records.
3140 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3141 greatest_closed. INCOMPATIBILITY.
3143 * Method algebra is now set up via an attribute. For examples see
3144 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3145 of algebraic structures.
3147 * Renamed theory CRing to Ring.
3152 * Substantial, yet incomplete support for nominal datatypes (binding
3153 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3154 src/HOL/Nominal/Examples. Prospective users should consult
3155 http://isabelle.in.tum.de/nominal/
3160 * ML basics: just one true type int, which coincides with IntInf.int
3163 * ML within Isar: antiquotations allow to embed statically-checked
3164 formal entities in the source, referring to the context available at
3165 compile-time. For example:
3167 ML {* @{sort "{zero,one}"} *}
3168 ML {* @{typ "'a => 'b"} *}
3169 ML {* @{term "%x. x"} *}
3170 ML {* @{prop "x == y"} *}
3171 ML {* @{ctyp "'a => 'b"} *}
3172 ML {* @{cterm "%x. x"} *}
3173 ML {* @{cprop "x == y"} *}
3174 ML {* @{thm asm_rl} *}
3175 ML {* @{thms asm_rl} *}
3176 ML {* @{type_name c} *}
3177 ML {* @{type_syntax c} *}
3178 ML {* @{const_name c} *}
3179 ML {* @{const_syntax c} *}
3182 ML {* @{theory Pure} *}
3183 ML {* @{theory_ref} *}
3184 ML {* @{theory_ref Pure} *}
3187 ML {* @{clasimpset} *}
3189 The same works for sources being ``used'' within an Isar context.
3191 * ML in Isar: improved error reporting; extra verbosity with
3192 ML_Context.trace enabled.
3194 * Pure/General/table.ML: the join operations now works via exceptions
3195 DUP/SAME instead of type option. This is simpler in simple cases, and
3196 admits slightly more efficient complex applications.
3198 * Pure: 'advanced' translation functions (parse_translation etc.) now
3199 use Context.generic instead of just theory.
3201 * Pure: datatype Context.generic joins theory/Proof.context and
3202 provides some facilities for code that works in either kind of
3203 context, notably GenericDataFun for uniform theory and proof data.
3205 * Pure: simplified internal attribute type, which is now always
3206 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3207 local (Proof.context) attributes have been discontinued, while
3208 minimizing code duplication. Thm.rule_attribute and
3209 Thm.declaration_attribute build canonical attributes; see also structure
3210 Context for further operations on Context.generic, notably
3211 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3212 declarations and definitions.
3214 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3215 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3216 init only required for impure data. INCOMPATIBILITY: empty really need
3217 to be empty (no dependencies on theory content!)
3219 * Pure/kernel: consts certification ignores sort constraints given in
3220 signature declarations. (This information is not relevant to the
3221 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3222 potential INCOMPATIBILITY.
3224 * Pure: axiomatic type classes are now purely definitional, with
3225 explicit proofs of class axioms and super class relations performed
3226 internally. See Pure/axclass.ML for the main internal interfaces --
3227 notably AxClass.define_class supercedes AxClass.add_axclass, and
3228 AxClass.axiomatize_class/classrel/arity supersede
3229 Sign.add_classes/classrel/arities.
3231 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3232 global/local versions on theory vs. Proof.context have been
3233 discontinued; Attrib.syntax and Method.syntax have been adapted
3234 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3235 attributes, methods, etc.
3237 * Pure: several functions of signature "... -> theory -> theory * ..."
3238 have been reoriented to "... -> theory -> ... * theory" in order to
3239 allow natural usage in combination with the ||>, ||>>, |-> and
3240 fold_map combinators.
3242 * Pure: official theorem names (closed derivations) and additional
3243 comments (tags) are now strictly separate. Name hints -- which are
3244 maintained as tags -- may be attached any time without affecting the
3247 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3248 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3249 achieve the old behaviour.
3251 * Pure: the "Goal" constant is now called "prop", supporting a
3252 slightly more general idea of ``protecting'' meta-level rule
3255 * Pure: Logic.(un)varify only works in a global context, which is now
3256 enforced instead of silently assumed. INCOMPATIBILITY, may use
3257 Logic.legacy_(un)varify as temporary workaround.
3259 * Pure: structure Name provides scalable operations for generating
3260 internal variable names, notably Name.variants etc. This replaces
3261 some popular functions from term.ML:
3263 Term.variant -> Name.variant
3264 Term.variantlist -> Name.variant_list
3265 Term.invent_names -> Name.invent_list
3267 Note that low-level renaming rarely occurs in new code -- operations
3268 from structure Variable are used instead (see below).
3270 * Pure: structure Variable provides fundamental operations for proper
3271 treatment of fixed/schematic variables in a context. For example,
3272 Variable.import introduces fixes for schematics of given facts and
3273 Variable.export reverses the effect (up to renaming) -- this replaces
3274 various freeze_thaw operations.
3276 * Pure: structure Goal provides simple interfaces for
3277 init/conclude/finish and tactical prove operations (replacing former
3278 Tactic.prove). Goal.prove is the canonical way to prove results
3279 within a given context; Goal.prove_global is a degraded version for
3280 theory level goals, including a global Drule.standard. Note that
3281 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3282 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3283 in a locale context).
3285 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3286 and type checking (Syntax.check_term etc.), with common combinations
3287 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3288 which are considered legacy and await removal.
3290 * Pure/Syntax: generic interfaces for type unchecking
3291 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3292 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3293 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3294 available for convenience, but refer to the very same operations using
3295 a mere theory instead of a full context.
3297 * Isar: simplified treatment of user-level errors, using exception
3298 ERROR of string uniformly. Function error now merely raises ERROR,
3299 without any side effect on output channels. The Isar toplevel takes
3300 care of proper display of ERROR exceptions. ML code may use plain
3301 handle/can/try; cat_error may be used to concatenate errors like this:
3303 ... handle ERROR msg => cat_error msg "..."
3305 Toplevel ML code (run directly or through the Isar toplevel) may be
3306 embedded into the Isar toplevel with exception display/debug like
3309 Isar.toplevel (fn () => ...)
3311 INCOMPATIBILITY, removed special transform_error facilities, removed
3312 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3313 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3314 -- use plain ERROR instead.
3316 * Isar: theory setup now has type (theory -> theory), instead of a
3317 list. INCOMPATIBILITY, may use #> to compose setup functions.
3319 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3320 ProofContext.debug/verbose flags.
3322 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3323 theory before entering a proof state. Transactions now always see a
3324 quasi-functional intermediate checkpoint, both in interactive and
3327 * Isar: simplified interfaces for outer syntax. Renamed
3328 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3329 OuterSyntax.add_parsers -- this functionality is now included in
3330 OuterSyntax.command etc. INCOMPATIBILITY.
3332 * Simplifier: the simpset of a running simplification process now
3333 contains a proof context (cf. Simplifier.the_context), which is the
3334 very context that the initial simpset has been retrieved from (by
3335 simpset_of/local_simpset_of). Consequently, all plug-in components
3336 (solver, looper etc.) may depend on arbitrary proof data.
3338 * Simplifier.inherit_context inherits the proof context (plus the
3339 local bounds) of the current simplification process; any simproc
3340 etc. that calls the Simplifier recursively should do this! Removed
3341 former Simplifier.inherit_bounds, which is already included here --
3342 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3343 specify an explicit context using Simplifier.context/theory_context.
3345 * Simplifier/Classical Reasoner: more abstract interfaces
3346 change_simpset/claset for modifying the simpset/claset reference of a
3347 theory; raw versions simpset/claset_ref etc. have been discontinued --
3350 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3356 * settings: the default heap location within ISABELLE_HOME_USER now
3357 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3358 Isabelle installations.
3360 * isabelle-process: option -S (secure mode) disables some critical
3361 operations, notably runtime compilation and evaluation of ML source
3364 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3366 * Support for parallel execution, using native multicore support of
3367 Poly/ML 5.1. The theory loader exploits parallelism when processing
3368 independent theories, according to the given theory header
3369 specifications. The maximum number of worker threads is specified via
3370 usedir option -M or the "max-threads" setting in Proof General. A
3371 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3372 to 6 on a 8-core machine. User-code needs to observe certain
3373 guidelines for thread-safe programming, see appendix A in the Isar
3374 Implementation manual.
3378 New in Isabelle2005 (October 2005)
3379 ----------------------------------
3383 * Theory headers: the new header syntax for Isar theories is
3386 imports <theory1> ... <theoryN>
3387 uses <file1> ... <fileM>
3390 where the 'uses' part is optional. The previous syntax
3392 theory <name> = <theory1> + ... + <theoryN>:
3394 will disappear in the next release. Use isatool fixheaders to convert
3395 existing theory files. Note that there is no change in ancient
3396 non-Isar theories now, but these will disappear soon.
3398 * Theory loader: parent theories can now also be referred to via
3399 relative and absolute paths.
3401 * Command 'find_theorems' searches for a list of criteria instead of a
3402 list of constants. Known criteria are: intro, elim, dest, name:string,
3403 simp:term, and any term. Criteria can be preceded by '-' to select
3404 theorems that do not match. Intro, elim, dest select theorems that
3405 match the current goal, name:s selects theorems whose fully qualified
3406 name contain s, and simp:term selects all simplification rules whose
3407 lhs match term. Any other term is interpreted as pattern and selects
3408 all theorems matching the pattern. Available in ProofGeneral under
3409 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3411 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3413 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3414 matching the current goal as introduction rule and not having "HOL."
3415 in their name (i.e. not being defined in theory HOL).
3417 * Command 'thms_containing' has been discontinued in favour of
3418 'find_theorems'; INCOMPATIBILITY.
3420 * Communication with Proof General is now 8bit clean, which means that
3421 Unicode text in UTF-8 encoding may be used within theory texts (both
3422 formal and informal parts). Cf. option -U of the Isabelle Proof
3423 General interface. Here are some simple examples (cf. src/HOL/ex):
3425 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3426 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3428 * Improved efficiency of the Simplifier and, to a lesser degree, the
3429 Classical Reasoner. Typical big applications run around 2 times
3433 *** Document preparation ***
3435 * Commands 'display_drafts' and 'print_drafts' perform simple output
3436 of raw sources. Only those symbols that do not require additional
3437 LaTeX packages (depending on comments in isabellesym.sty) are
3438 displayed properly, everything else is left verbatim. isatool display
3439 and isatool print are used as front ends (these are subject to the
3440 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3442 * Command tags control specific markup of certain regions of text,
3443 notably folding and hiding. Predefined tags include "theory" (for
3444 theory begin and end), "proof" for proof commands, and "ML" for
3445 commands involving ML code; the additional tags "visible" and
3446 "invisible" are unused by default. Users may give explicit tag
3447 specifications in the text, e.g. ''by %invisible (auto)''. The
3448 interpretation of tags is determined by the LaTeX job during document
3449 preparation: see option -V of isatool usedir, or options -n and -t of
3450 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3453 Several document versions may be produced at the same time via isatool
3454 usedir (the generated index.html will link all of them). Typical
3455 specifications include ''-V document=theory,proof,ML'' to present
3456 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3457 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3458 these parts without any formal replacement text. The Isabelle site
3459 default settings produce ''document'' and ''outline'' versions as
3462 * Several new antiquotations:
3464 @{term_type term} prints a term with its type annotated;
3466 @{typeof term} prints the type of a term;
3468 @{const const} is the same as @{term const}, but checks that the
3469 argument is a known logical constant;
3471 @{term_style style term} and @{thm_style style thm} print a term or
3472 theorem applying a "style" to it
3476 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3477 definitions, equations, inequations etc., 'concl' printing only the
3478 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3479 to print the specified premise. TermStyle.add_style provides an ML
3480 interface for introducing further styles. See also the "LaTeX Sugar"
3481 document practical applications. The ML antiquotation prints
3482 type-checked ML expressions verbatim.
3484 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3485 and 'text' support optional locale specification '(in loc)', which
3486 specifies the default context for interpreting antiquotations. For
3487 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3489 * Option 'locale=NAME' of antiquotations specifies an alternative
3490 context interpreting the subsequent argument. For example: @{thm
3491 [locale=lattice] inf_assoc}.
3493 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3496 * Proper output of antiquotations for theory commands involving a
3497 proof context (such as 'locale' or 'theorem (in loc) ...').
3499 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3500 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3502 * isatool usedir: new option -C (default true) controls whether option
3503 -D should include a copy of the original document directory; -C false
3504 prevents unwanted effects such as copying of administrative CVS data.
3509 * Considerably improved version of 'constdefs' command. Now performs
3510 automatic type-inference of declared constants; additional support for
3511 local structure declarations (cf. locales and HOL records), see also
3512 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3513 sequential dependencies of definitions within a single 'constdefs'
3514 section; moreover, the declared name needs to be an identifier. If
3515 all fails, consider to fall back on 'consts' and 'defs' separately.
3517 * Improved indexed syntax and implicit structures. First of all,
3518 indexed syntax provides a notational device for subscripted
3519 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3520 expressions. Secondly, in a local context with structure
3521 declarations, number indexes \<^sub>n or the empty index (default
3522 number 1) refer to a certain fixed variable implicitly; option
3523 show_structs controls printing of implicit structures. Typical
3524 applications of these concepts involve record types and locales.
3526 * New command 'no_syntax' removes grammar declarations (and
3527 translations) resulting from the given syntax specification, which is
3528 interpreted in the same manner as for the 'syntax' command.
3530 * 'Advanced' translation functions (parse_translation etc.) may depend
3531 on the signature of the theory context being presently used for
3532 parsing/printing, see also isar-ref manual.
3534 * Improved 'oracle' command provides a type-safe interface to turn an
3535 ML expression of type theory -> T -> term into a primitive rule of
3536 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3537 is already included here); see also FOL/ex/IffExample.thy;
3540 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3541 before); "cI" is no longer bound, use "c.intro" instead.
3542 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3543 axclasses vs. locales.
3545 * Improved internal renaming of symbolic identifiers -- attach primes
3546 instead of base 26 numbers.
3548 * New flag show_question_marks controls printing of leading question
3549 marks in schematic variable names.
3551 * In schematic variable names, *any* symbol following \<^isub> or
3552 \<^isup> is now treated as part of the base name. For example, the
3553 following works without printing of awkward ".0" indexes:
3555 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3558 * Inner syntax includes (*(*nested*) comments*).
3560 * Pretty printer now supports unbreakable blocks, specified in mixfix
3561 annotations as "(00...)".
3563 * Clear separation of logical types and nonterminals, where the latter
3564 may only occur in 'syntax' specifications or type abbreviations.
3565 Before that distinction was only partially implemented via type class
3566 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3567 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3568 exotic syntax specifications may require further adaption
3569 (e.g. Cube/Cube.thy).
3571 * Removed obsolete type class "logic", use the top sort {} instead.
3572 Note that non-logical types should be declared as 'nonterminals'
3573 rather than 'types'. INCOMPATIBILITY for new object-logic
3576 * Attributes 'induct' and 'cases': type or set names may now be
3577 locally fixed variables as well.
3579 * Simplifier: can now control the depth to which conditional rewriting
3580 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3583 * Simplifier: simplification procedures may now take the current
3584 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3585 interface), which is very useful for calling the Simplifier
3586 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3587 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3588 low-level mk_simproc no longer applies Logic.varify internally, to
3589 allow for use in a context of fixed variables.
3591 * thin_tac now works even if the assumption being deleted contains !!
3592 or ==>. More generally, erule now works even if the major premise of
3593 the elimination rule contains !! or ==>.
3595 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3597 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3598 from Pure, which contains all common declarations already. Both
3599 theories are defined via plain Isabelle/Isar .thy files.
3600 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3601 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3602 use isatool fixcpure to adapt your theory and ML sources.
3604 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3605 selections of theorems in named facts via index ranges.
3607 * 'print_theorems': in theory mode, really print the difference
3608 wrt. the last state (works for interactive theory development only),
3609 in proof mode print all local facts (cf. 'print_facts');
3611 * 'hide': option '(open)' hides only base names.
3613 * More efficient treatment of intermediate checkpoints in interactive
3616 * Code generator is now invoked via code_module (incremental code
3617 generation) and code_library (modular code generation, ML structures
3618 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3619 must be quoted when used as identifiers.
3621 * New 'value' command for reading, evaluating and printing terms using
3622 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3623 quoted when used as identifier.
3628 * New commands for the interpretation of locale expressions in
3629 theories (1), locales (2) and proof contexts (3). These generate
3630 proof obligations from the expression specification. After the
3631 obligations have been discharged, theorems of the expression are added
3632 to the theory, target locale or proof context. The synopsis of the
3633 commands is a follows:
3635 (1) interpretation expr inst
3636 (2) interpretation target < expr
3637 (3) interpret expr inst
3639 Interpretation in theories and proof contexts require a parameter
3640 instantiation of terms from the current context. This is applied to
3641 specifications and theorems of the interpreted expression.
3642 Interpretation in locales only permits parameter renaming through the
3643 locale expression. Interpretation is smart in that interpretations
3644 that are active already do not occur in proof obligations, neither are
3645 instantiated theorems stored in duplicate. Use 'print_interps' to
3646 inspect active interpretations of a particular locale. For details,
3647 see the Isar Reference manual. Examples can be found in
3648 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3650 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3651 'interpret' instead.
3653 * New context element 'constrains' for adding type constraints to
3656 * Context expressions: renaming of parameters with syntax
3659 * Locale declaration: 'includes' disallowed.
3661 * Proper static binding of attribute syntax -- i.e. types / terms /
3662 facts mentioned as arguments are always those of the locale definition
3663 context, independently of the context of later invocations. Moreover,
3664 locale operations (renaming and type / term instantiation) are applied
3665 to attribute arguments as expected.
3667 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3668 actual attributes; rare situations may require Attrib.attribute to
3669 embed those attributes into Attrib.src that lack concrete syntax.
3670 Attribute implementations need to cooperate properly with the static
3671 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3672 Attrib.XXX_thm etc. already do the right thing without further
3673 intervention. Only unusual applications -- such as "where" or "of"
3674 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3675 on the context and the facts involved -- may have to assign parsed
3676 values to argument tokens explicitly.
3678 * Changed parameter management in theorem generation for long goal
3679 statements with 'includes'. INCOMPATIBILITY: produces a different
3680 theorem statement in rare situations.
3682 * Locale inspection command 'print_locale' omits notes elements. Use
3683 'print_locale!' to have them included in the output.
3688 * Provers/hypsubst.ML: improved version of the subst method, for
3689 single-step rewriting: it now works in bound variable contexts. New is
3690 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3691 rewrite a different subterm than the original subst method, which is
3692 still available as 'simplesubst'.
3694 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3697 * Provers/trancl.ML: new transitivity reasoner for transitive and
3698 reflexive-transitive closure of relations.
3700 * Provers/blast.ML: new reference depth_limit to make blast's depth
3701 limit (previously hard-coded with a value of 20) user-definable.
3703 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3704 is peformed already. Object-logics merely need to finish their
3705 initial simpset configuration as before. INCOMPATIBILITY.
3710 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3713 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3715 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3716 and x-symbol; use option '-m epsilon' to get it actually printed.
3717 Moreover, the mathematically important symbolic identifier \<epsilon>
3718 becomes available as variable, constant etc. INCOMPATIBILITY,
3720 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3721 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3722 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3723 support corresponding Isar calculations.
3725 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3728 * theory SetInterval: changed the syntax for open intervals:
3737 The old syntax is still supported but will disappear in the next
3738 release. For conversion use the following Emacs search and replace
3739 patterns (these are not perfect but work quite well):
3741 {)\([^\.]*\)\.\. -> {\1<\.\.}
3742 \.\.\([^(}]*\)(} -> \.\.<\1}
3744 * Theory Commutative_Ring (in Library): method comm_ring for proving
3745 equalities in commutative rings; method 'algebra' provides a generic
3748 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3749 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3750 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3753 Some new syntax forms are available:
3755 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3756 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3757 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3758 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3760 The latter form "\<Sum>x < k. e" used to be based on a separate
3761 function "Summation", which has been discontinued.
3763 * theory Finite_Set: in structured induction proofs, the insert case
3764 is now 'case (insert x F)' instead of the old counterintuitive 'case
3767 * The 'refute' command has been extended to support a much larger
3768 fragment of HOL, including axiomatic type classes, constdefs and
3769 typedefs, inductive datatypes and recursion.
3771 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3772 Requires zChaff with proof generation to be installed. See
3773 HOL/ex/SAT_Examples.thy for examples.
3775 * Datatype induction via method 'induct' now preserves the name of the
3776 induction variable. For example, when proving P(xs::'a list) by
3777 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3778 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3779 in unstructured proof scripts.
3781 * Reworked implementation of records. Improved scalability for
3782 records with many fields, avoiding performance problems for type
3783 inference. Records are no longer composed of nested field types, but
3784 of nested extension types. Therefore the record type only grows linear
3785 in the number of extensions and not in the number of fields. The
3786 top-level (users) view on records is preserved. Potential
3787 INCOMPATIBILITY only in strange cases, where the theory depends on the
3788 old record representation. The type generated for a record is called
3789 <record_name>_ext_type.
3791 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3792 proofs triggered by a record definition or a simproc (if
3793 quick_and_dirty is enabled). Definitions of large records can take
3796 New simproc record_upd_simproc for simplification of multiple record
3797 updates enabled by default. Moreover, trivial updates are also
3798 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3799 occasionally, since simplification is more powerful by default.
3801 * typedef: proper support for polymorphic sets, which contain extra
3802 type-variables in the term.
3804 * Simplifier: automatically reasons about transitivity chains
3805 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3806 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3807 old proofs break occasionally as simplification may now solve more
3808 goals than previously.
3810 * Simplifier: converts x <= y into x = y if assumption y <= x is
3811 present. Works for all partial orders (class "order"), in particular
3812 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3815 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3816 bound variable or a constant then the let is unfolded. Otherwise
3817 first a is simplified to b, and then f b is simplified to g. If
3818 possible we abstract b from g arriving at "let x = b in h x",
3819 otherwise we unfold the let and arrive at g. The simproc can be
3820 enabled/disabled by the reference use_let_simproc. Potential
3821 INCOMPATIBILITY since simplification is more powerful by default.
3823 * Classical reasoning: the meson method now accepts theorems as arguments.
3825 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3826 jobs to provide advice on the provability of subgoals.
3828 * Theory OrderedGroup and Ring_and_Field: various additions and
3829 improvements to faciliate calculations involving equalities and
3832 The following theorems have been eliminated or modified
3835 abs_eq now named abs_of_nonneg
3836 abs_of_ge_0 now named abs_of_nonneg
3837 abs_minus_eq now named abs_of_nonpos
3838 imp_abs_id now named abs_of_nonneg
3839 imp_abs_neg_id now named abs_of_nonpos
3840 mult_pos now named mult_pos_pos
3841 mult_pos_le now named mult_nonneg_nonneg
3842 mult_pos_neg_le now named mult_nonneg_nonpos
3843 mult_pos_neg2_le now named mult_nonneg_nonpos2
3844 mult_neg now named mult_neg_neg
3845 mult_neg_le now named mult_nonpos_nonpos
3847 * The following lemmas in Ring_and_Field have been added to the simplifier:
3850 not_square_less_zero
3852 The following lemmas have been deleted from Real/RealPow:
3862 * Theory Parity: added rules for simplifying exponents.
3866 The following theorems have been eliminated or modified
3869 list_all_Nil now named list_all.simps(1)
3870 list_all_Cons now named list_all.simps(2)
3871 list_all_conv now named list_all_iff
3872 set_mem_eq now named mem_iff
3874 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3875 asymptotic "big O" calculations. See the notes in BigO.thy.
3880 * Theory RealDef: better support for embedding natural numbers and
3881 integers in the reals.
3883 The following theorems have been eliminated or modified
3886 exp_ge_add_one_self now requires no hypotheses
3887 real_of_int_add reversed direction of equality (use [symmetric])
3888 real_of_int_minus reversed direction of equality (use [symmetric])
3889 real_of_int_diff reversed direction of equality (use [symmetric])
3890 real_of_int_mult reversed direction of equality (use [symmetric])
3892 * Theory RComplete: expanded support for floor and ceiling functions.
3894 * Theory Ln is new, with properties of the natural logarithm
3896 * Hyperreal: There is a new type constructor "star" for making
3897 nonstandard types. The old type names are now type synonyms:
3901 hcomplex = complex star
3903 * Hyperreal: Many groups of similarly-defined constants have been
3904 replaced by polymorphic versions (INCOMPATIBILITY):
3906 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3908 starset <-- starsetNat, starsetC
3909 *s* <-- *sNat*, *sc*
3910 starset_n <-- starsetNat_n, starsetC_n
3911 *sn* <-- *sNatn*, *scn*
3912 InternalSets <-- InternalNatSets, InternalCSets
3914 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3915 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3916 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3917 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3918 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3920 * Hyperreal: Many type-specific theorems have been removed in favor of
3921 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3923 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3924 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3925 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3926 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3927 right_minus <-- hypreal_add_minus
3928 left_minus <-- {hypreal,hcomplex}_add_minus_left
3929 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3930 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3931 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3932 mult_1_right <-- hcomplex_mult_one_right
3933 mult_zero_left <-- hcomplex_mult_zero_left
3934 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3935 right_distrib <-- hypnat_add_mult_distrib2
3936 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3937 right_inverse <-- hypreal_mult_inverse
3938 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3939 order_refl <-- {hypreal,hypnat}_le_refl
3940 order_trans <-- {hypreal,hypnat}_le_trans
3941 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3942 order_less_le <-- {hypreal,hypnat}_less_le
3943 linorder_linear <-- {hypreal,hypnat}_le_linear
3944 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3945 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3946 add_nonneg_nonneg <-- hypreal_le_add_order
3948 * Hyperreal: Separate theorems having to do with type-specific
3949 versions of constants have been merged into theorems that apply to the
3950 new polymorphic constants (INCOMPATIBILITY):
3952 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3953 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3954 STAR_Un <-- {STAR,NatStar,STARC}_Un
3955 STAR_Int <-- {STAR,NatStar,STARC}_Int
3956 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3957 STAR_subset <-- {STAR,NatStar,STARC}_subset
3958 STAR_mem <-- {STAR,NatStar,STARC}_mem
3959 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3960 STAR_diff <-- {STAR,STARC}_diff
3961 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3962 STARC_hcomplex_of_complex}_image_subset
3963 starset_n_Un <-- starset{Nat,C}_n_Un
3964 starset_n_Int <-- starset{Nat,C}_n_Int
3965 starset_n_Compl <-- starset{Nat,C}_n_Compl
3966 starset_n_diff <-- starset{Nat,C}_n_diff
3967 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3968 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3969 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3970 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3971 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
3972 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
3973 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
3974 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
3975 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
3976 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3977 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
3978 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
3979 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
3980 starfun_diff <-- starfun{C,RC,CR}_diff
3981 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
3982 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
3983 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
3984 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
3985 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
3986 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
3987 starfun_Id <-- starfunC_Id
3988 starfun_approx <-- starfun{Nat,CR}_approx
3989 starfun_capprox <-- starfun{C,RC}_capprox
3990 starfun_abs <-- starfunNat_rabs
3991 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
3992 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
3993 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
3994 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
3995 starfun_add_capprox <-- starfun{C,RC}_add_capprox
3996 starfun_add_approx <-- starfunCR_add_approx
3997 starfun_inverse_inverse <-- starfunC_inverse_inverse
3998 starfun_divide <-- starfun{C,CR,RC}_divide
3999 starfun_n <-- starfun{Nat,C}_n
4000 starfun_n_mult <-- starfun{Nat,C}_n_mult
4001 starfun_n_add <-- starfun{Nat,C}_n_add
4002 starfun_n_add_minus <-- starfunNat_n_add_minus
4003 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4004 starfun_n_minus <-- starfun{Nat,C}_n_minus
4005 starfun_n_eq <-- starfun{Nat,C}_n_eq
4007 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4008 star_n_minus <-- {hypreal,hcomplex}_minus
4009 star_n_diff <-- {hypreal,hcomplex}_diff
4010 star_n_mult <-- {hypreal,hcomplex}_mult
4011 star_n_inverse <-- {hypreal,hcomplex}_inverse
4012 star_n_le <-- {hypreal,hypnat}_le
4013 star_n_less <-- {hypreal,hypnat}_less
4014 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4015 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4016 star_n_abs <-- hypreal_hrabs
4017 star_n_divide <-- hcomplex_divide
4019 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4020 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4021 star_of_diff <-- hypreal_of_real_diff
4022 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4023 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4024 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4025 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4026 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4027 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4028 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4029 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4030 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4031 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4032 star_of_number_of <-- {hypreal,hcomplex}_number_of
4033 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4034 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4035 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4036 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4037 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4038 star_of_power <-- hypreal_of_real_power
4039 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4041 * Hyperreal: new method "transfer" that implements the transfer
4042 principle of nonstandard analysis. With a subgoal that mentions
4043 nonstandard types like "'a star", the command "apply transfer"
4044 replaces it with an equivalent one that mentions only standard types.
4045 To be successful, all free variables must have standard types; non-
4046 standard variables must have explicit universal quantifiers.
4048 * Hyperreal: A theory of Taylor series.
4053 * Discontinued special version of 'constdefs' (which used to support
4054 continuous functions) in favor of the general Pure one with full
4057 * New simplification procedure for solving continuity conditions; it
4058 is much faster on terms with many nested lambda abstractions (cubic
4059 instead of exponential time).
4061 * New syntax for domain package: selector names are now optional.
4062 Parentheses should be omitted unless argument is lazy, for example:
4064 domain 'a stream = cons "'a" (lazy "'a stream")
4066 * New command 'fixrec' for defining recursive functions with pattern
4067 matching; defining multiple functions with mutual recursion is also
4068 supported. Patterns may include the constants cpair, spair, up, sinl,
4069 sinr, or any data constructor defined by the domain package. The given
4070 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4071 syntax and examples.
4073 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4074 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4075 but the proof obligation additionally includes an admissibility
4076 requirement. The packages generate instances of class cpo or pcpo,
4077 with continuity and strictness theorems for Rep and Abs.
4079 * HOLCF: Many theorems have been renamed according to a more standard naming
4080 scheme (INCOMPATIBILITY):
4082 foo_inject: "foo$x = foo$y ==> x = y"
4083 foo_eq: "(foo$x = foo$y) = (x = y)"
4084 foo_less: "(foo$x << foo$y) = (x << y)"
4085 foo_strict: "foo$UU = UU"
4086 foo_defined: "... ==> foo$x ~= UU"
4087 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4092 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4093 including the First Isomorphism Theorem (on quotienting by the kernel
4096 * ZF/Simplifier: install second copy of type solver that actually
4097 makes use of TC rules declared to Isar proof contexts (or locales);
4098 the old version is still required for ML proof scripts.
4103 * Converted to Isar theory format; use locales instead of axiomatic
4109 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4112 * Pure/library.ML no longer defines its own option datatype, but uses
4113 that of the SML basis, which has constructors NONE and SOME instead of
4114 None and Some, as well as exception Option.Option instead of OPTION.
4115 The functions the, if_none, is_some, is_none have been adapted
4116 accordingly, while Option.map replaces apsome.
4118 * Pure/library.ML: the exception LIST has been given up in favour of
4119 the standard exceptions Empty and Subscript, as well as
4120 Library.UnequalLengths. Function like Library.hd and Library.tl are
4121 superceded by the standard hd and tl functions etc.
4123 A number of basic list functions are no longer exported to the ML
4124 toplevel, as they are variants of predefined functions. The following
4125 suggests how one can translate existing code:
4127 rev_append xs ys = List.revAppend (xs, ys)
4128 nth_elem (i, xs) = List.nth (xs, i)
4129 last_elem xs = List.last xs
4130 flat xss = List.concat xss
4131 seq fs = List.app fs
4132 partition P xs = List.partition P xs
4133 mapfilter f xs = List.mapPartial f xs
4135 * Pure/library.ML: several combinators for linear functional
4136 transformations, notably reverse application and composition:
4139 (x, y) |-> f f #-> g
4141 * Pure/library.ML: introduced/changed precedence of infix operators:
4143 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4145 infix 3 o oo ooo oooo;
4146 infix 4 ~~ upto downto;
4148 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4151 * Pure/library.ML: natural list combinators fold, fold_rev, and
4152 fold_map support linear functional transformations and nesting. For
4155 fold f [x1, ..., xN] y =
4156 y |> f x1 |> ... |> f xN
4158 (fold o fold) f [xs1, ..., xsN] y =
4159 y |> fold f xs1 |> ... |> fold f xsN
4161 fold f [x1, ..., xN] =
4164 (fold o fold) f [xs1, ..., xsN] =
4165 fold f xs1 #> ... #> fold f xsN
4167 * Pure/library.ML: the following selectors on type 'a option are
4170 the: 'a option -> 'a (*partial*)
4171 these: 'a option -> 'a where 'a = 'b list
4172 the_default: 'a -> 'a option -> 'a
4173 the_list: 'a option -> 'a list
4175 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4176 basic operations for association lists, following natural argument
4177 order; moreover the explicit equality predicate passed here avoids
4178 potentially expensive polymorphic runtime equality checks.
4179 The old functions may be expressed as follows:
4181 assoc = uncurry (AList.lookup (op =))
4182 assocs = these oo AList.lookup (op =)
4183 overwrite = uncurry (AList.update (op =)) o swap
4185 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4187 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4188 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4190 replacing make_keylist and keyfilter (occassionally used)
4193 make_keylist = AList.make
4194 keyfilter = AList.find (op =)
4196 * eq_fst and eq_snd now take explicit equality parameter, thus
4197 avoiding eqtypes. Naive rewrites:
4199 eq_fst = eq_fst (op =)
4200 eq_snd = eq_snd (op =)
4202 * Removed deprecated apl and apr (rarely used).
4205 apl (n, op) =>>= curry op n
4206 apr (op, m) =>>= fn n => op (n, m)
4208 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4209 provides a reasonably efficient light-weight implementation of sets as
4212 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4213 few new operations; existing lookup and update are now curried to
4214 follow natural argument order (for use with fold etc.);
4215 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4217 * Pure/General: output via the Isabelle channels of
4218 writeln/warning/error etc. is now passed through Output.output, with a
4219 hook for arbitrary transformations depending on the print_mode
4220 (cf. Output.add_mode -- the first active mode that provides a output
4221 function wins). Already formatted output may be embedded into further
4222 text via Output.raw; the result of Pretty.string_of/str_of and derived
4223 functions (string_of_term/cterm/thm etc.) is already marked raw to
4224 accommodate easy composition of diagnostic messages etc. Programmers
4225 rarely need to care about Output.output or Output.raw at all, with
4226 some notable exceptions: Output.output is required when bypassing the
4227 standard channels (writeln etc.), or in token translations to produce
4228 properly formatted results; Output.raw is required when capturing
4229 already output material that will eventually be presented to the user
4230 a second time. For the default print mode, both Output.output and
4231 Output.raw have no effect.
4233 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4234 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4235 cumulative results are displayed at the end of a batch session.
4237 * Pure/General: File.sysify_path and File.quote_sysify path have been
4238 replaced by File.platform_path and File.shell_path (with appropriate
4239 hooks). This provides a clean interface for unusual systems where the
4240 internal and external process view of file names are different.
4242 * Pure: more efficient orders for basic syntactic entities: added
4243 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4244 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4245 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4246 orders now -- potential INCOMPATIBILITY for code that depends on a
4247 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4248 Library.sort_strings on result).
4250 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4251 fold_types traverse types/terms from left to right, observing natural
4252 argument order. Supercedes previous foldl_XXX versions, add_frees,
4253 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4255 * Pure: name spaces have been refined, with significant changes of the
4256 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4257 to extern(_table). The plain name entry path is superceded by a
4258 general 'naming' context, which also includes the 'policy' to produce
4259 a fully qualified name and external accesses of a fully qualified
4260 name; NameSpace.extend is superceded by context dependent
4261 Sign.declare_name. Several theory and proof context operations modify
4262 the naming context. Especially note Theory.restore_naming and
4263 ProofContext.restore_naming to get back to a sane state; note that
4264 Theory.add_path is no longer sufficient to recover from
4265 Theory.absolute_path in particular.
4267 * Pure: new flags short_names (default false) and unique_names
4268 (default true) for controlling output of qualified names. If
4269 short_names is set, names are printed unqualified. If unique_names is
4270 reset, the name prefix is reduced to the minimum required to achieve
4271 the original result when interning again, even if there is an overlap
4272 with earlier declarations.
4274 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4275 now 'extend', and 'merge' gets an additional Pretty.pp argument
4276 (useful for printing error messages). INCOMPATIBILITY.
4278 * Pure: major reorganization of the theory context. Type Sign.sg and
4279 Theory.theory are now identified, referring to the universal
4280 Context.theory (see Pure/context.ML). Actual signature and theory
4281 content is managed as theory data. The old code and interfaces were
4282 spread over many files and structures; the new arrangement introduces
4283 considerable INCOMPATIBILITY to gain more clarity:
4285 Context -- theory management operations (name, identity, inclusion,
4286 parents, ancestors, merge, etc.), plus generic theory data;
4288 Sign -- logical signature and syntax operations (declaring consts,
4289 types, etc.), plus certify/read for common entities;
4291 Theory -- logical theory operations (stating axioms, definitions,
4292 oracles), plus a copy of logical signature operations (consts,
4293 types, etc.); also a few basic management operations (Theory.copy,
4296 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4297 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4298 for convenience -- they merely return the theory.
4300 * Pure: type Type.tsig is superceded by theory in most interfaces.
4302 * Pure: the Isar proof context type is already defined early in Pure
4303 as Context.proof (note that ProofContext.context and Proof.context are
4304 aliases, where the latter is the preferred name). This enables other
4305 Isabelle components to refer to that type even before Isar is present.
4307 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4308 typeK, constK, axiomK, oracleK), but provide explicit operations for
4309 any of these kinds. For example, Sign.intern typeK is now
4310 Sign.intern_type, Theory.hide_space Sign.typeK is now
4311 Theory.hide_types. Also note that former
4312 Theory.hide_classes/types/consts are now
4313 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4314 internalize their arguments! INCOMPATIBILITY.
4316 * Pure: get_thm interface (of PureThy and ProofContext) expects
4317 datatype thmref (with constructors Name and NameSelection) instead of
4318 plain string -- INCOMPATIBILITY;
4320 * Pure: cases produced by proof methods specify options, where NONE
4321 means to remove case bindings -- INCOMPATIBILITY in
4324 * Pure: the following operations retrieve axioms or theorems from a
4325 theory node or theory hierarchy, respectively:
4327 Theory.axioms_of: theory -> (string * term) list
4328 Theory.all_axioms_of: theory -> (string * term) list
4329 PureThy.thms_of: theory -> (string * thm) list
4330 PureThy.all_thms_of: theory -> (string * thm) list
4332 * Pure: print_tac now outputs the goal through the trace channel.
4334 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4335 Reference Toplevel.debug (default false) controls detailed printing
4336 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4337 controls execution profiling -- set to 1 for time and 2 for space
4338 (both increase the runtime).
4340 * Isar session: The initial use of ROOT.ML is now always timed,
4341 i.e. the log will show the actual process times, in contrast to the
4342 elapsed wall-clock time that the outer shell wrapper produces.
4344 * Simplifier: improved handling of bound variables (nameless
4345 representation, avoid allocating new strings). Simprocs that invoke
4346 the Simplifier recursively should use Simplifier.inherit_bounds to
4347 avoid local name clashes. Failure to do so produces warnings
4348 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4349 for further details.
4351 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4352 bindings for all theorems stored within a given theory; this may help
4353 in porting non-Isar theories to Isar ones, while keeping ML proof
4354 scripts for the time being.
4356 * ML operator HTML.with_charset specifies the charset begin used for
4357 generated HTML files. For example:
4359 HTML.with_charset "utf-8" use_thy "Hebrew";
4360 HTML.with_charset "utf-8" use_thy "Chinese";
4365 * Allow symlinks to all proper Isabelle executables (Isabelle,
4366 isabelle, isatool etc.).
4368 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4369 isatool doc, isatool mkdir, display_drafts etc.).
4371 * isatool usedir: option -f allows specification of the ML file to be
4372 used by Isabelle; default is ROOT.ML.
4374 * New isatool version outputs the version identifier of the Isabelle
4375 distribution being used.
4377 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4378 (containing Boolean satisfiability problems) into Isabelle/HOL
4383 New in Isabelle2004 (April 2004)
4384 --------------------------------
4388 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4389 Replaces linorder.ML.
4391 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4392 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4393 (\<a>...\<z>), are now considered normal letters, and can therefore
4394 be used anywhere where an ASCII letter (a...zA...Z) has until
4395 now. COMPATIBILITY: This obviously changes the parsing of some
4396 terms, especially where a symbol has been used as a binder, say
4397 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4398 as an identifier. Fix it by inserting a space around former
4399 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4400 existing theory and ML files.
4402 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4404 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4405 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4406 a normal (but invisible) letter. For multiple letter subscripts repeat
4407 \<^isub> like this: x\<^isub>1\<^isub>2.
4409 * Pure: There are now sub-/superscripts that can span more than one
4410 character. Text between \<^bsub> and \<^esub> is set in subscript in
4411 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4412 superscript. The new control characters are not identifier parts.
4414 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4415 content of "..." to the latex file instead of \isacntrl... . The "..."
4416 may consist of any printable characters excluding the end bracket >.
4418 * Pure: Using new Isar command "finalconsts" (or the ML functions
4419 Theory.add_finals or Theory.add_finals_i) it is now possible to
4420 declare constants "final", which prevents their being given a definition
4421 later. It is useful for constants whose behaviour is fixed axiomatically
4422 rather than definitionally, such as the meta-logic connectives.
4424 * Pure: 'instance' now handles general arities with general sorts
4425 (i.e. intersections of classes),
4427 * Presentation: generated HTML now uses a CSS style sheet to make layout
4428 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4429 It can be changed to alter the colors/layout of generated pages.
4434 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4435 cut_tac, subgoal_tac and thin_tac:
4436 - Now understand static (Isar) contexts. As a consequence, users of Isar
4437 locales are no longer forced to write Isar proof scripts.
4438 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4440 - INCOMPATIBILITY: names of variables to be instantiated may no
4441 longer be enclosed in quotes. Instead, precede variable name with `?'.
4442 This is consistent with the instantiation attribute "where".
4444 * Attributes "where" and "of":
4445 - Now take type variables of instantiated theorem into account when reading
4446 the instantiation string. This fixes a bug that caused instantiated
4447 theorems to have too special types in some circumstances.
4448 - "where" permits explicit instantiations of type variables.
4450 * Calculation commands "moreover" and "also" no longer interfere with
4451 current facts ("this"), admitting arbitrary combinations with "then"
4455 - Goal statements involving the context element "includes" no longer
4456 generate theorems with internal delta predicates (those ending on
4457 "_axioms") in the premise.
4458 Resolve particular premise with <locale>.intro to obtain old form.
4459 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4460 specification and "includes" elements in goal statement.
4461 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4462 [intro?] and [elim?] (respectively) by default.
4463 - Experimental command for instantiation of locales in proof contexts:
4464 instantiate <label>[<attrs>]: <loc>
4465 Instantiates locale <loc> and adds all its theorems to the current context
4466 taking into account their attributes. Label and attrs are optional
4467 modifiers, like in theorem declarations. If present, names of
4468 instantiated theorems are qualified with <label>, and the attributes
4469 <attrs> are applied after any attributes these theorems might have already.
4470 If the locale has assumptions, a chained fact of the form
4471 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4472 are derived. The command does not support old-style locales declared
4473 with "locale (open)".
4474 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4476 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4482 * Proof import: new image HOL4 contains the imported library from
4483 the HOL4 system with about 2500 theorems. It is imported by
4484 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4485 can be used like any other Isabelle image. See
4486 HOL/Import/HOL/README for more information.
4489 - Much improved handling of linear and partial orders.
4490 Reasoners for linear and partial orders are set up for type classes
4491 "linorder" and "order" respectively, and are added to the default simpset
4492 as solvers. This means that the simplifier can build transitivity chains
4493 to solve goals from the assumptions.
4494 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4495 of blast or auto after simplification become unnecessary because the goal
4496 is solved by simplification already.
4498 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4499 all proved in axiomatic type classes for semirings, rings and fields.
4502 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4503 now formalized using the Ring_and_Field theory mentioned above.
4504 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4505 than before, because now they are set up once in a generic manner.
4506 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4507 Look for the general versions in Ring_and_Field (and Power if they concern
4510 * Type "rat" of the rational numbers is now available in HOL-Complex.
4513 - Record types are now by default printed with their type abbreviation
4514 instead of the list of all field types. This can be configured via
4515 the reference "print_record_type_abbr".
4516 - Simproc "record_upd_simproc" for simplification of multiple updates added
4517 (not enabled by default).
4518 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4519 EX x. x = sel r to True (not enabled by default).
4520 - Tactic "record_split_simp_tac" to split and simplify records added.
4522 * 'specification' command added, allowing for definition by
4523 specification. There is also an 'ax_specification' command that
4524 introduces the new constants axiomatically.
4526 * arith(_tac) is now able to generate counterexamples for reals as well.
4528 * HOL-Algebra: new locale "ring" for non-commutative rings.
4530 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4531 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4533 * HOL-Matrix: a first theory for matrices in HOL with an application of
4534 matrix theory to linear programming.
4536 * Unions and Intersections:
4537 The latex output syntax of UN and INT has been changed
4538 from "\Union x \in A. B" to "\Union_{x \in A} B"
4539 i.e. the index formulae has become a subscript.
4540 Similarly for "\Union x. B", and for \Inter instead of \Union.
4542 * Unions and Intersections over Intervals:
4543 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4544 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4545 like in normal math, and corresponding versions for < and for intersection.
4547 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4548 lexicographic dictonary ordering has been added as "lexord".
4550 * ML: the legacy theory structures Int and List have been removed. They had
4551 conflicted with ML Basis Library structures having the same names.
4553 * 'refute' command added to search for (finite) countermodels. Only works
4554 for a fragment of HOL. The installation of an external SAT solver is
4555 highly recommended. See "HOL/Refute.thy" for details.
4557 * 'quickcheck' command: Allows to find counterexamples by evaluating
4558 formulae under an assignment of free variables to random values.
4559 In contrast to 'refute', it can deal with inductive datatypes,
4560 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4566 * Streams now come with concatenation and are part of the HOLCF image
4570 New in Isabelle2003 (May 2003)
4571 ------------------------------
4575 * Provers/simplifier:
4577 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4578 Assumptions are now subject to complete mutual simplification,
4579 not just from left to right. The simplifier now preserves
4580 the order of assumptions.
4582 Potential INCOMPATIBILITY:
4584 -- simp sometimes diverges where the old version did
4585 not, e.g. invoking simp on the goal
4587 [| P (f x); y = x; f x = f y |] ==> Q
4589 now gives rise to the infinite reduction sequence
4591 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4593 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4596 -- Tactics combining classical reasoner and simplification (such as auto)
4597 are also affected by this change, because many of them rely on
4598 simp. They may sometimes diverge as well or yield a different numbers
4599 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4600 in case of problems. Sometimes subsequent calls to the classical
4601 reasoner will fail because a preceeding call to the simplifier too
4602 eagerly simplified the goal, e.g. deleted redundant premises.
4604 - The simplifier trace now shows the names of the applied rewrite rules
4606 - You can limit the number of recursive invocations of the simplifier
4607 during conditional rewriting (where the simplifie tries to solve the
4608 conditions before applying the rewrite rule):
4609 ML "simp_depth_limit := n"
4610 where n is an integer. Thus you can force termination where previously
4611 the simplifier would diverge.
4613 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4615 - No longer aborts on failed congruence proof. Instead, the
4616 congruence is ignored.
4618 * Pure: New generic framework for extracting programs from constructive
4619 proofs. See HOL/Extraction.thy for an example instantiation, as well
4620 as HOL/Extraction for some case studies.
4622 * Pure: The main goal of the proof state is no longer shown by default, only
4623 the subgoals. This behaviour is controlled by a new flag.
4624 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4625 (ML: Proof.show_main_goal).
4627 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4628 rules whose conclusion matches subgoal 1:
4629 PG menu: Isabelle/Isar -> Show me -> matching rules
4630 The rules are ordered by how closely they match the subgoal.
4631 In particular, rules that solve a subgoal outright are displayed first
4632 (or rather last, the way they are printed).
4633 (ML: ProofGeneral.print_intros())
4635 * Pure: New flag trace_unify_fail causes unification to print
4636 diagnostic information (PG: in trace buffer) when it fails. This is
4637 useful for figuring out why single step proofs like rule, erule or
4640 * Pure: Locale specifications now produce predicate definitions
4641 according to the body of text (covering assumptions modulo local
4642 definitions); predicate "loc_axioms" covers newly introduced text,
4643 while "loc" is cumulative wrt. all included locale expressions; the
4644 latter view is presented only on export into the global theory
4645 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4646 on the old view without predicates;
4648 * Pure: predefined locales "var" and "struct" are useful for sharing
4649 parameters (as in CASL, for example); just specify something like
4650 ``var x + var y + struct M'' as import;
4652 * Pure: improved thms_containing: proper indexing of facts instead of
4653 raw theorems; check validity of results wrt. current name space;
4654 include local facts of proof configuration (also covers active
4655 locales), cover fixed variables in index; may use "_" in term
4656 specification; an optional limit for the number of printed facts may
4657 be given (the default is 40);
4659 * Pure: disallow duplicate fact bindings within new-style theory files
4662 * Provers: improved induct method: assumptions introduced by case
4663 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4664 the goal statement); "foo" still refers to all facts collectively;
4666 * Provers: the function blast.overloaded has been removed: all constants
4667 are regarded as potentially overloaded, which improves robustness in exchange
4668 for slight decrease in efficiency;
4670 * Provers/linorder: New generic prover for transitivity reasoning over
4671 linear orders. Note: this prover is not efficient!
4673 * Isar: preview of problems to finish 'show' now produce an error
4674 rather than just a warning (in interactive mode);
4681 - Produces a counter example if it cannot prove a goal.
4682 Note that the counter example may be spurious if the goal is not a formula
4683 of quantifier-free linear arithmetic.
4684 In ProofGeneral the counter example appears in the trace buffer.
4686 - Knows about div k and mod k where k is a numeral of type nat or int.
4688 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4689 linear arithmetic fails. This takes account of quantifiers and divisibility.
4690 Presburger arithmetic can also be called explicitly via presburger(_tac).
4692 * simp's arithmetic capabilities have been enhanced a bit: it now
4693 takes ~= in premises into account (by performing a case split);
4695 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4696 are distributed over a sum of terms;
4698 * New tactic "trans_tac" and method "trans" instantiate
4699 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4702 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4703 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4705 * 'typedef' command has new option "open" to suppress the set
4708 * functions Min and Max on finite sets have been introduced (theory
4711 * attribute [symmetric] now works for relations as well; it turns
4712 (x,y) : R^-1 into (y,x) : R, and vice versa;
4714 * induct over a !!-quantified statement (say !!x1..xn):
4715 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4717 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4718 %x. None. Warning: empty_def now refers to the previously hidden definition
4721 * Algebra: formalization of classical algebra. Intended as base for
4722 any algebraic development in Isabelle. Currently covers group theory
4723 (up to Sylow's theorem) and ring theory (Universal Property of
4724 Univariate Polynomials). Contributions welcome;
4726 * GroupTheory: deleted, since its material has been moved to Algebra;
4728 * Complex: new directory of the complex numbers with numeric constants,
4729 nonstandard complex numbers, and some complex analysis, standard and
4730 nonstandard (Jacques Fleuriot);
4732 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4734 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4737 * Real/HahnBanach: updated and adapted to locales;
4739 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4742 * UNITY: added the Meier-Sanders theory of progress sets;
4744 * MicroJava: bytecode verifier and lightweight bytecode verifier
4745 as abstract algorithms, instantiated to the JVM;
4747 * Bali: Java source language formalization. Type system, operational
4748 semantics, axiomatic semantics. Supported language features:
4749 classes, interfaces, objects,virtual methods, static methods,
4750 static/instance fields, arrays, access modifiers, definite
4751 assignment, exceptions.
4756 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4759 * Main ZF: virtually all theories converted to new-style format;
4764 * Pure: Tactic.prove provides sane interface for internal proofs;
4765 omits the infamous "standard" operation, so this is more appropriate
4766 than prove_goalw_cterm in many situations (e.g. in simprocs);
4768 * Pure: improved error reporting of simprocs;
4770 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4774 *** Document preparation ***
4776 * uses \par instead of \\ for line breaks in theory text. This may
4777 shift some page breaks in large documents. To get the old behaviour
4778 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4780 * minimized dependencies of isabelle.sty and isabellesym.sty on
4783 * \<euro> now needs package babel/greek instead of marvosym (which
4786 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4791 New in Isabelle2002 (March 2002)
4792 --------------------------------
4794 *** Document preparation ***
4796 * greatly simplified document preparation setup, including more
4797 graceful interpretation of isatool usedir -i/-d/-D options, and more
4798 instructive isatool mkdir; users should basically be able to get
4799 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4800 users may run a separate document processing stage manually like this:
4801 "isatool usedir -D output HOL Test && isatool document Test/output";
4803 * theory dependency graph may now be incorporated into documents;
4804 isatool usedir -g true will produce session_graph.eps/.pdf for use
4805 with \includegraphics of LaTeX;
4807 * proper spacing of consecutive markup elements, especially text
4808 blocks after section headings;
4810 * support bold style (for single symbols only), input syntax is like
4811 this: "\<^bold>\<alpha>" or "\<^bold>A";
4813 * \<bullet> is now output as bold \cdot by default, which looks much
4814 better in printed text;
4816 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4817 note that these symbols are currently unavailable in Proof General /
4818 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4820 * isatool latex no longer depends on changed TEXINPUTS, instead
4821 isatool document copies the Isabelle style files to the target
4827 * Pure/Provers: improved proof by cases and induction;
4828 - 'case' command admits impromptu naming of parameters (such as
4830 - 'induct' method divinates rule instantiation from the inductive
4831 claim; no longer requires excessive ?P bindings for proper
4832 instantiation of cases;
4833 - 'induct' method properly enumerates all possibilities of set/type
4834 rules; as a consequence facts may be also passed through *type*
4835 rules without further ado;
4836 - 'induct' method now derives symbolic cases from the *rulified*
4837 rule (before it used to rulify cases stemming from the internal
4838 atomized version); this means that the context of a non-atomic
4839 statement becomes is included in the hypothesis, avoiding the
4840 slightly cumbersome show "PROP ?case" form;
4841 - 'induct' may now use elim-style induction rules without chaining
4842 facts, using ``missing'' premises from the goal state; this allows
4843 rules stemming from inductive sets to be applied in unstructured
4844 scripts, while still benefitting from proper handling of non-atomic
4845 statements; NB: major inductive premises need to be put first, all
4846 the rest of the goal is passed through the induction;
4847 - 'induct' proper support for mutual induction involving non-atomic
4848 rule statements (uses the new concept of simultaneous goals, see
4850 - append all possible rule selections, but only use the first
4851 success (no backtracking);
4852 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4853 - undeclared rule case names default to numbers 1, 2, 3, ...;
4854 - added 'print_induct_rules' (covered by help item in recent Proof
4856 - moved induct/cases attributes to Pure, methods to Provers;
4857 - generic method setup instantiated for FOL and HOL;
4859 * Pure: support multiple simultaneous goal statements, for example
4860 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4861 meta-level mechanism, this acts as if several individual goals had
4862 been stated separately; in particular common proof methods need to be
4863 repeated in order to cover all claims; note that a single elimination
4864 step is *not* sufficient to establish the two conjunctions, so this
4867 assume "A & B" then have A and B .. (*".." fails*)
4869 better use "obtain" in situations as above; alternative refer to
4870 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4872 * Pure: proper integration with ``locales''; unlike the original
4873 version by Florian Kammller, Isar locales package high-level proof
4874 contexts rather than raw logical ones (e.g. we admit to include
4875 attributes everywhere); operations on locales include merge and
4876 rename; support for implicit arguments (``structures''); simultaneous
4877 type-inference over imports and text; see also HOL/ex/Locales.thy for
4880 * Pure: the following commands have been ``localized'', supporting a
4881 target locale specification "(in name)": 'lemma', 'theorem',
4882 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4883 stored both within the locale and at the theory level (exported and
4884 qualified by the locale name);
4886 * Pure: theory goals may now be specified in ``long'' form, with
4887 ad-hoc contexts consisting of arbitrary locale elements. for example
4888 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4889 definitions may be given, too); the result is a meta-level rule with
4890 the context elements being discharged in the obvious way;
4892 * Pure: new proof command 'using' allows to augment currently used
4893 facts after a goal statement ('using' is syntactically analogous to
4894 'apply', but acts on the goal's facts only); this allows chained facts
4895 to be separated into parts given before and after a claim, as in
4896 ``from a and b have C using d and e <proof>'';
4898 * Pure: renamed "antecedent" case to "rule_context";
4900 * Pure: new 'judgment' command records explicit information about the
4901 object-logic embedding (used by several tools internally); no longer
4902 use hard-wired "Trueprop";
4904 * Pure: added 'corollary' command;
4906 * Pure: fixed 'token_translation' command;
4908 * Pure: removed obsolete 'exported' attribute;
4910 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4911 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4912 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4914 * Pure: method 'atomize' presents local goal premises as object-level
4915 statements (atomic meta-level propositions); setup controlled via
4916 rewrite rules declarations of 'atomize' attribute; example
4917 application: 'induct' method with proper rule statements in improper
4920 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4921 now consider the syntactic context of assumptions, giving a better
4922 chance to get type-inference of the arguments right (this is
4923 especially important for locales);
4925 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4928 * Pure/obtain: the formal conclusion "thesis", being marked as
4929 ``internal'', may no longer be reference directly in the text;
4930 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4933 * Pure: generic 'sym' attribute which declares a rule both as pure
4934 'elim?' and for the 'symmetric' operation;
4936 * Pure: marginal comments ``--'' may now occur just anywhere in the
4937 text; the fixed correlation with particular command syntax has been
4940 * Pure: new method 'rules' is particularly well-suited for proof
4941 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4942 but often produces more compact proof terms with less detours;
4944 * Pure/Provers/classical: simplified integration with pure rule
4945 attributes and methods; the classical "intro?/elim?/dest?"
4946 declarations coincide with the pure ones; the "rule" method no longer
4947 includes classically swapped intros; "intro" and "elim" methods no
4948 longer pick rules from the context; also got rid of ML declarations
4949 AddXIs/AddXEs/AddXDs; all of this has some potential for
4952 * Provers/classical: attribute 'swapped' produces classical inversions
4953 of introduction rules;
4955 * Provers/simplifier: 'simplified' attribute may refer to explicit
4956 rules instead of full simplifier context; 'iff' attribute handles
4959 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4961 * HOL: 'recdef' now fails on unfinished automated proofs, use
4962 "(permissive)" option to recover old behavior;
4964 * HOL: 'inductive' no longer features separate (collective) attributes
4965 for 'intros' (was found too confusing);
4967 * HOL: properly declared induction rules less_induct and
4973 * HOL: moved over to sane numeral syntax; the new policy is as
4976 - 0 and 1 are polymorphic constants, which are defined on any
4977 numeric type (nat, int, real etc.);
4979 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
4980 binary representation internally;
4982 - type nat has special constructor Suc, and generally prefers Suc 0
4983 over 1::nat and Suc (Suc 0) over 2::nat;
4985 This change may cause significant problems of INCOMPATIBILITY; here
4986 are some hints on converting existing sources:
4988 - due to the new "num" token, "-0" and "-1" etc. are now atomic
4989 entities, so expressions involving "-" (unary or binary minus) need
4990 to be spaced properly;
4992 - existing occurrences of "1" may need to be constraint "1::nat" or
4993 even replaced by Suc 0; similar for old "2";
4995 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
4997 - remove all special provisions on numerals in proofs;
4999 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5000 representation (depends on bin_arith_simps in the default context);
5002 * HOL: symbolic syntax for x^2 (numeral 2);
5004 * HOL: the class of all HOL types is now called "type" rather than
5005 "term"; INCOMPATIBILITY, need to adapt references to this type class
5006 in axclass/classes, instance/arities, and (usually rare) occurrences
5007 in typings (of consts etc.); internally the class is called
5008 "HOL.type", ML programs should refer to HOLogic.typeS;
5010 * HOL/record package improvements:
5011 - new derived operations "fields" to build a partial record section,
5012 "extend" to promote a fixed record to a record scheme, and
5013 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5014 declared as simp by default;
5015 - shared operations ("more", "fields", etc.) now need to be always
5016 qualified) --- potential INCOMPATIBILITY;
5017 - removed "make_scheme" operations (use "make" with "extend") --
5019 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5020 - provides cases/induct rules for use with corresponding Isar
5021 methods (for concrete records, record schemes, concrete more
5022 parts, and schematic more parts -- in that order);
5023 - internal definitions directly based on a light-weight abstract
5024 theory of product types over typedef rather than datatype;
5026 * HOL: generic code generator for generating executable ML code from
5027 specifications; specific support for HOL constructs such as inductive
5028 datatypes and sets, as well as recursive functions; can be invoked
5029 via 'generate_code' theory section;
5031 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5033 * HOL: consolidated and renamed several theories. In particular:
5034 Ord.thy has been absorbed into HOL.thy
5035 String.thy has been absorbed into List.thy
5037 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5038 (beware of argument permutation!);
5040 * HOL: linorder_less_split superseded by linorder_cases;
5042 * HOL/List: "nodups" renamed to "distinct";
5044 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5045 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5046 - Ex_def has changed, now need to use some_eq_ex
5048 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5049 in this (rare) case use:
5051 delSWrapper "split_all_tac"
5052 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5054 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5057 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5058 Isabelle's type classes, ^ on functions and relations has too general
5059 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5060 necessary to attach explicit type constraints;
5062 * HOL/Relation: the prefix name of the infix "O" has been changed from
5063 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5064 renamed accordingly (eg "compI" -> "rel_compI").
5066 * HOL: syntax translations now work properly with numerals and records
5069 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5070 of "lam" -- INCOMPATIBILITY;
5072 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5073 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5074 renamed "Product_Type.unit";
5076 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5078 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5079 the "cases" method);
5081 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5084 * HOL/IMP: updated and converted to new-style theory format; several
5085 parts turned into readable document, with proper Isar proof texts and
5086 some explanations (by Gerwin Klein);
5088 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5090 * HOL-Hyperreal is now a logic image;
5095 * Isar: consts/constdefs supports mixfix syntax for continuous
5098 * Isar: domain package adapted to new-style theory format, e.g. see
5101 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5102 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5103 lift.induct_tac, always use UU instead of Undef;
5105 * HOLCF/IMP: updated and converted to new-style theory;
5110 * Isar: proper integration of logic-specific tools and packages,
5111 including theory commands '(co)inductive', '(co)datatype',
5112 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5113 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5115 * theory Main no longer includes AC; for the Axiom of Choice, base
5116 your theory on Main_ZFC;
5118 * the integer library now covers quotients and remainders, with many
5119 laws relating division to addition, multiplication, etc.;
5121 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5122 typeless version of the formalism;
5124 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5127 * ZF/Induct: new directory for examples of inductive definitions,
5128 including theory Multiset for multiset orderings; converted to
5129 new-style theory format;
5131 * ZF: many new theorems about lists, ordinals, etc.;
5136 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5137 variable proof controls level of detail: 0 = no proofs (only oracle
5138 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5139 also ref manual for further ML interfaces;
5141 * Pure/axclass: removed obsolete ML interface
5142 goal_subclass/goal_arity;
5144 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5145 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5146 separate tokens, so expressions involving minus need to be spaced
5149 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5150 rather than "infixl" or "infixr";
5152 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5153 sort constraint specifications in type inference; e.g. "x::_::foo"
5154 ensures that the type of "x" is of sort "foo" (but not necessarily a
5157 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5158 control output of nested => (types); the default behavior is
5161 * Pure/syntax: builtin parse translation for "_constify" turns valued
5162 tokens into AST constants;
5164 * Pure/syntax: prefer later declarations of translations and print
5165 translation functions; potential INCOMPATIBILITY: need to reverse
5166 multiple declarations for same syntax element constant;
5168 * Pure/show_hyps reset by default (in accordance to existing Isar
5171 * Provers/classical: renamed addaltern to addafter, addSaltern to
5174 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5177 * system: tested support for MacOS X; should be able to get Isabelle +
5178 Proof General to work in a plain Terminal after installing Poly/ML
5179 (e.g. from the Isabelle distribution area) and GNU bash alone
5180 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5181 support requires further installations, e.g. from
5182 http://fink.sourceforge.net/);
5184 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5186 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5187 of 40 MB), cf. ML_OPTIONS;
5189 * system: Proof General keywords specification is now part of the
5190 Isabelle distribution (see etc/isar-keywords.el);
5192 * system: support for persistent Proof General sessions (refrain from
5193 outdating all loaded theories on startup); user may create writable
5194 logic images like this: ``isabelle -q HOL Test'';
5196 * system: smart selection of Isabelle process versus Isabelle
5197 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5198 run both "isabelle" and "Isabelle" even if file names are badly
5199 damaged (executable inspects the case of the first letter of its own
5200 name); added separate "isabelle-process" and "isabelle-interface";
5202 * system: refrain from any attempt at filtering input streams; no
5203 longer support ``8bit'' encoding of old isabelle font, instead proper
5204 iso-latin characters may now be used; the related isatools
5205 "symbolinput" and "nonascii" have disappeared as well;
5207 * system: removed old "xterm" interface (the print modes "xterm" and
5208 "xterm_color" are still available for direct use in a suitable
5213 New in Isabelle99-2 (February 2001)
5214 -----------------------------------
5216 *** Overview of INCOMPATIBILITIES ***
5218 * HOL: please note that theories in the Library and elsewhere often use the
5219 new-style (Isar) format; to refer to their theorems in an ML script you must
5220 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5222 * HOL: inductive package no longer splits induction rule aggressively,
5223 but only as far as specified by the introductions given; the old
5224 format may be recovered via ML function complete_split_rule or attribute
5225 'split_rule (complete)';
5227 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5228 gfp_Tarski to gfp_unfold;
5230 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5232 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5233 relation); infix "^^" has been renamed "``"; infix "``" has been
5234 renamed "`"; "univalent" has been renamed "single_valued";
5236 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5239 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5241 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5243 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5244 consequence, it is no longer monotonic wrt. the local goal context
5245 (which is now passed through the inductive cases);
5247 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5248 \<gg> to \<ggreater>;
5251 *** Document preparation ***
5253 * \isabellestyle{NAME} selects version of Isabelle output (currently
5254 available: are "it" for near math-mode best-style output, "sl" for
5255 slanted text style, and "tt" for plain type-writer; if no
5256 \isabellestyle command is given, output is according to slanted
5259 * support sub/super scripts (for single symbols only), input syntax is
5260 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5262 * some more standard symbols; see Appendix A of the system manual for
5263 the complete list of symbols defined in isabellesym.sty;
5265 * improved isabelle style files; more abstract symbol implementation
5266 (should now use \isamath{...} and \isatext{...} in custom symbol
5269 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5270 state; Note that presentation of goal states does not conform to
5271 actual human-readable proof documents. Please do not include goal
5272 states into document output unless you really know what you are doing!
5274 * proper indentation of antiquoted output with proportional LaTeX
5277 * no_document ML operator temporarily disables LaTeX document
5280 * isatool unsymbolize tunes sources for plain ASCII communication;
5285 * Pure: Isar now suffers initial goal statements to contain unbound
5286 schematic variables (this does not conform to actual readable proof
5287 documents, due to unpredictable outcome and non-compositional proof
5288 checking); users who know what they are doing may use schematic goals
5289 for Prolog-style synthesis of proven results;
5291 * Pure: assumption method (an implicit finishing) now handles actual
5294 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5295 initial goal, declare "that" only as Pure intro (only for single
5296 steps); the "that" rule assumption may now be involved in implicit
5297 finishing, thus ".." becomes a feasible for trivial obtains;
5299 * Pure: default proof step now includes 'intro_classes'; thus trivial
5300 instance proofs may be performed by "..";
5302 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5305 * Pure: more robust selection of calculational rules;
5307 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5308 rule (as well as the assumption rule);
5310 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5311 lemmas, using the graph browser tool;
5313 * Pure: predict failure of "show" in interactive mode;
5315 * Pure: 'thms_containing' now takes actual terms as arguments;
5317 * HOL: improved method 'induct' --- now handles non-atomic goals
5318 (potential INCOMPATIBILITY); tuned error handling;
5320 * HOL: cases and induct rules now provide explicit hints about the
5321 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5322 any remaining facts are inserted into the goal verbatim;
5324 * HOL: local contexts (aka cases) may now contain term bindings as
5325 well; the 'cases' and 'induct' methods new provide a ?case binding for
5326 the result to be shown in each case;
5328 * HOL: added 'recdef_tc' command;
5330 * isatool convert assists in eliminating legacy ML scripts;
5335 * HOL/Library: a collection of generic theories to be used together
5336 with main HOL; the theory loader path already includes this directory
5337 by default; the following existing theories have been moved here:
5338 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5339 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5341 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5342 modelling and verification task performed in Isabelle/HOL +
5343 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5345 * HOL/Algebra: special summation operator SUM no longer exists, it has
5346 been replaced by setsum; infix 'assoc' now has priority 50 (like
5347 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5348 'domain', this makes the theory consistent with mathematical
5351 * HOL basics: added overloaded operations "inverse" and "divide"
5352 (infix "/"), syntax for generic "abs" operation, generic summation
5355 * HOL/typedef: simplified package, provide more useful rules (see also
5358 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5359 now expressed as a proper nested rule (old-style tactic scripts may
5360 require atomize_strip_tac to cope with non-atomic premises);
5362 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5363 to "split_conv" (old name still available for compatibility);
5365 * HOL: improved concrete syntax for strings (e.g. allows translation
5366 rules with string literals);
5368 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5369 and Fleuriot's mechanization of analysis, including the transcendental
5370 functions for the reals;
5372 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5377 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5378 "lam" is displayed as TWO lambda-symbols
5380 * CTT: theory Main now available, containing everything (that is, Bool
5386 * Pure: the Simplifier has been implemented properly as a derived rule
5387 outside of the actual kernel (at last!); the overall performance
5388 penalty in practical applications is about 50%, while reliability of
5389 the Isabelle inference kernel has been greatly improved;
5391 * print modes "brackets" and "no_brackets" control output of nested =>
5392 (types) and ==> (props); the default behaviour is "brackets";
5394 * Provers: fast_tac (and friends) now handle actual object-logic rules
5395 as assumptions as well;
5397 * system: support Poly/ML 4.0;
5399 * system: isatool install handles KDE version 1 or 2;
5403 New in Isabelle99-1 (October 2000)
5404 ----------------------------------
5406 *** Overview of INCOMPATIBILITIES ***
5408 * HOL: simplification of natural numbers is much changed; to partly
5409 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5410 issue the following ML commands:
5412 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5413 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5415 * HOL: simplification no longer dives into case-expressions; this is
5416 controlled by "t.weak_case_cong" for each datatype t;
5418 * HOL: nat_less_induct renamed to less_induct;
5420 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5421 fixsome to patch .thy and .ML sources automatically;
5423 select_equality -> some_equality
5424 select_eq_Ex -> some_eq_ex
5425 selectI2EX -> someI2_ex
5428 select1_equality -> some1_equality
5429 Eps_sym_eq -> some_sym_eq_trivial
5430 Eps_eq -> some_eq_trivial
5432 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5434 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5437 * HOL: the recursion equations generated by 'recdef' are now called
5438 f.simps instead of f.rules;
5440 * HOL: qed_spec_mp now also handles bounded ALL as well;
5442 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5443 sometimes be needed;
5445 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5447 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5449 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5450 product is now "<*>" instead of "Times"; the lexicographic product is
5451 now "<*lex*>" instead of "**";
5453 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5454 of main HOL, but was unused); better use HOL's datatype package;
5456 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5457 the old syntax may be recovered as follows:
5460 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5461 (infixl "\\<oplus>" 100)
5463 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5465 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5466 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5469 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5470 changed from A/r to A//r;
5472 * ZF: new treatment of arithmetic (nat & int) may break some old
5475 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5476 rulify -> rule_format, elimify -> elim_format, ...);
5478 * Isar/Provers: intro/elim/dest attributes changed; renamed
5479 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5480 should have to change intro!! to intro? only); replaced "delrule" by
5483 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5485 * Provers: strengthened force_tac by using new first_best_tac;
5487 * LaTeX document preparation: several changes of isabelle.sty (see
5491 *** Document preparation ***
5493 * formal comments (text blocks etc.) in new-style theories may now
5494 contain antiquotations of thm/prop/term/typ/text to be presented
5495 according to latex print mode; concrete syntax is like this:
5496 @{term[show_types] "f(x) = a + x"};
5498 * isatool mkdir provides easy setup of Isabelle session directories,
5499 including proper document sources;
5501 * generated LaTeX sources are now deleted after successful run
5502 (isatool document -c); may retain a copy somewhere else via -D option
5505 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5506 style files, achieving self-contained LaTeX sources and simplifying
5509 * old-style theories now produce (crude) LaTeX output as well;
5511 * browser info session directories are now self-contained (may be put
5512 on WWW server seperately); improved graphs of nested sessions; removed
5513 graph for 'all sessions';
5515 * several improvements in isabelle style files; \isabellestyle{it}
5516 produces fake math mode output; \isamarkupheader is now \section by
5517 default; see lib/texinputs/isabelle.sty etc.;
5522 * Isar/Pure: local results and corresponding term bindings are now
5523 subject to Hindley-Milner polymorphism (similar to ML); this
5524 accommodates incremental type-inference very nicely;
5526 * Isar/Pure: new derived language element 'obtain' supports
5527 generalized existence reasoning;
5529 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5530 support accumulation of results, without applying any rules yet;
5531 useful to collect intermediate results without explicit name
5532 references, and for use with transitivity rules with more than 2
5535 * Isar/Pure: scalable support for case-analysis type proofs: new
5536 'case' language element refers to local contexts symbolically, as
5537 produced by certain proof methods; internally, case names are attached
5538 to theorems as "tags";
5540 * Isar/Pure: theory command 'hide' removes declarations from
5541 class/type/const name spaces;
5543 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5544 indicate potential overloading;
5546 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5548 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5549 "{a,b,c}" instead of {a,b,c};
5551 * Isar/Pure now provides its own version of intro/elim/dest
5552 attributes; useful for building new logics, but beware of confusion
5553 with the version in Provers/classical;
5555 * Isar/Pure: the local context of (non-atomic) goals is provided via
5556 case name 'antecedent';
5558 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5559 to the current context is now done automatically);
5561 * Isar/Pure: theory command 'method_setup' provides a simple interface
5562 for definining proof methods in ML;
5564 * Isar/Provers: intro/elim/dest attributes changed; renamed
5565 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5566 most cases, one should have to change intro!! to intro? only);
5567 replaced "delrule" by "rule del";
5569 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5570 'symmetric' attribute (the latter supercedes [RS sym]);
5572 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5573 method modifier); 'simp' method: 'only:' modifier removes loopers as
5574 well (including splits);
5576 * Isar/Provers: Simplifier and Classical methods now support all kind
5577 of modifiers used in the past, including 'cong', 'iff', etc.
5579 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5580 of Simplifier and Classical reasoner);
5582 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5583 now support named cases; major packages (inductive, datatype, primrec,
5584 recdef) support case names and properly name parameters;
5586 * Isar/HOL: new transitivity rules for substitution in inequalities --
5587 monotonicity conditions are extracted to be proven at end of
5590 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5593 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5594 split_if split_if_asm; datatype package provides theorems foo.splits =
5595 foo.split foo.split_asm for each datatype;
5597 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5598 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5599 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5600 use "(cases (simplified))" method in proper proof texts);
5602 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5604 * Isar: names of theorems etc. may be natural numbers as well;
5606 * Isar: 'pr' command: optional arguments for goals_limit and
5607 ProofContext.prems_limit; no longer prints theory contexts, but only
5610 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5611 additional print modes to be specified; e.g. "pr(latex)" will print
5612 proof state according to the Isabelle LaTeX style;
5614 * Isar: improved support for emulating tactic scripts, including proof
5615 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5616 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5617 (for HOL datatypes);
5619 * Isar: simplified (more robust) goal selection of proof methods: 1st
5620 goal, all goals, or explicit goal specifier (tactic emulation); thus
5621 'proof method scripts' have to be in depth-first order;
5623 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5625 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5626 should instead use individual commands for printing items
5627 (print_commands, print_methods etc.);
5629 * Isar: added 'nothing' --- the empty list of theorems;
5634 * HOL/MicroJava: formalization of a fragment of Java, together with a
5635 corresponding virtual machine and a specification of its bytecode
5636 verifier and a lightweight bytecode verifier, including proofs of
5637 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5638 Cornelia Pusch (see also the homepage of project Bali at
5639 http://isabelle.in.tum.de/Bali/);
5641 * HOL/Algebra: new theory of rings and univariate polynomials, by
5644 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5645 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5648 * HOL/Lattice: fundamental concepts of lattice theory and order
5649 structures, including duals, properties of bounds versus algebraic
5650 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5651 Theorem for complete lattices etc.; may also serve as a demonstration
5652 for abstract algebraic reasoning using axiomatic type classes, and
5653 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5655 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5658 * HOL/IMPP: extension of IMP with local variables and mutually
5659 recursive procedures, by David von Oheimb;
5661 * HOL/Lambda: converted into new-style theory and document;
5663 * HOL/ex/Multiquote: example of multiple nested quotations and
5664 anti-quotations -- basically a generalized version of de-Bruijn
5665 representation; very useful in avoiding lifting of operations;
5667 * HOL/record: added general record equality rule to simpset; fixed
5668 select-update simplification procedure to handle extended records as
5669 well; admit "r" as field name;
5671 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5672 other numeric types and also as the identity of groups, rings, etc.;
5674 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5675 Types nat and int belong to this axclass;
5677 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5678 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5679 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5680 two terms #m*u and #n*u are replaced by #(m+n)*u
5681 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5682 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5683 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5685 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5686 powerful prover for predicate logic but knows nothing of clasets; see
5687 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5689 * HOL: new version of "case_tac" subsumes both boolean case split and
5690 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5691 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5693 * HOL: simplification no longer dives into case-expressions: only the
5694 selector expression is simplified, but not the remaining arms; to
5695 enable full simplification of case-expressions for datatype t, you may
5696 remove t.weak_case_cong from the simpset, either globally (Delcongs
5697 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5699 * HOL/recdef: the recursion equations generated by 'recdef' for
5700 function 'f' are now called f.simps instead of f.rules; if all
5701 termination conditions are proved automatically, these simplification
5702 rules are added to the simpset, as in primrec; rules may be named
5703 individually as well, resulting in a separate list of theorems for
5706 * HOL/While is a new theory that provides a while-combinator. It
5707 permits the definition of tail-recursive functions without the
5708 provision of a termination measure. The latter is necessary once the
5709 invariant proof rule for while is applied.
5711 * HOL: new (overloaded) notation for the set of elements below/above
5712 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5714 * HOL: theorems impI, allI, ballI bound as "strip";
5716 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5717 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5718 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5720 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5722 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5723 main HOL, but was unused);
5725 * HOL: fewer consts declared as global (e.g. have to refer to
5726 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5728 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5729 in case of overlap with user translations (e.g. judgements over
5730 tuples); (note that the underlying logical represenation is still
5736 * ZF: simplification automatically cancels common terms in arithmetic
5737 expressions over nat and int;
5739 * ZF: new treatment of nat to minimize type-checking: all operators
5740 coerce their operands to a natural number using the function natify,
5741 making the algebraic laws unconditional;
5743 * ZF: as above, for int: operators coerce their operands to an integer
5744 using the function intify;
5746 * ZF: the integer library now contains many of the usual laws for the
5747 orderings, including $<=, and monotonicity laws for $+ and $*;
5749 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5752 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5753 to the simplifier and classical reasoner simultaneously;
5758 * Provers: blast_tac now handles actual object-logic rules as
5759 assumptions; note that auto_tac uses blast_tac internally as well;
5761 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5762 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5764 * Provers: delrules now handles destruct rules as well (no longer need
5765 explicit make_elim);
5767 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5768 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5769 use instead the strong form,
5770 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5771 in HOL, FOL and ZF the function cla_make_elim will create such rules
5772 from destruct-rules;
5774 * Provers: Simplifier.easy_setup provides a fast path to basic
5775 Simplifier setup for new object-logics;
5777 * Pure: AST translation rules no longer require constant head on LHS;
5779 * Pure: improved name spaces: ambiguous output is qualified; support
5780 for hiding of names;
5782 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5783 XSYMBOL_HOME; no longer need to do manual configuration in most
5786 * system: compression of ML heaps images may now be controlled via -c
5787 option of isabelle and isatool usedir (currently only observed by
5790 * system: isatool installfonts may handle X-Symbol fonts as well (very
5791 useful for remote X11);
5793 * system: provide TAGS file for Isabelle sources;
5795 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5798 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5799 timing flag supersedes proof_timing and Toplevel.trace;
5801 * ML: new combinators |>> and |>>> for incremental transformations
5802 with secondary results (e.g. certain theory extensions):
5804 * ML: PureThy.add_defs gets additional argument to indicate potential
5805 overloading (usually false);
5807 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5812 New in Isabelle99 (October 1999)
5813 --------------------------------
5815 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5817 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5818 are no longer simplified. (This allows the simplifier to unfold recursive
5819 functional programs.) To restore the old behaviour, declare
5821 Delcongs [if_weak_cong];
5823 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5826 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5828 * HOL/datatype: mutual_induct_tac no longer exists --
5829 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5831 * HOL/typedef: fixed type inference for representing set; type
5832 arguments now have to occur explicitly on the rhs as type constraints;
5834 * ZF: The con_defs part of an inductive definition may no longer refer
5835 to constants declared in the same theory;
5837 * HOL, ZF: the function mk_cases, generated by the inductive
5838 definition package, has lost an argument. To simplify its result, it
5839 uses the default simpset instead of a supplied list of theorems.
5841 * HOL/List: the constructors of type list are now Nil and Cons;
5843 * Simplifier: the type of the infix ML functions
5844 setSSolver addSSolver setSolver addSolver
5845 is now simpset * solver -> simpset where `solver' is a new abstract type
5846 for packaging solvers. A solver is created via
5847 mk_solver: string -> (thm list -> int -> tactic) -> solver
5848 where the string argument is only a comment.
5853 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5854 decision procedure for linear arithmetic. Currently it is used for
5855 types `nat', `int', and `real' in HOL (see below); it can, should and
5856 will be instantiated for other types and logics as well.
5858 * The simplifier now accepts rewrite rules with flexible heads, eg
5859 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5860 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5866 * New Isabelle/Isar subsystem provides an alternative to traditional
5867 tactical theorem proving; together with the ProofGeneral/isar user
5868 interface it offers an interactive environment for developing human
5869 readable proof documents (Isar == Intelligible semi-automated
5870 reasoning); for further information see isatool doc isar-ref,
5871 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5873 * improved and simplified presentation of theories: better HTML markup
5874 (including colors), graph views in several sizes; isatool usedir now
5875 provides a proper interface for user theories (via -P option); actual
5876 document preparation based on (PDF)LaTeX is available as well (for
5877 new-style theories only); see isatool doc system for more information;
5879 * native support for Proof General, both for classic Isabelle and
5882 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5883 using the graph browser tool;
5885 * Isabelle manuals now also available as PDF;
5887 * theory loader rewritten from scratch (may not be fully
5888 bug-compatible); old loadpath variable has been replaced by show_path,
5889 add_path, del_path, reset_path functions; new operations such as
5890 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5893 * improved isatool install: option -k creates KDE application icon,
5894 option -p DIR installs standalone binaries;
5896 * added ML_PLATFORM setting (useful for cross-platform installations);
5897 more robust handling of platform specific ML images for SML/NJ;
5899 * the settings environment is now statically scoped, i.e. it is never
5900 created again in sub-processes invoked from isabelle, isatool, or
5903 * path element specification '~~' refers to '$ISABELLE_HOME';
5905 * in locales, the "assumes" and "defines" parts may be omitted if
5908 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5911 * new print_mode "HTML";
5913 * new flag show_tags controls display of tags of theorems (which are
5914 basically just comments that may be attached by some tools);
5916 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5917 mode and goal output format:
5919 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5921 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5923 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5924 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5926 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5928 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5930 * function bind_thms stores lists of theorems (cf. bind_thm);
5932 * new shorthand tactics ftac, eatac, datac, fatac;
5934 * qed (and friends) now accept "" as result name; in that case the
5935 theorem is not stored, but proper checks and presentation of the
5938 * theorem database now also indexes constants "Trueprop", "all",
5939 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5944 ** HOL arithmetic **
5946 * There are now decision procedures for linear arithmetic over nat and
5949 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5950 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5951 are treated as atomic; subformulae not involving type `nat' or `int'
5952 are ignored; quantified subformulae are ignored unless they are
5953 positive universal or negative existential. The tactic has to be
5954 invoked by hand and can be a little bit slow. In particular, the
5955 running time is exponential in the number of occurrences of `min' and
5956 `max', and `-' on `nat'.
5958 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5959 (negated) (in)equalities among the premises and the conclusion into
5960 account (i.e. no compound formulae) and does not know about `min' and
5961 `max', and `-' on `nat'. It is fast and is used automatically by the
5964 NB: At the moment, these decision procedures do not cope with mixed
5965 nat/int formulae where the two parts interact, such as `m < n ==>
5968 * HOL/Numeral provides a generic theory of numerals (encoded
5969 efficiently as bit strings); setup for types nat/int/real is in place;
5970 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5971 int, existing theories and proof scripts may require a few additional
5974 * integer division and remainder can now be performed on constant
5977 * many properties of integer multiplication, division and remainder
5980 * An interface to the Stanford Validity Checker (SVC) is available through the
5981 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
5982 are proved automatically. SVC must be installed separately, and its results
5983 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
5984 invocation of the underlying oracle). For SVC see
5985 http://verify.stanford.edu/SVC
5987 * IsaMakefile: the HOL-Real target now builds an actual image;
5992 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
5993 (in Isabelle/Isar) -- by Gertrud Bauer;
5995 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
5996 analysis for assembly languages with subtypes;
5998 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
5999 -- avoids syntactic ambiguities and treats state, transition, and
6000 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6001 changed syntax and (many) tactics;
6003 * HOL/inductive: Now also handles more general introduction rules such
6004 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6005 theorems are now maintained within the theory (maintained via the
6008 * HOL/datatype: Now also handles arbitrarily branching datatypes
6009 (using function types) such as
6011 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6013 * HOL/record: record_simproc (part of the default simpset) takes care
6014 of selectors applied to updated records; record_split_tac is no longer
6015 part of the default claset; update_defs may now be removed from the
6016 simpset in many cases; COMPATIBILITY: old behavior achieved by
6018 claset_ref () := claset() addSWrapper record_split_wrapper;
6019 Delsimprocs [record_simproc]
6021 * HOL/typedef: fixed type inference for representing set; type
6022 arguments now have to occur explicitly on the rhs as type constraints;
6024 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6025 names rather than an ML expression;
6027 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6028 supplied later. Program schemes can be defined, such as
6029 "While B C s = (if B s then While B C (C s) else s)"
6030 where the well-founded relation can be chosen after B and C have been given.
6032 * HOL/List: the constructors of type list are now Nil and Cons;
6033 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6034 course, ML tools referring to List.list.op # etc. have to be adapted;
6036 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6037 disabled by default; run isabelle with option -m HOL to get back to
6038 the original Gordon/HOL-style output;
6040 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6041 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6043 * HOL basic syntax simplified (more orthogonal): all variants of
6044 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6045 Eps operator is provided as well: "SOME x. P[x]";
6047 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6049 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6050 thus available for user theories;
6052 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6053 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6056 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6057 several times and then mp;
6062 * the notation <<...>> is now available as a notation for sequences of
6065 * the simplifier is now installed
6067 * the axiom system has been generalized (thanks to Soren Heilmann)
6069 * the classical reasoner now has a default rule database
6074 * new primrec section allows primitive recursive functions to be given
6075 directly (as in HOL) over datatypes and the natural numbers;
6077 * new tactics induct_tac and exhaust_tac for induction (or case
6078 analysis) over datatypes and the natural numbers;
6080 * the datatype declaration of type T now defines the recursor T_rec;
6082 * simplification automatically does freeness reasoning for datatype
6085 * automatic type-inference, with AddTCs command to insert new
6086 type-checking rules;
6088 * datatype introduction rules are now added as Safe Introduction rules
6091 * the syntax "if P then x else y" is now available in addition to
6095 *** Internal programming interfaces ***
6097 * tuned simplifier trace output; new flag debug_simp;
6099 * structures Vartab / Termtab (instances of TableFun) offer efficient
6100 tables indexed by indexname_ord / term_ord (compatible with aconv);
6102 * AxClass.axclass_tac lost the theory argument;
6104 * tuned current_goals_markers semantics: begin / end goal avoids
6105 printing empty lines;
6107 * removed prs and prs_fn hook, which was broken because it did not
6108 include \n in its semantics, forcing writeln to add one
6109 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6110 string -> unit if you really want to output text without newline;
6112 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6113 plain output, interface builders may have to enable 'isabelle_font'
6114 mode to get Isabelle font glyphs as before;
6116 * refined token_translation interface; INCOMPATIBILITY: output length
6117 now of type real instead of int;
6119 * theory loader actions may be traced via new ThyInfo.add_hook
6120 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6121 your own database of information attached to *whole* theories -- as
6122 opposed to intra-theory data slots offered via TheoryDataFun;
6124 * proper handling of dangling sort hypotheses (at last!);
6125 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6126 extra sort hypotheses that can be witnessed from the type signature;
6127 the force_strip_shyps flag is gone, any remaining shyps are simply
6128 left in the theorem (with a warning issued by strip_shyps_warning);
6132 New in Isabelle98-1 (October 1998)
6133 ----------------------------------
6135 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6137 * several changes of automated proof tools;
6139 * HOL: major changes to the inductive and datatype packages, including
6140 some minor incompatibilities of theory syntax;
6142 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6145 * HOL: removed duplicate thms in Arith:
6146 less_imp_add_less should be replaced by trans_less_add1
6147 le_imp_add_le should be replaced by trans_le_add1
6149 * HOL: unary minus is now overloaded (new type constraints may be
6152 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6153 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6154 now taken as an integer constant.
6156 * Pure: ML function 'theory_of' renamed to 'theory';
6162 1. Asm_full_simp_tac is now more aggressive.
6163 1. It will sometimes reorient premises if that increases their power to
6165 2. It does no longer proceed strictly from left to right but may also
6166 rotate premises to achieve further simplification.
6167 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6168 old Asm_full_simp_tac in that it does not rotate premises.
6169 2. The simplifier now knows a little bit about nat-arithmetic.
6171 * Classical reasoner: wrapper mechanism for the classical reasoner now
6172 allows for selected deletion of wrappers, by introduction of names for
6173 wrapper functionals. This implies that addbefore, addSbefore,
6174 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6175 and that adding two tactics with the same name overwrites the first
6176 one (emitting a warning).
6177 type wrapper = (int -> tactic) -> (int -> tactic)
6178 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6179 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6180 delWrapper, delSWrapper: claset * string -> claset
6181 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6183 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6184 semantics; addbefore now affects only the unsafe part of step_tac
6185 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6186 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6189 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6190 compWrapper; added safe wrapper (and access functions for it);
6192 * HOL/split_all_tac is now much faster and fails if there is nothing
6193 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6194 and the names of the automatically generated variables have changed.
6195 split_all_tac has moved within claset() from unsafe wrappers to safe
6196 wrappers, which means that !!-bound variables are split much more
6197 aggressively, and safe_tac and clarify_tac now split such variables.
6198 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6199 Note: the same holds for record_split_tac, which does the job of
6200 split_all_tac for record fields.
6202 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6203 permanently to the default simpset using Addsplits just like
6204 Addsimps. They can be removed via Delsplits just like
6205 Delsimps. Lower-case versions are also available.
6207 * HOL/Simplifier: The rule split_if is now part of the default
6208 simpset. This means that the simplifier will eliminate all occurrences
6209 of if-then-else in the conclusion of a goal. To prevent this, you can
6210 either remove split_if completely from the default simpset by
6211 `Delsplits [split_if]' or remove it in a specific call of the
6212 simplifier using `... delsplits [split_if]'. You can also add/delete
6213 other case splitting rules to/from the default simpset: every datatype
6214 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6215 t is the name of the datatype).
6217 * Classical reasoner / Simplifier combination: new force_tac (and
6218 derivatives Force_tac, force) combines rewriting and classical
6219 reasoning (and whatever other tools) similarly to auto_tac, but is
6220 aimed to solve the given subgoal completely.
6225 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6226 and `goalw': the theory is no longer needed as an explicit argument -
6227 the current theory context is used; assumptions are no longer returned
6228 at the ML-level unless one of them starts with ==> or !!; it is
6229 recommended to convert to these new commands using isatool fixgoal
6230 (backup your sources first!);
6232 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6233 the current theory context, and 'theory' to lookup stored theories;
6235 * new theory section 'locale' for declaring constants, assumptions and
6236 definitions that have local scope;
6238 * new theory section 'nonterminals' for purely syntactic types;
6240 * new theory section 'setup' for generic ML setup functions
6241 (e.g. package initialization);
6243 * the distribution now includes Isabelle icons: see
6244 lib/logo/isabelle-{small,tiny}.xpm;
6246 * isatool install - install binaries with absolute references to
6249 * isatool logo -- create instances of the Isabelle logo (as EPS);
6251 * print mode 'emacs' reserved for Isamode;
6253 * support multiple print (ast) translations per constant name;
6255 * theorems involving oracles are now printed with a suffixed [!];
6260 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6262 * HOL/inductive package reorganized and improved: now supports mutual
6268 oddI "n : EVEN ==> Suc n : ODD"
6269 evenI "n : ODD ==> Suc n : EVEN"
6271 new theorem list "elims" contains an elimination rule for each of the
6272 recursive sets; inductive definitions now handle disjunctive premises
6273 correctly (also ZF);
6275 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6276 "mutual_induct" no longer exists - the induction rule is always
6277 contained in "induct";
6280 * HOL/datatype package re-implemented and greatly improved: now
6281 supports mutually recursive datatypes such as
6284 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6285 | SUM ('a aexp) ('a aexp)
6286 | DIFF ('a aexp) ('a aexp)
6289 'a bexp = LESS ('a aexp) ('a aexp)
6290 | AND ('a bexp) ('a bexp)
6291 | OR ('a bexp) ('a bexp)
6293 as well as indirectly recursive datatypes such as
6296 ('a, 'b) term = Var 'a
6297 | App 'b ((('a, 'b) term) list)
6299 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6300 induction on mutually / indirectly recursive datatypes.
6302 Primrec equations are now stored in theory and can be accessed via
6303 <function_name>.simps.
6307 - Theories using datatypes must now have theory Datatype as an
6309 - The specific <typename>.induct_tac no longer exists - use the
6310 generic induct_tac instead.
6311 - natE has been renamed to nat.exhaust - use exhaust_tac
6312 instead of res_inst_tac ... natE. Note that the variable
6313 names in nat.exhaust differ from the names in natE, this
6314 may cause some "fragile" proofs to fail.
6315 - The theorems split_<typename>_case and split_<typename>_case_asm
6316 have been renamed to <typename>.split and <typename>.split_asm.
6317 - Since default sorts of type variables are now handled correctly,
6318 some datatype definitions may have to be annotated with explicit
6320 - Primrec definitions no longer require function name and type
6321 of recursive argument.
6323 Consider using isatool fixdatatype to adapt your theories and proof
6324 scripts to the new package (backup your sources first!).
6327 * HOL/record package: considerably improved implementation; now
6328 includes concrete syntax for record types, terms, updates; theorems
6329 for surjective pairing and splitting !!-bound record variables; proof
6330 support is as follows:
6332 1) standard conversions (selectors or updates applied to record
6333 constructor terms) are part of the standard simpset;
6335 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6336 made part of standard simpset and claset via addIffs;
6338 3) a tactic for record field splitting (record_split_tac) is part of
6339 the standard claset (addSWrapper);
6341 To get a better idea about these rules you may retrieve them via
6342 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6343 the name of your record type.
6345 The split tactic 3) conceptually simplifies by the following rule:
6347 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6349 Thus any record variable that is bound by meta-all will automatically
6350 blow up into some record constructor term, consequently the
6351 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6352 solve record problems automatically.
6355 * reorganized the main HOL image: HOL/Integ and String loaded by
6356 default; theory Main includes everything;
6358 * automatic simplification of integer sums and comparisons, using cancellation;
6360 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6362 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6364 * many new identities for unions, intersections, set difference, etc.;
6366 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6367 called split_if, split_split, split_sum_case and split_nat_case (to go
6368 with add/delsplits);
6370 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6371 (?x::unit) = (); this is made part of the default simpset, which COULD
6372 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6373 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6374 unit_abs_eta_conv is added in order to counter the effect of
6375 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6378 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6381 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6382 It and 'sym RS equals0D' are now in the default claset, giving automatic
6383 disjointness reasoning but breaking a few old proofs.
6385 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6386 to 'converse' from 'inverse' (for compatibility with ZF and some
6389 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6390 the well-founded relation;
6392 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6393 Compl A. The "Compl" syntax remains available as input syntax for this
6396 * HOL/Update: new theory of function updates:
6397 f(a:=b) == %x. if x=a then b else f x
6398 may also be iterated as in f(a:=b,c:=d,...);
6400 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6403 - new function list_update written xs[i:=v] that updates the i-th
6404 list position. May also be iterated as in xs[i:=a,j:=b,...].
6405 - new function `upt' written [i..j(] which generates the list
6406 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6407 bound write [i..j], which is a shorthand for [i..j+1(].
6408 - new lexicographic orderings and corresponding wellfoundedness theorems.
6411 - removed 'pred' (predecessor) function;
6412 - generalized some theorems about n-1;
6413 - many new laws about "div" and "mod";
6414 - new laws about greatest common divisors (see theory ex/Primes);
6416 * HOL/Relation: renamed the relational operator r^-1 "converse"
6417 instead of "inverse";
6419 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6420 of the multiset ordering;
6422 * directory HOL/Real: a construction of the reals using Dedekind cuts
6423 (not included by default);
6425 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6427 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6428 programs, i.e. different program variables may have different types.
6430 * calling (stac rew i) now fails if "rew" has no effect on the goal
6431 [previously, this check worked only if the rewrite rule was unconditional]
6432 Now rew can involve either definitions or equalities (either == or =).
6437 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6438 only the theorems proved on ZF.ML;
6440 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6441 It and 'sym RS equals0D' are now in the default claset, giving automatic
6442 disjointness reasoning but breaking a few old proofs.
6444 * ZF/Update: new theory of function updates
6445 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6446 may also be iterated as in f(a:=b,c:=d,...);
6448 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
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 =).
6454 * case_tac provided for compatibility with HOL
6455 (like the old excluded_middle_tac, but with subgoals swapped)
6458 *** Internal programming interfaces ***
6460 * Pure: several new basic modules made available for general use, see
6461 also src/Pure/README;
6463 * improved the theory data mechanism to support encapsulation (data
6464 kind name replaced by private Object.kind, acting as authorization
6465 key); new type-safe user interface via functor TheoryDataFun; generic
6466 print_data function becomes basically useless;
6468 * removed global_names compatibility flag -- all theory declarations
6469 are qualified by default;
6471 * module Pure/Syntax now offers quote / antiquote translation
6472 functions (useful for Hoare logic etc. with implicit dependencies);
6473 see HOL/ex/Antiquote for an example use;
6475 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6478 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6481 * Display.print_goals function moved to Locale.print_goals;
6483 * standard print function for goals supports current_goals_markers
6484 variable for marking begin of proof, end of proof, start of goal; the
6485 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6486 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6491 New in Isabelle98 (January 1998)
6492 --------------------------------
6494 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6496 * changed lexical syntax of terms / types: dots made part of long
6497 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6499 * simpset (and claset) reference variable replaced by functions
6500 simpset / simpset_ref;
6502 * no longer supports theory aliases (via merge) and non-trivial
6503 implicit merge of thms' signatures;
6505 * most internal names of constants changed due to qualified names;
6507 * changed Pure/Sequence interface (see Pure/seq.ML);
6510 *** General Changes ***
6512 * hierachically structured name spaces (for consts, types, axms, thms
6513 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6514 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6515 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6516 long_names for fully qualified output names; NOTE: ML programs
6517 (special tactics, packages etc.) referring to internal names may have
6518 to be adapted to cope with fully qualified names; in case of severe
6519 backward campatibility problems try setting 'global_names' at compile
6520 time to have enrything declared within a flat name space; one may also
6521 fine tune name declarations in theories via the 'global' and 'local'
6524 * reimplemented the implicit simpset and claset using the new anytype
6525 data filed in signatures; references simpset:simpset ref etc. are
6526 replaced by functions simpset:unit->simpset and
6527 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6528 to patch your ML files accordingly;
6530 * HTML output now includes theory graph data for display with Java
6531 applet or isatool browser; data generated automatically via isatool
6532 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6534 * defs may now be conditional; improved rewrite_goals_tac to handle
6535 conditional equations;
6537 * defs now admits additional type arguments, using TYPE('a) syntax;
6539 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6540 creates a new theory node; implicit merge of thms' signatures is
6541 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6542 transfer:theory->thm->thm in (rare) cases;
6544 * improved handling of draft signatures / theories; draft thms (and
6545 ctyps, cterms) are automatically promoted to real ones;
6547 * slightly changed interfaces for oracles: admit many per theory, named
6548 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6550 * print_goals: optional output of const types (set show_consts and
6553 * improved output of warnings (###) and errors (***);
6555 * subgoal_tac displays a warning if the new subgoal has type variables;
6557 * removed old README and Makefiles;
6559 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6561 * removed obsolete init_pps and init_database;
6563 * deleted the obsolete tactical STATE, which was declared by
6564 fun STATE tacfun st = tacfun st st;
6566 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6567 (which abbreviates $HOME);
6569 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6570 use isatool fixseq to adapt your ML programs (this works for fully
6571 qualified references to the Sequence structure only!);
6573 * use_thy no longer requires writable current directory; it always
6574 reloads .ML *and* .thy file, if either one is out of date;
6577 *** Classical Reasoner ***
6579 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6580 tactics that use classical reasoning to simplify a subgoal without
6581 splitting it into several subgoals;
6583 * Safe_tac: like safe_tac but uses the default claset;
6588 * added simplification meta rules:
6589 (asm_)(full_)simplify: simpset -> thm -> thm;
6591 * simplifier.ML no longer part of Pure -- has to be loaded by object
6594 * added prems argument to simplification procedures;
6596 * HOL, FOL, ZF: added infix function `addsplits':
6597 instead of `<simpset> setloop (split_tac <thms>)'
6598 you can simply write `<simpset> addsplits <thms>'
6603 * TYPE('a) syntax for type reflection terms;
6605 * no longer handles consts with name "" -- declare as 'syntax' instead;
6607 * pretty printer: changed order of mixfix annotation preference (again!);
6609 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6614 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6615 with `addloop' of the simplifier to faciliate case splitting in premises.
6617 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6619 * HOL/Auth: new protocol proofs including some for the Internet
6622 * HOL/Map: new theory of `maps' a la VDM;
6624 * HOL/simplifier: simplification procedures nat_cancel_sums for
6625 cancelling out common nat summands from =, <, <= (in)equalities, or
6626 differences; simplification procedures nat_cancel_factor for
6627 cancelling common factor from =, <, <= (in)equalities over natural
6628 sums; nat_cancel contains both kinds of procedures, it is installed by
6629 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6631 * HOL/simplifier: terms of the form
6632 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6634 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6635 and those of the form
6636 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6638 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6641 Each datatype `t' now comes with a theorem `split_t_case' of the form
6643 P(t_case f1 ... fn x) =
6644 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6646 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6649 and a theorem `split_t_case_asm' of the form
6651 P(t_case f1 ... fn x) =
6652 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6654 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6656 which can be added to a simpset via `addsplits'. The existing theorems
6657 expand_list_case and expand_option_case have been renamed to
6658 split_list_case and split_option_case.
6661 - `pred n' is automatically converted to `n-1'.
6662 Users are strongly encouraged not to use `pred' any longer,
6663 because it will disappear altogether at some point.
6664 - Users are strongly encouraged to write "0 < n" rather than
6665 "n ~= 0". Theorems and proof tools have been modified towards this
6669 the function "set_of_list" has been renamed "set" (and its theorems too);
6670 the function "nth" now takes its arguments in the reverse order and
6671 has acquired the infix notation "!" as in "xs!n".
6673 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6675 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6676 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6678 * HOL/record: extensible records with schematic structural subtyping
6679 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6680 still lacks various theorems and concrete record syntax;
6685 * removed "axioms" and "generated by" sections;
6687 * replaced "ops" section by extended "consts" section, which is capable of
6688 handling the continuous function space "->" directly;
6691 . proves theorems immediately and stores them in the theory,
6692 . creates hierachical name space,
6693 . now uses normal mixfix annotations (instead of cinfix...),
6694 . minor changes to some names and values (for consistency),
6695 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6696 . separator between mutual domain defs: changed "," to "and",
6697 . improved handling of sort constraints; now they have to
6698 appear on the left-hand side of the equations only;
6700 * fixed LAM <x,y,zs>.b syntax;
6702 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6703 adm (%x. P (t x)), where P is chainfinite and t continuous;
6708 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6709 with `addloop' of the simplifier to faciliate case splitting in premises.
6711 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6712 in HOL, they strip ALL and --> from proved theorems;
6716 New in Isabelle94-8 (May 1997)
6717 ------------------------------
6719 *** General Changes ***
6721 * new utilities to build / run / maintain Isabelle etc. (in parts
6722 still somewhat experimental); old Makefiles etc. still functional;
6724 * new 'Isabelle System Manual';
6726 * INSTALL text, together with ./configure and ./build scripts;
6728 * reimplemented type inference for greater efficiency, better error
6729 messages and clean internal interface;
6731 * prlim command for dealing with lots of subgoals (an easier way of
6732 setting goals_limit);
6737 * supports alternative (named) syntax tables (parser and pretty
6738 printer); internal interface is provided by add_modesyntax(_i);
6740 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6741 be used in conjunction with the Isabelle symbol font; uses the
6742 "symbols" syntax table;
6744 * added token_translation interface (may translate name tokens in
6745 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6746 the current print_mode); IMPORTANT: user print translation functions
6747 are responsible for marking newly introduced bounds
6748 (Syntax.mark_boundT);
6750 * token translations for modes "xterm" and "xterm_color" that display
6751 names in bold, underline etc. or colors (which requires a color
6754 * infixes may now be declared with names independent of their syntax;
6756 * added typed_print_translation (like print_translation, but may
6757 access type of constant);
6760 *** Classical Reasoner ***
6762 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6763 some limitations. Blast_tac...
6764 + ignores addss, addbefore, addafter; this restriction is intrinsic
6765 + ignores elimination rules that don't have the correct format
6766 (the conclusion MUST be a formula variable)
6767 + ignores types, which can make HOL proofs fail
6768 + rules must not require higher-order unification, e.g. apply_type in ZF
6769 [message "Function Var's argument not a bound variable" relates to this]
6770 + its proof strategy is more general but can actually be slower
6772 * substitution with equality assumptions no longer permutes other
6775 * minor changes in semantics of addafter (now called addaltern); renamed
6776 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6777 (and access functions for it);
6779 * improved combination of classical reasoner and simplifier:
6780 + functions for handling clasimpsets
6781 + improvement of addss: now the simplifier is called _after_ the
6783 + safe variant of addss called addSss: uses safe simplifications
6784 _during_ the safe steps. It is more complete as it allows multiple
6785 instantiations of unknowns (e.g. with slow_tac).
6789 * added interface for simplification procedures (functions that
6790 produce *proven* rewrite rules on the fly, depending on current
6793 * ordering on terms as parameter (used for ordered rewriting);
6795 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6797 * the solver is now split into a safe and an unsafe part.
6798 This should be invisible for the normal user, except that the
6799 functions setsolver and addsolver have been renamed to setSolver and
6800 addSolver; added safe_asm_full_simp_tac;
6805 * a generic induction tactic `induct_tac' which works for all datatypes and
6806 also for type `nat';
6808 * a generic case distinction tactic `exhaust_tac' which works for all
6809 datatypes and also for type `nat';
6811 * each datatype comes with a function `size';
6813 * patterns in case expressions allow tuple patterns as arguments to
6814 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6816 * primrec now also works with type nat;
6818 * recdef: a new declaration form, allows general recursive functions to be
6819 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6821 * the constant for negation has been renamed from "not" to "Not" to
6822 harmonize with FOL, ZF, LK, etc.;
6824 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6827 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6829 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6830 problems in commutative rings, using axiomatic type classes for + and *;
6832 * more examples in HOL/MiniML and HOL/Auth;
6834 * more default rewrite rules for quantifiers, union/intersection;
6836 * a new constant `arbitrary == @x.False';
6838 * HOLCF/IOA replaces old HOL/IOA;
6840 * HOLCF changes: derived all rules and arities
6841 + axiomatic type classes instead of classes
6842 + typedef instead of faking type definitions
6843 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6844 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6845 + eliminated the types void, one, tr
6846 + use unit lift and bool lift (with translations) instead of one and tr
6847 + eliminated blift from Lift3.thy (use Def instead of blift)
6848 all eliminated rules are derived as theorems --> no visible changes ;
6853 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6854 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6855 as ZF_cs addSIs [equalityI];
6859 New in Isabelle94-7 (November 96)
6860 ---------------------------------
6862 * allowing negative levels (as offsets) in prlev and choplev;
6864 * super-linear speedup for large simplifications;
6866 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6867 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6868 FAIL); can suppress it using the command Delsimps (ex_simps @
6869 all_simps); De Morgan laws are also now included, by default;
6871 * improved printing of ==> : ~:
6873 * new object-logic "Sequents" adds linear logic, while replacing LK
6874 and Modal (thanks to Sara Kalvala);
6876 * HOL/Auth: correctness proofs for authentication protocols;
6878 * HOL: new auto_tac combines rewriting and classical reasoning (many
6879 examples on HOL/Auth);
6881 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6882 the rewriter and classical reasoner simultaneously;
6884 * function uresult no longer returns theorems in "standard" format;
6885 regain previous version by: val uresult = standard o uresult;
6892 * oracles -- these establish an interface between Isabelle and trusted
6893 external reasoners, which may deliver results as theorems;
6895 * proof objects (in particular record all uses of oracles);
6897 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6899 * "constdefs" section in theory files;
6901 * "primrec" section (HOL) no longer requires names;
6903 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6910 * reduced space requirements;
6912 * automatic HTML generation from theories;
6914 * theory files no longer require "..." (quotes) around most types;
6916 * new examples, including two proofs of the Church-Rosser theorem;
6918 * non-curried (1994) version of HOL is no longer distributed;
6925 * greatly reduced space requirements;
6927 * theory files (.thy) no longer require \...\ escapes at line breaks;
6929 * searchable theorem database (see the section "Retrieving theorems" on
6930 page 8 of the Reference Manual);
6932 * new examples, including Grabczewski's monumental case study of the
6935 * The previous version of HOL renamed to Old_HOL;
6937 * The new version of HOL (previously called CHOL) uses a curried syntax
6938 for functions. Application looks like f a b instead of f(a,b);
6940 * Mutually recursive inductive definitions finally work in HOL;
6942 * In ZF, pattern-matching on tuples is now available in all abstractions and
6943 translates to the operator "split";
6950 * new infix operator, addss, allowing the classical reasoner to
6951 perform simplification at each step of its search. Example:
6952 fast_tac (cs addss ss)
6954 * a new logic, CHOL, the same as HOL, but with a curried syntax
6955 for functions. Application looks like f a b instead of f(a,b). Also pairs
6956 look like (a,b) instead of <a,b>;
6958 * PLEASE NOTE: CHOL will eventually replace HOL!
6960 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6961 It translates to the operator "split". A new theory of integers is available;
6963 * In ZF, integer numerals now denote two's-complement binary integers.
6964 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6966 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6967 of the Axiom of Choice;
6974 * Significantly faster resolution;
6976 * the different sections in a .thy file can now be mixed and repeated
6979 * Database of theorems for FOL, HOL and ZF. New
6980 commands including qed, qed_goal and bind_thm store theorems in the database.
6982 * Simple database queries: return a named theorem (get_thm) or all theorems of
6983 a given theory (thms_of), or find out what theory a theorem was proved in
6986 * Bugs fixed in the inductive definition and datatype packages;
6988 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
6989 and HOL_dup_cs obsolete;
6991 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
6994 * Simpler definition of function space in ZF;
6996 * new results about cardinal and ordinal arithmetic in ZF;
6998 * 'subtype' facility in HOL for introducing new types as subsets of existing
7001 :mode=text:wrap=hard:maxLineLen=72: