use local /home/isatest/polyml-5.3.0 on atbroy102 to avoid problems with the SMB filesystem via homebroy;
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
92 * Predicates of locales introduces by classes carry a mandatory
93 "class" prefix. INCOMPATIBILITY.
95 * Command 'code_reflect' allows to incorporate generated ML code into
96 runtime environment; replaces immature code_datatype antiquotation.
99 * Empty class specifications observe default sort. INCOMPATIBILITY.
101 * Old 'axclass' command has been discontinued. Use 'class' instead.
104 * Code generator: simple concept for abstract datatypes obeying
107 * Local theory specifications may depend on extra type variables that
108 are not present in the result type -- arguments TYPE('a) :: 'a itself
109 are added internally. For example:
111 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
113 * Code generator: details of internal data cache have no impact on the
114 user space functionality any longer.
116 * Methods unfold_locales and intro_locales ignore non-locale subgoals.
117 This is more appropriate for interpretations with 'where'.
120 * Discontinued unnamed infix syntax (legacy feature for many years) --
121 need to specify constant name and syntax separately. Internal ML
122 datatype constructors have been renamed from InfixName to Infix etc.
123 Minor INCOMPATIBILITY.
125 * Command 'example_proof' opens an empty proof body. This allows to
126 experiment with Isar, without producing any persistent result.
128 * Commands 'type_notation' and 'no_type_notation' declare type syntax
129 within a local theory context, with explicit checking of the
130 constructors involved (in contrast to the raw 'syntax' versions).
132 * Commands 'types' and 'typedecl' now work within a local theory
133 context -- without introducing dependencies on parameters or
134 assumptions, which is not possible in Isabelle/Pure.
136 * Command 'defaultsort' has been renamed to 'default_sort', it works
137 within a local theory context. Minor INCOMPATIBILITY.
139 * Proof terms: Type substitutions on proof constants now use canonical
140 order of type variables. Potential INCOMPATIBILITY for tools working
146 * List membership infix mem operation is only an input abbreviation.
149 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
150 for future developements; former Library/Word.thy is still present in
151 the AFP entry RSAPPS.
153 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
154 longer shadowed. INCOMPATIBILITY.
156 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
159 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
162 * Dropped normalizing_semiring etc; use the facts in semiring classes
163 instead. INCOMPATIBILITY.
165 * Dropped several real-specific versions of lemmas about floor and
166 ceiling; use the generic lemmas from Archimedean_Field.thy instead.
169 floor_number_of_eq ~> floor_number_of
170 le_floor_eq_number_of ~> number_of_le_floor
171 le_floor_eq_zero ~> zero_le_floor
172 le_floor_eq_one ~> one_le_floor
173 floor_less_eq_number_of ~> floor_less_number_of
174 floor_less_eq_zero ~> floor_less_zero
175 floor_less_eq_one ~> floor_less_one
176 less_floor_eq_number_of ~> number_of_less_floor
177 less_floor_eq_zero ~> zero_less_floor
178 less_floor_eq_one ~> one_less_floor
179 floor_le_eq_number_of ~> floor_le_number_of
180 floor_le_eq_zero ~> floor_le_zero
181 floor_le_eq_one ~> floor_le_one
182 floor_subtract_number_of ~> floor_diff_number_of
183 floor_subtract_one ~> floor_diff_one
184 ceiling_number_of_eq ~> ceiling_number_of
185 ceiling_le_eq_number_of ~> ceiling_le_number_of
186 ceiling_le_zero_eq ~> ceiling_le_zero
187 ceiling_le_eq_one ~> ceiling_le_one
188 less_ceiling_eq_number_of ~> number_of_less_ceiling
189 less_ceiling_eq_zero ~> zero_less_ceiling
190 less_ceiling_eq_one ~> one_less_ceiling
191 ceiling_less_eq_number_of ~> ceiling_less_number_of
192 ceiling_less_eq_zero ~> ceiling_less_zero
193 ceiling_less_eq_one ~> ceiling_less_one
194 le_ceiling_eq_number_of ~> number_of_le_ceiling
195 le_ceiling_eq_zero ~> zero_le_ceiling
196 le_ceiling_eq_one ~> one_le_ceiling
197 ceiling_subtract_number_of ~> ceiling_diff_number_of
198 ceiling_subtract_one ~> ceiling_diff_one
200 * Theory "Finite_Set": various folding_XXX locales facilitate the
201 application of the various fold combinators on finite sets.
203 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
204 provides abstract red-black tree type which is backed by "RBT_Impl" as
205 implementation. INCOMPATIBILTY.
207 * Command 'typedef' now works within a local theory context -- without
208 introducing dependencies on parameters or assumptions, which is not
209 possible in Isabelle/Pure/HOL. Note that the logical environment may
210 contain multiple interpretations of local typedefs (with different
211 non-emptiness proofs), even in a global theory context.
213 * Theory Library/Coinductive_List has been removed -- superseded by
214 AFP/thys/Coinductive.
216 * Theory PReal, including the type "preal" and related operations, has
217 been removed. INCOMPATIBILITY.
219 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
220 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
222 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
223 "Int" etc. INCOMPATIBILITY.
225 * Constant Rat.normalize needs to be qualified. Minor
228 * New set of rules "ac_simps" provides combined assoc / commute
229 rewrites for all interpretations of the appropriate generic locales.
231 * Renamed theory "OrderedGroup" to "Groups" and split theory
232 "Ring_and_Field" into theories "Rings" and "Fields"; for more
233 appropriate and more consistent names suitable for name prefixes
234 within the HOL theories. INCOMPATIBILITY.
236 * Some generic constants have been put to appropriate theories:
237 - less_eq, less: Orderings
238 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
239 - inverse, divide: Rings
242 * More consistent naming of type classes involving orderings (and
245 lower_semilattice ~> semilattice_inf
246 upper_semilattice ~> semilattice_sup
248 dense_linear_order ~> dense_linorder
250 pordered_ab_group_add ~> ordered_ab_group_add
251 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
252 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
253 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
254 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
255 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
256 pordered_cancel_semiring ~> ordered_cancel_semiring
257 pordered_comm_monoid_add ~> ordered_comm_monoid_add
258 pordered_comm_ring ~> ordered_comm_ring
259 pordered_comm_semiring ~> ordered_comm_semiring
260 pordered_ring ~> ordered_ring
261 pordered_ring_abs ~> ordered_ring_abs
262 pordered_semiring ~> ordered_semiring
264 ordered_ab_group_add ~> linordered_ab_group_add
265 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
266 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
267 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
268 ordered_field ~> linordered_field
269 ordered_field_no_lb ~> linordered_field_no_lb
270 ordered_field_no_ub ~> linordered_field_no_ub
271 ordered_field_dense_linear_order ~> dense_linordered_field
272 ordered_idom ~> linordered_idom
273 ordered_ring ~> linordered_ring
274 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
275 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
276 ordered_ring_strict ~> linordered_ring_strict
277 ordered_semidom ~> linordered_semidom
278 ordered_semiring ~> linordered_semiring
279 ordered_semiring_1 ~> linordered_semiring_1
280 ordered_semiring_1_strict ~> linordered_semiring_1_strict
281 ordered_semiring_strict ~> linordered_semiring_strict
283 The following slightly odd type classes have been moved to a
284 separate theory Library/Lattice_Algebras.thy:
286 lordered_ab_group_add ~> lattice_ab_group_add
287 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
288 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
289 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
290 lordered_ring ~> lattice_ring
294 * Refined field classes:
295 - classes division_ring_inverse_zero, field_inverse_zero,
296 linordered_field_inverse_zero include rule inverse 0 = 0 --
297 subsumes former division_by_zero class;
298 - numerous lemmas have been ported from field to division_ring.
301 * Refined algebra theorem collections:
302 - dropped theorem group group_simps, use algebra_simps instead;
303 - dropped theorem group ring_simps, use field_simps instead;
304 - proper theorem collection field_simps subsumes former theorem
305 groups field_eq_simps and field_simps;
306 - dropped lemma eq_minus_self_iff which is a duplicate for
310 * Theory Finite_Set and List: some lemmas have been generalized from
313 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
314 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
315 inter_Inter_fold_inter ~> inf_Inf_fold_inf
316 union_Union_fold_union ~> sup_Sup_fold_sup
317 Inter_fold_inter ~> Inf_fold_inf
318 Union_fold_union ~> Sup_fold_sup
319 inter_INTER_fold_inter ~> inf_INFI_fold_inf
320 union_UNION_fold_union ~> sup_SUPR_fold_sup
321 INTER_fold_inter ~> INFI_fold_inf
322 UNION_fold_union ~> SUPR_fold_sup
324 * Theory Complete_Lattice: lemmas top_def and bot_def have been
325 replaced by the more convenient lemmas Inf_empty and Sup_empty.
326 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
327 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
328 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
329 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
331 * HOLogic.strip_psplit: types are returned in syntactic order, similar
332 to other strip and tuple operations. INCOMPATIBILITY.
334 * Reorganized theory Multiset: swapped notation of pointwise and
336 - pointwise ordering is instance of class order with standard syntax
338 - multiset ordering has syntax <=# and <#; partial order properties
339 are provided by means of interpretation with prefix
341 - less duplication, less historical organization of sections,
342 conversion from associations lists to multisets, rudimentary code
344 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
347 multiset_eq_conv_count_eq -> multiset_ext_iff
348 multi_count_ext -> multiset_ext
349 diff_union_inverse2 -> diff_union_cancelR
352 * Theory Permutation: replaced local "remove" by List.remove1.
354 * Code generation: ML and OCaml code is decorated with signatures.
356 * Theory List: added transpose.
358 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
359 clash with new theory Quotient in Main HOL.
361 * Library/Nat_Bijection.thy is a collection of bijective functions
362 between nat and other types, which supersedes the older libraries
363 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
366 Nat_Int_Bij.nat2_to_nat ~> prod_encode
367 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
368 Nat_Int_Bij.int_to_nat_bij ~> int_encode
369 Nat_Int_Bij.nat_to_int_bij ~> int_decode
370 Countable.pair_encode ~> prod_encode
371 NatIso.prod2nat ~> prod_encode
372 NatIso.nat2prod ~> prod_decode
373 NatIso.sum2nat ~> sum_encode
374 NatIso.nat2sum ~> sum_decode
375 NatIso.list2nat ~> list_encode
376 NatIso.nat2list ~> list_decode
377 NatIso.set2nat ~> set_encode
378 NatIso.nat2set ~> set_decode
381 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
382 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
383 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
384 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
385 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
386 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
387 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
388 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
389 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
390 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
391 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
392 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
393 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
396 - Renamed ATP commands:
397 atp_info ~> sledgehammer running_atps
398 atp_kill ~> sledgehammer kill_atps
399 atp_messages ~> sledgehammer messages
400 atp_minimize ~> sledgehammer minimize
401 print_atps ~> sledgehammer available_atps
403 - Added user's manual ("isabelle doc sledgehammer").
404 - Added option syntax and "sledgehammer_params" to customize
405 Sledgehammer's behavior. See the manual for details.
406 - Modified the Isar proof reconstruction code so that it produces
407 direct proofs rather than proofs by contradiction. (This feature
408 is still experimental.)
409 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
411 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
414 - Added and implemented "binary_ints" and "bits" options.
415 - Added "std" option and implemented support for nonstandard models.
416 - Added and implemented "finitize" option to improve the precision
417 of infinite datatypes based on a monotonicity analysis.
418 - Added support for quotient types.
419 - Added support for "specification" and "ax_specification"
421 - Added support for local definitions (for "function" and
422 "termination" proofs).
423 - Added support for term postprocessors.
424 - Optimized "Multiset.multiset" and "FinFun.finfun".
425 - Improved efficiency of "destroy_constrs" optimization.
426 - Fixed soundness bugs related to "destroy_constrs" optimization and
428 - Fixed soundness bug related to higher-order constructors
429 - Improved precision of set constructs.
430 - Added cache to speed up repeated Kodkod invocations on the same
432 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
433 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
434 "SAT4J_Light". INCOMPATIBILITY.
435 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
436 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
438 * Moved the SMT binding into the HOL image.
443 * Variable names in lemmas generated by the domain package have
444 changed; the naming scheme is now consistent with the HOL datatype
445 package. Some proof scripts may be affected, INCOMPATIBILITY.
447 * The domain package no longer defines the function "foo_copy" for
448 recursive domain "foo". The reach lemma is now stated directly in
449 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
450 be reformulated in terms of "foo_take", INCOMPATIBILITY.
452 * Most definedness lemmas generated by the domain package (previously
453 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
454 like "foo$x = UU <-> x = UU", which works better as a simp rule.
455 Proof scripts that used definedness lemmas as intro rules may break,
456 potential INCOMPATIBILITY.
458 * Induction and casedist rules generated by the domain package now
459 declare proper case_names (one called "bottom", and one named for each
460 constructor). INCOMPATIBILITY.
462 * For mutually-recursive domains, separate "reach" and "take_lemma"
463 rules are generated for each domain, INCOMPATIBILITY.
465 foo_bar.reach ~> foo.reach bar.reach
466 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
468 * Some lemmas generated by the domain package have been renamed for
469 consistency with the datatype package, INCOMPATIBILITY.
471 foo.ind ~> foo.induct
472 foo.finite_ind ~> foo.finite_induct
473 foo.coind ~> foo.coinduct
474 foo.casedist ~> foo.exhaust
475 foo.exhaust ~> foo.nchotomy
477 * For consistency with other definition packages, the fixrec package
478 now generates qualified theorem names, INCOMPATIBILITY.
480 foo_simps ~> foo.simps
481 foo_unfold ~> foo.unfold
482 foo_induct ~> foo.induct
484 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
485 method and internal fixrec proofs now use the default simpset instead.
488 * The "contlub" predicate has been removed. Proof scripts should use
489 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
491 * The "admw" predicate has been removed, INCOMPATIBILITY.
493 * The constants cpair, cfst, and csnd have been removed in favor of
494 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
499 * Renamed some important ML structures, while keeping the old names
500 for some time as aliases within the structure Legacy:
502 OuterKeyword ~> Keyword
505 OuterSyntax ~> Outer_Syntax
506 PrintMode ~> Print_Mode
507 SpecParse ~> Parse_Spec
510 ThyOutput ~> Thy_Output
511 TypeInfer ~> Type_Infer
513 Note that "open Legacy" simplifies porting of sources, but forgetting
514 to remove it again will complicate porting again in the future.
516 * Most operations that refer to a global context are named
517 accordingly, e.g. Simplifier.global_context or
518 ProofContext.init_global. There are some situations where a global
519 context actually works, but under normal circumstances one needs to
520 pass the proper local context through the code!
522 * Discontinued old TheoryDataFun with its copy/init operation -- data
523 needs to be pure. Functor Theory_Data_PP retains the traditional
524 Pretty.pp argument to merge, which is absent in the standard
527 * Antiquotations for basic formal entities:
529 @{class NAME} -- type class
530 @{class_syntax NAME} -- syntax representation of the above
532 @{type_name NAME} -- logical type
533 @{type_abbrev NAME} -- type abbreviation
534 @{nonterminal NAME} -- type of concrete syntactic category
535 @{type_syntax NAME} -- syntax representation of any of the above
537 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
538 @{const_abbrev NAME} -- abbreviated constant
539 @{const_syntax NAME} -- syntax representation of any of the above
541 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
542 syntax constant (cf. 'syntax' command).
544 * Antiquotation @{make_string} inlines a function to print arbitrary
545 values similar to the ML toplevel. The result is compiler dependent
546 and may fall back on "?" in certain situations.
548 * Sorts.certify_sort and derived "cert" operations for types and terms
549 no longer minimize sorts. Thus certification at the boundary of the
550 inference kernel becomes invariant under addition of class relations,
551 which is an important monotonicity principle. Sorts are now minimized
552 in the syntax layer only, at the boundary between the end-user and the
553 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
554 explicitly in rare situations.
556 * Renamed old-style Drule.standard to Drule.export_without_context, to
557 emphasize that this is in no way a standard operation.
560 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
561 usual for resolution. Rare INCOMPATIBILITY.
563 * Renamed varify/unvarify operations to varify_global/unvarify_global
564 to emphasize that these only work in a global situation (which is
567 * Configuration options now admit dynamic default values, depending on
568 the context or even global references.
570 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
571 uses an efficient external library if available (for Poly/ML).
573 * Curried take and drop in library.ML; negative length is interpreted
574 as infinity (as in chop). Subtle INCOMPATIBILITY.
579 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
580 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
581 proof terms are enabled unconditionally in the new HOL-Proofs image.
583 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
584 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
587 * Old lib/scripts/polyml-platform is superseded by the
588 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
589 variant, even on a 64 bit machine. The following example setting
590 prefers 64 bit if available:
592 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
594 * The preliminary Isabelle/jEdit application demonstrates the emerging
595 Isabelle/Scala layer for advanced prover interaction and integration.
596 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
601 New in Isabelle2009-1 (December 2009)
602 -------------------------------------
606 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
607 one backslash should be used, even in ML sources.
612 * Locale interpretation propagates mixins along the locale hierarchy.
613 The currently only available mixins are the equations used to map
614 local definitions to terms of the target domain of an interpretation.
616 * Reactivated diagnostic command 'print_interps'. Use "print_interps
617 loc" to print all interpretations of locale "loc" in the theory.
618 Interpretations in proofs are not shown.
620 * Thoroughly revised locales tutorial. New section on conditional
623 * On instantiation of classes, remaining undefined class parameters
624 are formally declared. INCOMPATIBILITY.
627 *** Document preparation ***
629 * New generalized style concept for printing terms: @{foo (style) ...}
630 instead of @{foo_style style ...} (old form is still retained for
631 backward compatibility). Styles can be also applied for
632 antiquotations prop, term_type and typeof.
637 * New proof method "smt" for a combination of first-order logic with
638 equality, linear and nonlinear (natural/integer/real) arithmetic, and
639 fixed-size bitvectors; there is also basic support for higher-order
640 features (esp. lambda abstractions). It is an incomplete decision
641 procedure based on external SMT solvers using the oracle mechanism;
642 for the SMT solver Z3, this method is proof-producing. Certificates
643 are provided to avoid calling the external solvers solely for
644 re-checking proofs. Due to a remote SMT service there is no need for
645 installing SMT solvers locally. See src/HOL/SMT.
647 * New commands to load and prove verification conditions generated by
648 the Boogie program verifier or derived systems (e.g. the Verifying C
649 Compiler (VCC) or Spec#). See src/HOL/Boogie.
651 * New counterexample generator tool 'nitpick' based on the Kodkod
652 relational model finder. See src/HOL/Tools/Nitpick and
653 src/HOL/Nitpick_Examples.
655 * New commands 'code_pred' and 'values' to invoke the predicate
656 compiler and to enumerate values of inductive predicates.
658 * A tabled implementation of the reflexive transitive closure.
660 * New implementation of quickcheck uses generic code generator;
661 default generators are provided for all suitable HOL types, records
662 and datatypes. Old quickcheck can be re-activated importing theory
663 Library/SML_Quickcheck.
665 * New testing tool Mirabelle for automated proof tools. Applies
666 several tools and tactics like sledgehammer, metis, or quickcheck, to
667 every proof step in a theory. To be used in batch mode via the
670 * New proof method "sos" (sum of squares) for nonlinear real
671 arithmetic (originally due to John Harison). It requires theory
672 Library/Sum_Of_Squares. It is not a complete decision procedure but
673 works well in practice on quantifier-free real arithmetic with +, -,
674 *, ^, =, <= and <, i.e. boolean combinations of equalities and
675 inequalities between polynomials. It makes use of external
676 semidefinite programming solvers. Method "sos" generates a
677 certificate that can be pasted into the proof thus avoiding the need
678 to call an external tool every time the proof is checked. See
679 src/HOL/Library/Sum_Of_Squares.
681 * New method "linarith" invokes existing linear arithmetic decision
684 * New command 'atp_minimal' reduces result produced by Sledgehammer.
686 * New Sledgehammer option "Full Types" in Proof General settings menu.
687 Causes full type information to be output to the ATPs. This slows
688 ATPs down considerably but eliminates a source of unsound "proofs"
691 * New method "metisFT": A version of metis that uses full type
692 information in order to avoid failures of proof reconstruction.
694 * New evaluator "approximate" approximates an real valued term using
695 the same method as the approximation method.
697 * Method "approximate" now supports arithmetic expressions as
698 boundaries of intervals and implements interval splitting and Taylor
701 * ML antiquotation @{code_datatype} inserts definition of a datatype
702 generated by the code generator; e.g. see src/HOL/Predicate.thy.
704 * New theory SupInf of the supremum and infimum operators for sets of
707 * New theory Probability, which contains a development of measure
708 theory, eventually leading to Lebesgue integration and probability.
710 * Extended Multivariate Analysis to include derivation and Brouwer's
713 * Reorganization of number theory, INCOMPATIBILITY:
714 - new number theory development for nat and int, in theories Divides
715 and GCD as well as in new session Number_Theory
716 - some constants and facts now suffixed with _nat and _int
718 - former session NumberTheory now named Old_Number_Theory, including
719 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
720 - moved theory Pocklington from src/HOL/Library to
721 src/HOL/Old_Number_Theory
723 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
724 lcm of finite and infinite sets. It is shown that they form a complete
727 * Class semiring_div requires superclass no_zero_divisors and proof of
728 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
729 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
730 generalized to class semiring_div, subsuming former theorems
731 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
732 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
735 * Refinements to lattice classes and sets:
736 - less default intro/elim rules in locale variant, more default
737 intro/elim rules in class variant: more uniformity
738 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
740 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
742 - renamed ACI to inf_sup_aci
743 - new class "boolean_algebra"
744 - class "complete_lattice" moved to separate theory
745 "Complete_Lattice"; corresponding constants (and abbreviations)
746 renamed and with authentic syntax:
747 Set.Inf ~> Complete_Lattice.Inf
748 Set.Sup ~> Complete_Lattice.Sup
749 Set.INFI ~> Complete_Lattice.INFI
750 Set.SUPR ~> Complete_Lattice.SUPR
751 Set.Inter ~> Complete_Lattice.Inter
752 Set.Union ~> Complete_Lattice.Union
753 Set.INTER ~> Complete_Lattice.INTER
754 Set.UNION ~> Complete_Lattice.UNION
755 - authentic syntax for
758 - mere abbreviations:
761 Set.inter (for inf, formerly Set.Int)
762 Set.union (for sup, formerly Set.Un)
763 Complete_Lattice.Inter (for Inf)
764 Complete_Lattice.Union (for Sup)
765 Complete_Lattice.INTER (for INFI)
766 Complete_Lattice.UNION (for SUPR)
767 - object-logic definitions as far as appropriate
769 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
770 Un_subset_iff are explicitly deleted as default simp rules; then also
771 their lattice counterparts le_inf_iff and le_sup_iff have to be
772 deleted to achieve the desired effect.
774 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
775 rules by default any longer; the same applies to min_max.inf_absorb1
776 etc. INCOMPATIBILITY.
778 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
779 pred_set_conv by default. INCOMPATIBILITY.
781 * Power operations on relations and functions are now one dedicated
782 constant "compow" with infix syntax "^^". Power operation on
783 multiplicative monoids retains syntax "^" and is now defined generic
784 in class power. INCOMPATIBILITY.
786 * Relation composition "R O S" now has a more standard argument order:
787 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
788 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
789 break, since the O_assoc rule was not rewritten like this. Fix using
790 O_assoc[symmetric]. The same applies to the curried version "R OO S".
792 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
793 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
796 * Most rules produced by inductive and datatype package have mandatory
797 prefixes. INCOMPATIBILITY.
799 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
800 the attribute of the same name. Each of the theorems in the list
801 DERIV_intros assumes composition with an additional function and
802 matches a variable to the derivative, which has to be solved by the
803 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
804 of most elementary terms. Former Maclauren.DERIV_tac and
805 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
808 * Code generator attributes follow the usual underscore convention:
809 code_unfold replaces code unfold
810 code_post replaces code post
815 sizechange -> size_change
816 induct_scheme -> induction_schema
819 * Discontinued abbreviation "arbitrary" of constant "undefined".
820 INCOMPATIBILITY, use "undefined" directly.
823 Suc_eq_add_numeral_1 -> Suc_eq_plus1
824 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
825 Suc_plus1 -> Suc_eq_plus1
826 *anti_sym -> *antisym*
827 vector_less_eq_def -> vector_le_def
830 * Added theorem List.map_map as [simp]. Removed List.map_compose.
833 * Removed predicate "M hassize n" (<--> card M = n & finite M).
839 * Theory Representable defines a class "rep" of domains that are
840 representable (via an ep-pair) in the universal domain type "udom".
841 Instances are provided for all type constructors defined in HOLCF.
843 * The 'new_domain' command is a purely definitional version of the
844 domain package, for representable domains. Syntax is identical to the
845 old domain package. The 'new_domain' package also supports indirect
846 recursion using previously-defined type constructors. See
847 src/HOLCF/ex/New_Domain.thy for examples.
849 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
850 on the left-hand side of an equation, and then performs
851 simplification. Rewriting is done using rules declared with the
852 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
853 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
855 * The pattern-match compiler in 'fixrec' can now handle constructors
856 with HOL function types. Pattern-match combinators for the Pair
857 constructor are pre-configured.
859 * The 'fixrec' package now produces better fixed-point induction rules
860 for mutually-recursive definitions: Induction rules have conclusions
861 of the form "P foo bar" instead of "P <foo, bar>".
863 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
864 been renamed to "below". The name "below" now replaces "less" in many
865 theorem names. (Legacy theorem names using "less" are still supported
868 * The 'fixrec' package now supports "bottom patterns". Bottom
869 patterns can be used to generate strictness rules, or to make
870 functions more strict (much like the bang-patterns supported by the
871 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
877 * Support for Poly/ML 5.3.0, with improved reporting of compiler
878 errors and run-time exceptions, including detailed source positions.
880 * Structure Name_Space (formerly NameSpace) now manages uniquely
881 identified entries, with some additional information such as source
882 position, logical grouping etc.
884 * Theory and context data is now introduced by the simplified and
885 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
886 to be pure, but the old TheoryDataFun for mutable data (with explicit
887 copy operation) is still available for some time.
889 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
890 provides a high-level programming interface to synchronized state
891 variables with atomic update. This works via pure function
892 application within a critical section -- its runtime should be as
893 short as possible; beware of deadlocks if critical code is nested,
894 either directly or indirectly via other synchronized variables!
896 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
897 wraps raw ML references, explicitly indicating their non-thread-safe
898 behaviour. The Isar toplevel keeps this structure open, to
899 accommodate Proof General as well as quick and dirty interactive
900 experiments with references.
902 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
903 parallel tactical reasoning.
905 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
906 are similar to SUBPROOF, but are slightly more flexible: only the
907 specified parts of the subgoal are imported into the context, and the
908 body tactic may introduce new subgoals and schematic variables.
910 * Old tactical METAHYPS, which does not observe the proof context, has
911 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
912 or Subgoal.FOCUS etc.
914 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
915 functors have their own ML name space there is no point to mark them
916 separately.) Minor INCOMPATIBILITY.
918 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
920 * Renamed several structures FooBar to Foo_Bar. Occasional,
923 * Operations of structure Skip_Proof no longer require quick_and_dirty
924 mode, which avoids critical setmp.
926 * Eliminated old Attrib.add_attributes, Method.add_methods and related
927 combinators for "args". INCOMPATIBILITY, need to use simplified
928 Attrib/Method.setup introduced in Isabelle2009.
930 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
931 back on global_simpset_of, global_claset_of, global_clasimpset_of as
932 last resort. INCOMPATIBILITY.
934 * Display.pretty_thm now requires a proper context (cf. former
935 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
936 or even Display.pretty_thm_without_context as last resort.
939 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
940 Syntax.pretty_typ/term directly, preferably with proper context
941 instead of global theory.
946 * Further fine tuning of parallel proof checking, scales up to 8 cores
947 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
950 * Support for additional "Isabelle components" via etc/components, see
951 also the system manual.
953 * The isabelle makeall tool now operates on all components with
954 IsaMakefile, not just hardwired "logics".
956 * Removed "compress" option from isabelle-process and isabelle usedir;
957 this is always enabled.
959 * Discontinued support for Poly/ML 4.x versions.
961 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
962 on a given logic image. This requires the lighttpd webserver and is
963 currently supported on Linux only.
967 New in Isabelle2009 (April 2009)
968 --------------------------------
972 * Simplified main Isabelle executables, with less surprises on
973 case-insensitive file-systems (such as Mac OS).
975 - The main Isabelle tool wrapper is now called "isabelle" instead of
978 - The former "isabelle" alias for "isabelle-process" has been
979 removed (should rarely occur to regular users).
981 - The former "isabelle-interface" and its alias "Isabelle" have been
982 removed (interfaces are now regular Isabelle tools).
984 Within scripts and make files, the Isabelle environment variables
985 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
986 respectively. (The latter are still available as legacy feature.)
988 The old isabelle-interface wrapper could react in confusing ways if
989 the interface was uninstalled or changed otherwise. Individual
990 interface tool configuration is now more explicit, see also the
991 Isabelle system manual. In particular, Proof General is now available
992 via "isabelle emacs".
994 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
995 purge installed copies of Isabelle executables and re-run "isabelle
996 install -p ...", or use symlinks.
998 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
999 old ~/isabelle, which was slightly non-standard and apt to cause
1000 surprises on case-insensitive file-systems (such as Mac OS).
1002 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1003 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1004 care is required when using older releases of Isabelle. Note that
1005 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1006 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1008 * Proofs of fully specified statements are run in parallel on
1009 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1010 a regular 4-core machine, if the initial heap space is made reasonably
1011 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1013 * The main reference manuals ("isar-ref", "implementation", and
1014 "system") have been updated and extended. Formally checked references
1015 as hyperlinks are now available uniformly.
1020 * Complete re-implementation of locales. INCOMPATIBILITY in several
1021 respects. The most important changes are listed below. See the
1022 Tutorial on Locales ("locales" manual) for details.
1024 - In locale expressions, instantiation replaces renaming. Parameters
1025 must be declared in a for clause. To aid compatibility with previous
1026 parameter inheritance, in locale declarations, parameters that are not
1027 'touched' (instantiation position "_" or omitted) are implicitly added
1028 with their syntax at the beginning of the for clause.
1030 - Syntax from abbreviations and definitions in locales is available in
1031 locale expressions and context elements. The latter is particularly
1032 useful in locale declarations.
1034 - More flexible mechanisms to qualify names generated by locale
1035 expressions. Qualifiers (prefixes) may be specified in locale
1036 expressions, and can be marked as mandatory (syntax: "name!:") or
1037 optional (syntax "name?:"). The default depends for plain "name:"
1038 depends on the situation where a locale expression is used: in
1039 commands 'locale' and 'sublocale' prefixes are optional, in
1040 'interpretation' and 'interpret' prefixes are mandatory. The old
1041 implicit qualifiers derived from the parameter names of a locale are
1042 no longer generated.
1044 - Command "sublocale l < e" replaces "interpretation l < e". The
1045 instantiation clause in "interpretation" and "interpret" (square
1046 brackets) is no longer available. Use locale expressions.
1048 - When converting proof scripts, mandatory qualifiers in
1049 'interpretation' and 'interpret' should be retained by default, even
1050 if this is an INCOMPATIBILITY compared to former behavior. In the
1051 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1052 in locale expressions range over a single locale instance only.
1054 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1055 In existing theorem specifications replace the includes element by the
1056 respective context elements of the included locale, omitting those
1057 that are already present in the theorem specification. Multiple
1058 assume elements of a locale should be replaced by a single one
1059 involving the locale predicate. In the proof body, declarations (most
1060 notably theorems) may be regained by interpreting the respective
1061 locales in the proof context as required (command "interpret").
1063 If using "includes" in replacement of a target solely because the
1064 parameter types in the theorem are not as general as in the target,
1065 consider declaring a new locale with additional type constraints on
1066 the parameters (context element "constrains").
1068 - Discontinued "locale (open)". INCOMPATIBILITY.
1070 - Locale interpretation commands no longer attempt to simplify goal.
1071 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1072 methods intro_locales and unfold_locales to clarify.
1074 - Locale interpretation commands no longer accept interpretation
1075 attributes. INCOMPATIBILITY.
1077 * Class declaration: so-called "base sort" must not be given in import
1078 list any longer, but is inferred from the specification. Particularly
1085 class foo = type + ...
1087 * Class target: global versions of theorems stemming do not carry a
1088 parameter prefix any longer. INCOMPATIBILITY.
1090 * Class 'instance' command no longer accepts attached definitions.
1091 INCOMPATIBILITY, use proper 'instantiation' target instead.
1093 * Recovered hiding of consts, which was accidentally broken in
1094 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1095 makes c inaccessible; consider using ``hide (open) const c'' instead.
1097 * Slightly more coherent Pure syntax, with updated documentation in
1098 isar-ref manual. Removed locales meta_term_syntax and
1099 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1100 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1101 directly in regular applications.
1103 * There is a new syntactic category "float_const" for signed decimal
1104 fractions (e.g. 123.45 or -123.45).
1106 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1107 interface with 'setup' command instead.
1109 * Command 'local_setup' is similar to 'setup', but operates on a local
1112 * The 'axiomatization' command now only works within a global theory
1113 context. INCOMPATIBILITY.
1115 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1116 hypotheses. Sorts required in the course of reasoning need to be
1117 covered by the constraints in the initial statement, completed by the
1118 type instance information of the background theory. Non-trivial sort
1119 hypotheses, which rarely occur in practice, may be specified via
1120 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1122 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1124 The result contains an implicit sort hypotheses as before --
1125 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1128 * Generalized Isar history, with support for linear undo, direct state
1131 * Changed defaults for unify configuration options:
1133 unify_trace_bound = 50 (formerly 25)
1134 unify_search_bound = 60 (formerly 30)
1136 * Different bookkeeping for code equations (INCOMPATIBILITY):
1138 a) On theory merge, the last set of code equations for a particular
1139 constant is taken (in accordance with the policy applied by other
1140 parts of the code generator framework).
1142 b) Code equations stemming from explicit declarations (e.g. code
1143 attribute) gain priority over default code equations stemming
1144 from definition, primrec, fun etc.
1146 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1148 * Unified theorem tables for both code generators. Thus [code
1149 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1151 * Command 'find_consts' searches for constants based on type and name
1154 find_consts "_ => bool"
1156 By default, matching is against subtypes, but it may be restricted to
1157 the whole type. Searching by name is possible. Multiple queries are
1158 conjunctive and queries may be negated by prefixing them with a
1161 find_consts strict: "_ => bool" name: "Int" -"int => int"
1163 * New 'find_theorems' criterion "solves" matches theorems that
1164 directly solve the current goal (modulo higher-order unification).
1166 * Auto solve feature for main theorem statements: whenever a new goal
1167 is stated, "find_theorems solves" is called; any theorems that could
1168 solve the lemma directly are listed as part of the goal state.
1169 Cf. associated options in Proof General Isabelle settings menu,
1170 enabled by default, with reasonable timeout for pathological cases of
1171 higher-order unification.
1174 *** Document preparation ***
1176 * Antiquotation @{lemma} now imitates a regular terminal proof,
1177 demanding keyword 'by' and supporting the full method expression
1178 syntax just like the Isar command 'by'.
1183 * Integrated main parts of former image HOL-Complex with HOL. Entry
1184 points Main and Complex_Main remain as before.
1186 * Logic image HOL-Plain provides a minimal HOL with the most important
1187 tools available (inductive, datatype, primrec, ...). This facilitates
1188 experimentation and tool development. Note that user applications
1189 (and library theories) should never refer to anything below theory
1192 * Logic image HOL-Main stops at theory Main, and thus facilitates
1193 experimentation due to shorter build times.
1195 * Logic image HOL-NSA contains theories of nonstandard analysis which
1196 were previously part of former HOL-Complex. Entry point Hyperreal
1197 remains valid, but theories formerly using Complex_Main should now use
1198 new entry point Hypercomplex.
1200 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1201 Posix processes. Avoids potentially expensive forking of the ML
1202 process. New thread-based implementation also works on non-Unix
1203 platforms (Cygwin). Provers are no longer hardwired, but defined
1204 within the theory via plain ML wrapper functions. Basic Sledgehammer
1205 commands are covered in the isar-ref manual.
1207 * Wrapper scripts for remote SystemOnTPTP service allows to use
1208 sledgehammer without local ATP installation (Vampire etc.). Other
1209 provers may be included via suitable ML wrappers, see also
1210 src/HOL/ATP_Linkup.thy.
1212 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1215 * The metis method no longer fails because the theorem is too trivial
1216 (contains the empty clause).
1218 * The metis method now fails in the usual manner, rather than raising
1219 an exception, if it determines that it cannot prove the theorem.
1221 * Method "coherent" implements a prover for coherent logic (see also
1222 src/Tools/coherent.ML).
1224 * Constants "undefined" and "default" replace "arbitrary". Usually
1225 "undefined" is the right choice to replace "arbitrary", though
1226 logically there is no difference. INCOMPATIBILITY.
1228 * Command "value" now integrates different evaluation mechanisms. The
1229 result of the first successful evaluation mechanism is printed. In
1230 square brackets a particular named evaluation mechanisms may be
1231 specified (currently, [SML], [code] or [nbe]). See further
1232 src/HOL/ex/Eval_Examples.thy.
1234 * Normalization by evaluation now allows non-leftlinear equations.
1235 Declare with attribute [code nbe].
1237 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1238 as the structured Isar versions "cases" and "induct", cf. the
1239 corresponding "cases" and "induct" attributes. Mutual induction rules
1240 are now presented as a list of individual projections
1241 (e.g. foo_bar.inducts for types foo and bar); the old format with
1242 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1243 rare situations a different rule is selected --- notably nested tuple
1244 elimination instead of former prod.exhaust: use explicit (case_tac t
1245 rule: prod.exhaust) here.
1247 * Attributes "cases", "induct", "coinduct" support "del" option.
1249 * Removed fact "case_split_thm", which duplicates "case_split".
1251 * The option datatype has been moved to a new theory Option. Renamed
1252 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1254 * New predicate "strict_mono" classifies strict functions on partial
1255 orders. With strict functions on linear orders, reasoning about
1256 (in)equalities is facilitated by theorems "strict_mono_eq",
1257 "strict_mono_less_eq" and "strict_mono_less".
1259 * Some set operations are now proper qualified constants with
1260 authentic syntax. INCOMPATIBILITY:
1271 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1274 * Auxiliary class "itself" has disappeared -- classes without any
1275 parameter are treated as expected by the 'class' command.
1277 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1279 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1280 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1282 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1283 method "approximation". It proves formulas on real values by using
1284 interval arithmetic. In the formulas are also the transcendental
1285 functions sin, cos, tan, atan, ln, exp and the constant pi are
1286 allowed. For examples see
1287 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1289 * Theory "Reflection" now resides in HOL/Library.
1291 * Entry point to Word library now simply named "Word".
1294 * Made source layout more coherent with logical distribution
1297 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1298 src/HOL/Library/Code_Message.thy ~> src/HOL/
1299 src/HOL/Library/GCD.thy ~> src/HOL/
1300 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1301 src/HOL/Library/Parity.thy ~> src/HOL/
1302 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1303 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1304 src/HOL/Real/Lubs.thy ~> src/HOL/
1305 src/HOL/Real/PReal.thy ~> src/HOL/
1306 src/HOL/Real/Rational.thy ~> src/HOL/
1307 src/HOL/Real/RComplete.thy ~> src/HOL/
1308 src/HOL/Real/RealDef.thy ~> src/HOL/
1309 src/HOL/Real/RealPow.thy ~> src/HOL/
1310 src/HOL/Real/Real.thy ~> src/HOL/
1311 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1312 src/HOL/Complex/Complex.thy ~> src/HOL/
1313 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1314 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1315 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1316 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1317 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1318 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1319 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1320 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1321 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1322 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1323 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1324 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1325 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1326 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1327 src/HOL/Real/Float ~> src/HOL/Library/
1328 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1329 src/HOL/Real/RealVector.thy ~> src/HOL/
1331 src/HOL/arith_data.ML ~> src/HOL/Tools
1332 src/HOL/hologic.ML ~> src/HOL/Tools
1333 src/HOL/simpdata.ML ~> src/HOL/Tools
1334 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1335 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1336 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1337 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1338 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1339 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1340 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1342 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1343 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1344 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1345 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1346 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1347 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1349 * If methods "eval" and "evaluation" encounter a structured proof
1350 state with !!/==>, only the conclusion is evaluated to True (if
1351 possible), avoiding strange error messages.
1353 * Method "sizechange" automates termination proofs using (a
1354 modification of) the size-change principle. Requires SAT solver. See
1355 src/HOL/ex/Termination.thy for examples.
1357 * Simplifier: simproc for let expressions now unfolds if bound
1358 variable occurs at most once in let expression body. INCOMPATIBILITY.
1360 * Method "arith": Linear arithmetic now ignores all inequalities when
1361 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1363 * New attribute "arith" for facts that should always be used
1364 automatically by arithmetic. It is intended to be used locally in
1367 assumes [arith]: "x > 0"
1369 Global usage is discouraged because of possible performance impact.
1371 * New classes "top" and "bot" with corresponding operations "top" and
1372 "bot" in theory Orderings; instantiation of class "complete_lattice"
1373 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1375 * Changed definition lemma "less_fun_def" in order to provide an
1376 instance for preorders on functions; use lemma "less_le" instead.
1379 * Theory Orderings: class "wellorder" moved here, with explicit
1380 induction rule "less_induct" as assumption. For instantiation of
1381 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1384 * Theory Orderings: added class "preorder" as superclass of "order".
1385 INCOMPATIBILITY: Instantiation proofs for order, linorder
1386 etc. slightly changed. Some theorems named order_class.* now named
1389 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1392 * Theory Finite_Set: added a new fold combinator of type
1394 ('a => 'b => 'b) => 'b => 'a set => 'b
1396 Occasionally this is more convenient than the old fold combinator
1397 which is now defined in terms of the new one and renamed to
1400 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1401 and "ring_simps" have been replaced by "algebra_simps" (which can be
1402 extended with further lemmas!). At the moment both still exist but
1403 the former will disappear at some point.
1405 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1406 class recpower. Type-specific simp rules for various recpower types
1407 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1409 rat_power_0 -> power_0
1410 rat_power_Suc -> power_Suc
1411 realpow_0 -> power_0
1412 realpow_Suc -> power_Suc
1413 complexpow_0 -> power_0
1414 complexpow_Suc -> power_Suc
1415 power_poly_0 -> power_0
1416 power_poly_Suc -> power_Suc
1418 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1419 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1420 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1421 of lemmas from Divides has been generalized from nat to class
1422 semiring_div. INCOMPATIBILITY. This involves the following theorem
1423 renames resulting from duplicate elimination:
1425 dvd_def_mod ~> dvd_eq_mod_eq_0
1426 zero_dvd_iff ~> dvd_0_left_iff
1427 dvd_0 ~> dvd_0_right
1428 DIVISION_BY_ZERO_DIV ~> div_by_0
1429 DIVISION_BY_ZERO_MOD ~> mod_by_0
1430 mult_div ~> div_mult_self2_is_id
1431 mult_mod ~> mod_mult_self2_is_0
1433 * Theory IntDiv: removed many lemmas that are instances of class-based
1434 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1435 rename old lemmas as follows:
1437 dvd_diff -> nat_dvd_diff
1438 dvd_zminus_iff -> dvd_minus_iff
1439 mod_add1_eq -> mod_add_eq
1440 mod_mult1_eq -> mod_mult_right_eq
1441 mod_mult1_eq' -> mod_mult_left_eq
1442 mod_mult_distrib_mod -> mod_mult_eq
1443 nat_mod_add_left_eq -> mod_add_left_eq
1444 nat_mod_add_right_eq -> mod_add_right_eq
1445 nat_mod_div_trivial -> mod_div_trivial
1446 nat_mod_mod_trivial -> mod_mod_trivial
1447 zdiv_zadd_self1 -> div_add_self1
1448 zdiv_zadd_self2 -> div_add_self2
1449 zdiv_zmult_self1 -> div_mult_self2_is_id
1450 zdiv_zmult_self2 -> div_mult_self1_is_id
1451 zdvd_triv_left -> dvd_triv_left
1452 zdvd_triv_right -> dvd_triv_right
1453 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1454 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1455 zmod_zadd_left_eq -> mod_add_left_eq
1456 zmod_zadd_right_eq -> mod_add_right_eq
1457 zmod_zadd_self1 -> mod_add_self1
1458 zmod_zadd_self2 -> mod_add_self2
1459 zmod_zadd1_eq -> mod_add_eq
1460 zmod_zdiff1_eq -> mod_diff_eq
1461 zmod_zdvd_zmod -> mod_mod_cancel
1462 zmod_zmod_cancel -> mod_mod_cancel
1463 zmod_zmult_self1 -> mod_mult_self2_is_0
1464 zmod_zmult_self2 -> mod_mult_self1_is_0
1467 zdvd_abs1 -> abs_dvd_iff
1468 zdvd_abs2 -> dvd_abs_iff
1469 zdvd_refl -> dvd_refl
1470 zdvd_trans -> dvd_trans
1471 zdvd_zadd -> dvd_add
1472 zdvd_zdiff -> dvd_diff
1473 zdvd_zminus_iff -> dvd_minus_iff
1474 zdvd_zminus2_iff -> minus_dvd_iff
1475 zdvd_zmultD -> dvd_mult_right
1476 zdvd_zmultD2 -> dvd_mult_left
1477 zdvd_zmult_mono -> mult_dvd_mono
1478 zdvd_0_right -> dvd_0_right
1479 zdvd_0_left -> dvd_0_left_iff
1480 zdvd_1_left -> one_dvd
1481 zminus_dvd_iff -> minus_dvd_iff
1483 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1485 * The real numbers offer decimal input syntax: 12.34 is translated
1486 into 1234/10^2. This translation is not reversed upon output.
1488 * Theory Library/Polynomial defines an abstract type 'a poly of
1489 univariate polynomials with coefficients of type 'a. In addition to
1490 the standard ring operations, it also supports div and mod. Code
1491 generation is also supported, using list-style constructors.
1493 * Theory Library/Inner_Product defines a class of real_inner for real
1494 inner product spaces, with an overloaded operation inner :: 'a => 'a
1495 => real. Class real_inner is a subclass of real_normed_vector from
1498 * Theory Library/Product_Vector provides instances for the product
1499 type 'a * 'b of several classes from RealVector and Inner_Product.
1500 Definitions of addition, subtraction, scalar multiplication, norms,
1501 and inner products are included.
1503 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1504 addition to the field operations, numerals and case syntax are also
1507 * Theory Library/Diagonalize provides constructive version of Cantor's
1508 first diagonalization argument.
1510 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1511 zlcm (for int); carried together from various gcd/lcm developements in
1512 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1513 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1514 may recover tupled syntax as follows:
1516 hide (open) const gcd
1517 abbreviation gcd where
1518 "gcd == (%(a, b). GCD.gcd a b)"
1520 GCD.gcd ("gcd '(_, _')")
1522 The same works for lcm, zgcd, zlcm.
1524 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1525 instantiations for algebraic structures. Removed some duplicate
1526 theorems. Changes in simp rules. INCOMPATIBILITY.
1528 * ML antiquotation @{code} takes a constant as argument and generates
1529 corresponding code in background and inserts name of the corresponding
1530 resulting ML value/function/datatype constructor binding in place.
1531 All occurrences of @{code} with a single ML block are generated
1532 simultaneously. Provides a generic and safe interface for
1533 instrumentalizing code generation. See
1534 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1535 In future you ought to refrain from ad-hoc compiling generated SML
1536 code on the ML toplevel. Note that (for technical reasons) @{code}
1537 cannot refer to constants for which user-defined serializations are
1538 set. Refer to the corresponding ML counterpart directly in that
1541 * Command 'rep_datatype': instead of theorem names the command now
1542 takes a list of terms denoting the constructors of the type to be
1543 represented as datatype. The characteristic theorems have to be
1544 proven. INCOMPATIBILITY. Also observe that the following theorems
1545 have disappeared in favour of existing ones:
1547 unit_induct ~> unit.induct
1548 prod_induct ~> prod.induct
1549 sum_induct ~> sum.induct
1550 Suc_Suc_eq ~> nat.inject
1551 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1556 * New locales for orders and lattices where the equivalence relation
1557 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1558 locales use a record structure with field eq for the equivalence.
1560 * New theory of factorial domains.
1562 * Units_l_inv and Units_r_inv are now simp rules by default.
1563 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1564 and/or r_inv will now also require deletion of these lemmas.
1566 * Renamed the following theorems, INCOMPATIBILITY:
1568 UpperD ~> Upper_memD
1569 LowerD ~> Lower_memD
1570 least_carrier ~> least_closed
1571 greatest_carrier ~> greatest_closed
1572 greatest_Lower_above ~> greatest_Lower_below
1573 one_zero ~> carrier_one_zero
1574 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1579 * Nominal datatypes can now contain type-variables.
1581 * Commands 'nominal_inductive' and 'equivariance' work with local
1584 * Nominal primrec can now works with local theory targets and its
1585 specification syntax now conforms to the general format as seen in
1588 * Method "perm_simp" honours the standard simplifier attributes
1589 (no_asm), (no_asm_use) etc.
1591 * The new predicate #* is defined like freshness, except that on the
1592 left hand side can be a set or list of atoms.
1594 * Experimental command 'nominal_inductive2' derives strong induction
1595 principles for inductive definitions. In contrast to
1596 'nominal_inductive', which can only deal with a fixed number of
1597 binders, it can deal with arbitrary expressions standing for sets of
1598 atoms to be avoided. The only inductive definition we have at the
1599 moment that needs this generalisation is the typing rule for Lets in
1602 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1603 -----------------------------------------------------------------
1604 Gamma |- Let x be t1 in t2 : T2
1606 In this rule one wants to avoid all the binders that are introduced by
1607 "close Gamma T1". We are looking for other examples where this
1608 feature might be useful. Please let us know.
1613 * Reimplemented the simplification procedure for proving continuity
1614 subgoals. The new simproc is extensible; users can declare additional
1615 continuity introduction rules with the attribute [cont2cont].
1617 * The continuity simproc now uses a different introduction rule for
1618 solving continuity subgoals on terms with lambda abstractions. In
1619 some rare cases the new simproc may fail to solve subgoals that the
1620 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1621 Potential INCOMPATIBILITY.
1623 * Command 'fixrec': specification syntax now conforms to the general
1624 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1625 examples. INCOMPATIBILITY.
1630 * Proof of Zorn's Lemma for partial orders.
1635 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1636 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1637 depends on multithreading, so timouts will not work before Poly/ML
1640 * High-level support for concurrent ML programming, see
1641 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1642 particularly convenient to organize independent functional
1643 computations. The concept of "synchronized variables" provides a
1644 higher-order interface for components with shared state, avoiding the
1645 delicate details of mutexes and condition variables. (Requires
1646 Poly/ML 5.2.1 or later.)
1648 * ML bindings produced via Isar commands are stored within the Isar
1649 context (theory or proof). Consequently, commands like 'use' and 'ML'
1650 become thread-safe and work with undo as expected (concerning
1651 top-level bindings, not side-effects on global references).
1652 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1653 compiler at runtime; really global bindings need to be given outside a
1654 theory. (Requires Poly/ML 5.2 or later.)
1656 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1657 context. Top-level ML bindings are stored within the proof context in
1658 a purely sequential fashion, disregarding the nested proof structure.
1659 ML bindings introduced by 'ML_prf' are discarded at the end of the
1660 proof. (Requires Poly/ML 5.2 or later.)
1662 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1663 and Method.setup, as well as Isar commands 'attribute_setup' and
1664 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1665 existing code accordingly, or use plain 'setup' together with old
1668 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1669 to 'a -> thm, while results are always tagged with an authentic oracle
1670 name. The Isar command 'oracle' is now polymorphic, no argument type
1671 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1672 accordingly. Note that extra performance may be gained by producing
1673 the cterm carefully, avoiding slow Thm.cterm_of.
1675 * Simplified interface for defining document antiquotations via
1676 ThyOutput.antiquotation, ThyOutput.output, and optionally
1677 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1678 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1681 * More systematic treatment of long names, abstract name bindings, and
1682 name space operations. Basic operations on qualified names have been
1683 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1684 Long_Name.append. Old type bstring has been mostly replaced by
1685 abstract type binding (see structure Binding), which supports precise
1686 qualification by packages and local theory targets, as well as proper
1687 tracking of source positions. INCOMPATIBILITY, need to wrap old
1688 bstring values into Binding.name, or better pass through abstract
1689 bindings everywhere. See further src/Pure/General/long_name.ML,
1690 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1692 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1693 LocalTheory.note etc.) now refer to the *full* internal name, not the
1694 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1696 * Disposed old type and term read functions (Sign.read_def_typ,
1697 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1698 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1699 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1700 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1701 resort for legacy applications.
1703 * Disposed old declarations, tactics, tactic combinators that refer to
1704 the simpset or claset of an implicit theory (such as Addsimps,
1705 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1706 embedded ML text, or local_simpset_of with a proper context passed as
1707 explicit runtime argument.
1709 * Rules and tactics that read instantiations (read_instantiate,
1710 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1711 context, which is required for parsing and type-checking. Moreover,
1712 the variables are specified as plain indexnames, not string encodings
1713 thereof. INCOMPATIBILITY.
1715 * Generic Toplevel.add_hook interface allows to analyze the result of
1716 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1717 for theorem dependency output of transactions resulting in a new
1720 * ML antiquotations: block-structured compilation context indicated by
1721 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1723 @{binding name} - basic name binding
1724 @{let ?pat = term} - term abbreviation (HO matching)
1725 @{note name = fact} - fact abbreviation
1726 @{thm fact} - singleton fact (with attributes)
1727 @{thms fact} - general fact (with attributes)
1728 @{lemma prop by method} - singleton goal
1729 @{lemma prop by meth1 meth2} - singleton goal
1730 @{lemma prop1 ... propN by method} - general goal
1731 @{lemma prop1 ... propN by meth1 meth2} - general goal
1732 @{lemma (open) ...} - open derivation
1737 * The Isabelle "emacs" tool provides a specific interface to invoke
1738 Proof General / Emacs, with more explicit failure if that is not
1739 installed (the old isabelle-interface script silently falls back on
1740 isabelle-process). The PROOFGENERAL_HOME setting determines the
1741 installation location of the Proof General distribution.
1743 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1744 the Isabelle process into a JVM/Scala application. See
1745 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1746 process wrapper has been discontinued.)
1748 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1750 * Various status messages (with exact source position information) are
1751 emitted, if proper markup print mode is enabled. This allows
1752 user-interface components to provide detailed feedback on internal
1757 New in Isabelle2008 (June 2008)
1758 -------------------------------
1762 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1763 and updated, with formally checked references as hyperlinks.
1765 * Theory loader: use_thy (and similar operations) no longer set the
1766 implicit ML context, which was occasionally hard to predict and in
1767 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1768 provides a proper context already.
1770 * Theory loader: old-style ML proof scripts being *attached* to a thy
1771 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1772 'use' within a theory file will do the job.
1774 * Name space merge now observes canonical order, i.e. the second space
1775 is inserted into the first one, while existing entries in the first
1776 space take precedence. INCOMPATIBILITY in rare situations, may try to
1777 swap theory imports.
1779 * Syntax: symbol \<chi> is now considered a letter. Potential
1780 INCOMPATIBILITY in identifier syntax etc.
1782 * Outer syntax: string tokens no longer admit escaped white space,
1783 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1784 white space without escapes.
1786 * Outer syntax: string tokens may contain arbitrary character codes
1787 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1793 * Context-dependent token translations. Default setup reverts locally
1794 fixed variables, and adds hilite markup for undeclared frees.
1796 * Unused theorems can be found using the new command 'unused_thms'.
1797 There are three ways of invoking it:
1800 Only finds unused theorems in the current theory.
1802 (2) unused_thms thy_1 ... thy_n -
1803 Finds unused theorems in the current theory and all of its ancestors,
1804 excluding the theories thy_1 ... thy_n and all of their ancestors.
1806 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1807 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1808 their ancestors, excluding the theories thy_1 ... thy_n and all of
1811 In order to increase the readability of the list produced by
1812 unused_thms, theorems that have been created by a particular instance
1813 of a theory command such as 'inductive' or 'function' are considered
1814 to belong to the same "group", meaning that if at least one theorem in
1815 this group is used, the other theorems in the same group are no longer
1816 reported as unused. Moreover, if all theorems in the group are
1817 unused, only one theorem in the group is displayed.
1819 Note that proof objects have to be switched on in order for
1820 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1821 usually the case when using Proof General with the default settings).
1823 * Authentic naming of facts disallows ad-hoc overwriting of previous
1824 theorems within the same name space. INCOMPATIBILITY, need to remove
1825 duplicate fact bindings, or even accidental fact duplications. Note
1826 that tools may maintain dynamically scoped facts systematically, using
1827 PureThy.add_thms_dynamic.
1829 * Command 'hide' now allows to hide from "fact" name space as well.
1831 * Eliminated destructive theorem database, simpset, claset, and
1832 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1833 update of theories within ML code.
1835 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1836 INCOMPATIBILITY, object-logics depending on former Pure require
1837 additional setup PureThy.old_appl_syntax_setup; object-logics
1838 depending on former CPure need to refer to Pure.
1840 * Commands 'use' and 'ML' are now purely functional, operating on
1841 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1842 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1845 * Command 'setup': discontinued implicit version with ML reference.
1847 * Instantiation target allows for simultaneous specification of class
1848 instance operations together with an instantiation proof.
1849 Type-checking phase allows to refer to class operations uniformly.
1850 See src/HOL/Complex/Complex.thy for an Isar example and
1851 src/HOL/Library/Eval.thy for an ML example.
1853 * Indexing of literal facts: be more serious about including only
1854 facts from the visible specification/proof context, but not the
1855 background context (locale etc.). Affects `prop` notation and method
1856 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1859 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1860 "(open)" option, which used to expose internal bound variables to the
1863 * Isar statements: removed obsolete case "rule_context".
1864 INCOMPATIBILITY, better use explicit fixes/assumes.
1866 * Locale proofs: default proof step now includes 'unfold_locales';
1867 hence 'proof' without argument may be used to unfold locale
1871 *** Document preparation ***
1873 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1874 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1875 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1876 spot); renamed link color from "darkblue" to "linkcolor" (default
1877 value unchanged, can be redefined via \definecolor); no longer sets
1878 "a4paper" option (unnecessary or even intrusive).
1880 * Antiquotation @{lemma A method} proves proposition A by the given
1881 method (either a method name or a method name plus (optional) method
1882 arguments in parentheses) and prints A just like @{prop A}.
1887 * New primrec package. Specification syntax conforms in style to
1888 definition/function/.... No separate induction rule is provided. The
1889 "primrec" command distinguishes old-style and new-style specifications
1890 by syntax. The former primrec package is now named OldPrimrecPackage.
1891 When adjusting theories, beware: constants stemming from new-style
1892 primrec specifications have authentic syntax.
1894 * Metis prover is now an order of magnitude faster, and also works
1895 with multithreading.
1897 * Metis: the maximum number of clauses that can be produced from a
1898 theorem is now given by the attribute max_clauses. Theorems that
1899 exceed this number are ignored, with a warning printed.
1901 * Sledgehammer no longer produces structured proofs by default. To
1902 enable, declare [[sledgehammer_full = true]]. Attributes
1903 reconstruction_modulus, reconstruction_sorts renamed
1904 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1906 * Method "induct_scheme" derives user-specified induction rules
1907 from well-founded induction and completeness of patterns. This factors
1908 out some operations that are done internally by the function package
1909 and makes them available separately. See
1910 src/HOL/ex/Induction_Scheme.thy for examples.
1912 * More flexible generation of measure functions for termination
1913 proofs: Measure functions can be declared by proving a rule of the
1914 form "is_measure f" and giving it the [measure_function] attribute.
1915 The "is_measure" predicate is logically meaningless (always true), and
1916 just guides the heuristic. To find suitable measure functions, the
1917 termination prover sets up the goal "is_measure ?f" of the appropriate
1918 type and generates all solutions by prolog-style backwards proof using
1921 This setup also deals with rules like
1923 "is_measure f ==> is_measure (list_size f)"
1925 which accommodates nested datatypes that recurse through lists.
1926 Similar rules are predeclared for products and option types.
1928 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1932 - Definitions of overloaded constants on sets have to be replaced by
1933 definitions on => and bool.
1935 - Some definitions of overloaded operators on sets can now be proved
1936 using the definitions of the operators on => and bool. Therefore,
1937 the following theorems have been renamed:
1939 subset_def -> subset_eq
1940 psubset_def -> psubset_eq
1941 set_diff_def -> set_diff_eq
1942 Compl_def -> Compl_eq
1943 Sup_set_def -> Sup_set_eq
1944 Inf_set_def -> Inf_set_eq
1945 sup_set_def -> sup_set_eq
1946 inf_set_def -> inf_set_eq
1948 - Due to the incompleteness of the HO unification algorithm, some
1949 rules such as subst may require manual instantiation, if some of
1950 the unknowns in the rule is a set.
1952 - Higher order unification and forward proofs:
1955 have "P (S::'a set)" <...>
1956 then have "EX S. P S" ..
1958 no longer works (due to the incompleteness of the HO unification
1959 algorithm) and must be replaced by the pattern
1966 - Calculational reasoning with subst (or similar rules):
1969 have "P (S::'a set)" <...>
1970 also have "S = T" <...>
1971 finally have "P T" .
1973 no longer works (for similar reasons as the previous example) and
1974 must be replaced by something like
1976 have "P (S::'a set)" <...>
1977 moreover have "S = T" <...>
1978 ultimately have "P T" by simp
1980 - Tactics or packages written in ML code:
1981 Code performing pattern matching on types via
1983 Type ("set", [T]) => ...
1985 must be rewritten. Moreover, functions like strip_type or
1986 binder_types no longer return the right value when applied to a
1989 T1 => ... => Tn => U => bool
1993 T1 => ... => Tn => U set
1995 * Merged theories Wellfounded_Recursion, Accessible_Part and
1996 Wellfounded_Relations to theory Wellfounded.
1998 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2000 * Class finite no longer treats UNIV as class parameter. Use class
2001 enum from theory Library/Enum instead to achieve a similar effect.
2004 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2005 and "Cons". INCOMPATIBILITY.
2007 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2008 Potential INCOMPATIBILITY.
2010 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2011 injective_fst_snd removed, use split_eta and prod_eqI instead.
2012 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2014 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2015 the same name in theory Orderings:
2025 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2026 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2027 and different variable names.
2029 * Library/Option_ord.thy: Canonical order on option type.
2031 * Library/RBT.thy: Red-black trees, an efficient implementation of
2034 * Library/Countable.thy: Type class for countable types.
2036 * Theory Int: The representation of numerals has changed. The infix
2037 operator BIT and the bit datatype with constructors B0 and B1 have
2038 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2039 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2040 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2043 * Theory Nat: definition of <= and < on natural numbers no longer
2044 depend on well-founded relations. INCOMPATIBILITY. Definitions
2045 le_def and less_def have disappeared. Consider lemmas not_less
2046 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2048 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2049 (whose purpose mainly is for various fold_set functionals) have been
2050 abandoned in favor of the existing algebraic classes
2051 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2052 lower_semilattice (resp. upper_semilattice) and linorder.
2055 * Theory Transitive_Closure: induct and cases rules now declare proper
2056 case_names ("base" and "step"). INCOMPATIBILITY.
2058 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2059 lattices. The form set-specific version is available as
2060 Inductive.lfp_ordinal_induct_set.
2062 * Renamed theorems "power.simps" to "power_int.simps".
2065 * Class semiring_div provides basic abstract properties of semirings
2066 with division and modulo operations. Subsumes former class dvd_mod.
2068 * Merged theories IntDef, Numeral and IntArith into unified theory
2069 Int. INCOMPATIBILITY.
2071 * Theory Library/Code_Index: type "index" now represents natural
2072 numbers rather than integers. INCOMPATIBILITY.
2074 * New class "uminus" with operation "uminus" (split of from class
2075 "minus" which now only has operation "minus", binary).
2078 * Constants "card", "internal_split", "option_map" now with authentic
2079 syntax. INCOMPATIBILITY.
2081 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2082 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2083 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2084 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2085 Sup_set_def, le_def, less_def, option_map_def now with object
2086 equality. INCOMPATIBILITY.
2088 * Records. Removed K_record, and replaced it by pure lambda term
2089 %x. c. The simplifier setup is now more robust against eta expansion.
2090 INCOMPATIBILITY: in cases explicitly referring to K_record.
2092 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2094 * Library/ListVector: new theory of arithmetic vector operations.
2096 * Library/Order_Relation: new theory of various orderings as sets of
2097 pairs. Defines preorders, partial orders, linear orders and
2098 well-orders on sets and on types.
2103 * Renamed some theories to allow to loading both ZF and HOL in the
2106 Datatype -> Datatype_ZF
2107 Inductive -> Inductive_ZF
2114 INCOMPATIBILITY: ZF theories that import individual theories below
2115 Main might need to be adapted. Regular theory Main is still
2116 available, as trivial extension of Main_ZF.
2121 * ML within Isar: antiquotation @{const name} or @{const
2122 name(typargs)} produces statically-checked Const term.
2124 * Functor NamedThmsFun: data is available to the user as dynamic fact
2125 (of the same name). Removed obsolete print command.
2127 * Removed obsolete "use_legacy_bindings" function.
2129 * The ``print mode'' is now a thread-local value derived from a global
2130 template (the former print_mode reference), thus access becomes
2131 non-critical. The global print_mode reference is for session
2132 management only; user-code should use print_mode_value,
2133 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2135 * Functions system/system_out provide a robust way to invoke external
2136 shell commands, with propagation of interrupts (requires Poly/ML
2137 5.2.1). Do not use OS.Process.system etc. from the basis library!
2142 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2143 in accordance with Proof General 3.7, which prefers GNU emacs.
2145 * isatool tty runs Isabelle process with plain tty interaction;
2146 optional line editor may be specified via ISABELLE_LINE_EDITOR
2147 setting, the default settings attempt to locate "ledit" and "rlwrap".
2149 * isatool browser now works with Cygwin as well, using general
2150 "javapath" function defined in Isabelle process environment.
2152 * YXML notation provides a simple and efficient alternative to
2153 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2154 isatool yxml as described in the Isabelle system manual.
2156 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2157 provides general wrapper for managing an Isabelle process in a robust
2158 fashion, with ``cooked'' output from stdin/stderr.
2160 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2161 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2163 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2164 way of changing the user's settings is via
2165 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2168 * Multithreading.max_threads := 0 refers to the number of actual CPU
2169 cores of the underlying machine, which is a good starting point for
2170 optimal performance tuning. The corresponding usedir option -M allows
2171 "max" as an alias for "0". WARNING: does not work on certain versions
2172 of Mac OS (with Poly/ML 5.1).
2174 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2175 adverse effect of Isabelle flooding interactive front-ends (notably
2176 ProofGeneral / XEmacs).
2180 New in Isabelle2007 (November 2007)
2181 -----------------------------------
2185 * More uniform information about legacy features, notably a
2186 warning/error of "Legacy feature: ...", depending on the state of the
2187 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2188 legacy features will disappear eventually.
2190 * Theory syntax: the header format ``theory A = B + C:'' has been
2191 discontinued in favour of ``theory A imports B C begin''. Use isatool
2192 fixheaders to convert existing theory files. INCOMPATIBILITY.
2194 * Theory syntax: the old non-Isar theory file format has been
2195 discontinued altogether. Note that ML proof scripts may still be used
2196 with Isar theories; migration is usually quite simple with the ML
2197 function use_legacy_bindings. INCOMPATIBILITY.
2199 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2200 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2203 * Theory loader: be more serious about observing the static theory
2204 header specifications (including optional directories), but not the
2205 accidental file locations of previously successful loads. The strict
2206 update policy of former update_thy is now already performed by
2207 use_thy, so the former has been removed; use_thys updates several
2208 theories simultaneously, just as 'imports' within a theory header
2209 specification, but without merging the results. Potential
2210 INCOMPATIBILITY: may need to refine theory headers and commands
2211 ROOT.ML which depend on load order.
2213 * Theory loader: optional support for content-based file
2214 identification, instead of the traditional scheme of full physical
2215 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2216 (cf. the system manual). The new scheme allows to work with
2217 non-finished theories in persistent session images, such that source
2218 files may be moved later on without requiring reloads.
2220 * Theory loader: old-style ML proof scripts being *attached* to a thy
2221 file (with the same base name as the theory) are considered a legacy
2222 feature, which will disappear eventually. Even now, the theory loader
2223 no longer maintains dependencies on such files.
2225 * Syntax: the scope for resolving ambiguities via type-inference is
2226 now limited to individual terms, instead of whole simultaneous
2227 specifications as before. This greatly reduces the complexity of the
2228 syntax module and improves flexibility by separating parsing and
2229 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2230 'fixes' etc.) are required in rare situations.
2232 * Syntax: constants introduced by new-style packages ('definition',
2233 'abbreviation' etc.) are passed through the syntax module in
2234 ``authentic mode''. This means that associated mixfix annotations
2235 really stick to such constants, independently of potential name space
2236 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2237 trees are represented slightly differently, may need to adapt syntax
2238 translations accordingly. Use CONST marker in 'translations' and
2239 @{const_syntax} antiquotation in 'parse_translation' etc.
2241 * Legacy goal package: reduced interface to the bare minimum required
2242 to keep existing proof scripts running. Most other user-level
2243 functions are now part of the OldGoals structure, which is *not* open
2244 by default (consider isatool expandshort before open OldGoals).
2245 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2246 these tend to cause confusion about the actual goal (!) context being
2247 used here, which is not necessarily the same as the_context().
2249 * Command 'find_theorems': supports "*" wild-card in "name:"
2250 criterion; "with_dups" option. Certain ProofGeneral versions might
2251 support a specific search form (see ProofGeneral/CHANGES).
2253 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2254 by default, which means that "prems" (and also "fixed variables") are
2255 suppressed from proof state output. Note that the ProofGeneral
2256 settings mechanism allows to change and save options persistently, but
2257 older versions of Isabelle will fail to start up if a negative prems
2260 * Local theory targets may be specified by non-nested blocks of
2261 ``context/locale/class ... begin'' followed by ``end''. The body may
2262 contain definitions, theorems etc., including any derived mechanism
2263 that has been implemented on top of these primitives. This concept
2264 generalizes the existing ``theorem (in ...)'' towards more versatility
2267 * Proof General interface: proper undo of final 'end' command;
2268 discontinued Isabelle/classic mode (ML proof scripts).
2271 *** Document preparation ***
2273 * Added antiquotation @{theory name} which prints the given name,
2274 after checking that it refers to a valid ancestor theory in the
2277 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2278 check the given source text as ML type/structure, printing verbatim.
2280 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2281 "c args == rhs" given in the current context. (Any number of
2282 arguments may be given on the LHS.)
2287 * The 'class' package offers a combination of axclass and locale to
2288 achieve Haskell-like type classes in Isabelle. Definitions and
2289 theorems within a class context produce both relative results (with
2290 implicit parameters according to the locale context), and polymorphic
2291 constants with qualified polymorphism (according to the class
2292 context). Within the body context of a 'class' target, a separate
2293 syntax layer ("user space type system") takes care of converting
2294 between global polymorphic consts and internal locale representation.
2295 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2296 "isatool doc classes" provides a tutorial.
2298 * Generic code generator framework allows to generate executable
2299 code for ML and Haskell (including Isabelle classes). A short usage
2302 internal compilation:
2303 export_code <list of constants (term syntax)> in SML
2304 writing SML code to a file:
2305 export_code <list of constants (term syntax)> in SML <filename>
2306 writing OCaml code to a file:
2307 export_code <list of constants (term syntax)> in OCaml <filename>
2308 writing Haskell code to a bunch of files:
2309 export_code <list of constants (term syntax)> in Haskell <filename>
2311 evaluating closed propositions to True/False using code generation:
2314 Reasonable default setup of framework in HOL.
2316 Theorem attributs for selecting and transforming function equations theorems:
2318 [code fun]: select a theorem as function equation for a specific constant
2319 [code fun del]: deselect a theorem as function equation for a specific constant
2320 [code inline]: select an equation theorem for unfolding (inlining) in place
2321 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2323 User-defined serializations (target in {SML, OCaml, Haskell}):
2325 code_const <and-list of constants (term syntax)>
2326 {(target) <and-list of const target syntax>}+
2328 code_type <and-list of type constructors>
2329 {(target) <and-list of type target syntax>}+
2331 code_instance <and-list of instances>
2333 where instance ::= <type constructor> :: <class>
2335 code_class <and_list of classes>
2336 {(target) <and-list of class target syntax>}+
2337 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2339 code_instance and code_class only are effective to target Haskell.
2341 For example usage see src/HOL/ex/Codegenerator.thy and
2342 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2343 generation from Isabelle/HOL theories is available via "isatool doc
2346 * Code generator: consts in 'consts_code' Isar commands are now
2347 referred to by usual term syntax (including optional type
2350 * Command 'no_translations' removes translation rules from theory
2353 * Overloaded definitions are now actually checked for acyclic
2354 dependencies. The overloading scheme is slightly more general than
2355 that of Haskell98, although Isabelle does not demand an exact
2356 correspondence to type class and instance declarations.
2357 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2358 exotic versions of overloading -- at the discretion of the user!
2360 Polymorphic constants are represented via type arguments, i.e. the
2361 instantiation that matches an instance against the most general
2362 declaration given in the signature. For example, with the declaration
2363 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2364 as c(nat). Overloading is essentially simultaneous structural
2365 recursion over such type arguments. Incomplete specification patterns
2366 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2367 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2368 Command 'print_theory' outputs the normalized system of recursive
2369 equations, see section "definitions".
2371 * Configuration options are maintained within the theory or proof
2372 context (with name and type bool/int/string), providing a very simple
2373 interface to a poor-man's version of general context data. Tools may
2374 declare options in ML (e.g. using Attrib.config_int) and then refer to
2375 these values using Config.get etc. Users may change options via an
2376 associated attribute of the same name. This form of context
2377 declaration works particularly well with commands 'declare' or
2378 'using', for example ``declare [[foo = 42]]''. Thus it has become
2379 very easy to avoid global references, which would not observe Isar
2380 toplevel undo/redo and fail to work with multithreading.
2382 Various global ML references of Pure and HOL have been turned into
2383 configuration options:
2385 Unify.search_bound unify_search_bound
2386 Unify.trace_bound unify_trace_bound
2387 Unify.trace_simp unify_trace_simp
2388 Unify.trace_types unify_trace_types
2389 Simplifier.simp_depth_limit simp_depth_limit
2390 Blast.depth_limit blast_depth_limit
2391 DatatypeProp.dtK datatype_distinctness_limit
2392 fast_arith_neq_limit fast_arith_neq_limit
2393 fast_arith_split_limit fast_arith_split_limit
2395 * Named collections of theorems may be easily installed as context
2396 data using the functor NamedThmsFun (see also
2397 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2398 attributes; there is also a toplevel print command. This facility is
2399 just a common case of general context data, which is the preferred way
2400 for anything more complex than just a list of facts in canonical
2403 * Isar: command 'declaration' augments a local theory by generic
2404 declaration functions written in ML. This enables arbitrary content
2405 being added to the context, depending on a morphism that tells the
2406 difference of the original declaration context wrt. the application
2407 context encountered later on.
2409 * Isar: proper interfaces for simplification procedures. Command
2410 'simproc_setup' declares named simprocs (with match patterns, and body
2411 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2412 context. ML antiquotation @{simproc name} retrieves named simprocs.
2414 * Isar: an extra pair of brackets around attribute declarations
2415 abbreviates a theorem reference involving an internal dummy fact,
2416 which will be ignored later --- only the effect of the attribute on
2417 the background context will persist. This form of in-place
2418 declarations is particularly useful with commands like 'declare' and
2419 'using', for example ``have A using [[simproc a]] by simp''.
2421 * Isar: method "assumption" (and implicit closing of subproofs) now
2422 takes simple non-atomic goal assumptions into account: after applying
2423 an assumption as a rule the resulting subgoals are solved by atomic
2424 assumption steps. This is particularly useful to finish 'obtain'
2425 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2426 without referring to the original premise "!!x. P x ==> thesis" in the
2427 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2430 * Isar: implicit use of prems from the Isar proof context is
2431 considered a legacy feature. Common applications like ``have A .''
2432 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2433 referencing facts explicitly here improves readability and
2434 maintainability of proof texts.
2436 * Isar: improper proof element 'guess' is like 'obtain', but derives
2437 the obtained context from the course of reasoning! For example:
2439 assume "EX x y. A x & B y" -- "any previous fact"
2440 then guess x and y by clarify
2442 This technique is potentially adventurous, depending on the facts and
2443 proof tools being involved here.
2445 * Isar: known facts from the proof context may be specified as literal
2446 propositions, using ASCII back-quote syntax. This works wherever
2447 named facts used to be allowed so far, in proof commands, proof
2448 methods, attributes etc. Literal facts are retrieved from the context
2449 according to unification of type and term parameters. For example,
2450 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2451 theorems in the current context, then these are valid literal facts:
2452 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2454 There is also a proof method "fact" which does the same composition
2455 for explicit goal states, e.g. the following proof texts coincide with
2456 certain special cases of literal facts:
2458 have "A" by fact == note `A`
2459 have "A ==> B" by fact == note `A ==> B`
2460 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2461 have "P a ==> Q a" by fact == note `P a ==> Q a`
2463 * Isar: ":" (colon) is no longer a symbolic identifier character in
2464 outer syntax. Thus symbolic identifiers may be used without
2465 additional white space in declarations like this: ``assume *: A''.
2467 * Isar: 'print_facts' prints all local facts of the current context,
2468 both named and unnamed ones.
2470 * Isar: 'def' now admits simultaneous definitions, e.g.:
2472 def x == "t" and y == "u"
2474 * Isar: added command 'unfolding', which is structurally similar to
2475 'using', but affects both the goal state and facts by unfolding given
2476 rewrite rules. Thus many occurrences of the 'unfold' method or
2477 'unfolded' attribute may be replaced by first-class proof text.
2479 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2480 and command 'unfolding' now all support object-level equalities
2481 (potentially conditional). The underlying notion of rewrite rule is
2482 analogous to the 'rule_format' attribute, but *not* that of the
2483 Simplifier (which is usually more generous).
2485 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2486 premises of a theorem by n. Useful in conjunction with drule.
2488 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2489 method expression within a sandbox consisting of the first N
2490 sub-goals, which need to exist. For example, ``simp_all [3]''
2491 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2492 simplifies all new goals that emerge from applying rule foo to the
2493 originally first one.
2495 * Isar: schematic goals are no longer restricted to higher-order
2496 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2499 * Isar: the conclusion of a long theorem statement is now either
2500 'shows' (a simultaneous conjunction, as before), or 'obtains'
2501 (essentially a disjunction of cases with local parameters and
2502 assumptions). The latter allows to express general elimination rules
2503 adequately; in this notation common elimination rules look like this:
2505 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2507 obtains x where "P x"
2509 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2513 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2519 The subsequent classical rules even refer to the formal "thesis"
2522 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2525 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2526 obtains "thesis ==> something"
2528 The actual proof of an 'obtains' statement is analogous to that of the
2529 Isar proof element 'obtain', only that there may be several cases.
2530 Optional case names may be specified in parentheses; these will be
2531 available both in the present proof and as annotations in the
2532 resulting rule, for later use with the 'cases' method (cf. attribute
2535 * Isar: the assumptions of a long theorem statement are available as
2536 "assms" fact in the proof context. This is more appropriate than the
2537 (historical) "prems", which refers to all assumptions of the current
2538 context, including those from the target locale, proof body etc.
2540 * Isar: 'print_statement' prints theorems from the current theory or
2541 proof context in long statement form, according to the syntax of a
2544 * Isar: 'obtain' takes an optional case name for the local context
2545 introduction rule (default "that").
2547 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2548 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2551 * Pure: syntax "CONST name" produces a fully internalized constant
2552 according to the current context. This is particularly useful for
2553 syntax translations that should refer to internal constant
2554 representations independently of name spaces.
2556 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2557 instead of "FOO ". This allows multiple binder declarations to coexist
2558 in the same context. INCOMPATIBILITY.
2560 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2561 primitive that also works in a locale context (both for constants and
2562 fixed variables). Type declaration and internal syntactic representation
2563 of given constants retrieved from the context. Likewise, the
2564 'no_notation' command allows to remove given syntax annotations from the
2567 * Isar/locales: new derived specification elements 'axiomatization',
2568 'definition', 'abbreviation', which support type-inference, admit
2569 object-level specifications (equality, equivalence). See also the
2570 isar-ref manual. Examples:
2573 eq (infix "===" 50) where
2574 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2576 definition "f x y = x + y + 1"
2577 definition g where "g x = f x x"
2580 neq (infix "=!=" 50) where
2581 "x =!= y == ~ (x === y)"
2583 These specifications may be also used in a locale context. Then the
2584 constants being introduced depend on certain fixed parameters, and the
2585 constant name is qualified by the locale base name. An internal
2586 abbreviation takes care for convenient input and output, making the
2587 parameters implicit and using the original short name. See also
2588 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2589 entities from a monomorphic theory.
2591 Presently, abbreviations are only available 'in' a target locale, but
2592 not inherited by general import expressions. Also note that
2593 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2594 'translations' in common applications. The "no_abbrevs" print mode
2595 prevents folding of abbreviations in term output.
2597 Concrete syntax is attached to specified constants in internal form,
2598 independently of name spaces. The parse tree representation is
2599 slightly different -- use 'notation' instead of raw 'syntax', and
2600 'translations' with explicit "CONST" markup to accommodate this.
2602 * Pure/Isar: unified syntax for new-style specification mechanisms
2603 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2604 full type inference and dummy patterns ("_"). For example:
2606 definition "K x _ = x"
2608 inductive conj for A B
2609 where "A ==> B ==> conj A B"
2611 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2612 the current context. Print mode "no_abbrevs" prevents inversion of
2613 abbreviations on output.
2615 * Isar/locales: improved parameter handling: use of locales "var" and
2616 "struct" no longer necessary; - parameter renamings are no longer
2617 required to be injective. For example, this allows to define
2618 endomorphisms as locale endom = homom mult mult h.
2620 * Isar/locales: changed the way locales with predicates are defined.
2621 Instead of accumulating the specification, the imported expression is
2622 now an interpretation. INCOMPATIBILITY: different normal form of
2623 locale expressions. In particular, in interpretations of locales with
2624 predicates, goals repesenting already interpreted fragments are not
2625 removed automatically. Use methods `intro_locales' and
2626 `unfold_locales'; see below.
2628 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2629 provide backward reasoning on locales predicates. The methods are
2630 aware of interpretations and discharge corresponding goals.
2631 `intro_locales' is less aggressive then `unfold_locales' and does not
2632 unfold predicates to assumptions.
2634 * Isar/locales: the order in which locale fragments are accumulated
2635 has changed. This enables to override declarations from fragments due
2636 to interpretations -- for example, unwanted simp rules.
2638 * Isar/locales: interpretation in theories and proof contexts has been
2639 extended. One may now specify (and prove) equations, which are
2640 unfolded in interpreted theorems. This is useful for replacing
2641 defined concepts (constants depending on locale parameters) by
2642 concepts already existing in the target context. Example:
2644 interpretation partial_order ["op <= :: [int, int] => bool"]
2645 where "partial_order.less (op <=) (x::int) y = (x < y)"
2647 Typically, the constant `partial_order.less' is created by a
2648 definition specification element in the context of locale
2651 * Method "induct": improved internal context management to support
2652 local fixes and defines on-the-fly. Thus explicit meta-level
2653 connectives !! and ==> are rarely required anymore in inductive goals
2654 (using object-logic connectives for this purpose has been long
2655 obsolete anyway). Common proof patterns are explained in
2656 src/HOL/Induct/Common_Patterns.thy, see also
2657 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2660 * Method "induct": improved handling of simultaneous goals. Instead of
2661 introducing object-level conjunction, the statement is now split into
2662 several conclusions, while the corresponding symbolic cases are nested
2663 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2664 see src/HOL/Induct/Common_Patterns.thy, for example.
2666 * Method "induct": mutual induction rules are now specified as a list
2667 of rule sharing the same induction cases. HOL packages usually provide
2668 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2669 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2670 mutual induction rules differently, i.e. like this:
2672 (induct rule: foo_bar.inducts)
2673 (induct set: foo bar)
2674 (induct pred: foo bar)
2675 (induct type: foo bar)
2677 The ML function ProjectRule.projections turns old-style rules into the
2680 * Method "coinduct": dual of induction, see
2681 src/HOL/Library/Coinductive_List.thy for various examples.
2683 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2684 considered a legacy feature.
2686 * Attribute "symmetric" produces result with standardized schematic
2687 variables (index 0). Potential INCOMPATIBILITY.
2689 * Simplifier: by default the simplifier trace only shows top level
2690 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2691 default. Thus there is less danger of being flooded by the trace. The
2692 trace indicates where parts have been suppressed.
2694 * Provers/classical: removed obsolete classical version of elim_format
2695 attribute; classical elim/dest rules are now treated uniformly when
2696 manipulating the claset.
2698 * Provers/classical: stricter checks to ensure that supplied intro,
2699 dest and elim rules are well-formed; dest and elim rules must have at
2702 * Provers/classical: attributes dest/elim/intro take an optional
2703 weight argument for the rule (just as the Pure versions). Weights are
2704 ignored by automated tools, but determine the search order of single
2707 * Syntax: input syntax now supports dummy variable binding "%_. b",
2708 where the body does not mention the bound variable. Note that dummy
2709 patterns implicitly depend on their context of bounds, which makes
2710 "{_. _}" match any set comprehension as expected. Potential
2711 INCOMPATIBILITY -- parse translations need to cope with syntactic
2712 constant "_idtdummy" in the binding position.
2714 * Syntax: removed obsolete syntactic constant "_K" and its associated
2715 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2716 for example "A -> B" => "Pi A (%_. B)".
2718 * Pure: 'class_deps' command visualizes the subclass relation, using
2719 the graph browser tool.
2721 * Pure: 'print_theory' now suppresses certain internal declarations by
2722 default; use '!' option for full details.
2727 * Method "metis" proves goals by applying the Metis general-purpose
2728 resolution prover (see also http://gilith.com/software/metis/).
2729 Examples are in the directory MetisExamples. WARNING: the
2730 Isabelle/HOL-Metis integration does not yet work properly with
2733 * Command 'sledgehammer' invokes external automatic theorem provers as
2734 background processes. It generates calls to the "metis" method if
2735 successful. These can be pasted into the proof. Users do not have to
2736 wait for the automatic provers to return. WARNING: does not really
2737 work with multi-threading.
2739 * New "auto_quickcheck" feature tests outermost goal statements for
2740 potential counter-examples. Controlled by ML references
2741 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2742 5000 milliseconds). Fails silently if statements is outside of
2743 executable fragment, or any other codgenerator problem occurs.
2745 * New constant "undefined" with axiom "undefined x = undefined".
2747 * Added class "HOL.eq", allowing for code generation with polymorphic
2750 * Some renaming of class constants due to canonical name prefixing in
2751 the new 'class' package:
2753 HOL.abs ~> HOL.abs_class.abs
2754 HOL.divide ~> HOL.divide_class.divide
2755 0 ~> HOL.zero_class.zero
2756 1 ~> HOL.one_class.one
2757 op + ~> HOL.plus_class.plus
2758 op - ~> HOL.minus_class.minus
2759 uminus ~> HOL.minus_class.uminus
2760 op * ~> HOL.times_class.times
2761 op < ~> HOL.ord_class.less
2762 op <= > HOL.ord_class.less_eq
2763 Nat.power ~> Power.power_class.power
2764 Nat.size ~> Nat.size_class.size
2765 Numeral.number_of ~> Numeral.number_class.number_of
2766 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2767 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2768 Orderings.min ~> Orderings.ord_class.min
2769 Orderings.max ~> Orderings.ord_class.max
2770 Divides.op div ~> Divides.div_class.div
2771 Divides.op mod ~> Divides.div_class.mod
2772 Divides.op dvd ~> Divides.div_class.dvd
2774 INCOMPATIBILITY. Adaptions may be required in the following cases:
2776 a) User-defined constants using any of the names "plus", "minus",
2777 "times", "less" or "less_eq". The standard syntax translations for
2778 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2781 b) Variables named "plus", "minus", "times", "less", "less_eq"
2782 INCOMPATIBILITY: use more specific names.
2784 c) Permutative equations (e.g. "a + b = b + a")
2785 Since the change of names also changes the order of terms, permutative
2786 rewrite rules may get applied in a different order. Experience shows
2787 that this is rarely the case (only two adaptions in the whole Isabelle
2788 distribution). INCOMPATIBILITY: rewrite proofs
2790 d) ML code directly refering to constant names
2791 This in general only affects hand-written proof tactics, simprocs and
2792 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2793 Consider using @{const_name} antiquotation.
2795 * New class "default" with associated constant "default".
2797 * Function "sgn" is now overloaded and available on int, real, complex
2798 (and other numeric types), using class "sgn". Two possible defs of
2799 sgn are given as equational assumptions in the classes sgn_if and
2800 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2803 * Locale "partial_order" now unified with class "order" (cf. theory
2804 Orderings), added parameter "less". INCOMPATIBILITY.
2806 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2807 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2808 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2810 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2811 changed order of proof goals in instance proofs.
2813 * The transitivity reasoner for partial and linear orders is set up
2814 for classes "order" and "linorder". Instances of the reasoner are available
2815 in all contexts importing or interpreting the corresponding locales.
2816 Method "order" invokes the reasoner separately; the reasoner
2817 is also integrated with the Simplifier as a solver. Diagnostic
2818 command 'print_orders' shows the available instances of the reasoner
2819 in the current context.
2821 * Localized monotonicity predicate in theory "Orderings"; integrated
2822 lemmas max_of_mono and min_of_mono with this predicate.
2825 * Formulation of theorem "dense" changed slightly due to integration
2826 with new class dense_linear_order.
2828 * Uniform lattice theory development in HOL.
2830 constants "meet" and "join" now named "inf" and "sup"
2831 constant "Meet" now named "Inf"
2833 classes "meet_semilorder" and "join_semilorder" now named
2834 "lower_semilattice" and "upper_semilattice"
2835 class "lorder" now named "lattice"
2836 class "comp_lat" now named "complete_lattice"
2838 Instantiation of lattice classes allows explicit definitions
2839 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2841 INCOMPATIBILITY. Theorem renames:
2843 meet_left_le ~> inf_le1
2844 meet_right_le ~> inf_le2
2845 join_left_le ~> sup_ge1
2846 join_right_le ~> sup_ge2
2847 meet_join_le ~> inf_sup_ord
2850 le_meet ~> le_inf_iff
2851 le_join ~> ge_sup_conv
2852 meet_idempotent ~> inf_idem
2853 join_idempotent ~> sup_idem
2854 meet_comm ~> inf_commute
2855 join_comm ~> sup_commute
2856 meet_leI1 ~> le_infI1
2857 meet_leI2 ~> le_infI2
2858 le_joinI1 ~> le_supI1
2859 le_joinI2 ~> le_supI2
2860 meet_assoc ~> inf_assoc
2861 join_assoc ~> sup_assoc
2862 meet_left_comm ~> inf_left_commute
2863 meet_left_idempotent ~> inf_left_idem
2864 join_left_comm ~> sup_left_commute
2865 join_left_idempotent ~> sup_left_idem
2868 le_def_meet ~> le_iff_inf
2869 le_def_join ~> le_iff_sup
2870 join_absorp2 ~> sup_absorb2
2871 join_absorp1 ~> sup_absorb1
2872 meet_absorp1 ~> inf_absorb1
2873 meet_absorp2 ~> inf_absorb2
2874 meet_join_absorp ~> inf_sup_absorb
2875 join_meet_absorp ~> sup_inf_absorb
2876 distrib_join_le ~> distrib_sup_le
2877 distrib_meet_le ~> distrib_inf_le
2879 add_meet_distrib_left ~> add_inf_distrib_left
2880 add_join_distrib_left ~> add_sup_distrib_left
2881 is_join_neg_meet ~> is_join_neg_inf
2882 is_meet_neg_join ~> is_meet_neg_sup
2883 add_meet_distrib_right ~> add_inf_distrib_right
2884 add_join_distrib_right ~> add_sup_distrib_right
2885 add_meet_join_distribs ~> add_sup_inf_distribs
2886 join_eq_neg_meet ~> sup_eq_neg_inf
2887 meet_eq_neg_join ~> inf_eq_neg_sup
2888 add_eq_meet_join ~> add_eq_inf_sup
2889 meet_0_imp_0 ~> inf_0_imp_0
2890 join_0_imp_0 ~> sup_0_imp_0
2891 meet_0_eq_0 ~> inf_0_eq_0
2892 join_0_eq_0 ~> sup_0_eq_0
2893 neg_meet_eq_join ~> neg_inf_eq_sup
2894 neg_join_eq_meet ~> neg_sup_eq_inf
2895 join_eq_if ~> sup_eq_if
2897 mono_meet ~> mono_inf
2898 mono_join ~> mono_sup
2899 meet_bool_eq ~> inf_bool_eq
2900 join_bool_eq ~> sup_bool_eq
2901 meet_fun_eq ~> inf_fun_eq
2902 join_fun_eq ~> sup_fun_eq
2903 meet_set_eq ~> inf_set_eq
2904 join_set_eq ~> sup_set_eq
2905 meet1_iff ~> inf1_iff
2906 meet2_iff ~> inf2_iff
2915 join1_iff ~> sup1_iff
2916 join2_iff ~> sup2_iff
2926 is_meet_Meet ~> is_meet_Inf
2927 Meet_bool_def ~> Inf_bool_def
2928 Meet_fun_def ~> Inf_fun_def
2929 Meet_greatest ~> Inf_greatest
2930 Meet_lower ~> Inf_lower
2931 Meet_set_def ~> Inf_set_def
2934 Sup_bool_eq ~> Sup_bool_def
2935 Sup_fun_eq ~> Sup_fun_def
2936 Sup_set_eq ~> Sup_set_def
2938 listsp_meetI ~> listsp_infI
2939 listsp_meet_eq ~> listsp_inf_eq
2944 * Added syntactic class "size"; overloaded constant "size" now has
2945 type "'a::size ==> bool"
2947 * Internal reorganisation of `size' of datatypes: size theorems
2948 "foo.size" are no longer subsumed by "foo.simps" (but are still
2949 simplification rules by default!); theorems "prod.size" now named
2952 * Class "div" now inherits from class "times" rather than "type".
2955 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2956 Linorder etc. have disappeared; operations defined in terms of
2957 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2959 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2961 * HOL-Word: New extensive library and type for generic, fixed size
2962 machine words, with arithemtic, bit-wise, shifting and rotating
2963 operations, reflection into int, nat, and bool lists, automation for
2964 linear arithmetic (by automatic reflection into nat or int), including
2965 lemmas on overflow and monotonicity. Instantiated to all appropriate
2966 arithmetic type classes, supporting automatic simplification of
2967 numerals on all operations.
2969 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2971 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2973 * Code generator library theories:
2974 - Code_Integer represents HOL integers by big integer literals in target
2976 - Code_Char represents HOL characters by character literals in target
2978 - Code_Char_chr like Code_Char, but also offers treatment of character
2979 codes; includes Code_Integer.
2980 - Executable_Set allows to generate code for finite sets using lists.
2981 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2983 - Executable_Real implements a subset of real numbers, namly those
2984 representable by rational numbers.
2985 - Efficient_Nat implements natural numbers by integers, which in general will
2986 result in higher efficency; pattern matching with 0/Suc is eliminated;
2987 includes Code_Integer.
2988 - Code_Index provides an additional datatype index which is mapped to
2989 target-language built-in integers.
2990 - Code_Message provides an additional datatype message_string which is isomorphic to
2991 strings; messages are mapped to target-language strings.
2993 * New package for inductive predicates
2995 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2998 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2999 for z_1 :: U_1 and ... and z_n :: U_m
3001 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3004 with full support for type-inference, rather than
3006 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3008 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3009 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3011 inductive "s z_1 ... z_m"
3013 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3016 For backward compatibility, there is a wrapper allowing inductive
3017 sets to be defined with the new package via
3020 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3021 for z_1 :: U_1 and ... and z_n :: U_m
3023 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3029 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3030 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3031 for z_1 :: U_1 and ... and z_n :: U_m
3033 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3034 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3037 if the additional syntax "p ..." is required.
3039 Numerous examples can be found in the subdirectories src/HOL/Auth,
3040 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3044 - Since declaration and definition of inductive sets or predicates
3045 is no longer separated, abbreviations involving the newly
3046 introduced sets or predicates must be specified together with the
3047 introduction rules after the 'where' keyword (see above), rather
3048 than before the actual inductive definition.
3050 - The variables in induction and elimination rules are now
3051 quantified in the order of their occurrence in the introduction
3052 rules, rather than in alphabetical order. Since this may break
3053 some proofs, these proofs either have to be repaired, e.g. by
3054 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3055 statements of the form
3057 case (rule_i a_i_1 ... a_i_{k_i})
3059 or the old order of quantification has to be restored by explicitly adding
3060 meta-level quantifiers in the introduction rules, i.e.
3062 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3064 - The format of the elimination rules is now
3066 p z_1 ... z_m x_1 ... x_n ==>
3067 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3072 (x_1, ..., x_n) : s z_1 ... z_m ==>
3073 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3076 for sets rather than
3078 x : s z_1 ... z_m ==>
3079 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3082 This may require terms in goals to be expanded to n-tuples
3083 (e.g. using case_tac or simplification with the split_paired_all
3084 rule) before the above elimination rule is applicable.
3086 - The elimination or case analysis rules for (mutually) inductive
3087 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3088 list of rules "p_1_..._p_k.elims" is no longer available.
3090 * New package "function"/"fun" for general recursive functions,
3091 supporting mutual and nested recursion, definitions in local contexts,
3092 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3093 for small examples, and the separate tutorial on the function
3094 package. The old recdef "package" is still available as before, but
3095 users are encouraged to use the new package.
3097 * Method "lexicographic_order" automatically synthesizes termination
3098 relations as lexicographic combinations of size measures.
3100 * Case-expressions allow arbitrary constructor-patterns (including
3101 "_") and take their order into account, like in functional
3102 programming. Internally, this is translated into nested
3103 case-expressions; missing cases are added and mapped to the predefined
3104 constant "undefined". In complicated cases printing may no longer show
3105 the original input but the internal form. Lambda-abstractions allow
3106 the same form of pattern matching: "% pat1 => e1 | ..." is an
3107 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3110 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3111 is an abbreviation for "of_nat :: nat => int". The simplification
3112 rules for "of_nat" have been changed to work like "int" did
3113 previously. Potential INCOMPATIBILITY:
3114 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3115 - of_nat_diff and of_nat_mult are no longer default simp rules
3117 * Method "algebra" solves polynomial equations over (semi)rings using
3118 Groebner bases. The (semi)ring structure is defined by locales and the
3119 tool setup depends on that generic context. Installing the method for
3120 a specific type involves instantiating the locale and possibly adding
3121 declarations for computation on the coefficients. The method is
3122 already instantiated for natural numbers and for the axiomatic class
3123 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3124 CALCULEMUS 2007 for the general principles underlying this
3125 architecture of context-aware proof-tools.
3127 * Method "ferrack" implements quantifier elimination over
3128 special-purpose dense linear orders using locales (analogous to
3129 "algebra"). The method is already installed for class
3130 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3133 * Former constant "List.op @" now named "List.append". Use ML
3134 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3135 circumvent possible incompatibilities when working on ML level.
3137 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3139 * New function listsum :: 'a list => 'a for arbitrary monoids.
3140 Special syntax: "SUM x <- xs. f x" (and latex variants)
3142 * New syntax for Haskell-like list comprehension (input only), eg.
3143 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3145 * The special syntax for function "filter" has changed from [x :
3146 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3147 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3149 * [a..b] is now defined for arbitrary linear orders. It used to be
3150 defined on nat only, as an abbreviation for [a..<Suc b]
3153 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3155 * New functions "sorted" and "sort" in src/HOL/List.thy.
3157 * New lemma collection field_simps (an extension of ring_simps) for
3158 manipulating (in)equations involving division. Multiplies with all
3159 denominators that can be proved to be non-zero (in equations) or
3160 positive/negative (in inequations).
3162 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3163 have been improved and renamed to ring_simps, group_simps and
3164 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3165 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3167 * Theory Library/Commutative_Ring: switched from recdef to function
3168 package; constants add, mul, pow now curried. Infix syntax for
3169 algebraic operations.
3171 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3174 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3177 * HOL/records: generalised field-update to take a function on the
3178 field rather than the new value: r(|A := x|) is translated to A_update
3179 (K x) r The K-combinator that is internally used is called K_record.
3180 INCOMPATIBILITY: Usage of the plain update functions has to be
3183 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3184 * x = 0, which are required for a semiring. Richer structures do not
3185 inherit from semiring_0 anymore, because this property is a theorem
3186 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3187 there is more to prove, but this is mostly trivial.
3189 * Class "recpower" is generalized to arbitrary monoids, not just
3190 commutative semirings. INCOMPATIBILITY: may need to incorporate
3191 commutativity or semiring properties additionally.
3193 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3194 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3195 better use 'abbreviation'.
3197 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3199 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3200 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3201 significant changes for setting up numeral syntax for types:
3202 - New constants Numeral.pred and Numeral.succ instead
3203 of former Numeral.bin_pred and Numeral.bin_succ.
3204 - Use integer operations instead of bin_add, bin_mult and so on.
3205 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3206 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3208 See src/HOL/Integ/IntArith.thy for an example setup.
3210 * Command 'normal_form' computes the normal form of a term that may
3211 contain free variables. For example ``normal_form "rev [a, b, c]"''
3212 produces ``[b, c, a]'' (without proof). This command is suitable for
3213 heavy-duty computations because the functions are compiled to ML
3214 first. Correspondingly, a method "normalization" is provided. See
3215 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3217 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3218 25 like -->); output depends on the "iff" print_mode, the default is
3219 "A = B" (with priority 50).
3221 * Relations less (<) and less_eq (<=) are also available on type bool.
3222 Modified syntax to disallow nesting without explicit parentheses,
3223 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3226 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3228 * Relation composition operator "op O" now has precedence 75 and binds
3229 stronger than union and intersection. INCOMPATIBILITY.
3231 * The old set interval syntax "{m..n(}" (and relatives) has been
3232 removed. Use "{m..<n}" (and relatives) instead.
3234 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3235 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3236 ``declare [[simproc del: neq]]''.
3238 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3241 * Theorem Cons_eq_map_conv no longer declared as "simp".
3243 * Theorem setsum_mult renamed to setsum_right_distrib.
3245 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3248 * Reimplemented methods "sat" and "satx", with several improvements:
3249 goals no longer need to be stated as "<prems> ==> False", equivalences
3250 (i.e. "=" on type bool) are handled, variable names of the form
3251 "lit_<n>" are no longer reserved, significant speedup.
3253 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3254 zChaff is still supported as well.
3256 * 'inductive' and 'datatype': provide projections of mutual rules,
3257 bundled as foo_bar.inducts;
3259 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3262 * Library: moved theory Accessible_Part to main HOL.
3264 * Library: added theory Coinductive_List of potentially infinite lists
3265 as greatest fixed-point.
3267 * Library: added theory AssocList which implements (finite) maps as
3270 * Method "evaluation" solves goals (i.e. a boolean expression)
3271 efficiently by compiling it to ML. The goal is "proved" (via an
3272 oracle) if it evaluates to True.
3274 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3275 also when invoked by the simplifier. This results in the Simplifier
3276 being more powerful on arithmetic goals. INCOMPATIBILITY.
3277 Configuration option fast_arith_split_limit=0 recovers the old
3280 * Support for hex (0x20) and binary (0b1001) numerals.
3282 * New method: reify eqs (t), where eqs are equations for an
3283 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3284 parameter, computes a term s::'b and a list xs::'a list and proves the
3285 theorem I xs s = t. This is also known as reification or quoting. The
3286 resulting theorem is applied to the subgoal to substitute t with I xs
3287 s. If t is omitted, the subgoal itself is reified.
3289 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3290 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3291 where f is supposed to be a computable function (in the sense of code
3292 generattion). The method uses reify to compute s and xs as above then
3293 applies corr_thm and uses normalization by evaluation to "prove" f s =
3294 r and finally gets the theorem t = r, which is again applied to the
3295 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3297 * Reflection: Automatic reification now handels binding, an example is
3298 available in src/HOL/ex/ReflectionEx.thy
3300 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3301 command 'statespace' that is similar to 'record', but introduces an
3302 abstract specification based on the locale infrastructure instead of
3303 HOL types. This leads to extra flexibility in composing state spaces,
3304 in particular multiple inheritance and renaming of components.
3309 * Hyperreal: Functions root and sqrt are now defined on negative real
3310 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3311 Nonnegativity side conditions have been removed from many lemmas, so
3312 that more subgoals may now be solved by simplification; potential
3315 * Real: new type classes formalize real normed vector spaces and
3316 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3317 and norm :: 'a => real.
3319 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3320 reals into other types. The overloaded constant Reals :: 'a set is now
3321 defined as range of_real; potential INCOMPATIBILITY.
3323 * Real: proper support for ML code generation, including 'quickcheck'.
3324 Reals are implemented as arbitrary precision rationals.
3326 * Hyperreal: Several constants that previously worked only for the
3327 reals have been generalized, so they now work over arbitrary vector
3328 spaces. Type annotations may need to be added in some cases; potential
3331 Infinitesimal :: ('a::real_normed_vector) star set
3332 HFinite :: ('a::real_normed_vector) star set
3333 HInfinite :: ('a::real_normed_vector) star set
3334 approx :: ('a::real_normed_vector) star => 'a star => bool
3335 monad :: ('a::real_normed_vector) star => 'a star set
3336 galaxy :: ('a::real_normed_vector) star => 'a star set
3337 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3338 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3339 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3340 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3341 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3342 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3343 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3344 sgn :: 'a::real_normed_vector => 'a
3345 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3347 * Complex: Some complex-specific constants are now abbreviations for
3348 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3349 hnorm. Other constants have been entirely removed in favor of the
3350 polymorphic versions (INCOMPATIBILITY):
3354 HInfinite <-- CInfinite
3355 Infinitesimal <-- CInfinitesimal
3358 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3359 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3360 (ns)deriv <-- (ns)cderiv
3365 * Formalisation of ideals and the quotient construction over rings.
3367 * Order and lattice theory no longer based on records.
3370 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3371 greatest_closed. INCOMPATIBILITY.
3373 * Method algebra is now set up via an attribute. For examples see
3374 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3375 of algebraic structures.
3377 * Renamed theory CRing to Ring.
3382 * Substantial, yet incomplete support for nominal datatypes (binding
3383 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3384 src/HOL/Nominal/Examples. Prospective users should consult
3385 http://isabelle.in.tum.de/nominal/
3390 * ML basics: just one true type int, which coincides with IntInf.int
3393 * ML within Isar: antiquotations allow to embed statically-checked
3394 formal entities in the source, referring to the context available at
3395 compile-time. For example:
3397 ML {* @{sort "{zero,one}"} *}
3398 ML {* @{typ "'a => 'b"} *}
3399 ML {* @{term "%x. x"} *}
3400 ML {* @{prop "x == y"} *}
3401 ML {* @{ctyp "'a => 'b"} *}
3402 ML {* @{cterm "%x. x"} *}
3403 ML {* @{cprop "x == y"} *}
3404 ML {* @{thm asm_rl} *}
3405 ML {* @{thms asm_rl} *}
3406 ML {* @{type_name c} *}
3407 ML {* @{type_syntax c} *}
3408 ML {* @{const_name c} *}
3409 ML {* @{const_syntax c} *}
3412 ML {* @{theory Pure} *}
3413 ML {* @{theory_ref} *}
3414 ML {* @{theory_ref Pure} *}
3417 ML {* @{clasimpset} *}
3419 The same works for sources being ``used'' within an Isar context.
3421 * ML in Isar: improved error reporting; extra verbosity with
3422 ML_Context.trace enabled.
3424 * Pure/General/table.ML: the join operations now works via exceptions
3425 DUP/SAME instead of type option. This is simpler in simple cases, and
3426 admits slightly more efficient complex applications.
3428 * Pure: 'advanced' translation functions (parse_translation etc.) now
3429 use Context.generic instead of just theory.
3431 * Pure: datatype Context.generic joins theory/Proof.context and
3432 provides some facilities for code that works in either kind of
3433 context, notably GenericDataFun for uniform theory and proof data.
3435 * Pure: simplified internal attribute type, which is now always
3436 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3437 local (Proof.context) attributes have been discontinued, while
3438 minimizing code duplication. Thm.rule_attribute and
3439 Thm.declaration_attribute build canonical attributes; see also structure
3440 Context for further operations on Context.generic, notably
3441 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3442 declarations and definitions.
3444 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3445 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3446 init only required for impure data. INCOMPATIBILITY: empty really need
3447 to be empty (no dependencies on theory content!)
3449 * Pure/kernel: consts certification ignores sort constraints given in
3450 signature declarations. (This information is not relevant to the
3451 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3452 potential INCOMPATIBILITY.
3454 * Pure: axiomatic type classes are now purely definitional, with
3455 explicit proofs of class axioms and super class relations performed
3456 internally. See Pure/axclass.ML for the main internal interfaces --
3457 notably AxClass.define_class supercedes AxClass.add_axclass, and
3458 AxClass.axiomatize_class/classrel/arity supersede
3459 Sign.add_classes/classrel/arities.
3461 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3462 global/local versions on theory vs. Proof.context have been
3463 discontinued; Attrib.syntax and Method.syntax have been adapted
3464 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3465 attributes, methods, etc.
3467 * Pure: several functions of signature "... -> theory -> theory * ..."
3468 have been reoriented to "... -> theory -> ... * theory" in order to
3469 allow natural usage in combination with the ||>, ||>>, |-> and
3470 fold_map combinators.
3472 * Pure: official theorem names (closed derivations) and additional
3473 comments (tags) are now strictly separate. Name hints -- which are
3474 maintained as tags -- may be attached any time without affecting the
3477 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3478 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3479 achieve the old behaviour.
3481 * Pure: the "Goal" constant is now called "prop", supporting a
3482 slightly more general idea of ``protecting'' meta-level rule
3485 * Pure: Logic.(un)varify only works in a global context, which is now
3486 enforced instead of silently assumed. INCOMPATIBILITY, may use
3487 Logic.legacy_(un)varify as temporary workaround.
3489 * Pure: structure Name provides scalable operations for generating
3490 internal variable names, notably Name.variants etc. This replaces
3491 some popular functions from term.ML:
3493 Term.variant -> Name.variant
3494 Term.variantlist -> Name.variant_list
3495 Term.invent_names -> Name.invent_list
3497 Note that low-level renaming rarely occurs in new code -- operations
3498 from structure Variable are used instead (see below).
3500 * Pure: structure Variable provides fundamental operations for proper
3501 treatment of fixed/schematic variables in a context. For example,
3502 Variable.import introduces fixes for schematics of given facts and
3503 Variable.export reverses the effect (up to renaming) -- this replaces
3504 various freeze_thaw operations.
3506 * Pure: structure Goal provides simple interfaces for
3507 init/conclude/finish and tactical prove operations (replacing former
3508 Tactic.prove). Goal.prove is the canonical way to prove results
3509 within a given context; Goal.prove_global is a degraded version for
3510 theory level goals, including a global Drule.standard. Note that
3511 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3512 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3513 in a locale context).
3515 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3516 and type checking (Syntax.check_term etc.), with common combinations
3517 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3518 which are considered legacy and await removal.
3520 * Pure/Syntax: generic interfaces for type unchecking
3521 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3522 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3523 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3524 available for convenience, but refer to the very same operations using
3525 a mere theory instead of a full context.
3527 * Isar: simplified treatment of user-level errors, using exception
3528 ERROR of string uniformly. Function error now merely raises ERROR,
3529 without any side effect on output channels. The Isar toplevel takes
3530 care of proper display of ERROR exceptions. ML code may use plain
3531 handle/can/try; cat_error may be used to concatenate errors like this:
3533 ... handle ERROR msg => cat_error msg "..."
3535 Toplevel ML code (run directly or through the Isar toplevel) may be
3536 embedded into the Isar toplevel with exception display/debug like
3539 Isar.toplevel (fn () => ...)
3541 INCOMPATIBILITY, removed special transform_error facilities, removed
3542 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3543 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3544 -- use plain ERROR instead.
3546 * Isar: theory setup now has type (theory -> theory), instead of a
3547 list. INCOMPATIBILITY, may use #> to compose setup functions.
3549 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3550 ProofContext.debug/verbose flags.
3552 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3553 theory before entering a proof state. Transactions now always see a
3554 quasi-functional intermediate checkpoint, both in interactive and
3557 * Isar: simplified interfaces for outer syntax. Renamed
3558 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3559 OuterSyntax.add_parsers -- this functionality is now included in
3560 OuterSyntax.command etc. INCOMPATIBILITY.
3562 * Simplifier: the simpset of a running simplification process now
3563 contains a proof context (cf. Simplifier.the_context), which is the
3564 very context that the initial simpset has been retrieved from (by
3565 simpset_of/local_simpset_of). Consequently, all plug-in components
3566 (solver, looper etc.) may depend on arbitrary proof data.
3568 * Simplifier.inherit_context inherits the proof context (plus the
3569 local bounds) of the current simplification process; any simproc
3570 etc. that calls the Simplifier recursively should do this! Removed
3571 former Simplifier.inherit_bounds, which is already included here --
3572 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3573 specify an explicit context using Simplifier.context/theory_context.
3575 * Simplifier/Classical Reasoner: more abstract interfaces
3576 change_simpset/claset for modifying the simpset/claset reference of a
3577 theory; raw versions simpset/claset_ref etc. have been discontinued --
3580 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3586 * settings: the default heap location within ISABELLE_HOME_USER now
3587 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3588 Isabelle installations.
3590 * isabelle-process: option -S (secure mode) disables some critical
3591 operations, notably runtime compilation and evaluation of ML source
3594 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3596 * Support for parallel execution, using native multicore support of
3597 Poly/ML 5.1. The theory loader exploits parallelism when processing
3598 independent theories, according to the given theory header
3599 specifications. The maximum number of worker threads is specified via
3600 usedir option -M or the "max-threads" setting in Proof General. A
3601 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3602 to 6 on a 8-core machine. User-code needs to observe certain
3603 guidelines for thread-safe programming, see appendix A in the Isar
3604 Implementation manual.
3608 New in Isabelle2005 (October 2005)
3609 ----------------------------------
3613 * Theory headers: the new header syntax for Isar theories is
3616 imports <theory1> ... <theoryN>
3617 uses <file1> ... <fileM>
3620 where the 'uses' part is optional. The previous syntax
3622 theory <name> = <theory1> + ... + <theoryN>:
3624 will disappear in the next release. Use isatool fixheaders to convert
3625 existing theory files. Note that there is no change in ancient
3626 non-Isar theories now, but these will disappear soon.
3628 * Theory loader: parent theories can now also be referred to via
3629 relative and absolute paths.
3631 * Command 'find_theorems' searches for a list of criteria instead of a
3632 list of constants. Known criteria are: intro, elim, dest, name:string,
3633 simp:term, and any term. Criteria can be preceded by '-' to select
3634 theorems that do not match. Intro, elim, dest select theorems that
3635 match the current goal, name:s selects theorems whose fully qualified
3636 name contain s, and simp:term selects all simplification rules whose
3637 lhs match term. Any other term is interpreted as pattern and selects
3638 all theorems matching the pattern. Available in ProofGeneral under
3639 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3641 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3643 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3644 matching the current goal as introduction rule and not having "HOL."
3645 in their name (i.e. not being defined in theory HOL).
3647 * Command 'thms_containing' has been discontinued in favour of
3648 'find_theorems'; INCOMPATIBILITY.
3650 * Communication with Proof General is now 8bit clean, which means that
3651 Unicode text in UTF-8 encoding may be used within theory texts (both
3652 formal and informal parts). Cf. option -U of the Isabelle Proof
3653 General interface. Here are some simple examples (cf. src/HOL/ex):
3655 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3656 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3658 * Improved efficiency of the Simplifier and, to a lesser degree, the
3659 Classical Reasoner. Typical big applications run around 2 times
3663 *** Document preparation ***
3665 * Commands 'display_drafts' and 'print_drafts' perform simple output
3666 of raw sources. Only those symbols that do not require additional
3667 LaTeX packages (depending on comments in isabellesym.sty) are
3668 displayed properly, everything else is left verbatim. isatool display
3669 and isatool print are used as front ends (these are subject to the
3670 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3672 * Command tags control specific markup of certain regions of text,
3673 notably folding and hiding. Predefined tags include "theory" (for
3674 theory begin and end), "proof" for proof commands, and "ML" for
3675 commands involving ML code; the additional tags "visible" and
3676 "invisible" are unused by default. Users may give explicit tag
3677 specifications in the text, e.g. ''by %invisible (auto)''. The
3678 interpretation of tags is determined by the LaTeX job during document
3679 preparation: see option -V of isatool usedir, or options -n and -t of
3680 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3683 Several document versions may be produced at the same time via isatool
3684 usedir (the generated index.html will link all of them). Typical
3685 specifications include ''-V document=theory,proof,ML'' to present
3686 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3687 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3688 these parts without any formal replacement text. The Isabelle site
3689 default settings produce ''document'' and ''outline'' versions as
3692 * Several new antiquotations:
3694 @{term_type term} prints a term with its type annotated;
3696 @{typeof term} prints the type of a term;
3698 @{const const} is the same as @{term const}, but checks that the
3699 argument is a known logical constant;
3701 @{term_style style term} and @{thm_style style thm} print a term or
3702 theorem applying a "style" to it
3706 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3707 definitions, equations, inequations etc., 'concl' printing only the
3708 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3709 to print the specified premise. TermStyle.add_style provides an ML
3710 interface for introducing further styles. See also the "LaTeX Sugar"
3711 document practical applications. The ML antiquotation prints
3712 type-checked ML expressions verbatim.
3714 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3715 and 'text' support optional locale specification '(in loc)', which
3716 specifies the default context for interpreting antiquotations. For
3717 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3719 * Option 'locale=NAME' of antiquotations specifies an alternative
3720 context interpreting the subsequent argument. For example: @{thm
3721 [locale=lattice] inf_assoc}.
3723 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3726 * Proper output of antiquotations for theory commands involving a
3727 proof context (such as 'locale' or 'theorem (in loc) ...').
3729 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3730 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3732 * isatool usedir: new option -C (default true) controls whether option
3733 -D should include a copy of the original document directory; -C false
3734 prevents unwanted effects such as copying of administrative CVS data.
3739 * Considerably improved version of 'constdefs' command. Now performs
3740 automatic type-inference of declared constants; additional support for
3741 local structure declarations (cf. locales and HOL records), see also
3742 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3743 sequential dependencies of definitions within a single 'constdefs'
3744 section; moreover, the declared name needs to be an identifier. If
3745 all fails, consider to fall back on 'consts' and 'defs' separately.
3747 * Improved indexed syntax and implicit structures. First of all,
3748 indexed syntax provides a notational device for subscripted
3749 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3750 expressions. Secondly, in a local context with structure
3751 declarations, number indexes \<^sub>n or the empty index (default
3752 number 1) refer to a certain fixed variable implicitly; option
3753 show_structs controls printing of implicit structures. Typical
3754 applications of these concepts involve record types and locales.
3756 * New command 'no_syntax' removes grammar declarations (and
3757 translations) resulting from the given syntax specification, which is
3758 interpreted in the same manner as for the 'syntax' command.
3760 * 'Advanced' translation functions (parse_translation etc.) may depend
3761 on the signature of the theory context being presently used for
3762 parsing/printing, see also isar-ref manual.
3764 * Improved 'oracle' command provides a type-safe interface to turn an
3765 ML expression of type theory -> T -> term into a primitive rule of
3766 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3767 is already included here); see also FOL/ex/IffExample.thy;
3770 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3771 before); "cI" is no longer bound, use "c.intro" instead.
3772 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3773 axclasses vs. locales.
3775 * Improved internal renaming of symbolic identifiers -- attach primes
3776 instead of base 26 numbers.
3778 * New flag show_question_marks controls printing of leading question
3779 marks in schematic variable names.
3781 * In schematic variable names, *any* symbol following \<^isub> or
3782 \<^isup> is now treated as part of the base name. For example, the
3783 following works without printing of awkward ".0" indexes:
3785 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3788 * Inner syntax includes (*(*nested*) comments*).
3790 * Pretty printer now supports unbreakable blocks, specified in mixfix
3791 annotations as "(00...)".
3793 * Clear separation of logical types and nonterminals, where the latter
3794 may only occur in 'syntax' specifications or type abbreviations.
3795 Before that distinction was only partially implemented via type class
3796 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3797 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3798 exotic syntax specifications may require further adaption
3799 (e.g. Cube/Cube.thy).
3801 * Removed obsolete type class "logic", use the top sort {} instead.
3802 Note that non-logical types should be declared as 'nonterminals'
3803 rather than 'types'. INCOMPATIBILITY for new object-logic
3806 * Attributes 'induct' and 'cases': type or set names may now be
3807 locally fixed variables as well.
3809 * Simplifier: can now control the depth to which conditional rewriting
3810 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3813 * Simplifier: simplification procedures may now take the current
3814 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3815 interface), which is very useful for calling the Simplifier
3816 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3817 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3818 low-level mk_simproc no longer applies Logic.varify internally, to
3819 allow for use in a context of fixed variables.
3821 * thin_tac now works even if the assumption being deleted contains !!
3822 or ==>. More generally, erule now works even if the major premise of
3823 the elimination rule contains !! or ==>.
3825 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3827 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3828 from Pure, which contains all common declarations already. Both
3829 theories are defined via plain Isabelle/Isar .thy files.
3830 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3831 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3832 use isatool fixcpure to adapt your theory and ML sources.
3834 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3835 selections of theorems in named facts via index ranges.
3837 * 'print_theorems': in theory mode, really print the difference
3838 wrt. the last state (works for interactive theory development only),
3839 in proof mode print all local facts (cf. 'print_facts');
3841 * 'hide': option '(open)' hides only base names.
3843 * More efficient treatment of intermediate checkpoints in interactive
3846 * Code generator is now invoked via code_module (incremental code
3847 generation) and code_library (modular code generation, ML structures
3848 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3849 must be quoted when used as identifiers.
3851 * New 'value' command for reading, evaluating and printing terms using
3852 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3853 quoted when used as identifier.
3858 * New commands for the interpretation of locale expressions in
3859 theories (1), locales (2) and proof contexts (3). These generate
3860 proof obligations from the expression specification. After the
3861 obligations have been discharged, theorems of the expression are added
3862 to the theory, target locale or proof context. The synopsis of the
3863 commands is a follows:
3865 (1) interpretation expr inst
3866 (2) interpretation target < expr
3867 (3) interpret expr inst
3869 Interpretation in theories and proof contexts require a parameter
3870 instantiation of terms from the current context. This is applied to
3871 specifications and theorems of the interpreted expression.
3872 Interpretation in locales only permits parameter renaming through the
3873 locale expression. Interpretation is smart in that interpretations
3874 that are active already do not occur in proof obligations, neither are
3875 instantiated theorems stored in duplicate. Use 'print_interps' to
3876 inspect active interpretations of a particular locale. For details,
3877 see the Isar Reference manual. Examples can be found in
3878 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3880 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3881 'interpret' instead.
3883 * New context element 'constrains' for adding type constraints to
3886 * Context expressions: renaming of parameters with syntax
3889 * Locale declaration: 'includes' disallowed.
3891 * Proper static binding of attribute syntax -- i.e. types / terms /
3892 facts mentioned as arguments are always those of the locale definition
3893 context, independently of the context of later invocations. Moreover,
3894 locale operations (renaming and type / term instantiation) are applied
3895 to attribute arguments as expected.
3897 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3898 actual attributes; rare situations may require Attrib.attribute to
3899 embed those attributes into Attrib.src that lack concrete syntax.
3900 Attribute implementations need to cooperate properly with the static
3901 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3902 Attrib.XXX_thm etc. already do the right thing without further
3903 intervention. Only unusual applications -- such as "where" or "of"
3904 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3905 on the context and the facts involved -- may have to assign parsed
3906 values to argument tokens explicitly.
3908 * Changed parameter management in theorem generation for long goal
3909 statements with 'includes'. INCOMPATIBILITY: produces a different
3910 theorem statement in rare situations.
3912 * Locale inspection command 'print_locale' omits notes elements. Use
3913 'print_locale!' to have them included in the output.
3918 * Provers/hypsubst.ML: improved version of the subst method, for
3919 single-step rewriting: it now works in bound variable contexts. New is
3920 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3921 rewrite a different subterm than the original subst method, which is
3922 still available as 'simplesubst'.
3924 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3927 * Provers/trancl.ML: new transitivity reasoner for transitive and
3928 reflexive-transitive closure of relations.
3930 * Provers/blast.ML: new reference depth_limit to make blast's depth
3931 limit (previously hard-coded with a value of 20) user-definable.
3933 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3934 is peformed already. Object-logics merely need to finish their
3935 initial simpset configuration as before. INCOMPATIBILITY.
3940 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3943 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3945 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3946 and x-symbol; use option '-m epsilon' to get it actually printed.
3947 Moreover, the mathematically important symbolic identifier \<epsilon>
3948 becomes available as variable, constant etc. INCOMPATIBILITY,
3950 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3951 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3952 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3953 support corresponding Isar calculations.
3955 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3958 * theory SetInterval: changed the syntax for open intervals:
3967 The old syntax is still supported but will disappear in the next
3968 release. For conversion use the following Emacs search and replace
3969 patterns (these are not perfect but work quite well):
3971 {)\([^\.]*\)\.\. -> {\1<\.\.}
3972 \.\.\([^(}]*\)(} -> \.\.<\1}
3974 * Theory Commutative_Ring (in Library): method comm_ring for proving
3975 equalities in commutative rings; method 'algebra' provides a generic
3978 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3979 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3980 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3983 Some new syntax forms are available:
3985 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3986 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3987 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3988 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3990 The latter form "\<Sum>x < k. e" used to be based on a separate
3991 function "Summation", which has been discontinued.
3993 * theory Finite_Set: in structured induction proofs, the insert case
3994 is now 'case (insert x F)' instead of the old counterintuitive 'case
3997 * The 'refute' command has been extended to support a much larger
3998 fragment of HOL, including axiomatic type classes, constdefs and
3999 typedefs, inductive datatypes and recursion.
4001 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4002 Requires zChaff with proof generation to be installed. See
4003 HOL/ex/SAT_Examples.thy for examples.
4005 * Datatype induction via method 'induct' now preserves the name of the
4006 induction variable. For example, when proving P(xs::'a list) by
4007 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4008 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4009 in unstructured proof scripts.
4011 * Reworked implementation of records. Improved scalability for
4012 records with many fields, avoiding performance problems for type
4013 inference. Records are no longer composed of nested field types, but
4014 of nested extension types. Therefore the record type only grows linear
4015 in the number of extensions and not in the number of fields. The
4016 top-level (users) view on records is preserved. Potential
4017 INCOMPATIBILITY only in strange cases, where the theory depends on the
4018 old record representation. The type generated for a record is called
4019 <record_name>_ext_type.
4021 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4022 proofs triggered by a record definition or a simproc (if
4023 quick_and_dirty is enabled). Definitions of large records can take
4026 New simproc record_upd_simproc for simplification of multiple record
4027 updates enabled by default. Moreover, trivial updates are also
4028 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4029 occasionally, since simplification is more powerful by default.
4031 * typedef: proper support for polymorphic sets, which contain extra
4032 type-variables in the term.
4034 * Simplifier: automatically reasons about transitivity chains
4035 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4036 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4037 old proofs break occasionally as simplification may now solve more
4038 goals than previously.
4040 * Simplifier: converts x <= y into x = y if assumption y <= x is
4041 present. Works for all partial orders (class "order"), in particular
4042 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4045 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4046 bound variable or a constant then the let is unfolded. Otherwise
4047 first a is simplified to b, and then f b is simplified to g. If
4048 possible we abstract b from g arriving at "let x = b in h x",
4049 otherwise we unfold the let and arrive at g. The simproc can be
4050 enabled/disabled by the reference use_let_simproc. Potential
4051 INCOMPATIBILITY since simplification is more powerful by default.
4053 * Classical reasoning: the meson method now accepts theorems as arguments.
4055 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4056 jobs to provide advice on the provability of subgoals.
4058 * Theory OrderedGroup and Ring_and_Field: various additions and
4059 improvements to faciliate calculations involving equalities and
4062 The following theorems have been eliminated or modified
4065 abs_eq now named abs_of_nonneg
4066 abs_of_ge_0 now named abs_of_nonneg
4067 abs_minus_eq now named abs_of_nonpos
4068 imp_abs_id now named abs_of_nonneg
4069 imp_abs_neg_id now named abs_of_nonpos
4070 mult_pos now named mult_pos_pos
4071 mult_pos_le now named mult_nonneg_nonneg
4072 mult_pos_neg_le now named mult_nonneg_nonpos
4073 mult_pos_neg2_le now named mult_nonneg_nonpos2
4074 mult_neg now named mult_neg_neg
4075 mult_neg_le now named mult_nonpos_nonpos
4077 * The following lemmas in Ring_and_Field have been added to the simplifier:
4080 not_square_less_zero
4082 The following lemmas have been deleted from Real/RealPow:
4092 * Theory Parity: added rules for simplifying exponents.
4096 The following theorems have been eliminated or modified
4099 list_all_Nil now named list_all.simps(1)
4100 list_all_Cons now named list_all.simps(2)
4101 list_all_conv now named list_all_iff
4102 set_mem_eq now named mem_iff
4104 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4105 asymptotic "big O" calculations. See the notes in BigO.thy.
4110 * Theory RealDef: better support for embedding natural numbers and
4111 integers in the reals.
4113 The following theorems have been eliminated or modified
4116 exp_ge_add_one_self now requires no hypotheses
4117 real_of_int_add reversed direction of equality (use [symmetric])
4118 real_of_int_minus reversed direction of equality (use [symmetric])
4119 real_of_int_diff reversed direction of equality (use [symmetric])
4120 real_of_int_mult reversed direction of equality (use [symmetric])
4122 * Theory RComplete: expanded support for floor and ceiling functions.
4124 * Theory Ln is new, with properties of the natural logarithm
4126 * Hyperreal: There is a new type constructor "star" for making
4127 nonstandard types. The old type names are now type synonyms:
4131 hcomplex = complex star
4133 * Hyperreal: Many groups of similarly-defined constants have been
4134 replaced by polymorphic versions (INCOMPATIBILITY):
4136 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4138 starset <-- starsetNat, starsetC
4139 *s* <-- *sNat*, *sc*
4140 starset_n <-- starsetNat_n, starsetC_n
4141 *sn* <-- *sNatn*, *scn*
4142 InternalSets <-- InternalNatSets, InternalCSets
4144 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4145 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4146 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4147 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4148 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4150 * Hyperreal: Many type-specific theorems have been removed in favor of
4151 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4153 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4154 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4155 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4156 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4157 right_minus <-- hypreal_add_minus
4158 left_minus <-- {hypreal,hcomplex}_add_minus_left
4159 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4160 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4161 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4162 mult_1_right <-- hcomplex_mult_one_right
4163 mult_zero_left <-- hcomplex_mult_zero_left
4164 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4165 right_distrib <-- hypnat_add_mult_distrib2
4166 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4167 right_inverse <-- hypreal_mult_inverse
4168 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4169 order_refl <-- {hypreal,hypnat}_le_refl
4170 order_trans <-- {hypreal,hypnat}_le_trans
4171 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4172 order_less_le <-- {hypreal,hypnat}_less_le
4173 linorder_linear <-- {hypreal,hypnat}_le_linear
4174 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4175 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4176 add_nonneg_nonneg <-- hypreal_le_add_order
4178 * Hyperreal: Separate theorems having to do with type-specific
4179 versions of constants have been merged into theorems that apply to the
4180 new polymorphic constants (INCOMPATIBILITY):
4182 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4183 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4184 STAR_Un <-- {STAR,NatStar,STARC}_Un
4185 STAR_Int <-- {STAR,NatStar,STARC}_Int
4186 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4187 STAR_subset <-- {STAR,NatStar,STARC}_subset
4188 STAR_mem <-- {STAR,NatStar,STARC}_mem
4189 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4190 STAR_diff <-- {STAR,STARC}_diff
4191 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4192 STARC_hcomplex_of_complex}_image_subset
4193 starset_n_Un <-- starset{Nat,C}_n_Un
4194 starset_n_Int <-- starset{Nat,C}_n_Int
4195 starset_n_Compl <-- starset{Nat,C}_n_Compl
4196 starset_n_diff <-- starset{Nat,C}_n_diff
4197 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4198 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4199 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4200 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4201 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4202 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4203 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4204 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4205 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4206 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4207 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4208 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4209 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4210 starfun_diff <-- starfun{C,RC,CR}_diff
4211 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4212 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4213 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4214 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4215 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4216 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4217 starfun_Id <-- starfunC_Id
4218 starfun_approx <-- starfun{Nat,CR}_approx
4219 starfun_capprox <-- starfun{C,RC}_capprox
4220 starfun_abs <-- starfunNat_rabs
4221 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4222 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4223 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4224 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4225 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4226 starfun_add_approx <-- starfunCR_add_approx
4227 starfun_inverse_inverse <-- starfunC_inverse_inverse
4228 starfun_divide <-- starfun{C,CR,RC}_divide
4229 starfun_n <-- starfun{Nat,C}_n
4230 starfun_n_mult <-- starfun{Nat,C}_n_mult
4231 starfun_n_add <-- starfun{Nat,C}_n_add
4232 starfun_n_add_minus <-- starfunNat_n_add_minus
4233 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4234 starfun_n_minus <-- starfun{Nat,C}_n_minus
4235 starfun_n_eq <-- starfun{Nat,C}_n_eq
4237 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4238 star_n_minus <-- {hypreal,hcomplex}_minus
4239 star_n_diff <-- {hypreal,hcomplex}_diff
4240 star_n_mult <-- {hypreal,hcomplex}_mult
4241 star_n_inverse <-- {hypreal,hcomplex}_inverse
4242 star_n_le <-- {hypreal,hypnat}_le
4243 star_n_less <-- {hypreal,hypnat}_less
4244 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4245 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4246 star_n_abs <-- hypreal_hrabs
4247 star_n_divide <-- hcomplex_divide
4249 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4250 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4251 star_of_diff <-- hypreal_of_real_diff
4252 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4253 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4254 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4255 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4256 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4257 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4258 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4259 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4260 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4261 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4262 star_of_number_of <-- {hypreal,hcomplex}_number_of
4263 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4264 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4265 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4266 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4267 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4268 star_of_power <-- hypreal_of_real_power
4269 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4271 * Hyperreal: new method "transfer" that implements the transfer
4272 principle of nonstandard analysis. With a subgoal that mentions
4273 nonstandard types like "'a star", the command "apply transfer"
4274 replaces it with an equivalent one that mentions only standard types.
4275 To be successful, all free variables must have standard types; non-
4276 standard variables must have explicit universal quantifiers.
4278 * Hyperreal: A theory of Taylor series.
4283 * Discontinued special version of 'constdefs' (which used to support
4284 continuous functions) in favor of the general Pure one with full
4287 * New simplification procedure for solving continuity conditions; it
4288 is much faster on terms with many nested lambda abstractions (cubic
4289 instead of exponential time).
4291 * New syntax for domain package: selector names are now optional.
4292 Parentheses should be omitted unless argument is lazy, for example:
4294 domain 'a stream = cons "'a" (lazy "'a stream")
4296 * New command 'fixrec' for defining recursive functions with pattern
4297 matching; defining multiple functions with mutual recursion is also
4298 supported. Patterns may include the constants cpair, spair, up, sinl,
4299 sinr, or any data constructor defined by the domain package. The given
4300 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4301 syntax and examples.
4303 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4304 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4305 but the proof obligation additionally includes an admissibility
4306 requirement. The packages generate instances of class cpo or pcpo,
4307 with continuity and strictness theorems for Rep and Abs.
4309 * HOLCF: Many theorems have been renamed according to a more standard naming
4310 scheme (INCOMPATIBILITY):
4312 foo_inject: "foo$x = foo$y ==> x = y"
4313 foo_eq: "(foo$x = foo$y) = (x = y)"
4314 foo_less: "(foo$x << foo$y) = (x << y)"
4315 foo_strict: "foo$UU = UU"
4316 foo_defined: "... ==> foo$x ~= UU"
4317 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4322 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4323 including the First Isomorphism Theorem (on quotienting by the kernel
4326 * ZF/Simplifier: install second copy of type solver that actually
4327 makes use of TC rules declared to Isar proof contexts (or locales);
4328 the old version is still required for ML proof scripts.
4333 * Converted to Isar theory format; use locales instead of axiomatic
4339 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4342 * Pure/library.ML no longer defines its own option datatype, but uses
4343 that of the SML basis, which has constructors NONE and SOME instead of
4344 None and Some, as well as exception Option.Option instead of OPTION.
4345 The functions the, if_none, is_some, is_none have been adapted
4346 accordingly, while Option.map replaces apsome.
4348 * Pure/library.ML: the exception LIST has been given up in favour of
4349 the standard exceptions Empty and Subscript, as well as
4350 Library.UnequalLengths. Function like Library.hd and Library.tl are
4351 superceded by the standard hd and tl functions etc.
4353 A number of basic list functions are no longer exported to the ML
4354 toplevel, as they are variants of predefined functions. The following
4355 suggests how one can translate existing code:
4357 rev_append xs ys = List.revAppend (xs, ys)
4358 nth_elem (i, xs) = List.nth (xs, i)
4359 last_elem xs = List.last xs
4360 flat xss = List.concat xss
4361 seq fs = List.app fs
4362 partition P xs = List.partition P xs
4363 mapfilter f xs = List.mapPartial f xs
4365 * Pure/library.ML: several combinators for linear functional
4366 transformations, notably reverse application and composition:
4369 (x, y) |-> f f #-> g
4371 * Pure/library.ML: introduced/changed precedence of infix operators:
4373 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4375 infix 3 o oo ooo oooo;
4376 infix 4 ~~ upto downto;
4378 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4381 * Pure/library.ML: natural list combinators fold, fold_rev, and
4382 fold_map support linear functional transformations and nesting. For
4385 fold f [x1, ..., xN] y =
4386 y |> f x1 |> ... |> f xN
4388 (fold o fold) f [xs1, ..., xsN] y =
4389 y |> fold f xs1 |> ... |> fold f xsN
4391 fold f [x1, ..., xN] =
4394 (fold o fold) f [xs1, ..., xsN] =
4395 fold f xs1 #> ... #> fold f xsN
4397 * Pure/library.ML: the following selectors on type 'a option are
4400 the: 'a option -> 'a (*partial*)
4401 these: 'a option -> 'a where 'a = 'b list
4402 the_default: 'a -> 'a option -> 'a
4403 the_list: 'a option -> 'a list
4405 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4406 basic operations for association lists, following natural argument
4407 order; moreover the explicit equality predicate passed here avoids
4408 potentially expensive polymorphic runtime equality checks.
4409 The old functions may be expressed as follows:
4411 assoc = uncurry (AList.lookup (op =))
4412 assocs = these oo AList.lookup (op =)
4413 overwrite = uncurry (AList.update (op =)) o swap
4415 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4417 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4418 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4420 replacing make_keylist and keyfilter (occassionally used)
4423 make_keylist = AList.make
4424 keyfilter = AList.find (op =)
4426 * eq_fst and eq_snd now take explicit equality parameter, thus
4427 avoiding eqtypes. Naive rewrites:
4429 eq_fst = eq_fst (op =)
4430 eq_snd = eq_snd (op =)
4432 * Removed deprecated apl and apr (rarely used).
4435 apl (n, op) =>>= curry op n
4436 apr (op, m) =>>= fn n => op (n, m)
4438 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4439 provides a reasonably efficient light-weight implementation of sets as
4442 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4443 few new operations; existing lookup and update are now curried to
4444 follow natural argument order (for use with fold etc.);
4445 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4447 * Pure/General: output via the Isabelle channels of
4448 writeln/warning/error etc. is now passed through Output.output, with a
4449 hook for arbitrary transformations depending on the print_mode
4450 (cf. Output.add_mode -- the first active mode that provides a output
4451 function wins). Already formatted output may be embedded into further
4452 text via Output.raw; the result of Pretty.string_of/str_of and derived
4453 functions (string_of_term/cterm/thm etc.) is already marked raw to
4454 accommodate easy composition of diagnostic messages etc. Programmers
4455 rarely need to care about Output.output or Output.raw at all, with
4456 some notable exceptions: Output.output is required when bypassing the
4457 standard channels (writeln etc.), or in token translations to produce
4458 properly formatted results; Output.raw is required when capturing
4459 already output material that will eventually be presented to the user
4460 a second time. For the default print mode, both Output.output and
4461 Output.raw have no effect.
4463 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4464 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4465 cumulative results are displayed at the end of a batch session.
4467 * Pure/General: File.sysify_path and File.quote_sysify path have been
4468 replaced by File.platform_path and File.shell_path (with appropriate
4469 hooks). This provides a clean interface for unusual systems where the
4470 internal and external process view of file names are different.
4472 * Pure: more efficient orders for basic syntactic entities: added
4473 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4474 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4475 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4476 orders now -- potential INCOMPATIBILITY for code that depends on a
4477 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4478 Library.sort_strings on result).
4480 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4481 fold_types traverse types/terms from left to right, observing natural
4482 argument order. Supercedes previous foldl_XXX versions, add_frees,
4483 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4485 * Pure: name spaces have been refined, with significant changes of the
4486 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4487 to extern(_table). The plain name entry path is superceded by a
4488 general 'naming' context, which also includes the 'policy' to produce
4489 a fully qualified name and external accesses of a fully qualified
4490 name; NameSpace.extend is superceded by context dependent
4491 Sign.declare_name. Several theory and proof context operations modify
4492 the naming context. Especially note Theory.restore_naming and
4493 ProofContext.restore_naming to get back to a sane state; note that
4494 Theory.add_path is no longer sufficient to recover from
4495 Theory.absolute_path in particular.
4497 * Pure: new flags short_names (default false) and unique_names
4498 (default true) for controlling output of qualified names. If
4499 short_names is set, names are printed unqualified. If unique_names is
4500 reset, the name prefix is reduced to the minimum required to achieve
4501 the original result when interning again, even if there is an overlap
4502 with earlier declarations.
4504 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4505 now 'extend', and 'merge' gets an additional Pretty.pp argument
4506 (useful for printing error messages). INCOMPATIBILITY.
4508 * Pure: major reorganization of the theory context. Type Sign.sg and
4509 Theory.theory are now identified, referring to the universal
4510 Context.theory (see Pure/context.ML). Actual signature and theory
4511 content is managed as theory data. The old code and interfaces were
4512 spread over many files and structures; the new arrangement introduces
4513 considerable INCOMPATIBILITY to gain more clarity:
4515 Context -- theory management operations (name, identity, inclusion,
4516 parents, ancestors, merge, etc.), plus generic theory data;
4518 Sign -- logical signature and syntax operations (declaring consts,
4519 types, etc.), plus certify/read for common entities;
4521 Theory -- logical theory operations (stating axioms, definitions,
4522 oracles), plus a copy of logical signature operations (consts,
4523 types, etc.); also a few basic management operations (Theory.copy,
4526 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4527 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4528 for convenience -- they merely return the theory.
4530 * Pure: type Type.tsig is superceded by theory in most interfaces.
4532 * Pure: the Isar proof context type is already defined early in Pure
4533 as Context.proof (note that ProofContext.context and Proof.context are
4534 aliases, where the latter is the preferred name). This enables other
4535 Isabelle components to refer to that type even before Isar is present.
4537 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4538 typeK, constK, axiomK, oracleK), but provide explicit operations for
4539 any of these kinds. For example, Sign.intern typeK is now
4540 Sign.intern_type, Theory.hide_space Sign.typeK is now
4541 Theory.hide_types. Also note that former
4542 Theory.hide_classes/types/consts are now
4543 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4544 internalize their arguments! INCOMPATIBILITY.
4546 * Pure: get_thm interface (of PureThy and ProofContext) expects
4547 datatype thmref (with constructors Name and NameSelection) instead of
4548 plain string -- INCOMPATIBILITY;
4550 * Pure: cases produced by proof methods specify options, where NONE
4551 means to remove case bindings -- INCOMPATIBILITY in
4554 * Pure: the following operations retrieve axioms or theorems from a
4555 theory node or theory hierarchy, respectively:
4557 Theory.axioms_of: theory -> (string * term) list
4558 Theory.all_axioms_of: theory -> (string * term) list
4559 PureThy.thms_of: theory -> (string * thm) list
4560 PureThy.all_thms_of: theory -> (string * thm) list
4562 * Pure: print_tac now outputs the goal through the trace channel.
4564 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4565 Reference Toplevel.debug (default false) controls detailed printing
4566 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4567 controls execution profiling -- set to 1 for time and 2 for space
4568 (both increase the runtime).
4570 * Isar session: The initial use of ROOT.ML is now always timed,
4571 i.e. the log will show the actual process times, in contrast to the
4572 elapsed wall-clock time that the outer shell wrapper produces.
4574 * Simplifier: improved handling of bound variables (nameless
4575 representation, avoid allocating new strings). Simprocs that invoke
4576 the Simplifier recursively should use Simplifier.inherit_bounds to
4577 avoid local name clashes. Failure to do so produces warnings
4578 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4579 for further details.
4581 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4582 bindings for all theorems stored within a given theory; this may help
4583 in porting non-Isar theories to Isar ones, while keeping ML proof
4584 scripts for the time being.
4586 * ML operator HTML.with_charset specifies the charset begin used for
4587 generated HTML files. For example:
4589 HTML.with_charset "utf-8" use_thy "Hebrew";
4590 HTML.with_charset "utf-8" use_thy "Chinese";
4595 * Allow symlinks to all proper Isabelle executables (Isabelle,
4596 isabelle, isatool etc.).
4598 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4599 isatool doc, isatool mkdir, display_drafts etc.).
4601 * isatool usedir: option -f allows specification of the ML file to be
4602 used by Isabelle; default is ROOT.ML.
4604 * New isatool version outputs the version identifier of the Isabelle
4605 distribution being used.
4607 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4608 (containing Boolean satisfiability problems) into Isabelle/HOL
4613 New in Isabelle2004 (April 2004)
4614 --------------------------------
4618 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4619 Replaces linorder.ML.
4621 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4622 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4623 (\<a>...\<z>), are now considered normal letters, and can therefore
4624 be used anywhere where an ASCII letter (a...zA...Z) has until
4625 now. COMPATIBILITY: This obviously changes the parsing of some
4626 terms, especially where a symbol has been used as a binder, say
4627 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4628 as an identifier. Fix it by inserting a space around former
4629 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4630 existing theory and ML files.
4632 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4634 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4635 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4636 a normal (but invisible) letter. For multiple letter subscripts repeat
4637 \<^isub> like this: x\<^isub>1\<^isub>2.
4639 * Pure: There are now sub-/superscripts that can span more than one
4640 character. Text between \<^bsub> and \<^esub> is set in subscript in
4641 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4642 superscript. The new control characters are not identifier parts.
4644 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4645 content of "..." to the latex file instead of \isacntrl... . The "..."
4646 may consist of any printable characters excluding the end bracket >.
4648 * Pure: Using new Isar command "finalconsts" (or the ML functions
4649 Theory.add_finals or Theory.add_finals_i) it is now possible to
4650 declare constants "final", which prevents their being given a definition
4651 later. It is useful for constants whose behaviour is fixed axiomatically
4652 rather than definitionally, such as the meta-logic connectives.
4654 * Pure: 'instance' now handles general arities with general sorts
4655 (i.e. intersections of classes),
4657 * Presentation: generated HTML now uses a CSS style sheet to make layout
4658 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4659 It can be changed to alter the colors/layout of generated pages.
4664 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4665 cut_tac, subgoal_tac and thin_tac:
4666 - Now understand static (Isar) contexts. As a consequence, users of Isar
4667 locales are no longer forced to write Isar proof scripts.
4668 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4670 - INCOMPATIBILITY: names of variables to be instantiated may no
4671 longer be enclosed in quotes. Instead, precede variable name with `?'.
4672 This is consistent with the instantiation attribute "where".
4674 * Attributes "where" and "of":
4675 - Now take type variables of instantiated theorem into account when reading
4676 the instantiation string. This fixes a bug that caused instantiated
4677 theorems to have too special types in some circumstances.
4678 - "where" permits explicit instantiations of type variables.
4680 * Calculation commands "moreover" and "also" no longer interfere with
4681 current facts ("this"), admitting arbitrary combinations with "then"
4685 - Goal statements involving the context element "includes" no longer
4686 generate theorems with internal delta predicates (those ending on
4687 "_axioms") in the premise.
4688 Resolve particular premise with <locale>.intro to obtain old form.
4689 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4690 specification and "includes" elements in goal statement.
4691 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4692 [intro?] and [elim?] (respectively) by default.
4693 - Experimental command for instantiation of locales in proof contexts:
4694 instantiate <label>[<attrs>]: <loc>
4695 Instantiates locale <loc> and adds all its theorems to the current context
4696 taking into account their attributes. Label and attrs are optional
4697 modifiers, like in theorem declarations. If present, names of
4698 instantiated theorems are qualified with <label>, and the attributes
4699 <attrs> are applied after any attributes these theorems might have already.
4700 If the locale has assumptions, a chained fact of the form
4701 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4702 are derived. The command does not support old-style locales declared
4703 with "locale (open)".
4704 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4706 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4712 * Proof import: new image HOL4 contains the imported library from
4713 the HOL4 system with about 2500 theorems. It is imported by
4714 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4715 can be used like any other Isabelle image. See
4716 HOL/Import/HOL/README for more information.
4719 - Much improved handling of linear and partial orders.
4720 Reasoners for linear and partial orders are set up for type classes
4721 "linorder" and "order" respectively, and are added to the default simpset
4722 as solvers. This means that the simplifier can build transitivity chains
4723 to solve goals from the assumptions.
4724 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4725 of blast or auto after simplification become unnecessary because the goal
4726 is solved by simplification already.
4728 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4729 all proved in axiomatic type classes for semirings, rings and fields.
4732 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4733 now formalized using the Ring_and_Field theory mentioned above.
4734 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4735 than before, because now they are set up once in a generic manner.
4736 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4737 Look for the general versions in Ring_and_Field (and Power if they concern
4740 * Type "rat" of the rational numbers is now available in HOL-Complex.
4743 - Record types are now by default printed with their type abbreviation
4744 instead of the list of all field types. This can be configured via
4745 the reference "print_record_type_abbr".
4746 - Simproc "record_upd_simproc" for simplification of multiple updates added
4747 (not enabled by default).
4748 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4749 EX x. x = sel r to True (not enabled by default).
4750 - Tactic "record_split_simp_tac" to split and simplify records added.
4752 * 'specification' command added, allowing for definition by
4753 specification. There is also an 'ax_specification' command that
4754 introduces the new constants axiomatically.
4756 * arith(_tac) is now able to generate counterexamples for reals as well.
4758 * HOL-Algebra: new locale "ring" for non-commutative rings.
4760 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4761 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4763 * HOL-Matrix: a first theory for matrices in HOL with an application of
4764 matrix theory to linear programming.
4766 * Unions and Intersections:
4767 The latex output syntax of UN and INT has been changed
4768 from "\Union x \in A. B" to "\Union_{x \in A} B"
4769 i.e. the index formulae has become a subscript.
4770 Similarly for "\Union x. B", and for \Inter instead of \Union.
4772 * Unions and Intersections over Intervals:
4773 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4774 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4775 like in normal math, and corresponding versions for < and for intersection.
4777 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4778 lexicographic dictonary ordering has been added as "lexord".
4780 * ML: the legacy theory structures Int and List have been removed. They had
4781 conflicted with ML Basis Library structures having the same names.
4783 * 'refute' command added to search for (finite) countermodels. Only works
4784 for a fragment of HOL. The installation of an external SAT solver is
4785 highly recommended. See "HOL/Refute.thy" for details.
4787 * 'quickcheck' command: Allows to find counterexamples by evaluating
4788 formulae under an assignment of free variables to random values.
4789 In contrast to 'refute', it can deal with inductive datatypes,
4790 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4796 * Streams now come with concatenation and are part of the HOLCF image
4800 New in Isabelle2003 (May 2003)
4801 ------------------------------
4805 * Provers/simplifier:
4807 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4808 Assumptions are now subject to complete mutual simplification,
4809 not just from left to right. The simplifier now preserves
4810 the order of assumptions.
4812 Potential INCOMPATIBILITY:
4814 -- simp sometimes diverges where the old version did
4815 not, e.g. invoking simp on the goal
4817 [| P (f x); y = x; f x = f y |] ==> Q
4819 now gives rise to the infinite reduction sequence
4821 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4823 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4826 -- Tactics combining classical reasoner and simplification (such as auto)
4827 are also affected by this change, because many of them rely on
4828 simp. They may sometimes diverge as well or yield a different numbers
4829 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4830 in case of problems. Sometimes subsequent calls to the classical
4831 reasoner will fail because a preceeding call to the simplifier too
4832 eagerly simplified the goal, e.g. deleted redundant premises.
4834 - The simplifier trace now shows the names of the applied rewrite rules
4836 - You can limit the number of recursive invocations of the simplifier
4837 during conditional rewriting (where the simplifie tries to solve the
4838 conditions before applying the rewrite rule):
4839 ML "simp_depth_limit := n"
4840 where n is an integer. Thus you can force termination where previously
4841 the simplifier would diverge.
4843 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4845 - No longer aborts on failed congruence proof. Instead, the
4846 congruence is ignored.
4848 * Pure: New generic framework for extracting programs from constructive
4849 proofs. See HOL/Extraction.thy for an example instantiation, as well
4850 as HOL/Extraction for some case studies.
4852 * Pure: The main goal of the proof state is no longer shown by default, only
4853 the subgoals. This behaviour is controlled by a new flag.
4854 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4855 (ML: Proof.show_main_goal).
4857 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4858 rules whose conclusion matches subgoal 1:
4859 PG menu: Isabelle/Isar -> Show me -> matching rules
4860 The rules are ordered by how closely they match the subgoal.
4861 In particular, rules that solve a subgoal outright are displayed first
4862 (or rather last, the way they are printed).
4863 (ML: ProofGeneral.print_intros())
4865 * Pure: New flag trace_unify_fail causes unification to print
4866 diagnostic information (PG: in trace buffer) when it fails. This is
4867 useful for figuring out why single step proofs like rule, erule or
4870 * Pure: Locale specifications now produce predicate definitions
4871 according to the body of text (covering assumptions modulo local
4872 definitions); predicate "loc_axioms" covers newly introduced text,
4873 while "loc" is cumulative wrt. all included locale expressions; the
4874 latter view is presented only on export into the global theory
4875 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4876 on the old view without predicates;
4878 * Pure: predefined locales "var" and "struct" are useful for sharing
4879 parameters (as in CASL, for example); just specify something like
4880 ``var x + var y + struct M'' as import;
4882 * Pure: improved thms_containing: proper indexing of facts instead of
4883 raw theorems; check validity of results wrt. current name space;
4884 include local facts of proof configuration (also covers active
4885 locales), cover fixed variables in index; may use "_" in term
4886 specification; an optional limit for the number of printed facts may
4887 be given (the default is 40);
4889 * Pure: disallow duplicate fact bindings within new-style theory files
4892 * Provers: improved induct method: assumptions introduced by case
4893 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4894 the goal statement); "foo" still refers to all facts collectively;
4896 * Provers: the function blast.overloaded has been removed: all constants
4897 are regarded as potentially overloaded, which improves robustness in exchange
4898 for slight decrease in efficiency;
4900 * Provers/linorder: New generic prover for transitivity reasoning over
4901 linear orders. Note: this prover is not efficient!
4903 * Isar: preview of problems to finish 'show' now produce an error
4904 rather than just a warning (in interactive mode);
4911 - Produces a counter example if it cannot prove a goal.
4912 Note that the counter example may be spurious if the goal is not a formula
4913 of quantifier-free linear arithmetic.
4914 In ProofGeneral the counter example appears in the trace buffer.
4916 - Knows about div k and mod k where k is a numeral of type nat or int.
4918 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4919 linear arithmetic fails. This takes account of quantifiers and divisibility.
4920 Presburger arithmetic can also be called explicitly via presburger(_tac).
4922 * simp's arithmetic capabilities have been enhanced a bit: it now
4923 takes ~= in premises into account (by performing a case split);
4925 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4926 are distributed over a sum of terms;
4928 * New tactic "trans_tac" and method "trans" instantiate
4929 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4932 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4933 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4935 * 'typedef' command has new option "open" to suppress the set
4938 * functions Min and Max on finite sets have been introduced (theory
4941 * attribute [symmetric] now works for relations as well; it turns
4942 (x,y) : R^-1 into (y,x) : R, and vice versa;
4944 * induct over a !!-quantified statement (say !!x1..xn):
4945 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4947 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4948 %x. None. Warning: empty_def now refers to the previously hidden definition
4951 * Algebra: formalization of classical algebra. Intended as base for
4952 any algebraic development in Isabelle. Currently covers group theory
4953 (up to Sylow's theorem) and ring theory (Universal Property of
4954 Univariate Polynomials). Contributions welcome;
4956 * GroupTheory: deleted, since its material has been moved to Algebra;
4958 * Complex: new directory of the complex numbers with numeric constants,
4959 nonstandard complex numbers, and some complex analysis, standard and
4960 nonstandard (Jacques Fleuriot);
4962 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4964 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4967 * Real/HahnBanach: updated and adapted to locales;
4969 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4972 * UNITY: added the Meier-Sanders theory of progress sets;
4974 * MicroJava: bytecode verifier and lightweight bytecode verifier
4975 as abstract algorithms, instantiated to the JVM;
4977 * Bali: Java source language formalization. Type system, operational
4978 semantics, axiomatic semantics. Supported language features:
4979 classes, interfaces, objects,virtual methods, static methods,
4980 static/instance fields, arrays, access modifiers, definite
4981 assignment, exceptions.
4986 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4989 * Main ZF: virtually all theories converted to new-style format;
4994 * Pure: Tactic.prove provides sane interface for internal proofs;
4995 omits the infamous "standard" operation, so this is more appropriate
4996 than prove_goalw_cterm in many situations (e.g. in simprocs);
4998 * Pure: improved error reporting of simprocs;
5000 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5004 *** Document preparation ***
5006 * uses \par instead of \\ for line breaks in theory text. This may
5007 shift some page breaks in large documents. To get the old behaviour
5008 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5010 * minimized dependencies of isabelle.sty and isabellesym.sty on
5013 * \<euro> now needs package babel/greek instead of marvosym (which
5016 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5021 New in Isabelle2002 (March 2002)
5022 --------------------------------
5024 *** Document preparation ***
5026 * greatly simplified document preparation setup, including more
5027 graceful interpretation of isatool usedir -i/-d/-D options, and more
5028 instructive isatool mkdir; users should basically be able to get
5029 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5030 users may run a separate document processing stage manually like this:
5031 "isatool usedir -D output HOL Test && isatool document Test/output";
5033 * theory dependency graph may now be incorporated into documents;
5034 isatool usedir -g true will produce session_graph.eps/.pdf for use
5035 with \includegraphics of LaTeX;
5037 * proper spacing of consecutive markup elements, especially text
5038 blocks after section headings;
5040 * support bold style (for single symbols only), input syntax is like
5041 this: "\<^bold>\<alpha>" or "\<^bold>A";
5043 * \<bullet> is now output as bold \cdot by default, which looks much
5044 better in printed text;
5046 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5047 note that these symbols are currently unavailable in Proof General /
5048 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5050 * isatool latex no longer depends on changed TEXINPUTS, instead
5051 isatool document copies the Isabelle style files to the target
5057 * Pure/Provers: improved proof by cases and induction;
5058 - 'case' command admits impromptu naming of parameters (such as
5060 - 'induct' method divinates rule instantiation from the inductive
5061 claim; no longer requires excessive ?P bindings for proper
5062 instantiation of cases;
5063 - 'induct' method properly enumerates all possibilities of set/type
5064 rules; as a consequence facts may be also passed through *type*
5065 rules without further ado;
5066 - 'induct' method now derives symbolic cases from the *rulified*
5067 rule (before it used to rulify cases stemming from the internal
5068 atomized version); this means that the context of a non-atomic
5069 statement becomes is included in the hypothesis, avoiding the
5070 slightly cumbersome show "PROP ?case" form;
5071 - 'induct' may now use elim-style induction rules without chaining
5072 facts, using ``missing'' premises from the goal state; this allows
5073 rules stemming from inductive sets to be applied in unstructured
5074 scripts, while still benefitting from proper handling of non-atomic
5075 statements; NB: major inductive premises need to be put first, all
5076 the rest of the goal is passed through the induction;
5077 - 'induct' proper support for mutual induction involving non-atomic
5078 rule statements (uses the new concept of simultaneous goals, see
5080 - append all possible rule selections, but only use the first
5081 success (no backtracking);
5082 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5083 - undeclared rule case names default to numbers 1, 2, 3, ...;
5084 - added 'print_induct_rules' (covered by help item in recent Proof
5086 - moved induct/cases attributes to Pure, methods to Provers;
5087 - generic method setup instantiated for FOL and HOL;
5089 * Pure: support multiple simultaneous goal statements, for example
5090 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5091 meta-level mechanism, this acts as if several individual goals had
5092 been stated separately; in particular common proof methods need to be
5093 repeated in order to cover all claims; note that a single elimination
5094 step is *not* sufficient to establish the two conjunctions, so this
5097 assume "A & B" then have A and B .. (*".." fails*)
5099 better use "obtain" in situations as above; alternative refer to
5100 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5102 * Pure: proper integration with ``locales''; unlike the original
5103 version by Florian Kammller, Isar locales package high-level proof
5104 contexts rather than raw logical ones (e.g. we admit to include
5105 attributes everywhere); operations on locales include merge and
5106 rename; support for implicit arguments (``structures''); simultaneous
5107 type-inference over imports and text; see also HOL/ex/Locales.thy for
5110 * Pure: the following commands have been ``localized'', supporting a
5111 target locale specification "(in name)": 'lemma', 'theorem',
5112 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5113 stored both within the locale and at the theory level (exported and
5114 qualified by the locale name);
5116 * Pure: theory goals may now be specified in ``long'' form, with
5117 ad-hoc contexts consisting of arbitrary locale elements. for example
5118 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5119 definitions may be given, too); the result is a meta-level rule with
5120 the context elements being discharged in the obvious way;
5122 * Pure: new proof command 'using' allows to augment currently used
5123 facts after a goal statement ('using' is syntactically analogous to
5124 'apply', but acts on the goal's facts only); this allows chained facts
5125 to be separated into parts given before and after a claim, as in
5126 ``from a and b have C using d and e <proof>'';
5128 * Pure: renamed "antecedent" case to "rule_context";
5130 * Pure: new 'judgment' command records explicit information about the
5131 object-logic embedding (used by several tools internally); no longer
5132 use hard-wired "Trueprop";
5134 * Pure: added 'corollary' command;
5136 * Pure: fixed 'token_translation' command;
5138 * Pure: removed obsolete 'exported' attribute;
5140 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5141 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5142 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5144 * Pure: method 'atomize' presents local goal premises as object-level
5145 statements (atomic meta-level propositions); setup controlled via
5146 rewrite rules declarations of 'atomize' attribute; example
5147 application: 'induct' method with proper rule statements in improper
5150 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5151 now consider the syntactic context of assumptions, giving a better
5152 chance to get type-inference of the arguments right (this is
5153 especially important for locales);
5155 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5158 * Pure/obtain: the formal conclusion "thesis", being marked as
5159 ``internal'', may no longer be reference directly in the text;
5160 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5163 * Pure: generic 'sym' attribute which declares a rule both as pure
5164 'elim?' and for the 'symmetric' operation;
5166 * Pure: marginal comments ``--'' may now occur just anywhere in the
5167 text; the fixed correlation with particular command syntax has been
5170 * Pure: new method 'rules' is particularly well-suited for proof
5171 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5172 but often produces more compact proof terms with less detours;
5174 * Pure/Provers/classical: simplified integration with pure rule
5175 attributes and methods; the classical "intro?/elim?/dest?"
5176 declarations coincide with the pure ones; the "rule" method no longer
5177 includes classically swapped intros; "intro" and "elim" methods no
5178 longer pick rules from the context; also got rid of ML declarations
5179 AddXIs/AddXEs/AddXDs; all of this has some potential for
5182 * Provers/classical: attribute 'swapped' produces classical inversions
5183 of introduction rules;
5185 * Provers/simplifier: 'simplified' attribute may refer to explicit
5186 rules instead of full simplifier context; 'iff' attribute handles
5189 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5191 * HOL: 'recdef' now fails on unfinished automated proofs, use
5192 "(permissive)" option to recover old behavior;
5194 * HOL: 'inductive' no longer features separate (collective) attributes
5195 for 'intros' (was found too confusing);
5197 * HOL: properly declared induction rules less_induct and
5203 * HOL: moved over to sane numeral syntax; the new policy is as
5206 - 0 and 1 are polymorphic constants, which are defined on any
5207 numeric type (nat, int, real etc.);
5209 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5210 binary representation internally;
5212 - type nat has special constructor Suc, and generally prefers Suc 0
5213 over 1::nat and Suc (Suc 0) over 2::nat;
5215 This change may cause significant problems of INCOMPATIBILITY; here
5216 are some hints on converting existing sources:
5218 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5219 entities, so expressions involving "-" (unary or binary minus) need
5220 to be spaced properly;
5222 - existing occurrences of "1" may need to be constraint "1::nat" or
5223 even replaced by Suc 0; similar for old "2";
5225 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5227 - remove all special provisions on numerals in proofs;
5229 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5230 representation (depends on bin_arith_simps in the default context);
5232 * HOL: symbolic syntax for x^2 (numeral 2);
5234 * HOL: the class of all HOL types is now called "type" rather than
5235 "term"; INCOMPATIBILITY, need to adapt references to this type class
5236 in axclass/classes, instance/arities, and (usually rare) occurrences
5237 in typings (of consts etc.); internally the class is called
5238 "HOL.type", ML programs should refer to HOLogic.typeS;
5240 * HOL/record package improvements:
5241 - new derived operations "fields" to build a partial record section,
5242 "extend" to promote a fixed record to a record scheme, and
5243 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5244 declared as simp by default;
5245 - shared operations ("more", "fields", etc.) now need to be always
5246 qualified) --- potential INCOMPATIBILITY;
5247 - removed "make_scheme" operations (use "make" with "extend") --
5249 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5250 - provides cases/induct rules for use with corresponding Isar
5251 methods (for concrete records, record schemes, concrete more
5252 parts, and schematic more parts -- in that order);
5253 - internal definitions directly based on a light-weight abstract
5254 theory of product types over typedef rather than datatype;
5256 * HOL: generic code generator for generating executable ML code from
5257 specifications; specific support for HOL constructs such as inductive
5258 datatypes and sets, as well as recursive functions; can be invoked
5259 via 'generate_code' theory section;
5261 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5263 * HOL: consolidated and renamed several theories. In particular:
5264 Ord.thy has been absorbed into HOL.thy
5265 String.thy has been absorbed into List.thy
5267 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5268 (beware of argument permutation!);
5270 * HOL: linorder_less_split superseded by linorder_cases;
5272 * HOL/List: "nodups" renamed to "distinct";
5274 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5275 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5276 - Ex_def has changed, now need to use some_eq_ex
5278 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5279 in this (rare) case use:
5281 delSWrapper "split_all_tac"
5282 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5284 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5287 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5288 Isabelle's type classes, ^ on functions and relations has too general
5289 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5290 necessary to attach explicit type constraints;
5292 * HOL/Relation: the prefix name of the infix "O" has been changed from
5293 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5294 renamed accordingly (eg "compI" -> "rel_compI").
5296 * HOL: syntax translations now work properly with numerals and records
5299 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5300 of "lam" -- INCOMPATIBILITY;
5302 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5303 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5304 renamed "Product_Type.unit";
5306 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5308 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5309 the "cases" method);
5311 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5314 * HOL/IMP: updated and converted to new-style theory format; several
5315 parts turned into readable document, with proper Isar proof texts and
5316 some explanations (by Gerwin Klein);
5318 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5320 * HOL-Hyperreal is now a logic image;
5325 * Isar: consts/constdefs supports mixfix syntax for continuous
5328 * Isar: domain package adapted to new-style theory format, e.g. see
5331 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5332 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5333 lift.induct_tac, always use UU instead of Undef;
5335 * HOLCF/IMP: updated and converted to new-style theory;
5340 * Isar: proper integration of logic-specific tools and packages,
5341 including theory commands '(co)inductive', '(co)datatype',
5342 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5343 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5345 * theory Main no longer includes AC; for the Axiom of Choice, base
5346 your theory on Main_ZFC;
5348 * the integer library now covers quotients and remainders, with many
5349 laws relating division to addition, multiplication, etc.;
5351 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5352 typeless version of the formalism;
5354 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5357 * ZF/Induct: new directory for examples of inductive definitions,
5358 including theory Multiset for multiset orderings; converted to
5359 new-style theory format;
5361 * ZF: many new theorems about lists, ordinals, etc.;
5366 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5367 variable proof controls level of detail: 0 = no proofs (only oracle
5368 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5369 also ref manual for further ML interfaces;
5371 * Pure/axclass: removed obsolete ML interface
5372 goal_subclass/goal_arity;
5374 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5375 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5376 separate tokens, so expressions involving minus need to be spaced
5379 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5380 rather than "infixl" or "infixr";
5382 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5383 sort constraint specifications in type inference; e.g. "x::_::foo"
5384 ensures that the type of "x" is of sort "foo" (but not necessarily a
5387 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5388 control output of nested => (types); the default behavior is
5391 * Pure/syntax: builtin parse translation for "_constify" turns valued
5392 tokens into AST constants;
5394 * Pure/syntax: prefer later declarations of translations and print
5395 translation functions; potential INCOMPATIBILITY: need to reverse
5396 multiple declarations for same syntax element constant;
5398 * Pure/show_hyps reset by default (in accordance to existing Isar
5401 * Provers/classical: renamed addaltern to addafter, addSaltern to
5404 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5407 * system: tested support for MacOS X; should be able to get Isabelle +
5408 Proof General to work in a plain Terminal after installing Poly/ML
5409 (e.g. from the Isabelle distribution area) and GNU bash alone
5410 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5411 support requires further installations, e.g. from
5412 http://fink.sourceforge.net/);
5414 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5416 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5417 of 40 MB), cf. ML_OPTIONS;
5419 * system: Proof General keywords specification is now part of the
5420 Isabelle distribution (see etc/isar-keywords.el);
5422 * system: support for persistent Proof General sessions (refrain from
5423 outdating all loaded theories on startup); user may create writable
5424 logic images like this: ``isabelle -q HOL Test'';
5426 * system: smart selection of Isabelle process versus Isabelle
5427 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5428 run both "isabelle" and "Isabelle" even if file names are badly
5429 damaged (executable inspects the case of the first letter of its own
5430 name); added separate "isabelle-process" and "isabelle-interface";
5432 * system: refrain from any attempt at filtering input streams; no
5433 longer support ``8bit'' encoding of old isabelle font, instead proper
5434 iso-latin characters may now be used; the related isatools
5435 "symbolinput" and "nonascii" have disappeared as well;
5437 * system: removed old "xterm" interface (the print modes "xterm" and
5438 "xterm_color" are still available for direct use in a suitable
5443 New in Isabelle99-2 (February 2001)
5444 -----------------------------------
5446 *** Overview of INCOMPATIBILITIES ***
5448 * HOL: please note that theories in the Library and elsewhere often use the
5449 new-style (Isar) format; to refer to their theorems in an ML script you must
5450 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5452 * HOL: inductive package no longer splits induction rule aggressively,
5453 but only as far as specified by the introductions given; the old
5454 format may be recovered via ML function complete_split_rule or attribute
5455 'split_rule (complete)';
5457 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5458 gfp_Tarski to gfp_unfold;
5460 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5462 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5463 relation); infix "^^" has been renamed "``"; infix "``" has been
5464 renamed "`"; "univalent" has been renamed "single_valued";
5466 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5469 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5471 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5473 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5474 consequence, it is no longer monotonic wrt. the local goal context
5475 (which is now passed through the inductive cases);
5477 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5478 \<gg> to \<ggreater>;
5481 *** Document preparation ***
5483 * \isabellestyle{NAME} selects version of Isabelle output (currently
5484 available: are "it" for near math-mode best-style output, "sl" for
5485 slanted text style, and "tt" for plain type-writer; if no
5486 \isabellestyle command is given, output is according to slanted
5489 * support sub/super scripts (for single symbols only), input syntax is
5490 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5492 * some more standard symbols; see Appendix A of the system manual for
5493 the complete list of symbols defined in isabellesym.sty;
5495 * improved isabelle style files; more abstract symbol implementation
5496 (should now use \isamath{...} and \isatext{...} in custom symbol
5499 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5500 state; Note that presentation of goal states does not conform to
5501 actual human-readable proof documents. Please do not include goal
5502 states into document output unless you really know what you are doing!
5504 * proper indentation of antiquoted output with proportional LaTeX
5507 * no_document ML operator temporarily disables LaTeX document
5510 * isatool unsymbolize tunes sources for plain ASCII communication;
5515 * Pure: Isar now suffers initial goal statements to contain unbound
5516 schematic variables (this does not conform to actual readable proof
5517 documents, due to unpredictable outcome and non-compositional proof
5518 checking); users who know what they are doing may use schematic goals
5519 for Prolog-style synthesis of proven results;
5521 * Pure: assumption method (an implicit finishing) now handles actual
5524 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5525 initial goal, declare "that" only as Pure intro (only for single
5526 steps); the "that" rule assumption may now be involved in implicit
5527 finishing, thus ".." becomes a feasible for trivial obtains;
5529 * Pure: default proof step now includes 'intro_classes'; thus trivial
5530 instance proofs may be performed by "..";
5532 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5535 * Pure: more robust selection of calculational rules;
5537 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5538 rule (as well as the assumption rule);
5540 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5541 lemmas, using the graph browser tool;
5543 * Pure: predict failure of "show" in interactive mode;
5545 * Pure: 'thms_containing' now takes actual terms as arguments;
5547 * HOL: improved method 'induct' --- now handles non-atomic goals
5548 (potential INCOMPATIBILITY); tuned error handling;
5550 * HOL: cases and induct rules now provide explicit hints about the
5551 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5552 any remaining facts are inserted into the goal verbatim;
5554 * HOL: local contexts (aka cases) may now contain term bindings as
5555 well; the 'cases' and 'induct' methods new provide a ?case binding for
5556 the result to be shown in each case;
5558 * HOL: added 'recdef_tc' command;
5560 * isatool convert assists in eliminating legacy ML scripts;
5565 * HOL/Library: a collection of generic theories to be used together
5566 with main HOL; the theory loader path already includes this directory
5567 by default; the following existing theories have been moved here:
5568 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5569 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5571 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5572 modelling and verification task performed in Isabelle/HOL +
5573 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5575 * HOL/Algebra: special summation operator SUM no longer exists, it has
5576 been replaced by setsum; infix 'assoc' now has priority 50 (like
5577 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5578 'domain', this makes the theory consistent with mathematical
5581 * HOL basics: added overloaded operations "inverse" and "divide"
5582 (infix "/"), syntax for generic "abs" operation, generic summation
5585 * HOL/typedef: simplified package, provide more useful rules (see also
5588 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5589 now expressed as a proper nested rule (old-style tactic scripts may
5590 require atomize_strip_tac to cope with non-atomic premises);
5592 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5593 to "split_conv" (old name still available for compatibility);
5595 * HOL: improved concrete syntax for strings (e.g. allows translation
5596 rules with string literals);
5598 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5599 and Fleuriot's mechanization of analysis, including the transcendental
5600 functions for the reals;
5602 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5607 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5608 "lam" is displayed as TWO lambda-symbols
5610 * CTT: theory Main now available, containing everything (that is, Bool
5616 * Pure: the Simplifier has been implemented properly as a derived rule
5617 outside of the actual kernel (at last!); the overall performance
5618 penalty in practical applications is about 50%, while reliability of
5619 the Isabelle inference kernel has been greatly improved;
5621 * print modes "brackets" and "no_brackets" control output of nested =>
5622 (types) and ==> (props); the default behaviour is "brackets";
5624 * Provers: fast_tac (and friends) now handle actual object-logic rules
5625 as assumptions as well;
5627 * system: support Poly/ML 4.0;
5629 * system: isatool install handles KDE version 1 or 2;
5633 New in Isabelle99-1 (October 2000)
5634 ----------------------------------
5636 *** Overview of INCOMPATIBILITIES ***
5638 * HOL: simplification of natural numbers is much changed; to partly
5639 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5640 issue the following ML commands:
5642 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5643 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5645 * HOL: simplification no longer dives into case-expressions; this is
5646 controlled by "t.weak_case_cong" for each datatype t;
5648 * HOL: nat_less_induct renamed to less_induct;
5650 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5651 fixsome to patch .thy and .ML sources automatically;
5653 select_equality -> some_equality
5654 select_eq_Ex -> some_eq_ex
5655 selectI2EX -> someI2_ex
5658 select1_equality -> some1_equality
5659 Eps_sym_eq -> some_sym_eq_trivial
5660 Eps_eq -> some_eq_trivial
5662 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5664 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5667 * HOL: the recursion equations generated by 'recdef' are now called
5668 f.simps instead of f.rules;
5670 * HOL: qed_spec_mp now also handles bounded ALL as well;
5672 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5673 sometimes be needed;
5675 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5677 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5679 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5680 product is now "<*>" instead of "Times"; the lexicographic product is
5681 now "<*lex*>" instead of "**";
5683 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5684 of main HOL, but was unused); better use HOL's datatype package;
5686 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5687 the old syntax may be recovered as follows:
5690 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5691 (infixl "\\<oplus>" 100)
5693 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5695 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5696 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5699 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5700 changed from A/r to A//r;
5702 * ZF: new treatment of arithmetic (nat & int) may break some old
5705 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5706 rulify -> rule_format, elimify -> elim_format, ...);
5708 * Isar/Provers: intro/elim/dest attributes changed; renamed
5709 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5710 should have to change intro!! to intro? only); replaced "delrule" by
5713 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5715 * Provers: strengthened force_tac by using new first_best_tac;
5717 * LaTeX document preparation: several changes of isabelle.sty (see
5721 *** Document preparation ***
5723 * formal comments (text blocks etc.) in new-style theories may now
5724 contain antiquotations of thm/prop/term/typ/text to be presented
5725 according to latex print mode; concrete syntax is like this:
5726 @{term[show_types] "f(x) = a + x"};
5728 * isatool mkdir provides easy setup of Isabelle session directories,
5729 including proper document sources;
5731 * generated LaTeX sources are now deleted after successful run
5732 (isatool document -c); may retain a copy somewhere else via -D option
5735 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5736 style files, achieving self-contained LaTeX sources and simplifying
5739 * old-style theories now produce (crude) LaTeX output as well;
5741 * browser info session directories are now self-contained (may be put
5742 on WWW server seperately); improved graphs of nested sessions; removed
5743 graph for 'all sessions';
5745 * several improvements in isabelle style files; \isabellestyle{it}
5746 produces fake math mode output; \isamarkupheader is now \section by
5747 default; see lib/texinputs/isabelle.sty etc.;
5752 * Isar/Pure: local results and corresponding term bindings are now
5753 subject to Hindley-Milner polymorphism (similar to ML); this
5754 accommodates incremental type-inference very nicely;
5756 * Isar/Pure: new derived language element 'obtain' supports
5757 generalized existence reasoning;
5759 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5760 support accumulation of results, without applying any rules yet;
5761 useful to collect intermediate results without explicit name
5762 references, and for use with transitivity rules with more than 2
5765 * Isar/Pure: scalable support for case-analysis type proofs: new
5766 'case' language element refers to local contexts symbolically, as
5767 produced by certain proof methods; internally, case names are attached
5768 to theorems as "tags";
5770 * Isar/Pure: theory command 'hide' removes declarations from
5771 class/type/const name spaces;
5773 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5774 indicate potential overloading;
5776 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5778 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5779 "{a,b,c}" instead of {a,b,c};
5781 * Isar/Pure now provides its own version of intro/elim/dest
5782 attributes; useful for building new logics, but beware of confusion
5783 with the version in Provers/classical;
5785 * Isar/Pure: the local context of (non-atomic) goals is provided via
5786 case name 'antecedent';
5788 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5789 to the current context is now done automatically);
5791 * Isar/Pure: theory command 'method_setup' provides a simple interface
5792 for definining proof methods in ML;
5794 * Isar/Provers: intro/elim/dest attributes changed; renamed
5795 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5796 most cases, one should have to change intro!! to intro? only);
5797 replaced "delrule" by "rule del";
5799 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5800 'symmetric' attribute (the latter supercedes [RS sym]);
5802 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5803 method modifier); 'simp' method: 'only:' modifier removes loopers as
5804 well (including splits);
5806 * Isar/Provers: Simplifier and Classical methods now support all kind
5807 of modifiers used in the past, including 'cong', 'iff', etc.
5809 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5810 of Simplifier and Classical reasoner);
5812 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5813 now support named cases; major packages (inductive, datatype, primrec,
5814 recdef) support case names and properly name parameters;
5816 * Isar/HOL: new transitivity rules for substitution in inequalities --
5817 monotonicity conditions are extracted to be proven at end of
5820 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5823 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5824 split_if split_if_asm; datatype package provides theorems foo.splits =
5825 foo.split foo.split_asm for each datatype;
5827 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5828 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5829 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5830 use "(cases (simplified))" method in proper proof texts);
5832 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5834 * Isar: names of theorems etc. may be natural numbers as well;
5836 * Isar: 'pr' command: optional arguments for goals_limit and
5837 ProofContext.prems_limit; no longer prints theory contexts, but only
5840 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5841 additional print modes to be specified; e.g. "pr(latex)" will print
5842 proof state according to the Isabelle LaTeX style;
5844 * Isar: improved support for emulating tactic scripts, including proof
5845 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5846 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5847 (for HOL datatypes);
5849 * Isar: simplified (more robust) goal selection of proof methods: 1st
5850 goal, all goals, or explicit goal specifier (tactic emulation); thus
5851 'proof method scripts' have to be in depth-first order;
5853 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5855 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5856 should instead use individual commands for printing items
5857 (print_commands, print_methods etc.);
5859 * Isar: added 'nothing' --- the empty list of theorems;
5864 * HOL/MicroJava: formalization of a fragment of Java, together with a
5865 corresponding virtual machine and a specification of its bytecode
5866 verifier and a lightweight bytecode verifier, including proofs of
5867 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5868 Cornelia Pusch (see also the homepage of project Bali at
5869 http://isabelle.in.tum.de/Bali/);
5871 * HOL/Algebra: new theory of rings and univariate polynomials, by
5874 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5875 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5878 * HOL/Lattice: fundamental concepts of lattice theory and order
5879 structures, including duals, properties of bounds versus algebraic
5880 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5881 Theorem for complete lattices etc.; may also serve as a demonstration
5882 for abstract algebraic reasoning using axiomatic type classes, and
5883 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5885 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5888 * HOL/IMPP: extension of IMP with local variables and mutually
5889 recursive procedures, by David von Oheimb;
5891 * HOL/Lambda: converted into new-style theory and document;
5893 * HOL/ex/Multiquote: example of multiple nested quotations and
5894 anti-quotations -- basically a generalized version of de-Bruijn
5895 representation; very useful in avoiding lifting of operations;
5897 * HOL/record: added general record equality rule to simpset; fixed
5898 select-update simplification procedure to handle extended records as
5899 well; admit "r" as field name;
5901 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5902 other numeric types and also as the identity of groups, rings, etc.;
5904 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5905 Types nat and int belong to this axclass;
5907 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5908 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5909 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5910 two terms #m*u and #n*u are replaced by #(m+n)*u
5911 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5912 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5913 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5915 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5916 powerful prover for predicate logic but knows nothing of clasets; see
5917 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5919 * HOL: new version of "case_tac" subsumes both boolean case split and
5920 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5921 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5923 * HOL: simplification no longer dives into case-expressions: only the
5924 selector expression is simplified, but not the remaining arms; to
5925 enable full simplification of case-expressions for datatype t, you may
5926 remove t.weak_case_cong from the simpset, either globally (Delcongs
5927 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5929 * HOL/recdef: the recursion equations generated by 'recdef' for
5930 function 'f' are now called f.simps instead of f.rules; if all
5931 termination conditions are proved automatically, these simplification
5932 rules are added to the simpset, as in primrec; rules may be named
5933 individually as well, resulting in a separate list of theorems for
5936 * HOL/While is a new theory that provides a while-combinator. It
5937 permits the definition of tail-recursive functions without the
5938 provision of a termination measure. The latter is necessary once the
5939 invariant proof rule for while is applied.
5941 * HOL: new (overloaded) notation for the set of elements below/above
5942 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5944 * HOL: theorems impI, allI, ballI bound as "strip";
5946 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5947 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5948 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5950 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5952 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5953 main HOL, but was unused);
5955 * HOL: fewer consts declared as global (e.g. have to refer to
5956 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5958 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5959 in case of overlap with user translations (e.g. judgements over
5960 tuples); (note that the underlying logical represenation is still
5966 * ZF: simplification automatically cancels common terms in arithmetic
5967 expressions over nat and int;
5969 * ZF: new treatment of nat to minimize type-checking: all operators
5970 coerce their operands to a natural number using the function natify,
5971 making the algebraic laws unconditional;
5973 * ZF: as above, for int: operators coerce their operands to an integer
5974 using the function intify;
5976 * ZF: the integer library now contains many of the usual laws for the
5977 orderings, including $<=, and monotonicity laws for $+ and $*;
5979 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5982 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5983 to the simplifier and classical reasoner simultaneously;
5988 * Provers: blast_tac now handles actual object-logic rules as
5989 assumptions; note that auto_tac uses blast_tac internally as well;
5991 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5992 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5994 * Provers: delrules now handles destruct rules as well (no longer need
5995 explicit make_elim);
5997 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5998 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5999 use instead the strong form,
6000 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6001 in HOL, FOL and ZF the function cla_make_elim will create such rules
6002 from destruct-rules;
6004 * Provers: Simplifier.easy_setup provides a fast path to basic
6005 Simplifier setup for new object-logics;
6007 * Pure: AST translation rules no longer require constant head on LHS;
6009 * Pure: improved name spaces: ambiguous output is qualified; support
6010 for hiding of names;
6012 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6013 XSYMBOL_HOME; no longer need to do manual configuration in most
6016 * system: compression of ML heaps images may now be controlled via -c
6017 option of isabelle and isatool usedir (currently only observed by
6020 * system: isatool installfonts may handle X-Symbol fonts as well (very
6021 useful for remote X11);
6023 * system: provide TAGS file for Isabelle sources;
6025 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6028 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6029 timing flag supersedes proof_timing and Toplevel.trace;
6031 * ML: new combinators |>> and |>>> for incremental transformations
6032 with secondary results (e.g. certain theory extensions):
6034 * ML: PureThy.add_defs gets additional argument to indicate potential
6035 overloading (usually false);
6037 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6042 New in Isabelle99 (October 1999)
6043 --------------------------------
6045 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6047 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6048 are no longer simplified. (This allows the simplifier to unfold recursive
6049 functional programs.) To restore the old behaviour, declare
6051 Delcongs [if_weak_cong];
6053 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6056 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6058 * HOL/datatype: mutual_induct_tac no longer exists --
6059 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6061 * HOL/typedef: fixed type inference for representing set; type
6062 arguments now have to occur explicitly on the rhs as type constraints;
6064 * ZF: The con_defs part of an inductive definition may no longer refer
6065 to constants declared in the same theory;
6067 * HOL, ZF: the function mk_cases, generated by the inductive
6068 definition package, has lost an argument. To simplify its result, it
6069 uses the default simpset instead of a supplied list of theorems.
6071 * HOL/List: the constructors of type list are now Nil and Cons;
6073 * Simplifier: the type of the infix ML functions
6074 setSSolver addSSolver setSolver addSolver
6075 is now simpset * solver -> simpset where `solver' is a new abstract type
6076 for packaging solvers. A solver is created via
6077 mk_solver: string -> (thm list -> int -> tactic) -> solver
6078 where the string argument is only a comment.
6083 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6084 decision procedure for linear arithmetic. Currently it is used for
6085 types `nat', `int', and `real' in HOL (see below); it can, should and
6086 will be instantiated for other types and logics as well.
6088 * The simplifier now accepts rewrite rules with flexible heads, eg
6089 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6090 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6096 * New Isabelle/Isar subsystem provides an alternative to traditional
6097 tactical theorem proving; together with the ProofGeneral/isar user
6098 interface it offers an interactive environment for developing human
6099 readable proof documents (Isar == Intelligible semi-automated
6100 reasoning); for further information see isatool doc isar-ref,
6101 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6103 * improved and simplified presentation of theories: better HTML markup
6104 (including colors), graph views in several sizes; isatool usedir now
6105 provides a proper interface for user theories (via -P option); actual
6106 document preparation based on (PDF)LaTeX is available as well (for
6107 new-style theories only); see isatool doc system for more information;
6109 * native support for Proof General, both for classic Isabelle and
6112 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6113 using the graph browser tool;
6115 * Isabelle manuals now also available as PDF;
6117 * theory loader rewritten from scratch (may not be fully
6118 bug-compatible); old loadpath variable has been replaced by show_path,
6119 add_path, del_path, reset_path functions; new operations such as
6120 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6123 * improved isatool install: option -k creates KDE application icon,
6124 option -p DIR installs standalone binaries;
6126 * added ML_PLATFORM setting (useful for cross-platform installations);
6127 more robust handling of platform specific ML images for SML/NJ;
6129 * the settings environment is now statically scoped, i.e. it is never
6130 created again in sub-processes invoked from isabelle, isatool, or
6133 * path element specification '~~' refers to '$ISABELLE_HOME';
6135 * in locales, the "assumes" and "defines" parts may be omitted if
6138 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6141 * new print_mode "HTML";
6143 * new flag show_tags controls display of tags of theorems (which are
6144 basically just comments that may be attached by some tools);
6146 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6147 mode and goal output format:
6149 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6151 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6153 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6154 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6156 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6158 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6160 * function bind_thms stores lists of theorems (cf. bind_thm);
6162 * new shorthand tactics ftac, eatac, datac, fatac;
6164 * qed (and friends) now accept "" as result name; in that case the
6165 theorem is not stored, but proper checks and presentation of the
6168 * theorem database now also indexes constants "Trueprop", "all",
6169 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6174 ** HOL arithmetic **
6176 * There are now decision procedures for linear arithmetic over nat and
6179 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6180 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6181 are treated as atomic; subformulae not involving type `nat' or `int'
6182 are ignored; quantified subformulae are ignored unless they are
6183 positive universal or negative existential. The tactic has to be
6184 invoked by hand and can be a little bit slow. In particular, the
6185 running time is exponential in the number of occurrences of `min' and
6186 `max', and `-' on `nat'.
6188 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6189 (negated) (in)equalities among the premises and the conclusion into
6190 account (i.e. no compound formulae) and does not know about `min' and
6191 `max', and `-' on `nat'. It is fast and is used automatically by the
6194 NB: At the moment, these decision procedures do not cope with mixed
6195 nat/int formulae where the two parts interact, such as `m < n ==>
6198 * HOL/Numeral provides a generic theory of numerals (encoded
6199 efficiently as bit strings); setup for types nat/int/real is in place;
6200 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6201 int, existing theories and proof scripts may require a few additional
6204 * integer division and remainder can now be performed on constant
6207 * many properties of integer multiplication, division and remainder
6210 * An interface to the Stanford Validity Checker (SVC) is available through the
6211 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6212 are proved automatically. SVC must be installed separately, and its results
6213 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6214 invocation of the underlying oracle). For SVC see
6215 http://verify.stanford.edu/SVC
6217 * IsaMakefile: the HOL-Real target now builds an actual image;
6222 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6223 (in Isabelle/Isar) -- by Gertrud Bauer;
6225 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6226 analysis for assembly languages with subtypes;
6228 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6229 -- avoids syntactic ambiguities and treats state, transition, and
6230 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6231 changed syntax and (many) tactics;
6233 * HOL/inductive: Now also handles more general introduction rules such
6234 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6235 theorems are now maintained within the theory (maintained via the
6238 * HOL/datatype: Now also handles arbitrarily branching datatypes
6239 (using function types) such as
6241 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6243 * HOL/record: record_simproc (part of the default simpset) takes care
6244 of selectors applied to updated records; record_split_tac is no longer
6245 part of the default claset; update_defs may now be removed from the
6246 simpset in many cases; COMPATIBILITY: old behavior achieved by
6248 claset_ref () := claset() addSWrapper record_split_wrapper;
6249 Delsimprocs [record_simproc]
6251 * HOL/typedef: fixed type inference for representing set; type
6252 arguments now have to occur explicitly on the rhs as type constraints;
6254 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6255 names rather than an ML expression;
6257 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6258 supplied later. Program schemes can be defined, such as
6259 "While B C s = (if B s then While B C (C s) else s)"
6260 where the well-founded relation can be chosen after B and C have been given.
6262 * HOL/List: the constructors of type list are now Nil and Cons;
6263 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6264 course, ML tools referring to List.list.op # etc. have to be adapted;
6266 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6267 disabled by default; run isabelle with option -m HOL to get back to
6268 the original Gordon/HOL-style output;
6270 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6271 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6273 * HOL basic syntax simplified (more orthogonal): all variants of
6274 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6275 Eps operator is provided as well: "SOME x. P[x]";
6277 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6279 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6280 thus available for user theories;
6282 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6283 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6286 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6287 several times and then mp;
6292 * the notation <<...>> is now available as a notation for sequences of
6295 * the simplifier is now installed
6297 * the axiom system has been generalized (thanks to Soren Heilmann)
6299 * the classical reasoner now has a default rule database
6304 * new primrec section allows primitive recursive functions to be given
6305 directly (as in HOL) over datatypes and the natural numbers;
6307 * new tactics induct_tac and exhaust_tac for induction (or case
6308 analysis) over datatypes and the natural numbers;
6310 * the datatype declaration of type T now defines the recursor T_rec;
6312 * simplification automatically does freeness reasoning for datatype
6315 * automatic type-inference, with AddTCs command to insert new
6316 type-checking rules;
6318 * datatype introduction rules are now added as Safe Introduction rules
6321 * the syntax "if P then x else y" is now available in addition to
6325 *** Internal programming interfaces ***
6327 * tuned simplifier trace output; new flag debug_simp;
6329 * structures Vartab / Termtab (instances of TableFun) offer efficient
6330 tables indexed by indexname_ord / term_ord (compatible with aconv);
6332 * AxClass.axclass_tac lost the theory argument;
6334 * tuned current_goals_markers semantics: begin / end goal avoids
6335 printing empty lines;
6337 * removed prs and prs_fn hook, which was broken because it did not
6338 include \n in its semantics, forcing writeln to add one
6339 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6340 string -> unit if you really want to output text without newline;
6342 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6343 plain output, interface builders may have to enable 'isabelle_font'
6344 mode to get Isabelle font glyphs as before;
6346 * refined token_translation interface; INCOMPATIBILITY: output length
6347 now of type real instead of int;
6349 * theory loader actions may be traced via new ThyInfo.add_hook
6350 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6351 your own database of information attached to *whole* theories -- as
6352 opposed to intra-theory data slots offered via TheoryDataFun;
6354 * proper handling of dangling sort hypotheses (at last!);
6355 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6356 extra sort hypotheses that can be witnessed from the type signature;
6357 the force_strip_shyps flag is gone, any remaining shyps are simply
6358 left in the theorem (with a warning issued by strip_shyps_warning);
6362 New in Isabelle98-1 (October 1998)
6363 ----------------------------------
6365 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6367 * several changes of automated proof tools;
6369 * HOL: major changes to the inductive and datatype packages, including
6370 some minor incompatibilities of theory syntax;
6372 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6375 * HOL: removed duplicate thms in Arith:
6376 less_imp_add_less should be replaced by trans_less_add1
6377 le_imp_add_le should be replaced by trans_le_add1
6379 * HOL: unary minus is now overloaded (new type constraints may be
6382 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6383 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6384 now taken as an integer constant.
6386 * Pure: ML function 'theory_of' renamed to 'theory';
6392 1. Asm_full_simp_tac is now more aggressive.
6393 1. It will sometimes reorient premises if that increases their power to
6395 2. It does no longer proceed strictly from left to right but may also
6396 rotate premises to achieve further simplification.
6397 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6398 old Asm_full_simp_tac in that it does not rotate premises.
6399 2. The simplifier now knows a little bit about nat-arithmetic.
6401 * Classical reasoner: wrapper mechanism for the classical reasoner now
6402 allows for selected deletion of wrappers, by introduction of names for
6403 wrapper functionals. This implies that addbefore, addSbefore,
6404 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6405 and that adding two tactics with the same name overwrites the first
6406 one (emitting a warning).
6407 type wrapper = (int -> tactic) -> (int -> tactic)
6408 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6409 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6410 delWrapper, delSWrapper: claset * string -> claset
6411 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6413 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6414 semantics; addbefore now affects only the unsafe part of step_tac
6415 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6416 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6419 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6420 compWrapper; added safe wrapper (and access functions for it);
6422 * HOL/split_all_tac is now much faster and fails if there is nothing
6423 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6424 and the names of the automatically generated variables have changed.
6425 split_all_tac has moved within claset() from unsafe wrappers to safe
6426 wrappers, which means that !!-bound variables are split much more
6427 aggressively, and safe_tac and clarify_tac now split such variables.
6428 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6429 Note: the same holds for record_split_tac, which does the job of
6430 split_all_tac for record fields.
6432 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6433 permanently to the default simpset using Addsplits just like
6434 Addsimps. They can be removed via Delsplits just like
6435 Delsimps. Lower-case versions are also available.
6437 * HOL/Simplifier: The rule split_if is now part of the default
6438 simpset. This means that the simplifier will eliminate all occurrences
6439 of if-then-else in the conclusion of a goal. To prevent this, you can
6440 either remove split_if completely from the default simpset by
6441 `Delsplits [split_if]' or remove it in a specific call of the
6442 simplifier using `... delsplits [split_if]'. You can also add/delete
6443 other case splitting rules to/from the default simpset: every datatype
6444 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6445 t is the name of the datatype).
6447 * Classical reasoner / Simplifier combination: new force_tac (and
6448 derivatives Force_tac, force) combines rewriting and classical
6449 reasoning (and whatever other tools) similarly to auto_tac, but is
6450 aimed to solve the given subgoal completely.
6455 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6456 and `goalw': the theory is no longer needed as an explicit argument -
6457 the current theory context is used; assumptions are no longer returned
6458 at the ML-level unless one of them starts with ==> or !!; it is
6459 recommended to convert to these new commands using isatool fixgoal
6460 (backup your sources first!);
6462 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6463 the current theory context, and 'theory' to lookup stored theories;
6465 * new theory section 'locale' for declaring constants, assumptions and
6466 definitions that have local scope;
6468 * new theory section 'nonterminals' for purely syntactic types;
6470 * new theory section 'setup' for generic ML setup functions
6471 (e.g. package initialization);
6473 * the distribution now includes Isabelle icons: see
6474 lib/logo/isabelle-{small,tiny}.xpm;
6476 * isatool install - install binaries with absolute references to
6479 * isatool logo -- create instances of the Isabelle logo (as EPS);
6481 * print mode 'emacs' reserved for Isamode;
6483 * support multiple print (ast) translations per constant name;
6485 * theorems involving oracles are now printed with a suffixed [!];
6490 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6492 * HOL/inductive package reorganized and improved: now supports mutual
6498 oddI "n : EVEN ==> Suc n : ODD"
6499 evenI "n : ODD ==> Suc n : EVEN"
6501 new theorem list "elims" contains an elimination rule for each of the
6502 recursive sets; inductive definitions now handle disjunctive premises
6503 correctly (also ZF);
6505 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6506 "mutual_induct" no longer exists - the induction rule is always
6507 contained in "induct";
6510 * HOL/datatype package re-implemented and greatly improved: now
6511 supports mutually recursive datatypes such as
6514 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6515 | SUM ('a aexp) ('a aexp)
6516 | DIFF ('a aexp) ('a aexp)
6519 'a bexp = LESS ('a aexp) ('a aexp)
6520 | AND ('a bexp) ('a bexp)
6521 | OR ('a bexp) ('a bexp)
6523 as well as indirectly recursive datatypes such as
6526 ('a, 'b) term = Var 'a
6527 | App 'b ((('a, 'b) term) list)
6529 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6530 induction on mutually / indirectly recursive datatypes.
6532 Primrec equations are now stored in theory and can be accessed via
6533 <function_name>.simps.
6537 - Theories using datatypes must now have theory Datatype as an
6539 - The specific <typename>.induct_tac no longer exists - use the
6540 generic induct_tac instead.
6541 - natE has been renamed to nat.exhaust - use exhaust_tac
6542 instead of res_inst_tac ... natE. Note that the variable
6543 names in nat.exhaust differ from the names in natE, this
6544 may cause some "fragile" proofs to fail.
6545 - The theorems split_<typename>_case and split_<typename>_case_asm
6546 have been renamed to <typename>.split and <typename>.split_asm.
6547 - Since default sorts of type variables are now handled correctly,
6548 some datatype definitions may have to be annotated with explicit
6550 - Primrec definitions no longer require function name and type
6551 of recursive argument.
6553 Consider using isatool fixdatatype to adapt your theories and proof
6554 scripts to the new package (backup your sources first!).
6557 * HOL/record package: considerably improved implementation; now
6558 includes concrete syntax for record types, terms, updates; theorems
6559 for surjective pairing and splitting !!-bound record variables; proof
6560 support is as follows:
6562 1) standard conversions (selectors or updates applied to record
6563 constructor terms) are part of the standard simpset;
6565 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6566 made part of standard simpset and claset via addIffs;
6568 3) a tactic for record field splitting (record_split_tac) is part of
6569 the standard claset (addSWrapper);
6571 To get a better idea about these rules you may retrieve them via
6572 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6573 the name of your record type.
6575 The split tactic 3) conceptually simplifies by the following rule:
6577 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6579 Thus any record variable that is bound by meta-all will automatically
6580 blow up into some record constructor term, consequently the
6581 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6582 solve record problems automatically.
6585 * reorganized the main HOL image: HOL/Integ and String loaded by
6586 default; theory Main includes everything;
6588 * automatic simplification of integer sums and comparisons, using cancellation;
6590 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6592 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6594 * many new identities for unions, intersections, set difference, etc.;
6596 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6597 called split_if, split_split, split_sum_case and split_nat_case (to go
6598 with add/delsplits);
6600 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6601 (?x::unit) = (); this is made part of the default simpset, which COULD
6602 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6603 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6604 unit_abs_eta_conv is added in order to counter the effect of
6605 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6608 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6611 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6612 It and 'sym RS equals0D' are now in the default claset, giving automatic
6613 disjointness reasoning but breaking a few old proofs.
6615 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6616 to 'converse' from 'inverse' (for compatibility with ZF and some
6619 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6620 the well-founded relation;
6622 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6623 Compl A. The "Compl" syntax remains available as input syntax for this
6626 * HOL/Update: new theory of function updates:
6627 f(a:=b) == %x. if x=a then b else f x
6628 may also be iterated as in f(a:=b,c:=d,...);
6630 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6633 - new function list_update written xs[i:=v] that updates the i-th
6634 list position. May also be iterated as in xs[i:=a,j:=b,...].
6635 - new function `upt' written [i..j(] which generates the list
6636 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6637 bound write [i..j], which is a shorthand for [i..j+1(].
6638 - new lexicographic orderings and corresponding wellfoundedness theorems.
6641 - removed 'pred' (predecessor) function;
6642 - generalized some theorems about n-1;
6643 - many new laws about "div" and "mod";
6644 - new laws about greatest common divisors (see theory ex/Primes);
6646 * HOL/Relation: renamed the relational operator r^-1 "converse"
6647 instead of "inverse";
6649 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6650 of the multiset ordering;
6652 * directory HOL/Real: a construction of the reals using Dedekind cuts
6653 (not included by default);
6655 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6657 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6658 programs, i.e. different program variables may have different types.
6660 * calling (stac rew i) now fails if "rew" has no effect on the goal
6661 [previously, this check worked only if the rewrite rule was unconditional]
6662 Now rew can involve either definitions or equalities (either == or =).
6667 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6668 only the theorems proved on ZF.ML;
6670 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6671 It and 'sym RS equals0D' are now in the default claset, giving automatic
6672 disjointness reasoning but breaking a few old proofs.
6674 * ZF/Update: new theory of function updates
6675 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6676 may also be iterated as in f(a:=b,c:=d,...);
6678 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6680 * calling (stac rew i) now fails if "rew" has no effect on the goal
6681 [previously, this check worked only if the rewrite rule was unconditional]
6682 Now rew can involve either definitions or equalities (either == or =).
6684 * case_tac provided for compatibility with HOL
6685 (like the old excluded_middle_tac, but with subgoals swapped)
6688 *** Internal programming interfaces ***
6690 * Pure: several new basic modules made available for general use, see
6691 also src/Pure/README;
6693 * improved the theory data mechanism to support encapsulation (data
6694 kind name replaced by private Object.kind, acting as authorization
6695 key); new type-safe user interface via functor TheoryDataFun; generic
6696 print_data function becomes basically useless;
6698 * removed global_names compatibility flag -- all theory declarations
6699 are qualified by default;
6701 * module Pure/Syntax now offers quote / antiquote translation
6702 functions (useful for Hoare logic etc. with implicit dependencies);
6703 see HOL/ex/Antiquote for an example use;
6705 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6708 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6711 * Display.print_goals function moved to Locale.print_goals;
6713 * standard print function for goals supports current_goals_markers
6714 variable for marking begin of proof, end of proof, start of goal; the
6715 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6716 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6721 New in Isabelle98 (January 1998)
6722 --------------------------------
6724 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6726 * changed lexical syntax of terms / types: dots made part of long
6727 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6729 * simpset (and claset) reference variable replaced by functions
6730 simpset / simpset_ref;
6732 * no longer supports theory aliases (via merge) and non-trivial
6733 implicit merge of thms' signatures;
6735 * most internal names of constants changed due to qualified names;
6737 * changed Pure/Sequence interface (see Pure/seq.ML);
6740 *** General Changes ***
6742 * hierachically structured name spaces (for consts, types, axms, thms
6743 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6744 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6745 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6746 long_names for fully qualified output names; NOTE: ML programs
6747 (special tactics, packages etc.) referring to internal names may have
6748 to be adapted to cope with fully qualified names; in case of severe
6749 backward campatibility problems try setting 'global_names' at compile
6750 time to have enrything declared within a flat name space; one may also
6751 fine tune name declarations in theories via the 'global' and 'local'
6754 * reimplemented the implicit simpset and claset using the new anytype
6755 data filed in signatures; references simpset:simpset ref etc. are
6756 replaced by functions simpset:unit->simpset and
6757 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6758 to patch your ML files accordingly;
6760 * HTML output now includes theory graph data for display with Java
6761 applet or isatool browser; data generated automatically via isatool
6762 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6764 * defs may now be conditional; improved rewrite_goals_tac to handle
6765 conditional equations;
6767 * defs now admits additional type arguments, using TYPE('a) syntax;
6769 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6770 creates a new theory node; implicit merge of thms' signatures is
6771 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6772 transfer:theory->thm->thm in (rare) cases;
6774 * improved handling of draft signatures / theories; draft thms (and
6775 ctyps, cterms) are automatically promoted to real ones;
6777 * slightly changed interfaces for oracles: admit many per theory, named
6778 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6780 * print_goals: optional output of const types (set show_consts and
6783 * improved output of warnings (###) and errors (***);
6785 * subgoal_tac displays a warning if the new subgoal has type variables;
6787 * removed old README and Makefiles;
6789 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6791 * removed obsolete init_pps and init_database;
6793 * deleted the obsolete tactical STATE, which was declared by
6794 fun STATE tacfun st = tacfun st st;
6796 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6797 (which abbreviates $HOME);
6799 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6800 use isatool fixseq to adapt your ML programs (this works for fully
6801 qualified references to the Sequence structure only!);
6803 * use_thy no longer requires writable current directory; it always
6804 reloads .ML *and* .thy file, if either one is out of date;
6807 *** Classical Reasoner ***
6809 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6810 tactics that use classical reasoning to simplify a subgoal without
6811 splitting it into several subgoals;
6813 * Safe_tac: like safe_tac but uses the default claset;
6818 * added simplification meta rules:
6819 (asm_)(full_)simplify: simpset -> thm -> thm;
6821 * simplifier.ML no longer part of Pure -- has to be loaded by object
6824 * added prems argument to simplification procedures;
6826 * HOL, FOL, ZF: added infix function `addsplits':
6827 instead of `<simpset> setloop (split_tac <thms>)'
6828 you can simply write `<simpset> addsplits <thms>'
6833 * TYPE('a) syntax for type reflection terms;
6835 * no longer handles consts with name "" -- declare as 'syntax' instead;
6837 * pretty printer: changed order of mixfix annotation preference (again!);
6839 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6844 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6845 with `addloop' of the simplifier to faciliate case splitting in premises.
6847 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6849 * HOL/Auth: new protocol proofs including some for the Internet
6852 * HOL/Map: new theory of `maps' a la VDM;
6854 * HOL/simplifier: simplification procedures nat_cancel_sums for
6855 cancelling out common nat summands from =, <, <= (in)equalities, or
6856 differences; simplification procedures nat_cancel_factor for
6857 cancelling common factor from =, <, <= (in)equalities over natural
6858 sums; nat_cancel contains both kinds of procedures, it is installed by
6859 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6861 * HOL/simplifier: terms of the form
6862 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6864 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6865 and those of the form
6866 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6868 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6871 Each datatype `t' now comes with a theorem `split_t_case' of the form
6873 P(t_case f1 ... fn x) =
6874 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6876 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6879 and a theorem `split_t_case_asm' of the form
6881 P(t_case f1 ... fn x) =
6882 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6884 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6886 which can be added to a simpset via `addsplits'. The existing theorems
6887 expand_list_case and expand_option_case have been renamed to
6888 split_list_case and split_option_case.
6891 - `pred n' is automatically converted to `n-1'.
6892 Users are strongly encouraged not to use `pred' any longer,
6893 because it will disappear altogether at some point.
6894 - Users are strongly encouraged to write "0 < n" rather than
6895 "n ~= 0". Theorems and proof tools have been modified towards this
6899 the function "set_of_list" has been renamed "set" (and its theorems too);
6900 the function "nth" now takes its arguments in the reverse order and
6901 has acquired the infix notation "!" as in "xs!n".
6903 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6905 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6906 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6908 * HOL/record: extensible records with schematic structural subtyping
6909 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6910 still lacks various theorems and concrete record syntax;
6915 * removed "axioms" and "generated by" sections;
6917 * replaced "ops" section by extended "consts" section, which is capable of
6918 handling the continuous function space "->" directly;
6921 . proves theorems immediately and stores them in the theory,
6922 . creates hierachical name space,
6923 . now uses normal mixfix annotations (instead of cinfix...),
6924 . minor changes to some names and values (for consistency),
6925 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6926 . separator between mutual domain defs: changed "," to "and",
6927 . improved handling of sort constraints; now they have to
6928 appear on the left-hand side of the equations only;
6930 * fixed LAM <x,y,zs>.b syntax;
6932 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6933 adm (%x. P (t x)), where P is chainfinite and t continuous;
6938 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6939 with `addloop' of the simplifier to faciliate case splitting in premises.
6941 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6942 in HOL, they strip ALL and --> from proved theorems;
6946 New in Isabelle94-8 (May 1997)
6947 ------------------------------
6949 *** General Changes ***
6951 * new utilities to build / run / maintain Isabelle etc. (in parts
6952 still somewhat experimental); old Makefiles etc. still functional;
6954 * new 'Isabelle System Manual';
6956 * INSTALL text, together with ./configure and ./build scripts;
6958 * reimplemented type inference for greater efficiency, better error
6959 messages and clean internal interface;
6961 * prlim command for dealing with lots of subgoals (an easier way of
6962 setting goals_limit);
6967 * supports alternative (named) syntax tables (parser and pretty
6968 printer); internal interface is provided by add_modesyntax(_i);
6970 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6971 be used in conjunction with the Isabelle symbol font; uses the
6972 "symbols" syntax table;
6974 * added token_translation interface (may translate name tokens in
6975 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6976 the current print_mode); IMPORTANT: user print translation functions
6977 are responsible for marking newly introduced bounds
6978 (Syntax.mark_boundT);
6980 * token translations for modes "xterm" and "xterm_color" that display
6981 names in bold, underline etc. or colors (which requires a color
6984 * infixes may now be declared with names independent of their syntax;
6986 * added typed_print_translation (like print_translation, but may
6987 access type of constant);
6990 *** Classical Reasoner ***
6992 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6993 some limitations. Blast_tac...
6994 + ignores addss, addbefore, addafter; this restriction is intrinsic
6995 + ignores elimination rules that don't have the correct format
6996 (the conclusion MUST be a formula variable)
6997 + ignores types, which can make HOL proofs fail
6998 + rules must not require higher-order unification, e.g. apply_type in ZF
6999 [message "Function Var's argument not a bound variable" relates to this]
7000 + its proof strategy is more general but can actually be slower
7002 * substitution with equality assumptions no longer permutes other
7005 * minor changes in semantics of addafter (now called addaltern); renamed
7006 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7007 (and access functions for it);
7009 * improved combination of classical reasoner and simplifier:
7010 + functions for handling clasimpsets
7011 + improvement of addss: now the simplifier is called _after_ the
7013 + safe variant of addss called addSss: uses safe simplifications
7014 _during_ the safe steps. It is more complete as it allows multiple
7015 instantiations of unknowns (e.g. with slow_tac).
7019 * added interface for simplification procedures (functions that
7020 produce *proven* rewrite rules on the fly, depending on current
7023 * ordering on terms as parameter (used for ordered rewriting);
7025 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7027 * the solver is now split into a safe and an unsafe part.
7028 This should be invisible for the normal user, except that the
7029 functions setsolver and addsolver have been renamed to setSolver and
7030 addSolver; added safe_asm_full_simp_tac;
7035 * a generic induction tactic `induct_tac' which works for all datatypes and
7036 also for type `nat';
7038 * a generic case distinction tactic `exhaust_tac' which works for all
7039 datatypes and also for type `nat';
7041 * each datatype comes with a function `size';
7043 * patterns in case expressions allow tuple patterns as arguments to
7044 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7046 * primrec now also works with type nat;
7048 * recdef: a new declaration form, allows general recursive functions to be
7049 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7051 * the constant for negation has been renamed from "not" to "Not" to
7052 harmonize with FOL, ZF, LK, etc.;
7054 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7057 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7059 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7060 problems in commutative rings, using axiomatic type classes for + and *;
7062 * more examples in HOL/MiniML and HOL/Auth;
7064 * more default rewrite rules for quantifiers, union/intersection;
7066 * a new constant `arbitrary == @x.False';
7068 * HOLCF/IOA replaces old HOL/IOA;
7070 * HOLCF changes: derived all rules and arities
7071 + axiomatic type classes instead of classes
7072 + typedef instead of faking type definitions
7073 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7074 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7075 + eliminated the types void, one, tr
7076 + use unit lift and bool lift (with translations) instead of one and tr
7077 + eliminated blift from Lift3.thy (use Def instead of blift)
7078 all eliminated rules are derived as theorems --> no visible changes ;
7083 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7084 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7085 as ZF_cs addSIs [equalityI];
7089 New in Isabelle94-7 (November 96)
7090 ---------------------------------
7092 * allowing negative levels (as offsets) in prlev and choplev;
7094 * super-linear speedup for large simplifications;
7096 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7097 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7098 FAIL); can suppress it using the command Delsimps (ex_simps @
7099 all_simps); De Morgan laws are also now included, by default;
7101 * improved printing of ==> : ~:
7103 * new object-logic "Sequents" adds linear logic, while replacing LK
7104 and Modal (thanks to Sara Kalvala);
7106 * HOL/Auth: correctness proofs for authentication protocols;
7108 * HOL: new auto_tac combines rewriting and classical reasoning (many
7109 examples on HOL/Auth);
7111 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7112 the rewriter and classical reasoner simultaneously;
7114 * function uresult no longer returns theorems in "standard" format;
7115 regain previous version by: val uresult = standard o uresult;
7122 * oracles -- these establish an interface between Isabelle and trusted
7123 external reasoners, which may deliver results as theorems;
7125 * proof objects (in particular record all uses of oracles);
7127 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7129 * "constdefs" section in theory files;
7131 * "primrec" section (HOL) no longer requires names;
7133 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7140 * reduced space requirements;
7142 * automatic HTML generation from theories;
7144 * theory files no longer require "..." (quotes) around most types;
7146 * new examples, including two proofs of the Church-Rosser theorem;
7148 * non-curried (1994) version of HOL is no longer distributed;
7155 * greatly reduced space requirements;
7157 * theory files (.thy) no longer require \...\ escapes at line breaks;
7159 * searchable theorem database (see the section "Retrieving theorems" on
7160 page 8 of the Reference Manual);
7162 * new examples, including Grabczewski's monumental case study of the
7165 * The previous version of HOL renamed to Old_HOL;
7167 * The new version of HOL (previously called CHOL) uses a curried syntax
7168 for functions. Application looks like f a b instead of f(a,b);
7170 * Mutually recursive inductive definitions finally work in HOL;
7172 * In ZF, pattern-matching on tuples is now available in all abstractions and
7173 translates to the operator "split";
7180 * new infix operator, addss, allowing the classical reasoner to
7181 perform simplification at each step of its search. Example:
7182 fast_tac (cs addss ss)
7184 * a new logic, CHOL, the same as HOL, but with a curried syntax
7185 for functions. Application looks like f a b instead of f(a,b). Also pairs
7186 look like (a,b) instead of <a,b>;
7188 * PLEASE NOTE: CHOL will eventually replace HOL!
7190 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7191 It translates to the operator "split". A new theory of integers is available;
7193 * In ZF, integer numerals now denote two's-complement binary integers.
7194 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7196 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7197 of the Axiom of Choice;
7204 * Significantly faster resolution;
7206 * the different sections in a .thy file can now be mixed and repeated
7209 * Database of theorems for FOL, HOL and ZF. New
7210 commands including qed, qed_goal and bind_thm store theorems in the database.
7212 * Simple database queries: return a named theorem (get_thm) or all theorems of
7213 a given theory (thms_of), or find out what theory a theorem was proved in
7216 * Bugs fixed in the inductive definition and datatype packages;
7218 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7219 and HOL_dup_cs obsolete;
7221 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7224 * Simpler definition of function space in ZF;
7226 * new results about cardinal and ordinal arithmetic in ZF;
7228 * 'subtype' facility in HOL for introducing new types as subsets of existing
7231 :mode=text:wrap=hard:maxLineLen=72: