don't show spurious "..." in Nitpick's output for free variables of set type (e.g., P (op +) example from Manual_Nits.thy); undoes parts of 38ba15040455, which was too aggressive
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 "atoms" option.
431 - Added cache to speed up repeated Kodkod invocations on the same
433 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
434 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
435 "SAT4J_Light". INCOMPATIBILITY.
436 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
437 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
439 * Moved the SMT binding into the HOL image.
444 * Variable names in lemmas generated by the domain package have
445 changed; the naming scheme is now consistent with the HOL datatype
446 package. Some proof scripts may be affected, INCOMPATIBILITY.
448 * The domain package no longer defines the function "foo_copy" for
449 recursive domain "foo". The reach lemma is now stated directly in
450 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
451 be reformulated in terms of "foo_take", INCOMPATIBILITY.
453 * Most definedness lemmas generated by the domain package (previously
454 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
455 like "foo$x = UU <-> x = UU", which works better as a simp rule.
456 Proof scripts that used definedness lemmas as intro rules may break,
457 potential INCOMPATIBILITY.
459 * Induction and casedist rules generated by the domain package now
460 declare proper case_names (one called "bottom", and one named for each
461 constructor). INCOMPATIBILITY.
463 * For mutually-recursive domains, separate "reach" and "take_lemma"
464 rules are generated for each domain, INCOMPATIBILITY.
466 foo_bar.reach ~> foo.reach bar.reach
467 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
469 * Some lemmas generated by the domain package have been renamed for
470 consistency with the datatype package, INCOMPATIBILITY.
472 foo.ind ~> foo.induct
473 foo.finite_ind ~> foo.finite_induct
474 foo.coind ~> foo.coinduct
475 foo.casedist ~> foo.exhaust
476 foo.exhaust ~> foo.nchotomy
478 * For consistency with other definition packages, the fixrec package
479 now generates qualified theorem names, INCOMPATIBILITY.
481 foo_simps ~> foo.simps
482 foo_unfold ~> foo.unfold
483 foo_induct ~> foo.induct
485 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
486 method and internal fixrec proofs now use the default simpset instead.
489 * The "contlub" predicate has been removed. Proof scripts should use
490 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
492 * The "admw" predicate has been removed, INCOMPATIBILITY.
494 * The constants cpair, cfst, and csnd have been removed in favor of
495 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
500 * Renamed some important ML structures, while keeping the old names
501 for some time as aliases within the structure Legacy:
503 OuterKeyword ~> Keyword
506 OuterSyntax ~> Outer_Syntax
507 SpecParse ~> Parse_Spec
508 TypeInfer ~> Type_Infer
509 PrintMode ~> Print_Mode
511 Note that "open Legacy" simplifies porting of sources, but forgetting
512 to remove it again will complicate porting again in the future.
514 * Most operations that refer to a global context are named
515 accordingly, e.g. Simplifier.global_context or
516 ProofContext.init_global. There are some situations where a global
517 context actually works, but under normal circumstances one needs to
518 pass the proper local context through the code!
520 * Discontinued old TheoryDataFun with its copy/init operation -- data
521 needs to be pure. Functor Theory_Data_PP retains the traditional
522 Pretty.pp argument to merge, which is absent in the standard
525 * Antiquotations for basic formal entities:
527 @{class NAME} -- type class
528 @{class_syntax NAME} -- syntax representation of the above
530 @{type_name NAME} -- logical type
531 @{type_abbrev NAME} -- type abbreviation
532 @{nonterminal NAME} -- type of concrete syntactic category
533 @{type_syntax NAME} -- syntax representation of any of the above
535 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
536 @{const_abbrev NAME} -- abbreviated constant
537 @{const_syntax NAME} -- syntax representation of any of the above
539 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
540 syntax constant (cf. 'syntax' command).
542 * Antiquotation @{make_string} inlines a function to print arbitrary
543 values similar to the ML toplevel. The result is compiler dependent
544 and may fall back on "?" in certain situations.
546 * Sorts.certify_sort and derived "cert" operations for types and terms
547 no longer minimize sorts. Thus certification at the boundary of the
548 inference kernel becomes invariant under addition of class relations,
549 which is an important monotonicity principle. Sorts are now minimized
550 in the syntax layer only, at the boundary between the end-user and the
551 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
552 explicitly in rare situations.
554 * Renamed old-style Drule.standard to Drule.export_without_context, to
555 emphasize that this is in no way a standard operation.
558 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
559 usual for resolution. Rare INCOMPATIBILITY.
561 * Renamed varify/unvarify operations to varify_global/unvarify_global
562 to emphasize that these only work in a global situation (which is
565 * Configuration options now admit dynamic default values, depending on
566 the context or even global references.
568 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
569 uses an efficient external library if available (for Poly/ML).
571 * Curried take and drop in library.ML; negative length is interpreted
572 as infinity (as in chop). Subtle INCOMPATIBILITY.
577 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
578 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
579 proof terms are enabled unconditionally in the new HOL-Proofs image.
581 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
582 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
585 * Old lib/scripts/polyml-platform is superseded by the
586 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
587 variant, even on a 64 bit machine. The following example setting
588 prefers 64 bit if available:
590 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
594 New in Isabelle2009-1 (December 2009)
595 -------------------------------------
599 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
600 one backslash should be used, even in ML sources.
605 * Locale interpretation propagates mixins along the locale hierarchy.
606 The currently only available mixins are the equations used to map
607 local definitions to terms of the target domain of an interpretation.
609 * Reactivated diagnostic command 'print_interps'. Use "print_interps
610 loc" to print all interpretations of locale "loc" in the theory.
611 Interpretations in proofs are not shown.
613 * Thoroughly revised locales tutorial. New section on conditional
616 * On instantiation of classes, remaining undefined class parameters
617 are formally declared. INCOMPATIBILITY.
620 *** Document preparation ***
622 * New generalized style concept for printing terms: @{foo (style) ...}
623 instead of @{foo_style style ...} (old form is still retained for
624 backward compatibility). Styles can be also applied for
625 antiquotations prop, term_type and typeof.
630 * New proof method "smt" for a combination of first-order logic with
631 equality, linear and nonlinear (natural/integer/real) arithmetic, and
632 fixed-size bitvectors; there is also basic support for higher-order
633 features (esp. lambda abstractions). It is an incomplete decision
634 procedure based on external SMT solvers using the oracle mechanism;
635 for the SMT solver Z3, this method is proof-producing. Certificates
636 are provided to avoid calling the external solvers solely for
637 re-checking proofs. Due to a remote SMT service there is no need for
638 installing SMT solvers locally. See src/HOL/SMT.
640 * New commands to load and prove verification conditions generated by
641 the Boogie program verifier or derived systems (e.g. the Verifying C
642 Compiler (VCC) or Spec#). See src/HOL/Boogie.
644 * New counterexample generator tool 'nitpick' based on the Kodkod
645 relational model finder. See src/HOL/Tools/Nitpick and
646 src/HOL/Nitpick_Examples.
648 * New commands 'code_pred' and 'values' to invoke the predicate
649 compiler and to enumerate values of inductive predicates.
651 * A tabled implementation of the reflexive transitive closure.
653 * New implementation of quickcheck uses generic code generator;
654 default generators are provided for all suitable HOL types, records
655 and datatypes. Old quickcheck can be re-activated importing theory
656 Library/SML_Quickcheck.
658 * New testing tool Mirabelle for automated proof tools. Applies
659 several tools and tactics like sledgehammer, metis, or quickcheck, to
660 every proof step in a theory. To be used in batch mode via the
663 * New proof method "sos" (sum of squares) for nonlinear real
664 arithmetic (originally due to John Harison). It requires theory
665 Library/Sum_Of_Squares. It is not a complete decision procedure but
666 works well in practice on quantifier-free real arithmetic with +, -,
667 *, ^, =, <= and <, i.e. boolean combinations of equalities and
668 inequalities between polynomials. It makes use of external
669 semidefinite programming solvers. Method "sos" generates a
670 certificate that can be pasted into the proof thus avoiding the need
671 to call an external tool every time the proof is checked. See
672 src/HOL/Library/Sum_Of_Squares.
674 * New method "linarith" invokes existing linear arithmetic decision
677 * New command 'atp_minimal' reduces result produced by Sledgehammer.
679 * New Sledgehammer option "Full Types" in Proof General settings menu.
680 Causes full type information to be output to the ATPs. This slows
681 ATPs down considerably but eliminates a source of unsound "proofs"
684 * New method "metisFT": A version of metis that uses full type
685 information in order to avoid failures of proof reconstruction.
687 * New evaluator "approximate" approximates an real valued term using
688 the same method as the approximation method.
690 * Method "approximate" now supports arithmetic expressions as
691 boundaries of intervals and implements interval splitting and Taylor
694 * ML antiquotation @{code_datatype} inserts definition of a datatype
695 generated by the code generator; e.g. see src/HOL/Predicate.thy.
697 * New theory SupInf of the supremum and infimum operators for sets of
700 * New theory Probability, which contains a development of measure
701 theory, eventually leading to Lebesgue integration and probability.
703 * Extended Multivariate Analysis to include derivation and Brouwer's
706 * Reorganization of number theory, INCOMPATIBILITY:
707 - new number theory development for nat and int, in theories Divides
708 and GCD as well as in new session Number_Theory
709 - some constants and facts now suffixed with _nat and _int
711 - former session NumberTheory now named Old_Number_Theory, including
712 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
713 - moved theory Pocklington from src/HOL/Library to
714 src/HOL/Old_Number_Theory
716 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
717 lcm of finite and infinite sets. It is shown that they form a complete
720 * Class semiring_div requires superclass no_zero_divisors and proof of
721 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
722 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
723 generalized to class semiring_div, subsuming former theorems
724 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
725 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
728 * Refinements to lattice classes and sets:
729 - less default intro/elim rules in locale variant, more default
730 intro/elim rules in class variant: more uniformity
731 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
733 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
735 - renamed ACI to inf_sup_aci
736 - new class "boolean_algebra"
737 - class "complete_lattice" moved to separate theory
738 "Complete_Lattice"; corresponding constants (and abbreviations)
739 renamed and with authentic syntax:
740 Set.Inf ~> Complete_Lattice.Inf
741 Set.Sup ~> Complete_Lattice.Sup
742 Set.INFI ~> Complete_Lattice.INFI
743 Set.SUPR ~> Complete_Lattice.SUPR
744 Set.Inter ~> Complete_Lattice.Inter
745 Set.Union ~> Complete_Lattice.Union
746 Set.INTER ~> Complete_Lattice.INTER
747 Set.UNION ~> Complete_Lattice.UNION
748 - authentic syntax for
751 - mere abbreviations:
754 Set.inter (for inf, formerly Set.Int)
755 Set.union (for sup, formerly Set.Un)
756 Complete_Lattice.Inter (for Inf)
757 Complete_Lattice.Union (for Sup)
758 Complete_Lattice.INTER (for INFI)
759 Complete_Lattice.UNION (for SUPR)
760 - object-logic definitions as far as appropriate
762 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
763 Un_subset_iff are explicitly deleted as default simp rules; then also
764 their lattice counterparts le_inf_iff and le_sup_iff have to be
765 deleted to achieve the desired effect.
767 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
768 rules by default any longer; the same applies to min_max.inf_absorb1
769 etc. INCOMPATIBILITY.
771 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
772 pred_set_conv by default. INCOMPATIBILITY.
774 * Power operations on relations and functions are now one dedicated
775 constant "compow" with infix syntax "^^". Power operation on
776 multiplicative monoids retains syntax "^" and is now defined generic
777 in class power. INCOMPATIBILITY.
779 * Relation composition "R O S" now has a more standard argument order:
780 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
781 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
782 break, since the O_assoc rule was not rewritten like this. Fix using
783 O_assoc[symmetric]. The same applies to the curried version "R OO S".
785 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
786 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
789 * Most rules produced by inductive and datatype package have mandatory
790 prefixes. INCOMPATIBILITY.
792 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
793 the attribute of the same name. Each of the theorems in the list
794 DERIV_intros assumes composition with an additional function and
795 matches a variable to the derivative, which has to be solved by the
796 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
797 of most elementary terms. Former Maclauren.DERIV_tac and
798 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
801 * Code generator attributes follow the usual underscore convention:
802 code_unfold replaces code unfold
803 code_post replaces code post
808 sizechange -> size_change
809 induct_scheme -> induction_schema
812 * Discontinued abbreviation "arbitrary" of constant "undefined".
813 INCOMPATIBILITY, use "undefined" directly.
816 Suc_eq_add_numeral_1 -> Suc_eq_plus1
817 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
818 Suc_plus1 -> Suc_eq_plus1
819 *anti_sym -> *antisym*
820 vector_less_eq_def -> vector_le_def
823 * Added theorem List.map_map as [simp]. Removed List.map_compose.
826 * Removed predicate "M hassize n" (<--> card M = n & finite M).
832 * Theory Representable defines a class "rep" of domains that are
833 representable (via an ep-pair) in the universal domain type "udom".
834 Instances are provided for all type constructors defined in HOLCF.
836 * The 'new_domain' command is a purely definitional version of the
837 domain package, for representable domains. Syntax is identical to the
838 old domain package. The 'new_domain' package also supports indirect
839 recursion using previously-defined type constructors. See
840 src/HOLCF/ex/New_Domain.thy for examples.
842 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
843 on the left-hand side of an equation, and then performs
844 simplification. Rewriting is done using rules declared with the
845 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
846 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
848 * The pattern-match compiler in 'fixrec' can now handle constructors
849 with HOL function types. Pattern-match combinators for the Pair
850 constructor are pre-configured.
852 * The 'fixrec' package now produces better fixed-point induction rules
853 for mutually-recursive definitions: Induction rules have conclusions
854 of the form "P foo bar" instead of "P <foo, bar>".
856 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
857 been renamed to "below". The name "below" now replaces "less" in many
858 theorem names. (Legacy theorem names using "less" are still supported
861 * The 'fixrec' package now supports "bottom patterns". Bottom
862 patterns can be used to generate strictness rules, or to make
863 functions more strict (much like the bang-patterns supported by the
864 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
870 * Support for Poly/ML 5.3.0, with improved reporting of compiler
871 errors and run-time exceptions, including detailed source positions.
873 * Structure Name_Space (formerly NameSpace) now manages uniquely
874 identified entries, with some additional information such as source
875 position, logical grouping etc.
877 * Theory and context data is now introduced by the simplified and
878 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
879 to be pure, but the old TheoryDataFun for mutable data (with explicit
880 copy operation) is still available for some time.
882 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
883 provides a high-level programming interface to synchronized state
884 variables with atomic update. This works via pure function
885 application within a critical section -- its runtime should be as
886 short as possible; beware of deadlocks if critical code is nested,
887 either directly or indirectly via other synchronized variables!
889 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
890 wraps raw ML references, explicitly indicating their non-thread-safe
891 behaviour. The Isar toplevel keeps this structure open, to
892 accommodate Proof General as well as quick and dirty interactive
893 experiments with references.
895 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
896 parallel tactical reasoning.
898 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
899 are similar to SUBPROOF, but are slightly more flexible: only the
900 specified parts of the subgoal are imported into the context, and the
901 body tactic may introduce new subgoals and schematic variables.
903 * Old tactical METAHYPS, which does not observe the proof context, has
904 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
905 or Subgoal.FOCUS etc.
907 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
908 functors have their own ML name space there is no point to mark them
909 separately.) Minor INCOMPATIBILITY.
911 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
913 * Renamed several structures FooBar to Foo_Bar. Occasional,
916 * Operations of structure Skip_Proof no longer require quick_and_dirty
917 mode, which avoids critical setmp.
919 * Eliminated old Attrib.add_attributes, Method.add_methods and related
920 combinators for "args". INCOMPATIBILITY, need to use simplified
921 Attrib/Method.setup introduced in Isabelle2009.
923 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
924 back on global_simpset_of, global_claset_of, global_clasimpset_of as
925 last resort. INCOMPATIBILITY.
927 * Display.pretty_thm now requires a proper context (cf. former
928 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
929 or even Display.pretty_thm_without_context as last resort.
932 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
933 Syntax.pretty_typ/term directly, preferably with proper context
934 instead of global theory.
939 * Further fine tuning of parallel proof checking, scales up to 8 cores
940 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
943 * Support for additional "Isabelle components" via etc/components, see
944 also the system manual.
946 * The isabelle makeall tool now operates on all components with
947 IsaMakefile, not just hardwired "logics".
949 * Removed "compress" option from isabelle-process and isabelle usedir;
950 this is always enabled.
952 * Discontinued support for Poly/ML 4.x versions.
954 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
955 on a given logic image. This requires the lighttpd webserver and is
956 currently supported on Linux only.
960 New in Isabelle2009 (April 2009)
961 --------------------------------
965 * Simplified main Isabelle executables, with less surprises on
966 case-insensitive file-systems (such as Mac OS).
968 - The main Isabelle tool wrapper is now called "isabelle" instead of
971 - The former "isabelle" alias for "isabelle-process" has been
972 removed (should rarely occur to regular users).
974 - The former "isabelle-interface" and its alias "Isabelle" have been
975 removed (interfaces are now regular Isabelle tools).
977 Within scripts and make files, the Isabelle environment variables
978 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
979 respectively. (The latter are still available as legacy feature.)
981 The old isabelle-interface wrapper could react in confusing ways if
982 the interface was uninstalled or changed otherwise. Individual
983 interface tool configuration is now more explicit, see also the
984 Isabelle system manual. In particular, Proof General is now available
985 via "isabelle emacs".
987 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
988 purge installed copies of Isabelle executables and re-run "isabelle
989 install -p ...", or use symlinks.
991 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
992 old ~/isabelle, which was slightly non-standard and apt to cause
993 surprises on case-insensitive file-systems (such as Mac OS).
995 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
996 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
997 care is required when using older releases of Isabelle. Note that
998 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
999 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1001 * Proofs of fully specified statements are run in parallel on
1002 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1003 a regular 4-core machine, if the initial heap space is made reasonably
1004 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1006 * The main reference manuals ("isar-ref", "implementation", and
1007 "system") have been updated and extended. Formally checked references
1008 as hyperlinks are now available uniformly.
1013 * Complete re-implementation of locales. INCOMPATIBILITY in several
1014 respects. The most important changes are listed below. See the
1015 Tutorial on Locales ("locales" manual) for details.
1017 - In locale expressions, instantiation replaces renaming. Parameters
1018 must be declared in a for clause. To aid compatibility with previous
1019 parameter inheritance, in locale declarations, parameters that are not
1020 'touched' (instantiation position "_" or omitted) are implicitly added
1021 with their syntax at the beginning of the for clause.
1023 - Syntax from abbreviations and definitions in locales is available in
1024 locale expressions and context elements. The latter is particularly
1025 useful in locale declarations.
1027 - More flexible mechanisms to qualify names generated by locale
1028 expressions. Qualifiers (prefixes) may be specified in locale
1029 expressions, and can be marked as mandatory (syntax: "name!:") or
1030 optional (syntax "name?:"). The default depends for plain "name:"
1031 depends on the situation where a locale expression is used: in
1032 commands 'locale' and 'sublocale' prefixes are optional, in
1033 'interpretation' and 'interpret' prefixes are mandatory. The old
1034 implicit qualifiers derived from the parameter names of a locale are
1035 no longer generated.
1037 - Command "sublocale l < e" replaces "interpretation l < e". The
1038 instantiation clause in "interpretation" and "interpret" (square
1039 brackets) is no longer available. Use locale expressions.
1041 - When converting proof scripts, mandatory qualifiers in
1042 'interpretation' and 'interpret' should be retained by default, even
1043 if this is an INCOMPATIBILITY compared to former behavior. In the
1044 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1045 in locale expressions range over a single locale instance only.
1047 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1048 In existing theorem specifications replace the includes element by the
1049 respective context elements of the included locale, omitting those
1050 that are already present in the theorem specification. Multiple
1051 assume elements of a locale should be replaced by a single one
1052 involving the locale predicate. In the proof body, declarations (most
1053 notably theorems) may be regained by interpreting the respective
1054 locales in the proof context as required (command "interpret").
1056 If using "includes" in replacement of a target solely because the
1057 parameter types in the theorem are not as general as in the target,
1058 consider declaring a new locale with additional type constraints on
1059 the parameters (context element "constrains").
1061 - Discontinued "locale (open)". INCOMPATIBILITY.
1063 - Locale interpretation commands no longer attempt to simplify goal.
1064 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1065 methods intro_locales and unfold_locales to clarify.
1067 - Locale interpretation commands no longer accept interpretation
1068 attributes. INCOMPATIBILITY.
1070 * Class declaration: so-called "base sort" must not be given in import
1071 list any longer, but is inferred from the specification. Particularly
1078 class foo = type + ...
1080 * Class target: global versions of theorems stemming do not carry a
1081 parameter prefix any longer. INCOMPATIBILITY.
1083 * Class 'instance' command no longer accepts attached definitions.
1084 INCOMPATIBILITY, use proper 'instantiation' target instead.
1086 * Recovered hiding of consts, which was accidentally broken in
1087 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1088 makes c inaccessible; consider using ``hide (open) const c'' instead.
1090 * Slightly more coherent Pure syntax, with updated documentation in
1091 isar-ref manual. Removed locales meta_term_syntax and
1092 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1093 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1094 directly in regular applications.
1096 * There is a new syntactic category "float_const" for signed decimal
1097 fractions (e.g. 123.45 or -123.45).
1099 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1100 interface with 'setup' command instead.
1102 * Command 'local_setup' is similar to 'setup', but operates on a local
1105 * The 'axiomatization' command now only works within a global theory
1106 context. INCOMPATIBILITY.
1108 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1109 hypotheses. Sorts required in the course of reasoning need to be
1110 covered by the constraints in the initial statement, completed by the
1111 type instance information of the background theory. Non-trivial sort
1112 hypotheses, which rarely occur in practice, may be specified via
1113 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1115 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1117 The result contains an implicit sort hypotheses as before --
1118 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1121 * Generalized Isar history, with support for linear undo, direct state
1124 * Changed defaults for unify configuration options:
1126 unify_trace_bound = 50 (formerly 25)
1127 unify_search_bound = 60 (formerly 30)
1129 * Different bookkeeping for code equations (INCOMPATIBILITY):
1131 a) On theory merge, the last set of code equations for a particular
1132 constant is taken (in accordance with the policy applied by other
1133 parts of the code generator framework).
1135 b) Code equations stemming from explicit declarations (e.g. code
1136 attribute) gain priority over default code equations stemming
1137 from definition, primrec, fun etc.
1139 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1141 * Unified theorem tables for both code generators. Thus [code
1142 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1144 * Command 'find_consts' searches for constants based on type and name
1147 find_consts "_ => bool"
1149 By default, matching is against subtypes, but it may be restricted to
1150 the whole type. Searching by name is possible. Multiple queries are
1151 conjunctive and queries may be negated by prefixing them with a
1154 find_consts strict: "_ => bool" name: "Int" -"int => int"
1156 * New 'find_theorems' criterion "solves" matches theorems that
1157 directly solve the current goal (modulo higher-order unification).
1159 * Auto solve feature for main theorem statements: whenever a new goal
1160 is stated, "find_theorems solves" is called; any theorems that could
1161 solve the lemma directly are listed as part of the goal state.
1162 Cf. associated options in Proof General Isabelle settings menu,
1163 enabled by default, with reasonable timeout for pathological cases of
1164 higher-order unification.
1167 *** Document preparation ***
1169 * Antiquotation @{lemma} now imitates a regular terminal proof,
1170 demanding keyword 'by' and supporting the full method expression
1171 syntax just like the Isar command 'by'.
1176 * Integrated main parts of former image HOL-Complex with HOL. Entry
1177 points Main and Complex_Main remain as before.
1179 * Logic image HOL-Plain provides a minimal HOL with the most important
1180 tools available (inductive, datatype, primrec, ...). This facilitates
1181 experimentation and tool development. Note that user applications
1182 (and library theories) should never refer to anything below theory
1185 * Logic image HOL-Main stops at theory Main, and thus facilitates
1186 experimentation due to shorter build times.
1188 * Logic image HOL-NSA contains theories of nonstandard analysis which
1189 were previously part of former HOL-Complex. Entry point Hyperreal
1190 remains valid, but theories formerly using Complex_Main should now use
1191 new entry point Hypercomplex.
1193 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1194 Posix processes. Avoids potentially expensive forking of the ML
1195 process. New thread-based implementation also works on non-Unix
1196 platforms (Cygwin). Provers are no longer hardwired, but defined
1197 within the theory via plain ML wrapper functions. Basic Sledgehammer
1198 commands are covered in the isar-ref manual.
1200 * Wrapper scripts for remote SystemOnTPTP service allows to use
1201 sledgehammer without local ATP installation (Vampire etc.). Other
1202 provers may be included via suitable ML wrappers, see also
1203 src/HOL/ATP_Linkup.thy.
1205 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1208 * The metis method no longer fails because the theorem is too trivial
1209 (contains the empty clause).
1211 * The metis method now fails in the usual manner, rather than raising
1212 an exception, if it determines that it cannot prove the theorem.
1214 * Method "coherent" implements a prover for coherent logic (see also
1215 src/Tools/coherent.ML).
1217 * Constants "undefined" and "default" replace "arbitrary". Usually
1218 "undefined" is the right choice to replace "arbitrary", though
1219 logically there is no difference. INCOMPATIBILITY.
1221 * Command "value" now integrates different evaluation mechanisms. The
1222 result of the first successful evaluation mechanism is printed. In
1223 square brackets a particular named evaluation mechanisms may be
1224 specified (currently, [SML], [code] or [nbe]). See further
1225 src/HOL/ex/Eval_Examples.thy.
1227 * Normalization by evaluation now allows non-leftlinear equations.
1228 Declare with attribute [code nbe].
1230 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1231 as the structured Isar versions "cases" and "induct", cf. the
1232 corresponding "cases" and "induct" attributes. Mutual induction rules
1233 are now presented as a list of individual projections
1234 (e.g. foo_bar.inducts for types foo and bar); the old format with
1235 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1236 rare situations a different rule is selected --- notably nested tuple
1237 elimination instead of former prod.exhaust: use explicit (case_tac t
1238 rule: prod.exhaust) here.
1240 * Attributes "cases", "induct", "coinduct" support "del" option.
1242 * Removed fact "case_split_thm", which duplicates "case_split".
1244 * The option datatype has been moved to a new theory Option. Renamed
1245 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1247 * New predicate "strict_mono" classifies strict functions on partial
1248 orders. With strict functions on linear orders, reasoning about
1249 (in)equalities is facilitated by theorems "strict_mono_eq",
1250 "strict_mono_less_eq" and "strict_mono_less".
1252 * Some set operations are now proper qualified constants with
1253 authentic syntax. INCOMPATIBILITY:
1264 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1267 * Auxiliary class "itself" has disappeared -- classes without any
1268 parameter are treated as expected by the 'class' command.
1270 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1272 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1273 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1275 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1276 method "approximation". It proves formulas on real values by using
1277 interval arithmetic. In the formulas are also the transcendental
1278 functions sin, cos, tan, atan, ln, exp and the constant pi are
1279 allowed. For examples see
1280 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1282 * Theory "Reflection" now resides in HOL/Library.
1284 * Entry point to Word library now simply named "Word".
1287 * Made source layout more coherent with logical distribution
1290 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1291 src/HOL/Library/Code_Message.thy ~> src/HOL/
1292 src/HOL/Library/GCD.thy ~> src/HOL/
1293 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1294 src/HOL/Library/Parity.thy ~> src/HOL/
1295 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1296 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1297 src/HOL/Real/Lubs.thy ~> src/HOL/
1298 src/HOL/Real/PReal.thy ~> src/HOL/
1299 src/HOL/Real/Rational.thy ~> src/HOL/
1300 src/HOL/Real/RComplete.thy ~> src/HOL/
1301 src/HOL/Real/RealDef.thy ~> src/HOL/
1302 src/HOL/Real/RealPow.thy ~> src/HOL/
1303 src/HOL/Real/Real.thy ~> src/HOL/
1304 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1305 src/HOL/Complex/Complex.thy ~> src/HOL/
1306 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1307 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1308 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1309 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1310 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1311 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1312 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1313 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1314 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1315 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1316 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1317 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1318 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1319 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1320 src/HOL/Real/Float ~> src/HOL/Library/
1321 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1322 src/HOL/Real/RealVector.thy ~> src/HOL/
1324 src/HOL/arith_data.ML ~> src/HOL/Tools
1325 src/HOL/hologic.ML ~> src/HOL/Tools
1326 src/HOL/simpdata.ML ~> src/HOL/Tools
1327 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1328 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1329 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1330 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1331 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1332 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1333 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1335 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1336 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1337 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1338 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1339 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1340 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1342 * If methods "eval" and "evaluation" encounter a structured proof
1343 state with !!/==>, only the conclusion is evaluated to True (if
1344 possible), avoiding strange error messages.
1346 * Method "sizechange" automates termination proofs using (a
1347 modification of) the size-change principle. Requires SAT solver. See
1348 src/HOL/ex/Termination.thy for examples.
1350 * Simplifier: simproc for let expressions now unfolds if bound
1351 variable occurs at most once in let expression body. INCOMPATIBILITY.
1353 * Method "arith": Linear arithmetic now ignores all inequalities when
1354 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1356 * New attribute "arith" for facts that should always be used
1357 automatically by arithmetic. It is intended to be used locally in
1360 assumes [arith]: "x > 0"
1362 Global usage is discouraged because of possible performance impact.
1364 * New classes "top" and "bot" with corresponding operations "top" and
1365 "bot" in theory Orderings; instantiation of class "complete_lattice"
1366 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1368 * Changed definition lemma "less_fun_def" in order to provide an
1369 instance for preorders on functions; use lemma "less_le" instead.
1372 * Theory Orderings: class "wellorder" moved here, with explicit
1373 induction rule "less_induct" as assumption. For instantiation of
1374 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1377 * Theory Orderings: added class "preorder" as superclass of "order".
1378 INCOMPATIBILITY: Instantiation proofs for order, linorder
1379 etc. slightly changed. Some theorems named order_class.* now named
1382 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1385 * Theory Finite_Set: added a new fold combinator of type
1387 ('a => 'b => 'b) => 'b => 'a set => 'b
1389 Occasionally this is more convenient than the old fold combinator
1390 which is now defined in terms of the new one and renamed to
1393 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1394 and "ring_simps" have been replaced by "algebra_simps" (which can be
1395 extended with further lemmas!). At the moment both still exist but
1396 the former will disappear at some point.
1398 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1399 class recpower. Type-specific simp rules for various recpower types
1400 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1402 rat_power_0 -> power_0
1403 rat_power_Suc -> power_Suc
1404 realpow_0 -> power_0
1405 realpow_Suc -> power_Suc
1406 complexpow_0 -> power_0
1407 complexpow_Suc -> power_Suc
1408 power_poly_0 -> power_0
1409 power_poly_Suc -> power_Suc
1411 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1412 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1413 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1414 of lemmas from Divides has been generalized from nat to class
1415 semiring_div. INCOMPATIBILITY. This involves the following theorem
1416 renames resulting from duplicate elimination:
1418 dvd_def_mod ~> dvd_eq_mod_eq_0
1419 zero_dvd_iff ~> dvd_0_left_iff
1420 dvd_0 ~> dvd_0_right
1421 DIVISION_BY_ZERO_DIV ~> div_by_0
1422 DIVISION_BY_ZERO_MOD ~> mod_by_0
1423 mult_div ~> div_mult_self2_is_id
1424 mult_mod ~> mod_mult_self2_is_0
1426 * Theory IntDiv: removed many lemmas that are instances of class-based
1427 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1428 rename old lemmas as follows:
1430 dvd_diff -> nat_dvd_diff
1431 dvd_zminus_iff -> dvd_minus_iff
1432 mod_add1_eq -> mod_add_eq
1433 mod_mult1_eq -> mod_mult_right_eq
1434 mod_mult1_eq' -> mod_mult_left_eq
1435 mod_mult_distrib_mod -> mod_mult_eq
1436 nat_mod_add_left_eq -> mod_add_left_eq
1437 nat_mod_add_right_eq -> mod_add_right_eq
1438 nat_mod_div_trivial -> mod_div_trivial
1439 nat_mod_mod_trivial -> mod_mod_trivial
1440 zdiv_zadd_self1 -> div_add_self1
1441 zdiv_zadd_self2 -> div_add_self2
1442 zdiv_zmult_self1 -> div_mult_self2_is_id
1443 zdiv_zmult_self2 -> div_mult_self1_is_id
1444 zdvd_triv_left -> dvd_triv_left
1445 zdvd_triv_right -> dvd_triv_right
1446 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1447 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1448 zmod_zadd_left_eq -> mod_add_left_eq
1449 zmod_zadd_right_eq -> mod_add_right_eq
1450 zmod_zadd_self1 -> mod_add_self1
1451 zmod_zadd_self2 -> mod_add_self2
1452 zmod_zadd1_eq -> mod_add_eq
1453 zmod_zdiff1_eq -> mod_diff_eq
1454 zmod_zdvd_zmod -> mod_mod_cancel
1455 zmod_zmod_cancel -> mod_mod_cancel
1456 zmod_zmult_self1 -> mod_mult_self2_is_0
1457 zmod_zmult_self2 -> mod_mult_self1_is_0
1460 zdvd_abs1 -> abs_dvd_iff
1461 zdvd_abs2 -> dvd_abs_iff
1462 zdvd_refl -> dvd_refl
1463 zdvd_trans -> dvd_trans
1464 zdvd_zadd -> dvd_add
1465 zdvd_zdiff -> dvd_diff
1466 zdvd_zminus_iff -> dvd_minus_iff
1467 zdvd_zminus2_iff -> minus_dvd_iff
1468 zdvd_zmultD -> dvd_mult_right
1469 zdvd_zmultD2 -> dvd_mult_left
1470 zdvd_zmult_mono -> mult_dvd_mono
1471 zdvd_0_right -> dvd_0_right
1472 zdvd_0_left -> dvd_0_left_iff
1473 zdvd_1_left -> one_dvd
1474 zminus_dvd_iff -> minus_dvd_iff
1476 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1478 * The real numbers offer decimal input syntax: 12.34 is translated
1479 into 1234/10^2. This translation is not reversed upon output.
1481 * Theory Library/Polynomial defines an abstract type 'a poly of
1482 univariate polynomials with coefficients of type 'a. In addition to
1483 the standard ring operations, it also supports div and mod. Code
1484 generation is also supported, using list-style constructors.
1486 * Theory Library/Inner_Product defines a class of real_inner for real
1487 inner product spaces, with an overloaded operation inner :: 'a => 'a
1488 => real. Class real_inner is a subclass of real_normed_vector from
1491 * Theory Library/Product_Vector provides instances for the product
1492 type 'a * 'b of several classes from RealVector and Inner_Product.
1493 Definitions of addition, subtraction, scalar multiplication, norms,
1494 and inner products are included.
1496 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1497 addition to the field operations, numerals and case syntax are also
1500 * Theory Library/Diagonalize provides constructive version of Cantor's
1501 first diagonalization argument.
1503 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1504 zlcm (for int); carried together from various gcd/lcm developements in
1505 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1506 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1507 may recover tupled syntax as follows:
1509 hide (open) const gcd
1510 abbreviation gcd where
1511 "gcd == (%(a, b). GCD.gcd a b)"
1513 GCD.gcd ("gcd '(_, _')")
1515 The same works for lcm, zgcd, zlcm.
1517 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1518 instantiations for algebraic structures. Removed some duplicate
1519 theorems. Changes in simp rules. INCOMPATIBILITY.
1521 * ML antiquotation @{code} takes a constant as argument and generates
1522 corresponding code in background and inserts name of the corresponding
1523 resulting ML value/function/datatype constructor binding in place.
1524 All occurrences of @{code} with a single ML block are generated
1525 simultaneously. Provides a generic and safe interface for
1526 instrumentalizing code generation. See
1527 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1528 In future you ought to refrain from ad-hoc compiling generated SML
1529 code on the ML toplevel. Note that (for technical reasons) @{code}
1530 cannot refer to constants for which user-defined serializations are
1531 set. Refer to the corresponding ML counterpart directly in that
1534 * Command 'rep_datatype': instead of theorem names the command now
1535 takes a list of terms denoting the constructors of the type to be
1536 represented as datatype. The characteristic theorems have to be
1537 proven. INCOMPATIBILITY. Also observe that the following theorems
1538 have disappeared in favour of existing ones:
1540 unit_induct ~> unit.induct
1541 prod_induct ~> prod.induct
1542 sum_induct ~> sum.induct
1543 Suc_Suc_eq ~> nat.inject
1544 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1549 * New locales for orders and lattices where the equivalence relation
1550 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1551 locales use a record structure with field eq for the equivalence.
1553 * New theory of factorial domains.
1555 * Units_l_inv and Units_r_inv are now simp rules by default.
1556 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1557 and/or r_inv will now also require deletion of these lemmas.
1559 * Renamed the following theorems, INCOMPATIBILITY:
1561 UpperD ~> Upper_memD
1562 LowerD ~> Lower_memD
1563 least_carrier ~> least_closed
1564 greatest_carrier ~> greatest_closed
1565 greatest_Lower_above ~> greatest_Lower_below
1566 one_zero ~> carrier_one_zero
1567 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1572 * Nominal datatypes can now contain type-variables.
1574 * Commands 'nominal_inductive' and 'equivariance' work with local
1577 * Nominal primrec can now works with local theory targets and its
1578 specification syntax now conforms to the general format as seen in
1581 * Method "perm_simp" honours the standard simplifier attributes
1582 (no_asm), (no_asm_use) etc.
1584 * The new predicate #* is defined like freshness, except that on the
1585 left hand side can be a set or list of atoms.
1587 * Experimental command 'nominal_inductive2' derives strong induction
1588 principles for inductive definitions. In contrast to
1589 'nominal_inductive', which can only deal with a fixed number of
1590 binders, it can deal with arbitrary expressions standing for sets of
1591 atoms to be avoided. The only inductive definition we have at the
1592 moment that needs this generalisation is the typing rule for Lets in
1595 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1596 -----------------------------------------------------------------
1597 Gamma |- Let x be t1 in t2 : T2
1599 In this rule one wants to avoid all the binders that are introduced by
1600 "close Gamma T1". We are looking for other examples where this
1601 feature might be useful. Please let us know.
1606 * Reimplemented the simplification procedure for proving continuity
1607 subgoals. The new simproc is extensible; users can declare additional
1608 continuity introduction rules with the attribute [cont2cont].
1610 * The continuity simproc now uses a different introduction rule for
1611 solving continuity subgoals on terms with lambda abstractions. In
1612 some rare cases the new simproc may fail to solve subgoals that the
1613 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1614 Potential INCOMPATIBILITY.
1616 * Command 'fixrec': specification syntax now conforms to the general
1617 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1618 examples. INCOMPATIBILITY.
1623 * Proof of Zorn's Lemma for partial orders.
1628 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1629 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1630 depends on multithreading, so timouts will not work before Poly/ML
1633 * High-level support for concurrent ML programming, see
1634 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1635 particularly convenient to organize independent functional
1636 computations. The concept of "synchronized variables" provides a
1637 higher-order interface for components with shared state, avoiding the
1638 delicate details of mutexes and condition variables. (Requires
1639 Poly/ML 5.2.1 or later.)
1641 * ML bindings produced via Isar commands are stored within the Isar
1642 context (theory or proof). Consequently, commands like 'use' and 'ML'
1643 become thread-safe and work with undo as expected (concerning
1644 top-level bindings, not side-effects on global references).
1645 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1646 compiler at runtime; really global bindings need to be given outside a
1647 theory. (Requires Poly/ML 5.2 or later.)
1649 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1650 context. Top-level ML bindings are stored within the proof context in
1651 a purely sequential fashion, disregarding the nested proof structure.
1652 ML bindings introduced by 'ML_prf' are discarded at the end of the
1653 proof. (Requires Poly/ML 5.2 or later.)
1655 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1656 and Method.setup, as well as Isar commands 'attribute_setup' and
1657 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1658 existing code accordingly, or use plain 'setup' together with old
1661 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1662 to 'a -> thm, while results are always tagged with an authentic oracle
1663 name. The Isar command 'oracle' is now polymorphic, no argument type
1664 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1665 accordingly. Note that extra performance may be gained by producing
1666 the cterm carefully, avoiding slow Thm.cterm_of.
1668 * Simplified interface for defining document antiquotations via
1669 ThyOutput.antiquotation, ThyOutput.output, and optionally
1670 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1671 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1674 * More systematic treatment of long names, abstract name bindings, and
1675 name space operations. Basic operations on qualified names have been
1676 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1677 Long_Name.append. Old type bstring has been mostly replaced by
1678 abstract type binding (see structure Binding), which supports precise
1679 qualification by packages and local theory targets, as well as proper
1680 tracking of source positions. INCOMPATIBILITY, need to wrap old
1681 bstring values into Binding.name, or better pass through abstract
1682 bindings everywhere. See further src/Pure/General/long_name.ML,
1683 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1685 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1686 LocalTheory.note etc.) now refer to the *full* internal name, not the
1687 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1689 * Disposed old type and term read functions (Sign.read_def_typ,
1690 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1691 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1692 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1693 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1694 resort for legacy applications.
1696 * Disposed old declarations, tactics, tactic combinators that refer to
1697 the simpset or claset of an implicit theory (such as Addsimps,
1698 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1699 embedded ML text, or local_simpset_of with a proper context passed as
1700 explicit runtime argument.
1702 * Rules and tactics that read instantiations (read_instantiate,
1703 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1704 context, which is required for parsing and type-checking. Moreover,
1705 the variables are specified as plain indexnames, not string encodings
1706 thereof. INCOMPATIBILITY.
1708 * Generic Toplevel.add_hook interface allows to analyze the result of
1709 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1710 for theorem dependency output of transactions resulting in a new
1713 * ML antiquotations: block-structured compilation context indicated by
1714 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1716 @{binding name} - basic name binding
1717 @{let ?pat = term} - term abbreviation (HO matching)
1718 @{note name = fact} - fact abbreviation
1719 @{thm fact} - singleton fact (with attributes)
1720 @{thms fact} - general fact (with attributes)
1721 @{lemma prop by method} - singleton goal
1722 @{lemma prop by meth1 meth2} - singleton goal
1723 @{lemma prop1 ... propN by method} - general goal
1724 @{lemma prop1 ... propN by meth1 meth2} - general goal
1725 @{lemma (open) ...} - open derivation
1730 * The Isabelle "emacs" tool provides a specific interface to invoke
1731 Proof General / Emacs, with more explicit failure if that is not
1732 installed (the old isabelle-interface script silently falls back on
1733 isabelle-process). The PROOFGENERAL_HOME setting determines the
1734 installation location of the Proof General distribution.
1736 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1737 the Isabelle process into a JVM/Scala application. See
1738 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1739 process wrapper has been discontinued.)
1741 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1743 * Various status messages (with exact source position information) are
1744 emitted, if proper markup print mode is enabled. This allows
1745 user-interface components to provide detailed feedback on internal
1750 New in Isabelle2008 (June 2008)
1751 -------------------------------
1755 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1756 and updated, with formally checked references as hyperlinks.
1758 * Theory loader: use_thy (and similar operations) no longer set the
1759 implicit ML context, which was occasionally hard to predict and in
1760 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1761 provides a proper context already.
1763 * Theory loader: old-style ML proof scripts being *attached* to a thy
1764 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1765 'use' within a theory file will do the job.
1767 * Name space merge now observes canonical order, i.e. the second space
1768 is inserted into the first one, while existing entries in the first
1769 space take precedence. INCOMPATIBILITY in rare situations, may try to
1770 swap theory imports.
1772 * Syntax: symbol \<chi> is now considered a letter. Potential
1773 INCOMPATIBILITY in identifier syntax etc.
1775 * Outer syntax: string tokens no longer admit escaped white space,
1776 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1777 white space without escapes.
1779 * Outer syntax: string tokens may contain arbitrary character codes
1780 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1786 * Context-dependent token translations. Default setup reverts locally
1787 fixed variables, and adds hilite markup for undeclared frees.
1789 * Unused theorems can be found using the new command 'unused_thms'.
1790 There are three ways of invoking it:
1793 Only finds unused theorems in the current theory.
1795 (2) unused_thms thy_1 ... thy_n -
1796 Finds unused theorems in the current theory and all of its ancestors,
1797 excluding the theories thy_1 ... thy_n and all of their ancestors.
1799 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1800 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1801 their ancestors, excluding the theories thy_1 ... thy_n and all of
1804 In order to increase the readability of the list produced by
1805 unused_thms, theorems that have been created by a particular instance
1806 of a theory command such as 'inductive' or 'function' are considered
1807 to belong to the same "group", meaning that if at least one theorem in
1808 this group is used, the other theorems in the same group are no longer
1809 reported as unused. Moreover, if all theorems in the group are
1810 unused, only one theorem in the group is displayed.
1812 Note that proof objects have to be switched on in order for
1813 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1814 usually the case when using Proof General with the default settings).
1816 * Authentic naming of facts disallows ad-hoc overwriting of previous
1817 theorems within the same name space. INCOMPATIBILITY, need to remove
1818 duplicate fact bindings, or even accidental fact duplications. Note
1819 that tools may maintain dynamically scoped facts systematically, using
1820 PureThy.add_thms_dynamic.
1822 * Command 'hide' now allows to hide from "fact" name space as well.
1824 * Eliminated destructive theorem database, simpset, claset, and
1825 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1826 update of theories within ML code.
1828 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1829 INCOMPATIBILITY, object-logics depending on former Pure require
1830 additional setup PureThy.old_appl_syntax_setup; object-logics
1831 depending on former CPure need to refer to Pure.
1833 * Commands 'use' and 'ML' are now purely functional, operating on
1834 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1835 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1838 * Command 'setup': discontinued implicit version with ML reference.
1840 * Instantiation target allows for simultaneous specification of class
1841 instance operations together with an instantiation proof.
1842 Type-checking phase allows to refer to class operations uniformly.
1843 See src/HOL/Complex/Complex.thy for an Isar example and
1844 src/HOL/Library/Eval.thy for an ML example.
1846 * Indexing of literal facts: be more serious about including only
1847 facts from the visible specification/proof context, but not the
1848 background context (locale etc.). Affects `prop` notation and method
1849 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1852 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1853 "(open)" option, which used to expose internal bound variables to the
1856 * Isar statements: removed obsolete case "rule_context".
1857 INCOMPATIBILITY, better use explicit fixes/assumes.
1859 * Locale proofs: default proof step now includes 'unfold_locales';
1860 hence 'proof' without argument may be used to unfold locale
1864 *** Document preparation ***
1866 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1867 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1868 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1869 spot); renamed link color from "darkblue" to "linkcolor" (default
1870 value unchanged, can be redefined via \definecolor); no longer sets
1871 "a4paper" option (unnecessary or even intrusive).
1873 * Antiquotation @{lemma A method} proves proposition A by the given
1874 method (either a method name or a method name plus (optional) method
1875 arguments in parentheses) and prints A just like @{prop A}.
1880 * New primrec package. Specification syntax conforms in style to
1881 definition/function/.... No separate induction rule is provided. The
1882 "primrec" command distinguishes old-style and new-style specifications
1883 by syntax. The former primrec package is now named OldPrimrecPackage.
1884 When adjusting theories, beware: constants stemming from new-style
1885 primrec specifications have authentic syntax.
1887 * Metis prover is now an order of magnitude faster, and also works
1888 with multithreading.
1890 * Metis: the maximum number of clauses that can be produced from a
1891 theorem is now given by the attribute max_clauses. Theorems that
1892 exceed this number are ignored, with a warning printed.
1894 * Sledgehammer no longer produces structured proofs by default. To
1895 enable, declare [[sledgehammer_full = true]]. Attributes
1896 reconstruction_modulus, reconstruction_sorts renamed
1897 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1899 * Method "induct_scheme" derives user-specified induction rules
1900 from well-founded induction and completeness of patterns. This factors
1901 out some operations that are done internally by the function package
1902 and makes them available separately. See
1903 src/HOL/ex/Induction_Scheme.thy for examples.
1905 * More flexible generation of measure functions for termination
1906 proofs: Measure functions can be declared by proving a rule of the
1907 form "is_measure f" and giving it the [measure_function] attribute.
1908 The "is_measure" predicate is logically meaningless (always true), and
1909 just guides the heuristic. To find suitable measure functions, the
1910 termination prover sets up the goal "is_measure ?f" of the appropriate
1911 type and generates all solutions by prolog-style backwards proof using
1914 This setup also deals with rules like
1916 "is_measure f ==> is_measure (list_size f)"
1918 which accommodates nested datatypes that recurse through lists.
1919 Similar rules are predeclared for products and option types.
1921 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1925 - Definitions of overloaded constants on sets have to be replaced by
1926 definitions on => and bool.
1928 - Some definitions of overloaded operators on sets can now be proved
1929 using the definitions of the operators on => and bool. Therefore,
1930 the following theorems have been renamed:
1932 subset_def -> subset_eq
1933 psubset_def -> psubset_eq
1934 set_diff_def -> set_diff_eq
1935 Compl_def -> Compl_eq
1936 Sup_set_def -> Sup_set_eq
1937 Inf_set_def -> Inf_set_eq
1938 sup_set_def -> sup_set_eq
1939 inf_set_def -> inf_set_eq
1941 - Due to the incompleteness of the HO unification algorithm, some
1942 rules such as subst may require manual instantiation, if some of
1943 the unknowns in the rule is a set.
1945 - Higher order unification and forward proofs:
1948 have "P (S::'a set)" <...>
1949 then have "EX S. P S" ..
1951 no longer works (due to the incompleteness of the HO unification
1952 algorithm) and must be replaced by the pattern
1959 - Calculational reasoning with subst (or similar rules):
1962 have "P (S::'a set)" <...>
1963 also have "S = T" <...>
1964 finally have "P T" .
1966 no longer works (for similar reasons as the previous example) and
1967 must be replaced by something like
1969 have "P (S::'a set)" <...>
1970 moreover have "S = T" <...>
1971 ultimately have "P T" by simp
1973 - Tactics or packages written in ML code:
1974 Code performing pattern matching on types via
1976 Type ("set", [T]) => ...
1978 must be rewritten. Moreover, functions like strip_type or
1979 binder_types no longer return the right value when applied to a
1982 T1 => ... => Tn => U => bool
1986 T1 => ... => Tn => U set
1988 * Merged theories Wellfounded_Recursion, Accessible_Part and
1989 Wellfounded_Relations to theory Wellfounded.
1991 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1993 * Class finite no longer treats UNIV as class parameter. Use class
1994 enum from theory Library/Enum instead to achieve a similar effect.
1997 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1998 and "Cons". INCOMPATIBILITY.
2000 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2001 Potential INCOMPATIBILITY.
2003 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2004 injective_fst_snd removed, use split_eta and prod_eqI instead.
2005 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2007 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2008 the same name in theory Orderings:
2018 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2019 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2020 and different variable names.
2022 * Library/Option_ord.thy: Canonical order on option type.
2024 * Library/RBT.thy: Red-black trees, an efficient implementation of
2027 * Library/Countable.thy: Type class for countable types.
2029 * Theory Int: The representation of numerals has changed. The infix
2030 operator BIT and the bit datatype with constructors B0 and B1 have
2031 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2032 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2033 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2036 * Theory Nat: definition of <= and < on natural numbers no longer
2037 depend on well-founded relations. INCOMPATIBILITY. Definitions
2038 le_def and less_def have disappeared. Consider lemmas not_less
2039 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2041 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2042 (whose purpose mainly is for various fold_set functionals) have been
2043 abandoned in favor of the existing algebraic classes
2044 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2045 lower_semilattice (resp. upper_semilattice) and linorder.
2048 * Theory Transitive_Closure: induct and cases rules now declare proper
2049 case_names ("base" and "step"). INCOMPATIBILITY.
2051 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2052 lattices. The form set-specific version is available as
2053 Inductive.lfp_ordinal_induct_set.
2055 * Renamed theorems "power.simps" to "power_int.simps".
2058 * Class semiring_div provides basic abstract properties of semirings
2059 with division and modulo operations. Subsumes former class dvd_mod.
2061 * Merged theories IntDef, Numeral and IntArith into unified theory
2062 Int. INCOMPATIBILITY.
2064 * Theory Library/Code_Index: type "index" now represents natural
2065 numbers rather than integers. INCOMPATIBILITY.
2067 * New class "uminus" with operation "uminus" (split of from class
2068 "minus" which now only has operation "minus", binary).
2071 * Constants "card", "internal_split", "option_map" now with authentic
2072 syntax. INCOMPATIBILITY.
2074 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2075 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2076 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2077 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2078 Sup_set_def, le_def, less_def, option_map_def now with object
2079 equality. INCOMPATIBILITY.
2081 * Records. Removed K_record, and replaced it by pure lambda term
2082 %x. c. The simplifier setup is now more robust against eta expansion.
2083 INCOMPATIBILITY: in cases explicitly referring to K_record.
2085 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2087 * Library/ListVector: new theory of arithmetic vector operations.
2089 * Library/Order_Relation: new theory of various orderings as sets of
2090 pairs. Defines preorders, partial orders, linear orders and
2091 well-orders on sets and on types.
2096 * Renamed some theories to allow to loading both ZF and HOL in the
2099 Datatype -> Datatype_ZF
2100 Inductive -> Inductive_ZF
2107 INCOMPATIBILITY: ZF theories that import individual theories below
2108 Main might need to be adapted. Regular theory Main is still
2109 available, as trivial extension of Main_ZF.
2114 * ML within Isar: antiquotation @{const name} or @{const
2115 name(typargs)} produces statically-checked Const term.
2117 * Functor NamedThmsFun: data is available to the user as dynamic fact
2118 (of the same name). Removed obsolete print command.
2120 * Removed obsolete "use_legacy_bindings" function.
2122 * The ``print mode'' is now a thread-local value derived from a global
2123 template (the former print_mode reference), thus access becomes
2124 non-critical. The global print_mode reference is for session
2125 management only; user-code should use print_mode_value,
2126 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2128 * Functions system/system_out provide a robust way to invoke external
2129 shell commands, with propagation of interrupts (requires Poly/ML
2130 5.2.1). Do not use OS.Process.system etc. from the basis library!
2135 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2136 in accordance with Proof General 3.7, which prefers GNU emacs.
2138 * isatool tty runs Isabelle process with plain tty interaction;
2139 optional line editor may be specified via ISABELLE_LINE_EDITOR
2140 setting, the default settings attempt to locate "ledit" and "rlwrap".
2142 * isatool browser now works with Cygwin as well, using general
2143 "javapath" function defined in Isabelle process environment.
2145 * YXML notation provides a simple and efficient alternative to
2146 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2147 isatool yxml as described in the Isabelle system manual.
2149 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2150 provides general wrapper for managing an Isabelle process in a robust
2151 fashion, with ``cooked'' output from stdin/stderr.
2153 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2154 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2156 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2157 way of changing the user's settings is via
2158 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2161 * Multithreading.max_threads := 0 refers to the number of actual CPU
2162 cores of the underlying machine, which is a good starting point for
2163 optimal performance tuning. The corresponding usedir option -M allows
2164 "max" as an alias for "0". WARNING: does not work on certain versions
2165 of Mac OS (with Poly/ML 5.1).
2167 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2168 adverse effect of Isabelle flooding interactive front-ends (notably
2169 ProofGeneral / XEmacs).
2173 New in Isabelle2007 (November 2007)
2174 -----------------------------------
2178 * More uniform information about legacy features, notably a
2179 warning/error of "Legacy feature: ...", depending on the state of the
2180 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2181 legacy features will disappear eventually.
2183 * Theory syntax: the header format ``theory A = B + C:'' has been
2184 discontinued in favour of ``theory A imports B C begin''. Use isatool
2185 fixheaders to convert existing theory files. INCOMPATIBILITY.
2187 * Theory syntax: the old non-Isar theory file format has been
2188 discontinued altogether. Note that ML proof scripts may still be used
2189 with Isar theories; migration is usually quite simple with the ML
2190 function use_legacy_bindings. INCOMPATIBILITY.
2192 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2193 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2196 * Theory loader: be more serious about observing the static theory
2197 header specifications (including optional directories), but not the
2198 accidental file locations of previously successful loads. The strict
2199 update policy of former update_thy is now already performed by
2200 use_thy, so the former has been removed; use_thys updates several
2201 theories simultaneously, just as 'imports' within a theory header
2202 specification, but without merging the results. Potential
2203 INCOMPATIBILITY: may need to refine theory headers and commands
2204 ROOT.ML which depend on load order.
2206 * Theory loader: optional support for content-based file
2207 identification, instead of the traditional scheme of full physical
2208 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2209 (cf. the system manual). The new scheme allows to work with
2210 non-finished theories in persistent session images, such that source
2211 files may be moved later on without requiring reloads.
2213 * Theory loader: old-style ML proof scripts being *attached* to a thy
2214 file (with the same base name as the theory) are considered a legacy
2215 feature, which will disappear eventually. Even now, the theory loader
2216 no longer maintains dependencies on such files.
2218 * Syntax: the scope for resolving ambiguities via type-inference is
2219 now limited to individual terms, instead of whole simultaneous
2220 specifications as before. This greatly reduces the complexity of the
2221 syntax module and improves flexibility by separating parsing and
2222 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2223 'fixes' etc.) are required in rare situations.
2225 * Syntax: constants introduced by new-style packages ('definition',
2226 'abbreviation' etc.) are passed through the syntax module in
2227 ``authentic mode''. This means that associated mixfix annotations
2228 really stick to such constants, independently of potential name space
2229 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2230 trees are represented slightly differently, may need to adapt syntax
2231 translations accordingly. Use CONST marker in 'translations' and
2232 @{const_syntax} antiquotation in 'parse_translation' etc.
2234 * Legacy goal package: reduced interface to the bare minimum required
2235 to keep existing proof scripts running. Most other user-level
2236 functions are now part of the OldGoals structure, which is *not* open
2237 by default (consider isatool expandshort before open OldGoals).
2238 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2239 these tend to cause confusion about the actual goal (!) context being
2240 used here, which is not necessarily the same as the_context().
2242 * Command 'find_theorems': supports "*" wild-card in "name:"
2243 criterion; "with_dups" option. Certain ProofGeneral versions might
2244 support a specific search form (see ProofGeneral/CHANGES).
2246 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2247 by default, which means that "prems" (and also "fixed variables") are
2248 suppressed from proof state output. Note that the ProofGeneral
2249 settings mechanism allows to change and save options persistently, but
2250 older versions of Isabelle will fail to start up if a negative prems
2253 * Local theory targets may be specified by non-nested blocks of
2254 ``context/locale/class ... begin'' followed by ``end''. The body may
2255 contain definitions, theorems etc., including any derived mechanism
2256 that has been implemented on top of these primitives. This concept
2257 generalizes the existing ``theorem (in ...)'' towards more versatility
2260 * Proof General interface: proper undo of final 'end' command;
2261 discontinued Isabelle/classic mode (ML proof scripts).
2264 *** Document preparation ***
2266 * Added antiquotation @{theory name} which prints the given name,
2267 after checking that it refers to a valid ancestor theory in the
2270 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2271 check the given source text as ML type/structure, printing verbatim.
2273 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2274 "c args == rhs" given in the current context. (Any number of
2275 arguments may be given on the LHS.)
2280 * The 'class' package offers a combination of axclass and locale to
2281 achieve Haskell-like type classes in Isabelle. Definitions and
2282 theorems within a class context produce both relative results (with
2283 implicit parameters according to the locale context), and polymorphic
2284 constants with qualified polymorphism (according to the class
2285 context). Within the body context of a 'class' target, a separate
2286 syntax layer ("user space type system") takes care of converting
2287 between global polymorphic consts and internal locale representation.
2288 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2289 "isatool doc classes" provides a tutorial.
2291 * Generic code generator framework allows to generate executable
2292 code for ML and Haskell (including Isabelle classes). A short usage
2295 internal compilation:
2296 export_code <list of constants (term syntax)> in SML
2297 writing SML code to a file:
2298 export_code <list of constants (term syntax)> in SML <filename>
2299 writing OCaml code to a file:
2300 export_code <list of constants (term syntax)> in OCaml <filename>
2301 writing Haskell code to a bunch of files:
2302 export_code <list of constants (term syntax)> in Haskell <filename>
2304 evaluating closed propositions to True/False using code generation:
2307 Reasonable default setup of framework in HOL.
2309 Theorem attributs for selecting and transforming function equations theorems:
2311 [code fun]: select a theorem as function equation for a specific constant
2312 [code fun del]: deselect a theorem as function equation for a specific constant
2313 [code inline]: select an equation theorem for unfolding (inlining) in place
2314 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2316 User-defined serializations (target in {SML, OCaml, Haskell}):
2318 code_const <and-list of constants (term syntax)>
2319 {(target) <and-list of const target syntax>}+
2321 code_type <and-list of type constructors>
2322 {(target) <and-list of type target syntax>}+
2324 code_instance <and-list of instances>
2326 where instance ::= <type constructor> :: <class>
2328 code_class <and_list of classes>
2329 {(target) <and-list of class target syntax>}+
2330 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2332 code_instance and code_class only are effective to target Haskell.
2334 For example usage see src/HOL/ex/Codegenerator.thy and
2335 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2336 generation from Isabelle/HOL theories is available via "isatool doc
2339 * Code generator: consts in 'consts_code' Isar commands are now
2340 referred to by usual term syntax (including optional type
2343 * Command 'no_translations' removes translation rules from theory
2346 * Overloaded definitions are now actually checked for acyclic
2347 dependencies. The overloading scheme is slightly more general than
2348 that of Haskell98, although Isabelle does not demand an exact
2349 correspondence to type class and instance declarations.
2350 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2351 exotic versions of overloading -- at the discretion of the user!
2353 Polymorphic constants are represented via type arguments, i.e. the
2354 instantiation that matches an instance against the most general
2355 declaration given in the signature. For example, with the declaration
2356 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2357 as c(nat). Overloading is essentially simultaneous structural
2358 recursion over such type arguments. Incomplete specification patterns
2359 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2360 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2361 Command 'print_theory' outputs the normalized system of recursive
2362 equations, see section "definitions".
2364 * Configuration options are maintained within the theory or proof
2365 context (with name and type bool/int/string), providing a very simple
2366 interface to a poor-man's version of general context data. Tools may
2367 declare options in ML (e.g. using Attrib.config_int) and then refer to
2368 these values using Config.get etc. Users may change options via an
2369 associated attribute of the same name. This form of context
2370 declaration works particularly well with commands 'declare' or
2371 'using', for example ``declare [[foo = 42]]''. Thus it has become
2372 very easy to avoid global references, which would not observe Isar
2373 toplevel undo/redo and fail to work with multithreading.
2375 Various global ML references of Pure and HOL have been turned into
2376 configuration options:
2378 Unify.search_bound unify_search_bound
2379 Unify.trace_bound unify_trace_bound
2380 Unify.trace_simp unify_trace_simp
2381 Unify.trace_types unify_trace_types
2382 Simplifier.simp_depth_limit simp_depth_limit
2383 Blast.depth_limit blast_depth_limit
2384 DatatypeProp.dtK datatype_distinctness_limit
2385 fast_arith_neq_limit fast_arith_neq_limit
2386 fast_arith_split_limit fast_arith_split_limit
2388 * Named collections of theorems may be easily installed as context
2389 data using the functor NamedThmsFun (see also
2390 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2391 attributes; there is also a toplevel print command. This facility is
2392 just a common case of general context data, which is the preferred way
2393 for anything more complex than just a list of facts in canonical
2396 * Isar: command 'declaration' augments a local theory by generic
2397 declaration functions written in ML. This enables arbitrary content
2398 being added to the context, depending on a morphism that tells the
2399 difference of the original declaration context wrt. the application
2400 context encountered later on.
2402 * Isar: proper interfaces for simplification procedures. Command
2403 'simproc_setup' declares named simprocs (with match patterns, and body
2404 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2405 context. ML antiquotation @{simproc name} retrieves named simprocs.
2407 * Isar: an extra pair of brackets around attribute declarations
2408 abbreviates a theorem reference involving an internal dummy fact,
2409 which will be ignored later --- only the effect of the attribute on
2410 the background context will persist. This form of in-place
2411 declarations is particularly useful with commands like 'declare' and
2412 'using', for example ``have A using [[simproc a]] by simp''.
2414 * Isar: method "assumption" (and implicit closing of subproofs) now
2415 takes simple non-atomic goal assumptions into account: after applying
2416 an assumption as a rule the resulting subgoals are solved by atomic
2417 assumption steps. This is particularly useful to finish 'obtain'
2418 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2419 without referring to the original premise "!!x. P x ==> thesis" in the
2420 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2423 * Isar: implicit use of prems from the Isar proof context is
2424 considered a legacy feature. Common applications like ``have A .''
2425 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2426 referencing facts explicitly here improves readability and
2427 maintainability of proof texts.
2429 * Isar: improper proof element 'guess' is like 'obtain', but derives
2430 the obtained context from the course of reasoning! For example:
2432 assume "EX x y. A x & B y" -- "any previous fact"
2433 then guess x and y by clarify
2435 This technique is potentially adventurous, depending on the facts and
2436 proof tools being involved here.
2438 * Isar: known facts from the proof context may be specified as literal
2439 propositions, using ASCII back-quote syntax. This works wherever
2440 named facts used to be allowed so far, in proof commands, proof
2441 methods, attributes etc. Literal facts are retrieved from the context
2442 according to unification of type and term parameters. For example,
2443 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2444 theorems in the current context, then these are valid literal facts:
2445 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2447 There is also a proof method "fact" which does the same composition
2448 for explicit goal states, e.g. the following proof texts coincide with
2449 certain special cases of literal facts:
2451 have "A" by fact == note `A`
2452 have "A ==> B" by fact == note `A ==> B`
2453 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2454 have "P a ==> Q a" by fact == note `P a ==> Q a`
2456 * Isar: ":" (colon) is no longer a symbolic identifier character in
2457 outer syntax. Thus symbolic identifiers may be used without
2458 additional white space in declarations like this: ``assume *: A''.
2460 * Isar: 'print_facts' prints all local facts of the current context,
2461 both named and unnamed ones.
2463 * Isar: 'def' now admits simultaneous definitions, e.g.:
2465 def x == "t" and y == "u"
2467 * Isar: added command 'unfolding', which is structurally similar to
2468 'using', but affects both the goal state and facts by unfolding given
2469 rewrite rules. Thus many occurrences of the 'unfold' method or
2470 'unfolded' attribute may be replaced by first-class proof text.
2472 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2473 and command 'unfolding' now all support object-level equalities
2474 (potentially conditional). The underlying notion of rewrite rule is
2475 analogous to the 'rule_format' attribute, but *not* that of the
2476 Simplifier (which is usually more generous).
2478 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2479 premises of a theorem by n. Useful in conjunction with drule.
2481 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2482 method expression within a sandbox consisting of the first N
2483 sub-goals, which need to exist. For example, ``simp_all [3]''
2484 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2485 simplifies all new goals that emerge from applying rule foo to the
2486 originally first one.
2488 * Isar: schematic goals are no longer restricted to higher-order
2489 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2492 * Isar: the conclusion of a long theorem statement is now either
2493 'shows' (a simultaneous conjunction, as before), or 'obtains'
2494 (essentially a disjunction of cases with local parameters and
2495 assumptions). The latter allows to express general elimination rules
2496 adequately; in this notation common elimination rules look like this:
2498 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2500 obtains x where "P x"
2502 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2506 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2512 The subsequent classical rules even refer to the formal "thesis"
2515 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2518 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2519 obtains "thesis ==> something"
2521 The actual proof of an 'obtains' statement is analogous to that of the
2522 Isar proof element 'obtain', only that there may be several cases.
2523 Optional case names may be specified in parentheses; these will be
2524 available both in the present proof and as annotations in the
2525 resulting rule, for later use with the 'cases' method (cf. attribute
2528 * Isar: the assumptions of a long theorem statement are available as
2529 "assms" fact in the proof context. This is more appropriate than the
2530 (historical) "prems", which refers to all assumptions of the current
2531 context, including those from the target locale, proof body etc.
2533 * Isar: 'print_statement' prints theorems from the current theory or
2534 proof context in long statement form, according to the syntax of a
2537 * Isar: 'obtain' takes an optional case name for the local context
2538 introduction rule (default "that").
2540 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2541 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2544 * Pure: syntax "CONST name" produces a fully internalized constant
2545 according to the current context. This is particularly useful for
2546 syntax translations that should refer to internal constant
2547 representations independently of name spaces.
2549 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2550 instead of "FOO ". This allows multiple binder declarations to coexist
2551 in the same context. INCOMPATIBILITY.
2553 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2554 primitive that also works in a locale context (both for constants and
2555 fixed variables). Type declaration and internal syntactic representation
2556 of given constants retrieved from the context. Likewise, the
2557 'no_notation' command allows to remove given syntax annotations from the
2560 * Isar/locales: new derived specification elements 'axiomatization',
2561 'definition', 'abbreviation', which support type-inference, admit
2562 object-level specifications (equality, equivalence). See also the
2563 isar-ref manual. Examples:
2566 eq (infix "===" 50) where
2567 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2569 definition "f x y = x + y + 1"
2570 definition g where "g x = f x x"
2573 neq (infix "=!=" 50) where
2574 "x =!= y == ~ (x === y)"
2576 These specifications may be also used in a locale context. Then the
2577 constants being introduced depend on certain fixed parameters, and the
2578 constant name is qualified by the locale base name. An internal
2579 abbreviation takes care for convenient input and output, making the
2580 parameters implicit and using the original short name. See also
2581 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2582 entities from a monomorphic theory.
2584 Presently, abbreviations are only available 'in' a target locale, but
2585 not inherited by general import expressions. Also note that
2586 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2587 'translations' in common applications. The "no_abbrevs" print mode
2588 prevents folding of abbreviations in term output.
2590 Concrete syntax is attached to specified constants in internal form,
2591 independently of name spaces. The parse tree representation is
2592 slightly different -- use 'notation' instead of raw 'syntax', and
2593 'translations' with explicit "CONST" markup to accommodate this.
2595 * Pure/Isar: unified syntax for new-style specification mechanisms
2596 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2597 full type inference and dummy patterns ("_"). For example:
2599 definition "K x _ = x"
2601 inductive conj for A B
2602 where "A ==> B ==> conj A B"
2604 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2605 the current context. Print mode "no_abbrevs" prevents inversion of
2606 abbreviations on output.
2608 * Isar/locales: improved parameter handling: use of locales "var" and
2609 "struct" no longer necessary; - parameter renamings are no longer
2610 required to be injective. For example, this allows to define
2611 endomorphisms as locale endom = homom mult mult h.
2613 * Isar/locales: changed the way locales with predicates are defined.
2614 Instead of accumulating the specification, the imported expression is
2615 now an interpretation. INCOMPATIBILITY: different normal form of
2616 locale expressions. In particular, in interpretations of locales with
2617 predicates, goals repesenting already interpreted fragments are not
2618 removed automatically. Use methods `intro_locales' and
2619 `unfold_locales'; see below.
2621 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2622 provide backward reasoning on locales predicates. The methods are
2623 aware of interpretations and discharge corresponding goals.
2624 `intro_locales' is less aggressive then `unfold_locales' and does not
2625 unfold predicates to assumptions.
2627 * Isar/locales: the order in which locale fragments are accumulated
2628 has changed. This enables to override declarations from fragments due
2629 to interpretations -- for example, unwanted simp rules.
2631 * Isar/locales: interpretation in theories and proof contexts has been
2632 extended. One may now specify (and prove) equations, which are
2633 unfolded in interpreted theorems. This is useful for replacing
2634 defined concepts (constants depending on locale parameters) by
2635 concepts already existing in the target context. Example:
2637 interpretation partial_order ["op <= :: [int, int] => bool"]
2638 where "partial_order.less (op <=) (x::int) y = (x < y)"
2640 Typically, the constant `partial_order.less' is created by a
2641 definition specification element in the context of locale
2644 * Method "induct": improved internal context management to support
2645 local fixes and defines on-the-fly. Thus explicit meta-level
2646 connectives !! and ==> are rarely required anymore in inductive goals
2647 (using object-logic connectives for this purpose has been long
2648 obsolete anyway). Common proof patterns are explained in
2649 src/HOL/Induct/Common_Patterns.thy, see also
2650 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2653 * Method "induct": improved handling of simultaneous goals. Instead of
2654 introducing object-level conjunction, the statement is now split into
2655 several conclusions, while the corresponding symbolic cases are nested
2656 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2657 see src/HOL/Induct/Common_Patterns.thy, for example.
2659 * Method "induct": mutual induction rules are now specified as a list
2660 of rule sharing the same induction cases. HOL packages usually provide
2661 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2662 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2663 mutual induction rules differently, i.e. like this:
2665 (induct rule: foo_bar.inducts)
2666 (induct set: foo bar)
2667 (induct pred: foo bar)
2668 (induct type: foo bar)
2670 The ML function ProjectRule.projections turns old-style rules into the
2673 * Method "coinduct": dual of induction, see
2674 src/HOL/Library/Coinductive_List.thy for various examples.
2676 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2677 considered a legacy feature.
2679 * Attribute "symmetric" produces result with standardized schematic
2680 variables (index 0). Potential INCOMPATIBILITY.
2682 * Simplifier: by default the simplifier trace only shows top level
2683 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2684 default. Thus there is less danger of being flooded by the trace. The
2685 trace indicates where parts have been suppressed.
2687 * Provers/classical: removed obsolete classical version of elim_format
2688 attribute; classical elim/dest rules are now treated uniformly when
2689 manipulating the claset.
2691 * Provers/classical: stricter checks to ensure that supplied intro,
2692 dest and elim rules are well-formed; dest and elim rules must have at
2695 * Provers/classical: attributes dest/elim/intro take an optional
2696 weight argument for the rule (just as the Pure versions). Weights are
2697 ignored by automated tools, but determine the search order of single
2700 * Syntax: input syntax now supports dummy variable binding "%_. b",
2701 where the body does not mention the bound variable. Note that dummy
2702 patterns implicitly depend on their context of bounds, which makes
2703 "{_. _}" match any set comprehension as expected. Potential
2704 INCOMPATIBILITY -- parse translations need to cope with syntactic
2705 constant "_idtdummy" in the binding position.
2707 * Syntax: removed obsolete syntactic constant "_K" and its associated
2708 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2709 for example "A -> B" => "Pi A (%_. B)".
2711 * Pure: 'class_deps' command visualizes the subclass relation, using
2712 the graph browser tool.
2714 * Pure: 'print_theory' now suppresses certain internal declarations by
2715 default; use '!' option for full details.
2720 * Method "metis" proves goals by applying the Metis general-purpose
2721 resolution prover (see also http://gilith.com/software/metis/).
2722 Examples are in the directory MetisExamples. WARNING: the
2723 Isabelle/HOL-Metis integration does not yet work properly with
2726 * Command 'sledgehammer' invokes external automatic theorem provers as
2727 background processes. It generates calls to the "metis" method if
2728 successful. These can be pasted into the proof. Users do not have to
2729 wait for the automatic provers to return. WARNING: does not really
2730 work with multi-threading.
2732 * New "auto_quickcheck" feature tests outermost goal statements for
2733 potential counter-examples. Controlled by ML references
2734 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2735 5000 milliseconds). Fails silently if statements is outside of
2736 executable fragment, or any other codgenerator problem occurs.
2738 * New constant "undefined" with axiom "undefined x = undefined".
2740 * Added class "HOL.eq", allowing for code generation with polymorphic
2743 * Some renaming of class constants due to canonical name prefixing in
2744 the new 'class' package:
2746 HOL.abs ~> HOL.abs_class.abs
2747 HOL.divide ~> HOL.divide_class.divide
2748 0 ~> HOL.zero_class.zero
2749 1 ~> HOL.one_class.one
2750 op + ~> HOL.plus_class.plus
2751 op - ~> HOL.minus_class.minus
2752 uminus ~> HOL.minus_class.uminus
2753 op * ~> HOL.times_class.times
2754 op < ~> HOL.ord_class.less
2755 op <= > HOL.ord_class.less_eq
2756 Nat.power ~> Power.power_class.power
2757 Nat.size ~> Nat.size_class.size
2758 Numeral.number_of ~> Numeral.number_class.number_of
2759 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2760 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2761 Orderings.min ~> Orderings.ord_class.min
2762 Orderings.max ~> Orderings.ord_class.max
2763 Divides.op div ~> Divides.div_class.div
2764 Divides.op mod ~> Divides.div_class.mod
2765 Divides.op dvd ~> Divides.div_class.dvd
2767 INCOMPATIBILITY. Adaptions may be required in the following cases:
2769 a) User-defined constants using any of the names "plus", "minus",
2770 "times", "less" or "less_eq". The standard syntax translations for
2771 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2774 b) Variables named "plus", "minus", "times", "less", "less_eq"
2775 INCOMPATIBILITY: use more specific names.
2777 c) Permutative equations (e.g. "a + b = b + a")
2778 Since the change of names also changes the order of terms, permutative
2779 rewrite rules may get applied in a different order. Experience shows
2780 that this is rarely the case (only two adaptions in the whole Isabelle
2781 distribution). INCOMPATIBILITY: rewrite proofs
2783 d) ML code directly refering to constant names
2784 This in general only affects hand-written proof tactics, simprocs and
2785 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2786 Consider using @{const_name} antiquotation.
2788 * New class "default" with associated constant "default".
2790 * Function "sgn" is now overloaded and available on int, real, complex
2791 (and other numeric types), using class "sgn". Two possible defs of
2792 sgn are given as equational assumptions in the classes sgn_if and
2793 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2796 * Locale "partial_order" now unified with class "order" (cf. theory
2797 Orderings), added parameter "less". INCOMPATIBILITY.
2799 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2800 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2801 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2803 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2804 changed order of proof goals in instance proofs.
2806 * The transitivity reasoner for partial and linear orders is set up
2807 for classes "order" and "linorder". Instances of the reasoner are available
2808 in all contexts importing or interpreting the corresponding locales.
2809 Method "order" invokes the reasoner separately; the reasoner
2810 is also integrated with the Simplifier as a solver. Diagnostic
2811 command 'print_orders' shows the available instances of the reasoner
2812 in the current context.
2814 * Localized monotonicity predicate in theory "Orderings"; integrated
2815 lemmas max_of_mono and min_of_mono with this predicate.
2818 * Formulation of theorem "dense" changed slightly due to integration
2819 with new class dense_linear_order.
2821 * Uniform lattice theory development in HOL.
2823 constants "meet" and "join" now named "inf" and "sup"
2824 constant "Meet" now named "Inf"
2826 classes "meet_semilorder" and "join_semilorder" now named
2827 "lower_semilattice" and "upper_semilattice"
2828 class "lorder" now named "lattice"
2829 class "comp_lat" now named "complete_lattice"
2831 Instantiation of lattice classes allows explicit definitions
2832 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2834 INCOMPATIBILITY. Theorem renames:
2836 meet_left_le ~> inf_le1
2837 meet_right_le ~> inf_le2
2838 join_left_le ~> sup_ge1
2839 join_right_le ~> sup_ge2
2840 meet_join_le ~> inf_sup_ord
2843 le_meet ~> le_inf_iff
2844 le_join ~> ge_sup_conv
2845 meet_idempotent ~> inf_idem
2846 join_idempotent ~> sup_idem
2847 meet_comm ~> inf_commute
2848 join_comm ~> sup_commute
2849 meet_leI1 ~> le_infI1
2850 meet_leI2 ~> le_infI2
2851 le_joinI1 ~> le_supI1
2852 le_joinI2 ~> le_supI2
2853 meet_assoc ~> inf_assoc
2854 join_assoc ~> sup_assoc
2855 meet_left_comm ~> inf_left_commute
2856 meet_left_idempotent ~> inf_left_idem
2857 join_left_comm ~> sup_left_commute
2858 join_left_idempotent ~> sup_left_idem
2861 le_def_meet ~> le_iff_inf
2862 le_def_join ~> le_iff_sup
2863 join_absorp2 ~> sup_absorb2
2864 join_absorp1 ~> sup_absorb1
2865 meet_absorp1 ~> inf_absorb1
2866 meet_absorp2 ~> inf_absorb2
2867 meet_join_absorp ~> inf_sup_absorb
2868 join_meet_absorp ~> sup_inf_absorb
2869 distrib_join_le ~> distrib_sup_le
2870 distrib_meet_le ~> distrib_inf_le
2872 add_meet_distrib_left ~> add_inf_distrib_left
2873 add_join_distrib_left ~> add_sup_distrib_left
2874 is_join_neg_meet ~> is_join_neg_inf
2875 is_meet_neg_join ~> is_meet_neg_sup
2876 add_meet_distrib_right ~> add_inf_distrib_right
2877 add_join_distrib_right ~> add_sup_distrib_right
2878 add_meet_join_distribs ~> add_sup_inf_distribs
2879 join_eq_neg_meet ~> sup_eq_neg_inf
2880 meet_eq_neg_join ~> inf_eq_neg_sup
2881 add_eq_meet_join ~> add_eq_inf_sup
2882 meet_0_imp_0 ~> inf_0_imp_0
2883 join_0_imp_0 ~> sup_0_imp_0
2884 meet_0_eq_0 ~> inf_0_eq_0
2885 join_0_eq_0 ~> sup_0_eq_0
2886 neg_meet_eq_join ~> neg_inf_eq_sup
2887 neg_join_eq_meet ~> neg_sup_eq_inf
2888 join_eq_if ~> sup_eq_if
2890 mono_meet ~> mono_inf
2891 mono_join ~> mono_sup
2892 meet_bool_eq ~> inf_bool_eq
2893 join_bool_eq ~> sup_bool_eq
2894 meet_fun_eq ~> inf_fun_eq
2895 join_fun_eq ~> sup_fun_eq
2896 meet_set_eq ~> inf_set_eq
2897 join_set_eq ~> sup_set_eq
2898 meet1_iff ~> inf1_iff
2899 meet2_iff ~> inf2_iff
2908 join1_iff ~> sup1_iff
2909 join2_iff ~> sup2_iff
2919 is_meet_Meet ~> is_meet_Inf
2920 Meet_bool_def ~> Inf_bool_def
2921 Meet_fun_def ~> Inf_fun_def
2922 Meet_greatest ~> Inf_greatest
2923 Meet_lower ~> Inf_lower
2924 Meet_set_def ~> Inf_set_def
2927 Sup_bool_eq ~> Sup_bool_def
2928 Sup_fun_eq ~> Sup_fun_def
2929 Sup_set_eq ~> Sup_set_def
2931 listsp_meetI ~> listsp_infI
2932 listsp_meet_eq ~> listsp_inf_eq
2937 * Added syntactic class "size"; overloaded constant "size" now has
2938 type "'a::size ==> bool"
2940 * Internal reorganisation of `size' of datatypes: size theorems
2941 "foo.size" are no longer subsumed by "foo.simps" (but are still
2942 simplification rules by default!); theorems "prod.size" now named
2945 * Class "div" now inherits from class "times" rather than "type".
2948 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2949 Linorder etc. have disappeared; operations defined in terms of
2950 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2952 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2954 * HOL-Word: New extensive library and type for generic, fixed size
2955 machine words, with arithemtic, bit-wise, shifting and rotating
2956 operations, reflection into int, nat, and bool lists, automation for
2957 linear arithmetic (by automatic reflection into nat or int), including
2958 lemmas on overflow and monotonicity. Instantiated to all appropriate
2959 arithmetic type classes, supporting automatic simplification of
2960 numerals on all operations.
2962 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2964 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2966 * Code generator library theories:
2967 - Code_Integer represents HOL integers by big integer literals in target
2969 - Code_Char represents HOL characters by character literals in target
2971 - Code_Char_chr like Code_Char, but also offers treatment of character
2972 codes; includes Code_Integer.
2973 - Executable_Set allows to generate code for finite sets using lists.
2974 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2976 - Executable_Real implements a subset of real numbers, namly those
2977 representable by rational numbers.
2978 - Efficient_Nat implements natural numbers by integers, which in general will
2979 result in higher efficency; pattern matching with 0/Suc is eliminated;
2980 includes Code_Integer.
2981 - Code_Index provides an additional datatype index which is mapped to
2982 target-language built-in integers.
2983 - Code_Message provides an additional datatype message_string which is isomorphic to
2984 strings; messages are mapped to target-language strings.
2986 * New package for inductive predicates
2988 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2991 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2992 for z_1 :: U_1 and ... and z_n :: U_m
2994 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2997 with full support for type-inference, rather than
2999 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3001 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3002 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3004 inductive "s z_1 ... z_m"
3006 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3009 For backward compatibility, there is a wrapper allowing inductive
3010 sets to be defined with the new package via
3013 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3014 for z_1 :: U_1 and ... and z_n :: U_m
3016 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3022 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3023 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3024 for z_1 :: U_1 and ... and z_n :: U_m
3026 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3027 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3030 if the additional syntax "p ..." is required.
3032 Numerous examples can be found in the subdirectories src/HOL/Auth,
3033 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3037 - Since declaration and definition of inductive sets or predicates
3038 is no longer separated, abbreviations involving the newly
3039 introduced sets or predicates must be specified together with the
3040 introduction rules after the 'where' keyword (see above), rather
3041 than before the actual inductive definition.
3043 - The variables in induction and elimination rules are now
3044 quantified in the order of their occurrence in the introduction
3045 rules, rather than in alphabetical order. Since this may break
3046 some proofs, these proofs either have to be repaired, e.g. by
3047 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3048 statements of the form
3050 case (rule_i a_i_1 ... a_i_{k_i})
3052 or the old order of quantification has to be restored by explicitly adding
3053 meta-level quantifiers in the introduction rules, i.e.
3055 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3057 - The format of the elimination rules is now
3059 p z_1 ... z_m x_1 ... x_n ==>
3060 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3065 (x_1, ..., x_n) : s z_1 ... z_m ==>
3066 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3069 for sets rather than
3071 x : s z_1 ... z_m ==>
3072 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3075 This may require terms in goals to be expanded to n-tuples
3076 (e.g. using case_tac or simplification with the split_paired_all
3077 rule) before the above elimination rule is applicable.
3079 - The elimination or case analysis rules for (mutually) inductive
3080 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3081 list of rules "p_1_..._p_k.elims" is no longer available.
3083 * New package "function"/"fun" for general recursive functions,
3084 supporting mutual and nested recursion, definitions in local contexts,
3085 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3086 for small examples, and the separate tutorial on the function
3087 package. The old recdef "package" is still available as before, but
3088 users are encouraged to use the new package.
3090 * Method "lexicographic_order" automatically synthesizes termination
3091 relations as lexicographic combinations of size measures.
3093 * Case-expressions allow arbitrary constructor-patterns (including
3094 "_") and take their order into account, like in functional
3095 programming. Internally, this is translated into nested
3096 case-expressions; missing cases are added and mapped to the predefined
3097 constant "undefined". In complicated cases printing may no longer show
3098 the original input but the internal form. Lambda-abstractions allow
3099 the same form of pattern matching: "% pat1 => e1 | ..." is an
3100 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3103 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3104 is an abbreviation for "of_nat :: nat => int". The simplification
3105 rules for "of_nat" have been changed to work like "int" did
3106 previously. Potential INCOMPATIBILITY:
3107 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3108 - of_nat_diff and of_nat_mult are no longer default simp rules
3110 * Method "algebra" solves polynomial equations over (semi)rings using
3111 Groebner bases. The (semi)ring structure is defined by locales and the
3112 tool setup depends on that generic context. Installing the method for
3113 a specific type involves instantiating the locale and possibly adding
3114 declarations for computation on the coefficients. The method is
3115 already instantiated for natural numbers and for the axiomatic class
3116 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3117 CALCULEMUS 2007 for the general principles underlying this
3118 architecture of context-aware proof-tools.
3120 * Method "ferrack" implements quantifier elimination over
3121 special-purpose dense linear orders using locales (analogous to
3122 "algebra"). The method is already installed for class
3123 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3126 * Former constant "List.op @" now named "List.append". Use ML
3127 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3128 circumvent possible incompatibilities when working on ML level.
3130 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3132 * New function listsum :: 'a list => 'a for arbitrary monoids.
3133 Special syntax: "SUM x <- xs. f x" (and latex variants)
3135 * New syntax for Haskell-like list comprehension (input only), eg.
3136 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3138 * The special syntax for function "filter" has changed from [x :
3139 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3140 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3142 * [a..b] is now defined for arbitrary linear orders. It used to be
3143 defined on nat only, as an abbreviation for [a..<Suc b]
3146 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3148 * New functions "sorted" and "sort" in src/HOL/List.thy.
3150 * New lemma collection field_simps (an extension of ring_simps) for
3151 manipulating (in)equations involving division. Multiplies with all
3152 denominators that can be proved to be non-zero (in equations) or
3153 positive/negative (in inequations).
3155 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3156 have been improved and renamed to ring_simps, group_simps and
3157 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3158 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3160 * Theory Library/Commutative_Ring: switched from recdef to function
3161 package; constants add, mul, pow now curried. Infix syntax for
3162 algebraic operations.
3164 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3167 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3170 * HOL/records: generalised field-update to take a function on the
3171 field rather than the new value: r(|A := x|) is translated to A_update
3172 (K x) r The K-combinator that is internally used is called K_record.
3173 INCOMPATIBILITY: Usage of the plain update functions has to be
3176 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3177 * x = 0, which are required for a semiring. Richer structures do not
3178 inherit from semiring_0 anymore, because this property is a theorem
3179 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3180 there is more to prove, but this is mostly trivial.
3182 * Class "recpower" is generalized to arbitrary monoids, not just
3183 commutative semirings. INCOMPATIBILITY: may need to incorporate
3184 commutativity or semiring properties additionally.
3186 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3187 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3188 better use 'abbreviation'.
3190 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3192 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3193 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3194 significant changes for setting up numeral syntax for types:
3195 - New constants Numeral.pred and Numeral.succ instead
3196 of former Numeral.bin_pred and Numeral.bin_succ.
3197 - Use integer operations instead of bin_add, bin_mult and so on.
3198 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3199 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3201 See src/HOL/Integ/IntArith.thy for an example setup.
3203 * Command 'normal_form' computes the normal form of a term that may
3204 contain free variables. For example ``normal_form "rev [a, b, c]"''
3205 produces ``[b, c, a]'' (without proof). This command is suitable for
3206 heavy-duty computations because the functions are compiled to ML
3207 first. Correspondingly, a method "normalization" is provided. See
3208 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3210 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3211 25 like -->); output depends on the "iff" print_mode, the default is
3212 "A = B" (with priority 50).
3214 * Relations less (<) and less_eq (<=) are also available on type bool.
3215 Modified syntax to disallow nesting without explicit parentheses,
3216 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3219 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3221 * Relation composition operator "op O" now has precedence 75 and binds
3222 stronger than union and intersection. INCOMPATIBILITY.
3224 * The old set interval syntax "{m..n(}" (and relatives) has been
3225 removed. Use "{m..<n}" (and relatives) instead.
3227 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3228 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3229 ``declare [[simproc del: neq]]''.
3231 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3234 * Theorem Cons_eq_map_conv no longer declared as "simp".
3236 * Theorem setsum_mult renamed to setsum_right_distrib.
3238 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3241 * Reimplemented methods "sat" and "satx", with several improvements:
3242 goals no longer need to be stated as "<prems> ==> False", equivalences
3243 (i.e. "=" on type bool) are handled, variable names of the form
3244 "lit_<n>" are no longer reserved, significant speedup.
3246 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3247 zChaff is still supported as well.
3249 * 'inductive' and 'datatype': provide projections of mutual rules,
3250 bundled as foo_bar.inducts;
3252 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3255 * Library: moved theory Accessible_Part to main HOL.
3257 * Library: added theory Coinductive_List of potentially infinite lists
3258 as greatest fixed-point.
3260 * Library: added theory AssocList which implements (finite) maps as
3263 * Method "evaluation" solves goals (i.e. a boolean expression)
3264 efficiently by compiling it to ML. The goal is "proved" (via an
3265 oracle) if it evaluates to True.
3267 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3268 also when invoked by the simplifier. This results in the Simplifier
3269 being more powerful on arithmetic goals. INCOMPATIBILITY.
3270 Configuration option fast_arith_split_limit=0 recovers the old
3273 * Support for hex (0x20) and binary (0b1001) numerals.
3275 * New method: reify eqs (t), where eqs are equations for an
3276 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3277 parameter, computes a term s::'b and a list xs::'a list and proves the
3278 theorem I xs s = t. This is also known as reification or quoting. The
3279 resulting theorem is applied to the subgoal to substitute t with I xs
3280 s. If t is omitted, the subgoal itself is reified.
3282 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3283 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3284 where f is supposed to be a computable function (in the sense of code
3285 generattion). The method uses reify to compute s and xs as above then
3286 applies corr_thm and uses normalization by evaluation to "prove" f s =
3287 r and finally gets the theorem t = r, which is again applied to the
3288 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3290 * Reflection: Automatic reification now handels binding, an example is
3291 available in src/HOL/ex/ReflectionEx.thy
3293 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3294 command 'statespace' that is similar to 'record', but introduces an
3295 abstract specification based on the locale infrastructure instead of
3296 HOL types. This leads to extra flexibility in composing state spaces,
3297 in particular multiple inheritance and renaming of components.
3302 * Hyperreal: Functions root and sqrt are now defined on negative real
3303 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3304 Nonnegativity side conditions have been removed from many lemmas, so
3305 that more subgoals may now be solved by simplification; potential
3308 * Real: new type classes formalize real normed vector spaces and
3309 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3310 and norm :: 'a => real.
3312 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3313 reals into other types. The overloaded constant Reals :: 'a set is now
3314 defined as range of_real; potential INCOMPATIBILITY.
3316 * Real: proper support for ML code generation, including 'quickcheck'.
3317 Reals are implemented as arbitrary precision rationals.
3319 * Hyperreal: Several constants that previously worked only for the
3320 reals have been generalized, so they now work over arbitrary vector
3321 spaces. Type annotations may need to be added in some cases; potential
3324 Infinitesimal :: ('a::real_normed_vector) star set
3325 HFinite :: ('a::real_normed_vector) star set
3326 HInfinite :: ('a::real_normed_vector) star set
3327 approx :: ('a::real_normed_vector) star => 'a star => bool
3328 monad :: ('a::real_normed_vector) star => 'a star set
3329 galaxy :: ('a::real_normed_vector) star => 'a star set
3330 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3331 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3332 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3333 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3334 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3335 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3336 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3337 sgn :: 'a::real_normed_vector => 'a
3338 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3340 * Complex: Some complex-specific constants are now abbreviations for
3341 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3342 hnorm. Other constants have been entirely removed in favor of the
3343 polymorphic versions (INCOMPATIBILITY):
3347 HInfinite <-- CInfinite
3348 Infinitesimal <-- CInfinitesimal
3351 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3352 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3353 (ns)deriv <-- (ns)cderiv
3358 * Formalisation of ideals and the quotient construction over rings.
3360 * Order and lattice theory no longer based on records.
3363 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3364 greatest_closed. INCOMPATIBILITY.
3366 * Method algebra is now set up via an attribute. For examples see
3367 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3368 of algebraic structures.
3370 * Renamed theory CRing to Ring.
3375 * Substantial, yet incomplete support for nominal datatypes (binding
3376 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3377 src/HOL/Nominal/Examples. Prospective users should consult
3378 http://isabelle.in.tum.de/nominal/
3383 * ML basics: just one true type int, which coincides with IntInf.int
3386 * ML within Isar: antiquotations allow to embed statically-checked
3387 formal entities in the source, referring to the context available at
3388 compile-time. For example:
3390 ML {* @{sort "{zero,one}"} *}
3391 ML {* @{typ "'a => 'b"} *}
3392 ML {* @{term "%x. x"} *}
3393 ML {* @{prop "x == y"} *}
3394 ML {* @{ctyp "'a => 'b"} *}
3395 ML {* @{cterm "%x. x"} *}
3396 ML {* @{cprop "x == y"} *}
3397 ML {* @{thm asm_rl} *}
3398 ML {* @{thms asm_rl} *}
3399 ML {* @{type_name c} *}
3400 ML {* @{type_syntax c} *}
3401 ML {* @{const_name c} *}
3402 ML {* @{const_syntax c} *}
3405 ML {* @{theory Pure} *}
3406 ML {* @{theory_ref} *}
3407 ML {* @{theory_ref Pure} *}
3410 ML {* @{clasimpset} *}
3412 The same works for sources being ``used'' within an Isar context.
3414 * ML in Isar: improved error reporting; extra verbosity with
3415 ML_Context.trace enabled.
3417 * Pure/General/table.ML: the join operations now works via exceptions
3418 DUP/SAME instead of type option. This is simpler in simple cases, and
3419 admits slightly more efficient complex applications.
3421 * Pure: 'advanced' translation functions (parse_translation etc.) now
3422 use Context.generic instead of just theory.
3424 * Pure: datatype Context.generic joins theory/Proof.context and
3425 provides some facilities for code that works in either kind of
3426 context, notably GenericDataFun for uniform theory and proof data.
3428 * Pure: simplified internal attribute type, which is now always
3429 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3430 local (Proof.context) attributes have been discontinued, while
3431 minimizing code duplication. Thm.rule_attribute and
3432 Thm.declaration_attribute build canonical attributes; see also structure
3433 Context for further operations on Context.generic, notably
3434 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3435 declarations and definitions.
3437 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3438 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3439 init only required for impure data. INCOMPATIBILITY: empty really need
3440 to be empty (no dependencies on theory content!)
3442 * Pure/kernel: consts certification ignores sort constraints given in
3443 signature declarations. (This information is not relevant to the
3444 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3445 potential INCOMPATIBILITY.
3447 * Pure: axiomatic type classes are now purely definitional, with
3448 explicit proofs of class axioms and super class relations performed
3449 internally. See Pure/axclass.ML for the main internal interfaces --
3450 notably AxClass.define_class supercedes AxClass.add_axclass, and
3451 AxClass.axiomatize_class/classrel/arity supersede
3452 Sign.add_classes/classrel/arities.
3454 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3455 global/local versions on theory vs. Proof.context have been
3456 discontinued; Attrib.syntax and Method.syntax have been adapted
3457 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3458 attributes, methods, etc.
3460 * Pure: several functions of signature "... -> theory -> theory * ..."
3461 have been reoriented to "... -> theory -> ... * theory" in order to
3462 allow natural usage in combination with the ||>, ||>>, |-> and
3463 fold_map combinators.
3465 * Pure: official theorem names (closed derivations) and additional
3466 comments (tags) are now strictly separate. Name hints -- which are
3467 maintained as tags -- may be attached any time without affecting the
3470 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3471 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3472 achieve the old behaviour.
3474 * Pure: the "Goal" constant is now called "prop", supporting a
3475 slightly more general idea of ``protecting'' meta-level rule
3478 * Pure: Logic.(un)varify only works in a global context, which is now
3479 enforced instead of silently assumed. INCOMPATIBILITY, may use
3480 Logic.legacy_(un)varify as temporary workaround.
3482 * Pure: structure Name provides scalable operations for generating
3483 internal variable names, notably Name.variants etc. This replaces
3484 some popular functions from term.ML:
3486 Term.variant -> Name.variant
3487 Term.variantlist -> Name.variant_list
3488 Term.invent_names -> Name.invent_list
3490 Note that low-level renaming rarely occurs in new code -- operations
3491 from structure Variable are used instead (see below).
3493 * Pure: structure Variable provides fundamental operations for proper
3494 treatment of fixed/schematic variables in a context. For example,
3495 Variable.import introduces fixes for schematics of given facts and
3496 Variable.export reverses the effect (up to renaming) -- this replaces
3497 various freeze_thaw operations.
3499 * Pure: structure Goal provides simple interfaces for
3500 init/conclude/finish and tactical prove operations (replacing former
3501 Tactic.prove). Goal.prove is the canonical way to prove results
3502 within a given context; Goal.prove_global is a degraded version for
3503 theory level goals, including a global Drule.standard. Note that
3504 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3505 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3506 in a locale context).
3508 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3509 and type checking (Syntax.check_term etc.), with common combinations
3510 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3511 which are considered legacy and await removal.
3513 * Pure/Syntax: generic interfaces for type unchecking
3514 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3515 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3516 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3517 available for convenience, but refer to the very same operations using
3518 a mere theory instead of a full context.
3520 * Isar: simplified treatment of user-level errors, using exception
3521 ERROR of string uniformly. Function error now merely raises ERROR,
3522 without any side effect on output channels. The Isar toplevel takes
3523 care of proper display of ERROR exceptions. ML code may use plain
3524 handle/can/try; cat_error may be used to concatenate errors like this:
3526 ... handle ERROR msg => cat_error msg "..."
3528 Toplevel ML code (run directly or through the Isar toplevel) may be
3529 embedded into the Isar toplevel with exception display/debug like
3532 Isar.toplevel (fn () => ...)
3534 INCOMPATIBILITY, removed special transform_error facilities, removed
3535 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3536 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3537 -- use plain ERROR instead.
3539 * Isar: theory setup now has type (theory -> theory), instead of a
3540 list. INCOMPATIBILITY, may use #> to compose setup functions.
3542 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3543 ProofContext.debug/verbose flags.
3545 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3546 theory before entering a proof state. Transactions now always see a
3547 quasi-functional intermediate checkpoint, both in interactive and
3550 * Isar: simplified interfaces for outer syntax. Renamed
3551 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3552 OuterSyntax.add_parsers -- this functionality is now included in
3553 OuterSyntax.command etc. INCOMPATIBILITY.
3555 * Simplifier: the simpset of a running simplification process now
3556 contains a proof context (cf. Simplifier.the_context), which is the
3557 very context that the initial simpset has been retrieved from (by
3558 simpset_of/local_simpset_of). Consequently, all plug-in components
3559 (solver, looper etc.) may depend on arbitrary proof data.
3561 * Simplifier.inherit_context inherits the proof context (plus the
3562 local bounds) of the current simplification process; any simproc
3563 etc. that calls the Simplifier recursively should do this! Removed
3564 former Simplifier.inherit_bounds, which is already included here --
3565 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3566 specify an explicit context using Simplifier.context/theory_context.
3568 * Simplifier/Classical Reasoner: more abstract interfaces
3569 change_simpset/claset for modifying the simpset/claset reference of a
3570 theory; raw versions simpset/claset_ref etc. have been discontinued --
3573 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3579 * settings: the default heap location within ISABELLE_HOME_USER now
3580 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3581 Isabelle installations.
3583 * isabelle-process: option -S (secure mode) disables some critical
3584 operations, notably runtime compilation and evaluation of ML source
3587 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3589 * Support for parallel execution, using native multicore support of
3590 Poly/ML 5.1. The theory loader exploits parallelism when processing
3591 independent theories, according to the given theory header
3592 specifications. The maximum number of worker threads is specified via
3593 usedir option -M or the "max-threads" setting in Proof General. A
3594 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3595 to 6 on a 8-core machine. User-code needs to observe certain
3596 guidelines for thread-safe programming, see appendix A in the Isar
3597 Implementation manual.
3601 New in Isabelle2005 (October 2005)
3602 ----------------------------------
3606 * Theory headers: the new header syntax for Isar theories is
3609 imports <theory1> ... <theoryN>
3610 uses <file1> ... <fileM>
3613 where the 'uses' part is optional. The previous syntax
3615 theory <name> = <theory1> + ... + <theoryN>:
3617 will disappear in the next release. Use isatool fixheaders to convert
3618 existing theory files. Note that there is no change in ancient
3619 non-Isar theories now, but these will disappear soon.
3621 * Theory loader: parent theories can now also be referred to via
3622 relative and absolute paths.
3624 * Command 'find_theorems' searches for a list of criteria instead of a
3625 list of constants. Known criteria are: intro, elim, dest, name:string,
3626 simp:term, and any term. Criteria can be preceded by '-' to select
3627 theorems that do not match. Intro, elim, dest select theorems that
3628 match the current goal, name:s selects theorems whose fully qualified
3629 name contain s, and simp:term selects all simplification rules whose
3630 lhs match term. Any other term is interpreted as pattern and selects
3631 all theorems matching the pattern. Available in ProofGeneral under
3632 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3634 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3636 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3637 matching the current goal as introduction rule and not having "HOL."
3638 in their name (i.e. not being defined in theory HOL).
3640 * Command 'thms_containing' has been discontinued in favour of
3641 'find_theorems'; INCOMPATIBILITY.
3643 * Communication with Proof General is now 8bit clean, which means that
3644 Unicode text in UTF-8 encoding may be used within theory texts (both
3645 formal and informal parts). Cf. option -U of the Isabelle Proof
3646 General interface. Here are some simple examples (cf. src/HOL/ex):
3648 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3649 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3651 * Improved efficiency of the Simplifier and, to a lesser degree, the
3652 Classical Reasoner. Typical big applications run around 2 times
3656 *** Document preparation ***
3658 * Commands 'display_drafts' and 'print_drafts' perform simple output
3659 of raw sources. Only those symbols that do not require additional
3660 LaTeX packages (depending on comments in isabellesym.sty) are
3661 displayed properly, everything else is left verbatim. isatool display
3662 and isatool print are used as front ends (these are subject to the
3663 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3665 * Command tags control specific markup of certain regions of text,
3666 notably folding and hiding. Predefined tags include "theory" (for
3667 theory begin and end), "proof" for proof commands, and "ML" for
3668 commands involving ML code; the additional tags "visible" and
3669 "invisible" are unused by default. Users may give explicit tag
3670 specifications in the text, e.g. ''by %invisible (auto)''. The
3671 interpretation of tags is determined by the LaTeX job during document
3672 preparation: see option -V of isatool usedir, or options -n and -t of
3673 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3676 Several document versions may be produced at the same time via isatool
3677 usedir (the generated index.html will link all of them). Typical
3678 specifications include ''-V document=theory,proof,ML'' to present
3679 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3680 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3681 these parts without any formal replacement text. The Isabelle site
3682 default settings produce ''document'' and ''outline'' versions as
3685 * Several new antiquotations:
3687 @{term_type term} prints a term with its type annotated;
3689 @{typeof term} prints the type of a term;
3691 @{const const} is the same as @{term const}, but checks that the
3692 argument is a known logical constant;
3694 @{term_style style term} and @{thm_style style thm} print a term or
3695 theorem applying a "style" to it
3699 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3700 definitions, equations, inequations etc., 'concl' printing only the
3701 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3702 to print the specified premise. TermStyle.add_style provides an ML
3703 interface for introducing further styles. See also the "LaTeX Sugar"
3704 document practical applications. The ML antiquotation prints
3705 type-checked ML expressions verbatim.
3707 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3708 and 'text' support optional locale specification '(in loc)', which
3709 specifies the default context for interpreting antiquotations. For
3710 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3712 * Option 'locale=NAME' of antiquotations specifies an alternative
3713 context interpreting the subsequent argument. For example: @{thm
3714 [locale=lattice] inf_assoc}.
3716 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3719 * Proper output of antiquotations for theory commands involving a
3720 proof context (such as 'locale' or 'theorem (in loc) ...').
3722 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3723 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3725 * isatool usedir: new option -C (default true) controls whether option
3726 -D should include a copy of the original document directory; -C false
3727 prevents unwanted effects such as copying of administrative CVS data.
3732 * Considerably improved version of 'constdefs' command. Now performs
3733 automatic type-inference of declared constants; additional support for
3734 local structure declarations (cf. locales and HOL records), see also
3735 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3736 sequential dependencies of definitions within a single 'constdefs'
3737 section; moreover, the declared name needs to be an identifier. If
3738 all fails, consider to fall back on 'consts' and 'defs' separately.
3740 * Improved indexed syntax and implicit structures. First of all,
3741 indexed syntax provides a notational device for subscripted
3742 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3743 expressions. Secondly, in a local context with structure
3744 declarations, number indexes \<^sub>n or the empty index (default
3745 number 1) refer to a certain fixed variable implicitly; option
3746 show_structs controls printing of implicit structures. Typical
3747 applications of these concepts involve record types and locales.
3749 * New command 'no_syntax' removes grammar declarations (and
3750 translations) resulting from the given syntax specification, which is
3751 interpreted in the same manner as for the 'syntax' command.
3753 * 'Advanced' translation functions (parse_translation etc.) may depend
3754 on the signature of the theory context being presently used for
3755 parsing/printing, see also isar-ref manual.
3757 * Improved 'oracle' command provides a type-safe interface to turn an
3758 ML expression of type theory -> T -> term into a primitive rule of
3759 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3760 is already included here); see also FOL/ex/IffExample.thy;
3763 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3764 before); "cI" is no longer bound, use "c.intro" instead.
3765 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3766 axclasses vs. locales.
3768 * Improved internal renaming of symbolic identifiers -- attach primes
3769 instead of base 26 numbers.
3771 * New flag show_question_marks controls printing of leading question
3772 marks in schematic variable names.
3774 * In schematic variable names, *any* symbol following \<^isub> or
3775 \<^isup> is now treated as part of the base name. For example, the
3776 following works without printing of awkward ".0" indexes:
3778 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3781 * Inner syntax includes (*(*nested*) comments*).
3783 * Pretty printer now supports unbreakable blocks, specified in mixfix
3784 annotations as "(00...)".
3786 * Clear separation of logical types and nonterminals, where the latter
3787 may only occur in 'syntax' specifications or type abbreviations.
3788 Before that distinction was only partially implemented via type class
3789 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3790 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3791 exotic syntax specifications may require further adaption
3792 (e.g. Cube/Cube.thy).
3794 * Removed obsolete type class "logic", use the top sort {} instead.
3795 Note that non-logical types should be declared as 'nonterminals'
3796 rather than 'types'. INCOMPATIBILITY for new object-logic
3799 * Attributes 'induct' and 'cases': type or set names may now be
3800 locally fixed variables as well.
3802 * Simplifier: can now control the depth to which conditional rewriting
3803 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3806 * Simplifier: simplification procedures may now take the current
3807 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3808 interface), which is very useful for calling the Simplifier
3809 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3810 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3811 low-level mk_simproc no longer applies Logic.varify internally, to
3812 allow for use in a context of fixed variables.
3814 * thin_tac now works even if the assumption being deleted contains !!
3815 or ==>. More generally, erule now works even if the major premise of
3816 the elimination rule contains !! or ==>.
3818 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3820 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3821 from Pure, which contains all common declarations already. Both
3822 theories are defined via plain Isabelle/Isar .thy files.
3823 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3824 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3825 use isatool fixcpure to adapt your theory and ML sources.
3827 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3828 selections of theorems in named facts via index ranges.
3830 * 'print_theorems': in theory mode, really print the difference
3831 wrt. the last state (works for interactive theory development only),
3832 in proof mode print all local facts (cf. 'print_facts');
3834 * 'hide': option '(open)' hides only base names.
3836 * More efficient treatment of intermediate checkpoints in interactive
3839 * Code generator is now invoked via code_module (incremental code
3840 generation) and code_library (modular code generation, ML structures
3841 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3842 must be quoted when used as identifiers.
3844 * New 'value' command for reading, evaluating and printing terms using
3845 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3846 quoted when used as identifier.
3851 * New commands for the interpretation of locale expressions in
3852 theories (1), locales (2) and proof contexts (3). These generate
3853 proof obligations from the expression specification. After the
3854 obligations have been discharged, theorems of the expression are added
3855 to the theory, target locale or proof context. The synopsis of the
3856 commands is a follows:
3858 (1) interpretation expr inst
3859 (2) interpretation target < expr
3860 (3) interpret expr inst
3862 Interpretation in theories and proof contexts require a parameter
3863 instantiation of terms from the current context. This is applied to
3864 specifications and theorems of the interpreted expression.
3865 Interpretation in locales only permits parameter renaming through the
3866 locale expression. Interpretation is smart in that interpretations
3867 that are active already do not occur in proof obligations, neither are
3868 instantiated theorems stored in duplicate. Use 'print_interps' to
3869 inspect active interpretations of a particular locale. For details,
3870 see the Isar Reference manual. Examples can be found in
3871 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3873 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3874 'interpret' instead.
3876 * New context element 'constrains' for adding type constraints to
3879 * Context expressions: renaming of parameters with syntax
3882 * Locale declaration: 'includes' disallowed.
3884 * Proper static binding of attribute syntax -- i.e. types / terms /
3885 facts mentioned as arguments are always those of the locale definition
3886 context, independently of the context of later invocations. Moreover,
3887 locale operations (renaming and type / term instantiation) are applied
3888 to attribute arguments as expected.
3890 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3891 actual attributes; rare situations may require Attrib.attribute to
3892 embed those attributes into Attrib.src that lack concrete syntax.
3893 Attribute implementations need to cooperate properly with the static
3894 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3895 Attrib.XXX_thm etc. already do the right thing without further
3896 intervention. Only unusual applications -- such as "where" or "of"
3897 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3898 on the context and the facts involved -- may have to assign parsed
3899 values to argument tokens explicitly.
3901 * Changed parameter management in theorem generation for long goal
3902 statements with 'includes'. INCOMPATIBILITY: produces a different
3903 theorem statement in rare situations.
3905 * Locale inspection command 'print_locale' omits notes elements. Use
3906 'print_locale!' to have them included in the output.
3911 * Provers/hypsubst.ML: improved version of the subst method, for
3912 single-step rewriting: it now works in bound variable contexts. New is
3913 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3914 rewrite a different subterm than the original subst method, which is
3915 still available as 'simplesubst'.
3917 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3920 * Provers/trancl.ML: new transitivity reasoner for transitive and
3921 reflexive-transitive closure of relations.
3923 * Provers/blast.ML: new reference depth_limit to make blast's depth
3924 limit (previously hard-coded with a value of 20) user-definable.
3926 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3927 is peformed already. Object-logics merely need to finish their
3928 initial simpset configuration as before. INCOMPATIBILITY.
3933 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3936 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3938 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3939 and x-symbol; use option '-m epsilon' to get it actually printed.
3940 Moreover, the mathematically important symbolic identifier \<epsilon>
3941 becomes available as variable, constant etc. INCOMPATIBILITY,
3943 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3944 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3945 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3946 support corresponding Isar calculations.
3948 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3951 * theory SetInterval: changed the syntax for open intervals:
3960 The old syntax is still supported but will disappear in the next
3961 release. For conversion use the following Emacs search and replace
3962 patterns (these are not perfect but work quite well):
3964 {)\([^\.]*\)\.\. -> {\1<\.\.}
3965 \.\.\([^(}]*\)(} -> \.\.<\1}
3967 * Theory Commutative_Ring (in Library): method comm_ring for proving
3968 equalities in commutative rings; method 'algebra' provides a generic
3971 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3972 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3973 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3976 Some new syntax forms are available:
3978 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3979 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3980 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3981 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3983 The latter form "\<Sum>x < k. e" used to be based on a separate
3984 function "Summation", which has been discontinued.
3986 * theory Finite_Set: in structured induction proofs, the insert case
3987 is now 'case (insert x F)' instead of the old counterintuitive 'case
3990 * The 'refute' command has been extended to support a much larger
3991 fragment of HOL, including axiomatic type classes, constdefs and
3992 typedefs, inductive datatypes and recursion.
3994 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3995 Requires zChaff with proof generation to be installed. See
3996 HOL/ex/SAT_Examples.thy for examples.
3998 * Datatype induction via method 'induct' now preserves the name of the
3999 induction variable. For example, when proving P(xs::'a list) by
4000 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4001 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4002 in unstructured proof scripts.
4004 * Reworked implementation of records. Improved scalability for
4005 records with many fields, avoiding performance problems for type
4006 inference. Records are no longer composed of nested field types, but
4007 of nested extension types. Therefore the record type only grows linear
4008 in the number of extensions and not in the number of fields. The
4009 top-level (users) view on records is preserved. Potential
4010 INCOMPATIBILITY only in strange cases, where the theory depends on the
4011 old record representation. The type generated for a record is called
4012 <record_name>_ext_type.
4014 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4015 proofs triggered by a record definition or a simproc (if
4016 quick_and_dirty is enabled). Definitions of large records can take
4019 New simproc record_upd_simproc for simplification of multiple record
4020 updates enabled by default. Moreover, trivial updates are also
4021 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4022 occasionally, since simplification is more powerful by default.
4024 * typedef: proper support for polymorphic sets, which contain extra
4025 type-variables in the term.
4027 * Simplifier: automatically reasons about transitivity chains
4028 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4029 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4030 old proofs break occasionally as simplification may now solve more
4031 goals than previously.
4033 * Simplifier: converts x <= y into x = y if assumption y <= x is
4034 present. Works for all partial orders (class "order"), in particular
4035 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4038 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4039 bound variable or a constant then the let is unfolded. Otherwise
4040 first a is simplified to b, and then f b is simplified to g. If
4041 possible we abstract b from g arriving at "let x = b in h x",
4042 otherwise we unfold the let and arrive at g. The simproc can be
4043 enabled/disabled by the reference use_let_simproc. Potential
4044 INCOMPATIBILITY since simplification is more powerful by default.
4046 * Classical reasoning: the meson method now accepts theorems as arguments.
4048 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4049 jobs to provide advice on the provability of subgoals.
4051 * Theory OrderedGroup and Ring_and_Field: various additions and
4052 improvements to faciliate calculations involving equalities and
4055 The following theorems have been eliminated or modified
4058 abs_eq now named abs_of_nonneg
4059 abs_of_ge_0 now named abs_of_nonneg
4060 abs_minus_eq now named abs_of_nonpos
4061 imp_abs_id now named abs_of_nonneg
4062 imp_abs_neg_id now named abs_of_nonpos
4063 mult_pos now named mult_pos_pos
4064 mult_pos_le now named mult_nonneg_nonneg
4065 mult_pos_neg_le now named mult_nonneg_nonpos
4066 mult_pos_neg2_le now named mult_nonneg_nonpos2
4067 mult_neg now named mult_neg_neg
4068 mult_neg_le now named mult_nonpos_nonpos
4070 * The following lemmas in Ring_and_Field have been added to the simplifier:
4073 not_square_less_zero
4075 The following lemmas have been deleted from Real/RealPow:
4085 * Theory Parity: added rules for simplifying exponents.
4089 The following theorems have been eliminated or modified
4092 list_all_Nil now named list_all.simps(1)
4093 list_all_Cons now named list_all.simps(2)
4094 list_all_conv now named list_all_iff
4095 set_mem_eq now named mem_iff
4097 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4098 asymptotic "big O" calculations. See the notes in BigO.thy.
4103 * Theory RealDef: better support for embedding natural numbers and
4104 integers in the reals.
4106 The following theorems have been eliminated or modified
4109 exp_ge_add_one_self now requires no hypotheses
4110 real_of_int_add reversed direction of equality (use [symmetric])
4111 real_of_int_minus reversed direction of equality (use [symmetric])
4112 real_of_int_diff reversed direction of equality (use [symmetric])
4113 real_of_int_mult reversed direction of equality (use [symmetric])
4115 * Theory RComplete: expanded support for floor and ceiling functions.
4117 * Theory Ln is new, with properties of the natural logarithm
4119 * Hyperreal: There is a new type constructor "star" for making
4120 nonstandard types. The old type names are now type synonyms:
4124 hcomplex = complex star
4126 * Hyperreal: Many groups of similarly-defined constants have been
4127 replaced by polymorphic versions (INCOMPATIBILITY):
4129 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4131 starset <-- starsetNat, starsetC
4132 *s* <-- *sNat*, *sc*
4133 starset_n <-- starsetNat_n, starsetC_n
4134 *sn* <-- *sNatn*, *scn*
4135 InternalSets <-- InternalNatSets, InternalCSets
4137 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4138 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4139 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4140 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4141 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4143 * Hyperreal: Many type-specific theorems have been removed in favor of
4144 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4146 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4147 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4148 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4149 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4150 right_minus <-- hypreal_add_minus
4151 left_minus <-- {hypreal,hcomplex}_add_minus_left
4152 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4153 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4154 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4155 mult_1_right <-- hcomplex_mult_one_right
4156 mult_zero_left <-- hcomplex_mult_zero_left
4157 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4158 right_distrib <-- hypnat_add_mult_distrib2
4159 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4160 right_inverse <-- hypreal_mult_inverse
4161 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4162 order_refl <-- {hypreal,hypnat}_le_refl
4163 order_trans <-- {hypreal,hypnat}_le_trans
4164 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4165 order_less_le <-- {hypreal,hypnat}_less_le
4166 linorder_linear <-- {hypreal,hypnat}_le_linear
4167 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4168 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4169 add_nonneg_nonneg <-- hypreal_le_add_order
4171 * Hyperreal: Separate theorems having to do with type-specific
4172 versions of constants have been merged into theorems that apply to the
4173 new polymorphic constants (INCOMPATIBILITY):
4175 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4176 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4177 STAR_Un <-- {STAR,NatStar,STARC}_Un
4178 STAR_Int <-- {STAR,NatStar,STARC}_Int
4179 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4180 STAR_subset <-- {STAR,NatStar,STARC}_subset
4181 STAR_mem <-- {STAR,NatStar,STARC}_mem
4182 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4183 STAR_diff <-- {STAR,STARC}_diff
4184 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4185 STARC_hcomplex_of_complex}_image_subset
4186 starset_n_Un <-- starset{Nat,C}_n_Un
4187 starset_n_Int <-- starset{Nat,C}_n_Int
4188 starset_n_Compl <-- starset{Nat,C}_n_Compl
4189 starset_n_diff <-- starset{Nat,C}_n_diff
4190 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4191 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4192 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4193 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4194 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4195 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4196 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4197 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4198 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4199 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4200 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4201 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4202 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4203 starfun_diff <-- starfun{C,RC,CR}_diff
4204 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4205 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4206 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4207 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4208 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4209 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4210 starfun_Id <-- starfunC_Id
4211 starfun_approx <-- starfun{Nat,CR}_approx
4212 starfun_capprox <-- starfun{C,RC}_capprox
4213 starfun_abs <-- starfunNat_rabs
4214 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4215 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4216 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4217 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4218 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4219 starfun_add_approx <-- starfunCR_add_approx
4220 starfun_inverse_inverse <-- starfunC_inverse_inverse
4221 starfun_divide <-- starfun{C,CR,RC}_divide
4222 starfun_n <-- starfun{Nat,C}_n
4223 starfun_n_mult <-- starfun{Nat,C}_n_mult
4224 starfun_n_add <-- starfun{Nat,C}_n_add
4225 starfun_n_add_minus <-- starfunNat_n_add_minus
4226 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4227 starfun_n_minus <-- starfun{Nat,C}_n_minus
4228 starfun_n_eq <-- starfun{Nat,C}_n_eq
4230 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4231 star_n_minus <-- {hypreal,hcomplex}_minus
4232 star_n_diff <-- {hypreal,hcomplex}_diff
4233 star_n_mult <-- {hypreal,hcomplex}_mult
4234 star_n_inverse <-- {hypreal,hcomplex}_inverse
4235 star_n_le <-- {hypreal,hypnat}_le
4236 star_n_less <-- {hypreal,hypnat}_less
4237 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4238 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4239 star_n_abs <-- hypreal_hrabs
4240 star_n_divide <-- hcomplex_divide
4242 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4243 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4244 star_of_diff <-- hypreal_of_real_diff
4245 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4246 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4247 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4248 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4249 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4250 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4251 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4252 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4253 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4254 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4255 star_of_number_of <-- {hypreal,hcomplex}_number_of
4256 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4257 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4258 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4259 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4260 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4261 star_of_power <-- hypreal_of_real_power
4262 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4264 * Hyperreal: new method "transfer" that implements the transfer
4265 principle of nonstandard analysis. With a subgoal that mentions
4266 nonstandard types like "'a star", the command "apply transfer"
4267 replaces it with an equivalent one that mentions only standard types.
4268 To be successful, all free variables must have standard types; non-
4269 standard variables must have explicit universal quantifiers.
4271 * Hyperreal: A theory of Taylor series.
4276 * Discontinued special version of 'constdefs' (which used to support
4277 continuous functions) in favor of the general Pure one with full
4280 * New simplification procedure for solving continuity conditions; it
4281 is much faster on terms with many nested lambda abstractions (cubic
4282 instead of exponential time).
4284 * New syntax for domain package: selector names are now optional.
4285 Parentheses should be omitted unless argument is lazy, for example:
4287 domain 'a stream = cons "'a" (lazy "'a stream")
4289 * New command 'fixrec' for defining recursive functions with pattern
4290 matching; defining multiple functions with mutual recursion is also
4291 supported. Patterns may include the constants cpair, spair, up, sinl,
4292 sinr, or any data constructor defined by the domain package. The given
4293 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4294 syntax and examples.
4296 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4297 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4298 but the proof obligation additionally includes an admissibility
4299 requirement. The packages generate instances of class cpo or pcpo,
4300 with continuity and strictness theorems for Rep and Abs.
4302 * HOLCF: Many theorems have been renamed according to a more standard naming
4303 scheme (INCOMPATIBILITY):
4305 foo_inject: "foo$x = foo$y ==> x = y"
4306 foo_eq: "(foo$x = foo$y) = (x = y)"
4307 foo_less: "(foo$x << foo$y) = (x << y)"
4308 foo_strict: "foo$UU = UU"
4309 foo_defined: "... ==> foo$x ~= UU"
4310 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4315 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4316 including the First Isomorphism Theorem (on quotienting by the kernel
4319 * ZF/Simplifier: install second copy of type solver that actually
4320 makes use of TC rules declared to Isar proof contexts (or locales);
4321 the old version is still required for ML proof scripts.
4326 * Converted to Isar theory format; use locales instead of axiomatic
4332 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4335 * Pure/library.ML no longer defines its own option datatype, but uses
4336 that of the SML basis, which has constructors NONE and SOME instead of
4337 None and Some, as well as exception Option.Option instead of OPTION.
4338 The functions the, if_none, is_some, is_none have been adapted
4339 accordingly, while Option.map replaces apsome.
4341 * Pure/library.ML: the exception LIST has been given up in favour of
4342 the standard exceptions Empty and Subscript, as well as
4343 Library.UnequalLengths. Function like Library.hd and Library.tl are
4344 superceded by the standard hd and tl functions etc.
4346 A number of basic list functions are no longer exported to the ML
4347 toplevel, as they are variants of predefined functions. The following
4348 suggests how one can translate existing code:
4350 rev_append xs ys = List.revAppend (xs, ys)
4351 nth_elem (i, xs) = List.nth (xs, i)
4352 last_elem xs = List.last xs
4353 flat xss = List.concat xss
4354 seq fs = List.app fs
4355 partition P xs = List.partition P xs
4356 mapfilter f xs = List.mapPartial f xs
4358 * Pure/library.ML: several combinators for linear functional
4359 transformations, notably reverse application and composition:
4362 (x, y) |-> f f #-> g
4364 * Pure/library.ML: introduced/changed precedence of infix operators:
4366 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4368 infix 3 o oo ooo oooo;
4369 infix 4 ~~ upto downto;
4371 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4374 * Pure/library.ML: natural list combinators fold, fold_rev, and
4375 fold_map support linear functional transformations and nesting. For
4378 fold f [x1, ..., xN] y =
4379 y |> f x1 |> ... |> f xN
4381 (fold o fold) f [xs1, ..., xsN] y =
4382 y |> fold f xs1 |> ... |> fold f xsN
4384 fold f [x1, ..., xN] =
4387 (fold o fold) f [xs1, ..., xsN] =
4388 fold f xs1 #> ... #> fold f xsN
4390 * Pure/library.ML: the following selectors on type 'a option are
4393 the: 'a option -> 'a (*partial*)
4394 these: 'a option -> 'a where 'a = 'b list
4395 the_default: 'a -> 'a option -> 'a
4396 the_list: 'a option -> 'a list
4398 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4399 basic operations for association lists, following natural argument
4400 order; moreover the explicit equality predicate passed here avoids
4401 potentially expensive polymorphic runtime equality checks.
4402 The old functions may be expressed as follows:
4404 assoc = uncurry (AList.lookup (op =))
4405 assocs = these oo AList.lookup (op =)
4406 overwrite = uncurry (AList.update (op =)) o swap
4408 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4410 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4411 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4413 replacing make_keylist and keyfilter (occassionally used)
4416 make_keylist = AList.make
4417 keyfilter = AList.find (op =)
4419 * eq_fst and eq_snd now take explicit equality parameter, thus
4420 avoiding eqtypes. Naive rewrites:
4422 eq_fst = eq_fst (op =)
4423 eq_snd = eq_snd (op =)
4425 * Removed deprecated apl and apr (rarely used).
4428 apl (n, op) =>>= curry op n
4429 apr (op, m) =>>= fn n => op (n, m)
4431 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4432 provides a reasonably efficient light-weight implementation of sets as
4435 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4436 few new operations; existing lookup and update are now curried to
4437 follow natural argument order (for use with fold etc.);
4438 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4440 * Pure/General: output via the Isabelle channels of
4441 writeln/warning/error etc. is now passed through Output.output, with a
4442 hook for arbitrary transformations depending on the print_mode
4443 (cf. Output.add_mode -- the first active mode that provides a output
4444 function wins). Already formatted output may be embedded into further
4445 text via Output.raw; the result of Pretty.string_of/str_of and derived
4446 functions (string_of_term/cterm/thm etc.) is already marked raw to
4447 accommodate easy composition of diagnostic messages etc. Programmers
4448 rarely need to care about Output.output or Output.raw at all, with
4449 some notable exceptions: Output.output is required when bypassing the
4450 standard channels (writeln etc.), or in token translations to produce
4451 properly formatted results; Output.raw is required when capturing
4452 already output material that will eventually be presented to the user
4453 a second time. For the default print mode, both Output.output and
4454 Output.raw have no effect.
4456 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4457 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4458 cumulative results are displayed at the end of a batch session.
4460 * Pure/General: File.sysify_path and File.quote_sysify path have been
4461 replaced by File.platform_path and File.shell_path (with appropriate
4462 hooks). This provides a clean interface for unusual systems where the
4463 internal and external process view of file names are different.
4465 * Pure: more efficient orders for basic syntactic entities: added
4466 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4467 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4468 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4469 orders now -- potential INCOMPATIBILITY for code that depends on a
4470 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4471 Library.sort_strings on result).
4473 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4474 fold_types traverse types/terms from left to right, observing natural
4475 argument order. Supercedes previous foldl_XXX versions, add_frees,
4476 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4478 * Pure: name spaces have been refined, with significant changes of the
4479 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4480 to extern(_table). The plain name entry path is superceded by a
4481 general 'naming' context, which also includes the 'policy' to produce
4482 a fully qualified name and external accesses of a fully qualified
4483 name; NameSpace.extend is superceded by context dependent
4484 Sign.declare_name. Several theory and proof context operations modify
4485 the naming context. Especially note Theory.restore_naming and
4486 ProofContext.restore_naming to get back to a sane state; note that
4487 Theory.add_path is no longer sufficient to recover from
4488 Theory.absolute_path in particular.
4490 * Pure: new flags short_names (default false) and unique_names
4491 (default true) for controlling output of qualified names. If
4492 short_names is set, names are printed unqualified. If unique_names is
4493 reset, the name prefix is reduced to the minimum required to achieve
4494 the original result when interning again, even if there is an overlap
4495 with earlier declarations.
4497 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4498 now 'extend', and 'merge' gets an additional Pretty.pp argument
4499 (useful for printing error messages). INCOMPATIBILITY.
4501 * Pure: major reorganization of the theory context. Type Sign.sg and
4502 Theory.theory are now identified, referring to the universal
4503 Context.theory (see Pure/context.ML). Actual signature and theory
4504 content is managed as theory data. The old code and interfaces were
4505 spread over many files and structures; the new arrangement introduces
4506 considerable INCOMPATIBILITY to gain more clarity:
4508 Context -- theory management operations (name, identity, inclusion,
4509 parents, ancestors, merge, etc.), plus generic theory data;
4511 Sign -- logical signature and syntax operations (declaring consts,
4512 types, etc.), plus certify/read for common entities;
4514 Theory -- logical theory operations (stating axioms, definitions,
4515 oracles), plus a copy of logical signature operations (consts,
4516 types, etc.); also a few basic management operations (Theory.copy,
4519 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4520 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4521 for convenience -- they merely return the theory.
4523 * Pure: type Type.tsig is superceded by theory in most interfaces.
4525 * Pure: the Isar proof context type is already defined early in Pure
4526 as Context.proof (note that ProofContext.context and Proof.context are
4527 aliases, where the latter is the preferred name). This enables other
4528 Isabelle components to refer to that type even before Isar is present.
4530 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4531 typeK, constK, axiomK, oracleK), but provide explicit operations for
4532 any of these kinds. For example, Sign.intern typeK is now
4533 Sign.intern_type, Theory.hide_space Sign.typeK is now
4534 Theory.hide_types. Also note that former
4535 Theory.hide_classes/types/consts are now
4536 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4537 internalize their arguments! INCOMPATIBILITY.
4539 * Pure: get_thm interface (of PureThy and ProofContext) expects
4540 datatype thmref (with constructors Name and NameSelection) instead of
4541 plain string -- INCOMPATIBILITY;
4543 * Pure: cases produced by proof methods specify options, where NONE
4544 means to remove case bindings -- INCOMPATIBILITY in
4547 * Pure: the following operations retrieve axioms or theorems from a
4548 theory node or theory hierarchy, respectively:
4550 Theory.axioms_of: theory -> (string * term) list
4551 Theory.all_axioms_of: theory -> (string * term) list
4552 PureThy.thms_of: theory -> (string * thm) list
4553 PureThy.all_thms_of: theory -> (string * thm) list
4555 * Pure: print_tac now outputs the goal through the trace channel.
4557 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4558 Reference Toplevel.debug (default false) controls detailed printing
4559 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4560 controls execution profiling -- set to 1 for time and 2 for space
4561 (both increase the runtime).
4563 * Isar session: The initial use of ROOT.ML is now always timed,
4564 i.e. the log will show the actual process times, in contrast to the
4565 elapsed wall-clock time that the outer shell wrapper produces.
4567 * Simplifier: improved handling of bound variables (nameless
4568 representation, avoid allocating new strings). Simprocs that invoke
4569 the Simplifier recursively should use Simplifier.inherit_bounds to
4570 avoid local name clashes. Failure to do so produces warnings
4571 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4572 for further details.
4574 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4575 bindings for all theorems stored within a given theory; this may help
4576 in porting non-Isar theories to Isar ones, while keeping ML proof
4577 scripts for the time being.
4579 * ML operator HTML.with_charset specifies the charset begin used for
4580 generated HTML files. For example:
4582 HTML.with_charset "utf-8" use_thy "Hebrew";
4583 HTML.with_charset "utf-8" use_thy "Chinese";
4588 * Allow symlinks to all proper Isabelle executables (Isabelle,
4589 isabelle, isatool etc.).
4591 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4592 isatool doc, isatool mkdir, display_drafts etc.).
4594 * isatool usedir: option -f allows specification of the ML file to be
4595 used by Isabelle; default is ROOT.ML.
4597 * New isatool version outputs the version identifier of the Isabelle
4598 distribution being used.
4600 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4601 (containing Boolean satisfiability problems) into Isabelle/HOL
4606 New in Isabelle2004 (April 2004)
4607 --------------------------------
4611 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4612 Replaces linorder.ML.
4614 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4615 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4616 (\<a>...\<z>), are now considered normal letters, and can therefore
4617 be used anywhere where an ASCII letter (a...zA...Z) has until
4618 now. COMPATIBILITY: This obviously changes the parsing of some
4619 terms, especially where a symbol has been used as a binder, say
4620 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4621 as an identifier. Fix it by inserting a space around former
4622 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4623 existing theory and ML files.
4625 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4627 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4628 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4629 a normal (but invisible) letter. For multiple letter subscripts repeat
4630 \<^isub> like this: x\<^isub>1\<^isub>2.
4632 * Pure: There are now sub-/superscripts that can span more than one
4633 character. Text between \<^bsub> and \<^esub> is set in subscript in
4634 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4635 superscript. The new control characters are not identifier parts.
4637 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4638 content of "..." to the latex file instead of \isacntrl... . The "..."
4639 may consist of any printable characters excluding the end bracket >.
4641 * Pure: Using new Isar command "finalconsts" (or the ML functions
4642 Theory.add_finals or Theory.add_finals_i) it is now possible to
4643 declare constants "final", which prevents their being given a definition
4644 later. It is useful for constants whose behaviour is fixed axiomatically
4645 rather than definitionally, such as the meta-logic connectives.
4647 * Pure: 'instance' now handles general arities with general sorts
4648 (i.e. intersections of classes),
4650 * Presentation: generated HTML now uses a CSS style sheet to make layout
4651 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4652 It can be changed to alter the colors/layout of generated pages.
4657 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4658 cut_tac, subgoal_tac and thin_tac:
4659 - Now understand static (Isar) contexts. As a consequence, users of Isar
4660 locales are no longer forced to write Isar proof scripts.
4661 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4663 - INCOMPATIBILITY: names of variables to be instantiated may no
4664 longer be enclosed in quotes. Instead, precede variable name with `?'.
4665 This is consistent with the instantiation attribute "where".
4667 * Attributes "where" and "of":
4668 - Now take type variables of instantiated theorem into account when reading
4669 the instantiation string. This fixes a bug that caused instantiated
4670 theorems to have too special types in some circumstances.
4671 - "where" permits explicit instantiations of type variables.
4673 * Calculation commands "moreover" and "also" no longer interfere with
4674 current facts ("this"), admitting arbitrary combinations with "then"
4678 - Goal statements involving the context element "includes" no longer
4679 generate theorems with internal delta predicates (those ending on
4680 "_axioms") in the premise.
4681 Resolve particular premise with <locale>.intro to obtain old form.
4682 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4683 specification and "includes" elements in goal statement.
4684 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4685 [intro?] and [elim?] (respectively) by default.
4686 - Experimental command for instantiation of locales in proof contexts:
4687 instantiate <label>[<attrs>]: <loc>
4688 Instantiates locale <loc> and adds all its theorems to the current context
4689 taking into account their attributes. Label and attrs are optional
4690 modifiers, like in theorem declarations. If present, names of
4691 instantiated theorems are qualified with <label>, and the attributes
4692 <attrs> are applied after any attributes these theorems might have already.
4693 If the locale has assumptions, a chained fact of the form
4694 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4695 are derived. The command does not support old-style locales declared
4696 with "locale (open)".
4697 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4699 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4705 * Proof import: new image HOL4 contains the imported library from
4706 the HOL4 system with about 2500 theorems. It is imported by
4707 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4708 can be used like any other Isabelle image. See
4709 HOL/Import/HOL/README for more information.
4712 - Much improved handling of linear and partial orders.
4713 Reasoners for linear and partial orders are set up for type classes
4714 "linorder" and "order" respectively, and are added to the default simpset
4715 as solvers. This means that the simplifier can build transitivity chains
4716 to solve goals from the assumptions.
4717 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4718 of blast or auto after simplification become unnecessary because the goal
4719 is solved by simplification already.
4721 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4722 all proved in axiomatic type classes for semirings, rings and fields.
4725 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4726 now formalized using the Ring_and_Field theory mentioned above.
4727 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4728 than before, because now they are set up once in a generic manner.
4729 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4730 Look for the general versions in Ring_and_Field (and Power if they concern
4733 * Type "rat" of the rational numbers is now available in HOL-Complex.
4736 - Record types are now by default printed with their type abbreviation
4737 instead of the list of all field types. This can be configured via
4738 the reference "print_record_type_abbr".
4739 - Simproc "record_upd_simproc" for simplification of multiple updates added
4740 (not enabled by default).
4741 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4742 EX x. x = sel r to True (not enabled by default).
4743 - Tactic "record_split_simp_tac" to split and simplify records added.
4745 * 'specification' command added, allowing for definition by
4746 specification. There is also an 'ax_specification' command that
4747 introduces the new constants axiomatically.
4749 * arith(_tac) is now able to generate counterexamples for reals as well.
4751 * HOL-Algebra: new locale "ring" for non-commutative rings.
4753 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4754 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4756 * HOL-Matrix: a first theory for matrices in HOL with an application of
4757 matrix theory to linear programming.
4759 * Unions and Intersections:
4760 The latex output syntax of UN and INT has been changed
4761 from "\Union x \in A. B" to "\Union_{x \in A} B"
4762 i.e. the index formulae has become a subscript.
4763 Similarly for "\Union x. B", and for \Inter instead of \Union.
4765 * Unions and Intersections over Intervals:
4766 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4767 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4768 like in normal math, and corresponding versions for < and for intersection.
4770 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4771 lexicographic dictonary ordering has been added as "lexord".
4773 * ML: the legacy theory structures Int and List have been removed. They had
4774 conflicted with ML Basis Library structures having the same names.
4776 * 'refute' command added to search for (finite) countermodels. Only works
4777 for a fragment of HOL. The installation of an external SAT solver is
4778 highly recommended. See "HOL/Refute.thy" for details.
4780 * 'quickcheck' command: Allows to find counterexamples by evaluating
4781 formulae under an assignment of free variables to random values.
4782 In contrast to 'refute', it can deal with inductive datatypes,
4783 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4789 * Streams now come with concatenation and are part of the HOLCF image
4793 New in Isabelle2003 (May 2003)
4794 ------------------------------
4798 * Provers/simplifier:
4800 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4801 Assumptions are now subject to complete mutual simplification,
4802 not just from left to right. The simplifier now preserves
4803 the order of assumptions.
4805 Potential INCOMPATIBILITY:
4807 -- simp sometimes diverges where the old version did
4808 not, e.g. invoking simp on the goal
4810 [| P (f x); y = x; f x = f y |] ==> Q
4812 now gives rise to the infinite reduction sequence
4814 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4816 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4819 -- Tactics combining classical reasoner and simplification (such as auto)
4820 are also affected by this change, because many of them rely on
4821 simp. They may sometimes diverge as well or yield a different numbers
4822 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4823 in case of problems. Sometimes subsequent calls to the classical
4824 reasoner will fail because a preceeding call to the simplifier too
4825 eagerly simplified the goal, e.g. deleted redundant premises.
4827 - The simplifier trace now shows the names of the applied rewrite rules
4829 - You can limit the number of recursive invocations of the simplifier
4830 during conditional rewriting (where the simplifie tries to solve the
4831 conditions before applying the rewrite rule):
4832 ML "simp_depth_limit := n"
4833 where n is an integer. Thus you can force termination where previously
4834 the simplifier would diverge.
4836 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4838 - No longer aborts on failed congruence proof. Instead, the
4839 congruence is ignored.
4841 * Pure: New generic framework for extracting programs from constructive
4842 proofs. See HOL/Extraction.thy for an example instantiation, as well
4843 as HOL/Extraction for some case studies.
4845 * Pure: The main goal of the proof state is no longer shown by default, only
4846 the subgoals. This behaviour is controlled by a new flag.
4847 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4848 (ML: Proof.show_main_goal).
4850 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4851 rules whose conclusion matches subgoal 1:
4852 PG menu: Isabelle/Isar -> Show me -> matching rules
4853 The rules are ordered by how closely they match the subgoal.
4854 In particular, rules that solve a subgoal outright are displayed first
4855 (or rather last, the way they are printed).
4856 (ML: ProofGeneral.print_intros())
4858 * Pure: New flag trace_unify_fail causes unification to print
4859 diagnostic information (PG: in trace buffer) when it fails. This is
4860 useful for figuring out why single step proofs like rule, erule or
4863 * Pure: Locale specifications now produce predicate definitions
4864 according to the body of text (covering assumptions modulo local
4865 definitions); predicate "loc_axioms" covers newly introduced text,
4866 while "loc" is cumulative wrt. all included locale expressions; the
4867 latter view is presented only on export into the global theory
4868 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4869 on the old view without predicates;
4871 * Pure: predefined locales "var" and "struct" are useful for sharing
4872 parameters (as in CASL, for example); just specify something like
4873 ``var x + var y + struct M'' as import;
4875 * Pure: improved thms_containing: proper indexing of facts instead of
4876 raw theorems; check validity of results wrt. current name space;
4877 include local facts of proof configuration (also covers active
4878 locales), cover fixed variables in index; may use "_" in term
4879 specification; an optional limit for the number of printed facts may
4880 be given (the default is 40);
4882 * Pure: disallow duplicate fact bindings within new-style theory files
4885 * Provers: improved induct method: assumptions introduced by case
4886 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4887 the goal statement); "foo" still refers to all facts collectively;
4889 * Provers: the function blast.overloaded has been removed: all constants
4890 are regarded as potentially overloaded, which improves robustness in exchange
4891 for slight decrease in efficiency;
4893 * Provers/linorder: New generic prover for transitivity reasoning over
4894 linear orders. Note: this prover is not efficient!
4896 * Isar: preview of problems to finish 'show' now produce an error
4897 rather than just a warning (in interactive mode);
4904 - Produces a counter example if it cannot prove a goal.
4905 Note that the counter example may be spurious if the goal is not a formula
4906 of quantifier-free linear arithmetic.
4907 In ProofGeneral the counter example appears in the trace buffer.
4909 - Knows about div k and mod k where k is a numeral of type nat or int.
4911 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4912 linear arithmetic fails. This takes account of quantifiers and divisibility.
4913 Presburger arithmetic can also be called explicitly via presburger(_tac).
4915 * simp's arithmetic capabilities have been enhanced a bit: it now
4916 takes ~= in premises into account (by performing a case split);
4918 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4919 are distributed over a sum of terms;
4921 * New tactic "trans_tac" and method "trans" instantiate
4922 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4925 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4926 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4928 * 'typedef' command has new option "open" to suppress the set
4931 * functions Min and Max on finite sets have been introduced (theory
4934 * attribute [symmetric] now works for relations as well; it turns
4935 (x,y) : R^-1 into (y,x) : R, and vice versa;
4937 * induct over a !!-quantified statement (say !!x1..xn):
4938 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4940 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4941 %x. None. Warning: empty_def now refers to the previously hidden definition
4944 * Algebra: formalization of classical algebra. Intended as base for
4945 any algebraic development in Isabelle. Currently covers group theory
4946 (up to Sylow's theorem) and ring theory (Universal Property of
4947 Univariate Polynomials). Contributions welcome;
4949 * GroupTheory: deleted, since its material has been moved to Algebra;
4951 * Complex: new directory of the complex numbers with numeric constants,
4952 nonstandard complex numbers, and some complex analysis, standard and
4953 nonstandard (Jacques Fleuriot);
4955 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4957 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4960 * Real/HahnBanach: updated and adapted to locales;
4962 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4965 * UNITY: added the Meier-Sanders theory of progress sets;
4967 * MicroJava: bytecode verifier and lightweight bytecode verifier
4968 as abstract algorithms, instantiated to the JVM;
4970 * Bali: Java source language formalization. Type system, operational
4971 semantics, axiomatic semantics. Supported language features:
4972 classes, interfaces, objects,virtual methods, static methods,
4973 static/instance fields, arrays, access modifiers, definite
4974 assignment, exceptions.
4979 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4982 * Main ZF: virtually all theories converted to new-style format;
4987 * Pure: Tactic.prove provides sane interface for internal proofs;
4988 omits the infamous "standard" operation, so this is more appropriate
4989 than prove_goalw_cterm in many situations (e.g. in simprocs);
4991 * Pure: improved error reporting of simprocs;
4993 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4997 *** Document preparation ***
4999 * uses \par instead of \\ for line breaks in theory text. This may
5000 shift some page breaks in large documents. To get the old behaviour
5001 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5003 * minimized dependencies of isabelle.sty and isabellesym.sty on
5006 * \<euro> now needs package babel/greek instead of marvosym (which
5009 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5014 New in Isabelle2002 (March 2002)
5015 --------------------------------
5017 *** Document preparation ***
5019 * greatly simplified document preparation setup, including more
5020 graceful interpretation of isatool usedir -i/-d/-D options, and more
5021 instructive isatool mkdir; users should basically be able to get
5022 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5023 users may run a separate document processing stage manually like this:
5024 "isatool usedir -D output HOL Test && isatool document Test/output";
5026 * theory dependency graph may now be incorporated into documents;
5027 isatool usedir -g true will produce session_graph.eps/.pdf for use
5028 with \includegraphics of LaTeX;
5030 * proper spacing of consecutive markup elements, especially text
5031 blocks after section headings;
5033 * support bold style (for single symbols only), input syntax is like
5034 this: "\<^bold>\<alpha>" or "\<^bold>A";
5036 * \<bullet> is now output as bold \cdot by default, which looks much
5037 better in printed text;
5039 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5040 note that these symbols are currently unavailable in Proof General /
5041 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5043 * isatool latex no longer depends on changed TEXINPUTS, instead
5044 isatool document copies the Isabelle style files to the target
5050 * Pure/Provers: improved proof by cases and induction;
5051 - 'case' command admits impromptu naming of parameters (such as
5053 - 'induct' method divinates rule instantiation from the inductive
5054 claim; no longer requires excessive ?P bindings for proper
5055 instantiation of cases;
5056 - 'induct' method properly enumerates all possibilities of set/type
5057 rules; as a consequence facts may be also passed through *type*
5058 rules without further ado;
5059 - 'induct' method now derives symbolic cases from the *rulified*
5060 rule (before it used to rulify cases stemming from the internal
5061 atomized version); this means that the context of a non-atomic
5062 statement becomes is included in the hypothesis, avoiding the
5063 slightly cumbersome show "PROP ?case" form;
5064 - 'induct' may now use elim-style induction rules without chaining
5065 facts, using ``missing'' premises from the goal state; this allows
5066 rules stemming from inductive sets to be applied in unstructured
5067 scripts, while still benefitting from proper handling of non-atomic
5068 statements; NB: major inductive premises need to be put first, all
5069 the rest of the goal is passed through the induction;
5070 - 'induct' proper support for mutual induction involving non-atomic
5071 rule statements (uses the new concept of simultaneous goals, see
5073 - append all possible rule selections, but only use the first
5074 success (no backtracking);
5075 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5076 - undeclared rule case names default to numbers 1, 2, 3, ...;
5077 - added 'print_induct_rules' (covered by help item in recent Proof
5079 - moved induct/cases attributes to Pure, methods to Provers;
5080 - generic method setup instantiated for FOL and HOL;
5082 * Pure: support multiple simultaneous goal statements, for example
5083 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5084 meta-level mechanism, this acts as if several individual goals had
5085 been stated separately; in particular common proof methods need to be
5086 repeated in order to cover all claims; note that a single elimination
5087 step is *not* sufficient to establish the two conjunctions, so this
5090 assume "A & B" then have A and B .. (*".." fails*)
5092 better use "obtain" in situations as above; alternative refer to
5093 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5095 * Pure: proper integration with ``locales''; unlike the original
5096 version by Florian Kammller, Isar locales package high-level proof
5097 contexts rather than raw logical ones (e.g. we admit to include
5098 attributes everywhere); operations on locales include merge and
5099 rename; support for implicit arguments (``structures''); simultaneous
5100 type-inference over imports and text; see also HOL/ex/Locales.thy for
5103 * Pure: the following commands have been ``localized'', supporting a
5104 target locale specification "(in name)": 'lemma', 'theorem',
5105 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5106 stored both within the locale and at the theory level (exported and
5107 qualified by the locale name);
5109 * Pure: theory goals may now be specified in ``long'' form, with
5110 ad-hoc contexts consisting of arbitrary locale elements. for example
5111 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5112 definitions may be given, too); the result is a meta-level rule with
5113 the context elements being discharged in the obvious way;
5115 * Pure: new proof command 'using' allows to augment currently used
5116 facts after a goal statement ('using' is syntactically analogous to
5117 'apply', but acts on the goal's facts only); this allows chained facts
5118 to be separated into parts given before and after a claim, as in
5119 ``from a and b have C using d and e <proof>'';
5121 * Pure: renamed "antecedent" case to "rule_context";
5123 * Pure: new 'judgment' command records explicit information about the
5124 object-logic embedding (used by several tools internally); no longer
5125 use hard-wired "Trueprop";
5127 * Pure: added 'corollary' command;
5129 * Pure: fixed 'token_translation' command;
5131 * Pure: removed obsolete 'exported' attribute;
5133 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5134 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5135 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5137 * Pure: method 'atomize' presents local goal premises as object-level
5138 statements (atomic meta-level propositions); setup controlled via
5139 rewrite rules declarations of 'atomize' attribute; example
5140 application: 'induct' method with proper rule statements in improper
5143 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5144 now consider the syntactic context of assumptions, giving a better
5145 chance to get type-inference of the arguments right (this is
5146 especially important for locales);
5148 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5151 * Pure/obtain: the formal conclusion "thesis", being marked as
5152 ``internal'', may no longer be reference directly in the text;
5153 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5156 * Pure: generic 'sym' attribute which declares a rule both as pure
5157 'elim?' and for the 'symmetric' operation;
5159 * Pure: marginal comments ``--'' may now occur just anywhere in the
5160 text; the fixed correlation with particular command syntax has been
5163 * Pure: new method 'rules' is particularly well-suited for proof
5164 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5165 but often produces more compact proof terms with less detours;
5167 * Pure/Provers/classical: simplified integration with pure rule
5168 attributes and methods; the classical "intro?/elim?/dest?"
5169 declarations coincide with the pure ones; the "rule" method no longer
5170 includes classically swapped intros; "intro" and "elim" methods no
5171 longer pick rules from the context; also got rid of ML declarations
5172 AddXIs/AddXEs/AddXDs; all of this has some potential for
5175 * Provers/classical: attribute 'swapped' produces classical inversions
5176 of introduction rules;
5178 * Provers/simplifier: 'simplified' attribute may refer to explicit
5179 rules instead of full simplifier context; 'iff' attribute handles
5182 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5184 * HOL: 'recdef' now fails on unfinished automated proofs, use
5185 "(permissive)" option to recover old behavior;
5187 * HOL: 'inductive' no longer features separate (collective) attributes
5188 for 'intros' (was found too confusing);
5190 * HOL: properly declared induction rules less_induct and
5196 * HOL: moved over to sane numeral syntax; the new policy is as
5199 - 0 and 1 are polymorphic constants, which are defined on any
5200 numeric type (nat, int, real etc.);
5202 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5203 binary representation internally;
5205 - type nat has special constructor Suc, and generally prefers Suc 0
5206 over 1::nat and Suc (Suc 0) over 2::nat;
5208 This change may cause significant problems of INCOMPATIBILITY; here
5209 are some hints on converting existing sources:
5211 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5212 entities, so expressions involving "-" (unary or binary minus) need
5213 to be spaced properly;
5215 - existing occurrences of "1" may need to be constraint "1::nat" or
5216 even replaced by Suc 0; similar for old "2";
5218 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5220 - remove all special provisions on numerals in proofs;
5222 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5223 representation (depends on bin_arith_simps in the default context);
5225 * HOL: symbolic syntax for x^2 (numeral 2);
5227 * HOL: the class of all HOL types is now called "type" rather than
5228 "term"; INCOMPATIBILITY, need to adapt references to this type class
5229 in axclass/classes, instance/arities, and (usually rare) occurrences
5230 in typings (of consts etc.); internally the class is called
5231 "HOL.type", ML programs should refer to HOLogic.typeS;
5233 * HOL/record package improvements:
5234 - new derived operations "fields" to build a partial record section,
5235 "extend" to promote a fixed record to a record scheme, and
5236 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5237 declared as simp by default;
5238 - shared operations ("more", "fields", etc.) now need to be always
5239 qualified) --- potential INCOMPATIBILITY;
5240 - removed "make_scheme" operations (use "make" with "extend") --
5242 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5243 - provides cases/induct rules for use with corresponding Isar
5244 methods (for concrete records, record schemes, concrete more
5245 parts, and schematic more parts -- in that order);
5246 - internal definitions directly based on a light-weight abstract
5247 theory of product types over typedef rather than datatype;
5249 * HOL: generic code generator for generating executable ML code from
5250 specifications; specific support for HOL constructs such as inductive
5251 datatypes and sets, as well as recursive functions; can be invoked
5252 via 'generate_code' theory section;
5254 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5256 * HOL: consolidated and renamed several theories. In particular:
5257 Ord.thy has been absorbed into HOL.thy
5258 String.thy has been absorbed into List.thy
5260 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5261 (beware of argument permutation!);
5263 * HOL: linorder_less_split superseded by linorder_cases;
5265 * HOL/List: "nodups" renamed to "distinct";
5267 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5268 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5269 - Ex_def has changed, now need to use some_eq_ex
5271 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5272 in this (rare) case use:
5274 delSWrapper "split_all_tac"
5275 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5277 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5280 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5281 Isabelle's type classes, ^ on functions and relations has too general
5282 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5283 necessary to attach explicit type constraints;
5285 * HOL/Relation: the prefix name of the infix "O" has been changed from
5286 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5287 renamed accordingly (eg "compI" -> "rel_compI").
5289 * HOL: syntax translations now work properly with numerals and records
5292 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5293 of "lam" -- INCOMPATIBILITY;
5295 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5296 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5297 renamed "Product_Type.unit";
5299 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5301 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5302 the "cases" method);
5304 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5307 * HOL/IMP: updated and converted to new-style theory format; several
5308 parts turned into readable document, with proper Isar proof texts and
5309 some explanations (by Gerwin Klein);
5311 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5313 * HOL-Hyperreal is now a logic image;
5318 * Isar: consts/constdefs supports mixfix syntax for continuous
5321 * Isar: domain package adapted to new-style theory format, e.g. see
5324 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5325 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5326 lift.induct_tac, always use UU instead of Undef;
5328 * HOLCF/IMP: updated and converted to new-style theory;
5333 * Isar: proper integration of logic-specific tools and packages,
5334 including theory commands '(co)inductive', '(co)datatype',
5335 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5336 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5338 * theory Main no longer includes AC; for the Axiom of Choice, base
5339 your theory on Main_ZFC;
5341 * the integer library now covers quotients and remainders, with many
5342 laws relating division to addition, multiplication, etc.;
5344 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5345 typeless version of the formalism;
5347 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5350 * ZF/Induct: new directory for examples of inductive definitions,
5351 including theory Multiset for multiset orderings; converted to
5352 new-style theory format;
5354 * ZF: many new theorems about lists, ordinals, etc.;
5359 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5360 variable proof controls level of detail: 0 = no proofs (only oracle
5361 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5362 also ref manual for further ML interfaces;
5364 * Pure/axclass: removed obsolete ML interface
5365 goal_subclass/goal_arity;
5367 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5368 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5369 separate tokens, so expressions involving minus need to be spaced
5372 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5373 rather than "infixl" or "infixr";
5375 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5376 sort constraint specifications in type inference; e.g. "x::_::foo"
5377 ensures that the type of "x" is of sort "foo" (but not necessarily a
5380 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5381 control output of nested => (types); the default behavior is
5384 * Pure/syntax: builtin parse translation for "_constify" turns valued
5385 tokens into AST constants;
5387 * Pure/syntax: prefer later declarations of translations and print
5388 translation functions; potential INCOMPATIBILITY: need to reverse
5389 multiple declarations for same syntax element constant;
5391 * Pure/show_hyps reset by default (in accordance to existing Isar
5394 * Provers/classical: renamed addaltern to addafter, addSaltern to
5397 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5400 * system: tested support for MacOS X; should be able to get Isabelle +
5401 Proof General to work in a plain Terminal after installing Poly/ML
5402 (e.g. from the Isabelle distribution area) and GNU bash alone
5403 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5404 support requires further installations, e.g. from
5405 http://fink.sourceforge.net/);
5407 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5409 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5410 of 40 MB), cf. ML_OPTIONS;
5412 * system: Proof General keywords specification is now part of the
5413 Isabelle distribution (see etc/isar-keywords.el);
5415 * system: support for persistent Proof General sessions (refrain from
5416 outdating all loaded theories on startup); user may create writable
5417 logic images like this: ``isabelle -q HOL Test'';
5419 * system: smart selection of Isabelle process versus Isabelle
5420 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5421 run both "isabelle" and "Isabelle" even if file names are badly
5422 damaged (executable inspects the case of the first letter of its own
5423 name); added separate "isabelle-process" and "isabelle-interface";
5425 * system: refrain from any attempt at filtering input streams; no
5426 longer support ``8bit'' encoding of old isabelle font, instead proper
5427 iso-latin characters may now be used; the related isatools
5428 "symbolinput" and "nonascii" have disappeared as well;
5430 * system: removed old "xterm" interface (the print modes "xterm" and
5431 "xterm_color" are still available for direct use in a suitable
5436 New in Isabelle99-2 (February 2001)
5437 -----------------------------------
5439 *** Overview of INCOMPATIBILITIES ***
5441 * HOL: please note that theories in the Library and elsewhere often use the
5442 new-style (Isar) format; to refer to their theorems in an ML script you must
5443 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5445 * HOL: inductive package no longer splits induction rule aggressively,
5446 but only as far as specified by the introductions given; the old
5447 format may be recovered via ML function complete_split_rule or attribute
5448 'split_rule (complete)';
5450 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5451 gfp_Tarski to gfp_unfold;
5453 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5455 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5456 relation); infix "^^" has been renamed "``"; infix "``" has been
5457 renamed "`"; "univalent" has been renamed "single_valued";
5459 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5462 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5464 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5466 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5467 consequence, it is no longer monotonic wrt. the local goal context
5468 (which is now passed through the inductive cases);
5470 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5471 \<gg> to \<ggreater>;
5474 *** Document preparation ***
5476 * \isabellestyle{NAME} selects version of Isabelle output (currently
5477 available: are "it" for near math-mode best-style output, "sl" for
5478 slanted text style, and "tt" for plain type-writer; if no
5479 \isabellestyle command is given, output is according to slanted
5482 * support sub/super scripts (for single symbols only), input syntax is
5483 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5485 * some more standard symbols; see Appendix A of the system manual for
5486 the complete list of symbols defined in isabellesym.sty;
5488 * improved isabelle style files; more abstract symbol implementation
5489 (should now use \isamath{...} and \isatext{...} in custom symbol
5492 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5493 state; Note that presentation of goal states does not conform to
5494 actual human-readable proof documents. Please do not include goal
5495 states into document output unless you really know what you are doing!
5497 * proper indentation of antiquoted output with proportional LaTeX
5500 * no_document ML operator temporarily disables LaTeX document
5503 * isatool unsymbolize tunes sources for plain ASCII communication;
5508 * Pure: Isar now suffers initial goal statements to contain unbound
5509 schematic variables (this does not conform to actual readable proof
5510 documents, due to unpredictable outcome and non-compositional proof
5511 checking); users who know what they are doing may use schematic goals
5512 for Prolog-style synthesis of proven results;
5514 * Pure: assumption method (an implicit finishing) now handles actual
5517 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5518 initial goal, declare "that" only as Pure intro (only for single
5519 steps); the "that" rule assumption may now be involved in implicit
5520 finishing, thus ".." becomes a feasible for trivial obtains;
5522 * Pure: default proof step now includes 'intro_classes'; thus trivial
5523 instance proofs may be performed by "..";
5525 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5528 * Pure: more robust selection of calculational rules;
5530 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5531 rule (as well as the assumption rule);
5533 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5534 lemmas, using the graph browser tool;
5536 * Pure: predict failure of "show" in interactive mode;
5538 * Pure: 'thms_containing' now takes actual terms as arguments;
5540 * HOL: improved method 'induct' --- now handles non-atomic goals
5541 (potential INCOMPATIBILITY); tuned error handling;
5543 * HOL: cases and induct rules now provide explicit hints about the
5544 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5545 any remaining facts are inserted into the goal verbatim;
5547 * HOL: local contexts (aka cases) may now contain term bindings as
5548 well; the 'cases' and 'induct' methods new provide a ?case binding for
5549 the result to be shown in each case;
5551 * HOL: added 'recdef_tc' command;
5553 * isatool convert assists in eliminating legacy ML scripts;
5558 * HOL/Library: a collection of generic theories to be used together
5559 with main HOL; the theory loader path already includes this directory
5560 by default; the following existing theories have been moved here:
5561 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5562 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5564 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5565 modelling and verification task performed in Isabelle/HOL +
5566 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5568 * HOL/Algebra: special summation operator SUM no longer exists, it has
5569 been replaced by setsum; infix 'assoc' now has priority 50 (like
5570 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5571 'domain', this makes the theory consistent with mathematical
5574 * HOL basics: added overloaded operations "inverse" and "divide"
5575 (infix "/"), syntax for generic "abs" operation, generic summation
5578 * HOL/typedef: simplified package, provide more useful rules (see also
5581 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5582 now expressed as a proper nested rule (old-style tactic scripts may
5583 require atomize_strip_tac to cope with non-atomic premises);
5585 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5586 to "split_conv" (old name still available for compatibility);
5588 * HOL: improved concrete syntax for strings (e.g. allows translation
5589 rules with string literals);
5591 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5592 and Fleuriot's mechanization of analysis, including the transcendental
5593 functions for the reals;
5595 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5600 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5601 "lam" is displayed as TWO lambda-symbols
5603 * CTT: theory Main now available, containing everything (that is, Bool
5609 * Pure: the Simplifier has been implemented properly as a derived rule
5610 outside of the actual kernel (at last!); the overall performance
5611 penalty in practical applications is about 50%, while reliability of
5612 the Isabelle inference kernel has been greatly improved;
5614 * print modes "brackets" and "no_brackets" control output of nested =>
5615 (types) and ==> (props); the default behaviour is "brackets";
5617 * Provers: fast_tac (and friends) now handle actual object-logic rules
5618 as assumptions as well;
5620 * system: support Poly/ML 4.0;
5622 * system: isatool install handles KDE version 1 or 2;
5626 New in Isabelle99-1 (October 2000)
5627 ----------------------------------
5629 *** Overview of INCOMPATIBILITIES ***
5631 * HOL: simplification of natural numbers is much changed; to partly
5632 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5633 issue the following ML commands:
5635 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5636 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5638 * HOL: simplification no longer dives into case-expressions; this is
5639 controlled by "t.weak_case_cong" for each datatype t;
5641 * HOL: nat_less_induct renamed to less_induct;
5643 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5644 fixsome to patch .thy and .ML sources automatically;
5646 select_equality -> some_equality
5647 select_eq_Ex -> some_eq_ex
5648 selectI2EX -> someI2_ex
5651 select1_equality -> some1_equality
5652 Eps_sym_eq -> some_sym_eq_trivial
5653 Eps_eq -> some_eq_trivial
5655 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5657 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5660 * HOL: the recursion equations generated by 'recdef' are now called
5661 f.simps instead of f.rules;
5663 * HOL: qed_spec_mp now also handles bounded ALL as well;
5665 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5666 sometimes be needed;
5668 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5670 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5672 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5673 product is now "<*>" instead of "Times"; the lexicographic product is
5674 now "<*lex*>" instead of "**";
5676 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5677 of main HOL, but was unused); better use HOL's datatype package;
5679 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5680 the old syntax may be recovered as follows:
5683 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5684 (infixl "\\<oplus>" 100)
5686 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5688 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5689 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5692 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5693 changed from A/r to A//r;
5695 * ZF: new treatment of arithmetic (nat & int) may break some old
5698 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5699 rulify -> rule_format, elimify -> elim_format, ...);
5701 * Isar/Provers: intro/elim/dest attributes changed; renamed
5702 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5703 should have to change intro!! to intro? only); replaced "delrule" by
5706 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5708 * Provers: strengthened force_tac by using new first_best_tac;
5710 * LaTeX document preparation: several changes of isabelle.sty (see
5714 *** Document preparation ***
5716 * formal comments (text blocks etc.) in new-style theories may now
5717 contain antiquotations of thm/prop/term/typ/text to be presented
5718 according to latex print mode; concrete syntax is like this:
5719 @{term[show_types] "f(x) = a + x"};
5721 * isatool mkdir provides easy setup of Isabelle session directories,
5722 including proper document sources;
5724 * generated LaTeX sources are now deleted after successful run
5725 (isatool document -c); may retain a copy somewhere else via -D option
5728 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5729 style files, achieving self-contained LaTeX sources and simplifying
5732 * old-style theories now produce (crude) LaTeX output as well;
5734 * browser info session directories are now self-contained (may be put
5735 on WWW server seperately); improved graphs of nested sessions; removed
5736 graph for 'all sessions';
5738 * several improvements in isabelle style files; \isabellestyle{it}
5739 produces fake math mode output; \isamarkupheader is now \section by
5740 default; see lib/texinputs/isabelle.sty etc.;
5745 * Isar/Pure: local results and corresponding term bindings are now
5746 subject to Hindley-Milner polymorphism (similar to ML); this
5747 accommodates incremental type-inference very nicely;
5749 * Isar/Pure: new derived language element 'obtain' supports
5750 generalized existence reasoning;
5752 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5753 support accumulation of results, without applying any rules yet;
5754 useful to collect intermediate results without explicit name
5755 references, and for use with transitivity rules with more than 2
5758 * Isar/Pure: scalable support for case-analysis type proofs: new
5759 'case' language element refers to local contexts symbolically, as
5760 produced by certain proof methods; internally, case names are attached
5761 to theorems as "tags";
5763 * Isar/Pure: theory command 'hide' removes declarations from
5764 class/type/const name spaces;
5766 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5767 indicate potential overloading;
5769 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5771 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5772 "{a,b,c}" instead of {a,b,c};
5774 * Isar/Pure now provides its own version of intro/elim/dest
5775 attributes; useful for building new logics, but beware of confusion
5776 with the version in Provers/classical;
5778 * Isar/Pure: the local context of (non-atomic) goals is provided via
5779 case name 'antecedent';
5781 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5782 to the current context is now done automatically);
5784 * Isar/Pure: theory command 'method_setup' provides a simple interface
5785 for definining proof methods in ML;
5787 * Isar/Provers: intro/elim/dest attributes changed; renamed
5788 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5789 most cases, one should have to change intro!! to intro? only);
5790 replaced "delrule" by "rule del";
5792 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5793 'symmetric' attribute (the latter supercedes [RS sym]);
5795 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5796 method modifier); 'simp' method: 'only:' modifier removes loopers as
5797 well (including splits);
5799 * Isar/Provers: Simplifier and Classical methods now support all kind
5800 of modifiers used in the past, including 'cong', 'iff', etc.
5802 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5803 of Simplifier and Classical reasoner);
5805 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5806 now support named cases; major packages (inductive, datatype, primrec,
5807 recdef) support case names and properly name parameters;
5809 * Isar/HOL: new transitivity rules for substitution in inequalities --
5810 monotonicity conditions are extracted to be proven at end of
5813 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5816 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5817 split_if split_if_asm; datatype package provides theorems foo.splits =
5818 foo.split foo.split_asm for each datatype;
5820 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5821 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5822 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5823 use "(cases (simplified))" method in proper proof texts);
5825 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5827 * Isar: names of theorems etc. may be natural numbers as well;
5829 * Isar: 'pr' command: optional arguments for goals_limit and
5830 ProofContext.prems_limit; no longer prints theory contexts, but only
5833 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5834 additional print modes to be specified; e.g. "pr(latex)" will print
5835 proof state according to the Isabelle LaTeX style;
5837 * Isar: improved support for emulating tactic scripts, including proof
5838 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5839 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5840 (for HOL datatypes);
5842 * Isar: simplified (more robust) goal selection of proof methods: 1st
5843 goal, all goals, or explicit goal specifier (tactic emulation); thus
5844 'proof method scripts' have to be in depth-first order;
5846 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5848 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5849 should instead use individual commands for printing items
5850 (print_commands, print_methods etc.);
5852 * Isar: added 'nothing' --- the empty list of theorems;
5857 * HOL/MicroJava: formalization of a fragment of Java, together with a
5858 corresponding virtual machine and a specification of its bytecode
5859 verifier and a lightweight bytecode verifier, including proofs of
5860 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5861 Cornelia Pusch (see also the homepage of project Bali at
5862 http://isabelle.in.tum.de/Bali/);
5864 * HOL/Algebra: new theory of rings and univariate polynomials, by
5867 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5868 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5871 * HOL/Lattice: fundamental concepts of lattice theory and order
5872 structures, including duals, properties of bounds versus algebraic
5873 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5874 Theorem for complete lattices etc.; may also serve as a demonstration
5875 for abstract algebraic reasoning using axiomatic type classes, and
5876 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5878 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5881 * HOL/IMPP: extension of IMP with local variables and mutually
5882 recursive procedures, by David von Oheimb;
5884 * HOL/Lambda: converted into new-style theory and document;
5886 * HOL/ex/Multiquote: example of multiple nested quotations and
5887 anti-quotations -- basically a generalized version of de-Bruijn
5888 representation; very useful in avoiding lifting of operations;
5890 * HOL/record: added general record equality rule to simpset; fixed
5891 select-update simplification procedure to handle extended records as
5892 well; admit "r" as field name;
5894 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5895 other numeric types and also as the identity of groups, rings, etc.;
5897 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5898 Types nat and int belong to this axclass;
5900 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5901 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5902 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5903 two terms #m*u and #n*u are replaced by #(m+n)*u
5904 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5905 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5906 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5908 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5909 powerful prover for predicate logic but knows nothing of clasets; see
5910 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5912 * HOL: new version of "case_tac" subsumes both boolean case split and
5913 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5914 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5916 * HOL: simplification no longer dives into case-expressions: only the
5917 selector expression is simplified, but not the remaining arms; to
5918 enable full simplification of case-expressions for datatype t, you may
5919 remove t.weak_case_cong from the simpset, either globally (Delcongs
5920 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5922 * HOL/recdef: the recursion equations generated by 'recdef' for
5923 function 'f' are now called f.simps instead of f.rules; if all
5924 termination conditions are proved automatically, these simplification
5925 rules are added to the simpset, as in primrec; rules may be named
5926 individually as well, resulting in a separate list of theorems for
5929 * HOL/While is a new theory that provides a while-combinator. It
5930 permits the definition of tail-recursive functions without the
5931 provision of a termination measure. The latter is necessary once the
5932 invariant proof rule for while is applied.
5934 * HOL: new (overloaded) notation for the set of elements below/above
5935 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5937 * HOL: theorems impI, allI, ballI bound as "strip";
5939 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5940 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5941 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5943 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5945 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5946 main HOL, but was unused);
5948 * HOL: fewer consts declared as global (e.g. have to refer to
5949 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5951 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5952 in case of overlap with user translations (e.g. judgements over
5953 tuples); (note that the underlying logical represenation is still
5959 * ZF: simplification automatically cancels common terms in arithmetic
5960 expressions over nat and int;
5962 * ZF: new treatment of nat to minimize type-checking: all operators
5963 coerce their operands to a natural number using the function natify,
5964 making the algebraic laws unconditional;
5966 * ZF: as above, for int: operators coerce their operands to an integer
5967 using the function intify;
5969 * ZF: the integer library now contains many of the usual laws for the
5970 orderings, including $<=, and monotonicity laws for $+ and $*;
5972 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5975 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5976 to the simplifier and classical reasoner simultaneously;
5981 * Provers: blast_tac now handles actual object-logic rules as
5982 assumptions; note that auto_tac uses blast_tac internally as well;
5984 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5985 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5987 * Provers: delrules now handles destruct rules as well (no longer need
5988 explicit make_elim);
5990 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5991 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5992 use instead the strong form,
5993 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5994 in HOL, FOL and ZF the function cla_make_elim will create such rules
5995 from destruct-rules;
5997 * Provers: Simplifier.easy_setup provides a fast path to basic
5998 Simplifier setup for new object-logics;
6000 * Pure: AST translation rules no longer require constant head on LHS;
6002 * Pure: improved name spaces: ambiguous output is qualified; support
6003 for hiding of names;
6005 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6006 XSYMBOL_HOME; no longer need to do manual configuration in most
6009 * system: compression of ML heaps images may now be controlled via -c
6010 option of isabelle and isatool usedir (currently only observed by
6013 * system: isatool installfonts may handle X-Symbol fonts as well (very
6014 useful for remote X11);
6016 * system: provide TAGS file for Isabelle sources;
6018 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6021 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6022 timing flag supersedes proof_timing and Toplevel.trace;
6024 * ML: new combinators |>> and |>>> for incremental transformations
6025 with secondary results (e.g. certain theory extensions):
6027 * ML: PureThy.add_defs gets additional argument to indicate potential
6028 overloading (usually false);
6030 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6035 New in Isabelle99 (October 1999)
6036 --------------------------------
6038 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6040 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6041 are no longer simplified. (This allows the simplifier to unfold recursive
6042 functional programs.) To restore the old behaviour, declare
6044 Delcongs [if_weak_cong];
6046 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6049 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6051 * HOL/datatype: mutual_induct_tac no longer exists --
6052 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6054 * HOL/typedef: fixed type inference for representing set; type
6055 arguments now have to occur explicitly on the rhs as type constraints;
6057 * ZF: The con_defs part of an inductive definition may no longer refer
6058 to constants declared in the same theory;
6060 * HOL, ZF: the function mk_cases, generated by the inductive
6061 definition package, has lost an argument. To simplify its result, it
6062 uses the default simpset instead of a supplied list of theorems.
6064 * HOL/List: the constructors of type list are now Nil and Cons;
6066 * Simplifier: the type of the infix ML functions
6067 setSSolver addSSolver setSolver addSolver
6068 is now simpset * solver -> simpset where `solver' is a new abstract type
6069 for packaging solvers. A solver is created via
6070 mk_solver: string -> (thm list -> int -> tactic) -> solver
6071 where the string argument is only a comment.
6076 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6077 decision procedure for linear arithmetic. Currently it is used for
6078 types `nat', `int', and `real' in HOL (see below); it can, should and
6079 will be instantiated for other types and logics as well.
6081 * The simplifier now accepts rewrite rules with flexible heads, eg
6082 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6083 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6089 * New Isabelle/Isar subsystem provides an alternative to traditional
6090 tactical theorem proving; together with the ProofGeneral/isar user
6091 interface it offers an interactive environment for developing human
6092 readable proof documents (Isar == Intelligible semi-automated
6093 reasoning); for further information see isatool doc isar-ref,
6094 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6096 * improved and simplified presentation of theories: better HTML markup
6097 (including colors), graph views in several sizes; isatool usedir now
6098 provides a proper interface for user theories (via -P option); actual
6099 document preparation based on (PDF)LaTeX is available as well (for
6100 new-style theories only); see isatool doc system for more information;
6102 * native support for Proof General, both for classic Isabelle and
6105 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6106 using the graph browser tool;
6108 * Isabelle manuals now also available as PDF;
6110 * theory loader rewritten from scratch (may not be fully
6111 bug-compatible); old loadpath variable has been replaced by show_path,
6112 add_path, del_path, reset_path functions; new operations such as
6113 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6116 * improved isatool install: option -k creates KDE application icon,
6117 option -p DIR installs standalone binaries;
6119 * added ML_PLATFORM setting (useful for cross-platform installations);
6120 more robust handling of platform specific ML images for SML/NJ;
6122 * the settings environment is now statically scoped, i.e. it is never
6123 created again in sub-processes invoked from isabelle, isatool, or
6126 * path element specification '~~' refers to '$ISABELLE_HOME';
6128 * in locales, the "assumes" and "defines" parts may be omitted if
6131 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6134 * new print_mode "HTML";
6136 * new flag show_tags controls display of tags of theorems (which are
6137 basically just comments that may be attached by some tools);
6139 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6140 mode and goal output format:
6142 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6144 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6146 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6147 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6149 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6151 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6153 * function bind_thms stores lists of theorems (cf. bind_thm);
6155 * new shorthand tactics ftac, eatac, datac, fatac;
6157 * qed (and friends) now accept "" as result name; in that case the
6158 theorem is not stored, but proper checks and presentation of the
6161 * theorem database now also indexes constants "Trueprop", "all",
6162 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6167 ** HOL arithmetic **
6169 * There are now decision procedures for linear arithmetic over nat and
6172 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6173 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6174 are treated as atomic; subformulae not involving type `nat' or `int'
6175 are ignored; quantified subformulae are ignored unless they are
6176 positive universal or negative existential. The tactic has to be
6177 invoked by hand and can be a little bit slow. In particular, the
6178 running time is exponential in the number of occurrences of `min' and
6179 `max', and `-' on `nat'.
6181 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6182 (negated) (in)equalities among the premises and the conclusion into
6183 account (i.e. no compound formulae) and does not know about `min' and
6184 `max', and `-' on `nat'. It is fast and is used automatically by the
6187 NB: At the moment, these decision procedures do not cope with mixed
6188 nat/int formulae where the two parts interact, such as `m < n ==>
6191 * HOL/Numeral provides a generic theory of numerals (encoded
6192 efficiently as bit strings); setup for types nat/int/real is in place;
6193 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6194 int, existing theories and proof scripts may require a few additional
6197 * integer division and remainder can now be performed on constant
6200 * many properties of integer multiplication, division and remainder
6203 * An interface to the Stanford Validity Checker (SVC) is available through the
6204 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6205 are proved automatically. SVC must be installed separately, and its results
6206 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6207 invocation of the underlying oracle). For SVC see
6208 http://verify.stanford.edu/SVC
6210 * IsaMakefile: the HOL-Real target now builds an actual image;
6215 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6216 (in Isabelle/Isar) -- by Gertrud Bauer;
6218 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6219 analysis for assembly languages with subtypes;
6221 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6222 -- avoids syntactic ambiguities and treats state, transition, and
6223 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6224 changed syntax and (many) tactics;
6226 * HOL/inductive: Now also handles more general introduction rules such
6227 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6228 theorems are now maintained within the theory (maintained via the
6231 * HOL/datatype: Now also handles arbitrarily branching datatypes
6232 (using function types) such as
6234 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6236 * HOL/record: record_simproc (part of the default simpset) takes care
6237 of selectors applied to updated records; record_split_tac is no longer
6238 part of the default claset; update_defs may now be removed from the
6239 simpset in many cases; COMPATIBILITY: old behavior achieved by
6241 claset_ref () := claset() addSWrapper record_split_wrapper;
6242 Delsimprocs [record_simproc]
6244 * HOL/typedef: fixed type inference for representing set; type
6245 arguments now have to occur explicitly on the rhs as type constraints;
6247 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6248 names rather than an ML expression;
6250 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6251 supplied later. Program schemes can be defined, such as
6252 "While B C s = (if B s then While B C (C s) else s)"
6253 where the well-founded relation can be chosen after B and C have been given.
6255 * HOL/List: the constructors of type list are now Nil and Cons;
6256 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6257 course, ML tools referring to List.list.op # etc. have to be adapted;
6259 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6260 disabled by default; run isabelle with option -m HOL to get back to
6261 the original Gordon/HOL-style output;
6263 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6264 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6266 * HOL basic syntax simplified (more orthogonal): all variants of
6267 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6268 Eps operator is provided as well: "SOME x. P[x]";
6270 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6272 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6273 thus available for user theories;
6275 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6276 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6279 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6280 several times and then mp;
6285 * the notation <<...>> is now available as a notation for sequences of
6288 * the simplifier is now installed
6290 * the axiom system has been generalized (thanks to Soren Heilmann)
6292 * the classical reasoner now has a default rule database
6297 * new primrec section allows primitive recursive functions to be given
6298 directly (as in HOL) over datatypes and the natural numbers;
6300 * new tactics induct_tac and exhaust_tac for induction (or case
6301 analysis) over datatypes and the natural numbers;
6303 * the datatype declaration of type T now defines the recursor T_rec;
6305 * simplification automatically does freeness reasoning for datatype
6308 * automatic type-inference, with AddTCs command to insert new
6309 type-checking rules;
6311 * datatype introduction rules are now added as Safe Introduction rules
6314 * the syntax "if P then x else y" is now available in addition to
6318 *** Internal programming interfaces ***
6320 * tuned simplifier trace output; new flag debug_simp;
6322 * structures Vartab / Termtab (instances of TableFun) offer efficient
6323 tables indexed by indexname_ord / term_ord (compatible with aconv);
6325 * AxClass.axclass_tac lost the theory argument;
6327 * tuned current_goals_markers semantics: begin / end goal avoids
6328 printing empty lines;
6330 * removed prs and prs_fn hook, which was broken because it did not
6331 include \n in its semantics, forcing writeln to add one
6332 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6333 string -> unit if you really want to output text without newline;
6335 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6336 plain output, interface builders may have to enable 'isabelle_font'
6337 mode to get Isabelle font glyphs as before;
6339 * refined token_translation interface; INCOMPATIBILITY: output length
6340 now of type real instead of int;
6342 * theory loader actions may be traced via new ThyInfo.add_hook
6343 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6344 your own database of information attached to *whole* theories -- as
6345 opposed to intra-theory data slots offered via TheoryDataFun;
6347 * proper handling of dangling sort hypotheses (at last!);
6348 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6349 extra sort hypotheses that can be witnessed from the type signature;
6350 the force_strip_shyps flag is gone, any remaining shyps are simply
6351 left in the theorem (with a warning issued by strip_shyps_warning);
6355 New in Isabelle98-1 (October 1998)
6356 ----------------------------------
6358 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6360 * several changes of automated proof tools;
6362 * HOL: major changes to the inductive and datatype packages, including
6363 some minor incompatibilities of theory syntax;
6365 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6368 * HOL: removed duplicate thms in Arith:
6369 less_imp_add_less should be replaced by trans_less_add1
6370 le_imp_add_le should be replaced by trans_le_add1
6372 * HOL: unary minus is now overloaded (new type constraints may be
6375 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6376 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6377 now taken as an integer constant.
6379 * Pure: ML function 'theory_of' renamed to 'theory';
6385 1. Asm_full_simp_tac is now more aggressive.
6386 1. It will sometimes reorient premises if that increases their power to
6388 2. It does no longer proceed strictly from left to right but may also
6389 rotate premises to achieve further simplification.
6390 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6391 old Asm_full_simp_tac in that it does not rotate premises.
6392 2. The simplifier now knows a little bit about nat-arithmetic.
6394 * Classical reasoner: wrapper mechanism for the classical reasoner now
6395 allows for selected deletion of wrappers, by introduction of names for
6396 wrapper functionals. This implies that addbefore, addSbefore,
6397 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6398 and that adding two tactics with the same name overwrites the first
6399 one (emitting a warning).
6400 type wrapper = (int -> tactic) -> (int -> tactic)
6401 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6402 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6403 delWrapper, delSWrapper: claset * string -> claset
6404 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6406 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6407 semantics; addbefore now affects only the unsafe part of step_tac
6408 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6409 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6412 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6413 compWrapper; added safe wrapper (and access functions for it);
6415 * HOL/split_all_tac is now much faster and fails if there is nothing
6416 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6417 and the names of the automatically generated variables have changed.
6418 split_all_tac has moved within claset() from unsafe wrappers to safe
6419 wrappers, which means that !!-bound variables are split much more
6420 aggressively, and safe_tac and clarify_tac now split such variables.
6421 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6422 Note: the same holds for record_split_tac, which does the job of
6423 split_all_tac for record fields.
6425 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6426 permanently to the default simpset using Addsplits just like
6427 Addsimps. They can be removed via Delsplits just like
6428 Delsimps. Lower-case versions are also available.
6430 * HOL/Simplifier: The rule split_if is now part of the default
6431 simpset. This means that the simplifier will eliminate all occurrences
6432 of if-then-else in the conclusion of a goal. To prevent this, you can
6433 either remove split_if completely from the default simpset by
6434 `Delsplits [split_if]' or remove it in a specific call of the
6435 simplifier using `... delsplits [split_if]'. You can also add/delete
6436 other case splitting rules to/from the default simpset: every datatype
6437 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6438 t is the name of the datatype).
6440 * Classical reasoner / Simplifier combination: new force_tac (and
6441 derivatives Force_tac, force) combines rewriting and classical
6442 reasoning (and whatever other tools) similarly to auto_tac, but is
6443 aimed to solve the given subgoal completely.
6448 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6449 and `goalw': the theory is no longer needed as an explicit argument -
6450 the current theory context is used; assumptions are no longer returned
6451 at the ML-level unless one of them starts with ==> or !!; it is
6452 recommended to convert to these new commands using isatool fixgoal
6453 (backup your sources first!);
6455 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6456 the current theory context, and 'theory' to lookup stored theories;
6458 * new theory section 'locale' for declaring constants, assumptions and
6459 definitions that have local scope;
6461 * new theory section 'nonterminals' for purely syntactic types;
6463 * new theory section 'setup' for generic ML setup functions
6464 (e.g. package initialization);
6466 * the distribution now includes Isabelle icons: see
6467 lib/logo/isabelle-{small,tiny}.xpm;
6469 * isatool install - install binaries with absolute references to
6472 * isatool logo -- create instances of the Isabelle logo (as EPS);
6474 * print mode 'emacs' reserved for Isamode;
6476 * support multiple print (ast) translations per constant name;
6478 * theorems involving oracles are now printed with a suffixed [!];
6483 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6485 * HOL/inductive package reorganized and improved: now supports mutual
6491 oddI "n : EVEN ==> Suc n : ODD"
6492 evenI "n : ODD ==> Suc n : EVEN"
6494 new theorem list "elims" contains an elimination rule for each of the
6495 recursive sets; inductive definitions now handle disjunctive premises
6496 correctly (also ZF);
6498 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6499 "mutual_induct" no longer exists - the induction rule is always
6500 contained in "induct";
6503 * HOL/datatype package re-implemented and greatly improved: now
6504 supports mutually recursive datatypes such as
6507 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6508 | SUM ('a aexp) ('a aexp)
6509 | DIFF ('a aexp) ('a aexp)
6512 'a bexp = LESS ('a aexp) ('a aexp)
6513 | AND ('a bexp) ('a bexp)
6514 | OR ('a bexp) ('a bexp)
6516 as well as indirectly recursive datatypes such as
6519 ('a, 'b) term = Var 'a
6520 | App 'b ((('a, 'b) term) list)
6522 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6523 induction on mutually / indirectly recursive datatypes.
6525 Primrec equations are now stored in theory and can be accessed via
6526 <function_name>.simps.
6530 - Theories using datatypes must now have theory Datatype as an
6532 - The specific <typename>.induct_tac no longer exists - use the
6533 generic induct_tac instead.
6534 - natE has been renamed to nat.exhaust - use exhaust_tac
6535 instead of res_inst_tac ... natE. Note that the variable
6536 names in nat.exhaust differ from the names in natE, this
6537 may cause some "fragile" proofs to fail.
6538 - The theorems split_<typename>_case and split_<typename>_case_asm
6539 have been renamed to <typename>.split and <typename>.split_asm.
6540 - Since default sorts of type variables are now handled correctly,
6541 some datatype definitions may have to be annotated with explicit
6543 - Primrec definitions no longer require function name and type
6544 of recursive argument.
6546 Consider using isatool fixdatatype to adapt your theories and proof
6547 scripts to the new package (backup your sources first!).
6550 * HOL/record package: considerably improved implementation; now
6551 includes concrete syntax for record types, terms, updates; theorems
6552 for surjective pairing and splitting !!-bound record variables; proof
6553 support is as follows:
6555 1) standard conversions (selectors or updates applied to record
6556 constructor terms) are part of the standard simpset;
6558 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6559 made part of standard simpset and claset via addIffs;
6561 3) a tactic for record field splitting (record_split_tac) is part of
6562 the standard claset (addSWrapper);
6564 To get a better idea about these rules you may retrieve them via
6565 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6566 the name of your record type.
6568 The split tactic 3) conceptually simplifies by the following rule:
6570 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6572 Thus any record variable that is bound by meta-all will automatically
6573 blow up into some record constructor term, consequently the
6574 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6575 solve record problems automatically.
6578 * reorganized the main HOL image: HOL/Integ and String loaded by
6579 default; theory Main includes everything;
6581 * automatic simplification of integer sums and comparisons, using cancellation;
6583 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6585 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6587 * many new identities for unions, intersections, set difference, etc.;
6589 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6590 called split_if, split_split, split_sum_case and split_nat_case (to go
6591 with add/delsplits);
6593 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6594 (?x::unit) = (); this is made part of the default simpset, which COULD
6595 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6596 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6597 unit_abs_eta_conv is added in order to counter the effect of
6598 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6601 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6604 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6605 It and 'sym RS equals0D' are now in the default claset, giving automatic
6606 disjointness reasoning but breaking a few old proofs.
6608 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6609 to 'converse' from 'inverse' (for compatibility with ZF and some
6612 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6613 the well-founded relation;
6615 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6616 Compl A. The "Compl" syntax remains available as input syntax for this
6619 * HOL/Update: new theory of function updates:
6620 f(a:=b) == %x. if x=a then b else f x
6621 may also be iterated as in f(a:=b,c:=d,...);
6623 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6626 - new function list_update written xs[i:=v] that updates the i-th
6627 list position. May also be iterated as in xs[i:=a,j:=b,...].
6628 - new function `upt' written [i..j(] which generates the list
6629 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6630 bound write [i..j], which is a shorthand for [i..j+1(].
6631 - new lexicographic orderings and corresponding wellfoundedness theorems.
6634 - removed 'pred' (predecessor) function;
6635 - generalized some theorems about n-1;
6636 - many new laws about "div" and "mod";
6637 - new laws about greatest common divisors (see theory ex/Primes);
6639 * HOL/Relation: renamed the relational operator r^-1 "converse"
6640 instead of "inverse";
6642 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6643 of the multiset ordering;
6645 * directory HOL/Real: a construction of the reals using Dedekind cuts
6646 (not included by default);
6648 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6650 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6651 programs, i.e. different program variables may have different types.
6653 * calling (stac rew i) now fails if "rew" has no effect on the goal
6654 [previously, this check worked only if the rewrite rule was unconditional]
6655 Now rew can involve either definitions or equalities (either == or =).
6660 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6661 only the theorems proved on ZF.ML;
6663 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6664 It and 'sym RS equals0D' are now in the default claset, giving automatic
6665 disjointness reasoning but breaking a few old proofs.
6667 * ZF/Update: new theory of function updates
6668 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6669 may also be iterated as in f(a:=b,c:=d,...);
6671 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6673 * calling (stac rew i) now fails if "rew" has no effect on the goal
6674 [previously, this check worked only if the rewrite rule was unconditional]
6675 Now rew can involve either definitions or equalities (either == or =).
6677 * case_tac provided for compatibility with HOL
6678 (like the old excluded_middle_tac, but with subgoals swapped)
6681 *** Internal programming interfaces ***
6683 * Pure: several new basic modules made available for general use, see
6684 also src/Pure/README;
6686 * improved the theory data mechanism to support encapsulation (data
6687 kind name replaced by private Object.kind, acting as authorization
6688 key); new type-safe user interface via functor TheoryDataFun; generic
6689 print_data function becomes basically useless;
6691 * removed global_names compatibility flag -- all theory declarations
6692 are qualified by default;
6694 * module Pure/Syntax now offers quote / antiquote translation
6695 functions (useful for Hoare logic etc. with implicit dependencies);
6696 see HOL/ex/Antiquote for an example use;
6698 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6701 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6704 * Display.print_goals function moved to Locale.print_goals;
6706 * standard print function for goals supports current_goals_markers
6707 variable for marking begin of proof, end of proof, start of goal; the
6708 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6709 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6714 New in Isabelle98 (January 1998)
6715 --------------------------------
6717 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6719 * changed lexical syntax of terms / types: dots made part of long
6720 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6722 * simpset (and claset) reference variable replaced by functions
6723 simpset / simpset_ref;
6725 * no longer supports theory aliases (via merge) and non-trivial
6726 implicit merge of thms' signatures;
6728 * most internal names of constants changed due to qualified names;
6730 * changed Pure/Sequence interface (see Pure/seq.ML);
6733 *** General Changes ***
6735 * hierachically structured name spaces (for consts, types, axms, thms
6736 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6737 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6738 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6739 long_names for fully qualified output names; NOTE: ML programs
6740 (special tactics, packages etc.) referring to internal names may have
6741 to be adapted to cope with fully qualified names; in case of severe
6742 backward campatibility problems try setting 'global_names' at compile
6743 time to have enrything declared within a flat name space; one may also
6744 fine tune name declarations in theories via the 'global' and 'local'
6747 * reimplemented the implicit simpset and claset using the new anytype
6748 data filed in signatures; references simpset:simpset ref etc. are
6749 replaced by functions simpset:unit->simpset and
6750 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6751 to patch your ML files accordingly;
6753 * HTML output now includes theory graph data for display with Java
6754 applet or isatool browser; data generated automatically via isatool
6755 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6757 * defs may now be conditional; improved rewrite_goals_tac to handle
6758 conditional equations;
6760 * defs now admits additional type arguments, using TYPE('a) syntax;
6762 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6763 creates a new theory node; implicit merge of thms' signatures is
6764 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6765 transfer:theory->thm->thm in (rare) cases;
6767 * improved handling of draft signatures / theories; draft thms (and
6768 ctyps, cterms) are automatically promoted to real ones;
6770 * slightly changed interfaces for oracles: admit many per theory, named
6771 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6773 * print_goals: optional output of const types (set show_consts and
6776 * improved output of warnings (###) and errors (***);
6778 * subgoal_tac displays a warning if the new subgoal has type variables;
6780 * removed old README and Makefiles;
6782 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6784 * removed obsolete init_pps and init_database;
6786 * deleted the obsolete tactical STATE, which was declared by
6787 fun STATE tacfun st = tacfun st st;
6789 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6790 (which abbreviates $HOME);
6792 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6793 use isatool fixseq to adapt your ML programs (this works for fully
6794 qualified references to the Sequence structure only!);
6796 * use_thy no longer requires writable current directory; it always
6797 reloads .ML *and* .thy file, if either one is out of date;
6800 *** Classical Reasoner ***
6802 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6803 tactics that use classical reasoning to simplify a subgoal without
6804 splitting it into several subgoals;
6806 * Safe_tac: like safe_tac but uses the default claset;
6811 * added simplification meta rules:
6812 (asm_)(full_)simplify: simpset -> thm -> thm;
6814 * simplifier.ML no longer part of Pure -- has to be loaded by object
6817 * added prems argument to simplification procedures;
6819 * HOL, FOL, ZF: added infix function `addsplits':
6820 instead of `<simpset> setloop (split_tac <thms>)'
6821 you can simply write `<simpset> addsplits <thms>'
6826 * TYPE('a) syntax for type reflection terms;
6828 * no longer handles consts with name "" -- declare as 'syntax' instead;
6830 * pretty printer: changed order of mixfix annotation preference (again!);
6832 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6837 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6838 with `addloop' of the simplifier to faciliate case splitting in premises.
6840 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6842 * HOL/Auth: new protocol proofs including some for the Internet
6845 * HOL/Map: new theory of `maps' a la VDM;
6847 * HOL/simplifier: simplification procedures nat_cancel_sums for
6848 cancelling out common nat summands from =, <, <= (in)equalities, or
6849 differences; simplification procedures nat_cancel_factor for
6850 cancelling common factor from =, <, <= (in)equalities over natural
6851 sums; nat_cancel contains both kinds of procedures, it is installed by
6852 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6854 * HOL/simplifier: terms of the form
6855 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6857 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6858 and those of the form
6859 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6861 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6864 Each datatype `t' now comes with a theorem `split_t_case' of the form
6866 P(t_case f1 ... fn x) =
6867 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6869 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6872 and a theorem `split_t_case_asm' of the form
6874 P(t_case f1 ... fn x) =
6875 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6877 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6879 which can be added to a simpset via `addsplits'. The existing theorems
6880 expand_list_case and expand_option_case have been renamed to
6881 split_list_case and split_option_case.
6884 - `pred n' is automatically converted to `n-1'.
6885 Users are strongly encouraged not to use `pred' any longer,
6886 because it will disappear altogether at some point.
6887 - Users are strongly encouraged to write "0 < n" rather than
6888 "n ~= 0". Theorems and proof tools have been modified towards this
6892 the function "set_of_list" has been renamed "set" (and its theorems too);
6893 the function "nth" now takes its arguments in the reverse order and
6894 has acquired the infix notation "!" as in "xs!n".
6896 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6898 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6899 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6901 * HOL/record: extensible records with schematic structural subtyping
6902 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6903 still lacks various theorems and concrete record syntax;
6908 * removed "axioms" and "generated by" sections;
6910 * replaced "ops" section by extended "consts" section, which is capable of
6911 handling the continuous function space "->" directly;
6914 . proves theorems immediately and stores them in the theory,
6915 . creates hierachical name space,
6916 . now uses normal mixfix annotations (instead of cinfix...),
6917 . minor changes to some names and values (for consistency),
6918 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6919 . separator between mutual domain defs: changed "," to "and",
6920 . improved handling of sort constraints; now they have to
6921 appear on the left-hand side of the equations only;
6923 * fixed LAM <x,y,zs>.b syntax;
6925 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6926 adm (%x. P (t x)), where P is chainfinite and t continuous;
6931 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6932 with `addloop' of the simplifier to faciliate case splitting in premises.
6934 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6935 in HOL, they strip ALL and --> from proved theorems;
6939 New in Isabelle94-8 (May 1997)
6940 ------------------------------
6942 *** General Changes ***
6944 * new utilities to build / run / maintain Isabelle etc. (in parts
6945 still somewhat experimental); old Makefiles etc. still functional;
6947 * new 'Isabelle System Manual';
6949 * INSTALL text, together with ./configure and ./build scripts;
6951 * reimplemented type inference for greater efficiency, better error
6952 messages and clean internal interface;
6954 * prlim command for dealing with lots of subgoals (an easier way of
6955 setting goals_limit);
6960 * supports alternative (named) syntax tables (parser and pretty
6961 printer); internal interface is provided by add_modesyntax(_i);
6963 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6964 be used in conjunction with the Isabelle symbol font; uses the
6965 "symbols" syntax table;
6967 * added token_translation interface (may translate name tokens in
6968 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6969 the current print_mode); IMPORTANT: user print translation functions
6970 are responsible for marking newly introduced bounds
6971 (Syntax.mark_boundT);
6973 * token translations for modes "xterm" and "xterm_color" that display
6974 names in bold, underline etc. or colors (which requires a color
6977 * infixes may now be declared with names independent of their syntax;
6979 * added typed_print_translation (like print_translation, but may
6980 access type of constant);
6983 *** Classical Reasoner ***
6985 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6986 some limitations. Blast_tac...
6987 + ignores addss, addbefore, addafter; this restriction is intrinsic
6988 + ignores elimination rules that don't have the correct format
6989 (the conclusion MUST be a formula variable)
6990 + ignores types, which can make HOL proofs fail
6991 + rules must not require higher-order unification, e.g. apply_type in ZF
6992 [message "Function Var's argument not a bound variable" relates to this]
6993 + its proof strategy is more general but can actually be slower
6995 * substitution with equality assumptions no longer permutes other
6998 * minor changes in semantics of addafter (now called addaltern); renamed
6999 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7000 (and access functions for it);
7002 * improved combination of classical reasoner and simplifier:
7003 + functions for handling clasimpsets
7004 + improvement of addss: now the simplifier is called _after_ the
7006 + safe variant of addss called addSss: uses safe simplifications
7007 _during_ the safe steps. It is more complete as it allows multiple
7008 instantiations of unknowns (e.g. with slow_tac).
7012 * added interface for simplification procedures (functions that
7013 produce *proven* rewrite rules on the fly, depending on current
7016 * ordering on terms as parameter (used for ordered rewriting);
7018 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7020 * the solver is now split into a safe and an unsafe part.
7021 This should be invisible for the normal user, except that the
7022 functions setsolver and addsolver have been renamed to setSolver and
7023 addSolver; added safe_asm_full_simp_tac;
7028 * a generic induction tactic `induct_tac' which works for all datatypes and
7029 also for type `nat';
7031 * a generic case distinction tactic `exhaust_tac' which works for all
7032 datatypes and also for type `nat';
7034 * each datatype comes with a function `size';
7036 * patterns in case expressions allow tuple patterns as arguments to
7037 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7039 * primrec now also works with type nat;
7041 * recdef: a new declaration form, allows general recursive functions to be
7042 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7044 * the constant for negation has been renamed from "not" to "Not" to
7045 harmonize with FOL, ZF, LK, etc.;
7047 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7050 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7052 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7053 problems in commutative rings, using axiomatic type classes for + and *;
7055 * more examples in HOL/MiniML and HOL/Auth;
7057 * more default rewrite rules for quantifiers, union/intersection;
7059 * a new constant `arbitrary == @x.False';
7061 * HOLCF/IOA replaces old HOL/IOA;
7063 * HOLCF changes: derived all rules and arities
7064 + axiomatic type classes instead of classes
7065 + typedef instead of faking type definitions
7066 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7067 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7068 + eliminated the types void, one, tr
7069 + use unit lift and bool lift (with translations) instead of one and tr
7070 + eliminated blift from Lift3.thy (use Def instead of blift)
7071 all eliminated rules are derived as theorems --> no visible changes ;
7076 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7077 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7078 as ZF_cs addSIs [equalityI];
7082 New in Isabelle94-7 (November 96)
7083 ---------------------------------
7085 * allowing negative levels (as offsets) in prlev and choplev;
7087 * super-linear speedup for large simplifications;
7089 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7090 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7091 FAIL); can suppress it using the command Delsimps (ex_simps @
7092 all_simps); De Morgan laws are also now included, by default;
7094 * improved printing of ==> : ~:
7096 * new object-logic "Sequents" adds linear logic, while replacing LK
7097 and Modal (thanks to Sara Kalvala);
7099 * HOL/Auth: correctness proofs for authentication protocols;
7101 * HOL: new auto_tac combines rewriting and classical reasoning (many
7102 examples on HOL/Auth);
7104 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7105 the rewriter and classical reasoner simultaneously;
7107 * function uresult no longer returns theorems in "standard" format;
7108 regain previous version by: val uresult = standard o uresult;
7115 * oracles -- these establish an interface between Isabelle and trusted
7116 external reasoners, which may deliver results as theorems;
7118 * proof objects (in particular record all uses of oracles);
7120 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7122 * "constdefs" section in theory files;
7124 * "primrec" section (HOL) no longer requires names;
7126 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7133 * reduced space requirements;
7135 * automatic HTML generation from theories;
7137 * theory files no longer require "..." (quotes) around most types;
7139 * new examples, including two proofs of the Church-Rosser theorem;
7141 * non-curried (1994) version of HOL is no longer distributed;
7148 * greatly reduced space requirements;
7150 * theory files (.thy) no longer require \...\ escapes at line breaks;
7152 * searchable theorem database (see the section "Retrieving theorems" on
7153 page 8 of the Reference Manual);
7155 * new examples, including Grabczewski's monumental case study of the
7158 * The previous version of HOL renamed to Old_HOL;
7160 * The new version of HOL (previously called CHOL) uses a curried syntax
7161 for functions. Application looks like f a b instead of f(a,b);
7163 * Mutually recursive inductive definitions finally work in HOL;
7165 * In ZF, pattern-matching on tuples is now available in all abstractions and
7166 translates to the operator "split";
7173 * new infix operator, addss, allowing the classical reasoner to
7174 perform simplification at each step of its search. Example:
7175 fast_tac (cs addss ss)
7177 * a new logic, CHOL, the same as HOL, but with a curried syntax
7178 for functions. Application looks like f a b instead of f(a,b). Also pairs
7179 look like (a,b) instead of <a,b>;
7181 * PLEASE NOTE: CHOL will eventually replace HOL!
7183 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7184 It translates to the operator "split". A new theory of integers is available;
7186 * In ZF, integer numerals now denote two's-complement binary integers.
7187 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7189 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7190 of the Axiom of Choice;
7197 * Significantly faster resolution;
7199 * the different sections in a .thy file can now be mixed and repeated
7202 * Database of theorems for FOL, HOL and ZF. New
7203 commands including qed, qed_goal and bind_thm store theorems in the database.
7205 * Simple database queries: return a named theorem (get_thm) or all theorems of
7206 a given theory (thms_of), or find out what theory a theorem was proved in
7209 * Bugs fixed in the inductive definition and datatype packages;
7211 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7212 and HOL_dup_cs obsolete;
7214 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7217 * Simpler definition of function space in ZF;
7219 * new results about cardinal and ordinal arithmetic in ZF;
7221 * 'subtype' facility in HOL for introducing new types as subsets of existing
7224 :mode=text:wrap=hard:maxLineLen=72: