1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2009-2 (June 2010)
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
89 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
90 more efficient than combinations with -q1 or -q2.
95 * Predicates of locales introduced by classes carry a mandatory
96 "class" prefix. INCOMPATIBILITY.
98 * Command 'code_reflect' allows to incorporate generated ML code into
99 runtime environment; replaces immature code_datatype antiquotation.
102 * Empty class specifications observe default sort. INCOMPATIBILITY.
104 * Old 'axclass' command has been discontinued. Use 'class' instead.
107 * Code generator: simple concept for abstract datatypes obeying
110 * Local theory specifications may depend on extra type variables that
111 are not present in the result type -- arguments TYPE('a) :: 'a itself
112 are added internally. For example:
114 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
116 * Code generator: details of internal data cache have no impact on the
117 user space functionality any longer.
119 * Methods unfold_locales and intro_locales ignore non-locale subgoals.
120 This is more appropriate for interpretations with 'where'.
123 * Discontinued unnamed infix syntax (legacy feature for many years) --
124 need to specify constant name and syntax separately. Internal ML
125 datatype constructors have been renamed from InfixName to Infix etc.
126 Minor INCOMPATIBILITY.
128 * Command 'example_proof' opens an empty proof body. This allows to
129 experiment with Isar, without producing any persistent result.
131 * Commands 'type_notation' and 'no_type_notation' declare type syntax
132 within a local theory context, with explicit checking of the
133 constructors involved (in contrast to the raw 'syntax' versions).
135 * Commands 'types' and 'typedecl' now work within a local theory
136 context -- without introducing dependencies on parameters or
137 assumptions, which is not possible in Isabelle/Pure.
139 * Command 'defaultsort' has been renamed to 'default_sort', it works
140 within a local theory context. Minor INCOMPATIBILITY.
142 * Raw axioms/defs may no longer carry sort constraints, and raw defs
143 may no longer carry premises. User-level specifications are
144 transformed accordingly by Thm.add_axiom/add_def.
146 * Proof terms: Type substitutions on proof constants now use canonical
147 order of type variables. INCOMPATIBILITY for tools working with proof
150 * New operation Thm.unconstrainT eliminates all sort constraints from
151 a theorem and proof, introducing explicit OFCLASS-premises. On the
152 proof term level, this operation is automatically applied at PThm
153 boundaries, such that closed proofs are always free of sort
154 constraints. The old (axiomatic) unconstrain operation has been
155 discontinued. INCOMPATIBILITY for tools working with proof terms.
160 * List membership infix mem operation is only an input abbreviation.
163 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
164 for future developements; former Library/Word.thy is still present in
165 the AFP entry RSAPPS.
167 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
168 longer shadowed. INCOMPATIBILITY.
170 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
173 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
176 * Dropped normalizing_semiring etc; use the facts in semiring classes
177 instead. INCOMPATIBILITY.
179 * Dropped several real-specific versions of lemmas about floor and
180 ceiling; use the generic lemmas from Archimedean_Field.thy instead.
183 floor_number_of_eq ~> floor_number_of
184 le_floor_eq_number_of ~> number_of_le_floor
185 le_floor_eq_zero ~> zero_le_floor
186 le_floor_eq_one ~> one_le_floor
187 floor_less_eq_number_of ~> floor_less_number_of
188 floor_less_eq_zero ~> floor_less_zero
189 floor_less_eq_one ~> floor_less_one
190 less_floor_eq_number_of ~> number_of_less_floor
191 less_floor_eq_zero ~> zero_less_floor
192 less_floor_eq_one ~> one_less_floor
193 floor_le_eq_number_of ~> floor_le_number_of
194 floor_le_eq_zero ~> floor_le_zero
195 floor_le_eq_one ~> floor_le_one
196 floor_subtract_number_of ~> floor_diff_number_of
197 floor_subtract_one ~> floor_diff_one
198 ceiling_number_of_eq ~> ceiling_number_of
199 ceiling_le_eq_number_of ~> ceiling_le_number_of
200 ceiling_le_zero_eq ~> ceiling_le_zero
201 ceiling_le_eq_one ~> ceiling_le_one
202 less_ceiling_eq_number_of ~> number_of_less_ceiling
203 less_ceiling_eq_zero ~> zero_less_ceiling
204 less_ceiling_eq_one ~> one_less_ceiling
205 ceiling_less_eq_number_of ~> ceiling_less_number_of
206 ceiling_less_eq_zero ~> ceiling_less_zero
207 ceiling_less_eq_one ~> ceiling_less_one
208 le_ceiling_eq_number_of ~> number_of_le_ceiling
209 le_ceiling_eq_zero ~> zero_le_ceiling
210 le_ceiling_eq_one ~> one_le_ceiling
211 ceiling_subtract_number_of ~> ceiling_diff_number_of
212 ceiling_subtract_one ~> ceiling_diff_one
214 * Theory "Finite_Set": various folding_XXX locales facilitate the
215 application of the various fold combinators on finite sets.
217 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
218 provides abstract red-black tree type which is backed by "RBT_Impl" as
219 implementation. INCOMPATIBILTY.
221 * Command 'typedef' now works within a local theory context -- without
222 introducing dependencies on parameters or assumptions, which is not
223 possible in Isabelle/Pure/HOL. Note that the logical environment may
224 contain multiple interpretations of local typedefs (with different
225 non-emptiness proofs), even in a global theory context.
227 * Theory Library/Coinductive_List has been removed -- superseded by
228 AFP/thys/Coinductive.
230 * Theory PReal, including the type "preal" and related operations, has
231 been removed. INCOMPATIBILITY.
233 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
234 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
236 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
237 "Int" etc. INCOMPATIBILITY.
239 * Constant Rat.normalize needs to be qualified. Minor
242 * New set of rules "ac_simps" provides combined assoc / commute
243 rewrites for all interpretations of the appropriate generic locales.
245 * Renamed theory "OrderedGroup" to "Groups" and split theory
246 "Ring_and_Field" into theories "Rings" and "Fields"; for more
247 appropriate and more consistent names suitable for name prefixes
248 within the HOL theories. INCOMPATIBILITY.
250 * Some generic constants have been put to appropriate theories:
251 - less_eq, less: Orderings
252 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
253 - inverse, divide: Rings
256 * More consistent naming of type classes involving orderings (and
259 lower_semilattice ~> semilattice_inf
260 upper_semilattice ~> semilattice_sup
262 dense_linear_order ~> dense_linorder
264 pordered_ab_group_add ~> ordered_ab_group_add
265 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
266 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
267 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
268 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
269 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
270 pordered_cancel_semiring ~> ordered_cancel_semiring
271 pordered_comm_monoid_add ~> ordered_comm_monoid_add
272 pordered_comm_ring ~> ordered_comm_ring
273 pordered_comm_semiring ~> ordered_comm_semiring
274 pordered_ring ~> ordered_ring
275 pordered_ring_abs ~> ordered_ring_abs
276 pordered_semiring ~> ordered_semiring
278 ordered_ab_group_add ~> linordered_ab_group_add
279 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
280 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
281 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
282 ordered_field ~> linordered_field
283 ordered_field_no_lb ~> linordered_field_no_lb
284 ordered_field_no_ub ~> linordered_field_no_ub
285 ordered_field_dense_linear_order ~> dense_linordered_field
286 ordered_idom ~> linordered_idom
287 ordered_ring ~> linordered_ring
288 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
289 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
290 ordered_ring_strict ~> linordered_ring_strict
291 ordered_semidom ~> linordered_semidom
292 ordered_semiring ~> linordered_semiring
293 ordered_semiring_1 ~> linordered_semiring_1
294 ordered_semiring_1_strict ~> linordered_semiring_1_strict
295 ordered_semiring_strict ~> linordered_semiring_strict
297 The following slightly odd type classes have been moved to a
298 separate theory Library/Lattice_Algebras.thy:
300 lordered_ab_group_add ~> lattice_ab_group_add
301 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
302 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
303 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
304 lordered_ring ~> lattice_ring
308 * Refined field classes:
309 - classes division_ring_inverse_zero, field_inverse_zero,
310 linordered_field_inverse_zero include rule inverse 0 = 0 --
311 subsumes former division_by_zero class;
312 - numerous lemmas have been ported from field to division_ring.
315 * Refined algebra theorem collections:
316 - dropped theorem group group_simps, use algebra_simps instead;
317 - dropped theorem group ring_simps, use field_simps instead;
318 - proper theorem collection field_simps subsumes former theorem
319 groups field_eq_simps and field_simps;
320 - dropped lemma eq_minus_self_iff which is a duplicate for
324 * Theory Finite_Set and List: some lemmas have been generalized from
327 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
328 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
329 inter_Inter_fold_inter ~> inf_Inf_fold_inf
330 union_Union_fold_union ~> sup_Sup_fold_sup
331 Inter_fold_inter ~> Inf_fold_inf
332 Union_fold_union ~> Sup_fold_sup
333 inter_INTER_fold_inter ~> inf_INFI_fold_inf
334 union_UNION_fold_union ~> sup_SUPR_fold_sup
335 INTER_fold_inter ~> INFI_fold_inf
336 UNION_fold_union ~> SUPR_fold_sup
338 * Theory Complete_Lattice: lemmas top_def and bot_def have been
339 replaced by the more convenient lemmas Inf_empty and Sup_empty.
340 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
341 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
342 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
343 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
345 * HOLogic.strip_psplit: types are returned in syntactic order, similar
346 to other strip and tuple operations. INCOMPATIBILITY.
348 * Reorganized theory Multiset: swapped notation of pointwise and
350 - pointwise ordering is instance of class order with standard syntax
352 - multiset ordering has syntax <=# and <#; partial order properties
353 are provided by means of interpretation with prefix
355 - less duplication, less historical organization of sections,
356 conversion from associations lists to multisets, rudimentary code
358 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
361 multiset_eq_conv_count_eq -> multiset_ext_iff
362 multi_count_ext -> multiset_ext
363 diff_union_inverse2 -> diff_union_cancelR
366 * Theory Permutation: replaced local "remove" by List.remove1.
368 * Code generation: ML and OCaml code is decorated with signatures.
370 * Theory List: added transpose.
372 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
373 clash with new theory Quotient in Main HOL.
375 * Library/Nat_Bijection.thy is a collection of bijective functions
376 between nat and other types, which supersedes the older libraries
377 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
380 Nat_Int_Bij.nat2_to_nat ~> prod_encode
381 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
382 Nat_Int_Bij.int_to_nat_bij ~> int_encode
383 Nat_Int_Bij.nat_to_int_bij ~> int_decode
384 Countable.pair_encode ~> prod_encode
385 NatIso.prod2nat ~> prod_encode
386 NatIso.nat2prod ~> prod_decode
387 NatIso.sum2nat ~> sum_encode
388 NatIso.nat2sum ~> sum_decode
389 NatIso.list2nat ~> list_encode
390 NatIso.nat2list ~> list_decode
391 NatIso.set2nat ~> set_encode
392 NatIso.nat2set ~> set_decode
395 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
396 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
397 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
398 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
399 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
400 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
401 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
402 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
403 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
404 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
405 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
406 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
407 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
410 - Renamed ATP commands:
411 atp_info ~> sledgehammer running_atps
412 atp_kill ~> sledgehammer kill_atps
413 atp_messages ~> sledgehammer messages
414 atp_minimize ~> sledgehammer minimize
415 print_atps ~> sledgehammer available_atps
417 - Added user's manual ("isabelle doc sledgehammer").
418 - Added option syntax and "sledgehammer_params" to customize
419 Sledgehammer's behavior. See the manual for details.
420 - Modified the Isar proof reconstruction code so that it produces
421 direct proofs rather than proofs by contradiction. (This feature
422 is still experimental.)
423 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
425 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
428 - Added and implemented "binary_ints" and "bits" options.
429 - Added "std" option and implemented support for nonstandard models.
430 - Added and implemented "finitize" option to improve the precision
431 of infinite datatypes based on a monotonicity analysis.
432 - Added support for quotient types.
433 - Added support for "specification" and "ax_specification"
435 - Added support for local definitions (for "function" and
436 "termination" proofs).
437 - Added support for term postprocessors.
438 - Optimized "Multiset.multiset" and "FinFun.finfun".
439 - Improved efficiency of "destroy_constrs" optimization.
440 - Fixed soundness bugs related to "destroy_constrs" optimization and
442 - Fixed soundness bug related to higher-order constructors.
443 - Fixed soundness bug when "full_descrs" is enabled.
444 - Improved precision of set constructs.
445 - Added "atoms" option.
446 - Added cache to speed up repeated Kodkod invocations on the same
448 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
449 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
450 "SAT4J_Light". INCOMPATIBILITY.
451 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
452 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
453 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
455 * Moved the SMT binding into the HOL image.
460 * Variable names in lemmas generated by the domain package have
461 changed; the naming scheme is now consistent with the HOL datatype
462 package. Some proof scripts may be affected, INCOMPATIBILITY.
464 * The domain package no longer defines the function "foo_copy" for
465 recursive domain "foo". The reach lemma is now stated directly in
466 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
467 be reformulated in terms of "foo_take", INCOMPATIBILITY.
469 * Most definedness lemmas generated by the domain package (previously
470 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
471 like "foo$x = UU <-> x = UU", which works better as a simp rule.
472 Proof scripts that used definedness lemmas as intro rules may break,
473 potential INCOMPATIBILITY.
475 * Induction and casedist rules generated by the domain package now
476 declare proper case_names (one called "bottom", and one named for each
477 constructor). INCOMPATIBILITY.
479 * For mutually-recursive domains, separate "reach" and "take_lemma"
480 rules are generated for each domain, INCOMPATIBILITY.
482 foo_bar.reach ~> foo.reach bar.reach
483 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
485 * Some lemmas generated by the domain package have been renamed for
486 consistency with the datatype package, INCOMPATIBILITY.
488 foo.ind ~> foo.induct
489 foo.finite_ind ~> foo.finite_induct
490 foo.coind ~> foo.coinduct
491 foo.casedist ~> foo.exhaust
492 foo.exhaust ~> foo.nchotomy
494 * For consistency with other definition packages, the fixrec package
495 now generates qualified theorem names, INCOMPATIBILITY.
497 foo_simps ~> foo.simps
498 foo_unfold ~> foo.unfold
499 foo_induct ~> foo.induct
501 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
502 method and internal fixrec proofs now use the default simpset instead.
505 * The "contlub" predicate has been removed. Proof scripts should use
506 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
508 * The "admw" predicate has been removed, INCOMPATIBILITY.
510 * The constants cpair, cfst, and csnd have been removed in favor of
511 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
516 * Renamed some important ML structures, while keeping the old names
517 for some time as aliases within the structure Legacy:
519 OuterKeyword ~> Keyword
522 OuterSyntax ~> Outer_Syntax
523 PrintMode ~> Print_Mode
524 SpecParse ~> Parse_Spec
527 ThyOutput ~> Thy_Output
528 TypeInfer ~> Type_Infer
530 Note that "open Legacy" simplifies porting of sources, but forgetting
531 to remove it again will complicate porting again in the future.
533 * Most operations that refer to a global context are named
534 accordingly, e.g. Simplifier.global_context or
535 ProofContext.init_global. There are some situations where a global
536 context actually works, but under normal circumstances one needs to
537 pass the proper local context through the code!
539 * Discontinued old TheoryDataFun with its copy/init operation -- data
540 needs to be pure. Functor Theory_Data_PP retains the traditional
541 Pretty.pp argument to merge, which is absent in the standard
544 * Antiquotations for basic formal entities:
546 @{class NAME} -- type class
547 @{class_syntax NAME} -- syntax representation of the above
549 @{type_name NAME} -- logical type
550 @{type_abbrev NAME} -- type abbreviation
551 @{nonterminal NAME} -- type of concrete syntactic category
552 @{type_syntax NAME} -- syntax representation of any of the above
554 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
555 @{const_abbrev NAME} -- abbreviated constant
556 @{const_syntax NAME} -- syntax representation of any of the above
558 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
559 syntax constant (cf. 'syntax' command).
561 * Antiquotation @{make_string} inlines a function to print arbitrary
562 values similar to the ML toplevel. The result is compiler dependent
563 and may fall back on "?" in certain situations.
565 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
566 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
567 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
568 not work with the asynchronous Isar document model.
570 * Sorts.certify_sort and derived "cert" operations for types and terms
571 no longer minimize sorts. Thus certification at the boundary of the
572 inference kernel becomes invariant under addition of class relations,
573 which is an important monotonicity principle. Sorts are now minimized
574 in the syntax layer only, at the boundary between the end-user and the
575 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
576 explicitly in rare situations.
578 * Renamed old-style Drule.standard to Drule.export_without_context, to
579 emphasize that this is in no way a standard operation.
582 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
583 usual for resolution. Rare INCOMPATIBILITY.
585 * Renamed varify/unvarify operations to varify_global/unvarify_global
586 to emphasize that these only work in a global situation (which is
589 * Configuration options now admit dynamic default values, depending on
590 the context or even global references.
592 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
593 uses an efficient external library if available (for Poly/ML).
595 * Curried take and drop in library.ML; negative length is interpreted
596 as infinity (as in chop). Subtle INCOMPATIBILITY.
601 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
602 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
603 proof terms are enabled unconditionally in the new HOL-Proofs image.
605 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
606 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
609 * Old lib/scripts/polyml-platform is superseded by the
610 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
611 variant, even on a 64 bit machine. The following example setting
612 prefers 64 bit if available:
614 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
616 * The preliminary Isabelle/jEdit application demonstrates the emerging
617 Isabelle/Scala layer for advanced prover interaction and integration.
618 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
623 New in Isabelle2009-1 (December 2009)
624 -------------------------------------
628 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
629 one backslash should be used, even in ML sources.
634 * Locale interpretation propagates mixins along the locale hierarchy.
635 The currently only available mixins are the equations used to map
636 local definitions to terms of the target domain of an interpretation.
638 * Reactivated diagnostic command 'print_interps'. Use "print_interps
639 loc" to print all interpretations of locale "loc" in the theory.
640 Interpretations in proofs are not shown.
642 * Thoroughly revised locales tutorial. New section on conditional
645 * On instantiation of classes, remaining undefined class parameters
646 are formally declared. INCOMPATIBILITY.
649 *** Document preparation ***
651 * New generalized style concept for printing terms: @{foo (style) ...}
652 instead of @{foo_style style ...} (old form is still retained for
653 backward compatibility). Styles can be also applied for
654 antiquotations prop, term_type and typeof.
659 * New proof method "smt" for a combination of first-order logic with
660 equality, linear and nonlinear (natural/integer/real) arithmetic, and
661 fixed-size bitvectors; there is also basic support for higher-order
662 features (esp. lambda abstractions). It is an incomplete decision
663 procedure based on external SMT solvers using the oracle mechanism;
664 for the SMT solver Z3, this method is proof-producing. Certificates
665 are provided to avoid calling the external solvers solely for
666 re-checking proofs. Due to a remote SMT service there is no need for
667 installing SMT solvers locally. See src/HOL/SMT.
669 * New commands to load and prove verification conditions generated by
670 the Boogie program verifier or derived systems (e.g. the Verifying C
671 Compiler (VCC) or Spec#). See src/HOL/Boogie.
673 * New counterexample generator tool 'nitpick' based on the Kodkod
674 relational model finder. See src/HOL/Tools/Nitpick and
675 src/HOL/Nitpick_Examples.
677 * New commands 'code_pred' and 'values' to invoke the predicate
678 compiler and to enumerate values of inductive predicates.
680 * A tabled implementation of the reflexive transitive closure.
682 * New implementation of quickcheck uses generic code generator;
683 default generators are provided for all suitable HOL types, records
684 and datatypes. Old quickcheck can be re-activated importing theory
685 Library/SML_Quickcheck.
687 * New testing tool Mirabelle for automated proof tools. Applies
688 several tools and tactics like sledgehammer, metis, or quickcheck, to
689 every proof step in a theory. To be used in batch mode via the
692 * New proof method "sos" (sum of squares) for nonlinear real
693 arithmetic (originally due to John Harison). It requires theory
694 Library/Sum_Of_Squares. It is not a complete decision procedure but
695 works well in practice on quantifier-free real arithmetic with +, -,
696 *, ^, =, <= and <, i.e. boolean combinations of equalities and
697 inequalities between polynomials. It makes use of external
698 semidefinite programming solvers. Method "sos" generates a
699 certificate that can be pasted into the proof thus avoiding the need
700 to call an external tool every time the proof is checked. See
701 src/HOL/Library/Sum_Of_Squares.
703 * New method "linarith" invokes existing linear arithmetic decision
706 * New command 'atp_minimal' reduces result produced by Sledgehammer.
708 * New Sledgehammer option "Full Types" in Proof General settings menu.
709 Causes full type information to be output to the ATPs. This slows
710 ATPs down considerably but eliminates a source of unsound "proofs"
713 * New method "metisFT": A version of metis that uses full type
714 information in order to avoid failures of proof reconstruction.
716 * New evaluator "approximate" approximates an real valued term using
717 the same method as the approximation method.
719 * Method "approximate" now supports arithmetic expressions as
720 boundaries of intervals and implements interval splitting and Taylor
723 * ML antiquotation @{code_datatype} inserts definition of a datatype
724 generated by the code generator; e.g. see src/HOL/Predicate.thy.
726 * New theory SupInf of the supremum and infimum operators for sets of
729 * New theory Probability, which contains a development of measure
730 theory, eventually leading to Lebesgue integration and probability.
732 * Extended Multivariate Analysis to include derivation and Brouwer's
735 * Reorganization of number theory, INCOMPATIBILITY:
736 - new number theory development for nat and int, in theories Divides
737 and GCD as well as in new session Number_Theory
738 - some constants and facts now suffixed with _nat and _int
740 - former session NumberTheory now named Old_Number_Theory, including
741 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
742 - moved theory Pocklington from src/HOL/Library to
743 src/HOL/Old_Number_Theory
745 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
746 lcm of finite and infinite sets. It is shown that they form a complete
749 * Class semiring_div requires superclass no_zero_divisors and proof of
750 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
751 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
752 generalized to class semiring_div, subsuming former theorems
753 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
754 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
757 * Refinements to lattice classes and sets:
758 - less default intro/elim rules in locale variant, more default
759 intro/elim rules in class variant: more uniformity
760 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
762 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
764 - renamed ACI to inf_sup_aci
765 - new class "boolean_algebra"
766 - class "complete_lattice" moved to separate theory
767 "Complete_Lattice"; corresponding constants (and abbreviations)
768 renamed and with authentic syntax:
769 Set.Inf ~> Complete_Lattice.Inf
770 Set.Sup ~> Complete_Lattice.Sup
771 Set.INFI ~> Complete_Lattice.INFI
772 Set.SUPR ~> Complete_Lattice.SUPR
773 Set.Inter ~> Complete_Lattice.Inter
774 Set.Union ~> Complete_Lattice.Union
775 Set.INTER ~> Complete_Lattice.INTER
776 Set.UNION ~> Complete_Lattice.UNION
777 - authentic syntax for
780 - mere abbreviations:
783 Set.inter (for inf, formerly Set.Int)
784 Set.union (for sup, formerly Set.Un)
785 Complete_Lattice.Inter (for Inf)
786 Complete_Lattice.Union (for Sup)
787 Complete_Lattice.INTER (for INFI)
788 Complete_Lattice.UNION (for SUPR)
789 - object-logic definitions as far as appropriate
791 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
792 Un_subset_iff are explicitly deleted as default simp rules; then also
793 their lattice counterparts le_inf_iff and le_sup_iff have to be
794 deleted to achieve the desired effect.
796 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
797 rules by default any longer; the same applies to min_max.inf_absorb1
798 etc. INCOMPATIBILITY.
800 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
801 pred_set_conv by default. INCOMPATIBILITY.
803 * Power operations on relations and functions are now one dedicated
804 constant "compow" with infix syntax "^^". Power operation on
805 multiplicative monoids retains syntax "^" and is now defined generic
806 in class power. INCOMPATIBILITY.
808 * Relation composition "R O S" now has a more standard argument order:
809 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
810 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
811 break, since the O_assoc rule was not rewritten like this. Fix using
812 O_assoc[symmetric]. The same applies to the curried version "R OO S".
814 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
815 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
818 * Most rules produced by inductive and datatype package have mandatory
819 prefixes. INCOMPATIBILITY.
821 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
822 the attribute of the same name. Each of the theorems in the list
823 DERIV_intros assumes composition with an additional function and
824 matches a variable to the derivative, which has to be solved by the
825 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
826 of most elementary terms. Former Maclauren.DERIV_tac and
827 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
830 * Code generator attributes follow the usual underscore convention:
831 code_unfold replaces code unfold
832 code_post replaces code post
837 sizechange -> size_change
838 induct_scheme -> induction_schema
841 * Discontinued abbreviation "arbitrary" of constant "undefined".
842 INCOMPATIBILITY, use "undefined" directly.
845 Suc_eq_add_numeral_1 -> Suc_eq_plus1
846 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
847 Suc_plus1 -> Suc_eq_plus1
848 *anti_sym -> *antisym*
849 vector_less_eq_def -> vector_le_def
852 * Added theorem List.map_map as [simp]. Removed List.map_compose.
855 * Removed predicate "M hassize n" (<--> card M = n & finite M).
861 * Theory Representable defines a class "rep" of domains that are
862 representable (via an ep-pair) in the universal domain type "udom".
863 Instances are provided for all type constructors defined in HOLCF.
865 * The 'new_domain' command is a purely definitional version of the
866 domain package, for representable domains. Syntax is identical to the
867 old domain package. The 'new_domain' package also supports indirect
868 recursion using previously-defined type constructors. See
869 src/HOLCF/ex/New_Domain.thy for examples.
871 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
872 on the left-hand side of an equation, and then performs
873 simplification. Rewriting is done using rules declared with the
874 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
875 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
877 * The pattern-match compiler in 'fixrec' can now handle constructors
878 with HOL function types. Pattern-match combinators for the Pair
879 constructor are pre-configured.
881 * The 'fixrec' package now produces better fixed-point induction rules
882 for mutually-recursive definitions: Induction rules have conclusions
883 of the form "P foo bar" instead of "P <foo, bar>".
885 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
886 been renamed to "below". The name "below" now replaces "less" in many
887 theorem names. (Legacy theorem names using "less" are still supported
890 * The 'fixrec' package now supports "bottom patterns". Bottom
891 patterns can be used to generate strictness rules, or to make
892 functions more strict (much like the bang-patterns supported by the
893 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
899 * Support for Poly/ML 5.3.0, with improved reporting of compiler
900 errors and run-time exceptions, including detailed source positions.
902 * Structure Name_Space (formerly NameSpace) now manages uniquely
903 identified entries, with some additional information such as source
904 position, logical grouping etc.
906 * Theory and context data is now introduced by the simplified and
907 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
908 to be pure, but the old TheoryDataFun for mutable data (with explicit
909 copy operation) is still available for some time.
911 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
912 provides a high-level programming interface to synchronized state
913 variables with atomic update. This works via pure function
914 application within a critical section -- its runtime should be as
915 short as possible; beware of deadlocks if critical code is nested,
916 either directly or indirectly via other synchronized variables!
918 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
919 wraps raw ML references, explicitly indicating their non-thread-safe
920 behaviour. The Isar toplevel keeps this structure open, to
921 accommodate Proof General as well as quick and dirty interactive
922 experiments with references.
924 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
925 parallel tactical reasoning.
927 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
928 are similar to SUBPROOF, but are slightly more flexible: only the
929 specified parts of the subgoal are imported into the context, and the
930 body tactic may introduce new subgoals and schematic variables.
932 * Old tactical METAHYPS, which does not observe the proof context, has
933 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
934 or Subgoal.FOCUS etc.
936 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
937 functors have their own ML name space there is no point to mark them
938 separately.) Minor INCOMPATIBILITY.
940 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
942 * Renamed several structures FooBar to Foo_Bar. Occasional,
945 * Operations of structure Skip_Proof no longer require quick_and_dirty
946 mode, which avoids critical setmp.
948 * Eliminated old Attrib.add_attributes, Method.add_methods and related
949 combinators for "args". INCOMPATIBILITY, need to use simplified
950 Attrib/Method.setup introduced in Isabelle2009.
952 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
953 back on global_simpset_of, global_claset_of, global_clasimpset_of as
954 last resort. INCOMPATIBILITY.
956 * Display.pretty_thm now requires a proper context (cf. former
957 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
958 or even Display.pretty_thm_without_context as last resort.
961 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
962 Syntax.pretty_typ/term directly, preferably with proper context
963 instead of global theory.
968 * Further fine tuning of parallel proof checking, scales up to 8 cores
969 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
972 * Support for additional "Isabelle components" via etc/components, see
973 also the system manual.
975 * The isabelle makeall tool now operates on all components with
976 IsaMakefile, not just hardwired "logics".
978 * Removed "compress" option from isabelle-process and isabelle usedir;
979 this is always enabled.
981 * Discontinued support for Poly/ML 4.x versions.
983 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
984 on a given logic image. This requires the lighttpd webserver and is
985 currently supported on Linux only.
989 New in Isabelle2009 (April 2009)
990 --------------------------------
994 * Simplified main Isabelle executables, with less surprises on
995 case-insensitive file-systems (such as Mac OS).
997 - The main Isabelle tool wrapper is now called "isabelle" instead of
1000 - The former "isabelle" alias for "isabelle-process" has been
1001 removed (should rarely occur to regular users).
1003 - The former "isabelle-interface" and its alias "Isabelle" have been
1004 removed (interfaces are now regular Isabelle tools).
1006 Within scripts and make files, the Isabelle environment variables
1007 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1008 respectively. (The latter are still available as legacy feature.)
1010 The old isabelle-interface wrapper could react in confusing ways if
1011 the interface was uninstalled or changed otherwise. Individual
1012 interface tool configuration is now more explicit, see also the
1013 Isabelle system manual. In particular, Proof General is now available
1014 via "isabelle emacs".
1016 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1017 purge installed copies of Isabelle executables and re-run "isabelle
1018 install -p ...", or use symlinks.
1020 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1021 old ~/isabelle, which was slightly non-standard and apt to cause
1022 surprises on case-insensitive file-systems (such as Mac OS).
1024 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1025 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1026 care is required when using older releases of Isabelle. Note that
1027 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1028 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1030 * Proofs of fully specified statements are run in parallel on
1031 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1032 a regular 4-core machine, if the initial heap space is made reasonably
1033 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1035 * The main reference manuals ("isar-ref", "implementation", and
1036 "system") have been updated and extended. Formally checked references
1037 as hyperlinks are now available uniformly.
1042 * Complete re-implementation of locales. INCOMPATIBILITY in several
1043 respects. The most important changes are listed below. See the
1044 Tutorial on Locales ("locales" manual) for details.
1046 - In locale expressions, instantiation replaces renaming. Parameters
1047 must be declared in a for clause. To aid compatibility with previous
1048 parameter inheritance, in locale declarations, parameters that are not
1049 'touched' (instantiation position "_" or omitted) are implicitly added
1050 with their syntax at the beginning of the for clause.
1052 - Syntax from abbreviations and definitions in locales is available in
1053 locale expressions and context elements. The latter is particularly
1054 useful in locale declarations.
1056 - More flexible mechanisms to qualify names generated by locale
1057 expressions. Qualifiers (prefixes) may be specified in locale
1058 expressions, and can be marked as mandatory (syntax: "name!:") or
1059 optional (syntax "name?:"). The default depends for plain "name:"
1060 depends on the situation where a locale expression is used: in
1061 commands 'locale' and 'sublocale' prefixes are optional, in
1062 'interpretation' and 'interpret' prefixes are mandatory. The old
1063 implicit qualifiers derived from the parameter names of a locale are
1064 no longer generated.
1066 - Command "sublocale l < e" replaces "interpretation l < e". The
1067 instantiation clause in "interpretation" and "interpret" (square
1068 brackets) is no longer available. Use locale expressions.
1070 - When converting proof scripts, mandatory qualifiers in
1071 'interpretation' and 'interpret' should be retained by default, even
1072 if this is an INCOMPATIBILITY compared to former behavior. In the
1073 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1074 in locale expressions range over a single locale instance only.
1076 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1077 In existing theorem specifications replace the includes element by the
1078 respective context elements of the included locale, omitting those
1079 that are already present in the theorem specification. Multiple
1080 assume elements of a locale should be replaced by a single one
1081 involving the locale predicate. In the proof body, declarations (most
1082 notably theorems) may be regained by interpreting the respective
1083 locales in the proof context as required (command "interpret").
1085 If using "includes" in replacement of a target solely because the
1086 parameter types in the theorem are not as general as in the target,
1087 consider declaring a new locale with additional type constraints on
1088 the parameters (context element "constrains").
1090 - Discontinued "locale (open)". INCOMPATIBILITY.
1092 - Locale interpretation commands no longer attempt to simplify goal.
1093 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1094 methods intro_locales and unfold_locales to clarify.
1096 - Locale interpretation commands no longer accept interpretation
1097 attributes. INCOMPATIBILITY.
1099 * Class declaration: so-called "base sort" must not be given in import
1100 list any longer, but is inferred from the specification. Particularly
1107 class foo = type + ...
1109 * Class target: global versions of theorems stemming do not carry a
1110 parameter prefix any longer. INCOMPATIBILITY.
1112 * Class 'instance' command no longer accepts attached definitions.
1113 INCOMPATIBILITY, use proper 'instantiation' target instead.
1115 * Recovered hiding of consts, which was accidentally broken in
1116 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1117 makes c inaccessible; consider using ``hide (open) const c'' instead.
1119 * Slightly more coherent Pure syntax, with updated documentation in
1120 isar-ref manual. Removed locales meta_term_syntax and
1121 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1122 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1123 directly in regular applications.
1125 * There is a new syntactic category "float_const" for signed decimal
1126 fractions (e.g. 123.45 or -123.45).
1128 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1129 interface with 'setup' command instead.
1131 * Command 'local_setup' is similar to 'setup', but operates on a local
1134 * The 'axiomatization' command now only works within a global theory
1135 context. INCOMPATIBILITY.
1137 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1138 hypotheses. Sorts required in the course of reasoning need to be
1139 covered by the constraints in the initial statement, completed by the
1140 type instance information of the background theory. Non-trivial sort
1141 hypotheses, which rarely occur in practice, may be specified via
1142 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1144 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1146 The result contains an implicit sort hypotheses as before --
1147 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1150 * Generalized Isar history, with support for linear undo, direct state
1153 * Changed defaults for unify configuration options:
1155 unify_trace_bound = 50 (formerly 25)
1156 unify_search_bound = 60 (formerly 30)
1158 * Different bookkeeping for code equations (INCOMPATIBILITY):
1160 a) On theory merge, the last set of code equations for a particular
1161 constant is taken (in accordance with the policy applied by other
1162 parts of the code generator framework).
1164 b) Code equations stemming from explicit declarations (e.g. code
1165 attribute) gain priority over default code equations stemming
1166 from definition, primrec, fun etc.
1168 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1170 * Unified theorem tables for both code generators. Thus [code
1171 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1173 * Command 'find_consts' searches for constants based on type and name
1176 find_consts "_ => bool"
1178 By default, matching is against subtypes, but it may be restricted to
1179 the whole type. Searching by name is possible. Multiple queries are
1180 conjunctive and queries may be negated by prefixing them with a
1183 find_consts strict: "_ => bool" name: "Int" -"int => int"
1185 * New 'find_theorems' criterion "solves" matches theorems that
1186 directly solve the current goal (modulo higher-order unification).
1188 * Auto solve feature for main theorem statements: whenever a new goal
1189 is stated, "find_theorems solves" is called; any theorems that could
1190 solve the lemma directly are listed as part of the goal state.
1191 Cf. associated options in Proof General Isabelle settings menu,
1192 enabled by default, with reasonable timeout for pathological cases of
1193 higher-order unification.
1196 *** Document preparation ***
1198 * Antiquotation @{lemma} now imitates a regular terminal proof,
1199 demanding keyword 'by' and supporting the full method expression
1200 syntax just like the Isar command 'by'.
1205 * Integrated main parts of former image HOL-Complex with HOL. Entry
1206 points Main and Complex_Main remain as before.
1208 * Logic image HOL-Plain provides a minimal HOL with the most important
1209 tools available (inductive, datatype, primrec, ...). This facilitates
1210 experimentation and tool development. Note that user applications
1211 (and library theories) should never refer to anything below theory
1214 * Logic image HOL-Main stops at theory Main, and thus facilitates
1215 experimentation due to shorter build times.
1217 * Logic image HOL-NSA contains theories of nonstandard analysis which
1218 were previously part of former HOL-Complex. Entry point Hyperreal
1219 remains valid, but theories formerly using Complex_Main should now use
1220 new entry point Hypercomplex.
1222 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1223 Posix processes. Avoids potentially expensive forking of the ML
1224 process. New thread-based implementation also works on non-Unix
1225 platforms (Cygwin). Provers are no longer hardwired, but defined
1226 within the theory via plain ML wrapper functions. Basic Sledgehammer
1227 commands are covered in the isar-ref manual.
1229 * Wrapper scripts for remote SystemOnTPTP service allows to use
1230 sledgehammer without local ATP installation (Vampire etc.). Other
1231 provers may be included via suitable ML wrappers, see also
1232 src/HOL/ATP_Linkup.thy.
1234 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1237 * The metis method no longer fails because the theorem is too trivial
1238 (contains the empty clause).
1240 * The metis method now fails in the usual manner, rather than raising
1241 an exception, if it determines that it cannot prove the theorem.
1243 * Method "coherent" implements a prover for coherent logic (see also
1244 src/Tools/coherent.ML).
1246 * Constants "undefined" and "default" replace "arbitrary". Usually
1247 "undefined" is the right choice to replace "arbitrary", though
1248 logically there is no difference. INCOMPATIBILITY.
1250 * Command "value" now integrates different evaluation mechanisms. The
1251 result of the first successful evaluation mechanism is printed. In
1252 square brackets a particular named evaluation mechanisms may be
1253 specified (currently, [SML], [code] or [nbe]). See further
1254 src/HOL/ex/Eval_Examples.thy.
1256 * Normalization by evaluation now allows non-leftlinear equations.
1257 Declare with attribute [code nbe].
1259 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1260 as the structured Isar versions "cases" and "induct", cf. the
1261 corresponding "cases" and "induct" attributes. Mutual induction rules
1262 are now presented as a list of individual projections
1263 (e.g. foo_bar.inducts for types foo and bar); the old format with
1264 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1265 rare situations a different rule is selected --- notably nested tuple
1266 elimination instead of former prod.exhaust: use explicit (case_tac t
1267 rule: prod.exhaust) here.
1269 * Attributes "cases", "induct", "coinduct" support "del" option.
1271 * Removed fact "case_split_thm", which duplicates "case_split".
1273 * The option datatype has been moved to a new theory Option. Renamed
1274 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1276 * New predicate "strict_mono" classifies strict functions on partial
1277 orders. With strict functions on linear orders, reasoning about
1278 (in)equalities is facilitated by theorems "strict_mono_eq",
1279 "strict_mono_less_eq" and "strict_mono_less".
1281 * Some set operations are now proper qualified constants with
1282 authentic syntax. INCOMPATIBILITY:
1293 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1296 * Auxiliary class "itself" has disappeared -- classes without any
1297 parameter are treated as expected by the 'class' command.
1299 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1301 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1302 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1304 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1305 method "approximation". It proves formulas on real values by using
1306 interval arithmetic. In the formulas are also the transcendental
1307 functions sin, cos, tan, atan, ln, exp and the constant pi are
1308 allowed. For examples see
1309 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1311 * Theory "Reflection" now resides in HOL/Library.
1313 * Entry point to Word library now simply named "Word".
1316 * Made source layout more coherent with logical distribution
1319 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1320 src/HOL/Library/Code_Message.thy ~> src/HOL/
1321 src/HOL/Library/GCD.thy ~> src/HOL/
1322 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1323 src/HOL/Library/Parity.thy ~> src/HOL/
1324 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1325 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1326 src/HOL/Real/Lubs.thy ~> src/HOL/
1327 src/HOL/Real/PReal.thy ~> src/HOL/
1328 src/HOL/Real/Rational.thy ~> src/HOL/
1329 src/HOL/Real/RComplete.thy ~> src/HOL/
1330 src/HOL/Real/RealDef.thy ~> src/HOL/
1331 src/HOL/Real/RealPow.thy ~> src/HOL/
1332 src/HOL/Real/Real.thy ~> src/HOL/
1333 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1334 src/HOL/Complex/Complex.thy ~> src/HOL/
1335 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1336 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1337 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1338 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1339 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1340 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1341 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1342 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1343 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1344 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1345 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1346 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1347 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1348 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1349 src/HOL/Real/Float ~> src/HOL/Library/
1350 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1351 src/HOL/Real/RealVector.thy ~> src/HOL/
1353 src/HOL/arith_data.ML ~> src/HOL/Tools
1354 src/HOL/hologic.ML ~> src/HOL/Tools
1355 src/HOL/simpdata.ML ~> src/HOL/Tools
1356 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1357 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1358 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1359 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1360 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1361 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1362 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1364 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1365 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1366 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1367 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1368 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1369 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1371 * If methods "eval" and "evaluation" encounter a structured proof
1372 state with !!/==>, only the conclusion is evaluated to True (if
1373 possible), avoiding strange error messages.
1375 * Method "sizechange" automates termination proofs using (a
1376 modification of) the size-change principle. Requires SAT solver. See
1377 src/HOL/ex/Termination.thy for examples.
1379 * Simplifier: simproc for let expressions now unfolds if bound
1380 variable occurs at most once in let expression body. INCOMPATIBILITY.
1382 * Method "arith": Linear arithmetic now ignores all inequalities when
1383 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1385 * New attribute "arith" for facts that should always be used
1386 automatically by arithmetic. It is intended to be used locally in
1389 assumes [arith]: "x > 0"
1391 Global usage is discouraged because of possible performance impact.
1393 * New classes "top" and "bot" with corresponding operations "top" and
1394 "bot" in theory Orderings; instantiation of class "complete_lattice"
1395 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1397 * Changed definition lemma "less_fun_def" in order to provide an
1398 instance for preorders on functions; use lemma "less_le" instead.
1401 * Theory Orderings: class "wellorder" moved here, with explicit
1402 induction rule "less_induct" as assumption. For instantiation of
1403 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1406 * Theory Orderings: added class "preorder" as superclass of "order".
1407 INCOMPATIBILITY: Instantiation proofs for order, linorder
1408 etc. slightly changed. Some theorems named order_class.* now named
1411 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1414 * Theory Finite_Set: added a new fold combinator of type
1416 ('a => 'b => 'b) => 'b => 'a set => 'b
1418 Occasionally this is more convenient than the old fold combinator
1419 which is now defined in terms of the new one and renamed to
1422 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1423 and "ring_simps" have been replaced by "algebra_simps" (which can be
1424 extended with further lemmas!). At the moment both still exist but
1425 the former will disappear at some point.
1427 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1428 class recpower. Type-specific simp rules for various recpower types
1429 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1431 rat_power_0 -> power_0
1432 rat_power_Suc -> power_Suc
1433 realpow_0 -> power_0
1434 realpow_Suc -> power_Suc
1435 complexpow_0 -> power_0
1436 complexpow_Suc -> power_Suc
1437 power_poly_0 -> power_0
1438 power_poly_Suc -> power_Suc
1440 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1441 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1442 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1443 of lemmas from Divides has been generalized from nat to class
1444 semiring_div. INCOMPATIBILITY. This involves the following theorem
1445 renames resulting from duplicate elimination:
1447 dvd_def_mod ~> dvd_eq_mod_eq_0
1448 zero_dvd_iff ~> dvd_0_left_iff
1449 dvd_0 ~> dvd_0_right
1450 DIVISION_BY_ZERO_DIV ~> div_by_0
1451 DIVISION_BY_ZERO_MOD ~> mod_by_0
1452 mult_div ~> div_mult_self2_is_id
1453 mult_mod ~> mod_mult_self2_is_0
1455 * Theory IntDiv: removed many lemmas that are instances of class-based
1456 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1457 rename old lemmas as follows:
1459 dvd_diff -> nat_dvd_diff
1460 dvd_zminus_iff -> dvd_minus_iff
1461 mod_add1_eq -> mod_add_eq
1462 mod_mult1_eq -> mod_mult_right_eq
1463 mod_mult1_eq' -> mod_mult_left_eq
1464 mod_mult_distrib_mod -> mod_mult_eq
1465 nat_mod_add_left_eq -> mod_add_left_eq
1466 nat_mod_add_right_eq -> mod_add_right_eq
1467 nat_mod_div_trivial -> mod_div_trivial
1468 nat_mod_mod_trivial -> mod_mod_trivial
1469 zdiv_zadd_self1 -> div_add_self1
1470 zdiv_zadd_self2 -> div_add_self2
1471 zdiv_zmult_self1 -> div_mult_self2_is_id
1472 zdiv_zmult_self2 -> div_mult_self1_is_id
1473 zdvd_triv_left -> dvd_triv_left
1474 zdvd_triv_right -> dvd_triv_right
1475 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1476 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1477 zmod_zadd_left_eq -> mod_add_left_eq
1478 zmod_zadd_right_eq -> mod_add_right_eq
1479 zmod_zadd_self1 -> mod_add_self1
1480 zmod_zadd_self2 -> mod_add_self2
1481 zmod_zadd1_eq -> mod_add_eq
1482 zmod_zdiff1_eq -> mod_diff_eq
1483 zmod_zdvd_zmod -> mod_mod_cancel
1484 zmod_zmod_cancel -> mod_mod_cancel
1485 zmod_zmult_self1 -> mod_mult_self2_is_0
1486 zmod_zmult_self2 -> mod_mult_self1_is_0
1489 zdvd_abs1 -> abs_dvd_iff
1490 zdvd_abs2 -> dvd_abs_iff
1491 zdvd_refl -> dvd_refl
1492 zdvd_trans -> dvd_trans
1493 zdvd_zadd -> dvd_add
1494 zdvd_zdiff -> dvd_diff
1495 zdvd_zminus_iff -> dvd_minus_iff
1496 zdvd_zminus2_iff -> minus_dvd_iff
1497 zdvd_zmultD -> dvd_mult_right
1498 zdvd_zmultD2 -> dvd_mult_left
1499 zdvd_zmult_mono -> mult_dvd_mono
1500 zdvd_0_right -> dvd_0_right
1501 zdvd_0_left -> dvd_0_left_iff
1502 zdvd_1_left -> one_dvd
1503 zminus_dvd_iff -> minus_dvd_iff
1505 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1507 * The real numbers offer decimal input syntax: 12.34 is translated
1508 into 1234/10^2. This translation is not reversed upon output.
1510 * Theory Library/Polynomial defines an abstract type 'a poly of
1511 univariate polynomials with coefficients of type 'a. In addition to
1512 the standard ring operations, it also supports div and mod. Code
1513 generation is also supported, using list-style constructors.
1515 * Theory Library/Inner_Product defines a class of real_inner for real
1516 inner product spaces, with an overloaded operation inner :: 'a => 'a
1517 => real. Class real_inner is a subclass of real_normed_vector from
1520 * Theory Library/Product_Vector provides instances for the product
1521 type 'a * 'b of several classes from RealVector and Inner_Product.
1522 Definitions of addition, subtraction, scalar multiplication, norms,
1523 and inner products are included.
1525 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1526 addition to the field operations, numerals and case syntax are also
1529 * Theory Library/Diagonalize provides constructive version of Cantor's
1530 first diagonalization argument.
1532 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1533 zlcm (for int); carried together from various gcd/lcm developements in
1534 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1535 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1536 may recover tupled syntax as follows:
1538 hide (open) const gcd
1539 abbreviation gcd where
1540 "gcd == (%(a, b). GCD.gcd a b)"
1542 GCD.gcd ("gcd '(_, _')")
1544 The same works for lcm, zgcd, zlcm.
1546 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1547 instantiations for algebraic structures. Removed some duplicate
1548 theorems. Changes in simp rules. INCOMPATIBILITY.
1550 * ML antiquotation @{code} takes a constant as argument and generates
1551 corresponding code in background and inserts name of the corresponding
1552 resulting ML value/function/datatype constructor binding in place.
1553 All occurrences of @{code} with a single ML block are generated
1554 simultaneously. Provides a generic and safe interface for
1555 instrumentalizing code generation. See
1556 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1557 In future you ought to refrain from ad-hoc compiling generated SML
1558 code on the ML toplevel. Note that (for technical reasons) @{code}
1559 cannot refer to constants for which user-defined serializations are
1560 set. Refer to the corresponding ML counterpart directly in that
1563 * Command 'rep_datatype': instead of theorem names the command now
1564 takes a list of terms denoting the constructors of the type to be
1565 represented as datatype. The characteristic theorems have to be
1566 proven. INCOMPATIBILITY. Also observe that the following theorems
1567 have disappeared in favour of existing ones:
1569 unit_induct ~> unit.induct
1570 prod_induct ~> prod.induct
1571 sum_induct ~> sum.induct
1572 Suc_Suc_eq ~> nat.inject
1573 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1578 * New locales for orders and lattices where the equivalence relation
1579 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1580 locales use a record structure with field eq for the equivalence.
1582 * New theory of factorial domains.
1584 * Units_l_inv and Units_r_inv are now simp rules by default.
1585 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1586 and/or r_inv will now also require deletion of these lemmas.
1588 * Renamed the following theorems, INCOMPATIBILITY:
1590 UpperD ~> Upper_memD
1591 LowerD ~> Lower_memD
1592 least_carrier ~> least_closed
1593 greatest_carrier ~> greatest_closed
1594 greatest_Lower_above ~> greatest_Lower_below
1595 one_zero ~> carrier_one_zero
1596 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1601 * Nominal datatypes can now contain type-variables.
1603 * Commands 'nominal_inductive' and 'equivariance' work with local
1606 * Nominal primrec can now works with local theory targets and its
1607 specification syntax now conforms to the general format as seen in
1610 * Method "perm_simp" honours the standard simplifier attributes
1611 (no_asm), (no_asm_use) etc.
1613 * The new predicate #* is defined like freshness, except that on the
1614 left hand side can be a set or list of atoms.
1616 * Experimental command 'nominal_inductive2' derives strong induction
1617 principles for inductive definitions. In contrast to
1618 'nominal_inductive', which can only deal with a fixed number of
1619 binders, it can deal with arbitrary expressions standing for sets of
1620 atoms to be avoided. The only inductive definition we have at the
1621 moment that needs this generalisation is the typing rule for Lets in
1624 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1625 -----------------------------------------------------------------
1626 Gamma |- Let x be t1 in t2 : T2
1628 In this rule one wants to avoid all the binders that are introduced by
1629 "close Gamma T1". We are looking for other examples where this
1630 feature might be useful. Please let us know.
1635 * Reimplemented the simplification procedure for proving continuity
1636 subgoals. The new simproc is extensible; users can declare additional
1637 continuity introduction rules with the attribute [cont2cont].
1639 * The continuity simproc now uses a different introduction rule for
1640 solving continuity subgoals on terms with lambda abstractions. In
1641 some rare cases the new simproc may fail to solve subgoals that the
1642 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1643 Potential INCOMPATIBILITY.
1645 * Command 'fixrec': specification syntax now conforms to the general
1646 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1647 examples. INCOMPATIBILITY.
1652 * Proof of Zorn's Lemma for partial orders.
1657 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1658 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1659 depends on multithreading, so timouts will not work before Poly/ML
1662 * High-level support for concurrent ML programming, see
1663 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1664 particularly convenient to organize independent functional
1665 computations. The concept of "synchronized variables" provides a
1666 higher-order interface for components with shared state, avoiding the
1667 delicate details of mutexes and condition variables. (Requires
1668 Poly/ML 5.2.1 or later.)
1670 * ML bindings produced via Isar commands are stored within the Isar
1671 context (theory or proof). Consequently, commands like 'use' and 'ML'
1672 become thread-safe and work with undo as expected (concerning
1673 top-level bindings, not side-effects on global references).
1674 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1675 compiler at runtime; really global bindings need to be given outside a
1676 theory. (Requires Poly/ML 5.2 or later.)
1678 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1679 context. Top-level ML bindings are stored within the proof context in
1680 a purely sequential fashion, disregarding the nested proof structure.
1681 ML bindings introduced by 'ML_prf' are discarded at the end of the
1682 proof. (Requires Poly/ML 5.2 or later.)
1684 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1685 and Method.setup, as well as Isar commands 'attribute_setup' and
1686 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1687 existing code accordingly, or use plain 'setup' together with old
1690 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1691 to 'a -> thm, while results are always tagged with an authentic oracle
1692 name. The Isar command 'oracle' is now polymorphic, no argument type
1693 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1694 accordingly. Note that extra performance may be gained by producing
1695 the cterm carefully, avoiding slow Thm.cterm_of.
1697 * Simplified interface for defining document antiquotations via
1698 ThyOutput.antiquotation, ThyOutput.output, and optionally
1699 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1700 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1703 * More systematic treatment of long names, abstract name bindings, and
1704 name space operations. Basic operations on qualified names have been
1705 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1706 Long_Name.append. Old type bstring has been mostly replaced by
1707 abstract type binding (see structure Binding), which supports precise
1708 qualification by packages and local theory targets, as well as proper
1709 tracking of source positions. INCOMPATIBILITY, need to wrap old
1710 bstring values into Binding.name, or better pass through abstract
1711 bindings everywhere. See further src/Pure/General/long_name.ML,
1712 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1714 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1715 LocalTheory.note etc.) now refer to the *full* internal name, not the
1716 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1718 * Disposed old type and term read functions (Sign.read_def_typ,
1719 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1720 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1721 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1722 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1723 resort for legacy applications.
1725 * Disposed old declarations, tactics, tactic combinators that refer to
1726 the simpset or claset of an implicit theory (such as Addsimps,
1727 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1728 embedded ML text, or local_simpset_of with a proper context passed as
1729 explicit runtime argument.
1731 * Rules and tactics that read instantiations (read_instantiate,
1732 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1733 context, which is required for parsing and type-checking. Moreover,
1734 the variables are specified as plain indexnames, not string encodings
1735 thereof. INCOMPATIBILITY.
1737 * Generic Toplevel.add_hook interface allows to analyze the result of
1738 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1739 for theorem dependency output of transactions resulting in a new
1742 * ML antiquotations: block-structured compilation context indicated by
1743 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1745 @{binding name} - basic name binding
1746 @{let ?pat = term} - term abbreviation (HO matching)
1747 @{note name = fact} - fact abbreviation
1748 @{thm fact} - singleton fact (with attributes)
1749 @{thms fact} - general fact (with attributes)
1750 @{lemma prop by method} - singleton goal
1751 @{lemma prop by meth1 meth2} - singleton goal
1752 @{lemma prop1 ... propN by method} - general goal
1753 @{lemma prop1 ... propN by meth1 meth2} - general goal
1754 @{lemma (open) ...} - open derivation
1759 * The Isabelle "emacs" tool provides a specific interface to invoke
1760 Proof General / Emacs, with more explicit failure if that is not
1761 installed (the old isabelle-interface script silently falls back on
1762 isabelle-process). The PROOFGENERAL_HOME setting determines the
1763 installation location of the Proof General distribution.
1765 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1766 the Isabelle process into a JVM/Scala application. See
1767 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1768 process wrapper has been discontinued.)
1770 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1772 * Various status messages (with exact source position information) are
1773 emitted, if proper markup print mode is enabled. This allows
1774 user-interface components to provide detailed feedback on internal
1779 New in Isabelle2008 (June 2008)
1780 -------------------------------
1784 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1785 and updated, with formally checked references as hyperlinks.
1787 * Theory loader: use_thy (and similar operations) no longer set the
1788 implicit ML context, which was occasionally hard to predict and in
1789 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1790 provides a proper context already.
1792 * Theory loader: old-style ML proof scripts being *attached* to a thy
1793 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1794 'use' within a theory file will do the job.
1796 * Name space merge now observes canonical order, i.e. the second space
1797 is inserted into the first one, while existing entries in the first
1798 space take precedence. INCOMPATIBILITY in rare situations, may try to
1799 swap theory imports.
1801 * Syntax: symbol \<chi> is now considered a letter. Potential
1802 INCOMPATIBILITY in identifier syntax etc.
1804 * Outer syntax: string tokens no longer admit escaped white space,
1805 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1806 white space without escapes.
1808 * Outer syntax: string tokens may contain arbitrary character codes
1809 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1815 * Context-dependent token translations. Default setup reverts locally
1816 fixed variables, and adds hilite markup for undeclared frees.
1818 * Unused theorems can be found using the new command 'unused_thms'.
1819 There are three ways of invoking it:
1822 Only finds unused theorems in the current theory.
1824 (2) unused_thms thy_1 ... thy_n -
1825 Finds unused theorems in the current theory and all of its ancestors,
1826 excluding the theories thy_1 ... thy_n and all of their ancestors.
1828 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1829 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1830 their ancestors, excluding the theories thy_1 ... thy_n and all of
1833 In order to increase the readability of the list produced by
1834 unused_thms, theorems that have been created by a particular instance
1835 of a theory command such as 'inductive' or 'function' are considered
1836 to belong to the same "group", meaning that if at least one theorem in
1837 this group is used, the other theorems in the same group are no longer
1838 reported as unused. Moreover, if all theorems in the group are
1839 unused, only one theorem in the group is displayed.
1841 Note that proof objects have to be switched on in order for
1842 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1843 usually the case when using Proof General with the default settings).
1845 * Authentic naming of facts disallows ad-hoc overwriting of previous
1846 theorems within the same name space. INCOMPATIBILITY, need to remove
1847 duplicate fact bindings, or even accidental fact duplications. Note
1848 that tools may maintain dynamically scoped facts systematically, using
1849 PureThy.add_thms_dynamic.
1851 * Command 'hide' now allows to hide from "fact" name space as well.
1853 * Eliminated destructive theorem database, simpset, claset, and
1854 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1855 update of theories within ML code.
1857 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1858 INCOMPATIBILITY, object-logics depending on former Pure require
1859 additional setup PureThy.old_appl_syntax_setup; object-logics
1860 depending on former CPure need to refer to Pure.
1862 * Commands 'use' and 'ML' are now purely functional, operating on
1863 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1864 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1867 * Command 'setup': discontinued implicit version with ML reference.
1869 * Instantiation target allows for simultaneous specification of class
1870 instance operations together with an instantiation proof.
1871 Type-checking phase allows to refer to class operations uniformly.
1872 See src/HOL/Complex/Complex.thy for an Isar example and
1873 src/HOL/Library/Eval.thy for an ML example.
1875 * Indexing of literal facts: be more serious about including only
1876 facts from the visible specification/proof context, but not the
1877 background context (locale etc.). Affects `prop` notation and method
1878 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1881 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1882 "(open)" option, which used to expose internal bound variables to the
1885 * Isar statements: removed obsolete case "rule_context".
1886 INCOMPATIBILITY, better use explicit fixes/assumes.
1888 * Locale proofs: default proof step now includes 'unfold_locales';
1889 hence 'proof' without argument may be used to unfold locale
1893 *** Document preparation ***
1895 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1896 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1897 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1898 spot); renamed link color from "darkblue" to "linkcolor" (default
1899 value unchanged, can be redefined via \definecolor); no longer sets
1900 "a4paper" option (unnecessary or even intrusive).
1902 * Antiquotation @{lemma A method} proves proposition A by the given
1903 method (either a method name or a method name plus (optional) method
1904 arguments in parentheses) and prints A just like @{prop A}.
1909 * New primrec package. Specification syntax conforms in style to
1910 definition/function/.... No separate induction rule is provided. The
1911 "primrec" command distinguishes old-style and new-style specifications
1912 by syntax. The former primrec package is now named OldPrimrecPackage.
1913 When adjusting theories, beware: constants stemming from new-style
1914 primrec specifications have authentic syntax.
1916 * Metis prover is now an order of magnitude faster, and also works
1917 with multithreading.
1919 * Metis: the maximum number of clauses that can be produced from a
1920 theorem is now given by the attribute max_clauses. Theorems that
1921 exceed this number are ignored, with a warning printed.
1923 * Sledgehammer no longer produces structured proofs by default. To
1924 enable, declare [[sledgehammer_full = true]]. Attributes
1925 reconstruction_modulus, reconstruction_sorts renamed
1926 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1928 * Method "induct_scheme" derives user-specified induction rules
1929 from well-founded induction and completeness of patterns. This factors
1930 out some operations that are done internally by the function package
1931 and makes them available separately. See
1932 src/HOL/ex/Induction_Scheme.thy for examples.
1934 * More flexible generation of measure functions for termination
1935 proofs: Measure functions can be declared by proving a rule of the
1936 form "is_measure f" and giving it the [measure_function] attribute.
1937 The "is_measure" predicate is logically meaningless (always true), and
1938 just guides the heuristic. To find suitable measure functions, the
1939 termination prover sets up the goal "is_measure ?f" of the appropriate
1940 type and generates all solutions by prolog-style backwards proof using
1943 This setup also deals with rules like
1945 "is_measure f ==> is_measure (list_size f)"
1947 which accommodates nested datatypes that recurse through lists.
1948 Similar rules are predeclared for products and option types.
1950 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1954 - Definitions of overloaded constants on sets have to be replaced by
1955 definitions on => and bool.
1957 - Some definitions of overloaded operators on sets can now be proved
1958 using the definitions of the operators on => and bool. Therefore,
1959 the following theorems have been renamed:
1961 subset_def -> subset_eq
1962 psubset_def -> psubset_eq
1963 set_diff_def -> set_diff_eq
1964 Compl_def -> Compl_eq
1965 Sup_set_def -> Sup_set_eq
1966 Inf_set_def -> Inf_set_eq
1967 sup_set_def -> sup_set_eq
1968 inf_set_def -> inf_set_eq
1970 - Due to the incompleteness of the HO unification algorithm, some
1971 rules such as subst may require manual instantiation, if some of
1972 the unknowns in the rule is a set.
1974 - Higher order unification and forward proofs:
1977 have "P (S::'a set)" <...>
1978 then have "EX S. P S" ..
1980 no longer works (due to the incompleteness of the HO unification
1981 algorithm) and must be replaced by the pattern
1988 - Calculational reasoning with subst (or similar rules):
1991 have "P (S::'a set)" <...>
1992 also have "S = T" <...>
1993 finally have "P T" .
1995 no longer works (for similar reasons as the previous example) and
1996 must be replaced by something like
1998 have "P (S::'a set)" <...>
1999 moreover have "S = T" <...>
2000 ultimately have "P T" by simp
2002 - Tactics or packages written in ML code:
2003 Code performing pattern matching on types via
2005 Type ("set", [T]) => ...
2007 must be rewritten. Moreover, functions like strip_type or
2008 binder_types no longer return the right value when applied to a
2011 T1 => ... => Tn => U => bool
2015 T1 => ... => Tn => U set
2017 * Merged theories Wellfounded_Recursion, Accessible_Part and
2018 Wellfounded_Relations to theory Wellfounded.
2020 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2022 * Class finite no longer treats UNIV as class parameter. Use class
2023 enum from theory Library/Enum instead to achieve a similar effect.
2026 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2027 and "Cons". INCOMPATIBILITY.
2029 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2030 Potential INCOMPATIBILITY.
2032 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2033 injective_fst_snd removed, use split_eta and prod_eqI instead.
2034 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2036 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2037 the same name in theory Orderings:
2047 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2048 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2049 and different variable names.
2051 * Library/Option_ord.thy: Canonical order on option type.
2053 * Library/RBT.thy: Red-black trees, an efficient implementation of
2056 * Library/Countable.thy: Type class for countable types.
2058 * Theory Int: The representation of numerals has changed. The infix
2059 operator BIT and the bit datatype with constructors B0 and B1 have
2060 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2061 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2062 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2065 * Theory Nat: definition of <= and < on natural numbers no longer
2066 depend on well-founded relations. INCOMPATIBILITY. Definitions
2067 le_def and less_def have disappeared. Consider lemmas not_less
2068 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2070 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2071 (whose purpose mainly is for various fold_set functionals) have been
2072 abandoned in favor of the existing algebraic classes
2073 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2074 lower_semilattice (resp. upper_semilattice) and linorder.
2077 * Theory Transitive_Closure: induct and cases rules now declare proper
2078 case_names ("base" and "step"). INCOMPATIBILITY.
2080 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2081 lattices. The form set-specific version is available as
2082 Inductive.lfp_ordinal_induct_set.
2084 * Renamed theorems "power.simps" to "power_int.simps".
2087 * Class semiring_div provides basic abstract properties of semirings
2088 with division and modulo operations. Subsumes former class dvd_mod.
2090 * Merged theories IntDef, Numeral and IntArith into unified theory
2091 Int. INCOMPATIBILITY.
2093 * Theory Library/Code_Index: type "index" now represents natural
2094 numbers rather than integers. INCOMPATIBILITY.
2096 * New class "uminus" with operation "uminus" (split of from class
2097 "minus" which now only has operation "minus", binary).
2100 * Constants "card", "internal_split", "option_map" now with authentic
2101 syntax. INCOMPATIBILITY.
2103 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2104 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2105 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2106 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2107 Sup_set_def, le_def, less_def, option_map_def now with object
2108 equality. INCOMPATIBILITY.
2110 * Records. Removed K_record, and replaced it by pure lambda term
2111 %x. c. The simplifier setup is now more robust against eta expansion.
2112 INCOMPATIBILITY: in cases explicitly referring to K_record.
2114 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2116 * Library/ListVector: new theory of arithmetic vector operations.
2118 * Library/Order_Relation: new theory of various orderings as sets of
2119 pairs. Defines preorders, partial orders, linear orders and
2120 well-orders on sets and on types.
2125 * Renamed some theories to allow to loading both ZF and HOL in the
2128 Datatype -> Datatype_ZF
2129 Inductive -> Inductive_ZF
2136 INCOMPATIBILITY: ZF theories that import individual theories below
2137 Main might need to be adapted. Regular theory Main is still
2138 available, as trivial extension of Main_ZF.
2143 * ML within Isar: antiquotation @{const name} or @{const
2144 name(typargs)} produces statically-checked Const term.
2146 * Functor NamedThmsFun: data is available to the user as dynamic fact
2147 (of the same name). Removed obsolete print command.
2149 * Removed obsolete "use_legacy_bindings" function.
2151 * The ``print mode'' is now a thread-local value derived from a global
2152 template (the former print_mode reference), thus access becomes
2153 non-critical. The global print_mode reference is for session
2154 management only; user-code should use print_mode_value,
2155 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2157 * Functions system/system_out provide a robust way to invoke external
2158 shell commands, with propagation of interrupts (requires Poly/ML
2159 5.2.1). Do not use OS.Process.system etc. from the basis library!
2164 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2165 in accordance with Proof General 3.7, which prefers GNU emacs.
2167 * isatool tty runs Isabelle process with plain tty interaction;
2168 optional line editor may be specified via ISABELLE_LINE_EDITOR
2169 setting, the default settings attempt to locate "ledit" and "rlwrap".
2171 * isatool browser now works with Cygwin as well, using general
2172 "javapath" function defined in Isabelle process environment.
2174 * YXML notation provides a simple and efficient alternative to
2175 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2176 isatool yxml as described in the Isabelle system manual.
2178 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2179 provides general wrapper for managing an Isabelle process in a robust
2180 fashion, with ``cooked'' output from stdin/stderr.
2182 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2183 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2185 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2186 way of changing the user's settings is via
2187 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2190 * Multithreading.max_threads := 0 refers to the number of actual CPU
2191 cores of the underlying machine, which is a good starting point for
2192 optimal performance tuning. The corresponding usedir option -M allows
2193 "max" as an alias for "0". WARNING: does not work on certain versions
2194 of Mac OS (with Poly/ML 5.1).
2196 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2197 adverse effect of Isabelle flooding interactive front-ends (notably
2198 ProofGeneral / XEmacs).
2202 New in Isabelle2007 (November 2007)
2203 -----------------------------------
2207 * More uniform information about legacy features, notably a
2208 warning/error of "Legacy feature: ...", depending on the state of the
2209 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2210 legacy features will disappear eventually.
2212 * Theory syntax: the header format ``theory A = B + C:'' has been
2213 discontinued in favour of ``theory A imports B C begin''. Use isatool
2214 fixheaders to convert existing theory files. INCOMPATIBILITY.
2216 * Theory syntax: the old non-Isar theory file format has been
2217 discontinued altogether. Note that ML proof scripts may still be used
2218 with Isar theories; migration is usually quite simple with the ML
2219 function use_legacy_bindings. INCOMPATIBILITY.
2221 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2222 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2225 * Theory loader: be more serious about observing the static theory
2226 header specifications (including optional directories), but not the
2227 accidental file locations of previously successful loads. The strict
2228 update policy of former update_thy is now already performed by
2229 use_thy, so the former has been removed; use_thys updates several
2230 theories simultaneously, just as 'imports' within a theory header
2231 specification, but without merging the results. Potential
2232 INCOMPATIBILITY: may need to refine theory headers and commands
2233 ROOT.ML which depend on load order.
2235 * Theory loader: optional support for content-based file
2236 identification, instead of the traditional scheme of full physical
2237 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2238 (cf. the system manual). The new scheme allows to work with
2239 non-finished theories in persistent session images, such that source
2240 files may be moved later on without requiring reloads.
2242 * Theory loader: old-style ML proof scripts being *attached* to a thy
2243 file (with the same base name as the theory) are considered a legacy
2244 feature, which will disappear eventually. Even now, the theory loader
2245 no longer maintains dependencies on such files.
2247 * Syntax: the scope for resolving ambiguities via type-inference is
2248 now limited to individual terms, instead of whole simultaneous
2249 specifications as before. This greatly reduces the complexity of the
2250 syntax module and improves flexibility by separating parsing and
2251 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2252 'fixes' etc.) are required in rare situations.
2254 * Syntax: constants introduced by new-style packages ('definition',
2255 'abbreviation' etc.) are passed through the syntax module in
2256 ``authentic mode''. This means that associated mixfix annotations
2257 really stick to such constants, independently of potential name space
2258 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2259 trees are represented slightly differently, may need to adapt syntax
2260 translations accordingly. Use CONST marker in 'translations' and
2261 @{const_syntax} antiquotation in 'parse_translation' etc.
2263 * Legacy goal package: reduced interface to the bare minimum required
2264 to keep existing proof scripts running. Most other user-level
2265 functions are now part of the OldGoals structure, which is *not* open
2266 by default (consider isatool expandshort before open OldGoals).
2267 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2268 these tend to cause confusion about the actual goal (!) context being
2269 used here, which is not necessarily the same as the_context().
2271 * Command 'find_theorems': supports "*" wild-card in "name:"
2272 criterion; "with_dups" option. Certain ProofGeneral versions might
2273 support a specific search form (see ProofGeneral/CHANGES).
2275 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2276 by default, which means that "prems" (and also "fixed variables") are
2277 suppressed from proof state output. Note that the ProofGeneral
2278 settings mechanism allows to change and save options persistently, but
2279 older versions of Isabelle will fail to start up if a negative prems
2282 * Local theory targets may be specified by non-nested blocks of
2283 ``context/locale/class ... begin'' followed by ``end''. The body may
2284 contain definitions, theorems etc., including any derived mechanism
2285 that has been implemented on top of these primitives. This concept
2286 generalizes the existing ``theorem (in ...)'' towards more versatility
2289 * Proof General interface: proper undo of final 'end' command;
2290 discontinued Isabelle/classic mode (ML proof scripts).
2293 *** Document preparation ***
2295 * Added antiquotation @{theory name} which prints the given name,
2296 after checking that it refers to a valid ancestor theory in the
2299 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2300 check the given source text as ML type/structure, printing verbatim.
2302 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2303 "c args == rhs" given in the current context. (Any number of
2304 arguments may be given on the LHS.)
2309 * The 'class' package offers a combination of axclass and locale to
2310 achieve Haskell-like type classes in Isabelle. Definitions and
2311 theorems within a class context produce both relative results (with
2312 implicit parameters according to the locale context), and polymorphic
2313 constants with qualified polymorphism (according to the class
2314 context). Within the body context of a 'class' target, a separate
2315 syntax layer ("user space type system") takes care of converting
2316 between global polymorphic consts and internal locale representation.
2317 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2318 "isatool doc classes" provides a tutorial.
2320 * Generic code generator framework allows to generate executable
2321 code for ML and Haskell (including Isabelle classes). A short usage
2324 internal compilation:
2325 export_code <list of constants (term syntax)> in SML
2326 writing SML code to a file:
2327 export_code <list of constants (term syntax)> in SML <filename>
2328 writing OCaml code to a file:
2329 export_code <list of constants (term syntax)> in OCaml <filename>
2330 writing Haskell code to a bunch of files:
2331 export_code <list of constants (term syntax)> in Haskell <filename>
2333 evaluating closed propositions to True/False using code generation:
2336 Reasonable default setup of framework in HOL.
2338 Theorem attributs for selecting and transforming function equations theorems:
2340 [code fun]: select a theorem as function equation for a specific constant
2341 [code fun del]: deselect a theorem as function equation for a specific constant
2342 [code inline]: select an equation theorem for unfolding (inlining) in place
2343 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2345 User-defined serializations (target in {SML, OCaml, Haskell}):
2347 code_const <and-list of constants (term syntax)>
2348 {(target) <and-list of const target syntax>}+
2350 code_type <and-list of type constructors>
2351 {(target) <and-list of type target syntax>}+
2353 code_instance <and-list of instances>
2355 where instance ::= <type constructor> :: <class>
2357 code_class <and_list of classes>
2358 {(target) <and-list of class target syntax>}+
2359 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2361 code_instance and code_class only are effective to target Haskell.
2363 For example usage see src/HOL/ex/Codegenerator.thy and
2364 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2365 generation from Isabelle/HOL theories is available via "isatool doc
2368 * Code generator: consts in 'consts_code' Isar commands are now
2369 referred to by usual term syntax (including optional type
2372 * Command 'no_translations' removes translation rules from theory
2375 * Overloaded definitions are now actually checked for acyclic
2376 dependencies. The overloading scheme is slightly more general than
2377 that of Haskell98, although Isabelle does not demand an exact
2378 correspondence to type class and instance declarations.
2379 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2380 exotic versions of overloading -- at the discretion of the user!
2382 Polymorphic constants are represented via type arguments, i.e. the
2383 instantiation that matches an instance against the most general
2384 declaration given in the signature. For example, with the declaration
2385 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2386 as c(nat). Overloading is essentially simultaneous structural
2387 recursion over such type arguments. Incomplete specification patterns
2388 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2389 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2390 Command 'print_theory' outputs the normalized system of recursive
2391 equations, see section "definitions".
2393 * Configuration options are maintained within the theory or proof
2394 context (with name and type bool/int/string), providing a very simple
2395 interface to a poor-man's version of general context data. Tools may
2396 declare options in ML (e.g. using Attrib.config_int) and then refer to
2397 these values using Config.get etc. Users may change options via an
2398 associated attribute of the same name. This form of context
2399 declaration works particularly well with commands 'declare' or
2400 'using', for example ``declare [[foo = 42]]''. Thus it has become
2401 very easy to avoid global references, which would not observe Isar
2402 toplevel undo/redo and fail to work with multithreading.
2404 Various global ML references of Pure and HOL have been turned into
2405 configuration options:
2407 Unify.search_bound unify_search_bound
2408 Unify.trace_bound unify_trace_bound
2409 Unify.trace_simp unify_trace_simp
2410 Unify.trace_types unify_trace_types
2411 Simplifier.simp_depth_limit simp_depth_limit
2412 Blast.depth_limit blast_depth_limit
2413 DatatypeProp.dtK datatype_distinctness_limit
2414 fast_arith_neq_limit fast_arith_neq_limit
2415 fast_arith_split_limit fast_arith_split_limit
2417 * Named collections of theorems may be easily installed as context
2418 data using the functor NamedThmsFun (see also
2419 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2420 attributes; there is also a toplevel print command. This facility is
2421 just a common case of general context data, which is the preferred way
2422 for anything more complex than just a list of facts in canonical
2425 * Isar: command 'declaration' augments a local theory by generic
2426 declaration functions written in ML. This enables arbitrary content
2427 being added to the context, depending on a morphism that tells the
2428 difference of the original declaration context wrt. the application
2429 context encountered later on.
2431 * Isar: proper interfaces for simplification procedures. Command
2432 'simproc_setup' declares named simprocs (with match patterns, and body
2433 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2434 context. ML antiquotation @{simproc name} retrieves named simprocs.
2436 * Isar: an extra pair of brackets around attribute declarations
2437 abbreviates a theorem reference involving an internal dummy fact,
2438 which will be ignored later --- only the effect of the attribute on
2439 the background context will persist. This form of in-place
2440 declarations is particularly useful with commands like 'declare' and
2441 'using', for example ``have A using [[simproc a]] by simp''.
2443 * Isar: method "assumption" (and implicit closing of subproofs) now
2444 takes simple non-atomic goal assumptions into account: after applying
2445 an assumption as a rule the resulting subgoals are solved by atomic
2446 assumption steps. This is particularly useful to finish 'obtain'
2447 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2448 without referring to the original premise "!!x. P x ==> thesis" in the
2449 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2452 * Isar: implicit use of prems from the Isar proof context is
2453 considered a legacy feature. Common applications like ``have A .''
2454 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2455 referencing facts explicitly here improves readability and
2456 maintainability of proof texts.
2458 * Isar: improper proof element 'guess' is like 'obtain', but derives
2459 the obtained context from the course of reasoning! For example:
2461 assume "EX x y. A x & B y" -- "any previous fact"
2462 then guess x and y by clarify
2464 This technique is potentially adventurous, depending on the facts and
2465 proof tools being involved here.
2467 * Isar: known facts from the proof context may be specified as literal
2468 propositions, using ASCII back-quote syntax. This works wherever
2469 named facts used to be allowed so far, in proof commands, proof
2470 methods, attributes etc. Literal facts are retrieved from the context
2471 according to unification of type and term parameters. For example,
2472 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2473 theorems in the current context, then these are valid literal facts:
2474 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2476 There is also a proof method "fact" which does the same composition
2477 for explicit goal states, e.g. the following proof texts coincide with
2478 certain special cases of literal facts:
2480 have "A" by fact == note `A`
2481 have "A ==> B" by fact == note `A ==> B`
2482 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2483 have "P a ==> Q a" by fact == note `P a ==> Q a`
2485 * Isar: ":" (colon) is no longer a symbolic identifier character in
2486 outer syntax. Thus symbolic identifiers may be used without
2487 additional white space in declarations like this: ``assume *: A''.
2489 * Isar: 'print_facts' prints all local facts of the current context,
2490 both named and unnamed ones.
2492 * Isar: 'def' now admits simultaneous definitions, e.g.:
2494 def x == "t" and y == "u"
2496 * Isar: added command 'unfolding', which is structurally similar to
2497 'using', but affects both the goal state and facts by unfolding given
2498 rewrite rules. Thus many occurrences of the 'unfold' method or
2499 'unfolded' attribute may be replaced by first-class proof text.
2501 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2502 and command 'unfolding' now all support object-level equalities
2503 (potentially conditional). The underlying notion of rewrite rule is
2504 analogous to the 'rule_format' attribute, but *not* that of the
2505 Simplifier (which is usually more generous).
2507 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2508 premises of a theorem by n. Useful in conjunction with drule.
2510 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2511 method expression within a sandbox consisting of the first N
2512 sub-goals, which need to exist. For example, ``simp_all [3]''
2513 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2514 simplifies all new goals that emerge from applying rule foo to the
2515 originally first one.
2517 * Isar: schematic goals are no longer restricted to higher-order
2518 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2521 * Isar: the conclusion of a long theorem statement is now either
2522 'shows' (a simultaneous conjunction, as before), or 'obtains'
2523 (essentially a disjunction of cases with local parameters and
2524 assumptions). The latter allows to express general elimination rules
2525 adequately; in this notation common elimination rules look like this:
2527 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2529 obtains x where "P x"
2531 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2535 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2541 The subsequent classical rules even refer to the formal "thesis"
2544 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2547 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2548 obtains "thesis ==> something"
2550 The actual proof of an 'obtains' statement is analogous to that of the
2551 Isar proof element 'obtain', only that there may be several cases.
2552 Optional case names may be specified in parentheses; these will be
2553 available both in the present proof and as annotations in the
2554 resulting rule, for later use with the 'cases' method (cf. attribute
2557 * Isar: the assumptions of a long theorem statement are available as
2558 "assms" fact in the proof context. This is more appropriate than the
2559 (historical) "prems", which refers to all assumptions of the current
2560 context, including those from the target locale, proof body etc.
2562 * Isar: 'print_statement' prints theorems from the current theory or
2563 proof context in long statement form, according to the syntax of a
2566 * Isar: 'obtain' takes an optional case name for the local context
2567 introduction rule (default "that").
2569 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2570 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2573 * Pure: syntax "CONST name" produces a fully internalized constant
2574 according to the current context. This is particularly useful for
2575 syntax translations that should refer to internal constant
2576 representations independently of name spaces.
2578 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2579 instead of "FOO ". This allows multiple binder declarations to coexist
2580 in the same context. INCOMPATIBILITY.
2582 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2583 primitive that also works in a locale context (both for constants and
2584 fixed variables). Type declaration and internal syntactic representation
2585 of given constants retrieved from the context. Likewise, the
2586 'no_notation' command allows to remove given syntax annotations from the
2589 * Isar/locales: new derived specification elements 'axiomatization',
2590 'definition', 'abbreviation', which support type-inference, admit
2591 object-level specifications (equality, equivalence). See also the
2592 isar-ref manual. Examples:
2595 eq (infix "===" 50) where
2596 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2598 definition "f x y = x + y + 1"
2599 definition g where "g x = f x x"
2602 neq (infix "=!=" 50) where
2603 "x =!= y == ~ (x === y)"
2605 These specifications may be also used in a locale context. Then the
2606 constants being introduced depend on certain fixed parameters, and the
2607 constant name is qualified by the locale base name. An internal
2608 abbreviation takes care for convenient input and output, making the
2609 parameters implicit and using the original short name. See also
2610 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2611 entities from a monomorphic theory.
2613 Presently, abbreviations are only available 'in' a target locale, but
2614 not inherited by general import expressions. Also note that
2615 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2616 'translations' in common applications. The "no_abbrevs" print mode
2617 prevents folding of abbreviations in term output.
2619 Concrete syntax is attached to specified constants in internal form,
2620 independently of name spaces. The parse tree representation is
2621 slightly different -- use 'notation' instead of raw 'syntax', and
2622 'translations' with explicit "CONST" markup to accommodate this.
2624 * Pure/Isar: unified syntax for new-style specification mechanisms
2625 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2626 full type inference and dummy patterns ("_"). For example:
2628 definition "K x _ = x"
2630 inductive conj for A B
2631 where "A ==> B ==> conj A B"
2633 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2634 the current context. Print mode "no_abbrevs" prevents inversion of
2635 abbreviations on output.
2637 * Isar/locales: improved parameter handling: use of locales "var" and
2638 "struct" no longer necessary; - parameter renamings are no longer
2639 required to be injective. For example, this allows to define
2640 endomorphisms as locale endom = homom mult mult h.
2642 * Isar/locales: changed the way locales with predicates are defined.
2643 Instead of accumulating the specification, the imported expression is
2644 now an interpretation. INCOMPATIBILITY: different normal form of
2645 locale expressions. In particular, in interpretations of locales with
2646 predicates, goals repesenting already interpreted fragments are not
2647 removed automatically. Use methods `intro_locales' and
2648 `unfold_locales'; see below.
2650 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2651 provide backward reasoning on locales predicates. The methods are
2652 aware of interpretations and discharge corresponding goals.
2653 `intro_locales' is less aggressive then `unfold_locales' and does not
2654 unfold predicates to assumptions.
2656 * Isar/locales: the order in which locale fragments are accumulated
2657 has changed. This enables to override declarations from fragments due
2658 to interpretations -- for example, unwanted simp rules.
2660 * Isar/locales: interpretation in theories and proof contexts has been
2661 extended. One may now specify (and prove) equations, which are
2662 unfolded in interpreted theorems. This is useful for replacing
2663 defined concepts (constants depending on locale parameters) by
2664 concepts already existing in the target context. Example:
2666 interpretation partial_order ["op <= :: [int, int] => bool"]
2667 where "partial_order.less (op <=) (x::int) y = (x < y)"
2669 Typically, the constant `partial_order.less' is created by a
2670 definition specification element in the context of locale
2673 * Method "induct": improved internal context management to support
2674 local fixes and defines on-the-fly. Thus explicit meta-level
2675 connectives !! and ==> are rarely required anymore in inductive goals
2676 (using object-logic connectives for this purpose has been long
2677 obsolete anyway). Common proof patterns are explained in
2678 src/HOL/Induct/Common_Patterns.thy, see also
2679 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2682 * Method "induct": improved handling of simultaneous goals. Instead of
2683 introducing object-level conjunction, the statement is now split into
2684 several conclusions, while the corresponding symbolic cases are nested
2685 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2686 see src/HOL/Induct/Common_Patterns.thy, for example.
2688 * Method "induct": mutual induction rules are now specified as a list
2689 of rule sharing the same induction cases. HOL packages usually provide
2690 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2691 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2692 mutual induction rules differently, i.e. like this:
2694 (induct rule: foo_bar.inducts)
2695 (induct set: foo bar)
2696 (induct pred: foo bar)
2697 (induct type: foo bar)
2699 The ML function ProjectRule.projections turns old-style rules into the
2702 * Method "coinduct": dual of induction, see
2703 src/HOL/Library/Coinductive_List.thy for various examples.
2705 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2706 considered a legacy feature.
2708 * Attribute "symmetric" produces result with standardized schematic
2709 variables (index 0). Potential INCOMPATIBILITY.
2711 * Simplifier: by default the simplifier trace only shows top level
2712 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2713 default. Thus there is less danger of being flooded by the trace. The
2714 trace indicates where parts have been suppressed.
2716 * Provers/classical: removed obsolete classical version of elim_format
2717 attribute; classical elim/dest rules are now treated uniformly when
2718 manipulating the claset.
2720 * Provers/classical: stricter checks to ensure that supplied intro,
2721 dest and elim rules are well-formed; dest and elim rules must have at
2724 * Provers/classical: attributes dest/elim/intro take an optional
2725 weight argument for the rule (just as the Pure versions). Weights are
2726 ignored by automated tools, but determine the search order of single
2729 * Syntax: input syntax now supports dummy variable binding "%_. b",
2730 where the body does not mention the bound variable. Note that dummy
2731 patterns implicitly depend on their context of bounds, which makes
2732 "{_. _}" match any set comprehension as expected. Potential
2733 INCOMPATIBILITY -- parse translations need to cope with syntactic
2734 constant "_idtdummy" in the binding position.
2736 * Syntax: removed obsolete syntactic constant "_K" and its associated
2737 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2738 for example "A -> B" => "Pi A (%_. B)".
2740 * Pure: 'class_deps' command visualizes the subclass relation, using
2741 the graph browser tool.
2743 * Pure: 'print_theory' now suppresses certain internal declarations by
2744 default; use '!' option for full details.
2749 * Method "metis" proves goals by applying the Metis general-purpose
2750 resolution prover (see also http://gilith.com/software/metis/).
2751 Examples are in the directory MetisExamples. WARNING: the
2752 Isabelle/HOL-Metis integration does not yet work properly with
2755 * Command 'sledgehammer' invokes external automatic theorem provers as
2756 background processes. It generates calls to the "metis" method if
2757 successful. These can be pasted into the proof. Users do not have to
2758 wait for the automatic provers to return. WARNING: does not really
2759 work with multi-threading.
2761 * New "auto_quickcheck" feature tests outermost goal statements for
2762 potential counter-examples. Controlled by ML references
2763 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2764 5000 milliseconds). Fails silently if statements is outside of
2765 executable fragment, or any other codgenerator problem occurs.
2767 * New constant "undefined" with axiom "undefined x = undefined".
2769 * Added class "HOL.eq", allowing for code generation with polymorphic
2772 * Some renaming of class constants due to canonical name prefixing in
2773 the new 'class' package:
2775 HOL.abs ~> HOL.abs_class.abs
2776 HOL.divide ~> HOL.divide_class.divide
2777 0 ~> HOL.zero_class.zero
2778 1 ~> HOL.one_class.one
2779 op + ~> HOL.plus_class.plus
2780 op - ~> HOL.minus_class.minus
2781 uminus ~> HOL.minus_class.uminus
2782 op * ~> HOL.times_class.times
2783 op < ~> HOL.ord_class.less
2784 op <= > HOL.ord_class.less_eq
2785 Nat.power ~> Power.power_class.power
2786 Nat.size ~> Nat.size_class.size
2787 Numeral.number_of ~> Numeral.number_class.number_of
2788 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2789 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2790 Orderings.min ~> Orderings.ord_class.min
2791 Orderings.max ~> Orderings.ord_class.max
2792 Divides.op div ~> Divides.div_class.div
2793 Divides.op mod ~> Divides.div_class.mod
2794 Divides.op dvd ~> Divides.div_class.dvd
2796 INCOMPATIBILITY. Adaptions may be required in the following cases:
2798 a) User-defined constants using any of the names "plus", "minus",
2799 "times", "less" or "less_eq". The standard syntax translations for
2800 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2803 b) Variables named "plus", "minus", "times", "less", "less_eq"
2804 INCOMPATIBILITY: use more specific names.
2806 c) Permutative equations (e.g. "a + b = b + a")
2807 Since the change of names also changes the order of terms, permutative
2808 rewrite rules may get applied in a different order. Experience shows
2809 that this is rarely the case (only two adaptions in the whole Isabelle
2810 distribution). INCOMPATIBILITY: rewrite proofs
2812 d) ML code directly refering to constant names
2813 This in general only affects hand-written proof tactics, simprocs and
2814 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2815 Consider using @{const_name} antiquotation.
2817 * New class "default" with associated constant "default".
2819 * Function "sgn" is now overloaded and available on int, real, complex
2820 (and other numeric types), using class "sgn". Two possible defs of
2821 sgn are given as equational assumptions in the classes sgn_if and
2822 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2825 * Locale "partial_order" now unified with class "order" (cf. theory
2826 Orderings), added parameter "less". INCOMPATIBILITY.
2828 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2829 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2830 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2832 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2833 changed order of proof goals in instance proofs.
2835 * The transitivity reasoner for partial and linear orders is set up
2836 for classes "order" and "linorder". Instances of the reasoner are available
2837 in all contexts importing or interpreting the corresponding locales.
2838 Method "order" invokes the reasoner separately; the reasoner
2839 is also integrated with the Simplifier as a solver. Diagnostic
2840 command 'print_orders' shows the available instances of the reasoner
2841 in the current context.
2843 * Localized monotonicity predicate in theory "Orderings"; integrated
2844 lemmas max_of_mono and min_of_mono with this predicate.
2847 * Formulation of theorem "dense" changed slightly due to integration
2848 with new class dense_linear_order.
2850 * Uniform lattice theory development in HOL.
2852 constants "meet" and "join" now named "inf" and "sup"
2853 constant "Meet" now named "Inf"
2855 classes "meet_semilorder" and "join_semilorder" now named
2856 "lower_semilattice" and "upper_semilattice"
2857 class "lorder" now named "lattice"
2858 class "comp_lat" now named "complete_lattice"
2860 Instantiation of lattice classes allows explicit definitions
2861 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2863 INCOMPATIBILITY. Theorem renames:
2865 meet_left_le ~> inf_le1
2866 meet_right_le ~> inf_le2
2867 join_left_le ~> sup_ge1
2868 join_right_le ~> sup_ge2
2869 meet_join_le ~> inf_sup_ord
2872 le_meet ~> le_inf_iff
2873 le_join ~> ge_sup_conv
2874 meet_idempotent ~> inf_idem
2875 join_idempotent ~> sup_idem
2876 meet_comm ~> inf_commute
2877 join_comm ~> sup_commute
2878 meet_leI1 ~> le_infI1
2879 meet_leI2 ~> le_infI2
2880 le_joinI1 ~> le_supI1
2881 le_joinI2 ~> le_supI2
2882 meet_assoc ~> inf_assoc
2883 join_assoc ~> sup_assoc
2884 meet_left_comm ~> inf_left_commute
2885 meet_left_idempotent ~> inf_left_idem
2886 join_left_comm ~> sup_left_commute
2887 join_left_idempotent ~> sup_left_idem
2890 le_def_meet ~> le_iff_inf
2891 le_def_join ~> le_iff_sup
2892 join_absorp2 ~> sup_absorb2
2893 join_absorp1 ~> sup_absorb1
2894 meet_absorp1 ~> inf_absorb1
2895 meet_absorp2 ~> inf_absorb2
2896 meet_join_absorp ~> inf_sup_absorb
2897 join_meet_absorp ~> sup_inf_absorb
2898 distrib_join_le ~> distrib_sup_le
2899 distrib_meet_le ~> distrib_inf_le
2901 add_meet_distrib_left ~> add_inf_distrib_left
2902 add_join_distrib_left ~> add_sup_distrib_left
2903 is_join_neg_meet ~> is_join_neg_inf
2904 is_meet_neg_join ~> is_meet_neg_sup
2905 add_meet_distrib_right ~> add_inf_distrib_right
2906 add_join_distrib_right ~> add_sup_distrib_right
2907 add_meet_join_distribs ~> add_sup_inf_distribs
2908 join_eq_neg_meet ~> sup_eq_neg_inf
2909 meet_eq_neg_join ~> inf_eq_neg_sup
2910 add_eq_meet_join ~> add_eq_inf_sup
2911 meet_0_imp_0 ~> inf_0_imp_0
2912 join_0_imp_0 ~> sup_0_imp_0
2913 meet_0_eq_0 ~> inf_0_eq_0
2914 join_0_eq_0 ~> sup_0_eq_0
2915 neg_meet_eq_join ~> neg_inf_eq_sup
2916 neg_join_eq_meet ~> neg_sup_eq_inf
2917 join_eq_if ~> sup_eq_if
2919 mono_meet ~> mono_inf
2920 mono_join ~> mono_sup
2921 meet_bool_eq ~> inf_bool_eq
2922 join_bool_eq ~> sup_bool_eq
2923 meet_fun_eq ~> inf_fun_eq
2924 join_fun_eq ~> sup_fun_eq
2925 meet_set_eq ~> inf_set_eq
2926 join_set_eq ~> sup_set_eq
2927 meet1_iff ~> inf1_iff
2928 meet2_iff ~> inf2_iff
2937 join1_iff ~> sup1_iff
2938 join2_iff ~> sup2_iff
2948 is_meet_Meet ~> is_meet_Inf
2949 Meet_bool_def ~> Inf_bool_def
2950 Meet_fun_def ~> Inf_fun_def
2951 Meet_greatest ~> Inf_greatest
2952 Meet_lower ~> Inf_lower
2953 Meet_set_def ~> Inf_set_def
2956 Sup_bool_eq ~> Sup_bool_def
2957 Sup_fun_eq ~> Sup_fun_def
2958 Sup_set_eq ~> Sup_set_def
2960 listsp_meetI ~> listsp_infI
2961 listsp_meet_eq ~> listsp_inf_eq
2966 * Added syntactic class "size"; overloaded constant "size" now has
2967 type "'a::size ==> bool"
2969 * Internal reorganisation of `size' of datatypes: size theorems
2970 "foo.size" are no longer subsumed by "foo.simps" (but are still
2971 simplification rules by default!); theorems "prod.size" now named
2974 * Class "div" now inherits from class "times" rather than "type".
2977 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2978 Linorder etc. have disappeared; operations defined in terms of
2979 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2981 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2983 * HOL-Word: New extensive library and type for generic, fixed size
2984 machine words, with arithemtic, bit-wise, shifting and rotating
2985 operations, reflection into int, nat, and bool lists, automation for
2986 linear arithmetic (by automatic reflection into nat or int), including
2987 lemmas on overflow and monotonicity. Instantiated to all appropriate
2988 arithmetic type classes, supporting automatic simplification of
2989 numerals on all operations.
2991 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2993 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2995 * Code generator library theories:
2996 - Code_Integer represents HOL integers by big integer literals in target
2998 - Code_Char represents HOL characters by character literals in target
3000 - Code_Char_chr like Code_Char, but also offers treatment of character
3001 codes; includes Code_Integer.
3002 - Executable_Set allows to generate code for finite sets using lists.
3003 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3005 - Executable_Real implements a subset of real numbers, namly those
3006 representable by rational numbers.
3007 - Efficient_Nat implements natural numbers by integers, which in general will
3008 result in higher efficency; pattern matching with 0/Suc is eliminated;
3009 includes Code_Integer.
3010 - Code_Index provides an additional datatype index which is mapped to
3011 target-language built-in integers.
3012 - Code_Message provides an additional datatype message_string which is isomorphic to
3013 strings; messages are mapped to target-language strings.
3015 * New package for inductive predicates
3017 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3020 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3021 for z_1 :: U_1 and ... and z_n :: U_m
3023 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3026 with full support for type-inference, rather than
3028 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3030 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3031 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3033 inductive "s z_1 ... z_m"
3035 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3038 For backward compatibility, there is a wrapper allowing inductive
3039 sets to be defined with the new package via
3042 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3043 for z_1 :: U_1 and ... and z_n :: U_m
3045 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3051 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3052 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3053 for z_1 :: U_1 and ... and z_n :: U_m
3055 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3056 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3059 if the additional syntax "p ..." is required.
3061 Numerous examples can be found in the subdirectories src/HOL/Auth,
3062 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3066 - Since declaration and definition of inductive sets or predicates
3067 is no longer separated, abbreviations involving the newly
3068 introduced sets or predicates must be specified together with the
3069 introduction rules after the 'where' keyword (see above), rather
3070 than before the actual inductive definition.
3072 - The variables in induction and elimination rules are now
3073 quantified in the order of their occurrence in the introduction
3074 rules, rather than in alphabetical order. Since this may break
3075 some proofs, these proofs either have to be repaired, e.g. by
3076 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3077 statements of the form
3079 case (rule_i a_i_1 ... a_i_{k_i})
3081 or the old order of quantification has to be restored by explicitly adding
3082 meta-level quantifiers in the introduction rules, i.e.
3084 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3086 - The format of the elimination rules is now
3088 p z_1 ... z_m x_1 ... x_n ==>
3089 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3094 (x_1, ..., x_n) : s z_1 ... z_m ==>
3095 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3098 for sets rather than
3100 x : s z_1 ... z_m ==>
3101 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3104 This may require terms in goals to be expanded to n-tuples
3105 (e.g. using case_tac or simplification with the split_paired_all
3106 rule) before the above elimination rule is applicable.
3108 - The elimination or case analysis rules for (mutually) inductive
3109 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3110 list of rules "p_1_..._p_k.elims" is no longer available.
3112 * New package "function"/"fun" for general recursive functions,
3113 supporting mutual and nested recursion, definitions in local contexts,
3114 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3115 for small examples, and the separate tutorial on the function
3116 package. The old recdef "package" is still available as before, but
3117 users are encouraged to use the new package.
3119 * Method "lexicographic_order" automatically synthesizes termination
3120 relations as lexicographic combinations of size measures.
3122 * Case-expressions allow arbitrary constructor-patterns (including
3123 "_") and take their order into account, like in functional
3124 programming. Internally, this is translated into nested
3125 case-expressions; missing cases are added and mapped to the predefined
3126 constant "undefined". In complicated cases printing may no longer show
3127 the original input but the internal form. Lambda-abstractions allow
3128 the same form of pattern matching: "% pat1 => e1 | ..." is an
3129 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3132 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3133 is an abbreviation for "of_nat :: nat => int". The simplification
3134 rules for "of_nat" have been changed to work like "int" did
3135 previously. Potential INCOMPATIBILITY:
3136 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3137 - of_nat_diff and of_nat_mult are no longer default simp rules
3139 * Method "algebra" solves polynomial equations over (semi)rings using
3140 Groebner bases. The (semi)ring structure is defined by locales and the
3141 tool setup depends on that generic context. Installing the method for
3142 a specific type involves instantiating the locale and possibly adding
3143 declarations for computation on the coefficients. The method is
3144 already instantiated for natural numbers and for the axiomatic class
3145 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3146 CALCULEMUS 2007 for the general principles underlying this
3147 architecture of context-aware proof-tools.
3149 * Method "ferrack" implements quantifier elimination over
3150 special-purpose dense linear orders using locales (analogous to
3151 "algebra"). The method is already installed for class
3152 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3155 * Former constant "List.op @" now named "List.append". Use ML
3156 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3157 circumvent possible incompatibilities when working on ML level.
3159 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3161 * New function listsum :: 'a list => 'a for arbitrary monoids.
3162 Special syntax: "SUM x <- xs. f x" (and latex variants)
3164 * New syntax for Haskell-like list comprehension (input only), eg.
3165 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3167 * The special syntax for function "filter" has changed from [x :
3168 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3169 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3171 * [a..b] is now defined for arbitrary linear orders. It used to be
3172 defined on nat only, as an abbreviation for [a..<Suc b]
3175 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3177 * New functions "sorted" and "sort" in src/HOL/List.thy.
3179 * New lemma collection field_simps (an extension of ring_simps) for
3180 manipulating (in)equations involving division. Multiplies with all
3181 denominators that can be proved to be non-zero (in equations) or
3182 positive/negative (in inequations).
3184 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3185 have been improved and renamed to ring_simps, group_simps and
3186 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3187 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3189 * Theory Library/Commutative_Ring: switched from recdef to function
3190 package; constants add, mul, pow now curried. Infix syntax for
3191 algebraic operations.
3193 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3196 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3199 * HOL/records: generalised field-update to take a function on the
3200 field rather than the new value: r(|A := x|) is translated to A_update
3201 (K x) r The K-combinator that is internally used is called K_record.
3202 INCOMPATIBILITY: Usage of the plain update functions has to be
3205 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3206 * x = 0, which are required for a semiring. Richer structures do not
3207 inherit from semiring_0 anymore, because this property is a theorem
3208 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3209 there is more to prove, but this is mostly trivial.
3211 * Class "recpower" is generalized to arbitrary monoids, not just
3212 commutative semirings. INCOMPATIBILITY: may need to incorporate
3213 commutativity or semiring properties additionally.
3215 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3216 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3217 better use 'abbreviation'.
3219 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3221 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3222 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3223 significant changes for setting up numeral syntax for types:
3224 - New constants Numeral.pred and Numeral.succ instead
3225 of former Numeral.bin_pred and Numeral.bin_succ.
3226 - Use integer operations instead of bin_add, bin_mult and so on.
3227 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3228 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3230 See src/HOL/Integ/IntArith.thy for an example setup.
3232 * Command 'normal_form' computes the normal form of a term that may
3233 contain free variables. For example ``normal_form "rev [a, b, c]"''
3234 produces ``[b, c, a]'' (without proof). This command is suitable for
3235 heavy-duty computations because the functions are compiled to ML
3236 first. Correspondingly, a method "normalization" is provided. See
3237 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3239 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3240 25 like -->); output depends on the "iff" print_mode, the default is
3241 "A = B" (with priority 50).
3243 * Relations less (<) and less_eq (<=) are also available on type bool.
3244 Modified syntax to disallow nesting without explicit parentheses,
3245 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3248 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3250 * Relation composition operator "op O" now has precedence 75 and binds
3251 stronger than union and intersection. INCOMPATIBILITY.
3253 * The old set interval syntax "{m..n(}" (and relatives) has been
3254 removed. Use "{m..<n}" (and relatives) instead.
3256 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3257 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3258 ``declare [[simproc del: neq]]''.
3260 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3263 * Theorem Cons_eq_map_conv no longer declared as "simp".
3265 * Theorem setsum_mult renamed to setsum_right_distrib.
3267 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3270 * Reimplemented methods "sat" and "satx", with several improvements:
3271 goals no longer need to be stated as "<prems> ==> False", equivalences
3272 (i.e. "=" on type bool) are handled, variable names of the form
3273 "lit_<n>" are no longer reserved, significant speedup.
3275 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3276 zChaff is still supported as well.
3278 * 'inductive' and 'datatype': provide projections of mutual rules,
3279 bundled as foo_bar.inducts;
3281 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3284 * Library: moved theory Accessible_Part to main HOL.
3286 * Library: added theory Coinductive_List of potentially infinite lists
3287 as greatest fixed-point.
3289 * Library: added theory AssocList which implements (finite) maps as
3292 * Method "evaluation" solves goals (i.e. a boolean expression)
3293 efficiently by compiling it to ML. The goal is "proved" (via an
3294 oracle) if it evaluates to True.
3296 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3297 also when invoked by the simplifier. This results in the Simplifier
3298 being more powerful on arithmetic goals. INCOMPATIBILITY.
3299 Configuration option fast_arith_split_limit=0 recovers the old
3302 * Support for hex (0x20) and binary (0b1001) numerals.
3304 * New method: reify eqs (t), where eqs are equations for an
3305 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3306 parameter, computes a term s::'b and a list xs::'a list and proves the
3307 theorem I xs s = t. This is also known as reification or quoting. The
3308 resulting theorem is applied to the subgoal to substitute t with I xs
3309 s. If t is omitted, the subgoal itself is reified.
3311 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3312 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3313 where f is supposed to be a computable function (in the sense of code
3314 generattion). The method uses reify to compute s and xs as above then
3315 applies corr_thm and uses normalization by evaluation to "prove" f s =
3316 r and finally gets the theorem t = r, which is again applied to the
3317 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3319 * Reflection: Automatic reification now handels binding, an example is
3320 available in src/HOL/ex/ReflectionEx.thy
3322 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3323 command 'statespace' that is similar to 'record', but introduces an
3324 abstract specification based on the locale infrastructure instead of
3325 HOL types. This leads to extra flexibility in composing state spaces,
3326 in particular multiple inheritance and renaming of components.
3331 * Hyperreal: Functions root and sqrt are now defined on negative real
3332 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3333 Nonnegativity side conditions have been removed from many lemmas, so
3334 that more subgoals may now be solved by simplification; potential
3337 * Real: new type classes formalize real normed vector spaces and
3338 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3339 and norm :: 'a => real.
3341 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3342 reals into other types. The overloaded constant Reals :: 'a set is now
3343 defined as range of_real; potential INCOMPATIBILITY.
3345 * Real: proper support for ML code generation, including 'quickcheck'.
3346 Reals are implemented as arbitrary precision rationals.
3348 * Hyperreal: Several constants that previously worked only for the
3349 reals have been generalized, so they now work over arbitrary vector
3350 spaces. Type annotations may need to be added in some cases; potential
3353 Infinitesimal :: ('a::real_normed_vector) star set
3354 HFinite :: ('a::real_normed_vector) star set
3355 HInfinite :: ('a::real_normed_vector) star set
3356 approx :: ('a::real_normed_vector) star => 'a star => bool
3357 monad :: ('a::real_normed_vector) star => 'a star set
3358 galaxy :: ('a::real_normed_vector) star => 'a star set
3359 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3360 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3361 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3362 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3363 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3364 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3365 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3366 sgn :: 'a::real_normed_vector => 'a
3367 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3369 * Complex: Some complex-specific constants are now abbreviations for
3370 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3371 hnorm. Other constants have been entirely removed in favor of the
3372 polymorphic versions (INCOMPATIBILITY):
3376 HInfinite <-- CInfinite
3377 Infinitesimal <-- CInfinitesimal
3380 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3381 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3382 (ns)deriv <-- (ns)cderiv
3387 * Formalisation of ideals and the quotient construction over rings.
3389 * Order and lattice theory no longer based on records.
3392 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3393 greatest_closed. INCOMPATIBILITY.
3395 * Method algebra is now set up via an attribute. For examples see
3396 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3397 of algebraic structures.
3399 * Renamed theory CRing to Ring.
3404 * Substantial, yet incomplete support for nominal datatypes (binding
3405 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3406 src/HOL/Nominal/Examples. Prospective users should consult
3407 http://isabelle.in.tum.de/nominal/
3412 * ML basics: just one true type int, which coincides with IntInf.int
3415 * ML within Isar: antiquotations allow to embed statically-checked
3416 formal entities in the source, referring to the context available at
3417 compile-time. For example:
3419 ML {* @{sort "{zero,one}"} *}
3420 ML {* @{typ "'a => 'b"} *}
3421 ML {* @{term "%x. x"} *}
3422 ML {* @{prop "x == y"} *}
3423 ML {* @{ctyp "'a => 'b"} *}
3424 ML {* @{cterm "%x. x"} *}
3425 ML {* @{cprop "x == y"} *}
3426 ML {* @{thm asm_rl} *}
3427 ML {* @{thms asm_rl} *}
3428 ML {* @{type_name c} *}
3429 ML {* @{type_syntax c} *}
3430 ML {* @{const_name c} *}
3431 ML {* @{const_syntax c} *}
3434 ML {* @{theory Pure} *}
3435 ML {* @{theory_ref} *}
3436 ML {* @{theory_ref Pure} *}
3439 ML {* @{clasimpset} *}
3441 The same works for sources being ``used'' within an Isar context.
3443 * ML in Isar: improved error reporting; extra verbosity with
3444 ML_Context.trace enabled.
3446 * Pure/General/table.ML: the join operations now works via exceptions
3447 DUP/SAME instead of type option. This is simpler in simple cases, and
3448 admits slightly more efficient complex applications.
3450 * Pure: 'advanced' translation functions (parse_translation etc.) now
3451 use Context.generic instead of just theory.
3453 * Pure: datatype Context.generic joins theory/Proof.context and
3454 provides some facilities for code that works in either kind of
3455 context, notably GenericDataFun for uniform theory and proof data.
3457 * Pure: simplified internal attribute type, which is now always
3458 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3459 local (Proof.context) attributes have been discontinued, while
3460 minimizing code duplication. Thm.rule_attribute and
3461 Thm.declaration_attribute build canonical attributes; see also structure
3462 Context for further operations on Context.generic, notably
3463 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3464 declarations and definitions.
3466 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3467 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3468 init only required for impure data. INCOMPATIBILITY: empty really need
3469 to be empty (no dependencies on theory content!)
3471 * Pure/kernel: consts certification ignores sort constraints given in
3472 signature declarations. (This information is not relevant to the
3473 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3474 potential INCOMPATIBILITY.
3476 * Pure: axiomatic type classes are now purely definitional, with
3477 explicit proofs of class axioms and super class relations performed
3478 internally. See Pure/axclass.ML for the main internal interfaces --
3479 notably AxClass.define_class supercedes AxClass.add_axclass, and
3480 AxClass.axiomatize_class/classrel/arity supersede
3481 Sign.add_classes/classrel/arities.
3483 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3484 global/local versions on theory vs. Proof.context have been
3485 discontinued; Attrib.syntax and Method.syntax have been adapted
3486 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3487 attributes, methods, etc.
3489 * Pure: several functions of signature "... -> theory -> theory * ..."
3490 have been reoriented to "... -> theory -> ... * theory" in order to
3491 allow natural usage in combination with the ||>, ||>>, |-> and
3492 fold_map combinators.
3494 * Pure: official theorem names (closed derivations) and additional
3495 comments (tags) are now strictly separate. Name hints -- which are
3496 maintained as tags -- may be attached any time without affecting the
3499 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3500 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3501 achieve the old behaviour.
3503 * Pure: the "Goal" constant is now called "prop", supporting a
3504 slightly more general idea of ``protecting'' meta-level rule
3507 * Pure: Logic.(un)varify only works in a global context, which is now
3508 enforced instead of silently assumed. INCOMPATIBILITY, may use
3509 Logic.legacy_(un)varify as temporary workaround.
3511 * Pure: structure Name provides scalable operations for generating
3512 internal variable names, notably Name.variants etc. This replaces
3513 some popular functions from term.ML:
3515 Term.variant -> Name.variant
3516 Term.variantlist -> Name.variant_list
3517 Term.invent_names -> Name.invent_list
3519 Note that low-level renaming rarely occurs in new code -- operations
3520 from structure Variable are used instead (see below).
3522 * Pure: structure Variable provides fundamental operations for proper
3523 treatment of fixed/schematic variables in a context. For example,
3524 Variable.import introduces fixes for schematics of given facts and
3525 Variable.export reverses the effect (up to renaming) -- this replaces
3526 various freeze_thaw operations.
3528 * Pure: structure Goal provides simple interfaces for
3529 init/conclude/finish and tactical prove operations (replacing former
3530 Tactic.prove). Goal.prove is the canonical way to prove results
3531 within a given context; Goal.prove_global is a degraded version for
3532 theory level goals, including a global Drule.standard. Note that
3533 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3534 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3535 in a locale context).
3537 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3538 and type checking (Syntax.check_term etc.), with common combinations
3539 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3540 which are considered legacy and await removal.
3542 * Pure/Syntax: generic interfaces for type unchecking
3543 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3544 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3545 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3546 available for convenience, but refer to the very same operations using
3547 a mere theory instead of a full context.
3549 * Isar: simplified treatment of user-level errors, using exception
3550 ERROR of string uniformly. Function error now merely raises ERROR,
3551 without any side effect on output channels. The Isar toplevel takes
3552 care of proper display of ERROR exceptions. ML code may use plain
3553 handle/can/try; cat_error may be used to concatenate errors like this:
3555 ... handle ERROR msg => cat_error msg "..."
3557 Toplevel ML code (run directly or through the Isar toplevel) may be
3558 embedded into the Isar toplevel with exception display/debug like
3561 Isar.toplevel (fn () => ...)
3563 INCOMPATIBILITY, removed special transform_error facilities, removed
3564 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3565 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3566 -- use plain ERROR instead.
3568 * Isar: theory setup now has type (theory -> theory), instead of a
3569 list. INCOMPATIBILITY, may use #> to compose setup functions.
3571 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3572 ProofContext.debug/verbose flags.
3574 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3575 theory before entering a proof state. Transactions now always see a
3576 quasi-functional intermediate checkpoint, both in interactive and
3579 * Isar: simplified interfaces for outer syntax. Renamed
3580 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3581 OuterSyntax.add_parsers -- this functionality is now included in
3582 OuterSyntax.command etc. INCOMPATIBILITY.
3584 * Simplifier: the simpset of a running simplification process now
3585 contains a proof context (cf. Simplifier.the_context), which is the
3586 very context that the initial simpset has been retrieved from (by
3587 simpset_of/local_simpset_of). Consequently, all plug-in components
3588 (solver, looper etc.) may depend on arbitrary proof data.
3590 * Simplifier.inherit_context inherits the proof context (plus the
3591 local bounds) of the current simplification process; any simproc
3592 etc. that calls the Simplifier recursively should do this! Removed
3593 former Simplifier.inherit_bounds, which is already included here --
3594 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3595 specify an explicit context using Simplifier.context/theory_context.
3597 * Simplifier/Classical Reasoner: more abstract interfaces
3598 change_simpset/claset for modifying the simpset/claset reference of a
3599 theory; raw versions simpset/claset_ref etc. have been discontinued --
3602 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3608 * settings: the default heap location within ISABELLE_HOME_USER now
3609 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3610 Isabelle installations.
3612 * isabelle-process: option -S (secure mode) disables some critical
3613 operations, notably runtime compilation and evaluation of ML source
3616 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3618 * Support for parallel execution, using native multicore support of
3619 Poly/ML 5.1. The theory loader exploits parallelism when processing
3620 independent theories, according to the given theory header
3621 specifications. The maximum number of worker threads is specified via
3622 usedir option -M or the "max-threads" setting in Proof General. A
3623 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3624 to 6 on a 8-core machine. User-code needs to observe certain
3625 guidelines for thread-safe programming, see appendix A in the Isar
3626 Implementation manual.
3630 New in Isabelle2005 (October 2005)
3631 ----------------------------------
3635 * Theory headers: the new header syntax for Isar theories is
3638 imports <theory1> ... <theoryN>
3639 uses <file1> ... <fileM>
3642 where the 'uses' part is optional. The previous syntax
3644 theory <name> = <theory1> + ... + <theoryN>:
3646 will disappear in the next release. Use isatool fixheaders to convert
3647 existing theory files. Note that there is no change in ancient
3648 non-Isar theories now, but these will disappear soon.
3650 * Theory loader: parent theories can now also be referred to via
3651 relative and absolute paths.
3653 * Command 'find_theorems' searches for a list of criteria instead of a
3654 list of constants. Known criteria are: intro, elim, dest, name:string,
3655 simp:term, and any term. Criteria can be preceded by '-' to select
3656 theorems that do not match. Intro, elim, dest select theorems that
3657 match the current goal, name:s selects theorems whose fully qualified
3658 name contain s, and simp:term selects all simplification rules whose
3659 lhs match term. Any other term is interpreted as pattern and selects
3660 all theorems matching the pattern. Available in ProofGeneral under
3661 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3663 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3665 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3666 matching the current goal as introduction rule and not having "HOL."
3667 in their name (i.e. not being defined in theory HOL).
3669 * Command 'thms_containing' has been discontinued in favour of
3670 'find_theorems'; INCOMPATIBILITY.
3672 * Communication with Proof General is now 8bit clean, which means that
3673 Unicode text in UTF-8 encoding may be used within theory texts (both
3674 formal and informal parts). Cf. option -U of the Isabelle Proof
3675 General interface. Here are some simple examples (cf. src/HOL/ex):
3677 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3678 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3680 * Improved efficiency of the Simplifier and, to a lesser degree, the
3681 Classical Reasoner. Typical big applications run around 2 times
3685 *** Document preparation ***
3687 * Commands 'display_drafts' and 'print_drafts' perform simple output
3688 of raw sources. Only those symbols that do not require additional
3689 LaTeX packages (depending on comments in isabellesym.sty) are
3690 displayed properly, everything else is left verbatim. isatool display
3691 and isatool print are used as front ends (these are subject to the
3692 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3694 * Command tags control specific markup of certain regions of text,
3695 notably folding and hiding. Predefined tags include "theory" (for
3696 theory begin and end), "proof" for proof commands, and "ML" for
3697 commands involving ML code; the additional tags "visible" and
3698 "invisible" are unused by default. Users may give explicit tag
3699 specifications in the text, e.g. ''by %invisible (auto)''. The
3700 interpretation of tags is determined by the LaTeX job during document
3701 preparation: see option -V of isatool usedir, or options -n and -t of
3702 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3705 Several document versions may be produced at the same time via isatool
3706 usedir (the generated index.html will link all of them). Typical
3707 specifications include ''-V document=theory,proof,ML'' to present
3708 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3709 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3710 these parts without any formal replacement text. The Isabelle site
3711 default settings produce ''document'' and ''outline'' versions as
3714 * Several new antiquotations:
3716 @{term_type term} prints a term with its type annotated;
3718 @{typeof term} prints the type of a term;
3720 @{const const} is the same as @{term const}, but checks that the
3721 argument is a known logical constant;
3723 @{term_style style term} and @{thm_style style thm} print a term or
3724 theorem applying a "style" to it
3728 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3729 definitions, equations, inequations etc., 'concl' printing only the
3730 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3731 to print the specified premise. TermStyle.add_style provides an ML
3732 interface for introducing further styles. See also the "LaTeX Sugar"
3733 document practical applications. The ML antiquotation prints
3734 type-checked ML expressions verbatim.
3736 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3737 and 'text' support optional locale specification '(in loc)', which
3738 specifies the default context for interpreting antiquotations. For
3739 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3741 * Option 'locale=NAME' of antiquotations specifies an alternative
3742 context interpreting the subsequent argument. For example: @{thm
3743 [locale=lattice] inf_assoc}.
3745 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3748 * Proper output of antiquotations for theory commands involving a
3749 proof context (such as 'locale' or 'theorem (in loc) ...').
3751 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3752 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3754 * isatool usedir: new option -C (default true) controls whether option
3755 -D should include a copy of the original document directory; -C false
3756 prevents unwanted effects such as copying of administrative CVS data.
3761 * Considerably improved version of 'constdefs' command. Now performs
3762 automatic type-inference of declared constants; additional support for
3763 local structure declarations (cf. locales and HOL records), see also
3764 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3765 sequential dependencies of definitions within a single 'constdefs'
3766 section; moreover, the declared name needs to be an identifier. If
3767 all fails, consider to fall back on 'consts' and 'defs' separately.
3769 * Improved indexed syntax and implicit structures. First of all,
3770 indexed syntax provides a notational device for subscripted
3771 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3772 expressions. Secondly, in a local context with structure
3773 declarations, number indexes \<^sub>n or the empty index (default
3774 number 1) refer to a certain fixed variable implicitly; option
3775 show_structs controls printing of implicit structures. Typical
3776 applications of these concepts involve record types and locales.
3778 * New command 'no_syntax' removes grammar declarations (and
3779 translations) resulting from the given syntax specification, which is
3780 interpreted in the same manner as for the 'syntax' command.
3782 * 'Advanced' translation functions (parse_translation etc.) may depend
3783 on the signature of the theory context being presently used for
3784 parsing/printing, see also isar-ref manual.
3786 * Improved 'oracle' command provides a type-safe interface to turn an
3787 ML expression of type theory -> T -> term into a primitive rule of
3788 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3789 is already included here); see also FOL/ex/IffExample.thy;
3792 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3793 before); "cI" is no longer bound, use "c.intro" instead.
3794 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3795 axclasses vs. locales.
3797 * Improved internal renaming of symbolic identifiers -- attach primes
3798 instead of base 26 numbers.
3800 * New flag show_question_marks controls printing of leading question
3801 marks in schematic variable names.
3803 * In schematic variable names, *any* symbol following \<^isub> or
3804 \<^isup> is now treated as part of the base name. For example, the
3805 following works without printing of awkward ".0" indexes:
3807 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3810 * Inner syntax includes (*(*nested*) comments*).
3812 * Pretty printer now supports unbreakable blocks, specified in mixfix
3813 annotations as "(00...)".
3815 * Clear separation of logical types and nonterminals, where the latter
3816 may only occur in 'syntax' specifications or type abbreviations.
3817 Before that distinction was only partially implemented via type class
3818 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3819 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3820 exotic syntax specifications may require further adaption
3821 (e.g. Cube/Cube.thy).
3823 * Removed obsolete type class "logic", use the top sort {} instead.
3824 Note that non-logical types should be declared as 'nonterminals'
3825 rather than 'types'. INCOMPATIBILITY for new object-logic
3828 * Attributes 'induct' and 'cases': type or set names may now be
3829 locally fixed variables as well.
3831 * Simplifier: can now control the depth to which conditional rewriting
3832 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3835 * Simplifier: simplification procedures may now take the current
3836 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3837 interface), which is very useful for calling the Simplifier
3838 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3839 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3840 low-level mk_simproc no longer applies Logic.varify internally, to
3841 allow for use in a context of fixed variables.
3843 * thin_tac now works even if the assumption being deleted contains !!
3844 or ==>. More generally, erule now works even if the major premise of
3845 the elimination rule contains !! or ==>.
3847 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3849 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3850 from Pure, which contains all common declarations already. Both
3851 theories are defined via plain Isabelle/Isar .thy files.
3852 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3853 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3854 use isatool fixcpure to adapt your theory and ML sources.
3856 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3857 selections of theorems in named facts via index ranges.
3859 * 'print_theorems': in theory mode, really print the difference
3860 wrt. the last state (works for interactive theory development only),
3861 in proof mode print all local facts (cf. 'print_facts');
3863 * 'hide': option '(open)' hides only base names.
3865 * More efficient treatment of intermediate checkpoints in interactive
3868 * Code generator is now invoked via code_module (incremental code
3869 generation) and code_library (modular code generation, ML structures
3870 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3871 must be quoted when used as identifiers.
3873 * New 'value' command for reading, evaluating and printing terms using
3874 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3875 quoted when used as identifier.
3880 * New commands for the interpretation of locale expressions in
3881 theories (1), locales (2) and proof contexts (3). These generate
3882 proof obligations from the expression specification. After the
3883 obligations have been discharged, theorems of the expression are added
3884 to the theory, target locale or proof context. The synopsis of the
3885 commands is a follows:
3887 (1) interpretation expr inst
3888 (2) interpretation target < expr
3889 (3) interpret expr inst
3891 Interpretation in theories and proof contexts require a parameter
3892 instantiation of terms from the current context. This is applied to
3893 specifications and theorems of the interpreted expression.
3894 Interpretation in locales only permits parameter renaming through the
3895 locale expression. Interpretation is smart in that interpretations
3896 that are active already do not occur in proof obligations, neither are
3897 instantiated theorems stored in duplicate. Use 'print_interps' to
3898 inspect active interpretations of a particular locale. For details,
3899 see the Isar Reference manual. Examples can be found in
3900 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3902 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3903 'interpret' instead.
3905 * New context element 'constrains' for adding type constraints to
3908 * Context expressions: renaming of parameters with syntax
3911 * Locale declaration: 'includes' disallowed.
3913 * Proper static binding of attribute syntax -- i.e. types / terms /
3914 facts mentioned as arguments are always those of the locale definition
3915 context, independently of the context of later invocations. Moreover,
3916 locale operations (renaming and type / term instantiation) are applied
3917 to attribute arguments as expected.
3919 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3920 actual attributes; rare situations may require Attrib.attribute to
3921 embed those attributes into Attrib.src that lack concrete syntax.
3922 Attribute implementations need to cooperate properly with the static
3923 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3924 Attrib.XXX_thm etc. already do the right thing without further
3925 intervention. Only unusual applications -- such as "where" or "of"
3926 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3927 on the context and the facts involved -- may have to assign parsed
3928 values to argument tokens explicitly.
3930 * Changed parameter management in theorem generation for long goal
3931 statements with 'includes'. INCOMPATIBILITY: produces a different
3932 theorem statement in rare situations.
3934 * Locale inspection command 'print_locale' omits notes elements. Use
3935 'print_locale!' to have them included in the output.
3940 * Provers/hypsubst.ML: improved version of the subst method, for
3941 single-step rewriting: it now works in bound variable contexts. New is
3942 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3943 rewrite a different subterm than the original subst method, which is
3944 still available as 'simplesubst'.
3946 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3949 * Provers/trancl.ML: new transitivity reasoner for transitive and
3950 reflexive-transitive closure of relations.
3952 * Provers/blast.ML: new reference depth_limit to make blast's depth
3953 limit (previously hard-coded with a value of 20) user-definable.
3955 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3956 is peformed already. Object-logics merely need to finish their
3957 initial simpset configuration as before. INCOMPATIBILITY.
3962 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3965 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3967 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3968 and x-symbol; use option '-m epsilon' to get it actually printed.
3969 Moreover, the mathematically important symbolic identifier \<epsilon>
3970 becomes available as variable, constant etc. INCOMPATIBILITY,
3972 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3973 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3974 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3975 support corresponding Isar calculations.
3977 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3980 * theory SetInterval: changed the syntax for open intervals:
3989 The old syntax is still supported but will disappear in the next
3990 release. For conversion use the following Emacs search and replace
3991 patterns (these are not perfect but work quite well):
3993 {)\([^\.]*\)\.\. -> {\1<\.\.}
3994 \.\.\([^(}]*\)(} -> \.\.<\1}
3996 * Theory Commutative_Ring (in Library): method comm_ring for proving
3997 equalities in commutative rings; method 'algebra' provides a generic
4000 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4001 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4002 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4005 Some new syntax forms are available:
4007 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4008 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4009 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4010 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4012 The latter form "\<Sum>x < k. e" used to be based on a separate
4013 function "Summation", which has been discontinued.
4015 * theory Finite_Set: in structured induction proofs, the insert case
4016 is now 'case (insert x F)' instead of the old counterintuitive 'case
4019 * The 'refute' command has been extended to support a much larger
4020 fragment of HOL, including axiomatic type classes, constdefs and
4021 typedefs, inductive datatypes and recursion.
4023 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4024 Requires zChaff with proof generation to be installed. See
4025 HOL/ex/SAT_Examples.thy for examples.
4027 * Datatype induction via method 'induct' now preserves the name of the
4028 induction variable. For example, when proving P(xs::'a list) by
4029 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4030 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4031 in unstructured proof scripts.
4033 * Reworked implementation of records. Improved scalability for
4034 records with many fields, avoiding performance problems for type
4035 inference. Records are no longer composed of nested field types, but
4036 of nested extension types. Therefore the record type only grows linear
4037 in the number of extensions and not in the number of fields. The
4038 top-level (users) view on records is preserved. Potential
4039 INCOMPATIBILITY only in strange cases, where the theory depends on the
4040 old record representation. The type generated for a record is called
4041 <record_name>_ext_type.
4043 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4044 proofs triggered by a record definition or a simproc (if
4045 quick_and_dirty is enabled). Definitions of large records can take
4048 New simproc record_upd_simproc for simplification of multiple record
4049 updates enabled by default. Moreover, trivial updates are also
4050 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4051 occasionally, since simplification is more powerful by default.
4053 * typedef: proper support for polymorphic sets, which contain extra
4054 type-variables in the term.
4056 * Simplifier: automatically reasons about transitivity chains
4057 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4058 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4059 old proofs break occasionally as simplification may now solve more
4060 goals than previously.
4062 * Simplifier: converts x <= y into x = y if assumption y <= x is
4063 present. Works for all partial orders (class "order"), in particular
4064 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4067 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4068 bound variable or a constant then the let is unfolded. Otherwise
4069 first a is simplified to b, and then f b is simplified to g. If
4070 possible we abstract b from g arriving at "let x = b in h x",
4071 otherwise we unfold the let and arrive at g. The simproc can be
4072 enabled/disabled by the reference use_let_simproc. Potential
4073 INCOMPATIBILITY since simplification is more powerful by default.
4075 * Classical reasoning: the meson method now accepts theorems as arguments.
4077 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4078 jobs to provide advice on the provability of subgoals.
4080 * Theory OrderedGroup and Ring_and_Field: various additions and
4081 improvements to faciliate calculations involving equalities and
4084 The following theorems have been eliminated or modified
4087 abs_eq now named abs_of_nonneg
4088 abs_of_ge_0 now named abs_of_nonneg
4089 abs_minus_eq now named abs_of_nonpos
4090 imp_abs_id now named abs_of_nonneg
4091 imp_abs_neg_id now named abs_of_nonpos
4092 mult_pos now named mult_pos_pos
4093 mult_pos_le now named mult_nonneg_nonneg
4094 mult_pos_neg_le now named mult_nonneg_nonpos
4095 mult_pos_neg2_le now named mult_nonneg_nonpos2
4096 mult_neg now named mult_neg_neg
4097 mult_neg_le now named mult_nonpos_nonpos
4099 * The following lemmas in Ring_and_Field have been added to the simplifier:
4102 not_square_less_zero
4104 The following lemmas have been deleted from Real/RealPow:
4114 * Theory Parity: added rules for simplifying exponents.
4118 The following theorems have been eliminated or modified
4121 list_all_Nil now named list_all.simps(1)
4122 list_all_Cons now named list_all.simps(2)
4123 list_all_conv now named list_all_iff
4124 set_mem_eq now named mem_iff
4126 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4127 asymptotic "big O" calculations. See the notes in BigO.thy.
4132 * Theory RealDef: better support for embedding natural numbers and
4133 integers in the reals.
4135 The following theorems have been eliminated or modified
4138 exp_ge_add_one_self now requires no hypotheses
4139 real_of_int_add reversed direction of equality (use [symmetric])
4140 real_of_int_minus reversed direction of equality (use [symmetric])
4141 real_of_int_diff reversed direction of equality (use [symmetric])
4142 real_of_int_mult reversed direction of equality (use [symmetric])
4144 * Theory RComplete: expanded support for floor and ceiling functions.
4146 * Theory Ln is new, with properties of the natural logarithm
4148 * Hyperreal: There is a new type constructor "star" for making
4149 nonstandard types. The old type names are now type synonyms:
4153 hcomplex = complex star
4155 * Hyperreal: Many groups of similarly-defined constants have been
4156 replaced by polymorphic versions (INCOMPATIBILITY):
4158 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4160 starset <-- starsetNat, starsetC
4161 *s* <-- *sNat*, *sc*
4162 starset_n <-- starsetNat_n, starsetC_n
4163 *sn* <-- *sNatn*, *scn*
4164 InternalSets <-- InternalNatSets, InternalCSets
4166 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4167 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4168 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4169 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4170 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4172 * Hyperreal: Many type-specific theorems have been removed in favor of
4173 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4175 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4176 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4177 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4178 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4179 right_minus <-- hypreal_add_minus
4180 left_minus <-- {hypreal,hcomplex}_add_minus_left
4181 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4182 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4183 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4184 mult_1_right <-- hcomplex_mult_one_right
4185 mult_zero_left <-- hcomplex_mult_zero_left
4186 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4187 right_distrib <-- hypnat_add_mult_distrib2
4188 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4189 right_inverse <-- hypreal_mult_inverse
4190 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4191 order_refl <-- {hypreal,hypnat}_le_refl
4192 order_trans <-- {hypreal,hypnat}_le_trans
4193 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4194 order_less_le <-- {hypreal,hypnat}_less_le
4195 linorder_linear <-- {hypreal,hypnat}_le_linear
4196 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4197 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4198 add_nonneg_nonneg <-- hypreal_le_add_order
4200 * Hyperreal: Separate theorems having to do with type-specific
4201 versions of constants have been merged into theorems that apply to the
4202 new polymorphic constants (INCOMPATIBILITY):
4204 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4205 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4206 STAR_Un <-- {STAR,NatStar,STARC}_Un
4207 STAR_Int <-- {STAR,NatStar,STARC}_Int
4208 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4209 STAR_subset <-- {STAR,NatStar,STARC}_subset
4210 STAR_mem <-- {STAR,NatStar,STARC}_mem
4211 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4212 STAR_diff <-- {STAR,STARC}_diff
4213 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4214 STARC_hcomplex_of_complex}_image_subset
4215 starset_n_Un <-- starset{Nat,C}_n_Un
4216 starset_n_Int <-- starset{Nat,C}_n_Int
4217 starset_n_Compl <-- starset{Nat,C}_n_Compl
4218 starset_n_diff <-- starset{Nat,C}_n_diff
4219 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4220 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4221 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4222 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4223 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4224 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4225 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4226 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4227 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4228 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4229 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4230 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4231 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4232 starfun_diff <-- starfun{C,RC,CR}_diff
4233 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4234 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4235 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4236 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4237 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4238 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4239 starfun_Id <-- starfunC_Id
4240 starfun_approx <-- starfun{Nat,CR}_approx
4241 starfun_capprox <-- starfun{C,RC}_capprox
4242 starfun_abs <-- starfunNat_rabs
4243 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4244 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4245 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4246 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4247 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4248 starfun_add_approx <-- starfunCR_add_approx
4249 starfun_inverse_inverse <-- starfunC_inverse_inverse
4250 starfun_divide <-- starfun{C,CR,RC}_divide
4251 starfun_n <-- starfun{Nat,C}_n
4252 starfun_n_mult <-- starfun{Nat,C}_n_mult
4253 starfun_n_add <-- starfun{Nat,C}_n_add
4254 starfun_n_add_minus <-- starfunNat_n_add_minus
4255 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4256 starfun_n_minus <-- starfun{Nat,C}_n_minus
4257 starfun_n_eq <-- starfun{Nat,C}_n_eq
4259 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4260 star_n_minus <-- {hypreal,hcomplex}_minus
4261 star_n_diff <-- {hypreal,hcomplex}_diff
4262 star_n_mult <-- {hypreal,hcomplex}_mult
4263 star_n_inverse <-- {hypreal,hcomplex}_inverse
4264 star_n_le <-- {hypreal,hypnat}_le
4265 star_n_less <-- {hypreal,hypnat}_less
4266 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4267 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4268 star_n_abs <-- hypreal_hrabs
4269 star_n_divide <-- hcomplex_divide
4271 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4272 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4273 star_of_diff <-- hypreal_of_real_diff
4274 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4275 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4276 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4277 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4278 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4279 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4280 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4281 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4282 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4283 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4284 star_of_number_of <-- {hypreal,hcomplex}_number_of
4285 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4286 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4287 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4288 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4289 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4290 star_of_power <-- hypreal_of_real_power
4291 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4293 * Hyperreal: new method "transfer" that implements the transfer
4294 principle of nonstandard analysis. With a subgoal that mentions
4295 nonstandard types like "'a star", the command "apply transfer"
4296 replaces it with an equivalent one that mentions only standard types.
4297 To be successful, all free variables must have standard types; non-
4298 standard variables must have explicit universal quantifiers.
4300 * Hyperreal: A theory of Taylor series.
4305 * Discontinued special version of 'constdefs' (which used to support
4306 continuous functions) in favor of the general Pure one with full
4309 * New simplification procedure for solving continuity conditions; it
4310 is much faster on terms with many nested lambda abstractions (cubic
4311 instead of exponential time).
4313 * New syntax for domain package: selector names are now optional.
4314 Parentheses should be omitted unless argument is lazy, for example:
4316 domain 'a stream = cons "'a" (lazy "'a stream")
4318 * New command 'fixrec' for defining recursive functions with pattern
4319 matching; defining multiple functions with mutual recursion is also
4320 supported. Patterns may include the constants cpair, spair, up, sinl,
4321 sinr, or any data constructor defined by the domain package. The given
4322 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4323 syntax and examples.
4325 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4326 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4327 but the proof obligation additionally includes an admissibility
4328 requirement. The packages generate instances of class cpo or pcpo,
4329 with continuity and strictness theorems for Rep and Abs.
4331 * HOLCF: Many theorems have been renamed according to a more standard naming
4332 scheme (INCOMPATIBILITY):
4334 foo_inject: "foo$x = foo$y ==> x = y"
4335 foo_eq: "(foo$x = foo$y) = (x = y)"
4336 foo_less: "(foo$x << foo$y) = (x << y)"
4337 foo_strict: "foo$UU = UU"
4338 foo_defined: "... ==> foo$x ~= UU"
4339 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4344 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4345 including the First Isomorphism Theorem (on quotienting by the kernel
4348 * ZF/Simplifier: install second copy of type solver that actually
4349 makes use of TC rules declared to Isar proof contexts (or locales);
4350 the old version is still required for ML proof scripts.
4355 * Converted to Isar theory format; use locales instead of axiomatic
4361 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4364 * Pure/library.ML no longer defines its own option datatype, but uses
4365 that of the SML basis, which has constructors NONE and SOME instead of
4366 None and Some, as well as exception Option.Option instead of OPTION.
4367 The functions the, if_none, is_some, is_none have been adapted
4368 accordingly, while Option.map replaces apsome.
4370 * Pure/library.ML: the exception LIST has been given up in favour of
4371 the standard exceptions Empty and Subscript, as well as
4372 Library.UnequalLengths. Function like Library.hd and Library.tl are
4373 superceded by the standard hd and tl functions etc.
4375 A number of basic list functions are no longer exported to the ML
4376 toplevel, as they are variants of predefined functions. The following
4377 suggests how one can translate existing code:
4379 rev_append xs ys = List.revAppend (xs, ys)
4380 nth_elem (i, xs) = List.nth (xs, i)
4381 last_elem xs = List.last xs
4382 flat xss = List.concat xss
4383 seq fs = List.app fs
4384 partition P xs = List.partition P xs
4385 mapfilter f xs = List.mapPartial f xs
4387 * Pure/library.ML: several combinators for linear functional
4388 transformations, notably reverse application and composition:
4391 (x, y) |-> f f #-> g
4393 * Pure/library.ML: introduced/changed precedence of infix operators:
4395 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4397 infix 3 o oo ooo oooo;
4398 infix 4 ~~ upto downto;
4400 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4403 * Pure/library.ML: natural list combinators fold, fold_rev, and
4404 fold_map support linear functional transformations and nesting. For
4407 fold f [x1, ..., xN] y =
4408 y |> f x1 |> ... |> f xN
4410 (fold o fold) f [xs1, ..., xsN] y =
4411 y |> fold f xs1 |> ... |> fold f xsN
4413 fold f [x1, ..., xN] =
4416 (fold o fold) f [xs1, ..., xsN] =
4417 fold f xs1 #> ... #> fold f xsN
4419 * Pure/library.ML: the following selectors on type 'a option are
4422 the: 'a option -> 'a (*partial*)
4423 these: 'a option -> 'a where 'a = 'b list
4424 the_default: 'a -> 'a option -> 'a
4425 the_list: 'a option -> 'a list
4427 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4428 basic operations for association lists, following natural argument
4429 order; moreover the explicit equality predicate passed here avoids
4430 potentially expensive polymorphic runtime equality checks.
4431 The old functions may be expressed as follows:
4433 assoc = uncurry (AList.lookup (op =))
4434 assocs = these oo AList.lookup (op =)
4435 overwrite = uncurry (AList.update (op =)) o swap
4437 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4439 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4440 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4442 replacing make_keylist and keyfilter (occassionally used)
4445 make_keylist = AList.make
4446 keyfilter = AList.find (op =)
4448 * eq_fst and eq_snd now take explicit equality parameter, thus
4449 avoiding eqtypes. Naive rewrites:
4451 eq_fst = eq_fst (op =)
4452 eq_snd = eq_snd (op =)
4454 * Removed deprecated apl and apr (rarely used).
4457 apl (n, op) =>>= curry op n
4458 apr (op, m) =>>= fn n => op (n, m)
4460 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4461 provides a reasonably efficient light-weight implementation of sets as
4464 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4465 few new operations; existing lookup and update are now curried to
4466 follow natural argument order (for use with fold etc.);
4467 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4469 * Pure/General: output via the Isabelle channels of
4470 writeln/warning/error etc. is now passed through Output.output, with a
4471 hook for arbitrary transformations depending on the print_mode
4472 (cf. Output.add_mode -- the first active mode that provides a output
4473 function wins). Already formatted output may be embedded into further
4474 text via Output.raw; the result of Pretty.string_of/str_of and derived
4475 functions (string_of_term/cterm/thm etc.) is already marked raw to
4476 accommodate easy composition of diagnostic messages etc. Programmers
4477 rarely need to care about Output.output or Output.raw at all, with
4478 some notable exceptions: Output.output is required when bypassing the
4479 standard channels (writeln etc.), or in token translations to produce
4480 properly formatted results; Output.raw is required when capturing
4481 already output material that will eventually be presented to the user
4482 a second time. For the default print mode, both Output.output and
4483 Output.raw have no effect.
4485 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4486 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4487 cumulative results are displayed at the end of a batch session.
4489 * Pure/General: File.sysify_path and File.quote_sysify path have been
4490 replaced by File.platform_path and File.shell_path (with appropriate
4491 hooks). This provides a clean interface for unusual systems where the
4492 internal and external process view of file names are different.
4494 * Pure: more efficient orders for basic syntactic entities: added
4495 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4496 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4497 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4498 orders now -- potential INCOMPATIBILITY for code that depends on a
4499 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4500 Library.sort_strings on result).
4502 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4503 fold_types traverse types/terms from left to right, observing natural
4504 argument order. Supercedes previous foldl_XXX versions, add_frees,
4505 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4507 * Pure: name spaces have been refined, with significant changes of the
4508 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4509 to extern(_table). The plain name entry path is superceded by a
4510 general 'naming' context, which also includes the 'policy' to produce
4511 a fully qualified name and external accesses of a fully qualified
4512 name; NameSpace.extend is superceded by context dependent
4513 Sign.declare_name. Several theory and proof context operations modify
4514 the naming context. Especially note Theory.restore_naming and
4515 ProofContext.restore_naming to get back to a sane state; note that
4516 Theory.add_path is no longer sufficient to recover from
4517 Theory.absolute_path in particular.
4519 * Pure: new flags short_names (default false) and unique_names
4520 (default true) for controlling output of qualified names. If
4521 short_names is set, names are printed unqualified. If unique_names is
4522 reset, the name prefix is reduced to the minimum required to achieve
4523 the original result when interning again, even if there is an overlap
4524 with earlier declarations.
4526 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4527 now 'extend', and 'merge' gets an additional Pretty.pp argument
4528 (useful for printing error messages). INCOMPATIBILITY.
4530 * Pure: major reorganization of the theory context. Type Sign.sg and
4531 Theory.theory are now identified, referring to the universal
4532 Context.theory (see Pure/context.ML). Actual signature and theory
4533 content is managed as theory data. The old code and interfaces were
4534 spread over many files and structures; the new arrangement introduces
4535 considerable INCOMPATIBILITY to gain more clarity:
4537 Context -- theory management operations (name, identity, inclusion,
4538 parents, ancestors, merge, etc.), plus generic theory data;
4540 Sign -- logical signature and syntax operations (declaring consts,
4541 types, etc.), plus certify/read for common entities;
4543 Theory -- logical theory operations (stating axioms, definitions,
4544 oracles), plus a copy of logical signature operations (consts,
4545 types, etc.); also a few basic management operations (Theory.copy,
4548 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4549 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4550 for convenience -- they merely return the theory.
4552 * Pure: type Type.tsig is superceded by theory in most interfaces.
4554 * Pure: the Isar proof context type is already defined early in Pure
4555 as Context.proof (note that ProofContext.context and Proof.context are
4556 aliases, where the latter is the preferred name). This enables other
4557 Isabelle components to refer to that type even before Isar is present.
4559 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4560 typeK, constK, axiomK, oracleK), but provide explicit operations for
4561 any of these kinds. For example, Sign.intern typeK is now
4562 Sign.intern_type, Theory.hide_space Sign.typeK is now
4563 Theory.hide_types. Also note that former
4564 Theory.hide_classes/types/consts are now
4565 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4566 internalize their arguments! INCOMPATIBILITY.
4568 * Pure: get_thm interface (of PureThy and ProofContext) expects
4569 datatype thmref (with constructors Name and NameSelection) instead of
4570 plain string -- INCOMPATIBILITY;
4572 * Pure: cases produced by proof methods specify options, where NONE
4573 means to remove case bindings -- INCOMPATIBILITY in
4576 * Pure: the following operations retrieve axioms or theorems from a
4577 theory node or theory hierarchy, respectively:
4579 Theory.axioms_of: theory -> (string * term) list
4580 Theory.all_axioms_of: theory -> (string * term) list
4581 PureThy.thms_of: theory -> (string * thm) list
4582 PureThy.all_thms_of: theory -> (string * thm) list
4584 * Pure: print_tac now outputs the goal through the trace channel.
4586 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4587 Reference Toplevel.debug (default false) controls detailed printing
4588 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4589 controls execution profiling -- set to 1 for time and 2 for space
4590 (both increase the runtime).
4592 * Isar session: The initial use of ROOT.ML is now always timed,
4593 i.e. the log will show the actual process times, in contrast to the
4594 elapsed wall-clock time that the outer shell wrapper produces.
4596 * Simplifier: improved handling of bound variables (nameless
4597 representation, avoid allocating new strings). Simprocs that invoke
4598 the Simplifier recursively should use Simplifier.inherit_bounds to
4599 avoid local name clashes. Failure to do so produces warnings
4600 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4601 for further details.
4603 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4604 bindings for all theorems stored within a given theory; this may help
4605 in porting non-Isar theories to Isar ones, while keeping ML proof
4606 scripts for the time being.
4608 * ML operator HTML.with_charset specifies the charset begin used for
4609 generated HTML files. For example:
4611 HTML.with_charset "utf-8" use_thy "Hebrew";
4612 HTML.with_charset "utf-8" use_thy "Chinese";
4617 * Allow symlinks to all proper Isabelle executables (Isabelle,
4618 isabelle, isatool etc.).
4620 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4621 isatool doc, isatool mkdir, display_drafts etc.).
4623 * isatool usedir: option -f allows specification of the ML file to be
4624 used by Isabelle; default is ROOT.ML.
4626 * New isatool version outputs the version identifier of the Isabelle
4627 distribution being used.
4629 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4630 (containing Boolean satisfiability problems) into Isabelle/HOL
4635 New in Isabelle2004 (April 2004)
4636 --------------------------------
4640 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4641 Replaces linorder.ML.
4643 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4644 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4645 (\<a>...\<z>), are now considered normal letters, and can therefore
4646 be used anywhere where an ASCII letter (a...zA...Z) has until
4647 now. COMPATIBILITY: This obviously changes the parsing of some
4648 terms, especially where a symbol has been used as a binder, say
4649 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4650 as an identifier. Fix it by inserting a space around former
4651 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4652 existing theory and ML files.
4654 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4656 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4657 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4658 a normal (but invisible) letter. For multiple letter subscripts repeat
4659 \<^isub> like this: x\<^isub>1\<^isub>2.
4661 * Pure: There are now sub-/superscripts that can span more than one
4662 character. Text between \<^bsub> and \<^esub> is set in subscript in
4663 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4664 superscript. The new control characters are not identifier parts.
4666 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4667 content of "..." to the latex file instead of \isacntrl... . The "..."
4668 may consist of any printable characters excluding the end bracket >.
4670 * Pure: Using new Isar command "finalconsts" (or the ML functions
4671 Theory.add_finals or Theory.add_finals_i) it is now possible to
4672 declare constants "final", which prevents their being given a definition
4673 later. It is useful for constants whose behaviour is fixed axiomatically
4674 rather than definitionally, such as the meta-logic connectives.
4676 * Pure: 'instance' now handles general arities with general sorts
4677 (i.e. intersections of classes),
4679 * Presentation: generated HTML now uses a CSS style sheet to make layout
4680 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4681 It can be changed to alter the colors/layout of generated pages.
4686 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4687 cut_tac, subgoal_tac and thin_tac:
4688 - Now understand static (Isar) contexts. As a consequence, users of Isar
4689 locales are no longer forced to write Isar proof scripts.
4690 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4692 - INCOMPATIBILITY: names of variables to be instantiated may no
4693 longer be enclosed in quotes. Instead, precede variable name with `?'.
4694 This is consistent with the instantiation attribute "where".
4696 * Attributes "where" and "of":
4697 - Now take type variables of instantiated theorem into account when reading
4698 the instantiation string. This fixes a bug that caused instantiated
4699 theorems to have too special types in some circumstances.
4700 - "where" permits explicit instantiations of type variables.
4702 * Calculation commands "moreover" and "also" no longer interfere with
4703 current facts ("this"), admitting arbitrary combinations with "then"
4707 - Goal statements involving the context element "includes" no longer
4708 generate theorems with internal delta predicates (those ending on
4709 "_axioms") in the premise.
4710 Resolve particular premise with <locale>.intro to obtain old form.
4711 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4712 specification and "includes" elements in goal statement.
4713 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4714 [intro?] and [elim?] (respectively) by default.
4715 - Experimental command for instantiation of locales in proof contexts:
4716 instantiate <label>[<attrs>]: <loc>
4717 Instantiates locale <loc> and adds all its theorems to the current context
4718 taking into account their attributes. Label and attrs are optional
4719 modifiers, like in theorem declarations. If present, names of
4720 instantiated theorems are qualified with <label>, and the attributes
4721 <attrs> are applied after any attributes these theorems might have already.
4722 If the locale has assumptions, a chained fact of the form
4723 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4724 are derived. The command does not support old-style locales declared
4725 with "locale (open)".
4726 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4728 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4734 * Proof import: new image HOL4 contains the imported library from
4735 the HOL4 system with about 2500 theorems. It is imported by
4736 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4737 can be used like any other Isabelle image. See
4738 HOL/Import/HOL/README for more information.
4741 - Much improved handling of linear and partial orders.
4742 Reasoners for linear and partial orders are set up for type classes
4743 "linorder" and "order" respectively, and are added to the default simpset
4744 as solvers. This means that the simplifier can build transitivity chains
4745 to solve goals from the assumptions.
4746 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4747 of blast or auto after simplification become unnecessary because the goal
4748 is solved by simplification already.
4750 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4751 all proved in axiomatic type classes for semirings, rings and fields.
4754 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4755 now formalized using the Ring_and_Field theory mentioned above.
4756 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4757 than before, because now they are set up once in a generic manner.
4758 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4759 Look for the general versions in Ring_and_Field (and Power if they concern
4762 * Type "rat" of the rational numbers is now available in HOL-Complex.
4765 - Record types are now by default printed with their type abbreviation
4766 instead of the list of all field types. This can be configured via
4767 the reference "print_record_type_abbr".
4768 - Simproc "record_upd_simproc" for simplification of multiple updates added
4769 (not enabled by default).
4770 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4771 EX x. x = sel r to True (not enabled by default).
4772 - Tactic "record_split_simp_tac" to split and simplify records added.
4774 * 'specification' command added, allowing for definition by
4775 specification. There is also an 'ax_specification' command that
4776 introduces the new constants axiomatically.
4778 * arith(_tac) is now able to generate counterexamples for reals as well.
4780 * HOL-Algebra: new locale "ring" for non-commutative rings.
4782 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4783 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4785 * HOL-Matrix: a first theory for matrices in HOL with an application of
4786 matrix theory to linear programming.
4788 * Unions and Intersections:
4789 The latex output syntax of UN and INT has been changed
4790 from "\Union x \in A. B" to "\Union_{x \in A} B"
4791 i.e. the index formulae has become a subscript.
4792 Similarly for "\Union x. B", and for \Inter instead of \Union.
4794 * Unions and Intersections over Intervals:
4795 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4796 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4797 like in normal math, and corresponding versions for < and for intersection.
4799 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4800 lexicographic dictonary ordering has been added as "lexord".
4802 * ML: the legacy theory structures Int and List have been removed. They had
4803 conflicted with ML Basis Library structures having the same names.
4805 * 'refute' command added to search for (finite) countermodels. Only works
4806 for a fragment of HOL. The installation of an external SAT solver is
4807 highly recommended. See "HOL/Refute.thy" for details.
4809 * 'quickcheck' command: Allows to find counterexamples by evaluating
4810 formulae under an assignment of free variables to random values.
4811 In contrast to 'refute', it can deal with inductive datatypes,
4812 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4818 * Streams now come with concatenation and are part of the HOLCF image
4822 New in Isabelle2003 (May 2003)
4823 ------------------------------
4827 * Provers/simplifier:
4829 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4830 Assumptions are now subject to complete mutual simplification,
4831 not just from left to right. The simplifier now preserves
4832 the order of assumptions.
4834 Potential INCOMPATIBILITY:
4836 -- simp sometimes diverges where the old version did
4837 not, e.g. invoking simp on the goal
4839 [| P (f x); y = x; f x = f y |] ==> Q
4841 now gives rise to the infinite reduction sequence
4843 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4845 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4848 -- Tactics combining classical reasoner and simplification (such as auto)
4849 are also affected by this change, because many of them rely on
4850 simp. They may sometimes diverge as well or yield a different numbers
4851 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4852 in case of problems. Sometimes subsequent calls to the classical
4853 reasoner will fail because a preceeding call to the simplifier too
4854 eagerly simplified the goal, e.g. deleted redundant premises.
4856 - The simplifier trace now shows the names of the applied rewrite rules
4858 - You can limit the number of recursive invocations of the simplifier
4859 during conditional rewriting (where the simplifie tries to solve the
4860 conditions before applying the rewrite rule):
4861 ML "simp_depth_limit := n"
4862 where n is an integer. Thus you can force termination where previously
4863 the simplifier would diverge.
4865 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4867 - No longer aborts on failed congruence proof. Instead, the
4868 congruence is ignored.
4870 * Pure: New generic framework for extracting programs from constructive
4871 proofs. See HOL/Extraction.thy for an example instantiation, as well
4872 as HOL/Extraction for some case studies.
4874 * Pure: The main goal of the proof state is no longer shown by default, only
4875 the subgoals. This behaviour is controlled by a new flag.
4876 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4877 (ML: Proof.show_main_goal).
4879 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4880 rules whose conclusion matches subgoal 1:
4881 PG menu: Isabelle/Isar -> Show me -> matching rules
4882 The rules are ordered by how closely they match the subgoal.
4883 In particular, rules that solve a subgoal outright are displayed first
4884 (or rather last, the way they are printed).
4885 (ML: ProofGeneral.print_intros())
4887 * Pure: New flag trace_unify_fail causes unification to print
4888 diagnostic information (PG: in trace buffer) when it fails. This is
4889 useful for figuring out why single step proofs like rule, erule or
4892 * Pure: Locale specifications now produce predicate definitions
4893 according to the body of text (covering assumptions modulo local
4894 definitions); predicate "loc_axioms" covers newly introduced text,
4895 while "loc" is cumulative wrt. all included locale expressions; the
4896 latter view is presented only on export into the global theory
4897 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4898 on the old view without predicates;
4900 * Pure: predefined locales "var" and "struct" are useful for sharing
4901 parameters (as in CASL, for example); just specify something like
4902 ``var x + var y + struct M'' as import;
4904 * Pure: improved thms_containing: proper indexing of facts instead of
4905 raw theorems; check validity of results wrt. current name space;
4906 include local facts of proof configuration (also covers active
4907 locales), cover fixed variables in index; may use "_" in term
4908 specification; an optional limit for the number of printed facts may
4909 be given (the default is 40);
4911 * Pure: disallow duplicate fact bindings within new-style theory files
4914 * Provers: improved induct method: assumptions introduced by case
4915 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4916 the goal statement); "foo" still refers to all facts collectively;
4918 * Provers: the function blast.overloaded has been removed: all constants
4919 are regarded as potentially overloaded, which improves robustness in exchange
4920 for slight decrease in efficiency;
4922 * Provers/linorder: New generic prover for transitivity reasoning over
4923 linear orders. Note: this prover is not efficient!
4925 * Isar: preview of problems to finish 'show' now produce an error
4926 rather than just a warning (in interactive mode);
4933 - Produces a counter example if it cannot prove a goal.
4934 Note that the counter example may be spurious if the goal is not a formula
4935 of quantifier-free linear arithmetic.
4936 In ProofGeneral the counter example appears in the trace buffer.
4938 - Knows about div k and mod k where k is a numeral of type nat or int.
4940 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4941 linear arithmetic fails. This takes account of quantifiers and divisibility.
4942 Presburger arithmetic can also be called explicitly via presburger(_tac).
4944 * simp's arithmetic capabilities have been enhanced a bit: it now
4945 takes ~= in premises into account (by performing a case split);
4947 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4948 are distributed over a sum of terms;
4950 * New tactic "trans_tac" and method "trans" instantiate
4951 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4954 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4955 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4957 * 'typedef' command has new option "open" to suppress the set
4960 * functions Min and Max on finite sets have been introduced (theory
4963 * attribute [symmetric] now works for relations as well; it turns
4964 (x,y) : R^-1 into (y,x) : R, and vice versa;
4966 * induct over a !!-quantified statement (say !!x1..xn):
4967 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4969 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4970 %x. None. Warning: empty_def now refers to the previously hidden definition
4973 * Algebra: formalization of classical algebra. Intended as base for
4974 any algebraic development in Isabelle. Currently covers group theory
4975 (up to Sylow's theorem) and ring theory (Universal Property of
4976 Univariate Polynomials). Contributions welcome;
4978 * GroupTheory: deleted, since its material has been moved to Algebra;
4980 * Complex: new directory of the complex numbers with numeric constants,
4981 nonstandard complex numbers, and some complex analysis, standard and
4982 nonstandard (Jacques Fleuriot);
4984 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4986 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4989 * Real/HahnBanach: updated and adapted to locales;
4991 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4994 * UNITY: added the Meier-Sanders theory of progress sets;
4996 * MicroJava: bytecode verifier and lightweight bytecode verifier
4997 as abstract algorithms, instantiated to the JVM;
4999 * Bali: Java source language formalization. Type system, operational
5000 semantics, axiomatic semantics. Supported language features:
5001 classes, interfaces, objects,virtual methods, static methods,
5002 static/instance fields, arrays, access modifiers, definite
5003 assignment, exceptions.
5008 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5011 * Main ZF: virtually all theories converted to new-style format;
5016 * Pure: Tactic.prove provides sane interface for internal proofs;
5017 omits the infamous "standard" operation, so this is more appropriate
5018 than prove_goalw_cterm in many situations (e.g. in simprocs);
5020 * Pure: improved error reporting of simprocs;
5022 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5026 *** Document preparation ***
5028 * uses \par instead of \\ for line breaks in theory text. This may
5029 shift some page breaks in large documents. To get the old behaviour
5030 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5032 * minimized dependencies of isabelle.sty and isabellesym.sty on
5035 * \<euro> now needs package babel/greek instead of marvosym (which
5038 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5043 New in Isabelle2002 (March 2002)
5044 --------------------------------
5046 *** Document preparation ***
5048 * greatly simplified document preparation setup, including more
5049 graceful interpretation of isatool usedir -i/-d/-D options, and more
5050 instructive isatool mkdir; users should basically be able to get
5051 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5052 users may run a separate document processing stage manually like this:
5053 "isatool usedir -D output HOL Test && isatool document Test/output";
5055 * theory dependency graph may now be incorporated into documents;
5056 isatool usedir -g true will produce session_graph.eps/.pdf for use
5057 with \includegraphics of LaTeX;
5059 * proper spacing of consecutive markup elements, especially text
5060 blocks after section headings;
5062 * support bold style (for single symbols only), input syntax is like
5063 this: "\<^bold>\<alpha>" or "\<^bold>A";
5065 * \<bullet> is now output as bold \cdot by default, which looks much
5066 better in printed text;
5068 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5069 note that these symbols are currently unavailable in Proof General /
5070 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5072 * isatool latex no longer depends on changed TEXINPUTS, instead
5073 isatool document copies the Isabelle style files to the target
5079 * Pure/Provers: improved proof by cases and induction;
5080 - 'case' command admits impromptu naming of parameters (such as
5082 - 'induct' method divinates rule instantiation from the inductive
5083 claim; no longer requires excessive ?P bindings for proper
5084 instantiation of cases;
5085 - 'induct' method properly enumerates all possibilities of set/type
5086 rules; as a consequence facts may be also passed through *type*
5087 rules without further ado;
5088 - 'induct' method now derives symbolic cases from the *rulified*
5089 rule (before it used to rulify cases stemming from the internal
5090 atomized version); this means that the context of a non-atomic
5091 statement becomes is included in the hypothesis, avoiding the
5092 slightly cumbersome show "PROP ?case" form;
5093 - 'induct' may now use elim-style induction rules without chaining
5094 facts, using ``missing'' premises from the goal state; this allows
5095 rules stemming from inductive sets to be applied in unstructured
5096 scripts, while still benefitting from proper handling of non-atomic
5097 statements; NB: major inductive premises need to be put first, all
5098 the rest of the goal is passed through the induction;
5099 - 'induct' proper support for mutual induction involving non-atomic
5100 rule statements (uses the new concept of simultaneous goals, see
5102 - append all possible rule selections, but only use the first
5103 success (no backtracking);
5104 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5105 - undeclared rule case names default to numbers 1, 2, 3, ...;
5106 - added 'print_induct_rules' (covered by help item in recent Proof
5108 - moved induct/cases attributes to Pure, methods to Provers;
5109 - generic method setup instantiated for FOL and HOL;
5111 * Pure: support multiple simultaneous goal statements, for example
5112 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5113 meta-level mechanism, this acts as if several individual goals had
5114 been stated separately; in particular common proof methods need to be
5115 repeated in order to cover all claims; note that a single elimination
5116 step is *not* sufficient to establish the two conjunctions, so this
5119 assume "A & B" then have A and B .. (*".." fails*)
5121 better use "obtain" in situations as above; alternative refer to
5122 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5124 * Pure: proper integration with ``locales''; unlike the original
5125 version by Florian Kammller, Isar locales package high-level proof
5126 contexts rather than raw logical ones (e.g. we admit to include
5127 attributes everywhere); operations on locales include merge and
5128 rename; support for implicit arguments (``structures''); simultaneous
5129 type-inference over imports and text; see also HOL/ex/Locales.thy for
5132 * Pure: the following commands have been ``localized'', supporting a
5133 target locale specification "(in name)": 'lemma', 'theorem',
5134 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5135 stored both within the locale and at the theory level (exported and
5136 qualified by the locale name);
5138 * Pure: theory goals may now be specified in ``long'' form, with
5139 ad-hoc contexts consisting of arbitrary locale elements. for example
5140 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5141 definitions may be given, too); the result is a meta-level rule with
5142 the context elements being discharged in the obvious way;
5144 * Pure: new proof command 'using' allows to augment currently used
5145 facts after a goal statement ('using' is syntactically analogous to
5146 'apply', but acts on the goal's facts only); this allows chained facts
5147 to be separated into parts given before and after a claim, as in
5148 ``from a and b have C using d and e <proof>'';
5150 * Pure: renamed "antecedent" case to "rule_context";
5152 * Pure: new 'judgment' command records explicit information about the
5153 object-logic embedding (used by several tools internally); no longer
5154 use hard-wired "Trueprop";
5156 * Pure: added 'corollary' command;
5158 * Pure: fixed 'token_translation' command;
5160 * Pure: removed obsolete 'exported' attribute;
5162 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5163 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5164 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5166 * Pure: method 'atomize' presents local goal premises as object-level
5167 statements (atomic meta-level propositions); setup controlled via
5168 rewrite rules declarations of 'atomize' attribute; example
5169 application: 'induct' method with proper rule statements in improper
5172 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5173 now consider the syntactic context of assumptions, giving a better
5174 chance to get type-inference of the arguments right (this is
5175 especially important for locales);
5177 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5180 * Pure/obtain: the formal conclusion "thesis", being marked as
5181 ``internal'', may no longer be reference directly in the text;
5182 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5185 * Pure: generic 'sym' attribute which declares a rule both as pure
5186 'elim?' and for the 'symmetric' operation;
5188 * Pure: marginal comments ``--'' may now occur just anywhere in the
5189 text; the fixed correlation with particular command syntax has been
5192 * Pure: new method 'rules' is particularly well-suited for proof
5193 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5194 but often produces more compact proof terms with less detours;
5196 * Pure/Provers/classical: simplified integration with pure rule
5197 attributes and methods; the classical "intro?/elim?/dest?"
5198 declarations coincide with the pure ones; the "rule" method no longer
5199 includes classically swapped intros; "intro" and "elim" methods no
5200 longer pick rules from the context; also got rid of ML declarations
5201 AddXIs/AddXEs/AddXDs; all of this has some potential for
5204 * Provers/classical: attribute 'swapped' produces classical inversions
5205 of introduction rules;
5207 * Provers/simplifier: 'simplified' attribute may refer to explicit
5208 rules instead of full simplifier context; 'iff' attribute handles
5211 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5213 * HOL: 'recdef' now fails on unfinished automated proofs, use
5214 "(permissive)" option to recover old behavior;
5216 * HOL: 'inductive' no longer features separate (collective) attributes
5217 for 'intros' (was found too confusing);
5219 * HOL: properly declared induction rules less_induct and
5225 * HOL: moved over to sane numeral syntax; the new policy is as
5228 - 0 and 1 are polymorphic constants, which are defined on any
5229 numeric type (nat, int, real etc.);
5231 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5232 binary representation internally;
5234 - type nat has special constructor Suc, and generally prefers Suc 0
5235 over 1::nat and Suc (Suc 0) over 2::nat;
5237 This change may cause significant problems of INCOMPATIBILITY; here
5238 are some hints on converting existing sources:
5240 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5241 entities, so expressions involving "-" (unary or binary minus) need
5242 to be spaced properly;
5244 - existing occurrences of "1" may need to be constraint "1::nat" or
5245 even replaced by Suc 0; similar for old "2";
5247 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5249 - remove all special provisions on numerals in proofs;
5251 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5252 representation (depends on bin_arith_simps in the default context);
5254 * HOL: symbolic syntax for x^2 (numeral 2);
5256 * HOL: the class of all HOL types is now called "type" rather than
5257 "term"; INCOMPATIBILITY, need to adapt references to this type class
5258 in axclass/classes, instance/arities, and (usually rare) occurrences
5259 in typings (of consts etc.); internally the class is called
5260 "HOL.type", ML programs should refer to HOLogic.typeS;
5262 * HOL/record package improvements:
5263 - new derived operations "fields" to build a partial record section,
5264 "extend" to promote a fixed record to a record scheme, and
5265 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5266 declared as simp by default;
5267 - shared operations ("more", "fields", etc.) now need to be always
5268 qualified) --- potential INCOMPATIBILITY;
5269 - removed "make_scheme" operations (use "make" with "extend") --
5271 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5272 - provides cases/induct rules for use with corresponding Isar
5273 methods (for concrete records, record schemes, concrete more
5274 parts, and schematic more parts -- in that order);
5275 - internal definitions directly based on a light-weight abstract
5276 theory of product types over typedef rather than datatype;
5278 * HOL: generic code generator for generating executable ML code from
5279 specifications; specific support for HOL constructs such as inductive
5280 datatypes and sets, as well as recursive functions; can be invoked
5281 via 'generate_code' theory section;
5283 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5285 * HOL: consolidated and renamed several theories. In particular:
5286 Ord.thy has been absorbed into HOL.thy
5287 String.thy has been absorbed into List.thy
5289 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5290 (beware of argument permutation!);
5292 * HOL: linorder_less_split superseded by linorder_cases;
5294 * HOL/List: "nodups" renamed to "distinct";
5296 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5297 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5298 - Ex_def has changed, now need to use some_eq_ex
5300 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5301 in this (rare) case use:
5303 delSWrapper "split_all_tac"
5304 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5306 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5309 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5310 Isabelle's type classes, ^ on functions and relations has too general
5311 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5312 necessary to attach explicit type constraints;
5314 * HOL/Relation: the prefix name of the infix "O" has been changed from
5315 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5316 renamed accordingly (eg "compI" -> "rel_compI").
5318 * HOL: syntax translations now work properly with numerals and records
5321 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5322 of "lam" -- INCOMPATIBILITY;
5324 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5325 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5326 renamed "Product_Type.unit";
5328 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5330 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5331 the "cases" method);
5333 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5336 * HOL/IMP: updated and converted to new-style theory format; several
5337 parts turned into readable document, with proper Isar proof texts and
5338 some explanations (by Gerwin Klein);
5340 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5342 * HOL-Hyperreal is now a logic image;
5347 * Isar: consts/constdefs supports mixfix syntax for continuous
5350 * Isar: domain package adapted to new-style theory format, e.g. see
5353 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5354 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5355 lift.induct_tac, always use UU instead of Undef;
5357 * HOLCF/IMP: updated and converted to new-style theory;
5362 * Isar: proper integration of logic-specific tools and packages,
5363 including theory commands '(co)inductive', '(co)datatype',
5364 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5365 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5367 * theory Main no longer includes AC; for the Axiom of Choice, base
5368 your theory on Main_ZFC;
5370 * the integer library now covers quotients and remainders, with many
5371 laws relating division to addition, multiplication, etc.;
5373 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5374 typeless version of the formalism;
5376 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5379 * ZF/Induct: new directory for examples of inductive definitions,
5380 including theory Multiset for multiset orderings; converted to
5381 new-style theory format;
5383 * ZF: many new theorems about lists, ordinals, etc.;
5388 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5389 variable proof controls level of detail: 0 = no proofs (only oracle
5390 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5391 also ref manual for further ML interfaces;
5393 * Pure/axclass: removed obsolete ML interface
5394 goal_subclass/goal_arity;
5396 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5397 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5398 separate tokens, so expressions involving minus need to be spaced
5401 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5402 rather than "infixl" or "infixr";
5404 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5405 sort constraint specifications in type inference; e.g. "x::_::foo"
5406 ensures that the type of "x" is of sort "foo" (but not necessarily a
5409 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5410 control output of nested => (types); the default behavior is
5413 * Pure/syntax: builtin parse translation for "_constify" turns valued
5414 tokens into AST constants;
5416 * Pure/syntax: prefer later declarations of translations and print
5417 translation functions; potential INCOMPATIBILITY: need to reverse
5418 multiple declarations for same syntax element constant;
5420 * Pure/show_hyps reset by default (in accordance to existing Isar
5423 * Provers/classical: renamed addaltern to addafter, addSaltern to
5426 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5429 * system: tested support for MacOS X; should be able to get Isabelle +
5430 Proof General to work in a plain Terminal after installing Poly/ML
5431 (e.g. from the Isabelle distribution area) and GNU bash alone
5432 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5433 support requires further installations, e.g. from
5434 http://fink.sourceforge.net/);
5436 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5438 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5439 of 40 MB), cf. ML_OPTIONS;
5441 * system: Proof General keywords specification is now part of the
5442 Isabelle distribution (see etc/isar-keywords.el);
5444 * system: support for persistent Proof General sessions (refrain from
5445 outdating all loaded theories on startup); user may create writable
5446 logic images like this: ``isabelle -q HOL Test'';
5448 * system: smart selection of Isabelle process versus Isabelle
5449 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5450 run both "isabelle" and "Isabelle" even if file names are badly
5451 damaged (executable inspects the case of the first letter of its own
5452 name); added separate "isabelle-process" and "isabelle-interface";
5454 * system: refrain from any attempt at filtering input streams; no
5455 longer support ``8bit'' encoding of old isabelle font, instead proper
5456 iso-latin characters may now be used; the related isatools
5457 "symbolinput" and "nonascii" have disappeared as well;
5459 * system: removed old "xterm" interface (the print modes "xterm" and
5460 "xterm_color" are still available for direct use in a suitable
5465 New in Isabelle99-2 (February 2001)
5466 -----------------------------------
5468 *** Overview of INCOMPATIBILITIES ***
5470 * HOL: please note that theories in the Library and elsewhere often use the
5471 new-style (Isar) format; to refer to their theorems in an ML script you must
5472 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5474 * HOL: inductive package no longer splits induction rule aggressively,
5475 but only as far as specified by the introductions given; the old
5476 format may be recovered via ML function complete_split_rule or attribute
5477 'split_rule (complete)';
5479 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5480 gfp_Tarski to gfp_unfold;
5482 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5484 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5485 relation); infix "^^" has been renamed "``"; infix "``" has been
5486 renamed "`"; "univalent" has been renamed "single_valued";
5488 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5491 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5493 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5495 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5496 consequence, it is no longer monotonic wrt. the local goal context
5497 (which is now passed through the inductive cases);
5499 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5500 \<gg> to \<ggreater>;
5503 *** Document preparation ***
5505 * \isabellestyle{NAME} selects version of Isabelle output (currently
5506 available: are "it" for near math-mode best-style output, "sl" for
5507 slanted text style, and "tt" for plain type-writer; if no
5508 \isabellestyle command is given, output is according to slanted
5511 * support sub/super scripts (for single symbols only), input syntax is
5512 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5514 * some more standard symbols; see Appendix A of the system manual for
5515 the complete list of symbols defined in isabellesym.sty;
5517 * improved isabelle style files; more abstract symbol implementation
5518 (should now use \isamath{...} and \isatext{...} in custom symbol
5521 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5522 state; Note that presentation of goal states does not conform to
5523 actual human-readable proof documents. Please do not include goal
5524 states into document output unless you really know what you are doing!
5526 * proper indentation of antiquoted output with proportional LaTeX
5529 * no_document ML operator temporarily disables LaTeX document
5532 * isatool unsymbolize tunes sources for plain ASCII communication;
5537 * Pure: Isar now suffers initial goal statements to contain unbound
5538 schematic variables (this does not conform to actual readable proof
5539 documents, due to unpredictable outcome and non-compositional proof
5540 checking); users who know what they are doing may use schematic goals
5541 for Prolog-style synthesis of proven results;
5543 * Pure: assumption method (an implicit finishing) now handles actual
5546 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5547 initial goal, declare "that" only as Pure intro (only for single
5548 steps); the "that" rule assumption may now be involved in implicit
5549 finishing, thus ".." becomes a feasible for trivial obtains;
5551 * Pure: default proof step now includes 'intro_classes'; thus trivial
5552 instance proofs may be performed by "..";
5554 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5557 * Pure: more robust selection of calculational rules;
5559 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5560 rule (as well as the assumption rule);
5562 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5563 lemmas, using the graph browser tool;
5565 * Pure: predict failure of "show" in interactive mode;
5567 * Pure: 'thms_containing' now takes actual terms as arguments;
5569 * HOL: improved method 'induct' --- now handles non-atomic goals
5570 (potential INCOMPATIBILITY); tuned error handling;
5572 * HOL: cases and induct rules now provide explicit hints about the
5573 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5574 any remaining facts are inserted into the goal verbatim;
5576 * HOL: local contexts (aka cases) may now contain term bindings as
5577 well; the 'cases' and 'induct' methods new provide a ?case binding for
5578 the result to be shown in each case;
5580 * HOL: added 'recdef_tc' command;
5582 * isatool convert assists in eliminating legacy ML scripts;
5587 * HOL/Library: a collection of generic theories to be used together
5588 with main HOL; the theory loader path already includes this directory
5589 by default; the following existing theories have been moved here:
5590 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5591 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5593 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5594 modelling and verification task performed in Isabelle/HOL +
5595 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5597 * HOL/Algebra: special summation operator SUM no longer exists, it has
5598 been replaced by setsum; infix 'assoc' now has priority 50 (like
5599 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5600 'domain', this makes the theory consistent with mathematical
5603 * HOL basics: added overloaded operations "inverse" and "divide"
5604 (infix "/"), syntax for generic "abs" operation, generic summation
5607 * HOL/typedef: simplified package, provide more useful rules (see also
5610 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5611 now expressed as a proper nested rule (old-style tactic scripts may
5612 require atomize_strip_tac to cope with non-atomic premises);
5614 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5615 to "split_conv" (old name still available for compatibility);
5617 * HOL: improved concrete syntax for strings (e.g. allows translation
5618 rules with string literals);
5620 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5621 and Fleuriot's mechanization of analysis, including the transcendental
5622 functions for the reals;
5624 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5629 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5630 "lam" is displayed as TWO lambda-symbols
5632 * CTT: theory Main now available, containing everything (that is, Bool
5638 * Pure: the Simplifier has been implemented properly as a derived rule
5639 outside of the actual kernel (at last!); the overall performance
5640 penalty in practical applications is about 50%, while reliability of
5641 the Isabelle inference kernel has been greatly improved;
5643 * print modes "brackets" and "no_brackets" control output of nested =>
5644 (types) and ==> (props); the default behaviour is "brackets";
5646 * Provers: fast_tac (and friends) now handle actual object-logic rules
5647 as assumptions as well;
5649 * system: support Poly/ML 4.0;
5651 * system: isatool install handles KDE version 1 or 2;
5655 New in Isabelle99-1 (October 2000)
5656 ----------------------------------
5658 *** Overview of INCOMPATIBILITIES ***
5660 * HOL: simplification of natural numbers is much changed; to partly
5661 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5662 issue the following ML commands:
5664 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5665 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5667 * HOL: simplification no longer dives into case-expressions; this is
5668 controlled by "t.weak_case_cong" for each datatype t;
5670 * HOL: nat_less_induct renamed to less_induct;
5672 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5673 fixsome to patch .thy and .ML sources automatically;
5675 select_equality -> some_equality
5676 select_eq_Ex -> some_eq_ex
5677 selectI2EX -> someI2_ex
5680 select1_equality -> some1_equality
5681 Eps_sym_eq -> some_sym_eq_trivial
5682 Eps_eq -> some_eq_trivial
5684 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5686 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5689 * HOL: the recursion equations generated by 'recdef' are now called
5690 f.simps instead of f.rules;
5692 * HOL: qed_spec_mp now also handles bounded ALL as well;
5694 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5695 sometimes be needed;
5697 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5699 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5701 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5702 product is now "<*>" instead of "Times"; the lexicographic product is
5703 now "<*lex*>" instead of "**";
5705 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5706 of main HOL, but was unused); better use HOL's datatype package;
5708 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5709 the old syntax may be recovered as follows:
5712 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5713 (infixl "\\<oplus>" 100)
5715 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5717 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5718 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5721 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5722 changed from A/r to A//r;
5724 * ZF: new treatment of arithmetic (nat & int) may break some old
5727 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5728 rulify -> rule_format, elimify -> elim_format, ...);
5730 * Isar/Provers: intro/elim/dest attributes changed; renamed
5731 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5732 should have to change intro!! to intro? only); replaced "delrule" by
5735 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5737 * Provers: strengthened force_tac by using new first_best_tac;
5739 * LaTeX document preparation: several changes of isabelle.sty (see
5743 *** Document preparation ***
5745 * formal comments (text blocks etc.) in new-style theories may now
5746 contain antiquotations of thm/prop/term/typ/text to be presented
5747 according to latex print mode; concrete syntax is like this:
5748 @{term[show_types] "f(x) = a + x"};
5750 * isatool mkdir provides easy setup of Isabelle session directories,
5751 including proper document sources;
5753 * generated LaTeX sources are now deleted after successful run
5754 (isatool document -c); may retain a copy somewhere else via -D option
5757 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5758 style files, achieving self-contained LaTeX sources and simplifying
5761 * old-style theories now produce (crude) LaTeX output as well;
5763 * browser info session directories are now self-contained (may be put
5764 on WWW server seperately); improved graphs of nested sessions; removed
5765 graph for 'all sessions';
5767 * several improvements in isabelle style files; \isabellestyle{it}
5768 produces fake math mode output; \isamarkupheader is now \section by
5769 default; see lib/texinputs/isabelle.sty etc.;
5774 * Isar/Pure: local results and corresponding term bindings are now
5775 subject to Hindley-Milner polymorphism (similar to ML); this
5776 accommodates incremental type-inference very nicely;
5778 * Isar/Pure: new derived language element 'obtain' supports
5779 generalized existence reasoning;
5781 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5782 support accumulation of results, without applying any rules yet;
5783 useful to collect intermediate results without explicit name
5784 references, and for use with transitivity rules with more than 2
5787 * Isar/Pure: scalable support for case-analysis type proofs: new
5788 'case' language element refers to local contexts symbolically, as
5789 produced by certain proof methods; internally, case names are attached
5790 to theorems as "tags";
5792 * Isar/Pure: theory command 'hide' removes declarations from
5793 class/type/const name spaces;
5795 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5796 indicate potential overloading;
5798 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5800 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5801 "{a,b,c}" instead of {a,b,c};
5803 * Isar/Pure now provides its own version of intro/elim/dest
5804 attributes; useful for building new logics, but beware of confusion
5805 with the version in Provers/classical;
5807 * Isar/Pure: the local context of (non-atomic) goals is provided via
5808 case name 'antecedent';
5810 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5811 to the current context is now done automatically);
5813 * Isar/Pure: theory command 'method_setup' provides a simple interface
5814 for definining proof methods in ML;
5816 * Isar/Provers: intro/elim/dest attributes changed; renamed
5817 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5818 most cases, one should have to change intro!! to intro? only);
5819 replaced "delrule" by "rule del";
5821 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5822 'symmetric' attribute (the latter supercedes [RS sym]);
5824 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5825 method modifier); 'simp' method: 'only:' modifier removes loopers as
5826 well (including splits);
5828 * Isar/Provers: Simplifier and Classical methods now support all kind
5829 of modifiers used in the past, including 'cong', 'iff', etc.
5831 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5832 of Simplifier and Classical reasoner);
5834 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5835 now support named cases; major packages (inductive, datatype, primrec,
5836 recdef) support case names and properly name parameters;
5838 * Isar/HOL: new transitivity rules for substitution in inequalities --
5839 monotonicity conditions are extracted to be proven at end of
5842 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5845 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5846 split_if split_if_asm; datatype package provides theorems foo.splits =
5847 foo.split foo.split_asm for each datatype;
5849 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5850 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5851 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5852 use "(cases (simplified))" method in proper proof texts);
5854 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5856 * Isar: names of theorems etc. may be natural numbers as well;
5858 * Isar: 'pr' command: optional arguments for goals_limit and
5859 ProofContext.prems_limit; no longer prints theory contexts, but only
5862 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5863 additional print modes to be specified; e.g. "pr(latex)" will print
5864 proof state according to the Isabelle LaTeX style;
5866 * Isar: improved support for emulating tactic scripts, including proof
5867 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5868 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5869 (for HOL datatypes);
5871 * Isar: simplified (more robust) goal selection of proof methods: 1st
5872 goal, all goals, or explicit goal specifier (tactic emulation); thus
5873 'proof method scripts' have to be in depth-first order;
5875 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5877 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5878 should instead use individual commands for printing items
5879 (print_commands, print_methods etc.);
5881 * Isar: added 'nothing' --- the empty list of theorems;
5886 * HOL/MicroJava: formalization of a fragment of Java, together with a
5887 corresponding virtual machine and a specification of its bytecode
5888 verifier and a lightweight bytecode verifier, including proofs of
5889 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5890 Cornelia Pusch (see also the homepage of project Bali at
5891 http://isabelle.in.tum.de/Bali/);
5893 * HOL/Algebra: new theory of rings and univariate polynomials, by
5896 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5897 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5900 * HOL/Lattice: fundamental concepts of lattice theory and order
5901 structures, including duals, properties of bounds versus algebraic
5902 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5903 Theorem for complete lattices etc.; may also serve as a demonstration
5904 for abstract algebraic reasoning using axiomatic type classes, and
5905 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5907 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5910 * HOL/IMPP: extension of IMP with local variables and mutually
5911 recursive procedures, by David von Oheimb;
5913 * HOL/Lambda: converted into new-style theory and document;
5915 * HOL/ex/Multiquote: example of multiple nested quotations and
5916 anti-quotations -- basically a generalized version of de-Bruijn
5917 representation; very useful in avoiding lifting of operations;
5919 * HOL/record: added general record equality rule to simpset; fixed
5920 select-update simplification procedure to handle extended records as
5921 well; admit "r" as field name;
5923 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5924 other numeric types and also as the identity of groups, rings, etc.;
5926 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5927 Types nat and int belong to this axclass;
5929 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5930 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5931 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5932 two terms #m*u and #n*u are replaced by #(m+n)*u
5933 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5934 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5935 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5937 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5938 powerful prover for predicate logic but knows nothing of clasets; see
5939 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5941 * HOL: new version of "case_tac" subsumes both boolean case split and
5942 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5943 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5945 * HOL: simplification no longer dives into case-expressions: only the
5946 selector expression is simplified, but not the remaining arms; to
5947 enable full simplification of case-expressions for datatype t, you may
5948 remove t.weak_case_cong from the simpset, either globally (Delcongs
5949 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5951 * HOL/recdef: the recursion equations generated by 'recdef' for
5952 function 'f' are now called f.simps instead of f.rules; if all
5953 termination conditions are proved automatically, these simplification
5954 rules are added to the simpset, as in primrec; rules may be named
5955 individually as well, resulting in a separate list of theorems for
5958 * HOL/While is a new theory that provides a while-combinator. It
5959 permits the definition of tail-recursive functions without the
5960 provision of a termination measure. The latter is necessary once the
5961 invariant proof rule for while is applied.
5963 * HOL: new (overloaded) notation for the set of elements below/above
5964 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5966 * HOL: theorems impI, allI, ballI bound as "strip";
5968 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5969 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5970 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5972 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5974 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5975 main HOL, but was unused);
5977 * HOL: fewer consts declared as global (e.g. have to refer to
5978 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5980 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5981 in case of overlap with user translations (e.g. judgements over
5982 tuples); (note that the underlying logical represenation is still
5988 * ZF: simplification automatically cancels common terms in arithmetic
5989 expressions over nat and int;
5991 * ZF: new treatment of nat to minimize type-checking: all operators
5992 coerce their operands to a natural number using the function natify,
5993 making the algebraic laws unconditional;
5995 * ZF: as above, for int: operators coerce their operands to an integer
5996 using the function intify;
5998 * ZF: the integer library now contains many of the usual laws for the
5999 orderings, including $<=, and monotonicity laws for $+ and $*;
6001 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6004 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6005 to the simplifier and classical reasoner simultaneously;
6010 * Provers: blast_tac now handles actual object-logic rules as
6011 assumptions; note that auto_tac uses blast_tac internally as well;
6013 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6014 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6016 * Provers: delrules now handles destruct rules as well (no longer need
6017 explicit make_elim);
6019 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6020 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6021 use instead the strong form,
6022 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6023 in HOL, FOL and ZF the function cla_make_elim will create such rules
6024 from destruct-rules;
6026 * Provers: Simplifier.easy_setup provides a fast path to basic
6027 Simplifier setup for new object-logics;
6029 * Pure: AST translation rules no longer require constant head on LHS;
6031 * Pure: improved name spaces: ambiguous output is qualified; support
6032 for hiding of names;
6034 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6035 XSYMBOL_HOME; no longer need to do manual configuration in most
6038 * system: compression of ML heaps images may now be controlled via -c
6039 option of isabelle and isatool usedir (currently only observed by
6042 * system: isatool installfonts may handle X-Symbol fonts as well (very
6043 useful for remote X11);
6045 * system: provide TAGS file for Isabelle sources;
6047 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6050 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6051 timing flag supersedes proof_timing and Toplevel.trace;
6053 * ML: new combinators |>> and |>>> for incremental transformations
6054 with secondary results (e.g. certain theory extensions):
6056 * ML: PureThy.add_defs gets additional argument to indicate potential
6057 overloading (usually false);
6059 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6064 New in Isabelle99 (October 1999)
6065 --------------------------------
6067 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6069 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6070 are no longer simplified. (This allows the simplifier to unfold recursive
6071 functional programs.) To restore the old behaviour, declare
6073 Delcongs [if_weak_cong];
6075 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6078 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6080 * HOL/datatype: mutual_induct_tac no longer exists --
6081 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6083 * HOL/typedef: fixed type inference for representing set; type
6084 arguments now have to occur explicitly on the rhs as type constraints;
6086 * ZF: The con_defs part of an inductive definition may no longer refer
6087 to constants declared in the same theory;
6089 * HOL, ZF: the function mk_cases, generated by the inductive
6090 definition package, has lost an argument. To simplify its result, it
6091 uses the default simpset instead of a supplied list of theorems.
6093 * HOL/List: the constructors of type list are now Nil and Cons;
6095 * Simplifier: the type of the infix ML functions
6096 setSSolver addSSolver setSolver addSolver
6097 is now simpset * solver -> simpset where `solver' is a new abstract type
6098 for packaging solvers. A solver is created via
6099 mk_solver: string -> (thm list -> int -> tactic) -> solver
6100 where the string argument is only a comment.
6105 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6106 decision procedure for linear arithmetic. Currently it is used for
6107 types `nat', `int', and `real' in HOL (see below); it can, should and
6108 will be instantiated for other types and logics as well.
6110 * The simplifier now accepts rewrite rules with flexible heads, eg
6111 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6112 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6118 * New Isabelle/Isar subsystem provides an alternative to traditional
6119 tactical theorem proving; together with the ProofGeneral/isar user
6120 interface it offers an interactive environment for developing human
6121 readable proof documents (Isar == Intelligible semi-automated
6122 reasoning); for further information see isatool doc isar-ref,
6123 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6125 * improved and simplified presentation of theories: better HTML markup
6126 (including colors), graph views in several sizes; isatool usedir now
6127 provides a proper interface for user theories (via -P option); actual
6128 document preparation based on (PDF)LaTeX is available as well (for
6129 new-style theories only); see isatool doc system for more information;
6131 * native support for Proof General, both for classic Isabelle and
6134 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6135 using the graph browser tool;
6137 * Isabelle manuals now also available as PDF;
6139 * theory loader rewritten from scratch (may not be fully
6140 bug-compatible); old loadpath variable has been replaced by show_path,
6141 add_path, del_path, reset_path functions; new operations such as
6142 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6145 * improved isatool install: option -k creates KDE application icon,
6146 option -p DIR installs standalone binaries;
6148 * added ML_PLATFORM setting (useful for cross-platform installations);
6149 more robust handling of platform specific ML images for SML/NJ;
6151 * the settings environment is now statically scoped, i.e. it is never
6152 created again in sub-processes invoked from isabelle, isatool, or
6155 * path element specification '~~' refers to '$ISABELLE_HOME';
6157 * in locales, the "assumes" and "defines" parts may be omitted if
6160 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6163 * new print_mode "HTML";
6165 * new flag show_tags controls display of tags of theorems (which are
6166 basically just comments that may be attached by some tools);
6168 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6169 mode and goal output format:
6171 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6173 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6175 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6176 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6178 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6180 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6182 * function bind_thms stores lists of theorems (cf. bind_thm);
6184 * new shorthand tactics ftac, eatac, datac, fatac;
6186 * qed (and friends) now accept "" as result name; in that case the
6187 theorem is not stored, but proper checks and presentation of the
6190 * theorem database now also indexes constants "Trueprop", "all",
6191 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6196 ** HOL arithmetic **
6198 * There are now decision procedures for linear arithmetic over nat and
6201 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6202 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6203 are treated as atomic; subformulae not involving type `nat' or `int'
6204 are ignored; quantified subformulae are ignored unless they are
6205 positive universal or negative existential. The tactic has to be
6206 invoked by hand and can be a little bit slow. In particular, the
6207 running time is exponential in the number of occurrences of `min' and
6208 `max', and `-' on `nat'.
6210 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6211 (negated) (in)equalities among the premises and the conclusion into
6212 account (i.e. no compound formulae) and does not know about `min' and
6213 `max', and `-' on `nat'. It is fast and is used automatically by the
6216 NB: At the moment, these decision procedures do not cope with mixed
6217 nat/int formulae where the two parts interact, such as `m < n ==>
6220 * HOL/Numeral provides a generic theory of numerals (encoded
6221 efficiently as bit strings); setup for types nat/int/real is in place;
6222 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6223 int, existing theories and proof scripts may require a few additional
6226 * integer division and remainder can now be performed on constant
6229 * many properties of integer multiplication, division and remainder
6232 * An interface to the Stanford Validity Checker (SVC) is available through the
6233 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6234 are proved automatically. SVC must be installed separately, and its results
6235 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6236 invocation of the underlying oracle). For SVC see
6237 http://verify.stanford.edu/SVC
6239 * IsaMakefile: the HOL-Real target now builds an actual image;
6244 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6245 (in Isabelle/Isar) -- by Gertrud Bauer;
6247 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6248 analysis for assembly languages with subtypes;
6250 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6251 -- avoids syntactic ambiguities and treats state, transition, and
6252 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6253 changed syntax and (many) tactics;
6255 * HOL/inductive: Now also handles more general introduction rules such
6256 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6257 theorems are now maintained within the theory (maintained via the
6260 * HOL/datatype: Now also handles arbitrarily branching datatypes
6261 (using function types) such as
6263 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6265 * HOL/record: record_simproc (part of the default simpset) takes care
6266 of selectors applied to updated records; record_split_tac is no longer
6267 part of the default claset; update_defs may now be removed from the
6268 simpset in many cases; COMPATIBILITY: old behavior achieved by
6270 claset_ref () := claset() addSWrapper record_split_wrapper;
6271 Delsimprocs [record_simproc]
6273 * HOL/typedef: fixed type inference for representing set; type
6274 arguments now have to occur explicitly on the rhs as type constraints;
6276 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6277 names rather than an ML expression;
6279 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6280 supplied later. Program schemes can be defined, such as
6281 "While B C s = (if B s then While B C (C s) else s)"
6282 where the well-founded relation can be chosen after B and C have been given.
6284 * HOL/List: the constructors of type list are now Nil and Cons;
6285 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6286 course, ML tools referring to List.list.op # etc. have to be adapted;
6288 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6289 disabled by default; run isabelle with option -m HOL to get back to
6290 the original Gordon/HOL-style output;
6292 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6293 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6295 * HOL basic syntax simplified (more orthogonal): all variants of
6296 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6297 Eps operator is provided as well: "SOME x. P[x]";
6299 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6301 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6302 thus available for user theories;
6304 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6305 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6308 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6309 several times and then mp;
6314 * the notation <<...>> is now available as a notation for sequences of
6317 * the simplifier is now installed
6319 * the axiom system has been generalized (thanks to Soren Heilmann)
6321 * the classical reasoner now has a default rule database
6326 * new primrec section allows primitive recursive functions to be given
6327 directly (as in HOL) over datatypes and the natural numbers;
6329 * new tactics induct_tac and exhaust_tac for induction (or case
6330 analysis) over datatypes and the natural numbers;
6332 * the datatype declaration of type T now defines the recursor T_rec;
6334 * simplification automatically does freeness reasoning for datatype
6337 * automatic type-inference, with AddTCs command to insert new
6338 type-checking rules;
6340 * datatype introduction rules are now added as Safe Introduction rules
6343 * the syntax "if P then x else y" is now available in addition to
6347 *** Internal programming interfaces ***
6349 * tuned simplifier trace output; new flag debug_simp;
6351 * structures Vartab / Termtab (instances of TableFun) offer efficient
6352 tables indexed by indexname_ord / term_ord (compatible with aconv);
6354 * AxClass.axclass_tac lost the theory argument;
6356 * tuned current_goals_markers semantics: begin / end goal avoids
6357 printing empty lines;
6359 * removed prs and prs_fn hook, which was broken because it did not
6360 include \n in its semantics, forcing writeln to add one
6361 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6362 string -> unit if you really want to output text without newline;
6364 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6365 plain output, interface builders may have to enable 'isabelle_font'
6366 mode to get Isabelle font glyphs as before;
6368 * refined token_translation interface; INCOMPATIBILITY: output length
6369 now of type real instead of int;
6371 * theory loader actions may be traced via new ThyInfo.add_hook
6372 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6373 your own database of information attached to *whole* theories -- as
6374 opposed to intra-theory data slots offered via TheoryDataFun;
6376 * proper handling of dangling sort hypotheses (at last!);
6377 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6378 extra sort hypotheses that can be witnessed from the type signature;
6379 the force_strip_shyps flag is gone, any remaining shyps are simply
6380 left in the theorem (with a warning issued by strip_shyps_warning);
6384 New in Isabelle98-1 (October 1998)
6385 ----------------------------------
6387 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6389 * several changes of automated proof tools;
6391 * HOL: major changes to the inductive and datatype packages, including
6392 some minor incompatibilities of theory syntax;
6394 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6397 * HOL: removed duplicate thms in Arith:
6398 less_imp_add_less should be replaced by trans_less_add1
6399 le_imp_add_le should be replaced by trans_le_add1
6401 * HOL: unary minus is now overloaded (new type constraints may be
6404 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6405 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6406 now taken as an integer constant.
6408 * Pure: ML function 'theory_of' renamed to 'theory';
6414 1. Asm_full_simp_tac is now more aggressive.
6415 1. It will sometimes reorient premises if that increases their power to
6417 2. It does no longer proceed strictly from left to right but may also
6418 rotate premises to achieve further simplification.
6419 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6420 old Asm_full_simp_tac in that it does not rotate premises.
6421 2. The simplifier now knows a little bit about nat-arithmetic.
6423 * Classical reasoner: wrapper mechanism for the classical reasoner now
6424 allows for selected deletion of wrappers, by introduction of names for
6425 wrapper functionals. This implies that addbefore, addSbefore,
6426 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6427 and that adding two tactics with the same name overwrites the first
6428 one (emitting a warning).
6429 type wrapper = (int -> tactic) -> (int -> tactic)
6430 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6431 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6432 delWrapper, delSWrapper: claset * string -> claset
6433 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6435 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6436 semantics; addbefore now affects only the unsafe part of step_tac
6437 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6438 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6441 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6442 compWrapper; added safe wrapper (and access functions for it);
6444 * HOL/split_all_tac is now much faster and fails if there is nothing
6445 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6446 and the names of the automatically generated variables have changed.
6447 split_all_tac has moved within claset() from unsafe wrappers to safe
6448 wrappers, which means that !!-bound variables are split much more
6449 aggressively, and safe_tac and clarify_tac now split such variables.
6450 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6451 Note: the same holds for record_split_tac, which does the job of
6452 split_all_tac for record fields.
6454 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6455 permanently to the default simpset using Addsplits just like
6456 Addsimps. They can be removed via Delsplits just like
6457 Delsimps. Lower-case versions are also available.
6459 * HOL/Simplifier: The rule split_if is now part of the default
6460 simpset. This means that the simplifier will eliminate all occurrences
6461 of if-then-else in the conclusion of a goal. To prevent this, you can
6462 either remove split_if completely from the default simpset by
6463 `Delsplits [split_if]' or remove it in a specific call of the
6464 simplifier using `... delsplits [split_if]'. You can also add/delete
6465 other case splitting rules to/from the default simpset: every datatype
6466 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6467 t is the name of the datatype).
6469 * Classical reasoner / Simplifier combination: new force_tac (and
6470 derivatives Force_tac, force) combines rewriting and classical
6471 reasoning (and whatever other tools) similarly to auto_tac, but is
6472 aimed to solve the given subgoal completely.
6477 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6478 and `goalw': the theory is no longer needed as an explicit argument -
6479 the current theory context is used; assumptions are no longer returned
6480 at the ML-level unless one of them starts with ==> or !!; it is
6481 recommended to convert to these new commands using isatool fixgoal
6482 (backup your sources first!);
6484 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6485 the current theory context, and 'theory' to lookup stored theories;
6487 * new theory section 'locale' for declaring constants, assumptions and
6488 definitions that have local scope;
6490 * new theory section 'nonterminals' for purely syntactic types;
6492 * new theory section 'setup' for generic ML setup functions
6493 (e.g. package initialization);
6495 * the distribution now includes Isabelle icons: see
6496 lib/logo/isabelle-{small,tiny}.xpm;
6498 * isatool install - install binaries with absolute references to
6501 * isatool logo -- create instances of the Isabelle logo (as EPS);
6503 * print mode 'emacs' reserved for Isamode;
6505 * support multiple print (ast) translations per constant name;
6507 * theorems involving oracles are now printed with a suffixed [!];
6512 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6514 * HOL/inductive package reorganized and improved: now supports mutual
6520 oddI "n : EVEN ==> Suc n : ODD"
6521 evenI "n : ODD ==> Suc n : EVEN"
6523 new theorem list "elims" contains an elimination rule for each of the
6524 recursive sets; inductive definitions now handle disjunctive premises
6525 correctly (also ZF);
6527 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6528 "mutual_induct" no longer exists - the induction rule is always
6529 contained in "induct";
6532 * HOL/datatype package re-implemented and greatly improved: now
6533 supports mutually recursive datatypes such as
6536 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6537 | SUM ('a aexp) ('a aexp)
6538 | DIFF ('a aexp) ('a aexp)
6541 'a bexp = LESS ('a aexp) ('a aexp)
6542 | AND ('a bexp) ('a bexp)
6543 | OR ('a bexp) ('a bexp)
6545 as well as indirectly recursive datatypes such as
6548 ('a, 'b) term = Var 'a
6549 | App 'b ((('a, 'b) term) list)
6551 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6552 induction on mutually / indirectly recursive datatypes.
6554 Primrec equations are now stored in theory and can be accessed via
6555 <function_name>.simps.
6559 - Theories using datatypes must now have theory Datatype as an
6561 - The specific <typename>.induct_tac no longer exists - use the
6562 generic induct_tac instead.
6563 - natE has been renamed to nat.exhaust - use exhaust_tac
6564 instead of res_inst_tac ... natE. Note that the variable
6565 names in nat.exhaust differ from the names in natE, this
6566 may cause some "fragile" proofs to fail.
6567 - The theorems split_<typename>_case and split_<typename>_case_asm
6568 have been renamed to <typename>.split and <typename>.split_asm.
6569 - Since default sorts of type variables are now handled correctly,
6570 some datatype definitions may have to be annotated with explicit
6572 - Primrec definitions no longer require function name and type
6573 of recursive argument.
6575 Consider using isatool fixdatatype to adapt your theories and proof
6576 scripts to the new package (backup your sources first!).
6579 * HOL/record package: considerably improved implementation; now
6580 includes concrete syntax for record types, terms, updates; theorems
6581 for surjective pairing and splitting !!-bound record variables; proof
6582 support is as follows:
6584 1) standard conversions (selectors or updates applied to record
6585 constructor terms) are part of the standard simpset;
6587 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6588 made part of standard simpset and claset via addIffs;
6590 3) a tactic for record field splitting (record_split_tac) is part of
6591 the standard claset (addSWrapper);
6593 To get a better idea about these rules you may retrieve them via
6594 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6595 the name of your record type.
6597 The split tactic 3) conceptually simplifies by the following rule:
6599 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6601 Thus any record variable that is bound by meta-all will automatically
6602 blow up into some record constructor term, consequently the
6603 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6604 solve record problems automatically.
6607 * reorganized the main HOL image: HOL/Integ and String loaded by
6608 default; theory Main includes everything;
6610 * automatic simplification of integer sums and comparisons, using cancellation;
6612 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6614 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6616 * many new identities for unions, intersections, set difference, etc.;
6618 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6619 called split_if, split_split, split_sum_case and split_nat_case (to go
6620 with add/delsplits);
6622 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6623 (?x::unit) = (); this is made part of the default simpset, which COULD
6624 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6625 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6626 unit_abs_eta_conv is added in order to counter the effect of
6627 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6630 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6633 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6634 It and 'sym RS equals0D' are now in the default claset, giving automatic
6635 disjointness reasoning but breaking a few old proofs.
6637 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6638 to 'converse' from 'inverse' (for compatibility with ZF and some
6641 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6642 the well-founded relation;
6644 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6645 Compl A. The "Compl" syntax remains available as input syntax for this
6648 * HOL/Update: new theory of function updates:
6649 f(a:=b) == %x. if x=a then b else f x
6650 may also be iterated as in f(a:=b,c:=d,...);
6652 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6655 - new function list_update written xs[i:=v] that updates the i-th
6656 list position. May also be iterated as in xs[i:=a,j:=b,...].
6657 - new function `upt' written [i..j(] which generates the list
6658 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6659 bound write [i..j], which is a shorthand for [i..j+1(].
6660 - new lexicographic orderings and corresponding wellfoundedness theorems.
6663 - removed 'pred' (predecessor) function;
6664 - generalized some theorems about n-1;
6665 - many new laws about "div" and "mod";
6666 - new laws about greatest common divisors (see theory ex/Primes);
6668 * HOL/Relation: renamed the relational operator r^-1 "converse"
6669 instead of "inverse";
6671 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6672 of the multiset ordering;
6674 * directory HOL/Real: a construction of the reals using Dedekind cuts
6675 (not included by default);
6677 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6679 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6680 programs, i.e. different program variables may have different types.
6682 * calling (stac rew i) now fails if "rew" has no effect on the goal
6683 [previously, this check worked only if the rewrite rule was unconditional]
6684 Now rew can involve either definitions or equalities (either == or =).
6689 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6690 only the theorems proved on ZF.ML;
6692 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6693 It and 'sym RS equals0D' are now in the default claset, giving automatic
6694 disjointness reasoning but breaking a few old proofs.
6696 * ZF/Update: new theory of function updates
6697 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6698 may also be iterated as in f(a:=b,c:=d,...);
6700 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6702 * calling (stac rew i) now fails if "rew" has no effect on the goal
6703 [previously, this check worked only if the rewrite rule was unconditional]
6704 Now rew can involve either definitions or equalities (either == or =).
6706 * case_tac provided for compatibility with HOL
6707 (like the old excluded_middle_tac, but with subgoals swapped)
6710 *** Internal programming interfaces ***
6712 * Pure: several new basic modules made available for general use, see
6713 also src/Pure/README;
6715 * improved the theory data mechanism to support encapsulation (data
6716 kind name replaced by private Object.kind, acting as authorization
6717 key); new type-safe user interface via functor TheoryDataFun; generic
6718 print_data function becomes basically useless;
6720 * removed global_names compatibility flag -- all theory declarations
6721 are qualified by default;
6723 * module Pure/Syntax now offers quote / antiquote translation
6724 functions (useful for Hoare logic etc. with implicit dependencies);
6725 see HOL/ex/Antiquote for an example use;
6727 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6730 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6733 * Display.print_goals function moved to Locale.print_goals;
6735 * standard print function for goals supports current_goals_markers
6736 variable for marking begin of proof, end of proof, start of goal; the
6737 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6738 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6743 New in Isabelle98 (January 1998)
6744 --------------------------------
6746 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6748 * changed lexical syntax of terms / types: dots made part of long
6749 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6751 * simpset (and claset) reference variable replaced by functions
6752 simpset / simpset_ref;
6754 * no longer supports theory aliases (via merge) and non-trivial
6755 implicit merge of thms' signatures;
6757 * most internal names of constants changed due to qualified names;
6759 * changed Pure/Sequence interface (see Pure/seq.ML);
6762 *** General Changes ***
6764 * hierachically structured name spaces (for consts, types, axms, thms
6765 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6766 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6767 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6768 long_names for fully qualified output names; NOTE: ML programs
6769 (special tactics, packages etc.) referring to internal names may have
6770 to be adapted to cope with fully qualified names; in case of severe
6771 backward campatibility problems try setting 'global_names' at compile
6772 time to have enrything declared within a flat name space; one may also
6773 fine tune name declarations in theories via the 'global' and 'local'
6776 * reimplemented the implicit simpset and claset using the new anytype
6777 data filed in signatures; references simpset:simpset ref etc. are
6778 replaced by functions simpset:unit->simpset and
6779 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6780 to patch your ML files accordingly;
6782 * HTML output now includes theory graph data for display with Java
6783 applet or isatool browser; data generated automatically via isatool
6784 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6786 * defs may now be conditional; improved rewrite_goals_tac to handle
6787 conditional equations;
6789 * defs now admits additional type arguments, using TYPE('a) syntax;
6791 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6792 creates a new theory node; implicit merge of thms' signatures is
6793 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6794 transfer:theory->thm->thm in (rare) cases;
6796 * improved handling of draft signatures / theories; draft thms (and
6797 ctyps, cterms) are automatically promoted to real ones;
6799 * slightly changed interfaces for oracles: admit many per theory, named
6800 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6802 * print_goals: optional output of const types (set show_consts and
6805 * improved output of warnings (###) and errors (***);
6807 * subgoal_tac displays a warning if the new subgoal has type variables;
6809 * removed old README and Makefiles;
6811 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6813 * removed obsolete init_pps and init_database;
6815 * deleted the obsolete tactical STATE, which was declared by
6816 fun STATE tacfun st = tacfun st st;
6818 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6819 (which abbreviates $HOME);
6821 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6822 use isatool fixseq to adapt your ML programs (this works for fully
6823 qualified references to the Sequence structure only!);
6825 * use_thy no longer requires writable current directory; it always
6826 reloads .ML *and* .thy file, if either one is out of date;
6829 *** Classical Reasoner ***
6831 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6832 tactics that use classical reasoning to simplify a subgoal without
6833 splitting it into several subgoals;
6835 * Safe_tac: like safe_tac but uses the default claset;
6840 * added simplification meta rules:
6841 (asm_)(full_)simplify: simpset -> thm -> thm;
6843 * simplifier.ML no longer part of Pure -- has to be loaded by object
6846 * added prems argument to simplification procedures;
6848 * HOL, FOL, ZF: added infix function `addsplits':
6849 instead of `<simpset> setloop (split_tac <thms>)'
6850 you can simply write `<simpset> addsplits <thms>'
6855 * TYPE('a) syntax for type reflection terms;
6857 * no longer handles consts with name "" -- declare as 'syntax' instead;
6859 * pretty printer: changed order of mixfix annotation preference (again!);
6861 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6866 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6867 with `addloop' of the simplifier to faciliate case splitting in premises.
6869 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6871 * HOL/Auth: new protocol proofs including some for the Internet
6874 * HOL/Map: new theory of `maps' a la VDM;
6876 * HOL/simplifier: simplification procedures nat_cancel_sums for
6877 cancelling out common nat summands from =, <, <= (in)equalities, or
6878 differences; simplification procedures nat_cancel_factor for
6879 cancelling common factor from =, <, <= (in)equalities over natural
6880 sums; nat_cancel contains both kinds of procedures, it is installed by
6881 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6883 * HOL/simplifier: terms of the form
6884 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6886 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6887 and those of the form
6888 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6890 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6893 Each datatype `t' now comes with a theorem `split_t_case' of the form
6895 P(t_case f1 ... fn x) =
6896 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6898 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6901 and a theorem `split_t_case_asm' of the form
6903 P(t_case f1 ... fn x) =
6904 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6906 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6908 which can be added to a simpset via `addsplits'. The existing theorems
6909 expand_list_case and expand_option_case have been renamed to
6910 split_list_case and split_option_case.
6913 - `pred n' is automatically converted to `n-1'.
6914 Users are strongly encouraged not to use `pred' any longer,
6915 because it will disappear altogether at some point.
6916 - Users are strongly encouraged to write "0 < n" rather than
6917 "n ~= 0". Theorems and proof tools have been modified towards this
6921 the function "set_of_list" has been renamed "set" (and its theorems too);
6922 the function "nth" now takes its arguments in the reverse order and
6923 has acquired the infix notation "!" as in "xs!n".
6925 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6927 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6928 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6930 * HOL/record: extensible records with schematic structural subtyping
6931 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6932 still lacks various theorems and concrete record syntax;
6937 * removed "axioms" and "generated by" sections;
6939 * replaced "ops" section by extended "consts" section, which is capable of
6940 handling the continuous function space "->" directly;
6943 . proves theorems immediately and stores them in the theory,
6944 . creates hierachical name space,
6945 . now uses normal mixfix annotations (instead of cinfix...),
6946 . minor changes to some names and values (for consistency),
6947 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6948 . separator between mutual domain defs: changed "," to "and",
6949 . improved handling of sort constraints; now they have to
6950 appear on the left-hand side of the equations only;
6952 * fixed LAM <x,y,zs>.b syntax;
6954 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6955 adm (%x. P (t x)), where P is chainfinite and t continuous;
6960 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6961 with `addloop' of the simplifier to faciliate case splitting in premises.
6963 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6964 in HOL, they strip ALL and --> from proved theorems;
6968 New in Isabelle94-8 (May 1997)
6969 ------------------------------
6971 *** General Changes ***
6973 * new utilities to build / run / maintain Isabelle etc. (in parts
6974 still somewhat experimental); old Makefiles etc. still functional;
6976 * new 'Isabelle System Manual';
6978 * INSTALL text, together with ./configure and ./build scripts;
6980 * reimplemented type inference for greater efficiency, better error
6981 messages and clean internal interface;
6983 * prlim command for dealing with lots of subgoals (an easier way of
6984 setting goals_limit);
6989 * supports alternative (named) syntax tables (parser and pretty
6990 printer); internal interface is provided by add_modesyntax(_i);
6992 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6993 be used in conjunction with the Isabelle symbol font; uses the
6994 "symbols" syntax table;
6996 * added token_translation interface (may translate name tokens in
6997 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6998 the current print_mode); IMPORTANT: user print translation functions
6999 are responsible for marking newly introduced bounds
7000 (Syntax.mark_boundT);
7002 * token translations for modes "xterm" and "xterm_color" that display
7003 names in bold, underline etc. or colors (which requires a color
7006 * infixes may now be declared with names independent of their syntax;
7008 * added typed_print_translation (like print_translation, but may
7009 access type of constant);
7012 *** Classical Reasoner ***
7014 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7015 some limitations. Blast_tac...
7016 + ignores addss, addbefore, addafter; this restriction is intrinsic
7017 + ignores elimination rules that don't have the correct format
7018 (the conclusion MUST be a formula variable)
7019 + ignores types, which can make HOL proofs fail
7020 + rules must not require higher-order unification, e.g. apply_type in ZF
7021 [message "Function Var's argument not a bound variable" relates to this]
7022 + its proof strategy is more general but can actually be slower
7024 * substitution with equality assumptions no longer permutes other
7027 * minor changes in semantics of addafter (now called addaltern); renamed
7028 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7029 (and access functions for it);
7031 * improved combination of classical reasoner and simplifier:
7032 + functions for handling clasimpsets
7033 + improvement of addss: now the simplifier is called _after_ the
7035 + safe variant of addss called addSss: uses safe simplifications
7036 _during_ the safe steps. It is more complete as it allows multiple
7037 instantiations of unknowns (e.g. with slow_tac).
7041 * added interface for simplification procedures (functions that
7042 produce *proven* rewrite rules on the fly, depending on current
7045 * ordering on terms as parameter (used for ordered rewriting);
7047 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7049 * the solver is now split into a safe and an unsafe part.
7050 This should be invisible for the normal user, except that the
7051 functions setsolver and addsolver have been renamed to setSolver and
7052 addSolver; added safe_asm_full_simp_tac;
7057 * a generic induction tactic `induct_tac' which works for all datatypes and
7058 also for type `nat';
7060 * a generic case distinction tactic `exhaust_tac' which works for all
7061 datatypes and also for type `nat';
7063 * each datatype comes with a function `size';
7065 * patterns in case expressions allow tuple patterns as arguments to
7066 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7068 * primrec now also works with type nat;
7070 * recdef: a new declaration form, allows general recursive functions to be
7071 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7073 * the constant for negation has been renamed from "not" to "Not" to
7074 harmonize with FOL, ZF, LK, etc.;
7076 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7079 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7081 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7082 problems in commutative rings, using axiomatic type classes for + and *;
7084 * more examples in HOL/MiniML and HOL/Auth;
7086 * more default rewrite rules for quantifiers, union/intersection;
7088 * a new constant `arbitrary == @x.False';
7090 * HOLCF/IOA replaces old HOL/IOA;
7092 * HOLCF changes: derived all rules and arities
7093 + axiomatic type classes instead of classes
7094 + typedef instead of faking type definitions
7095 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7096 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7097 + eliminated the types void, one, tr
7098 + use unit lift and bool lift (with translations) instead of one and tr
7099 + eliminated blift from Lift3.thy (use Def instead of blift)
7100 all eliminated rules are derived as theorems --> no visible changes ;
7105 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7106 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7107 as ZF_cs addSIs [equalityI];
7111 New in Isabelle94-7 (November 96)
7112 ---------------------------------
7114 * allowing negative levels (as offsets) in prlev and choplev;
7116 * super-linear speedup for large simplifications;
7118 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7119 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7120 FAIL); can suppress it using the command Delsimps (ex_simps @
7121 all_simps); De Morgan laws are also now included, by default;
7123 * improved printing of ==> : ~:
7125 * new object-logic "Sequents" adds linear logic, while replacing LK
7126 and Modal (thanks to Sara Kalvala);
7128 * HOL/Auth: correctness proofs for authentication protocols;
7130 * HOL: new auto_tac combines rewriting and classical reasoning (many
7131 examples on HOL/Auth);
7133 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7134 the rewriter and classical reasoner simultaneously;
7136 * function uresult no longer returns theorems in "standard" format;
7137 regain previous version by: val uresult = standard o uresult;
7144 * oracles -- these establish an interface between Isabelle and trusted
7145 external reasoners, which may deliver results as theorems;
7147 * proof objects (in particular record all uses of oracles);
7149 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7151 * "constdefs" section in theory files;
7153 * "primrec" section (HOL) no longer requires names;
7155 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7162 * reduced space requirements;
7164 * automatic HTML generation from theories;
7166 * theory files no longer require "..." (quotes) around most types;
7168 * new examples, including two proofs of the Church-Rosser theorem;
7170 * non-curried (1994) version of HOL is no longer distributed;
7177 * greatly reduced space requirements;
7179 * theory files (.thy) no longer require \...\ escapes at line breaks;
7181 * searchable theorem database (see the section "Retrieving theorems" on
7182 page 8 of the Reference Manual);
7184 * new examples, including Grabczewski's monumental case study of the
7187 * The previous version of HOL renamed to Old_HOL;
7189 * The new version of HOL (previously called CHOL) uses a curried syntax
7190 for functions. Application looks like f a b instead of f(a,b);
7192 * Mutually recursive inductive definitions finally work in HOL;
7194 * In ZF, pattern-matching on tuples is now available in all abstractions and
7195 translates to the operator "split";
7202 * new infix operator, addss, allowing the classical reasoner to
7203 perform simplification at each step of its search. Example:
7204 fast_tac (cs addss ss)
7206 * a new logic, CHOL, the same as HOL, but with a curried syntax
7207 for functions. Application looks like f a b instead of f(a,b). Also pairs
7208 look like (a,b) instead of <a,b>;
7210 * PLEASE NOTE: CHOL will eventually replace HOL!
7212 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7213 It translates to the operator "split". A new theory of integers is available;
7215 * In ZF, integer numerals now denote two's-complement binary integers.
7216 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7218 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7219 of the Axiom of Choice;
7226 * Significantly faster resolution;
7228 * the different sections in a .thy file can now be mixed and repeated
7231 * Database of theorems for FOL, HOL and ZF. New
7232 commands including qed, qed_goal and bind_thm store theorems in the database.
7234 * Simple database queries: return a named theorem (get_thm) or all theorems of
7235 a given theory (thms_of), or find out what theory a theorem was proved in
7238 * Bugs fixed in the inductive definition and datatype packages;
7240 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7241 and HOL_dup_cs obsolete;
7243 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7246 * Simpler definition of function space in ZF;
7248 * new results about cardinal and ordinal arithmetic in ZF;
7250 * 'subtype' facility in HOL for introducing new types as subsets of existing
7253 :mode=text:wrap=hard:maxLineLen=72: