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 * Proof terms: Type substitutions on proof constants now use canonical
143 order of type variables. INCOMPATIBILITY for tools working with proof
146 * New operation Thm.unconstrainT eliminates all sort constraints from
147 a theorem and proof, introducing explicit OFCLASS-premises. On the
148 proof term level, this operation is automatically applied at PThm
149 boundaries, such that closed proofs are always free of sort
150 constraints. The old (axiomatic) unconstrain operation has been
151 discontinued. INCOMPATIBILITY for tools working with proof terms.
156 * List membership infix mem operation is only an input abbreviation.
159 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
160 for future developements; former Library/Word.thy is still present in
161 the AFP entry RSAPPS.
163 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
164 longer shadowed. INCOMPATIBILITY.
166 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
169 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
172 * Dropped normalizing_semiring etc; use the facts in semiring classes
173 instead. INCOMPATIBILITY.
175 * Dropped several real-specific versions of lemmas about floor and
176 ceiling; use the generic lemmas from Archimedean_Field.thy instead.
179 floor_number_of_eq ~> floor_number_of
180 le_floor_eq_number_of ~> number_of_le_floor
181 le_floor_eq_zero ~> zero_le_floor
182 le_floor_eq_one ~> one_le_floor
183 floor_less_eq_number_of ~> floor_less_number_of
184 floor_less_eq_zero ~> floor_less_zero
185 floor_less_eq_one ~> floor_less_one
186 less_floor_eq_number_of ~> number_of_less_floor
187 less_floor_eq_zero ~> zero_less_floor
188 less_floor_eq_one ~> one_less_floor
189 floor_le_eq_number_of ~> floor_le_number_of
190 floor_le_eq_zero ~> floor_le_zero
191 floor_le_eq_one ~> floor_le_one
192 floor_subtract_number_of ~> floor_diff_number_of
193 floor_subtract_one ~> floor_diff_one
194 ceiling_number_of_eq ~> ceiling_number_of
195 ceiling_le_eq_number_of ~> ceiling_le_number_of
196 ceiling_le_zero_eq ~> ceiling_le_zero
197 ceiling_le_eq_one ~> ceiling_le_one
198 less_ceiling_eq_number_of ~> number_of_less_ceiling
199 less_ceiling_eq_zero ~> zero_less_ceiling
200 less_ceiling_eq_one ~> one_less_ceiling
201 ceiling_less_eq_number_of ~> ceiling_less_number_of
202 ceiling_less_eq_zero ~> ceiling_less_zero
203 ceiling_less_eq_one ~> ceiling_less_one
204 le_ceiling_eq_number_of ~> number_of_le_ceiling
205 le_ceiling_eq_zero ~> zero_le_ceiling
206 le_ceiling_eq_one ~> one_le_ceiling
207 ceiling_subtract_number_of ~> ceiling_diff_number_of
208 ceiling_subtract_one ~> ceiling_diff_one
210 * Theory "Finite_Set": various folding_XXX locales facilitate the
211 application of the various fold combinators on finite sets.
213 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
214 provides abstract red-black tree type which is backed by "RBT_Impl" as
215 implementation. INCOMPATIBILTY.
217 * Command 'typedef' now works within a local theory context -- without
218 introducing dependencies on parameters or assumptions, which is not
219 possible in Isabelle/Pure/HOL. Note that the logical environment may
220 contain multiple interpretations of local typedefs (with different
221 non-emptiness proofs), even in a global theory context.
223 * Theory Library/Coinductive_List has been removed -- superseded by
224 AFP/thys/Coinductive.
226 * Theory PReal, including the type "preal" and related operations, has
227 been removed. INCOMPATIBILITY.
229 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
230 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
232 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
233 "Int" etc. INCOMPATIBILITY.
235 * Constant Rat.normalize needs to be qualified. Minor
238 * New set of rules "ac_simps" provides combined assoc / commute
239 rewrites for all interpretations of the appropriate generic locales.
241 * Renamed theory "OrderedGroup" to "Groups" and split theory
242 "Ring_and_Field" into theories "Rings" and "Fields"; for more
243 appropriate and more consistent names suitable for name prefixes
244 within the HOL theories. INCOMPATIBILITY.
246 * Some generic constants have been put to appropriate theories:
247 - less_eq, less: Orderings
248 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
249 - inverse, divide: Rings
252 * More consistent naming of type classes involving orderings (and
255 lower_semilattice ~> semilattice_inf
256 upper_semilattice ~> semilattice_sup
258 dense_linear_order ~> dense_linorder
260 pordered_ab_group_add ~> ordered_ab_group_add
261 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
262 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
263 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
264 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
265 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
266 pordered_cancel_semiring ~> ordered_cancel_semiring
267 pordered_comm_monoid_add ~> ordered_comm_monoid_add
268 pordered_comm_ring ~> ordered_comm_ring
269 pordered_comm_semiring ~> ordered_comm_semiring
270 pordered_ring ~> ordered_ring
271 pordered_ring_abs ~> ordered_ring_abs
272 pordered_semiring ~> ordered_semiring
274 ordered_ab_group_add ~> linordered_ab_group_add
275 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
276 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
277 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
278 ordered_field ~> linordered_field
279 ordered_field_no_lb ~> linordered_field_no_lb
280 ordered_field_no_ub ~> linordered_field_no_ub
281 ordered_field_dense_linear_order ~> dense_linordered_field
282 ordered_idom ~> linordered_idom
283 ordered_ring ~> linordered_ring
284 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
285 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
286 ordered_ring_strict ~> linordered_ring_strict
287 ordered_semidom ~> linordered_semidom
288 ordered_semiring ~> linordered_semiring
289 ordered_semiring_1 ~> linordered_semiring_1
290 ordered_semiring_1_strict ~> linordered_semiring_1_strict
291 ordered_semiring_strict ~> linordered_semiring_strict
293 The following slightly odd type classes have been moved to a
294 separate theory Library/Lattice_Algebras.thy:
296 lordered_ab_group_add ~> lattice_ab_group_add
297 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
298 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
299 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
300 lordered_ring ~> lattice_ring
304 * Refined field classes:
305 - classes division_ring_inverse_zero, field_inverse_zero,
306 linordered_field_inverse_zero include rule inverse 0 = 0 --
307 subsumes former division_by_zero class;
308 - numerous lemmas have been ported from field to division_ring.
311 * Refined algebra theorem collections:
312 - dropped theorem group group_simps, use algebra_simps instead;
313 - dropped theorem group ring_simps, use field_simps instead;
314 - proper theorem collection field_simps subsumes former theorem
315 groups field_eq_simps and field_simps;
316 - dropped lemma eq_minus_self_iff which is a duplicate for
320 * Theory Finite_Set and List: some lemmas have been generalized from
323 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
324 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
325 inter_Inter_fold_inter ~> inf_Inf_fold_inf
326 union_Union_fold_union ~> sup_Sup_fold_sup
327 Inter_fold_inter ~> Inf_fold_inf
328 Union_fold_union ~> Sup_fold_sup
329 inter_INTER_fold_inter ~> inf_INFI_fold_inf
330 union_UNION_fold_union ~> sup_SUPR_fold_sup
331 INTER_fold_inter ~> INFI_fold_inf
332 UNION_fold_union ~> SUPR_fold_sup
334 * Theory Complete_Lattice: lemmas top_def and bot_def have been
335 replaced by the more convenient lemmas Inf_empty and Sup_empty.
336 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
337 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
338 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
339 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
341 * HOLogic.strip_psplit: types are returned in syntactic order, similar
342 to other strip and tuple operations. INCOMPATIBILITY.
344 * Reorganized theory Multiset: swapped notation of pointwise and
346 - pointwise ordering is instance of class order with standard syntax
348 - multiset ordering has syntax <=# and <#; partial order properties
349 are provided by means of interpretation with prefix
351 - less duplication, less historical organization of sections,
352 conversion from associations lists to multisets, rudimentary code
354 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
357 multiset_eq_conv_count_eq -> multiset_ext_iff
358 multi_count_ext -> multiset_ext
359 diff_union_inverse2 -> diff_union_cancelR
362 * Theory Permutation: replaced local "remove" by List.remove1.
364 * Code generation: ML and OCaml code is decorated with signatures.
366 * Theory List: added transpose.
368 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
369 clash with new theory Quotient in Main HOL.
371 * Library/Nat_Bijection.thy is a collection of bijective functions
372 between nat and other types, which supersedes the older libraries
373 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
376 Nat_Int_Bij.nat2_to_nat ~> prod_encode
377 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
378 Nat_Int_Bij.int_to_nat_bij ~> int_encode
379 Nat_Int_Bij.nat_to_int_bij ~> int_decode
380 Countable.pair_encode ~> prod_encode
381 NatIso.prod2nat ~> prod_encode
382 NatIso.nat2prod ~> prod_decode
383 NatIso.sum2nat ~> sum_encode
384 NatIso.nat2sum ~> sum_decode
385 NatIso.list2nat ~> list_encode
386 NatIso.nat2list ~> list_decode
387 NatIso.set2nat ~> set_encode
388 NatIso.nat2set ~> set_decode
391 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
392 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
393 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
394 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
395 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
396 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
397 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
398 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
399 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
400 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
401 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
402 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
403 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
406 - Renamed ATP commands:
407 atp_info ~> sledgehammer running_atps
408 atp_kill ~> sledgehammer kill_atps
409 atp_messages ~> sledgehammer messages
410 atp_minimize ~> sledgehammer minimize
411 print_atps ~> sledgehammer available_atps
413 - Added user's manual ("isabelle doc sledgehammer").
414 - Added option syntax and "sledgehammer_params" to customize
415 Sledgehammer's behavior. See the manual for details.
416 - Modified the Isar proof reconstruction code so that it produces
417 direct proofs rather than proofs by contradiction. (This feature
418 is still experimental.)
419 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
421 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
424 - Added and implemented "binary_ints" and "bits" options.
425 - Added "std" option and implemented support for nonstandard models.
426 - Added and implemented "finitize" option to improve the precision
427 of infinite datatypes based on a monotonicity analysis.
428 - Added support for quotient types.
429 - Added support for "specification" and "ax_specification"
431 - Added support for local definitions (for "function" and
432 "termination" proofs).
433 - Added support for term postprocessors.
434 - Optimized "Multiset.multiset" and "FinFun.finfun".
435 - Improved efficiency of "destroy_constrs" optimization.
436 - Fixed soundness bugs related to "destroy_constrs" optimization and
438 - Fixed soundness bug related to higher-order constructors.
439 - Fixed soundness bug when "full_descrs" is enabled.
440 - Improved precision of set constructs.
441 - Added "atoms" option.
442 - Added cache to speed up repeated Kodkod invocations on the same
444 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
445 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
446 "SAT4J_Light". INCOMPATIBILITY.
447 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
448 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
449 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
451 * Moved the SMT binding into the HOL image.
456 * Variable names in lemmas generated by the domain package have
457 changed; the naming scheme is now consistent with the HOL datatype
458 package. Some proof scripts may be affected, INCOMPATIBILITY.
460 * The domain package no longer defines the function "foo_copy" for
461 recursive domain "foo". The reach lemma is now stated directly in
462 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
463 be reformulated in terms of "foo_take", INCOMPATIBILITY.
465 * Most definedness lemmas generated by the domain package (previously
466 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
467 like "foo$x = UU <-> x = UU", which works better as a simp rule.
468 Proof scripts that used definedness lemmas as intro rules may break,
469 potential INCOMPATIBILITY.
471 * Induction and casedist rules generated by the domain package now
472 declare proper case_names (one called "bottom", and one named for each
473 constructor). INCOMPATIBILITY.
475 * For mutually-recursive domains, separate "reach" and "take_lemma"
476 rules are generated for each domain, INCOMPATIBILITY.
478 foo_bar.reach ~> foo.reach bar.reach
479 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
481 * Some lemmas generated by the domain package have been renamed for
482 consistency with the datatype package, INCOMPATIBILITY.
484 foo.ind ~> foo.induct
485 foo.finite_ind ~> foo.finite_induct
486 foo.coind ~> foo.coinduct
487 foo.casedist ~> foo.exhaust
488 foo.exhaust ~> foo.nchotomy
490 * For consistency with other definition packages, the fixrec package
491 now generates qualified theorem names, INCOMPATIBILITY.
493 foo_simps ~> foo.simps
494 foo_unfold ~> foo.unfold
495 foo_induct ~> foo.induct
497 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
498 method and internal fixrec proofs now use the default simpset instead.
501 * The "contlub" predicate has been removed. Proof scripts should use
502 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
504 * The "admw" predicate has been removed, INCOMPATIBILITY.
506 * The constants cpair, cfst, and csnd have been removed in favor of
507 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
512 * Renamed some important ML structures, while keeping the old names
513 for some time as aliases within the structure Legacy:
515 OuterKeyword ~> Keyword
518 OuterSyntax ~> Outer_Syntax
519 PrintMode ~> Print_Mode
520 SpecParse ~> Parse_Spec
523 ThyOutput ~> Thy_Output
524 TypeInfer ~> Type_Infer
526 Note that "open Legacy" simplifies porting of sources, but forgetting
527 to remove it again will complicate porting again in the future.
529 * Most operations that refer to a global context are named
530 accordingly, e.g. Simplifier.global_context or
531 ProofContext.init_global. There are some situations where a global
532 context actually works, but under normal circumstances one needs to
533 pass the proper local context through the code!
535 * Discontinued old TheoryDataFun with its copy/init operation -- data
536 needs to be pure. Functor Theory_Data_PP retains the traditional
537 Pretty.pp argument to merge, which is absent in the standard
540 * Antiquotations for basic formal entities:
542 @{class NAME} -- type class
543 @{class_syntax NAME} -- syntax representation of the above
545 @{type_name NAME} -- logical type
546 @{type_abbrev NAME} -- type abbreviation
547 @{nonterminal NAME} -- type of concrete syntactic category
548 @{type_syntax NAME} -- syntax representation of any of the above
550 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
551 @{const_abbrev NAME} -- abbreviated constant
552 @{const_syntax NAME} -- syntax representation of any of the above
554 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
555 syntax constant (cf. 'syntax' command).
557 * Antiquotation @{make_string} inlines a function to print arbitrary
558 values similar to the ML toplevel. The result is compiler dependent
559 and may fall back on "?" in certain situations.
561 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
562 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
563 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
564 not work with the asynchronous Isar document model.
566 * Sorts.certify_sort and derived "cert" operations for types and terms
567 no longer minimize sorts. Thus certification at the boundary of the
568 inference kernel becomes invariant under addition of class relations,
569 which is an important monotonicity principle. Sorts are now minimized
570 in the syntax layer only, at the boundary between the end-user and the
571 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
572 explicitly in rare situations.
574 * Renamed old-style Drule.standard to Drule.export_without_context, to
575 emphasize that this is in no way a standard operation.
578 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
579 usual for resolution. Rare INCOMPATIBILITY.
581 * Renamed varify/unvarify operations to varify_global/unvarify_global
582 to emphasize that these only work in a global situation (which is
585 * Configuration options now admit dynamic default values, depending on
586 the context or even global references.
588 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
589 uses an efficient external library if available (for Poly/ML).
591 * Curried take and drop in library.ML; negative length is interpreted
592 as infinity (as in chop). Subtle INCOMPATIBILITY.
597 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
598 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
599 proof terms are enabled unconditionally in the new HOL-Proofs image.
601 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
602 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
605 * Old lib/scripts/polyml-platform is superseded by the
606 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
607 variant, even on a 64 bit machine. The following example setting
608 prefers 64 bit if available:
610 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
612 * The preliminary Isabelle/jEdit application demonstrates the emerging
613 Isabelle/Scala layer for advanced prover interaction and integration.
614 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
619 New in Isabelle2009-1 (December 2009)
620 -------------------------------------
624 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
625 one backslash should be used, even in ML sources.
630 * Locale interpretation propagates mixins along the locale hierarchy.
631 The currently only available mixins are the equations used to map
632 local definitions to terms of the target domain of an interpretation.
634 * Reactivated diagnostic command 'print_interps'. Use "print_interps
635 loc" to print all interpretations of locale "loc" in the theory.
636 Interpretations in proofs are not shown.
638 * Thoroughly revised locales tutorial. New section on conditional
641 * On instantiation of classes, remaining undefined class parameters
642 are formally declared. INCOMPATIBILITY.
645 *** Document preparation ***
647 * New generalized style concept for printing terms: @{foo (style) ...}
648 instead of @{foo_style style ...} (old form is still retained for
649 backward compatibility). Styles can be also applied for
650 antiquotations prop, term_type and typeof.
655 * New proof method "smt" for a combination of first-order logic with
656 equality, linear and nonlinear (natural/integer/real) arithmetic, and
657 fixed-size bitvectors; there is also basic support for higher-order
658 features (esp. lambda abstractions). It is an incomplete decision
659 procedure based on external SMT solvers using the oracle mechanism;
660 for the SMT solver Z3, this method is proof-producing. Certificates
661 are provided to avoid calling the external solvers solely for
662 re-checking proofs. Due to a remote SMT service there is no need for
663 installing SMT solvers locally. See src/HOL/SMT.
665 * New commands to load and prove verification conditions generated by
666 the Boogie program verifier or derived systems (e.g. the Verifying C
667 Compiler (VCC) or Spec#). See src/HOL/Boogie.
669 * New counterexample generator tool 'nitpick' based on the Kodkod
670 relational model finder. See src/HOL/Tools/Nitpick and
671 src/HOL/Nitpick_Examples.
673 * New commands 'code_pred' and 'values' to invoke the predicate
674 compiler and to enumerate values of inductive predicates.
676 * A tabled implementation of the reflexive transitive closure.
678 * New implementation of quickcheck uses generic code generator;
679 default generators are provided for all suitable HOL types, records
680 and datatypes. Old quickcheck can be re-activated importing theory
681 Library/SML_Quickcheck.
683 * New testing tool Mirabelle for automated proof tools. Applies
684 several tools and tactics like sledgehammer, metis, or quickcheck, to
685 every proof step in a theory. To be used in batch mode via the
688 * New proof method "sos" (sum of squares) for nonlinear real
689 arithmetic (originally due to John Harison). It requires theory
690 Library/Sum_Of_Squares. It is not a complete decision procedure but
691 works well in practice on quantifier-free real arithmetic with +, -,
692 *, ^, =, <= and <, i.e. boolean combinations of equalities and
693 inequalities between polynomials. It makes use of external
694 semidefinite programming solvers. Method "sos" generates a
695 certificate that can be pasted into the proof thus avoiding the need
696 to call an external tool every time the proof is checked. See
697 src/HOL/Library/Sum_Of_Squares.
699 * New method "linarith" invokes existing linear arithmetic decision
702 * New command 'atp_minimal' reduces result produced by Sledgehammer.
704 * New Sledgehammer option "Full Types" in Proof General settings menu.
705 Causes full type information to be output to the ATPs. This slows
706 ATPs down considerably but eliminates a source of unsound "proofs"
709 * New method "metisFT": A version of metis that uses full type
710 information in order to avoid failures of proof reconstruction.
712 * New evaluator "approximate" approximates an real valued term using
713 the same method as the approximation method.
715 * Method "approximate" now supports arithmetic expressions as
716 boundaries of intervals and implements interval splitting and Taylor
719 * ML antiquotation @{code_datatype} inserts definition of a datatype
720 generated by the code generator; e.g. see src/HOL/Predicate.thy.
722 * New theory SupInf of the supremum and infimum operators for sets of
725 * New theory Probability, which contains a development of measure
726 theory, eventually leading to Lebesgue integration and probability.
728 * Extended Multivariate Analysis to include derivation and Brouwer's
731 * Reorganization of number theory, INCOMPATIBILITY:
732 - new number theory development for nat and int, in theories Divides
733 and GCD as well as in new session Number_Theory
734 - some constants and facts now suffixed with _nat and _int
736 - former session NumberTheory now named Old_Number_Theory, including
737 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
738 - moved theory Pocklington from src/HOL/Library to
739 src/HOL/Old_Number_Theory
741 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
742 lcm of finite and infinite sets. It is shown that they form a complete
745 * Class semiring_div requires superclass no_zero_divisors and proof of
746 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
747 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
748 generalized to class semiring_div, subsuming former theorems
749 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
750 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
753 * Refinements to lattice classes and sets:
754 - less default intro/elim rules in locale variant, more default
755 intro/elim rules in class variant: more uniformity
756 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
758 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
760 - renamed ACI to inf_sup_aci
761 - new class "boolean_algebra"
762 - class "complete_lattice" moved to separate theory
763 "Complete_Lattice"; corresponding constants (and abbreviations)
764 renamed and with authentic syntax:
765 Set.Inf ~> Complete_Lattice.Inf
766 Set.Sup ~> Complete_Lattice.Sup
767 Set.INFI ~> Complete_Lattice.INFI
768 Set.SUPR ~> Complete_Lattice.SUPR
769 Set.Inter ~> Complete_Lattice.Inter
770 Set.Union ~> Complete_Lattice.Union
771 Set.INTER ~> Complete_Lattice.INTER
772 Set.UNION ~> Complete_Lattice.UNION
773 - authentic syntax for
776 - mere abbreviations:
779 Set.inter (for inf, formerly Set.Int)
780 Set.union (for sup, formerly Set.Un)
781 Complete_Lattice.Inter (for Inf)
782 Complete_Lattice.Union (for Sup)
783 Complete_Lattice.INTER (for INFI)
784 Complete_Lattice.UNION (for SUPR)
785 - object-logic definitions as far as appropriate
787 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
788 Un_subset_iff are explicitly deleted as default simp rules; then also
789 their lattice counterparts le_inf_iff and le_sup_iff have to be
790 deleted to achieve the desired effect.
792 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
793 rules by default any longer; the same applies to min_max.inf_absorb1
794 etc. INCOMPATIBILITY.
796 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
797 pred_set_conv by default. INCOMPATIBILITY.
799 * Power operations on relations and functions are now one dedicated
800 constant "compow" with infix syntax "^^". Power operation on
801 multiplicative monoids retains syntax "^" and is now defined generic
802 in class power. INCOMPATIBILITY.
804 * Relation composition "R O S" now has a more standard argument order:
805 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
806 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
807 break, since the O_assoc rule was not rewritten like this. Fix using
808 O_assoc[symmetric]. The same applies to the curried version "R OO S".
810 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
811 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
814 * Most rules produced by inductive and datatype package have mandatory
815 prefixes. INCOMPATIBILITY.
817 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
818 the attribute of the same name. Each of the theorems in the list
819 DERIV_intros assumes composition with an additional function and
820 matches a variable to the derivative, which has to be solved by the
821 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
822 of most elementary terms. Former Maclauren.DERIV_tac and
823 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
826 * Code generator attributes follow the usual underscore convention:
827 code_unfold replaces code unfold
828 code_post replaces code post
833 sizechange -> size_change
834 induct_scheme -> induction_schema
837 * Discontinued abbreviation "arbitrary" of constant "undefined".
838 INCOMPATIBILITY, use "undefined" directly.
841 Suc_eq_add_numeral_1 -> Suc_eq_plus1
842 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
843 Suc_plus1 -> Suc_eq_plus1
844 *anti_sym -> *antisym*
845 vector_less_eq_def -> vector_le_def
848 * Added theorem List.map_map as [simp]. Removed List.map_compose.
851 * Removed predicate "M hassize n" (<--> card M = n & finite M).
857 * Theory Representable defines a class "rep" of domains that are
858 representable (via an ep-pair) in the universal domain type "udom".
859 Instances are provided for all type constructors defined in HOLCF.
861 * The 'new_domain' command is a purely definitional version of the
862 domain package, for representable domains. Syntax is identical to the
863 old domain package. The 'new_domain' package also supports indirect
864 recursion using previously-defined type constructors. See
865 src/HOLCF/ex/New_Domain.thy for examples.
867 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
868 on the left-hand side of an equation, and then performs
869 simplification. Rewriting is done using rules declared with the
870 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
871 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
873 * The pattern-match compiler in 'fixrec' can now handle constructors
874 with HOL function types. Pattern-match combinators for the Pair
875 constructor are pre-configured.
877 * The 'fixrec' package now produces better fixed-point induction rules
878 for mutually-recursive definitions: Induction rules have conclusions
879 of the form "P foo bar" instead of "P <foo, bar>".
881 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
882 been renamed to "below". The name "below" now replaces "less" in many
883 theorem names. (Legacy theorem names using "less" are still supported
886 * The 'fixrec' package now supports "bottom patterns". Bottom
887 patterns can be used to generate strictness rules, or to make
888 functions more strict (much like the bang-patterns supported by the
889 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
895 * Support for Poly/ML 5.3.0, with improved reporting of compiler
896 errors and run-time exceptions, including detailed source positions.
898 * Structure Name_Space (formerly NameSpace) now manages uniquely
899 identified entries, with some additional information such as source
900 position, logical grouping etc.
902 * Theory and context data is now introduced by the simplified and
903 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
904 to be pure, but the old TheoryDataFun for mutable data (with explicit
905 copy operation) is still available for some time.
907 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
908 provides a high-level programming interface to synchronized state
909 variables with atomic update. This works via pure function
910 application within a critical section -- its runtime should be as
911 short as possible; beware of deadlocks if critical code is nested,
912 either directly or indirectly via other synchronized variables!
914 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
915 wraps raw ML references, explicitly indicating their non-thread-safe
916 behaviour. The Isar toplevel keeps this structure open, to
917 accommodate Proof General as well as quick and dirty interactive
918 experiments with references.
920 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
921 parallel tactical reasoning.
923 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
924 are similar to SUBPROOF, but are slightly more flexible: only the
925 specified parts of the subgoal are imported into the context, and the
926 body tactic may introduce new subgoals and schematic variables.
928 * Old tactical METAHYPS, which does not observe the proof context, has
929 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
930 or Subgoal.FOCUS etc.
932 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
933 functors have their own ML name space there is no point to mark them
934 separately.) Minor INCOMPATIBILITY.
936 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
938 * Renamed several structures FooBar to Foo_Bar. Occasional,
941 * Operations of structure Skip_Proof no longer require quick_and_dirty
942 mode, which avoids critical setmp.
944 * Eliminated old Attrib.add_attributes, Method.add_methods and related
945 combinators for "args". INCOMPATIBILITY, need to use simplified
946 Attrib/Method.setup introduced in Isabelle2009.
948 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
949 back on global_simpset_of, global_claset_of, global_clasimpset_of as
950 last resort. INCOMPATIBILITY.
952 * Display.pretty_thm now requires a proper context (cf. former
953 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
954 or even Display.pretty_thm_without_context as last resort.
957 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
958 Syntax.pretty_typ/term directly, preferably with proper context
959 instead of global theory.
964 * Further fine tuning of parallel proof checking, scales up to 8 cores
965 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
968 * Support for additional "Isabelle components" via etc/components, see
969 also the system manual.
971 * The isabelle makeall tool now operates on all components with
972 IsaMakefile, not just hardwired "logics".
974 * Removed "compress" option from isabelle-process and isabelle usedir;
975 this is always enabled.
977 * Discontinued support for Poly/ML 4.x versions.
979 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
980 on a given logic image. This requires the lighttpd webserver and is
981 currently supported on Linux only.
985 New in Isabelle2009 (April 2009)
986 --------------------------------
990 * Simplified main Isabelle executables, with less surprises on
991 case-insensitive file-systems (such as Mac OS).
993 - The main Isabelle tool wrapper is now called "isabelle" instead of
996 - The former "isabelle" alias for "isabelle-process" has been
997 removed (should rarely occur to regular users).
999 - The former "isabelle-interface" and its alias "Isabelle" have been
1000 removed (interfaces are now regular Isabelle tools).
1002 Within scripts and make files, the Isabelle environment variables
1003 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1004 respectively. (The latter are still available as legacy feature.)
1006 The old isabelle-interface wrapper could react in confusing ways if
1007 the interface was uninstalled or changed otherwise. Individual
1008 interface tool configuration is now more explicit, see also the
1009 Isabelle system manual. In particular, Proof General is now available
1010 via "isabelle emacs".
1012 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1013 purge installed copies of Isabelle executables and re-run "isabelle
1014 install -p ...", or use symlinks.
1016 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1017 old ~/isabelle, which was slightly non-standard and apt to cause
1018 surprises on case-insensitive file-systems (such as Mac OS).
1020 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1021 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1022 care is required when using older releases of Isabelle. Note that
1023 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1024 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1026 * Proofs of fully specified statements are run in parallel on
1027 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1028 a regular 4-core machine, if the initial heap space is made reasonably
1029 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1031 * The main reference manuals ("isar-ref", "implementation", and
1032 "system") have been updated and extended. Formally checked references
1033 as hyperlinks are now available uniformly.
1038 * Complete re-implementation of locales. INCOMPATIBILITY in several
1039 respects. The most important changes are listed below. See the
1040 Tutorial on Locales ("locales" manual) for details.
1042 - In locale expressions, instantiation replaces renaming. Parameters
1043 must be declared in a for clause. To aid compatibility with previous
1044 parameter inheritance, in locale declarations, parameters that are not
1045 'touched' (instantiation position "_" or omitted) are implicitly added
1046 with their syntax at the beginning of the for clause.
1048 - Syntax from abbreviations and definitions in locales is available in
1049 locale expressions and context elements. The latter is particularly
1050 useful in locale declarations.
1052 - More flexible mechanisms to qualify names generated by locale
1053 expressions. Qualifiers (prefixes) may be specified in locale
1054 expressions, and can be marked as mandatory (syntax: "name!:") or
1055 optional (syntax "name?:"). The default depends for plain "name:"
1056 depends on the situation where a locale expression is used: in
1057 commands 'locale' and 'sublocale' prefixes are optional, in
1058 'interpretation' and 'interpret' prefixes are mandatory. The old
1059 implicit qualifiers derived from the parameter names of a locale are
1060 no longer generated.
1062 - Command "sublocale l < e" replaces "interpretation l < e". The
1063 instantiation clause in "interpretation" and "interpret" (square
1064 brackets) is no longer available. Use locale expressions.
1066 - When converting proof scripts, mandatory qualifiers in
1067 'interpretation' and 'interpret' should be retained by default, even
1068 if this is an INCOMPATIBILITY compared to former behavior. In the
1069 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1070 in locale expressions range over a single locale instance only.
1072 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1073 In existing theorem specifications replace the includes element by the
1074 respective context elements of the included locale, omitting those
1075 that are already present in the theorem specification. Multiple
1076 assume elements of a locale should be replaced by a single one
1077 involving the locale predicate. In the proof body, declarations (most
1078 notably theorems) may be regained by interpreting the respective
1079 locales in the proof context as required (command "interpret").
1081 If using "includes" in replacement of a target solely because the
1082 parameter types in the theorem are not as general as in the target,
1083 consider declaring a new locale with additional type constraints on
1084 the parameters (context element "constrains").
1086 - Discontinued "locale (open)". INCOMPATIBILITY.
1088 - Locale interpretation commands no longer attempt to simplify goal.
1089 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1090 methods intro_locales and unfold_locales to clarify.
1092 - Locale interpretation commands no longer accept interpretation
1093 attributes. INCOMPATIBILITY.
1095 * Class declaration: so-called "base sort" must not be given in import
1096 list any longer, but is inferred from the specification. Particularly
1103 class foo = type + ...
1105 * Class target: global versions of theorems stemming do not carry a
1106 parameter prefix any longer. INCOMPATIBILITY.
1108 * Class 'instance' command no longer accepts attached definitions.
1109 INCOMPATIBILITY, use proper 'instantiation' target instead.
1111 * Recovered hiding of consts, which was accidentally broken in
1112 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1113 makes c inaccessible; consider using ``hide (open) const c'' instead.
1115 * Slightly more coherent Pure syntax, with updated documentation in
1116 isar-ref manual. Removed locales meta_term_syntax and
1117 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1118 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1119 directly in regular applications.
1121 * There is a new syntactic category "float_const" for signed decimal
1122 fractions (e.g. 123.45 or -123.45).
1124 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1125 interface with 'setup' command instead.
1127 * Command 'local_setup' is similar to 'setup', but operates on a local
1130 * The 'axiomatization' command now only works within a global theory
1131 context. INCOMPATIBILITY.
1133 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1134 hypotheses. Sorts required in the course of reasoning need to be
1135 covered by the constraints in the initial statement, completed by the
1136 type instance information of the background theory. Non-trivial sort
1137 hypotheses, which rarely occur in practice, may be specified via
1138 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1140 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1142 The result contains an implicit sort hypotheses as before --
1143 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1146 * Generalized Isar history, with support for linear undo, direct state
1149 * Changed defaults for unify configuration options:
1151 unify_trace_bound = 50 (formerly 25)
1152 unify_search_bound = 60 (formerly 30)
1154 * Different bookkeeping for code equations (INCOMPATIBILITY):
1156 a) On theory merge, the last set of code equations for a particular
1157 constant is taken (in accordance with the policy applied by other
1158 parts of the code generator framework).
1160 b) Code equations stemming from explicit declarations (e.g. code
1161 attribute) gain priority over default code equations stemming
1162 from definition, primrec, fun etc.
1164 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1166 * Unified theorem tables for both code generators. Thus [code
1167 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1169 * Command 'find_consts' searches for constants based on type and name
1172 find_consts "_ => bool"
1174 By default, matching is against subtypes, but it may be restricted to
1175 the whole type. Searching by name is possible. Multiple queries are
1176 conjunctive and queries may be negated by prefixing them with a
1179 find_consts strict: "_ => bool" name: "Int" -"int => int"
1181 * New 'find_theorems' criterion "solves" matches theorems that
1182 directly solve the current goal (modulo higher-order unification).
1184 * Auto solve feature for main theorem statements: whenever a new goal
1185 is stated, "find_theorems solves" is called; any theorems that could
1186 solve the lemma directly are listed as part of the goal state.
1187 Cf. associated options in Proof General Isabelle settings menu,
1188 enabled by default, with reasonable timeout for pathological cases of
1189 higher-order unification.
1192 *** Document preparation ***
1194 * Antiquotation @{lemma} now imitates a regular terminal proof,
1195 demanding keyword 'by' and supporting the full method expression
1196 syntax just like the Isar command 'by'.
1201 * Integrated main parts of former image HOL-Complex with HOL. Entry
1202 points Main and Complex_Main remain as before.
1204 * Logic image HOL-Plain provides a minimal HOL with the most important
1205 tools available (inductive, datatype, primrec, ...). This facilitates
1206 experimentation and tool development. Note that user applications
1207 (and library theories) should never refer to anything below theory
1210 * Logic image HOL-Main stops at theory Main, and thus facilitates
1211 experimentation due to shorter build times.
1213 * Logic image HOL-NSA contains theories of nonstandard analysis which
1214 were previously part of former HOL-Complex. Entry point Hyperreal
1215 remains valid, but theories formerly using Complex_Main should now use
1216 new entry point Hypercomplex.
1218 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1219 Posix processes. Avoids potentially expensive forking of the ML
1220 process. New thread-based implementation also works on non-Unix
1221 platforms (Cygwin). Provers are no longer hardwired, but defined
1222 within the theory via plain ML wrapper functions. Basic Sledgehammer
1223 commands are covered in the isar-ref manual.
1225 * Wrapper scripts for remote SystemOnTPTP service allows to use
1226 sledgehammer without local ATP installation (Vampire etc.). Other
1227 provers may be included via suitable ML wrappers, see also
1228 src/HOL/ATP_Linkup.thy.
1230 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1233 * The metis method no longer fails because the theorem is too trivial
1234 (contains the empty clause).
1236 * The metis method now fails in the usual manner, rather than raising
1237 an exception, if it determines that it cannot prove the theorem.
1239 * Method "coherent" implements a prover for coherent logic (see also
1240 src/Tools/coherent.ML).
1242 * Constants "undefined" and "default" replace "arbitrary". Usually
1243 "undefined" is the right choice to replace "arbitrary", though
1244 logically there is no difference. INCOMPATIBILITY.
1246 * Command "value" now integrates different evaluation mechanisms. The
1247 result of the first successful evaluation mechanism is printed. In
1248 square brackets a particular named evaluation mechanisms may be
1249 specified (currently, [SML], [code] or [nbe]). See further
1250 src/HOL/ex/Eval_Examples.thy.
1252 * Normalization by evaluation now allows non-leftlinear equations.
1253 Declare with attribute [code nbe].
1255 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1256 as the structured Isar versions "cases" and "induct", cf. the
1257 corresponding "cases" and "induct" attributes. Mutual induction rules
1258 are now presented as a list of individual projections
1259 (e.g. foo_bar.inducts for types foo and bar); the old format with
1260 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1261 rare situations a different rule is selected --- notably nested tuple
1262 elimination instead of former prod.exhaust: use explicit (case_tac t
1263 rule: prod.exhaust) here.
1265 * Attributes "cases", "induct", "coinduct" support "del" option.
1267 * Removed fact "case_split_thm", which duplicates "case_split".
1269 * The option datatype has been moved to a new theory Option. Renamed
1270 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1272 * New predicate "strict_mono" classifies strict functions on partial
1273 orders. With strict functions on linear orders, reasoning about
1274 (in)equalities is facilitated by theorems "strict_mono_eq",
1275 "strict_mono_less_eq" and "strict_mono_less".
1277 * Some set operations are now proper qualified constants with
1278 authentic syntax. INCOMPATIBILITY:
1289 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1292 * Auxiliary class "itself" has disappeared -- classes without any
1293 parameter are treated as expected by the 'class' command.
1295 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1297 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1298 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1300 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1301 method "approximation". It proves formulas on real values by using
1302 interval arithmetic. In the formulas are also the transcendental
1303 functions sin, cos, tan, atan, ln, exp and the constant pi are
1304 allowed. For examples see
1305 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1307 * Theory "Reflection" now resides in HOL/Library.
1309 * Entry point to Word library now simply named "Word".
1312 * Made source layout more coherent with logical distribution
1315 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1316 src/HOL/Library/Code_Message.thy ~> src/HOL/
1317 src/HOL/Library/GCD.thy ~> src/HOL/
1318 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1319 src/HOL/Library/Parity.thy ~> src/HOL/
1320 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1321 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1322 src/HOL/Real/Lubs.thy ~> src/HOL/
1323 src/HOL/Real/PReal.thy ~> src/HOL/
1324 src/HOL/Real/Rational.thy ~> src/HOL/
1325 src/HOL/Real/RComplete.thy ~> src/HOL/
1326 src/HOL/Real/RealDef.thy ~> src/HOL/
1327 src/HOL/Real/RealPow.thy ~> src/HOL/
1328 src/HOL/Real/Real.thy ~> src/HOL/
1329 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1330 src/HOL/Complex/Complex.thy ~> src/HOL/
1331 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1332 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1333 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1334 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1335 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1336 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1337 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1338 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1339 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1340 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1341 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1342 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1343 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1344 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1345 src/HOL/Real/Float ~> src/HOL/Library/
1346 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1347 src/HOL/Real/RealVector.thy ~> src/HOL/
1349 src/HOL/arith_data.ML ~> src/HOL/Tools
1350 src/HOL/hologic.ML ~> src/HOL/Tools
1351 src/HOL/simpdata.ML ~> src/HOL/Tools
1352 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1353 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1354 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1355 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1356 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1357 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1358 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1360 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1361 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1362 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1363 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1364 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1365 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1367 * If methods "eval" and "evaluation" encounter a structured proof
1368 state with !!/==>, only the conclusion is evaluated to True (if
1369 possible), avoiding strange error messages.
1371 * Method "sizechange" automates termination proofs using (a
1372 modification of) the size-change principle. Requires SAT solver. See
1373 src/HOL/ex/Termination.thy for examples.
1375 * Simplifier: simproc for let expressions now unfolds if bound
1376 variable occurs at most once in let expression body. INCOMPATIBILITY.
1378 * Method "arith": Linear arithmetic now ignores all inequalities when
1379 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1381 * New attribute "arith" for facts that should always be used
1382 automatically by arithmetic. It is intended to be used locally in
1385 assumes [arith]: "x > 0"
1387 Global usage is discouraged because of possible performance impact.
1389 * New classes "top" and "bot" with corresponding operations "top" and
1390 "bot" in theory Orderings; instantiation of class "complete_lattice"
1391 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1393 * Changed definition lemma "less_fun_def" in order to provide an
1394 instance for preorders on functions; use lemma "less_le" instead.
1397 * Theory Orderings: class "wellorder" moved here, with explicit
1398 induction rule "less_induct" as assumption. For instantiation of
1399 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1402 * Theory Orderings: added class "preorder" as superclass of "order".
1403 INCOMPATIBILITY: Instantiation proofs for order, linorder
1404 etc. slightly changed. Some theorems named order_class.* now named
1407 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1410 * Theory Finite_Set: added a new fold combinator of type
1412 ('a => 'b => 'b) => 'b => 'a set => 'b
1414 Occasionally this is more convenient than the old fold combinator
1415 which is now defined in terms of the new one and renamed to
1418 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1419 and "ring_simps" have been replaced by "algebra_simps" (which can be
1420 extended with further lemmas!). At the moment both still exist but
1421 the former will disappear at some point.
1423 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1424 class recpower. Type-specific simp rules for various recpower types
1425 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1427 rat_power_0 -> power_0
1428 rat_power_Suc -> power_Suc
1429 realpow_0 -> power_0
1430 realpow_Suc -> power_Suc
1431 complexpow_0 -> power_0
1432 complexpow_Suc -> power_Suc
1433 power_poly_0 -> power_0
1434 power_poly_Suc -> power_Suc
1436 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1437 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1438 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1439 of lemmas from Divides has been generalized from nat to class
1440 semiring_div. INCOMPATIBILITY. This involves the following theorem
1441 renames resulting from duplicate elimination:
1443 dvd_def_mod ~> dvd_eq_mod_eq_0
1444 zero_dvd_iff ~> dvd_0_left_iff
1445 dvd_0 ~> dvd_0_right
1446 DIVISION_BY_ZERO_DIV ~> div_by_0
1447 DIVISION_BY_ZERO_MOD ~> mod_by_0
1448 mult_div ~> div_mult_self2_is_id
1449 mult_mod ~> mod_mult_self2_is_0
1451 * Theory IntDiv: removed many lemmas that are instances of class-based
1452 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1453 rename old lemmas as follows:
1455 dvd_diff -> nat_dvd_diff
1456 dvd_zminus_iff -> dvd_minus_iff
1457 mod_add1_eq -> mod_add_eq
1458 mod_mult1_eq -> mod_mult_right_eq
1459 mod_mult1_eq' -> mod_mult_left_eq
1460 mod_mult_distrib_mod -> mod_mult_eq
1461 nat_mod_add_left_eq -> mod_add_left_eq
1462 nat_mod_add_right_eq -> mod_add_right_eq
1463 nat_mod_div_trivial -> mod_div_trivial
1464 nat_mod_mod_trivial -> mod_mod_trivial
1465 zdiv_zadd_self1 -> div_add_self1
1466 zdiv_zadd_self2 -> div_add_self2
1467 zdiv_zmult_self1 -> div_mult_self2_is_id
1468 zdiv_zmult_self2 -> div_mult_self1_is_id
1469 zdvd_triv_left -> dvd_triv_left
1470 zdvd_triv_right -> dvd_triv_right
1471 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1472 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1473 zmod_zadd_left_eq -> mod_add_left_eq
1474 zmod_zadd_right_eq -> mod_add_right_eq
1475 zmod_zadd_self1 -> mod_add_self1
1476 zmod_zadd_self2 -> mod_add_self2
1477 zmod_zadd1_eq -> mod_add_eq
1478 zmod_zdiff1_eq -> mod_diff_eq
1479 zmod_zdvd_zmod -> mod_mod_cancel
1480 zmod_zmod_cancel -> mod_mod_cancel
1481 zmod_zmult_self1 -> mod_mult_self2_is_0
1482 zmod_zmult_self2 -> mod_mult_self1_is_0
1485 zdvd_abs1 -> abs_dvd_iff
1486 zdvd_abs2 -> dvd_abs_iff
1487 zdvd_refl -> dvd_refl
1488 zdvd_trans -> dvd_trans
1489 zdvd_zadd -> dvd_add
1490 zdvd_zdiff -> dvd_diff
1491 zdvd_zminus_iff -> dvd_minus_iff
1492 zdvd_zminus2_iff -> minus_dvd_iff
1493 zdvd_zmultD -> dvd_mult_right
1494 zdvd_zmultD2 -> dvd_mult_left
1495 zdvd_zmult_mono -> mult_dvd_mono
1496 zdvd_0_right -> dvd_0_right
1497 zdvd_0_left -> dvd_0_left_iff
1498 zdvd_1_left -> one_dvd
1499 zminus_dvd_iff -> minus_dvd_iff
1501 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1503 * The real numbers offer decimal input syntax: 12.34 is translated
1504 into 1234/10^2. This translation is not reversed upon output.
1506 * Theory Library/Polynomial defines an abstract type 'a poly of
1507 univariate polynomials with coefficients of type 'a. In addition to
1508 the standard ring operations, it also supports div and mod. Code
1509 generation is also supported, using list-style constructors.
1511 * Theory Library/Inner_Product defines a class of real_inner for real
1512 inner product spaces, with an overloaded operation inner :: 'a => 'a
1513 => real. Class real_inner is a subclass of real_normed_vector from
1516 * Theory Library/Product_Vector provides instances for the product
1517 type 'a * 'b of several classes from RealVector and Inner_Product.
1518 Definitions of addition, subtraction, scalar multiplication, norms,
1519 and inner products are included.
1521 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1522 addition to the field operations, numerals and case syntax are also
1525 * Theory Library/Diagonalize provides constructive version of Cantor's
1526 first diagonalization argument.
1528 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1529 zlcm (for int); carried together from various gcd/lcm developements in
1530 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1531 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1532 may recover tupled syntax as follows:
1534 hide (open) const gcd
1535 abbreviation gcd where
1536 "gcd == (%(a, b). GCD.gcd a b)"
1538 GCD.gcd ("gcd '(_, _')")
1540 The same works for lcm, zgcd, zlcm.
1542 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1543 instantiations for algebraic structures. Removed some duplicate
1544 theorems. Changes in simp rules. INCOMPATIBILITY.
1546 * ML antiquotation @{code} takes a constant as argument and generates
1547 corresponding code in background and inserts name of the corresponding
1548 resulting ML value/function/datatype constructor binding in place.
1549 All occurrences of @{code} with a single ML block are generated
1550 simultaneously. Provides a generic and safe interface for
1551 instrumentalizing code generation. See
1552 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1553 In future you ought to refrain from ad-hoc compiling generated SML
1554 code on the ML toplevel. Note that (for technical reasons) @{code}
1555 cannot refer to constants for which user-defined serializations are
1556 set. Refer to the corresponding ML counterpart directly in that
1559 * Command 'rep_datatype': instead of theorem names the command now
1560 takes a list of terms denoting the constructors of the type to be
1561 represented as datatype. The characteristic theorems have to be
1562 proven. INCOMPATIBILITY. Also observe that the following theorems
1563 have disappeared in favour of existing ones:
1565 unit_induct ~> unit.induct
1566 prod_induct ~> prod.induct
1567 sum_induct ~> sum.induct
1568 Suc_Suc_eq ~> nat.inject
1569 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1574 * New locales for orders and lattices where the equivalence relation
1575 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1576 locales use a record structure with field eq for the equivalence.
1578 * New theory of factorial domains.
1580 * Units_l_inv and Units_r_inv are now simp rules by default.
1581 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1582 and/or r_inv will now also require deletion of these lemmas.
1584 * Renamed the following theorems, INCOMPATIBILITY:
1586 UpperD ~> Upper_memD
1587 LowerD ~> Lower_memD
1588 least_carrier ~> least_closed
1589 greatest_carrier ~> greatest_closed
1590 greatest_Lower_above ~> greatest_Lower_below
1591 one_zero ~> carrier_one_zero
1592 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1597 * Nominal datatypes can now contain type-variables.
1599 * Commands 'nominal_inductive' and 'equivariance' work with local
1602 * Nominal primrec can now works with local theory targets and its
1603 specification syntax now conforms to the general format as seen in
1606 * Method "perm_simp" honours the standard simplifier attributes
1607 (no_asm), (no_asm_use) etc.
1609 * The new predicate #* is defined like freshness, except that on the
1610 left hand side can be a set or list of atoms.
1612 * Experimental command 'nominal_inductive2' derives strong induction
1613 principles for inductive definitions. In contrast to
1614 'nominal_inductive', which can only deal with a fixed number of
1615 binders, it can deal with arbitrary expressions standing for sets of
1616 atoms to be avoided. The only inductive definition we have at the
1617 moment that needs this generalisation is the typing rule for Lets in
1620 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1621 -----------------------------------------------------------------
1622 Gamma |- Let x be t1 in t2 : T2
1624 In this rule one wants to avoid all the binders that are introduced by
1625 "close Gamma T1". We are looking for other examples where this
1626 feature might be useful. Please let us know.
1631 * Reimplemented the simplification procedure for proving continuity
1632 subgoals. The new simproc is extensible; users can declare additional
1633 continuity introduction rules with the attribute [cont2cont].
1635 * The continuity simproc now uses a different introduction rule for
1636 solving continuity subgoals on terms with lambda abstractions. In
1637 some rare cases the new simproc may fail to solve subgoals that the
1638 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1639 Potential INCOMPATIBILITY.
1641 * Command 'fixrec': specification syntax now conforms to the general
1642 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1643 examples. INCOMPATIBILITY.
1648 * Proof of Zorn's Lemma for partial orders.
1653 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1654 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1655 depends on multithreading, so timouts will not work before Poly/ML
1658 * High-level support for concurrent ML programming, see
1659 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1660 particularly convenient to organize independent functional
1661 computations. The concept of "synchronized variables" provides a
1662 higher-order interface for components with shared state, avoiding the
1663 delicate details of mutexes and condition variables. (Requires
1664 Poly/ML 5.2.1 or later.)
1666 * ML bindings produced via Isar commands are stored within the Isar
1667 context (theory or proof). Consequently, commands like 'use' and 'ML'
1668 become thread-safe and work with undo as expected (concerning
1669 top-level bindings, not side-effects on global references).
1670 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1671 compiler at runtime; really global bindings need to be given outside a
1672 theory. (Requires Poly/ML 5.2 or later.)
1674 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1675 context. Top-level ML bindings are stored within the proof context in
1676 a purely sequential fashion, disregarding the nested proof structure.
1677 ML bindings introduced by 'ML_prf' are discarded at the end of the
1678 proof. (Requires Poly/ML 5.2 or later.)
1680 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1681 and Method.setup, as well as Isar commands 'attribute_setup' and
1682 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1683 existing code accordingly, or use plain 'setup' together with old
1686 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1687 to 'a -> thm, while results are always tagged with an authentic oracle
1688 name. The Isar command 'oracle' is now polymorphic, no argument type
1689 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1690 accordingly. Note that extra performance may be gained by producing
1691 the cterm carefully, avoiding slow Thm.cterm_of.
1693 * Simplified interface for defining document antiquotations via
1694 ThyOutput.antiquotation, ThyOutput.output, and optionally
1695 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1696 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1699 * More systematic treatment of long names, abstract name bindings, and
1700 name space operations. Basic operations on qualified names have been
1701 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1702 Long_Name.append. Old type bstring has been mostly replaced by
1703 abstract type binding (see structure Binding), which supports precise
1704 qualification by packages and local theory targets, as well as proper
1705 tracking of source positions. INCOMPATIBILITY, need to wrap old
1706 bstring values into Binding.name, or better pass through abstract
1707 bindings everywhere. See further src/Pure/General/long_name.ML,
1708 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1710 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1711 LocalTheory.note etc.) now refer to the *full* internal name, not the
1712 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1714 * Disposed old type and term read functions (Sign.read_def_typ,
1715 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1716 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1717 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1718 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1719 resort for legacy applications.
1721 * Disposed old declarations, tactics, tactic combinators that refer to
1722 the simpset or claset of an implicit theory (such as Addsimps,
1723 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1724 embedded ML text, or local_simpset_of with a proper context passed as
1725 explicit runtime argument.
1727 * Rules and tactics that read instantiations (read_instantiate,
1728 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1729 context, which is required for parsing and type-checking. Moreover,
1730 the variables are specified as plain indexnames, not string encodings
1731 thereof. INCOMPATIBILITY.
1733 * Generic Toplevel.add_hook interface allows to analyze the result of
1734 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1735 for theorem dependency output of transactions resulting in a new
1738 * ML antiquotations: block-structured compilation context indicated by
1739 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1741 @{binding name} - basic name binding
1742 @{let ?pat = term} - term abbreviation (HO matching)
1743 @{note name = fact} - fact abbreviation
1744 @{thm fact} - singleton fact (with attributes)
1745 @{thms fact} - general fact (with attributes)
1746 @{lemma prop by method} - singleton goal
1747 @{lemma prop by meth1 meth2} - singleton goal
1748 @{lemma prop1 ... propN by method} - general goal
1749 @{lemma prop1 ... propN by meth1 meth2} - general goal
1750 @{lemma (open) ...} - open derivation
1755 * The Isabelle "emacs" tool provides a specific interface to invoke
1756 Proof General / Emacs, with more explicit failure if that is not
1757 installed (the old isabelle-interface script silently falls back on
1758 isabelle-process). The PROOFGENERAL_HOME setting determines the
1759 installation location of the Proof General distribution.
1761 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1762 the Isabelle process into a JVM/Scala application. See
1763 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1764 process wrapper has been discontinued.)
1766 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1768 * Various status messages (with exact source position information) are
1769 emitted, if proper markup print mode is enabled. This allows
1770 user-interface components to provide detailed feedback on internal
1775 New in Isabelle2008 (June 2008)
1776 -------------------------------
1780 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1781 and updated, with formally checked references as hyperlinks.
1783 * Theory loader: use_thy (and similar operations) no longer set the
1784 implicit ML context, which was occasionally hard to predict and in
1785 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1786 provides a proper context already.
1788 * Theory loader: old-style ML proof scripts being *attached* to a thy
1789 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1790 'use' within a theory file will do the job.
1792 * Name space merge now observes canonical order, i.e. the second space
1793 is inserted into the first one, while existing entries in the first
1794 space take precedence. INCOMPATIBILITY in rare situations, may try to
1795 swap theory imports.
1797 * Syntax: symbol \<chi> is now considered a letter. Potential
1798 INCOMPATIBILITY in identifier syntax etc.
1800 * Outer syntax: string tokens no longer admit escaped white space,
1801 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1802 white space without escapes.
1804 * Outer syntax: string tokens may contain arbitrary character codes
1805 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1811 * Context-dependent token translations. Default setup reverts locally
1812 fixed variables, and adds hilite markup for undeclared frees.
1814 * Unused theorems can be found using the new command 'unused_thms'.
1815 There are three ways of invoking it:
1818 Only finds unused theorems in the current theory.
1820 (2) unused_thms thy_1 ... thy_n -
1821 Finds unused theorems in the current theory and all of its ancestors,
1822 excluding the theories thy_1 ... thy_n and all of their ancestors.
1824 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1825 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1826 their ancestors, excluding the theories thy_1 ... thy_n and all of
1829 In order to increase the readability of the list produced by
1830 unused_thms, theorems that have been created by a particular instance
1831 of a theory command such as 'inductive' or 'function' are considered
1832 to belong to the same "group", meaning that if at least one theorem in
1833 this group is used, the other theorems in the same group are no longer
1834 reported as unused. Moreover, if all theorems in the group are
1835 unused, only one theorem in the group is displayed.
1837 Note that proof objects have to be switched on in order for
1838 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1839 usually the case when using Proof General with the default settings).
1841 * Authentic naming of facts disallows ad-hoc overwriting of previous
1842 theorems within the same name space. INCOMPATIBILITY, need to remove
1843 duplicate fact bindings, or even accidental fact duplications. Note
1844 that tools may maintain dynamically scoped facts systematically, using
1845 PureThy.add_thms_dynamic.
1847 * Command 'hide' now allows to hide from "fact" name space as well.
1849 * Eliminated destructive theorem database, simpset, claset, and
1850 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1851 update of theories within ML code.
1853 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1854 INCOMPATIBILITY, object-logics depending on former Pure require
1855 additional setup PureThy.old_appl_syntax_setup; object-logics
1856 depending on former CPure need to refer to Pure.
1858 * Commands 'use' and 'ML' are now purely functional, operating on
1859 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1860 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1863 * Command 'setup': discontinued implicit version with ML reference.
1865 * Instantiation target allows for simultaneous specification of class
1866 instance operations together with an instantiation proof.
1867 Type-checking phase allows to refer to class operations uniformly.
1868 See src/HOL/Complex/Complex.thy for an Isar example and
1869 src/HOL/Library/Eval.thy for an ML example.
1871 * Indexing of literal facts: be more serious about including only
1872 facts from the visible specification/proof context, but not the
1873 background context (locale etc.). Affects `prop` notation and method
1874 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1877 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1878 "(open)" option, which used to expose internal bound variables to the
1881 * Isar statements: removed obsolete case "rule_context".
1882 INCOMPATIBILITY, better use explicit fixes/assumes.
1884 * Locale proofs: default proof step now includes 'unfold_locales';
1885 hence 'proof' without argument may be used to unfold locale
1889 *** Document preparation ***
1891 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1892 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1893 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1894 spot); renamed link color from "darkblue" to "linkcolor" (default
1895 value unchanged, can be redefined via \definecolor); no longer sets
1896 "a4paper" option (unnecessary or even intrusive).
1898 * Antiquotation @{lemma A method} proves proposition A by the given
1899 method (either a method name or a method name plus (optional) method
1900 arguments in parentheses) and prints A just like @{prop A}.
1905 * New primrec package. Specification syntax conforms in style to
1906 definition/function/.... No separate induction rule is provided. The
1907 "primrec" command distinguishes old-style and new-style specifications
1908 by syntax. The former primrec package is now named OldPrimrecPackage.
1909 When adjusting theories, beware: constants stemming from new-style
1910 primrec specifications have authentic syntax.
1912 * Metis prover is now an order of magnitude faster, and also works
1913 with multithreading.
1915 * Metis: the maximum number of clauses that can be produced from a
1916 theorem is now given by the attribute max_clauses. Theorems that
1917 exceed this number are ignored, with a warning printed.
1919 * Sledgehammer no longer produces structured proofs by default. To
1920 enable, declare [[sledgehammer_full = true]]. Attributes
1921 reconstruction_modulus, reconstruction_sorts renamed
1922 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1924 * Method "induct_scheme" derives user-specified induction rules
1925 from well-founded induction and completeness of patterns. This factors
1926 out some operations that are done internally by the function package
1927 and makes them available separately. See
1928 src/HOL/ex/Induction_Scheme.thy for examples.
1930 * More flexible generation of measure functions for termination
1931 proofs: Measure functions can be declared by proving a rule of the
1932 form "is_measure f" and giving it the [measure_function] attribute.
1933 The "is_measure" predicate is logically meaningless (always true), and
1934 just guides the heuristic. To find suitable measure functions, the
1935 termination prover sets up the goal "is_measure ?f" of the appropriate
1936 type and generates all solutions by prolog-style backwards proof using
1939 This setup also deals with rules like
1941 "is_measure f ==> is_measure (list_size f)"
1943 which accommodates nested datatypes that recurse through lists.
1944 Similar rules are predeclared for products and option types.
1946 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1950 - Definitions of overloaded constants on sets have to be replaced by
1951 definitions on => and bool.
1953 - Some definitions of overloaded operators on sets can now be proved
1954 using the definitions of the operators on => and bool. Therefore,
1955 the following theorems have been renamed:
1957 subset_def -> subset_eq
1958 psubset_def -> psubset_eq
1959 set_diff_def -> set_diff_eq
1960 Compl_def -> Compl_eq
1961 Sup_set_def -> Sup_set_eq
1962 Inf_set_def -> Inf_set_eq
1963 sup_set_def -> sup_set_eq
1964 inf_set_def -> inf_set_eq
1966 - Due to the incompleteness of the HO unification algorithm, some
1967 rules such as subst may require manual instantiation, if some of
1968 the unknowns in the rule is a set.
1970 - Higher order unification and forward proofs:
1973 have "P (S::'a set)" <...>
1974 then have "EX S. P S" ..
1976 no longer works (due to the incompleteness of the HO unification
1977 algorithm) and must be replaced by the pattern
1984 - Calculational reasoning with subst (or similar rules):
1987 have "P (S::'a set)" <...>
1988 also have "S = T" <...>
1989 finally have "P T" .
1991 no longer works (for similar reasons as the previous example) and
1992 must be replaced by something like
1994 have "P (S::'a set)" <...>
1995 moreover have "S = T" <...>
1996 ultimately have "P T" by simp
1998 - Tactics or packages written in ML code:
1999 Code performing pattern matching on types via
2001 Type ("set", [T]) => ...
2003 must be rewritten. Moreover, functions like strip_type or
2004 binder_types no longer return the right value when applied to a
2007 T1 => ... => Tn => U => bool
2011 T1 => ... => Tn => U set
2013 * Merged theories Wellfounded_Recursion, Accessible_Part and
2014 Wellfounded_Relations to theory Wellfounded.
2016 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2018 * Class finite no longer treats UNIV as class parameter. Use class
2019 enum from theory Library/Enum instead to achieve a similar effect.
2022 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2023 and "Cons". INCOMPATIBILITY.
2025 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2026 Potential INCOMPATIBILITY.
2028 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2029 injective_fst_snd removed, use split_eta and prod_eqI instead.
2030 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2032 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2033 the same name in theory Orderings:
2043 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2044 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2045 and different variable names.
2047 * Library/Option_ord.thy: Canonical order on option type.
2049 * Library/RBT.thy: Red-black trees, an efficient implementation of
2052 * Library/Countable.thy: Type class for countable types.
2054 * Theory Int: The representation of numerals has changed. The infix
2055 operator BIT and the bit datatype with constructors B0 and B1 have
2056 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2057 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2058 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2061 * Theory Nat: definition of <= and < on natural numbers no longer
2062 depend on well-founded relations. INCOMPATIBILITY. Definitions
2063 le_def and less_def have disappeared. Consider lemmas not_less
2064 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2066 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2067 (whose purpose mainly is for various fold_set functionals) have been
2068 abandoned in favor of the existing algebraic classes
2069 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2070 lower_semilattice (resp. upper_semilattice) and linorder.
2073 * Theory Transitive_Closure: induct and cases rules now declare proper
2074 case_names ("base" and "step"). INCOMPATIBILITY.
2076 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2077 lattices. The form set-specific version is available as
2078 Inductive.lfp_ordinal_induct_set.
2080 * Renamed theorems "power.simps" to "power_int.simps".
2083 * Class semiring_div provides basic abstract properties of semirings
2084 with division and modulo operations. Subsumes former class dvd_mod.
2086 * Merged theories IntDef, Numeral and IntArith into unified theory
2087 Int. INCOMPATIBILITY.
2089 * Theory Library/Code_Index: type "index" now represents natural
2090 numbers rather than integers. INCOMPATIBILITY.
2092 * New class "uminus" with operation "uminus" (split of from class
2093 "minus" which now only has operation "minus", binary).
2096 * Constants "card", "internal_split", "option_map" now with authentic
2097 syntax. INCOMPATIBILITY.
2099 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2100 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2101 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2102 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2103 Sup_set_def, le_def, less_def, option_map_def now with object
2104 equality. INCOMPATIBILITY.
2106 * Records. Removed K_record, and replaced it by pure lambda term
2107 %x. c. The simplifier setup is now more robust against eta expansion.
2108 INCOMPATIBILITY: in cases explicitly referring to K_record.
2110 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2112 * Library/ListVector: new theory of arithmetic vector operations.
2114 * Library/Order_Relation: new theory of various orderings as sets of
2115 pairs. Defines preorders, partial orders, linear orders and
2116 well-orders on sets and on types.
2121 * Renamed some theories to allow to loading both ZF and HOL in the
2124 Datatype -> Datatype_ZF
2125 Inductive -> Inductive_ZF
2132 INCOMPATIBILITY: ZF theories that import individual theories below
2133 Main might need to be adapted. Regular theory Main is still
2134 available, as trivial extension of Main_ZF.
2139 * ML within Isar: antiquotation @{const name} or @{const
2140 name(typargs)} produces statically-checked Const term.
2142 * Functor NamedThmsFun: data is available to the user as dynamic fact
2143 (of the same name). Removed obsolete print command.
2145 * Removed obsolete "use_legacy_bindings" function.
2147 * The ``print mode'' is now a thread-local value derived from a global
2148 template (the former print_mode reference), thus access becomes
2149 non-critical. The global print_mode reference is for session
2150 management only; user-code should use print_mode_value,
2151 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2153 * Functions system/system_out provide a robust way to invoke external
2154 shell commands, with propagation of interrupts (requires Poly/ML
2155 5.2.1). Do not use OS.Process.system etc. from the basis library!
2160 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2161 in accordance with Proof General 3.7, which prefers GNU emacs.
2163 * isatool tty runs Isabelle process with plain tty interaction;
2164 optional line editor may be specified via ISABELLE_LINE_EDITOR
2165 setting, the default settings attempt to locate "ledit" and "rlwrap".
2167 * isatool browser now works with Cygwin as well, using general
2168 "javapath" function defined in Isabelle process environment.
2170 * YXML notation provides a simple and efficient alternative to
2171 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2172 isatool yxml as described in the Isabelle system manual.
2174 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2175 provides general wrapper for managing an Isabelle process in a robust
2176 fashion, with ``cooked'' output from stdin/stderr.
2178 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2179 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2181 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2182 way of changing the user's settings is via
2183 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2186 * Multithreading.max_threads := 0 refers to the number of actual CPU
2187 cores of the underlying machine, which is a good starting point for
2188 optimal performance tuning. The corresponding usedir option -M allows
2189 "max" as an alias for "0". WARNING: does not work on certain versions
2190 of Mac OS (with Poly/ML 5.1).
2192 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2193 adverse effect of Isabelle flooding interactive front-ends (notably
2194 ProofGeneral / XEmacs).
2198 New in Isabelle2007 (November 2007)
2199 -----------------------------------
2203 * More uniform information about legacy features, notably a
2204 warning/error of "Legacy feature: ...", depending on the state of the
2205 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2206 legacy features will disappear eventually.
2208 * Theory syntax: the header format ``theory A = B + C:'' has been
2209 discontinued in favour of ``theory A imports B C begin''. Use isatool
2210 fixheaders to convert existing theory files. INCOMPATIBILITY.
2212 * Theory syntax: the old non-Isar theory file format has been
2213 discontinued altogether. Note that ML proof scripts may still be used
2214 with Isar theories; migration is usually quite simple with the ML
2215 function use_legacy_bindings. INCOMPATIBILITY.
2217 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2218 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2221 * Theory loader: be more serious about observing the static theory
2222 header specifications (including optional directories), but not the
2223 accidental file locations of previously successful loads. The strict
2224 update policy of former update_thy is now already performed by
2225 use_thy, so the former has been removed; use_thys updates several
2226 theories simultaneously, just as 'imports' within a theory header
2227 specification, but without merging the results. Potential
2228 INCOMPATIBILITY: may need to refine theory headers and commands
2229 ROOT.ML which depend on load order.
2231 * Theory loader: optional support for content-based file
2232 identification, instead of the traditional scheme of full physical
2233 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2234 (cf. the system manual). The new scheme allows to work with
2235 non-finished theories in persistent session images, such that source
2236 files may be moved later on without requiring reloads.
2238 * Theory loader: old-style ML proof scripts being *attached* to a thy
2239 file (with the same base name as the theory) are considered a legacy
2240 feature, which will disappear eventually. Even now, the theory loader
2241 no longer maintains dependencies on such files.
2243 * Syntax: the scope for resolving ambiguities via type-inference is
2244 now limited to individual terms, instead of whole simultaneous
2245 specifications as before. This greatly reduces the complexity of the
2246 syntax module and improves flexibility by separating parsing and
2247 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2248 'fixes' etc.) are required in rare situations.
2250 * Syntax: constants introduced by new-style packages ('definition',
2251 'abbreviation' etc.) are passed through the syntax module in
2252 ``authentic mode''. This means that associated mixfix annotations
2253 really stick to such constants, independently of potential name space
2254 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2255 trees are represented slightly differently, may need to adapt syntax
2256 translations accordingly. Use CONST marker in 'translations' and
2257 @{const_syntax} antiquotation in 'parse_translation' etc.
2259 * Legacy goal package: reduced interface to the bare minimum required
2260 to keep existing proof scripts running. Most other user-level
2261 functions are now part of the OldGoals structure, which is *not* open
2262 by default (consider isatool expandshort before open OldGoals).
2263 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2264 these tend to cause confusion about the actual goal (!) context being
2265 used here, which is not necessarily the same as the_context().
2267 * Command 'find_theorems': supports "*" wild-card in "name:"
2268 criterion; "with_dups" option. Certain ProofGeneral versions might
2269 support a specific search form (see ProofGeneral/CHANGES).
2271 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2272 by default, which means that "prems" (and also "fixed variables") are
2273 suppressed from proof state output. Note that the ProofGeneral
2274 settings mechanism allows to change and save options persistently, but
2275 older versions of Isabelle will fail to start up if a negative prems
2278 * Local theory targets may be specified by non-nested blocks of
2279 ``context/locale/class ... begin'' followed by ``end''. The body may
2280 contain definitions, theorems etc., including any derived mechanism
2281 that has been implemented on top of these primitives. This concept
2282 generalizes the existing ``theorem (in ...)'' towards more versatility
2285 * Proof General interface: proper undo of final 'end' command;
2286 discontinued Isabelle/classic mode (ML proof scripts).
2289 *** Document preparation ***
2291 * Added antiquotation @{theory name} which prints the given name,
2292 after checking that it refers to a valid ancestor theory in the
2295 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2296 check the given source text as ML type/structure, printing verbatim.
2298 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2299 "c args == rhs" given in the current context. (Any number of
2300 arguments may be given on the LHS.)
2305 * The 'class' package offers a combination of axclass and locale to
2306 achieve Haskell-like type classes in Isabelle. Definitions and
2307 theorems within a class context produce both relative results (with
2308 implicit parameters according to the locale context), and polymorphic
2309 constants with qualified polymorphism (according to the class
2310 context). Within the body context of a 'class' target, a separate
2311 syntax layer ("user space type system") takes care of converting
2312 between global polymorphic consts and internal locale representation.
2313 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2314 "isatool doc classes" provides a tutorial.
2316 * Generic code generator framework allows to generate executable
2317 code for ML and Haskell (including Isabelle classes). A short usage
2320 internal compilation:
2321 export_code <list of constants (term syntax)> in SML
2322 writing SML code to a file:
2323 export_code <list of constants (term syntax)> in SML <filename>
2324 writing OCaml code to a file:
2325 export_code <list of constants (term syntax)> in OCaml <filename>
2326 writing Haskell code to a bunch of files:
2327 export_code <list of constants (term syntax)> in Haskell <filename>
2329 evaluating closed propositions to True/False using code generation:
2332 Reasonable default setup of framework in HOL.
2334 Theorem attributs for selecting and transforming function equations theorems:
2336 [code fun]: select a theorem as function equation for a specific constant
2337 [code fun del]: deselect a theorem as function equation for a specific constant
2338 [code inline]: select an equation theorem for unfolding (inlining) in place
2339 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2341 User-defined serializations (target in {SML, OCaml, Haskell}):
2343 code_const <and-list of constants (term syntax)>
2344 {(target) <and-list of const target syntax>}+
2346 code_type <and-list of type constructors>
2347 {(target) <and-list of type target syntax>}+
2349 code_instance <and-list of instances>
2351 where instance ::= <type constructor> :: <class>
2353 code_class <and_list of classes>
2354 {(target) <and-list of class target syntax>}+
2355 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2357 code_instance and code_class only are effective to target Haskell.
2359 For example usage see src/HOL/ex/Codegenerator.thy and
2360 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2361 generation from Isabelle/HOL theories is available via "isatool doc
2364 * Code generator: consts in 'consts_code' Isar commands are now
2365 referred to by usual term syntax (including optional type
2368 * Command 'no_translations' removes translation rules from theory
2371 * Overloaded definitions are now actually checked for acyclic
2372 dependencies. The overloading scheme is slightly more general than
2373 that of Haskell98, although Isabelle does not demand an exact
2374 correspondence to type class and instance declarations.
2375 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2376 exotic versions of overloading -- at the discretion of the user!
2378 Polymorphic constants are represented via type arguments, i.e. the
2379 instantiation that matches an instance against the most general
2380 declaration given in the signature. For example, with the declaration
2381 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2382 as c(nat). Overloading is essentially simultaneous structural
2383 recursion over such type arguments. Incomplete specification patterns
2384 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2385 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2386 Command 'print_theory' outputs the normalized system of recursive
2387 equations, see section "definitions".
2389 * Configuration options are maintained within the theory or proof
2390 context (with name and type bool/int/string), providing a very simple
2391 interface to a poor-man's version of general context data. Tools may
2392 declare options in ML (e.g. using Attrib.config_int) and then refer to
2393 these values using Config.get etc. Users may change options via an
2394 associated attribute of the same name. This form of context
2395 declaration works particularly well with commands 'declare' or
2396 'using', for example ``declare [[foo = 42]]''. Thus it has become
2397 very easy to avoid global references, which would not observe Isar
2398 toplevel undo/redo and fail to work with multithreading.
2400 Various global ML references of Pure and HOL have been turned into
2401 configuration options:
2403 Unify.search_bound unify_search_bound
2404 Unify.trace_bound unify_trace_bound
2405 Unify.trace_simp unify_trace_simp
2406 Unify.trace_types unify_trace_types
2407 Simplifier.simp_depth_limit simp_depth_limit
2408 Blast.depth_limit blast_depth_limit
2409 DatatypeProp.dtK datatype_distinctness_limit
2410 fast_arith_neq_limit fast_arith_neq_limit
2411 fast_arith_split_limit fast_arith_split_limit
2413 * Named collections of theorems may be easily installed as context
2414 data using the functor NamedThmsFun (see also
2415 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2416 attributes; there is also a toplevel print command. This facility is
2417 just a common case of general context data, which is the preferred way
2418 for anything more complex than just a list of facts in canonical
2421 * Isar: command 'declaration' augments a local theory by generic
2422 declaration functions written in ML. This enables arbitrary content
2423 being added to the context, depending on a morphism that tells the
2424 difference of the original declaration context wrt. the application
2425 context encountered later on.
2427 * Isar: proper interfaces for simplification procedures. Command
2428 'simproc_setup' declares named simprocs (with match patterns, and body
2429 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2430 context. ML antiquotation @{simproc name} retrieves named simprocs.
2432 * Isar: an extra pair of brackets around attribute declarations
2433 abbreviates a theorem reference involving an internal dummy fact,
2434 which will be ignored later --- only the effect of the attribute on
2435 the background context will persist. This form of in-place
2436 declarations is particularly useful with commands like 'declare' and
2437 'using', for example ``have A using [[simproc a]] by simp''.
2439 * Isar: method "assumption" (and implicit closing of subproofs) now
2440 takes simple non-atomic goal assumptions into account: after applying
2441 an assumption as a rule the resulting subgoals are solved by atomic
2442 assumption steps. This is particularly useful to finish 'obtain'
2443 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2444 without referring to the original premise "!!x. P x ==> thesis" in the
2445 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2448 * Isar: implicit use of prems from the Isar proof context is
2449 considered a legacy feature. Common applications like ``have A .''
2450 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2451 referencing facts explicitly here improves readability and
2452 maintainability of proof texts.
2454 * Isar: improper proof element 'guess' is like 'obtain', but derives
2455 the obtained context from the course of reasoning! For example:
2457 assume "EX x y. A x & B y" -- "any previous fact"
2458 then guess x and y by clarify
2460 This technique is potentially adventurous, depending on the facts and
2461 proof tools being involved here.
2463 * Isar: known facts from the proof context may be specified as literal
2464 propositions, using ASCII back-quote syntax. This works wherever
2465 named facts used to be allowed so far, in proof commands, proof
2466 methods, attributes etc. Literal facts are retrieved from the context
2467 according to unification of type and term parameters. For example,
2468 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2469 theorems in the current context, then these are valid literal facts:
2470 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2472 There is also a proof method "fact" which does the same composition
2473 for explicit goal states, e.g. the following proof texts coincide with
2474 certain special cases of literal facts:
2476 have "A" by fact == note `A`
2477 have "A ==> B" by fact == note `A ==> B`
2478 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2479 have "P a ==> Q a" by fact == note `P a ==> Q a`
2481 * Isar: ":" (colon) is no longer a symbolic identifier character in
2482 outer syntax. Thus symbolic identifiers may be used without
2483 additional white space in declarations like this: ``assume *: A''.
2485 * Isar: 'print_facts' prints all local facts of the current context,
2486 both named and unnamed ones.
2488 * Isar: 'def' now admits simultaneous definitions, e.g.:
2490 def x == "t" and y == "u"
2492 * Isar: added command 'unfolding', which is structurally similar to
2493 'using', but affects both the goal state and facts by unfolding given
2494 rewrite rules. Thus many occurrences of the 'unfold' method or
2495 'unfolded' attribute may be replaced by first-class proof text.
2497 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2498 and command 'unfolding' now all support object-level equalities
2499 (potentially conditional). The underlying notion of rewrite rule is
2500 analogous to the 'rule_format' attribute, but *not* that of the
2501 Simplifier (which is usually more generous).
2503 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2504 premises of a theorem by n. Useful in conjunction with drule.
2506 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2507 method expression within a sandbox consisting of the first N
2508 sub-goals, which need to exist. For example, ``simp_all [3]''
2509 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2510 simplifies all new goals that emerge from applying rule foo to the
2511 originally first one.
2513 * Isar: schematic goals are no longer restricted to higher-order
2514 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2517 * Isar: the conclusion of a long theorem statement is now either
2518 'shows' (a simultaneous conjunction, as before), or 'obtains'
2519 (essentially a disjunction of cases with local parameters and
2520 assumptions). The latter allows to express general elimination rules
2521 adequately; in this notation common elimination rules look like this:
2523 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2525 obtains x where "P x"
2527 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2531 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2537 The subsequent classical rules even refer to the formal "thesis"
2540 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2543 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2544 obtains "thesis ==> something"
2546 The actual proof of an 'obtains' statement is analogous to that of the
2547 Isar proof element 'obtain', only that there may be several cases.
2548 Optional case names may be specified in parentheses; these will be
2549 available both in the present proof and as annotations in the
2550 resulting rule, for later use with the 'cases' method (cf. attribute
2553 * Isar: the assumptions of a long theorem statement are available as
2554 "assms" fact in the proof context. This is more appropriate than the
2555 (historical) "prems", which refers to all assumptions of the current
2556 context, including those from the target locale, proof body etc.
2558 * Isar: 'print_statement' prints theorems from the current theory or
2559 proof context in long statement form, according to the syntax of a
2562 * Isar: 'obtain' takes an optional case name for the local context
2563 introduction rule (default "that").
2565 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2566 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2569 * Pure: syntax "CONST name" produces a fully internalized constant
2570 according to the current context. This is particularly useful for
2571 syntax translations that should refer to internal constant
2572 representations independently of name spaces.
2574 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2575 instead of "FOO ". This allows multiple binder declarations to coexist
2576 in the same context. INCOMPATIBILITY.
2578 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2579 primitive that also works in a locale context (both for constants and
2580 fixed variables). Type declaration and internal syntactic representation
2581 of given constants retrieved from the context. Likewise, the
2582 'no_notation' command allows to remove given syntax annotations from the
2585 * Isar/locales: new derived specification elements 'axiomatization',
2586 'definition', 'abbreviation', which support type-inference, admit
2587 object-level specifications (equality, equivalence). See also the
2588 isar-ref manual. Examples:
2591 eq (infix "===" 50) where
2592 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2594 definition "f x y = x + y + 1"
2595 definition g where "g x = f x x"
2598 neq (infix "=!=" 50) where
2599 "x =!= y == ~ (x === y)"
2601 These specifications may be also used in a locale context. Then the
2602 constants being introduced depend on certain fixed parameters, and the
2603 constant name is qualified by the locale base name. An internal
2604 abbreviation takes care for convenient input and output, making the
2605 parameters implicit and using the original short name. See also
2606 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2607 entities from a monomorphic theory.
2609 Presently, abbreviations are only available 'in' a target locale, but
2610 not inherited by general import expressions. Also note that
2611 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2612 'translations' in common applications. The "no_abbrevs" print mode
2613 prevents folding of abbreviations in term output.
2615 Concrete syntax is attached to specified constants in internal form,
2616 independently of name spaces. The parse tree representation is
2617 slightly different -- use 'notation' instead of raw 'syntax', and
2618 'translations' with explicit "CONST" markup to accommodate this.
2620 * Pure/Isar: unified syntax for new-style specification mechanisms
2621 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2622 full type inference and dummy patterns ("_"). For example:
2624 definition "K x _ = x"
2626 inductive conj for A B
2627 where "A ==> B ==> conj A B"
2629 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2630 the current context. Print mode "no_abbrevs" prevents inversion of
2631 abbreviations on output.
2633 * Isar/locales: improved parameter handling: use of locales "var" and
2634 "struct" no longer necessary; - parameter renamings are no longer
2635 required to be injective. For example, this allows to define
2636 endomorphisms as locale endom = homom mult mult h.
2638 * Isar/locales: changed the way locales with predicates are defined.
2639 Instead of accumulating the specification, the imported expression is
2640 now an interpretation. INCOMPATIBILITY: different normal form of
2641 locale expressions. In particular, in interpretations of locales with
2642 predicates, goals repesenting already interpreted fragments are not
2643 removed automatically. Use methods `intro_locales' and
2644 `unfold_locales'; see below.
2646 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2647 provide backward reasoning on locales predicates. The methods are
2648 aware of interpretations and discharge corresponding goals.
2649 `intro_locales' is less aggressive then `unfold_locales' and does not
2650 unfold predicates to assumptions.
2652 * Isar/locales: the order in which locale fragments are accumulated
2653 has changed. This enables to override declarations from fragments due
2654 to interpretations -- for example, unwanted simp rules.
2656 * Isar/locales: interpretation in theories and proof contexts has been
2657 extended. One may now specify (and prove) equations, which are
2658 unfolded in interpreted theorems. This is useful for replacing
2659 defined concepts (constants depending on locale parameters) by
2660 concepts already existing in the target context. Example:
2662 interpretation partial_order ["op <= :: [int, int] => bool"]
2663 where "partial_order.less (op <=) (x::int) y = (x < y)"
2665 Typically, the constant `partial_order.less' is created by a
2666 definition specification element in the context of locale
2669 * Method "induct": improved internal context management to support
2670 local fixes and defines on-the-fly. Thus explicit meta-level
2671 connectives !! and ==> are rarely required anymore in inductive goals
2672 (using object-logic connectives for this purpose has been long
2673 obsolete anyway). Common proof patterns are explained in
2674 src/HOL/Induct/Common_Patterns.thy, see also
2675 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2678 * Method "induct": improved handling of simultaneous goals. Instead of
2679 introducing object-level conjunction, the statement is now split into
2680 several conclusions, while the corresponding symbolic cases are nested
2681 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2682 see src/HOL/Induct/Common_Patterns.thy, for example.
2684 * Method "induct": mutual induction rules are now specified as a list
2685 of rule sharing the same induction cases. HOL packages usually provide
2686 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2687 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2688 mutual induction rules differently, i.e. like this:
2690 (induct rule: foo_bar.inducts)
2691 (induct set: foo bar)
2692 (induct pred: foo bar)
2693 (induct type: foo bar)
2695 The ML function ProjectRule.projections turns old-style rules into the
2698 * Method "coinduct": dual of induction, see
2699 src/HOL/Library/Coinductive_List.thy for various examples.
2701 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2702 considered a legacy feature.
2704 * Attribute "symmetric" produces result with standardized schematic
2705 variables (index 0). Potential INCOMPATIBILITY.
2707 * Simplifier: by default the simplifier trace only shows top level
2708 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2709 default. Thus there is less danger of being flooded by the trace. The
2710 trace indicates where parts have been suppressed.
2712 * Provers/classical: removed obsolete classical version of elim_format
2713 attribute; classical elim/dest rules are now treated uniformly when
2714 manipulating the claset.
2716 * Provers/classical: stricter checks to ensure that supplied intro,
2717 dest and elim rules are well-formed; dest and elim rules must have at
2720 * Provers/classical: attributes dest/elim/intro take an optional
2721 weight argument for the rule (just as the Pure versions). Weights are
2722 ignored by automated tools, but determine the search order of single
2725 * Syntax: input syntax now supports dummy variable binding "%_. b",
2726 where the body does not mention the bound variable. Note that dummy
2727 patterns implicitly depend on their context of bounds, which makes
2728 "{_. _}" match any set comprehension as expected. Potential
2729 INCOMPATIBILITY -- parse translations need to cope with syntactic
2730 constant "_idtdummy" in the binding position.
2732 * Syntax: removed obsolete syntactic constant "_K" and its associated
2733 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2734 for example "A -> B" => "Pi A (%_. B)".
2736 * Pure: 'class_deps' command visualizes the subclass relation, using
2737 the graph browser tool.
2739 * Pure: 'print_theory' now suppresses certain internal declarations by
2740 default; use '!' option for full details.
2745 * Method "metis" proves goals by applying the Metis general-purpose
2746 resolution prover (see also http://gilith.com/software/metis/).
2747 Examples are in the directory MetisExamples. WARNING: the
2748 Isabelle/HOL-Metis integration does not yet work properly with
2751 * Command 'sledgehammer' invokes external automatic theorem provers as
2752 background processes. It generates calls to the "metis" method if
2753 successful. These can be pasted into the proof. Users do not have to
2754 wait for the automatic provers to return. WARNING: does not really
2755 work with multi-threading.
2757 * New "auto_quickcheck" feature tests outermost goal statements for
2758 potential counter-examples. Controlled by ML references
2759 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2760 5000 milliseconds). Fails silently if statements is outside of
2761 executable fragment, or any other codgenerator problem occurs.
2763 * New constant "undefined" with axiom "undefined x = undefined".
2765 * Added class "HOL.eq", allowing for code generation with polymorphic
2768 * Some renaming of class constants due to canonical name prefixing in
2769 the new 'class' package:
2771 HOL.abs ~> HOL.abs_class.abs
2772 HOL.divide ~> HOL.divide_class.divide
2773 0 ~> HOL.zero_class.zero
2774 1 ~> HOL.one_class.one
2775 op + ~> HOL.plus_class.plus
2776 op - ~> HOL.minus_class.minus
2777 uminus ~> HOL.minus_class.uminus
2778 op * ~> HOL.times_class.times
2779 op < ~> HOL.ord_class.less
2780 op <= > HOL.ord_class.less_eq
2781 Nat.power ~> Power.power_class.power
2782 Nat.size ~> Nat.size_class.size
2783 Numeral.number_of ~> Numeral.number_class.number_of
2784 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2785 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2786 Orderings.min ~> Orderings.ord_class.min
2787 Orderings.max ~> Orderings.ord_class.max
2788 Divides.op div ~> Divides.div_class.div
2789 Divides.op mod ~> Divides.div_class.mod
2790 Divides.op dvd ~> Divides.div_class.dvd
2792 INCOMPATIBILITY. Adaptions may be required in the following cases:
2794 a) User-defined constants using any of the names "plus", "minus",
2795 "times", "less" or "less_eq". The standard syntax translations for
2796 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2799 b) Variables named "plus", "minus", "times", "less", "less_eq"
2800 INCOMPATIBILITY: use more specific names.
2802 c) Permutative equations (e.g. "a + b = b + a")
2803 Since the change of names also changes the order of terms, permutative
2804 rewrite rules may get applied in a different order. Experience shows
2805 that this is rarely the case (only two adaptions in the whole Isabelle
2806 distribution). INCOMPATIBILITY: rewrite proofs
2808 d) ML code directly refering to constant names
2809 This in general only affects hand-written proof tactics, simprocs and
2810 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2811 Consider using @{const_name} antiquotation.
2813 * New class "default" with associated constant "default".
2815 * Function "sgn" is now overloaded and available on int, real, complex
2816 (and other numeric types), using class "sgn". Two possible defs of
2817 sgn are given as equational assumptions in the classes sgn_if and
2818 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2821 * Locale "partial_order" now unified with class "order" (cf. theory
2822 Orderings), added parameter "less". INCOMPATIBILITY.
2824 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2825 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2826 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2828 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2829 changed order of proof goals in instance proofs.
2831 * The transitivity reasoner for partial and linear orders is set up
2832 for classes "order" and "linorder". Instances of the reasoner are available
2833 in all contexts importing or interpreting the corresponding locales.
2834 Method "order" invokes the reasoner separately; the reasoner
2835 is also integrated with the Simplifier as a solver. Diagnostic
2836 command 'print_orders' shows the available instances of the reasoner
2837 in the current context.
2839 * Localized monotonicity predicate in theory "Orderings"; integrated
2840 lemmas max_of_mono and min_of_mono with this predicate.
2843 * Formulation of theorem "dense" changed slightly due to integration
2844 with new class dense_linear_order.
2846 * Uniform lattice theory development in HOL.
2848 constants "meet" and "join" now named "inf" and "sup"
2849 constant "Meet" now named "Inf"
2851 classes "meet_semilorder" and "join_semilorder" now named
2852 "lower_semilattice" and "upper_semilattice"
2853 class "lorder" now named "lattice"
2854 class "comp_lat" now named "complete_lattice"
2856 Instantiation of lattice classes allows explicit definitions
2857 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2859 INCOMPATIBILITY. Theorem renames:
2861 meet_left_le ~> inf_le1
2862 meet_right_le ~> inf_le2
2863 join_left_le ~> sup_ge1
2864 join_right_le ~> sup_ge2
2865 meet_join_le ~> inf_sup_ord
2868 le_meet ~> le_inf_iff
2869 le_join ~> ge_sup_conv
2870 meet_idempotent ~> inf_idem
2871 join_idempotent ~> sup_idem
2872 meet_comm ~> inf_commute
2873 join_comm ~> sup_commute
2874 meet_leI1 ~> le_infI1
2875 meet_leI2 ~> le_infI2
2876 le_joinI1 ~> le_supI1
2877 le_joinI2 ~> le_supI2
2878 meet_assoc ~> inf_assoc
2879 join_assoc ~> sup_assoc
2880 meet_left_comm ~> inf_left_commute
2881 meet_left_idempotent ~> inf_left_idem
2882 join_left_comm ~> sup_left_commute
2883 join_left_idempotent ~> sup_left_idem
2886 le_def_meet ~> le_iff_inf
2887 le_def_join ~> le_iff_sup
2888 join_absorp2 ~> sup_absorb2
2889 join_absorp1 ~> sup_absorb1
2890 meet_absorp1 ~> inf_absorb1
2891 meet_absorp2 ~> inf_absorb2
2892 meet_join_absorp ~> inf_sup_absorb
2893 join_meet_absorp ~> sup_inf_absorb
2894 distrib_join_le ~> distrib_sup_le
2895 distrib_meet_le ~> distrib_inf_le
2897 add_meet_distrib_left ~> add_inf_distrib_left
2898 add_join_distrib_left ~> add_sup_distrib_left
2899 is_join_neg_meet ~> is_join_neg_inf
2900 is_meet_neg_join ~> is_meet_neg_sup
2901 add_meet_distrib_right ~> add_inf_distrib_right
2902 add_join_distrib_right ~> add_sup_distrib_right
2903 add_meet_join_distribs ~> add_sup_inf_distribs
2904 join_eq_neg_meet ~> sup_eq_neg_inf
2905 meet_eq_neg_join ~> inf_eq_neg_sup
2906 add_eq_meet_join ~> add_eq_inf_sup
2907 meet_0_imp_0 ~> inf_0_imp_0
2908 join_0_imp_0 ~> sup_0_imp_0
2909 meet_0_eq_0 ~> inf_0_eq_0
2910 join_0_eq_0 ~> sup_0_eq_0
2911 neg_meet_eq_join ~> neg_inf_eq_sup
2912 neg_join_eq_meet ~> neg_sup_eq_inf
2913 join_eq_if ~> sup_eq_if
2915 mono_meet ~> mono_inf
2916 mono_join ~> mono_sup
2917 meet_bool_eq ~> inf_bool_eq
2918 join_bool_eq ~> sup_bool_eq
2919 meet_fun_eq ~> inf_fun_eq
2920 join_fun_eq ~> sup_fun_eq
2921 meet_set_eq ~> inf_set_eq
2922 join_set_eq ~> sup_set_eq
2923 meet1_iff ~> inf1_iff
2924 meet2_iff ~> inf2_iff
2933 join1_iff ~> sup1_iff
2934 join2_iff ~> sup2_iff
2944 is_meet_Meet ~> is_meet_Inf
2945 Meet_bool_def ~> Inf_bool_def
2946 Meet_fun_def ~> Inf_fun_def
2947 Meet_greatest ~> Inf_greatest
2948 Meet_lower ~> Inf_lower
2949 Meet_set_def ~> Inf_set_def
2952 Sup_bool_eq ~> Sup_bool_def
2953 Sup_fun_eq ~> Sup_fun_def
2954 Sup_set_eq ~> Sup_set_def
2956 listsp_meetI ~> listsp_infI
2957 listsp_meet_eq ~> listsp_inf_eq
2962 * Added syntactic class "size"; overloaded constant "size" now has
2963 type "'a::size ==> bool"
2965 * Internal reorganisation of `size' of datatypes: size theorems
2966 "foo.size" are no longer subsumed by "foo.simps" (but are still
2967 simplification rules by default!); theorems "prod.size" now named
2970 * Class "div" now inherits from class "times" rather than "type".
2973 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2974 Linorder etc. have disappeared; operations defined in terms of
2975 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2977 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2979 * HOL-Word: New extensive library and type for generic, fixed size
2980 machine words, with arithemtic, bit-wise, shifting and rotating
2981 operations, reflection into int, nat, and bool lists, automation for
2982 linear arithmetic (by automatic reflection into nat or int), including
2983 lemmas on overflow and monotonicity. Instantiated to all appropriate
2984 arithmetic type classes, supporting automatic simplification of
2985 numerals on all operations.
2987 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2989 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2991 * Code generator library theories:
2992 - Code_Integer represents HOL integers by big integer literals in target
2994 - Code_Char represents HOL characters by character literals in target
2996 - Code_Char_chr like Code_Char, but also offers treatment of character
2997 codes; includes Code_Integer.
2998 - Executable_Set allows to generate code for finite sets using lists.
2999 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3001 - Executable_Real implements a subset of real numbers, namly those
3002 representable by rational numbers.
3003 - Efficient_Nat implements natural numbers by integers, which in general will
3004 result in higher efficency; pattern matching with 0/Suc is eliminated;
3005 includes Code_Integer.
3006 - Code_Index provides an additional datatype index which is mapped to
3007 target-language built-in integers.
3008 - Code_Message provides an additional datatype message_string which is isomorphic to
3009 strings; messages are mapped to target-language strings.
3011 * New package for inductive predicates
3013 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3016 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3017 for z_1 :: U_1 and ... and z_n :: U_m
3019 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3022 with full support for type-inference, rather than
3024 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3026 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3027 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3029 inductive "s z_1 ... z_m"
3031 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3034 For backward compatibility, there is a wrapper allowing inductive
3035 sets to be defined with the new package via
3038 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3039 for z_1 :: U_1 and ... and z_n :: U_m
3041 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3047 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3048 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3049 for z_1 :: U_1 and ... and z_n :: U_m
3051 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3052 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3055 if the additional syntax "p ..." is required.
3057 Numerous examples can be found in the subdirectories src/HOL/Auth,
3058 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3062 - Since declaration and definition of inductive sets or predicates
3063 is no longer separated, abbreviations involving the newly
3064 introduced sets or predicates must be specified together with the
3065 introduction rules after the 'where' keyword (see above), rather
3066 than before the actual inductive definition.
3068 - The variables in induction and elimination rules are now
3069 quantified in the order of their occurrence in the introduction
3070 rules, rather than in alphabetical order. Since this may break
3071 some proofs, these proofs either have to be repaired, e.g. by
3072 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3073 statements of the form
3075 case (rule_i a_i_1 ... a_i_{k_i})
3077 or the old order of quantification has to be restored by explicitly adding
3078 meta-level quantifiers in the introduction rules, i.e.
3080 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3082 - The format of the elimination rules is now
3084 p z_1 ... z_m x_1 ... x_n ==>
3085 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3090 (x_1, ..., x_n) : s z_1 ... z_m ==>
3091 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3094 for sets rather than
3096 x : s z_1 ... z_m ==>
3097 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3100 This may require terms in goals to be expanded to n-tuples
3101 (e.g. using case_tac or simplification with the split_paired_all
3102 rule) before the above elimination rule is applicable.
3104 - The elimination or case analysis rules for (mutually) inductive
3105 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3106 list of rules "p_1_..._p_k.elims" is no longer available.
3108 * New package "function"/"fun" for general recursive functions,
3109 supporting mutual and nested recursion, definitions in local contexts,
3110 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3111 for small examples, and the separate tutorial on the function
3112 package. The old recdef "package" is still available as before, but
3113 users are encouraged to use the new package.
3115 * Method "lexicographic_order" automatically synthesizes termination
3116 relations as lexicographic combinations of size measures.
3118 * Case-expressions allow arbitrary constructor-patterns (including
3119 "_") and take their order into account, like in functional
3120 programming. Internally, this is translated into nested
3121 case-expressions; missing cases are added and mapped to the predefined
3122 constant "undefined". In complicated cases printing may no longer show
3123 the original input but the internal form. Lambda-abstractions allow
3124 the same form of pattern matching: "% pat1 => e1 | ..." is an
3125 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3128 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3129 is an abbreviation for "of_nat :: nat => int". The simplification
3130 rules for "of_nat" have been changed to work like "int" did
3131 previously. Potential INCOMPATIBILITY:
3132 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3133 - of_nat_diff and of_nat_mult are no longer default simp rules
3135 * Method "algebra" solves polynomial equations over (semi)rings using
3136 Groebner bases. The (semi)ring structure is defined by locales and the
3137 tool setup depends on that generic context. Installing the method for
3138 a specific type involves instantiating the locale and possibly adding
3139 declarations for computation on the coefficients. The method is
3140 already instantiated for natural numbers and for the axiomatic class
3141 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3142 CALCULEMUS 2007 for the general principles underlying this
3143 architecture of context-aware proof-tools.
3145 * Method "ferrack" implements quantifier elimination over
3146 special-purpose dense linear orders using locales (analogous to
3147 "algebra"). The method is already installed for class
3148 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3151 * Former constant "List.op @" now named "List.append". Use ML
3152 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3153 circumvent possible incompatibilities when working on ML level.
3155 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3157 * New function listsum :: 'a list => 'a for arbitrary monoids.
3158 Special syntax: "SUM x <- xs. f x" (and latex variants)
3160 * New syntax for Haskell-like list comprehension (input only), eg.
3161 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3163 * The special syntax for function "filter" has changed from [x :
3164 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3165 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3167 * [a..b] is now defined for arbitrary linear orders. It used to be
3168 defined on nat only, as an abbreviation for [a..<Suc b]
3171 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3173 * New functions "sorted" and "sort" in src/HOL/List.thy.
3175 * New lemma collection field_simps (an extension of ring_simps) for
3176 manipulating (in)equations involving division. Multiplies with all
3177 denominators that can be proved to be non-zero (in equations) or
3178 positive/negative (in inequations).
3180 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3181 have been improved and renamed to ring_simps, group_simps and
3182 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3183 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3185 * Theory Library/Commutative_Ring: switched from recdef to function
3186 package; constants add, mul, pow now curried. Infix syntax for
3187 algebraic operations.
3189 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3192 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3195 * HOL/records: generalised field-update to take a function on the
3196 field rather than the new value: r(|A := x|) is translated to A_update
3197 (K x) r The K-combinator that is internally used is called K_record.
3198 INCOMPATIBILITY: Usage of the plain update functions has to be
3201 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3202 * x = 0, which are required for a semiring. Richer structures do not
3203 inherit from semiring_0 anymore, because this property is a theorem
3204 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3205 there is more to prove, but this is mostly trivial.
3207 * Class "recpower" is generalized to arbitrary monoids, not just
3208 commutative semirings. INCOMPATIBILITY: may need to incorporate
3209 commutativity or semiring properties additionally.
3211 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3212 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3213 better use 'abbreviation'.
3215 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3217 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3218 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3219 significant changes for setting up numeral syntax for types:
3220 - New constants Numeral.pred and Numeral.succ instead
3221 of former Numeral.bin_pred and Numeral.bin_succ.
3222 - Use integer operations instead of bin_add, bin_mult and so on.
3223 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3224 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3226 See src/HOL/Integ/IntArith.thy for an example setup.
3228 * Command 'normal_form' computes the normal form of a term that may
3229 contain free variables. For example ``normal_form "rev [a, b, c]"''
3230 produces ``[b, c, a]'' (without proof). This command is suitable for
3231 heavy-duty computations because the functions are compiled to ML
3232 first. Correspondingly, a method "normalization" is provided. See
3233 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3235 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3236 25 like -->); output depends on the "iff" print_mode, the default is
3237 "A = B" (with priority 50).
3239 * Relations less (<) and less_eq (<=) are also available on type bool.
3240 Modified syntax to disallow nesting without explicit parentheses,
3241 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3244 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3246 * Relation composition operator "op O" now has precedence 75 and binds
3247 stronger than union and intersection. INCOMPATIBILITY.
3249 * The old set interval syntax "{m..n(}" (and relatives) has been
3250 removed. Use "{m..<n}" (and relatives) instead.
3252 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3253 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3254 ``declare [[simproc del: neq]]''.
3256 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3259 * Theorem Cons_eq_map_conv no longer declared as "simp".
3261 * Theorem setsum_mult renamed to setsum_right_distrib.
3263 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3266 * Reimplemented methods "sat" and "satx", with several improvements:
3267 goals no longer need to be stated as "<prems> ==> False", equivalences
3268 (i.e. "=" on type bool) are handled, variable names of the form
3269 "lit_<n>" are no longer reserved, significant speedup.
3271 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3272 zChaff is still supported as well.
3274 * 'inductive' and 'datatype': provide projections of mutual rules,
3275 bundled as foo_bar.inducts;
3277 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3280 * Library: moved theory Accessible_Part to main HOL.
3282 * Library: added theory Coinductive_List of potentially infinite lists
3283 as greatest fixed-point.
3285 * Library: added theory AssocList which implements (finite) maps as
3288 * Method "evaluation" solves goals (i.e. a boolean expression)
3289 efficiently by compiling it to ML. The goal is "proved" (via an
3290 oracle) if it evaluates to True.
3292 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3293 also when invoked by the simplifier. This results in the Simplifier
3294 being more powerful on arithmetic goals. INCOMPATIBILITY.
3295 Configuration option fast_arith_split_limit=0 recovers the old
3298 * Support for hex (0x20) and binary (0b1001) numerals.
3300 * New method: reify eqs (t), where eqs are equations for an
3301 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3302 parameter, computes a term s::'b and a list xs::'a list and proves the
3303 theorem I xs s = t. This is also known as reification or quoting. The
3304 resulting theorem is applied to the subgoal to substitute t with I xs
3305 s. If t is omitted, the subgoal itself is reified.
3307 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3308 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3309 where f is supposed to be a computable function (in the sense of code
3310 generattion). The method uses reify to compute s and xs as above then
3311 applies corr_thm and uses normalization by evaluation to "prove" f s =
3312 r and finally gets the theorem t = r, which is again applied to the
3313 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3315 * Reflection: Automatic reification now handels binding, an example is
3316 available in src/HOL/ex/ReflectionEx.thy
3318 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3319 command 'statespace' that is similar to 'record', but introduces an
3320 abstract specification based on the locale infrastructure instead of
3321 HOL types. This leads to extra flexibility in composing state spaces,
3322 in particular multiple inheritance and renaming of components.
3327 * Hyperreal: Functions root and sqrt are now defined on negative real
3328 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3329 Nonnegativity side conditions have been removed from many lemmas, so
3330 that more subgoals may now be solved by simplification; potential
3333 * Real: new type classes formalize real normed vector spaces and
3334 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3335 and norm :: 'a => real.
3337 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3338 reals into other types. The overloaded constant Reals :: 'a set is now
3339 defined as range of_real; potential INCOMPATIBILITY.
3341 * Real: proper support for ML code generation, including 'quickcheck'.
3342 Reals are implemented as arbitrary precision rationals.
3344 * Hyperreal: Several constants that previously worked only for the
3345 reals have been generalized, so they now work over arbitrary vector
3346 spaces. Type annotations may need to be added in some cases; potential
3349 Infinitesimal :: ('a::real_normed_vector) star set
3350 HFinite :: ('a::real_normed_vector) star set
3351 HInfinite :: ('a::real_normed_vector) star set
3352 approx :: ('a::real_normed_vector) star => 'a star => bool
3353 monad :: ('a::real_normed_vector) star => 'a star set
3354 galaxy :: ('a::real_normed_vector) star => 'a star set
3355 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3356 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3357 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3358 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3359 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3360 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3361 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3362 sgn :: 'a::real_normed_vector => 'a
3363 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3365 * Complex: Some complex-specific constants are now abbreviations for
3366 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3367 hnorm. Other constants have been entirely removed in favor of the
3368 polymorphic versions (INCOMPATIBILITY):
3372 HInfinite <-- CInfinite
3373 Infinitesimal <-- CInfinitesimal
3376 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3377 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3378 (ns)deriv <-- (ns)cderiv
3383 * Formalisation of ideals and the quotient construction over rings.
3385 * Order and lattice theory no longer based on records.
3388 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3389 greatest_closed. INCOMPATIBILITY.
3391 * Method algebra is now set up via an attribute. For examples see
3392 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3393 of algebraic structures.
3395 * Renamed theory CRing to Ring.
3400 * Substantial, yet incomplete support for nominal datatypes (binding
3401 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3402 src/HOL/Nominal/Examples. Prospective users should consult
3403 http://isabelle.in.tum.de/nominal/
3408 * ML basics: just one true type int, which coincides with IntInf.int
3411 * ML within Isar: antiquotations allow to embed statically-checked
3412 formal entities in the source, referring to the context available at
3413 compile-time. For example:
3415 ML {* @{sort "{zero,one}"} *}
3416 ML {* @{typ "'a => 'b"} *}
3417 ML {* @{term "%x. x"} *}
3418 ML {* @{prop "x == y"} *}
3419 ML {* @{ctyp "'a => 'b"} *}
3420 ML {* @{cterm "%x. x"} *}
3421 ML {* @{cprop "x == y"} *}
3422 ML {* @{thm asm_rl} *}
3423 ML {* @{thms asm_rl} *}
3424 ML {* @{type_name c} *}
3425 ML {* @{type_syntax c} *}
3426 ML {* @{const_name c} *}
3427 ML {* @{const_syntax c} *}
3430 ML {* @{theory Pure} *}
3431 ML {* @{theory_ref} *}
3432 ML {* @{theory_ref Pure} *}
3435 ML {* @{clasimpset} *}
3437 The same works for sources being ``used'' within an Isar context.
3439 * ML in Isar: improved error reporting; extra verbosity with
3440 ML_Context.trace enabled.
3442 * Pure/General/table.ML: the join operations now works via exceptions
3443 DUP/SAME instead of type option. This is simpler in simple cases, and
3444 admits slightly more efficient complex applications.
3446 * Pure: 'advanced' translation functions (parse_translation etc.) now
3447 use Context.generic instead of just theory.
3449 * Pure: datatype Context.generic joins theory/Proof.context and
3450 provides some facilities for code that works in either kind of
3451 context, notably GenericDataFun for uniform theory and proof data.
3453 * Pure: simplified internal attribute type, which is now always
3454 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3455 local (Proof.context) attributes have been discontinued, while
3456 minimizing code duplication. Thm.rule_attribute and
3457 Thm.declaration_attribute build canonical attributes; see also structure
3458 Context for further operations on Context.generic, notably
3459 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3460 declarations and definitions.
3462 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3463 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3464 init only required for impure data. INCOMPATIBILITY: empty really need
3465 to be empty (no dependencies on theory content!)
3467 * Pure/kernel: consts certification ignores sort constraints given in
3468 signature declarations. (This information is not relevant to the
3469 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3470 potential INCOMPATIBILITY.
3472 * Pure: axiomatic type classes are now purely definitional, with
3473 explicit proofs of class axioms and super class relations performed
3474 internally. See Pure/axclass.ML for the main internal interfaces --
3475 notably AxClass.define_class supercedes AxClass.add_axclass, and
3476 AxClass.axiomatize_class/classrel/arity supersede
3477 Sign.add_classes/classrel/arities.
3479 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3480 global/local versions on theory vs. Proof.context have been
3481 discontinued; Attrib.syntax and Method.syntax have been adapted
3482 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3483 attributes, methods, etc.
3485 * Pure: several functions of signature "... -> theory -> theory * ..."
3486 have been reoriented to "... -> theory -> ... * theory" in order to
3487 allow natural usage in combination with the ||>, ||>>, |-> and
3488 fold_map combinators.
3490 * Pure: official theorem names (closed derivations) and additional
3491 comments (tags) are now strictly separate. Name hints -- which are
3492 maintained as tags -- may be attached any time without affecting the
3495 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3496 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3497 achieve the old behaviour.
3499 * Pure: the "Goal" constant is now called "prop", supporting a
3500 slightly more general idea of ``protecting'' meta-level rule
3503 * Pure: Logic.(un)varify only works in a global context, which is now
3504 enforced instead of silently assumed. INCOMPATIBILITY, may use
3505 Logic.legacy_(un)varify as temporary workaround.
3507 * Pure: structure Name provides scalable operations for generating
3508 internal variable names, notably Name.variants etc. This replaces
3509 some popular functions from term.ML:
3511 Term.variant -> Name.variant
3512 Term.variantlist -> Name.variant_list
3513 Term.invent_names -> Name.invent_list
3515 Note that low-level renaming rarely occurs in new code -- operations
3516 from structure Variable are used instead (see below).
3518 * Pure: structure Variable provides fundamental operations for proper
3519 treatment of fixed/schematic variables in a context. For example,
3520 Variable.import introduces fixes for schematics of given facts and
3521 Variable.export reverses the effect (up to renaming) -- this replaces
3522 various freeze_thaw operations.
3524 * Pure: structure Goal provides simple interfaces for
3525 init/conclude/finish and tactical prove operations (replacing former
3526 Tactic.prove). Goal.prove is the canonical way to prove results
3527 within a given context; Goal.prove_global is a degraded version for
3528 theory level goals, including a global Drule.standard. Note that
3529 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3530 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3531 in a locale context).
3533 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3534 and type checking (Syntax.check_term etc.), with common combinations
3535 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3536 which are considered legacy and await removal.
3538 * Pure/Syntax: generic interfaces for type unchecking
3539 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3540 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3541 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3542 available for convenience, but refer to the very same operations using
3543 a mere theory instead of a full context.
3545 * Isar: simplified treatment of user-level errors, using exception
3546 ERROR of string uniformly. Function error now merely raises ERROR,
3547 without any side effect on output channels. The Isar toplevel takes
3548 care of proper display of ERROR exceptions. ML code may use plain
3549 handle/can/try; cat_error may be used to concatenate errors like this:
3551 ... handle ERROR msg => cat_error msg "..."
3553 Toplevel ML code (run directly or through the Isar toplevel) may be
3554 embedded into the Isar toplevel with exception display/debug like
3557 Isar.toplevel (fn () => ...)
3559 INCOMPATIBILITY, removed special transform_error facilities, removed
3560 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3561 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3562 -- use plain ERROR instead.
3564 * Isar: theory setup now has type (theory -> theory), instead of a
3565 list. INCOMPATIBILITY, may use #> to compose setup functions.
3567 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3568 ProofContext.debug/verbose flags.
3570 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3571 theory before entering a proof state. Transactions now always see a
3572 quasi-functional intermediate checkpoint, both in interactive and
3575 * Isar: simplified interfaces for outer syntax. Renamed
3576 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3577 OuterSyntax.add_parsers -- this functionality is now included in
3578 OuterSyntax.command etc. INCOMPATIBILITY.
3580 * Simplifier: the simpset of a running simplification process now
3581 contains a proof context (cf. Simplifier.the_context), which is the
3582 very context that the initial simpset has been retrieved from (by
3583 simpset_of/local_simpset_of). Consequently, all plug-in components
3584 (solver, looper etc.) may depend on arbitrary proof data.
3586 * Simplifier.inherit_context inherits the proof context (plus the
3587 local bounds) of the current simplification process; any simproc
3588 etc. that calls the Simplifier recursively should do this! Removed
3589 former Simplifier.inherit_bounds, which is already included here --
3590 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3591 specify an explicit context using Simplifier.context/theory_context.
3593 * Simplifier/Classical Reasoner: more abstract interfaces
3594 change_simpset/claset for modifying the simpset/claset reference of a
3595 theory; raw versions simpset/claset_ref etc. have been discontinued --
3598 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3604 * settings: the default heap location within ISABELLE_HOME_USER now
3605 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3606 Isabelle installations.
3608 * isabelle-process: option -S (secure mode) disables some critical
3609 operations, notably runtime compilation and evaluation of ML source
3612 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3614 * Support for parallel execution, using native multicore support of
3615 Poly/ML 5.1. The theory loader exploits parallelism when processing
3616 independent theories, according to the given theory header
3617 specifications. The maximum number of worker threads is specified via
3618 usedir option -M or the "max-threads" setting in Proof General. A
3619 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3620 to 6 on a 8-core machine. User-code needs to observe certain
3621 guidelines for thread-safe programming, see appendix A in the Isar
3622 Implementation manual.
3626 New in Isabelle2005 (October 2005)
3627 ----------------------------------
3631 * Theory headers: the new header syntax for Isar theories is
3634 imports <theory1> ... <theoryN>
3635 uses <file1> ... <fileM>
3638 where the 'uses' part is optional. The previous syntax
3640 theory <name> = <theory1> + ... + <theoryN>:
3642 will disappear in the next release. Use isatool fixheaders to convert
3643 existing theory files. Note that there is no change in ancient
3644 non-Isar theories now, but these will disappear soon.
3646 * Theory loader: parent theories can now also be referred to via
3647 relative and absolute paths.
3649 * Command 'find_theorems' searches for a list of criteria instead of a
3650 list of constants. Known criteria are: intro, elim, dest, name:string,
3651 simp:term, and any term. Criteria can be preceded by '-' to select
3652 theorems that do not match. Intro, elim, dest select theorems that
3653 match the current goal, name:s selects theorems whose fully qualified
3654 name contain s, and simp:term selects all simplification rules whose
3655 lhs match term. Any other term is interpreted as pattern and selects
3656 all theorems matching the pattern. Available in ProofGeneral under
3657 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3659 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3661 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3662 matching the current goal as introduction rule and not having "HOL."
3663 in their name (i.e. not being defined in theory HOL).
3665 * Command 'thms_containing' has been discontinued in favour of
3666 'find_theorems'; INCOMPATIBILITY.
3668 * Communication with Proof General is now 8bit clean, which means that
3669 Unicode text in UTF-8 encoding may be used within theory texts (both
3670 formal and informal parts). Cf. option -U of the Isabelle Proof
3671 General interface. Here are some simple examples (cf. src/HOL/ex):
3673 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3674 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3676 * Improved efficiency of the Simplifier and, to a lesser degree, the
3677 Classical Reasoner. Typical big applications run around 2 times
3681 *** Document preparation ***
3683 * Commands 'display_drafts' and 'print_drafts' perform simple output
3684 of raw sources. Only those symbols that do not require additional
3685 LaTeX packages (depending on comments in isabellesym.sty) are
3686 displayed properly, everything else is left verbatim. isatool display
3687 and isatool print are used as front ends (these are subject to the
3688 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3690 * Command tags control specific markup of certain regions of text,
3691 notably folding and hiding. Predefined tags include "theory" (for
3692 theory begin and end), "proof" for proof commands, and "ML" for
3693 commands involving ML code; the additional tags "visible" and
3694 "invisible" are unused by default. Users may give explicit tag
3695 specifications in the text, e.g. ''by %invisible (auto)''. The
3696 interpretation of tags is determined by the LaTeX job during document
3697 preparation: see option -V of isatool usedir, or options -n and -t of
3698 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3701 Several document versions may be produced at the same time via isatool
3702 usedir (the generated index.html will link all of them). Typical
3703 specifications include ''-V document=theory,proof,ML'' to present
3704 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3705 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3706 these parts without any formal replacement text. The Isabelle site
3707 default settings produce ''document'' and ''outline'' versions as
3710 * Several new antiquotations:
3712 @{term_type term} prints a term with its type annotated;
3714 @{typeof term} prints the type of a term;
3716 @{const const} is the same as @{term const}, but checks that the
3717 argument is a known logical constant;
3719 @{term_style style term} and @{thm_style style thm} print a term or
3720 theorem applying a "style" to it
3724 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3725 definitions, equations, inequations etc., 'concl' printing only the
3726 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3727 to print the specified premise. TermStyle.add_style provides an ML
3728 interface for introducing further styles. See also the "LaTeX Sugar"
3729 document practical applications. The ML antiquotation prints
3730 type-checked ML expressions verbatim.
3732 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3733 and 'text' support optional locale specification '(in loc)', which
3734 specifies the default context for interpreting antiquotations. For
3735 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3737 * Option 'locale=NAME' of antiquotations specifies an alternative
3738 context interpreting the subsequent argument. For example: @{thm
3739 [locale=lattice] inf_assoc}.
3741 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3744 * Proper output of antiquotations for theory commands involving a
3745 proof context (such as 'locale' or 'theorem (in loc) ...').
3747 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3748 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3750 * isatool usedir: new option -C (default true) controls whether option
3751 -D should include a copy of the original document directory; -C false
3752 prevents unwanted effects such as copying of administrative CVS data.
3757 * Considerably improved version of 'constdefs' command. Now performs
3758 automatic type-inference of declared constants; additional support for
3759 local structure declarations (cf. locales and HOL records), see also
3760 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3761 sequential dependencies of definitions within a single 'constdefs'
3762 section; moreover, the declared name needs to be an identifier. If
3763 all fails, consider to fall back on 'consts' and 'defs' separately.
3765 * Improved indexed syntax and implicit structures. First of all,
3766 indexed syntax provides a notational device for subscripted
3767 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3768 expressions. Secondly, in a local context with structure
3769 declarations, number indexes \<^sub>n or the empty index (default
3770 number 1) refer to a certain fixed variable implicitly; option
3771 show_structs controls printing of implicit structures. Typical
3772 applications of these concepts involve record types and locales.
3774 * New command 'no_syntax' removes grammar declarations (and
3775 translations) resulting from the given syntax specification, which is
3776 interpreted in the same manner as for the 'syntax' command.
3778 * 'Advanced' translation functions (parse_translation etc.) may depend
3779 on the signature of the theory context being presently used for
3780 parsing/printing, see also isar-ref manual.
3782 * Improved 'oracle' command provides a type-safe interface to turn an
3783 ML expression of type theory -> T -> term into a primitive rule of
3784 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3785 is already included here); see also FOL/ex/IffExample.thy;
3788 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3789 before); "cI" is no longer bound, use "c.intro" instead.
3790 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3791 axclasses vs. locales.
3793 * Improved internal renaming of symbolic identifiers -- attach primes
3794 instead of base 26 numbers.
3796 * New flag show_question_marks controls printing of leading question
3797 marks in schematic variable names.
3799 * In schematic variable names, *any* symbol following \<^isub> or
3800 \<^isup> is now treated as part of the base name. For example, the
3801 following works without printing of awkward ".0" indexes:
3803 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3806 * Inner syntax includes (*(*nested*) comments*).
3808 * Pretty printer now supports unbreakable blocks, specified in mixfix
3809 annotations as "(00...)".
3811 * Clear separation of logical types and nonterminals, where the latter
3812 may only occur in 'syntax' specifications or type abbreviations.
3813 Before that distinction was only partially implemented via type class
3814 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3815 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3816 exotic syntax specifications may require further adaption
3817 (e.g. Cube/Cube.thy).
3819 * Removed obsolete type class "logic", use the top sort {} instead.
3820 Note that non-logical types should be declared as 'nonterminals'
3821 rather than 'types'. INCOMPATIBILITY for new object-logic
3824 * Attributes 'induct' and 'cases': type or set names may now be
3825 locally fixed variables as well.
3827 * Simplifier: can now control the depth to which conditional rewriting
3828 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3831 * Simplifier: simplification procedures may now take the current
3832 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3833 interface), which is very useful for calling the Simplifier
3834 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3835 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3836 low-level mk_simproc no longer applies Logic.varify internally, to
3837 allow for use in a context of fixed variables.
3839 * thin_tac now works even if the assumption being deleted contains !!
3840 or ==>. More generally, erule now works even if the major premise of
3841 the elimination rule contains !! or ==>.
3843 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3845 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3846 from Pure, which contains all common declarations already. Both
3847 theories are defined via plain Isabelle/Isar .thy files.
3848 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3849 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3850 use isatool fixcpure to adapt your theory and ML sources.
3852 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3853 selections of theorems in named facts via index ranges.
3855 * 'print_theorems': in theory mode, really print the difference
3856 wrt. the last state (works for interactive theory development only),
3857 in proof mode print all local facts (cf. 'print_facts');
3859 * 'hide': option '(open)' hides only base names.
3861 * More efficient treatment of intermediate checkpoints in interactive
3864 * Code generator is now invoked via code_module (incremental code
3865 generation) and code_library (modular code generation, ML structures
3866 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3867 must be quoted when used as identifiers.
3869 * New 'value' command for reading, evaluating and printing terms using
3870 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3871 quoted when used as identifier.
3876 * New commands for the interpretation of locale expressions in
3877 theories (1), locales (2) and proof contexts (3). These generate
3878 proof obligations from the expression specification. After the
3879 obligations have been discharged, theorems of the expression are added
3880 to the theory, target locale or proof context. The synopsis of the
3881 commands is a follows:
3883 (1) interpretation expr inst
3884 (2) interpretation target < expr
3885 (3) interpret expr inst
3887 Interpretation in theories and proof contexts require a parameter
3888 instantiation of terms from the current context. This is applied to
3889 specifications and theorems of the interpreted expression.
3890 Interpretation in locales only permits parameter renaming through the
3891 locale expression. Interpretation is smart in that interpretations
3892 that are active already do not occur in proof obligations, neither are
3893 instantiated theorems stored in duplicate. Use 'print_interps' to
3894 inspect active interpretations of a particular locale. For details,
3895 see the Isar Reference manual. Examples can be found in
3896 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3898 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3899 'interpret' instead.
3901 * New context element 'constrains' for adding type constraints to
3904 * Context expressions: renaming of parameters with syntax
3907 * Locale declaration: 'includes' disallowed.
3909 * Proper static binding of attribute syntax -- i.e. types / terms /
3910 facts mentioned as arguments are always those of the locale definition
3911 context, independently of the context of later invocations. Moreover,
3912 locale operations (renaming and type / term instantiation) are applied
3913 to attribute arguments as expected.
3915 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3916 actual attributes; rare situations may require Attrib.attribute to
3917 embed those attributes into Attrib.src that lack concrete syntax.
3918 Attribute implementations need to cooperate properly with the static
3919 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3920 Attrib.XXX_thm etc. already do the right thing without further
3921 intervention. Only unusual applications -- such as "where" or "of"
3922 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3923 on the context and the facts involved -- may have to assign parsed
3924 values to argument tokens explicitly.
3926 * Changed parameter management in theorem generation for long goal
3927 statements with 'includes'. INCOMPATIBILITY: produces a different
3928 theorem statement in rare situations.
3930 * Locale inspection command 'print_locale' omits notes elements. Use
3931 'print_locale!' to have them included in the output.
3936 * Provers/hypsubst.ML: improved version of the subst method, for
3937 single-step rewriting: it now works in bound variable contexts. New is
3938 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3939 rewrite a different subterm than the original subst method, which is
3940 still available as 'simplesubst'.
3942 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3945 * Provers/trancl.ML: new transitivity reasoner for transitive and
3946 reflexive-transitive closure of relations.
3948 * Provers/blast.ML: new reference depth_limit to make blast's depth
3949 limit (previously hard-coded with a value of 20) user-definable.
3951 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3952 is peformed already. Object-logics merely need to finish their
3953 initial simpset configuration as before. INCOMPATIBILITY.
3958 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3961 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3963 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3964 and x-symbol; use option '-m epsilon' to get it actually printed.
3965 Moreover, the mathematically important symbolic identifier \<epsilon>
3966 becomes available as variable, constant etc. INCOMPATIBILITY,
3968 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3969 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3970 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3971 support corresponding Isar calculations.
3973 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3976 * theory SetInterval: changed the syntax for open intervals:
3985 The old syntax is still supported but will disappear in the next
3986 release. For conversion use the following Emacs search and replace
3987 patterns (these are not perfect but work quite well):
3989 {)\([^\.]*\)\.\. -> {\1<\.\.}
3990 \.\.\([^(}]*\)(} -> \.\.<\1}
3992 * Theory Commutative_Ring (in Library): method comm_ring for proving
3993 equalities in commutative rings; method 'algebra' provides a generic
3996 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3997 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3998 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4001 Some new syntax forms are available:
4003 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4004 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4005 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4006 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4008 The latter form "\<Sum>x < k. e" used to be based on a separate
4009 function "Summation", which has been discontinued.
4011 * theory Finite_Set: in structured induction proofs, the insert case
4012 is now 'case (insert x F)' instead of the old counterintuitive 'case
4015 * The 'refute' command has been extended to support a much larger
4016 fragment of HOL, including axiomatic type classes, constdefs and
4017 typedefs, inductive datatypes and recursion.
4019 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4020 Requires zChaff with proof generation to be installed. See
4021 HOL/ex/SAT_Examples.thy for examples.
4023 * Datatype induction via method 'induct' now preserves the name of the
4024 induction variable. For example, when proving P(xs::'a list) by
4025 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4026 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4027 in unstructured proof scripts.
4029 * Reworked implementation of records. Improved scalability for
4030 records with many fields, avoiding performance problems for type
4031 inference. Records are no longer composed of nested field types, but
4032 of nested extension types. Therefore the record type only grows linear
4033 in the number of extensions and not in the number of fields. The
4034 top-level (users) view on records is preserved. Potential
4035 INCOMPATIBILITY only in strange cases, where the theory depends on the
4036 old record representation. The type generated for a record is called
4037 <record_name>_ext_type.
4039 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4040 proofs triggered by a record definition or a simproc (if
4041 quick_and_dirty is enabled). Definitions of large records can take
4044 New simproc record_upd_simproc for simplification of multiple record
4045 updates enabled by default. Moreover, trivial updates are also
4046 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4047 occasionally, since simplification is more powerful by default.
4049 * typedef: proper support for polymorphic sets, which contain extra
4050 type-variables in the term.
4052 * Simplifier: automatically reasons about transitivity chains
4053 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4054 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4055 old proofs break occasionally as simplification may now solve more
4056 goals than previously.
4058 * Simplifier: converts x <= y into x = y if assumption y <= x is
4059 present. Works for all partial orders (class "order"), in particular
4060 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4063 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4064 bound variable or a constant then the let is unfolded. Otherwise
4065 first a is simplified to b, and then f b is simplified to g. If
4066 possible we abstract b from g arriving at "let x = b in h x",
4067 otherwise we unfold the let and arrive at g. The simproc can be
4068 enabled/disabled by the reference use_let_simproc. Potential
4069 INCOMPATIBILITY since simplification is more powerful by default.
4071 * Classical reasoning: the meson method now accepts theorems as arguments.
4073 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4074 jobs to provide advice on the provability of subgoals.
4076 * Theory OrderedGroup and Ring_and_Field: various additions and
4077 improvements to faciliate calculations involving equalities and
4080 The following theorems have been eliminated or modified
4083 abs_eq now named abs_of_nonneg
4084 abs_of_ge_0 now named abs_of_nonneg
4085 abs_minus_eq now named abs_of_nonpos
4086 imp_abs_id now named abs_of_nonneg
4087 imp_abs_neg_id now named abs_of_nonpos
4088 mult_pos now named mult_pos_pos
4089 mult_pos_le now named mult_nonneg_nonneg
4090 mult_pos_neg_le now named mult_nonneg_nonpos
4091 mult_pos_neg2_le now named mult_nonneg_nonpos2
4092 mult_neg now named mult_neg_neg
4093 mult_neg_le now named mult_nonpos_nonpos
4095 * The following lemmas in Ring_and_Field have been added to the simplifier:
4098 not_square_less_zero
4100 The following lemmas have been deleted from Real/RealPow:
4110 * Theory Parity: added rules for simplifying exponents.
4114 The following theorems have been eliminated or modified
4117 list_all_Nil now named list_all.simps(1)
4118 list_all_Cons now named list_all.simps(2)
4119 list_all_conv now named list_all_iff
4120 set_mem_eq now named mem_iff
4122 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4123 asymptotic "big O" calculations. See the notes in BigO.thy.
4128 * Theory RealDef: better support for embedding natural numbers and
4129 integers in the reals.
4131 The following theorems have been eliminated or modified
4134 exp_ge_add_one_self now requires no hypotheses
4135 real_of_int_add reversed direction of equality (use [symmetric])
4136 real_of_int_minus reversed direction of equality (use [symmetric])
4137 real_of_int_diff reversed direction of equality (use [symmetric])
4138 real_of_int_mult reversed direction of equality (use [symmetric])
4140 * Theory RComplete: expanded support for floor and ceiling functions.
4142 * Theory Ln is new, with properties of the natural logarithm
4144 * Hyperreal: There is a new type constructor "star" for making
4145 nonstandard types. The old type names are now type synonyms:
4149 hcomplex = complex star
4151 * Hyperreal: Many groups of similarly-defined constants have been
4152 replaced by polymorphic versions (INCOMPATIBILITY):
4154 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4156 starset <-- starsetNat, starsetC
4157 *s* <-- *sNat*, *sc*
4158 starset_n <-- starsetNat_n, starsetC_n
4159 *sn* <-- *sNatn*, *scn*
4160 InternalSets <-- InternalNatSets, InternalCSets
4162 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4163 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4164 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4165 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4166 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4168 * Hyperreal: Many type-specific theorems have been removed in favor of
4169 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4171 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4172 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4173 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4174 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4175 right_minus <-- hypreal_add_minus
4176 left_minus <-- {hypreal,hcomplex}_add_minus_left
4177 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4178 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4179 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4180 mult_1_right <-- hcomplex_mult_one_right
4181 mult_zero_left <-- hcomplex_mult_zero_left
4182 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4183 right_distrib <-- hypnat_add_mult_distrib2
4184 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4185 right_inverse <-- hypreal_mult_inverse
4186 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4187 order_refl <-- {hypreal,hypnat}_le_refl
4188 order_trans <-- {hypreal,hypnat}_le_trans
4189 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4190 order_less_le <-- {hypreal,hypnat}_less_le
4191 linorder_linear <-- {hypreal,hypnat}_le_linear
4192 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4193 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4194 add_nonneg_nonneg <-- hypreal_le_add_order
4196 * Hyperreal: Separate theorems having to do with type-specific
4197 versions of constants have been merged into theorems that apply to the
4198 new polymorphic constants (INCOMPATIBILITY):
4200 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4201 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4202 STAR_Un <-- {STAR,NatStar,STARC}_Un
4203 STAR_Int <-- {STAR,NatStar,STARC}_Int
4204 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4205 STAR_subset <-- {STAR,NatStar,STARC}_subset
4206 STAR_mem <-- {STAR,NatStar,STARC}_mem
4207 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4208 STAR_diff <-- {STAR,STARC}_diff
4209 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4210 STARC_hcomplex_of_complex}_image_subset
4211 starset_n_Un <-- starset{Nat,C}_n_Un
4212 starset_n_Int <-- starset{Nat,C}_n_Int
4213 starset_n_Compl <-- starset{Nat,C}_n_Compl
4214 starset_n_diff <-- starset{Nat,C}_n_diff
4215 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4216 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4217 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4218 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4219 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4220 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4221 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4222 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4223 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4224 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4225 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4226 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4227 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4228 starfun_diff <-- starfun{C,RC,CR}_diff
4229 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4230 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4231 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4232 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4233 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4234 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4235 starfun_Id <-- starfunC_Id
4236 starfun_approx <-- starfun{Nat,CR}_approx
4237 starfun_capprox <-- starfun{C,RC}_capprox
4238 starfun_abs <-- starfunNat_rabs
4239 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4240 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4241 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4242 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4243 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4244 starfun_add_approx <-- starfunCR_add_approx
4245 starfun_inverse_inverse <-- starfunC_inverse_inverse
4246 starfun_divide <-- starfun{C,CR,RC}_divide
4247 starfun_n <-- starfun{Nat,C}_n
4248 starfun_n_mult <-- starfun{Nat,C}_n_mult
4249 starfun_n_add <-- starfun{Nat,C}_n_add
4250 starfun_n_add_minus <-- starfunNat_n_add_minus
4251 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4252 starfun_n_minus <-- starfun{Nat,C}_n_minus
4253 starfun_n_eq <-- starfun{Nat,C}_n_eq
4255 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4256 star_n_minus <-- {hypreal,hcomplex}_minus
4257 star_n_diff <-- {hypreal,hcomplex}_diff
4258 star_n_mult <-- {hypreal,hcomplex}_mult
4259 star_n_inverse <-- {hypreal,hcomplex}_inverse
4260 star_n_le <-- {hypreal,hypnat}_le
4261 star_n_less <-- {hypreal,hypnat}_less
4262 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4263 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4264 star_n_abs <-- hypreal_hrabs
4265 star_n_divide <-- hcomplex_divide
4267 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4268 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4269 star_of_diff <-- hypreal_of_real_diff
4270 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4271 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4272 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4273 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4274 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4275 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4276 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4277 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4278 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4279 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4280 star_of_number_of <-- {hypreal,hcomplex}_number_of
4281 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4282 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4283 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4284 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4285 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4286 star_of_power <-- hypreal_of_real_power
4287 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4289 * Hyperreal: new method "transfer" that implements the transfer
4290 principle of nonstandard analysis. With a subgoal that mentions
4291 nonstandard types like "'a star", the command "apply transfer"
4292 replaces it with an equivalent one that mentions only standard types.
4293 To be successful, all free variables must have standard types; non-
4294 standard variables must have explicit universal quantifiers.
4296 * Hyperreal: A theory of Taylor series.
4301 * Discontinued special version of 'constdefs' (which used to support
4302 continuous functions) in favor of the general Pure one with full
4305 * New simplification procedure for solving continuity conditions; it
4306 is much faster on terms with many nested lambda abstractions (cubic
4307 instead of exponential time).
4309 * New syntax for domain package: selector names are now optional.
4310 Parentheses should be omitted unless argument is lazy, for example:
4312 domain 'a stream = cons "'a" (lazy "'a stream")
4314 * New command 'fixrec' for defining recursive functions with pattern
4315 matching; defining multiple functions with mutual recursion is also
4316 supported. Patterns may include the constants cpair, spair, up, sinl,
4317 sinr, or any data constructor defined by the domain package. The given
4318 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4319 syntax and examples.
4321 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4322 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4323 but the proof obligation additionally includes an admissibility
4324 requirement. The packages generate instances of class cpo or pcpo,
4325 with continuity and strictness theorems for Rep and Abs.
4327 * HOLCF: Many theorems have been renamed according to a more standard naming
4328 scheme (INCOMPATIBILITY):
4330 foo_inject: "foo$x = foo$y ==> x = y"
4331 foo_eq: "(foo$x = foo$y) = (x = y)"
4332 foo_less: "(foo$x << foo$y) = (x << y)"
4333 foo_strict: "foo$UU = UU"
4334 foo_defined: "... ==> foo$x ~= UU"
4335 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4340 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4341 including the First Isomorphism Theorem (on quotienting by the kernel
4344 * ZF/Simplifier: install second copy of type solver that actually
4345 makes use of TC rules declared to Isar proof contexts (or locales);
4346 the old version is still required for ML proof scripts.
4351 * Converted to Isar theory format; use locales instead of axiomatic
4357 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4360 * Pure/library.ML no longer defines its own option datatype, but uses
4361 that of the SML basis, which has constructors NONE and SOME instead of
4362 None and Some, as well as exception Option.Option instead of OPTION.
4363 The functions the, if_none, is_some, is_none have been adapted
4364 accordingly, while Option.map replaces apsome.
4366 * Pure/library.ML: the exception LIST has been given up in favour of
4367 the standard exceptions Empty and Subscript, as well as
4368 Library.UnequalLengths. Function like Library.hd and Library.tl are
4369 superceded by the standard hd and tl functions etc.
4371 A number of basic list functions are no longer exported to the ML
4372 toplevel, as they are variants of predefined functions. The following
4373 suggests how one can translate existing code:
4375 rev_append xs ys = List.revAppend (xs, ys)
4376 nth_elem (i, xs) = List.nth (xs, i)
4377 last_elem xs = List.last xs
4378 flat xss = List.concat xss
4379 seq fs = List.app fs
4380 partition P xs = List.partition P xs
4381 mapfilter f xs = List.mapPartial f xs
4383 * Pure/library.ML: several combinators for linear functional
4384 transformations, notably reverse application and composition:
4387 (x, y) |-> f f #-> g
4389 * Pure/library.ML: introduced/changed precedence of infix operators:
4391 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4393 infix 3 o oo ooo oooo;
4394 infix 4 ~~ upto downto;
4396 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4399 * Pure/library.ML: natural list combinators fold, fold_rev, and
4400 fold_map support linear functional transformations and nesting. For
4403 fold f [x1, ..., xN] y =
4404 y |> f x1 |> ... |> f xN
4406 (fold o fold) f [xs1, ..., xsN] y =
4407 y |> fold f xs1 |> ... |> fold f xsN
4409 fold f [x1, ..., xN] =
4412 (fold o fold) f [xs1, ..., xsN] =
4413 fold f xs1 #> ... #> fold f xsN
4415 * Pure/library.ML: the following selectors on type 'a option are
4418 the: 'a option -> 'a (*partial*)
4419 these: 'a option -> 'a where 'a = 'b list
4420 the_default: 'a -> 'a option -> 'a
4421 the_list: 'a option -> 'a list
4423 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4424 basic operations for association lists, following natural argument
4425 order; moreover the explicit equality predicate passed here avoids
4426 potentially expensive polymorphic runtime equality checks.
4427 The old functions may be expressed as follows:
4429 assoc = uncurry (AList.lookup (op =))
4430 assocs = these oo AList.lookup (op =)
4431 overwrite = uncurry (AList.update (op =)) o swap
4433 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4435 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4436 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4438 replacing make_keylist and keyfilter (occassionally used)
4441 make_keylist = AList.make
4442 keyfilter = AList.find (op =)
4444 * eq_fst and eq_snd now take explicit equality parameter, thus
4445 avoiding eqtypes. Naive rewrites:
4447 eq_fst = eq_fst (op =)
4448 eq_snd = eq_snd (op =)
4450 * Removed deprecated apl and apr (rarely used).
4453 apl (n, op) =>>= curry op n
4454 apr (op, m) =>>= fn n => op (n, m)
4456 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4457 provides a reasonably efficient light-weight implementation of sets as
4460 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4461 few new operations; existing lookup and update are now curried to
4462 follow natural argument order (for use with fold etc.);
4463 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4465 * Pure/General: output via the Isabelle channels of
4466 writeln/warning/error etc. is now passed through Output.output, with a
4467 hook for arbitrary transformations depending on the print_mode
4468 (cf. Output.add_mode -- the first active mode that provides a output
4469 function wins). Already formatted output may be embedded into further
4470 text via Output.raw; the result of Pretty.string_of/str_of and derived
4471 functions (string_of_term/cterm/thm etc.) is already marked raw to
4472 accommodate easy composition of diagnostic messages etc. Programmers
4473 rarely need to care about Output.output or Output.raw at all, with
4474 some notable exceptions: Output.output is required when bypassing the
4475 standard channels (writeln etc.), or in token translations to produce
4476 properly formatted results; Output.raw is required when capturing
4477 already output material that will eventually be presented to the user
4478 a second time. For the default print mode, both Output.output and
4479 Output.raw have no effect.
4481 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4482 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4483 cumulative results are displayed at the end of a batch session.
4485 * Pure/General: File.sysify_path and File.quote_sysify path have been
4486 replaced by File.platform_path and File.shell_path (with appropriate
4487 hooks). This provides a clean interface for unusual systems where the
4488 internal and external process view of file names are different.
4490 * Pure: more efficient orders for basic syntactic entities: added
4491 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4492 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4493 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4494 orders now -- potential INCOMPATIBILITY for code that depends on a
4495 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4496 Library.sort_strings on result).
4498 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4499 fold_types traverse types/terms from left to right, observing natural
4500 argument order. Supercedes previous foldl_XXX versions, add_frees,
4501 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4503 * Pure: name spaces have been refined, with significant changes of the
4504 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4505 to extern(_table). The plain name entry path is superceded by a
4506 general 'naming' context, which also includes the 'policy' to produce
4507 a fully qualified name and external accesses of a fully qualified
4508 name; NameSpace.extend is superceded by context dependent
4509 Sign.declare_name. Several theory and proof context operations modify
4510 the naming context. Especially note Theory.restore_naming and
4511 ProofContext.restore_naming to get back to a sane state; note that
4512 Theory.add_path is no longer sufficient to recover from
4513 Theory.absolute_path in particular.
4515 * Pure: new flags short_names (default false) and unique_names
4516 (default true) for controlling output of qualified names. If
4517 short_names is set, names are printed unqualified. If unique_names is
4518 reset, the name prefix is reduced to the minimum required to achieve
4519 the original result when interning again, even if there is an overlap
4520 with earlier declarations.
4522 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4523 now 'extend', and 'merge' gets an additional Pretty.pp argument
4524 (useful for printing error messages). INCOMPATIBILITY.
4526 * Pure: major reorganization of the theory context. Type Sign.sg and
4527 Theory.theory are now identified, referring to the universal
4528 Context.theory (see Pure/context.ML). Actual signature and theory
4529 content is managed as theory data. The old code and interfaces were
4530 spread over many files and structures; the new arrangement introduces
4531 considerable INCOMPATIBILITY to gain more clarity:
4533 Context -- theory management operations (name, identity, inclusion,
4534 parents, ancestors, merge, etc.), plus generic theory data;
4536 Sign -- logical signature and syntax operations (declaring consts,
4537 types, etc.), plus certify/read for common entities;
4539 Theory -- logical theory operations (stating axioms, definitions,
4540 oracles), plus a copy of logical signature operations (consts,
4541 types, etc.); also a few basic management operations (Theory.copy,
4544 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4545 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4546 for convenience -- they merely return the theory.
4548 * Pure: type Type.tsig is superceded by theory in most interfaces.
4550 * Pure: the Isar proof context type is already defined early in Pure
4551 as Context.proof (note that ProofContext.context and Proof.context are
4552 aliases, where the latter is the preferred name). This enables other
4553 Isabelle components to refer to that type even before Isar is present.
4555 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4556 typeK, constK, axiomK, oracleK), but provide explicit operations for
4557 any of these kinds. For example, Sign.intern typeK is now
4558 Sign.intern_type, Theory.hide_space Sign.typeK is now
4559 Theory.hide_types. Also note that former
4560 Theory.hide_classes/types/consts are now
4561 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4562 internalize their arguments! INCOMPATIBILITY.
4564 * Pure: get_thm interface (of PureThy and ProofContext) expects
4565 datatype thmref (with constructors Name and NameSelection) instead of
4566 plain string -- INCOMPATIBILITY;
4568 * Pure: cases produced by proof methods specify options, where NONE
4569 means to remove case bindings -- INCOMPATIBILITY in
4572 * Pure: the following operations retrieve axioms or theorems from a
4573 theory node or theory hierarchy, respectively:
4575 Theory.axioms_of: theory -> (string * term) list
4576 Theory.all_axioms_of: theory -> (string * term) list
4577 PureThy.thms_of: theory -> (string * thm) list
4578 PureThy.all_thms_of: theory -> (string * thm) list
4580 * Pure: print_tac now outputs the goal through the trace channel.
4582 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4583 Reference Toplevel.debug (default false) controls detailed printing
4584 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4585 controls execution profiling -- set to 1 for time and 2 for space
4586 (both increase the runtime).
4588 * Isar session: The initial use of ROOT.ML is now always timed,
4589 i.e. the log will show the actual process times, in contrast to the
4590 elapsed wall-clock time that the outer shell wrapper produces.
4592 * Simplifier: improved handling of bound variables (nameless
4593 representation, avoid allocating new strings). Simprocs that invoke
4594 the Simplifier recursively should use Simplifier.inherit_bounds to
4595 avoid local name clashes. Failure to do so produces warnings
4596 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4597 for further details.
4599 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4600 bindings for all theorems stored within a given theory; this may help
4601 in porting non-Isar theories to Isar ones, while keeping ML proof
4602 scripts for the time being.
4604 * ML operator HTML.with_charset specifies the charset begin used for
4605 generated HTML files. For example:
4607 HTML.with_charset "utf-8" use_thy "Hebrew";
4608 HTML.with_charset "utf-8" use_thy "Chinese";
4613 * Allow symlinks to all proper Isabelle executables (Isabelle,
4614 isabelle, isatool etc.).
4616 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4617 isatool doc, isatool mkdir, display_drafts etc.).
4619 * isatool usedir: option -f allows specification of the ML file to be
4620 used by Isabelle; default is ROOT.ML.
4622 * New isatool version outputs the version identifier of the Isabelle
4623 distribution being used.
4625 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4626 (containing Boolean satisfiability problems) into Isabelle/HOL
4631 New in Isabelle2004 (April 2004)
4632 --------------------------------
4636 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4637 Replaces linorder.ML.
4639 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4640 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4641 (\<a>...\<z>), are now considered normal letters, and can therefore
4642 be used anywhere where an ASCII letter (a...zA...Z) has until
4643 now. COMPATIBILITY: This obviously changes the parsing of some
4644 terms, especially where a symbol has been used as a binder, say
4645 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4646 as an identifier. Fix it by inserting a space around former
4647 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4648 existing theory and ML files.
4650 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4652 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4653 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4654 a normal (but invisible) letter. For multiple letter subscripts repeat
4655 \<^isub> like this: x\<^isub>1\<^isub>2.
4657 * Pure: There are now sub-/superscripts that can span more than one
4658 character. Text between \<^bsub> and \<^esub> is set in subscript in
4659 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4660 superscript. The new control characters are not identifier parts.
4662 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4663 content of "..." to the latex file instead of \isacntrl... . The "..."
4664 may consist of any printable characters excluding the end bracket >.
4666 * Pure: Using new Isar command "finalconsts" (or the ML functions
4667 Theory.add_finals or Theory.add_finals_i) it is now possible to
4668 declare constants "final", which prevents their being given a definition
4669 later. It is useful for constants whose behaviour is fixed axiomatically
4670 rather than definitionally, such as the meta-logic connectives.
4672 * Pure: 'instance' now handles general arities with general sorts
4673 (i.e. intersections of classes),
4675 * Presentation: generated HTML now uses a CSS style sheet to make layout
4676 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4677 It can be changed to alter the colors/layout of generated pages.
4682 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4683 cut_tac, subgoal_tac and thin_tac:
4684 - Now understand static (Isar) contexts. As a consequence, users of Isar
4685 locales are no longer forced to write Isar proof scripts.
4686 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4688 - INCOMPATIBILITY: names of variables to be instantiated may no
4689 longer be enclosed in quotes. Instead, precede variable name with `?'.
4690 This is consistent with the instantiation attribute "where".
4692 * Attributes "where" and "of":
4693 - Now take type variables of instantiated theorem into account when reading
4694 the instantiation string. This fixes a bug that caused instantiated
4695 theorems to have too special types in some circumstances.
4696 - "where" permits explicit instantiations of type variables.
4698 * Calculation commands "moreover" and "also" no longer interfere with
4699 current facts ("this"), admitting arbitrary combinations with "then"
4703 - Goal statements involving the context element "includes" no longer
4704 generate theorems with internal delta predicates (those ending on
4705 "_axioms") in the premise.
4706 Resolve particular premise with <locale>.intro to obtain old form.
4707 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4708 specification and "includes" elements in goal statement.
4709 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4710 [intro?] and [elim?] (respectively) by default.
4711 - Experimental command for instantiation of locales in proof contexts:
4712 instantiate <label>[<attrs>]: <loc>
4713 Instantiates locale <loc> and adds all its theorems to the current context
4714 taking into account their attributes. Label and attrs are optional
4715 modifiers, like in theorem declarations. If present, names of
4716 instantiated theorems are qualified with <label>, and the attributes
4717 <attrs> are applied after any attributes these theorems might have already.
4718 If the locale has assumptions, a chained fact of the form
4719 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4720 are derived. The command does not support old-style locales declared
4721 with "locale (open)".
4722 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4724 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4730 * Proof import: new image HOL4 contains the imported library from
4731 the HOL4 system with about 2500 theorems. It is imported by
4732 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4733 can be used like any other Isabelle image. See
4734 HOL/Import/HOL/README for more information.
4737 - Much improved handling of linear and partial orders.
4738 Reasoners for linear and partial orders are set up for type classes
4739 "linorder" and "order" respectively, and are added to the default simpset
4740 as solvers. This means that the simplifier can build transitivity chains
4741 to solve goals from the assumptions.
4742 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4743 of blast or auto after simplification become unnecessary because the goal
4744 is solved by simplification already.
4746 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4747 all proved in axiomatic type classes for semirings, rings and fields.
4750 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4751 now formalized using the Ring_and_Field theory mentioned above.
4752 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4753 than before, because now they are set up once in a generic manner.
4754 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4755 Look for the general versions in Ring_and_Field (and Power if they concern
4758 * Type "rat" of the rational numbers is now available in HOL-Complex.
4761 - Record types are now by default printed with their type abbreviation
4762 instead of the list of all field types. This can be configured via
4763 the reference "print_record_type_abbr".
4764 - Simproc "record_upd_simproc" for simplification of multiple updates added
4765 (not enabled by default).
4766 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4767 EX x. x = sel r to True (not enabled by default).
4768 - Tactic "record_split_simp_tac" to split and simplify records added.
4770 * 'specification' command added, allowing for definition by
4771 specification. There is also an 'ax_specification' command that
4772 introduces the new constants axiomatically.
4774 * arith(_tac) is now able to generate counterexamples for reals as well.
4776 * HOL-Algebra: new locale "ring" for non-commutative rings.
4778 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4779 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4781 * HOL-Matrix: a first theory for matrices in HOL with an application of
4782 matrix theory to linear programming.
4784 * Unions and Intersections:
4785 The latex output syntax of UN and INT has been changed
4786 from "\Union x \in A. B" to "\Union_{x \in A} B"
4787 i.e. the index formulae has become a subscript.
4788 Similarly for "\Union x. B", and for \Inter instead of \Union.
4790 * Unions and Intersections over Intervals:
4791 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4792 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4793 like in normal math, and corresponding versions for < and for intersection.
4795 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4796 lexicographic dictonary ordering has been added as "lexord".
4798 * ML: the legacy theory structures Int and List have been removed. They had
4799 conflicted with ML Basis Library structures having the same names.
4801 * 'refute' command added to search for (finite) countermodels. Only works
4802 for a fragment of HOL. The installation of an external SAT solver is
4803 highly recommended. See "HOL/Refute.thy" for details.
4805 * 'quickcheck' command: Allows to find counterexamples by evaluating
4806 formulae under an assignment of free variables to random values.
4807 In contrast to 'refute', it can deal with inductive datatypes,
4808 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4814 * Streams now come with concatenation and are part of the HOLCF image
4818 New in Isabelle2003 (May 2003)
4819 ------------------------------
4823 * Provers/simplifier:
4825 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4826 Assumptions are now subject to complete mutual simplification,
4827 not just from left to right. The simplifier now preserves
4828 the order of assumptions.
4830 Potential INCOMPATIBILITY:
4832 -- simp sometimes diverges where the old version did
4833 not, e.g. invoking simp on the goal
4835 [| P (f x); y = x; f x = f y |] ==> Q
4837 now gives rise to the infinite reduction sequence
4839 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4841 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4844 -- Tactics combining classical reasoner and simplification (such as auto)
4845 are also affected by this change, because many of them rely on
4846 simp. They may sometimes diverge as well or yield a different numbers
4847 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4848 in case of problems. Sometimes subsequent calls to the classical
4849 reasoner will fail because a preceeding call to the simplifier too
4850 eagerly simplified the goal, e.g. deleted redundant premises.
4852 - The simplifier trace now shows the names of the applied rewrite rules
4854 - You can limit the number of recursive invocations of the simplifier
4855 during conditional rewriting (where the simplifie tries to solve the
4856 conditions before applying the rewrite rule):
4857 ML "simp_depth_limit := n"
4858 where n is an integer. Thus you can force termination where previously
4859 the simplifier would diverge.
4861 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4863 - No longer aborts on failed congruence proof. Instead, the
4864 congruence is ignored.
4866 * Pure: New generic framework for extracting programs from constructive
4867 proofs. See HOL/Extraction.thy for an example instantiation, as well
4868 as HOL/Extraction for some case studies.
4870 * Pure: The main goal of the proof state is no longer shown by default, only
4871 the subgoals. This behaviour is controlled by a new flag.
4872 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4873 (ML: Proof.show_main_goal).
4875 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4876 rules whose conclusion matches subgoal 1:
4877 PG menu: Isabelle/Isar -> Show me -> matching rules
4878 The rules are ordered by how closely they match the subgoal.
4879 In particular, rules that solve a subgoal outright are displayed first
4880 (or rather last, the way they are printed).
4881 (ML: ProofGeneral.print_intros())
4883 * Pure: New flag trace_unify_fail causes unification to print
4884 diagnostic information (PG: in trace buffer) when it fails. This is
4885 useful for figuring out why single step proofs like rule, erule or
4888 * Pure: Locale specifications now produce predicate definitions
4889 according to the body of text (covering assumptions modulo local
4890 definitions); predicate "loc_axioms" covers newly introduced text,
4891 while "loc" is cumulative wrt. all included locale expressions; the
4892 latter view is presented only on export into the global theory
4893 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4894 on the old view without predicates;
4896 * Pure: predefined locales "var" and "struct" are useful for sharing
4897 parameters (as in CASL, for example); just specify something like
4898 ``var x + var y + struct M'' as import;
4900 * Pure: improved thms_containing: proper indexing of facts instead of
4901 raw theorems; check validity of results wrt. current name space;
4902 include local facts of proof configuration (also covers active
4903 locales), cover fixed variables in index; may use "_" in term
4904 specification; an optional limit for the number of printed facts may
4905 be given (the default is 40);
4907 * Pure: disallow duplicate fact bindings within new-style theory files
4910 * Provers: improved induct method: assumptions introduced by case
4911 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4912 the goal statement); "foo" still refers to all facts collectively;
4914 * Provers: the function blast.overloaded has been removed: all constants
4915 are regarded as potentially overloaded, which improves robustness in exchange
4916 for slight decrease in efficiency;
4918 * Provers/linorder: New generic prover for transitivity reasoning over
4919 linear orders. Note: this prover is not efficient!
4921 * Isar: preview of problems to finish 'show' now produce an error
4922 rather than just a warning (in interactive mode);
4929 - Produces a counter example if it cannot prove a goal.
4930 Note that the counter example may be spurious if the goal is not a formula
4931 of quantifier-free linear arithmetic.
4932 In ProofGeneral the counter example appears in the trace buffer.
4934 - Knows about div k and mod k where k is a numeral of type nat or int.
4936 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4937 linear arithmetic fails. This takes account of quantifiers and divisibility.
4938 Presburger arithmetic can also be called explicitly via presburger(_tac).
4940 * simp's arithmetic capabilities have been enhanced a bit: it now
4941 takes ~= in premises into account (by performing a case split);
4943 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4944 are distributed over a sum of terms;
4946 * New tactic "trans_tac" and method "trans" instantiate
4947 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4950 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4951 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4953 * 'typedef' command has new option "open" to suppress the set
4956 * functions Min and Max on finite sets have been introduced (theory
4959 * attribute [symmetric] now works for relations as well; it turns
4960 (x,y) : R^-1 into (y,x) : R, and vice versa;
4962 * induct over a !!-quantified statement (say !!x1..xn):
4963 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4965 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4966 %x. None. Warning: empty_def now refers to the previously hidden definition
4969 * Algebra: formalization of classical algebra. Intended as base for
4970 any algebraic development in Isabelle. Currently covers group theory
4971 (up to Sylow's theorem) and ring theory (Universal Property of
4972 Univariate Polynomials). Contributions welcome;
4974 * GroupTheory: deleted, since its material has been moved to Algebra;
4976 * Complex: new directory of the complex numbers with numeric constants,
4977 nonstandard complex numbers, and some complex analysis, standard and
4978 nonstandard (Jacques Fleuriot);
4980 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4982 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4985 * Real/HahnBanach: updated and adapted to locales;
4987 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4990 * UNITY: added the Meier-Sanders theory of progress sets;
4992 * MicroJava: bytecode verifier and lightweight bytecode verifier
4993 as abstract algorithms, instantiated to the JVM;
4995 * Bali: Java source language formalization. Type system, operational
4996 semantics, axiomatic semantics. Supported language features:
4997 classes, interfaces, objects,virtual methods, static methods,
4998 static/instance fields, arrays, access modifiers, definite
4999 assignment, exceptions.
5004 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5007 * Main ZF: virtually all theories converted to new-style format;
5012 * Pure: Tactic.prove provides sane interface for internal proofs;
5013 omits the infamous "standard" operation, so this is more appropriate
5014 than prove_goalw_cterm in many situations (e.g. in simprocs);
5016 * Pure: improved error reporting of simprocs;
5018 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5022 *** Document preparation ***
5024 * uses \par instead of \\ for line breaks in theory text. This may
5025 shift some page breaks in large documents. To get the old behaviour
5026 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5028 * minimized dependencies of isabelle.sty and isabellesym.sty on
5031 * \<euro> now needs package babel/greek instead of marvosym (which
5034 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5039 New in Isabelle2002 (March 2002)
5040 --------------------------------
5042 *** Document preparation ***
5044 * greatly simplified document preparation setup, including more
5045 graceful interpretation of isatool usedir -i/-d/-D options, and more
5046 instructive isatool mkdir; users should basically be able to get
5047 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5048 users may run a separate document processing stage manually like this:
5049 "isatool usedir -D output HOL Test && isatool document Test/output";
5051 * theory dependency graph may now be incorporated into documents;
5052 isatool usedir -g true will produce session_graph.eps/.pdf for use
5053 with \includegraphics of LaTeX;
5055 * proper spacing of consecutive markup elements, especially text
5056 blocks after section headings;
5058 * support bold style (for single symbols only), input syntax is like
5059 this: "\<^bold>\<alpha>" or "\<^bold>A";
5061 * \<bullet> is now output as bold \cdot by default, which looks much
5062 better in printed text;
5064 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5065 note that these symbols are currently unavailable in Proof General /
5066 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5068 * isatool latex no longer depends on changed TEXINPUTS, instead
5069 isatool document copies the Isabelle style files to the target
5075 * Pure/Provers: improved proof by cases and induction;
5076 - 'case' command admits impromptu naming of parameters (such as
5078 - 'induct' method divinates rule instantiation from the inductive
5079 claim; no longer requires excessive ?P bindings for proper
5080 instantiation of cases;
5081 - 'induct' method properly enumerates all possibilities of set/type
5082 rules; as a consequence facts may be also passed through *type*
5083 rules without further ado;
5084 - 'induct' method now derives symbolic cases from the *rulified*
5085 rule (before it used to rulify cases stemming from the internal
5086 atomized version); this means that the context of a non-atomic
5087 statement becomes is included in the hypothesis, avoiding the
5088 slightly cumbersome show "PROP ?case" form;
5089 - 'induct' may now use elim-style induction rules without chaining
5090 facts, using ``missing'' premises from the goal state; this allows
5091 rules stemming from inductive sets to be applied in unstructured
5092 scripts, while still benefitting from proper handling of non-atomic
5093 statements; NB: major inductive premises need to be put first, all
5094 the rest of the goal is passed through the induction;
5095 - 'induct' proper support for mutual induction involving non-atomic
5096 rule statements (uses the new concept of simultaneous goals, see
5098 - append all possible rule selections, but only use the first
5099 success (no backtracking);
5100 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5101 - undeclared rule case names default to numbers 1, 2, 3, ...;
5102 - added 'print_induct_rules' (covered by help item in recent Proof
5104 - moved induct/cases attributes to Pure, methods to Provers;
5105 - generic method setup instantiated for FOL and HOL;
5107 * Pure: support multiple simultaneous goal statements, for example
5108 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5109 meta-level mechanism, this acts as if several individual goals had
5110 been stated separately; in particular common proof methods need to be
5111 repeated in order to cover all claims; note that a single elimination
5112 step is *not* sufficient to establish the two conjunctions, so this
5115 assume "A & B" then have A and B .. (*".." fails*)
5117 better use "obtain" in situations as above; alternative refer to
5118 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5120 * Pure: proper integration with ``locales''; unlike the original
5121 version by Florian Kammller, Isar locales package high-level proof
5122 contexts rather than raw logical ones (e.g. we admit to include
5123 attributes everywhere); operations on locales include merge and
5124 rename; support for implicit arguments (``structures''); simultaneous
5125 type-inference over imports and text; see also HOL/ex/Locales.thy for
5128 * Pure: the following commands have been ``localized'', supporting a
5129 target locale specification "(in name)": 'lemma', 'theorem',
5130 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5131 stored both within the locale and at the theory level (exported and
5132 qualified by the locale name);
5134 * Pure: theory goals may now be specified in ``long'' form, with
5135 ad-hoc contexts consisting of arbitrary locale elements. for example
5136 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5137 definitions may be given, too); the result is a meta-level rule with
5138 the context elements being discharged in the obvious way;
5140 * Pure: new proof command 'using' allows to augment currently used
5141 facts after a goal statement ('using' is syntactically analogous to
5142 'apply', but acts on the goal's facts only); this allows chained facts
5143 to be separated into parts given before and after a claim, as in
5144 ``from a and b have C using d and e <proof>'';
5146 * Pure: renamed "antecedent" case to "rule_context";
5148 * Pure: new 'judgment' command records explicit information about the
5149 object-logic embedding (used by several tools internally); no longer
5150 use hard-wired "Trueprop";
5152 * Pure: added 'corollary' command;
5154 * Pure: fixed 'token_translation' command;
5156 * Pure: removed obsolete 'exported' attribute;
5158 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5159 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5160 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5162 * Pure: method 'atomize' presents local goal premises as object-level
5163 statements (atomic meta-level propositions); setup controlled via
5164 rewrite rules declarations of 'atomize' attribute; example
5165 application: 'induct' method with proper rule statements in improper
5168 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5169 now consider the syntactic context of assumptions, giving a better
5170 chance to get type-inference of the arguments right (this is
5171 especially important for locales);
5173 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5176 * Pure/obtain: the formal conclusion "thesis", being marked as
5177 ``internal'', may no longer be reference directly in the text;
5178 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5181 * Pure: generic 'sym' attribute which declares a rule both as pure
5182 'elim?' and for the 'symmetric' operation;
5184 * Pure: marginal comments ``--'' may now occur just anywhere in the
5185 text; the fixed correlation with particular command syntax has been
5188 * Pure: new method 'rules' is particularly well-suited for proof
5189 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5190 but often produces more compact proof terms with less detours;
5192 * Pure/Provers/classical: simplified integration with pure rule
5193 attributes and methods; the classical "intro?/elim?/dest?"
5194 declarations coincide with the pure ones; the "rule" method no longer
5195 includes classically swapped intros; "intro" and "elim" methods no
5196 longer pick rules from the context; also got rid of ML declarations
5197 AddXIs/AddXEs/AddXDs; all of this has some potential for
5200 * Provers/classical: attribute 'swapped' produces classical inversions
5201 of introduction rules;
5203 * Provers/simplifier: 'simplified' attribute may refer to explicit
5204 rules instead of full simplifier context; 'iff' attribute handles
5207 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5209 * HOL: 'recdef' now fails on unfinished automated proofs, use
5210 "(permissive)" option to recover old behavior;
5212 * HOL: 'inductive' no longer features separate (collective) attributes
5213 for 'intros' (was found too confusing);
5215 * HOL: properly declared induction rules less_induct and
5221 * HOL: moved over to sane numeral syntax; the new policy is as
5224 - 0 and 1 are polymorphic constants, which are defined on any
5225 numeric type (nat, int, real etc.);
5227 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5228 binary representation internally;
5230 - type nat has special constructor Suc, and generally prefers Suc 0
5231 over 1::nat and Suc (Suc 0) over 2::nat;
5233 This change may cause significant problems of INCOMPATIBILITY; here
5234 are some hints on converting existing sources:
5236 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5237 entities, so expressions involving "-" (unary or binary minus) need
5238 to be spaced properly;
5240 - existing occurrences of "1" may need to be constraint "1::nat" or
5241 even replaced by Suc 0; similar for old "2";
5243 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5245 - remove all special provisions on numerals in proofs;
5247 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5248 representation (depends on bin_arith_simps in the default context);
5250 * HOL: symbolic syntax for x^2 (numeral 2);
5252 * HOL: the class of all HOL types is now called "type" rather than
5253 "term"; INCOMPATIBILITY, need to adapt references to this type class
5254 in axclass/classes, instance/arities, and (usually rare) occurrences
5255 in typings (of consts etc.); internally the class is called
5256 "HOL.type", ML programs should refer to HOLogic.typeS;
5258 * HOL/record package improvements:
5259 - new derived operations "fields" to build a partial record section,
5260 "extend" to promote a fixed record to a record scheme, and
5261 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5262 declared as simp by default;
5263 - shared operations ("more", "fields", etc.) now need to be always
5264 qualified) --- potential INCOMPATIBILITY;
5265 - removed "make_scheme" operations (use "make" with "extend") --
5267 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5268 - provides cases/induct rules for use with corresponding Isar
5269 methods (for concrete records, record schemes, concrete more
5270 parts, and schematic more parts -- in that order);
5271 - internal definitions directly based on a light-weight abstract
5272 theory of product types over typedef rather than datatype;
5274 * HOL: generic code generator for generating executable ML code from
5275 specifications; specific support for HOL constructs such as inductive
5276 datatypes and sets, as well as recursive functions; can be invoked
5277 via 'generate_code' theory section;
5279 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5281 * HOL: consolidated and renamed several theories. In particular:
5282 Ord.thy has been absorbed into HOL.thy
5283 String.thy has been absorbed into List.thy
5285 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5286 (beware of argument permutation!);
5288 * HOL: linorder_less_split superseded by linorder_cases;
5290 * HOL/List: "nodups" renamed to "distinct";
5292 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5293 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5294 - Ex_def has changed, now need to use some_eq_ex
5296 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5297 in this (rare) case use:
5299 delSWrapper "split_all_tac"
5300 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5302 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5305 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5306 Isabelle's type classes, ^ on functions and relations has too general
5307 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5308 necessary to attach explicit type constraints;
5310 * HOL/Relation: the prefix name of the infix "O" has been changed from
5311 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5312 renamed accordingly (eg "compI" -> "rel_compI").
5314 * HOL: syntax translations now work properly with numerals and records
5317 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5318 of "lam" -- INCOMPATIBILITY;
5320 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5321 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5322 renamed "Product_Type.unit";
5324 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5326 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5327 the "cases" method);
5329 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5332 * HOL/IMP: updated and converted to new-style theory format; several
5333 parts turned into readable document, with proper Isar proof texts and
5334 some explanations (by Gerwin Klein);
5336 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5338 * HOL-Hyperreal is now a logic image;
5343 * Isar: consts/constdefs supports mixfix syntax for continuous
5346 * Isar: domain package adapted to new-style theory format, e.g. see
5349 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5350 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5351 lift.induct_tac, always use UU instead of Undef;
5353 * HOLCF/IMP: updated and converted to new-style theory;
5358 * Isar: proper integration of logic-specific tools and packages,
5359 including theory commands '(co)inductive', '(co)datatype',
5360 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5361 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5363 * theory Main no longer includes AC; for the Axiom of Choice, base
5364 your theory on Main_ZFC;
5366 * the integer library now covers quotients and remainders, with many
5367 laws relating division to addition, multiplication, etc.;
5369 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5370 typeless version of the formalism;
5372 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5375 * ZF/Induct: new directory for examples of inductive definitions,
5376 including theory Multiset for multiset orderings; converted to
5377 new-style theory format;
5379 * ZF: many new theorems about lists, ordinals, etc.;
5384 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5385 variable proof controls level of detail: 0 = no proofs (only oracle
5386 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5387 also ref manual for further ML interfaces;
5389 * Pure/axclass: removed obsolete ML interface
5390 goal_subclass/goal_arity;
5392 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5393 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5394 separate tokens, so expressions involving minus need to be spaced
5397 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5398 rather than "infixl" or "infixr";
5400 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5401 sort constraint specifications in type inference; e.g. "x::_::foo"
5402 ensures that the type of "x" is of sort "foo" (but not necessarily a
5405 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5406 control output of nested => (types); the default behavior is
5409 * Pure/syntax: builtin parse translation for "_constify" turns valued
5410 tokens into AST constants;
5412 * Pure/syntax: prefer later declarations of translations and print
5413 translation functions; potential INCOMPATIBILITY: need to reverse
5414 multiple declarations for same syntax element constant;
5416 * Pure/show_hyps reset by default (in accordance to existing Isar
5419 * Provers/classical: renamed addaltern to addafter, addSaltern to
5422 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5425 * system: tested support for MacOS X; should be able to get Isabelle +
5426 Proof General to work in a plain Terminal after installing Poly/ML
5427 (e.g. from the Isabelle distribution area) and GNU bash alone
5428 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5429 support requires further installations, e.g. from
5430 http://fink.sourceforge.net/);
5432 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5434 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5435 of 40 MB), cf. ML_OPTIONS;
5437 * system: Proof General keywords specification is now part of the
5438 Isabelle distribution (see etc/isar-keywords.el);
5440 * system: support for persistent Proof General sessions (refrain from
5441 outdating all loaded theories on startup); user may create writable
5442 logic images like this: ``isabelle -q HOL Test'';
5444 * system: smart selection of Isabelle process versus Isabelle
5445 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5446 run both "isabelle" and "Isabelle" even if file names are badly
5447 damaged (executable inspects the case of the first letter of its own
5448 name); added separate "isabelle-process" and "isabelle-interface";
5450 * system: refrain from any attempt at filtering input streams; no
5451 longer support ``8bit'' encoding of old isabelle font, instead proper
5452 iso-latin characters may now be used; the related isatools
5453 "symbolinput" and "nonascii" have disappeared as well;
5455 * system: removed old "xterm" interface (the print modes "xterm" and
5456 "xterm_color" are still available for direct use in a suitable
5461 New in Isabelle99-2 (February 2001)
5462 -----------------------------------
5464 *** Overview of INCOMPATIBILITIES ***
5466 * HOL: please note that theories in the Library and elsewhere often use the
5467 new-style (Isar) format; to refer to their theorems in an ML script you must
5468 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5470 * HOL: inductive package no longer splits induction rule aggressively,
5471 but only as far as specified by the introductions given; the old
5472 format may be recovered via ML function complete_split_rule or attribute
5473 'split_rule (complete)';
5475 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5476 gfp_Tarski to gfp_unfold;
5478 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5480 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5481 relation); infix "^^" has been renamed "``"; infix "``" has been
5482 renamed "`"; "univalent" has been renamed "single_valued";
5484 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5487 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5489 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5491 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5492 consequence, it is no longer monotonic wrt. the local goal context
5493 (which is now passed through the inductive cases);
5495 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5496 \<gg> to \<ggreater>;
5499 *** Document preparation ***
5501 * \isabellestyle{NAME} selects version of Isabelle output (currently
5502 available: are "it" for near math-mode best-style output, "sl" for
5503 slanted text style, and "tt" for plain type-writer; if no
5504 \isabellestyle command is given, output is according to slanted
5507 * support sub/super scripts (for single symbols only), input syntax is
5508 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5510 * some more standard symbols; see Appendix A of the system manual for
5511 the complete list of symbols defined in isabellesym.sty;
5513 * improved isabelle style files; more abstract symbol implementation
5514 (should now use \isamath{...} and \isatext{...} in custom symbol
5517 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5518 state; Note that presentation of goal states does not conform to
5519 actual human-readable proof documents. Please do not include goal
5520 states into document output unless you really know what you are doing!
5522 * proper indentation of antiquoted output with proportional LaTeX
5525 * no_document ML operator temporarily disables LaTeX document
5528 * isatool unsymbolize tunes sources for plain ASCII communication;
5533 * Pure: Isar now suffers initial goal statements to contain unbound
5534 schematic variables (this does not conform to actual readable proof
5535 documents, due to unpredictable outcome and non-compositional proof
5536 checking); users who know what they are doing may use schematic goals
5537 for Prolog-style synthesis of proven results;
5539 * Pure: assumption method (an implicit finishing) now handles actual
5542 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5543 initial goal, declare "that" only as Pure intro (only for single
5544 steps); the "that" rule assumption may now be involved in implicit
5545 finishing, thus ".." becomes a feasible for trivial obtains;
5547 * Pure: default proof step now includes 'intro_classes'; thus trivial
5548 instance proofs may be performed by "..";
5550 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5553 * Pure: more robust selection of calculational rules;
5555 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5556 rule (as well as the assumption rule);
5558 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5559 lemmas, using the graph browser tool;
5561 * Pure: predict failure of "show" in interactive mode;
5563 * Pure: 'thms_containing' now takes actual terms as arguments;
5565 * HOL: improved method 'induct' --- now handles non-atomic goals
5566 (potential INCOMPATIBILITY); tuned error handling;
5568 * HOL: cases and induct rules now provide explicit hints about the
5569 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5570 any remaining facts are inserted into the goal verbatim;
5572 * HOL: local contexts (aka cases) may now contain term bindings as
5573 well; the 'cases' and 'induct' methods new provide a ?case binding for
5574 the result to be shown in each case;
5576 * HOL: added 'recdef_tc' command;
5578 * isatool convert assists in eliminating legacy ML scripts;
5583 * HOL/Library: a collection of generic theories to be used together
5584 with main HOL; the theory loader path already includes this directory
5585 by default; the following existing theories have been moved here:
5586 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5587 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5589 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5590 modelling and verification task performed in Isabelle/HOL +
5591 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5593 * HOL/Algebra: special summation operator SUM no longer exists, it has
5594 been replaced by setsum; infix 'assoc' now has priority 50 (like
5595 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5596 'domain', this makes the theory consistent with mathematical
5599 * HOL basics: added overloaded operations "inverse" and "divide"
5600 (infix "/"), syntax for generic "abs" operation, generic summation
5603 * HOL/typedef: simplified package, provide more useful rules (see also
5606 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5607 now expressed as a proper nested rule (old-style tactic scripts may
5608 require atomize_strip_tac to cope with non-atomic premises);
5610 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5611 to "split_conv" (old name still available for compatibility);
5613 * HOL: improved concrete syntax for strings (e.g. allows translation
5614 rules with string literals);
5616 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5617 and Fleuriot's mechanization of analysis, including the transcendental
5618 functions for the reals;
5620 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5625 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5626 "lam" is displayed as TWO lambda-symbols
5628 * CTT: theory Main now available, containing everything (that is, Bool
5634 * Pure: the Simplifier has been implemented properly as a derived rule
5635 outside of the actual kernel (at last!); the overall performance
5636 penalty in practical applications is about 50%, while reliability of
5637 the Isabelle inference kernel has been greatly improved;
5639 * print modes "brackets" and "no_brackets" control output of nested =>
5640 (types) and ==> (props); the default behaviour is "brackets";
5642 * Provers: fast_tac (and friends) now handle actual object-logic rules
5643 as assumptions as well;
5645 * system: support Poly/ML 4.0;
5647 * system: isatool install handles KDE version 1 or 2;
5651 New in Isabelle99-1 (October 2000)
5652 ----------------------------------
5654 *** Overview of INCOMPATIBILITIES ***
5656 * HOL: simplification of natural numbers is much changed; to partly
5657 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5658 issue the following ML commands:
5660 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5661 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5663 * HOL: simplification no longer dives into case-expressions; this is
5664 controlled by "t.weak_case_cong" for each datatype t;
5666 * HOL: nat_less_induct renamed to less_induct;
5668 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5669 fixsome to patch .thy and .ML sources automatically;
5671 select_equality -> some_equality
5672 select_eq_Ex -> some_eq_ex
5673 selectI2EX -> someI2_ex
5676 select1_equality -> some1_equality
5677 Eps_sym_eq -> some_sym_eq_trivial
5678 Eps_eq -> some_eq_trivial
5680 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5682 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5685 * HOL: the recursion equations generated by 'recdef' are now called
5686 f.simps instead of f.rules;
5688 * HOL: qed_spec_mp now also handles bounded ALL as well;
5690 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5691 sometimes be needed;
5693 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5695 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5697 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5698 product is now "<*>" instead of "Times"; the lexicographic product is
5699 now "<*lex*>" instead of "**";
5701 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5702 of main HOL, but was unused); better use HOL's datatype package;
5704 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5705 the old syntax may be recovered as follows:
5708 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5709 (infixl "\\<oplus>" 100)
5711 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5713 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5714 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5717 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5718 changed from A/r to A//r;
5720 * ZF: new treatment of arithmetic (nat & int) may break some old
5723 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5724 rulify -> rule_format, elimify -> elim_format, ...);
5726 * Isar/Provers: intro/elim/dest attributes changed; renamed
5727 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5728 should have to change intro!! to intro? only); replaced "delrule" by
5731 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5733 * Provers: strengthened force_tac by using new first_best_tac;
5735 * LaTeX document preparation: several changes of isabelle.sty (see
5739 *** Document preparation ***
5741 * formal comments (text blocks etc.) in new-style theories may now
5742 contain antiquotations of thm/prop/term/typ/text to be presented
5743 according to latex print mode; concrete syntax is like this:
5744 @{term[show_types] "f(x) = a + x"};
5746 * isatool mkdir provides easy setup of Isabelle session directories,
5747 including proper document sources;
5749 * generated LaTeX sources are now deleted after successful run
5750 (isatool document -c); may retain a copy somewhere else via -D option
5753 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5754 style files, achieving self-contained LaTeX sources and simplifying
5757 * old-style theories now produce (crude) LaTeX output as well;
5759 * browser info session directories are now self-contained (may be put
5760 on WWW server seperately); improved graphs of nested sessions; removed
5761 graph for 'all sessions';
5763 * several improvements in isabelle style files; \isabellestyle{it}
5764 produces fake math mode output; \isamarkupheader is now \section by
5765 default; see lib/texinputs/isabelle.sty etc.;
5770 * Isar/Pure: local results and corresponding term bindings are now
5771 subject to Hindley-Milner polymorphism (similar to ML); this
5772 accommodates incremental type-inference very nicely;
5774 * Isar/Pure: new derived language element 'obtain' supports
5775 generalized existence reasoning;
5777 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5778 support accumulation of results, without applying any rules yet;
5779 useful to collect intermediate results without explicit name
5780 references, and for use with transitivity rules with more than 2
5783 * Isar/Pure: scalable support for case-analysis type proofs: new
5784 'case' language element refers to local contexts symbolically, as
5785 produced by certain proof methods; internally, case names are attached
5786 to theorems as "tags";
5788 * Isar/Pure: theory command 'hide' removes declarations from
5789 class/type/const name spaces;
5791 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5792 indicate potential overloading;
5794 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5796 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5797 "{a,b,c}" instead of {a,b,c};
5799 * Isar/Pure now provides its own version of intro/elim/dest
5800 attributes; useful for building new logics, but beware of confusion
5801 with the version in Provers/classical;
5803 * Isar/Pure: the local context of (non-atomic) goals is provided via
5804 case name 'antecedent';
5806 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5807 to the current context is now done automatically);
5809 * Isar/Pure: theory command 'method_setup' provides a simple interface
5810 for definining proof methods in ML;
5812 * Isar/Provers: intro/elim/dest attributes changed; renamed
5813 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5814 most cases, one should have to change intro!! to intro? only);
5815 replaced "delrule" by "rule del";
5817 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5818 'symmetric' attribute (the latter supercedes [RS sym]);
5820 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5821 method modifier); 'simp' method: 'only:' modifier removes loopers as
5822 well (including splits);
5824 * Isar/Provers: Simplifier and Classical methods now support all kind
5825 of modifiers used in the past, including 'cong', 'iff', etc.
5827 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5828 of Simplifier and Classical reasoner);
5830 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5831 now support named cases; major packages (inductive, datatype, primrec,
5832 recdef) support case names and properly name parameters;
5834 * Isar/HOL: new transitivity rules for substitution in inequalities --
5835 monotonicity conditions are extracted to be proven at end of
5838 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5841 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5842 split_if split_if_asm; datatype package provides theorems foo.splits =
5843 foo.split foo.split_asm for each datatype;
5845 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5846 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5847 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5848 use "(cases (simplified))" method in proper proof texts);
5850 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5852 * Isar: names of theorems etc. may be natural numbers as well;
5854 * Isar: 'pr' command: optional arguments for goals_limit and
5855 ProofContext.prems_limit; no longer prints theory contexts, but only
5858 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5859 additional print modes to be specified; e.g. "pr(latex)" will print
5860 proof state according to the Isabelle LaTeX style;
5862 * Isar: improved support for emulating tactic scripts, including proof
5863 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5864 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5865 (for HOL datatypes);
5867 * Isar: simplified (more robust) goal selection of proof methods: 1st
5868 goal, all goals, or explicit goal specifier (tactic emulation); thus
5869 'proof method scripts' have to be in depth-first order;
5871 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5873 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5874 should instead use individual commands for printing items
5875 (print_commands, print_methods etc.);
5877 * Isar: added 'nothing' --- the empty list of theorems;
5882 * HOL/MicroJava: formalization of a fragment of Java, together with a
5883 corresponding virtual machine and a specification of its bytecode
5884 verifier and a lightweight bytecode verifier, including proofs of
5885 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5886 Cornelia Pusch (see also the homepage of project Bali at
5887 http://isabelle.in.tum.de/Bali/);
5889 * HOL/Algebra: new theory of rings and univariate polynomials, by
5892 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5893 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5896 * HOL/Lattice: fundamental concepts of lattice theory and order
5897 structures, including duals, properties of bounds versus algebraic
5898 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5899 Theorem for complete lattices etc.; may also serve as a demonstration
5900 for abstract algebraic reasoning using axiomatic type classes, and
5901 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5903 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5906 * HOL/IMPP: extension of IMP with local variables and mutually
5907 recursive procedures, by David von Oheimb;
5909 * HOL/Lambda: converted into new-style theory and document;
5911 * HOL/ex/Multiquote: example of multiple nested quotations and
5912 anti-quotations -- basically a generalized version of de-Bruijn
5913 representation; very useful in avoiding lifting of operations;
5915 * HOL/record: added general record equality rule to simpset; fixed
5916 select-update simplification procedure to handle extended records as
5917 well; admit "r" as field name;
5919 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5920 other numeric types and also as the identity of groups, rings, etc.;
5922 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5923 Types nat and int belong to this axclass;
5925 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5926 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5927 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5928 two terms #m*u and #n*u are replaced by #(m+n)*u
5929 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5930 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5931 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5933 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5934 powerful prover for predicate logic but knows nothing of clasets; see
5935 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5937 * HOL: new version of "case_tac" subsumes both boolean case split and
5938 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5939 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5941 * HOL: simplification no longer dives into case-expressions: only the
5942 selector expression is simplified, but not the remaining arms; to
5943 enable full simplification of case-expressions for datatype t, you may
5944 remove t.weak_case_cong from the simpset, either globally (Delcongs
5945 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5947 * HOL/recdef: the recursion equations generated by 'recdef' for
5948 function 'f' are now called f.simps instead of f.rules; if all
5949 termination conditions are proved automatically, these simplification
5950 rules are added to the simpset, as in primrec; rules may be named
5951 individually as well, resulting in a separate list of theorems for
5954 * HOL/While is a new theory that provides a while-combinator. It
5955 permits the definition of tail-recursive functions without the
5956 provision of a termination measure. The latter is necessary once the
5957 invariant proof rule for while is applied.
5959 * HOL: new (overloaded) notation for the set of elements below/above
5960 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5962 * HOL: theorems impI, allI, ballI bound as "strip";
5964 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5965 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5966 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5968 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5970 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5971 main HOL, but was unused);
5973 * HOL: fewer consts declared as global (e.g. have to refer to
5974 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5976 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5977 in case of overlap with user translations (e.g. judgements over
5978 tuples); (note that the underlying logical represenation is still
5984 * ZF: simplification automatically cancels common terms in arithmetic
5985 expressions over nat and int;
5987 * ZF: new treatment of nat to minimize type-checking: all operators
5988 coerce their operands to a natural number using the function natify,
5989 making the algebraic laws unconditional;
5991 * ZF: as above, for int: operators coerce their operands to an integer
5992 using the function intify;
5994 * ZF: the integer library now contains many of the usual laws for the
5995 orderings, including $<=, and monotonicity laws for $+ and $*;
5997 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6000 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6001 to the simplifier and classical reasoner simultaneously;
6006 * Provers: blast_tac now handles actual object-logic rules as
6007 assumptions; note that auto_tac uses blast_tac internally as well;
6009 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6010 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6012 * Provers: delrules now handles destruct rules as well (no longer need
6013 explicit make_elim);
6015 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6016 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6017 use instead the strong form,
6018 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6019 in HOL, FOL and ZF the function cla_make_elim will create such rules
6020 from destruct-rules;
6022 * Provers: Simplifier.easy_setup provides a fast path to basic
6023 Simplifier setup for new object-logics;
6025 * Pure: AST translation rules no longer require constant head on LHS;
6027 * Pure: improved name spaces: ambiguous output is qualified; support
6028 for hiding of names;
6030 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6031 XSYMBOL_HOME; no longer need to do manual configuration in most
6034 * system: compression of ML heaps images may now be controlled via -c
6035 option of isabelle and isatool usedir (currently only observed by
6038 * system: isatool installfonts may handle X-Symbol fonts as well (very
6039 useful for remote X11);
6041 * system: provide TAGS file for Isabelle sources;
6043 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6046 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6047 timing flag supersedes proof_timing and Toplevel.trace;
6049 * ML: new combinators |>> and |>>> for incremental transformations
6050 with secondary results (e.g. certain theory extensions):
6052 * ML: PureThy.add_defs gets additional argument to indicate potential
6053 overloading (usually false);
6055 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6060 New in Isabelle99 (October 1999)
6061 --------------------------------
6063 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6065 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6066 are no longer simplified. (This allows the simplifier to unfold recursive
6067 functional programs.) To restore the old behaviour, declare
6069 Delcongs [if_weak_cong];
6071 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6074 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6076 * HOL/datatype: mutual_induct_tac no longer exists --
6077 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6079 * HOL/typedef: fixed type inference for representing set; type
6080 arguments now have to occur explicitly on the rhs as type constraints;
6082 * ZF: The con_defs part of an inductive definition may no longer refer
6083 to constants declared in the same theory;
6085 * HOL, ZF: the function mk_cases, generated by the inductive
6086 definition package, has lost an argument. To simplify its result, it
6087 uses the default simpset instead of a supplied list of theorems.
6089 * HOL/List: the constructors of type list are now Nil and Cons;
6091 * Simplifier: the type of the infix ML functions
6092 setSSolver addSSolver setSolver addSolver
6093 is now simpset * solver -> simpset where `solver' is a new abstract type
6094 for packaging solvers. A solver is created via
6095 mk_solver: string -> (thm list -> int -> tactic) -> solver
6096 where the string argument is only a comment.
6101 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6102 decision procedure for linear arithmetic. Currently it is used for
6103 types `nat', `int', and `real' in HOL (see below); it can, should and
6104 will be instantiated for other types and logics as well.
6106 * The simplifier now accepts rewrite rules with flexible heads, eg
6107 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6108 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6114 * New Isabelle/Isar subsystem provides an alternative to traditional
6115 tactical theorem proving; together with the ProofGeneral/isar user
6116 interface it offers an interactive environment for developing human
6117 readable proof documents (Isar == Intelligible semi-automated
6118 reasoning); for further information see isatool doc isar-ref,
6119 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6121 * improved and simplified presentation of theories: better HTML markup
6122 (including colors), graph views in several sizes; isatool usedir now
6123 provides a proper interface for user theories (via -P option); actual
6124 document preparation based on (PDF)LaTeX is available as well (for
6125 new-style theories only); see isatool doc system for more information;
6127 * native support for Proof General, both for classic Isabelle and
6130 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6131 using the graph browser tool;
6133 * Isabelle manuals now also available as PDF;
6135 * theory loader rewritten from scratch (may not be fully
6136 bug-compatible); old loadpath variable has been replaced by show_path,
6137 add_path, del_path, reset_path functions; new operations such as
6138 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6141 * improved isatool install: option -k creates KDE application icon,
6142 option -p DIR installs standalone binaries;
6144 * added ML_PLATFORM setting (useful for cross-platform installations);
6145 more robust handling of platform specific ML images for SML/NJ;
6147 * the settings environment is now statically scoped, i.e. it is never
6148 created again in sub-processes invoked from isabelle, isatool, or
6151 * path element specification '~~' refers to '$ISABELLE_HOME';
6153 * in locales, the "assumes" and "defines" parts may be omitted if
6156 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6159 * new print_mode "HTML";
6161 * new flag show_tags controls display of tags of theorems (which are
6162 basically just comments that may be attached by some tools);
6164 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6165 mode and goal output format:
6167 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6169 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6171 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6172 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6174 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6176 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6178 * function bind_thms stores lists of theorems (cf. bind_thm);
6180 * new shorthand tactics ftac, eatac, datac, fatac;
6182 * qed (and friends) now accept "" as result name; in that case the
6183 theorem is not stored, but proper checks and presentation of the
6186 * theorem database now also indexes constants "Trueprop", "all",
6187 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6192 ** HOL arithmetic **
6194 * There are now decision procedures for linear arithmetic over nat and
6197 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6198 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6199 are treated as atomic; subformulae not involving type `nat' or `int'
6200 are ignored; quantified subformulae are ignored unless they are
6201 positive universal or negative existential. The tactic has to be
6202 invoked by hand and can be a little bit slow. In particular, the
6203 running time is exponential in the number of occurrences of `min' and
6204 `max', and `-' on `nat'.
6206 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6207 (negated) (in)equalities among the premises and the conclusion into
6208 account (i.e. no compound formulae) and does not know about `min' and
6209 `max', and `-' on `nat'. It is fast and is used automatically by the
6212 NB: At the moment, these decision procedures do not cope with mixed
6213 nat/int formulae where the two parts interact, such as `m < n ==>
6216 * HOL/Numeral provides a generic theory of numerals (encoded
6217 efficiently as bit strings); setup for types nat/int/real is in place;
6218 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6219 int, existing theories and proof scripts may require a few additional
6222 * integer division and remainder can now be performed on constant
6225 * many properties of integer multiplication, division and remainder
6228 * An interface to the Stanford Validity Checker (SVC) is available through the
6229 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6230 are proved automatically. SVC must be installed separately, and its results
6231 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6232 invocation of the underlying oracle). For SVC see
6233 http://verify.stanford.edu/SVC
6235 * IsaMakefile: the HOL-Real target now builds an actual image;
6240 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6241 (in Isabelle/Isar) -- by Gertrud Bauer;
6243 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6244 analysis for assembly languages with subtypes;
6246 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6247 -- avoids syntactic ambiguities and treats state, transition, and
6248 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6249 changed syntax and (many) tactics;
6251 * HOL/inductive: Now also handles more general introduction rules such
6252 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6253 theorems are now maintained within the theory (maintained via the
6256 * HOL/datatype: Now also handles arbitrarily branching datatypes
6257 (using function types) such as
6259 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6261 * HOL/record: record_simproc (part of the default simpset) takes care
6262 of selectors applied to updated records; record_split_tac is no longer
6263 part of the default claset; update_defs may now be removed from the
6264 simpset in many cases; COMPATIBILITY: old behavior achieved by
6266 claset_ref () := claset() addSWrapper record_split_wrapper;
6267 Delsimprocs [record_simproc]
6269 * HOL/typedef: fixed type inference for representing set; type
6270 arguments now have to occur explicitly on the rhs as type constraints;
6272 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6273 names rather than an ML expression;
6275 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6276 supplied later. Program schemes can be defined, such as
6277 "While B C s = (if B s then While B C (C s) else s)"
6278 where the well-founded relation can be chosen after B and C have been given.
6280 * HOL/List: the constructors of type list are now Nil and Cons;
6281 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6282 course, ML tools referring to List.list.op # etc. have to be adapted;
6284 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6285 disabled by default; run isabelle with option -m HOL to get back to
6286 the original Gordon/HOL-style output;
6288 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6289 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6291 * HOL basic syntax simplified (more orthogonal): all variants of
6292 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6293 Eps operator is provided as well: "SOME x. P[x]";
6295 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6297 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6298 thus available for user theories;
6300 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6301 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6304 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6305 several times and then mp;
6310 * the notation <<...>> is now available as a notation for sequences of
6313 * the simplifier is now installed
6315 * the axiom system has been generalized (thanks to Soren Heilmann)
6317 * the classical reasoner now has a default rule database
6322 * new primrec section allows primitive recursive functions to be given
6323 directly (as in HOL) over datatypes and the natural numbers;
6325 * new tactics induct_tac and exhaust_tac for induction (or case
6326 analysis) over datatypes and the natural numbers;
6328 * the datatype declaration of type T now defines the recursor T_rec;
6330 * simplification automatically does freeness reasoning for datatype
6333 * automatic type-inference, with AddTCs command to insert new
6334 type-checking rules;
6336 * datatype introduction rules are now added as Safe Introduction rules
6339 * the syntax "if P then x else y" is now available in addition to
6343 *** Internal programming interfaces ***
6345 * tuned simplifier trace output; new flag debug_simp;
6347 * structures Vartab / Termtab (instances of TableFun) offer efficient
6348 tables indexed by indexname_ord / term_ord (compatible with aconv);
6350 * AxClass.axclass_tac lost the theory argument;
6352 * tuned current_goals_markers semantics: begin / end goal avoids
6353 printing empty lines;
6355 * removed prs and prs_fn hook, which was broken because it did not
6356 include \n in its semantics, forcing writeln to add one
6357 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6358 string -> unit if you really want to output text without newline;
6360 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6361 plain output, interface builders may have to enable 'isabelle_font'
6362 mode to get Isabelle font glyphs as before;
6364 * refined token_translation interface; INCOMPATIBILITY: output length
6365 now of type real instead of int;
6367 * theory loader actions may be traced via new ThyInfo.add_hook
6368 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6369 your own database of information attached to *whole* theories -- as
6370 opposed to intra-theory data slots offered via TheoryDataFun;
6372 * proper handling of dangling sort hypotheses (at last!);
6373 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6374 extra sort hypotheses that can be witnessed from the type signature;
6375 the force_strip_shyps flag is gone, any remaining shyps are simply
6376 left in the theorem (with a warning issued by strip_shyps_warning);
6380 New in Isabelle98-1 (October 1998)
6381 ----------------------------------
6383 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6385 * several changes of automated proof tools;
6387 * HOL: major changes to the inductive and datatype packages, including
6388 some minor incompatibilities of theory syntax;
6390 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6393 * HOL: removed duplicate thms in Arith:
6394 less_imp_add_less should be replaced by trans_less_add1
6395 le_imp_add_le should be replaced by trans_le_add1
6397 * HOL: unary minus is now overloaded (new type constraints may be
6400 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6401 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6402 now taken as an integer constant.
6404 * Pure: ML function 'theory_of' renamed to 'theory';
6410 1. Asm_full_simp_tac is now more aggressive.
6411 1. It will sometimes reorient premises if that increases their power to
6413 2. It does no longer proceed strictly from left to right but may also
6414 rotate premises to achieve further simplification.
6415 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6416 old Asm_full_simp_tac in that it does not rotate premises.
6417 2. The simplifier now knows a little bit about nat-arithmetic.
6419 * Classical reasoner: wrapper mechanism for the classical reasoner now
6420 allows for selected deletion of wrappers, by introduction of names for
6421 wrapper functionals. This implies that addbefore, addSbefore,
6422 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6423 and that adding two tactics with the same name overwrites the first
6424 one (emitting a warning).
6425 type wrapper = (int -> tactic) -> (int -> tactic)
6426 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6427 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6428 delWrapper, delSWrapper: claset * string -> claset
6429 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6431 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6432 semantics; addbefore now affects only the unsafe part of step_tac
6433 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6434 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6437 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6438 compWrapper; added safe wrapper (and access functions for it);
6440 * HOL/split_all_tac is now much faster and fails if there is nothing
6441 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6442 and the names of the automatically generated variables have changed.
6443 split_all_tac has moved within claset() from unsafe wrappers to safe
6444 wrappers, which means that !!-bound variables are split much more
6445 aggressively, and safe_tac and clarify_tac now split such variables.
6446 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6447 Note: the same holds for record_split_tac, which does the job of
6448 split_all_tac for record fields.
6450 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6451 permanently to the default simpset using Addsplits just like
6452 Addsimps. They can be removed via Delsplits just like
6453 Delsimps. Lower-case versions are also available.
6455 * HOL/Simplifier: The rule split_if is now part of the default
6456 simpset. This means that the simplifier will eliminate all occurrences
6457 of if-then-else in the conclusion of a goal. To prevent this, you can
6458 either remove split_if completely from the default simpset by
6459 `Delsplits [split_if]' or remove it in a specific call of the
6460 simplifier using `... delsplits [split_if]'. You can also add/delete
6461 other case splitting rules to/from the default simpset: every datatype
6462 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6463 t is the name of the datatype).
6465 * Classical reasoner / Simplifier combination: new force_tac (and
6466 derivatives Force_tac, force) combines rewriting and classical
6467 reasoning (and whatever other tools) similarly to auto_tac, but is
6468 aimed to solve the given subgoal completely.
6473 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6474 and `goalw': the theory is no longer needed as an explicit argument -
6475 the current theory context is used; assumptions are no longer returned
6476 at the ML-level unless one of them starts with ==> or !!; it is
6477 recommended to convert to these new commands using isatool fixgoal
6478 (backup your sources first!);
6480 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6481 the current theory context, and 'theory' to lookup stored theories;
6483 * new theory section 'locale' for declaring constants, assumptions and
6484 definitions that have local scope;
6486 * new theory section 'nonterminals' for purely syntactic types;
6488 * new theory section 'setup' for generic ML setup functions
6489 (e.g. package initialization);
6491 * the distribution now includes Isabelle icons: see
6492 lib/logo/isabelle-{small,tiny}.xpm;
6494 * isatool install - install binaries with absolute references to
6497 * isatool logo -- create instances of the Isabelle logo (as EPS);
6499 * print mode 'emacs' reserved for Isamode;
6501 * support multiple print (ast) translations per constant name;
6503 * theorems involving oracles are now printed with a suffixed [!];
6508 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6510 * HOL/inductive package reorganized and improved: now supports mutual
6516 oddI "n : EVEN ==> Suc n : ODD"
6517 evenI "n : ODD ==> Suc n : EVEN"
6519 new theorem list "elims" contains an elimination rule for each of the
6520 recursive sets; inductive definitions now handle disjunctive premises
6521 correctly (also ZF);
6523 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6524 "mutual_induct" no longer exists - the induction rule is always
6525 contained in "induct";
6528 * HOL/datatype package re-implemented and greatly improved: now
6529 supports mutually recursive datatypes such as
6532 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6533 | SUM ('a aexp) ('a aexp)
6534 | DIFF ('a aexp) ('a aexp)
6537 'a bexp = LESS ('a aexp) ('a aexp)
6538 | AND ('a bexp) ('a bexp)
6539 | OR ('a bexp) ('a bexp)
6541 as well as indirectly recursive datatypes such as
6544 ('a, 'b) term = Var 'a
6545 | App 'b ((('a, 'b) term) list)
6547 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6548 induction on mutually / indirectly recursive datatypes.
6550 Primrec equations are now stored in theory and can be accessed via
6551 <function_name>.simps.
6555 - Theories using datatypes must now have theory Datatype as an
6557 - The specific <typename>.induct_tac no longer exists - use the
6558 generic induct_tac instead.
6559 - natE has been renamed to nat.exhaust - use exhaust_tac
6560 instead of res_inst_tac ... natE. Note that the variable
6561 names in nat.exhaust differ from the names in natE, this
6562 may cause some "fragile" proofs to fail.
6563 - The theorems split_<typename>_case and split_<typename>_case_asm
6564 have been renamed to <typename>.split and <typename>.split_asm.
6565 - Since default sorts of type variables are now handled correctly,
6566 some datatype definitions may have to be annotated with explicit
6568 - Primrec definitions no longer require function name and type
6569 of recursive argument.
6571 Consider using isatool fixdatatype to adapt your theories and proof
6572 scripts to the new package (backup your sources first!).
6575 * HOL/record package: considerably improved implementation; now
6576 includes concrete syntax for record types, terms, updates; theorems
6577 for surjective pairing and splitting !!-bound record variables; proof
6578 support is as follows:
6580 1) standard conversions (selectors or updates applied to record
6581 constructor terms) are part of the standard simpset;
6583 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6584 made part of standard simpset and claset via addIffs;
6586 3) a tactic for record field splitting (record_split_tac) is part of
6587 the standard claset (addSWrapper);
6589 To get a better idea about these rules you may retrieve them via
6590 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6591 the name of your record type.
6593 The split tactic 3) conceptually simplifies by the following rule:
6595 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6597 Thus any record variable that is bound by meta-all will automatically
6598 blow up into some record constructor term, consequently the
6599 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6600 solve record problems automatically.
6603 * reorganized the main HOL image: HOL/Integ and String loaded by
6604 default; theory Main includes everything;
6606 * automatic simplification of integer sums and comparisons, using cancellation;
6608 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6610 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6612 * many new identities for unions, intersections, set difference, etc.;
6614 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6615 called split_if, split_split, split_sum_case and split_nat_case (to go
6616 with add/delsplits);
6618 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6619 (?x::unit) = (); this is made part of the default simpset, which COULD
6620 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6621 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6622 unit_abs_eta_conv is added in order to counter the effect of
6623 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6626 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6629 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6630 It and 'sym RS equals0D' are now in the default claset, giving automatic
6631 disjointness reasoning but breaking a few old proofs.
6633 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6634 to 'converse' from 'inverse' (for compatibility with ZF and some
6637 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6638 the well-founded relation;
6640 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6641 Compl A. The "Compl" syntax remains available as input syntax for this
6644 * HOL/Update: new theory of function updates:
6645 f(a:=b) == %x. if x=a then b else f x
6646 may also be iterated as in f(a:=b,c:=d,...);
6648 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6651 - new function list_update written xs[i:=v] that updates the i-th
6652 list position. May also be iterated as in xs[i:=a,j:=b,...].
6653 - new function `upt' written [i..j(] which generates the list
6654 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6655 bound write [i..j], which is a shorthand for [i..j+1(].
6656 - new lexicographic orderings and corresponding wellfoundedness theorems.
6659 - removed 'pred' (predecessor) function;
6660 - generalized some theorems about n-1;
6661 - many new laws about "div" and "mod";
6662 - new laws about greatest common divisors (see theory ex/Primes);
6664 * HOL/Relation: renamed the relational operator r^-1 "converse"
6665 instead of "inverse";
6667 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6668 of the multiset ordering;
6670 * directory HOL/Real: a construction of the reals using Dedekind cuts
6671 (not included by default);
6673 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6675 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6676 programs, i.e. different program variables may have different types.
6678 * calling (stac rew i) now fails if "rew" has no effect on the goal
6679 [previously, this check worked only if the rewrite rule was unconditional]
6680 Now rew can involve either definitions or equalities (either == or =).
6685 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6686 only the theorems proved on ZF.ML;
6688 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6689 It and 'sym RS equals0D' are now in the default claset, giving automatic
6690 disjointness reasoning but breaking a few old proofs.
6692 * ZF/Update: new theory of function updates
6693 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6694 may also be iterated as in f(a:=b,c:=d,...);
6696 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6698 * calling (stac rew i) now fails if "rew" has no effect on the goal
6699 [previously, this check worked only if the rewrite rule was unconditional]
6700 Now rew can involve either definitions or equalities (either == or =).
6702 * case_tac provided for compatibility with HOL
6703 (like the old excluded_middle_tac, but with subgoals swapped)
6706 *** Internal programming interfaces ***
6708 * Pure: several new basic modules made available for general use, see
6709 also src/Pure/README;
6711 * improved the theory data mechanism to support encapsulation (data
6712 kind name replaced by private Object.kind, acting as authorization
6713 key); new type-safe user interface via functor TheoryDataFun; generic
6714 print_data function becomes basically useless;
6716 * removed global_names compatibility flag -- all theory declarations
6717 are qualified by default;
6719 * module Pure/Syntax now offers quote / antiquote translation
6720 functions (useful for Hoare logic etc. with implicit dependencies);
6721 see HOL/ex/Antiquote for an example use;
6723 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6726 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6729 * Display.print_goals function moved to Locale.print_goals;
6731 * standard print function for goals supports current_goals_markers
6732 variable for marking begin of proof, end of proof, start of goal; the
6733 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6734 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6739 New in Isabelle98 (January 1998)
6740 --------------------------------
6742 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6744 * changed lexical syntax of terms / types: dots made part of long
6745 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6747 * simpset (and claset) reference variable replaced by functions
6748 simpset / simpset_ref;
6750 * no longer supports theory aliases (via merge) and non-trivial
6751 implicit merge of thms' signatures;
6753 * most internal names of constants changed due to qualified names;
6755 * changed Pure/Sequence interface (see Pure/seq.ML);
6758 *** General Changes ***
6760 * hierachically structured name spaces (for consts, types, axms, thms
6761 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6762 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6763 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6764 long_names for fully qualified output names; NOTE: ML programs
6765 (special tactics, packages etc.) referring to internal names may have
6766 to be adapted to cope with fully qualified names; in case of severe
6767 backward campatibility problems try setting 'global_names' at compile
6768 time to have enrything declared within a flat name space; one may also
6769 fine tune name declarations in theories via the 'global' and 'local'
6772 * reimplemented the implicit simpset and claset using the new anytype
6773 data filed in signatures; references simpset:simpset ref etc. are
6774 replaced by functions simpset:unit->simpset and
6775 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6776 to patch your ML files accordingly;
6778 * HTML output now includes theory graph data for display with Java
6779 applet or isatool browser; data generated automatically via isatool
6780 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6782 * defs may now be conditional; improved rewrite_goals_tac to handle
6783 conditional equations;
6785 * defs now admits additional type arguments, using TYPE('a) syntax;
6787 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6788 creates a new theory node; implicit merge of thms' signatures is
6789 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6790 transfer:theory->thm->thm in (rare) cases;
6792 * improved handling of draft signatures / theories; draft thms (and
6793 ctyps, cterms) are automatically promoted to real ones;
6795 * slightly changed interfaces for oracles: admit many per theory, named
6796 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6798 * print_goals: optional output of const types (set show_consts and
6801 * improved output of warnings (###) and errors (***);
6803 * subgoal_tac displays a warning if the new subgoal has type variables;
6805 * removed old README and Makefiles;
6807 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6809 * removed obsolete init_pps and init_database;
6811 * deleted the obsolete tactical STATE, which was declared by
6812 fun STATE tacfun st = tacfun st st;
6814 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6815 (which abbreviates $HOME);
6817 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6818 use isatool fixseq to adapt your ML programs (this works for fully
6819 qualified references to the Sequence structure only!);
6821 * use_thy no longer requires writable current directory; it always
6822 reloads .ML *and* .thy file, if either one is out of date;
6825 *** Classical Reasoner ***
6827 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6828 tactics that use classical reasoning to simplify a subgoal without
6829 splitting it into several subgoals;
6831 * Safe_tac: like safe_tac but uses the default claset;
6836 * added simplification meta rules:
6837 (asm_)(full_)simplify: simpset -> thm -> thm;
6839 * simplifier.ML no longer part of Pure -- has to be loaded by object
6842 * added prems argument to simplification procedures;
6844 * HOL, FOL, ZF: added infix function `addsplits':
6845 instead of `<simpset> setloop (split_tac <thms>)'
6846 you can simply write `<simpset> addsplits <thms>'
6851 * TYPE('a) syntax for type reflection terms;
6853 * no longer handles consts with name "" -- declare as 'syntax' instead;
6855 * pretty printer: changed order of mixfix annotation preference (again!);
6857 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6862 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6863 with `addloop' of the simplifier to faciliate case splitting in premises.
6865 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6867 * HOL/Auth: new protocol proofs including some for the Internet
6870 * HOL/Map: new theory of `maps' a la VDM;
6872 * HOL/simplifier: simplification procedures nat_cancel_sums for
6873 cancelling out common nat summands from =, <, <= (in)equalities, or
6874 differences; simplification procedures nat_cancel_factor for
6875 cancelling common factor from =, <, <= (in)equalities over natural
6876 sums; nat_cancel contains both kinds of procedures, it is installed by
6877 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6879 * HOL/simplifier: terms of the form
6880 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6882 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6883 and those of the form
6884 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6886 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6889 Each datatype `t' now comes with a theorem `split_t_case' of the form
6891 P(t_case f1 ... fn x) =
6892 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6894 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6897 and a theorem `split_t_case_asm' of the form
6899 P(t_case f1 ... fn x) =
6900 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6902 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6904 which can be added to a simpset via `addsplits'. The existing theorems
6905 expand_list_case and expand_option_case have been renamed to
6906 split_list_case and split_option_case.
6909 - `pred n' is automatically converted to `n-1'.
6910 Users are strongly encouraged not to use `pred' any longer,
6911 because it will disappear altogether at some point.
6912 - Users are strongly encouraged to write "0 < n" rather than
6913 "n ~= 0". Theorems and proof tools have been modified towards this
6917 the function "set_of_list" has been renamed "set" (and its theorems too);
6918 the function "nth" now takes its arguments in the reverse order and
6919 has acquired the infix notation "!" as in "xs!n".
6921 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6923 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6924 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6926 * HOL/record: extensible records with schematic structural subtyping
6927 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6928 still lacks various theorems and concrete record syntax;
6933 * removed "axioms" and "generated by" sections;
6935 * replaced "ops" section by extended "consts" section, which is capable of
6936 handling the continuous function space "->" directly;
6939 . proves theorems immediately and stores them in the theory,
6940 . creates hierachical name space,
6941 . now uses normal mixfix annotations (instead of cinfix...),
6942 . minor changes to some names and values (for consistency),
6943 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6944 . separator between mutual domain defs: changed "," to "and",
6945 . improved handling of sort constraints; now they have to
6946 appear on the left-hand side of the equations only;
6948 * fixed LAM <x,y,zs>.b syntax;
6950 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6951 adm (%x. P (t x)), where P is chainfinite and t continuous;
6956 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6957 with `addloop' of the simplifier to faciliate case splitting in premises.
6959 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6960 in HOL, they strip ALL and --> from proved theorems;
6964 New in Isabelle94-8 (May 1997)
6965 ------------------------------
6967 *** General Changes ***
6969 * new utilities to build / run / maintain Isabelle etc. (in parts
6970 still somewhat experimental); old Makefiles etc. still functional;
6972 * new 'Isabelle System Manual';
6974 * INSTALL text, together with ./configure and ./build scripts;
6976 * reimplemented type inference for greater efficiency, better error
6977 messages and clean internal interface;
6979 * prlim command for dealing with lots of subgoals (an easier way of
6980 setting goals_limit);
6985 * supports alternative (named) syntax tables (parser and pretty
6986 printer); internal interface is provided by add_modesyntax(_i);
6988 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6989 be used in conjunction with the Isabelle symbol font; uses the
6990 "symbols" syntax table;
6992 * added token_translation interface (may translate name tokens in
6993 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6994 the current print_mode); IMPORTANT: user print translation functions
6995 are responsible for marking newly introduced bounds
6996 (Syntax.mark_boundT);
6998 * token translations for modes "xterm" and "xterm_color" that display
6999 names in bold, underline etc. or colors (which requires a color
7002 * infixes may now be declared with names independent of their syntax;
7004 * added typed_print_translation (like print_translation, but may
7005 access type of constant);
7008 *** Classical Reasoner ***
7010 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7011 some limitations. Blast_tac...
7012 + ignores addss, addbefore, addafter; this restriction is intrinsic
7013 + ignores elimination rules that don't have the correct format
7014 (the conclusion MUST be a formula variable)
7015 + ignores types, which can make HOL proofs fail
7016 + rules must not require higher-order unification, e.g. apply_type in ZF
7017 [message "Function Var's argument not a bound variable" relates to this]
7018 + its proof strategy is more general but can actually be slower
7020 * substitution with equality assumptions no longer permutes other
7023 * minor changes in semantics of addafter (now called addaltern); renamed
7024 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7025 (and access functions for it);
7027 * improved combination of classical reasoner and simplifier:
7028 + functions for handling clasimpsets
7029 + improvement of addss: now the simplifier is called _after_ the
7031 + safe variant of addss called addSss: uses safe simplifications
7032 _during_ the safe steps. It is more complete as it allows multiple
7033 instantiations of unknowns (e.g. with slow_tac).
7037 * added interface for simplification procedures (functions that
7038 produce *proven* rewrite rules on the fly, depending on current
7041 * ordering on terms as parameter (used for ordered rewriting);
7043 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7045 * the solver is now split into a safe and an unsafe part.
7046 This should be invisible for the normal user, except that the
7047 functions setsolver and addsolver have been renamed to setSolver and
7048 addSolver; added safe_asm_full_simp_tac;
7053 * a generic induction tactic `induct_tac' which works for all datatypes and
7054 also for type `nat';
7056 * a generic case distinction tactic `exhaust_tac' which works for all
7057 datatypes and also for type `nat';
7059 * each datatype comes with a function `size';
7061 * patterns in case expressions allow tuple patterns as arguments to
7062 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7064 * primrec now also works with type nat;
7066 * recdef: a new declaration form, allows general recursive functions to be
7067 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7069 * the constant for negation has been renamed from "not" to "Not" to
7070 harmonize with FOL, ZF, LK, etc.;
7072 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7075 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7077 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7078 problems in commutative rings, using axiomatic type classes for + and *;
7080 * more examples in HOL/MiniML and HOL/Auth;
7082 * more default rewrite rules for quantifiers, union/intersection;
7084 * a new constant `arbitrary == @x.False';
7086 * HOLCF/IOA replaces old HOL/IOA;
7088 * HOLCF changes: derived all rules and arities
7089 + axiomatic type classes instead of classes
7090 + typedef instead of faking type definitions
7091 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7092 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7093 + eliminated the types void, one, tr
7094 + use unit lift and bool lift (with translations) instead of one and tr
7095 + eliminated blift from Lift3.thy (use Def instead of blift)
7096 all eliminated rules are derived as theorems --> no visible changes ;
7101 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7102 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7103 as ZF_cs addSIs [equalityI];
7107 New in Isabelle94-7 (November 96)
7108 ---------------------------------
7110 * allowing negative levels (as offsets) in prlev and choplev;
7112 * super-linear speedup for large simplifications;
7114 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7115 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7116 FAIL); can suppress it using the command Delsimps (ex_simps @
7117 all_simps); De Morgan laws are also now included, by default;
7119 * improved printing of ==> : ~:
7121 * new object-logic "Sequents" adds linear logic, while replacing LK
7122 and Modal (thanks to Sara Kalvala);
7124 * HOL/Auth: correctness proofs for authentication protocols;
7126 * HOL: new auto_tac combines rewriting and classical reasoning (many
7127 examples on HOL/Auth);
7129 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7130 the rewriter and classical reasoner simultaneously;
7132 * function uresult no longer returns theorems in "standard" format;
7133 regain previous version by: val uresult = standard o uresult;
7140 * oracles -- these establish an interface between Isabelle and trusted
7141 external reasoners, which may deliver results as theorems;
7143 * proof objects (in particular record all uses of oracles);
7145 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7147 * "constdefs" section in theory files;
7149 * "primrec" section (HOL) no longer requires names;
7151 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7158 * reduced space requirements;
7160 * automatic HTML generation from theories;
7162 * theory files no longer require "..." (quotes) around most types;
7164 * new examples, including two proofs of the Church-Rosser theorem;
7166 * non-curried (1994) version of HOL is no longer distributed;
7173 * greatly reduced space requirements;
7175 * theory files (.thy) no longer require \...\ escapes at line breaks;
7177 * searchable theorem database (see the section "Retrieving theorems" on
7178 page 8 of the Reference Manual);
7180 * new examples, including Grabczewski's monumental case study of the
7183 * The previous version of HOL renamed to Old_HOL;
7185 * The new version of HOL (previously called CHOL) uses a curried syntax
7186 for functions. Application looks like f a b instead of f(a,b);
7188 * Mutually recursive inductive definitions finally work in HOL;
7190 * In ZF, pattern-matching on tuples is now available in all abstractions and
7191 translates to the operator "split";
7198 * new infix operator, addss, allowing the classical reasoner to
7199 perform simplification at each step of its search. Example:
7200 fast_tac (cs addss ss)
7202 * a new logic, CHOL, the same as HOL, but with a curried syntax
7203 for functions. Application looks like f a b instead of f(a,b). Also pairs
7204 look like (a,b) instead of <a,b>;
7206 * PLEASE NOTE: CHOL will eventually replace HOL!
7208 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7209 It translates to the operator "split". A new theory of integers is available;
7211 * In ZF, integer numerals now denote two's-complement binary integers.
7212 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7214 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7215 of the Axiom of Choice;
7222 * Significantly faster resolution;
7224 * the different sections in a .thy file can now be mixed and repeated
7227 * Database of theorems for FOL, HOL and ZF. New
7228 commands including qed, qed_goal and bind_thm store theorems in the database.
7230 * Simple database queries: return a named theorem (get_thm) or all theorems of
7231 a given theory (thms_of), or find out what theory a theorem was proved in
7234 * Bugs fixed in the inductive definition and datatype packages;
7236 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7237 and HOL_dup_cs obsolete;
7239 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7242 * Simpler definition of function space in ZF;
7244 * new results about cardinal and ordinal arithmetic in ZF;
7246 * 'subtype' facility in HOL for introducing new types as subsets of existing
7249 :mode=text:wrap=hard:maxLineLen=72: