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 - Fixed soundness bug when "full_descrs" is enabled.
430 - Improved precision of set constructs.
431 - Added "atoms" option.
432 - Added cache to speed up repeated Kodkod invocations on the same
434 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
435 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
436 "SAT4J_Light". INCOMPATIBILITY.
437 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
438 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
439 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
441 * Moved the SMT binding into the HOL image.
446 * Variable names in lemmas generated by the domain package have
447 changed; the naming scheme is now consistent with the HOL datatype
448 package. Some proof scripts may be affected, INCOMPATIBILITY.
450 * The domain package no longer defines the function "foo_copy" for
451 recursive domain "foo". The reach lemma is now stated directly in
452 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
453 be reformulated in terms of "foo_take", INCOMPATIBILITY.
455 * Most definedness lemmas generated by the domain package (previously
456 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
457 like "foo$x = UU <-> x = UU", which works better as a simp rule.
458 Proof scripts that used definedness lemmas as intro rules may break,
459 potential INCOMPATIBILITY.
461 * Induction and casedist rules generated by the domain package now
462 declare proper case_names (one called "bottom", and one named for each
463 constructor). INCOMPATIBILITY.
465 * For mutually-recursive domains, separate "reach" and "take_lemma"
466 rules are generated for each domain, INCOMPATIBILITY.
468 foo_bar.reach ~> foo.reach bar.reach
469 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
471 * Some lemmas generated by the domain package have been renamed for
472 consistency with the datatype package, INCOMPATIBILITY.
474 foo.ind ~> foo.induct
475 foo.finite_ind ~> foo.finite_induct
476 foo.coind ~> foo.coinduct
477 foo.casedist ~> foo.exhaust
478 foo.exhaust ~> foo.nchotomy
480 * For consistency with other definition packages, the fixrec package
481 now generates qualified theorem names, INCOMPATIBILITY.
483 foo_simps ~> foo.simps
484 foo_unfold ~> foo.unfold
485 foo_induct ~> foo.induct
487 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
488 method and internal fixrec proofs now use the default simpset instead.
491 * The "contlub" predicate has been removed. Proof scripts should use
492 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
494 * The "admw" predicate has been removed, INCOMPATIBILITY.
496 * The constants cpair, cfst, and csnd have been removed in favor of
497 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
502 * Renamed some important ML structures, while keeping the old names
503 for some time as aliases within the structure Legacy:
505 OuterKeyword ~> Keyword
508 OuterSyntax ~> Outer_Syntax
509 PrintMode ~> Print_Mode
510 SpecParse ~> Parse_Spec
513 ThyOutput ~> Thy_Output
514 TypeInfer ~> Type_Infer
516 Note that "open Legacy" simplifies porting of sources, but forgetting
517 to remove it again will complicate porting again in the future.
519 * Most operations that refer to a global context are named
520 accordingly, e.g. Simplifier.global_context or
521 ProofContext.init_global. There are some situations where a global
522 context actually works, but under normal circumstances one needs to
523 pass the proper local context through the code!
525 * Discontinued old TheoryDataFun with its copy/init operation -- data
526 needs to be pure. Functor Theory_Data_PP retains the traditional
527 Pretty.pp argument to merge, which is absent in the standard
530 * Antiquotations for basic formal entities:
532 @{class NAME} -- type class
533 @{class_syntax NAME} -- syntax representation of the above
535 @{type_name NAME} -- logical type
536 @{type_abbrev NAME} -- type abbreviation
537 @{nonterminal NAME} -- type of concrete syntactic category
538 @{type_syntax NAME} -- syntax representation of any of the above
540 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
541 @{const_abbrev NAME} -- abbreviated constant
542 @{const_syntax NAME} -- syntax representation of any of the above
544 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
545 syntax constant (cf. 'syntax' command).
547 * Antiquotation @{make_string} inlines a function to print arbitrary
548 values similar to the ML toplevel. The result is compiler dependent
549 and may fall back on "?" in certain situations.
551 * Sorts.certify_sort and derived "cert" operations for types and terms
552 no longer minimize sorts. Thus certification at the boundary of the
553 inference kernel becomes invariant under addition of class relations,
554 which is an important monotonicity principle. Sorts are now minimized
555 in the syntax layer only, at the boundary between the end-user and the
556 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
557 explicitly in rare situations.
559 * Renamed old-style Drule.standard to Drule.export_without_context, to
560 emphasize that this is in no way a standard operation.
563 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
564 usual for resolution. Rare INCOMPATIBILITY.
566 * Renamed varify/unvarify operations to varify_global/unvarify_global
567 to emphasize that these only work in a global situation (which is
570 * Configuration options now admit dynamic default values, depending on
571 the context or even global references.
573 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
574 uses an efficient external library if available (for Poly/ML).
576 * Curried take and drop in library.ML; negative length is interpreted
577 as infinity (as in chop). Subtle INCOMPATIBILITY.
582 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
583 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
584 proof terms are enabled unconditionally in the new HOL-Proofs image.
586 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
587 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
590 * Old lib/scripts/polyml-platform is superseded by the
591 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
592 variant, even on a 64 bit machine. The following example setting
593 prefers 64 bit if available:
595 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
597 * The preliminary Isabelle/jEdit application demonstrates the emerging
598 Isabelle/Scala layer for advanced prover interaction and integration.
599 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
604 New in Isabelle2009-1 (December 2009)
605 -------------------------------------
609 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
610 one backslash should be used, even in ML sources.
615 * Locale interpretation propagates mixins along the locale hierarchy.
616 The currently only available mixins are the equations used to map
617 local definitions to terms of the target domain of an interpretation.
619 * Reactivated diagnostic command 'print_interps'. Use "print_interps
620 loc" to print all interpretations of locale "loc" in the theory.
621 Interpretations in proofs are not shown.
623 * Thoroughly revised locales tutorial. New section on conditional
626 * On instantiation of classes, remaining undefined class parameters
627 are formally declared. INCOMPATIBILITY.
630 *** Document preparation ***
632 * New generalized style concept for printing terms: @{foo (style) ...}
633 instead of @{foo_style style ...} (old form is still retained for
634 backward compatibility). Styles can be also applied for
635 antiquotations prop, term_type and typeof.
640 * New proof method "smt" for a combination of first-order logic with
641 equality, linear and nonlinear (natural/integer/real) arithmetic, and
642 fixed-size bitvectors; there is also basic support for higher-order
643 features (esp. lambda abstractions). It is an incomplete decision
644 procedure based on external SMT solvers using the oracle mechanism;
645 for the SMT solver Z3, this method is proof-producing. Certificates
646 are provided to avoid calling the external solvers solely for
647 re-checking proofs. Due to a remote SMT service there is no need for
648 installing SMT solvers locally. See src/HOL/SMT.
650 * New commands to load and prove verification conditions generated by
651 the Boogie program verifier or derived systems (e.g. the Verifying C
652 Compiler (VCC) or Spec#). See src/HOL/Boogie.
654 * New counterexample generator tool 'nitpick' based on the Kodkod
655 relational model finder. See src/HOL/Tools/Nitpick and
656 src/HOL/Nitpick_Examples.
658 * New commands 'code_pred' and 'values' to invoke the predicate
659 compiler and to enumerate values of inductive predicates.
661 * A tabled implementation of the reflexive transitive closure.
663 * New implementation of quickcheck uses generic code generator;
664 default generators are provided for all suitable HOL types, records
665 and datatypes. Old quickcheck can be re-activated importing theory
666 Library/SML_Quickcheck.
668 * New testing tool Mirabelle for automated proof tools. Applies
669 several tools and tactics like sledgehammer, metis, or quickcheck, to
670 every proof step in a theory. To be used in batch mode via the
673 * New proof method "sos" (sum of squares) for nonlinear real
674 arithmetic (originally due to John Harison). It requires theory
675 Library/Sum_Of_Squares. It is not a complete decision procedure but
676 works well in practice on quantifier-free real arithmetic with +, -,
677 *, ^, =, <= and <, i.e. boolean combinations of equalities and
678 inequalities between polynomials. It makes use of external
679 semidefinite programming solvers. Method "sos" generates a
680 certificate that can be pasted into the proof thus avoiding the need
681 to call an external tool every time the proof is checked. See
682 src/HOL/Library/Sum_Of_Squares.
684 * New method "linarith" invokes existing linear arithmetic decision
687 * New command 'atp_minimal' reduces result produced by Sledgehammer.
689 * New Sledgehammer option "Full Types" in Proof General settings menu.
690 Causes full type information to be output to the ATPs. This slows
691 ATPs down considerably but eliminates a source of unsound "proofs"
694 * New method "metisFT": A version of metis that uses full type
695 information in order to avoid failures of proof reconstruction.
697 * New evaluator "approximate" approximates an real valued term using
698 the same method as the approximation method.
700 * Method "approximate" now supports arithmetic expressions as
701 boundaries of intervals and implements interval splitting and Taylor
704 * ML antiquotation @{code_datatype} inserts definition of a datatype
705 generated by the code generator; e.g. see src/HOL/Predicate.thy.
707 * New theory SupInf of the supremum and infimum operators for sets of
710 * New theory Probability, which contains a development of measure
711 theory, eventually leading to Lebesgue integration and probability.
713 * Extended Multivariate Analysis to include derivation and Brouwer's
716 * Reorganization of number theory, INCOMPATIBILITY:
717 - new number theory development for nat and int, in theories Divides
718 and GCD as well as in new session Number_Theory
719 - some constants and facts now suffixed with _nat and _int
721 - former session NumberTheory now named Old_Number_Theory, including
722 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
723 - moved theory Pocklington from src/HOL/Library to
724 src/HOL/Old_Number_Theory
726 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
727 lcm of finite and infinite sets. It is shown that they form a complete
730 * Class semiring_div requires superclass no_zero_divisors and proof of
731 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
732 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
733 generalized to class semiring_div, subsuming former theorems
734 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
735 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
738 * Refinements to lattice classes and sets:
739 - less default intro/elim rules in locale variant, more default
740 intro/elim rules in class variant: more uniformity
741 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
743 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
745 - renamed ACI to inf_sup_aci
746 - new class "boolean_algebra"
747 - class "complete_lattice" moved to separate theory
748 "Complete_Lattice"; corresponding constants (and abbreviations)
749 renamed and with authentic syntax:
750 Set.Inf ~> Complete_Lattice.Inf
751 Set.Sup ~> Complete_Lattice.Sup
752 Set.INFI ~> Complete_Lattice.INFI
753 Set.SUPR ~> Complete_Lattice.SUPR
754 Set.Inter ~> Complete_Lattice.Inter
755 Set.Union ~> Complete_Lattice.Union
756 Set.INTER ~> Complete_Lattice.INTER
757 Set.UNION ~> Complete_Lattice.UNION
758 - authentic syntax for
761 - mere abbreviations:
764 Set.inter (for inf, formerly Set.Int)
765 Set.union (for sup, formerly Set.Un)
766 Complete_Lattice.Inter (for Inf)
767 Complete_Lattice.Union (for Sup)
768 Complete_Lattice.INTER (for INFI)
769 Complete_Lattice.UNION (for SUPR)
770 - object-logic definitions as far as appropriate
772 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
773 Un_subset_iff are explicitly deleted as default simp rules; then also
774 their lattice counterparts le_inf_iff and le_sup_iff have to be
775 deleted to achieve the desired effect.
777 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
778 rules by default any longer; the same applies to min_max.inf_absorb1
779 etc. INCOMPATIBILITY.
781 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
782 pred_set_conv by default. INCOMPATIBILITY.
784 * Power operations on relations and functions are now one dedicated
785 constant "compow" with infix syntax "^^". Power operation on
786 multiplicative monoids retains syntax "^" and is now defined generic
787 in class power. INCOMPATIBILITY.
789 * Relation composition "R O S" now has a more standard argument order:
790 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
791 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
792 break, since the O_assoc rule was not rewritten like this. Fix using
793 O_assoc[symmetric]. The same applies to the curried version "R OO S".
795 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
796 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
799 * Most rules produced by inductive and datatype package have mandatory
800 prefixes. INCOMPATIBILITY.
802 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
803 the attribute of the same name. Each of the theorems in the list
804 DERIV_intros assumes composition with an additional function and
805 matches a variable to the derivative, which has to be solved by the
806 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
807 of most elementary terms. Former Maclauren.DERIV_tac and
808 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
811 * Code generator attributes follow the usual underscore convention:
812 code_unfold replaces code unfold
813 code_post replaces code post
818 sizechange -> size_change
819 induct_scheme -> induction_schema
822 * Discontinued abbreviation "arbitrary" of constant "undefined".
823 INCOMPATIBILITY, use "undefined" directly.
826 Suc_eq_add_numeral_1 -> Suc_eq_plus1
827 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
828 Suc_plus1 -> Suc_eq_plus1
829 *anti_sym -> *antisym*
830 vector_less_eq_def -> vector_le_def
833 * Added theorem List.map_map as [simp]. Removed List.map_compose.
836 * Removed predicate "M hassize n" (<--> card M = n & finite M).
842 * Theory Representable defines a class "rep" of domains that are
843 representable (via an ep-pair) in the universal domain type "udom".
844 Instances are provided for all type constructors defined in HOLCF.
846 * The 'new_domain' command is a purely definitional version of the
847 domain package, for representable domains. Syntax is identical to the
848 old domain package. The 'new_domain' package also supports indirect
849 recursion using previously-defined type constructors. See
850 src/HOLCF/ex/New_Domain.thy for examples.
852 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
853 on the left-hand side of an equation, and then performs
854 simplification. Rewriting is done using rules declared with the
855 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
856 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
858 * The pattern-match compiler in 'fixrec' can now handle constructors
859 with HOL function types. Pattern-match combinators for the Pair
860 constructor are pre-configured.
862 * The 'fixrec' package now produces better fixed-point induction rules
863 for mutually-recursive definitions: Induction rules have conclusions
864 of the form "P foo bar" instead of "P <foo, bar>".
866 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
867 been renamed to "below". The name "below" now replaces "less" in many
868 theorem names. (Legacy theorem names using "less" are still supported
871 * The 'fixrec' package now supports "bottom patterns". Bottom
872 patterns can be used to generate strictness rules, or to make
873 functions more strict (much like the bang-patterns supported by the
874 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
880 * Support for Poly/ML 5.3.0, with improved reporting of compiler
881 errors and run-time exceptions, including detailed source positions.
883 * Structure Name_Space (formerly NameSpace) now manages uniquely
884 identified entries, with some additional information such as source
885 position, logical grouping etc.
887 * Theory and context data is now introduced by the simplified and
888 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
889 to be pure, but the old TheoryDataFun for mutable data (with explicit
890 copy operation) is still available for some time.
892 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
893 provides a high-level programming interface to synchronized state
894 variables with atomic update. This works via pure function
895 application within a critical section -- its runtime should be as
896 short as possible; beware of deadlocks if critical code is nested,
897 either directly or indirectly via other synchronized variables!
899 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
900 wraps raw ML references, explicitly indicating their non-thread-safe
901 behaviour. The Isar toplevel keeps this structure open, to
902 accommodate Proof General as well as quick and dirty interactive
903 experiments with references.
905 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
906 parallel tactical reasoning.
908 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
909 are similar to SUBPROOF, but are slightly more flexible: only the
910 specified parts of the subgoal are imported into the context, and the
911 body tactic may introduce new subgoals and schematic variables.
913 * Old tactical METAHYPS, which does not observe the proof context, has
914 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
915 or Subgoal.FOCUS etc.
917 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
918 functors have their own ML name space there is no point to mark them
919 separately.) Minor INCOMPATIBILITY.
921 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
923 * Renamed several structures FooBar to Foo_Bar. Occasional,
926 * Operations of structure Skip_Proof no longer require quick_and_dirty
927 mode, which avoids critical setmp.
929 * Eliminated old Attrib.add_attributes, Method.add_methods and related
930 combinators for "args". INCOMPATIBILITY, need to use simplified
931 Attrib/Method.setup introduced in Isabelle2009.
933 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
934 back on global_simpset_of, global_claset_of, global_clasimpset_of as
935 last resort. INCOMPATIBILITY.
937 * Display.pretty_thm now requires a proper context (cf. former
938 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
939 or even Display.pretty_thm_without_context as last resort.
942 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
943 Syntax.pretty_typ/term directly, preferably with proper context
944 instead of global theory.
949 * Further fine tuning of parallel proof checking, scales up to 8 cores
950 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
953 * Support for additional "Isabelle components" via etc/components, see
954 also the system manual.
956 * The isabelle makeall tool now operates on all components with
957 IsaMakefile, not just hardwired "logics".
959 * Removed "compress" option from isabelle-process and isabelle usedir;
960 this is always enabled.
962 * Discontinued support for Poly/ML 4.x versions.
964 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
965 on a given logic image. This requires the lighttpd webserver and is
966 currently supported on Linux only.
970 New in Isabelle2009 (April 2009)
971 --------------------------------
975 * Simplified main Isabelle executables, with less surprises on
976 case-insensitive file-systems (such as Mac OS).
978 - The main Isabelle tool wrapper is now called "isabelle" instead of
981 - The former "isabelle" alias for "isabelle-process" has been
982 removed (should rarely occur to regular users).
984 - The former "isabelle-interface" and its alias "Isabelle" have been
985 removed (interfaces are now regular Isabelle tools).
987 Within scripts and make files, the Isabelle environment variables
988 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
989 respectively. (The latter are still available as legacy feature.)
991 The old isabelle-interface wrapper could react in confusing ways if
992 the interface was uninstalled or changed otherwise. Individual
993 interface tool configuration is now more explicit, see also the
994 Isabelle system manual. In particular, Proof General is now available
995 via "isabelle emacs".
997 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
998 purge installed copies of Isabelle executables and re-run "isabelle
999 install -p ...", or use symlinks.
1001 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1002 old ~/isabelle, which was slightly non-standard and apt to cause
1003 surprises on case-insensitive file-systems (such as Mac OS).
1005 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1006 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1007 care is required when using older releases of Isabelle. Note that
1008 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1009 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1011 * Proofs of fully specified statements are run in parallel on
1012 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1013 a regular 4-core machine, if the initial heap space is made reasonably
1014 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1016 * The main reference manuals ("isar-ref", "implementation", and
1017 "system") have been updated and extended. Formally checked references
1018 as hyperlinks are now available uniformly.
1023 * Complete re-implementation of locales. INCOMPATIBILITY in several
1024 respects. The most important changes are listed below. See the
1025 Tutorial on Locales ("locales" manual) for details.
1027 - In locale expressions, instantiation replaces renaming. Parameters
1028 must be declared in a for clause. To aid compatibility with previous
1029 parameter inheritance, in locale declarations, parameters that are not
1030 'touched' (instantiation position "_" or omitted) are implicitly added
1031 with their syntax at the beginning of the for clause.
1033 - Syntax from abbreviations and definitions in locales is available in
1034 locale expressions and context elements. The latter is particularly
1035 useful in locale declarations.
1037 - More flexible mechanisms to qualify names generated by locale
1038 expressions. Qualifiers (prefixes) may be specified in locale
1039 expressions, and can be marked as mandatory (syntax: "name!:") or
1040 optional (syntax "name?:"). The default depends for plain "name:"
1041 depends on the situation where a locale expression is used: in
1042 commands 'locale' and 'sublocale' prefixes are optional, in
1043 'interpretation' and 'interpret' prefixes are mandatory. The old
1044 implicit qualifiers derived from the parameter names of a locale are
1045 no longer generated.
1047 - Command "sublocale l < e" replaces "interpretation l < e". The
1048 instantiation clause in "interpretation" and "interpret" (square
1049 brackets) is no longer available. Use locale expressions.
1051 - When converting proof scripts, mandatory qualifiers in
1052 'interpretation' and 'interpret' should be retained by default, even
1053 if this is an INCOMPATIBILITY compared to former behavior. In the
1054 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1055 in locale expressions range over a single locale instance only.
1057 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1058 In existing theorem specifications replace the includes element by the
1059 respective context elements of the included locale, omitting those
1060 that are already present in the theorem specification. Multiple
1061 assume elements of a locale should be replaced by a single one
1062 involving the locale predicate. In the proof body, declarations (most
1063 notably theorems) may be regained by interpreting the respective
1064 locales in the proof context as required (command "interpret").
1066 If using "includes" in replacement of a target solely because the
1067 parameter types in the theorem are not as general as in the target,
1068 consider declaring a new locale with additional type constraints on
1069 the parameters (context element "constrains").
1071 - Discontinued "locale (open)". INCOMPATIBILITY.
1073 - Locale interpretation commands no longer attempt to simplify goal.
1074 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1075 methods intro_locales and unfold_locales to clarify.
1077 - Locale interpretation commands no longer accept interpretation
1078 attributes. INCOMPATIBILITY.
1080 * Class declaration: so-called "base sort" must not be given in import
1081 list any longer, but is inferred from the specification. Particularly
1088 class foo = type + ...
1090 * Class target: global versions of theorems stemming do not carry a
1091 parameter prefix any longer. INCOMPATIBILITY.
1093 * Class 'instance' command no longer accepts attached definitions.
1094 INCOMPATIBILITY, use proper 'instantiation' target instead.
1096 * Recovered hiding of consts, which was accidentally broken in
1097 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1098 makes c inaccessible; consider using ``hide (open) const c'' instead.
1100 * Slightly more coherent Pure syntax, with updated documentation in
1101 isar-ref manual. Removed locales meta_term_syntax and
1102 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1103 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1104 directly in regular applications.
1106 * There is a new syntactic category "float_const" for signed decimal
1107 fractions (e.g. 123.45 or -123.45).
1109 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1110 interface with 'setup' command instead.
1112 * Command 'local_setup' is similar to 'setup', but operates on a local
1115 * The 'axiomatization' command now only works within a global theory
1116 context. INCOMPATIBILITY.
1118 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1119 hypotheses. Sorts required in the course of reasoning need to be
1120 covered by the constraints in the initial statement, completed by the
1121 type instance information of the background theory. Non-trivial sort
1122 hypotheses, which rarely occur in practice, may be specified via
1123 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1125 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1127 The result contains an implicit sort hypotheses as before --
1128 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1131 * Generalized Isar history, with support for linear undo, direct state
1134 * Changed defaults for unify configuration options:
1136 unify_trace_bound = 50 (formerly 25)
1137 unify_search_bound = 60 (formerly 30)
1139 * Different bookkeeping for code equations (INCOMPATIBILITY):
1141 a) On theory merge, the last set of code equations for a particular
1142 constant is taken (in accordance with the policy applied by other
1143 parts of the code generator framework).
1145 b) Code equations stemming from explicit declarations (e.g. code
1146 attribute) gain priority over default code equations stemming
1147 from definition, primrec, fun etc.
1149 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1151 * Unified theorem tables for both code generators. Thus [code
1152 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1154 * Command 'find_consts' searches for constants based on type and name
1157 find_consts "_ => bool"
1159 By default, matching is against subtypes, but it may be restricted to
1160 the whole type. Searching by name is possible. Multiple queries are
1161 conjunctive and queries may be negated by prefixing them with a
1164 find_consts strict: "_ => bool" name: "Int" -"int => int"
1166 * New 'find_theorems' criterion "solves" matches theorems that
1167 directly solve the current goal (modulo higher-order unification).
1169 * Auto solve feature for main theorem statements: whenever a new goal
1170 is stated, "find_theorems solves" is called; any theorems that could
1171 solve the lemma directly are listed as part of the goal state.
1172 Cf. associated options in Proof General Isabelle settings menu,
1173 enabled by default, with reasonable timeout for pathological cases of
1174 higher-order unification.
1177 *** Document preparation ***
1179 * Antiquotation @{lemma} now imitates a regular terminal proof,
1180 demanding keyword 'by' and supporting the full method expression
1181 syntax just like the Isar command 'by'.
1186 * Integrated main parts of former image HOL-Complex with HOL. Entry
1187 points Main and Complex_Main remain as before.
1189 * Logic image HOL-Plain provides a minimal HOL with the most important
1190 tools available (inductive, datatype, primrec, ...). This facilitates
1191 experimentation and tool development. Note that user applications
1192 (and library theories) should never refer to anything below theory
1195 * Logic image HOL-Main stops at theory Main, and thus facilitates
1196 experimentation due to shorter build times.
1198 * Logic image HOL-NSA contains theories of nonstandard analysis which
1199 were previously part of former HOL-Complex. Entry point Hyperreal
1200 remains valid, but theories formerly using Complex_Main should now use
1201 new entry point Hypercomplex.
1203 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1204 Posix processes. Avoids potentially expensive forking of the ML
1205 process. New thread-based implementation also works on non-Unix
1206 platforms (Cygwin). Provers are no longer hardwired, but defined
1207 within the theory via plain ML wrapper functions. Basic Sledgehammer
1208 commands are covered in the isar-ref manual.
1210 * Wrapper scripts for remote SystemOnTPTP service allows to use
1211 sledgehammer without local ATP installation (Vampire etc.). Other
1212 provers may be included via suitable ML wrappers, see also
1213 src/HOL/ATP_Linkup.thy.
1215 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1218 * The metis method no longer fails because the theorem is too trivial
1219 (contains the empty clause).
1221 * The metis method now fails in the usual manner, rather than raising
1222 an exception, if it determines that it cannot prove the theorem.
1224 * Method "coherent" implements a prover for coherent logic (see also
1225 src/Tools/coherent.ML).
1227 * Constants "undefined" and "default" replace "arbitrary". Usually
1228 "undefined" is the right choice to replace "arbitrary", though
1229 logically there is no difference. INCOMPATIBILITY.
1231 * Command "value" now integrates different evaluation mechanisms. The
1232 result of the first successful evaluation mechanism is printed. In
1233 square brackets a particular named evaluation mechanisms may be
1234 specified (currently, [SML], [code] or [nbe]). See further
1235 src/HOL/ex/Eval_Examples.thy.
1237 * Normalization by evaluation now allows non-leftlinear equations.
1238 Declare with attribute [code nbe].
1240 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1241 as the structured Isar versions "cases" and "induct", cf. the
1242 corresponding "cases" and "induct" attributes. Mutual induction rules
1243 are now presented as a list of individual projections
1244 (e.g. foo_bar.inducts for types foo and bar); the old format with
1245 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1246 rare situations a different rule is selected --- notably nested tuple
1247 elimination instead of former prod.exhaust: use explicit (case_tac t
1248 rule: prod.exhaust) here.
1250 * Attributes "cases", "induct", "coinduct" support "del" option.
1252 * Removed fact "case_split_thm", which duplicates "case_split".
1254 * The option datatype has been moved to a new theory Option. Renamed
1255 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1257 * New predicate "strict_mono" classifies strict functions on partial
1258 orders. With strict functions on linear orders, reasoning about
1259 (in)equalities is facilitated by theorems "strict_mono_eq",
1260 "strict_mono_less_eq" and "strict_mono_less".
1262 * Some set operations are now proper qualified constants with
1263 authentic syntax. INCOMPATIBILITY:
1274 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1277 * Auxiliary class "itself" has disappeared -- classes without any
1278 parameter are treated as expected by the 'class' command.
1280 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1282 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1283 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1285 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1286 method "approximation". It proves formulas on real values by using
1287 interval arithmetic. In the formulas are also the transcendental
1288 functions sin, cos, tan, atan, ln, exp and the constant pi are
1289 allowed. For examples see
1290 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1292 * Theory "Reflection" now resides in HOL/Library.
1294 * Entry point to Word library now simply named "Word".
1297 * Made source layout more coherent with logical distribution
1300 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1301 src/HOL/Library/Code_Message.thy ~> src/HOL/
1302 src/HOL/Library/GCD.thy ~> src/HOL/
1303 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1304 src/HOL/Library/Parity.thy ~> src/HOL/
1305 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1306 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1307 src/HOL/Real/Lubs.thy ~> src/HOL/
1308 src/HOL/Real/PReal.thy ~> src/HOL/
1309 src/HOL/Real/Rational.thy ~> src/HOL/
1310 src/HOL/Real/RComplete.thy ~> src/HOL/
1311 src/HOL/Real/RealDef.thy ~> src/HOL/
1312 src/HOL/Real/RealPow.thy ~> src/HOL/
1313 src/HOL/Real/Real.thy ~> src/HOL/
1314 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1315 src/HOL/Complex/Complex.thy ~> src/HOL/
1316 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1317 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1318 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1319 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1320 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1321 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1322 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1323 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1324 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1325 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1326 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1327 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1328 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1329 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1330 src/HOL/Real/Float ~> src/HOL/Library/
1331 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1332 src/HOL/Real/RealVector.thy ~> src/HOL/
1334 src/HOL/arith_data.ML ~> src/HOL/Tools
1335 src/HOL/hologic.ML ~> src/HOL/Tools
1336 src/HOL/simpdata.ML ~> src/HOL/Tools
1337 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1338 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1339 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1340 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1341 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1342 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1343 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1345 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1346 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1347 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1348 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1349 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1350 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1352 * If methods "eval" and "evaluation" encounter a structured proof
1353 state with !!/==>, only the conclusion is evaluated to True (if
1354 possible), avoiding strange error messages.
1356 * Method "sizechange" automates termination proofs using (a
1357 modification of) the size-change principle. Requires SAT solver. See
1358 src/HOL/ex/Termination.thy for examples.
1360 * Simplifier: simproc for let expressions now unfolds if bound
1361 variable occurs at most once in let expression body. INCOMPATIBILITY.
1363 * Method "arith": Linear arithmetic now ignores all inequalities when
1364 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1366 * New attribute "arith" for facts that should always be used
1367 automatically by arithmetic. It is intended to be used locally in
1370 assumes [arith]: "x > 0"
1372 Global usage is discouraged because of possible performance impact.
1374 * New classes "top" and "bot" with corresponding operations "top" and
1375 "bot" in theory Orderings; instantiation of class "complete_lattice"
1376 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1378 * Changed definition lemma "less_fun_def" in order to provide an
1379 instance for preorders on functions; use lemma "less_le" instead.
1382 * Theory Orderings: class "wellorder" moved here, with explicit
1383 induction rule "less_induct" as assumption. For instantiation of
1384 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1387 * Theory Orderings: added class "preorder" as superclass of "order".
1388 INCOMPATIBILITY: Instantiation proofs for order, linorder
1389 etc. slightly changed. Some theorems named order_class.* now named
1392 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1395 * Theory Finite_Set: added a new fold combinator of type
1397 ('a => 'b => 'b) => 'b => 'a set => 'b
1399 Occasionally this is more convenient than the old fold combinator
1400 which is now defined in terms of the new one and renamed to
1403 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1404 and "ring_simps" have been replaced by "algebra_simps" (which can be
1405 extended with further lemmas!). At the moment both still exist but
1406 the former will disappear at some point.
1408 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1409 class recpower. Type-specific simp rules for various recpower types
1410 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1412 rat_power_0 -> power_0
1413 rat_power_Suc -> power_Suc
1414 realpow_0 -> power_0
1415 realpow_Suc -> power_Suc
1416 complexpow_0 -> power_0
1417 complexpow_Suc -> power_Suc
1418 power_poly_0 -> power_0
1419 power_poly_Suc -> power_Suc
1421 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1422 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1423 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1424 of lemmas from Divides has been generalized from nat to class
1425 semiring_div. INCOMPATIBILITY. This involves the following theorem
1426 renames resulting from duplicate elimination:
1428 dvd_def_mod ~> dvd_eq_mod_eq_0
1429 zero_dvd_iff ~> dvd_0_left_iff
1430 dvd_0 ~> dvd_0_right
1431 DIVISION_BY_ZERO_DIV ~> div_by_0
1432 DIVISION_BY_ZERO_MOD ~> mod_by_0
1433 mult_div ~> div_mult_self2_is_id
1434 mult_mod ~> mod_mult_self2_is_0
1436 * Theory IntDiv: removed many lemmas that are instances of class-based
1437 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1438 rename old lemmas as follows:
1440 dvd_diff -> nat_dvd_diff
1441 dvd_zminus_iff -> dvd_minus_iff
1442 mod_add1_eq -> mod_add_eq
1443 mod_mult1_eq -> mod_mult_right_eq
1444 mod_mult1_eq' -> mod_mult_left_eq
1445 mod_mult_distrib_mod -> mod_mult_eq
1446 nat_mod_add_left_eq -> mod_add_left_eq
1447 nat_mod_add_right_eq -> mod_add_right_eq
1448 nat_mod_div_trivial -> mod_div_trivial
1449 nat_mod_mod_trivial -> mod_mod_trivial
1450 zdiv_zadd_self1 -> div_add_self1
1451 zdiv_zadd_self2 -> div_add_self2
1452 zdiv_zmult_self1 -> div_mult_self2_is_id
1453 zdiv_zmult_self2 -> div_mult_self1_is_id
1454 zdvd_triv_left -> dvd_triv_left
1455 zdvd_triv_right -> dvd_triv_right
1456 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1457 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1458 zmod_zadd_left_eq -> mod_add_left_eq
1459 zmod_zadd_right_eq -> mod_add_right_eq
1460 zmod_zadd_self1 -> mod_add_self1
1461 zmod_zadd_self2 -> mod_add_self2
1462 zmod_zadd1_eq -> mod_add_eq
1463 zmod_zdiff1_eq -> mod_diff_eq
1464 zmod_zdvd_zmod -> mod_mod_cancel
1465 zmod_zmod_cancel -> mod_mod_cancel
1466 zmod_zmult_self1 -> mod_mult_self2_is_0
1467 zmod_zmult_self2 -> mod_mult_self1_is_0
1470 zdvd_abs1 -> abs_dvd_iff
1471 zdvd_abs2 -> dvd_abs_iff
1472 zdvd_refl -> dvd_refl
1473 zdvd_trans -> dvd_trans
1474 zdvd_zadd -> dvd_add
1475 zdvd_zdiff -> dvd_diff
1476 zdvd_zminus_iff -> dvd_minus_iff
1477 zdvd_zminus2_iff -> minus_dvd_iff
1478 zdvd_zmultD -> dvd_mult_right
1479 zdvd_zmultD2 -> dvd_mult_left
1480 zdvd_zmult_mono -> mult_dvd_mono
1481 zdvd_0_right -> dvd_0_right
1482 zdvd_0_left -> dvd_0_left_iff
1483 zdvd_1_left -> one_dvd
1484 zminus_dvd_iff -> minus_dvd_iff
1486 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1488 * The real numbers offer decimal input syntax: 12.34 is translated
1489 into 1234/10^2. This translation is not reversed upon output.
1491 * Theory Library/Polynomial defines an abstract type 'a poly of
1492 univariate polynomials with coefficients of type 'a. In addition to
1493 the standard ring operations, it also supports div and mod. Code
1494 generation is also supported, using list-style constructors.
1496 * Theory Library/Inner_Product defines a class of real_inner for real
1497 inner product spaces, with an overloaded operation inner :: 'a => 'a
1498 => real. Class real_inner is a subclass of real_normed_vector from
1501 * Theory Library/Product_Vector provides instances for the product
1502 type 'a * 'b of several classes from RealVector and Inner_Product.
1503 Definitions of addition, subtraction, scalar multiplication, norms,
1504 and inner products are included.
1506 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1507 addition to the field operations, numerals and case syntax are also
1510 * Theory Library/Diagonalize provides constructive version of Cantor's
1511 first diagonalization argument.
1513 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1514 zlcm (for int); carried together from various gcd/lcm developements in
1515 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1516 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1517 may recover tupled syntax as follows:
1519 hide (open) const gcd
1520 abbreviation gcd where
1521 "gcd == (%(a, b). GCD.gcd a b)"
1523 GCD.gcd ("gcd '(_, _')")
1525 The same works for lcm, zgcd, zlcm.
1527 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1528 instantiations for algebraic structures. Removed some duplicate
1529 theorems. Changes in simp rules. INCOMPATIBILITY.
1531 * ML antiquotation @{code} takes a constant as argument and generates
1532 corresponding code in background and inserts name of the corresponding
1533 resulting ML value/function/datatype constructor binding in place.
1534 All occurrences of @{code} with a single ML block are generated
1535 simultaneously. Provides a generic and safe interface for
1536 instrumentalizing code generation. See
1537 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1538 In future you ought to refrain from ad-hoc compiling generated SML
1539 code on the ML toplevel. Note that (for technical reasons) @{code}
1540 cannot refer to constants for which user-defined serializations are
1541 set. Refer to the corresponding ML counterpart directly in that
1544 * Command 'rep_datatype': instead of theorem names the command now
1545 takes a list of terms denoting the constructors of the type to be
1546 represented as datatype. The characteristic theorems have to be
1547 proven. INCOMPATIBILITY. Also observe that the following theorems
1548 have disappeared in favour of existing ones:
1550 unit_induct ~> unit.induct
1551 prod_induct ~> prod.induct
1552 sum_induct ~> sum.induct
1553 Suc_Suc_eq ~> nat.inject
1554 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1559 * New locales for orders and lattices where the equivalence relation
1560 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1561 locales use a record structure with field eq for the equivalence.
1563 * New theory of factorial domains.
1565 * Units_l_inv and Units_r_inv are now simp rules by default.
1566 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1567 and/or r_inv will now also require deletion of these lemmas.
1569 * Renamed the following theorems, INCOMPATIBILITY:
1571 UpperD ~> Upper_memD
1572 LowerD ~> Lower_memD
1573 least_carrier ~> least_closed
1574 greatest_carrier ~> greatest_closed
1575 greatest_Lower_above ~> greatest_Lower_below
1576 one_zero ~> carrier_one_zero
1577 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1582 * Nominal datatypes can now contain type-variables.
1584 * Commands 'nominal_inductive' and 'equivariance' work with local
1587 * Nominal primrec can now works with local theory targets and its
1588 specification syntax now conforms to the general format as seen in
1591 * Method "perm_simp" honours the standard simplifier attributes
1592 (no_asm), (no_asm_use) etc.
1594 * The new predicate #* is defined like freshness, except that on the
1595 left hand side can be a set or list of atoms.
1597 * Experimental command 'nominal_inductive2' derives strong induction
1598 principles for inductive definitions. In contrast to
1599 'nominal_inductive', which can only deal with a fixed number of
1600 binders, it can deal with arbitrary expressions standing for sets of
1601 atoms to be avoided. The only inductive definition we have at the
1602 moment that needs this generalisation is the typing rule for Lets in
1605 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1606 -----------------------------------------------------------------
1607 Gamma |- Let x be t1 in t2 : T2
1609 In this rule one wants to avoid all the binders that are introduced by
1610 "close Gamma T1". We are looking for other examples where this
1611 feature might be useful. Please let us know.
1616 * Reimplemented the simplification procedure for proving continuity
1617 subgoals. The new simproc is extensible; users can declare additional
1618 continuity introduction rules with the attribute [cont2cont].
1620 * The continuity simproc now uses a different introduction rule for
1621 solving continuity subgoals on terms with lambda abstractions. In
1622 some rare cases the new simproc may fail to solve subgoals that the
1623 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1624 Potential INCOMPATIBILITY.
1626 * Command 'fixrec': specification syntax now conforms to the general
1627 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1628 examples. INCOMPATIBILITY.
1633 * Proof of Zorn's Lemma for partial orders.
1638 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1639 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1640 depends on multithreading, so timouts will not work before Poly/ML
1643 * High-level support for concurrent ML programming, see
1644 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1645 particularly convenient to organize independent functional
1646 computations. The concept of "synchronized variables" provides a
1647 higher-order interface for components with shared state, avoiding the
1648 delicate details of mutexes and condition variables. (Requires
1649 Poly/ML 5.2.1 or later.)
1651 * ML bindings produced via Isar commands are stored within the Isar
1652 context (theory or proof). Consequently, commands like 'use' and 'ML'
1653 become thread-safe and work with undo as expected (concerning
1654 top-level bindings, not side-effects on global references).
1655 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1656 compiler at runtime; really global bindings need to be given outside a
1657 theory. (Requires Poly/ML 5.2 or later.)
1659 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1660 context. Top-level ML bindings are stored within the proof context in
1661 a purely sequential fashion, disregarding the nested proof structure.
1662 ML bindings introduced by 'ML_prf' are discarded at the end of the
1663 proof. (Requires Poly/ML 5.2 or later.)
1665 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1666 and Method.setup, as well as Isar commands 'attribute_setup' and
1667 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1668 existing code accordingly, or use plain 'setup' together with old
1671 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1672 to 'a -> thm, while results are always tagged with an authentic oracle
1673 name. The Isar command 'oracle' is now polymorphic, no argument type
1674 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1675 accordingly. Note that extra performance may be gained by producing
1676 the cterm carefully, avoiding slow Thm.cterm_of.
1678 * Simplified interface for defining document antiquotations via
1679 ThyOutput.antiquotation, ThyOutput.output, and optionally
1680 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1681 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1684 * More systematic treatment of long names, abstract name bindings, and
1685 name space operations. Basic operations on qualified names have been
1686 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1687 Long_Name.append. Old type bstring has been mostly replaced by
1688 abstract type binding (see structure Binding), which supports precise
1689 qualification by packages and local theory targets, as well as proper
1690 tracking of source positions. INCOMPATIBILITY, need to wrap old
1691 bstring values into Binding.name, or better pass through abstract
1692 bindings everywhere. See further src/Pure/General/long_name.ML,
1693 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1695 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1696 LocalTheory.note etc.) now refer to the *full* internal name, not the
1697 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1699 * Disposed old type and term read functions (Sign.read_def_typ,
1700 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1701 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1702 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1703 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1704 resort for legacy applications.
1706 * Disposed old declarations, tactics, tactic combinators that refer to
1707 the simpset or claset of an implicit theory (such as Addsimps,
1708 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1709 embedded ML text, or local_simpset_of with a proper context passed as
1710 explicit runtime argument.
1712 * Rules and tactics that read instantiations (read_instantiate,
1713 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1714 context, which is required for parsing and type-checking. Moreover,
1715 the variables are specified as plain indexnames, not string encodings
1716 thereof. INCOMPATIBILITY.
1718 * Generic Toplevel.add_hook interface allows to analyze the result of
1719 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1720 for theorem dependency output of transactions resulting in a new
1723 * ML antiquotations: block-structured compilation context indicated by
1724 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1726 @{binding name} - basic name binding
1727 @{let ?pat = term} - term abbreviation (HO matching)
1728 @{note name = fact} - fact abbreviation
1729 @{thm fact} - singleton fact (with attributes)
1730 @{thms fact} - general fact (with attributes)
1731 @{lemma prop by method} - singleton goal
1732 @{lemma prop by meth1 meth2} - singleton goal
1733 @{lemma prop1 ... propN by method} - general goal
1734 @{lemma prop1 ... propN by meth1 meth2} - general goal
1735 @{lemma (open) ...} - open derivation
1740 * The Isabelle "emacs" tool provides a specific interface to invoke
1741 Proof General / Emacs, with more explicit failure if that is not
1742 installed (the old isabelle-interface script silently falls back on
1743 isabelle-process). The PROOFGENERAL_HOME setting determines the
1744 installation location of the Proof General distribution.
1746 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1747 the Isabelle process into a JVM/Scala application. See
1748 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1749 process wrapper has been discontinued.)
1751 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1753 * Various status messages (with exact source position information) are
1754 emitted, if proper markup print mode is enabled. This allows
1755 user-interface components to provide detailed feedback on internal
1760 New in Isabelle2008 (June 2008)
1761 -------------------------------
1765 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1766 and updated, with formally checked references as hyperlinks.
1768 * Theory loader: use_thy (and similar operations) no longer set the
1769 implicit ML context, which was occasionally hard to predict and in
1770 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1771 provides a proper context already.
1773 * Theory loader: old-style ML proof scripts being *attached* to a thy
1774 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1775 'use' within a theory file will do the job.
1777 * Name space merge now observes canonical order, i.e. the second space
1778 is inserted into the first one, while existing entries in the first
1779 space take precedence. INCOMPATIBILITY in rare situations, may try to
1780 swap theory imports.
1782 * Syntax: symbol \<chi> is now considered a letter. Potential
1783 INCOMPATIBILITY in identifier syntax etc.
1785 * Outer syntax: string tokens no longer admit escaped white space,
1786 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1787 white space without escapes.
1789 * Outer syntax: string tokens may contain arbitrary character codes
1790 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1796 * Context-dependent token translations. Default setup reverts locally
1797 fixed variables, and adds hilite markup for undeclared frees.
1799 * Unused theorems can be found using the new command 'unused_thms'.
1800 There are three ways of invoking it:
1803 Only finds unused theorems in the current theory.
1805 (2) unused_thms thy_1 ... thy_n -
1806 Finds unused theorems in the current theory and all of its ancestors,
1807 excluding the theories thy_1 ... thy_n and all of their ancestors.
1809 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1810 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1811 their ancestors, excluding the theories thy_1 ... thy_n and all of
1814 In order to increase the readability of the list produced by
1815 unused_thms, theorems that have been created by a particular instance
1816 of a theory command such as 'inductive' or 'function' are considered
1817 to belong to the same "group", meaning that if at least one theorem in
1818 this group is used, the other theorems in the same group are no longer
1819 reported as unused. Moreover, if all theorems in the group are
1820 unused, only one theorem in the group is displayed.
1822 Note that proof objects have to be switched on in order for
1823 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1824 usually the case when using Proof General with the default settings).
1826 * Authentic naming of facts disallows ad-hoc overwriting of previous
1827 theorems within the same name space. INCOMPATIBILITY, need to remove
1828 duplicate fact bindings, or even accidental fact duplications. Note
1829 that tools may maintain dynamically scoped facts systematically, using
1830 PureThy.add_thms_dynamic.
1832 * Command 'hide' now allows to hide from "fact" name space as well.
1834 * Eliminated destructive theorem database, simpset, claset, and
1835 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1836 update of theories within ML code.
1838 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1839 INCOMPATIBILITY, object-logics depending on former Pure require
1840 additional setup PureThy.old_appl_syntax_setup; object-logics
1841 depending on former CPure need to refer to Pure.
1843 * Commands 'use' and 'ML' are now purely functional, operating on
1844 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1845 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1848 * Command 'setup': discontinued implicit version with ML reference.
1850 * Instantiation target allows for simultaneous specification of class
1851 instance operations together with an instantiation proof.
1852 Type-checking phase allows to refer to class operations uniformly.
1853 See src/HOL/Complex/Complex.thy for an Isar example and
1854 src/HOL/Library/Eval.thy for an ML example.
1856 * Indexing of literal facts: be more serious about including only
1857 facts from the visible specification/proof context, but not the
1858 background context (locale etc.). Affects `prop` notation and method
1859 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1862 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1863 "(open)" option, which used to expose internal bound variables to the
1866 * Isar statements: removed obsolete case "rule_context".
1867 INCOMPATIBILITY, better use explicit fixes/assumes.
1869 * Locale proofs: default proof step now includes 'unfold_locales';
1870 hence 'proof' without argument may be used to unfold locale
1874 *** Document preparation ***
1876 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1877 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1878 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1879 spot); renamed link color from "darkblue" to "linkcolor" (default
1880 value unchanged, can be redefined via \definecolor); no longer sets
1881 "a4paper" option (unnecessary or even intrusive).
1883 * Antiquotation @{lemma A method} proves proposition A by the given
1884 method (either a method name or a method name plus (optional) method
1885 arguments in parentheses) and prints A just like @{prop A}.
1890 * New primrec package. Specification syntax conforms in style to
1891 definition/function/.... No separate induction rule is provided. The
1892 "primrec" command distinguishes old-style and new-style specifications
1893 by syntax. The former primrec package is now named OldPrimrecPackage.
1894 When adjusting theories, beware: constants stemming from new-style
1895 primrec specifications have authentic syntax.
1897 * Metis prover is now an order of magnitude faster, and also works
1898 with multithreading.
1900 * Metis: the maximum number of clauses that can be produced from a
1901 theorem is now given by the attribute max_clauses. Theorems that
1902 exceed this number are ignored, with a warning printed.
1904 * Sledgehammer no longer produces structured proofs by default. To
1905 enable, declare [[sledgehammer_full = true]]. Attributes
1906 reconstruction_modulus, reconstruction_sorts renamed
1907 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1909 * Method "induct_scheme" derives user-specified induction rules
1910 from well-founded induction and completeness of patterns. This factors
1911 out some operations that are done internally by the function package
1912 and makes them available separately. See
1913 src/HOL/ex/Induction_Scheme.thy for examples.
1915 * More flexible generation of measure functions for termination
1916 proofs: Measure functions can be declared by proving a rule of the
1917 form "is_measure f" and giving it the [measure_function] attribute.
1918 The "is_measure" predicate is logically meaningless (always true), and
1919 just guides the heuristic. To find suitable measure functions, the
1920 termination prover sets up the goal "is_measure ?f" of the appropriate
1921 type and generates all solutions by prolog-style backwards proof using
1924 This setup also deals with rules like
1926 "is_measure f ==> is_measure (list_size f)"
1928 which accommodates nested datatypes that recurse through lists.
1929 Similar rules are predeclared for products and option types.
1931 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1935 - Definitions of overloaded constants on sets have to be replaced by
1936 definitions on => and bool.
1938 - Some definitions of overloaded operators on sets can now be proved
1939 using the definitions of the operators on => and bool. Therefore,
1940 the following theorems have been renamed:
1942 subset_def -> subset_eq
1943 psubset_def -> psubset_eq
1944 set_diff_def -> set_diff_eq
1945 Compl_def -> Compl_eq
1946 Sup_set_def -> Sup_set_eq
1947 Inf_set_def -> Inf_set_eq
1948 sup_set_def -> sup_set_eq
1949 inf_set_def -> inf_set_eq
1951 - Due to the incompleteness of the HO unification algorithm, some
1952 rules such as subst may require manual instantiation, if some of
1953 the unknowns in the rule is a set.
1955 - Higher order unification and forward proofs:
1958 have "P (S::'a set)" <...>
1959 then have "EX S. P S" ..
1961 no longer works (due to the incompleteness of the HO unification
1962 algorithm) and must be replaced by the pattern
1969 - Calculational reasoning with subst (or similar rules):
1972 have "P (S::'a set)" <...>
1973 also have "S = T" <...>
1974 finally have "P T" .
1976 no longer works (for similar reasons as the previous example) and
1977 must be replaced by something like
1979 have "P (S::'a set)" <...>
1980 moreover have "S = T" <...>
1981 ultimately have "P T" by simp
1983 - Tactics or packages written in ML code:
1984 Code performing pattern matching on types via
1986 Type ("set", [T]) => ...
1988 must be rewritten. Moreover, functions like strip_type or
1989 binder_types no longer return the right value when applied to a
1992 T1 => ... => Tn => U => bool
1996 T1 => ... => Tn => U set
1998 * Merged theories Wellfounded_Recursion, Accessible_Part and
1999 Wellfounded_Relations to theory Wellfounded.
2001 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2003 * Class finite no longer treats UNIV as class parameter. Use class
2004 enum from theory Library/Enum instead to achieve a similar effect.
2007 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2008 and "Cons". INCOMPATIBILITY.
2010 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2011 Potential INCOMPATIBILITY.
2013 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2014 injective_fst_snd removed, use split_eta and prod_eqI instead.
2015 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2017 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2018 the same name in theory Orderings:
2028 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2029 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2030 and different variable names.
2032 * Library/Option_ord.thy: Canonical order on option type.
2034 * Library/RBT.thy: Red-black trees, an efficient implementation of
2037 * Library/Countable.thy: Type class for countable types.
2039 * Theory Int: The representation of numerals has changed. The infix
2040 operator BIT and the bit datatype with constructors B0 and B1 have
2041 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2042 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2043 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2046 * Theory Nat: definition of <= and < on natural numbers no longer
2047 depend on well-founded relations. INCOMPATIBILITY. Definitions
2048 le_def and less_def have disappeared. Consider lemmas not_less
2049 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2051 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2052 (whose purpose mainly is for various fold_set functionals) have been
2053 abandoned in favor of the existing algebraic classes
2054 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2055 lower_semilattice (resp. upper_semilattice) and linorder.
2058 * Theory Transitive_Closure: induct and cases rules now declare proper
2059 case_names ("base" and "step"). INCOMPATIBILITY.
2061 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2062 lattices. The form set-specific version is available as
2063 Inductive.lfp_ordinal_induct_set.
2065 * Renamed theorems "power.simps" to "power_int.simps".
2068 * Class semiring_div provides basic abstract properties of semirings
2069 with division and modulo operations. Subsumes former class dvd_mod.
2071 * Merged theories IntDef, Numeral and IntArith into unified theory
2072 Int. INCOMPATIBILITY.
2074 * Theory Library/Code_Index: type "index" now represents natural
2075 numbers rather than integers. INCOMPATIBILITY.
2077 * New class "uminus" with operation "uminus" (split of from class
2078 "minus" which now only has operation "minus", binary).
2081 * Constants "card", "internal_split", "option_map" now with authentic
2082 syntax. INCOMPATIBILITY.
2084 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2085 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2086 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2087 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2088 Sup_set_def, le_def, less_def, option_map_def now with object
2089 equality. INCOMPATIBILITY.
2091 * Records. Removed K_record, and replaced it by pure lambda term
2092 %x. c. The simplifier setup is now more robust against eta expansion.
2093 INCOMPATIBILITY: in cases explicitly referring to K_record.
2095 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2097 * Library/ListVector: new theory of arithmetic vector operations.
2099 * Library/Order_Relation: new theory of various orderings as sets of
2100 pairs. Defines preorders, partial orders, linear orders and
2101 well-orders on sets and on types.
2106 * Renamed some theories to allow to loading both ZF and HOL in the
2109 Datatype -> Datatype_ZF
2110 Inductive -> Inductive_ZF
2117 INCOMPATIBILITY: ZF theories that import individual theories below
2118 Main might need to be adapted. Regular theory Main is still
2119 available, as trivial extension of Main_ZF.
2124 * ML within Isar: antiquotation @{const name} or @{const
2125 name(typargs)} produces statically-checked Const term.
2127 * Functor NamedThmsFun: data is available to the user as dynamic fact
2128 (of the same name). Removed obsolete print command.
2130 * Removed obsolete "use_legacy_bindings" function.
2132 * The ``print mode'' is now a thread-local value derived from a global
2133 template (the former print_mode reference), thus access becomes
2134 non-critical. The global print_mode reference is for session
2135 management only; user-code should use print_mode_value,
2136 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2138 * Functions system/system_out provide a robust way to invoke external
2139 shell commands, with propagation of interrupts (requires Poly/ML
2140 5.2.1). Do not use OS.Process.system etc. from the basis library!
2145 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2146 in accordance with Proof General 3.7, which prefers GNU emacs.
2148 * isatool tty runs Isabelle process with plain tty interaction;
2149 optional line editor may be specified via ISABELLE_LINE_EDITOR
2150 setting, the default settings attempt to locate "ledit" and "rlwrap".
2152 * isatool browser now works with Cygwin as well, using general
2153 "javapath" function defined in Isabelle process environment.
2155 * YXML notation provides a simple and efficient alternative to
2156 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2157 isatool yxml as described in the Isabelle system manual.
2159 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2160 provides general wrapper for managing an Isabelle process in a robust
2161 fashion, with ``cooked'' output from stdin/stderr.
2163 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2164 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2166 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2167 way of changing the user's settings is via
2168 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2171 * Multithreading.max_threads := 0 refers to the number of actual CPU
2172 cores of the underlying machine, which is a good starting point for
2173 optimal performance tuning. The corresponding usedir option -M allows
2174 "max" as an alias for "0". WARNING: does not work on certain versions
2175 of Mac OS (with Poly/ML 5.1).
2177 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2178 adverse effect of Isabelle flooding interactive front-ends (notably
2179 ProofGeneral / XEmacs).
2183 New in Isabelle2007 (November 2007)
2184 -----------------------------------
2188 * More uniform information about legacy features, notably a
2189 warning/error of "Legacy feature: ...", depending on the state of the
2190 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2191 legacy features will disappear eventually.
2193 * Theory syntax: the header format ``theory A = B + C:'' has been
2194 discontinued in favour of ``theory A imports B C begin''. Use isatool
2195 fixheaders to convert existing theory files. INCOMPATIBILITY.
2197 * Theory syntax: the old non-Isar theory file format has been
2198 discontinued altogether. Note that ML proof scripts may still be used
2199 with Isar theories; migration is usually quite simple with the ML
2200 function use_legacy_bindings. INCOMPATIBILITY.
2202 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2203 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2206 * Theory loader: be more serious about observing the static theory
2207 header specifications (including optional directories), but not the
2208 accidental file locations of previously successful loads. The strict
2209 update policy of former update_thy is now already performed by
2210 use_thy, so the former has been removed; use_thys updates several
2211 theories simultaneously, just as 'imports' within a theory header
2212 specification, but without merging the results. Potential
2213 INCOMPATIBILITY: may need to refine theory headers and commands
2214 ROOT.ML which depend on load order.
2216 * Theory loader: optional support for content-based file
2217 identification, instead of the traditional scheme of full physical
2218 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2219 (cf. the system manual). The new scheme allows to work with
2220 non-finished theories in persistent session images, such that source
2221 files may be moved later on without requiring reloads.
2223 * Theory loader: old-style ML proof scripts being *attached* to a thy
2224 file (with the same base name as the theory) are considered a legacy
2225 feature, which will disappear eventually. Even now, the theory loader
2226 no longer maintains dependencies on such files.
2228 * Syntax: the scope for resolving ambiguities via type-inference is
2229 now limited to individual terms, instead of whole simultaneous
2230 specifications as before. This greatly reduces the complexity of the
2231 syntax module and improves flexibility by separating parsing and
2232 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2233 'fixes' etc.) are required in rare situations.
2235 * Syntax: constants introduced by new-style packages ('definition',
2236 'abbreviation' etc.) are passed through the syntax module in
2237 ``authentic mode''. This means that associated mixfix annotations
2238 really stick to such constants, independently of potential name space
2239 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2240 trees are represented slightly differently, may need to adapt syntax
2241 translations accordingly. Use CONST marker in 'translations' and
2242 @{const_syntax} antiquotation in 'parse_translation' etc.
2244 * Legacy goal package: reduced interface to the bare minimum required
2245 to keep existing proof scripts running. Most other user-level
2246 functions are now part of the OldGoals structure, which is *not* open
2247 by default (consider isatool expandshort before open OldGoals).
2248 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2249 these tend to cause confusion about the actual goal (!) context being
2250 used here, which is not necessarily the same as the_context().
2252 * Command 'find_theorems': supports "*" wild-card in "name:"
2253 criterion; "with_dups" option. Certain ProofGeneral versions might
2254 support a specific search form (see ProofGeneral/CHANGES).
2256 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2257 by default, which means that "prems" (and also "fixed variables") are
2258 suppressed from proof state output. Note that the ProofGeneral
2259 settings mechanism allows to change and save options persistently, but
2260 older versions of Isabelle will fail to start up if a negative prems
2263 * Local theory targets may be specified by non-nested blocks of
2264 ``context/locale/class ... begin'' followed by ``end''. The body may
2265 contain definitions, theorems etc., including any derived mechanism
2266 that has been implemented on top of these primitives. This concept
2267 generalizes the existing ``theorem (in ...)'' towards more versatility
2270 * Proof General interface: proper undo of final 'end' command;
2271 discontinued Isabelle/classic mode (ML proof scripts).
2274 *** Document preparation ***
2276 * Added antiquotation @{theory name} which prints the given name,
2277 after checking that it refers to a valid ancestor theory in the
2280 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2281 check the given source text as ML type/structure, printing verbatim.
2283 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2284 "c args == rhs" given in the current context. (Any number of
2285 arguments may be given on the LHS.)
2290 * The 'class' package offers a combination of axclass and locale to
2291 achieve Haskell-like type classes in Isabelle. Definitions and
2292 theorems within a class context produce both relative results (with
2293 implicit parameters according to the locale context), and polymorphic
2294 constants with qualified polymorphism (according to the class
2295 context). Within the body context of a 'class' target, a separate
2296 syntax layer ("user space type system") takes care of converting
2297 between global polymorphic consts and internal locale representation.
2298 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2299 "isatool doc classes" provides a tutorial.
2301 * Generic code generator framework allows to generate executable
2302 code for ML and Haskell (including Isabelle classes). A short usage
2305 internal compilation:
2306 export_code <list of constants (term syntax)> in SML
2307 writing SML code to a file:
2308 export_code <list of constants (term syntax)> in SML <filename>
2309 writing OCaml code to a file:
2310 export_code <list of constants (term syntax)> in OCaml <filename>
2311 writing Haskell code to a bunch of files:
2312 export_code <list of constants (term syntax)> in Haskell <filename>
2314 evaluating closed propositions to True/False using code generation:
2317 Reasonable default setup of framework in HOL.
2319 Theorem attributs for selecting and transforming function equations theorems:
2321 [code fun]: select a theorem as function equation for a specific constant
2322 [code fun del]: deselect a theorem as function equation for a specific constant
2323 [code inline]: select an equation theorem for unfolding (inlining) in place
2324 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2326 User-defined serializations (target in {SML, OCaml, Haskell}):
2328 code_const <and-list of constants (term syntax)>
2329 {(target) <and-list of const target syntax>}+
2331 code_type <and-list of type constructors>
2332 {(target) <and-list of type target syntax>}+
2334 code_instance <and-list of instances>
2336 where instance ::= <type constructor> :: <class>
2338 code_class <and_list of classes>
2339 {(target) <and-list of class target syntax>}+
2340 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2342 code_instance and code_class only are effective to target Haskell.
2344 For example usage see src/HOL/ex/Codegenerator.thy and
2345 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2346 generation from Isabelle/HOL theories is available via "isatool doc
2349 * Code generator: consts in 'consts_code' Isar commands are now
2350 referred to by usual term syntax (including optional type
2353 * Command 'no_translations' removes translation rules from theory
2356 * Overloaded definitions are now actually checked for acyclic
2357 dependencies. The overloading scheme is slightly more general than
2358 that of Haskell98, although Isabelle does not demand an exact
2359 correspondence to type class and instance declarations.
2360 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2361 exotic versions of overloading -- at the discretion of the user!
2363 Polymorphic constants are represented via type arguments, i.e. the
2364 instantiation that matches an instance against the most general
2365 declaration given in the signature. For example, with the declaration
2366 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2367 as c(nat). Overloading is essentially simultaneous structural
2368 recursion over such type arguments. Incomplete specification patterns
2369 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2370 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2371 Command 'print_theory' outputs the normalized system of recursive
2372 equations, see section "definitions".
2374 * Configuration options are maintained within the theory or proof
2375 context (with name and type bool/int/string), providing a very simple
2376 interface to a poor-man's version of general context data. Tools may
2377 declare options in ML (e.g. using Attrib.config_int) and then refer to
2378 these values using Config.get etc. Users may change options via an
2379 associated attribute of the same name. This form of context
2380 declaration works particularly well with commands 'declare' or
2381 'using', for example ``declare [[foo = 42]]''. Thus it has become
2382 very easy to avoid global references, which would not observe Isar
2383 toplevel undo/redo and fail to work with multithreading.
2385 Various global ML references of Pure and HOL have been turned into
2386 configuration options:
2388 Unify.search_bound unify_search_bound
2389 Unify.trace_bound unify_trace_bound
2390 Unify.trace_simp unify_trace_simp
2391 Unify.trace_types unify_trace_types
2392 Simplifier.simp_depth_limit simp_depth_limit
2393 Blast.depth_limit blast_depth_limit
2394 DatatypeProp.dtK datatype_distinctness_limit
2395 fast_arith_neq_limit fast_arith_neq_limit
2396 fast_arith_split_limit fast_arith_split_limit
2398 * Named collections of theorems may be easily installed as context
2399 data using the functor NamedThmsFun (see also
2400 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2401 attributes; there is also a toplevel print command. This facility is
2402 just a common case of general context data, which is the preferred way
2403 for anything more complex than just a list of facts in canonical
2406 * Isar: command 'declaration' augments a local theory by generic
2407 declaration functions written in ML. This enables arbitrary content
2408 being added to the context, depending on a morphism that tells the
2409 difference of the original declaration context wrt. the application
2410 context encountered later on.
2412 * Isar: proper interfaces for simplification procedures. Command
2413 'simproc_setup' declares named simprocs (with match patterns, and body
2414 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2415 context. ML antiquotation @{simproc name} retrieves named simprocs.
2417 * Isar: an extra pair of brackets around attribute declarations
2418 abbreviates a theorem reference involving an internal dummy fact,
2419 which will be ignored later --- only the effect of the attribute on
2420 the background context will persist. This form of in-place
2421 declarations is particularly useful with commands like 'declare' and
2422 'using', for example ``have A using [[simproc a]] by simp''.
2424 * Isar: method "assumption" (and implicit closing of subproofs) now
2425 takes simple non-atomic goal assumptions into account: after applying
2426 an assumption as a rule the resulting subgoals are solved by atomic
2427 assumption steps. This is particularly useful to finish 'obtain'
2428 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2429 without referring to the original premise "!!x. P x ==> thesis" in the
2430 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2433 * Isar: implicit use of prems from the Isar proof context is
2434 considered a legacy feature. Common applications like ``have A .''
2435 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2436 referencing facts explicitly here improves readability and
2437 maintainability of proof texts.
2439 * Isar: improper proof element 'guess' is like 'obtain', but derives
2440 the obtained context from the course of reasoning! For example:
2442 assume "EX x y. A x & B y" -- "any previous fact"
2443 then guess x and y by clarify
2445 This technique is potentially adventurous, depending on the facts and
2446 proof tools being involved here.
2448 * Isar: known facts from the proof context may be specified as literal
2449 propositions, using ASCII back-quote syntax. This works wherever
2450 named facts used to be allowed so far, in proof commands, proof
2451 methods, attributes etc. Literal facts are retrieved from the context
2452 according to unification of type and term parameters. For example,
2453 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2454 theorems in the current context, then these are valid literal facts:
2455 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2457 There is also a proof method "fact" which does the same composition
2458 for explicit goal states, e.g. the following proof texts coincide with
2459 certain special cases of literal facts:
2461 have "A" by fact == note `A`
2462 have "A ==> B" by fact == note `A ==> B`
2463 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2464 have "P a ==> Q a" by fact == note `P a ==> Q a`
2466 * Isar: ":" (colon) is no longer a symbolic identifier character in
2467 outer syntax. Thus symbolic identifiers may be used without
2468 additional white space in declarations like this: ``assume *: A''.
2470 * Isar: 'print_facts' prints all local facts of the current context,
2471 both named and unnamed ones.
2473 * Isar: 'def' now admits simultaneous definitions, e.g.:
2475 def x == "t" and y == "u"
2477 * Isar: added command 'unfolding', which is structurally similar to
2478 'using', but affects both the goal state and facts by unfolding given
2479 rewrite rules. Thus many occurrences of the 'unfold' method or
2480 'unfolded' attribute may be replaced by first-class proof text.
2482 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2483 and command 'unfolding' now all support object-level equalities
2484 (potentially conditional). The underlying notion of rewrite rule is
2485 analogous to the 'rule_format' attribute, but *not* that of the
2486 Simplifier (which is usually more generous).
2488 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2489 premises of a theorem by n. Useful in conjunction with drule.
2491 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2492 method expression within a sandbox consisting of the first N
2493 sub-goals, which need to exist. For example, ``simp_all [3]''
2494 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2495 simplifies all new goals that emerge from applying rule foo to the
2496 originally first one.
2498 * Isar: schematic goals are no longer restricted to higher-order
2499 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2502 * Isar: the conclusion of a long theorem statement is now either
2503 'shows' (a simultaneous conjunction, as before), or 'obtains'
2504 (essentially a disjunction of cases with local parameters and
2505 assumptions). The latter allows to express general elimination rules
2506 adequately; in this notation common elimination rules look like this:
2508 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2510 obtains x where "P x"
2512 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2516 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2522 The subsequent classical rules even refer to the formal "thesis"
2525 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2528 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2529 obtains "thesis ==> something"
2531 The actual proof of an 'obtains' statement is analogous to that of the
2532 Isar proof element 'obtain', only that there may be several cases.
2533 Optional case names may be specified in parentheses; these will be
2534 available both in the present proof and as annotations in the
2535 resulting rule, for later use with the 'cases' method (cf. attribute
2538 * Isar: the assumptions of a long theorem statement are available as
2539 "assms" fact in the proof context. This is more appropriate than the
2540 (historical) "prems", which refers to all assumptions of the current
2541 context, including those from the target locale, proof body etc.
2543 * Isar: 'print_statement' prints theorems from the current theory or
2544 proof context in long statement form, according to the syntax of a
2547 * Isar: 'obtain' takes an optional case name for the local context
2548 introduction rule (default "that").
2550 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2551 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2554 * Pure: syntax "CONST name" produces a fully internalized constant
2555 according to the current context. This is particularly useful for
2556 syntax translations that should refer to internal constant
2557 representations independently of name spaces.
2559 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2560 instead of "FOO ". This allows multiple binder declarations to coexist
2561 in the same context. INCOMPATIBILITY.
2563 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2564 primitive that also works in a locale context (both for constants and
2565 fixed variables). Type declaration and internal syntactic representation
2566 of given constants retrieved from the context. Likewise, the
2567 'no_notation' command allows to remove given syntax annotations from the
2570 * Isar/locales: new derived specification elements 'axiomatization',
2571 'definition', 'abbreviation', which support type-inference, admit
2572 object-level specifications (equality, equivalence). See also the
2573 isar-ref manual. Examples:
2576 eq (infix "===" 50) where
2577 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2579 definition "f x y = x + y + 1"
2580 definition g where "g x = f x x"
2583 neq (infix "=!=" 50) where
2584 "x =!= y == ~ (x === y)"
2586 These specifications may be also used in a locale context. Then the
2587 constants being introduced depend on certain fixed parameters, and the
2588 constant name is qualified by the locale base name. An internal
2589 abbreviation takes care for convenient input and output, making the
2590 parameters implicit and using the original short name. See also
2591 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2592 entities from a monomorphic theory.
2594 Presently, abbreviations are only available 'in' a target locale, but
2595 not inherited by general import expressions. Also note that
2596 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2597 'translations' in common applications. The "no_abbrevs" print mode
2598 prevents folding of abbreviations in term output.
2600 Concrete syntax is attached to specified constants in internal form,
2601 independently of name spaces. The parse tree representation is
2602 slightly different -- use 'notation' instead of raw 'syntax', and
2603 'translations' with explicit "CONST" markup to accommodate this.
2605 * Pure/Isar: unified syntax for new-style specification mechanisms
2606 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2607 full type inference and dummy patterns ("_"). For example:
2609 definition "K x _ = x"
2611 inductive conj for A B
2612 where "A ==> B ==> conj A B"
2614 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2615 the current context. Print mode "no_abbrevs" prevents inversion of
2616 abbreviations on output.
2618 * Isar/locales: improved parameter handling: use of locales "var" and
2619 "struct" no longer necessary; - parameter renamings are no longer
2620 required to be injective. For example, this allows to define
2621 endomorphisms as locale endom = homom mult mult h.
2623 * Isar/locales: changed the way locales with predicates are defined.
2624 Instead of accumulating the specification, the imported expression is
2625 now an interpretation. INCOMPATIBILITY: different normal form of
2626 locale expressions. In particular, in interpretations of locales with
2627 predicates, goals repesenting already interpreted fragments are not
2628 removed automatically. Use methods `intro_locales' and
2629 `unfold_locales'; see below.
2631 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2632 provide backward reasoning on locales predicates. The methods are
2633 aware of interpretations and discharge corresponding goals.
2634 `intro_locales' is less aggressive then `unfold_locales' and does not
2635 unfold predicates to assumptions.
2637 * Isar/locales: the order in which locale fragments are accumulated
2638 has changed. This enables to override declarations from fragments due
2639 to interpretations -- for example, unwanted simp rules.
2641 * Isar/locales: interpretation in theories and proof contexts has been
2642 extended. One may now specify (and prove) equations, which are
2643 unfolded in interpreted theorems. This is useful for replacing
2644 defined concepts (constants depending on locale parameters) by
2645 concepts already existing in the target context. Example:
2647 interpretation partial_order ["op <= :: [int, int] => bool"]
2648 where "partial_order.less (op <=) (x::int) y = (x < y)"
2650 Typically, the constant `partial_order.less' is created by a
2651 definition specification element in the context of locale
2654 * Method "induct": improved internal context management to support
2655 local fixes and defines on-the-fly. Thus explicit meta-level
2656 connectives !! and ==> are rarely required anymore in inductive goals
2657 (using object-logic connectives for this purpose has been long
2658 obsolete anyway). Common proof patterns are explained in
2659 src/HOL/Induct/Common_Patterns.thy, see also
2660 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2663 * Method "induct": improved handling of simultaneous goals. Instead of
2664 introducing object-level conjunction, the statement is now split into
2665 several conclusions, while the corresponding symbolic cases are nested
2666 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2667 see src/HOL/Induct/Common_Patterns.thy, for example.
2669 * Method "induct": mutual induction rules are now specified as a list
2670 of rule sharing the same induction cases. HOL packages usually provide
2671 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2672 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2673 mutual induction rules differently, i.e. like this:
2675 (induct rule: foo_bar.inducts)
2676 (induct set: foo bar)
2677 (induct pred: foo bar)
2678 (induct type: foo bar)
2680 The ML function ProjectRule.projections turns old-style rules into the
2683 * Method "coinduct": dual of induction, see
2684 src/HOL/Library/Coinductive_List.thy for various examples.
2686 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2687 considered a legacy feature.
2689 * Attribute "symmetric" produces result with standardized schematic
2690 variables (index 0). Potential INCOMPATIBILITY.
2692 * Simplifier: by default the simplifier trace only shows top level
2693 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2694 default. Thus there is less danger of being flooded by the trace. The
2695 trace indicates where parts have been suppressed.
2697 * Provers/classical: removed obsolete classical version of elim_format
2698 attribute; classical elim/dest rules are now treated uniformly when
2699 manipulating the claset.
2701 * Provers/classical: stricter checks to ensure that supplied intro,
2702 dest and elim rules are well-formed; dest and elim rules must have at
2705 * Provers/classical: attributes dest/elim/intro take an optional
2706 weight argument for the rule (just as the Pure versions). Weights are
2707 ignored by automated tools, but determine the search order of single
2710 * Syntax: input syntax now supports dummy variable binding "%_. b",
2711 where the body does not mention the bound variable. Note that dummy
2712 patterns implicitly depend on their context of bounds, which makes
2713 "{_. _}" match any set comprehension as expected. Potential
2714 INCOMPATIBILITY -- parse translations need to cope with syntactic
2715 constant "_idtdummy" in the binding position.
2717 * Syntax: removed obsolete syntactic constant "_K" and its associated
2718 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2719 for example "A -> B" => "Pi A (%_. B)".
2721 * Pure: 'class_deps' command visualizes the subclass relation, using
2722 the graph browser tool.
2724 * Pure: 'print_theory' now suppresses certain internal declarations by
2725 default; use '!' option for full details.
2730 * Method "metis" proves goals by applying the Metis general-purpose
2731 resolution prover (see also http://gilith.com/software/metis/).
2732 Examples are in the directory MetisExamples. WARNING: the
2733 Isabelle/HOL-Metis integration does not yet work properly with
2736 * Command 'sledgehammer' invokes external automatic theorem provers as
2737 background processes. It generates calls to the "metis" method if
2738 successful. These can be pasted into the proof. Users do not have to
2739 wait for the automatic provers to return. WARNING: does not really
2740 work with multi-threading.
2742 * New "auto_quickcheck" feature tests outermost goal statements for
2743 potential counter-examples. Controlled by ML references
2744 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2745 5000 milliseconds). Fails silently if statements is outside of
2746 executable fragment, or any other codgenerator problem occurs.
2748 * New constant "undefined" with axiom "undefined x = undefined".
2750 * Added class "HOL.eq", allowing for code generation with polymorphic
2753 * Some renaming of class constants due to canonical name prefixing in
2754 the new 'class' package:
2756 HOL.abs ~> HOL.abs_class.abs
2757 HOL.divide ~> HOL.divide_class.divide
2758 0 ~> HOL.zero_class.zero
2759 1 ~> HOL.one_class.one
2760 op + ~> HOL.plus_class.plus
2761 op - ~> HOL.minus_class.minus
2762 uminus ~> HOL.minus_class.uminus
2763 op * ~> HOL.times_class.times
2764 op < ~> HOL.ord_class.less
2765 op <= > HOL.ord_class.less_eq
2766 Nat.power ~> Power.power_class.power
2767 Nat.size ~> Nat.size_class.size
2768 Numeral.number_of ~> Numeral.number_class.number_of
2769 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2770 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2771 Orderings.min ~> Orderings.ord_class.min
2772 Orderings.max ~> Orderings.ord_class.max
2773 Divides.op div ~> Divides.div_class.div
2774 Divides.op mod ~> Divides.div_class.mod
2775 Divides.op dvd ~> Divides.div_class.dvd
2777 INCOMPATIBILITY. Adaptions may be required in the following cases:
2779 a) User-defined constants using any of the names "plus", "minus",
2780 "times", "less" or "less_eq". The standard syntax translations for
2781 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2784 b) Variables named "plus", "minus", "times", "less", "less_eq"
2785 INCOMPATIBILITY: use more specific names.
2787 c) Permutative equations (e.g. "a + b = b + a")
2788 Since the change of names also changes the order of terms, permutative
2789 rewrite rules may get applied in a different order. Experience shows
2790 that this is rarely the case (only two adaptions in the whole Isabelle
2791 distribution). INCOMPATIBILITY: rewrite proofs
2793 d) ML code directly refering to constant names
2794 This in general only affects hand-written proof tactics, simprocs and
2795 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2796 Consider using @{const_name} antiquotation.
2798 * New class "default" with associated constant "default".
2800 * Function "sgn" is now overloaded and available on int, real, complex
2801 (and other numeric types), using class "sgn". Two possible defs of
2802 sgn are given as equational assumptions in the classes sgn_if and
2803 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2806 * Locale "partial_order" now unified with class "order" (cf. theory
2807 Orderings), added parameter "less". INCOMPATIBILITY.
2809 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2810 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2811 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2813 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2814 changed order of proof goals in instance proofs.
2816 * The transitivity reasoner for partial and linear orders is set up
2817 for classes "order" and "linorder". Instances of the reasoner are available
2818 in all contexts importing or interpreting the corresponding locales.
2819 Method "order" invokes the reasoner separately; the reasoner
2820 is also integrated with the Simplifier as a solver. Diagnostic
2821 command 'print_orders' shows the available instances of the reasoner
2822 in the current context.
2824 * Localized monotonicity predicate in theory "Orderings"; integrated
2825 lemmas max_of_mono and min_of_mono with this predicate.
2828 * Formulation of theorem "dense" changed slightly due to integration
2829 with new class dense_linear_order.
2831 * Uniform lattice theory development in HOL.
2833 constants "meet" and "join" now named "inf" and "sup"
2834 constant "Meet" now named "Inf"
2836 classes "meet_semilorder" and "join_semilorder" now named
2837 "lower_semilattice" and "upper_semilattice"
2838 class "lorder" now named "lattice"
2839 class "comp_lat" now named "complete_lattice"
2841 Instantiation of lattice classes allows explicit definitions
2842 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2844 INCOMPATIBILITY. Theorem renames:
2846 meet_left_le ~> inf_le1
2847 meet_right_le ~> inf_le2
2848 join_left_le ~> sup_ge1
2849 join_right_le ~> sup_ge2
2850 meet_join_le ~> inf_sup_ord
2853 le_meet ~> le_inf_iff
2854 le_join ~> ge_sup_conv
2855 meet_idempotent ~> inf_idem
2856 join_idempotent ~> sup_idem
2857 meet_comm ~> inf_commute
2858 join_comm ~> sup_commute
2859 meet_leI1 ~> le_infI1
2860 meet_leI2 ~> le_infI2
2861 le_joinI1 ~> le_supI1
2862 le_joinI2 ~> le_supI2
2863 meet_assoc ~> inf_assoc
2864 join_assoc ~> sup_assoc
2865 meet_left_comm ~> inf_left_commute
2866 meet_left_idempotent ~> inf_left_idem
2867 join_left_comm ~> sup_left_commute
2868 join_left_idempotent ~> sup_left_idem
2871 le_def_meet ~> le_iff_inf
2872 le_def_join ~> le_iff_sup
2873 join_absorp2 ~> sup_absorb2
2874 join_absorp1 ~> sup_absorb1
2875 meet_absorp1 ~> inf_absorb1
2876 meet_absorp2 ~> inf_absorb2
2877 meet_join_absorp ~> inf_sup_absorb
2878 join_meet_absorp ~> sup_inf_absorb
2879 distrib_join_le ~> distrib_sup_le
2880 distrib_meet_le ~> distrib_inf_le
2882 add_meet_distrib_left ~> add_inf_distrib_left
2883 add_join_distrib_left ~> add_sup_distrib_left
2884 is_join_neg_meet ~> is_join_neg_inf
2885 is_meet_neg_join ~> is_meet_neg_sup
2886 add_meet_distrib_right ~> add_inf_distrib_right
2887 add_join_distrib_right ~> add_sup_distrib_right
2888 add_meet_join_distribs ~> add_sup_inf_distribs
2889 join_eq_neg_meet ~> sup_eq_neg_inf
2890 meet_eq_neg_join ~> inf_eq_neg_sup
2891 add_eq_meet_join ~> add_eq_inf_sup
2892 meet_0_imp_0 ~> inf_0_imp_0
2893 join_0_imp_0 ~> sup_0_imp_0
2894 meet_0_eq_0 ~> inf_0_eq_0
2895 join_0_eq_0 ~> sup_0_eq_0
2896 neg_meet_eq_join ~> neg_inf_eq_sup
2897 neg_join_eq_meet ~> neg_sup_eq_inf
2898 join_eq_if ~> sup_eq_if
2900 mono_meet ~> mono_inf
2901 mono_join ~> mono_sup
2902 meet_bool_eq ~> inf_bool_eq
2903 join_bool_eq ~> sup_bool_eq
2904 meet_fun_eq ~> inf_fun_eq
2905 join_fun_eq ~> sup_fun_eq
2906 meet_set_eq ~> inf_set_eq
2907 join_set_eq ~> sup_set_eq
2908 meet1_iff ~> inf1_iff
2909 meet2_iff ~> inf2_iff
2918 join1_iff ~> sup1_iff
2919 join2_iff ~> sup2_iff
2929 is_meet_Meet ~> is_meet_Inf
2930 Meet_bool_def ~> Inf_bool_def
2931 Meet_fun_def ~> Inf_fun_def
2932 Meet_greatest ~> Inf_greatest
2933 Meet_lower ~> Inf_lower
2934 Meet_set_def ~> Inf_set_def
2937 Sup_bool_eq ~> Sup_bool_def
2938 Sup_fun_eq ~> Sup_fun_def
2939 Sup_set_eq ~> Sup_set_def
2941 listsp_meetI ~> listsp_infI
2942 listsp_meet_eq ~> listsp_inf_eq
2947 * Added syntactic class "size"; overloaded constant "size" now has
2948 type "'a::size ==> bool"
2950 * Internal reorganisation of `size' of datatypes: size theorems
2951 "foo.size" are no longer subsumed by "foo.simps" (but are still
2952 simplification rules by default!); theorems "prod.size" now named
2955 * Class "div" now inherits from class "times" rather than "type".
2958 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2959 Linorder etc. have disappeared; operations defined in terms of
2960 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2962 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2964 * HOL-Word: New extensive library and type for generic, fixed size
2965 machine words, with arithemtic, bit-wise, shifting and rotating
2966 operations, reflection into int, nat, and bool lists, automation for
2967 linear arithmetic (by automatic reflection into nat or int), including
2968 lemmas on overflow and monotonicity. Instantiated to all appropriate
2969 arithmetic type classes, supporting automatic simplification of
2970 numerals on all operations.
2972 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2974 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2976 * Code generator library theories:
2977 - Code_Integer represents HOL integers by big integer literals in target
2979 - Code_Char represents HOL characters by character literals in target
2981 - Code_Char_chr like Code_Char, but also offers treatment of character
2982 codes; includes Code_Integer.
2983 - Executable_Set allows to generate code for finite sets using lists.
2984 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2986 - Executable_Real implements a subset of real numbers, namly those
2987 representable by rational numbers.
2988 - Efficient_Nat implements natural numbers by integers, which in general will
2989 result in higher efficency; pattern matching with 0/Suc is eliminated;
2990 includes Code_Integer.
2991 - Code_Index provides an additional datatype index which is mapped to
2992 target-language built-in integers.
2993 - Code_Message provides an additional datatype message_string which is isomorphic to
2994 strings; messages are mapped to target-language strings.
2996 * New package for inductive predicates
2998 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3001 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3002 for z_1 :: U_1 and ... and z_n :: U_m
3004 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3007 with full support for type-inference, rather than
3009 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3011 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3012 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3014 inductive "s z_1 ... z_m"
3016 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3019 For backward compatibility, there is a wrapper allowing inductive
3020 sets to be defined with the new package via
3023 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3024 for z_1 :: U_1 and ... and z_n :: U_m
3026 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3032 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3033 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3034 for z_1 :: U_1 and ... and z_n :: U_m
3036 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3037 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3040 if the additional syntax "p ..." is required.
3042 Numerous examples can be found in the subdirectories src/HOL/Auth,
3043 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3047 - Since declaration and definition of inductive sets or predicates
3048 is no longer separated, abbreviations involving the newly
3049 introduced sets or predicates must be specified together with the
3050 introduction rules after the 'where' keyword (see above), rather
3051 than before the actual inductive definition.
3053 - The variables in induction and elimination rules are now
3054 quantified in the order of their occurrence in the introduction
3055 rules, rather than in alphabetical order. Since this may break
3056 some proofs, these proofs either have to be repaired, e.g. by
3057 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3058 statements of the form
3060 case (rule_i a_i_1 ... a_i_{k_i})
3062 or the old order of quantification has to be restored by explicitly adding
3063 meta-level quantifiers in the introduction rules, i.e.
3065 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3067 - The format of the elimination rules is now
3069 p z_1 ... z_m x_1 ... x_n ==>
3070 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3075 (x_1, ..., x_n) : s z_1 ... z_m ==>
3076 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3079 for sets rather than
3081 x : s z_1 ... z_m ==>
3082 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3085 This may require terms in goals to be expanded to n-tuples
3086 (e.g. using case_tac or simplification with the split_paired_all
3087 rule) before the above elimination rule is applicable.
3089 - The elimination or case analysis rules for (mutually) inductive
3090 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3091 list of rules "p_1_..._p_k.elims" is no longer available.
3093 * New package "function"/"fun" for general recursive functions,
3094 supporting mutual and nested recursion, definitions in local contexts,
3095 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3096 for small examples, and the separate tutorial on the function
3097 package. The old recdef "package" is still available as before, but
3098 users are encouraged to use the new package.
3100 * Method "lexicographic_order" automatically synthesizes termination
3101 relations as lexicographic combinations of size measures.
3103 * Case-expressions allow arbitrary constructor-patterns (including
3104 "_") and take their order into account, like in functional
3105 programming. Internally, this is translated into nested
3106 case-expressions; missing cases are added and mapped to the predefined
3107 constant "undefined". In complicated cases printing may no longer show
3108 the original input but the internal form. Lambda-abstractions allow
3109 the same form of pattern matching: "% pat1 => e1 | ..." is an
3110 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3113 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3114 is an abbreviation for "of_nat :: nat => int". The simplification
3115 rules for "of_nat" have been changed to work like "int" did
3116 previously. Potential INCOMPATIBILITY:
3117 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3118 - of_nat_diff and of_nat_mult are no longer default simp rules
3120 * Method "algebra" solves polynomial equations over (semi)rings using
3121 Groebner bases. The (semi)ring structure is defined by locales and the
3122 tool setup depends on that generic context. Installing the method for
3123 a specific type involves instantiating the locale and possibly adding
3124 declarations for computation on the coefficients. The method is
3125 already instantiated for natural numbers and for the axiomatic class
3126 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3127 CALCULEMUS 2007 for the general principles underlying this
3128 architecture of context-aware proof-tools.
3130 * Method "ferrack" implements quantifier elimination over
3131 special-purpose dense linear orders using locales (analogous to
3132 "algebra"). The method is already installed for class
3133 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3136 * Former constant "List.op @" now named "List.append". Use ML
3137 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3138 circumvent possible incompatibilities when working on ML level.
3140 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3142 * New function listsum :: 'a list => 'a for arbitrary monoids.
3143 Special syntax: "SUM x <- xs. f x" (and latex variants)
3145 * New syntax for Haskell-like list comprehension (input only), eg.
3146 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3148 * The special syntax for function "filter" has changed from [x :
3149 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3150 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3152 * [a..b] is now defined for arbitrary linear orders. It used to be
3153 defined on nat only, as an abbreviation for [a..<Suc b]
3156 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3158 * New functions "sorted" and "sort" in src/HOL/List.thy.
3160 * New lemma collection field_simps (an extension of ring_simps) for
3161 manipulating (in)equations involving division. Multiplies with all
3162 denominators that can be proved to be non-zero (in equations) or
3163 positive/negative (in inequations).
3165 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3166 have been improved and renamed to ring_simps, group_simps and
3167 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3168 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3170 * Theory Library/Commutative_Ring: switched from recdef to function
3171 package; constants add, mul, pow now curried. Infix syntax for
3172 algebraic operations.
3174 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3177 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3180 * HOL/records: generalised field-update to take a function on the
3181 field rather than the new value: r(|A := x|) is translated to A_update
3182 (K x) r The K-combinator that is internally used is called K_record.
3183 INCOMPATIBILITY: Usage of the plain update functions has to be
3186 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3187 * x = 0, which are required for a semiring. Richer structures do not
3188 inherit from semiring_0 anymore, because this property is a theorem
3189 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3190 there is more to prove, but this is mostly trivial.
3192 * Class "recpower" is generalized to arbitrary monoids, not just
3193 commutative semirings. INCOMPATIBILITY: may need to incorporate
3194 commutativity or semiring properties additionally.
3196 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3197 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3198 better use 'abbreviation'.
3200 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3202 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3203 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3204 significant changes for setting up numeral syntax for types:
3205 - New constants Numeral.pred and Numeral.succ instead
3206 of former Numeral.bin_pred and Numeral.bin_succ.
3207 - Use integer operations instead of bin_add, bin_mult and so on.
3208 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3209 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3211 See src/HOL/Integ/IntArith.thy for an example setup.
3213 * Command 'normal_form' computes the normal form of a term that may
3214 contain free variables. For example ``normal_form "rev [a, b, c]"''
3215 produces ``[b, c, a]'' (without proof). This command is suitable for
3216 heavy-duty computations because the functions are compiled to ML
3217 first. Correspondingly, a method "normalization" is provided. See
3218 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3220 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3221 25 like -->); output depends on the "iff" print_mode, the default is
3222 "A = B" (with priority 50).
3224 * Relations less (<) and less_eq (<=) are also available on type bool.
3225 Modified syntax to disallow nesting without explicit parentheses,
3226 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3229 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3231 * Relation composition operator "op O" now has precedence 75 and binds
3232 stronger than union and intersection. INCOMPATIBILITY.
3234 * The old set interval syntax "{m..n(}" (and relatives) has been
3235 removed. Use "{m..<n}" (and relatives) instead.
3237 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3238 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3239 ``declare [[simproc del: neq]]''.
3241 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3244 * Theorem Cons_eq_map_conv no longer declared as "simp".
3246 * Theorem setsum_mult renamed to setsum_right_distrib.
3248 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3251 * Reimplemented methods "sat" and "satx", with several improvements:
3252 goals no longer need to be stated as "<prems> ==> False", equivalences
3253 (i.e. "=" on type bool) are handled, variable names of the form
3254 "lit_<n>" are no longer reserved, significant speedup.
3256 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3257 zChaff is still supported as well.
3259 * 'inductive' and 'datatype': provide projections of mutual rules,
3260 bundled as foo_bar.inducts;
3262 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3265 * Library: moved theory Accessible_Part to main HOL.
3267 * Library: added theory Coinductive_List of potentially infinite lists
3268 as greatest fixed-point.
3270 * Library: added theory AssocList which implements (finite) maps as
3273 * Method "evaluation" solves goals (i.e. a boolean expression)
3274 efficiently by compiling it to ML. The goal is "proved" (via an
3275 oracle) if it evaluates to True.
3277 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3278 also when invoked by the simplifier. This results in the Simplifier
3279 being more powerful on arithmetic goals. INCOMPATIBILITY.
3280 Configuration option fast_arith_split_limit=0 recovers the old
3283 * Support for hex (0x20) and binary (0b1001) numerals.
3285 * New method: reify eqs (t), where eqs are equations for an
3286 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3287 parameter, computes a term s::'b and a list xs::'a list and proves the
3288 theorem I xs s = t. This is also known as reification or quoting. The
3289 resulting theorem is applied to the subgoal to substitute t with I xs
3290 s. If t is omitted, the subgoal itself is reified.
3292 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3293 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3294 where f is supposed to be a computable function (in the sense of code
3295 generattion). The method uses reify to compute s and xs as above then
3296 applies corr_thm and uses normalization by evaluation to "prove" f s =
3297 r and finally gets the theorem t = r, which is again applied to the
3298 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3300 * Reflection: Automatic reification now handels binding, an example is
3301 available in src/HOL/ex/ReflectionEx.thy
3303 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3304 command 'statespace' that is similar to 'record', but introduces an
3305 abstract specification based on the locale infrastructure instead of
3306 HOL types. This leads to extra flexibility in composing state spaces,
3307 in particular multiple inheritance and renaming of components.
3312 * Hyperreal: Functions root and sqrt are now defined on negative real
3313 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3314 Nonnegativity side conditions have been removed from many lemmas, so
3315 that more subgoals may now be solved by simplification; potential
3318 * Real: new type classes formalize real normed vector spaces and
3319 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3320 and norm :: 'a => real.
3322 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3323 reals into other types. The overloaded constant Reals :: 'a set is now
3324 defined as range of_real; potential INCOMPATIBILITY.
3326 * Real: proper support for ML code generation, including 'quickcheck'.
3327 Reals are implemented as arbitrary precision rationals.
3329 * Hyperreal: Several constants that previously worked only for the
3330 reals have been generalized, so they now work over arbitrary vector
3331 spaces. Type annotations may need to be added in some cases; potential
3334 Infinitesimal :: ('a::real_normed_vector) star set
3335 HFinite :: ('a::real_normed_vector) star set
3336 HInfinite :: ('a::real_normed_vector) star set
3337 approx :: ('a::real_normed_vector) star => 'a star => bool
3338 monad :: ('a::real_normed_vector) star => 'a star set
3339 galaxy :: ('a::real_normed_vector) star => 'a star set
3340 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3341 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3342 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3343 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3344 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3345 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3346 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3347 sgn :: 'a::real_normed_vector => 'a
3348 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3350 * Complex: Some complex-specific constants are now abbreviations for
3351 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3352 hnorm. Other constants have been entirely removed in favor of the
3353 polymorphic versions (INCOMPATIBILITY):
3357 HInfinite <-- CInfinite
3358 Infinitesimal <-- CInfinitesimal
3361 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3362 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3363 (ns)deriv <-- (ns)cderiv
3368 * Formalisation of ideals and the quotient construction over rings.
3370 * Order and lattice theory no longer based on records.
3373 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3374 greatest_closed. INCOMPATIBILITY.
3376 * Method algebra is now set up via an attribute. For examples see
3377 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3378 of algebraic structures.
3380 * Renamed theory CRing to Ring.
3385 * Substantial, yet incomplete support for nominal datatypes (binding
3386 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3387 src/HOL/Nominal/Examples. Prospective users should consult
3388 http://isabelle.in.tum.de/nominal/
3393 * ML basics: just one true type int, which coincides with IntInf.int
3396 * ML within Isar: antiquotations allow to embed statically-checked
3397 formal entities in the source, referring to the context available at
3398 compile-time. For example:
3400 ML {* @{sort "{zero,one}"} *}
3401 ML {* @{typ "'a => 'b"} *}
3402 ML {* @{term "%x. x"} *}
3403 ML {* @{prop "x == y"} *}
3404 ML {* @{ctyp "'a => 'b"} *}
3405 ML {* @{cterm "%x. x"} *}
3406 ML {* @{cprop "x == y"} *}
3407 ML {* @{thm asm_rl} *}
3408 ML {* @{thms asm_rl} *}
3409 ML {* @{type_name c} *}
3410 ML {* @{type_syntax c} *}
3411 ML {* @{const_name c} *}
3412 ML {* @{const_syntax c} *}
3415 ML {* @{theory Pure} *}
3416 ML {* @{theory_ref} *}
3417 ML {* @{theory_ref Pure} *}
3420 ML {* @{clasimpset} *}
3422 The same works for sources being ``used'' within an Isar context.
3424 * ML in Isar: improved error reporting; extra verbosity with
3425 ML_Context.trace enabled.
3427 * Pure/General/table.ML: the join operations now works via exceptions
3428 DUP/SAME instead of type option. This is simpler in simple cases, and
3429 admits slightly more efficient complex applications.
3431 * Pure: 'advanced' translation functions (parse_translation etc.) now
3432 use Context.generic instead of just theory.
3434 * Pure: datatype Context.generic joins theory/Proof.context and
3435 provides some facilities for code that works in either kind of
3436 context, notably GenericDataFun for uniform theory and proof data.
3438 * Pure: simplified internal attribute type, which is now always
3439 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3440 local (Proof.context) attributes have been discontinued, while
3441 minimizing code duplication. Thm.rule_attribute and
3442 Thm.declaration_attribute build canonical attributes; see also structure
3443 Context for further operations on Context.generic, notably
3444 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3445 declarations and definitions.
3447 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3448 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3449 init only required for impure data. INCOMPATIBILITY: empty really need
3450 to be empty (no dependencies on theory content!)
3452 * Pure/kernel: consts certification ignores sort constraints given in
3453 signature declarations. (This information is not relevant to the
3454 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3455 potential INCOMPATIBILITY.
3457 * Pure: axiomatic type classes are now purely definitional, with
3458 explicit proofs of class axioms and super class relations performed
3459 internally. See Pure/axclass.ML for the main internal interfaces --
3460 notably AxClass.define_class supercedes AxClass.add_axclass, and
3461 AxClass.axiomatize_class/classrel/arity supersede
3462 Sign.add_classes/classrel/arities.
3464 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3465 global/local versions on theory vs. Proof.context have been
3466 discontinued; Attrib.syntax and Method.syntax have been adapted
3467 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3468 attributes, methods, etc.
3470 * Pure: several functions of signature "... -> theory -> theory * ..."
3471 have been reoriented to "... -> theory -> ... * theory" in order to
3472 allow natural usage in combination with the ||>, ||>>, |-> and
3473 fold_map combinators.
3475 * Pure: official theorem names (closed derivations) and additional
3476 comments (tags) are now strictly separate. Name hints -- which are
3477 maintained as tags -- may be attached any time without affecting the
3480 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3481 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3482 achieve the old behaviour.
3484 * Pure: the "Goal" constant is now called "prop", supporting a
3485 slightly more general idea of ``protecting'' meta-level rule
3488 * Pure: Logic.(un)varify only works in a global context, which is now
3489 enforced instead of silently assumed. INCOMPATIBILITY, may use
3490 Logic.legacy_(un)varify as temporary workaround.
3492 * Pure: structure Name provides scalable operations for generating
3493 internal variable names, notably Name.variants etc. This replaces
3494 some popular functions from term.ML:
3496 Term.variant -> Name.variant
3497 Term.variantlist -> Name.variant_list
3498 Term.invent_names -> Name.invent_list
3500 Note that low-level renaming rarely occurs in new code -- operations
3501 from structure Variable are used instead (see below).
3503 * Pure: structure Variable provides fundamental operations for proper
3504 treatment of fixed/schematic variables in a context. For example,
3505 Variable.import introduces fixes for schematics of given facts and
3506 Variable.export reverses the effect (up to renaming) -- this replaces
3507 various freeze_thaw operations.
3509 * Pure: structure Goal provides simple interfaces for
3510 init/conclude/finish and tactical prove operations (replacing former
3511 Tactic.prove). Goal.prove is the canonical way to prove results
3512 within a given context; Goal.prove_global is a degraded version for
3513 theory level goals, including a global Drule.standard. Note that
3514 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3515 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3516 in a locale context).
3518 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3519 and type checking (Syntax.check_term etc.), with common combinations
3520 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3521 which are considered legacy and await removal.
3523 * Pure/Syntax: generic interfaces for type unchecking
3524 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3525 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3526 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3527 available for convenience, but refer to the very same operations using
3528 a mere theory instead of a full context.
3530 * Isar: simplified treatment of user-level errors, using exception
3531 ERROR of string uniformly. Function error now merely raises ERROR,
3532 without any side effect on output channels. The Isar toplevel takes
3533 care of proper display of ERROR exceptions. ML code may use plain
3534 handle/can/try; cat_error may be used to concatenate errors like this:
3536 ... handle ERROR msg => cat_error msg "..."
3538 Toplevel ML code (run directly or through the Isar toplevel) may be
3539 embedded into the Isar toplevel with exception display/debug like
3542 Isar.toplevel (fn () => ...)
3544 INCOMPATIBILITY, removed special transform_error facilities, removed
3545 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3546 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3547 -- use plain ERROR instead.
3549 * Isar: theory setup now has type (theory -> theory), instead of a
3550 list. INCOMPATIBILITY, may use #> to compose setup functions.
3552 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3553 ProofContext.debug/verbose flags.
3555 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3556 theory before entering a proof state. Transactions now always see a
3557 quasi-functional intermediate checkpoint, both in interactive and
3560 * Isar: simplified interfaces for outer syntax. Renamed
3561 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3562 OuterSyntax.add_parsers -- this functionality is now included in
3563 OuterSyntax.command etc. INCOMPATIBILITY.
3565 * Simplifier: the simpset of a running simplification process now
3566 contains a proof context (cf. Simplifier.the_context), which is the
3567 very context that the initial simpset has been retrieved from (by
3568 simpset_of/local_simpset_of). Consequently, all plug-in components
3569 (solver, looper etc.) may depend on arbitrary proof data.
3571 * Simplifier.inherit_context inherits the proof context (plus the
3572 local bounds) of the current simplification process; any simproc
3573 etc. that calls the Simplifier recursively should do this! Removed
3574 former Simplifier.inherit_bounds, which is already included here --
3575 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3576 specify an explicit context using Simplifier.context/theory_context.
3578 * Simplifier/Classical Reasoner: more abstract interfaces
3579 change_simpset/claset for modifying the simpset/claset reference of a
3580 theory; raw versions simpset/claset_ref etc. have been discontinued --
3583 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3589 * settings: the default heap location within ISABELLE_HOME_USER now
3590 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3591 Isabelle installations.
3593 * isabelle-process: option -S (secure mode) disables some critical
3594 operations, notably runtime compilation and evaluation of ML source
3597 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3599 * Support for parallel execution, using native multicore support of
3600 Poly/ML 5.1. The theory loader exploits parallelism when processing
3601 independent theories, according to the given theory header
3602 specifications. The maximum number of worker threads is specified via
3603 usedir option -M or the "max-threads" setting in Proof General. A
3604 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3605 to 6 on a 8-core machine. User-code needs to observe certain
3606 guidelines for thread-safe programming, see appendix A in the Isar
3607 Implementation manual.
3611 New in Isabelle2005 (October 2005)
3612 ----------------------------------
3616 * Theory headers: the new header syntax for Isar theories is
3619 imports <theory1> ... <theoryN>
3620 uses <file1> ... <fileM>
3623 where the 'uses' part is optional. The previous syntax
3625 theory <name> = <theory1> + ... + <theoryN>:
3627 will disappear in the next release. Use isatool fixheaders to convert
3628 existing theory files. Note that there is no change in ancient
3629 non-Isar theories now, but these will disappear soon.
3631 * Theory loader: parent theories can now also be referred to via
3632 relative and absolute paths.
3634 * Command 'find_theorems' searches for a list of criteria instead of a
3635 list of constants. Known criteria are: intro, elim, dest, name:string,
3636 simp:term, and any term. Criteria can be preceded by '-' to select
3637 theorems that do not match. Intro, elim, dest select theorems that
3638 match the current goal, name:s selects theorems whose fully qualified
3639 name contain s, and simp:term selects all simplification rules whose
3640 lhs match term. Any other term is interpreted as pattern and selects
3641 all theorems matching the pattern. Available in ProofGeneral under
3642 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3644 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3646 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3647 matching the current goal as introduction rule and not having "HOL."
3648 in their name (i.e. not being defined in theory HOL).
3650 * Command 'thms_containing' has been discontinued in favour of
3651 'find_theorems'; INCOMPATIBILITY.
3653 * Communication with Proof General is now 8bit clean, which means that
3654 Unicode text in UTF-8 encoding may be used within theory texts (both
3655 formal and informal parts). Cf. option -U of the Isabelle Proof
3656 General interface. Here are some simple examples (cf. src/HOL/ex):
3658 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3659 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3661 * Improved efficiency of the Simplifier and, to a lesser degree, the
3662 Classical Reasoner. Typical big applications run around 2 times
3666 *** Document preparation ***
3668 * Commands 'display_drafts' and 'print_drafts' perform simple output
3669 of raw sources. Only those symbols that do not require additional
3670 LaTeX packages (depending on comments in isabellesym.sty) are
3671 displayed properly, everything else is left verbatim. isatool display
3672 and isatool print are used as front ends (these are subject to the
3673 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3675 * Command tags control specific markup of certain regions of text,
3676 notably folding and hiding. Predefined tags include "theory" (for
3677 theory begin and end), "proof" for proof commands, and "ML" for
3678 commands involving ML code; the additional tags "visible" and
3679 "invisible" are unused by default. Users may give explicit tag
3680 specifications in the text, e.g. ''by %invisible (auto)''. The
3681 interpretation of tags is determined by the LaTeX job during document
3682 preparation: see option -V of isatool usedir, or options -n and -t of
3683 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3686 Several document versions may be produced at the same time via isatool
3687 usedir (the generated index.html will link all of them). Typical
3688 specifications include ''-V document=theory,proof,ML'' to present
3689 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3690 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3691 these parts without any formal replacement text. The Isabelle site
3692 default settings produce ''document'' and ''outline'' versions as
3695 * Several new antiquotations:
3697 @{term_type term} prints a term with its type annotated;
3699 @{typeof term} prints the type of a term;
3701 @{const const} is the same as @{term const}, but checks that the
3702 argument is a known logical constant;
3704 @{term_style style term} and @{thm_style style thm} print a term or
3705 theorem applying a "style" to it
3709 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3710 definitions, equations, inequations etc., 'concl' printing only the
3711 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3712 to print the specified premise. TermStyle.add_style provides an ML
3713 interface for introducing further styles. See also the "LaTeX Sugar"
3714 document practical applications. The ML antiquotation prints
3715 type-checked ML expressions verbatim.
3717 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3718 and 'text' support optional locale specification '(in loc)', which
3719 specifies the default context for interpreting antiquotations. For
3720 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3722 * Option 'locale=NAME' of antiquotations specifies an alternative
3723 context interpreting the subsequent argument. For example: @{thm
3724 [locale=lattice] inf_assoc}.
3726 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3729 * Proper output of antiquotations for theory commands involving a
3730 proof context (such as 'locale' or 'theorem (in loc) ...').
3732 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3733 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3735 * isatool usedir: new option -C (default true) controls whether option
3736 -D should include a copy of the original document directory; -C false
3737 prevents unwanted effects such as copying of administrative CVS data.
3742 * Considerably improved version of 'constdefs' command. Now performs
3743 automatic type-inference of declared constants; additional support for
3744 local structure declarations (cf. locales and HOL records), see also
3745 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3746 sequential dependencies of definitions within a single 'constdefs'
3747 section; moreover, the declared name needs to be an identifier. If
3748 all fails, consider to fall back on 'consts' and 'defs' separately.
3750 * Improved indexed syntax and implicit structures. First of all,
3751 indexed syntax provides a notational device for subscripted
3752 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3753 expressions. Secondly, in a local context with structure
3754 declarations, number indexes \<^sub>n or the empty index (default
3755 number 1) refer to a certain fixed variable implicitly; option
3756 show_structs controls printing of implicit structures. Typical
3757 applications of these concepts involve record types and locales.
3759 * New command 'no_syntax' removes grammar declarations (and
3760 translations) resulting from the given syntax specification, which is
3761 interpreted in the same manner as for the 'syntax' command.
3763 * 'Advanced' translation functions (parse_translation etc.) may depend
3764 on the signature of the theory context being presently used for
3765 parsing/printing, see also isar-ref manual.
3767 * Improved 'oracle' command provides a type-safe interface to turn an
3768 ML expression of type theory -> T -> term into a primitive rule of
3769 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3770 is already included here); see also FOL/ex/IffExample.thy;
3773 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3774 before); "cI" is no longer bound, use "c.intro" instead.
3775 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3776 axclasses vs. locales.
3778 * Improved internal renaming of symbolic identifiers -- attach primes
3779 instead of base 26 numbers.
3781 * New flag show_question_marks controls printing of leading question
3782 marks in schematic variable names.
3784 * In schematic variable names, *any* symbol following \<^isub> or
3785 \<^isup> is now treated as part of the base name. For example, the
3786 following works without printing of awkward ".0" indexes:
3788 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3791 * Inner syntax includes (*(*nested*) comments*).
3793 * Pretty printer now supports unbreakable blocks, specified in mixfix
3794 annotations as "(00...)".
3796 * Clear separation of logical types and nonterminals, where the latter
3797 may only occur in 'syntax' specifications or type abbreviations.
3798 Before that distinction was only partially implemented via type class
3799 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3800 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3801 exotic syntax specifications may require further adaption
3802 (e.g. Cube/Cube.thy).
3804 * Removed obsolete type class "logic", use the top sort {} instead.
3805 Note that non-logical types should be declared as 'nonterminals'
3806 rather than 'types'. INCOMPATIBILITY for new object-logic
3809 * Attributes 'induct' and 'cases': type or set names may now be
3810 locally fixed variables as well.
3812 * Simplifier: can now control the depth to which conditional rewriting
3813 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3816 * Simplifier: simplification procedures may now take the current
3817 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3818 interface), which is very useful for calling the Simplifier
3819 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3820 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3821 low-level mk_simproc no longer applies Logic.varify internally, to
3822 allow for use in a context of fixed variables.
3824 * thin_tac now works even if the assumption being deleted contains !!
3825 or ==>. More generally, erule now works even if the major premise of
3826 the elimination rule contains !! or ==>.
3828 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3830 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3831 from Pure, which contains all common declarations already. Both
3832 theories are defined via plain Isabelle/Isar .thy files.
3833 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3834 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3835 use isatool fixcpure to adapt your theory and ML sources.
3837 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3838 selections of theorems in named facts via index ranges.
3840 * 'print_theorems': in theory mode, really print the difference
3841 wrt. the last state (works for interactive theory development only),
3842 in proof mode print all local facts (cf. 'print_facts');
3844 * 'hide': option '(open)' hides only base names.
3846 * More efficient treatment of intermediate checkpoints in interactive
3849 * Code generator is now invoked via code_module (incremental code
3850 generation) and code_library (modular code generation, ML structures
3851 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3852 must be quoted when used as identifiers.
3854 * New 'value' command for reading, evaluating and printing terms using
3855 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3856 quoted when used as identifier.
3861 * New commands for the interpretation of locale expressions in
3862 theories (1), locales (2) and proof contexts (3). These generate
3863 proof obligations from the expression specification. After the
3864 obligations have been discharged, theorems of the expression are added
3865 to the theory, target locale or proof context. The synopsis of the
3866 commands is a follows:
3868 (1) interpretation expr inst
3869 (2) interpretation target < expr
3870 (3) interpret expr inst
3872 Interpretation in theories and proof contexts require a parameter
3873 instantiation of terms from the current context. This is applied to
3874 specifications and theorems of the interpreted expression.
3875 Interpretation in locales only permits parameter renaming through the
3876 locale expression. Interpretation is smart in that interpretations
3877 that are active already do not occur in proof obligations, neither are
3878 instantiated theorems stored in duplicate. Use 'print_interps' to
3879 inspect active interpretations of a particular locale. For details,
3880 see the Isar Reference manual. Examples can be found in
3881 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3883 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3884 'interpret' instead.
3886 * New context element 'constrains' for adding type constraints to
3889 * Context expressions: renaming of parameters with syntax
3892 * Locale declaration: 'includes' disallowed.
3894 * Proper static binding of attribute syntax -- i.e. types / terms /
3895 facts mentioned as arguments are always those of the locale definition
3896 context, independently of the context of later invocations. Moreover,
3897 locale operations (renaming and type / term instantiation) are applied
3898 to attribute arguments as expected.
3900 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3901 actual attributes; rare situations may require Attrib.attribute to
3902 embed those attributes into Attrib.src that lack concrete syntax.
3903 Attribute implementations need to cooperate properly with the static
3904 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3905 Attrib.XXX_thm etc. already do the right thing without further
3906 intervention. Only unusual applications -- such as "where" or "of"
3907 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3908 on the context and the facts involved -- may have to assign parsed
3909 values to argument tokens explicitly.
3911 * Changed parameter management in theorem generation for long goal
3912 statements with 'includes'. INCOMPATIBILITY: produces a different
3913 theorem statement in rare situations.
3915 * Locale inspection command 'print_locale' omits notes elements. Use
3916 'print_locale!' to have them included in the output.
3921 * Provers/hypsubst.ML: improved version of the subst method, for
3922 single-step rewriting: it now works in bound variable contexts. New is
3923 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3924 rewrite a different subterm than the original subst method, which is
3925 still available as 'simplesubst'.
3927 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3930 * Provers/trancl.ML: new transitivity reasoner for transitive and
3931 reflexive-transitive closure of relations.
3933 * Provers/blast.ML: new reference depth_limit to make blast's depth
3934 limit (previously hard-coded with a value of 20) user-definable.
3936 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3937 is peformed already. Object-logics merely need to finish their
3938 initial simpset configuration as before. INCOMPATIBILITY.
3943 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3946 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3948 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3949 and x-symbol; use option '-m epsilon' to get it actually printed.
3950 Moreover, the mathematically important symbolic identifier \<epsilon>
3951 becomes available as variable, constant etc. INCOMPATIBILITY,
3953 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3954 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3955 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3956 support corresponding Isar calculations.
3958 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3961 * theory SetInterval: changed the syntax for open intervals:
3970 The old syntax is still supported but will disappear in the next
3971 release. For conversion use the following Emacs search and replace
3972 patterns (these are not perfect but work quite well):
3974 {)\([^\.]*\)\.\. -> {\1<\.\.}
3975 \.\.\([^(}]*\)(} -> \.\.<\1}
3977 * Theory Commutative_Ring (in Library): method comm_ring for proving
3978 equalities in commutative rings; method 'algebra' provides a generic
3981 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3982 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3983 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3986 Some new syntax forms are available:
3988 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3989 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3990 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3991 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3993 The latter form "\<Sum>x < k. e" used to be based on a separate
3994 function "Summation", which has been discontinued.
3996 * theory Finite_Set: in structured induction proofs, the insert case
3997 is now 'case (insert x F)' instead of the old counterintuitive 'case
4000 * The 'refute' command has been extended to support a much larger
4001 fragment of HOL, including axiomatic type classes, constdefs and
4002 typedefs, inductive datatypes and recursion.
4004 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4005 Requires zChaff with proof generation to be installed. See
4006 HOL/ex/SAT_Examples.thy for examples.
4008 * Datatype induction via method 'induct' now preserves the name of the
4009 induction variable. For example, when proving P(xs::'a list) by
4010 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4011 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4012 in unstructured proof scripts.
4014 * Reworked implementation of records. Improved scalability for
4015 records with many fields, avoiding performance problems for type
4016 inference. Records are no longer composed of nested field types, but
4017 of nested extension types. Therefore the record type only grows linear
4018 in the number of extensions and not in the number of fields. The
4019 top-level (users) view on records is preserved. Potential
4020 INCOMPATIBILITY only in strange cases, where the theory depends on the
4021 old record representation. The type generated for a record is called
4022 <record_name>_ext_type.
4024 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4025 proofs triggered by a record definition or a simproc (if
4026 quick_and_dirty is enabled). Definitions of large records can take
4029 New simproc record_upd_simproc for simplification of multiple record
4030 updates enabled by default. Moreover, trivial updates are also
4031 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4032 occasionally, since simplification is more powerful by default.
4034 * typedef: proper support for polymorphic sets, which contain extra
4035 type-variables in the term.
4037 * Simplifier: automatically reasons about transitivity chains
4038 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4039 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4040 old proofs break occasionally as simplification may now solve more
4041 goals than previously.
4043 * Simplifier: converts x <= y into x = y if assumption y <= x is
4044 present. Works for all partial orders (class "order"), in particular
4045 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4048 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4049 bound variable or a constant then the let is unfolded. Otherwise
4050 first a is simplified to b, and then f b is simplified to g. If
4051 possible we abstract b from g arriving at "let x = b in h x",
4052 otherwise we unfold the let and arrive at g. The simproc can be
4053 enabled/disabled by the reference use_let_simproc. Potential
4054 INCOMPATIBILITY since simplification is more powerful by default.
4056 * Classical reasoning: the meson method now accepts theorems as arguments.
4058 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4059 jobs to provide advice on the provability of subgoals.
4061 * Theory OrderedGroup and Ring_and_Field: various additions and
4062 improvements to faciliate calculations involving equalities and
4065 The following theorems have been eliminated or modified
4068 abs_eq now named abs_of_nonneg
4069 abs_of_ge_0 now named abs_of_nonneg
4070 abs_minus_eq now named abs_of_nonpos
4071 imp_abs_id now named abs_of_nonneg
4072 imp_abs_neg_id now named abs_of_nonpos
4073 mult_pos now named mult_pos_pos
4074 mult_pos_le now named mult_nonneg_nonneg
4075 mult_pos_neg_le now named mult_nonneg_nonpos
4076 mult_pos_neg2_le now named mult_nonneg_nonpos2
4077 mult_neg now named mult_neg_neg
4078 mult_neg_le now named mult_nonpos_nonpos
4080 * The following lemmas in Ring_and_Field have been added to the simplifier:
4083 not_square_less_zero
4085 The following lemmas have been deleted from Real/RealPow:
4095 * Theory Parity: added rules for simplifying exponents.
4099 The following theorems have been eliminated or modified
4102 list_all_Nil now named list_all.simps(1)
4103 list_all_Cons now named list_all.simps(2)
4104 list_all_conv now named list_all_iff
4105 set_mem_eq now named mem_iff
4107 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4108 asymptotic "big O" calculations. See the notes in BigO.thy.
4113 * Theory RealDef: better support for embedding natural numbers and
4114 integers in the reals.
4116 The following theorems have been eliminated or modified
4119 exp_ge_add_one_self now requires no hypotheses
4120 real_of_int_add reversed direction of equality (use [symmetric])
4121 real_of_int_minus reversed direction of equality (use [symmetric])
4122 real_of_int_diff reversed direction of equality (use [symmetric])
4123 real_of_int_mult reversed direction of equality (use [symmetric])
4125 * Theory RComplete: expanded support for floor and ceiling functions.
4127 * Theory Ln is new, with properties of the natural logarithm
4129 * Hyperreal: There is a new type constructor "star" for making
4130 nonstandard types. The old type names are now type synonyms:
4134 hcomplex = complex star
4136 * Hyperreal: Many groups of similarly-defined constants have been
4137 replaced by polymorphic versions (INCOMPATIBILITY):
4139 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4141 starset <-- starsetNat, starsetC
4142 *s* <-- *sNat*, *sc*
4143 starset_n <-- starsetNat_n, starsetC_n
4144 *sn* <-- *sNatn*, *scn*
4145 InternalSets <-- InternalNatSets, InternalCSets
4147 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4148 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4149 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4150 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4151 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4153 * Hyperreal: Many type-specific theorems have been removed in favor of
4154 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4156 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4157 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4158 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4159 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4160 right_minus <-- hypreal_add_minus
4161 left_minus <-- {hypreal,hcomplex}_add_minus_left
4162 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4163 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4164 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4165 mult_1_right <-- hcomplex_mult_one_right
4166 mult_zero_left <-- hcomplex_mult_zero_left
4167 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4168 right_distrib <-- hypnat_add_mult_distrib2
4169 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4170 right_inverse <-- hypreal_mult_inverse
4171 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4172 order_refl <-- {hypreal,hypnat}_le_refl
4173 order_trans <-- {hypreal,hypnat}_le_trans
4174 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4175 order_less_le <-- {hypreal,hypnat}_less_le
4176 linorder_linear <-- {hypreal,hypnat}_le_linear
4177 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4178 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4179 add_nonneg_nonneg <-- hypreal_le_add_order
4181 * Hyperreal: Separate theorems having to do with type-specific
4182 versions of constants have been merged into theorems that apply to the
4183 new polymorphic constants (INCOMPATIBILITY):
4185 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4186 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4187 STAR_Un <-- {STAR,NatStar,STARC}_Un
4188 STAR_Int <-- {STAR,NatStar,STARC}_Int
4189 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4190 STAR_subset <-- {STAR,NatStar,STARC}_subset
4191 STAR_mem <-- {STAR,NatStar,STARC}_mem
4192 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4193 STAR_diff <-- {STAR,STARC}_diff
4194 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4195 STARC_hcomplex_of_complex}_image_subset
4196 starset_n_Un <-- starset{Nat,C}_n_Un
4197 starset_n_Int <-- starset{Nat,C}_n_Int
4198 starset_n_Compl <-- starset{Nat,C}_n_Compl
4199 starset_n_diff <-- starset{Nat,C}_n_diff
4200 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4201 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4202 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4203 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4204 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4205 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4206 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4207 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4208 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4209 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4210 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4211 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4212 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4213 starfun_diff <-- starfun{C,RC,CR}_diff
4214 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4215 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4216 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4217 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4218 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4219 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4220 starfun_Id <-- starfunC_Id
4221 starfun_approx <-- starfun{Nat,CR}_approx
4222 starfun_capprox <-- starfun{C,RC}_capprox
4223 starfun_abs <-- starfunNat_rabs
4224 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4225 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4226 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4227 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4228 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4229 starfun_add_approx <-- starfunCR_add_approx
4230 starfun_inverse_inverse <-- starfunC_inverse_inverse
4231 starfun_divide <-- starfun{C,CR,RC}_divide
4232 starfun_n <-- starfun{Nat,C}_n
4233 starfun_n_mult <-- starfun{Nat,C}_n_mult
4234 starfun_n_add <-- starfun{Nat,C}_n_add
4235 starfun_n_add_minus <-- starfunNat_n_add_minus
4236 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4237 starfun_n_minus <-- starfun{Nat,C}_n_minus
4238 starfun_n_eq <-- starfun{Nat,C}_n_eq
4240 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4241 star_n_minus <-- {hypreal,hcomplex}_minus
4242 star_n_diff <-- {hypreal,hcomplex}_diff
4243 star_n_mult <-- {hypreal,hcomplex}_mult
4244 star_n_inverse <-- {hypreal,hcomplex}_inverse
4245 star_n_le <-- {hypreal,hypnat}_le
4246 star_n_less <-- {hypreal,hypnat}_less
4247 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4248 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4249 star_n_abs <-- hypreal_hrabs
4250 star_n_divide <-- hcomplex_divide
4252 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4253 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4254 star_of_diff <-- hypreal_of_real_diff
4255 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4256 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4257 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4258 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4259 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4260 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4261 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4262 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4263 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4264 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4265 star_of_number_of <-- {hypreal,hcomplex}_number_of
4266 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4267 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4268 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4269 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4270 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4271 star_of_power <-- hypreal_of_real_power
4272 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4274 * Hyperreal: new method "transfer" that implements the transfer
4275 principle of nonstandard analysis. With a subgoal that mentions
4276 nonstandard types like "'a star", the command "apply transfer"
4277 replaces it with an equivalent one that mentions only standard types.
4278 To be successful, all free variables must have standard types; non-
4279 standard variables must have explicit universal quantifiers.
4281 * Hyperreal: A theory of Taylor series.
4286 * Discontinued special version of 'constdefs' (which used to support
4287 continuous functions) in favor of the general Pure one with full
4290 * New simplification procedure for solving continuity conditions; it
4291 is much faster on terms with many nested lambda abstractions (cubic
4292 instead of exponential time).
4294 * New syntax for domain package: selector names are now optional.
4295 Parentheses should be omitted unless argument is lazy, for example:
4297 domain 'a stream = cons "'a" (lazy "'a stream")
4299 * New command 'fixrec' for defining recursive functions with pattern
4300 matching; defining multiple functions with mutual recursion is also
4301 supported. Patterns may include the constants cpair, spair, up, sinl,
4302 sinr, or any data constructor defined by the domain package. The given
4303 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4304 syntax and examples.
4306 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4307 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4308 but the proof obligation additionally includes an admissibility
4309 requirement. The packages generate instances of class cpo or pcpo,
4310 with continuity and strictness theorems for Rep and Abs.
4312 * HOLCF: Many theorems have been renamed according to a more standard naming
4313 scheme (INCOMPATIBILITY):
4315 foo_inject: "foo$x = foo$y ==> x = y"
4316 foo_eq: "(foo$x = foo$y) = (x = y)"
4317 foo_less: "(foo$x << foo$y) = (x << y)"
4318 foo_strict: "foo$UU = UU"
4319 foo_defined: "... ==> foo$x ~= UU"
4320 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4325 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4326 including the First Isomorphism Theorem (on quotienting by the kernel
4329 * ZF/Simplifier: install second copy of type solver that actually
4330 makes use of TC rules declared to Isar proof contexts (or locales);
4331 the old version is still required for ML proof scripts.
4336 * Converted to Isar theory format; use locales instead of axiomatic
4342 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4345 * Pure/library.ML no longer defines its own option datatype, but uses
4346 that of the SML basis, which has constructors NONE and SOME instead of
4347 None and Some, as well as exception Option.Option instead of OPTION.
4348 The functions the, if_none, is_some, is_none have been adapted
4349 accordingly, while Option.map replaces apsome.
4351 * Pure/library.ML: the exception LIST has been given up in favour of
4352 the standard exceptions Empty and Subscript, as well as
4353 Library.UnequalLengths. Function like Library.hd and Library.tl are
4354 superceded by the standard hd and tl functions etc.
4356 A number of basic list functions are no longer exported to the ML
4357 toplevel, as they are variants of predefined functions. The following
4358 suggests how one can translate existing code:
4360 rev_append xs ys = List.revAppend (xs, ys)
4361 nth_elem (i, xs) = List.nth (xs, i)
4362 last_elem xs = List.last xs
4363 flat xss = List.concat xss
4364 seq fs = List.app fs
4365 partition P xs = List.partition P xs
4366 mapfilter f xs = List.mapPartial f xs
4368 * Pure/library.ML: several combinators for linear functional
4369 transformations, notably reverse application and composition:
4372 (x, y) |-> f f #-> g
4374 * Pure/library.ML: introduced/changed precedence of infix operators:
4376 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4378 infix 3 o oo ooo oooo;
4379 infix 4 ~~ upto downto;
4381 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4384 * Pure/library.ML: natural list combinators fold, fold_rev, and
4385 fold_map support linear functional transformations and nesting. For
4388 fold f [x1, ..., xN] y =
4389 y |> f x1 |> ... |> f xN
4391 (fold o fold) f [xs1, ..., xsN] y =
4392 y |> fold f xs1 |> ... |> fold f xsN
4394 fold f [x1, ..., xN] =
4397 (fold o fold) f [xs1, ..., xsN] =
4398 fold f xs1 #> ... #> fold f xsN
4400 * Pure/library.ML: the following selectors on type 'a option are
4403 the: 'a option -> 'a (*partial*)
4404 these: 'a option -> 'a where 'a = 'b list
4405 the_default: 'a -> 'a option -> 'a
4406 the_list: 'a option -> 'a list
4408 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4409 basic operations for association lists, following natural argument
4410 order; moreover the explicit equality predicate passed here avoids
4411 potentially expensive polymorphic runtime equality checks.
4412 The old functions may be expressed as follows:
4414 assoc = uncurry (AList.lookup (op =))
4415 assocs = these oo AList.lookup (op =)
4416 overwrite = uncurry (AList.update (op =)) o swap
4418 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4420 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4421 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4423 replacing make_keylist and keyfilter (occassionally used)
4426 make_keylist = AList.make
4427 keyfilter = AList.find (op =)
4429 * eq_fst and eq_snd now take explicit equality parameter, thus
4430 avoiding eqtypes. Naive rewrites:
4432 eq_fst = eq_fst (op =)
4433 eq_snd = eq_snd (op =)
4435 * Removed deprecated apl and apr (rarely used).
4438 apl (n, op) =>>= curry op n
4439 apr (op, m) =>>= fn n => op (n, m)
4441 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4442 provides a reasonably efficient light-weight implementation of sets as
4445 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4446 few new operations; existing lookup and update are now curried to
4447 follow natural argument order (for use with fold etc.);
4448 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4450 * Pure/General: output via the Isabelle channels of
4451 writeln/warning/error etc. is now passed through Output.output, with a
4452 hook for arbitrary transformations depending on the print_mode
4453 (cf. Output.add_mode -- the first active mode that provides a output
4454 function wins). Already formatted output may be embedded into further
4455 text via Output.raw; the result of Pretty.string_of/str_of and derived
4456 functions (string_of_term/cterm/thm etc.) is already marked raw to
4457 accommodate easy composition of diagnostic messages etc. Programmers
4458 rarely need to care about Output.output or Output.raw at all, with
4459 some notable exceptions: Output.output is required when bypassing the
4460 standard channels (writeln etc.), or in token translations to produce
4461 properly formatted results; Output.raw is required when capturing
4462 already output material that will eventually be presented to the user
4463 a second time. For the default print mode, both Output.output and
4464 Output.raw have no effect.
4466 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4467 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4468 cumulative results are displayed at the end of a batch session.
4470 * Pure/General: File.sysify_path and File.quote_sysify path have been
4471 replaced by File.platform_path and File.shell_path (with appropriate
4472 hooks). This provides a clean interface for unusual systems where the
4473 internal and external process view of file names are different.
4475 * Pure: more efficient orders for basic syntactic entities: added
4476 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4477 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4478 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4479 orders now -- potential INCOMPATIBILITY for code that depends on a
4480 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4481 Library.sort_strings on result).
4483 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4484 fold_types traverse types/terms from left to right, observing natural
4485 argument order. Supercedes previous foldl_XXX versions, add_frees,
4486 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4488 * Pure: name spaces have been refined, with significant changes of the
4489 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4490 to extern(_table). The plain name entry path is superceded by a
4491 general 'naming' context, which also includes the 'policy' to produce
4492 a fully qualified name and external accesses of a fully qualified
4493 name; NameSpace.extend is superceded by context dependent
4494 Sign.declare_name. Several theory and proof context operations modify
4495 the naming context. Especially note Theory.restore_naming and
4496 ProofContext.restore_naming to get back to a sane state; note that
4497 Theory.add_path is no longer sufficient to recover from
4498 Theory.absolute_path in particular.
4500 * Pure: new flags short_names (default false) and unique_names
4501 (default true) for controlling output of qualified names. If
4502 short_names is set, names are printed unqualified. If unique_names is
4503 reset, the name prefix is reduced to the minimum required to achieve
4504 the original result when interning again, even if there is an overlap
4505 with earlier declarations.
4507 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4508 now 'extend', and 'merge' gets an additional Pretty.pp argument
4509 (useful for printing error messages). INCOMPATIBILITY.
4511 * Pure: major reorganization of the theory context. Type Sign.sg and
4512 Theory.theory are now identified, referring to the universal
4513 Context.theory (see Pure/context.ML). Actual signature and theory
4514 content is managed as theory data. The old code and interfaces were
4515 spread over many files and structures; the new arrangement introduces
4516 considerable INCOMPATIBILITY to gain more clarity:
4518 Context -- theory management operations (name, identity, inclusion,
4519 parents, ancestors, merge, etc.), plus generic theory data;
4521 Sign -- logical signature and syntax operations (declaring consts,
4522 types, etc.), plus certify/read for common entities;
4524 Theory -- logical theory operations (stating axioms, definitions,
4525 oracles), plus a copy of logical signature operations (consts,
4526 types, etc.); also a few basic management operations (Theory.copy,
4529 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4530 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4531 for convenience -- they merely return the theory.
4533 * Pure: type Type.tsig is superceded by theory in most interfaces.
4535 * Pure: the Isar proof context type is already defined early in Pure
4536 as Context.proof (note that ProofContext.context and Proof.context are
4537 aliases, where the latter is the preferred name). This enables other
4538 Isabelle components to refer to that type even before Isar is present.
4540 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4541 typeK, constK, axiomK, oracleK), but provide explicit operations for
4542 any of these kinds. For example, Sign.intern typeK is now
4543 Sign.intern_type, Theory.hide_space Sign.typeK is now
4544 Theory.hide_types. Also note that former
4545 Theory.hide_classes/types/consts are now
4546 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4547 internalize their arguments! INCOMPATIBILITY.
4549 * Pure: get_thm interface (of PureThy and ProofContext) expects
4550 datatype thmref (with constructors Name and NameSelection) instead of
4551 plain string -- INCOMPATIBILITY;
4553 * Pure: cases produced by proof methods specify options, where NONE
4554 means to remove case bindings -- INCOMPATIBILITY in
4557 * Pure: the following operations retrieve axioms or theorems from a
4558 theory node or theory hierarchy, respectively:
4560 Theory.axioms_of: theory -> (string * term) list
4561 Theory.all_axioms_of: theory -> (string * term) list
4562 PureThy.thms_of: theory -> (string * thm) list
4563 PureThy.all_thms_of: theory -> (string * thm) list
4565 * Pure: print_tac now outputs the goal through the trace channel.
4567 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4568 Reference Toplevel.debug (default false) controls detailed printing
4569 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4570 controls execution profiling -- set to 1 for time and 2 for space
4571 (both increase the runtime).
4573 * Isar session: The initial use of ROOT.ML is now always timed,
4574 i.e. the log will show the actual process times, in contrast to the
4575 elapsed wall-clock time that the outer shell wrapper produces.
4577 * Simplifier: improved handling of bound variables (nameless
4578 representation, avoid allocating new strings). Simprocs that invoke
4579 the Simplifier recursively should use Simplifier.inherit_bounds to
4580 avoid local name clashes. Failure to do so produces warnings
4581 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4582 for further details.
4584 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4585 bindings for all theorems stored within a given theory; this may help
4586 in porting non-Isar theories to Isar ones, while keeping ML proof
4587 scripts for the time being.
4589 * ML operator HTML.with_charset specifies the charset begin used for
4590 generated HTML files. For example:
4592 HTML.with_charset "utf-8" use_thy "Hebrew";
4593 HTML.with_charset "utf-8" use_thy "Chinese";
4598 * Allow symlinks to all proper Isabelle executables (Isabelle,
4599 isabelle, isatool etc.).
4601 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4602 isatool doc, isatool mkdir, display_drafts etc.).
4604 * isatool usedir: option -f allows specification of the ML file to be
4605 used by Isabelle; default is ROOT.ML.
4607 * New isatool version outputs the version identifier of the Isabelle
4608 distribution being used.
4610 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4611 (containing Boolean satisfiability problems) into Isabelle/HOL
4616 New in Isabelle2004 (April 2004)
4617 --------------------------------
4621 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4622 Replaces linorder.ML.
4624 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4625 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4626 (\<a>...\<z>), are now considered normal letters, and can therefore
4627 be used anywhere where an ASCII letter (a...zA...Z) has until
4628 now. COMPATIBILITY: This obviously changes the parsing of some
4629 terms, especially where a symbol has been used as a binder, say
4630 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4631 as an identifier. Fix it by inserting a space around former
4632 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4633 existing theory and ML files.
4635 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4637 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4638 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4639 a normal (but invisible) letter. For multiple letter subscripts repeat
4640 \<^isub> like this: x\<^isub>1\<^isub>2.
4642 * Pure: There are now sub-/superscripts that can span more than one
4643 character. Text between \<^bsub> and \<^esub> is set in subscript in
4644 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4645 superscript. The new control characters are not identifier parts.
4647 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4648 content of "..." to the latex file instead of \isacntrl... . The "..."
4649 may consist of any printable characters excluding the end bracket >.
4651 * Pure: Using new Isar command "finalconsts" (or the ML functions
4652 Theory.add_finals or Theory.add_finals_i) it is now possible to
4653 declare constants "final", which prevents their being given a definition
4654 later. It is useful for constants whose behaviour is fixed axiomatically
4655 rather than definitionally, such as the meta-logic connectives.
4657 * Pure: 'instance' now handles general arities with general sorts
4658 (i.e. intersections of classes),
4660 * Presentation: generated HTML now uses a CSS style sheet to make layout
4661 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4662 It can be changed to alter the colors/layout of generated pages.
4667 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4668 cut_tac, subgoal_tac and thin_tac:
4669 - Now understand static (Isar) contexts. As a consequence, users of Isar
4670 locales are no longer forced to write Isar proof scripts.
4671 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4673 - INCOMPATIBILITY: names of variables to be instantiated may no
4674 longer be enclosed in quotes. Instead, precede variable name with `?'.
4675 This is consistent with the instantiation attribute "where".
4677 * Attributes "where" and "of":
4678 - Now take type variables of instantiated theorem into account when reading
4679 the instantiation string. This fixes a bug that caused instantiated
4680 theorems to have too special types in some circumstances.
4681 - "where" permits explicit instantiations of type variables.
4683 * Calculation commands "moreover" and "also" no longer interfere with
4684 current facts ("this"), admitting arbitrary combinations with "then"
4688 - Goal statements involving the context element "includes" no longer
4689 generate theorems with internal delta predicates (those ending on
4690 "_axioms") in the premise.
4691 Resolve particular premise with <locale>.intro to obtain old form.
4692 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4693 specification and "includes" elements in goal statement.
4694 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4695 [intro?] and [elim?] (respectively) by default.
4696 - Experimental command for instantiation of locales in proof contexts:
4697 instantiate <label>[<attrs>]: <loc>
4698 Instantiates locale <loc> and adds all its theorems to the current context
4699 taking into account their attributes. Label and attrs are optional
4700 modifiers, like in theorem declarations. If present, names of
4701 instantiated theorems are qualified with <label>, and the attributes
4702 <attrs> are applied after any attributes these theorems might have already.
4703 If the locale has assumptions, a chained fact of the form
4704 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4705 are derived. The command does not support old-style locales declared
4706 with "locale (open)".
4707 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4709 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4715 * Proof import: new image HOL4 contains the imported library from
4716 the HOL4 system with about 2500 theorems. It is imported by
4717 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4718 can be used like any other Isabelle image. See
4719 HOL/Import/HOL/README for more information.
4722 - Much improved handling of linear and partial orders.
4723 Reasoners for linear and partial orders are set up for type classes
4724 "linorder" and "order" respectively, and are added to the default simpset
4725 as solvers. This means that the simplifier can build transitivity chains
4726 to solve goals from the assumptions.
4727 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4728 of blast or auto after simplification become unnecessary because the goal
4729 is solved by simplification already.
4731 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4732 all proved in axiomatic type classes for semirings, rings and fields.
4735 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4736 now formalized using the Ring_and_Field theory mentioned above.
4737 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4738 than before, because now they are set up once in a generic manner.
4739 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4740 Look for the general versions in Ring_and_Field (and Power if they concern
4743 * Type "rat" of the rational numbers is now available in HOL-Complex.
4746 - Record types are now by default printed with their type abbreviation
4747 instead of the list of all field types. This can be configured via
4748 the reference "print_record_type_abbr".
4749 - Simproc "record_upd_simproc" for simplification of multiple updates added
4750 (not enabled by default).
4751 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4752 EX x. x = sel r to True (not enabled by default).
4753 - Tactic "record_split_simp_tac" to split and simplify records added.
4755 * 'specification' command added, allowing for definition by
4756 specification. There is also an 'ax_specification' command that
4757 introduces the new constants axiomatically.
4759 * arith(_tac) is now able to generate counterexamples for reals as well.
4761 * HOL-Algebra: new locale "ring" for non-commutative rings.
4763 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4764 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4766 * HOL-Matrix: a first theory for matrices in HOL with an application of
4767 matrix theory to linear programming.
4769 * Unions and Intersections:
4770 The latex output syntax of UN and INT has been changed
4771 from "\Union x \in A. B" to "\Union_{x \in A} B"
4772 i.e. the index formulae has become a subscript.
4773 Similarly for "\Union x. B", and for \Inter instead of \Union.
4775 * Unions and Intersections over Intervals:
4776 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4777 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4778 like in normal math, and corresponding versions for < and for intersection.
4780 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4781 lexicographic dictonary ordering has been added as "lexord".
4783 * ML: the legacy theory structures Int and List have been removed. They had
4784 conflicted with ML Basis Library structures having the same names.
4786 * 'refute' command added to search for (finite) countermodels. Only works
4787 for a fragment of HOL. The installation of an external SAT solver is
4788 highly recommended. See "HOL/Refute.thy" for details.
4790 * 'quickcheck' command: Allows to find counterexamples by evaluating
4791 formulae under an assignment of free variables to random values.
4792 In contrast to 'refute', it can deal with inductive datatypes,
4793 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4799 * Streams now come with concatenation and are part of the HOLCF image
4803 New in Isabelle2003 (May 2003)
4804 ------------------------------
4808 * Provers/simplifier:
4810 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4811 Assumptions are now subject to complete mutual simplification,
4812 not just from left to right. The simplifier now preserves
4813 the order of assumptions.
4815 Potential INCOMPATIBILITY:
4817 -- simp sometimes diverges where the old version did
4818 not, e.g. invoking simp on the goal
4820 [| P (f x); y = x; f x = f y |] ==> Q
4822 now gives rise to the infinite reduction sequence
4824 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4826 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4829 -- Tactics combining classical reasoner and simplification (such as auto)
4830 are also affected by this change, because many of them rely on
4831 simp. They may sometimes diverge as well or yield a different numbers
4832 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4833 in case of problems. Sometimes subsequent calls to the classical
4834 reasoner will fail because a preceeding call to the simplifier too
4835 eagerly simplified the goal, e.g. deleted redundant premises.
4837 - The simplifier trace now shows the names of the applied rewrite rules
4839 - You can limit the number of recursive invocations of the simplifier
4840 during conditional rewriting (where the simplifie tries to solve the
4841 conditions before applying the rewrite rule):
4842 ML "simp_depth_limit := n"
4843 where n is an integer. Thus you can force termination where previously
4844 the simplifier would diverge.
4846 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4848 - No longer aborts on failed congruence proof. Instead, the
4849 congruence is ignored.
4851 * Pure: New generic framework for extracting programs from constructive
4852 proofs. See HOL/Extraction.thy for an example instantiation, as well
4853 as HOL/Extraction for some case studies.
4855 * Pure: The main goal of the proof state is no longer shown by default, only
4856 the subgoals. This behaviour is controlled by a new flag.
4857 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4858 (ML: Proof.show_main_goal).
4860 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4861 rules whose conclusion matches subgoal 1:
4862 PG menu: Isabelle/Isar -> Show me -> matching rules
4863 The rules are ordered by how closely they match the subgoal.
4864 In particular, rules that solve a subgoal outright are displayed first
4865 (or rather last, the way they are printed).
4866 (ML: ProofGeneral.print_intros())
4868 * Pure: New flag trace_unify_fail causes unification to print
4869 diagnostic information (PG: in trace buffer) when it fails. This is
4870 useful for figuring out why single step proofs like rule, erule or
4873 * Pure: Locale specifications now produce predicate definitions
4874 according to the body of text (covering assumptions modulo local
4875 definitions); predicate "loc_axioms" covers newly introduced text,
4876 while "loc" is cumulative wrt. all included locale expressions; the
4877 latter view is presented only on export into the global theory
4878 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4879 on the old view without predicates;
4881 * Pure: predefined locales "var" and "struct" are useful for sharing
4882 parameters (as in CASL, for example); just specify something like
4883 ``var x + var y + struct M'' as import;
4885 * Pure: improved thms_containing: proper indexing of facts instead of
4886 raw theorems; check validity of results wrt. current name space;
4887 include local facts of proof configuration (also covers active
4888 locales), cover fixed variables in index; may use "_" in term
4889 specification; an optional limit for the number of printed facts may
4890 be given (the default is 40);
4892 * Pure: disallow duplicate fact bindings within new-style theory files
4895 * Provers: improved induct method: assumptions introduced by case
4896 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4897 the goal statement); "foo" still refers to all facts collectively;
4899 * Provers: the function blast.overloaded has been removed: all constants
4900 are regarded as potentially overloaded, which improves robustness in exchange
4901 for slight decrease in efficiency;
4903 * Provers/linorder: New generic prover for transitivity reasoning over
4904 linear orders. Note: this prover is not efficient!
4906 * Isar: preview of problems to finish 'show' now produce an error
4907 rather than just a warning (in interactive mode);
4914 - Produces a counter example if it cannot prove a goal.
4915 Note that the counter example may be spurious if the goal is not a formula
4916 of quantifier-free linear arithmetic.
4917 In ProofGeneral the counter example appears in the trace buffer.
4919 - Knows about div k and mod k where k is a numeral of type nat or int.
4921 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4922 linear arithmetic fails. This takes account of quantifiers and divisibility.
4923 Presburger arithmetic can also be called explicitly via presburger(_tac).
4925 * simp's arithmetic capabilities have been enhanced a bit: it now
4926 takes ~= in premises into account (by performing a case split);
4928 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4929 are distributed over a sum of terms;
4931 * New tactic "trans_tac" and method "trans" instantiate
4932 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4935 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4936 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4938 * 'typedef' command has new option "open" to suppress the set
4941 * functions Min and Max on finite sets have been introduced (theory
4944 * attribute [symmetric] now works for relations as well; it turns
4945 (x,y) : R^-1 into (y,x) : R, and vice versa;
4947 * induct over a !!-quantified statement (say !!x1..xn):
4948 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4950 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4951 %x. None. Warning: empty_def now refers to the previously hidden definition
4954 * Algebra: formalization of classical algebra. Intended as base for
4955 any algebraic development in Isabelle. Currently covers group theory
4956 (up to Sylow's theorem) and ring theory (Universal Property of
4957 Univariate Polynomials). Contributions welcome;
4959 * GroupTheory: deleted, since its material has been moved to Algebra;
4961 * Complex: new directory of the complex numbers with numeric constants,
4962 nonstandard complex numbers, and some complex analysis, standard and
4963 nonstandard (Jacques Fleuriot);
4965 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4967 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4970 * Real/HahnBanach: updated and adapted to locales;
4972 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4975 * UNITY: added the Meier-Sanders theory of progress sets;
4977 * MicroJava: bytecode verifier and lightweight bytecode verifier
4978 as abstract algorithms, instantiated to the JVM;
4980 * Bali: Java source language formalization. Type system, operational
4981 semantics, axiomatic semantics. Supported language features:
4982 classes, interfaces, objects,virtual methods, static methods,
4983 static/instance fields, arrays, access modifiers, definite
4984 assignment, exceptions.
4989 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4992 * Main ZF: virtually all theories converted to new-style format;
4997 * Pure: Tactic.prove provides sane interface for internal proofs;
4998 omits the infamous "standard" operation, so this is more appropriate
4999 than prove_goalw_cterm in many situations (e.g. in simprocs);
5001 * Pure: improved error reporting of simprocs;
5003 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5007 *** Document preparation ***
5009 * uses \par instead of \\ for line breaks in theory text. This may
5010 shift some page breaks in large documents. To get the old behaviour
5011 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5013 * minimized dependencies of isabelle.sty and isabellesym.sty on
5016 * \<euro> now needs package babel/greek instead of marvosym (which
5019 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5024 New in Isabelle2002 (March 2002)
5025 --------------------------------
5027 *** Document preparation ***
5029 * greatly simplified document preparation setup, including more
5030 graceful interpretation of isatool usedir -i/-d/-D options, and more
5031 instructive isatool mkdir; users should basically be able to get
5032 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5033 users may run a separate document processing stage manually like this:
5034 "isatool usedir -D output HOL Test && isatool document Test/output";
5036 * theory dependency graph may now be incorporated into documents;
5037 isatool usedir -g true will produce session_graph.eps/.pdf for use
5038 with \includegraphics of LaTeX;
5040 * proper spacing of consecutive markup elements, especially text
5041 blocks after section headings;
5043 * support bold style (for single symbols only), input syntax is like
5044 this: "\<^bold>\<alpha>" or "\<^bold>A";
5046 * \<bullet> is now output as bold \cdot by default, which looks much
5047 better in printed text;
5049 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5050 note that these symbols are currently unavailable in Proof General /
5051 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5053 * isatool latex no longer depends on changed TEXINPUTS, instead
5054 isatool document copies the Isabelle style files to the target
5060 * Pure/Provers: improved proof by cases and induction;
5061 - 'case' command admits impromptu naming of parameters (such as
5063 - 'induct' method divinates rule instantiation from the inductive
5064 claim; no longer requires excessive ?P bindings for proper
5065 instantiation of cases;
5066 - 'induct' method properly enumerates all possibilities of set/type
5067 rules; as a consequence facts may be also passed through *type*
5068 rules without further ado;
5069 - 'induct' method now derives symbolic cases from the *rulified*
5070 rule (before it used to rulify cases stemming from the internal
5071 atomized version); this means that the context of a non-atomic
5072 statement becomes is included in the hypothesis, avoiding the
5073 slightly cumbersome show "PROP ?case" form;
5074 - 'induct' may now use elim-style induction rules without chaining
5075 facts, using ``missing'' premises from the goal state; this allows
5076 rules stemming from inductive sets to be applied in unstructured
5077 scripts, while still benefitting from proper handling of non-atomic
5078 statements; NB: major inductive premises need to be put first, all
5079 the rest of the goal is passed through the induction;
5080 - 'induct' proper support for mutual induction involving non-atomic
5081 rule statements (uses the new concept of simultaneous goals, see
5083 - append all possible rule selections, but only use the first
5084 success (no backtracking);
5085 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5086 - undeclared rule case names default to numbers 1, 2, 3, ...;
5087 - added 'print_induct_rules' (covered by help item in recent Proof
5089 - moved induct/cases attributes to Pure, methods to Provers;
5090 - generic method setup instantiated for FOL and HOL;
5092 * Pure: support multiple simultaneous goal statements, for example
5093 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5094 meta-level mechanism, this acts as if several individual goals had
5095 been stated separately; in particular common proof methods need to be
5096 repeated in order to cover all claims; note that a single elimination
5097 step is *not* sufficient to establish the two conjunctions, so this
5100 assume "A & B" then have A and B .. (*".." fails*)
5102 better use "obtain" in situations as above; alternative refer to
5103 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5105 * Pure: proper integration with ``locales''; unlike the original
5106 version by Florian Kammller, Isar locales package high-level proof
5107 contexts rather than raw logical ones (e.g. we admit to include
5108 attributes everywhere); operations on locales include merge and
5109 rename; support for implicit arguments (``structures''); simultaneous
5110 type-inference over imports and text; see also HOL/ex/Locales.thy for
5113 * Pure: the following commands have been ``localized'', supporting a
5114 target locale specification "(in name)": 'lemma', 'theorem',
5115 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5116 stored both within the locale and at the theory level (exported and
5117 qualified by the locale name);
5119 * Pure: theory goals may now be specified in ``long'' form, with
5120 ad-hoc contexts consisting of arbitrary locale elements. for example
5121 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5122 definitions may be given, too); the result is a meta-level rule with
5123 the context elements being discharged in the obvious way;
5125 * Pure: new proof command 'using' allows to augment currently used
5126 facts after a goal statement ('using' is syntactically analogous to
5127 'apply', but acts on the goal's facts only); this allows chained facts
5128 to be separated into parts given before and after a claim, as in
5129 ``from a and b have C using d and e <proof>'';
5131 * Pure: renamed "antecedent" case to "rule_context";
5133 * Pure: new 'judgment' command records explicit information about the
5134 object-logic embedding (used by several tools internally); no longer
5135 use hard-wired "Trueprop";
5137 * Pure: added 'corollary' command;
5139 * Pure: fixed 'token_translation' command;
5141 * Pure: removed obsolete 'exported' attribute;
5143 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5144 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5145 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5147 * Pure: method 'atomize' presents local goal premises as object-level
5148 statements (atomic meta-level propositions); setup controlled via
5149 rewrite rules declarations of 'atomize' attribute; example
5150 application: 'induct' method with proper rule statements in improper
5153 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5154 now consider the syntactic context of assumptions, giving a better
5155 chance to get type-inference of the arguments right (this is
5156 especially important for locales);
5158 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5161 * Pure/obtain: the formal conclusion "thesis", being marked as
5162 ``internal'', may no longer be reference directly in the text;
5163 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5166 * Pure: generic 'sym' attribute which declares a rule both as pure
5167 'elim?' and for the 'symmetric' operation;
5169 * Pure: marginal comments ``--'' may now occur just anywhere in the
5170 text; the fixed correlation with particular command syntax has been
5173 * Pure: new method 'rules' is particularly well-suited for proof
5174 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5175 but often produces more compact proof terms with less detours;
5177 * Pure/Provers/classical: simplified integration with pure rule
5178 attributes and methods; the classical "intro?/elim?/dest?"
5179 declarations coincide with the pure ones; the "rule" method no longer
5180 includes classically swapped intros; "intro" and "elim" methods no
5181 longer pick rules from the context; also got rid of ML declarations
5182 AddXIs/AddXEs/AddXDs; all of this has some potential for
5185 * Provers/classical: attribute 'swapped' produces classical inversions
5186 of introduction rules;
5188 * Provers/simplifier: 'simplified' attribute may refer to explicit
5189 rules instead of full simplifier context; 'iff' attribute handles
5192 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5194 * HOL: 'recdef' now fails on unfinished automated proofs, use
5195 "(permissive)" option to recover old behavior;
5197 * HOL: 'inductive' no longer features separate (collective) attributes
5198 for 'intros' (was found too confusing);
5200 * HOL: properly declared induction rules less_induct and
5206 * HOL: moved over to sane numeral syntax; the new policy is as
5209 - 0 and 1 are polymorphic constants, which are defined on any
5210 numeric type (nat, int, real etc.);
5212 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5213 binary representation internally;
5215 - type nat has special constructor Suc, and generally prefers Suc 0
5216 over 1::nat and Suc (Suc 0) over 2::nat;
5218 This change may cause significant problems of INCOMPATIBILITY; here
5219 are some hints on converting existing sources:
5221 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5222 entities, so expressions involving "-" (unary or binary minus) need
5223 to be spaced properly;
5225 - existing occurrences of "1" may need to be constraint "1::nat" or
5226 even replaced by Suc 0; similar for old "2";
5228 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5230 - remove all special provisions on numerals in proofs;
5232 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5233 representation (depends on bin_arith_simps in the default context);
5235 * HOL: symbolic syntax for x^2 (numeral 2);
5237 * HOL: the class of all HOL types is now called "type" rather than
5238 "term"; INCOMPATIBILITY, need to adapt references to this type class
5239 in axclass/classes, instance/arities, and (usually rare) occurrences
5240 in typings (of consts etc.); internally the class is called
5241 "HOL.type", ML programs should refer to HOLogic.typeS;
5243 * HOL/record package improvements:
5244 - new derived operations "fields" to build a partial record section,
5245 "extend" to promote a fixed record to a record scheme, and
5246 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5247 declared as simp by default;
5248 - shared operations ("more", "fields", etc.) now need to be always
5249 qualified) --- potential INCOMPATIBILITY;
5250 - removed "make_scheme" operations (use "make" with "extend") --
5252 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5253 - provides cases/induct rules for use with corresponding Isar
5254 methods (for concrete records, record schemes, concrete more
5255 parts, and schematic more parts -- in that order);
5256 - internal definitions directly based on a light-weight abstract
5257 theory of product types over typedef rather than datatype;
5259 * HOL: generic code generator for generating executable ML code from
5260 specifications; specific support for HOL constructs such as inductive
5261 datatypes and sets, as well as recursive functions; can be invoked
5262 via 'generate_code' theory section;
5264 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5266 * HOL: consolidated and renamed several theories. In particular:
5267 Ord.thy has been absorbed into HOL.thy
5268 String.thy has been absorbed into List.thy
5270 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5271 (beware of argument permutation!);
5273 * HOL: linorder_less_split superseded by linorder_cases;
5275 * HOL/List: "nodups" renamed to "distinct";
5277 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5278 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5279 - Ex_def has changed, now need to use some_eq_ex
5281 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5282 in this (rare) case use:
5284 delSWrapper "split_all_tac"
5285 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5287 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5290 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5291 Isabelle's type classes, ^ on functions and relations has too general
5292 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5293 necessary to attach explicit type constraints;
5295 * HOL/Relation: the prefix name of the infix "O" has been changed from
5296 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5297 renamed accordingly (eg "compI" -> "rel_compI").
5299 * HOL: syntax translations now work properly with numerals and records
5302 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5303 of "lam" -- INCOMPATIBILITY;
5305 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5306 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5307 renamed "Product_Type.unit";
5309 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5311 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5312 the "cases" method);
5314 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5317 * HOL/IMP: updated and converted to new-style theory format; several
5318 parts turned into readable document, with proper Isar proof texts and
5319 some explanations (by Gerwin Klein);
5321 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5323 * HOL-Hyperreal is now a logic image;
5328 * Isar: consts/constdefs supports mixfix syntax for continuous
5331 * Isar: domain package adapted to new-style theory format, e.g. see
5334 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5335 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5336 lift.induct_tac, always use UU instead of Undef;
5338 * HOLCF/IMP: updated and converted to new-style theory;
5343 * Isar: proper integration of logic-specific tools and packages,
5344 including theory commands '(co)inductive', '(co)datatype',
5345 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5346 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5348 * theory Main no longer includes AC; for the Axiom of Choice, base
5349 your theory on Main_ZFC;
5351 * the integer library now covers quotients and remainders, with many
5352 laws relating division to addition, multiplication, etc.;
5354 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5355 typeless version of the formalism;
5357 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5360 * ZF/Induct: new directory for examples of inductive definitions,
5361 including theory Multiset for multiset orderings; converted to
5362 new-style theory format;
5364 * ZF: many new theorems about lists, ordinals, etc.;
5369 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5370 variable proof controls level of detail: 0 = no proofs (only oracle
5371 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5372 also ref manual for further ML interfaces;
5374 * Pure/axclass: removed obsolete ML interface
5375 goal_subclass/goal_arity;
5377 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5378 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5379 separate tokens, so expressions involving minus need to be spaced
5382 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5383 rather than "infixl" or "infixr";
5385 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5386 sort constraint specifications in type inference; e.g. "x::_::foo"
5387 ensures that the type of "x" is of sort "foo" (but not necessarily a
5390 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5391 control output of nested => (types); the default behavior is
5394 * Pure/syntax: builtin parse translation for "_constify" turns valued
5395 tokens into AST constants;
5397 * Pure/syntax: prefer later declarations of translations and print
5398 translation functions; potential INCOMPATIBILITY: need to reverse
5399 multiple declarations for same syntax element constant;
5401 * Pure/show_hyps reset by default (in accordance to existing Isar
5404 * Provers/classical: renamed addaltern to addafter, addSaltern to
5407 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5410 * system: tested support for MacOS X; should be able to get Isabelle +
5411 Proof General to work in a plain Terminal after installing Poly/ML
5412 (e.g. from the Isabelle distribution area) and GNU bash alone
5413 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5414 support requires further installations, e.g. from
5415 http://fink.sourceforge.net/);
5417 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5419 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5420 of 40 MB), cf. ML_OPTIONS;
5422 * system: Proof General keywords specification is now part of the
5423 Isabelle distribution (see etc/isar-keywords.el);
5425 * system: support for persistent Proof General sessions (refrain from
5426 outdating all loaded theories on startup); user may create writable
5427 logic images like this: ``isabelle -q HOL Test'';
5429 * system: smart selection of Isabelle process versus Isabelle
5430 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5431 run both "isabelle" and "Isabelle" even if file names are badly
5432 damaged (executable inspects the case of the first letter of its own
5433 name); added separate "isabelle-process" and "isabelle-interface";
5435 * system: refrain from any attempt at filtering input streams; no
5436 longer support ``8bit'' encoding of old isabelle font, instead proper
5437 iso-latin characters may now be used; the related isatools
5438 "symbolinput" and "nonascii" have disappeared as well;
5440 * system: removed old "xterm" interface (the print modes "xterm" and
5441 "xterm_color" are still available for direct use in a suitable
5446 New in Isabelle99-2 (February 2001)
5447 -----------------------------------
5449 *** Overview of INCOMPATIBILITIES ***
5451 * HOL: please note that theories in the Library and elsewhere often use the
5452 new-style (Isar) format; to refer to their theorems in an ML script you must
5453 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5455 * HOL: inductive package no longer splits induction rule aggressively,
5456 but only as far as specified by the introductions given; the old
5457 format may be recovered via ML function complete_split_rule or attribute
5458 'split_rule (complete)';
5460 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5461 gfp_Tarski to gfp_unfold;
5463 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5465 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5466 relation); infix "^^" has been renamed "``"; infix "``" has been
5467 renamed "`"; "univalent" has been renamed "single_valued";
5469 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5472 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5474 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5476 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5477 consequence, it is no longer monotonic wrt. the local goal context
5478 (which is now passed through the inductive cases);
5480 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5481 \<gg> to \<ggreater>;
5484 *** Document preparation ***
5486 * \isabellestyle{NAME} selects version of Isabelle output (currently
5487 available: are "it" for near math-mode best-style output, "sl" for
5488 slanted text style, and "tt" for plain type-writer; if no
5489 \isabellestyle command is given, output is according to slanted
5492 * support sub/super scripts (for single symbols only), input syntax is
5493 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5495 * some more standard symbols; see Appendix A of the system manual for
5496 the complete list of symbols defined in isabellesym.sty;
5498 * improved isabelle style files; more abstract symbol implementation
5499 (should now use \isamath{...} and \isatext{...} in custom symbol
5502 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5503 state; Note that presentation of goal states does not conform to
5504 actual human-readable proof documents. Please do not include goal
5505 states into document output unless you really know what you are doing!
5507 * proper indentation of antiquoted output with proportional LaTeX
5510 * no_document ML operator temporarily disables LaTeX document
5513 * isatool unsymbolize tunes sources for plain ASCII communication;
5518 * Pure: Isar now suffers initial goal statements to contain unbound
5519 schematic variables (this does not conform to actual readable proof
5520 documents, due to unpredictable outcome and non-compositional proof
5521 checking); users who know what they are doing may use schematic goals
5522 for Prolog-style synthesis of proven results;
5524 * Pure: assumption method (an implicit finishing) now handles actual
5527 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5528 initial goal, declare "that" only as Pure intro (only for single
5529 steps); the "that" rule assumption may now be involved in implicit
5530 finishing, thus ".." becomes a feasible for trivial obtains;
5532 * Pure: default proof step now includes 'intro_classes'; thus trivial
5533 instance proofs may be performed by "..";
5535 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5538 * Pure: more robust selection of calculational rules;
5540 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5541 rule (as well as the assumption rule);
5543 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5544 lemmas, using the graph browser tool;
5546 * Pure: predict failure of "show" in interactive mode;
5548 * Pure: 'thms_containing' now takes actual terms as arguments;
5550 * HOL: improved method 'induct' --- now handles non-atomic goals
5551 (potential INCOMPATIBILITY); tuned error handling;
5553 * HOL: cases and induct rules now provide explicit hints about the
5554 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5555 any remaining facts are inserted into the goal verbatim;
5557 * HOL: local contexts (aka cases) may now contain term bindings as
5558 well; the 'cases' and 'induct' methods new provide a ?case binding for
5559 the result to be shown in each case;
5561 * HOL: added 'recdef_tc' command;
5563 * isatool convert assists in eliminating legacy ML scripts;
5568 * HOL/Library: a collection of generic theories to be used together
5569 with main HOL; the theory loader path already includes this directory
5570 by default; the following existing theories have been moved here:
5571 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5572 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5574 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5575 modelling and verification task performed in Isabelle/HOL +
5576 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5578 * HOL/Algebra: special summation operator SUM no longer exists, it has
5579 been replaced by setsum; infix 'assoc' now has priority 50 (like
5580 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5581 'domain', this makes the theory consistent with mathematical
5584 * HOL basics: added overloaded operations "inverse" and "divide"
5585 (infix "/"), syntax for generic "abs" operation, generic summation
5588 * HOL/typedef: simplified package, provide more useful rules (see also
5591 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5592 now expressed as a proper nested rule (old-style tactic scripts may
5593 require atomize_strip_tac to cope with non-atomic premises);
5595 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5596 to "split_conv" (old name still available for compatibility);
5598 * HOL: improved concrete syntax for strings (e.g. allows translation
5599 rules with string literals);
5601 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5602 and Fleuriot's mechanization of analysis, including the transcendental
5603 functions for the reals;
5605 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5610 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5611 "lam" is displayed as TWO lambda-symbols
5613 * CTT: theory Main now available, containing everything (that is, Bool
5619 * Pure: the Simplifier has been implemented properly as a derived rule
5620 outside of the actual kernel (at last!); the overall performance
5621 penalty in practical applications is about 50%, while reliability of
5622 the Isabelle inference kernel has been greatly improved;
5624 * print modes "brackets" and "no_brackets" control output of nested =>
5625 (types) and ==> (props); the default behaviour is "brackets";
5627 * Provers: fast_tac (and friends) now handle actual object-logic rules
5628 as assumptions as well;
5630 * system: support Poly/ML 4.0;
5632 * system: isatool install handles KDE version 1 or 2;
5636 New in Isabelle99-1 (October 2000)
5637 ----------------------------------
5639 *** Overview of INCOMPATIBILITIES ***
5641 * HOL: simplification of natural numbers is much changed; to partly
5642 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5643 issue the following ML commands:
5645 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5646 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5648 * HOL: simplification no longer dives into case-expressions; this is
5649 controlled by "t.weak_case_cong" for each datatype t;
5651 * HOL: nat_less_induct renamed to less_induct;
5653 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5654 fixsome to patch .thy and .ML sources automatically;
5656 select_equality -> some_equality
5657 select_eq_Ex -> some_eq_ex
5658 selectI2EX -> someI2_ex
5661 select1_equality -> some1_equality
5662 Eps_sym_eq -> some_sym_eq_trivial
5663 Eps_eq -> some_eq_trivial
5665 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5667 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5670 * HOL: the recursion equations generated by 'recdef' are now called
5671 f.simps instead of f.rules;
5673 * HOL: qed_spec_mp now also handles bounded ALL as well;
5675 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5676 sometimes be needed;
5678 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5680 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5682 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5683 product is now "<*>" instead of "Times"; the lexicographic product is
5684 now "<*lex*>" instead of "**";
5686 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5687 of main HOL, but was unused); better use HOL's datatype package;
5689 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5690 the old syntax may be recovered as follows:
5693 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5694 (infixl "\\<oplus>" 100)
5696 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5698 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5699 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5702 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5703 changed from A/r to A//r;
5705 * ZF: new treatment of arithmetic (nat & int) may break some old
5708 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5709 rulify -> rule_format, elimify -> elim_format, ...);
5711 * Isar/Provers: intro/elim/dest attributes changed; renamed
5712 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5713 should have to change intro!! to intro? only); replaced "delrule" by
5716 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5718 * Provers: strengthened force_tac by using new first_best_tac;
5720 * LaTeX document preparation: several changes of isabelle.sty (see
5724 *** Document preparation ***
5726 * formal comments (text blocks etc.) in new-style theories may now
5727 contain antiquotations of thm/prop/term/typ/text to be presented
5728 according to latex print mode; concrete syntax is like this:
5729 @{term[show_types] "f(x) = a + x"};
5731 * isatool mkdir provides easy setup of Isabelle session directories,
5732 including proper document sources;
5734 * generated LaTeX sources are now deleted after successful run
5735 (isatool document -c); may retain a copy somewhere else via -D option
5738 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5739 style files, achieving self-contained LaTeX sources and simplifying
5742 * old-style theories now produce (crude) LaTeX output as well;
5744 * browser info session directories are now self-contained (may be put
5745 on WWW server seperately); improved graphs of nested sessions; removed
5746 graph for 'all sessions';
5748 * several improvements in isabelle style files; \isabellestyle{it}
5749 produces fake math mode output; \isamarkupheader is now \section by
5750 default; see lib/texinputs/isabelle.sty etc.;
5755 * Isar/Pure: local results and corresponding term bindings are now
5756 subject to Hindley-Milner polymorphism (similar to ML); this
5757 accommodates incremental type-inference very nicely;
5759 * Isar/Pure: new derived language element 'obtain' supports
5760 generalized existence reasoning;
5762 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5763 support accumulation of results, without applying any rules yet;
5764 useful to collect intermediate results without explicit name
5765 references, and for use with transitivity rules with more than 2
5768 * Isar/Pure: scalable support for case-analysis type proofs: new
5769 'case' language element refers to local contexts symbolically, as
5770 produced by certain proof methods; internally, case names are attached
5771 to theorems as "tags";
5773 * Isar/Pure: theory command 'hide' removes declarations from
5774 class/type/const name spaces;
5776 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5777 indicate potential overloading;
5779 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5781 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5782 "{a,b,c}" instead of {a,b,c};
5784 * Isar/Pure now provides its own version of intro/elim/dest
5785 attributes; useful for building new logics, but beware of confusion
5786 with the version in Provers/classical;
5788 * Isar/Pure: the local context of (non-atomic) goals is provided via
5789 case name 'antecedent';
5791 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5792 to the current context is now done automatically);
5794 * Isar/Pure: theory command 'method_setup' provides a simple interface
5795 for definining proof methods in ML;
5797 * Isar/Provers: intro/elim/dest attributes changed; renamed
5798 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5799 most cases, one should have to change intro!! to intro? only);
5800 replaced "delrule" by "rule del";
5802 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5803 'symmetric' attribute (the latter supercedes [RS sym]);
5805 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5806 method modifier); 'simp' method: 'only:' modifier removes loopers as
5807 well (including splits);
5809 * Isar/Provers: Simplifier and Classical methods now support all kind
5810 of modifiers used in the past, including 'cong', 'iff', etc.
5812 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5813 of Simplifier and Classical reasoner);
5815 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5816 now support named cases; major packages (inductive, datatype, primrec,
5817 recdef) support case names and properly name parameters;
5819 * Isar/HOL: new transitivity rules for substitution in inequalities --
5820 monotonicity conditions are extracted to be proven at end of
5823 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5826 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5827 split_if split_if_asm; datatype package provides theorems foo.splits =
5828 foo.split foo.split_asm for each datatype;
5830 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5831 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5832 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5833 use "(cases (simplified))" method in proper proof texts);
5835 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5837 * Isar: names of theorems etc. may be natural numbers as well;
5839 * Isar: 'pr' command: optional arguments for goals_limit and
5840 ProofContext.prems_limit; no longer prints theory contexts, but only
5843 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5844 additional print modes to be specified; e.g. "pr(latex)" will print
5845 proof state according to the Isabelle LaTeX style;
5847 * Isar: improved support for emulating tactic scripts, including proof
5848 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5849 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5850 (for HOL datatypes);
5852 * Isar: simplified (more robust) goal selection of proof methods: 1st
5853 goal, all goals, or explicit goal specifier (tactic emulation); thus
5854 'proof method scripts' have to be in depth-first order;
5856 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5858 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5859 should instead use individual commands for printing items
5860 (print_commands, print_methods etc.);
5862 * Isar: added 'nothing' --- the empty list of theorems;
5867 * HOL/MicroJava: formalization of a fragment of Java, together with a
5868 corresponding virtual machine and a specification of its bytecode
5869 verifier and a lightweight bytecode verifier, including proofs of
5870 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5871 Cornelia Pusch (see also the homepage of project Bali at
5872 http://isabelle.in.tum.de/Bali/);
5874 * HOL/Algebra: new theory of rings and univariate polynomials, by
5877 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5878 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5881 * HOL/Lattice: fundamental concepts of lattice theory and order
5882 structures, including duals, properties of bounds versus algebraic
5883 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5884 Theorem for complete lattices etc.; may also serve as a demonstration
5885 for abstract algebraic reasoning using axiomatic type classes, and
5886 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5888 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5891 * HOL/IMPP: extension of IMP with local variables and mutually
5892 recursive procedures, by David von Oheimb;
5894 * HOL/Lambda: converted into new-style theory and document;
5896 * HOL/ex/Multiquote: example of multiple nested quotations and
5897 anti-quotations -- basically a generalized version of de-Bruijn
5898 representation; very useful in avoiding lifting of operations;
5900 * HOL/record: added general record equality rule to simpset; fixed
5901 select-update simplification procedure to handle extended records as
5902 well; admit "r" as field name;
5904 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5905 other numeric types and also as the identity of groups, rings, etc.;
5907 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5908 Types nat and int belong to this axclass;
5910 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5911 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5912 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5913 two terms #m*u and #n*u are replaced by #(m+n)*u
5914 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5915 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5916 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5918 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5919 powerful prover for predicate logic but knows nothing of clasets; see
5920 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5922 * HOL: new version of "case_tac" subsumes both boolean case split and
5923 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5924 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5926 * HOL: simplification no longer dives into case-expressions: only the
5927 selector expression is simplified, but not the remaining arms; to
5928 enable full simplification of case-expressions for datatype t, you may
5929 remove t.weak_case_cong from the simpset, either globally (Delcongs
5930 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5932 * HOL/recdef: the recursion equations generated by 'recdef' for
5933 function 'f' are now called f.simps instead of f.rules; if all
5934 termination conditions are proved automatically, these simplification
5935 rules are added to the simpset, as in primrec; rules may be named
5936 individually as well, resulting in a separate list of theorems for
5939 * HOL/While is a new theory that provides a while-combinator. It
5940 permits the definition of tail-recursive functions without the
5941 provision of a termination measure. The latter is necessary once the
5942 invariant proof rule for while is applied.
5944 * HOL: new (overloaded) notation for the set of elements below/above
5945 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5947 * HOL: theorems impI, allI, ballI bound as "strip";
5949 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5950 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5951 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5953 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5955 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5956 main HOL, but was unused);
5958 * HOL: fewer consts declared as global (e.g. have to refer to
5959 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5961 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5962 in case of overlap with user translations (e.g. judgements over
5963 tuples); (note that the underlying logical represenation is still
5969 * ZF: simplification automatically cancels common terms in arithmetic
5970 expressions over nat and int;
5972 * ZF: new treatment of nat to minimize type-checking: all operators
5973 coerce their operands to a natural number using the function natify,
5974 making the algebraic laws unconditional;
5976 * ZF: as above, for int: operators coerce their operands to an integer
5977 using the function intify;
5979 * ZF: the integer library now contains many of the usual laws for the
5980 orderings, including $<=, and monotonicity laws for $+ and $*;
5982 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5985 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5986 to the simplifier and classical reasoner simultaneously;
5991 * Provers: blast_tac now handles actual object-logic rules as
5992 assumptions; note that auto_tac uses blast_tac internally as well;
5994 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5995 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5997 * Provers: delrules now handles destruct rules as well (no longer need
5998 explicit make_elim);
6000 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6001 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6002 use instead the strong form,
6003 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6004 in HOL, FOL and ZF the function cla_make_elim will create such rules
6005 from destruct-rules;
6007 * Provers: Simplifier.easy_setup provides a fast path to basic
6008 Simplifier setup for new object-logics;
6010 * Pure: AST translation rules no longer require constant head on LHS;
6012 * Pure: improved name spaces: ambiguous output is qualified; support
6013 for hiding of names;
6015 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6016 XSYMBOL_HOME; no longer need to do manual configuration in most
6019 * system: compression of ML heaps images may now be controlled via -c
6020 option of isabelle and isatool usedir (currently only observed by
6023 * system: isatool installfonts may handle X-Symbol fonts as well (very
6024 useful for remote X11);
6026 * system: provide TAGS file for Isabelle sources;
6028 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6031 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6032 timing flag supersedes proof_timing and Toplevel.trace;
6034 * ML: new combinators |>> and |>>> for incremental transformations
6035 with secondary results (e.g. certain theory extensions):
6037 * ML: PureThy.add_defs gets additional argument to indicate potential
6038 overloading (usually false);
6040 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6045 New in Isabelle99 (October 1999)
6046 --------------------------------
6048 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6050 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6051 are no longer simplified. (This allows the simplifier to unfold recursive
6052 functional programs.) To restore the old behaviour, declare
6054 Delcongs [if_weak_cong];
6056 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6059 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6061 * HOL/datatype: mutual_induct_tac no longer exists --
6062 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6064 * HOL/typedef: fixed type inference for representing set; type
6065 arguments now have to occur explicitly on the rhs as type constraints;
6067 * ZF: The con_defs part of an inductive definition may no longer refer
6068 to constants declared in the same theory;
6070 * HOL, ZF: the function mk_cases, generated by the inductive
6071 definition package, has lost an argument. To simplify its result, it
6072 uses the default simpset instead of a supplied list of theorems.
6074 * HOL/List: the constructors of type list are now Nil and Cons;
6076 * Simplifier: the type of the infix ML functions
6077 setSSolver addSSolver setSolver addSolver
6078 is now simpset * solver -> simpset where `solver' is a new abstract type
6079 for packaging solvers. A solver is created via
6080 mk_solver: string -> (thm list -> int -> tactic) -> solver
6081 where the string argument is only a comment.
6086 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6087 decision procedure for linear arithmetic. Currently it is used for
6088 types `nat', `int', and `real' in HOL (see below); it can, should and
6089 will be instantiated for other types and logics as well.
6091 * The simplifier now accepts rewrite rules with flexible heads, eg
6092 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6093 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6099 * New Isabelle/Isar subsystem provides an alternative to traditional
6100 tactical theorem proving; together with the ProofGeneral/isar user
6101 interface it offers an interactive environment for developing human
6102 readable proof documents (Isar == Intelligible semi-automated
6103 reasoning); for further information see isatool doc isar-ref,
6104 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6106 * improved and simplified presentation of theories: better HTML markup
6107 (including colors), graph views in several sizes; isatool usedir now
6108 provides a proper interface for user theories (via -P option); actual
6109 document preparation based on (PDF)LaTeX is available as well (for
6110 new-style theories only); see isatool doc system for more information;
6112 * native support for Proof General, both for classic Isabelle and
6115 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6116 using the graph browser tool;
6118 * Isabelle manuals now also available as PDF;
6120 * theory loader rewritten from scratch (may not be fully
6121 bug-compatible); old loadpath variable has been replaced by show_path,
6122 add_path, del_path, reset_path functions; new operations such as
6123 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6126 * improved isatool install: option -k creates KDE application icon,
6127 option -p DIR installs standalone binaries;
6129 * added ML_PLATFORM setting (useful for cross-platform installations);
6130 more robust handling of platform specific ML images for SML/NJ;
6132 * the settings environment is now statically scoped, i.e. it is never
6133 created again in sub-processes invoked from isabelle, isatool, or
6136 * path element specification '~~' refers to '$ISABELLE_HOME';
6138 * in locales, the "assumes" and "defines" parts may be omitted if
6141 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6144 * new print_mode "HTML";
6146 * new flag show_tags controls display of tags of theorems (which are
6147 basically just comments that may be attached by some tools);
6149 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6150 mode and goal output format:
6152 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6154 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6156 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6157 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6159 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6161 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6163 * function bind_thms stores lists of theorems (cf. bind_thm);
6165 * new shorthand tactics ftac, eatac, datac, fatac;
6167 * qed (and friends) now accept "" as result name; in that case the
6168 theorem is not stored, but proper checks and presentation of the
6171 * theorem database now also indexes constants "Trueprop", "all",
6172 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6177 ** HOL arithmetic **
6179 * There are now decision procedures for linear arithmetic over nat and
6182 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6183 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6184 are treated as atomic; subformulae not involving type `nat' or `int'
6185 are ignored; quantified subformulae are ignored unless they are
6186 positive universal or negative existential. The tactic has to be
6187 invoked by hand and can be a little bit slow. In particular, the
6188 running time is exponential in the number of occurrences of `min' and
6189 `max', and `-' on `nat'.
6191 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6192 (negated) (in)equalities among the premises and the conclusion into
6193 account (i.e. no compound formulae) and does not know about `min' and
6194 `max', and `-' on `nat'. It is fast and is used automatically by the
6197 NB: At the moment, these decision procedures do not cope with mixed
6198 nat/int formulae where the two parts interact, such as `m < n ==>
6201 * HOL/Numeral provides a generic theory of numerals (encoded
6202 efficiently as bit strings); setup for types nat/int/real is in place;
6203 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6204 int, existing theories and proof scripts may require a few additional
6207 * integer division and remainder can now be performed on constant
6210 * many properties of integer multiplication, division and remainder
6213 * An interface to the Stanford Validity Checker (SVC) is available through the
6214 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6215 are proved automatically. SVC must be installed separately, and its results
6216 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6217 invocation of the underlying oracle). For SVC see
6218 http://verify.stanford.edu/SVC
6220 * IsaMakefile: the HOL-Real target now builds an actual image;
6225 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6226 (in Isabelle/Isar) -- by Gertrud Bauer;
6228 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6229 analysis for assembly languages with subtypes;
6231 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6232 -- avoids syntactic ambiguities and treats state, transition, and
6233 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6234 changed syntax and (many) tactics;
6236 * HOL/inductive: Now also handles more general introduction rules such
6237 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6238 theorems are now maintained within the theory (maintained via the
6241 * HOL/datatype: Now also handles arbitrarily branching datatypes
6242 (using function types) such as
6244 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6246 * HOL/record: record_simproc (part of the default simpset) takes care
6247 of selectors applied to updated records; record_split_tac is no longer
6248 part of the default claset; update_defs may now be removed from the
6249 simpset in many cases; COMPATIBILITY: old behavior achieved by
6251 claset_ref () := claset() addSWrapper record_split_wrapper;
6252 Delsimprocs [record_simproc]
6254 * HOL/typedef: fixed type inference for representing set; type
6255 arguments now have to occur explicitly on the rhs as type constraints;
6257 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6258 names rather than an ML expression;
6260 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6261 supplied later. Program schemes can be defined, such as
6262 "While B C s = (if B s then While B C (C s) else s)"
6263 where the well-founded relation can be chosen after B and C have been given.
6265 * HOL/List: the constructors of type list are now Nil and Cons;
6266 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6267 course, ML tools referring to List.list.op # etc. have to be adapted;
6269 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6270 disabled by default; run isabelle with option -m HOL to get back to
6271 the original Gordon/HOL-style output;
6273 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6274 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6276 * HOL basic syntax simplified (more orthogonal): all variants of
6277 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6278 Eps operator is provided as well: "SOME x. P[x]";
6280 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6282 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6283 thus available for user theories;
6285 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6286 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6289 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6290 several times and then mp;
6295 * the notation <<...>> is now available as a notation for sequences of
6298 * the simplifier is now installed
6300 * the axiom system has been generalized (thanks to Soren Heilmann)
6302 * the classical reasoner now has a default rule database
6307 * new primrec section allows primitive recursive functions to be given
6308 directly (as in HOL) over datatypes and the natural numbers;
6310 * new tactics induct_tac and exhaust_tac for induction (or case
6311 analysis) over datatypes and the natural numbers;
6313 * the datatype declaration of type T now defines the recursor T_rec;
6315 * simplification automatically does freeness reasoning for datatype
6318 * automatic type-inference, with AddTCs command to insert new
6319 type-checking rules;
6321 * datatype introduction rules are now added as Safe Introduction rules
6324 * the syntax "if P then x else y" is now available in addition to
6328 *** Internal programming interfaces ***
6330 * tuned simplifier trace output; new flag debug_simp;
6332 * structures Vartab / Termtab (instances of TableFun) offer efficient
6333 tables indexed by indexname_ord / term_ord (compatible with aconv);
6335 * AxClass.axclass_tac lost the theory argument;
6337 * tuned current_goals_markers semantics: begin / end goal avoids
6338 printing empty lines;
6340 * removed prs and prs_fn hook, which was broken because it did not
6341 include \n in its semantics, forcing writeln to add one
6342 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6343 string -> unit if you really want to output text without newline;
6345 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6346 plain output, interface builders may have to enable 'isabelle_font'
6347 mode to get Isabelle font glyphs as before;
6349 * refined token_translation interface; INCOMPATIBILITY: output length
6350 now of type real instead of int;
6352 * theory loader actions may be traced via new ThyInfo.add_hook
6353 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6354 your own database of information attached to *whole* theories -- as
6355 opposed to intra-theory data slots offered via TheoryDataFun;
6357 * proper handling of dangling sort hypotheses (at last!);
6358 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6359 extra sort hypotheses that can be witnessed from the type signature;
6360 the force_strip_shyps flag is gone, any remaining shyps are simply
6361 left in the theorem (with a warning issued by strip_shyps_warning);
6365 New in Isabelle98-1 (October 1998)
6366 ----------------------------------
6368 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6370 * several changes of automated proof tools;
6372 * HOL: major changes to the inductive and datatype packages, including
6373 some minor incompatibilities of theory syntax;
6375 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6378 * HOL: removed duplicate thms in Arith:
6379 less_imp_add_less should be replaced by trans_less_add1
6380 le_imp_add_le should be replaced by trans_le_add1
6382 * HOL: unary minus is now overloaded (new type constraints may be
6385 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6386 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6387 now taken as an integer constant.
6389 * Pure: ML function 'theory_of' renamed to 'theory';
6395 1. Asm_full_simp_tac is now more aggressive.
6396 1. It will sometimes reorient premises if that increases their power to
6398 2. It does no longer proceed strictly from left to right but may also
6399 rotate premises to achieve further simplification.
6400 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6401 old Asm_full_simp_tac in that it does not rotate premises.
6402 2. The simplifier now knows a little bit about nat-arithmetic.
6404 * Classical reasoner: wrapper mechanism for the classical reasoner now
6405 allows for selected deletion of wrappers, by introduction of names for
6406 wrapper functionals. This implies that addbefore, addSbefore,
6407 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6408 and that adding two tactics with the same name overwrites the first
6409 one (emitting a warning).
6410 type wrapper = (int -> tactic) -> (int -> tactic)
6411 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6412 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6413 delWrapper, delSWrapper: claset * string -> claset
6414 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6416 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6417 semantics; addbefore now affects only the unsafe part of step_tac
6418 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6419 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6422 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6423 compWrapper; added safe wrapper (and access functions for it);
6425 * HOL/split_all_tac is now much faster and fails if there is nothing
6426 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6427 and the names of the automatically generated variables have changed.
6428 split_all_tac has moved within claset() from unsafe wrappers to safe
6429 wrappers, which means that !!-bound variables are split much more
6430 aggressively, and safe_tac and clarify_tac now split such variables.
6431 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6432 Note: the same holds for record_split_tac, which does the job of
6433 split_all_tac for record fields.
6435 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6436 permanently to the default simpset using Addsplits just like
6437 Addsimps. They can be removed via Delsplits just like
6438 Delsimps. Lower-case versions are also available.
6440 * HOL/Simplifier: The rule split_if is now part of the default
6441 simpset. This means that the simplifier will eliminate all occurrences
6442 of if-then-else in the conclusion of a goal. To prevent this, you can
6443 either remove split_if completely from the default simpset by
6444 `Delsplits [split_if]' or remove it in a specific call of the
6445 simplifier using `... delsplits [split_if]'. You can also add/delete
6446 other case splitting rules to/from the default simpset: every datatype
6447 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6448 t is the name of the datatype).
6450 * Classical reasoner / Simplifier combination: new force_tac (and
6451 derivatives Force_tac, force) combines rewriting and classical
6452 reasoning (and whatever other tools) similarly to auto_tac, but is
6453 aimed to solve the given subgoal completely.
6458 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6459 and `goalw': the theory is no longer needed as an explicit argument -
6460 the current theory context is used; assumptions are no longer returned
6461 at the ML-level unless one of them starts with ==> or !!; it is
6462 recommended to convert to these new commands using isatool fixgoal
6463 (backup your sources first!);
6465 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6466 the current theory context, and 'theory' to lookup stored theories;
6468 * new theory section 'locale' for declaring constants, assumptions and
6469 definitions that have local scope;
6471 * new theory section 'nonterminals' for purely syntactic types;
6473 * new theory section 'setup' for generic ML setup functions
6474 (e.g. package initialization);
6476 * the distribution now includes Isabelle icons: see
6477 lib/logo/isabelle-{small,tiny}.xpm;
6479 * isatool install - install binaries with absolute references to
6482 * isatool logo -- create instances of the Isabelle logo (as EPS);
6484 * print mode 'emacs' reserved for Isamode;
6486 * support multiple print (ast) translations per constant name;
6488 * theorems involving oracles are now printed with a suffixed [!];
6493 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6495 * HOL/inductive package reorganized and improved: now supports mutual
6501 oddI "n : EVEN ==> Suc n : ODD"
6502 evenI "n : ODD ==> Suc n : EVEN"
6504 new theorem list "elims" contains an elimination rule for each of the
6505 recursive sets; inductive definitions now handle disjunctive premises
6506 correctly (also ZF);
6508 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6509 "mutual_induct" no longer exists - the induction rule is always
6510 contained in "induct";
6513 * HOL/datatype package re-implemented and greatly improved: now
6514 supports mutually recursive datatypes such as
6517 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6518 | SUM ('a aexp) ('a aexp)
6519 | DIFF ('a aexp) ('a aexp)
6522 'a bexp = LESS ('a aexp) ('a aexp)
6523 | AND ('a bexp) ('a bexp)
6524 | OR ('a bexp) ('a bexp)
6526 as well as indirectly recursive datatypes such as
6529 ('a, 'b) term = Var 'a
6530 | App 'b ((('a, 'b) term) list)
6532 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6533 induction on mutually / indirectly recursive datatypes.
6535 Primrec equations are now stored in theory and can be accessed via
6536 <function_name>.simps.
6540 - Theories using datatypes must now have theory Datatype as an
6542 - The specific <typename>.induct_tac no longer exists - use the
6543 generic induct_tac instead.
6544 - natE has been renamed to nat.exhaust - use exhaust_tac
6545 instead of res_inst_tac ... natE. Note that the variable
6546 names in nat.exhaust differ from the names in natE, this
6547 may cause some "fragile" proofs to fail.
6548 - The theorems split_<typename>_case and split_<typename>_case_asm
6549 have been renamed to <typename>.split and <typename>.split_asm.
6550 - Since default sorts of type variables are now handled correctly,
6551 some datatype definitions may have to be annotated with explicit
6553 - Primrec definitions no longer require function name and type
6554 of recursive argument.
6556 Consider using isatool fixdatatype to adapt your theories and proof
6557 scripts to the new package (backup your sources first!).
6560 * HOL/record package: considerably improved implementation; now
6561 includes concrete syntax for record types, terms, updates; theorems
6562 for surjective pairing and splitting !!-bound record variables; proof
6563 support is as follows:
6565 1) standard conversions (selectors or updates applied to record
6566 constructor terms) are part of the standard simpset;
6568 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6569 made part of standard simpset and claset via addIffs;
6571 3) a tactic for record field splitting (record_split_tac) is part of
6572 the standard claset (addSWrapper);
6574 To get a better idea about these rules you may retrieve them via
6575 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6576 the name of your record type.
6578 The split tactic 3) conceptually simplifies by the following rule:
6580 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6582 Thus any record variable that is bound by meta-all will automatically
6583 blow up into some record constructor term, consequently the
6584 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6585 solve record problems automatically.
6588 * reorganized the main HOL image: HOL/Integ and String loaded by
6589 default; theory Main includes everything;
6591 * automatic simplification of integer sums and comparisons, using cancellation;
6593 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6595 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6597 * many new identities for unions, intersections, set difference, etc.;
6599 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6600 called split_if, split_split, split_sum_case and split_nat_case (to go
6601 with add/delsplits);
6603 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6604 (?x::unit) = (); this is made part of the default simpset, which COULD
6605 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6606 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6607 unit_abs_eta_conv is added in order to counter the effect of
6608 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6611 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6614 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6615 It and 'sym RS equals0D' are now in the default claset, giving automatic
6616 disjointness reasoning but breaking a few old proofs.
6618 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6619 to 'converse' from 'inverse' (for compatibility with ZF and some
6622 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6623 the well-founded relation;
6625 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6626 Compl A. The "Compl" syntax remains available as input syntax for this
6629 * HOL/Update: new theory of function updates:
6630 f(a:=b) == %x. if x=a then b else f x
6631 may also be iterated as in f(a:=b,c:=d,...);
6633 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6636 - new function list_update written xs[i:=v] that updates the i-th
6637 list position. May also be iterated as in xs[i:=a,j:=b,...].
6638 - new function `upt' written [i..j(] which generates the list
6639 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6640 bound write [i..j], which is a shorthand for [i..j+1(].
6641 - new lexicographic orderings and corresponding wellfoundedness theorems.
6644 - removed 'pred' (predecessor) function;
6645 - generalized some theorems about n-1;
6646 - many new laws about "div" and "mod";
6647 - new laws about greatest common divisors (see theory ex/Primes);
6649 * HOL/Relation: renamed the relational operator r^-1 "converse"
6650 instead of "inverse";
6652 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6653 of the multiset ordering;
6655 * directory HOL/Real: a construction of the reals using Dedekind cuts
6656 (not included by default);
6658 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6660 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6661 programs, i.e. different program variables may have different types.
6663 * calling (stac rew i) now fails if "rew" has no effect on the goal
6664 [previously, this check worked only if the rewrite rule was unconditional]
6665 Now rew can involve either definitions or equalities (either == or =).
6670 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6671 only the theorems proved on ZF.ML;
6673 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6674 It and 'sym RS equals0D' are now in the default claset, giving automatic
6675 disjointness reasoning but breaking a few old proofs.
6677 * ZF/Update: new theory of function updates
6678 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6679 may also be iterated as in f(a:=b,c:=d,...);
6681 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6683 * calling (stac rew i) now fails if "rew" has no effect on the goal
6684 [previously, this check worked only if the rewrite rule was unconditional]
6685 Now rew can involve either definitions or equalities (either == or =).
6687 * case_tac provided for compatibility with HOL
6688 (like the old excluded_middle_tac, but with subgoals swapped)
6691 *** Internal programming interfaces ***
6693 * Pure: several new basic modules made available for general use, see
6694 also src/Pure/README;
6696 * improved the theory data mechanism to support encapsulation (data
6697 kind name replaced by private Object.kind, acting as authorization
6698 key); new type-safe user interface via functor TheoryDataFun; generic
6699 print_data function becomes basically useless;
6701 * removed global_names compatibility flag -- all theory declarations
6702 are qualified by default;
6704 * module Pure/Syntax now offers quote / antiquote translation
6705 functions (useful for Hoare logic etc. with implicit dependencies);
6706 see HOL/ex/Antiquote for an example use;
6708 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6711 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6714 * Display.print_goals function moved to Locale.print_goals;
6716 * standard print function for goals supports current_goals_markers
6717 variable for marking begin of proof, end of proof, start of goal; the
6718 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6719 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6724 New in Isabelle98 (January 1998)
6725 --------------------------------
6727 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6729 * changed lexical syntax of terms / types: dots made part of long
6730 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6732 * simpset (and claset) reference variable replaced by functions
6733 simpset / simpset_ref;
6735 * no longer supports theory aliases (via merge) and non-trivial
6736 implicit merge of thms' signatures;
6738 * most internal names of constants changed due to qualified names;
6740 * changed Pure/Sequence interface (see Pure/seq.ML);
6743 *** General Changes ***
6745 * hierachically structured name spaces (for consts, types, axms, thms
6746 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6747 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6748 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6749 long_names for fully qualified output names; NOTE: ML programs
6750 (special tactics, packages etc.) referring to internal names may have
6751 to be adapted to cope with fully qualified names; in case of severe
6752 backward campatibility problems try setting 'global_names' at compile
6753 time to have enrything declared within a flat name space; one may also
6754 fine tune name declarations in theories via the 'global' and 'local'
6757 * reimplemented the implicit simpset and claset using the new anytype
6758 data filed in signatures; references simpset:simpset ref etc. are
6759 replaced by functions simpset:unit->simpset and
6760 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6761 to patch your ML files accordingly;
6763 * HTML output now includes theory graph data for display with Java
6764 applet or isatool browser; data generated automatically via isatool
6765 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6767 * defs may now be conditional; improved rewrite_goals_tac to handle
6768 conditional equations;
6770 * defs now admits additional type arguments, using TYPE('a) syntax;
6772 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6773 creates a new theory node; implicit merge of thms' signatures is
6774 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6775 transfer:theory->thm->thm in (rare) cases;
6777 * improved handling of draft signatures / theories; draft thms (and
6778 ctyps, cterms) are automatically promoted to real ones;
6780 * slightly changed interfaces for oracles: admit many per theory, named
6781 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6783 * print_goals: optional output of const types (set show_consts and
6786 * improved output of warnings (###) and errors (***);
6788 * subgoal_tac displays a warning if the new subgoal has type variables;
6790 * removed old README and Makefiles;
6792 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6794 * removed obsolete init_pps and init_database;
6796 * deleted the obsolete tactical STATE, which was declared by
6797 fun STATE tacfun st = tacfun st st;
6799 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6800 (which abbreviates $HOME);
6802 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6803 use isatool fixseq to adapt your ML programs (this works for fully
6804 qualified references to the Sequence structure only!);
6806 * use_thy no longer requires writable current directory; it always
6807 reloads .ML *and* .thy file, if either one is out of date;
6810 *** Classical Reasoner ***
6812 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6813 tactics that use classical reasoning to simplify a subgoal without
6814 splitting it into several subgoals;
6816 * Safe_tac: like safe_tac but uses the default claset;
6821 * added simplification meta rules:
6822 (asm_)(full_)simplify: simpset -> thm -> thm;
6824 * simplifier.ML no longer part of Pure -- has to be loaded by object
6827 * added prems argument to simplification procedures;
6829 * HOL, FOL, ZF: added infix function `addsplits':
6830 instead of `<simpset> setloop (split_tac <thms>)'
6831 you can simply write `<simpset> addsplits <thms>'
6836 * TYPE('a) syntax for type reflection terms;
6838 * no longer handles consts with name "" -- declare as 'syntax' instead;
6840 * pretty printer: changed order of mixfix annotation preference (again!);
6842 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6847 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6848 with `addloop' of the simplifier to faciliate case splitting in premises.
6850 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6852 * HOL/Auth: new protocol proofs including some for the Internet
6855 * HOL/Map: new theory of `maps' a la VDM;
6857 * HOL/simplifier: simplification procedures nat_cancel_sums for
6858 cancelling out common nat summands from =, <, <= (in)equalities, or
6859 differences; simplification procedures nat_cancel_factor for
6860 cancelling common factor from =, <, <= (in)equalities over natural
6861 sums; nat_cancel contains both kinds of procedures, it is installed by
6862 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6864 * HOL/simplifier: terms of the form
6865 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6867 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6868 and those of the form
6869 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6871 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6874 Each datatype `t' now comes with a theorem `split_t_case' of the form
6876 P(t_case f1 ... fn x) =
6877 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6879 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6882 and a theorem `split_t_case_asm' of the form
6884 P(t_case f1 ... fn x) =
6885 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6887 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6889 which can be added to a simpset via `addsplits'. The existing theorems
6890 expand_list_case and expand_option_case have been renamed to
6891 split_list_case and split_option_case.
6894 - `pred n' is automatically converted to `n-1'.
6895 Users are strongly encouraged not to use `pred' any longer,
6896 because it will disappear altogether at some point.
6897 - Users are strongly encouraged to write "0 < n" rather than
6898 "n ~= 0". Theorems and proof tools have been modified towards this
6902 the function "set_of_list" has been renamed "set" (and its theorems too);
6903 the function "nth" now takes its arguments in the reverse order and
6904 has acquired the infix notation "!" as in "xs!n".
6906 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6908 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6909 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6911 * HOL/record: extensible records with schematic structural subtyping
6912 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6913 still lacks various theorems and concrete record syntax;
6918 * removed "axioms" and "generated by" sections;
6920 * replaced "ops" section by extended "consts" section, which is capable of
6921 handling the continuous function space "->" directly;
6924 . proves theorems immediately and stores them in the theory,
6925 . creates hierachical name space,
6926 . now uses normal mixfix annotations (instead of cinfix...),
6927 . minor changes to some names and values (for consistency),
6928 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6929 . separator between mutual domain defs: changed "," to "and",
6930 . improved handling of sort constraints; now they have to
6931 appear on the left-hand side of the equations only;
6933 * fixed LAM <x,y,zs>.b syntax;
6935 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6936 adm (%x. P (t x)), where P is chainfinite and t continuous;
6941 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6942 with `addloop' of the simplifier to faciliate case splitting in premises.
6944 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6945 in HOL, they strip ALL and --> from proved theorems;
6949 New in Isabelle94-8 (May 1997)
6950 ------------------------------
6952 *** General Changes ***
6954 * new utilities to build / run / maintain Isabelle etc. (in parts
6955 still somewhat experimental); old Makefiles etc. still functional;
6957 * new 'Isabelle System Manual';
6959 * INSTALL text, together with ./configure and ./build scripts;
6961 * reimplemented type inference for greater efficiency, better error
6962 messages and clean internal interface;
6964 * prlim command for dealing with lots of subgoals (an easier way of
6965 setting goals_limit);
6970 * supports alternative (named) syntax tables (parser and pretty
6971 printer); internal interface is provided by add_modesyntax(_i);
6973 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6974 be used in conjunction with the Isabelle symbol font; uses the
6975 "symbols" syntax table;
6977 * added token_translation interface (may translate name tokens in
6978 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6979 the current print_mode); IMPORTANT: user print translation functions
6980 are responsible for marking newly introduced bounds
6981 (Syntax.mark_boundT);
6983 * token translations for modes "xterm" and "xterm_color" that display
6984 names in bold, underline etc. or colors (which requires a color
6987 * infixes may now be declared with names independent of their syntax;
6989 * added typed_print_translation (like print_translation, but may
6990 access type of constant);
6993 *** Classical Reasoner ***
6995 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6996 some limitations. Blast_tac...
6997 + ignores addss, addbefore, addafter; this restriction is intrinsic
6998 + ignores elimination rules that don't have the correct format
6999 (the conclusion MUST be a formula variable)
7000 + ignores types, which can make HOL proofs fail
7001 + rules must not require higher-order unification, e.g. apply_type in ZF
7002 [message "Function Var's argument not a bound variable" relates to this]
7003 + its proof strategy is more general but can actually be slower
7005 * substitution with equality assumptions no longer permutes other
7008 * minor changes in semantics of addafter (now called addaltern); renamed
7009 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7010 (and access functions for it);
7012 * improved combination of classical reasoner and simplifier:
7013 + functions for handling clasimpsets
7014 + improvement of addss: now the simplifier is called _after_ the
7016 + safe variant of addss called addSss: uses safe simplifications
7017 _during_ the safe steps. It is more complete as it allows multiple
7018 instantiations of unknowns (e.g. with slow_tac).
7022 * added interface for simplification procedures (functions that
7023 produce *proven* rewrite rules on the fly, depending on current
7026 * ordering on terms as parameter (used for ordered rewriting);
7028 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7030 * the solver is now split into a safe and an unsafe part.
7031 This should be invisible for the normal user, except that the
7032 functions setsolver and addsolver have been renamed to setSolver and
7033 addSolver; added safe_asm_full_simp_tac;
7038 * a generic induction tactic `induct_tac' which works for all datatypes and
7039 also for type `nat';
7041 * a generic case distinction tactic `exhaust_tac' which works for all
7042 datatypes and also for type `nat';
7044 * each datatype comes with a function `size';
7046 * patterns in case expressions allow tuple patterns as arguments to
7047 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7049 * primrec now also works with type nat;
7051 * recdef: a new declaration form, allows general recursive functions to be
7052 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7054 * the constant for negation has been renamed from "not" to "Not" to
7055 harmonize with FOL, ZF, LK, etc.;
7057 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7060 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7062 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7063 problems in commutative rings, using axiomatic type classes for + and *;
7065 * more examples in HOL/MiniML and HOL/Auth;
7067 * more default rewrite rules for quantifiers, union/intersection;
7069 * a new constant `arbitrary == @x.False';
7071 * HOLCF/IOA replaces old HOL/IOA;
7073 * HOLCF changes: derived all rules and arities
7074 + axiomatic type classes instead of classes
7075 + typedef instead of faking type definitions
7076 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7077 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7078 + eliminated the types void, one, tr
7079 + use unit lift and bool lift (with translations) instead of one and tr
7080 + eliminated blift from Lift3.thy (use Def instead of blift)
7081 all eliminated rules are derived as theorems --> no visible changes ;
7086 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7087 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7088 as ZF_cs addSIs [equalityI];
7092 New in Isabelle94-7 (November 96)
7093 ---------------------------------
7095 * allowing negative levels (as offsets) in prlev and choplev;
7097 * super-linear speedup for large simplifications;
7099 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7100 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7101 FAIL); can suppress it using the command Delsimps (ex_simps @
7102 all_simps); De Morgan laws are also now included, by default;
7104 * improved printing of ==> : ~:
7106 * new object-logic "Sequents" adds linear logic, while replacing LK
7107 and Modal (thanks to Sara Kalvala);
7109 * HOL/Auth: correctness proofs for authentication protocols;
7111 * HOL: new auto_tac combines rewriting and classical reasoning (many
7112 examples on HOL/Auth);
7114 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7115 the rewriter and classical reasoner simultaneously;
7117 * function uresult no longer returns theorems in "standard" format;
7118 regain previous version by: val uresult = standard o uresult;
7125 * oracles -- these establish an interface between Isabelle and trusted
7126 external reasoners, which may deliver results as theorems;
7128 * proof objects (in particular record all uses of oracles);
7130 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7132 * "constdefs" section in theory files;
7134 * "primrec" section (HOL) no longer requires names;
7136 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7143 * reduced space requirements;
7145 * automatic HTML generation from theories;
7147 * theory files no longer require "..." (quotes) around most types;
7149 * new examples, including two proofs of the Church-Rosser theorem;
7151 * non-curried (1994) version of HOL is no longer distributed;
7158 * greatly reduced space requirements;
7160 * theory files (.thy) no longer require \...\ escapes at line breaks;
7162 * searchable theorem database (see the section "Retrieving theorems" on
7163 page 8 of the Reference Manual);
7165 * new examples, including Grabczewski's monumental case study of the
7168 * The previous version of HOL renamed to Old_HOL;
7170 * The new version of HOL (previously called CHOL) uses a curried syntax
7171 for functions. Application looks like f a b instead of f(a,b);
7173 * Mutually recursive inductive definitions finally work in HOL;
7175 * In ZF, pattern-matching on tuples is now available in all abstractions and
7176 translates to the operator "split";
7183 * new infix operator, addss, allowing the classical reasoner to
7184 perform simplification at each step of its search. Example:
7185 fast_tac (cs addss ss)
7187 * a new logic, CHOL, the same as HOL, but with a curried syntax
7188 for functions. Application looks like f a b instead of f(a,b). Also pairs
7189 look like (a,b) instead of <a,b>;
7191 * PLEASE NOTE: CHOL will eventually replace HOL!
7193 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7194 It translates to the operator "split". A new theory of integers is available;
7196 * In ZF, integer numerals now denote two's-complement binary integers.
7197 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7199 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7200 of the Axiom of Choice;
7207 * Significantly faster resolution;
7209 * the different sections in a .thy file can now be mixed and repeated
7212 * Database of theorems for FOL, HOL and ZF. New
7213 commands including qed, qed_goal and bind_thm store theorems in the database.
7215 * Simple database queries: return a named theorem (get_thm) or all theorems of
7216 a given theory (thms_of), or find out what theory a theorem was proved in
7219 * Bugs fixed in the inductive definition and datatype packages;
7221 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7222 and HOL_dup_cs obsolete;
7224 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7227 * Simpler definition of function space in ZF;
7229 * new results about cardinal and ordinal arithmetic in ZF;
7231 * 'subtype' facility in HOL for introducing new types as subsets of existing
7234 :mode=text:wrap=hard:maxLineLen=72: