1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Schematic theorem statements need to be explicitly markup as such,
10 via commands 'schematic_lemma', 'schematic_theorem',
11 'schematic_corollary'. Thus the relevance of the proof is made
12 syntactically clear, which impacts performance in a parallel or
13 asynchronous interactive environment. Minor INCOMPATIBILITY.
15 * Authentic syntax for *all* logical entities (type classes, type
16 constructors, term constants): provides simple and robust
17 correspondence between formal entities and concrete syntax. Within
18 the parse tree / AST representations, "constants" are decorated by
19 their category (class, type, const) and spelled out explicitly with
20 their full internal name.
22 Substantial INCOMPATIBILITY concerning low-level syntax declarations
23 and translations (translation rules and translation functions in ML).
24 Some hints on upgrading:
26 - Many existing uses of 'syntax' and 'translations' can be replaced
27 by more modern 'type_notation', 'notation' and 'abbreviation',
28 which are independent of this issue.
30 - 'translations' require markup within the AST; the term syntax
31 provides the following special forms:
33 CONST c -- produces syntax version of constant c from context
34 XCONST c -- literally c, checked as constant from context
35 c -- literally c, if declared by 'syntax'
37 Plain identifiers are treated as AST variables -- occasionally the
38 system indicates accidental variables via the error "rhs contains
41 Type classes and type constructors are marked according to their
42 concrete syntax. Some old translations rules need to be written
43 for the "type" category, using type constructor application
44 instead of pseudo-term application of the default category
47 - 'parse_translation' etc. in ML may use the following
50 @{class_syntax c} -- type class c within parse tree / AST
51 @{term_syntax c} -- type constructor c within parse tree / AST
52 @{const_syntax c} -- ML version of "CONST c" above
53 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
55 - Literal types within 'typed_print_translations', i.e. those *not*
56 represented as pseudo-terms are represented verbatim. Use @{class
57 c} or @{type_name c} here instead of the above syntax
60 Note that old non-authentic syntax was based on unqualified base
61 names, so all of the above "constant" names would coincide. Recall
62 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
63 diagnose syntax problems.
65 * Type constructors admit general mixfix syntax, not just infix.
67 * Concrete syntax may be attached to local entities without a proof
68 body, too. This works via regular mixfix annotations for 'fix',
69 'def', 'obtain' etc. or via the explicit 'write' command, which is
70 similar to the 'notation' command in theory specifications.
72 * Use of cumulative prems via "!" in some proof methods has been
73 discontinued (legacy feature).
75 * References 'trace_simp' and 'debug_simp' have been replaced by
76 configuration options stored in the context. Enabling tracing (the
77 case of debugging is similar) in proofs works via
79 using [[trace_simp = true]]
81 Tracing is then active for all invocations of the simplifier in
82 subsequent goal refinement steps. Tracing may also still be enabled or
83 disabled via the ProofGeneral settings menu.
85 * Separate commands 'hide_class', 'hide_type', 'hide_const',
86 'hide_fact' replace the former 'hide' KIND command. Minor
92 * Predicates of locales introduces by classes carry a mandatory
93 "class" prefix. INCOMPATIBILITY.
95 * Command 'code_reflect' allows to incorporate generated ML code into
96 runtime environment; replaces immature code_datatype antiquotation.
99 * Empty class specifications observe default sort. INCOMPATIBILITY.
101 * Old 'axclass' command has been discontinued. Use 'class' instead.
104 * Code generator: simple concept for abstract datatypes obeying
107 * Local theory specifications may depend on extra type variables that
108 are not present in the result type -- arguments TYPE('a) :: 'a itself
109 are added internally. For example:
111 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
113 * Code generator: details of internal data cache have no impact on the
114 user space functionality any longer.
116 * Methods unfold_locales and intro_locales ignore non-locale subgoals.
117 This is more appropriate for interpretations with 'where'.
120 * Discontinued unnamed infix syntax (legacy feature for many years) --
121 need to specify constant name and syntax separately. Internal ML
122 datatype constructors have been renamed from InfixName to Infix etc.
123 Minor INCOMPATIBILITY.
125 * Command 'example_proof' opens an empty proof body. This allows to
126 experiment with Isar, without producing any persistent result.
128 * Commands 'type_notation' and 'no_type_notation' declare type syntax
129 within a local theory context, with explicit checking of the
130 constructors involved (in contrast to the raw 'syntax' versions).
132 * Commands 'types' and 'typedecl' now work within a local theory
133 context -- without introducing dependencies on parameters or
134 assumptions, which is not possible in Isabelle/Pure.
136 * Command 'defaultsort' has been renamed to 'default_sort', it works
137 within a local theory context. Minor INCOMPATIBILITY.
139 * Proof terms: Type substitutions on proof constants now use canonical
140 order of type variables. Potential INCOMPATIBILITY for tools working
146 * List membership infix mem operation is only an input abbreviation.
149 * Theory Library/Word.thy has been removed. Use library Word/Word.thy for
150 future developements; former Library/Word.thy is still present in the AFP
153 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
154 longer shadowed. INCOMPATIBILITY.
156 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
159 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
162 * Dropped normalizing_semiring etc; use the facts in semiring classes
163 instead. INCOMPATIBILITY.
165 * Dropped several real-specific versions of lemmas about floor and
166 ceiling; use the generic lemmas from Archimedean_Field.thy instead.
169 floor_number_of_eq ~> floor_number_of
170 le_floor_eq_number_of ~> number_of_le_floor
171 le_floor_eq_zero ~> zero_le_floor
172 le_floor_eq_one ~> one_le_floor
173 floor_less_eq_number_of ~> floor_less_number_of
174 floor_less_eq_zero ~> floor_less_zero
175 floor_less_eq_one ~> floor_less_one
176 less_floor_eq_number_of ~> number_of_less_floor
177 less_floor_eq_zero ~> zero_less_floor
178 less_floor_eq_one ~> one_less_floor
179 floor_le_eq_number_of ~> floor_le_number_of
180 floor_le_eq_zero ~> floor_le_zero
181 floor_le_eq_one ~> floor_le_one
182 floor_subtract_number_of ~> floor_diff_number_of
183 floor_subtract_one ~> floor_diff_one
184 ceiling_number_of_eq ~> ceiling_number_of
185 ceiling_le_eq_number_of ~> ceiling_le_number_of
186 ceiling_le_zero_eq ~> ceiling_le_zero
187 ceiling_le_eq_one ~> ceiling_le_one
188 less_ceiling_eq_number_of ~> number_of_less_ceiling
189 less_ceiling_eq_zero ~> zero_less_ceiling
190 less_ceiling_eq_one ~> one_less_ceiling
191 ceiling_less_eq_number_of ~> ceiling_less_number_of
192 ceiling_less_eq_zero ~> ceiling_less_zero
193 ceiling_less_eq_one ~> ceiling_less_one
194 le_ceiling_eq_number_of ~> number_of_le_ceiling
195 le_ceiling_eq_zero ~> zero_le_ceiling
196 le_ceiling_eq_one ~> one_le_ceiling
197 ceiling_subtract_number_of ~> ceiling_diff_number_of
198 ceiling_subtract_one ~> ceiling_diff_one
200 * Theory 'Finite_Set': various folding_XXX locales facilitate the
201 application of the various fold combinators on finite sets.
203 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
204 provides abstract red-black tree type which is backed by "RBT_Impl" as
205 implementation. INCOMPATIBILTY.
207 * Command 'typedef' now works within a local theory context -- without
208 introducing dependencies on parameters or assumptions, which is not
209 possible in Isabelle/Pure/HOL. Note that the logical environment may
210 contain multiple interpretations of local typedefs (with different
211 non-emptiness proofs), even in a global theory context.
213 * Theory Library/Coinductive_List has been removed -- superseded by
214 AFP/thys/Coinductive.
216 * Theory PReal, including the type "preal" and related operations, has
217 been removed. INCOMPATIBILITY.
219 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
220 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
222 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
223 "Int" etc. INCOMPATIBILITY.
225 * New set of rules "ac_simps" provides combined assoc / commute
226 rewrites for all interpretations of the appropriate generic locales.
228 * Renamed theory "OrderedGroup" to "Groups" and split theory
229 "Ring_and_Field" into theories "Rings" and "Fields"; for more
230 appropriate and more consistent names suitable for name prefixes
231 within the HOL theories. INCOMPATIBILITY.
233 * Some generic constants have been put to appropriate theories:
234 - less_eq, less: Orderings
235 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
236 - inverse, divide: Rings
239 * More consistent naming of type classes involving orderings (and
242 lower_semilattice ~> semilattice_inf
243 upper_semilattice ~> semilattice_sup
245 dense_linear_order ~> dense_linorder
247 pordered_ab_group_add ~> ordered_ab_group_add
248 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
249 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
250 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
251 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
252 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
253 pordered_cancel_semiring ~> ordered_cancel_semiring
254 pordered_comm_monoid_add ~> ordered_comm_monoid_add
255 pordered_comm_ring ~> ordered_comm_ring
256 pordered_comm_semiring ~> ordered_comm_semiring
257 pordered_ring ~> ordered_ring
258 pordered_ring_abs ~> ordered_ring_abs
259 pordered_semiring ~> ordered_semiring
261 ordered_ab_group_add ~> linordered_ab_group_add
262 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
263 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
264 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
265 ordered_field ~> linordered_field
266 ordered_field_no_lb ~> linordered_field_no_lb
267 ordered_field_no_ub ~> linordered_field_no_ub
268 ordered_field_dense_linear_order ~> dense_linordered_field
269 ordered_idom ~> linordered_idom
270 ordered_ring ~> linordered_ring
271 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
272 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
273 ordered_ring_strict ~> linordered_ring_strict
274 ordered_semidom ~> linordered_semidom
275 ordered_semiring ~> linordered_semiring
276 ordered_semiring_1 ~> linordered_semiring_1
277 ordered_semiring_1_strict ~> linordered_semiring_1_strict
278 ordered_semiring_strict ~> linordered_semiring_strict
280 The following slightly odd type classes have been moved to a
281 separate theory Library/Lattice_Algebras.thy:
283 lordered_ab_group_add ~> lattice_ab_group_add
284 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
285 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
286 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
287 lordered_ring ~> lattice_ring
291 * Refined field classes:
292 - classes division_ring_inverse_zero, field_inverse_zero,
293 linordered_field_inverse_zero include rule inverse 0 = 0 --
294 subsumes former division_by_zero class;
295 - numerous lemmas have been ported from field to division_ring.
298 * Refined algebra theorem collections:
299 - dropped theorem group group_simps, use algebra_simps instead;
300 - dropped theorem group ring_simps, use field_simps instead;
301 - proper theorem collection field_simps subsumes former theorem
302 groups field_eq_simps and field_simps;
303 - dropped lemma eq_minus_self_iff which is a duplicate for
307 * Theory Finite_Set and List: some lemmas have been generalized from
310 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
311 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
312 inter_Inter_fold_inter ~> inf_Inf_fold_inf
313 union_Union_fold_union ~> sup_Sup_fold_sup
314 Inter_fold_inter ~> Inf_fold_inf
315 Union_fold_union ~> Sup_fold_sup
316 inter_INTER_fold_inter ~> inf_INFI_fold_inf
317 union_UNION_fold_union ~> sup_SUPR_fold_sup
318 INTER_fold_inter ~> INFI_fold_inf
319 UNION_fold_union ~> SUPR_fold_sup
321 * Theory Complete_Lattice: lemmas top_def and bot_def have been
322 replaced by the more convenient lemmas Inf_empty and Sup_empty.
323 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
324 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
325 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
326 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
328 * HOLogic.strip_psplit: types are returned in syntactic order, similar
329 to other strip and tuple operations. INCOMPATIBILITY.
331 * Reorganized theory Multiset: swapped notation of pointwise and
333 - pointwise ordering is instance of class order with standard syntax
335 - multiset ordering has syntax <=# and <#; partial order properties
336 are provided by means of interpretation with prefix
338 - less duplication, less historical organization of sections,
339 conversion from associations lists to multisets, rudimentary code
341 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
344 multiset_eq_conv_count_eq -> multiset_ext_iff
345 multi_count_ext -> multiset_ext
346 diff_union_inverse2 -> diff_union_cancelR
349 * Theory Permutation: replaced local "remove" by List.remove1.
351 * Code generation: ML and OCaml code is decorated with signatures.
353 * Theory List: added transpose.
355 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
356 clash with new theory Quotient in Main HOL.
358 * Library/Nat_Bijection.thy is a collection of bijective functions
359 between nat and other types, which supersedes the older libraries
360 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
363 Nat_Int_Bij.nat2_to_nat ~> prod_encode
364 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
365 Nat_Int_Bij.int_to_nat_bij ~> int_encode
366 Nat_Int_Bij.nat_to_int_bij ~> int_decode
367 Countable.pair_encode ~> prod_encode
368 NatIso.prod2nat ~> prod_encode
369 NatIso.nat2prod ~> prod_decode
370 NatIso.sum2nat ~> sum_encode
371 NatIso.nat2sum ~> sum_decode
372 NatIso.list2nat ~> list_encode
373 NatIso.nat2list ~> list_decode
374 NatIso.set2nat ~> set_encode
375 NatIso.nat2set ~> set_decode
378 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
379 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
380 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
381 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
382 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
383 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
384 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
385 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
386 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
387 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
388 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
389 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
390 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
393 - Renamed ATP commands:
394 atp_info ~> sledgehammer running_atps
395 atp_kill ~> sledgehammer kill_atps
396 atp_messages ~> sledgehammer messages
397 atp_minimize ~> sledgehammer minimize
398 print_atps ~> sledgehammer available_atps
400 - Added user's manual ("isabelle doc sledgehammer").
401 - Added option syntax and "sledgehammer_params" to customize
402 Sledgehammer's behavior. See the manual for details.
403 - Modified the Isar proof reconstruction code so that it produces
404 direct proofs rather than proofs by contradiction. (This feature
405 is still experimental.)
406 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
408 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
411 - Added and implemented "binary_ints" and "bits" options.
412 - Added "std" option and implemented support for nonstandard models.
413 - Added and implemented "finitize" option to improve the precision
414 of infinite datatypes based on a monotonicity analysis.
415 - Added support for quotient types.
416 - Added support for "specification" and "ax_specification"
418 - Added support for local definitions (for "function" and
419 "termination" proofs).
420 - Added support for term postprocessors.
421 - Optimized "Multiset.multiset" and "FinFun.finfun".
422 - Improved efficiency of "destroy_constrs" optimization.
423 - Fixed soundness bugs related to "destroy_constrs" optimization and
425 - Fixed soundness bug related to higher-order constructors
426 - Improved precision of set constructs.
427 - Added cache to speed up repeated Kodkod invocations on the same
429 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
430 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
431 "SAT4J_Light". INCOMPATIBILITY.
432 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
433 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
435 * Moved the SMT binding into the HOL image.
440 * Variable names in lemmas generated by the domain package have
441 changed; the naming scheme is now consistent with the HOL datatype
442 package. Some proof scripts may be affected, INCOMPATIBILITY.
444 * The domain package no longer defines the function "foo_copy" for
445 recursive domain "foo". The reach lemma is now stated directly in
446 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
447 be reformulated in terms of "foo_take", INCOMPATIBILITY.
449 * Most definedness lemmas generated by the domain package (previously
450 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
451 like "foo$x = UU <-> x = UU", which works better as a simp rule.
452 Proof scripts that used definedness lemmas as intro rules may break,
453 potential INCOMPATIBILITY.
455 * Induction and casedist rules generated by the domain package now
456 declare proper case_names (one called "bottom", and one named for each
457 constructor). INCOMPATIBILITY.
459 * For mutually-recursive domains, separate "reach" and "take_lemma"
460 rules are generated for each domain, INCOMPATIBILITY.
462 foo_bar.reach ~> foo.reach bar.reach
463 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
465 * Some lemmas generated by the domain package have been renamed for
466 consistency with the datatype package, INCOMPATIBILITY.
468 foo.ind ~> foo.induct
469 foo.finite_ind ~> foo.finite_induct
470 foo.coind ~> foo.coinduct
471 foo.casedist ~> foo.exhaust
472 foo.exhaust ~> foo.nchotomy
474 * For consistency with other definition packages, the fixrec package
475 now generates qualified theorem names, INCOMPATIBILITY.
477 foo_simps ~> foo.simps
478 foo_unfold ~> foo.unfold
479 foo_induct ~> foo.induct
481 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
482 method and internal fixrec proofs now use the default simpset instead.
485 * The "contlub" predicate has been removed. Proof scripts should use
486 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
488 * The "admw" predicate has been removed, INCOMPATIBILITY.
490 * The constants cpair, cfst, and csnd have been removed in favor of
491 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
496 * Sorts.certify_sort and derived "cert" operations for types and terms
497 no longer minimize sorts. Thus certification at the boundary of the
498 inference kernel becomes invariant under addition of class relations,
499 which is an important monotonicity principle. Sorts are now minimized
500 in the syntax layer only, at the boundary between the end-user and the
501 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
502 explicitly in rare situations.
504 * Antiquotations for basic formal entities:
506 @{class NAME} -- type class
507 @{class_syntax NAME} -- syntax representation of the above
509 @{type_name NAME} -- logical type
510 @{type_abbrev NAME} -- type abbreviation
511 @{nonterminal NAME} -- type of concrete syntactic category
512 @{type_syntax NAME} -- syntax representation of any of the above
514 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
515 @{const_abbrev NAME} -- abbreviated constant
516 @{const_syntax NAME} -- syntax representation of any of the above
518 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
519 syntax constant (cf. 'syntax' command).
521 * Antiquotation @{make_string} inlines a function to print arbitrary
522 values similar to the ML toplevel. The result is compiler dependent
523 and may fall back on "?" in certain situations.
525 * Renamed old-style Drule.standard to Drule.export_without_context, to
526 emphasize that this is in no way a standard operation.
529 * Curried take and drop in library.ML; negative length is interpreted
530 as infinity (as in chop). INCOMPATIBILITY.
532 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
533 usual for resolution. Rare INCOMPATIBILITY.
535 * Discontinued old TheoryDataFun with its copy/init operation -- data
536 needs to be pure. Functor Theory_Data_PP retains the traditional
537 Pretty.pp argument to merge, which is absent in the standard
540 * Renamed varify/unvarify operations to varify_global/unvarify_global
541 to emphasize that these only work in a global situation (which is
544 * Configuration options now admit dynamic default values, depending on
545 the context or even global references.
547 * Most operations that refer to a global context are named
548 accordingly, e.g. Simplifier.global_context or
549 ProofContext.init_global. There are some situations where a global
550 context actually works, but under normal circumstances one needs to
551 pass the proper local context through the code!
553 * Renamed some important ML structures, while keeping the old names
554 for some time as aliases within the structure Legacy:
556 OuterKeyword ~> Keyword
559 OuterSyntax ~> Outer_Syntax
560 SpecParse ~> Parse_Spec
562 Note that "open Legacy" simplifies porting of sources, but forgetting
563 to remove it again will complicate porting again in the future.
568 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
569 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
570 proof terms are enabled unconditionally in the new HOL-Proofs image.
572 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
573 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
576 * Old lib/scripts/polyml-platform is superseded by the
577 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
578 variant, even on a 64 bit machine. The following example setting
579 prefers 64 bit if available:
581 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
585 New in Isabelle2009-1 (December 2009)
586 -------------------------------------
590 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
591 one backslash should be used, even in ML sources.
596 * Locale interpretation propagates mixins along the locale hierarchy.
597 The currently only available mixins are the equations used to map
598 local definitions to terms of the target domain of an interpretation.
600 * Reactivated diagnostic command 'print_interps'. Use "print_interps
601 loc" to print all interpretations of locale "loc" in the theory.
602 Interpretations in proofs are not shown.
604 * Thoroughly revised locales tutorial. New section on conditional
607 * On instantiation of classes, remaining undefined class parameters
608 are formally declared. INCOMPATIBILITY.
611 *** Document preparation ***
613 * New generalized style concept for printing terms: @{foo (style) ...}
614 instead of @{foo_style style ...} (old form is still retained for
615 backward compatibility). Styles can be also applied for
616 antiquotations prop, term_type and typeof.
621 * New proof method "smt" for a combination of first-order logic with
622 equality, linear and nonlinear (natural/integer/real) arithmetic, and
623 fixed-size bitvectors; there is also basic support for higher-order
624 features (esp. lambda abstractions). It is an incomplete decision
625 procedure based on external SMT solvers using the oracle mechanism;
626 for the SMT solver Z3, this method is proof-producing. Certificates
627 are provided to avoid calling the external solvers solely for
628 re-checking proofs. Due to a remote SMT service there is no need for
629 installing SMT solvers locally. See src/HOL/SMT.
631 * New commands to load and prove verification conditions generated by
632 the Boogie program verifier or derived systems (e.g. the Verifying C
633 Compiler (VCC) or Spec#). See src/HOL/Boogie.
635 * New counterexample generator tool 'nitpick' based on the Kodkod
636 relational model finder. See src/HOL/Tools/Nitpick and
637 src/HOL/Nitpick_Examples.
639 * New commands 'code_pred' and 'values' to invoke the predicate
640 compiler and to enumerate values of inductive predicates.
642 * A tabled implementation of the reflexive transitive closure.
644 * New implementation of quickcheck uses generic code generator;
645 default generators are provided for all suitable HOL types, records
646 and datatypes. Old quickcheck can be re-activated importing theory
647 Library/SML_Quickcheck.
649 * New testing tool Mirabelle for automated proof tools. Applies
650 several tools and tactics like sledgehammer, metis, or quickcheck, to
651 every proof step in a theory. To be used in batch mode via the
654 * New proof method "sos" (sum of squares) for nonlinear real
655 arithmetic (originally due to John Harison). It requires theory
656 Library/Sum_Of_Squares. It is not a complete decision procedure but
657 works well in practice on quantifier-free real arithmetic with +, -,
658 *, ^, =, <= and <, i.e. boolean combinations of equalities and
659 inequalities between polynomials. It makes use of external
660 semidefinite programming solvers. Method "sos" generates a
661 certificate that can be pasted into the proof thus avoiding the need
662 to call an external tool every time the proof is checked. See
663 src/HOL/Library/Sum_Of_Squares.
665 * New method "linarith" invokes existing linear arithmetic decision
668 * New command 'atp_minimal' reduces result produced by Sledgehammer.
670 * New Sledgehammer option "Full Types" in Proof General settings menu.
671 Causes full type information to be output to the ATPs. This slows
672 ATPs down considerably but eliminates a source of unsound "proofs"
675 * New method "metisFT": A version of metis that uses full type
676 information in order to avoid failures of proof reconstruction.
678 * New evaluator "approximate" approximates an real valued term using
679 the same method as the approximation method.
681 * Method "approximate" now supports arithmetic expressions as
682 boundaries of intervals and implements interval splitting and Taylor
685 * ML antiquotation @{code_datatype} inserts definition of a datatype
686 generated by the code generator; e.g. see src/HOL/Predicate.thy.
688 * New theory SupInf of the supremum and infimum operators for sets of
691 * New theory Probability, which contains a development of measure
692 theory, eventually leading to Lebesgue integration and probability.
694 * Extended Multivariate Analysis to include derivation and Brouwer's
697 * Reorganization of number theory, INCOMPATIBILITY:
698 - new number theory development for nat and int, in theories Divides
699 and GCD as well as in new session Number_Theory
700 - some constants and facts now suffixed with _nat and _int
702 - former session NumberTheory now named Old_Number_Theory, including
703 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
704 - moved theory Pocklington from src/HOL/Library to
705 src/HOL/Old_Number_Theory
707 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
708 lcm of finite and infinite sets. It is shown that they form a complete
711 * Class semiring_div requires superclass no_zero_divisors and proof of
712 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
713 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
714 generalized to class semiring_div, subsuming former theorems
715 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
716 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
719 * Refinements to lattice classes and sets:
720 - less default intro/elim rules in locale variant, more default
721 intro/elim rules in class variant: more uniformity
722 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
724 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
726 - renamed ACI to inf_sup_aci
727 - new class "boolean_algebra"
728 - class "complete_lattice" moved to separate theory
729 "Complete_Lattice"; corresponding constants (and abbreviations)
730 renamed and with authentic syntax:
731 Set.Inf ~> Complete_Lattice.Inf
732 Set.Sup ~> Complete_Lattice.Sup
733 Set.INFI ~> Complete_Lattice.INFI
734 Set.SUPR ~> Complete_Lattice.SUPR
735 Set.Inter ~> Complete_Lattice.Inter
736 Set.Union ~> Complete_Lattice.Union
737 Set.INTER ~> Complete_Lattice.INTER
738 Set.UNION ~> Complete_Lattice.UNION
739 - authentic syntax for
742 - mere abbreviations:
745 Set.inter (for inf, formerly Set.Int)
746 Set.union (for sup, formerly Set.Un)
747 Complete_Lattice.Inter (for Inf)
748 Complete_Lattice.Union (for Sup)
749 Complete_Lattice.INTER (for INFI)
750 Complete_Lattice.UNION (for SUPR)
751 - object-logic definitions as far as appropriate
753 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
754 Un_subset_iff are explicitly deleted as default simp rules; then also
755 their lattice counterparts le_inf_iff and le_sup_iff have to be
756 deleted to achieve the desired effect.
758 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
759 rules by default any longer; the same applies to min_max.inf_absorb1
760 etc. INCOMPATIBILITY.
762 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
763 pred_set_conv by default. INCOMPATIBILITY.
765 * Power operations on relations and functions are now one dedicated
766 constant "compow" with infix syntax "^^". Power operation on
767 multiplicative monoids retains syntax "^" and is now defined generic
768 in class power. INCOMPATIBILITY.
770 * Relation composition "R O S" now has a more standard argument order:
771 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
772 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
773 break, since the O_assoc rule was not rewritten like this. Fix using
774 O_assoc[symmetric]. The same applies to the curried version "R OO S".
776 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
777 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
780 * Most rules produced by inductive and datatype package have mandatory
781 prefixes. INCOMPATIBILITY.
783 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
784 the attribute of the same name. Each of the theorems in the list
785 DERIV_intros assumes composition with an additional function and
786 matches a variable to the derivative, which has to be solved by the
787 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
788 of most elementary terms. Former Maclauren.DERIV_tac and
789 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
792 * Code generator attributes follow the usual underscore convention:
793 code_unfold replaces code unfold
794 code_post replaces code post
799 sizechange -> size_change
800 induct_scheme -> induction_schema
803 * Discontinued abbreviation "arbitrary" of constant "undefined".
804 INCOMPATIBILITY, use "undefined" directly.
807 Suc_eq_add_numeral_1 -> Suc_eq_plus1
808 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
809 Suc_plus1 -> Suc_eq_plus1
810 *anti_sym -> *antisym*
811 vector_less_eq_def -> vector_le_def
814 * Added theorem List.map_map as [simp]. Removed List.map_compose.
817 * Removed predicate "M hassize n" (<--> card M = n & finite M).
823 * Theory Representable defines a class "rep" of domains that are
824 representable (via an ep-pair) in the universal domain type "udom".
825 Instances are provided for all type constructors defined in HOLCF.
827 * The 'new_domain' command is a purely definitional version of the
828 domain package, for representable domains. Syntax is identical to the
829 old domain package. The 'new_domain' package also supports indirect
830 recursion using previously-defined type constructors. See
831 src/HOLCF/ex/New_Domain.thy for examples.
833 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
834 on the left-hand side of an equation, and then performs
835 simplification. Rewriting is done using rules declared with the
836 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
837 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
839 * The pattern-match compiler in 'fixrec' can now handle constructors
840 with HOL function types. Pattern-match combinators for the Pair
841 constructor are pre-configured.
843 * The 'fixrec' package now produces better fixed-point induction rules
844 for mutually-recursive definitions: Induction rules have conclusions
845 of the form "P foo bar" instead of "P <foo, bar>".
847 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
848 been renamed to "below". The name "below" now replaces "less" in many
849 theorem names. (Legacy theorem names using "less" are still supported
852 * The 'fixrec' package now supports "bottom patterns". Bottom
853 patterns can be used to generate strictness rules, or to make
854 functions more strict (much like the bang-patterns supported by the
855 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
861 * Support for Poly/ML 5.3.0, with improved reporting of compiler
862 errors and run-time exceptions, including detailed source positions.
864 * Structure Name_Space (formerly NameSpace) now manages uniquely
865 identified entries, with some additional information such as source
866 position, logical grouping etc.
868 * Theory and context data is now introduced by the simplified and
869 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
870 to be pure, but the old TheoryDataFun for mutable data (with explicit
871 copy operation) is still available for some time.
873 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
874 provides a high-level programming interface to synchronized state
875 variables with atomic update. This works via pure function
876 application within a critical section -- its runtime should be as
877 short as possible; beware of deadlocks if critical code is nested,
878 either directly or indirectly via other synchronized variables!
880 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
881 wraps raw ML references, explicitly indicating their non-thread-safe
882 behaviour. The Isar toplevel keeps this structure open, to
883 accommodate Proof General as well as quick and dirty interactive
884 experiments with references.
886 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
887 parallel tactical reasoning.
889 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
890 are similar to SUBPROOF, but are slightly more flexible: only the
891 specified parts of the subgoal are imported into the context, and the
892 body tactic may introduce new subgoals and schematic variables.
894 * Old tactical METAHYPS, which does not observe the proof context, has
895 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
896 or Subgoal.FOCUS etc.
898 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
899 functors have their own ML name space there is no point to mark them
900 separately.) Minor INCOMPATIBILITY.
902 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
904 * Renamed several structures FooBar to Foo_Bar. Occasional,
907 * Operations of structure Skip_Proof no longer require quick_and_dirty
908 mode, which avoids critical setmp.
910 * Eliminated old Attrib.add_attributes, Method.add_methods and related
911 combinators for "args". INCOMPATIBILITY, need to use simplified
912 Attrib/Method.setup introduced in Isabelle2009.
914 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
915 back on global_simpset_of, global_claset_of, global_clasimpset_of as
916 last resort. INCOMPATIBILITY.
918 * Display.pretty_thm now requires a proper context (cf. former
919 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
920 or even Display.pretty_thm_without_context as last resort.
923 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
924 Syntax.pretty_typ/term directly, preferably with proper context
925 instead of global theory.
930 * Further fine tuning of parallel proof checking, scales up to 8 cores
931 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
934 * Support for additional "Isabelle components" via etc/components, see
935 also the system manual.
937 * The isabelle makeall tool now operates on all components with
938 IsaMakefile, not just hardwired "logics".
940 * Removed "compress" option from isabelle-process and isabelle usedir;
941 this is always enabled.
943 * Discontinued support for Poly/ML 4.x versions.
945 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
946 on a given logic image. This requires the lighttpd webserver and is
947 currently supported on Linux only.
951 New in Isabelle2009 (April 2009)
952 --------------------------------
956 * Simplified main Isabelle executables, with less surprises on
957 case-insensitive file-systems (such as Mac OS).
959 - The main Isabelle tool wrapper is now called "isabelle" instead of
962 - The former "isabelle" alias for "isabelle-process" has been
963 removed (should rarely occur to regular users).
965 - The former "isabelle-interface" and its alias "Isabelle" have been
966 removed (interfaces are now regular Isabelle tools).
968 Within scripts and make files, the Isabelle environment variables
969 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
970 respectively. (The latter are still available as legacy feature.)
972 The old isabelle-interface wrapper could react in confusing ways if
973 the interface was uninstalled or changed otherwise. Individual
974 interface tool configuration is now more explicit, see also the
975 Isabelle system manual. In particular, Proof General is now available
976 via "isabelle emacs".
978 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
979 purge installed copies of Isabelle executables and re-run "isabelle
980 install -p ...", or use symlinks.
982 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
983 old ~/isabelle, which was slightly non-standard and apt to cause
984 surprises on case-insensitive file-systems (such as Mac OS).
986 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
987 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
988 care is required when using older releases of Isabelle. Note that
989 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
990 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
992 * Proofs of fully specified statements are run in parallel on
993 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
994 a regular 4-core machine, if the initial heap space is made reasonably
995 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
997 * The main reference manuals ("isar-ref", "implementation", and
998 "system") have been updated and extended. Formally checked references
999 as hyperlinks are now available uniformly.
1004 * Complete re-implementation of locales. INCOMPATIBILITY in several
1005 respects. The most important changes are listed below. See the
1006 Tutorial on Locales ("locales" manual) for details.
1008 - In locale expressions, instantiation replaces renaming. Parameters
1009 must be declared in a for clause. To aid compatibility with previous
1010 parameter inheritance, in locale declarations, parameters that are not
1011 'touched' (instantiation position "_" or omitted) are implicitly added
1012 with their syntax at the beginning of the for clause.
1014 - Syntax from abbreviations and definitions in locales is available in
1015 locale expressions and context elements. The latter is particularly
1016 useful in locale declarations.
1018 - More flexible mechanisms to qualify names generated by locale
1019 expressions. Qualifiers (prefixes) may be specified in locale
1020 expressions, and can be marked as mandatory (syntax: "name!:") or
1021 optional (syntax "name?:"). The default depends for plain "name:"
1022 depends on the situation where a locale expression is used: in
1023 commands 'locale' and 'sublocale' prefixes are optional, in
1024 'interpretation' and 'interpret' prefixes are mandatory. The old
1025 implicit qualifiers derived from the parameter names of a locale are
1026 no longer generated.
1028 - Command "sublocale l < e" replaces "interpretation l < e". The
1029 instantiation clause in "interpretation" and "interpret" (square
1030 brackets) is no longer available. Use locale expressions.
1032 - When converting proof scripts, mandatory qualifiers in
1033 'interpretation' and 'interpret' should be retained by default, even
1034 if this is an INCOMPATIBILITY compared to former behavior. In the
1035 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1036 in locale expressions range over a single locale instance only.
1038 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1039 In existing theorem specifications replace the includes element by the
1040 respective context elements of the included locale, omitting those
1041 that are already present in the theorem specification. Multiple
1042 assume elements of a locale should be replaced by a single one
1043 involving the locale predicate. In the proof body, declarations (most
1044 notably theorems) may be regained by interpreting the respective
1045 locales in the proof context as required (command "interpret").
1047 If using "includes" in replacement of a target solely because the
1048 parameter types in the theorem are not as general as in the target,
1049 consider declaring a new locale with additional type constraints on
1050 the parameters (context element "constrains").
1052 - Discontinued "locale (open)". INCOMPATIBILITY.
1054 - Locale interpretation commands no longer attempt to simplify goal.
1055 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1056 methods intro_locales and unfold_locales to clarify.
1058 - Locale interpretation commands no longer accept interpretation
1059 attributes. INCOMPATIBILITY.
1061 * Class declaration: so-called "base sort" must not be given in import
1062 list any longer, but is inferred from the specification. Particularly
1069 class foo = type + ...
1071 * Class target: global versions of theorems stemming do not carry a
1072 parameter prefix any longer. INCOMPATIBILITY.
1074 * Class 'instance' command no longer accepts attached definitions.
1075 INCOMPATIBILITY, use proper 'instantiation' target instead.
1077 * Recovered hiding of consts, which was accidentally broken in
1078 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1079 makes c inaccessible; consider using ``hide (open) const c'' instead.
1081 * Slightly more coherent Pure syntax, with updated documentation in
1082 isar-ref manual. Removed locales meta_term_syntax and
1083 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1084 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1085 directly in regular applications.
1087 * There is a new syntactic category "float_const" for signed decimal
1088 fractions (e.g. 123.45 or -123.45).
1090 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1091 interface with 'setup' command instead.
1093 * Command 'local_setup' is similar to 'setup', but operates on a local
1096 * The 'axiomatization' command now only works within a global theory
1097 context. INCOMPATIBILITY.
1099 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1100 hypotheses. Sorts required in the course of reasoning need to be
1101 covered by the constraints in the initial statement, completed by the
1102 type instance information of the background theory. Non-trivial sort
1103 hypotheses, which rarely occur in practice, may be specified via
1104 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1106 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1108 The result contains an implicit sort hypotheses as before --
1109 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1112 * Generalized Isar history, with support for linear undo, direct state
1115 * Changed defaults for unify configuration options:
1117 unify_trace_bound = 50 (formerly 25)
1118 unify_search_bound = 60 (formerly 30)
1120 * Different bookkeeping for code equations (INCOMPATIBILITY):
1122 a) On theory merge, the last set of code equations for a particular
1123 constant is taken (in accordance with the policy applied by other
1124 parts of the code generator framework).
1126 b) Code equations stemming from explicit declarations (e.g. code
1127 attribute) gain priority over default code equations stemming
1128 from definition, primrec, fun etc.
1130 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1132 * Unified theorem tables for both code generators. Thus [code
1133 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1135 * Command 'find_consts' searches for constants based on type and name
1138 find_consts "_ => bool"
1140 By default, matching is against subtypes, but it may be restricted to
1141 the whole type. Searching by name is possible. Multiple queries are
1142 conjunctive and queries may be negated by prefixing them with a
1145 find_consts strict: "_ => bool" name: "Int" -"int => int"
1147 * New 'find_theorems' criterion "solves" matches theorems that
1148 directly solve the current goal (modulo higher-order unification).
1150 * Auto solve feature for main theorem statements: whenever a new goal
1151 is stated, "find_theorems solves" is called; any theorems that could
1152 solve the lemma directly are listed as part of the goal state.
1153 Cf. associated options in Proof General Isabelle settings menu,
1154 enabled by default, with reasonable timeout for pathological cases of
1155 higher-order unification.
1158 *** Document preparation ***
1160 * Antiquotation @{lemma} now imitates a regular terminal proof,
1161 demanding keyword 'by' and supporting the full method expression
1162 syntax just like the Isar command 'by'.
1167 * Integrated main parts of former image HOL-Complex with HOL. Entry
1168 points Main and Complex_Main remain as before.
1170 * Logic image HOL-Plain provides a minimal HOL with the most important
1171 tools available (inductive, datatype, primrec, ...). This facilitates
1172 experimentation and tool development. Note that user applications
1173 (and library theories) should never refer to anything below theory
1176 * Logic image HOL-Main stops at theory Main, and thus facilitates
1177 experimentation due to shorter build times.
1179 * Logic image HOL-NSA contains theories of nonstandard analysis which
1180 were previously part of former HOL-Complex. Entry point Hyperreal
1181 remains valid, but theories formerly using Complex_Main should now use
1182 new entry point Hypercomplex.
1184 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1185 Posix processes. Avoids potentially expensive forking of the ML
1186 process. New thread-based implementation also works on non-Unix
1187 platforms (Cygwin). Provers are no longer hardwired, but defined
1188 within the theory via plain ML wrapper functions. Basic Sledgehammer
1189 commands are covered in the isar-ref manual.
1191 * Wrapper scripts for remote SystemOnTPTP service allows to use
1192 sledgehammer without local ATP installation (Vampire etc.). Other
1193 provers may be included via suitable ML wrappers, see also
1194 src/HOL/ATP_Linkup.thy.
1196 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1199 * The metis method no longer fails because the theorem is too trivial
1200 (contains the empty clause).
1202 * The metis method now fails in the usual manner, rather than raising
1203 an exception, if it determines that it cannot prove the theorem.
1205 * Method "coherent" implements a prover for coherent logic (see also
1206 src/Tools/coherent.ML).
1208 * Constants "undefined" and "default" replace "arbitrary". Usually
1209 "undefined" is the right choice to replace "arbitrary", though
1210 logically there is no difference. INCOMPATIBILITY.
1212 * Command "value" now integrates different evaluation mechanisms. The
1213 result of the first successful evaluation mechanism is printed. In
1214 square brackets a particular named evaluation mechanisms may be
1215 specified (currently, [SML], [code] or [nbe]). See further
1216 src/HOL/ex/Eval_Examples.thy.
1218 * Normalization by evaluation now allows non-leftlinear equations.
1219 Declare with attribute [code nbe].
1221 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1222 as the structured Isar versions "cases" and "induct", cf. the
1223 corresponding "cases" and "induct" attributes. Mutual induction rules
1224 are now presented as a list of individual projections
1225 (e.g. foo_bar.inducts for types foo and bar); the old format with
1226 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1227 rare situations a different rule is selected --- notably nested tuple
1228 elimination instead of former prod.exhaust: use explicit (case_tac t
1229 rule: prod.exhaust) here.
1231 * Attributes "cases", "induct", "coinduct" support "del" option.
1233 * Removed fact "case_split_thm", which duplicates "case_split".
1235 * The option datatype has been moved to a new theory Option. Renamed
1236 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1238 * New predicate "strict_mono" classifies strict functions on partial
1239 orders. With strict functions on linear orders, reasoning about
1240 (in)equalities is facilitated by theorems "strict_mono_eq",
1241 "strict_mono_less_eq" and "strict_mono_less".
1243 * Some set operations are now proper qualified constants with
1244 authentic syntax. INCOMPATIBILITY:
1255 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1258 * Auxiliary class "itself" has disappeared -- classes without any
1259 parameter are treated as expected by the 'class' command.
1261 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1263 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1264 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1266 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1267 method "approximation". It proves formulas on real values by using
1268 interval arithmetic. In the formulas are also the transcendental
1269 functions sin, cos, tan, atan, ln, exp and the constant pi are
1270 allowed. For examples see
1271 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1273 * Theory "Reflection" now resides in HOL/Library.
1275 * Entry point to Word library now simply named "Word".
1278 * Made source layout more coherent with logical distribution
1281 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1282 src/HOL/Library/Code_Message.thy ~> src/HOL/
1283 src/HOL/Library/GCD.thy ~> src/HOL/
1284 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1285 src/HOL/Library/Parity.thy ~> src/HOL/
1286 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1287 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1288 src/HOL/Real/Lubs.thy ~> src/HOL/
1289 src/HOL/Real/PReal.thy ~> src/HOL/
1290 src/HOL/Real/Rational.thy ~> src/HOL/
1291 src/HOL/Real/RComplete.thy ~> src/HOL/
1292 src/HOL/Real/RealDef.thy ~> src/HOL/
1293 src/HOL/Real/RealPow.thy ~> src/HOL/
1294 src/HOL/Real/Real.thy ~> src/HOL/
1295 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1296 src/HOL/Complex/Complex.thy ~> src/HOL/
1297 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1298 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1299 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1300 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1301 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1302 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1303 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1304 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1305 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1306 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1307 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1308 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1309 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1310 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1311 src/HOL/Real/Float ~> src/HOL/Library/
1312 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1313 src/HOL/Real/RealVector.thy ~> src/HOL/
1315 src/HOL/arith_data.ML ~> src/HOL/Tools
1316 src/HOL/hologic.ML ~> src/HOL/Tools
1317 src/HOL/simpdata.ML ~> src/HOL/Tools
1318 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1319 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1320 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1321 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1322 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1323 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1324 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1326 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1327 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1328 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1329 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1330 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1331 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1333 * If methods "eval" and "evaluation" encounter a structured proof
1334 state with !!/==>, only the conclusion is evaluated to True (if
1335 possible), avoiding strange error messages.
1337 * Method "sizechange" automates termination proofs using (a
1338 modification of) the size-change principle. Requires SAT solver. See
1339 src/HOL/ex/Termination.thy for examples.
1341 * Simplifier: simproc for let expressions now unfolds if bound
1342 variable occurs at most once in let expression body. INCOMPATIBILITY.
1344 * Method "arith": Linear arithmetic now ignores all inequalities when
1345 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1347 * New attribute "arith" for facts that should always be used
1348 automatically by arithmetic. It is intended to be used locally in
1351 assumes [arith]: "x > 0"
1353 Global usage is discouraged because of possible performance impact.
1355 * New classes "top" and "bot" with corresponding operations "top" and
1356 "bot" in theory Orderings; instantiation of class "complete_lattice"
1357 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1359 * Changed definition lemma "less_fun_def" in order to provide an
1360 instance for preorders on functions; use lemma "less_le" instead.
1363 * Theory Orderings: class "wellorder" moved here, with explicit
1364 induction rule "less_induct" as assumption. For instantiation of
1365 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1368 * Theory Orderings: added class "preorder" as superclass of "order".
1369 INCOMPATIBILITY: Instantiation proofs for order, linorder
1370 etc. slightly changed. Some theorems named order_class.* now named
1373 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1376 * Theory Finite_Set: added a new fold combinator of type
1378 ('a => 'b => 'b) => 'b => 'a set => 'b
1380 Occasionally this is more convenient than the old fold combinator
1381 which is now defined in terms of the new one and renamed to
1384 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1385 and "ring_simps" have been replaced by "algebra_simps" (which can be
1386 extended with further lemmas!). At the moment both still exist but
1387 the former will disappear at some point.
1389 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1390 class recpower. Type-specific simp rules for various recpower types
1391 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1393 rat_power_0 -> power_0
1394 rat_power_Suc -> power_Suc
1395 realpow_0 -> power_0
1396 realpow_Suc -> power_Suc
1397 complexpow_0 -> power_0
1398 complexpow_Suc -> power_Suc
1399 power_poly_0 -> power_0
1400 power_poly_Suc -> power_Suc
1402 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1403 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1404 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1405 of lemmas from Divides has been generalized from nat to class
1406 semiring_div. INCOMPATIBILITY. This involves the following theorem
1407 renames resulting from duplicate elimination:
1409 dvd_def_mod ~> dvd_eq_mod_eq_0
1410 zero_dvd_iff ~> dvd_0_left_iff
1411 dvd_0 ~> dvd_0_right
1412 DIVISION_BY_ZERO_DIV ~> div_by_0
1413 DIVISION_BY_ZERO_MOD ~> mod_by_0
1414 mult_div ~> div_mult_self2_is_id
1415 mult_mod ~> mod_mult_self2_is_0
1417 * Theory IntDiv: removed many lemmas that are instances of class-based
1418 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1419 rename old lemmas as follows:
1421 dvd_diff -> nat_dvd_diff
1422 dvd_zminus_iff -> dvd_minus_iff
1423 mod_add1_eq -> mod_add_eq
1424 mod_mult1_eq -> mod_mult_right_eq
1425 mod_mult1_eq' -> mod_mult_left_eq
1426 mod_mult_distrib_mod -> mod_mult_eq
1427 nat_mod_add_left_eq -> mod_add_left_eq
1428 nat_mod_add_right_eq -> mod_add_right_eq
1429 nat_mod_div_trivial -> mod_div_trivial
1430 nat_mod_mod_trivial -> mod_mod_trivial
1431 zdiv_zadd_self1 -> div_add_self1
1432 zdiv_zadd_self2 -> div_add_self2
1433 zdiv_zmult_self1 -> div_mult_self2_is_id
1434 zdiv_zmult_self2 -> div_mult_self1_is_id
1435 zdvd_triv_left -> dvd_triv_left
1436 zdvd_triv_right -> dvd_triv_right
1437 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1438 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1439 zmod_zadd_left_eq -> mod_add_left_eq
1440 zmod_zadd_right_eq -> mod_add_right_eq
1441 zmod_zadd_self1 -> mod_add_self1
1442 zmod_zadd_self2 -> mod_add_self2
1443 zmod_zadd1_eq -> mod_add_eq
1444 zmod_zdiff1_eq -> mod_diff_eq
1445 zmod_zdvd_zmod -> mod_mod_cancel
1446 zmod_zmod_cancel -> mod_mod_cancel
1447 zmod_zmult_self1 -> mod_mult_self2_is_0
1448 zmod_zmult_self2 -> mod_mult_self1_is_0
1451 zdvd_abs1 -> abs_dvd_iff
1452 zdvd_abs2 -> dvd_abs_iff
1453 zdvd_refl -> dvd_refl
1454 zdvd_trans -> dvd_trans
1455 zdvd_zadd -> dvd_add
1456 zdvd_zdiff -> dvd_diff
1457 zdvd_zminus_iff -> dvd_minus_iff
1458 zdvd_zminus2_iff -> minus_dvd_iff
1459 zdvd_zmultD -> dvd_mult_right
1460 zdvd_zmultD2 -> dvd_mult_left
1461 zdvd_zmult_mono -> mult_dvd_mono
1462 zdvd_0_right -> dvd_0_right
1463 zdvd_0_left -> dvd_0_left_iff
1464 zdvd_1_left -> one_dvd
1465 zminus_dvd_iff -> minus_dvd_iff
1467 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1469 * The real numbers offer decimal input syntax: 12.34 is translated
1470 into 1234/10^2. This translation is not reversed upon output.
1472 * Theory Library/Polynomial defines an abstract type 'a poly of
1473 univariate polynomials with coefficients of type 'a. In addition to
1474 the standard ring operations, it also supports div and mod. Code
1475 generation is also supported, using list-style constructors.
1477 * Theory Library/Inner_Product defines a class of real_inner for real
1478 inner product spaces, with an overloaded operation inner :: 'a => 'a
1479 => real. Class real_inner is a subclass of real_normed_vector from
1482 * Theory Library/Product_Vector provides instances for the product
1483 type 'a * 'b of several classes from RealVector and Inner_Product.
1484 Definitions of addition, subtraction, scalar multiplication, norms,
1485 and inner products are included.
1487 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1488 addition to the field operations, numerals and case syntax are also
1491 * Theory Library/Diagonalize provides constructive version of Cantor's
1492 first diagonalization argument.
1494 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1495 zlcm (for int); carried together from various gcd/lcm developements in
1496 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1497 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1498 may recover tupled syntax as follows:
1500 hide (open) const gcd
1501 abbreviation gcd where
1502 "gcd == (%(a, b). GCD.gcd a b)"
1504 GCD.gcd ("gcd '(_, _')")
1506 The same works for lcm, zgcd, zlcm.
1508 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1509 instantiations for algebraic structures. Removed some duplicate
1510 theorems. Changes in simp rules. INCOMPATIBILITY.
1512 * ML antiquotation @{code} takes a constant as argument and generates
1513 corresponding code in background and inserts name of the corresponding
1514 resulting ML value/function/datatype constructor binding in place.
1515 All occurrences of @{code} with a single ML block are generated
1516 simultaneously. Provides a generic and safe interface for
1517 instrumentalizing code generation. See
1518 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1519 In future you ought to refrain from ad-hoc compiling generated SML
1520 code on the ML toplevel. Note that (for technical reasons) @{code}
1521 cannot refer to constants for which user-defined serializations are
1522 set. Refer to the corresponding ML counterpart directly in that
1525 * Command 'rep_datatype': instead of theorem names the command now
1526 takes a list of terms denoting the constructors of the type to be
1527 represented as datatype. The characteristic theorems have to be
1528 proven. INCOMPATIBILITY. Also observe that the following theorems
1529 have disappeared in favour of existing ones:
1531 unit_induct ~> unit.induct
1532 prod_induct ~> prod.induct
1533 sum_induct ~> sum.induct
1534 Suc_Suc_eq ~> nat.inject
1535 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1540 * New locales for orders and lattices where the equivalence relation
1541 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1542 locales use a record structure with field eq for the equivalence.
1544 * New theory of factorial domains.
1546 * Units_l_inv and Units_r_inv are now simp rules by default.
1547 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1548 and/or r_inv will now also require deletion of these lemmas.
1550 * Renamed the following theorems, INCOMPATIBILITY:
1552 UpperD ~> Upper_memD
1553 LowerD ~> Lower_memD
1554 least_carrier ~> least_closed
1555 greatest_carrier ~> greatest_closed
1556 greatest_Lower_above ~> greatest_Lower_below
1557 one_zero ~> carrier_one_zero
1558 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1563 * Nominal datatypes can now contain type-variables.
1565 * Commands 'nominal_inductive' and 'equivariance' work with local
1568 * Nominal primrec can now works with local theory targets and its
1569 specification syntax now conforms to the general format as seen in
1572 * Method "perm_simp" honours the standard simplifier attributes
1573 (no_asm), (no_asm_use) etc.
1575 * The new predicate #* is defined like freshness, except that on the
1576 left hand side can be a set or list of atoms.
1578 * Experimental command 'nominal_inductive2' derives strong induction
1579 principles for inductive definitions. In contrast to
1580 'nominal_inductive', which can only deal with a fixed number of
1581 binders, it can deal with arbitrary expressions standing for sets of
1582 atoms to be avoided. The only inductive definition we have at the
1583 moment that needs this generalisation is the typing rule for Lets in
1586 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1587 -----------------------------------------------------------------
1588 Gamma |- Let x be t1 in t2 : T2
1590 In this rule one wants to avoid all the binders that are introduced by
1591 "close Gamma T1". We are looking for other examples where this
1592 feature might be useful. Please let us know.
1597 * Reimplemented the simplification procedure for proving continuity
1598 subgoals. The new simproc is extensible; users can declare additional
1599 continuity introduction rules with the attribute [cont2cont].
1601 * The continuity simproc now uses a different introduction rule for
1602 solving continuity subgoals on terms with lambda abstractions. In
1603 some rare cases the new simproc may fail to solve subgoals that the
1604 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1605 Potential INCOMPATIBILITY.
1607 * Command 'fixrec': specification syntax now conforms to the general
1608 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1609 examples. INCOMPATIBILITY.
1614 * Proof of Zorn's Lemma for partial orders.
1619 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1620 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1621 depends on multithreading, so timouts will not work before Poly/ML
1624 * High-level support for concurrent ML programming, see
1625 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1626 particularly convenient to organize independent functional
1627 computations. The concept of "synchronized variables" provides a
1628 higher-order interface for components with shared state, avoiding the
1629 delicate details of mutexes and condition variables. (Requires
1630 Poly/ML 5.2.1 or later.)
1632 * ML bindings produced via Isar commands are stored within the Isar
1633 context (theory or proof). Consequently, commands like 'use' and 'ML'
1634 become thread-safe and work with undo as expected (concerning
1635 top-level bindings, not side-effects on global references).
1636 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1637 compiler at runtime; really global bindings need to be given outside a
1638 theory. (Requires Poly/ML 5.2 or later.)
1640 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1641 context. Top-level ML bindings are stored within the proof context in
1642 a purely sequential fashion, disregarding the nested proof structure.
1643 ML bindings introduced by 'ML_prf' are discarded at the end of the
1644 proof. (Requires Poly/ML 5.2 or later.)
1646 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1647 and Method.setup, as well as Isar commands 'attribute_setup' and
1648 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1649 existing code accordingly, or use plain 'setup' together with old
1652 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1653 to 'a -> thm, while results are always tagged with an authentic oracle
1654 name. The Isar command 'oracle' is now polymorphic, no argument type
1655 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1656 accordingly. Note that extra performance may be gained by producing
1657 the cterm carefully, avoiding slow Thm.cterm_of.
1659 * Simplified interface for defining document antiquotations via
1660 ThyOutput.antiquotation, ThyOutput.output, and optionally
1661 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1662 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1665 * More systematic treatment of long names, abstract name bindings, and
1666 name space operations. Basic operations on qualified names have been
1667 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1668 Long_Name.append. Old type bstring has been mostly replaced by
1669 abstract type binding (see structure Binding), which supports precise
1670 qualification by packages and local theory targets, as well as proper
1671 tracking of source positions. INCOMPATIBILITY, need to wrap old
1672 bstring values into Binding.name, or better pass through abstract
1673 bindings everywhere. See further src/Pure/General/long_name.ML,
1674 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1676 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1677 LocalTheory.note etc.) now refer to the *full* internal name, not the
1678 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1680 * Disposed old type and term read functions (Sign.read_def_typ,
1681 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1682 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1683 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1684 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1685 resort for legacy applications.
1687 * Disposed old declarations, tactics, tactic combinators that refer to
1688 the simpset or claset of an implicit theory (such as Addsimps,
1689 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1690 embedded ML text, or local_simpset_of with a proper context passed as
1691 explicit runtime argument.
1693 * Rules and tactics that read instantiations (read_instantiate,
1694 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1695 context, which is required for parsing and type-checking. Moreover,
1696 the variables are specified as plain indexnames, not string encodings
1697 thereof. INCOMPATIBILITY.
1699 * Generic Toplevel.add_hook interface allows to analyze the result of
1700 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1701 for theorem dependency output of transactions resulting in a new
1704 * ML antiquotations: block-structured compilation context indicated by
1705 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1707 @{binding name} - basic name binding
1708 @{let ?pat = term} - term abbreviation (HO matching)
1709 @{note name = fact} - fact abbreviation
1710 @{thm fact} - singleton fact (with attributes)
1711 @{thms fact} - general fact (with attributes)
1712 @{lemma prop by method} - singleton goal
1713 @{lemma prop by meth1 meth2} - singleton goal
1714 @{lemma prop1 ... propN by method} - general goal
1715 @{lemma prop1 ... propN by meth1 meth2} - general goal
1716 @{lemma (open) ...} - open derivation
1721 * The Isabelle "emacs" tool provides a specific interface to invoke
1722 Proof General / Emacs, with more explicit failure if that is not
1723 installed (the old isabelle-interface script silently falls back on
1724 isabelle-process). The PROOFGENERAL_HOME setting determines the
1725 installation location of the Proof General distribution.
1727 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1728 the Isabelle process into a JVM/Scala application. See
1729 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1730 process wrapper has been discontinued.)
1732 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1734 * Various status messages (with exact source position information) are
1735 emitted, if proper markup print mode is enabled. This allows
1736 user-interface components to provide detailed feedback on internal
1741 New in Isabelle2008 (June 2008)
1742 -------------------------------
1746 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1747 and updated, with formally checked references as hyperlinks.
1749 * Theory loader: use_thy (and similar operations) no longer set the
1750 implicit ML context, which was occasionally hard to predict and in
1751 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1752 provides a proper context already.
1754 * Theory loader: old-style ML proof scripts being *attached* to a thy
1755 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1756 'use' within a theory file will do the job.
1758 * Name space merge now observes canonical order, i.e. the second space
1759 is inserted into the first one, while existing entries in the first
1760 space take precedence. INCOMPATIBILITY in rare situations, may try to
1761 swap theory imports.
1763 * Syntax: symbol \<chi> is now considered a letter. Potential
1764 INCOMPATIBILITY in identifier syntax etc.
1766 * Outer syntax: string tokens no longer admit escaped white space,
1767 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1768 white space without escapes.
1770 * Outer syntax: string tokens may contain arbitrary character codes
1771 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1777 * Context-dependent token translations. Default setup reverts locally
1778 fixed variables, and adds hilite markup for undeclared frees.
1780 * Unused theorems can be found using the new command 'unused_thms'.
1781 There are three ways of invoking it:
1784 Only finds unused theorems in the current theory.
1786 (2) unused_thms thy_1 ... thy_n -
1787 Finds unused theorems in the current theory and all of its ancestors,
1788 excluding the theories thy_1 ... thy_n and all of their ancestors.
1790 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1791 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1792 their ancestors, excluding the theories thy_1 ... thy_n and all of
1795 In order to increase the readability of the list produced by
1796 unused_thms, theorems that have been created by a particular instance
1797 of a theory command such as 'inductive' or 'function' are considered
1798 to belong to the same "group", meaning that if at least one theorem in
1799 this group is used, the other theorems in the same group are no longer
1800 reported as unused. Moreover, if all theorems in the group are
1801 unused, only one theorem in the group is displayed.
1803 Note that proof objects have to be switched on in order for
1804 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1805 usually the case when using Proof General with the default settings).
1807 * Authentic naming of facts disallows ad-hoc overwriting of previous
1808 theorems within the same name space. INCOMPATIBILITY, need to remove
1809 duplicate fact bindings, or even accidental fact duplications. Note
1810 that tools may maintain dynamically scoped facts systematically, using
1811 PureThy.add_thms_dynamic.
1813 * Command 'hide' now allows to hide from "fact" name space as well.
1815 * Eliminated destructive theorem database, simpset, claset, and
1816 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1817 update of theories within ML code.
1819 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1820 INCOMPATIBILITY, object-logics depending on former Pure require
1821 additional setup PureThy.old_appl_syntax_setup; object-logics
1822 depending on former CPure need to refer to Pure.
1824 * Commands 'use' and 'ML' are now purely functional, operating on
1825 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1826 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1829 * Command 'setup': discontinued implicit version with ML reference.
1831 * Instantiation target allows for simultaneous specification of class
1832 instance operations together with an instantiation proof.
1833 Type-checking phase allows to refer to class operations uniformly.
1834 See src/HOL/Complex/Complex.thy for an Isar example and
1835 src/HOL/Library/Eval.thy for an ML example.
1837 * Indexing of literal facts: be more serious about including only
1838 facts from the visible specification/proof context, but not the
1839 background context (locale etc.). Affects `prop` notation and method
1840 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1843 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1844 "(open)" option, which used to expose internal bound variables to the
1847 * Isar statements: removed obsolete case "rule_context".
1848 INCOMPATIBILITY, better use explicit fixes/assumes.
1850 * Locale proofs: default proof step now includes 'unfold_locales';
1851 hence 'proof' without argument may be used to unfold locale
1855 *** Document preparation ***
1857 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1858 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1859 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1860 spot); renamed link color from "darkblue" to "linkcolor" (default
1861 value unchanged, can be redefined via \definecolor); no longer sets
1862 "a4paper" option (unnecessary or even intrusive).
1864 * Antiquotation @{lemma A method} proves proposition A by the given
1865 method (either a method name or a method name plus (optional) method
1866 arguments in parentheses) and prints A just like @{prop A}.
1871 * New primrec package. Specification syntax conforms in style to
1872 definition/function/.... No separate induction rule is provided. The
1873 "primrec" command distinguishes old-style and new-style specifications
1874 by syntax. The former primrec package is now named OldPrimrecPackage.
1875 When adjusting theories, beware: constants stemming from new-style
1876 primrec specifications have authentic syntax.
1878 * Metis prover is now an order of magnitude faster, and also works
1879 with multithreading.
1881 * Metis: the maximum number of clauses that can be produced from a
1882 theorem is now given by the attribute max_clauses. Theorems that
1883 exceed this number are ignored, with a warning printed.
1885 * Sledgehammer no longer produces structured proofs by default. To
1886 enable, declare [[sledgehammer_full = true]]. Attributes
1887 reconstruction_modulus, reconstruction_sorts renamed
1888 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1890 * Method "induct_scheme" derives user-specified induction rules
1891 from well-founded induction and completeness of patterns. This factors
1892 out some operations that are done internally by the function package
1893 and makes them available separately. See
1894 src/HOL/ex/Induction_Scheme.thy for examples.
1896 * More flexible generation of measure functions for termination
1897 proofs: Measure functions can be declared by proving a rule of the
1898 form "is_measure f" and giving it the [measure_function] attribute.
1899 The "is_measure" predicate is logically meaningless (always true), and
1900 just guides the heuristic. To find suitable measure functions, the
1901 termination prover sets up the goal "is_measure ?f" of the appropriate
1902 type and generates all solutions by prolog-style backwards proof using
1905 This setup also deals with rules like
1907 "is_measure f ==> is_measure (list_size f)"
1909 which accommodates nested datatypes that recurse through lists.
1910 Similar rules are predeclared for products and option types.
1912 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1916 - Definitions of overloaded constants on sets have to be replaced by
1917 definitions on => and bool.
1919 - Some definitions of overloaded operators on sets can now be proved
1920 using the definitions of the operators on => and bool. Therefore,
1921 the following theorems have been renamed:
1923 subset_def -> subset_eq
1924 psubset_def -> psubset_eq
1925 set_diff_def -> set_diff_eq
1926 Compl_def -> Compl_eq
1927 Sup_set_def -> Sup_set_eq
1928 Inf_set_def -> Inf_set_eq
1929 sup_set_def -> sup_set_eq
1930 inf_set_def -> inf_set_eq
1932 - Due to the incompleteness of the HO unification algorithm, some
1933 rules such as subst may require manual instantiation, if some of
1934 the unknowns in the rule is a set.
1936 - Higher order unification and forward proofs:
1939 have "P (S::'a set)" <...>
1940 then have "EX S. P S" ..
1942 no longer works (due to the incompleteness of the HO unification
1943 algorithm) and must be replaced by the pattern
1950 - Calculational reasoning with subst (or similar rules):
1953 have "P (S::'a set)" <...>
1954 also have "S = T" <...>
1955 finally have "P T" .
1957 no longer works (for similar reasons as the previous example) and
1958 must be replaced by something like
1960 have "P (S::'a set)" <...>
1961 moreover have "S = T" <...>
1962 ultimately have "P T" by simp
1964 - Tactics or packages written in ML code:
1965 Code performing pattern matching on types via
1967 Type ("set", [T]) => ...
1969 must be rewritten. Moreover, functions like strip_type or
1970 binder_types no longer return the right value when applied to a
1973 T1 => ... => Tn => U => bool
1977 T1 => ... => Tn => U set
1979 * Merged theories Wellfounded_Recursion, Accessible_Part and
1980 Wellfounded_Relations to theory Wellfounded.
1982 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1984 * Class finite no longer treats UNIV as class parameter. Use class
1985 enum from theory Library/Enum instead to achieve a similar effect.
1988 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1989 and "Cons". INCOMPATIBILITY.
1991 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1992 Potential INCOMPATIBILITY.
1994 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1995 injective_fst_snd removed, use split_eta and prod_eqI instead.
1996 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1998 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1999 the same name in theory Orderings:
2009 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2010 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2011 and different variable names.
2013 * Library/Option_ord.thy: Canonical order on option type.
2015 * Library/RBT.thy: Red-black trees, an efficient implementation of
2018 * Library/Countable.thy: Type class for countable types.
2020 * Theory Int: The representation of numerals has changed. The infix
2021 operator BIT and the bit datatype with constructors B0 and B1 have
2022 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2023 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2024 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2027 * Theory Nat: definition of <= and < on natural numbers no longer
2028 depend on well-founded relations. INCOMPATIBILITY. Definitions
2029 le_def and less_def have disappeared. Consider lemmas not_less
2030 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2032 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2033 (whose purpose mainly is for various fold_set functionals) have been
2034 abandoned in favor of the existing algebraic classes
2035 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2036 lower_semilattice (resp. upper_semilattice) and linorder.
2039 * Theory Transitive_Closure: induct and cases rules now declare proper
2040 case_names ("base" and "step"). INCOMPATIBILITY.
2042 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2043 lattices. The form set-specific version is available as
2044 Inductive.lfp_ordinal_induct_set.
2046 * Renamed theorems "power.simps" to "power_int.simps".
2049 * Class semiring_div provides basic abstract properties of semirings
2050 with division and modulo operations. Subsumes former class dvd_mod.
2052 * Merged theories IntDef, Numeral and IntArith into unified theory
2053 Int. INCOMPATIBILITY.
2055 * Theory Library/Code_Index: type "index" now represents natural
2056 numbers rather than integers. INCOMPATIBILITY.
2058 * New class "uminus" with operation "uminus" (split of from class
2059 "minus" which now only has operation "minus", binary).
2062 * Constants "card", "internal_split", "option_map" now with authentic
2063 syntax. INCOMPATIBILITY.
2065 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2066 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2067 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2068 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2069 Sup_set_def, le_def, less_def, option_map_def now with object
2070 equality. INCOMPATIBILITY.
2072 * Records. Removed K_record, and replaced it by pure lambda term
2073 %x. c. The simplifier setup is now more robust against eta expansion.
2074 INCOMPATIBILITY: in cases explicitly referring to K_record.
2076 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2078 * Library/ListVector: new theory of arithmetic vector operations.
2080 * Library/Order_Relation: new theory of various orderings as sets of
2081 pairs. Defines preorders, partial orders, linear orders and
2082 well-orders on sets and on types.
2087 * Renamed some theories to allow to loading both ZF and HOL in the
2090 Datatype -> Datatype_ZF
2091 Inductive -> Inductive_ZF
2098 INCOMPATIBILITY: ZF theories that import individual theories below
2099 Main might need to be adapted. Regular theory Main is still
2100 available, as trivial extension of Main_ZF.
2105 * ML within Isar: antiquotation @{const name} or @{const
2106 name(typargs)} produces statically-checked Const term.
2108 * Functor NamedThmsFun: data is available to the user as dynamic fact
2109 (of the same name). Removed obsolete print command.
2111 * Removed obsolete "use_legacy_bindings" function.
2113 * The ``print mode'' is now a thread-local value derived from a global
2114 template (the former print_mode reference), thus access becomes
2115 non-critical. The global print_mode reference is for session
2116 management only; user-code should use print_mode_value,
2117 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2119 * Functions system/system_out provide a robust way to invoke external
2120 shell commands, with propagation of interrupts (requires Poly/ML
2121 5.2.1). Do not use OS.Process.system etc. from the basis library!
2126 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2127 in accordance with Proof General 3.7, which prefers GNU emacs.
2129 * isatool tty runs Isabelle process with plain tty interaction;
2130 optional line editor may be specified via ISABELLE_LINE_EDITOR
2131 setting, the default settings attempt to locate "ledit" and "rlwrap".
2133 * isatool browser now works with Cygwin as well, using general
2134 "javapath" function defined in Isabelle process environment.
2136 * YXML notation provides a simple and efficient alternative to
2137 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2138 isatool yxml as described in the Isabelle system manual.
2140 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2141 provides general wrapper for managing an Isabelle process in a robust
2142 fashion, with ``cooked'' output from stdin/stderr.
2144 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2145 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2147 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2148 way of changing the user's settings is via
2149 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2152 * Multithreading.max_threads := 0 refers to the number of actual CPU
2153 cores of the underlying machine, which is a good starting point for
2154 optimal performance tuning. The corresponding usedir option -M allows
2155 "max" as an alias for "0". WARNING: does not work on certain versions
2156 of Mac OS (with Poly/ML 5.1).
2158 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2159 adverse effect of Isabelle flooding interactive front-ends (notably
2160 ProofGeneral / XEmacs).
2164 New in Isabelle2007 (November 2007)
2165 -----------------------------------
2169 * More uniform information about legacy features, notably a
2170 warning/error of "Legacy feature: ...", depending on the state of the
2171 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2172 legacy features will disappear eventually.
2174 * Theory syntax: the header format ``theory A = B + C:'' has been
2175 discontinued in favour of ``theory A imports B C begin''. Use isatool
2176 fixheaders to convert existing theory files. INCOMPATIBILITY.
2178 * Theory syntax: the old non-Isar theory file format has been
2179 discontinued altogether. Note that ML proof scripts may still be used
2180 with Isar theories; migration is usually quite simple with the ML
2181 function use_legacy_bindings. INCOMPATIBILITY.
2183 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2184 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2187 * Theory loader: be more serious about observing the static theory
2188 header specifications (including optional directories), but not the
2189 accidental file locations of previously successful loads. The strict
2190 update policy of former update_thy is now already performed by
2191 use_thy, so the former has been removed; use_thys updates several
2192 theories simultaneously, just as 'imports' within a theory header
2193 specification, but without merging the results. Potential
2194 INCOMPATIBILITY: may need to refine theory headers and commands
2195 ROOT.ML which depend on load order.
2197 * Theory loader: optional support for content-based file
2198 identification, instead of the traditional scheme of full physical
2199 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2200 (cf. the system manual). The new scheme allows to work with
2201 non-finished theories in persistent session images, such that source
2202 files may be moved later on without requiring reloads.
2204 * Theory loader: old-style ML proof scripts being *attached* to a thy
2205 file (with the same base name as the theory) are considered a legacy
2206 feature, which will disappear eventually. Even now, the theory loader
2207 no longer maintains dependencies on such files.
2209 * Syntax: the scope for resolving ambiguities via type-inference is
2210 now limited to individual terms, instead of whole simultaneous
2211 specifications as before. This greatly reduces the complexity of the
2212 syntax module and improves flexibility by separating parsing and
2213 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2214 'fixes' etc.) are required in rare situations.
2216 * Syntax: constants introduced by new-style packages ('definition',
2217 'abbreviation' etc.) are passed through the syntax module in
2218 ``authentic mode''. This means that associated mixfix annotations
2219 really stick to such constants, independently of potential name space
2220 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2221 trees are represented slightly differently, may need to adapt syntax
2222 translations accordingly. Use CONST marker in 'translations' and
2223 @{const_syntax} antiquotation in 'parse_translation' etc.
2225 * Legacy goal package: reduced interface to the bare minimum required
2226 to keep existing proof scripts running. Most other user-level
2227 functions are now part of the OldGoals structure, which is *not* open
2228 by default (consider isatool expandshort before open OldGoals).
2229 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2230 these tend to cause confusion about the actual goal (!) context being
2231 used here, which is not necessarily the same as the_context().
2233 * Command 'find_theorems': supports "*" wild-card in "name:"
2234 criterion; "with_dups" option. Certain ProofGeneral versions might
2235 support a specific search form (see ProofGeneral/CHANGES).
2237 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2238 by default, which means that "prems" (and also "fixed variables") are
2239 suppressed from proof state output. Note that the ProofGeneral
2240 settings mechanism allows to change and save options persistently, but
2241 older versions of Isabelle will fail to start up if a negative prems
2244 * Local theory targets may be specified by non-nested blocks of
2245 ``context/locale/class ... begin'' followed by ``end''. The body may
2246 contain definitions, theorems etc., including any derived mechanism
2247 that has been implemented on top of these primitives. This concept
2248 generalizes the existing ``theorem (in ...)'' towards more versatility
2251 * Proof General interface: proper undo of final 'end' command;
2252 discontinued Isabelle/classic mode (ML proof scripts).
2255 *** Document preparation ***
2257 * Added antiquotation @{theory name} which prints the given name,
2258 after checking that it refers to a valid ancestor theory in the
2261 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2262 check the given source text as ML type/structure, printing verbatim.
2264 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2265 "c args == rhs" given in the current context. (Any number of
2266 arguments may be given on the LHS.)
2271 * The 'class' package offers a combination of axclass and locale to
2272 achieve Haskell-like type classes in Isabelle. Definitions and
2273 theorems within a class context produce both relative results (with
2274 implicit parameters according to the locale context), and polymorphic
2275 constants with qualified polymorphism (according to the class
2276 context). Within the body context of a 'class' target, a separate
2277 syntax layer ("user space type system") takes care of converting
2278 between global polymorphic consts and internal locale representation.
2279 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2280 "isatool doc classes" provides a tutorial.
2282 * Generic code generator framework allows to generate executable
2283 code for ML and Haskell (including Isabelle classes). A short usage
2286 internal compilation:
2287 export_code <list of constants (term syntax)> in SML
2288 writing SML code to a file:
2289 export_code <list of constants (term syntax)> in SML <filename>
2290 writing OCaml code to a file:
2291 export_code <list of constants (term syntax)> in OCaml <filename>
2292 writing Haskell code to a bunch of files:
2293 export_code <list of constants (term syntax)> in Haskell <filename>
2295 evaluating closed propositions to True/False using code generation:
2298 Reasonable default setup of framework in HOL.
2300 Theorem attributs for selecting and transforming function equations theorems:
2302 [code fun]: select a theorem as function equation for a specific constant
2303 [code fun del]: deselect a theorem as function equation for a specific constant
2304 [code inline]: select an equation theorem for unfolding (inlining) in place
2305 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2307 User-defined serializations (target in {SML, OCaml, Haskell}):
2309 code_const <and-list of constants (term syntax)>
2310 {(target) <and-list of const target syntax>}+
2312 code_type <and-list of type constructors>
2313 {(target) <and-list of type target syntax>}+
2315 code_instance <and-list of instances>
2317 where instance ::= <type constructor> :: <class>
2319 code_class <and_list of classes>
2320 {(target) <and-list of class target syntax>}+
2321 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2323 code_instance and code_class only are effective to target Haskell.
2325 For example usage see src/HOL/ex/Codegenerator.thy and
2326 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2327 generation from Isabelle/HOL theories is available via "isatool doc
2330 * Code generator: consts in 'consts_code' Isar commands are now
2331 referred to by usual term syntax (including optional type
2334 * Command 'no_translations' removes translation rules from theory
2337 * Overloaded definitions are now actually checked for acyclic
2338 dependencies. The overloading scheme is slightly more general than
2339 that of Haskell98, although Isabelle does not demand an exact
2340 correspondence to type class and instance declarations.
2341 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2342 exotic versions of overloading -- at the discretion of the user!
2344 Polymorphic constants are represented via type arguments, i.e. the
2345 instantiation that matches an instance against the most general
2346 declaration given in the signature. For example, with the declaration
2347 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2348 as c(nat). Overloading is essentially simultaneous structural
2349 recursion over such type arguments. Incomplete specification patterns
2350 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2351 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2352 Command 'print_theory' outputs the normalized system of recursive
2353 equations, see section "definitions".
2355 * Configuration options are maintained within the theory or proof
2356 context (with name and type bool/int/string), providing a very simple
2357 interface to a poor-man's version of general context data. Tools may
2358 declare options in ML (e.g. using Attrib.config_int) and then refer to
2359 these values using Config.get etc. Users may change options via an
2360 associated attribute of the same name. This form of context
2361 declaration works particularly well with commands 'declare' or
2362 'using', for example ``declare [[foo = 42]]''. Thus it has become
2363 very easy to avoid global references, which would not observe Isar
2364 toplevel undo/redo and fail to work with multithreading.
2366 Various global ML references of Pure and HOL have been turned into
2367 configuration options:
2369 Unify.search_bound unify_search_bound
2370 Unify.trace_bound unify_trace_bound
2371 Unify.trace_simp unify_trace_simp
2372 Unify.trace_types unify_trace_types
2373 Simplifier.simp_depth_limit simp_depth_limit
2374 Blast.depth_limit blast_depth_limit
2375 DatatypeProp.dtK datatype_distinctness_limit
2376 fast_arith_neq_limit fast_arith_neq_limit
2377 fast_arith_split_limit fast_arith_split_limit
2379 * Named collections of theorems may be easily installed as context
2380 data using the functor NamedThmsFun (see also
2381 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2382 attributes; there is also a toplevel print command. This facility is
2383 just a common case of general context data, which is the preferred way
2384 for anything more complex than just a list of facts in canonical
2387 * Isar: command 'declaration' augments a local theory by generic
2388 declaration functions written in ML. This enables arbitrary content
2389 being added to the context, depending on a morphism that tells the
2390 difference of the original declaration context wrt. the application
2391 context encountered later on.
2393 * Isar: proper interfaces for simplification procedures. Command
2394 'simproc_setup' declares named simprocs (with match patterns, and body
2395 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2396 context. ML antiquotation @{simproc name} retrieves named simprocs.
2398 * Isar: an extra pair of brackets around attribute declarations
2399 abbreviates a theorem reference involving an internal dummy fact,
2400 which will be ignored later --- only the effect of the attribute on
2401 the background context will persist. This form of in-place
2402 declarations is particularly useful with commands like 'declare' and
2403 'using', for example ``have A using [[simproc a]] by simp''.
2405 * Isar: method "assumption" (and implicit closing of subproofs) now
2406 takes simple non-atomic goal assumptions into account: after applying
2407 an assumption as a rule the resulting subgoals are solved by atomic
2408 assumption steps. This is particularly useful to finish 'obtain'
2409 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2410 without referring to the original premise "!!x. P x ==> thesis" in the
2411 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2414 * Isar: implicit use of prems from the Isar proof context is
2415 considered a legacy feature. Common applications like ``have A .''
2416 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2417 referencing facts explicitly here improves readability and
2418 maintainability of proof texts.
2420 * Isar: improper proof element 'guess' is like 'obtain', but derives
2421 the obtained context from the course of reasoning! For example:
2423 assume "EX x y. A x & B y" -- "any previous fact"
2424 then guess x and y by clarify
2426 This technique is potentially adventurous, depending on the facts and
2427 proof tools being involved here.
2429 * Isar: known facts from the proof context may be specified as literal
2430 propositions, using ASCII back-quote syntax. This works wherever
2431 named facts used to be allowed so far, in proof commands, proof
2432 methods, attributes etc. Literal facts are retrieved from the context
2433 according to unification of type and term parameters. For example,
2434 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2435 theorems in the current context, then these are valid literal facts:
2436 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2438 There is also a proof method "fact" which does the same composition
2439 for explicit goal states, e.g. the following proof texts coincide with
2440 certain special cases of literal facts:
2442 have "A" by fact == note `A`
2443 have "A ==> B" by fact == note `A ==> B`
2444 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2445 have "P a ==> Q a" by fact == note `P a ==> Q a`
2447 * Isar: ":" (colon) is no longer a symbolic identifier character in
2448 outer syntax. Thus symbolic identifiers may be used without
2449 additional white space in declarations like this: ``assume *: A''.
2451 * Isar: 'print_facts' prints all local facts of the current context,
2452 both named and unnamed ones.
2454 * Isar: 'def' now admits simultaneous definitions, e.g.:
2456 def x == "t" and y == "u"
2458 * Isar: added command 'unfolding', which is structurally similar to
2459 'using', but affects both the goal state and facts by unfolding given
2460 rewrite rules. Thus many occurrences of the 'unfold' method or
2461 'unfolded' attribute may be replaced by first-class proof text.
2463 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2464 and command 'unfolding' now all support object-level equalities
2465 (potentially conditional). The underlying notion of rewrite rule is
2466 analogous to the 'rule_format' attribute, but *not* that of the
2467 Simplifier (which is usually more generous).
2469 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2470 premises of a theorem by n. Useful in conjunction with drule.
2472 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2473 method expression within a sandbox consisting of the first N
2474 sub-goals, which need to exist. For example, ``simp_all [3]''
2475 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2476 simplifies all new goals that emerge from applying rule foo to the
2477 originally first one.
2479 * Isar: schematic goals are no longer restricted to higher-order
2480 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2483 * Isar: the conclusion of a long theorem statement is now either
2484 'shows' (a simultaneous conjunction, as before), or 'obtains'
2485 (essentially a disjunction of cases with local parameters and
2486 assumptions). The latter allows to express general elimination rules
2487 adequately; in this notation common elimination rules look like this:
2489 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2491 obtains x where "P x"
2493 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2497 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2503 The subsequent classical rules even refer to the formal "thesis"
2506 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2509 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2510 obtains "thesis ==> something"
2512 The actual proof of an 'obtains' statement is analogous to that of the
2513 Isar proof element 'obtain', only that there may be several cases.
2514 Optional case names may be specified in parentheses; these will be
2515 available both in the present proof and as annotations in the
2516 resulting rule, for later use with the 'cases' method (cf. attribute
2519 * Isar: the assumptions of a long theorem statement are available as
2520 "assms" fact in the proof context. This is more appropriate than the
2521 (historical) "prems", which refers to all assumptions of the current
2522 context, including those from the target locale, proof body etc.
2524 * Isar: 'print_statement' prints theorems from the current theory or
2525 proof context in long statement form, according to the syntax of a
2528 * Isar: 'obtain' takes an optional case name for the local context
2529 introduction rule (default "that").
2531 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2532 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2535 * Pure: syntax "CONST name" produces a fully internalized constant
2536 according to the current context. This is particularly useful for
2537 syntax translations that should refer to internal constant
2538 representations independently of name spaces.
2540 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2541 instead of "FOO ". This allows multiple binder declarations to coexist
2542 in the same context. INCOMPATIBILITY.
2544 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2545 primitive that also works in a locale context (both for constants and
2546 fixed variables). Type declaration and internal syntactic representation
2547 of given constants retrieved from the context. Likewise, the
2548 'no_notation' command allows to remove given syntax annotations from the
2551 * Isar/locales: new derived specification elements 'axiomatization',
2552 'definition', 'abbreviation', which support type-inference, admit
2553 object-level specifications (equality, equivalence). See also the
2554 isar-ref manual. Examples:
2557 eq (infix "===" 50) where
2558 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2560 definition "f x y = x + y + 1"
2561 definition g where "g x = f x x"
2564 neq (infix "=!=" 50) where
2565 "x =!= y == ~ (x === y)"
2567 These specifications may be also used in a locale context. Then the
2568 constants being introduced depend on certain fixed parameters, and the
2569 constant name is qualified by the locale base name. An internal
2570 abbreviation takes care for convenient input and output, making the
2571 parameters implicit and using the original short name. See also
2572 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2573 entities from a monomorphic theory.
2575 Presently, abbreviations are only available 'in' a target locale, but
2576 not inherited by general import expressions. Also note that
2577 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2578 'translations' in common applications. The "no_abbrevs" print mode
2579 prevents folding of abbreviations in term output.
2581 Concrete syntax is attached to specified constants in internal form,
2582 independently of name spaces. The parse tree representation is
2583 slightly different -- use 'notation' instead of raw 'syntax', and
2584 'translations' with explicit "CONST" markup to accommodate this.
2586 * Pure/Isar: unified syntax for new-style specification mechanisms
2587 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2588 full type inference and dummy patterns ("_"). For example:
2590 definition "K x _ = x"
2592 inductive conj for A B
2593 where "A ==> B ==> conj A B"
2595 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2596 the current context. Print mode "no_abbrevs" prevents inversion of
2597 abbreviations on output.
2599 * Isar/locales: improved parameter handling: use of locales "var" and
2600 "struct" no longer necessary; - parameter renamings are no longer
2601 required to be injective. For example, this allows to define
2602 endomorphisms as locale endom = homom mult mult h.
2604 * Isar/locales: changed the way locales with predicates are defined.
2605 Instead of accumulating the specification, the imported expression is
2606 now an interpretation. INCOMPATIBILITY: different normal form of
2607 locale expressions. In particular, in interpretations of locales with
2608 predicates, goals repesenting already interpreted fragments are not
2609 removed automatically. Use methods `intro_locales' and
2610 `unfold_locales'; see below.
2612 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2613 provide backward reasoning on locales predicates. The methods are
2614 aware of interpretations and discharge corresponding goals.
2615 `intro_locales' is less aggressive then `unfold_locales' and does not
2616 unfold predicates to assumptions.
2618 * Isar/locales: the order in which locale fragments are accumulated
2619 has changed. This enables to override declarations from fragments due
2620 to interpretations -- for example, unwanted simp rules.
2622 * Isar/locales: interpretation in theories and proof contexts has been
2623 extended. One may now specify (and prove) equations, which are
2624 unfolded in interpreted theorems. This is useful for replacing
2625 defined concepts (constants depending on locale parameters) by
2626 concepts already existing in the target context. Example:
2628 interpretation partial_order ["op <= :: [int, int] => bool"]
2629 where "partial_order.less (op <=) (x::int) y = (x < y)"
2631 Typically, the constant `partial_order.less' is created by a
2632 definition specification element in the context of locale
2635 * Method "induct": improved internal context management to support
2636 local fixes and defines on-the-fly. Thus explicit meta-level
2637 connectives !! and ==> are rarely required anymore in inductive goals
2638 (using object-logic connectives for this purpose has been long
2639 obsolete anyway). Common proof patterns are explained in
2640 src/HOL/Induct/Common_Patterns.thy, see also
2641 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2644 * Method "induct": improved handling of simultaneous goals. Instead of
2645 introducing object-level conjunction, the statement is now split into
2646 several conclusions, while the corresponding symbolic cases are nested
2647 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2648 see src/HOL/Induct/Common_Patterns.thy, for example.
2650 * Method "induct": mutual induction rules are now specified as a list
2651 of rule sharing the same induction cases. HOL packages usually provide
2652 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2653 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2654 mutual induction rules differently, i.e. like this:
2656 (induct rule: foo_bar.inducts)
2657 (induct set: foo bar)
2658 (induct pred: foo bar)
2659 (induct type: foo bar)
2661 The ML function ProjectRule.projections turns old-style rules into the
2664 * Method "coinduct": dual of induction, see
2665 src/HOL/Library/Coinductive_List.thy for various examples.
2667 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2668 considered a legacy feature.
2670 * Attribute "symmetric" produces result with standardized schematic
2671 variables (index 0). Potential INCOMPATIBILITY.
2673 * Simplifier: by default the simplifier trace only shows top level
2674 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2675 default. Thus there is less danger of being flooded by the trace. The
2676 trace indicates where parts have been suppressed.
2678 * Provers/classical: removed obsolete classical version of elim_format
2679 attribute; classical elim/dest rules are now treated uniformly when
2680 manipulating the claset.
2682 * Provers/classical: stricter checks to ensure that supplied intro,
2683 dest and elim rules are well-formed; dest and elim rules must have at
2686 * Provers/classical: attributes dest/elim/intro take an optional
2687 weight argument for the rule (just as the Pure versions). Weights are
2688 ignored by automated tools, but determine the search order of single
2691 * Syntax: input syntax now supports dummy variable binding "%_. b",
2692 where the body does not mention the bound variable. Note that dummy
2693 patterns implicitly depend on their context of bounds, which makes
2694 "{_. _}" match any set comprehension as expected. Potential
2695 INCOMPATIBILITY -- parse translations need to cope with syntactic
2696 constant "_idtdummy" in the binding position.
2698 * Syntax: removed obsolete syntactic constant "_K" and its associated
2699 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2700 for example "A -> B" => "Pi A (%_. B)".
2702 * Pure: 'class_deps' command visualizes the subclass relation, using
2703 the graph browser tool.
2705 * Pure: 'print_theory' now suppresses certain internal declarations by
2706 default; use '!' option for full details.
2711 * Method "metis" proves goals by applying the Metis general-purpose
2712 resolution prover (see also http://gilith.com/software/metis/).
2713 Examples are in the directory MetisExamples. WARNING: the
2714 Isabelle/HOL-Metis integration does not yet work properly with
2717 * Command 'sledgehammer' invokes external automatic theorem provers as
2718 background processes. It generates calls to the "metis" method if
2719 successful. These can be pasted into the proof. Users do not have to
2720 wait for the automatic provers to return. WARNING: does not really
2721 work with multi-threading.
2723 * New "auto_quickcheck" feature tests outermost goal statements for
2724 potential counter-examples. Controlled by ML references
2725 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2726 5000 milliseconds). Fails silently if statements is outside of
2727 executable fragment, or any other codgenerator problem occurs.
2729 * New constant "undefined" with axiom "undefined x = undefined".
2731 * Added class "HOL.eq", allowing for code generation with polymorphic
2734 * Some renaming of class constants due to canonical name prefixing in
2735 the new 'class' package:
2737 HOL.abs ~> HOL.abs_class.abs
2738 HOL.divide ~> HOL.divide_class.divide
2739 0 ~> HOL.zero_class.zero
2740 1 ~> HOL.one_class.one
2741 op + ~> HOL.plus_class.plus
2742 op - ~> HOL.minus_class.minus
2743 uminus ~> HOL.minus_class.uminus
2744 op * ~> HOL.times_class.times
2745 op < ~> HOL.ord_class.less
2746 op <= > HOL.ord_class.less_eq
2747 Nat.power ~> Power.power_class.power
2748 Nat.size ~> Nat.size_class.size
2749 Numeral.number_of ~> Numeral.number_class.number_of
2750 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2751 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2752 Orderings.min ~> Orderings.ord_class.min
2753 Orderings.max ~> Orderings.ord_class.max
2754 Divides.op div ~> Divides.div_class.div
2755 Divides.op mod ~> Divides.div_class.mod
2756 Divides.op dvd ~> Divides.div_class.dvd
2758 INCOMPATIBILITY. Adaptions may be required in the following cases:
2760 a) User-defined constants using any of the names "plus", "minus",
2761 "times", "less" or "less_eq". The standard syntax translations for
2762 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2765 b) Variables named "plus", "minus", "times", "less", "less_eq"
2766 INCOMPATIBILITY: use more specific names.
2768 c) Permutative equations (e.g. "a + b = b + a")
2769 Since the change of names also changes the order of terms, permutative
2770 rewrite rules may get applied in a different order. Experience shows
2771 that this is rarely the case (only two adaptions in the whole Isabelle
2772 distribution). INCOMPATIBILITY: rewrite proofs
2774 d) ML code directly refering to constant names
2775 This in general only affects hand-written proof tactics, simprocs and
2776 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2777 Consider using @{const_name} antiquotation.
2779 * New class "default" with associated constant "default".
2781 * Function "sgn" is now overloaded and available on int, real, complex
2782 (and other numeric types), using class "sgn". Two possible defs of
2783 sgn are given as equational assumptions in the classes sgn_if and
2784 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2787 * Locale "partial_order" now unified with class "order" (cf. theory
2788 Orderings), added parameter "less". INCOMPATIBILITY.
2790 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2791 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2792 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2794 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2795 changed order of proof goals in instance proofs.
2797 * The transitivity reasoner for partial and linear orders is set up
2798 for classes "order" and "linorder". Instances of the reasoner are available
2799 in all contexts importing or interpreting the corresponding locales.
2800 Method "order" invokes the reasoner separately; the reasoner
2801 is also integrated with the Simplifier as a solver. Diagnostic
2802 command 'print_orders' shows the available instances of the reasoner
2803 in the current context.
2805 * Localized monotonicity predicate in theory "Orderings"; integrated
2806 lemmas max_of_mono and min_of_mono with this predicate.
2809 * Formulation of theorem "dense" changed slightly due to integration
2810 with new class dense_linear_order.
2812 * Uniform lattice theory development in HOL.
2814 constants "meet" and "join" now named "inf" and "sup"
2815 constant "Meet" now named "Inf"
2817 classes "meet_semilorder" and "join_semilorder" now named
2818 "lower_semilattice" and "upper_semilattice"
2819 class "lorder" now named "lattice"
2820 class "comp_lat" now named "complete_lattice"
2822 Instantiation of lattice classes allows explicit definitions
2823 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2825 INCOMPATIBILITY. Theorem renames:
2827 meet_left_le ~> inf_le1
2828 meet_right_le ~> inf_le2
2829 join_left_le ~> sup_ge1
2830 join_right_le ~> sup_ge2
2831 meet_join_le ~> inf_sup_ord
2834 le_meet ~> le_inf_iff
2835 le_join ~> ge_sup_conv
2836 meet_idempotent ~> inf_idem
2837 join_idempotent ~> sup_idem
2838 meet_comm ~> inf_commute
2839 join_comm ~> sup_commute
2840 meet_leI1 ~> le_infI1
2841 meet_leI2 ~> le_infI2
2842 le_joinI1 ~> le_supI1
2843 le_joinI2 ~> le_supI2
2844 meet_assoc ~> inf_assoc
2845 join_assoc ~> sup_assoc
2846 meet_left_comm ~> inf_left_commute
2847 meet_left_idempotent ~> inf_left_idem
2848 join_left_comm ~> sup_left_commute
2849 join_left_idempotent ~> sup_left_idem
2852 le_def_meet ~> le_iff_inf
2853 le_def_join ~> le_iff_sup
2854 join_absorp2 ~> sup_absorb2
2855 join_absorp1 ~> sup_absorb1
2856 meet_absorp1 ~> inf_absorb1
2857 meet_absorp2 ~> inf_absorb2
2858 meet_join_absorp ~> inf_sup_absorb
2859 join_meet_absorp ~> sup_inf_absorb
2860 distrib_join_le ~> distrib_sup_le
2861 distrib_meet_le ~> distrib_inf_le
2863 add_meet_distrib_left ~> add_inf_distrib_left
2864 add_join_distrib_left ~> add_sup_distrib_left
2865 is_join_neg_meet ~> is_join_neg_inf
2866 is_meet_neg_join ~> is_meet_neg_sup
2867 add_meet_distrib_right ~> add_inf_distrib_right
2868 add_join_distrib_right ~> add_sup_distrib_right
2869 add_meet_join_distribs ~> add_sup_inf_distribs
2870 join_eq_neg_meet ~> sup_eq_neg_inf
2871 meet_eq_neg_join ~> inf_eq_neg_sup
2872 add_eq_meet_join ~> add_eq_inf_sup
2873 meet_0_imp_0 ~> inf_0_imp_0
2874 join_0_imp_0 ~> sup_0_imp_0
2875 meet_0_eq_0 ~> inf_0_eq_0
2876 join_0_eq_0 ~> sup_0_eq_0
2877 neg_meet_eq_join ~> neg_inf_eq_sup
2878 neg_join_eq_meet ~> neg_sup_eq_inf
2879 join_eq_if ~> sup_eq_if
2881 mono_meet ~> mono_inf
2882 mono_join ~> mono_sup
2883 meet_bool_eq ~> inf_bool_eq
2884 join_bool_eq ~> sup_bool_eq
2885 meet_fun_eq ~> inf_fun_eq
2886 join_fun_eq ~> sup_fun_eq
2887 meet_set_eq ~> inf_set_eq
2888 join_set_eq ~> sup_set_eq
2889 meet1_iff ~> inf1_iff
2890 meet2_iff ~> inf2_iff
2899 join1_iff ~> sup1_iff
2900 join2_iff ~> sup2_iff
2910 is_meet_Meet ~> is_meet_Inf
2911 Meet_bool_def ~> Inf_bool_def
2912 Meet_fun_def ~> Inf_fun_def
2913 Meet_greatest ~> Inf_greatest
2914 Meet_lower ~> Inf_lower
2915 Meet_set_def ~> Inf_set_def
2918 Sup_bool_eq ~> Sup_bool_def
2919 Sup_fun_eq ~> Sup_fun_def
2920 Sup_set_eq ~> Sup_set_def
2922 listsp_meetI ~> listsp_infI
2923 listsp_meet_eq ~> listsp_inf_eq
2928 * Added syntactic class "size"; overloaded constant "size" now has
2929 type "'a::size ==> bool"
2931 * Internal reorganisation of `size' of datatypes: size theorems
2932 "foo.size" are no longer subsumed by "foo.simps" (but are still
2933 simplification rules by default!); theorems "prod.size" now named
2936 * Class "div" now inherits from class "times" rather than "type".
2939 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2940 Linorder etc. have disappeared; operations defined in terms of
2941 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2943 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2945 * HOL-Word: New extensive library and type for generic, fixed size
2946 machine words, with arithemtic, bit-wise, shifting and rotating
2947 operations, reflection into int, nat, and bool lists, automation for
2948 linear arithmetic (by automatic reflection into nat or int), including
2949 lemmas on overflow and monotonicity. Instantiated to all appropriate
2950 arithmetic type classes, supporting automatic simplification of
2951 numerals on all operations.
2953 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2955 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2957 * Code generator library theories:
2958 - Code_Integer represents HOL integers by big integer literals in target
2960 - Code_Char represents HOL characters by character literals in target
2962 - Code_Char_chr like Code_Char, but also offers treatment of character
2963 codes; includes Code_Integer.
2964 - Executable_Set allows to generate code for finite sets using lists.
2965 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2967 - Executable_Real implements a subset of real numbers, namly those
2968 representable by rational numbers.
2969 - Efficient_Nat implements natural numbers by integers, which in general will
2970 result in higher efficency; pattern matching with 0/Suc is eliminated;
2971 includes Code_Integer.
2972 - Code_Index provides an additional datatype index which is mapped to
2973 target-language built-in integers.
2974 - Code_Message provides an additional datatype message_string which is isomorphic to
2975 strings; messages are mapped to target-language strings.
2977 * New package for inductive predicates
2979 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2982 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2983 for z_1 :: U_1 and ... and z_n :: U_m
2985 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2988 with full support for type-inference, rather than
2990 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2992 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2993 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2995 inductive "s z_1 ... z_m"
2997 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3000 For backward compatibility, there is a wrapper allowing inductive
3001 sets to be defined with the new package via
3004 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3005 for z_1 :: U_1 and ... and z_n :: U_m
3007 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3013 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3014 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3015 for z_1 :: U_1 and ... and z_n :: U_m
3017 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3018 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3021 if the additional syntax "p ..." is required.
3023 Numerous examples can be found in the subdirectories src/HOL/Auth,
3024 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3028 - Since declaration and definition of inductive sets or predicates
3029 is no longer separated, abbreviations involving the newly
3030 introduced sets or predicates must be specified together with the
3031 introduction rules after the 'where' keyword (see above), rather
3032 than before the actual inductive definition.
3034 - The variables in induction and elimination rules are now
3035 quantified in the order of their occurrence in the introduction
3036 rules, rather than in alphabetical order. Since this may break
3037 some proofs, these proofs either have to be repaired, e.g. by
3038 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3039 statements of the form
3041 case (rule_i a_i_1 ... a_i_{k_i})
3043 or the old order of quantification has to be restored by explicitly adding
3044 meta-level quantifiers in the introduction rules, i.e.
3046 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3048 - The format of the elimination rules is now
3050 p z_1 ... z_m x_1 ... x_n ==>
3051 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3056 (x_1, ..., x_n) : s z_1 ... z_m ==>
3057 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3060 for sets rather than
3062 x : s z_1 ... z_m ==>
3063 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3066 This may require terms in goals to be expanded to n-tuples
3067 (e.g. using case_tac or simplification with the split_paired_all
3068 rule) before the above elimination rule is applicable.
3070 - The elimination or case analysis rules for (mutually) inductive
3071 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3072 list of rules "p_1_..._p_k.elims" is no longer available.
3074 * New package "function"/"fun" for general recursive functions,
3075 supporting mutual and nested recursion, definitions in local contexts,
3076 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3077 for small examples, and the separate tutorial on the function
3078 package. The old recdef "package" is still available as before, but
3079 users are encouraged to use the new package.
3081 * Method "lexicographic_order" automatically synthesizes termination
3082 relations as lexicographic combinations of size measures.
3084 * Case-expressions allow arbitrary constructor-patterns (including
3085 "_") and take their order into account, like in functional
3086 programming. Internally, this is translated into nested
3087 case-expressions; missing cases are added and mapped to the predefined
3088 constant "undefined". In complicated cases printing may no longer show
3089 the original input but the internal form. Lambda-abstractions allow
3090 the same form of pattern matching: "% pat1 => e1 | ..." is an
3091 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3094 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3095 is an abbreviation for "of_nat :: nat => int". The simplification
3096 rules for "of_nat" have been changed to work like "int" did
3097 previously. Potential INCOMPATIBILITY:
3098 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3099 - of_nat_diff and of_nat_mult are no longer default simp rules
3101 * Method "algebra" solves polynomial equations over (semi)rings using
3102 Groebner bases. The (semi)ring structure is defined by locales and the
3103 tool setup depends on that generic context. Installing the method for
3104 a specific type involves instantiating the locale and possibly adding
3105 declarations for computation on the coefficients. The method is
3106 already instantiated for natural numbers and for the axiomatic class
3107 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3108 CALCULEMUS 2007 for the general principles underlying this
3109 architecture of context-aware proof-tools.
3111 * Method "ferrack" implements quantifier elimination over
3112 special-purpose dense linear orders using locales (analogous to
3113 "algebra"). The method is already installed for class
3114 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3117 * Former constant "List.op @" now named "List.append". Use ML
3118 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3119 circumvent possible incompatibilities when working on ML level.
3121 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3123 * New function listsum :: 'a list => 'a for arbitrary monoids.
3124 Special syntax: "SUM x <- xs. f x" (and latex variants)
3126 * New syntax for Haskell-like list comprehension (input only), eg.
3127 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3129 * The special syntax for function "filter" has changed from [x :
3130 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3131 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3133 * [a..b] is now defined for arbitrary linear orders. It used to be
3134 defined on nat only, as an abbreviation for [a..<Suc b]
3137 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3139 * New functions "sorted" and "sort" in src/HOL/List.thy.
3141 * New lemma collection field_simps (an extension of ring_simps) for
3142 manipulating (in)equations involving division. Multiplies with all
3143 denominators that can be proved to be non-zero (in equations) or
3144 positive/negative (in inequations).
3146 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3147 have been improved and renamed to ring_simps, group_simps and
3148 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3149 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3151 * Theory Library/Commutative_Ring: switched from recdef to function
3152 package; constants add, mul, pow now curried. Infix syntax for
3153 algebraic operations.
3155 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3158 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3161 * HOL/records: generalised field-update to take a function on the
3162 field rather than the new value: r(|A := x|) is translated to A_update
3163 (K x) r The K-combinator that is internally used is called K_record.
3164 INCOMPATIBILITY: Usage of the plain update functions has to be
3167 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3168 * x = 0, which are required for a semiring. Richer structures do not
3169 inherit from semiring_0 anymore, because this property is a theorem
3170 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3171 there is more to prove, but this is mostly trivial.
3173 * Class "recpower" is generalized to arbitrary monoids, not just
3174 commutative semirings. INCOMPATIBILITY: may need to incorporate
3175 commutativity or semiring properties additionally.
3177 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3178 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3179 better use 'abbreviation'.
3181 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3183 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3184 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3185 significant changes for setting up numeral syntax for types:
3186 - New constants Numeral.pred and Numeral.succ instead
3187 of former Numeral.bin_pred and Numeral.bin_succ.
3188 - Use integer operations instead of bin_add, bin_mult and so on.
3189 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3190 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3192 See src/HOL/Integ/IntArith.thy for an example setup.
3194 * Command 'normal_form' computes the normal form of a term that may
3195 contain free variables. For example ``normal_form "rev [a, b, c]"''
3196 produces ``[b, c, a]'' (without proof). This command is suitable for
3197 heavy-duty computations because the functions are compiled to ML
3198 first. Correspondingly, a method "normalization" is provided. See
3199 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3201 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3202 25 like -->); output depends on the "iff" print_mode, the default is
3203 "A = B" (with priority 50).
3205 * Relations less (<) and less_eq (<=) are also available on type bool.
3206 Modified syntax to disallow nesting without explicit parentheses,
3207 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3210 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3212 * Relation composition operator "op O" now has precedence 75 and binds
3213 stronger than union and intersection. INCOMPATIBILITY.
3215 * The old set interval syntax "{m..n(}" (and relatives) has been
3216 removed. Use "{m..<n}" (and relatives) instead.
3218 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3219 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3220 ``declare [[simproc del: neq]]''.
3222 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3225 * Theorem Cons_eq_map_conv no longer declared as "simp".
3227 * Theorem setsum_mult renamed to setsum_right_distrib.
3229 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3232 * Reimplemented methods "sat" and "satx", with several improvements:
3233 goals no longer need to be stated as "<prems> ==> False", equivalences
3234 (i.e. "=" on type bool) are handled, variable names of the form
3235 "lit_<n>" are no longer reserved, significant speedup.
3237 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3238 zChaff is still supported as well.
3240 * 'inductive' and 'datatype': provide projections of mutual rules,
3241 bundled as foo_bar.inducts;
3243 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3246 * Library: moved theory Accessible_Part to main HOL.
3248 * Library: added theory Coinductive_List of potentially infinite lists
3249 as greatest fixed-point.
3251 * Library: added theory AssocList which implements (finite) maps as
3254 * Method "evaluation" solves goals (i.e. a boolean expression)
3255 efficiently by compiling it to ML. The goal is "proved" (via an
3256 oracle) if it evaluates to True.
3258 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3259 also when invoked by the simplifier. This results in the Simplifier
3260 being more powerful on arithmetic goals. INCOMPATIBILITY.
3261 Configuration option fast_arith_split_limit=0 recovers the old
3264 * Support for hex (0x20) and binary (0b1001) numerals.
3266 * New method: reify eqs (t), where eqs are equations for an
3267 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3268 parameter, computes a term s::'b and a list xs::'a list and proves the
3269 theorem I xs s = t. This is also known as reification or quoting. The
3270 resulting theorem is applied to the subgoal to substitute t with I xs
3271 s. If t is omitted, the subgoal itself is reified.
3273 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3274 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3275 where f is supposed to be a computable function (in the sense of code
3276 generattion). The method uses reify to compute s and xs as above then
3277 applies corr_thm and uses normalization by evaluation to "prove" f s =
3278 r and finally gets the theorem t = r, which is again applied to the
3279 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3281 * Reflection: Automatic reification now handels binding, an example is
3282 available in src/HOL/ex/ReflectionEx.thy
3284 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3285 command 'statespace' that is similar to 'record', but introduces an
3286 abstract specification based on the locale infrastructure instead of
3287 HOL types. This leads to extra flexibility in composing state spaces,
3288 in particular multiple inheritance and renaming of components.
3293 * Hyperreal: Functions root and sqrt are now defined on negative real
3294 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3295 Nonnegativity side conditions have been removed from many lemmas, so
3296 that more subgoals may now be solved by simplification; potential
3299 * Real: new type classes formalize real normed vector spaces and
3300 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3301 and norm :: 'a => real.
3303 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3304 reals into other types. The overloaded constant Reals :: 'a set is now
3305 defined as range of_real; potential INCOMPATIBILITY.
3307 * Real: proper support for ML code generation, including 'quickcheck'.
3308 Reals are implemented as arbitrary precision rationals.
3310 * Hyperreal: Several constants that previously worked only for the
3311 reals have been generalized, so they now work over arbitrary vector
3312 spaces. Type annotations may need to be added in some cases; potential
3315 Infinitesimal :: ('a::real_normed_vector) star set
3316 HFinite :: ('a::real_normed_vector) star set
3317 HInfinite :: ('a::real_normed_vector) star set
3318 approx :: ('a::real_normed_vector) star => 'a star => bool
3319 monad :: ('a::real_normed_vector) star => 'a star set
3320 galaxy :: ('a::real_normed_vector) star => 'a star set
3321 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3322 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3323 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3324 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3325 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3326 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3327 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3328 sgn :: 'a::real_normed_vector => 'a
3329 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3331 * Complex: Some complex-specific constants are now abbreviations for
3332 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3333 hnorm. Other constants have been entirely removed in favor of the
3334 polymorphic versions (INCOMPATIBILITY):
3338 HInfinite <-- CInfinite
3339 Infinitesimal <-- CInfinitesimal
3342 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3343 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3344 (ns)deriv <-- (ns)cderiv
3349 * Formalisation of ideals and the quotient construction over rings.
3351 * Order and lattice theory no longer based on records.
3354 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3355 greatest_closed. INCOMPATIBILITY.
3357 * Method algebra is now set up via an attribute. For examples see
3358 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3359 of algebraic structures.
3361 * Renamed theory CRing to Ring.
3366 * Substantial, yet incomplete support for nominal datatypes (binding
3367 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3368 src/HOL/Nominal/Examples. Prospective users should consult
3369 http://isabelle.in.tum.de/nominal/
3374 * ML basics: just one true type int, which coincides with IntInf.int
3377 * ML within Isar: antiquotations allow to embed statically-checked
3378 formal entities in the source, referring to the context available at
3379 compile-time. For example:
3381 ML {* @{sort "{zero,one}"} *}
3382 ML {* @{typ "'a => 'b"} *}
3383 ML {* @{term "%x. x"} *}
3384 ML {* @{prop "x == y"} *}
3385 ML {* @{ctyp "'a => 'b"} *}
3386 ML {* @{cterm "%x. x"} *}
3387 ML {* @{cprop "x == y"} *}
3388 ML {* @{thm asm_rl} *}
3389 ML {* @{thms asm_rl} *}
3390 ML {* @{type_name c} *}
3391 ML {* @{type_syntax c} *}
3392 ML {* @{const_name c} *}
3393 ML {* @{const_syntax c} *}
3396 ML {* @{theory Pure} *}
3397 ML {* @{theory_ref} *}
3398 ML {* @{theory_ref Pure} *}
3401 ML {* @{clasimpset} *}
3403 The same works for sources being ``used'' within an Isar context.
3405 * ML in Isar: improved error reporting; extra verbosity with
3406 ML_Context.trace enabled.
3408 * Pure/General/table.ML: the join operations now works via exceptions
3409 DUP/SAME instead of type option. This is simpler in simple cases, and
3410 admits slightly more efficient complex applications.
3412 * Pure: 'advanced' translation functions (parse_translation etc.) now
3413 use Context.generic instead of just theory.
3415 * Pure: datatype Context.generic joins theory/Proof.context and
3416 provides some facilities for code that works in either kind of
3417 context, notably GenericDataFun for uniform theory and proof data.
3419 * Pure: simplified internal attribute type, which is now always
3420 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3421 local (Proof.context) attributes have been discontinued, while
3422 minimizing code duplication. Thm.rule_attribute and
3423 Thm.declaration_attribute build canonical attributes; see also structure
3424 Context for further operations on Context.generic, notably
3425 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3426 declarations and definitions.
3428 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3429 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3430 init only required for impure data. INCOMPATIBILITY: empty really need
3431 to be empty (no dependencies on theory content!)
3433 * Pure/kernel: consts certification ignores sort constraints given in
3434 signature declarations. (This information is not relevant to the
3435 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3436 potential INCOMPATIBILITY.
3438 * Pure: axiomatic type classes are now purely definitional, with
3439 explicit proofs of class axioms and super class relations performed
3440 internally. See Pure/axclass.ML for the main internal interfaces --
3441 notably AxClass.define_class supercedes AxClass.add_axclass, and
3442 AxClass.axiomatize_class/classrel/arity supersede
3443 Sign.add_classes/classrel/arities.
3445 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3446 global/local versions on theory vs. Proof.context have been
3447 discontinued; Attrib.syntax and Method.syntax have been adapted
3448 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3449 attributes, methods, etc.
3451 * Pure: several functions of signature "... -> theory -> theory * ..."
3452 have been reoriented to "... -> theory -> ... * theory" in order to
3453 allow natural usage in combination with the ||>, ||>>, |-> and
3454 fold_map combinators.
3456 * Pure: official theorem names (closed derivations) and additional
3457 comments (tags) are now strictly separate. Name hints -- which are
3458 maintained as tags -- may be attached any time without affecting the
3461 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3462 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3463 achieve the old behaviour.
3465 * Pure: the "Goal" constant is now called "prop", supporting a
3466 slightly more general idea of ``protecting'' meta-level rule
3469 * Pure: Logic.(un)varify only works in a global context, which is now
3470 enforced instead of silently assumed. INCOMPATIBILITY, may use
3471 Logic.legacy_(un)varify as temporary workaround.
3473 * Pure: structure Name provides scalable operations for generating
3474 internal variable names, notably Name.variants etc. This replaces
3475 some popular functions from term.ML:
3477 Term.variant -> Name.variant
3478 Term.variantlist -> Name.variant_list
3479 Term.invent_names -> Name.invent_list
3481 Note that low-level renaming rarely occurs in new code -- operations
3482 from structure Variable are used instead (see below).
3484 * Pure: structure Variable provides fundamental operations for proper
3485 treatment of fixed/schematic variables in a context. For example,
3486 Variable.import introduces fixes for schematics of given facts and
3487 Variable.export reverses the effect (up to renaming) -- this replaces
3488 various freeze_thaw operations.
3490 * Pure: structure Goal provides simple interfaces for
3491 init/conclude/finish and tactical prove operations (replacing former
3492 Tactic.prove). Goal.prove is the canonical way to prove results
3493 within a given context; Goal.prove_global is a degraded version for
3494 theory level goals, including a global Drule.standard. Note that
3495 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3496 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3497 in a locale context).
3499 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3500 and type checking (Syntax.check_term etc.), with common combinations
3501 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3502 which are considered legacy and await removal.
3504 * Pure/Syntax: generic interfaces for type unchecking
3505 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3506 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3507 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3508 available for convenience, but refer to the very same operations using
3509 a mere theory instead of a full context.
3511 * Isar: simplified treatment of user-level errors, using exception
3512 ERROR of string uniformly. Function error now merely raises ERROR,
3513 without any side effect on output channels. The Isar toplevel takes
3514 care of proper display of ERROR exceptions. ML code may use plain
3515 handle/can/try; cat_error may be used to concatenate errors like this:
3517 ... handle ERROR msg => cat_error msg "..."
3519 Toplevel ML code (run directly or through the Isar toplevel) may be
3520 embedded into the Isar toplevel with exception display/debug like
3523 Isar.toplevel (fn () => ...)
3525 INCOMPATIBILITY, removed special transform_error facilities, removed
3526 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3527 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3528 -- use plain ERROR instead.
3530 * Isar: theory setup now has type (theory -> theory), instead of a
3531 list. INCOMPATIBILITY, may use #> to compose setup functions.
3533 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3534 ProofContext.debug/verbose flags.
3536 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3537 theory before entering a proof state. Transactions now always see a
3538 quasi-functional intermediate checkpoint, both in interactive and
3541 * Isar: simplified interfaces for outer syntax. Renamed
3542 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3543 OuterSyntax.add_parsers -- this functionality is now included in
3544 OuterSyntax.command etc. INCOMPATIBILITY.
3546 * Simplifier: the simpset of a running simplification process now
3547 contains a proof context (cf. Simplifier.the_context), which is the
3548 very context that the initial simpset has been retrieved from (by
3549 simpset_of/local_simpset_of). Consequently, all plug-in components
3550 (solver, looper etc.) may depend on arbitrary proof data.
3552 * Simplifier.inherit_context inherits the proof context (plus the
3553 local bounds) of the current simplification process; any simproc
3554 etc. that calls the Simplifier recursively should do this! Removed
3555 former Simplifier.inherit_bounds, which is already included here --
3556 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3557 specify an explicit context using Simplifier.context/theory_context.
3559 * Simplifier/Classical Reasoner: more abstract interfaces
3560 change_simpset/claset for modifying the simpset/claset reference of a
3561 theory; raw versions simpset/claset_ref etc. have been discontinued --
3564 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3570 * settings: the default heap location within ISABELLE_HOME_USER now
3571 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3572 Isabelle installations.
3574 * isabelle-process: option -S (secure mode) disables some critical
3575 operations, notably runtime compilation and evaluation of ML source
3578 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3580 * Support for parallel execution, using native multicore support of
3581 Poly/ML 5.1. The theory loader exploits parallelism when processing
3582 independent theories, according to the given theory header
3583 specifications. The maximum number of worker threads is specified via
3584 usedir option -M or the "max-threads" setting in Proof General. A
3585 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3586 to 6 on a 8-core machine. User-code needs to observe certain
3587 guidelines for thread-safe programming, see appendix A in the Isar
3588 Implementation manual.
3592 New in Isabelle2005 (October 2005)
3593 ----------------------------------
3597 * Theory headers: the new header syntax for Isar theories is
3600 imports <theory1> ... <theoryN>
3601 uses <file1> ... <fileM>
3604 where the 'uses' part is optional. The previous syntax
3606 theory <name> = <theory1> + ... + <theoryN>:
3608 will disappear in the next release. Use isatool fixheaders to convert
3609 existing theory files. Note that there is no change in ancient
3610 non-Isar theories now, but these will disappear soon.
3612 * Theory loader: parent theories can now also be referred to via
3613 relative and absolute paths.
3615 * Command 'find_theorems' searches for a list of criteria instead of a
3616 list of constants. Known criteria are: intro, elim, dest, name:string,
3617 simp:term, and any term. Criteria can be preceded by '-' to select
3618 theorems that do not match. Intro, elim, dest select theorems that
3619 match the current goal, name:s selects theorems whose fully qualified
3620 name contain s, and simp:term selects all simplification rules whose
3621 lhs match term. Any other term is interpreted as pattern and selects
3622 all theorems matching the pattern. Available in ProofGeneral under
3623 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3625 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3627 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3628 matching the current goal as introduction rule and not having "HOL."
3629 in their name (i.e. not being defined in theory HOL).
3631 * Command 'thms_containing' has been discontinued in favour of
3632 'find_theorems'; INCOMPATIBILITY.
3634 * Communication with Proof General is now 8bit clean, which means that
3635 Unicode text in UTF-8 encoding may be used within theory texts (both
3636 formal and informal parts). Cf. option -U of the Isabelle Proof
3637 General interface. Here are some simple examples (cf. src/HOL/ex):
3639 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3640 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3642 * Improved efficiency of the Simplifier and, to a lesser degree, the
3643 Classical Reasoner. Typical big applications run around 2 times
3647 *** Document preparation ***
3649 * Commands 'display_drafts' and 'print_drafts' perform simple output
3650 of raw sources. Only those symbols that do not require additional
3651 LaTeX packages (depending on comments in isabellesym.sty) are
3652 displayed properly, everything else is left verbatim. isatool display
3653 and isatool print are used as front ends (these are subject to the
3654 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3656 * Command tags control specific markup of certain regions of text,
3657 notably folding and hiding. Predefined tags include "theory" (for
3658 theory begin and end), "proof" for proof commands, and "ML" for
3659 commands involving ML code; the additional tags "visible" and
3660 "invisible" are unused by default. Users may give explicit tag
3661 specifications in the text, e.g. ''by %invisible (auto)''. The
3662 interpretation of tags is determined by the LaTeX job during document
3663 preparation: see option -V of isatool usedir, or options -n and -t of
3664 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3667 Several document versions may be produced at the same time via isatool
3668 usedir (the generated index.html will link all of them). Typical
3669 specifications include ''-V document=theory,proof,ML'' to present
3670 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3671 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3672 these parts without any formal replacement text. The Isabelle site
3673 default settings produce ''document'' and ''outline'' versions as
3676 * Several new antiquotations:
3678 @{term_type term} prints a term with its type annotated;
3680 @{typeof term} prints the type of a term;
3682 @{const const} is the same as @{term const}, but checks that the
3683 argument is a known logical constant;
3685 @{term_style style term} and @{thm_style style thm} print a term or
3686 theorem applying a "style" to it
3690 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3691 definitions, equations, inequations etc., 'concl' printing only the
3692 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3693 to print the specified premise. TermStyle.add_style provides an ML
3694 interface for introducing further styles. See also the "LaTeX Sugar"
3695 document practical applications. The ML antiquotation prints
3696 type-checked ML expressions verbatim.
3698 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3699 and 'text' support optional locale specification '(in loc)', which
3700 specifies the default context for interpreting antiquotations. For
3701 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3703 * Option 'locale=NAME' of antiquotations specifies an alternative
3704 context interpreting the subsequent argument. For example: @{thm
3705 [locale=lattice] inf_assoc}.
3707 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3710 * Proper output of antiquotations for theory commands involving a
3711 proof context (such as 'locale' or 'theorem (in loc) ...').
3713 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3714 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3716 * isatool usedir: new option -C (default true) controls whether option
3717 -D should include a copy of the original document directory; -C false
3718 prevents unwanted effects such as copying of administrative CVS data.
3723 * Considerably improved version of 'constdefs' command. Now performs
3724 automatic type-inference of declared constants; additional support for
3725 local structure declarations (cf. locales and HOL records), see also
3726 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3727 sequential dependencies of definitions within a single 'constdefs'
3728 section; moreover, the declared name needs to be an identifier. If
3729 all fails, consider to fall back on 'consts' and 'defs' separately.
3731 * Improved indexed syntax and implicit structures. First of all,
3732 indexed syntax provides a notational device for subscripted
3733 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3734 expressions. Secondly, in a local context with structure
3735 declarations, number indexes \<^sub>n or the empty index (default
3736 number 1) refer to a certain fixed variable implicitly; option
3737 show_structs controls printing of implicit structures. Typical
3738 applications of these concepts involve record types and locales.
3740 * New command 'no_syntax' removes grammar declarations (and
3741 translations) resulting from the given syntax specification, which is
3742 interpreted in the same manner as for the 'syntax' command.
3744 * 'Advanced' translation functions (parse_translation etc.) may depend
3745 on the signature of the theory context being presently used for
3746 parsing/printing, see also isar-ref manual.
3748 * Improved 'oracle' command provides a type-safe interface to turn an
3749 ML expression of type theory -> T -> term into a primitive rule of
3750 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3751 is already included here); see also FOL/ex/IffExample.thy;
3754 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3755 before); "cI" is no longer bound, use "c.intro" instead.
3756 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3757 axclasses vs. locales.
3759 * Improved internal renaming of symbolic identifiers -- attach primes
3760 instead of base 26 numbers.
3762 * New flag show_question_marks controls printing of leading question
3763 marks in schematic variable names.
3765 * In schematic variable names, *any* symbol following \<^isub> or
3766 \<^isup> is now treated as part of the base name. For example, the
3767 following works without printing of awkward ".0" indexes:
3769 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3772 * Inner syntax includes (*(*nested*) comments*).
3774 * Pretty printer now supports unbreakable blocks, specified in mixfix
3775 annotations as "(00...)".
3777 * Clear separation of logical types and nonterminals, where the latter
3778 may only occur in 'syntax' specifications or type abbreviations.
3779 Before that distinction was only partially implemented via type class
3780 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3781 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3782 exotic syntax specifications may require further adaption
3783 (e.g. Cube/Cube.thy).
3785 * Removed obsolete type class "logic", use the top sort {} instead.
3786 Note that non-logical types should be declared as 'nonterminals'
3787 rather than 'types'. INCOMPATIBILITY for new object-logic
3790 * Attributes 'induct' and 'cases': type or set names may now be
3791 locally fixed variables as well.
3793 * Simplifier: can now control the depth to which conditional rewriting
3794 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3797 * Simplifier: simplification procedures may now take the current
3798 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3799 interface), which is very useful for calling the Simplifier
3800 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3801 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3802 low-level mk_simproc no longer applies Logic.varify internally, to
3803 allow for use in a context of fixed variables.
3805 * thin_tac now works even if the assumption being deleted contains !!
3806 or ==>. More generally, erule now works even if the major premise of
3807 the elimination rule contains !! or ==>.
3809 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3811 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3812 from Pure, which contains all common declarations already. Both
3813 theories are defined via plain Isabelle/Isar .thy files.
3814 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3815 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3816 use isatool fixcpure to adapt your theory and ML sources.
3818 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3819 selections of theorems in named facts via index ranges.
3821 * 'print_theorems': in theory mode, really print the difference
3822 wrt. the last state (works for interactive theory development only),
3823 in proof mode print all local facts (cf. 'print_facts');
3825 * 'hide': option '(open)' hides only base names.
3827 * More efficient treatment of intermediate checkpoints in interactive
3830 * Code generator is now invoked via code_module (incremental code
3831 generation) and code_library (modular code generation, ML structures
3832 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3833 must be quoted when used as identifiers.
3835 * New 'value' command for reading, evaluating and printing terms using
3836 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3837 quoted when used as identifier.
3842 * New commands for the interpretation of locale expressions in
3843 theories (1), locales (2) and proof contexts (3). These generate
3844 proof obligations from the expression specification. After the
3845 obligations have been discharged, theorems of the expression are added
3846 to the theory, target locale or proof context. The synopsis of the
3847 commands is a follows:
3849 (1) interpretation expr inst
3850 (2) interpretation target < expr
3851 (3) interpret expr inst
3853 Interpretation in theories and proof contexts require a parameter
3854 instantiation of terms from the current context. This is applied to
3855 specifications and theorems of the interpreted expression.
3856 Interpretation in locales only permits parameter renaming through the
3857 locale expression. Interpretation is smart in that interpretations
3858 that are active already do not occur in proof obligations, neither are
3859 instantiated theorems stored in duplicate. Use 'print_interps' to
3860 inspect active interpretations of a particular locale. For details,
3861 see the Isar Reference manual. Examples can be found in
3862 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3864 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3865 'interpret' instead.
3867 * New context element 'constrains' for adding type constraints to
3870 * Context expressions: renaming of parameters with syntax
3873 * Locale declaration: 'includes' disallowed.
3875 * Proper static binding of attribute syntax -- i.e. types / terms /
3876 facts mentioned as arguments are always those of the locale definition
3877 context, independently of the context of later invocations. Moreover,
3878 locale operations (renaming and type / term instantiation) are applied
3879 to attribute arguments as expected.
3881 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3882 actual attributes; rare situations may require Attrib.attribute to
3883 embed those attributes into Attrib.src that lack concrete syntax.
3884 Attribute implementations need to cooperate properly with the static
3885 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3886 Attrib.XXX_thm etc. already do the right thing without further
3887 intervention. Only unusual applications -- such as "where" or "of"
3888 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3889 on the context and the facts involved -- may have to assign parsed
3890 values to argument tokens explicitly.
3892 * Changed parameter management in theorem generation for long goal
3893 statements with 'includes'. INCOMPATIBILITY: produces a different
3894 theorem statement in rare situations.
3896 * Locale inspection command 'print_locale' omits notes elements. Use
3897 'print_locale!' to have them included in the output.
3902 * Provers/hypsubst.ML: improved version of the subst method, for
3903 single-step rewriting: it now works in bound variable contexts. New is
3904 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3905 rewrite a different subterm than the original subst method, which is
3906 still available as 'simplesubst'.
3908 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3911 * Provers/trancl.ML: new transitivity reasoner for transitive and
3912 reflexive-transitive closure of relations.
3914 * Provers/blast.ML: new reference depth_limit to make blast's depth
3915 limit (previously hard-coded with a value of 20) user-definable.
3917 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3918 is peformed already. Object-logics merely need to finish their
3919 initial simpset configuration as before. INCOMPATIBILITY.
3924 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3927 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3929 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3930 and x-symbol; use option '-m epsilon' to get it actually printed.
3931 Moreover, the mathematically important symbolic identifier \<epsilon>
3932 becomes available as variable, constant etc. INCOMPATIBILITY,
3934 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3935 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3936 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3937 support corresponding Isar calculations.
3939 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3942 * theory SetInterval: changed the syntax for open intervals:
3951 The old syntax is still supported but will disappear in the next
3952 release. For conversion use the following Emacs search and replace
3953 patterns (these are not perfect but work quite well):
3955 {)\([^\.]*\)\.\. -> {\1<\.\.}
3956 \.\.\([^(}]*\)(} -> \.\.<\1}
3958 * Theory Commutative_Ring (in Library): method comm_ring for proving
3959 equalities in commutative rings; method 'algebra' provides a generic
3962 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3963 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3964 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3967 Some new syntax forms are available:
3969 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3970 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3971 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3972 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3974 The latter form "\<Sum>x < k. e" used to be based on a separate
3975 function "Summation", which has been discontinued.
3977 * theory Finite_Set: in structured induction proofs, the insert case
3978 is now 'case (insert x F)' instead of the old counterintuitive 'case
3981 * The 'refute' command has been extended to support a much larger
3982 fragment of HOL, including axiomatic type classes, constdefs and
3983 typedefs, inductive datatypes and recursion.
3985 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3986 Requires zChaff with proof generation to be installed. See
3987 HOL/ex/SAT_Examples.thy for examples.
3989 * Datatype induction via method 'induct' now preserves the name of the
3990 induction variable. For example, when proving P(xs::'a list) by
3991 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3992 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3993 in unstructured proof scripts.
3995 * Reworked implementation of records. Improved scalability for
3996 records with many fields, avoiding performance problems for type
3997 inference. Records are no longer composed of nested field types, but
3998 of nested extension types. Therefore the record type only grows linear
3999 in the number of extensions and not in the number of fields. The
4000 top-level (users) view on records is preserved. Potential
4001 INCOMPATIBILITY only in strange cases, where the theory depends on the
4002 old record representation. The type generated for a record is called
4003 <record_name>_ext_type.
4005 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4006 proofs triggered by a record definition or a simproc (if
4007 quick_and_dirty is enabled). Definitions of large records can take
4010 New simproc record_upd_simproc for simplification of multiple record
4011 updates enabled by default. Moreover, trivial updates are also
4012 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4013 occasionally, since simplification is more powerful by default.
4015 * typedef: proper support for polymorphic sets, which contain extra
4016 type-variables in the term.
4018 * Simplifier: automatically reasons about transitivity chains
4019 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4020 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4021 old proofs break occasionally as simplification may now solve more
4022 goals than previously.
4024 * Simplifier: converts x <= y into x = y if assumption y <= x is
4025 present. Works for all partial orders (class "order"), in particular
4026 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4029 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4030 bound variable or a constant then the let is unfolded. Otherwise
4031 first a is simplified to b, and then f b is simplified to g. If
4032 possible we abstract b from g arriving at "let x = b in h x",
4033 otherwise we unfold the let and arrive at g. The simproc can be
4034 enabled/disabled by the reference use_let_simproc. Potential
4035 INCOMPATIBILITY since simplification is more powerful by default.
4037 * Classical reasoning: the meson method now accepts theorems as arguments.
4039 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4040 jobs to provide advice on the provability of subgoals.
4042 * Theory OrderedGroup and Ring_and_Field: various additions and
4043 improvements to faciliate calculations involving equalities and
4046 The following theorems have been eliminated or modified
4049 abs_eq now named abs_of_nonneg
4050 abs_of_ge_0 now named abs_of_nonneg
4051 abs_minus_eq now named abs_of_nonpos
4052 imp_abs_id now named abs_of_nonneg
4053 imp_abs_neg_id now named abs_of_nonpos
4054 mult_pos now named mult_pos_pos
4055 mult_pos_le now named mult_nonneg_nonneg
4056 mult_pos_neg_le now named mult_nonneg_nonpos
4057 mult_pos_neg2_le now named mult_nonneg_nonpos2
4058 mult_neg now named mult_neg_neg
4059 mult_neg_le now named mult_nonpos_nonpos
4061 * The following lemmas in Ring_and_Field have been added to the simplifier:
4064 not_square_less_zero
4066 The following lemmas have been deleted from Real/RealPow:
4076 * Theory Parity: added rules for simplifying exponents.
4080 The following theorems have been eliminated or modified
4083 list_all_Nil now named list_all.simps(1)
4084 list_all_Cons now named list_all.simps(2)
4085 list_all_conv now named list_all_iff
4086 set_mem_eq now named mem_iff
4088 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4089 asymptotic "big O" calculations. See the notes in BigO.thy.
4094 * Theory RealDef: better support for embedding natural numbers and
4095 integers in the reals.
4097 The following theorems have been eliminated or modified
4100 exp_ge_add_one_self now requires no hypotheses
4101 real_of_int_add reversed direction of equality (use [symmetric])
4102 real_of_int_minus reversed direction of equality (use [symmetric])
4103 real_of_int_diff reversed direction of equality (use [symmetric])
4104 real_of_int_mult reversed direction of equality (use [symmetric])
4106 * Theory RComplete: expanded support for floor and ceiling functions.
4108 * Theory Ln is new, with properties of the natural logarithm
4110 * Hyperreal: There is a new type constructor "star" for making
4111 nonstandard types. The old type names are now type synonyms:
4115 hcomplex = complex star
4117 * Hyperreal: Many groups of similarly-defined constants have been
4118 replaced by polymorphic versions (INCOMPATIBILITY):
4120 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4122 starset <-- starsetNat, starsetC
4123 *s* <-- *sNat*, *sc*
4124 starset_n <-- starsetNat_n, starsetC_n
4125 *sn* <-- *sNatn*, *scn*
4126 InternalSets <-- InternalNatSets, InternalCSets
4128 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4129 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4130 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4131 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4132 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4134 * Hyperreal: Many type-specific theorems have been removed in favor of
4135 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4137 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4138 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4139 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4140 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4141 right_minus <-- hypreal_add_minus
4142 left_minus <-- {hypreal,hcomplex}_add_minus_left
4143 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4144 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4145 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4146 mult_1_right <-- hcomplex_mult_one_right
4147 mult_zero_left <-- hcomplex_mult_zero_left
4148 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4149 right_distrib <-- hypnat_add_mult_distrib2
4150 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4151 right_inverse <-- hypreal_mult_inverse
4152 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4153 order_refl <-- {hypreal,hypnat}_le_refl
4154 order_trans <-- {hypreal,hypnat}_le_trans
4155 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4156 order_less_le <-- {hypreal,hypnat}_less_le
4157 linorder_linear <-- {hypreal,hypnat}_le_linear
4158 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4159 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4160 add_nonneg_nonneg <-- hypreal_le_add_order
4162 * Hyperreal: Separate theorems having to do with type-specific
4163 versions of constants have been merged into theorems that apply to the
4164 new polymorphic constants (INCOMPATIBILITY):
4166 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4167 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4168 STAR_Un <-- {STAR,NatStar,STARC}_Un
4169 STAR_Int <-- {STAR,NatStar,STARC}_Int
4170 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4171 STAR_subset <-- {STAR,NatStar,STARC}_subset
4172 STAR_mem <-- {STAR,NatStar,STARC}_mem
4173 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4174 STAR_diff <-- {STAR,STARC}_diff
4175 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4176 STARC_hcomplex_of_complex}_image_subset
4177 starset_n_Un <-- starset{Nat,C}_n_Un
4178 starset_n_Int <-- starset{Nat,C}_n_Int
4179 starset_n_Compl <-- starset{Nat,C}_n_Compl
4180 starset_n_diff <-- starset{Nat,C}_n_diff
4181 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4182 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4183 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4184 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4185 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4186 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4187 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4188 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4189 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4190 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4191 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4192 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4193 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4194 starfun_diff <-- starfun{C,RC,CR}_diff
4195 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4196 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4197 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4198 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4199 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4200 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4201 starfun_Id <-- starfunC_Id
4202 starfun_approx <-- starfun{Nat,CR}_approx
4203 starfun_capprox <-- starfun{C,RC}_capprox
4204 starfun_abs <-- starfunNat_rabs
4205 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4206 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4207 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4208 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4209 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4210 starfun_add_approx <-- starfunCR_add_approx
4211 starfun_inverse_inverse <-- starfunC_inverse_inverse
4212 starfun_divide <-- starfun{C,CR,RC}_divide
4213 starfun_n <-- starfun{Nat,C}_n
4214 starfun_n_mult <-- starfun{Nat,C}_n_mult
4215 starfun_n_add <-- starfun{Nat,C}_n_add
4216 starfun_n_add_minus <-- starfunNat_n_add_minus
4217 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4218 starfun_n_minus <-- starfun{Nat,C}_n_minus
4219 starfun_n_eq <-- starfun{Nat,C}_n_eq
4221 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4222 star_n_minus <-- {hypreal,hcomplex}_minus
4223 star_n_diff <-- {hypreal,hcomplex}_diff
4224 star_n_mult <-- {hypreal,hcomplex}_mult
4225 star_n_inverse <-- {hypreal,hcomplex}_inverse
4226 star_n_le <-- {hypreal,hypnat}_le
4227 star_n_less <-- {hypreal,hypnat}_less
4228 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4229 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4230 star_n_abs <-- hypreal_hrabs
4231 star_n_divide <-- hcomplex_divide
4233 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4234 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4235 star_of_diff <-- hypreal_of_real_diff
4236 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4237 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4238 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4239 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4240 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4241 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4242 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4243 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4244 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4245 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4246 star_of_number_of <-- {hypreal,hcomplex}_number_of
4247 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4248 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4249 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4250 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4251 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4252 star_of_power <-- hypreal_of_real_power
4253 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4255 * Hyperreal: new method "transfer" that implements the transfer
4256 principle of nonstandard analysis. With a subgoal that mentions
4257 nonstandard types like "'a star", the command "apply transfer"
4258 replaces it with an equivalent one that mentions only standard types.
4259 To be successful, all free variables must have standard types; non-
4260 standard variables must have explicit universal quantifiers.
4262 * Hyperreal: A theory of Taylor series.
4267 * Discontinued special version of 'constdefs' (which used to support
4268 continuous functions) in favor of the general Pure one with full
4271 * New simplification procedure for solving continuity conditions; it
4272 is much faster on terms with many nested lambda abstractions (cubic
4273 instead of exponential time).
4275 * New syntax for domain package: selector names are now optional.
4276 Parentheses should be omitted unless argument is lazy, for example:
4278 domain 'a stream = cons "'a" (lazy "'a stream")
4280 * New command 'fixrec' for defining recursive functions with pattern
4281 matching; defining multiple functions with mutual recursion is also
4282 supported. Patterns may include the constants cpair, spair, up, sinl,
4283 sinr, or any data constructor defined by the domain package. The given
4284 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4285 syntax and examples.
4287 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4288 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4289 but the proof obligation additionally includes an admissibility
4290 requirement. The packages generate instances of class cpo or pcpo,
4291 with continuity and strictness theorems for Rep and Abs.
4293 * HOLCF: Many theorems have been renamed according to a more standard naming
4294 scheme (INCOMPATIBILITY):
4296 foo_inject: "foo$x = foo$y ==> x = y"
4297 foo_eq: "(foo$x = foo$y) = (x = y)"
4298 foo_less: "(foo$x << foo$y) = (x << y)"
4299 foo_strict: "foo$UU = UU"
4300 foo_defined: "... ==> foo$x ~= UU"
4301 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4306 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4307 including the First Isomorphism Theorem (on quotienting by the kernel
4310 * ZF/Simplifier: install second copy of type solver that actually
4311 makes use of TC rules declared to Isar proof contexts (or locales);
4312 the old version is still required for ML proof scripts.
4317 * Converted to Isar theory format; use locales instead of axiomatic
4323 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4326 * Pure/library.ML no longer defines its own option datatype, but uses
4327 that of the SML basis, which has constructors NONE and SOME instead of
4328 None and Some, as well as exception Option.Option instead of OPTION.
4329 The functions the, if_none, is_some, is_none have been adapted
4330 accordingly, while Option.map replaces apsome.
4332 * Pure/library.ML: the exception LIST has been given up in favour of
4333 the standard exceptions Empty and Subscript, as well as
4334 Library.UnequalLengths. Function like Library.hd and Library.tl are
4335 superceded by the standard hd and tl functions etc.
4337 A number of basic list functions are no longer exported to the ML
4338 toplevel, as they are variants of predefined functions. The following
4339 suggests how one can translate existing code:
4341 rev_append xs ys = List.revAppend (xs, ys)
4342 nth_elem (i, xs) = List.nth (xs, i)
4343 last_elem xs = List.last xs
4344 flat xss = List.concat xss
4345 seq fs = List.app fs
4346 partition P xs = List.partition P xs
4347 mapfilter f xs = List.mapPartial f xs
4349 * Pure/library.ML: several combinators for linear functional
4350 transformations, notably reverse application and composition:
4353 (x, y) |-> f f #-> g
4355 * Pure/library.ML: introduced/changed precedence of infix operators:
4357 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4359 infix 3 o oo ooo oooo;
4360 infix 4 ~~ upto downto;
4362 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4365 * Pure/library.ML: natural list combinators fold, fold_rev, and
4366 fold_map support linear functional transformations and nesting. For
4369 fold f [x1, ..., xN] y =
4370 y |> f x1 |> ... |> f xN
4372 (fold o fold) f [xs1, ..., xsN] y =
4373 y |> fold f xs1 |> ... |> fold f xsN
4375 fold f [x1, ..., xN] =
4378 (fold o fold) f [xs1, ..., xsN] =
4379 fold f xs1 #> ... #> fold f xsN
4381 * Pure/library.ML: the following selectors on type 'a option are
4384 the: 'a option -> 'a (*partial*)
4385 these: 'a option -> 'a where 'a = 'b list
4386 the_default: 'a -> 'a option -> 'a
4387 the_list: 'a option -> 'a list
4389 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4390 basic operations for association lists, following natural argument
4391 order; moreover the explicit equality predicate passed here avoids
4392 potentially expensive polymorphic runtime equality checks.
4393 The old functions may be expressed as follows:
4395 assoc = uncurry (AList.lookup (op =))
4396 assocs = these oo AList.lookup (op =)
4397 overwrite = uncurry (AList.update (op =)) o swap
4399 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4401 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4402 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4404 replacing make_keylist and keyfilter (occassionally used)
4407 make_keylist = AList.make
4408 keyfilter = AList.find (op =)
4410 * eq_fst and eq_snd now take explicit equality parameter, thus
4411 avoiding eqtypes. Naive rewrites:
4413 eq_fst = eq_fst (op =)
4414 eq_snd = eq_snd (op =)
4416 * Removed deprecated apl and apr (rarely used).
4419 apl (n, op) =>>= curry op n
4420 apr (op, m) =>>= fn n => op (n, m)
4422 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4423 provides a reasonably efficient light-weight implementation of sets as
4426 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4427 few new operations; existing lookup and update are now curried to
4428 follow natural argument order (for use with fold etc.);
4429 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4431 * Pure/General: output via the Isabelle channels of
4432 writeln/warning/error etc. is now passed through Output.output, with a
4433 hook for arbitrary transformations depending on the print_mode
4434 (cf. Output.add_mode -- the first active mode that provides a output
4435 function wins). Already formatted output may be embedded into further
4436 text via Output.raw; the result of Pretty.string_of/str_of and derived
4437 functions (string_of_term/cterm/thm etc.) is already marked raw to
4438 accommodate easy composition of diagnostic messages etc. Programmers
4439 rarely need to care about Output.output or Output.raw at all, with
4440 some notable exceptions: Output.output is required when bypassing the
4441 standard channels (writeln etc.), or in token translations to produce
4442 properly formatted results; Output.raw is required when capturing
4443 already output material that will eventually be presented to the user
4444 a second time. For the default print mode, both Output.output and
4445 Output.raw have no effect.
4447 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4448 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4449 cumulative results are displayed at the end of a batch session.
4451 * Pure/General: File.sysify_path and File.quote_sysify path have been
4452 replaced by File.platform_path and File.shell_path (with appropriate
4453 hooks). This provides a clean interface for unusual systems where the
4454 internal and external process view of file names are different.
4456 * Pure: more efficient orders for basic syntactic entities: added
4457 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4458 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4459 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4460 orders now -- potential INCOMPATIBILITY for code that depends on a
4461 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4462 Library.sort_strings on result).
4464 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4465 fold_types traverse types/terms from left to right, observing natural
4466 argument order. Supercedes previous foldl_XXX versions, add_frees,
4467 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4469 * Pure: name spaces have been refined, with significant changes of the
4470 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4471 to extern(_table). The plain name entry path is superceded by a
4472 general 'naming' context, which also includes the 'policy' to produce
4473 a fully qualified name and external accesses of a fully qualified
4474 name; NameSpace.extend is superceded by context dependent
4475 Sign.declare_name. Several theory and proof context operations modify
4476 the naming context. Especially note Theory.restore_naming and
4477 ProofContext.restore_naming to get back to a sane state; note that
4478 Theory.add_path is no longer sufficient to recover from
4479 Theory.absolute_path in particular.
4481 * Pure: new flags short_names (default false) and unique_names
4482 (default true) for controlling output of qualified names. If
4483 short_names is set, names are printed unqualified. If unique_names is
4484 reset, the name prefix is reduced to the minimum required to achieve
4485 the original result when interning again, even if there is an overlap
4486 with earlier declarations.
4488 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4489 now 'extend', and 'merge' gets an additional Pretty.pp argument
4490 (useful for printing error messages). INCOMPATIBILITY.
4492 * Pure: major reorganization of the theory context. Type Sign.sg and
4493 Theory.theory are now identified, referring to the universal
4494 Context.theory (see Pure/context.ML). Actual signature and theory
4495 content is managed as theory data. The old code and interfaces were
4496 spread over many files and structures; the new arrangement introduces
4497 considerable INCOMPATIBILITY to gain more clarity:
4499 Context -- theory management operations (name, identity, inclusion,
4500 parents, ancestors, merge, etc.), plus generic theory data;
4502 Sign -- logical signature and syntax operations (declaring consts,
4503 types, etc.), plus certify/read for common entities;
4505 Theory -- logical theory operations (stating axioms, definitions,
4506 oracles), plus a copy of logical signature operations (consts,
4507 types, etc.); also a few basic management operations (Theory.copy,
4510 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4511 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4512 for convenience -- they merely return the theory.
4514 * Pure: type Type.tsig is superceded by theory in most interfaces.
4516 * Pure: the Isar proof context type is already defined early in Pure
4517 as Context.proof (note that ProofContext.context and Proof.context are
4518 aliases, where the latter is the preferred name). This enables other
4519 Isabelle components to refer to that type even before Isar is present.
4521 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4522 typeK, constK, axiomK, oracleK), but provide explicit operations for
4523 any of these kinds. For example, Sign.intern typeK is now
4524 Sign.intern_type, Theory.hide_space Sign.typeK is now
4525 Theory.hide_types. Also note that former
4526 Theory.hide_classes/types/consts are now
4527 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4528 internalize their arguments! INCOMPATIBILITY.
4530 * Pure: get_thm interface (of PureThy and ProofContext) expects
4531 datatype thmref (with constructors Name and NameSelection) instead of
4532 plain string -- INCOMPATIBILITY;
4534 * Pure: cases produced by proof methods specify options, where NONE
4535 means to remove case bindings -- INCOMPATIBILITY in
4538 * Pure: the following operations retrieve axioms or theorems from a
4539 theory node or theory hierarchy, respectively:
4541 Theory.axioms_of: theory -> (string * term) list
4542 Theory.all_axioms_of: theory -> (string * term) list
4543 PureThy.thms_of: theory -> (string * thm) list
4544 PureThy.all_thms_of: theory -> (string * thm) list
4546 * Pure: print_tac now outputs the goal through the trace channel.
4548 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4549 Reference Toplevel.debug (default false) controls detailed printing
4550 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4551 controls execution profiling -- set to 1 for time and 2 for space
4552 (both increase the runtime).
4554 * Isar session: The initial use of ROOT.ML is now always timed,
4555 i.e. the log will show the actual process times, in contrast to the
4556 elapsed wall-clock time that the outer shell wrapper produces.
4558 * Simplifier: improved handling of bound variables (nameless
4559 representation, avoid allocating new strings). Simprocs that invoke
4560 the Simplifier recursively should use Simplifier.inherit_bounds to
4561 avoid local name clashes. Failure to do so produces warnings
4562 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4563 for further details.
4565 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4566 bindings for all theorems stored within a given theory; this may help
4567 in porting non-Isar theories to Isar ones, while keeping ML proof
4568 scripts for the time being.
4570 * ML operator HTML.with_charset specifies the charset begin used for
4571 generated HTML files. For example:
4573 HTML.with_charset "utf-8" use_thy "Hebrew";
4574 HTML.with_charset "utf-8" use_thy "Chinese";
4579 * Allow symlinks to all proper Isabelle executables (Isabelle,
4580 isabelle, isatool etc.).
4582 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4583 isatool doc, isatool mkdir, display_drafts etc.).
4585 * isatool usedir: option -f allows specification of the ML file to be
4586 used by Isabelle; default is ROOT.ML.
4588 * New isatool version outputs the version identifier of the Isabelle
4589 distribution being used.
4591 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4592 (containing Boolean satisfiability problems) into Isabelle/HOL
4597 New in Isabelle2004 (April 2004)
4598 --------------------------------
4602 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4603 Replaces linorder.ML.
4605 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4606 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4607 (\<a>...\<z>), are now considered normal letters, and can therefore
4608 be used anywhere where an ASCII letter (a...zA...Z) has until
4609 now. COMPATIBILITY: This obviously changes the parsing of some
4610 terms, especially where a symbol has been used as a binder, say
4611 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4612 as an identifier. Fix it by inserting a space around former
4613 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4614 existing theory and ML files.
4616 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4618 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4619 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4620 a normal (but invisible) letter. For multiple letter subscripts repeat
4621 \<^isub> like this: x\<^isub>1\<^isub>2.
4623 * Pure: There are now sub-/superscripts that can span more than one
4624 character. Text between \<^bsub> and \<^esub> is set in subscript in
4625 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4626 superscript. The new control characters are not identifier parts.
4628 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4629 content of "..." to the latex file instead of \isacntrl... . The "..."
4630 may consist of any printable characters excluding the end bracket >.
4632 * Pure: Using new Isar command "finalconsts" (or the ML functions
4633 Theory.add_finals or Theory.add_finals_i) it is now possible to
4634 declare constants "final", which prevents their being given a definition
4635 later. It is useful for constants whose behaviour is fixed axiomatically
4636 rather than definitionally, such as the meta-logic connectives.
4638 * Pure: 'instance' now handles general arities with general sorts
4639 (i.e. intersections of classes),
4641 * Presentation: generated HTML now uses a CSS style sheet to make layout
4642 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4643 It can be changed to alter the colors/layout of generated pages.
4648 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4649 cut_tac, subgoal_tac and thin_tac:
4650 - Now understand static (Isar) contexts. As a consequence, users of Isar
4651 locales are no longer forced to write Isar proof scripts.
4652 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4654 - INCOMPATIBILITY: names of variables to be instantiated may no
4655 longer be enclosed in quotes. Instead, precede variable name with `?'.
4656 This is consistent with the instantiation attribute "where".
4658 * Attributes "where" and "of":
4659 - Now take type variables of instantiated theorem into account when reading
4660 the instantiation string. This fixes a bug that caused instantiated
4661 theorems to have too special types in some circumstances.
4662 - "where" permits explicit instantiations of type variables.
4664 * Calculation commands "moreover" and "also" no longer interfere with
4665 current facts ("this"), admitting arbitrary combinations with "then"
4669 - Goal statements involving the context element "includes" no longer
4670 generate theorems with internal delta predicates (those ending on
4671 "_axioms") in the premise.
4672 Resolve particular premise with <locale>.intro to obtain old form.
4673 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4674 specification and "includes" elements in goal statement.
4675 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4676 [intro?] and [elim?] (respectively) by default.
4677 - Experimental command for instantiation of locales in proof contexts:
4678 instantiate <label>[<attrs>]: <loc>
4679 Instantiates locale <loc> and adds all its theorems to the current context
4680 taking into account their attributes. Label and attrs are optional
4681 modifiers, like in theorem declarations. If present, names of
4682 instantiated theorems are qualified with <label>, and the attributes
4683 <attrs> are applied after any attributes these theorems might have already.
4684 If the locale has assumptions, a chained fact of the form
4685 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4686 are derived. The command does not support old-style locales declared
4687 with "locale (open)".
4688 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4690 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4696 * Proof import: new image HOL4 contains the imported library from
4697 the HOL4 system with about 2500 theorems. It is imported by
4698 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4699 can be used like any other Isabelle image. See
4700 HOL/Import/HOL/README for more information.
4703 - Much improved handling of linear and partial orders.
4704 Reasoners for linear and partial orders are set up for type classes
4705 "linorder" and "order" respectively, and are added to the default simpset
4706 as solvers. This means that the simplifier can build transitivity chains
4707 to solve goals from the assumptions.
4708 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4709 of blast or auto after simplification become unnecessary because the goal
4710 is solved by simplification already.
4712 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4713 all proved in axiomatic type classes for semirings, rings and fields.
4716 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4717 now formalized using the Ring_and_Field theory mentioned above.
4718 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4719 than before, because now they are set up once in a generic manner.
4720 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4721 Look for the general versions in Ring_and_Field (and Power if they concern
4724 * Type "rat" of the rational numbers is now available in HOL-Complex.
4727 - Record types are now by default printed with their type abbreviation
4728 instead of the list of all field types. This can be configured via
4729 the reference "print_record_type_abbr".
4730 - Simproc "record_upd_simproc" for simplification of multiple updates added
4731 (not enabled by default).
4732 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4733 EX x. x = sel r to True (not enabled by default).
4734 - Tactic "record_split_simp_tac" to split and simplify records added.
4736 * 'specification' command added, allowing for definition by
4737 specification. There is also an 'ax_specification' command that
4738 introduces the new constants axiomatically.
4740 * arith(_tac) is now able to generate counterexamples for reals as well.
4742 * HOL-Algebra: new locale "ring" for non-commutative rings.
4744 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4745 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4747 * HOL-Matrix: a first theory for matrices in HOL with an application of
4748 matrix theory to linear programming.
4750 * Unions and Intersections:
4751 The latex output syntax of UN and INT has been changed
4752 from "\Union x \in A. B" to "\Union_{x \in A} B"
4753 i.e. the index formulae has become a subscript.
4754 Similarly for "\Union x. B", and for \Inter instead of \Union.
4756 * Unions and Intersections over Intervals:
4757 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4758 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4759 like in normal math, and corresponding versions for < and for intersection.
4761 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4762 lexicographic dictonary ordering has been added as "lexord".
4764 * ML: the legacy theory structures Int and List have been removed. They had
4765 conflicted with ML Basis Library structures having the same names.
4767 * 'refute' command added to search for (finite) countermodels. Only works
4768 for a fragment of HOL. The installation of an external SAT solver is
4769 highly recommended. See "HOL/Refute.thy" for details.
4771 * 'quickcheck' command: Allows to find counterexamples by evaluating
4772 formulae under an assignment of free variables to random values.
4773 In contrast to 'refute', it can deal with inductive datatypes,
4774 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4780 * Streams now come with concatenation and are part of the HOLCF image
4784 New in Isabelle2003 (May 2003)
4785 ------------------------------
4789 * Provers/simplifier:
4791 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4792 Assumptions are now subject to complete mutual simplification,
4793 not just from left to right. The simplifier now preserves
4794 the order of assumptions.
4796 Potential INCOMPATIBILITY:
4798 -- simp sometimes diverges where the old version did
4799 not, e.g. invoking simp on the goal
4801 [| P (f x); y = x; f x = f y |] ==> Q
4803 now gives rise to the infinite reduction sequence
4805 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4807 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4810 -- Tactics combining classical reasoner and simplification (such as auto)
4811 are also affected by this change, because many of them rely on
4812 simp. They may sometimes diverge as well or yield a different numbers
4813 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4814 in case of problems. Sometimes subsequent calls to the classical
4815 reasoner will fail because a preceeding call to the simplifier too
4816 eagerly simplified the goal, e.g. deleted redundant premises.
4818 - The simplifier trace now shows the names of the applied rewrite rules
4820 - You can limit the number of recursive invocations of the simplifier
4821 during conditional rewriting (where the simplifie tries to solve the
4822 conditions before applying the rewrite rule):
4823 ML "simp_depth_limit := n"
4824 where n is an integer. Thus you can force termination where previously
4825 the simplifier would diverge.
4827 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4829 - No longer aborts on failed congruence proof. Instead, the
4830 congruence is ignored.
4832 * Pure: New generic framework for extracting programs from constructive
4833 proofs. See HOL/Extraction.thy for an example instantiation, as well
4834 as HOL/Extraction for some case studies.
4836 * Pure: The main goal of the proof state is no longer shown by default, only
4837 the subgoals. This behaviour is controlled by a new flag.
4838 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4839 (ML: Proof.show_main_goal).
4841 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4842 rules whose conclusion matches subgoal 1:
4843 PG menu: Isabelle/Isar -> Show me -> matching rules
4844 The rules are ordered by how closely they match the subgoal.
4845 In particular, rules that solve a subgoal outright are displayed first
4846 (or rather last, the way they are printed).
4847 (ML: ProofGeneral.print_intros())
4849 * Pure: New flag trace_unify_fail causes unification to print
4850 diagnostic information (PG: in trace buffer) when it fails. This is
4851 useful for figuring out why single step proofs like rule, erule or
4854 * Pure: Locale specifications now produce predicate definitions
4855 according to the body of text (covering assumptions modulo local
4856 definitions); predicate "loc_axioms" covers newly introduced text,
4857 while "loc" is cumulative wrt. all included locale expressions; the
4858 latter view is presented only on export into the global theory
4859 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4860 on the old view without predicates;
4862 * Pure: predefined locales "var" and "struct" are useful for sharing
4863 parameters (as in CASL, for example); just specify something like
4864 ``var x + var y + struct M'' as import;
4866 * Pure: improved thms_containing: proper indexing of facts instead of
4867 raw theorems; check validity of results wrt. current name space;
4868 include local facts of proof configuration (also covers active
4869 locales), cover fixed variables in index; may use "_" in term
4870 specification; an optional limit for the number of printed facts may
4871 be given (the default is 40);
4873 * Pure: disallow duplicate fact bindings within new-style theory files
4876 * Provers: improved induct method: assumptions introduced by case
4877 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4878 the goal statement); "foo" still refers to all facts collectively;
4880 * Provers: the function blast.overloaded has been removed: all constants
4881 are regarded as potentially overloaded, which improves robustness in exchange
4882 for slight decrease in efficiency;
4884 * Provers/linorder: New generic prover for transitivity reasoning over
4885 linear orders. Note: this prover is not efficient!
4887 * Isar: preview of problems to finish 'show' now produce an error
4888 rather than just a warning (in interactive mode);
4895 - Produces a counter example if it cannot prove a goal.
4896 Note that the counter example may be spurious if the goal is not a formula
4897 of quantifier-free linear arithmetic.
4898 In ProofGeneral the counter example appears in the trace buffer.
4900 - Knows about div k and mod k where k is a numeral of type nat or int.
4902 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4903 linear arithmetic fails. This takes account of quantifiers and divisibility.
4904 Presburger arithmetic can also be called explicitly via presburger(_tac).
4906 * simp's arithmetic capabilities have been enhanced a bit: it now
4907 takes ~= in premises into account (by performing a case split);
4909 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4910 are distributed over a sum of terms;
4912 * New tactic "trans_tac" and method "trans" instantiate
4913 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4916 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4917 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4919 * 'typedef' command has new option "open" to suppress the set
4922 * functions Min and Max on finite sets have been introduced (theory
4925 * attribute [symmetric] now works for relations as well; it turns
4926 (x,y) : R^-1 into (y,x) : R, and vice versa;
4928 * induct over a !!-quantified statement (say !!x1..xn):
4929 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4931 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4932 %x. None. Warning: empty_def now refers to the previously hidden definition
4935 * Algebra: formalization of classical algebra. Intended as base for
4936 any algebraic development in Isabelle. Currently covers group theory
4937 (up to Sylow's theorem) and ring theory (Universal Property of
4938 Univariate Polynomials). Contributions welcome;
4940 * GroupTheory: deleted, since its material has been moved to Algebra;
4942 * Complex: new directory of the complex numbers with numeric constants,
4943 nonstandard complex numbers, and some complex analysis, standard and
4944 nonstandard (Jacques Fleuriot);
4946 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4948 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4951 * Real/HahnBanach: updated and adapted to locales;
4953 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4956 * UNITY: added the Meier-Sanders theory of progress sets;
4958 * MicroJava: bytecode verifier and lightweight bytecode verifier
4959 as abstract algorithms, instantiated to the JVM;
4961 * Bali: Java source language formalization. Type system, operational
4962 semantics, axiomatic semantics. Supported language features:
4963 classes, interfaces, objects,virtual methods, static methods,
4964 static/instance fields, arrays, access modifiers, definite
4965 assignment, exceptions.
4970 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4973 * Main ZF: virtually all theories converted to new-style format;
4978 * Pure: Tactic.prove provides sane interface for internal proofs;
4979 omits the infamous "standard" operation, so this is more appropriate
4980 than prove_goalw_cterm in many situations (e.g. in simprocs);
4982 * Pure: improved error reporting of simprocs;
4984 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4988 *** Document preparation ***
4990 * uses \par instead of \\ for line breaks in theory text. This may
4991 shift some page breaks in large documents. To get the old behaviour
4992 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4994 * minimized dependencies of isabelle.sty and isabellesym.sty on
4997 * \<euro> now needs package babel/greek instead of marvosym (which
5000 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5005 New in Isabelle2002 (March 2002)
5006 --------------------------------
5008 *** Document preparation ***
5010 * greatly simplified document preparation setup, including more
5011 graceful interpretation of isatool usedir -i/-d/-D options, and more
5012 instructive isatool mkdir; users should basically be able to get
5013 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5014 users may run a separate document processing stage manually like this:
5015 "isatool usedir -D output HOL Test && isatool document Test/output";
5017 * theory dependency graph may now be incorporated into documents;
5018 isatool usedir -g true will produce session_graph.eps/.pdf for use
5019 with \includegraphics of LaTeX;
5021 * proper spacing of consecutive markup elements, especially text
5022 blocks after section headings;
5024 * support bold style (for single symbols only), input syntax is like
5025 this: "\<^bold>\<alpha>" or "\<^bold>A";
5027 * \<bullet> is now output as bold \cdot by default, which looks much
5028 better in printed text;
5030 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5031 note that these symbols are currently unavailable in Proof General /
5032 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5034 * isatool latex no longer depends on changed TEXINPUTS, instead
5035 isatool document copies the Isabelle style files to the target
5041 * Pure/Provers: improved proof by cases and induction;
5042 - 'case' command admits impromptu naming of parameters (such as
5044 - 'induct' method divinates rule instantiation from the inductive
5045 claim; no longer requires excessive ?P bindings for proper
5046 instantiation of cases;
5047 - 'induct' method properly enumerates all possibilities of set/type
5048 rules; as a consequence facts may be also passed through *type*
5049 rules without further ado;
5050 - 'induct' method now derives symbolic cases from the *rulified*
5051 rule (before it used to rulify cases stemming from the internal
5052 atomized version); this means that the context of a non-atomic
5053 statement becomes is included in the hypothesis, avoiding the
5054 slightly cumbersome show "PROP ?case" form;
5055 - 'induct' may now use elim-style induction rules without chaining
5056 facts, using ``missing'' premises from the goal state; this allows
5057 rules stemming from inductive sets to be applied in unstructured
5058 scripts, while still benefitting from proper handling of non-atomic
5059 statements; NB: major inductive premises need to be put first, all
5060 the rest of the goal is passed through the induction;
5061 - 'induct' proper support for mutual induction involving non-atomic
5062 rule statements (uses the new concept of simultaneous goals, see
5064 - append all possible rule selections, but only use the first
5065 success (no backtracking);
5066 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5067 - undeclared rule case names default to numbers 1, 2, 3, ...;
5068 - added 'print_induct_rules' (covered by help item in recent Proof
5070 - moved induct/cases attributes to Pure, methods to Provers;
5071 - generic method setup instantiated for FOL and HOL;
5073 * Pure: support multiple simultaneous goal statements, for example
5074 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5075 meta-level mechanism, this acts as if several individual goals had
5076 been stated separately; in particular common proof methods need to be
5077 repeated in order to cover all claims; note that a single elimination
5078 step is *not* sufficient to establish the two conjunctions, so this
5081 assume "A & B" then have A and B .. (*".." fails*)
5083 better use "obtain" in situations as above; alternative refer to
5084 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5086 * Pure: proper integration with ``locales''; unlike the original
5087 version by Florian Kammller, Isar locales package high-level proof
5088 contexts rather than raw logical ones (e.g. we admit to include
5089 attributes everywhere); operations on locales include merge and
5090 rename; support for implicit arguments (``structures''); simultaneous
5091 type-inference over imports and text; see also HOL/ex/Locales.thy for
5094 * Pure: the following commands have been ``localized'', supporting a
5095 target locale specification "(in name)": 'lemma', 'theorem',
5096 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5097 stored both within the locale and at the theory level (exported and
5098 qualified by the locale name);
5100 * Pure: theory goals may now be specified in ``long'' form, with
5101 ad-hoc contexts consisting of arbitrary locale elements. for example
5102 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5103 definitions may be given, too); the result is a meta-level rule with
5104 the context elements being discharged in the obvious way;
5106 * Pure: new proof command 'using' allows to augment currently used
5107 facts after a goal statement ('using' is syntactically analogous to
5108 'apply', but acts on the goal's facts only); this allows chained facts
5109 to be separated into parts given before and after a claim, as in
5110 ``from a and b have C using d and e <proof>'';
5112 * Pure: renamed "antecedent" case to "rule_context";
5114 * Pure: new 'judgment' command records explicit information about the
5115 object-logic embedding (used by several tools internally); no longer
5116 use hard-wired "Trueprop";
5118 * Pure: added 'corollary' command;
5120 * Pure: fixed 'token_translation' command;
5122 * Pure: removed obsolete 'exported' attribute;
5124 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5125 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5126 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5128 * Pure: method 'atomize' presents local goal premises as object-level
5129 statements (atomic meta-level propositions); setup controlled via
5130 rewrite rules declarations of 'atomize' attribute; example
5131 application: 'induct' method with proper rule statements in improper
5134 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5135 now consider the syntactic context of assumptions, giving a better
5136 chance to get type-inference of the arguments right (this is
5137 especially important for locales);
5139 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5142 * Pure/obtain: the formal conclusion "thesis", being marked as
5143 ``internal'', may no longer be reference directly in the text;
5144 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5147 * Pure: generic 'sym' attribute which declares a rule both as pure
5148 'elim?' and for the 'symmetric' operation;
5150 * Pure: marginal comments ``--'' may now occur just anywhere in the
5151 text; the fixed correlation with particular command syntax has been
5154 * Pure: new method 'rules' is particularly well-suited for proof
5155 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5156 but often produces more compact proof terms with less detours;
5158 * Pure/Provers/classical: simplified integration with pure rule
5159 attributes and methods; the classical "intro?/elim?/dest?"
5160 declarations coincide with the pure ones; the "rule" method no longer
5161 includes classically swapped intros; "intro" and "elim" methods no
5162 longer pick rules from the context; also got rid of ML declarations
5163 AddXIs/AddXEs/AddXDs; all of this has some potential for
5166 * Provers/classical: attribute 'swapped' produces classical inversions
5167 of introduction rules;
5169 * Provers/simplifier: 'simplified' attribute may refer to explicit
5170 rules instead of full simplifier context; 'iff' attribute handles
5173 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5175 * HOL: 'recdef' now fails on unfinished automated proofs, use
5176 "(permissive)" option to recover old behavior;
5178 * HOL: 'inductive' no longer features separate (collective) attributes
5179 for 'intros' (was found too confusing);
5181 * HOL: properly declared induction rules less_induct and
5187 * HOL: moved over to sane numeral syntax; the new policy is as
5190 - 0 and 1 are polymorphic constants, which are defined on any
5191 numeric type (nat, int, real etc.);
5193 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5194 binary representation internally;
5196 - type nat has special constructor Suc, and generally prefers Suc 0
5197 over 1::nat and Suc (Suc 0) over 2::nat;
5199 This change may cause significant problems of INCOMPATIBILITY; here
5200 are some hints on converting existing sources:
5202 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5203 entities, so expressions involving "-" (unary or binary minus) need
5204 to be spaced properly;
5206 - existing occurrences of "1" may need to be constraint "1::nat" or
5207 even replaced by Suc 0; similar for old "2";
5209 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5211 - remove all special provisions on numerals in proofs;
5213 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5214 representation (depends on bin_arith_simps in the default context);
5216 * HOL: symbolic syntax for x^2 (numeral 2);
5218 * HOL: the class of all HOL types is now called "type" rather than
5219 "term"; INCOMPATIBILITY, need to adapt references to this type class
5220 in axclass/classes, instance/arities, and (usually rare) occurrences
5221 in typings (of consts etc.); internally the class is called
5222 "HOL.type", ML programs should refer to HOLogic.typeS;
5224 * HOL/record package improvements:
5225 - new derived operations "fields" to build a partial record section,
5226 "extend" to promote a fixed record to a record scheme, and
5227 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5228 declared as simp by default;
5229 - shared operations ("more", "fields", etc.) now need to be always
5230 qualified) --- potential INCOMPATIBILITY;
5231 - removed "make_scheme" operations (use "make" with "extend") --
5233 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5234 - provides cases/induct rules for use with corresponding Isar
5235 methods (for concrete records, record schemes, concrete more
5236 parts, and schematic more parts -- in that order);
5237 - internal definitions directly based on a light-weight abstract
5238 theory of product types over typedef rather than datatype;
5240 * HOL: generic code generator for generating executable ML code from
5241 specifications; specific support for HOL constructs such as inductive
5242 datatypes and sets, as well as recursive functions; can be invoked
5243 via 'generate_code' theory section;
5245 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5247 * HOL: consolidated and renamed several theories. In particular:
5248 Ord.thy has been absorbed into HOL.thy
5249 String.thy has been absorbed into List.thy
5251 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5252 (beware of argument permutation!);
5254 * HOL: linorder_less_split superseded by linorder_cases;
5256 * HOL/List: "nodups" renamed to "distinct";
5258 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5259 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5260 - Ex_def has changed, now need to use some_eq_ex
5262 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5263 in this (rare) case use:
5265 delSWrapper "split_all_tac"
5266 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5268 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5271 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5272 Isabelle's type classes, ^ on functions and relations has too general
5273 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5274 necessary to attach explicit type constraints;
5276 * HOL/Relation: the prefix name of the infix "O" has been changed from
5277 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5278 renamed accordingly (eg "compI" -> "rel_compI").
5280 * HOL: syntax translations now work properly with numerals and records
5283 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5284 of "lam" -- INCOMPATIBILITY;
5286 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5287 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5288 renamed "Product_Type.unit";
5290 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5292 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5293 the "cases" method);
5295 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5298 * HOL/IMP: updated and converted to new-style theory format; several
5299 parts turned into readable document, with proper Isar proof texts and
5300 some explanations (by Gerwin Klein);
5302 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5304 * HOL-Hyperreal is now a logic image;
5309 * Isar: consts/constdefs supports mixfix syntax for continuous
5312 * Isar: domain package adapted to new-style theory format, e.g. see
5315 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5316 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5317 lift.induct_tac, always use UU instead of Undef;
5319 * HOLCF/IMP: updated and converted to new-style theory;
5324 * Isar: proper integration of logic-specific tools and packages,
5325 including theory commands '(co)inductive', '(co)datatype',
5326 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5327 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5329 * theory Main no longer includes AC; for the Axiom of Choice, base
5330 your theory on Main_ZFC;
5332 * the integer library now covers quotients and remainders, with many
5333 laws relating division to addition, multiplication, etc.;
5335 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5336 typeless version of the formalism;
5338 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5341 * ZF/Induct: new directory for examples of inductive definitions,
5342 including theory Multiset for multiset orderings; converted to
5343 new-style theory format;
5345 * ZF: many new theorems about lists, ordinals, etc.;
5350 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5351 variable proof controls level of detail: 0 = no proofs (only oracle
5352 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5353 also ref manual for further ML interfaces;
5355 * Pure/axclass: removed obsolete ML interface
5356 goal_subclass/goal_arity;
5358 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5359 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5360 separate tokens, so expressions involving minus need to be spaced
5363 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5364 rather than "infixl" or "infixr";
5366 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5367 sort constraint specifications in type inference; e.g. "x::_::foo"
5368 ensures that the type of "x" is of sort "foo" (but not necessarily a
5371 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5372 control output of nested => (types); the default behavior is
5375 * Pure/syntax: builtin parse translation for "_constify" turns valued
5376 tokens into AST constants;
5378 * Pure/syntax: prefer later declarations of translations and print
5379 translation functions; potential INCOMPATIBILITY: need to reverse
5380 multiple declarations for same syntax element constant;
5382 * Pure/show_hyps reset by default (in accordance to existing Isar
5385 * Provers/classical: renamed addaltern to addafter, addSaltern to
5388 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5391 * system: tested support for MacOS X; should be able to get Isabelle +
5392 Proof General to work in a plain Terminal after installing Poly/ML
5393 (e.g. from the Isabelle distribution area) and GNU bash alone
5394 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5395 support requires further installations, e.g. from
5396 http://fink.sourceforge.net/);
5398 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5400 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5401 of 40 MB), cf. ML_OPTIONS;
5403 * system: Proof General keywords specification is now part of the
5404 Isabelle distribution (see etc/isar-keywords.el);
5406 * system: support for persistent Proof General sessions (refrain from
5407 outdating all loaded theories on startup); user may create writable
5408 logic images like this: ``isabelle -q HOL Test'';
5410 * system: smart selection of Isabelle process versus Isabelle
5411 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5412 run both "isabelle" and "Isabelle" even if file names are badly
5413 damaged (executable inspects the case of the first letter of its own
5414 name); added separate "isabelle-process" and "isabelle-interface";
5416 * system: refrain from any attempt at filtering input streams; no
5417 longer support ``8bit'' encoding of old isabelle font, instead proper
5418 iso-latin characters may now be used; the related isatools
5419 "symbolinput" and "nonascii" have disappeared as well;
5421 * system: removed old "xterm" interface (the print modes "xterm" and
5422 "xterm_color" are still available for direct use in a suitable
5427 New in Isabelle99-2 (February 2001)
5428 -----------------------------------
5430 *** Overview of INCOMPATIBILITIES ***
5432 * HOL: please note that theories in the Library and elsewhere often use the
5433 new-style (Isar) format; to refer to their theorems in an ML script you must
5434 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5436 * HOL: inductive package no longer splits induction rule aggressively,
5437 but only as far as specified by the introductions given; the old
5438 format may be recovered via ML function complete_split_rule or attribute
5439 'split_rule (complete)';
5441 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5442 gfp_Tarski to gfp_unfold;
5444 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5446 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5447 relation); infix "^^" has been renamed "``"; infix "``" has been
5448 renamed "`"; "univalent" has been renamed "single_valued";
5450 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5453 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5455 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5457 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5458 consequence, it is no longer monotonic wrt. the local goal context
5459 (which is now passed through the inductive cases);
5461 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5462 \<gg> to \<ggreater>;
5465 *** Document preparation ***
5467 * \isabellestyle{NAME} selects version of Isabelle output (currently
5468 available: are "it" for near math-mode best-style output, "sl" for
5469 slanted text style, and "tt" for plain type-writer; if no
5470 \isabellestyle command is given, output is according to slanted
5473 * support sub/super scripts (for single symbols only), input syntax is
5474 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5476 * some more standard symbols; see Appendix A of the system manual for
5477 the complete list of symbols defined in isabellesym.sty;
5479 * improved isabelle style files; more abstract symbol implementation
5480 (should now use \isamath{...} and \isatext{...} in custom symbol
5483 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5484 state; Note that presentation of goal states does not conform to
5485 actual human-readable proof documents. Please do not include goal
5486 states into document output unless you really know what you are doing!
5488 * proper indentation of antiquoted output with proportional LaTeX
5491 * no_document ML operator temporarily disables LaTeX document
5494 * isatool unsymbolize tunes sources for plain ASCII communication;
5499 * Pure: Isar now suffers initial goal statements to contain unbound
5500 schematic variables (this does not conform to actual readable proof
5501 documents, due to unpredictable outcome and non-compositional proof
5502 checking); users who know what they are doing may use schematic goals
5503 for Prolog-style synthesis of proven results;
5505 * Pure: assumption method (an implicit finishing) now handles actual
5508 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5509 initial goal, declare "that" only as Pure intro (only for single
5510 steps); the "that" rule assumption may now be involved in implicit
5511 finishing, thus ".." becomes a feasible for trivial obtains;
5513 * Pure: default proof step now includes 'intro_classes'; thus trivial
5514 instance proofs may be performed by "..";
5516 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5519 * Pure: more robust selection of calculational rules;
5521 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5522 rule (as well as the assumption rule);
5524 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5525 lemmas, using the graph browser tool;
5527 * Pure: predict failure of "show" in interactive mode;
5529 * Pure: 'thms_containing' now takes actual terms as arguments;
5531 * HOL: improved method 'induct' --- now handles non-atomic goals
5532 (potential INCOMPATIBILITY); tuned error handling;
5534 * HOL: cases and induct rules now provide explicit hints about the
5535 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5536 any remaining facts are inserted into the goal verbatim;
5538 * HOL: local contexts (aka cases) may now contain term bindings as
5539 well; the 'cases' and 'induct' methods new provide a ?case binding for
5540 the result to be shown in each case;
5542 * HOL: added 'recdef_tc' command;
5544 * isatool convert assists in eliminating legacy ML scripts;
5549 * HOL/Library: a collection of generic theories to be used together
5550 with main HOL; the theory loader path already includes this directory
5551 by default; the following existing theories have been moved here:
5552 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5553 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5555 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5556 modelling and verification task performed in Isabelle/HOL +
5557 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5559 * HOL/Algebra: special summation operator SUM no longer exists, it has
5560 been replaced by setsum; infix 'assoc' now has priority 50 (like
5561 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5562 'domain', this makes the theory consistent with mathematical
5565 * HOL basics: added overloaded operations "inverse" and "divide"
5566 (infix "/"), syntax for generic "abs" operation, generic summation
5569 * HOL/typedef: simplified package, provide more useful rules (see also
5572 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5573 now expressed as a proper nested rule (old-style tactic scripts may
5574 require atomize_strip_tac to cope with non-atomic premises);
5576 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5577 to "split_conv" (old name still available for compatibility);
5579 * HOL: improved concrete syntax for strings (e.g. allows translation
5580 rules with string literals);
5582 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5583 and Fleuriot's mechanization of analysis, including the transcendental
5584 functions for the reals;
5586 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5591 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5592 "lam" is displayed as TWO lambda-symbols
5594 * CTT: theory Main now available, containing everything (that is, Bool
5600 * Pure: the Simplifier has been implemented properly as a derived rule
5601 outside of the actual kernel (at last!); the overall performance
5602 penalty in practical applications is about 50%, while reliability of
5603 the Isabelle inference kernel has been greatly improved;
5605 * print modes "brackets" and "no_brackets" control output of nested =>
5606 (types) and ==> (props); the default behaviour is "brackets";
5608 * Provers: fast_tac (and friends) now handle actual object-logic rules
5609 as assumptions as well;
5611 * system: support Poly/ML 4.0;
5613 * system: isatool install handles KDE version 1 or 2;
5617 New in Isabelle99-1 (October 2000)
5618 ----------------------------------
5620 *** Overview of INCOMPATIBILITIES ***
5622 * HOL: simplification of natural numbers is much changed; to partly
5623 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5624 issue the following ML commands:
5626 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5627 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5629 * HOL: simplification no longer dives into case-expressions; this is
5630 controlled by "t.weak_case_cong" for each datatype t;
5632 * HOL: nat_less_induct renamed to less_induct;
5634 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5635 fixsome to patch .thy and .ML sources automatically;
5637 select_equality -> some_equality
5638 select_eq_Ex -> some_eq_ex
5639 selectI2EX -> someI2_ex
5642 select1_equality -> some1_equality
5643 Eps_sym_eq -> some_sym_eq_trivial
5644 Eps_eq -> some_eq_trivial
5646 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5648 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5651 * HOL: the recursion equations generated by 'recdef' are now called
5652 f.simps instead of f.rules;
5654 * HOL: qed_spec_mp now also handles bounded ALL as well;
5656 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5657 sometimes be needed;
5659 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5661 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5663 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5664 product is now "<*>" instead of "Times"; the lexicographic product is
5665 now "<*lex*>" instead of "**";
5667 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5668 of main HOL, but was unused); better use HOL's datatype package;
5670 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5671 the old syntax may be recovered as follows:
5674 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5675 (infixl "\\<oplus>" 100)
5677 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5679 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5680 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5683 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5684 changed from A/r to A//r;
5686 * ZF: new treatment of arithmetic (nat & int) may break some old
5689 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5690 rulify -> rule_format, elimify -> elim_format, ...);
5692 * Isar/Provers: intro/elim/dest attributes changed; renamed
5693 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5694 should have to change intro!! to intro? only); replaced "delrule" by
5697 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5699 * Provers: strengthened force_tac by using new first_best_tac;
5701 * LaTeX document preparation: several changes of isabelle.sty (see
5705 *** Document preparation ***
5707 * formal comments (text blocks etc.) in new-style theories may now
5708 contain antiquotations of thm/prop/term/typ/text to be presented
5709 according to latex print mode; concrete syntax is like this:
5710 @{term[show_types] "f(x) = a + x"};
5712 * isatool mkdir provides easy setup of Isabelle session directories,
5713 including proper document sources;
5715 * generated LaTeX sources are now deleted after successful run
5716 (isatool document -c); may retain a copy somewhere else via -D option
5719 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5720 style files, achieving self-contained LaTeX sources and simplifying
5723 * old-style theories now produce (crude) LaTeX output as well;
5725 * browser info session directories are now self-contained (may be put
5726 on WWW server seperately); improved graphs of nested sessions; removed
5727 graph for 'all sessions';
5729 * several improvements in isabelle style files; \isabellestyle{it}
5730 produces fake math mode output; \isamarkupheader is now \section by
5731 default; see lib/texinputs/isabelle.sty etc.;
5736 * Isar/Pure: local results and corresponding term bindings are now
5737 subject to Hindley-Milner polymorphism (similar to ML); this
5738 accommodates incremental type-inference very nicely;
5740 * Isar/Pure: new derived language element 'obtain' supports
5741 generalized existence reasoning;
5743 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5744 support accumulation of results, without applying any rules yet;
5745 useful to collect intermediate results without explicit name
5746 references, and for use with transitivity rules with more than 2
5749 * Isar/Pure: scalable support for case-analysis type proofs: new
5750 'case' language element refers to local contexts symbolically, as
5751 produced by certain proof methods; internally, case names are attached
5752 to theorems as "tags";
5754 * Isar/Pure: theory command 'hide' removes declarations from
5755 class/type/const name spaces;
5757 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5758 indicate potential overloading;
5760 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5762 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5763 "{a,b,c}" instead of {a,b,c};
5765 * Isar/Pure now provides its own version of intro/elim/dest
5766 attributes; useful for building new logics, but beware of confusion
5767 with the version in Provers/classical;
5769 * Isar/Pure: the local context of (non-atomic) goals is provided via
5770 case name 'antecedent';
5772 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5773 to the current context is now done automatically);
5775 * Isar/Pure: theory command 'method_setup' provides a simple interface
5776 for definining proof methods in ML;
5778 * Isar/Provers: intro/elim/dest attributes changed; renamed
5779 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5780 most cases, one should have to change intro!! to intro? only);
5781 replaced "delrule" by "rule del";
5783 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5784 'symmetric' attribute (the latter supercedes [RS sym]);
5786 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5787 method modifier); 'simp' method: 'only:' modifier removes loopers as
5788 well (including splits);
5790 * Isar/Provers: Simplifier and Classical methods now support all kind
5791 of modifiers used in the past, including 'cong', 'iff', etc.
5793 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5794 of Simplifier and Classical reasoner);
5796 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5797 now support named cases; major packages (inductive, datatype, primrec,
5798 recdef) support case names and properly name parameters;
5800 * Isar/HOL: new transitivity rules for substitution in inequalities --
5801 monotonicity conditions are extracted to be proven at end of
5804 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5807 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5808 split_if split_if_asm; datatype package provides theorems foo.splits =
5809 foo.split foo.split_asm for each datatype;
5811 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5812 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5813 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5814 use "(cases (simplified))" method in proper proof texts);
5816 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5818 * Isar: names of theorems etc. may be natural numbers as well;
5820 * Isar: 'pr' command: optional arguments for goals_limit and
5821 ProofContext.prems_limit; no longer prints theory contexts, but only
5824 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5825 additional print modes to be specified; e.g. "pr(latex)" will print
5826 proof state according to the Isabelle LaTeX style;
5828 * Isar: improved support for emulating tactic scripts, including proof
5829 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5830 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5831 (for HOL datatypes);
5833 * Isar: simplified (more robust) goal selection of proof methods: 1st
5834 goal, all goals, or explicit goal specifier (tactic emulation); thus
5835 'proof method scripts' have to be in depth-first order;
5837 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5839 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5840 should instead use individual commands for printing items
5841 (print_commands, print_methods etc.);
5843 * Isar: added 'nothing' --- the empty list of theorems;
5848 * HOL/MicroJava: formalization of a fragment of Java, together with a
5849 corresponding virtual machine and a specification of its bytecode
5850 verifier and a lightweight bytecode verifier, including proofs of
5851 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5852 Cornelia Pusch (see also the homepage of project Bali at
5853 http://isabelle.in.tum.de/Bali/);
5855 * HOL/Algebra: new theory of rings and univariate polynomials, by
5858 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5859 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5862 * HOL/Lattice: fundamental concepts of lattice theory and order
5863 structures, including duals, properties of bounds versus algebraic
5864 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5865 Theorem for complete lattices etc.; may also serve as a demonstration
5866 for abstract algebraic reasoning using axiomatic type classes, and
5867 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5869 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5872 * HOL/IMPP: extension of IMP with local variables and mutually
5873 recursive procedures, by David von Oheimb;
5875 * HOL/Lambda: converted into new-style theory and document;
5877 * HOL/ex/Multiquote: example of multiple nested quotations and
5878 anti-quotations -- basically a generalized version of de-Bruijn
5879 representation; very useful in avoiding lifting of operations;
5881 * HOL/record: added general record equality rule to simpset; fixed
5882 select-update simplification procedure to handle extended records as
5883 well; admit "r" as field name;
5885 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5886 other numeric types and also as the identity of groups, rings, etc.;
5888 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5889 Types nat and int belong to this axclass;
5891 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5892 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5893 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5894 two terms #m*u and #n*u are replaced by #(m+n)*u
5895 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5896 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5897 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5899 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5900 powerful prover for predicate logic but knows nothing of clasets; see
5901 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5903 * HOL: new version of "case_tac" subsumes both boolean case split and
5904 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5905 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5907 * HOL: simplification no longer dives into case-expressions: only the
5908 selector expression is simplified, but not the remaining arms; to
5909 enable full simplification of case-expressions for datatype t, you may
5910 remove t.weak_case_cong from the simpset, either globally (Delcongs
5911 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5913 * HOL/recdef: the recursion equations generated by 'recdef' for
5914 function 'f' are now called f.simps instead of f.rules; if all
5915 termination conditions are proved automatically, these simplification
5916 rules are added to the simpset, as in primrec; rules may be named
5917 individually as well, resulting in a separate list of theorems for
5920 * HOL/While is a new theory that provides a while-combinator. It
5921 permits the definition of tail-recursive functions without the
5922 provision of a termination measure. The latter is necessary once the
5923 invariant proof rule for while is applied.
5925 * HOL: new (overloaded) notation for the set of elements below/above
5926 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5928 * HOL: theorems impI, allI, ballI bound as "strip";
5930 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5931 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5932 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5934 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5936 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5937 main HOL, but was unused);
5939 * HOL: fewer consts declared as global (e.g. have to refer to
5940 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5942 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5943 in case of overlap with user translations (e.g. judgements over
5944 tuples); (note that the underlying logical represenation is still
5950 * ZF: simplification automatically cancels common terms in arithmetic
5951 expressions over nat and int;
5953 * ZF: new treatment of nat to minimize type-checking: all operators
5954 coerce their operands to a natural number using the function natify,
5955 making the algebraic laws unconditional;
5957 * ZF: as above, for int: operators coerce their operands to an integer
5958 using the function intify;
5960 * ZF: the integer library now contains many of the usual laws for the
5961 orderings, including $<=, and monotonicity laws for $+ and $*;
5963 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5966 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5967 to the simplifier and classical reasoner simultaneously;
5972 * Provers: blast_tac now handles actual object-logic rules as
5973 assumptions; note that auto_tac uses blast_tac internally as well;
5975 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5976 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5978 * Provers: delrules now handles destruct rules as well (no longer need
5979 explicit make_elim);
5981 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5982 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5983 use instead the strong form,
5984 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5985 in HOL, FOL and ZF the function cla_make_elim will create such rules
5986 from destruct-rules;
5988 * Provers: Simplifier.easy_setup provides a fast path to basic
5989 Simplifier setup for new object-logics;
5991 * Pure: AST translation rules no longer require constant head on LHS;
5993 * Pure: improved name spaces: ambiguous output is qualified; support
5994 for hiding of names;
5996 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5997 XSYMBOL_HOME; no longer need to do manual configuration in most
6000 * system: compression of ML heaps images may now be controlled via -c
6001 option of isabelle and isatool usedir (currently only observed by
6004 * system: isatool installfonts may handle X-Symbol fonts as well (very
6005 useful for remote X11);
6007 * system: provide TAGS file for Isabelle sources;
6009 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6012 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6013 timing flag supersedes proof_timing and Toplevel.trace;
6015 * ML: new combinators |>> and |>>> for incremental transformations
6016 with secondary results (e.g. certain theory extensions):
6018 * ML: PureThy.add_defs gets additional argument to indicate potential
6019 overloading (usually false);
6021 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6026 New in Isabelle99 (October 1999)
6027 --------------------------------
6029 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6031 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6032 are no longer simplified. (This allows the simplifier to unfold recursive
6033 functional programs.) To restore the old behaviour, declare
6035 Delcongs [if_weak_cong];
6037 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6040 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6042 * HOL/datatype: mutual_induct_tac no longer exists --
6043 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6045 * HOL/typedef: fixed type inference for representing set; type
6046 arguments now have to occur explicitly on the rhs as type constraints;
6048 * ZF: The con_defs part of an inductive definition may no longer refer
6049 to constants declared in the same theory;
6051 * HOL, ZF: the function mk_cases, generated by the inductive
6052 definition package, has lost an argument. To simplify its result, it
6053 uses the default simpset instead of a supplied list of theorems.
6055 * HOL/List: the constructors of type list are now Nil and Cons;
6057 * Simplifier: the type of the infix ML functions
6058 setSSolver addSSolver setSolver addSolver
6059 is now simpset * solver -> simpset where `solver' is a new abstract type
6060 for packaging solvers. A solver is created via
6061 mk_solver: string -> (thm list -> int -> tactic) -> solver
6062 where the string argument is only a comment.
6067 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6068 decision procedure for linear arithmetic. Currently it is used for
6069 types `nat', `int', and `real' in HOL (see below); it can, should and
6070 will be instantiated for other types and logics as well.
6072 * The simplifier now accepts rewrite rules with flexible heads, eg
6073 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6074 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6080 * New Isabelle/Isar subsystem provides an alternative to traditional
6081 tactical theorem proving; together with the ProofGeneral/isar user
6082 interface it offers an interactive environment for developing human
6083 readable proof documents (Isar == Intelligible semi-automated
6084 reasoning); for further information see isatool doc isar-ref,
6085 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6087 * improved and simplified presentation of theories: better HTML markup
6088 (including colors), graph views in several sizes; isatool usedir now
6089 provides a proper interface for user theories (via -P option); actual
6090 document preparation based on (PDF)LaTeX is available as well (for
6091 new-style theories only); see isatool doc system for more information;
6093 * native support for Proof General, both for classic Isabelle and
6096 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6097 using the graph browser tool;
6099 * Isabelle manuals now also available as PDF;
6101 * theory loader rewritten from scratch (may not be fully
6102 bug-compatible); old loadpath variable has been replaced by show_path,
6103 add_path, del_path, reset_path functions; new operations such as
6104 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6107 * improved isatool install: option -k creates KDE application icon,
6108 option -p DIR installs standalone binaries;
6110 * added ML_PLATFORM setting (useful for cross-platform installations);
6111 more robust handling of platform specific ML images for SML/NJ;
6113 * the settings environment is now statically scoped, i.e. it is never
6114 created again in sub-processes invoked from isabelle, isatool, or
6117 * path element specification '~~' refers to '$ISABELLE_HOME';
6119 * in locales, the "assumes" and "defines" parts may be omitted if
6122 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6125 * new print_mode "HTML";
6127 * new flag show_tags controls display of tags of theorems (which are
6128 basically just comments that may be attached by some tools);
6130 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6131 mode and goal output format:
6133 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6135 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6137 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6138 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6140 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6142 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6144 * function bind_thms stores lists of theorems (cf. bind_thm);
6146 * new shorthand tactics ftac, eatac, datac, fatac;
6148 * qed (and friends) now accept "" as result name; in that case the
6149 theorem is not stored, but proper checks and presentation of the
6152 * theorem database now also indexes constants "Trueprop", "all",
6153 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6158 ** HOL arithmetic **
6160 * There are now decision procedures for linear arithmetic over nat and
6163 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6164 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6165 are treated as atomic; subformulae not involving type `nat' or `int'
6166 are ignored; quantified subformulae are ignored unless they are
6167 positive universal or negative existential. The tactic has to be
6168 invoked by hand and can be a little bit slow. In particular, the
6169 running time is exponential in the number of occurrences of `min' and
6170 `max', and `-' on `nat'.
6172 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6173 (negated) (in)equalities among the premises and the conclusion into
6174 account (i.e. no compound formulae) and does not know about `min' and
6175 `max', and `-' on `nat'. It is fast and is used automatically by the
6178 NB: At the moment, these decision procedures do not cope with mixed
6179 nat/int formulae where the two parts interact, such as `m < n ==>
6182 * HOL/Numeral provides a generic theory of numerals (encoded
6183 efficiently as bit strings); setup for types nat/int/real is in place;
6184 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6185 int, existing theories and proof scripts may require a few additional
6188 * integer division and remainder can now be performed on constant
6191 * many properties of integer multiplication, division and remainder
6194 * An interface to the Stanford Validity Checker (SVC) is available through the
6195 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6196 are proved automatically. SVC must be installed separately, and its results
6197 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6198 invocation of the underlying oracle). For SVC see
6199 http://verify.stanford.edu/SVC
6201 * IsaMakefile: the HOL-Real target now builds an actual image;
6206 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6207 (in Isabelle/Isar) -- by Gertrud Bauer;
6209 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6210 analysis for assembly languages with subtypes;
6212 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6213 -- avoids syntactic ambiguities and treats state, transition, and
6214 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6215 changed syntax and (many) tactics;
6217 * HOL/inductive: Now also handles more general introduction rules such
6218 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6219 theorems are now maintained within the theory (maintained via the
6222 * HOL/datatype: Now also handles arbitrarily branching datatypes
6223 (using function types) such as
6225 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6227 * HOL/record: record_simproc (part of the default simpset) takes care
6228 of selectors applied to updated records; record_split_tac is no longer
6229 part of the default claset; update_defs may now be removed from the
6230 simpset in many cases; COMPATIBILITY: old behavior achieved by
6232 claset_ref () := claset() addSWrapper record_split_wrapper;
6233 Delsimprocs [record_simproc]
6235 * HOL/typedef: fixed type inference for representing set; type
6236 arguments now have to occur explicitly on the rhs as type constraints;
6238 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6239 names rather than an ML expression;
6241 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6242 supplied later. Program schemes can be defined, such as
6243 "While B C s = (if B s then While B C (C s) else s)"
6244 where the well-founded relation can be chosen after B and C have been given.
6246 * HOL/List: the constructors of type list are now Nil and Cons;
6247 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6248 course, ML tools referring to List.list.op # etc. have to be adapted;
6250 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6251 disabled by default; run isabelle with option -m HOL to get back to
6252 the original Gordon/HOL-style output;
6254 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6255 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6257 * HOL basic syntax simplified (more orthogonal): all variants of
6258 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6259 Eps operator is provided as well: "SOME x. P[x]";
6261 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6263 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6264 thus available for user theories;
6266 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6267 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6270 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6271 several times and then mp;
6276 * the notation <<...>> is now available as a notation for sequences of
6279 * the simplifier is now installed
6281 * the axiom system has been generalized (thanks to Soren Heilmann)
6283 * the classical reasoner now has a default rule database
6288 * new primrec section allows primitive recursive functions to be given
6289 directly (as in HOL) over datatypes and the natural numbers;
6291 * new tactics induct_tac and exhaust_tac for induction (or case
6292 analysis) over datatypes and the natural numbers;
6294 * the datatype declaration of type T now defines the recursor T_rec;
6296 * simplification automatically does freeness reasoning for datatype
6299 * automatic type-inference, with AddTCs command to insert new
6300 type-checking rules;
6302 * datatype introduction rules are now added as Safe Introduction rules
6305 * the syntax "if P then x else y" is now available in addition to
6309 *** Internal programming interfaces ***
6311 * tuned simplifier trace output; new flag debug_simp;
6313 * structures Vartab / Termtab (instances of TableFun) offer efficient
6314 tables indexed by indexname_ord / term_ord (compatible with aconv);
6316 * AxClass.axclass_tac lost the theory argument;
6318 * tuned current_goals_markers semantics: begin / end goal avoids
6319 printing empty lines;
6321 * removed prs and prs_fn hook, which was broken because it did not
6322 include \n in its semantics, forcing writeln to add one
6323 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6324 string -> unit if you really want to output text without newline;
6326 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6327 plain output, interface builders may have to enable 'isabelle_font'
6328 mode to get Isabelle font glyphs as before;
6330 * refined token_translation interface; INCOMPATIBILITY: output length
6331 now of type real instead of int;
6333 * theory loader actions may be traced via new ThyInfo.add_hook
6334 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6335 your own database of information attached to *whole* theories -- as
6336 opposed to intra-theory data slots offered via TheoryDataFun;
6338 * proper handling of dangling sort hypotheses (at last!);
6339 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6340 extra sort hypotheses that can be witnessed from the type signature;
6341 the force_strip_shyps flag is gone, any remaining shyps are simply
6342 left in the theorem (with a warning issued by strip_shyps_warning);
6346 New in Isabelle98-1 (October 1998)
6347 ----------------------------------
6349 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6351 * several changes of automated proof tools;
6353 * HOL: major changes to the inductive and datatype packages, including
6354 some minor incompatibilities of theory syntax;
6356 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6359 * HOL: removed duplicate thms in Arith:
6360 less_imp_add_less should be replaced by trans_less_add1
6361 le_imp_add_le should be replaced by trans_le_add1
6363 * HOL: unary minus is now overloaded (new type constraints may be
6366 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6367 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6368 now taken as an integer constant.
6370 * Pure: ML function 'theory_of' renamed to 'theory';
6376 1. Asm_full_simp_tac is now more aggressive.
6377 1. It will sometimes reorient premises if that increases their power to
6379 2. It does no longer proceed strictly from left to right but may also
6380 rotate premises to achieve further simplification.
6381 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6382 old Asm_full_simp_tac in that it does not rotate premises.
6383 2. The simplifier now knows a little bit about nat-arithmetic.
6385 * Classical reasoner: wrapper mechanism for the classical reasoner now
6386 allows for selected deletion of wrappers, by introduction of names for
6387 wrapper functionals. This implies that addbefore, addSbefore,
6388 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6389 and that adding two tactics with the same name overwrites the first
6390 one (emitting a warning).
6391 type wrapper = (int -> tactic) -> (int -> tactic)
6392 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6393 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6394 delWrapper, delSWrapper: claset * string -> claset
6395 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6397 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6398 semantics; addbefore now affects only the unsafe part of step_tac
6399 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6400 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6403 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6404 compWrapper; added safe wrapper (and access functions for it);
6406 * HOL/split_all_tac is now much faster and fails if there is nothing
6407 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6408 and the names of the automatically generated variables have changed.
6409 split_all_tac has moved within claset() from unsafe wrappers to safe
6410 wrappers, which means that !!-bound variables are split much more
6411 aggressively, and safe_tac and clarify_tac now split such variables.
6412 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6413 Note: the same holds for record_split_tac, which does the job of
6414 split_all_tac for record fields.
6416 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6417 permanently to the default simpset using Addsplits just like
6418 Addsimps. They can be removed via Delsplits just like
6419 Delsimps. Lower-case versions are also available.
6421 * HOL/Simplifier: The rule split_if is now part of the default
6422 simpset. This means that the simplifier will eliminate all occurrences
6423 of if-then-else in the conclusion of a goal. To prevent this, you can
6424 either remove split_if completely from the default simpset by
6425 `Delsplits [split_if]' or remove it in a specific call of the
6426 simplifier using `... delsplits [split_if]'. You can also add/delete
6427 other case splitting rules to/from the default simpset: every datatype
6428 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6429 t is the name of the datatype).
6431 * Classical reasoner / Simplifier combination: new force_tac (and
6432 derivatives Force_tac, force) combines rewriting and classical
6433 reasoning (and whatever other tools) similarly to auto_tac, but is
6434 aimed to solve the given subgoal completely.
6439 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6440 and `goalw': the theory is no longer needed as an explicit argument -
6441 the current theory context is used; assumptions are no longer returned
6442 at the ML-level unless one of them starts with ==> or !!; it is
6443 recommended to convert to these new commands using isatool fixgoal
6444 (backup your sources first!);
6446 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6447 the current theory context, and 'theory' to lookup stored theories;
6449 * new theory section 'locale' for declaring constants, assumptions and
6450 definitions that have local scope;
6452 * new theory section 'nonterminals' for purely syntactic types;
6454 * new theory section 'setup' for generic ML setup functions
6455 (e.g. package initialization);
6457 * the distribution now includes Isabelle icons: see
6458 lib/logo/isabelle-{small,tiny}.xpm;
6460 * isatool install - install binaries with absolute references to
6463 * isatool logo -- create instances of the Isabelle logo (as EPS);
6465 * print mode 'emacs' reserved for Isamode;
6467 * support multiple print (ast) translations per constant name;
6469 * theorems involving oracles are now printed with a suffixed [!];
6474 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6476 * HOL/inductive package reorganized and improved: now supports mutual
6482 oddI "n : EVEN ==> Suc n : ODD"
6483 evenI "n : ODD ==> Suc n : EVEN"
6485 new theorem list "elims" contains an elimination rule for each of the
6486 recursive sets; inductive definitions now handle disjunctive premises
6487 correctly (also ZF);
6489 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6490 "mutual_induct" no longer exists - the induction rule is always
6491 contained in "induct";
6494 * HOL/datatype package re-implemented and greatly improved: now
6495 supports mutually recursive datatypes such as
6498 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6499 | SUM ('a aexp) ('a aexp)
6500 | DIFF ('a aexp) ('a aexp)
6503 'a bexp = LESS ('a aexp) ('a aexp)
6504 | AND ('a bexp) ('a bexp)
6505 | OR ('a bexp) ('a bexp)
6507 as well as indirectly recursive datatypes such as
6510 ('a, 'b) term = Var 'a
6511 | App 'b ((('a, 'b) term) list)
6513 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6514 induction on mutually / indirectly recursive datatypes.
6516 Primrec equations are now stored in theory and can be accessed via
6517 <function_name>.simps.
6521 - Theories using datatypes must now have theory Datatype as an
6523 - The specific <typename>.induct_tac no longer exists - use the
6524 generic induct_tac instead.
6525 - natE has been renamed to nat.exhaust - use exhaust_tac
6526 instead of res_inst_tac ... natE. Note that the variable
6527 names in nat.exhaust differ from the names in natE, this
6528 may cause some "fragile" proofs to fail.
6529 - The theorems split_<typename>_case and split_<typename>_case_asm
6530 have been renamed to <typename>.split and <typename>.split_asm.
6531 - Since default sorts of type variables are now handled correctly,
6532 some datatype definitions may have to be annotated with explicit
6534 - Primrec definitions no longer require function name and type
6535 of recursive argument.
6537 Consider using isatool fixdatatype to adapt your theories and proof
6538 scripts to the new package (backup your sources first!).
6541 * HOL/record package: considerably improved implementation; now
6542 includes concrete syntax for record types, terms, updates; theorems
6543 for surjective pairing and splitting !!-bound record variables; proof
6544 support is as follows:
6546 1) standard conversions (selectors or updates applied to record
6547 constructor terms) are part of the standard simpset;
6549 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6550 made part of standard simpset and claset via addIffs;
6552 3) a tactic for record field splitting (record_split_tac) is part of
6553 the standard claset (addSWrapper);
6555 To get a better idea about these rules you may retrieve them via
6556 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6557 the name of your record type.
6559 The split tactic 3) conceptually simplifies by the following rule:
6561 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6563 Thus any record variable that is bound by meta-all will automatically
6564 blow up into some record constructor term, consequently the
6565 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6566 solve record problems automatically.
6569 * reorganized the main HOL image: HOL/Integ and String loaded by
6570 default; theory Main includes everything;
6572 * automatic simplification of integer sums and comparisons, using cancellation;
6574 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6576 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6578 * many new identities for unions, intersections, set difference, etc.;
6580 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6581 called split_if, split_split, split_sum_case and split_nat_case (to go
6582 with add/delsplits);
6584 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6585 (?x::unit) = (); this is made part of the default simpset, which COULD
6586 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6587 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6588 unit_abs_eta_conv is added in order to counter the effect of
6589 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6592 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6595 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6596 It and 'sym RS equals0D' are now in the default claset, giving automatic
6597 disjointness reasoning but breaking a few old proofs.
6599 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6600 to 'converse' from 'inverse' (for compatibility with ZF and some
6603 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6604 the well-founded relation;
6606 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6607 Compl A. The "Compl" syntax remains available as input syntax for this
6610 * HOL/Update: new theory of function updates:
6611 f(a:=b) == %x. if x=a then b else f x
6612 may also be iterated as in f(a:=b,c:=d,...);
6614 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6617 - new function list_update written xs[i:=v] that updates the i-th
6618 list position. May also be iterated as in xs[i:=a,j:=b,...].
6619 - new function `upt' written [i..j(] which generates the list
6620 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6621 bound write [i..j], which is a shorthand for [i..j+1(].
6622 - new lexicographic orderings and corresponding wellfoundedness theorems.
6625 - removed 'pred' (predecessor) function;
6626 - generalized some theorems about n-1;
6627 - many new laws about "div" and "mod";
6628 - new laws about greatest common divisors (see theory ex/Primes);
6630 * HOL/Relation: renamed the relational operator r^-1 "converse"
6631 instead of "inverse";
6633 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6634 of the multiset ordering;
6636 * directory HOL/Real: a construction of the reals using Dedekind cuts
6637 (not included by default);
6639 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6641 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6642 programs, i.e. different program variables may have different types.
6644 * calling (stac rew i) now fails if "rew" has no effect on the goal
6645 [previously, this check worked only if the rewrite rule was unconditional]
6646 Now rew can involve either definitions or equalities (either == or =).
6651 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6652 only the theorems proved on ZF.ML;
6654 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6655 It and 'sym RS equals0D' are now in the default claset, giving automatic
6656 disjointness reasoning but breaking a few old proofs.
6658 * ZF/Update: new theory of function updates
6659 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6660 may also be iterated as in f(a:=b,c:=d,...);
6662 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6664 * calling (stac rew i) now fails if "rew" has no effect on the goal
6665 [previously, this check worked only if the rewrite rule was unconditional]
6666 Now rew can involve either definitions or equalities (either == or =).
6668 * case_tac provided for compatibility with HOL
6669 (like the old excluded_middle_tac, but with subgoals swapped)
6672 *** Internal programming interfaces ***
6674 * Pure: several new basic modules made available for general use, see
6675 also src/Pure/README;
6677 * improved the theory data mechanism to support encapsulation (data
6678 kind name replaced by private Object.kind, acting as authorization
6679 key); new type-safe user interface via functor TheoryDataFun; generic
6680 print_data function becomes basically useless;
6682 * removed global_names compatibility flag -- all theory declarations
6683 are qualified by default;
6685 * module Pure/Syntax now offers quote / antiquote translation
6686 functions (useful for Hoare logic etc. with implicit dependencies);
6687 see HOL/ex/Antiquote for an example use;
6689 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6692 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6695 * Display.print_goals function moved to Locale.print_goals;
6697 * standard print function for goals supports current_goals_markers
6698 variable for marking begin of proof, end of proof, start of goal; the
6699 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6700 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6705 New in Isabelle98 (January 1998)
6706 --------------------------------
6708 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6710 * changed lexical syntax of terms / types: dots made part of long
6711 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6713 * simpset (and claset) reference variable replaced by functions
6714 simpset / simpset_ref;
6716 * no longer supports theory aliases (via merge) and non-trivial
6717 implicit merge of thms' signatures;
6719 * most internal names of constants changed due to qualified names;
6721 * changed Pure/Sequence interface (see Pure/seq.ML);
6724 *** General Changes ***
6726 * hierachically structured name spaces (for consts, types, axms, thms
6727 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6728 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6729 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6730 long_names for fully qualified output names; NOTE: ML programs
6731 (special tactics, packages etc.) referring to internal names may have
6732 to be adapted to cope with fully qualified names; in case of severe
6733 backward campatibility problems try setting 'global_names' at compile
6734 time to have enrything declared within a flat name space; one may also
6735 fine tune name declarations in theories via the 'global' and 'local'
6738 * reimplemented the implicit simpset and claset using the new anytype
6739 data filed in signatures; references simpset:simpset ref etc. are
6740 replaced by functions simpset:unit->simpset and
6741 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6742 to patch your ML files accordingly;
6744 * HTML output now includes theory graph data for display with Java
6745 applet or isatool browser; data generated automatically via isatool
6746 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6748 * defs may now be conditional; improved rewrite_goals_tac to handle
6749 conditional equations;
6751 * defs now admits additional type arguments, using TYPE('a) syntax;
6753 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6754 creates a new theory node; implicit merge of thms' signatures is
6755 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6756 transfer:theory->thm->thm in (rare) cases;
6758 * improved handling of draft signatures / theories; draft thms (and
6759 ctyps, cterms) are automatically promoted to real ones;
6761 * slightly changed interfaces for oracles: admit many per theory, named
6762 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6764 * print_goals: optional output of const types (set show_consts and
6767 * improved output of warnings (###) and errors (***);
6769 * subgoal_tac displays a warning if the new subgoal has type variables;
6771 * removed old README and Makefiles;
6773 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6775 * removed obsolete init_pps and init_database;
6777 * deleted the obsolete tactical STATE, which was declared by
6778 fun STATE tacfun st = tacfun st st;
6780 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6781 (which abbreviates $HOME);
6783 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6784 use isatool fixseq to adapt your ML programs (this works for fully
6785 qualified references to the Sequence structure only!);
6787 * use_thy no longer requires writable current directory; it always
6788 reloads .ML *and* .thy file, if either one is out of date;
6791 *** Classical Reasoner ***
6793 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6794 tactics that use classical reasoning to simplify a subgoal without
6795 splitting it into several subgoals;
6797 * Safe_tac: like safe_tac but uses the default claset;
6802 * added simplification meta rules:
6803 (asm_)(full_)simplify: simpset -> thm -> thm;
6805 * simplifier.ML no longer part of Pure -- has to be loaded by object
6808 * added prems argument to simplification procedures;
6810 * HOL, FOL, ZF: added infix function `addsplits':
6811 instead of `<simpset> setloop (split_tac <thms>)'
6812 you can simply write `<simpset> addsplits <thms>'
6817 * TYPE('a) syntax for type reflection terms;
6819 * no longer handles consts with name "" -- declare as 'syntax' instead;
6821 * pretty printer: changed order of mixfix annotation preference (again!);
6823 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6828 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6829 with `addloop' of the simplifier to faciliate case splitting in premises.
6831 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6833 * HOL/Auth: new protocol proofs including some for the Internet
6836 * HOL/Map: new theory of `maps' a la VDM;
6838 * HOL/simplifier: simplification procedures nat_cancel_sums for
6839 cancelling out common nat summands from =, <, <= (in)equalities, or
6840 differences; simplification procedures nat_cancel_factor for
6841 cancelling common factor from =, <, <= (in)equalities over natural
6842 sums; nat_cancel contains both kinds of procedures, it is installed by
6843 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6845 * HOL/simplifier: terms of the form
6846 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6848 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6849 and those of the form
6850 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6852 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6855 Each datatype `t' now comes with a theorem `split_t_case' of the form
6857 P(t_case f1 ... fn x) =
6858 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6860 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6863 and a theorem `split_t_case_asm' of the form
6865 P(t_case f1 ... fn x) =
6866 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6868 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6870 which can be added to a simpset via `addsplits'. The existing theorems
6871 expand_list_case and expand_option_case have been renamed to
6872 split_list_case and split_option_case.
6875 - `pred n' is automatically converted to `n-1'.
6876 Users are strongly encouraged not to use `pred' any longer,
6877 because it will disappear altogether at some point.
6878 - Users are strongly encouraged to write "0 < n" rather than
6879 "n ~= 0". Theorems and proof tools have been modified towards this
6883 the function "set_of_list" has been renamed "set" (and its theorems too);
6884 the function "nth" now takes its arguments in the reverse order and
6885 has acquired the infix notation "!" as in "xs!n".
6887 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6889 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6890 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6892 * HOL/record: extensible records with schematic structural subtyping
6893 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6894 still lacks various theorems and concrete record syntax;
6899 * removed "axioms" and "generated by" sections;
6901 * replaced "ops" section by extended "consts" section, which is capable of
6902 handling the continuous function space "->" directly;
6905 . proves theorems immediately and stores them in the theory,
6906 . creates hierachical name space,
6907 . now uses normal mixfix annotations (instead of cinfix...),
6908 . minor changes to some names and values (for consistency),
6909 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6910 . separator between mutual domain defs: changed "," to "and",
6911 . improved handling of sort constraints; now they have to
6912 appear on the left-hand side of the equations only;
6914 * fixed LAM <x,y,zs>.b syntax;
6916 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6917 adm (%x. P (t x)), where P is chainfinite and t continuous;
6922 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6923 with `addloop' of the simplifier to faciliate case splitting in premises.
6925 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6926 in HOL, they strip ALL and --> from proved theorems;
6930 New in Isabelle94-8 (May 1997)
6931 ------------------------------
6933 *** General Changes ***
6935 * new utilities to build / run / maintain Isabelle etc. (in parts
6936 still somewhat experimental); old Makefiles etc. still functional;
6938 * new 'Isabelle System Manual';
6940 * INSTALL text, together with ./configure and ./build scripts;
6942 * reimplemented type inference for greater efficiency, better error
6943 messages and clean internal interface;
6945 * prlim command for dealing with lots of subgoals (an easier way of
6946 setting goals_limit);
6951 * supports alternative (named) syntax tables (parser and pretty
6952 printer); internal interface is provided by add_modesyntax(_i);
6954 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6955 be used in conjunction with the Isabelle symbol font; uses the
6956 "symbols" syntax table;
6958 * added token_translation interface (may translate name tokens in
6959 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6960 the current print_mode); IMPORTANT: user print translation functions
6961 are responsible for marking newly introduced bounds
6962 (Syntax.mark_boundT);
6964 * token translations for modes "xterm" and "xterm_color" that display
6965 names in bold, underline etc. or colors (which requires a color
6968 * infixes may now be declared with names independent of their syntax;
6970 * added typed_print_translation (like print_translation, but may
6971 access type of constant);
6974 *** Classical Reasoner ***
6976 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6977 some limitations. Blast_tac...
6978 + ignores addss, addbefore, addafter; this restriction is intrinsic
6979 + ignores elimination rules that don't have the correct format
6980 (the conclusion MUST be a formula variable)
6981 + ignores types, which can make HOL proofs fail
6982 + rules must not require higher-order unification, e.g. apply_type in ZF
6983 [message "Function Var's argument not a bound variable" relates to this]
6984 + its proof strategy is more general but can actually be slower
6986 * substitution with equality assumptions no longer permutes other
6989 * minor changes in semantics of addafter (now called addaltern); renamed
6990 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6991 (and access functions for it);
6993 * improved combination of classical reasoner and simplifier:
6994 + functions for handling clasimpsets
6995 + improvement of addss: now the simplifier is called _after_ the
6997 + safe variant of addss called addSss: uses safe simplifications
6998 _during_ the safe steps. It is more complete as it allows multiple
6999 instantiations of unknowns (e.g. with slow_tac).
7003 * added interface for simplification procedures (functions that
7004 produce *proven* rewrite rules on the fly, depending on current
7007 * ordering on terms as parameter (used for ordered rewriting);
7009 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7011 * the solver is now split into a safe and an unsafe part.
7012 This should be invisible for the normal user, except that the
7013 functions setsolver and addsolver have been renamed to setSolver and
7014 addSolver; added safe_asm_full_simp_tac;
7019 * a generic induction tactic `induct_tac' which works for all datatypes and
7020 also for type `nat';
7022 * a generic case distinction tactic `exhaust_tac' which works for all
7023 datatypes and also for type `nat';
7025 * each datatype comes with a function `size';
7027 * patterns in case expressions allow tuple patterns as arguments to
7028 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7030 * primrec now also works with type nat;
7032 * recdef: a new declaration form, allows general recursive functions to be
7033 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7035 * the constant for negation has been renamed from "not" to "Not" to
7036 harmonize with FOL, ZF, LK, etc.;
7038 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7041 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7043 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7044 problems in commutative rings, using axiomatic type classes for + and *;
7046 * more examples in HOL/MiniML and HOL/Auth;
7048 * more default rewrite rules for quantifiers, union/intersection;
7050 * a new constant `arbitrary == @x.False';
7052 * HOLCF/IOA replaces old HOL/IOA;
7054 * HOLCF changes: derived all rules and arities
7055 + axiomatic type classes instead of classes
7056 + typedef instead of faking type definitions
7057 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7058 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7059 + eliminated the types void, one, tr
7060 + use unit lift and bool lift (with translations) instead of one and tr
7061 + eliminated blift from Lift3.thy (use Def instead of blift)
7062 all eliminated rules are derived as theorems --> no visible changes ;
7067 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7068 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7069 as ZF_cs addSIs [equalityI];
7073 New in Isabelle94-7 (November 96)
7074 ---------------------------------
7076 * allowing negative levels (as offsets) in prlev and choplev;
7078 * super-linear speedup for large simplifications;
7080 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7081 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7082 FAIL); can suppress it using the command Delsimps (ex_simps @
7083 all_simps); De Morgan laws are also now included, by default;
7085 * improved printing of ==> : ~:
7087 * new object-logic "Sequents" adds linear logic, while replacing LK
7088 and Modal (thanks to Sara Kalvala);
7090 * HOL/Auth: correctness proofs for authentication protocols;
7092 * HOL: new auto_tac combines rewriting and classical reasoning (many
7093 examples on HOL/Auth);
7095 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7096 the rewriter and classical reasoner simultaneously;
7098 * function uresult no longer returns theorems in "standard" format;
7099 regain previous version by: val uresult = standard o uresult;
7106 * oracles -- these establish an interface between Isabelle and trusted
7107 external reasoners, which may deliver results as theorems;
7109 * proof objects (in particular record all uses of oracles);
7111 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7113 * "constdefs" section in theory files;
7115 * "primrec" section (HOL) no longer requires names;
7117 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7124 * reduced space requirements;
7126 * automatic HTML generation from theories;
7128 * theory files no longer require "..." (quotes) around most types;
7130 * new examples, including two proofs of the Church-Rosser theorem;
7132 * non-curried (1994) version of HOL is no longer distributed;
7139 * greatly reduced space requirements;
7141 * theory files (.thy) no longer require \...\ escapes at line breaks;
7143 * searchable theorem database (see the section "Retrieving theorems" on
7144 page 8 of the Reference Manual);
7146 * new examples, including Grabczewski's monumental case study of the
7149 * The previous version of HOL renamed to Old_HOL;
7151 * The new version of HOL (previously called CHOL) uses a curried syntax
7152 for functions. Application looks like f a b instead of f(a,b);
7154 * Mutually recursive inductive definitions finally work in HOL;
7156 * In ZF, pattern-matching on tuples is now available in all abstractions and
7157 translates to the operator "split";
7164 * new infix operator, addss, allowing the classical reasoner to
7165 perform simplification at each step of its search. Example:
7166 fast_tac (cs addss ss)
7168 * a new logic, CHOL, the same as HOL, but with a curried syntax
7169 for functions. Application looks like f a b instead of f(a,b). Also pairs
7170 look like (a,b) instead of <a,b>;
7172 * PLEASE NOTE: CHOL will eventually replace HOL!
7174 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7175 It translates to the operator "split". A new theory of integers is available;
7177 * In ZF, integer numerals now denote two's-complement binary integers.
7178 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7180 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7181 of the Axiom of Choice;
7188 * Significantly faster resolution;
7190 * the different sections in a .thy file can now be mixed and repeated
7193 * Database of theorems for FOL, HOL and ZF. New
7194 commands including qed, qed_goal and bind_thm store theorems in the database.
7196 * Simple database queries: return a named theorem (get_thm) or all theorems of
7197 a given theory (thms_of), or find out what theory a theorem was proved in
7200 * Bugs fixed in the inductive definition and datatype packages;
7202 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7203 and HOL_dup_cs obsolete;
7205 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7208 * Simpler definition of function space in ZF;
7210 * new results about cardinal and ordinal arithmetic in ZF;
7212 * 'subtype' facility in HOL for introducing new types as subsets of existing
7215 :mode=text:wrap=hard:maxLineLen=72: