1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2009-2 (June 2010)
5 ---------------------------------
9 * Authentic syntax for *all* logical entities (type classes, type
10 constructors, term constants): provides simple and robust
11 correspondence between formal entities and concrete syntax. Within
12 the parse tree / AST representations, "constants" are decorated by
13 their category (class, type, const) and spelled out explicitly with
14 their full internal name.
16 Substantial INCOMPATIBILITY concerning low-level syntax declarations
17 and translations (translation rules and translation functions in ML).
18 Some hints on upgrading:
20 - Many existing uses of 'syntax' and 'translations' can be replaced
21 by more modern 'type_notation', 'notation' and 'abbreviation',
22 which are independent of this issue.
24 - 'translations' require markup within the AST; the term syntax
25 provides the following special forms:
27 CONST c -- produces syntax version of constant c from context
28 XCONST c -- literally c, checked as constant from context
29 c -- literally c, if declared by 'syntax'
31 Plain identifiers are treated as AST variables -- occasionally the
32 system indicates accidental variables via the error "rhs contains
35 Type classes and type constructors are marked according to their
36 concrete syntax. Some old translations rules need to be written
37 for the "type" category, using type constructor application
38 instead of pseudo-term application of the default category
41 - 'parse_translation' etc. in ML may use the following
44 @{class_syntax c} -- type class c within parse tree / AST
45 @{term_syntax c} -- type constructor c within parse tree / AST
46 @{const_syntax c} -- ML version of "CONST c" above
47 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
49 - Literal types within 'typed_print_translations', i.e. those *not*
50 represented as pseudo-terms are represented verbatim. Use @{class
51 c} or @{type_name c} here instead of the above syntax
54 Note that old non-authentic syntax was based on unqualified base
55 names, so all of the above "constant" names would coincide. Recall
56 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
57 diagnose syntax problems.
59 * Type constructors admit general mixfix syntax, not just infix.
61 * Concrete syntax may be attached to local entities without a proof
62 body, too. This works via regular mixfix annotations for 'fix',
63 'def', 'obtain' etc. or via the explicit 'write' command, which is
64 similar to the 'notation' command in theory specifications.
66 * Discontinued unnamed infix syntax (legacy feature for many years) --
67 need to specify constant name and syntax separately. Internal ML
68 datatype constructors have been renamed from InfixName to Infix etc.
69 Minor INCOMPATIBILITY.
71 * Schematic theorem statements need to be explicitly markup as such,
72 via commands 'schematic_lemma', 'schematic_theorem',
73 'schematic_corollary'. Thus the relevance of the proof is made
74 syntactically clear, which impacts performance in a parallel or
75 asynchronous interactive environment. Minor INCOMPATIBILITY.
77 * Use of cumulative prems via "!" in some proof methods has been
78 discontinued (old legacy feature).
80 * References 'trace_simp' and 'debug_simp' have been replaced by
81 configuration options stored in the context. Enabling tracing (the
82 case of debugging is similar) in proofs works via
84 using [[trace_simp = true]]
86 Tracing is then active for all invocations of the simplifier in
87 subsequent goal refinement steps. Tracing may also still be enabled or
88 disabled via the ProofGeneral settings menu.
90 * Separate commands 'hide_class', 'hide_type', 'hide_const',
91 'hide_fact' replace the former 'hide' KIND command. Minor
94 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
95 more efficient than combinations with -q1 or -q2.
100 * Proofterms record type-class reasoning explicitly, using the
101 "unconstrain" operation internally. This eliminates all sort
102 constraints from a theorem and proof, introducing explicit
103 OFCLASS-premises. On the proof term level, this operation is
104 automatically applied at theorem boundaries, such that closed proofs
105 are always free of sort constraints. INCOMPATIBILITY for tools that
108 * Local theory specifications may depend on extra type variables that
109 are not present in the result type -- arguments TYPE('a) :: 'a itself
110 are added internally. For example:
112 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
114 * Predicates of locales introduced by classes carry a mandatory
115 "class" prefix. INCOMPATIBILITY.
117 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
119 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
122 * Command 'code_reflect' allows to incorporate generated ML code into
123 runtime environment; replaces immature code_datatype antiquotation.
126 * Code generator: simple concept for abstract datatypes obeying
129 * Code generator: details of internal data cache have no impact on the
130 user space functionality any longer.
132 * Methods "unfold_locales" and "intro_locales" ignore non-locale
133 subgoals. This is more appropriate for interpretations with 'where'.
136 * Command 'example_proof' opens an empty proof body. This allows to
137 experiment with Isar, without producing any persistent result.
139 * Commands 'type_notation' and 'no_type_notation' declare type syntax
140 within a local theory context, with explicit checking of the
141 constructors involved (in contrast to the raw 'syntax' versions).
143 * Commands 'types' and 'typedecl' now work within a local theory
144 context -- without introducing dependencies on parameters or
145 assumptions, which is not possible in Isabelle/Pure.
147 * Command 'defaultsort' has been renamed to 'default_sort', it works
148 within a local theory context. Minor INCOMPATIBILITY.
153 * Command 'typedef' now works within a local theory context -- without
154 introducing dependencies on parameters or assumptions, which is not
155 possible in Isabelle/Pure/HOL. Note that the logical environment may
156 contain multiple interpretations of local typedefs (with different
157 non-emptiness proofs), even in a global theory context.
159 * New package for quotient types. Commands 'quotient_type' and
160 'quotient_definition' may be used for defining types and constants by
161 quotient constructions. An example is the type of integers created by
162 quotienting pairs of natural numbers:
165 intrel :: "(nat * nat) => (nat * nat) => bool"
167 "intrel (x, y) (u, v) = (x + v = u + y)"
169 quotient_type int = "nat * nat" / intrel
170 by (auto simp add: equivp_def expand_fun_eq)
173 "0::int" is "(0::nat, 0::nat)"
175 The method "lifting" can be used to lift of theorems from the
176 underlying "raw" type to the quotient type. The example
177 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
178 construction and provides a reasoning infrastructure for finite sets.
180 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
181 clash with new theory Quotient in Main HOL.
183 * Moved the SMT binding into the main HOL session, eliminating
184 separate HOL-SMT session.
186 * List membership infix mem operation is only an input abbreviation.
189 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
190 for future developements; former Library/Word.thy is still present in
191 the AFP entry RSAPPS.
193 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
194 longer shadowed. INCOMPATIBILITY.
196 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
199 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
202 * Dropped normalizing_semiring etc; use the facts in semiring classes
203 instead. INCOMPATIBILITY.
205 * Dropped several real-specific versions of lemmas about floor and
206 ceiling; use the generic lemmas from theory "Archimedean_Field"
207 instead. INCOMPATIBILITY.
209 floor_number_of_eq ~> floor_number_of
210 le_floor_eq_number_of ~> number_of_le_floor
211 le_floor_eq_zero ~> zero_le_floor
212 le_floor_eq_one ~> one_le_floor
213 floor_less_eq_number_of ~> floor_less_number_of
214 floor_less_eq_zero ~> floor_less_zero
215 floor_less_eq_one ~> floor_less_one
216 less_floor_eq_number_of ~> number_of_less_floor
217 less_floor_eq_zero ~> zero_less_floor
218 less_floor_eq_one ~> one_less_floor
219 floor_le_eq_number_of ~> floor_le_number_of
220 floor_le_eq_zero ~> floor_le_zero
221 floor_le_eq_one ~> floor_le_one
222 floor_subtract_number_of ~> floor_diff_number_of
223 floor_subtract_one ~> floor_diff_one
224 ceiling_number_of_eq ~> ceiling_number_of
225 ceiling_le_eq_number_of ~> ceiling_le_number_of
226 ceiling_le_zero_eq ~> ceiling_le_zero
227 ceiling_le_eq_one ~> ceiling_le_one
228 less_ceiling_eq_number_of ~> number_of_less_ceiling
229 less_ceiling_eq_zero ~> zero_less_ceiling
230 less_ceiling_eq_one ~> one_less_ceiling
231 ceiling_less_eq_number_of ~> ceiling_less_number_of
232 ceiling_less_eq_zero ~> ceiling_less_zero
233 ceiling_less_eq_one ~> ceiling_less_one
234 le_ceiling_eq_number_of ~> number_of_le_ceiling
235 le_ceiling_eq_zero ~> zero_le_ceiling
236 le_ceiling_eq_one ~> one_le_ceiling
237 ceiling_subtract_number_of ~> ceiling_diff_number_of
238 ceiling_subtract_one ~> ceiling_diff_one
240 * Theory "Finite_Set": various folding_XXX locales facilitate the
241 application of the various fold combinators on finite sets.
243 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
244 provides abstract red-black tree type which is backed by "RBT_Impl" as
245 implementation. INCOMPATIBILTY.
247 * Theory Library/Coinductive_List has been removed -- superseded by
248 AFP/thys/Coinductive.
250 * Theory PReal, including the type "preal" and related operations, has
251 been removed. INCOMPATIBILITY.
253 * Real: new development using Cauchy Sequences.
255 * Split off theory "Big_Operators" containing setsum, setprod,
256 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
258 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
259 "Int" etc. INCOMPATIBILITY.
261 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
263 * New set of rules "ac_simps" provides combined assoc / commute
264 rewrites for all interpretations of the appropriate generic locales.
266 * Renamed theory "OrderedGroup" to "Groups" and split theory
267 "Ring_and_Field" into theories "Rings" and "Fields"; for more
268 appropriate and more consistent names suitable for name prefixes
269 within the HOL theories. INCOMPATIBILITY.
271 * Some generic constants have been put to appropriate theories:
272 - less_eq, less: Orderings
273 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
274 - inverse, divide: Rings
277 * More consistent naming of type classes involving orderings (and
280 lower_semilattice ~> semilattice_inf
281 upper_semilattice ~> semilattice_sup
283 dense_linear_order ~> dense_linorder
285 pordered_ab_group_add ~> ordered_ab_group_add
286 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
287 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
288 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
289 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
290 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
291 pordered_cancel_semiring ~> ordered_cancel_semiring
292 pordered_comm_monoid_add ~> ordered_comm_monoid_add
293 pordered_comm_ring ~> ordered_comm_ring
294 pordered_comm_semiring ~> ordered_comm_semiring
295 pordered_ring ~> ordered_ring
296 pordered_ring_abs ~> ordered_ring_abs
297 pordered_semiring ~> ordered_semiring
299 ordered_ab_group_add ~> linordered_ab_group_add
300 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
301 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
302 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
303 ordered_field ~> linordered_field
304 ordered_field_no_lb ~> linordered_field_no_lb
305 ordered_field_no_ub ~> linordered_field_no_ub
306 ordered_field_dense_linear_order ~> dense_linordered_field
307 ordered_idom ~> linordered_idom
308 ordered_ring ~> linordered_ring
309 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
310 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
311 ordered_ring_strict ~> linordered_ring_strict
312 ordered_semidom ~> linordered_semidom
313 ordered_semiring ~> linordered_semiring
314 ordered_semiring_1 ~> linordered_semiring_1
315 ordered_semiring_1_strict ~> linordered_semiring_1_strict
316 ordered_semiring_strict ~> linordered_semiring_strict
318 The following slightly odd type classes have been moved to a
319 separate theory Library/Lattice_Algebras:
321 lordered_ab_group_add ~> lattice_ab_group_add
322 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
323 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
324 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
325 lordered_ring ~> lattice_ring
329 * Refined field classes:
330 - classes division_ring_inverse_zero, field_inverse_zero,
331 linordered_field_inverse_zero include rule inverse 0 = 0 --
332 subsumes former division_by_zero class;
333 - numerous lemmas have been ported from field to division_ring.
336 * Refined algebra theorem collections:
337 - dropped theorem group group_simps, use algebra_simps instead;
338 - dropped theorem group ring_simps, use field_simps instead;
339 - proper theorem collection field_simps subsumes former theorem
340 groups field_eq_simps and field_simps;
341 - dropped lemma eq_minus_self_iff which is a duplicate for
345 * Theory Finite_Set and List: some lemmas have been generalized from
348 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
349 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
350 inter_Inter_fold_inter ~> inf_Inf_fold_inf
351 union_Union_fold_union ~> sup_Sup_fold_sup
352 Inter_fold_inter ~> Inf_fold_inf
353 Union_fold_union ~> Sup_fold_sup
354 inter_INTER_fold_inter ~> inf_INFI_fold_inf
355 union_UNION_fold_union ~> sup_SUPR_fold_sup
356 INTER_fold_inter ~> INFI_fold_inf
357 UNION_fold_union ~> SUPR_fold_sup
359 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
360 replaced by the more convenient lemmas Inf_empty and Sup_empty.
361 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
362 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
363 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
364 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
366 * Reorganized theory Multiset: swapped notation of pointwise and
369 - pointwise ordering is instance of class order with standard syntax
371 - multiset ordering has syntax <=# and <#; partial order properties
372 are provided by means of interpretation with prefix
374 - less duplication, less historical organization of sections,
375 conversion from associations lists to multisets, rudimentary code
377 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
382 multiset_eq_conv_count_eq ~> multiset_ext_iff
383 multi_count_ext ~> multiset_ext
384 diff_union_inverse2 ~> diff_union_cancelR
388 * Theory Permutation: replaced local "remove" by List.remove1.
390 * Code generation: ML and OCaml code is decorated with signatures.
392 * Theory List: added transpose.
394 * Library/Nat_Bijection.thy is a collection of bijective functions
395 between nat and other types, which supersedes the older libraries
396 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
399 Nat_Int_Bij.nat2_to_nat ~> prod_encode
400 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
401 Nat_Int_Bij.int_to_nat_bij ~> int_encode
402 Nat_Int_Bij.nat_to_int_bij ~> int_decode
403 Countable.pair_encode ~> prod_encode
404 NatIso.prod2nat ~> prod_encode
405 NatIso.nat2prod ~> prod_decode
406 NatIso.sum2nat ~> sum_encode
407 NatIso.nat2sum ~> sum_decode
408 NatIso.list2nat ~> list_encode
409 NatIso.nat2list ~> list_decode
410 NatIso.set2nat ~> set_encode
411 NatIso.nat2set ~> set_decode
414 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
415 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
416 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
417 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
418 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
419 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
420 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
421 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
422 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
423 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
424 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
425 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
426 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
429 - Renamed ATP commands:
430 atp_info ~> sledgehammer running_atps
431 atp_kill ~> sledgehammer kill_atps
432 atp_messages ~> sledgehammer messages
433 atp_minimize ~> sledgehammer minimize
434 print_atps ~> sledgehammer available_atps
436 - Added user's manual ("isabelle doc sledgehammer").
437 - Added option syntax and "sledgehammer_params" to customize
438 Sledgehammer's behavior. See the manual for details.
439 - Modified the Isar proof reconstruction code so that it produces
440 direct proofs rather than proofs by contradiction. (This feature
441 is still experimental.)
442 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
444 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
447 - Added and implemented "binary_ints" and "bits" options.
448 - Added "std" option and implemented support for nonstandard models.
449 - Added and implemented "finitize" option to improve the precision
450 of infinite datatypes based on a monotonicity analysis.
451 - Added support for quotient types.
452 - Added support for "specification" and "ax_specification"
454 - Added support for local definitions (for "function" and
455 "termination" proofs).
456 - Added support for term postprocessors.
457 - Optimized "Multiset.multiset" and "FinFun.finfun".
458 - Improved efficiency of "destroy_constrs" optimization.
459 - Fixed soundness bugs related to "destroy_constrs" optimization and
461 - Fixed soundness bug related to higher-order constructors.
462 - Fixed soundness bug when "full_descrs" is enabled.
463 - Improved precision of set constructs.
464 - Added "atoms" option.
465 - Added cache to speed up repeated Kodkod invocations on the same
467 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
468 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
469 "SAT4J_Light". INCOMPATIBILITY.
470 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
471 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
472 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
474 * Method "induct" now takes instantiations of the form t, where t is not
475 a variable, as a shorthand for "x == t", where x is a fresh variable.
476 If this is not intended, t has to be enclosed in parentheses.
477 By default, the equalities generated by definitional instantiations
478 are pre-simplified, which may cause parameters of inductive cases
479 to disappear, or may even delete some of the inductive cases.
480 Use "induct (no_simp)" instead of "induct" to restore the old
481 behaviour. The (no_simp) option is also understood by the "cases"
482 and "nominal_induct" methods, which now perform pre-simplification, too.
488 * Variable names in lemmas generated by the domain package have
489 changed; the naming scheme is now consistent with the HOL datatype
490 package. Some proof scripts may be affected, INCOMPATIBILITY.
492 * The domain package no longer defines the function "foo_copy" for
493 recursive domain "foo". The reach lemma is now stated directly in
494 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
495 be reformulated in terms of "foo_take", INCOMPATIBILITY.
497 * Most definedness lemmas generated by the domain package (previously
498 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
499 like "foo$x = UU <-> x = UU", which works better as a simp rule.
500 Proofs that used definedness lemmas as intro rules may break,
501 potential INCOMPATIBILITY.
503 * Induction and casedist rules generated by the domain package now
504 declare proper case_names (one called "bottom", and one named for each
505 constructor). INCOMPATIBILITY.
507 * For mutually-recursive domains, separate "reach" and "take_lemma"
508 rules are generated for each domain, INCOMPATIBILITY.
510 foo_bar.reach ~> foo.reach bar.reach
511 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
513 * Some lemmas generated by the domain package have been renamed for
514 consistency with the datatype package, INCOMPATIBILITY.
516 foo.ind ~> foo.induct
517 foo.finite_ind ~> foo.finite_induct
518 foo.coind ~> foo.coinduct
519 foo.casedist ~> foo.exhaust
520 foo.exhaust ~> foo.nchotomy
522 * For consistency with other definition packages, the fixrec package
523 now generates qualified theorem names, INCOMPATIBILITY.
525 foo_simps ~> foo.simps
526 foo_unfold ~> foo.unfold
527 foo_induct ~> foo.induct
529 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
530 method and internal fixrec proofs now use the default simpset instead.
533 * The "contlub" predicate has been removed. Proof scripts should use
534 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
536 * The "admw" predicate has been removed, INCOMPATIBILITY.
538 * The constants cpair, cfst, and csnd have been removed in favor of
539 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
544 * Antiquotations for basic formal entities:
546 @{class NAME} -- type class
547 @{class_syntax NAME} -- syntax representation of the above
549 @{type_name NAME} -- logical type
550 @{type_abbrev NAME} -- type abbreviation
551 @{nonterminal NAME} -- type of concrete syntactic category
552 @{type_syntax NAME} -- syntax representation of any of the above
554 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
555 @{const_abbrev NAME} -- abbreviated constant
556 @{const_syntax NAME} -- syntax representation of any of the above
558 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
559 syntax constant (cf. 'syntax' command).
561 * Antiquotation @{make_string} inlines a function to print arbitrary
562 values similar to the ML toplevel. The result is compiler dependent
563 and may fall back on "?" in certain situations.
565 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
566 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
567 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
568 not work with the asynchronous Isar document model.
570 * 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 * Renamed some important ML structures, while keeping the old names
577 for some time as aliases within the structure Legacy:
579 OuterKeyword ~> Keyword
582 OuterSyntax ~> Outer_Syntax
583 PrintMode ~> Print_Mode
584 SpecParse ~> Parse_Spec
587 ThyOutput ~> Thy_Output
588 TypeInfer ~> Type_Infer
590 Note that "open Legacy" simplifies porting of sources, but forgetting
591 to remove it again will complicate porting again in the future.
593 * Most operations that refer to a global context are named
594 accordingly, e.g. Simplifier.global_context or
595 ProofContext.init_global. There are some situations where a global
596 context actually works, but under normal circumstances one needs to
597 pass the proper local context through the code!
599 * Discontinued old TheoryDataFun with its copy/init operation -- data
600 needs to be pure. Functor Theory_Data_PP retains the traditional
601 Pretty.pp argument to merge, which is absent in the standard
604 * Sorts.certify_sort and derived "cert" operations for types and terms
605 no longer minimize sorts. Thus certification at the boundary of the
606 inference kernel becomes invariant under addition of class relations,
607 which is an important monotonicity principle. Sorts are now minimized
608 in the syntax layer only, at the boundary between the end-user and the
609 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
610 explicitly in rare situations.
612 * Renamed old-style Drule.standard to Drule.export_without_context, to
613 emphasize that this is in no way a standard operation.
616 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
617 usual for resolution. Rare INCOMPATIBILITY.
619 * Renamed varify/unvarify operations to varify_global/unvarify_global
620 to emphasize that these only work in a global situation (which is
623 * Curried take and drop in library.ML; negative length is interpreted
624 as infinity (as in chop). Subtle INCOMPATIBILITY.
626 * Proof terms: type substitutions on proof constants now use canonical
627 order of type variables. INCOMPATIBILITY for tools working with proof
630 * Raw axioms/defs may no longer carry sort constraints, and raw defs
631 may no longer carry premises. User-level specifications are
632 transformed accordingly by Thm.add_axiom/add_def.
637 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
638 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
639 proof terms are enabled unconditionally in the new HOL-Proofs image.
641 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
642 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
645 * Old lib/scripts/polyml-platform is superseded by the
646 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
647 variant, even on a 64 bit machine. The following example setting
648 prefers 64 bit if available:
650 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
652 * The preliminary Isabelle/jEdit application demonstrates the emerging
653 Isabelle/Scala layer for advanced prover interaction and integration.
654 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
657 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
658 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
659 similar to the default assignment of the document preparation system
660 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
661 provides some operations for direct access to the font without asking
662 the user for manual installation.
666 New in Isabelle2009-1 (December 2009)
667 -------------------------------------
671 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
672 one backslash should be used, even in ML sources.
677 * Locale interpretation propagates mixins along the locale hierarchy.
678 The currently only available mixins are the equations used to map
679 local definitions to terms of the target domain of an interpretation.
681 * Reactivated diagnostic command 'print_interps'. Use "print_interps
682 loc" to print all interpretations of locale "loc" in the theory.
683 Interpretations in proofs are not shown.
685 * Thoroughly revised locales tutorial. New section on conditional
688 * On instantiation of classes, remaining undefined class parameters
689 are formally declared. INCOMPATIBILITY.
692 *** Document preparation ***
694 * New generalized style concept for printing terms: @{foo (style) ...}
695 instead of @{foo_style style ...} (old form is still retained for
696 backward compatibility). Styles can be also applied for
697 antiquotations prop, term_type and typeof.
702 * New proof method "smt" for a combination of first-order logic with
703 equality, linear and nonlinear (natural/integer/real) arithmetic, and
704 fixed-size bitvectors; there is also basic support for higher-order
705 features (esp. lambda abstractions). It is an incomplete decision
706 procedure based on external SMT solvers using the oracle mechanism;
707 for the SMT solver Z3, this method is proof-producing. Certificates
708 are provided to avoid calling the external solvers solely for
709 re-checking proofs. Due to a remote SMT service there is no need for
710 installing SMT solvers locally. See src/HOL/SMT.
712 * New commands to load and prove verification conditions generated by
713 the Boogie program verifier or derived systems (e.g. the Verifying C
714 Compiler (VCC) or Spec#). See src/HOL/Boogie.
716 * New counterexample generator tool 'nitpick' based on the Kodkod
717 relational model finder. See src/HOL/Tools/Nitpick and
718 src/HOL/Nitpick_Examples.
720 * New commands 'code_pred' and 'values' to invoke the predicate
721 compiler and to enumerate values of inductive predicates.
723 * A tabled implementation of the reflexive transitive closure.
725 * New implementation of quickcheck uses generic code generator;
726 default generators are provided for all suitable HOL types, records
727 and datatypes. Old quickcheck can be re-activated importing theory
728 Library/SML_Quickcheck.
730 * New testing tool Mirabelle for automated proof tools. Applies
731 several tools and tactics like sledgehammer, metis, or quickcheck, to
732 every proof step in a theory. To be used in batch mode via the
735 * New proof method "sos" (sum of squares) for nonlinear real
736 arithmetic (originally due to John Harison). It requires theory
737 Library/Sum_Of_Squares. It is not a complete decision procedure but
738 works well in practice on quantifier-free real arithmetic with +, -,
739 *, ^, =, <= and <, i.e. boolean combinations of equalities and
740 inequalities between polynomials. It makes use of external
741 semidefinite programming solvers. Method "sos" generates a
742 certificate that can be pasted into the proof thus avoiding the need
743 to call an external tool every time the proof is checked. See
744 src/HOL/Library/Sum_Of_Squares.
746 * New method "linarith" invokes existing linear arithmetic decision
749 * New command 'atp_minimal' reduces result produced by Sledgehammer.
751 * New Sledgehammer option "Full Types" in Proof General settings menu.
752 Causes full type information to be output to the ATPs. This slows
753 ATPs down considerably but eliminates a source of unsound "proofs"
756 * New method "metisFT": A version of metis that uses full type
757 information in order to avoid failures of proof reconstruction.
759 * New evaluator "approximate" approximates an real valued term using
760 the same method as the approximation method.
762 * Method "approximate" now supports arithmetic expressions as
763 boundaries of intervals and implements interval splitting and Taylor
766 * ML antiquotation @{code_datatype} inserts definition of a datatype
767 generated by the code generator; e.g. see src/HOL/Predicate.thy.
769 * New theory SupInf of the supremum and infimum operators for sets of
772 * New theory Probability, which contains a development of measure
773 theory, eventually leading to Lebesgue integration and probability.
775 * Extended Multivariate Analysis to include derivation and Brouwer's
778 * Reorganization of number theory, INCOMPATIBILITY:
779 - new number theory development for nat and int, in theories Divides
780 and GCD as well as in new session Number_Theory
781 - some constants and facts now suffixed with _nat and _int
783 - former session NumberTheory now named Old_Number_Theory, including
784 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
785 - moved theory Pocklington from src/HOL/Library to
786 src/HOL/Old_Number_Theory
788 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
789 lcm of finite and infinite sets. It is shown that they form a complete
792 * Class semiring_div requires superclass no_zero_divisors and proof of
793 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
794 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
795 generalized to class semiring_div, subsuming former theorems
796 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
797 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
800 * Refinements to lattice classes and sets:
801 - less default intro/elim rules in locale variant, more default
802 intro/elim rules in class variant: more uniformity
803 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
805 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
807 - renamed ACI to inf_sup_aci
808 - new class "boolean_algebra"
809 - class "complete_lattice" moved to separate theory
810 "Complete_Lattice"; corresponding constants (and abbreviations)
811 renamed and with authentic syntax:
812 Set.Inf ~> Complete_Lattice.Inf
813 Set.Sup ~> Complete_Lattice.Sup
814 Set.INFI ~> Complete_Lattice.INFI
815 Set.SUPR ~> Complete_Lattice.SUPR
816 Set.Inter ~> Complete_Lattice.Inter
817 Set.Union ~> Complete_Lattice.Union
818 Set.INTER ~> Complete_Lattice.INTER
819 Set.UNION ~> Complete_Lattice.UNION
820 - authentic syntax for
823 - mere abbreviations:
826 Set.inter (for inf, formerly Set.Int)
827 Set.union (for sup, formerly Set.Un)
828 Complete_Lattice.Inter (for Inf)
829 Complete_Lattice.Union (for Sup)
830 Complete_Lattice.INTER (for INFI)
831 Complete_Lattice.UNION (for SUPR)
832 - object-logic definitions as far as appropriate
834 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
835 Un_subset_iff are explicitly deleted as default simp rules; then also
836 their lattice counterparts le_inf_iff and le_sup_iff have to be
837 deleted to achieve the desired effect.
839 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
840 rules by default any longer; the same applies to min_max.inf_absorb1
841 etc. INCOMPATIBILITY.
843 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
844 pred_set_conv by default. INCOMPATIBILITY.
846 * Power operations on relations and functions are now one dedicated
847 constant "compow" with infix syntax "^^". Power operation on
848 multiplicative monoids retains syntax "^" and is now defined generic
849 in class power. INCOMPATIBILITY.
851 * Relation composition "R O S" now has a more standard argument order:
852 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
853 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
854 break, since the O_assoc rule was not rewritten like this. Fix using
855 O_assoc[symmetric]. The same applies to the curried version "R OO S".
857 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
858 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
861 * Most rules produced by inductive and datatype package have mandatory
862 prefixes. INCOMPATIBILITY.
864 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
865 the attribute of the same name. Each of the theorems in the list
866 DERIV_intros assumes composition with an additional function and
867 matches a variable to the derivative, which has to be solved by the
868 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
869 of most elementary terms. Former Maclauren.DERIV_tac and
870 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
873 * Code generator attributes follow the usual underscore convention:
874 code_unfold replaces code unfold
875 code_post replaces code post
880 sizechange -> size_change
881 induct_scheme -> induction_schema
884 * Discontinued abbreviation "arbitrary" of constant "undefined".
885 INCOMPATIBILITY, use "undefined" directly.
888 Suc_eq_add_numeral_1 -> Suc_eq_plus1
889 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
890 Suc_plus1 -> Suc_eq_plus1
891 *anti_sym -> *antisym*
892 vector_less_eq_def -> vector_le_def
895 * Added theorem List.map_map as [simp]. Removed List.map_compose.
898 * Removed predicate "M hassize n" (<--> card M = n & finite M).
904 * Theory Representable defines a class "rep" of domains that are
905 representable (via an ep-pair) in the universal domain type "udom".
906 Instances are provided for all type constructors defined in HOLCF.
908 * The 'new_domain' command is a purely definitional version of the
909 domain package, for representable domains. Syntax is identical to the
910 old domain package. The 'new_domain' package also supports indirect
911 recursion using previously-defined type constructors. See
912 src/HOLCF/ex/New_Domain.thy for examples.
914 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
915 on the left-hand side of an equation, and then performs
916 simplification. Rewriting is done using rules declared with the
917 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
918 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
920 * The pattern-match compiler in 'fixrec' can now handle constructors
921 with HOL function types. Pattern-match combinators for the Pair
922 constructor are pre-configured.
924 * The 'fixrec' package now produces better fixed-point induction rules
925 for mutually-recursive definitions: Induction rules have conclusions
926 of the form "P foo bar" instead of "P <foo, bar>".
928 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
929 been renamed to "below". The name "below" now replaces "less" in many
930 theorem names. (Legacy theorem names using "less" are still supported
933 * The 'fixrec' package now supports "bottom patterns". Bottom
934 patterns can be used to generate strictness rules, or to make
935 functions more strict (much like the bang-patterns supported by the
936 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
942 * Support for Poly/ML 5.3.0, with improved reporting of compiler
943 errors and run-time exceptions, including detailed source positions.
945 * Structure Name_Space (formerly NameSpace) now manages uniquely
946 identified entries, with some additional information such as source
947 position, logical grouping etc.
949 * Theory and context data is now introduced by the simplified and
950 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
951 to be pure, but the old TheoryDataFun for mutable data (with explicit
952 copy operation) is still available for some time.
954 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
955 provides a high-level programming interface to synchronized state
956 variables with atomic update. This works via pure function
957 application within a critical section -- its runtime should be as
958 short as possible; beware of deadlocks if critical code is nested,
959 either directly or indirectly via other synchronized variables!
961 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
962 wraps raw ML references, explicitly indicating their non-thread-safe
963 behaviour. The Isar toplevel keeps this structure open, to
964 accommodate Proof General as well as quick and dirty interactive
965 experiments with references.
967 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
968 parallel tactical reasoning.
970 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
971 are similar to SUBPROOF, but are slightly more flexible: only the
972 specified parts of the subgoal are imported into the context, and the
973 body tactic may introduce new subgoals and schematic variables.
975 * Old tactical METAHYPS, which does not observe the proof context, has
976 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
977 or Subgoal.FOCUS etc.
979 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
980 functors have their own ML name space there is no point to mark them
981 separately.) Minor INCOMPATIBILITY.
983 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
985 * Renamed several structures FooBar to Foo_Bar. Occasional,
988 * Operations of structure Skip_Proof no longer require quick_and_dirty
989 mode, which avoids critical setmp.
991 * Eliminated old Attrib.add_attributes, Method.add_methods and related
992 combinators for "args". INCOMPATIBILITY, need to use simplified
993 Attrib/Method.setup introduced in Isabelle2009.
995 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
996 back on global_simpset_of, global_claset_of, global_clasimpset_of as
997 last resort. INCOMPATIBILITY.
999 * Display.pretty_thm now requires a proper context (cf. former
1000 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1001 or even Display.pretty_thm_without_context as last resort.
1004 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1005 Syntax.pretty_typ/term directly, preferably with proper context
1006 instead of global theory.
1011 * Further fine tuning of parallel proof checking, scales up to 8 cores
1012 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1015 * Support for additional "Isabelle components" via etc/components, see
1016 also the system manual.
1018 * The isabelle makeall tool now operates on all components with
1019 IsaMakefile, not just hardwired "logics".
1021 * Removed "compress" option from isabelle-process and isabelle usedir;
1022 this is always enabled.
1024 * Discontinued support for Poly/ML 4.x versions.
1026 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1027 on a given logic image. This requires the lighttpd webserver and is
1028 currently supported on Linux only.
1032 New in Isabelle2009 (April 2009)
1033 --------------------------------
1037 * Simplified main Isabelle executables, with less surprises on
1038 case-insensitive file-systems (such as Mac OS).
1040 - The main Isabelle tool wrapper is now called "isabelle" instead of
1043 - The former "isabelle" alias for "isabelle-process" has been
1044 removed (should rarely occur to regular users).
1046 - The former "isabelle-interface" and its alias "Isabelle" have been
1047 removed (interfaces are now regular Isabelle tools).
1049 Within scripts and make files, the Isabelle environment variables
1050 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1051 respectively. (The latter are still available as legacy feature.)
1053 The old isabelle-interface wrapper could react in confusing ways if
1054 the interface was uninstalled or changed otherwise. Individual
1055 interface tool configuration is now more explicit, see also the
1056 Isabelle system manual. In particular, Proof General is now available
1057 via "isabelle emacs".
1059 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1060 purge installed copies of Isabelle executables and re-run "isabelle
1061 install -p ...", or use symlinks.
1063 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1064 old ~/isabelle, which was slightly non-standard and apt to cause
1065 surprises on case-insensitive file-systems (such as Mac OS).
1067 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1068 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1069 care is required when using older releases of Isabelle. Note that
1070 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1071 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1073 * Proofs of fully specified statements are run in parallel on
1074 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1075 a regular 4-core machine, if the initial heap space is made reasonably
1076 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1078 * The main reference manuals ("isar-ref", "implementation", and
1079 "system") have been updated and extended. Formally checked references
1080 as hyperlinks are now available uniformly.
1085 * Complete re-implementation of locales. INCOMPATIBILITY in several
1086 respects. The most important changes are listed below. See the
1087 Tutorial on Locales ("locales" manual) for details.
1089 - In locale expressions, instantiation replaces renaming. Parameters
1090 must be declared in a for clause. To aid compatibility with previous
1091 parameter inheritance, in locale declarations, parameters that are not
1092 'touched' (instantiation position "_" or omitted) are implicitly added
1093 with their syntax at the beginning of the for clause.
1095 - Syntax from abbreviations and definitions in locales is available in
1096 locale expressions and context elements. The latter is particularly
1097 useful in locale declarations.
1099 - More flexible mechanisms to qualify names generated by locale
1100 expressions. Qualifiers (prefixes) may be specified in locale
1101 expressions, and can be marked as mandatory (syntax: "name!:") or
1102 optional (syntax "name?:"). The default depends for plain "name:"
1103 depends on the situation where a locale expression is used: in
1104 commands 'locale' and 'sublocale' prefixes are optional, in
1105 'interpretation' and 'interpret' prefixes are mandatory. The old
1106 implicit qualifiers derived from the parameter names of a locale are
1107 no longer generated.
1109 - Command "sublocale l < e" replaces "interpretation l < e". The
1110 instantiation clause in "interpretation" and "interpret" (square
1111 brackets) is no longer available. Use locale expressions.
1113 - When converting proof scripts, mandatory qualifiers in
1114 'interpretation' and 'interpret' should be retained by default, even
1115 if this is an INCOMPATIBILITY compared to former behavior. In the
1116 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1117 in locale expressions range over a single locale instance only.
1119 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1120 In existing theorem specifications replace the includes element by the
1121 respective context elements of the included locale, omitting those
1122 that are already present in the theorem specification. Multiple
1123 assume elements of a locale should be replaced by a single one
1124 involving the locale predicate. In the proof body, declarations (most
1125 notably theorems) may be regained by interpreting the respective
1126 locales in the proof context as required (command "interpret").
1128 If using "includes" in replacement of a target solely because the
1129 parameter types in the theorem are not as general as in the target,
1130 consider declaring a new locale with additional type constraints on
1131 the parameters (context element "constrains").
1133 - Discontinued "locale (open)". INCOMPATIBILITY.
1135 - Locale interpretation commands no longer attempt to simplify goal.
1136 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1137 methods intro_locales and unfold_locales to clarify.
1139 - Locale interpretation commands no longer accept interpretation
1140 attributes. INCOMPATIBILITY.
1142 * Class declaration: so-called "base sort" must not be given in import
1143 list any longer, but is inferred from the specification. Particularly
1150 class foo = type + ...
1152 * Class target: global versions of theorems stemming do not carry a
1153 parameter prefix any longer. INCOMPATIBILITY.
1155 * Class 'instance' command no longer accepts attached definitions.
1156 INCOMPATIBILITY, use proper 'instantiation' target instead.
1158 * Recovered hiding of consts, which was accidentally broken in
1159 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1160 makes c inaccessible; consider using ``hide (open) const c'' instead.
1162 * Slightly more coherent Pure syntax, with updated documentation in
1163 isar-ref manual. Removed locales meta_term_syntax and
1164 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1165 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1166 directly in regular applications.
1168 * There is a new syntactic category "float_const" for signed decimal
1169 fractions (e.g. 123.45 or -123.45).
1171 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1172 interface with 'setup' command instead.
1174 * Command 'local_setup' is similar to 'setup', but operates on a local
1177 * The 'axiomatization' command now only works within a global theory
1178 context. INCOMPATIBILITY.
1180 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1181 hypotheses. Sorts required in the course of reasoning need to be
1182 covered by the constraints in the initial statement, completed by the
1183 type instance information of the background theory. Non-trivial sort
1184 hypotheses, which rarely occur in practice, may be specified via
1185 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1187 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1189 The result contains an implicit sort hypotheses as before --
1190 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1193 * Generalized Isar history, with support for linear undo, direct state
1196 * Changed defaults for unify configuration options:
1198 unify_trace_bound = 50 (formerly 25)
1199 unify_search_bound = 60 (formerly 30)
1201 * Different bookkeeping for code equations (INCOMPATIBILITY):
1203 a) On theory merge, the last set of code equations for a particular
1204 constant is taken (in accordance with the policy applied by other
1205 parts of the code generator framework).
1207 b) Code equations stemming from explicit declarations (e.g. code
1208 attribute) gain priority over default code equations stemming
1209 from definition, primrec, fun etc.
1211 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1213 * Unified theorem tables for both code generators. Thus [code
1214 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1216 * Command 'find_consts' searches for constants based on type and name
1219 find_consts "_ => bool"
1221 By default, matching is against subtypes, but it may be restricted to
1222 the whole type. Searching by name is possible. Multiple queries are
1223 conjunctive and queries may be negated by prefixing them with a
1226 find_consts strict: "_ => bool" name: "Int" -"int => int"
1228 * New 'find_theorems' criterion "solves" matches theorems that
1229 directly solve the current goal (modulo higher-order unification).
1231 * Auto solve feature for main theorem statements: whenever a new goal
1232 is stated, "find_theorems solves" is called; any theorems that could
1233 solve the lemma directly are listed as part of the goal state.
1234 Cf. associated options in Proof General Isabelle settings menu,
1235 enabled by default, with reasonable timeout for pathological cases of
1236 higher-order unification.
1239 *** Document preparation ***
1241 * Antiquotation @{lemma} now imitates a regular terminal proof,
1242 demanding keyword 'by' and supporting the full method expression
1243 syntax just like the Isar command 'by'.
1248 * Integrated main parts of former image HOL-Complex with HOL. Entry
1249 points Main and Complex_Main remain as before.
1251 * Logic image HOL-Plain provides a minimal HOL with the most important
1252 tools available (inductive, datatype, primrec, ...). This facilitates
1253 experimentation and tool development. Note that user applications
1254 (and library theories) should never refer to anything below theory
1257 * Logic image HOL-Main stops at theory Main, and thus facilitates
1258 experimentation due to shorter build times.
1260 * Logic image HOL-NSA contains theories of nonstandard analysis which
1261 were previously part of former HOL-Complex. Entry point Hyperreal
1262 remains valid, but theories formerly using Complex_Main should now use
1263 new entry point Hypercomplex.
1265 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1266 Posix processes. Avoids potentially expensive forking of the ML
1267 process. New thread-based implementation also works on non-Unix
1268 platforms (Cygwin). Provers are no longer hardwired, but defined
1269 within the theory via plain ML wrapper functions. Basic Sledgehammer
1270 commands are covered in the isar-ref manual.
1272 * Wrapper scripts for remote SystemOnTPTP service allows to use
1273 sledgehammer without local ATP installation (Vampire etc.). Other
1274 provers may be included via suitable ML wrappers, see also
1275 src/HOL/ATP_Linkup.thy.
1277 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1280 * The metis method no longer fails because the theorem is too trivial
1281 (contains the empty clause).
1283 * The metis method now fails in the usual manner, rather than raising
1284 an exception, if it determines that it cannot prove the theorem.
1286 * Method "coherent" implements a prover for coherent logic (see also
1287 src/Tools/coherent.ML).
1289 * Constants "undefined" and "default" replace "arbitrary". Usually
1290 "undefined" is the right choice to replace "arbitrary", though
1291 logically there is no difference. INCOMPATIBILITY.
1293 * Command "value" now integrates different evaluation mechanisms. The
1294 result of the first successful evaluation mechanism is printed. In
1295 square brackets a particular named evaluation mechanisms may be
1296 specified (currently, [SML], [code] or [nbe]). See further
1297 src/HOL/ex/Eval_Examples.thy.
1299 * Normalization by evaluation now allows non-leftlinear equations.
1300 Declare with attribute [code nbe].
1302 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1303 as the structured Isar versions "cases" and "induct", cf. the
1304 corresponding "cases" and "induct" attributes. Mutual induction rules
1305 are now presented as a list of individual projections
1306 (e.g. foo_bar.inducts for types foo and bar); the old format with
1307 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1308 rare situations a different rule is selected --- notably nested tuple
1309 elimination instead of former prod.exhaust: use explicit (case_tac t
1310 rule: prod.exhaust) here.
1312 * Attributes "cases", "induct", "coinduct" support "del" option.
1314 * Removed fact "case_split_thm", which duplicates "case_split".
1316 * The option datatype has been moved to a new theory Option. Renamed
1317 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1319 * New predicate "strict_mono" classifies strict functions on partial
1320 orders. With strict functions on linear orders, reasoning about
1321 (in)equalities is facilitated by theorems "strict_mono_eq",
1322 "strict_mono_less_eq" and "strict_mono_less".
1324 * Some set operations are now proper qualified constants with
1325 authentic syntax. INCOMPATIBILITY:
1336 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1339 * Auxiliary class "itself" has disappeared -- classes without any
1340 parameter are treated as expected by the 'class' command.
1342 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1344 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1345 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1347 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1348 method "approximation". It proves formulas on real values by using
1349 interval arithmetic. In the formulas are also the transcendental
1350 functions sin, cos, tan, atan, ln, exp and the constant pi are
1351 allowed. For examples see
1352 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1354 * Theory "Reflection" now resides in HOL/Library.
1356 * Entry point to Word library now simply named "Word".
1359 * Made source layout more coherent with logical distribution
1362 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1363 src/HOL/Library/Code_Message.thy ~> src/HOL/
1364 src/HOL/Library/GCD.thy ~> src/HOL/
1365 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1366 src/HOL/Library/Parity.thy ~> src/HOL/
1367 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1368 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1369 src/HOL/Real/Lubs.thy ~> src/HOL/
1370 src/HOL/Real/PReal.thy ~> src/HOL/
1371 src/HOL/Real/Rational.thy ~> src/HOL/
1372 src/HOL/Real/RComplete.thy ~> src/HOL/
1373 src/HOL/Real/RealDef.thy ~> src/HOL/
1374 src/HOL/Real/RealPow.thy ~> src/HOL/
1375 src/HOL/Real/Real.thy ~> src/HOL/
1376 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1377 src/HOL/Complex/Complex.thy ~> src/HOL/
1378 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1379 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1380 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1381 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1382 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1383 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1384 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1385 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1386 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1387 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1388 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1389 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1390 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1391 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1392 src/HOL/Real/Float ~> src/HOL/Library/
1393 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1394 src/HOL/Real/RealVector.thy ~> src/HOL/
1396 src/HOL/arith_data.ML ~> src/HOL/Tools
1397 src/HOL/hologic.ML ~> src/HOL/Tools
1398 src/HOL/simpdata.ML ~> src/HOL/Tools
1399 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1400 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1401 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1402 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1403 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1404 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1405 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1407 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1408 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1409 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1410 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1411 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1412 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1414 * If methods "eval" and "evaluation" encounter a structured proof
1415 state with !!/==>, only the conclusion is evaluated to True (if
1416 possible), avoiding strange error messages.
1418 * Method "sizechange" automates termination proofs using (a
1419 modification of) the size-change principle. Requires SAT solver. See
1420 src/HOL/ex/Termination.thy for examples.
1422 * Simplifier: simproc for let expressions now unfolds if bound
1423 variable occurs at most once in let expression body. INCOMPATIBILITY.
1425 * Method "arith": Linear arithmetic now ignores all inequalities when
1426 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1428 * New attribute "arith" for facts that should always be used
1429 automatically by arithmetic. It is intended to be used locally in
1432 assumes [arith]: "x > 0"
1434 Global usage is discouraged because of possible performance impact.
1436 * New classes "top" and "bot" with corresponding operations "top" and
1437 "bot" in theory Orderings; instantiation of class "complete_lattice"
1438 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1440 * Changed definition lemma "less_fun_def" in order to provide an
1441 instance for preorders on functions; use lemma "less_le" instead.
1444 * Theory Orderings: class "wellorder" moved here, with explicit
1445 induction rule "less_induct" as assumption. For instantiation of
1446 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1449 * Theory Orderings: added class "preorder" as superclass of "order".
1450 INCOMPATIBILITY: Instantiation proofs for order, linorder
1451 etc. slightly changed. Some theorems named order_class.* now named
1454 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1457 * Theory Finite_Set: added a new fold combinator of type
1459 ('a => 'b => 'b) => 'b => 'a set => 'b
1461 Occasionally this is more convenient than the old fold combinator
1462 which is now defined in terms of the new one and renamed to
1465 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1466 and "ring_simps" have been replaced by "algebra_simps" (which can be
1467 extended with further lemmas!). At the moment both still exist but
1468 the former will disappear at some point.
1470 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1471 class recpower. Type-specific simp rules for various recpower types
1472 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1474 rat_power_0 -> power_0
1475 rat_power_Suc -> power_Suc
1476 realpow_0 -> power_0
1477 realpow_Suc -> power_Suc
1478 complexpow_0 -> power_0
1479 complexpow_Suc -> power_Suc
1480 power_poly_0 -> power_0
1481 power_poly_Suc -> power_Suc
1483 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1484 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1485 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1486 of lemmas from Divides has been generalized from nat to class
1487 semiring_div. INCOMPATIBILITY. This involves the following theorem
1488 renames resulting from duplicate elimination:
1490 dvd_def_mod ~> dvd_eq_mod_eq_0
1491 zero_dvd_iff ~> dvd_0_left_iff
1492 dvd_0 ~> dvd_0_right
1493 DIVISION_BY_ZERO_DIV ~> div_by_0
1494 DIVISION_BY_ZERO_MOD ~> mod_by_0
1495 mult_div ~> div_mult_self2_is_id
1496 mult_mod ~> mod_mult_self2_is_0
1498 * Theory IntDiv: removed many lemmas that are instances of class-based
1499 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1500 rename old lemmas as follows:
1502 dvd_diff -> nat_dvd_diff
1503 dvd_zminus_iff -> dvd_minus_iff
1504 mod_add1_eq -> mod_add_eq
1505 mod_mult1_eq -> mod_mult_right_eq
1506 mod_mult1_eq' -> mod_mult_left_eq
1507 mod_mult_distrib_mod -> mod_mult_eq
1508 nat_mod_add_left_eq -> mod_add_left_eq
1509 nat_mod_add_right_eq -> mod_add_right_eq
1510 nat_mod_div_trivial -> mod_div_trivial
1511 nat_mod_mod_trivial -> mod_mod_trivial
1512 zdiv_zadd_self1 -> div_add_self1
1513 zdiv_zadd_self2 -> div_add_self2
1514 zdiv_zmult_self1 -> div_mult_self2_is_id
1515 zdiv_zmult_self2 -> div_mult_self1_is_id
1516 zdvd_triv_left -> dvd_triv_left
1517 zdvd_triv_right -> dvd_triv_right
1518 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1519 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1520 zmod_zadd_left_eq -> mod_add_left_eq
1521 zmod_zadd_right_eq -> mod_add_right_eq
1522 zmod_zadd_self1 -> mod_add_self1
1523 zmod_zadd_self2 -> mod_add_self2
1524 zmod_zadd1_eq -> mod_add_eq
1525 zmod_zdiff1_eq -> mod_diff_eq
1526 zmod_zdvd_zmod -> mod_mod_cancel
1527 zmod_zmod_cancel -> mod_mod_cancel
1528 zmod_zmult_self1 -> mod_mult_self2_is_0
1529 zmod_zmult_self2 -> mod_mult_self1_is_0
1532 zdvd_abs1 -> abs_dvd_iff
1533 zdvd_abs2 -> dvd_abs_iff
1534 zdvd_refl -> dvd_refl
1535 zdvd_trans -> dvd_trans
1536 zdvd_zadd -> dvd_add
1537 zdvd_zdiff -> dvd_diff
1538 zdvd_zminus_iff -> dvd_minus_iff
1539 zdvd_zminus2_iff -> minus_dvd_iff
1540 zdvd_zmultD -> dvd_mult_right
1541 zdvd_zmultD2 -> dvd_mult_left
1542 zdvd_zmult_mono -> mult_dvd_mono
1543 zdvd_0_right -> dvd_0_right
1544 zdvd_0_left -> dvd_0_left_iff
1545 zdvd_1_left -> one_dvd
1546 zminus_dvd_iff -> minus_dvd_iff
1548 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1550 * The real numbers offer decimal input syntax: 12.34 is translated
1551 into 1234/10^2. This translation is not reversed upon output.
1553 * Theory Library/Polynomial defines an abstract type 'a poly of
1554 univariate polynomials with coefficients of type 'a. In addition to
1555 the standard ring operations, it also supports div and mod. Code
1556 generation is also supported, using list-style constructors.
1558 * Theory Library/Inner_Product defines a class of real_inner for real
1559 inner product spaces, with an overloaded operation inner :: 'a => 'a
1560 => real. Class real_inner is a subclass of real_normed_vector from
1563 * Theory Library/Product_Vector provides instances for the product
1564 type 'a * 'b of several classes from RealVector and Inner_Product.
1565 Definitions of addition, subtraction, scalar multiplication, norms,
1566 and inner products are included.
1568 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1569 addition to the field operations, numerals and case syntax are also
1572 * Theory Library/Diagonalize provides constructive version of Cantor's
1573 first diagonalization argument.
1575 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1576 zlcm (for int); carried together from various gcd/lcm developements in
1577 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1578 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1579 may recover tupled syntax as follows:
1581 hide (open) const gcd
1582 abbreviation gcd where
1583 "gcd == (%(a, b). GCD.gcd a b)"
1585 GCD.gcd ("gcd '(_, _')")
1587 The same works for lcm, zgcd, zlcm.
1589 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1590 instantiations for algebraic structures. Removed some duplicate
1591 theorems. Changes in simp rules. INCOMPATIBILITY.
1593 * ML antiquotation @{code} takes a constant as argument and generates
1594 corresponding code in background and inserts name of the corresponding
1595 resulting ML value/function/datatype constructor binding in place.
1596 All occurrences of @{code} with a single ML block are generated
1597 simultaneously. Provides a generic and safe interface for
1598 instrumentalizing code generation. See
1599 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1600 In future you ought to refrain from ad-hoc compiling generated SML
1601 code on the ML toplevel. Note that (for technical reasons) @{code}
1602 cannot refer to constants for which user-defined serializations are
1603 set. Refer to the corresponding ML counterpart directly in that
1606 * Command 'rep_datatype': instead of theorem names the command now
1607 takes a list of terms denoting the constructors of the type to be
1608 represented as datatype. The characteristic theorems have to be
1609 proven. INCOMPATIBILITY. Also observe that the following theorems
1610 have disappeared in favour of existing ones:
1612 unit_induct ~> unit.induct
1613 prod_induct ~> prod.induct
1614 sum_induct ~> sum.induct
1615 Suc_Suc_eq ~> nat.inject
1616 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1621 * New locales for orders and lattices where the equivalence relation
1622 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1623 locales use a record structure with field eq for the equivalence.
1625 * New theory of factorial domains.
1627 * Units_l_inv and Units_r_inv are now simp rules by default.
1628 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1629 and/or r_inv will now also require deletion of these lemmas.
1631 * Renamed the following theorems, INCOMPATIBILITY:
1633 UpperD ~> Upper_memD
1634 LowerD ~> Lower_memD
1635 least_carrier ~> least_closed
1636 greatest_carrier ~> greatest_closed
1637 greatest_Lower_above ~> greatest_Lower_below
1638 one_zero ~> carrier_one_zero
1639 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1644 * Nominal datatypes can now contain type-variables.
1646 * Commands 'nominal_inductive' and 'equivariance' work with local
1649 * Nominal primrec can now works with local theory targets and its
1650 specification syntax now conforms to the general format as seen in
1653 * Method "perm_simp" honours the standard simplifier attributes
1654 (no_asm), (no_asm_use) etc.
1656 * The new predicate #* is defined like freshness, except that on the
1657 left hand side can be a set or list of atoms.
1659 * Experimental command 'nominal_inductive2' derives strong induction
1660 principles for inductive definitions. In contrast to
1661 'nominal_inductive', which can only deal with a fixed number of
1662 binders, it can deal with arbitrary expressions standing for sets of
1663 atoms to be avoided. The only inductive definition we have at the
1664 moment that needs this generalisation is the typing rule for Lets in
1667 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1668 -----------------------------------------------------------------
1669 Gamma |- Let x be t1 in t2 : T2
1671 In this rule one wants to avoid all the binders that are introduced by
1672 "close Gamma T1". We are looking for other examples where this
1673 feature might be useful. Please let us know.
1678 * Reimplemented the simplification procedure for proving continuity
1679 subgoals. The new simproc is extensible; users can declare additional
1680 continuity introduction rules with the attribute [cont2cont].
1682 * The continuity simproc now uses a different introduction rule for
1683 solving continuity subgoals on terms with lambda abstractions. In
1684 some rare cases the new simproc may fail to solve subgoals that the
1685 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1686 Potential INCOMPATIBILITY.
1688 * Command 'fixrec': specification syntax now conforms to the general
1689 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1690 examples. INCOMPATIBILITY.
1695 * Proof of Zorn's Lemma for partial orders.
1700 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1701 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1702 depends on multithreading, so timouts will not work before Poly/ML
1705 * High-level support for concurrent ML programming, see
1706 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1707 particularly convenient to organize independent functional
1708 computations. The concept of "synchronized variables" provides a
1709 higher-order interface for components with shared state, avoiding the
1710 delicate details of mutexes and condition variables. (Requires
1711 Poly/ML 5.2.1 or later.)
1713 * ML bindings produced via Isar commands are stored within the Isar
1714 context (theory or proof). Consequently, commands like 'use' and 'ML'
1715 become thread-safe and work with undo as expected (concerning
1716 top-level bindings, not side-effects on global references).
1717 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1718 compiler at runtime; really global bindings need to be given outside a
1719 theory. (Requires Poly/ML 5.2 or later.)
1721 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1722 context. Top-level ML bindings are stored within the proof context in
1723 a purely sequential fashion, disregarding the nested proof structure.
1724 ML bindings introduced by 'ML_prf' are discarded at the end of the
1725 proof. (Requires Poly/ML 5.2 or later.)
1727 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1728 and Method.setup, as well as Isar commands 'attribute_setup' and
1729 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1730 existing code accordingly, or use plain 'setup' together with old
1733 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1734 to 'a -> thm, while results are always tagged with an authentic oracle
1735 name. The Isar command 'oracle' is now polymorphic, no argument type
1736 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1737 accordingly. Note that extra performance may be gained by producing
1738 the cterm carefully, avoiding slow Thm.cterm_of.
1740 * Simplified interface for defining document antiquotations via
1741 ThyOutput.antiquotation, ThyOutput.output, and optionally
1742 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1743 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1746 * More systematic treatment of long names, abstract name bindings, and
1747 name space operations. Basic operations on qualified names have been
1748 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1749 Long_Name.append. Old type bstring has been mostly replaced by
1750 abstract type binding (see structure Binding), which supports precise
1751 qualification by packages and local theory targets, as well as proper
1752 tracking of source positions. INCOMPATIBILITY, need to wrap old
1753 bstring values into Binding.name, or better pass through abstract
1754 bindings everywhere. See further src/Pure/General/long_name.ML,
1755 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1757 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1758 LocalTheory.note etc.) now refer to the *full* internal name, not the
1759 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1761 * Disposed old type and term read functions (Sign.read_def_typ,
1762 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1763 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1764 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1765 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1766 resort for legacy applications.
1768 * Disposed old declarations, tactics, tactic combinators that refer to
1769 the simpset or claset of an implicit theory (such as Addsimps,
1770 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1771 embedded ML text, or local_simpset_of with a proper context passed as
1772 explicit runtime argument.
1774 * Rules and tactics that read instantiations (read_instantiate,
1775 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1776 context, which is required for parsing and type-checking. Moreover,
1777 the variables are specified as plain indexnames, not string encodings
1778 thereof. INCOMPATIBILITY.
1780 * Generic Toplevel.add_hook interface allows to analyze the result of
1781 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1782 for theorem dependency output of transactions resulting in a new
1785 * ML antiquotations: block-structured compilation context indicated by
1786 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1788 @{binding name} - basic name binding
1789 @{let ?pat = term} - term abbreviation (HO matching)
1790 @{note name = fact} - fact abbreviation
1791 @{thm fact} - singleton fact (with attributes)
1792 @{thms fact} - general fact (with attributes)
1793 @{lemma prop by method} - singleton goal
1794 @{lemma prop by meth1 meth2} - singleton goal
1795 @{lemma prop1 ... propN by method} - general goal
1796 @{lemma prop1 ... propN by meth1 meth2} - general goal
1797 @{lemma (open) ...} - open derivation
1802 * The Isabelle "emacs" tool provides a specific interface to invoke
1803 Proof General / Emacs, with more explicit failure if that is not
1804 installed (the old isabelle-interface script silently falls back on
1805 isabelle-process). The PROOFGENERAL_HOME setting determines the
1806 installation location of the Proof General distribution.
1808 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1809 the Isabelle process into a JVM/Scala application. See
1810 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1811 process wrapper has been discontinued.)
1813 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1815 * Various status messages (with exact source position information) are
1816 emitted, if proper markup print mode is enabled. This allows
1817 user-interface components to provide detailed feedback on internal
1822 New in Isabelle2008 (June 2008)
1823 -------------------------------
1827 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1828 and updated, with formally checked references as hyperlinks.
1830 * Theory loader: use_thy (and similar operations) no longer set the
1831 implicit ML context, which was occasionally hard to predict and in
1832 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1833 provides a proper context already.
1835 * Theory loader: old-style ML proof scripts being *attached* to a thy
1836 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1837 'use' within a theory file will do the job.
1839 * Name space merge now observes canonical order, i.e. the second space
1840 is inserted into the first one, while existing entries in the first
1841 space take precedence. INCOMPATIBILITY in rare situations, may try to
1842 swap theory imports.
1844 * Syntax: symbol \<chi> is now considered a letter. Potential
1845 INCOMPATIBILITY in identifier syntax etc.
1847 * Outer syntax: string tokens no longer admit escaped white space,
1848 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1849 white space without escapes.
1851 * Outer syntax: string tokens may contain arbitrary character codes
1852 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1858 * Context-dependent token translations. Default setup reverts locally
1859 fixed variables, and adds hilite markup for undeclared frees.
1861 * Unused theorems can be found using the new command 'unused_thms'.
1862 There are three ways of invoking it:
1865 Only finds unused theorems in the current theory.
1867 (2) unused_thms thy_1 ... thy_n -
1868 Finds unused theorems in the current theory and all of its ancestors,
1869 excluding the theories thy_1 ... thy_n and all of their ancestors.
1871 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1872 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1873 their ancestors, excluding the theories thy_1 ... thy_n and all of
1876 In order to increase the readability of the list produced by
1877 unused_thms, theorems that have been created by a particular instance
1878 of a theory command such as 'inductive' or 'function' are considered
1879 to belong to the same "group", meaning that if at least one theorem in
1880 this group is used, the other theorems in the same group are no longer
1881 reported as unused. Moreover, if all theorems in the group are
1882 unused, only one theorem in the group is displayed.
1884 Note that proof objects have to be switched on in order for
1885 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1886 usually the case when using Proof General with the default settings).
1888 * Authentic naming of facts disallows ad-hoc overwriting of previous
1889 theorems within the same name space. INCOMPATIBILITY, need to remove
1890 duplicate fact bindings, or even accidental fact duplications. Note
1891 that tools may maintain dynamically scoped facts systematically, using
1892 PureThy.add_thms_dynamic.
1894 * Command 'hide' now allows to hide from "fact" name space as well.
1896 * Eliminated destructive theorem database, simpset, claset, and
1897 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1898 update of theories within ML code.
1900 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1901 INCOMPATIBILITY, object-logics depending on former Pure require
1902 additional setup PureThy.old_appl_syntax_setup; object-logics
1903 depending on former CPure need to refer to Pure.
1905 * Commands 'use' and 'ML' are now purely functional, operating on
1906 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1907 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1910 * Command 'setup': discontinued implicit version with ML reference.
1912 * Instantiation target allows for simultaneous specification of class
1913 instance operations together with an instantiation proof.
1914 Type-checking phase allows to refer to class operations uniformly.
1915 See src/HOL/Complex/Complex.thy for an Isar example and
1916 src/HOL/Library/Eval.thy for an ML example.
1918 * Indexing of literal facts: be more serious about including only
1919 facts from the visible specification/proof context, but not the
1920 background context (locale etc.). Affects `prop` notation and method
1921 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1924 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1925 "(open)" option, which used to expose internal bound variables to the
1928 * Isar statements: removed obsolete case "rule_context".
1929 INCOMPATIBILITY, better use explicit fixes/assumes.
1931 * Locale proofs: default proof step now includes 'unfold_locales';
1932 hence 'proof' without argument may be used to unfold locale
1936 *** Document preparation ***
1938 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1939 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1940 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1941 spot); renamed link color from "darkblue" to "linkcolor" (default
1942 value unchanged, can be redefined via \definecolor); no longer sets
1943 "a4paper" option (unnecessary or even intrusive).
1945 * Antiquotation @{lemma A method} proves proposition A by the given
1946 method (either a method name or a method name plus (optional) method
1947 arguments in parentheses) and prints A just like @{prop A}.
1952 * New primrec package. Specification syntax conforms in style to
1953 definition/function/.... No separate induction rule is provided. The
1954 "primrec" command distinguishes old-style and new-style specifications
1955 by syntax. The former primrec package is now named OldPrimrecPackage.
1956 When adjusting theories, beware: constants stemming from new-style
1957 primrec specifications have authentic syntax.
1959 * Metis prover is now an order of magnitude faster, and also works
1960 with multithreading.
1962 * Metis: the maximum number of clauses that can be produced from a
1963 theorem is now given by the attribute max_clauses. Theorems that
1964 exceed this number are ignored, with a warning printed.
1966 * Sledgehammer no longer produces structured proofs by default. To
1967 enable, declare [[sledgehammer_full = true]]. Attributes
1968 reconstruction_modulus, reconstruction_sorts renamed
1969 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1971 * Method "induct_scheme" derives user-specified induction rules
1972 from well-founded induction and completeness of patterns. This factors
1973 out some operations that are done internally by the function package
1974 and makes them available separately. See
1975 src/HOL/ex/Induction_Scheme.thy for examples.
1977 * More flexible generation of measure functions for termination
1978 proofs: Measure functions can be declared by proving a rule of the
1979 form "is_measure f" and giving it the [measure_function] attribute.
1980 The "is_measure" predicate is logically meaningless (always true), and
1981 just guides the heuristic. To find suitable measure functions, the
1982 termination prover sets up the goal "is_measure ?f" of the appropriate
1983 type and generates all solutions by prolog-style backwards proof using
1986 This setup also deals with rules like
1988 "is_measure f ==> is_measure (list_size f)"
1990 which accommodates nested datatypes that recurse through lists.
1991 Similar rules are predeclared for products and option types.
1993 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1997 - Definitions of overloaded constants on sets have to be replaced by
1998 definitions on => and bool.
2000 - Some definitions of overloaded operators on sets can now be proved
2001 using the definitions of the operators on => and bool. Therefore,
2002 the following theorems have been renamed:
2004 subset_def -> subset_eq
2005 psubset_def -> psubset_eq
2006 set_diff_def -> set_diff_eq
2007 Compl_def -> Compl_eq
2008 Sup_set_def -> Sup_set_eq
2009 Inf_set_def -> Inf_set_eq
2010 sup_set_def -> sup_set_eq
2011 inf_set_def -> inf_set_eq
2013 - Due to the incompleteness of the HO unification algorithm, some
2014 rules such as subst may require manual instantiation, if some of
2015 the unknowns in the rule is a set.
2017 - Higher order unification and forward proofs:
2020 have "P (S::'a set)" <...>
2021 then have "EX S. P S" ..
2023 no longer works (due to the incompleteness of the HO unification
2024 algorithm) and must be replaced by the pattern
2031 - Calculational reasoning with subst (or similar rules):
2034 have "P (S::'a set)" <...>
2035 also have "S = T" <...>
2036 finally have "P T" .
2038 no longer works (for similar reasons as the previous example) and
2039 must be replaced by something like
2041 have "P (S::'a set)" <...>
2042 moreover have "S = T" <...>
2043 ultimately have "P T" by simp
2045 - Tactics or packages written in ML code:
2046 Code performing pattern matching on types via
2048 Type ("set", [T]) => ...
2050 must be rewritten. Moreover, functions like strip_type or
2051 binder_types no longer return the right value when applied to a
2054 T1 => ... => Tn => U => bool
2058 T1 => ... => Tn => U set
2060 * Merged theories Wellfounded_Recursion, Accessible_Part and
2061 Wellfounded_Relations to theory Wellfounded.
2063 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2065 * Class finite no longer treats UNIV as class parameter. Use class
2066 enum from theory Library/Enum instead to achieve a similar effect.
2069 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2070 and "Cons". INCOMPATIBILITY.
2072 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2073 Potential INCOMPATIBILITY.
2075 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2076 injective_fst_snd removed, use split_eta and prod_eqI instead.
2077 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2079 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2080 the same name in theory Orderings:
2090 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2091 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2092 and different variable names.
2094 * Library/Option_ord.thy: Canonical order on option type.
2096 * Library/RBT.thy: Red-black trees, an efficient implementation of
2099 * Library/Countable.thy: Type class for countable types.
2101 * Theory Int: The representation of numerals has changed. The infix
2102 operator BIT and the bit datatype with constructors B0 and B1 have
2103 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2104 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2105 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2108 * Theory Nat: definition of <= and < on natural numbers no longer
2109 depend on well-founded relations. INCOMPATIBILITY. Definitions
2110 le_def and less_def have disappeared. Consider lemmas not_less
2111 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2113 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2114 (whose purpose mainly is for various fold_set functionals) have been
2115 abandoned in favor of the existing algebraic classes
2116 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2117 lower_semilattice (resp. upper_semilattice) and linorder.
2120 * Theory Transitive_Closure: induct and cases rules now declare proper
2121 case_names ("base" and "step"). INCOMPATIBILITY.
2123 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2124 lattices. The form set-specific version is available as
2125 Inductive.lfp_ordinal_induct_set.
2127 * Renamed theorems "power.simps" to "power_int.simps".
2130 * Class semiring_div provides basic abstract properties of semirings
2131 with division and modulo operations. Subsumes former class dvd_mod.
2133 * Merged theories IntDef, Numeral and IntArith into unified theory
2134 Int. INCOMPATIBILITY.
2136 * Theory Library/Code_Index: type "index" now represents natural
2137 numbers rather than integers. INCOMPATIBILITY.
2139 * New class "uminus" with operation "uminus" (split of from class
2140 "minus" which now only has operation "minus", binary).
2143 * Constants "card", "internal_split", "option_map" now with authentic
2144 syntax. INCOMPATIBILITY.
2146 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2147 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2148 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2149 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2150 Sup_set_def, le_def, less_def, option_map_def now with object
2151 equality. INCOMPATIBILITY.
2153 * Records. Removed K_record, and replaced it by pure lambda term
2154 %x. c. The simplifier setup is now more robust against eta expansion.
2155 INCOMPATIBILITY: in cases explicitly referring to K_record.
2157 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2159 * Library/ListVector: new theory of arithmetic vector operations.
2161 * Library/Order_Relation: new theory of various orderings as sets of
2162 pairs. Defines preorders, partial orders, linear orders and
2163 well-orders on sets and on types.
2168 * Renamed some theories to allow to loading both ZF and HOL in the
2171 Datatype -> Datatype_ZF
2172 Inductive -> Inductive_ZF
2179 INCOMPATIBILITY: ZF theories that import individual theories below
2180 Main might need to be adapted. Regular theory Main is still
2181 available, as trivial extension of Main_ZF.
2186 * ML within Isar: antiquotation @{const name} or @{const
2187 name(typargs)} produces statically-checked Const term.
2189 * Functor NamedThmsFun: data is available to the user as dynamic fact
2190 (of the same name). Removed obsolete print command.
2192 * Removed obsolete "use_legacy_bindings" function.
2194 * The ``print mode'' is now a thread-local value derived from a global
2195 template (the former print_mode reference), thus access becomes
2196 non-critical. The global print_mode reference is for session
2197 management only; user-code should use print_mode_value,
2198 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2200 * Functions system/system_out provide a robust way to invoke external
2201 shell commands, with propagation of interrupts (requires Poly/ML
2202 5.2.1). Do not use OS.Process.system etc. from the basis library!
2207 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2208 in accordance with Proof General 3.7, which prefers GNU emacs.
2210 * isatool tty runs Isabelle process with plain tty interaction;
2211 optional line editor may be specified via ISABELLE_LINE_EDITOR
2212 setting, the default settings attempt to locate "ledit" and "rlwrap".
2214 * isatool browser now works with Cygwin as well, using general
2215 "javapath" function defined in Isabelle process environment.
2217 * YXML notation provides a simple and efficient alternative to
2218 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2219 isatool yxml as described in the Isabelle system manual.
2221 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2222 provides general wrapper for managing an Isabelle process in a robust
2223 fashion, with ``cooked'' output from stdin/stderr.
2225 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2226 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2228 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2229 way of changing the user's settings is via
2230 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2233 * Multithreading.max_threads := 0 refers to the number of actual CPU
2234 cores of the underlying machine, which is a good starting point for
2235 optimal performance tuning. The corresponding usedir option -M allows
2236 "max" as an alias for "0". WARNING: does not work on certain versions
2237 of Mac OS (with Poly/ML 5.1).
2239 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2240 adverse effect of Isabelle flooding interactive front-ends (notably
2241 ProofGeneral / XEmacs).
2245 New in Isabelle2007 (November 2007)
2246 -----------------------------------
2250 * More uniform information about legacy features, notably a
2251 warning/error of "Legacy feature: ...", depending on the state of the
2252 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2253 legacy features will disappear eventually.
2255 * Theory syntax: the header format ``theory A = B + C:'' has been
2256 discontinued in favour of ``theory A imports B C begin''. Use isatool
2257 fixheaders to convert existing theory files. INCOMPATIBILITY.
2259 * Theory syntax: the old non-Isar theory file format has been
2260 discontinued altogether. Note that ML proof scripts may still be used
2261 with Isar theories; migration is usually quite simple with the ML
2262 function use_legacy_bindings. INCOMPATIBILITY.
2264 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2265 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2268 * Theory loader: be more serious about observing the static theory
2269 header specifications (including optional directories), but not the
2270 accidental file locations of previously successful loads. The strict
2271 update policy of former update_thy is now already performed by
2272 use_thy, so the former has been removed; use_thys updates several
2273 theories simultaneously, just as 'imports' within a theory header
2274 specification, but without merging the results. Potential
2275 INCOMPATIBILITY: may need to refine theory headers and commands
2276 ROOT.ML which depend on load order.
2278 * Theory loader: optional support for content-based file
2279 identification, instead of the traditional scheme of full physical
2280 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2281 (cf. the system manual). The new scheme allows to work with
2282 non-finished theories in persistent session images, such that source
2283 files may be moved later on without requiring reloads.
2285 * Theory loader: old-style ML proof scripts being *attached* to a thy
2286 file (with the same base name as the theory) are considered a legacy
2287 feature, which will disappear eventually. Even now, the theory loader
2288 no longer maintains dependencies on such files.
2290 * Syntax: the scope for resolving ambiguities via type-inference is
2291 now limited to individual terms, instead of whole simultaneous
2292 specifications as before. This greatly reduces the complexity of the
2293 syntax module and improves flexibility by separating parsing and
2294 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2295 'fixes' etc.) are required in rare situations.
2297 * Syntax: constants introduced by new-style packages ('definition',
2298 'abbreviation' etc.) are passed through the syntax module in
2299 ``authentic mode''. This means that associated mixfix annotations
2300 really stick to such constants, independently of potential name space
2301 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2302 trees are represented slightly differently, may need to adapt syntax
2303 translations accordingly. Use CONST marker in 'translations' and
2304 @{const_syntax} antiquotation in 'parse_translation' etc.
2306 * Legacy goal package: reduced interface to the bare minimum required
2307 to keep existing proof scripts running. Most other user-level
2308 functions are now part of the OldGoals structure, which is *not* open
2309 by default (consider isatool expandshort before open OldGoals).
2310 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2311 these tend to cause confusion about the actual goal (!) context being
2312 used here, which is not necessarily the same as the_context().
2314 * Command 'find_theorems': supports "*" wild-card in "name:"
2315 criterion; "with_dups" option. Certain ProofGeneral versions might
2316 support a specific search form (see ProofGeneral/CHANGES).
2318 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2319 by default, which means that "prems" (and also "fixed variables") are
2320 suppressed from proof state output. Note that the ProofGeneral
2321 settings mechanism allows to change and save options persistently, but
2322 older versions of Isabelle will fail to start up if a negative prems
2325 * Local theory targets may be specified by non-nested blocks of
2326 ``context/locale/class ... begin'' followed by ``end''. The body may
2327 contain definitions, theorems etc., including any derived mechanism
2328 that has been implemented on top of these primitives. This concept
2329 generalizes the existing ``theorem (in ...)'' towards more versatility
2332 * Proof General interface: proper undo of final 'end' command;
2333 discontinued Isabelle/classic mode (ML proof scripts).
2336 *** Document preparation ***
2338 * Added antiquotation @{theory name} which prints the given name,
2339 after checking that it refers to a valid ancestor theory in the
2342 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2343 check the given source text as ML type/structure, printing verbatim.
2345 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2346 "c args == rhs" given in the current context. (Any number of
2347 arguments may be given on the LHS.)
2352 * The 'class' package offers a combination of axclass and locale to
2353 achieve Haskell-like type classes in Isabelle. Definitions and
2354 theorems within a class context produce both relative results (with
2355 implicit parameters according to the locale context), and polymorphic
2356 constants with qualified polymorphism (according to the class
2357 context). Within the body context of a 'class' target, a separate
2358 syntax layer ("user space type system") takes care of converting
2359 between global polymorphic consts and internal locale representation.
2360 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2361 "isatool doc classes" provides a tutorial.
2363 * Generic code generator framework allows to generate executable
2364 code for ML and Haskell (including Isabelle classes). A short usage
2367 internal compilation:
2368 export_code <list of constants (term syntax)> in SML
2369 writing SML code to a file:
2370 export_code <list of constants (term syntax)> in SML <filename>
2371 writing OCaml code to a file:
2372 export_code <list of constants (term syntax)> in OCaml <filename>
2373 writing Haskell code to a bunch of files:
2374 export_code <list of constants (term syntax)> in Haskell <filename>
2376 evaluating closed propositions to True/False using code generation:
2379 Reasonable default setup of framework in HOL.
2381 Theorem attributs for selecting and transforming function equations theorems:
2383 [code fun]: select a theorem as function equation for a specific constant
2384 [code fun del]: deselect a theorem as function equation for a specific constant
2385 [code inline]: select an equation theorem for unfolding (inlining) in place
2386 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2388 User-defined serializations (target in {SML, OCaml, Haskell}):
2390 code_const <and-list of constants (term syntax)>
2391 {(target) <and-list of const target syntax>}+
2393 code_type <and-list of type constructors>
2394 {(target) <and-list of type target syntax>}+
2396 code_instance <and-list of instances>
2398 where instance ::= <type constructor> :: <class>
2400 code_class <and_list of classes>
2401 {(target) <and-list of class target syntax>}+
2402 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2404 code_instance and code_class only are effective to target Haskell.
2406 For example usage see src/HOL/ex/Codegenerator.thy and
2407 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2408 generation from Isabelle/HOL theories is available via "isatool doc
2411 * Code generator: consts in 'consts_code' Isar commands are now
2412 referred to by usual term syntax (including optional type
2415 * Command 'no_translations' removes translation rules from theory
2418 * Overloaded definitions are now actually checked for acyclic
2419 dependencies. The overloading scheme is slightly more general than
2420 that of Haskell98, although Isabelle does not demand an exact
2421 correspondence to type class and instance declarations.
2422 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2423 exotic versions of overloading -- at the discretion of the user!
2425 Polymorphic constants are represented via type arguments, i.e. the
2426 instantiation that matches an instance against the most general
2427 declaration given in the signature. For example, with the declaration
2428 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2429 as c(nat). Overloading is essentially simultaneous structural
2430 recursion over such type arguments. Incomplete specification patterns
2431 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2432 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2433 Command 'print_theory' outputs the normalized system of recursive
2434 equations, see section "definitions".
2436 * Configuration options are maintained within the theory or proof
2437 context (with name and type bool/int/string), providing a very simple
2438 interface to a poor-man's version of general context data. Tools may
2439 declare options in ML (e.g. using Attrib.config_int) and then refer to
2440 these values using Config.get etc. Users may change options via an
2441 associated attribute of the same name. This form of context
2442 declaration works particularly well with commands 'declare' or
2443 'using', for example ``declare [[foo = 42]]''. Thus it has become
2444 very easy to avoid global references, which would not observe Isar
2445 toplevel undo/redo and fail to work with multithreading.
2447 Various global ML references of Pure and HOL have been turned into
2448 configuration options:
2450 Unify.search_bound unify_search_bound
2451 Unify.trace_bound unify_trace_bound
2452 Unify.trace_simp unify_trace_simp
2453 Unify.trace_types unify_trace_types
2454 Simplifier.simp_depth_limit simp_depth_limit
2455 Blast.depth_limit blast_depth_limit
2456 DatatypeProp.dtK datatype_distinctness_limit
2457 fast_arith_neq_limit fast_arith_neq_limit
2458 fast_arith_split_limit fast_arith_split_limit
2460 * Named collections of theorems may be easily installed as context
2461 data using the functor NamedThmsFun (see also
2462 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2463 attributes; there is also a toplevel print command. This facility is
2464 just a common case of general context data, which is the preferred way
2465 for anything more complex than just a list of facts in canonical
2468 * Isar: command 'declaration' augments a local theory by generic
2469 declaration functions written in ML. This enables arbitrary content
2470 being added to the context, depending on a morphism that tells the
2471 difference of the original declaration context wrt. the application
2472 context encountered later on.
2474 * Isar: proper interfaces for simplification procedures. Command
2475 'simproc_setup' declares named simprocs (with match patterns, and body
2476 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2477 context. ML antiquotation @{simproc name} retrieves named simprocs.
2479 * Isar: an extra pair of brackets around attribute declarations
2480 abbreviates a theorem reference involving an internal dummy fact,
2481 which will be ignored later --- only the effect of the attribute on
2482 the background context will persist. This form of in-place
2483 declarations is particularly useful with commands like 'declare' and
2484 'using', for example ``have A using [[simproc a]] by simp''.
2486 * Isar: method "assumption" (and implicit closing of subproofs) now
2487 takes simple non-atomic goal assumptions into account: after applying
2488 an assumption as a rule the resulting subgoals are solved by atomic
2489 assumption steps. This is particularly useful to finish 'obtain'
2490 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2491 without referring to the original premise "!!x. P x ==> thesis" in the
2492 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2495 * Isar: implicit use of prems from the Isar proof context is
2496 considered a legacy feature. Common applications like ``have A .''
2497 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2498 referencing facts explicitly here improves readability and
2499 maintainability of proof texts.
2501 * Isar: improper proof element 'guess' is like 'obtain', but derives
2502 the obtained context from the course of reasoning! For example:
2504 assume "EX x y. A x & B y" -- "any previous fact"
2505 then guess x and y by clarify
2507 This technique is potentially adventurous, depending on the facts and
2508 proof tools being involved here.
2510 * Isar: known facts from the proof context may be specified as literal
2511 propositions, using ASCII back-quote syntax. This works wherever
2512 named facts used to be allowed so far, in proof commands, proof
2513 methods, attributes etc. Literal facts are retrieved from the context
2514 according to unification of type and term parameters. For example,
2515 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2516 theorems in the current context, then these are valid literal facts:
2517 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2519 There is also a proof method "fact" which does the same composition
2520 for explicit goal states, e.g. the following proof texts coincide with
2521 certain special cases of literal facts:
2523 have "A" by fact == note `A`
2524 have "A ==> B" by fact == note `A ==> B`
2525 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2526 have "P a ==> Q a" by fact == note `P a ==> Q a`
2528 * Isar: ":" (colon) is no longer a symbolic identifier character in
2529 outer syntax. Thus symbolic identifiers may be used without
2530 additional white space in declarations like this: ``assume *: A''.
2532 * Isar: 'print_facts' prints all local facts of the current context,
2533 both named and unnamed ones.
2535 * Isar: 'def' now admits simultaneous definitions, e.g.:
2537 def x == "t" and y == "u"
2539 * Isar: added command 'unfolding', which is structurally similar to
2540 'using', but affects both the goal state and facts by unfolding given
2541 rewrite rules. Thus many occurrences of the 'unfold' method or
2542 'unfolded' attribute may be replaced by first-class proof text.
2544 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2545 and command 'unfolding' now all support object-level equalities
2546 (potentially conditional). The underlying notion of rewrite rule is
2547 analogous to the 'rule_format' attribute, but *not* that of the
2548 Simplifier (which is usually more generous).
2550 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2551 premises of a theorem by n. Useful in conjunction with drule.
2553 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2554 method expression within a sandbox consisting of the first N
2555 sub-goals, which need to exist. For example, ``simp_all [3]''
2556 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2557 simplifies all new goals that emerge from applying rule foo to the
2558 originally first one.
2560 * Isar: schematic goals are no longer restricted to higher-order
2561 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2564 * Isar: the conclusion of a long theorem statement is now either
2565 'shows' (a simultaneous conjunction, as before), or 'obtains'
2566 (essentially a disjunction of cases with local parameters and
2567 assumptions). The latter allows to express general elimination rules
2568 adequately; in this notation common elimination rules look like this:
2570 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2572 obtains x where "P x"
2574 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2578 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2584 The subsequent classical rules even refer to the formal "thesis"
2587 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2590 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2591 obtains "thesis ==> something"
2593 The actual proof of an 'obtains' statement is analogous to that of the
2594 Isar proof element 'obtain', only that there may be several cases.
2595 Optional case names may be specified in parentheses; these will be
2596 available both in the present proof and as annotations in the
2597 resulting rule, for later use with the 'cases' method (cf. attribute
2600 * Isar: the assumptions of a long theorem statement are available as
2601 "assms" fact in the proof context. This is more appropriate than the
2602 (historical) "prems", which refers to all assumptions of the current
2603 context, including those from the target locale, proof body etc.
2605 * Isar: 'print_statement' prints theorems from the current theory or
2606 proof context in long statement form, according to the syntax of a
2609 * Isar: 'obtain' takes an optional case name for the local context
2610 introduction rule (default "that").
2612 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2613 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2616 * Pure: syntax "CONST name" produces a fully internalized constant
2617 according to the current context. This is particularly useful for
2618 syntax translations that should refer to internal constant
2619 representations independently of name spaces.
2621 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2622 instead of "FOO ". This allows multiple binder declarations to coexist
2623 in the same context. INCOMPATIBILITY.
2625 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2626 primitive that also works in a locale context (both for constants and
2627 fixed variables). Type declaration and internal syntactic representation
2628 of given constants retrieved from the context. Likewise, the
2629 'no_notation' command allows to remove given syntax annotations from the
2632 * Isar/locales: new derived specification elements 'axiomatization',
2633 'definition', 'abbreviation', which support type-inference, admit
2634 object-level specifications (equality, equivalence). See also the
2635 isar-ref manual. Examples:
2638 eq (infix "===" 50) where
2639 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2641 definition "f x y = x + y + 1"
2642 definition g where "g x = f x x"
2645 neq (infix "=!=" 50) where
2646 "x =!= y == ~ (x === y)"
2648 These specifications may be also used in a locale context. Then the
2649 constants being introduced depend on certain fixed parameters, and the
2650 constant name is qualified by the locale base name. An internal
2651 abbreviation takes care for convenient input and output, making the
2652 parameters implicit and using the original short name. See also
2653 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2654 entities from a monomorphic theory.
2656 Presently, abbreviations are only available 'in' a target locale, but
2657 not inherited by general import expressions. Also note that
2658 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2659 'translations' in common applications. The "no_abbrevs" print mode
2660 prevents folding of abbreviations in term output.
2662 Concrete syntax is attached to specified constants in internal form,
2663 independently of name spaces. The parse tree representation is
2664 slightly different -- use 'notation' instead of raw 'syntax', and
2665 'translations' with explicit "CONST" markup to accommodate this.
2667 * Pure/Isar: unified syntax for new-style specification mechanisms
2668 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2669 full type inference and dummy patterns ("_"). For example:
2671 definition "K x _ = x"
2673 inductive conj for A B
2674 where "A ==> B ==> conj A B"
2676 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2677 the current context. Print mode "no_abbrevs" prevents inversion of
2678 abbreviations on output.
2680 * Isar/locales: improved parameter handling: use of locales "var" and
2681 "struct" no longer necessary; - parameter renamings are no longer
2682 required to be injective. For example, this allows to define
2683 endomorphisms as locale endom = homom mult mult h.
2685 * Isar/locales: changed the way locales with predicates are defined.
2686 Instead of accumulating the specification, the imported expression is
2687 now an interpretation. INCOMPATIBILITY: different normal form of
2688 locale expressions. In particular, in interpretations of locales with
2689 predicates, goals repesenting already interpreted fragments are not
2690 removed automatically. Use methods `intro_locales' and
2691 `unfold_locales'; see below.
2693 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2694 provide backward reasoning on locales predicates. The methods are
2695 aware of interpretations and discharge corresponding goals.
2696 `intro_locales' is less aggressive then `unfold_locales' and does not
2697 unfold predicates to assumptions.
2699 * Isar/locales: the order in which locale fragments are accumulated
2700 has changed. This enables to override declarations from fragments due
2701 to interpretations -- for example, unwanted simp rules.
2703 * Isar/locales: interpretation in theories and proof contexts has been
2704 extended. One may now specify (and prove) equations, which are
2705 unfolded in interpreted theorems. This is useful for replacing
2706 defined concepts (constants depending on locale parameters) by
2707 concepts already existing in the target context. Example:
2709 interpretation partial_order ["op <= :: [int, int] => bool"]
2710 where "partial_order.less (op <=) (x::int) y = (x < y)"
2712 Typically, the constant `partial_order.less' is created by a
2713 definition specification element in the context of locale
2716 * Method "induct": improved internal context management to support
2717 local fixes and defines on-the-fly. Thus explicit meta-level
2718 connectives !! and ==> are rarely required anymore in inductive goals
2719 (using object-logic connectives for this purpose has been long
2720 obsolete anyway). Common proof patterns are explained in
2721 src/HOL/Induct/Common_Patterns.thy, see also
2722 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2725 * Method "induct": improved handling of simultaneous goals. Instead of
2726 introducing object-level conjunction, the statement is now split into
2727 several conclusions, while the corresponding symbolic cases are nested
2728 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2729 see src/HOL/Induct/Common_Patterns.thy, for example.
2731 * Method "induct": mutual induction rules are now specified as a list
2732 of rule sharing the same induction cases. HOL packages usually provide
2733 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2734 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2735 mutual induction rules differently, i.e. like this:
2737 (induct rule: foo_bar.inducts)
2738 (induct set: foo bar)
2739 (induct pred: foo bar)
2740 (induct type: foo bar)
2742 The ML function ProjectRule.projections turns old-style rules into the
2745 * Method "coinduct": dual of induction, see
2746 src/HOL/Library/Coinductive_List.thy for various examples.
2748 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2749 considered a legacy feature.
2751 * Attribute "symmetric" produces result with standardized schematic
2752 variables (index 0). Potential INCOMPATIBILITY.
2754 * Simplifier: by default the simplifier trace only shows top level
2755 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2756 default. Thus there is less danger of being flooded by the trace. The
2757 trace indicates where parts have been suppressed.
2759 * Provers/classical: removed obsolete classical version of elim_format
2760 attribute; classical elim/dest rules are now treated uniformly when
2761 manipulating the claset.
2763 * Provers/classical: stricter checks to ensure that supplied intro,
2764 dest and elim rules are well-formed; dest and elim rules must have at
2767 * Provers/classical: attributes dest/elim/intro take an optional
2768 weight argument for the rule (just as the Pure versions). Weights are
2769 ignored by automated tools, but determine the search order of single
2772 * Syntax: input syntax now supports dummy variable binding "%_. b",
2773 where the body does not mention the bound variable. Note that dummy
2774 patterns implicitly depend on their context of bounds, which makes
2775 "{_. _}" match any set comprehension as expected. Potential
2776 INCOMPATIBILITY -- parse translations need to cope with syntactic
2777 constant "_idtdummy" in the binding position.
2779 * Syntax: removed obsolete syntactic constant "_K" and its associated
2780 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2781 for example "A -> B" => "Pi A (%_. B)".
2783 * Pure: 'class_deps' command visualizes the subclass relation, using
2784 the graph browser tool.
2786 * Pure: 'print_theory' now suppresses certain internal declarations by
2787 default; use '!' option for full details.
2792 * Method "metis" proves goals by applying the Metis general-purpose
2793 resolution prover (see also http://gilith.com/software/metis/).
2794 Examples are in the directory MetisExamples. WARNING: the
2795 Isabelle/HOL-Metis integration does not yet work properly with
2798 * Command 'sledgehammer' invokes external automatic theorem provers as
2799 background processes. It generates calls to the "metis" method if
2800 successful. These can be pasted into the proof. Users do not have to
2801 wait for the automatic provers to return. WARNING: does not really
2802 work with multi-threading.
2804 * New "auto_quickcheck" feature tests outermost goal statements for
2805 potential counter-examples. Controlled by ML references
2806 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2807 5000 milliseconds). Fails silently if statements is outside of
2808 executable fragment, or any other codgenerator problem occurs.
2810 * New constant "undefined" with axiom "undefined x = undefined".
2812 * Added class "HOL.eq", allowing for code generation with polymorphic
2815 * Some renaming of class constants due to canonical name prefixing in
2816 the new 'class' package:
2818 HOL.abs ~> HOL.abs_class.abs
2819 HOL.divide ~> HOL.divide_class.divide
2820 0 ~> HOL.zero_class.zero
2821 1 ~> HOL.one_class.one
2822 op + ~> HOL.plus_class.plus
2823 op - ~> HOL.minus_class.minus
2824 uminus ~> HOL.minus_class.uminus
2825 op * ~> HOL.times_class.times
2826 op < ~> HOL.ord_class.less
2827 op <= > HOL.ord_class.less_eq
2828 Nat.power ~> Power.power_class.power
2829 Nat.size ~> Nat.size_class.size
2830 Numeral.number_of ~> Numeral.number_class.number_of
2831 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2832 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2833 Orderings.min ~> Orderings.ord_class.min
2834 Orderings.max ~> Orderings.ord_class.max
2835 Divides.op div ~> Divides.div_class.div
2836 Divides.op mod ~> Divides.div_class.mod
2837 Divides.op dvd ~> Divides.div_class.dvd
2839 INCOMPATIBILITY. Adaptions may be required in the following cases:
2841 a) User-defined constants using any of the names "plus", "minus",
2842 "times", "less" or "less_eq". The standard syntax translations for
2843 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2846 b) Variables named "plus", "minus", "times", "less", "less_eq"
2847 INCOMPATIBILITY: use more specific names.
2849 c) Permutative equations (e.g. "a + b = b + a")
2850 Since the change of names also changes the order of terms, permutative
2851 rewrite rules may get applied in a different order. Experience shows
2852 that this is rarely the case (only two adaptions in the whole Isabelle
2853 distribution). INCOMPATIBILITY: rewrite proofs
2855 d) ML code directly refering to constant names
2856 This in general only affects hand-written proof tactics, simprocs and
2857 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2858 Consider using @{const_name} antiquotation.
2860 * New class "default" with associated constant "default".
2862 * Function "sgn" is now overloaded and available on int, real, complex
2863 (and other numeric types), using class "sgn". Two possible defs of
2864 sgn are given as equational assumptions in the classes sgn_if and
2865 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2868 * Locale "partial_order" now unified with class "order" (cf. theory
2869 Orderings), added parameter "less". INCOMPATIBILITY.
2871 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2872 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2873 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2875 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2876 changed order of proof goals in instance proofs.
2878 * The transitivity reasoner for partial and linear orders is set up
2879 for classes "order" and "linorder". Instances of the reasoner are available
2880 in all contexts importing or interpreting the corresponding locales.
2881 Method "order" invokes the reasoner separately; the reasoner
2882 is also integrated with the Simplifier as a solver. Diagnostic
2883 command 'print_orders' shows the available instances of the reasoner
2884 in the current context.
2886 * Localized monotonicity predicate in theory "Orderings"; integrated
2887 lemmas max_of_mono and min_of_mono with this predicate.
2890 * Formulation of theorem "dense" changed slightly due to integration
2891 with new class dense_linear_order.
2893 * Uniform lattice theory development in HOL.
2895 constants "meet" and "join" now named "inf" and "sup"
2896 constant "Meet" now named "Inf"
2898 classes "meet_semilorder" and "join_semilorder" now named
2899 "lower_semilattice" and "upper_semilattice"
2900 class "lorder" now named "lattice"
2901 class "comp_lat" now named "complete_lattice"
2903 Instantiation of lattice classes allows explicit definitions
2904 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2906 INCOMPATIBILITY. Theorem renames:
2908 meet_left_le ~> inf_le1
2909 meet_right_le ~> inf_le2
2910 join_left_le ~> sup_ge1
2911 join_right_le ~> sup_ge2
2912 meet_join_le ~> inf_sup_ord
2915 le_meet ~> le_inf_iff
2916 le_join ~> ge_sup_conv
2917 meet_idempotent ~> inf_idem
2918 join_idempotent ~> sup_idem
2919 meet_comm ~> inf_commute
2920 join_comm ~> sup_commute
2921 meet_leI1 ~> le_infI1
2922 meet_leI2 ~> le_infI2
2923 le_joinI1 ~> le_supI1
2924 le_joinI2 ~> le_supI2
2925 meet_assoc ~> inf_assoc
2926 join_assoc ~> sup_assoc
2927 meet_left_comm ~> inf_left_commute
2928 meet_left_idempotent ~> inf_left_idem
2929 join_left_comm ~> sup_left_commute
2930 join_left_idempotent ~> sup_left_idem
2933 le_def_meet ~> le_iff_inf
2934 le_def_join ~> le_iff_sup
2935 join_absorp2 ~> sup_absorb2
2936 join_absorp1 ~> sup_absorb1
2937 meet_absorp1 ~> inf_absorb1
2938 meet_absorp2 ~> inf_absorb2
2939 meet_join_absorp ~> inf_sup_absorb
2940 join_meet_absorp ~> sup_inf_absorb
2941 distrib_join_le ~> distrib_sup_le
2942 distrib_meet_le ~> distrib_inf_le
2944 add_meet_distrib_left ~> add_inf_distrib_left
2945 add_join_distrib_left ~> add_sup_distrib_left
2946 is_join_neg_meet ~> is_join_neg_inf
2947 is_meet_neg_join ~> is_meet_neg_sup
2948 add_meet_distrib_right ~> add_inf_distrib_right
2949 add_join_distrib_right ~> add_sup_distrib_right
2950 add_meet_join_distribs ~> add_sup_inf_distribs
2951 join_eq_neg_meet ~> sup_eq_neg_inf
2952 meet_eq_neg_join ~> inf_eq_neg_sup
2953 add_eq_meet_join ~> add_eq_inf_sup
2954 meet_0_imp_0 ~> inf_0_imp_0
2955 join_0_imp_0 ~> sup_0_imp_0
2956 meet_0_eq_0 ~> inf_0_eq_0
2957 join_0_eq_0 ~> sup_0_eq_0
2958 neg_meet_eq_join ~> neg_inf_eq_sup
2959 neg_join_eq_meet ~> neg_sup_eq_inf
2960 join_eq_if ~> sup_eq_if
2962 mono_meet ~> mono_inf
2963 mono_join ~> mono_sup
2964 meet_bool_eq ~> inf_bool_eq
2965 join_bool_eq ~> sup_bool_eq
2966 meet_fun_eq ~> inf_fun_eq
2967 join_fun_eq ~> sup_fun_eq
2968 meet_set_eq ~> inf_set_eq
2969 join_set_eq ~> sup_set_eq
2970 meet1_iff ~> inf1_iff
2971 meet2_iff ~> inf2_iff
2980 join1_iff ~> sup1_iff
2981 join2_iff ~> sup2_iff
2991 is_meet_Meet ~> is_meet_Inf
2992 Meet_bool_def ~> Inf_bool_def
2993 Meet_fun_def ~> Inf_fun_def
2994 Meet_greatest ~> Inf_greatest
2995 Meet_lower ~> Inf_lower
2996 Meet_set_def ~> Inf_set_def
2999 Sup_bool_eq ~> Sup_bool_def
3000 Sup_fun_eq ~> Sup_fun_def
3001 Sup_set_eq ~> Sup_set_def
3003 listsp_meetI ~> listsp_infI
3004 listsp_meet_eq ~> listsp_inf_eq
3009 * Added syntactic class "size"; overloaded constant "size" now has
3010 type "'a::size ==> bool"
3012 * Internal reorganisation of `size' of datatypes: size theorems
3013 "foo.size" are no longer subsumed by "foo.simps" (but are still
3014 simplification rules by default!); theorems "prod.size" now named
3017 * Class "div" now inherits from class "times" rather than "type".
3020 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3021 Linorder etc. have disappeared; operations defined in terms of
3022 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3024 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3026 * HOL-Word: New extensive library and type for generic, fixed size
3027 machine words, with arithemtic, bit-wise, shifting and rotating
3028 operations, reflection into int, nat, and bool lists, automation for
3029 linear arithmetic (by automatic reflection into nat or int), including
3030 lemmas on overflow and monotonicity. Instantiated to all appropriate
3031 arithmetic type classes, supporting automatic simplification of
3032 numerals on all operations.
3034 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3036 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3038 * Code generator library theories:
3039 - Code_Integer represents HOL integers by big integer literals in target
3041 - Code_Char represents HOL characters by character literals in target
3043 - Code_Char_chr like Code_Char, but also offers treatment of character
3044 codes; includes Code_Integer.
3045 - Executable_Set allows to generate code for finite sets using lists.
3046 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3048 - Executable_Real implements a subset of real numbers, namly those
3049 representable by rational numbers.
3050 - Efficient_Nat implements natural numbers by integers, which in general will
3051 result in higher efficency; pattern matching with 0/Suc is eliminated;
3052 includes Code_Integer.
3053 - Code_Index provides an additional datatype index which is mapped to
3054 target-language built-in integers.
3055 - Code_Message provides an additional datatype message_string which is isomorphic to
3056 strings; messages are mapped to target-language strings.
3058 * New package for inductive predicates
3060 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3063 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3064 for z_1 :: U_1 and ... and z_n :: U_m
3066 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3069 with full support for type-inference, rather than
3071 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3073 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3074 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3076 inductive "s z_1 ... z_m"
3078 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3081 For backward compatibility, there is a wrapper allowing inductive
3082 sets to be defined with the new package via
3085 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3086 for z_1 :: U_1 and ... and z_n :: U_m
3088 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3094 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3095 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3096 for z_1 :: U_1 and ... and z_n :: U_m
3098 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3099 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3102 if the additional syntax "p ..." is required.
3104 Numerous examples can be found in the subdirectories src/HOL/Auth,
3105 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3109 - Since declaration and definition of inductive sets or predicates
3110 is no longer separated, abbreviations involving the newly
3111 introduced sets or predicates must be specified together with the
3112 introduction rules after the 'where' keyword (see above), rather
3113 than before the actual inductive definition.
3115 - The variables in induction and elimination rules are now
3116 quantified in the order of their occurrence in the introduction
3117 rules, rather than in alphabetical order. Since this may break
3118 some proofs, these proofs either have to be repaired, e.g. by
3119 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3120 statements of the form
3122 case (rule_i a_i_1 ... a_i_{k_i})
3124 or the old order of quantification has to be restored by explicitly adding
3125 meta-level quantifiers in the introduction rules, i.e.
3127 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3129 - The format of the elimination rules is now
3131 p z_1 ... z_m x_1 ... x_n ==>
3132 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3137 (x_1, ..., x_n) : s z_1 ... z_m ==>
3138 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3141 for sets rather than
3143 x : s z_1 ... z_m ==>
3144 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3147 This may require terms in goals to be expanded to n-tuples
3148 (e.g. using case_tac or simplification with the split_paired_all
3149 rule) before the above elimination rule is applicable.
3151 - The elimination or case analysis rules for (mutually) inductive
3152 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3153 list of rules "p_1_..._p_k.elims" is no longer available.
3155 * New package "function"/"fun" for general recursive functions,
3156 supporting mutual and nested recursion, definitions in local contexts,
3157 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3158 for small examples, and the separate tutorial on the function
3159 package. The old recdef "package" is still available as before, but
3160 users are encouraged to use the new package.
3162 * Method "lexicographic_order" automatically synthesizes termination
3163 relations as lexicographic combinations of size measures.
3165 * Case-expressions allow arbitrary constructor-patterns (including
3166 "_") and take their order into account, like in functional
3167 programming. Internally, this is translated into nested
3168 case-expressions; missing cases are added and mapped to the predefined
3169 constant "undefined". In complicated cases printing may no longer show
3170 the original input but the internal form. Lambda-abstractions allow
3171 the same form of pattern matching: "% pat1 => e1 | ..." is an
3172 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3175 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3176 is an abbreviation for "of_nat :: nat => int". The simplification
3177 rules for "of_nat" have been changed to work like "int" did
3178 previously. Potential INCOMPATIBILITY:
3179 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3180 - of_nat_diff and of_nat_mult are no longer default simp rules
3182 * Method "algebra" solves polynomial equations over (semi)rings using
3183 Groebner bases. The (semi)ring structure is defined by locales and the
3184 tool setup depends on that generic context. Installing the method for
3185 a specific type involves instantiating the locale and possibly adding
3186 declarations for computation on the coefficients. The method is
3187 already instantiated for natural numbers and for the axiomatic class
3188 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3189 CALCULEMUS 2007 for the general principles underlying this
3190 architecture of context-aware proof-tools.
3192 * Method "ferrack" implements quantifier elimination over
3193 special-purpose dense linear orders using locales (analogous to
3194 "algebra"). The method is already installed for class
3195 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3198 * Former constant "List.op @" now named "List.append". Use ML
3199 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3200 circumvent possible incompatibilities when working on ML level.
3202 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3204 * New function listsum :: 'a list => 'a for arbitrary monoids.
3205 Special syntax: "SUM x <- xs. f x" (and latex variants)
3207 * New syntax for Haskell-like list comprehension (input only), eg.
3208 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3210 * The special syntax for function "filter" has changed from [x :
3211 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3212 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3214 * [a..b] is now defined for arbitrary linear orders. It used to be
3215 defined on nat only, as an abbreviation for [a..<Suc b]
3218 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3220 * New functions "sorted" and "sort" in src/HOL/List.thy.
3222 * New lemma collection field_simps (an extension of ring_simps) for
3223 manipulating (in)equations involving division. Multiplies with all
3224 denominators that can be proved to be non-zero (in equations) or
3225 positive/negative (in inequations).
3227 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3228 have been improved and renamed to ring_simps, group_simps and
3229 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3230 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3232 * Theory Library/Commutative_Ring: switched from recdef to function
3233 package; constants add, mul, pow now curried. Infix syntax for
3234 algebraic operations.
3236 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3239 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3242 * HOL/records: generalised field-update to take a function on the
3243 field rather than the new value: r(|A := x|) is translated to A_update
3244 (K x) r The K-combinator that is internally used is called K_record.
3245 INCOMPATIBILITY: Usage of the plain update functions has to be
3248 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3249 * x = 0, which are required for a semiring. Richer structures do not
3250 inherit from semiring_0 anymore, because this property is a theorem
3251 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3252 there is more to prove, but this is mostly trivial.
3254 * Class "recpower" is generalized to arbitrary monoids, not just
3255 commutative semirings. INCOMPATIBILITY: may need to incorporate
3256 commutativity or semiring properties additionally.
3258 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3259 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3260 better use 'abbreviation'.
3262 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3264 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3265 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3266 significant changes for setting up numeral syntax for types:
3267 - New constants Numeral.pred and Numeral.succ instead
3268 of former Numeral.bin_pred and Numeral.bin_succ.
3269 - Use integer operations instead of bin_add, bin_mult and so on.
3270 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3271 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3273 See src/HOL/Integ/IntArith.thy for an example setup.
3275 * Command 'normal_form' computes the normal form of a term that may
3276 contain free variables. For example ``normal_form "rev [a, b, c]"''
3277 produces ``[b, c, a]'' (without proof). This command is suitable for
3278 heavy-duty computations because the functions are compiled to ML
3279 first. Correspondingly, a method "normalization" is provided. See
3280 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3282 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3283 25 like -->); output depends on the "iff" print_mode, the default is
3284 "A = B" (with priority 50).
3286 * Relations less (<) and less_eq (<=) are also available on type bool.
3287 Modified syntax to disallow nesting without explicit parentheses,
3288 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3291 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3293 * Relation composition operator "op O" now has precedence 75 and binds
3294 stronger than union and intersection. INCOMPATIBILITY.
3296 * The old set interval syntax "{m..n(}" (and relatives) has been
3297 removed. Use "{m..<n}" (and relatives) instead.
3299 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3300 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3301 ``declare [[simproc del: neq]]''.
3303 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3306 * Theorem Cons_eq_map_conv no longer declared as "simp".
3308 * Theorem setsum_mult renamed to setsum_right_distrib.
3310 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3313 * Reimplemented methods "sat" and "satx", with several improvements:
3314 goals no longer need to be stated as "<prems> ==> False", equivalences
3315 (i.e. "=" on type bool) are handled, variable names of the form
3316 "lit_<n>" are no longer reserved, significant speedup.
3318 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3319 zChaff is still supported as well.
3321 * 'inductive' and 'datatype': provide projections of mutual rules,
3322 bundled as foo_bar.inducts;
3324 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3327 * Library: moved theory Accessible_Part to main HOL.
3329 * Library: added theory Coinductive_List of potentially infinite lists
3330 as greatest fixed-point.
3332 * Library: added theory AssocList which implements (finite) maps as
3335 * Method "evaluation" solves goals (i.e. a boolean expression)
3336 efficiently by compiling it to ML. The goal is "proved" (via an
3337 oracle) if it evaluates to True.
3339 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3340 also when invoked by the simplifier. This results in the Simplifier
3341 being more powerful on arithmetic goals. INCOMPATIBILITY.
3342 Configuration option fast_arith_split_limit=0 recovers the old
3345 * Support for hex (0x20) and binary (0b1001) numerals.
3347 * New method: reify eqs (t), where eqs are equations for an
3348 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3349 parameter, computes a term s::'b and a list xs::'a list and proves the
3350 theorem I xs s = t. This is also known as reification or quoting. The
3351 resulting theorem is applied to the subgoal to substitute t with I xs
3352 s. If t is omitted, the subgoal itself is reified.
3354 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3355 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3356 where f is supposed to be a computable function (in the sense of code
3357 generattion). The method uses reify to compute s and xs as above then
3358 applies corr_thm and uses normalization by evaluation to "prove" f s =
3359 r and finally gets the theorem t = r, which is again applied to the
3360 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3362 * Reflection: Automatic reification now handels binding, an example is
3363 available in src/HOL/ex/ReflectionEx.thy
3365 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3366 command 'statespace' that is similar to 'record', but introduces an
3367 abstract specification based on the locale infrastructure instead of
3368 HOL types. This leads to extra flexibility in composing state spaces,
3369 in particular multiple inheritance and renaming of components.
3374 * Hyperreal: Functions root and sqrt are now defined on negative real
3375 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3376 Nonnegativity side conditions have been removed from many lemmas, so
3377 that more subgoals may now be solved by simplification; potential
3380 * Real: new type classes formalize real normed vector spaces and
3381 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3382 and norm :: 'a => real.
3384 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3385 reals into other types. The overloaded constant Reals :: 'a set is now
3386 defined as range of_real; potential INCOMPATIBILITY.
3388 * Real: proper support for ML code generation, including 'quickcheck'.
3389 Reals are implemented as arbitrary precision rationals.
3391 * Hyperreal: Several constants that previously worked only for the
3392 reals have been generalized, so they now work over arbitrary vector
3393 spaces. Type annotations may need to be added in some cases; potential
3396 Infinitesimal :: ('a::real_normed_vector) star set
3397 HFinite :: ('a::real_normed_vector) star set
3398 HInfinite :: ('a::real_normed_vector) star set
3399 approx :: ('a::real_normed_vector) star => 'a star => bool
3400 monad :: ('a::real_normed_vector) star => 'a star set
3401 galaxy :: ('a::real_normed_vector) star => 'a star set
3402 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3403 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3404 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3405 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3406 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3407 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3408 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3409 sgn :: 'a::real_normed_vector => 'a
3410 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3412 * Complex: Some complex-specific constants are now abbreviations for
3413 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3414 hnorm. Other constants have been entirely removed in favor of the
3415 polymorphic versions (INCOMPATIBILITY):
3419 HInfinite <-- CInfinite
3420 Infinitesimal <-- CInfinitesimal
3423 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3424 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3425 (ns)deriv <-- (ns)cderiv
3430 * Formalisation of ideals and the quotient construction over rings.
3432 * Order and lattice theory no longer based on records.
3435 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3436 greatest_closed. INCOMPATIBILITY.
3438 * Method algebra is now set up via an attribute. For examples see
3439 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3440 of algebraic structures.
3442 * Renamed theory CRing to Ring.
3447 * Substantial, yet incomplete support for nominal datatypes (binding
3448 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3449 src/HOL/Nominal/Examples. Prospective users should consult
3450 http://isabelle.in.tum.de/nominal/
3455 * ML basics: just one true type int, which coincides with IntInf.int
3458 * ML within Isar: antiquotations allow to embed statically-checked
3459 formal entities in the source, referring to the context available at
3460 compile-time. For example:
3462 ML {* @{sort "{zero,one}"} *}
3463 ML {* @{typ "'a => 'b"} *}
3464 ML {* @{term "%x. x"} *}
3465 ML {* @{prop "x == y"} *}
3466 ML {* @{ctyp "'a => 'b"} *}
3467 ML {* @{cterm "%x. x"} *}
3468 ML {* @{cprop "x == y"} *}
3469 ML {* @{thm asm_rl} *}
3470 ML {* @{thms asm_rl} *}
3471 ML {* @{type_name c} *}
3472 ML {* @{type_syntax c} *}
3473 ML {* @{const_name c} *}
3474 ML {* @{const_syntax c} *}
3477 ML {* @{theory Pure} *}
3478 ML {* @{theory_ref} *}
3479 ML {* @{theory_ref Pure} *}
3482 ML {* @{clasimpset} *}
3484 The same works for sources being ``used'' within an Isar context.
3486 * ML in Isar: improved error reporting; extra verbosity with
3487 ML_Context.trace enabled.
3489 * Pure/General/table.ML: the join operations now works via exceptions
3490 DUP/SAME instead of type option. This is simpler in simple cases, and
3491 admits slightly more efficient complex applications.
3493 * Pure: 'advanced' translation functions (parse_translation etc.) now
3494 use Context.generic instead of just theory.
3496 * Pure: datatype Context.generic joins theory/Proof.context and
3497 provides some facilities for code that works in either kind of
3498 context, notably GenericDataFun for uniform theory and proof data.
3500 * Pure: simplified internal attribute type, which is now always
3501 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3502 local (Proof.context) attributes have been discontinued, while
3503 minimizing code duplication. Thm.rule_attribute and
3504 Thm.declaration_attribute build canonical attributes; see also structure
3505 Context for further operations on Context.generic, notably
3506 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3507 declarations and definitions.
3509 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3510 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3511 init only required for impure data. INCOMPATIBILITY: empty really need
3512 to be empty (no dependencies on theory content!)
3514 * Pure/kernel: consts certification ignores sort constraints given in
3515 signature declarations. (This information is not relevant to the
3516 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3517 potential INCOMPATIBILITY.
3519 * Pure: axiomatic type classes are now purely definitional, with
3520 explicit proofs of class axioms and super class relations performed
3521 internally. See Pure/axclass.ML for the main internal interfaces --
3522 notably AxClass.define_class supercedes AxClass.add_axclass, and
3523 AxClass.axiomatize_class/classrel/arity supersede
3524 Sign.add_classes/classrel/arities.
3526 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3527 global/local versions on theory vs. Proof.context have been
3528 discontinued; Attrib.syntax and Method.syntax have been adapted
3529 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3530 attributes, methods, etc.
3532 * Pure: several functions of signature "... -> theory -> theory * ..."
3533 have been reoriented to "... -> theory -> ... * theory" in order to
3534 allow natural usage in combination with the ||>, ||>>, |-> and
3535 fold_map combinators.
3537 * Pure: official theorem names (closed derivations) and additional
3538 comments (tags) are now strictly separate. Name hints -- which are
3539 maintained as tags -- may be attached any time without affecting the
3542 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3543 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3544 achieve the old behaviour.
3546 * Pure: the "Goal" constant is now called "prop", supporting a
3547 slightly more general idea of ``protecting'' meta-level rule
3550 * Pure: Logic.(un)varify only works in a global context, which is now
3551 enforced instead of silently assumed. INCOMPATIBILITY, may use
3552 Logic.legacy_(un)varify as temporary workaround.
3554 * Pure: structure Name provides scalable operations for generating
3555 internal variable names, notably Name.variants etc. This replaces
3556 some popular functions from term.ML:
3558 Term.variant -> Name.variant
3559 Term.variantlist -> Name.variant_list
3560 Term.invent_names -> Name.invent_list
3562 Note that low-level renaming rarely occurs in new code -- operations
3563 from structure Variable are used instead (see below).
3565 * Pure: structure Variable provides fundamental operations for proper
3566 treatment of fixed/schematic variables in a context. For example,
3567 Variable.import introduces fixes for schematics of given facts and
3568 Variable.export reverses the effect (up to renaming) -- this replaces
3569 various freeze_thaw operations.
3571 * Pure: structure Goal provides simple interfaces for
3572 init/conclude/finish and tactical prove operations (replacing former
3573 Tactic.prove). Goal.prove is the canonical way to prove results
3574 within a given context; Goal.prove_global is a degraded version for
3575 theory level goals, including a global Drule.standard. Note that
3576 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3577 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3578 in a locale context).
3580 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3581 and type checking (Syntax.check_term etc.), with common combinations
3582 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3583 which are considered legacy and await removal.
3585 * Pure/Syntax: generic interfaces for type unchecking
3586 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3587 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3588 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3589 available for convenience, but refer to the very same operations using
3590 a mere theory instead of a full context.
3592 * Isar: simplified treatment of user-level errors, using exception
3593 ERROR of string uniformly. Function error now merely raises ERROR,
3594 without any side effect on output channels. The Isar toplevel takes
3595 care of proper display of ERROR exceptions. ML code may use plain
3596 handle/can/try; cat_error may be used to concatenate errors like this:
3598 ... handle ERROR msg => cat_error msg "..."
3600 Toplevel ML code (run directly or through the Isar toplevel) may be
3601 embedded into the Isar toplevel with exception display/debug like
3604 Isar.toplevel (fn () => ...)
3606 INCOMPATIBILITY, removed special transform_error facilities, removed
3607 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3608 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3609 -- use plain ERROR instead.
3611 * Isar: theory setup now has type (theory -> theory), instead of a
3612 list. INCOMPATIBILITY, may use #> to compose setup functions.
3614 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3615 ProofContext.debug/verbose flags.
3617 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3618 theory before entering a proof state. Transactions now always see a
3619 quasi-functional intermediate checkpoint, both in interactive and
3622 * Isar: simplified interfaces for outer syntax. Renamed
3623 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3624 OuterSyntax.add_parsers -- this functionality is now included in
3625 OuterSyntax.command etc. INCOMPATIBILITY.
3627 * Simplifier: the simpset of a running simplification process now
3628 contains a proof context (cf. Simplifier.the_context), which is the
3629 very context that the initial simpset has been retrieved from (by
3630 simpset_of/local_simpset_of). Consequently, all plug-in components
3631 (solver, looper etc.) may depend on arbitrary proof data.
3633 * Simplifier.inherit_context inherits the proof context (plus the
3634 local bounds) of the current simplification process; any simproc
3635 etc. that calls the Simplifier recursively should do this! Removed
3636 former Simplifier.inherit_bounds, which is already included here --
3637 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3638 specify an explicit context using Simplifier.context/theory_context.
3640 * Simplifier/Classical Reasoner: more abstract interfaces
3641 change_simpset/claset for modifying the simpset/claset reference of a
3642 theory; raw versions simpset/claset_ref etc. have been discontinued --
3645 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3651 * settings: the default heap location within ISABELLE_HOME_USER now
3652 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3653 Isabelle installations.
3655 * isabelle-process: option -S (secure mode) disables some critical
3656 operations, notably runtime compilation and evaluation of ML source
3659 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3661 * Support for parallel execution, using native multicore support of
3662 Poly/ML 5.1. The theory loader exploits parallelism when processing
3663 independent theories, according to the given theory header
3664 specifications. The maximum number of worker threads is specified via
3665 usedir option -M or the "max-threads" setting in Proof General. A
3666 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3667 to 6 on a 8-core machine. User-code needs to observe certain
3668 guidelines for thread-safe programming, see appendix A in the Isar
3669 Implementation manual.
3673 New in Isabelle2005 (October 2005)
3674 ----------------------------------
3678 * Theory headers: the new header syntax for Isar theories is
3681 imports <theory1> ... <theoryN>
3682 uses <file1> ... <fileM>
3685 where the 'uses' part is optional. The previous syntax
3687 theory <name> = <theory1> + ... + <theoryN>:
3689 will disappear in the next release. Use isatool fixheaders to convert
3690 existing theory files. Note that there is no change in ancient
3691 non-Isar theories now, but these will disappear soon.
3693 * Theory loader: parent theories can now also be referred to via
3694 relative and absolute paths.
3696 * Command 'find_theorems' searches for a list of criteria instead of a
3697 list of constants. Known criteria are: intro, elim, dest, name:string,
3698 simp:term, and any term. Criteria can be preceded by '-' to select
3699 theorems that do not match. Intro, elim, dest select theorems that
3700 match the current goal, name:s selects theorems whose fully qualified
3701 name contain s, and simp:term selects all simplification rules whose
3702 lhs match term. Any other term is interpreted as pattern and selects
3703 all theorems matching the pattern. Available in ProofGeneral under
3704 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3706 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3708 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3709 matching the current goal as introduction rule and not having "HOL."
3710 in their name (i.e. not being defined in theory HOL).
3712 * Command 'thms_containing' has been discontinued in favour of
3713 'find_theorems'; INCOMPATIBILITY.
3715 * Communication with Proof General is now 8bit clean, which means that
3716 Unicode text in UTF-8 encoding may be used within theory texts (both
3717 formal and informal parts). Cf. option -U of the Isabelle Proof
3718 General interface. Here are some simple examples (cf. src/HOL/ex):
3720 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3721 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3723 * Improved efficiency of the Simplifier and, to a lesser degree, the
3724 Classical Reasoner. Typical big applications run around 2 times
3728 *** Document preparation ***
3730 * Commands 'display_drafts' and 'print_drafts' perform simple output
3731 of raw sources. Only those symbols that do not require additional
3732 LaTeX packages (depending on comments in isabellesym.sty) are
3733 displayed properly, everything else is left verbatim. isatool display
3734 and isatool print are used as front ends (these are subject to the
3735 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3737 * Command tags control specific markup of certain regions of text,
3738 notably folding and hiding. Predefined tags include "theory" (for
3739 theory begin and end), "proof" for proof commands, and "ML" for
3740 commands involving ML code; the additional tags "visible" and
3741 "invisible" are unused by default. Users may give explicit tag
3742 specifications in the text, e.g. ''by %invisible (auto)''. The
3743 interpretation of tags is determined by the LaTeX job during document
3744 preparation: see option -V of isatool usedir, or options -n and -t of
3745 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3748 Several document versions may be produced at the same time via isatool
3749 usedir (the generated index.html will link all of them). Typical
3750 specifications include ''-V document=theory,proof,ML'' to present
3751 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3752 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3753 these parts without any formal replacement text. The Isabelle site
3754 default settings produce ''document'' and ''outline'' versions as
3757 * Several new antiquotations:
3759 @{term_type term} prints a term with its type annotated;
3761 @{typeof term} prints the type of a term;
3763 @{const const} is the same as @{term const}, but checks that the
3764 argument is a known logical constant;
3766 @{term_style style term} and @{thm_style style thm} print a term or
3767 theorem applying a "style" to it
3771 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3772 definitions, equations, inequations etc., 'concl' printing only the
3773 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3774 to print the specified premise. TermStyle.add_style provides an ML
3775 interface for introducing further styles. See also the "LaTeX Sugar"
3776 document practical applications. The ML antiquotation prints
3777 type-checked ML expressions verbatim.
3779 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3780 and 'text' support optional locale specification '(in loc)', which
3781 specifies the default context for interpreting antiquotations. For
3782 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3784 * Option 'locale=NAME' of antiquotations specifies an alternative
3785 context interpreting the subsequent argument. For example: @{thm
3786 [locale=lattice] inf_assoc}.
3788 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3791 * Proper output of antiquotations for theory commands involving a
3792 proof context (such as 'locale' or 'theorem (in loc) ...').
3794 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3795 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3797 * isatool usedir: new option -C (default true) controls whether option
3798 -D should include a copy of the original document directory; -C false
3799 prevents unwanted effects such as copying of administrative CVS data.
3804 * Considerably improved version of 'constdefs' command. Now performs
3805 automatic type-inference of declared constants; additional support for
3806 local structure declarations (cf. locales and HOL records), see also
3807 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3808 sequential dependencies of definitions within a single 'constdefs'
3809 section; moreover, the declared name needs to be an identifier. If
3810 all fails, consider to fall back on 'consts' and 'defs' separately.
3812 * Improved indexed syntax and implicit structures. First of all,
3813 indexed syntax provides a notational device for subscripted
3814 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3815 expressions. Secondly, in a local context with structure
3816 declarations, number indexes \<^sub>n or the empty index (default
3817 number 1) refer to a certain fixed variable implicitly; option
3818 show_structs controls printing of implicit structures. Typical
3819 applications of these concepts involve record types and locales.
3821 * New command 'no_syntax' removes grammar declarations (and
3822 translations) resulting from the given syntax specification, which is
3823 interpreted in the same manner as for the 'syntax' command.
3825 * 'Advanced' translation functions (parse_translation etc.) may depend
3826 on the signature of the theory context being presently used for
3827 parsing/printing, see also isar-ref manual.
3829 * Improved 'oracle' command provides a type-safe interface to turn an
3830 ML expression of type theory -> T -> term into a primitive rule of
3831 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3832 is already included here); see also FOL/ex/IffExample.thy;
3835 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3836 before); "cI" is no longer bound, use "c.intro" instead.
3837 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3838 axclasses vs. locales.
3840 * Improved internal renaming of symbolic identifiers -- attach primes
3841 instead of base 26 numbers.
3843 * New flag show_question_marks controls printing of leading question
3844 marks in schematic variable names.
3846 * In schematic variable names, *any* symbol following \<^isub> or
3847 \<^isup> is now treated as part of the base name. For example, the
3848 following works without printing of awkward ".0" indexes:
3850 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3853 * Inner syntax includes (*(*nested*) comments*).
3855 * Pretty printer now supports unbreakable blocks, specified in mixfix
3856 annotations as "(00...)".
3858 * Clear separation of logical types and nonterminals, where the latter
3859 may only occur in 'syntax' specifications or type abbreviations.
3860 Before that distinction was only partially implemented via type class
3861 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3862 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3863 exotic syntax specifications may require further adaption
3864 (e.g. Cube/Cube.thy).
3866 * Removed obsolete type class "logic", use the top sort {} instead.
3867 Note that non-logical types should be declared as 'nonterminals'
3868 rather than 'types'. INCOMPATIBILITY for new object-logic
3871 * Attributes 'induct' and 'cases': type or set names may now be
3872 locally fixed variables as well.
3874 * Simplifier: can now control the depth to which conditional rewriting
3875 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3878 * Simplifier: simplification procedures may now take the current
3879 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3880 interface), which is very useful for calling the Simplifier
3881 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3882 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3883 low-level mk_simproc no longer applies Logic.varify internally, to
3884 allow for use in a context of fixed variables.
3886 * thin_tac now works even if the assumption being deleted contains !!
3887 or ==>. More generally, erule now works even if the major premise of
3888 the elimination rule contains !! or ==>.
3890 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3892 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3893 from Pure, which contains all common declarations already. Both
3894 theories are defined via plain Isabelle/Isar .thy files.
3895 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3896 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3897 use isatool fixcpure to adapt your theory and ML sources.
3899 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3900 selections of theorems in named facts via index ranges.
3902 * 'print_theorems': in theory mode, really print the difference
3903 wrt. the last state (works for interactive theory development only),
3904 in proof mode print all local facts (cf. 'print_facts');
3906 * 'hide': option '(open)' hides only base names.
3908 * More efficient treatment of intermediate checkpoints in interactive
3911 * Code generator is now invoked via code_module (incremental code
3912 generation) and code_library (modular code generation, ML structures
3913 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3914 must be quoted when used as identifiers.
3916 * New 'value' command for reading, evaluating and printing terms using
3917 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3918 quoted when used as identifier.
3923 * New commands for the interpretation of locale expressions in
3924 theories (1), locales (2) and proof contexts (3). These generate
3925 proof obligations from the expression specification. After the
3926 obligations have been discharged, theorems of the expression are added
3927 to the theory, target locale or proof context. The synopsis of the
3928 commands is a follows:
3930 (1) interpretation expr inst
3931 (2) interpretation target < expr
3932 (3) interpret expr inst
3934 Interpretation in theories and proof contexts require a parameter
3935 instantiation of terms from the current context. This is applied to
3936 specifications and theorems of the interpreted expression.
3937 Interpretation in locales only permits parameter renaming through the
3938 locale expression. Interpretation is smart in that interpretations
3939 that are active already do not occur in proof obligations, neither are
3940 instantiated theorems stored in duplicate. Use 'print_interps' to
3941 inspect active interpretations of a particular locale. For details,
3942 see the Isar Reference manual. Examples can be found in
3943 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3945 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3946 'interpret' instead.
3948 * New context element 'constrains' for adding type constraints to
3951 * Context expressions: renaming of parameters with syntax
3954 * Locale declaration: 'includes' disallowed.
3956 * Proper static binding of attribute syntax -- i.e. types / terms /
3957 facts mentioned as arguments are always those of the locale definition
3958 context, independently of the context of later invocations. Moreover,
3959 locale operations (renaming and type / term instantiation) are applied
3960 to attribute arguments as expected.
3962 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3963 actual attributes; rare situations may require Attrib.attribute to
3964 embed those attributes into Attrib.src that lack concrete syntax.
3965 Attribute implementations need to cooperate properly with the static
3966 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3967 Attrib.XXX_thm etc. already do the right thing without further
3968 intervention. Only unusual applications -- such as "where" or "of"
3969 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3970 on the context and the facts involved -- may have to assign parsed
3971 values to argument tokens explicitly.
3973 * Changed parameter management in theorem generation for long goal
3974 statements with 'includes'. INCOMPATIBILITY: produces a different
3975 theorem statement in rare situations.
3977 * Locale inspection command 'print_locale' omits notes elements. Use
3978 'print_locale!' to have them included in the output.
3983 * Provers/hypsubst.ML: improved version of the subst method, for
3984 single-step rewriting: it now works in bound variable contexts. New is
3985 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3986 rewrite a different subterm than the original subst method, which is
3987 still available as 'simplesubst'.
3989 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3992 * Provers/trancl.ML: new transitivity reasoner for transitive and
3993 reflexive-transitive closure of relations.
3995 * Provers/blast.ML: new reference depth_limit to make blast's depth
3996 limit (previously hard-coded with a value of 20) user-definable.
3998 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3999 is peformed already. Object-logics merely need to finish their
4000 initial simpset configuration as before. INCOMPATIBILITY.
4005 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4008 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4010 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4011 and x-symbol; use option '-m epsilon' to get it actually printed.
4012 Moreover, the mathematically important symbolic identifier \<epsilon>
4013 becomes available as variable, constant etc. INCOMPATIBILITY,
4015 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4016 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4017 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4018 support corresponding Isar calculations.
4020 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4023 * theory SetInterval: changed the syntax for open intervals:
4032 The old syntax is still supported but will disappear in the next
4033 release. For conversion use the following Emacs search and replace
4034 patterns (these are not perfect but work quite well):
4036 {)\([^\.]*\)\.\. -> {\1<\.\.}
4037 \.\.\([^(}]*\)(} -> \.\.<\1}
4039 * Theory Commutative_Ring (in Library): method comm_ring for proving
4040 equalities in commutative rings; method 'algebra' provides a generic
4043 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4044 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4045 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4048 Some new syntax forms are available:
4050 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4051 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4052 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4053 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4055 The latter form "\<Sum>x < k. e" used to be based on a separate
4056 function "Summation", which has been discontinued.
4058 * theory Finite_Set: in structured induction proofs, the insert case
4059 is now 'case (insert x F)' instead of the old counterintuitive 'case
4062 * The 'refute' command has been extended to support a much larger
4063 fragment of HOL, including axiomatic type classes, constdefs and
4064 typedefs, inductive datatypes and recursion.
4066 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4067 Requires zChaff with proof generation to be installed. See
4068 HOL/ex/SAT_Examples.thy for examples.
4070 * Datatype induction via method 'induct' now preserves the name of the
4071 induction variable. For example, when proving P(xs::'a list) by
4072 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4073 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4074 in unstructured proof scripts.
4076 * Reworked implementation of records. Improved scalability for
4077 records with many fields, avoiding performance problems for type
4078 inference. Records are no longer composed of nested field types, but
4079 of nested extension types. Therefore the record type only grows linear
4080 in the number of extensions and not in the number of fields. The
4081 top-level (users) view on records is preserved. Potential
4082 INCOMPATIBILITY only in strange cases, where the theory depends on the
4083 old record representation. The type generated for a record is called
4084 <record_name>_ext_type.
4086 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4087 proofs triggered by a record definition or a simproc (if
4088 quick_and_dirty is enabled). Definitions of large records can take
4091 New simproc record_upd_simproc for simplification of multiple record
4092 updates enabled by default. Moreover, trivial updates are also
4093 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4094 occasionally, since simplification is more powerful by default.
4096 * typedef: proper support for polymorphic sets, which contain extra
4097 type-variables in the term.
4099 * Simplifier: automatically reasons about transitivity chains
4100 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4101 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4102 old proofs break occasionally as simplification may now solve more
4103 goals than previously.
4105 * Simplifier: converts x <= y into x = y if assumption y <= x is
4106 present. Works for all partial orders (class "order"), in particular
4107 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4110 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4111 bound variable or a constant then the let is unfolded. Otherwise
4112 first a is simplified to b, and then f b is simplified to g. If
4113 possible we abstract b from g arriving at "let x = b in h x",
4114 otherwise we unfold the let and arrive at g. The simproc can be
4115 enabled/disabled by the reference use_let_simproc. Potential
4116 INCOMPATIBILITY since simplification is more powerful by default.
4118 * Classical reasoning: the meson method now accepts theorems as arguments.
4120 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4121 jobs to provide advice on the provability of subgoals.
4123 * Theory OrderedGroup and Ring_and_Field: various additions and
4124 improvements to faciliate calculations involving equalities and
4127 The following theorems have been eliminated or modified
4130 abs_eq now named abs_of_nonneg
4131 abs_of_ge_0 now named abs_of_nonneg
4132 abs_minus_eq now named abs_of_nonpos
4133 imp_abs_id now named abs_of_nonneg
4134 imp_abs_neg_id now named abs_of_nonpos
4135 mult_pos now named mult_pos_pos
4136 mult_pos_le now named mult_nonneg_nonneg
4137 mult_pos_neg_le now named mult_nonneg_nonpos
4138 mult_pos_neg2_le now named mult_nonneg_nonpos2
4139 mult_neg now named mult_neg_neg
4140 mult_neg_le now named mult_nonpos_nonpos
4142 * The following lemmas in Ring_and_Field have been added to the simplifier:
4145 not_square_less_zero
4147 The following lemmas have been deleted from Real/RealPow:
4157 * Theory Parity: added rules for simplifying exponents.
4161 The following theorems have been eliminated or modified
4164 list_all_Nil now named list_all.simps(1)
4165 list_all_Cons now named list_all.simps(2)
4166 list_all_conv now named list_all_iff
4167 set_mem_eq now named mem_iff
4169 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4170 asymptotic "big O" calculations. See the notes in BigO.thy.
4175 * Theory RealDef: better support for embedding natural numbers and
4176 integers in the reals.
4178 The following theorems have been eliminated or modified
4181 exp_ge_add_one_self now requires no hypotheses
4182 real_of_int_add reversed direction of equality (use [symmetric])
4183 real_of_int_minus reversed direction of equality (use [symmetric])
4184 real_of_int_diff reversed direction of equality (use [symmetric])
4185 real_of_int_mult reversed direction of equality (use [symmetric])
4187 * Theory RComplete: expanded support for floor and ceiling functions.
4189 * Theory Ln is new, with properties of the natural logarithm
4191 * Hyperreal: There is a new type constructor "star" for making
4192 nonstandard types. The old type names are now type synonyms:
4196 hcomplex = complex star
4198 * Hyperreal: Many groups of similarly-defined constants have been
4199 replaced by polymorphic versions (INCOMPATIBILITY):
4201 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4203 starset <-- starsetNat, starsetC
4204 *s* <-- *sNat*, *sc*
4205 starset_n <-- starsetNat_n, starsetC_n
4206 *sn* <-- *sNatn*, *scn*
4207 InternalSets <-- InternalNatSets, InternalCSets
4209 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4210 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4211 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4212 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4213 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4215 * Hyperreal: Many type-specific theorems have been removed in favor of
4216 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4218 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4219 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4220 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4221 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4222 right_minus <-- hypreal_add_minus
4223 left_minus <-- {hypreal,hcomplex}_add_minus_left
4224 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4225 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4226 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4227 mult_1_right <-- hcomplex_mult_one_right
4228 mult_zero_left <-- hcomplex_mult_zero_left
4229 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4230 right_distrib <-- hypnat_add_mult_distrib2
4231 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4232 right_inverse <-- hypreal_mult_inverse
4233 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4234 order_refl <-- {hypreal,hypnat}_le_refl
4235 order_trans <-- {hypreal,hypnat}_le_trans
4236 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4237 order_less_le <-- {hypreal,hypnat}_less_le
4238 linorder_linear <-- {hypreal,hypnat}_le_linear
4239 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4240 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4241 add_nonneg_nonneg <-- hypreal_le_add_order
4243 * Hyperreal: Separate theorems having to do with type-specific
4244 versions of constants have been merged into theorems that apply to the
4245 new polymorphic constants (INCOMPATIBILITY):
4247 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4248 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4249 STAR_Un <-- {STAR,NatStar,STARC}_Un
4250 STAR_Int <-- {STAR,NatStar,STARC}_Int
4251 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4252 STAR_subset <-- {STAR,NatStar,STARC}_subset
4253 STAR_mem <-- {STAR,NatStar,STARC}_mem
4254 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4255 STAR_diff <-- {STAR,STARC}_diff
4256 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4257 STARC_hcomplex_of_complex}_image_subset
4258 starset_n_Un <-- starset{Nat,C}_n_Un
4259 starset_n_Int <-- starset{Nat,C}_n_Int
4260 starset_n_Compl <-- starset{Nat,C}_n_Compl
4261 starset_n_diff <-- starset{Nat,C}_n_diff
4262 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4263 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4264 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4265 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4266 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4267 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4268 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4269 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4270 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4271 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4272 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4273 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4274 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4275 starfun_diff <-- starfun{C,RC,CR}_diff
4276 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4277 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4278 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4279 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4280 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4281 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4282 starfun_Id <-- starfunC_Id
4283 starfun_approx <-- starfun{Nat,CR}_approx
4284 starfun_capprox <-- starfun{C,RC}_capprox
4285 starfun_abs <-- starfunNat_rabs
4286 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4287 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4288 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4289 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4290 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4291 starfun_add_approx <-- starfunCR_add_approx
4292 starfun_inverse_inverse <-- starfunC_inverse_inverse
4293 starfun_divide <-- starfun{C,CR,RC}_divide
4294 starfun_n <-- starfun{Nat,C}_n
4295 starfun_n_mult <-- starfun{Nat,C}_n_mult
4296 starfun_n_add <-- starfun{Nat,C}_n_add
4297 starfun_n_add_minus <-- starfunNat_n_add_minus
4298 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4299 starfun_n_minus <-- starfun{Nat,C}_n_minus
4300 starfun_n_eq <-- starfun{Nat,C}_n_eq
4302 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4303 star_n_minus <-- {hypreal,hcomplex}_minus
4304 star_n_diff <-- {hypreal,hcomplex}_diff
4305 star_n_mult <-- {hypreal,hcomplex}_mult
4306 star_n_inverse <-- {hypreal,hcomplex}_inverse
4307 star_n_le <-- {hypreal,hypnat}_le
4308 star_n_less <-- {hypreal,hypnat}_less
4309 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4310 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4311 star_n_abs <-- hypreal_hrabs
4312 star_n_divide <-- hcomplex_divide
4314 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4315 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4316 star_of_diff <-- hypreal_of_real_diff
4317 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4318 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4319 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4320 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4321 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4322 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4323 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4324 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4325 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4326 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4327 star_of_number_of <-- {hypreal,hcomplex}_number_of
4328 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4329 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4330 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4331 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4332 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4333 star_of_power <-- hypreal_of_real_power
4334 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4336 * Hyperreal: new method "transfer" that implements the transfer
4337 principle of nonstandard analysis. With a subgoal that mentions
4338 nonstandard types like "'a star", the command "apply transfer"
4339 replaces it with an equivalent one that mentions only standard types.
4340 To be successful, all free variables must have standard types; non-
4341 standard variables must have explicit universal quantifiers.
4343 * Hyperreal: A theory of Taylor series.
4348 * Discontinued special version of 'constdefs' (which used to support
4349 continuous functions) in favor of the general Pure one with full
4352 * New simplification procedure for solving continuity conditions; it
4353 is much faster on terms with many nested lambda abstractions (cubic
4354 instead of exponential time).
4356 * New syntax for domain package: selector names are now optional.
4357 Parentheses should be omitted unless argument is lazy, for example:
4359 domain 'a stream = cons "'a" (lazy "'a stream")
4361 * New command 'fixrec' for defining recursive functions with pattern
4362 matching; defining multiple functions with mutual recursion is also
4363 supported. Patterns may include the constants cpair, spair, up, sinl,
4364 sinr, or any data constructor defined by the domain package. The given
4365 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4366 syntax and examples.
4368 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4369 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4370 but the proof obligation additionally includes an admissibility
4371 requirement. The packages generate instances of class cpo or pcpo,
4372 with continuity and strictness theorems for Rep and Abs.
4374 * HOLCF: Many theorems have been renamed according to a more standard naming
4375 scheme (INCOMPATIBILITY):
4377 foo_inject: "foo$x = foo$y ==> x = y"
4378 foo_eq: "(foo$x = foo$y) = (x = y)"
4379 foo_less: "(foo$x << foo$y) = (x << y)"
4380 foo_strict: "foo$UU = UU"
4381 foo_defined: "... ==> foo$x ~= UU"
4382 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4387 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4388 including the First Isomorphism Theorem (on quotienting by the kernel
4391 * ZF/Simplifier: install second copy of type solver that actually
4392 makes use of TC rules declared to Isar proof contexts (or locales);
4393 the old version is still required for ML proof scripts.
4398 * Converted to Isar theory format; use locales instead of axiomatic
4404 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4407 * Pure/library.ML no longer defines its own option datatype, but uses
4408 that of the SML basis, which has constructors NONE and SOME instead of
4409 None and Some, as well as exception Option.Option instead of OPTION.
4410 The functions the, if_none, is_some, is_none have been adapted
4411 accordingly, while Option.map replaces apsome.
4413 * Pure/library.ML: the exception LIST has been given up in favour of
4414 the standard exceptions Empty and Subscript, as well as
4415 Library.UnequalLengths. Function like Library.hd and Library.tl are
4416 superceded by the standard hd and tl functions etc.
4418 A number of basic list functions are no longer exported to the ML
4419 toplevel, as they are variants of predefined functions. The following
4420 suggests how one can translate existing code:
4422 rev_append xs ys = List.revAppend (xs, ys)
4423 nth_elem (i, xs) = List.nth (xs, i)
4424 last_elem xs = List.last xs
4425 flat xss = List.concat xss
4426 seq fs = List.app fs
4427 partition P xs = List.partition P xs
4428 mapfilter f xs = List.mapPartial f xs
4430 * Pure/library.ML: several combinators for linear functional
4431 transformations, notably reverse application and composition:
4434 (x, y) |-> f f #-> g
4436 * Pure/library.ML: introduced/changed precedence of infix operators:
4438 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4440 infix 3 o oo ooo oooo;
4441 infix 4 ~~ upto downto;
4443 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4446 * Pure/library.ML: natural list combinators fold, fold_rev, and
4447 fold_map support linear functional transformations and nesting. For
4450 fold f [x1, ..., xN] y =
4451 y |> f x1 |> ... |> f xN
4453 (fold o fold) f [xs1, ..., xsN] y =
4454 y |> fold f xs1 |> ... |> fold f xsN
4456 fold f [x1, ..., xN] =
4459 (fold o fold) f [xs1, ..., xsN] =
4460 fold f xs1 #> ... #> fold f xsN
4462 * Pure/library.ML: the following selectors on type 'a option are
4465 the: 'a option -> 'a (*partial*)
4466 these: 'a option -> 'a where 'a = 'b list
4467 the_default: 'a -> 'a option -> 'a
4468 the_list: 'a option -> 'a list
4470 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4471 basic operations for association lists, following natural argument
4472 order; moreover the explicit equality predicate passed here avoids
4473 potentially expensive polymorphic runtime equality checks.
4474 The old functions may be expressed as follows:
4476 assoc = uncurry (AList.lookup (op =))
4477 assocs = these oo AList.lookup (op =)
4478 overwrite = uncurry (AList.update (op =)) o swap
4480 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4482 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4483 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4485 replacing make_keylist and keyfilter (occassionally used)
4488 make_keylist = AList.make
4489 keyfilter = AList.find (op =)
4491 * eq_fst and eq_snd now take explicit equality parameter, thus
4492 avoiding eqtypes. Naive rewrites:
4494 eq_fst = eq_fst (op =)
4495 eq_snd = eq_snd (op =)
4497 * Removed deprecated apl and apr (rarely used).
4500 apl (n, op) =>>= curry op n
4501 apr (op, m) =>>= fn n => op (n, m)
4503 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4504 provides a reasonably efficient light-weight implementation of sets as
4507 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4508 few new operations; existing lookup and update are now curried to
4509 follow natural argument order (for use with fold etc.);
4510 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4512 * Pure/General: output via the Isabelle channels of
4513 writeln/warning/error etc. is now passed through Output.output, with a
4514 hook for arbitrary transformations depending on the print_mode
4515 (cf. Output.add_mode -- the first active mode that provides a output
4516 function wins). Already formatted output may be embedded into further
4517 text via Output.raw; the result of Pretty.string_of/str_of and derived
4518 functions (string_of_term/cterm/thm etc.) is already marked raw to
4519 accommodate easy composition of diagnostic messages etc. Programmers
4520 rarely need to care about Output.output or Output.raw at all, with
4521 some notable exceptions: Output.output is required when bypassing the
4522 standard channels (writeln etc.), or in token translations to produce
4523 properly formatted results; Output.raw is required when capturing
4524 already output material that will eventually be presented to the user
4525 a second time. For the default print mode, both Output.output and
4526 Output.raw have no effect.
4528 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4529 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4530 cumulative results are displayed at the end of a batch session.
4532 * Pure/General: File.sysify_path and File.quote_sysify path have been
4533 replaced by File.platform_path and File.shell_path (with appropriate
4534 hooks). This provides a clean interface for unusual systems where the
4535 internal and external process view of file names are different.
4537 * Pure: more efficient orders for basic syntactic entities: added
4538 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4539 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4540 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4541 orders now -- potential INCOMPATIBILITY for code that depends on a
4542 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4543 Library.sort_strings on result).
4545 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4546 fold_types traverse types/terms from left to right, observing natural
4547 argument order. Supercedes previous foldl_XXX versions, add_frees,
4548 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4550 * Pure: name spaces have been refined, with significant changes of the
4551 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4552 to extern(_table). The plain name entry path is superceded by a
4553 general 'naming' context, which also includes the 'policy' to produce
4554 a fully qualified name and external accesses of a fully qualified
4555 name; NameSpace.extend is superceded by context dependent
4556 Sign.declare_name. Several theory and proof context operations modify
4557 the naming context. Especially note Theory.restore_naming and
4558 ProofContext.restore_naming to get back to a sane state; note that
4559 Theory.add_path is no longer sufficient to recover from
4560 Theory.absolute_path in particular.
4562 * Pure: new flags short_names (default false) and unique_names
4563 (default true) for controlling output of qualified names. If
4564 short_names is set, names are printed unqualified. If unique_names is
4565 reset, the name prefix is reduced to the minimum required to achieve
4566 the original result when interning again, even if there is an overlap
4567 with earlier declarations.
4569 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4570 now 'extend', and 'merge' gets an additional Pretty.pp argument
4571 (useful for printing error messages). INCOMPATIBILITY.
4573 * Pure: major reorganization of the theory context. Type Sign.sg and
4574 Theory.theory are now identified, referring to the universal
4575 Context.theory (see Pure/context.ML). Actual signature and theory
4576 content is managed as theory data. The old code and interfaces were
4577 spread over many files and structures; the new arrangement introduces
4578 considerable INCOMPATIBILITY to gain more clarity:
4580 Context -- theory management operations (name, identity, inclusion,
4581 parents, ancestors, merge, etc.), plus generic theory data;
4583 Sign -- logical signature and syntax operations (declaring consts,
4584 types, etc.), plus certify/read for common entities;
4586 Theory -- logical theory operations (stating axioms, definitions,
4587 oracles), plus a copy of logical signature operations (consts,
4588 types, etc.); also a few basic management operations (Theory.copy,
4591 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4592 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4593 for convenience -- they merely return the theory.
4595 * Pure: type Type.tsig is superceded by theory in most interfaces.
4597 * Pure: the Isar proof context type is already defined early in Pure
4598 as Context.proof (note that ProofContext.context and Proof.context are
4599 aliases, where the latter is the preferred name). This enables other
4600 Isabelle components to refer to that type even before Isar is present.
4602 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4603 typeK, constK, axiomK, oracleK), but provide explicit operations for
4604 any of these kinds. For example, Sign.intern typeK is now
4605 Sign.intern_type, Theory.hide_space Sign.typeK is now
4606 Theory.hide_types. Also note that former
4607 Theory.hide_classes/types/consts are now
4608 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4609 internalize their arguments! INCOMPATIBILITY.
4611 * Pure: get_thm interface (of PureThy and ProofContext) expects
4612 datatype thmref (with constructors Name and NameSelection) instead of
4613 plain string -- INCOMPATIBILITY;
4615 * Pure: cases produced by proof methods specify options, where NONE
4616 means to remove case bindings -- INCOMPATIBILITY in
4619 * Pure: the following operations retrieve axioms or theorems from a
4620 theory node or theory hierarchy, respectively:
4622 Theory.axioms_of: theory -> (string * term) list
4623 Theory.all_axioms_of: theory -> (string * term) list
4624 PureThy.thms_of: theory -> (string * thm) list
4625 PureThy.all_thms_of: theory -> (string * thm) list
4627 * Pure: print_tac now outputs the goal through the trace channel.
4629 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4630 Reference Toplevel.debug (default false) controls detailed printing
4631 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4632 controls execution profiling -- set to 1 for time and 2 for space
4633 (both increase the runtime).
4635 * Isar session: The initial use of ROOT.ML is now always timed,
4636 i.e. the log will show the actual process times, in contrast to the
4637 elapsed wall-clock time that the outer shell wrapper produces.
4639 * Simplifier: improved handling of bound variables (nameless
4640 representation, avoid allocating new strings). Simprocs that invoke
4641 the Simplifier recursively should use Simplifier.inherit_bounds to
4642 avoid local name clashes. Failure to do so produces warnings
4643 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4644 for further details.
4646 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4647 bindings for all theorems stored within a given theory; this may help
4648 in porting non-Isar theories to Isar ones, while keeping ML proof
4649 scripts for the time being.
4651 * ML operator HTML.with_charset specifies the charset begin used for
4652 generated HTML files. For example:
4654 HTML.with_charset "utf-8" use_thy "Hebrew";
4655 HTML.with_charset "utf-8" use_thy "Chinese";
4660 * Allow symlinks to all proper Isabelle executables (Isabelle,
4661 isabelle, isatool etc.).
4663 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4664 isatool doc, isatool mkdir, display_drafts etc.).
4666 * isatool usedir: option -f allows specification of the ML file to be
4667 used by Isabelle; default is ROOT.ML.
4669 * New isatool version outputs the version identifier of the Isabelle
4670 distribution being used.
4672 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4673 (containing Boolean satisfiability problems) into Isabelle/HOL
4678 New in Isabelle2004 (April 2004)
4679 --------------------------------
4683 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4684 Replaces linorder.ML.
4686 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4687 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4688 (\<a>...\<z>), are now considered normal letters, and can therefore
4689 be used anywhere where an ASCII letter (a...zA...Z) has until
4690 now. COMPATIBILITY: This obviously changes the parsing of some
4691 terms, especially where a symbol has been used as a binder, say
4692 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4693 as an identifier. Fix it by inserting a space around former
4694 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4695 existing theory and ML files.
4697 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4699 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4700 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4701 a normal (but invisible) letter. For multiple letter subscripts repeat
4702 \<^isub> like this: x\<^isub>1\<^isub>2.
4704 * Pure: There are now sub-/superscripts that can span more than one
4705 character. Text between \<^bsub> and \<^esub> is set in subscript in
4706 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4707 superscript. The new control characters are not identifier parts.
4709 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4710 content of "..." to the latex file instead of \isacntrl... . The "..."
4711 may consist of any printable characters excluding the end bracket >.
4713 * Pure: Using new Isar command "finalconsts" (or the ML functions
4714 Theory.add_finals or Theory.add_finals_i) it is now possible to
4715 declare constants "final", which prevents their being given a definition
4716 later. It is useful for constants whose behaviour is fixed axiomatically
4717 rather than definitionally, such as the meta-logic connectives.
4719 * Pure: 'instance' now handles general arities with general sorts
4720 (i.e. intersections of classes),
4722 * Presentation: generated HTML now uses a CSS style sheet to make layout
4723 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4724 It can be changed to alter the colors/layout of generated pages.
4729 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4730 cut_tac, subgoal_tac and thin_tac:
4731 - Now understand static (Isar) contexts. As a consequence, users of Isar
4732 locales are no longer forced to write Isar proof scripts.
4733 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4735 - INCOMPATIBILITY: names of variables to be instantiated may no
4736 longer be enclosed in quotes. Instead, precede variable name with `?'.
4737 This is consistent with the instantiation attribute "where".
4739 * Attributes "where" and "of":
4740 - Now take type variables of instantiated theorem into account when reading
4741 the instantiation string. This fixes a bug that caused instantiated
4742 theorems to have too special types in some circumstances.
4743 - "where" permits explicit instantiations of type variables.
4745 * Calculation commands "moreover" and "also" no longer interfere with
4746 current facts ("this"), admitting arbitrary combinations with "then"
4750 - Goal statements involving the context element "includes" no longer
4751 generate theorems with internal delta predicates (those ending on
4752 "_axioms") in the premise.
4753 Resolve particular premise with <locale>.intro to obtain old form.
4754 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4755 specification and "includes" elements in goal statement.
4756 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4757 [intro?] and [elim?] (respectively) by default.
4758 - Experimental command for instantiation of locales in proof contexts:
4759 instantiate <label>[<attrs>]: <loc>
4760 Instantiates locale <loc> and adds all its theorems to the current context
4761 taking into account their attributes. Label and attrs are optional
4762 modifiers, like in theorem declarations. If present, names of
4763 instantiated theorems are qualified with <label>, and the attributes
4764 <attrs> are applied after any attributes these theorems might have already.
4765 If the locale has assumptions, a chained fact of the form
4766 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4767 are derived. The command does not support old-style locales declared
4768 with "locale (open)".
4769 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4771 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4777 * Proof import: new image HOL4 contains the imported library from
4778 the HOL4 system with about 2500 theorems. It is imported by
4779 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4780 can be used like any other Isabelle image. See
4781 HOL/Import/HOL/README for more information.
4784 - Much improved handling of linear and partial orders.
4785 Reasoners for linear and partial orders are set up for type classes
4786 "linorder" and "order" respectively, and are added to the default simpset
4787 as solvers. This means that the simplifier can build transitivity chains
4788 to solve goals from the assumptions.
4789 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4790 of blast or auto after simplification become unnecessary because the goal
4791 is solved by simplification already.
4793 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4794 all proved in axiomatic type classes for semirings, rings and fields.
4797 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4798 now formalized using the Ring_and_Field theory mentioned above.
4799 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4800 than before, because now they are set up once in a generic manner.
4801 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4802 Look for the general versions in Ring_and_Field (and Power if they concern
4805 * Type "rat" of the rational numbers is now available in HOL-Complex.
4808 - Record types are now by default printed with their type abbreviation
4809 instead of the list of all field types. This can be configured via
4810 the reference "print_record_type_abbr".
4811 - Simproc "record_upd_simproc" for simplification of multiple updates added
4812 (not enabled by default).
4813 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4814 EX x. x = sel r to True (not enabled by default).
4815 - Tactic "record_split_simp_tac" to split and simplify records added.
4817 * 'specification' command added, allowing for definition by
4818 specification. There is also an 'ax_specification' command that
4819 introduces the new constants axiomatically.
4821 * arith(_tac) is now able to generate counterexamples for reals as well.
4823 * HOL-Algebra: new locale "ring" for non-commutative rings.
4825 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4826 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4828 * HOL-Matrix: a first theory for matrices in HOL with an application of
4829 matrix theory to linear programming.
4831 * Unions and Intersections:
4832 The latex output syntax of UN and INT has been changed
4833 from "\Union x \in A. B" to "\Union_{x \in A} B"
4834 i.e. the index formulae has become a subscript.
4835 Similarly for "\Union x. B", and for \Inter instead of \Union.
4837 * Unions and Intersections over Intervals:
4838 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4839 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4840 like in normal math, and corresponding versions for < and for intersection.
4842 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4843 lexicographic dictonary ordering has been added as "lexord".
4845 * ML: the legacy theory structures Int and List have been removed. They had
4846 conflicted with ML Basis Library structures having the same names.
4848 * 'refute' command added to search for (finite) countermodels. Only works
4849 for a fragment of HOL. The installation of an external SAT solver is
4850 highly recommended. See "HOL/Refute.thy" for details.
4852 * 'quickcheck' command: Allows to find counterexamples by evaluating
4853 formulae under an assignment of free variables to random values.
4854 In contrast to 'refute', it can deal with inductive datatypes,
4855 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4861 * Streams now come with concatenation and are part of the HOLCF image
4865 New in Isabelle2003 (May 2003)
4866 ------------------------------
4870 * Provers/simplifier:
4872 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4873 Assumptions are now subject to complete mutual simplification,
4874 not just from left to right. The simplifier now preserves
4875 the order of assumptions.
4877 Potential INCOMPATIBILITY:
4879 -- simp sometimes diverges where the old version did
4880 not, e.g. invoking simp on the goal
4882 [| P (f x); y = x; f x = f y |] ==> Q
4884 now gives rise to the infinite reduction sequence
4886 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4888 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4891 -- Tactics combining classical reasoner and simplification (such as auto)
4892 are also affected by this change, because many of them rely on
4893 simp. They may sometimes diverge as well or yield a different numbers
4894 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4895 in case of problems. Sometimes subsequent calls to the classical
4896 reasoner will fail because a preceeding call to the simplifier too
4897 eagerly simplified the goal, e.g. deleted redundant premises.
4899 - The simplifier trace now shows the names of the applied rewrite rules
4901 - You can limit the number of recursive invocations of the simplifier
4902 during conditional rewriting (where the simplifie tries to solve the
4903 conditions before applying the rewrite rule):
4904 ML "simp_depth_limit := n"
4905 where n is an integer. Thus you can force termination where previously
4906 the simplifier would diverge.
4908 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4910 - No longer aborts on failed congruence proof. Instead, the
4911 congruence is ignored.
4913 * Pure: New generic framework for extracting programs from constructive
4914 proofs. See HOL/Extraction.thy for an example instantiation, as well
4915 as HOL/Extraction for some case studies.
4917 * Pure: The main goal of the proof state is no longer shown by default, only
4918 the subgoals. This behaviour is controlled by a new flag.
4919 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4920 (ML: Proof.show_main_goal).
4922 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4923 rules whose conclusion matches subgoal 1:
4924 PG menu: Isabelle/Isar -> Show me -> matching rules
4925 The rules are ordered by how closely they match the subgoal.
4926 In particular, rules that solve a subgoal outright are displayed first
4927 (or rather last, the way they are printed).
4928 (ML: ProofGeneral.print_intros())
4930 * Pure: New flag trace_unify_fail causes unification to print
4931 diagnostic information (PG: in trace buffer) when it fails. This is
4932 useful for figuring out why single step proofs like rule, erule or
4935 * Pure: Locale specifications now produce predicate definitions
4936 according to the body of text (covering assumptions modulo local
4937 definitions); predicate "loc_axioms" covers newly introduced text,
4938 while "loc" is cumulative wrt. all included locale expressions; the
4939 latter view is presented only on export into the global theory
4940 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4941 on the old view without predicates;
4943 * Pure: predefined locales "var" and "struct" are useful for sharing
4944 parameters (as in CASL, for example); just specify something like
4945 ``var x + var y + struct M'' as import;
4947 * Pure: improved thms_containing: proper indexing of facts instead of
4948 raw theorems; check validity of results wrt. current name space;
4949 include local facts of proof configuration (also covers active
4950 locales), cover fixed variables in index; may use "_" in term
4951 specification; an optional limit for the number of printed facts may
4952 be given (the default is 40);
4954 * Pure: disallow duplicate fact bindings within new-style theory files
4957 * Provers: improved induct method: assumptions introduced by case
4958 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4959 the goal statement); "foo" still refers to all facts collectively;
4961 * Provers: the function blast.overloaded has been removed: all constants
4962 are regarded as potentially overloaded, which improves robustness in exchange
4963 for slight decrease in efficiency;
4965 * Provers/linorder: New generic prover for transitivity reasoning over
4966 linear orders. Note: this prover is not efficient!
4968 * Isar: preview of problems to finish 'show' now produce an error
4969 rather than just a warning (in interactive mode);
4976 - Produces a counter example if it cannot prove a goal.
4977 Note that the counter example may be spurious if the goal is not a formula
4978 of quantifier-free linear arithmetic.
4979 In ProofGeneral the counter example appears in the trace buffer.
4981 - Knows about div k and mod k where k is a numeral of type nat or int.
4983 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4984 linear arithmetic fails. This takes account of quantifiers and divisibility.
4985 Presburger arithmetic can also be called explicitly via presburger(_tac).
4987 * simp's arithmetic capabilities have been enhanced a bit: it now
4988 takes ~= in premises into account (by performing a case split);
4990 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4991 are distributed over a sum of terms;
4993 * New tactic "trans_tac" and method "trans" instantiate
4994 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4997 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4998 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5000 * 'typedef' command has new option "open" to suppress the set
5003 * functions Min and Max on finite sets have been introduced (theory
5006 * attribute [symmetric] now works for relations as well; it turns
5007 (x,y) : R^-1 into (y,x) : R, and vice versa;
5009 * induct over a !!-quantified statement (say !!x1..xn):
5010 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5012 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5013 %x. None. Warning: empty_def now refers to the previously hidden definition
5016 * Algebra: formalization of classical algebra. Intended as base for
5017 any algebraic development in Isabelle. Currently covers group theory
5018 (up to Sylow's theorem) and ring theory (Universal Property of
5019 Univariate Polynomials). Contributions welcome;
5021 * GroupTheory: deleted, since its material has been moved to Algebra;
5023 * Complex: new directory of the complex numbers with numeric constants,
5024 nonstandard complex numbers, and some complex analysis, standard and
5025 nonstandard (Jacques Fleuriot);
5027 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5029 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5032 * Real/HahnBanach: updated and adapted to locales;
5034 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5037 * UNITY: added the Meier-Sanders theory of progress sets;
5039 * MicroJava: bytecode verifier and lightweight bytecode verifier
5040 as abstract algorithms, instantiated to the JVM;
5042 * Bali: Java source language formalization. Type system, operational
5043 semantics, axiomatic semantics. Supported language features:
5044 classes, interfaces, objects,virtual methods, static methods,
5045 static/instance fields, arrays, access modifiers, definite
5046 assignment, exceptions.
5051 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5054 * Main ZF: virtually all theories converted to new-style format;
5059 * Pure: Tactic.prove provides sane interface for internal proofs;
5060 omits the infamous "standard" operation, so this is more appropriate
5061 than prove_goalw_cterm in many situations (e.g. in simprocs);
5063 * Pure: improved error reporting of simprocs;
5065 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5069 *** Document preparation ***
5071 * uses \par instead of \\ for line breaks in theory text. This may
5072 shift some page breaks in large documents. To get the old behaviour
5073 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5075 * minimized dependencies of isabelle.sty and isabellesym.sty on
5078 * \<euro> now needs package babel/greek instead of marvosym (which
5081 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5086 New in Isabelle2002 (March 2002)
5087 --------------------------------
5089 *** Document preparation ***
5091 * greatly simplified document preparation setup, including more
5092 graceful interpretation of isatool usedir -i/-d/-D options, and more
5093 instructive isatool mkdir; users should basically be able to get
5094 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5095 users may run a separate document processing stage manually like this:
5096 "isatool usedir -D output HOL Test && isatool document Test/output";
5098 * theory dependency graph may now be incorporated into documents;
5099 isatool usedir -g true will produce session_graph.eps/.pdf for use
5100 with \includegraphics of LaTeX;
5102 * proper spacing of consecutive markup elements, especially text
5103 blocks after section headings;
5105 * support bold style (for single symbols only), input syntax is like
5106 this: "\<^bold>\<alpha>" or "\<^bold>A";
5108 * \<bullet> is now output as bold \cdot by default, which looks much
5109 better in printed text;
5111 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5112 note that these symbols are currently unavailable in Proof General /
5113 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5115 * isatool latex no longer depends on changed TEXINPUTS, instead
5116 isatool document copies the Isabelle style files to the target
5122 * Pure/Provers: improved proof by cases and induction;
5123 - 'case' command admits impromptu naming of parameters (such as
5125 - 'induct' method divinates rule instantiation from the inductive
5126 claim; no longer requires excessive ?P bindings for proper
5127 instantiation of cases;
5128 - 'induct' method properly enumerates all possibilities of set/type
5129 rules; as a consequence facts may be also passed through *type*
5130 rules without further ado;
5131 - 'induct' method now derives symbolic cases from the *rulified*
5132 rule (before it used to rulify cases stemming from the internal
5133 atomized version); this means that the context of a non-atomic
5134 statement becomes is included in the hypothesis, avoiding the
5135 slightly cumbersome show "PROP ?case" form;
5136 - 'induct' may now use elim-style induction rules without chaining
5137 facts, using ``missing'' premises from the goal state; this allows
5138 rules stemming from inductive sets to be applied in unstructured
5139 scripts, while still benefitting from proper handling of non-atomic
5140 statements; NB: major inductive premises need to be put first, all
5141 the rest of the goal is passed through the induction;
5142 - 'induct' proper support for mutual induction involving non-atomic
5143 rule statements (uses the new concept of simultaneous goals, see
5145 - append all possible rule selections, but only use the first
5146 success (no backtracking);
5147 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5148 - undeclared rule case names default to numbers 1, 2, 3, ...;
5149 - added 'print_induct_rules' (covered by help item in recent Proof
5151 - moved induct/cases attributes to Pure, methods to Provers;
5152 - generic method setup instantiated for FOL and HOL;
5154 * Pure: support multiple simultaneous goal statements, for example
5155 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5156 meta-level mechanism, this acts as if several individual goals had
5157 been stated separately; in particular common proof methods need to be
5158 repeated in order to cover all claims; note that a single elimination
5159 step is *not* sufficient to establish the two conjunctions, so this
5162 assume "A & B" then have A and B .. (*".." fails*)
5164 better use "obtain" in situations as above; alternative refer to
5165 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5167 * Pure: proper integration with ``locales''; unlike the original
5168 version by Florian Kammller, Isar locales package high-level proof
5169 contexts rather than raw logical ones (e.g. we admit to include
5170 attributes everywhere); operations on locales include merge and
5171 rename; support for implicit arguments (``structures''); simultaneous
5172 type-inference over imports and text; see also HOL/ex/Locales.thy for
5175 * Pure: the following commands have been ``localized'', supporting a
5176 target locale specification "(in name)": 'lemma', 'theorem',
5177 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5178 stored both within the locale and at the theory level (exported and
5179 qualified by the locale name);
5181 * Pure: theory goals may now be specified in ``long'' form, with
5182 ad-hoc contexts consisting of arbitrary locale elements. for example
5183 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5184 definitions may be given, too); the result is a meta-level rule with
5185 the context elements being discharged in the obvious way;
5187 * Pure: new proof command 'using' allows to augment currently used
5188 facts after a goal statement ('using' is syntactically analogous to
5189 'apply', but acts on the goal's facts only); this allows chained facts
5190 to be separated into parts given before and after a claim, as in
5191 ``from a and b have C using d and e <proof>'';
5193 * Pure: renamed "antecedent" case to "rule_context";
5195 * Pure: new 'judgment' command records explicit information about the
5196 object-logic embedding (used by several tools internally); no longer
5197 use hard-wired "Trueprop";
5199 * Pure: added 'corollary' command;
5201 * Pure: fixed 'token_translation' command;
5203 * Pure: removed obsolete 'exported' attribute;
5205 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5206 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5207 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5209 * Pure: method 'atomize' presents local goal premises as object-level
5210 statements (atomic meta-level propositions); setup controlled via
5211 rewrite rules declarations of 'atomize' attribute; example
5212 application: 'induct' method with proper rule statements in improper
5215 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5216 now consider the syntactic context of assumptions, giving a better
5217 chance to get type-inference of the arguments right (this is
5218 especially important for locales);
5220 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5223 * Pure/obtain: the formal conclusion "thesis", being marked as
5224 ``internal'', may no longer be reference directly in the text;
5225 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5228 * Pure: generic 'sym' attribute which declares a rule both as pure
5229 'elim?' and for the 'symmetric' operation;
5231 * Pure: marginal comments ``--'' may now occur just anywhere in the
5232 text; the fixed correlation with particular command syntax has been
5235 * Pure: new method 'rules' is particularly well-suited for proof
5236 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5237 but often produces more compact proof terms with less detours;
5239 * Pure/Provers/classical: simplified integration with pure rule
5240 attributes and methods; the classical "intro?/elim?/dest?"
5241 declarations coincide with the pure ones; the "rule" method no longer
5242 includes classically swapped intros; "intro" and "elim" methods no
5243 longer pick rules from the context; also got rid of ML declarations
5244 AddXIs/AddXEs/AddXDs; all of this has some potential for
5247 * Provers/classical: attribute 'swapped' produces classical inversions
5248 of introduction rules;
5250 * Provers/simplifier: 'simplified' attribute may refer to explicit
5251 rules instead of full simplifier context; 'iff' attribute handles
5254 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5256 * HOL: 'recdef' now fails on unfinished automated proofs, use
5257 "(permissive)" option to recover old behavior;
5259 * HOL: 'inductive' no longer features separate (collective) attributes
5260 for 'intros' (was found too confusing);
5262 * HOL: properly declared induction rules less_induct and
5268 * HOL: moved over to sane numeral syntax; the new policy is as
5271 - 0 and 1 are polymorphic constants, which are defined on any
5272 numeric type (nat, int, real etc.);
5274 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5275 binary representation internally;
5277 - type nat has special constructor Suc, and generally prefers Suc 0
5278 over 1::nat and Suc (Suc 0) over 2::nat;
5280 This change may cause significant problems of INCOMPATIBILITY; here
5281 are some hints on converting existing sources:
5283 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5284 entities, so expressions involving "-" (unary or binary minus) need
5285 to be spaced properly;
5287 - existing occurrences of "1" may need to be constraint "1::nat" or
5288 even replaced by Suc 0; similar for old "2";
5290 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5292 - remove all special provisions on numerals in proofs;
5294 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5295 representation (depends on bin_arith_simps in the default context);
5297 * HOL: symbolic syntax for x^2 (numeral 2);
5299 * HOL: the class of all HOL types is now called "type" rather than
5300 "term"; INCOMPATIBILITY, need to adapt references to this type class
5301 in axclass/classes, instance/arities, and (usually rare) occurrences
5302 in typings (of consts etc.); internally the class is called
5303 "HOL.type", ML programs should refer to HOLogic.typeS;
5305 * HOL/record package improvements:
5306 - new derived operations "fields" to build a partial record section,
5307 "extend" to promote a fixed record to a record scheme, and
5308 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5309 declared as simp by default;
5310 - shared operations ("more", "fields", etc.) now need to be always
5311 qualified) --- potential INCOMPATIBILITY;
5312 - removed "make_scheme" operations (use "make" with "extend") --
5314 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5315 - provides cases/induct rules for use with corresponding Isar
5316 methods (for concrete records, record schemes, concrete more
5317 parts, and schematic more parts -- in that order);
5318 - internal definitions directly based on a light-weight abstract
5319 theory of product types over typedef rather than datatype;
5321 * HOL: generic code generator for generating executable ML code from
5322 specifications; specific support for HOL constructs such as inductive
5323 datatypes and sets, as well as recursive functions; can be invoked
5324 via 'generate_code' theory section;
5326 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5328 * HOL: consolidated and renamed several theories. In particular:
5329 Ord.thy has been absorbed into HOL.thy
5330 String.thy has been absorbed into List.thy
5332 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5333 (beware of argument permutation!);
5335 * HOL: linorder_less_split superseded by linorder_cases;
5337 * HOL/List: "nodups" renamed to "distinct";
5339 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5340 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5341 - Ex_def has changed, now need to use some_eq_ex
5343 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5344 in this (rare) case use:
5346 delSWrapper "split_all_tac"
5347 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5349 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5352 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5353 Isabelle's type classes, ^ on functions and relations has too general
5354 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5355 necessary to attach explicit type constraints;
5357 * HOL/Relation: the prefix name of the infix "O" has been changed from
5358 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5359 renamed accordingly (eg "compI" -> "rel_compI").
5361 * HOL: syntax translations now work properly with numerals and records
5364 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5365 of "lam" -- INCOMPATIBILITY;
5367 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5368 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5369 renamed "Product_Type.unit";
5371 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5373 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5374 the "cases" method);
5376 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5379 * HOL/IMP: updated and converted to new-style theory format; several
5380 parts turned into readable document, with proper Isar proof texts and
5381 some explanations (by Gerwin Klein);
5383 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5385 * HOL-Hyperreal is now a logic image;
5390 * Isar: consts/constdefs supports mixfix syntax for continuous
5393 * Isar: domain package adapted to new-style theory format, e.g. see
5396 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5397 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5398 lift.induct_tac, always use UU instead of Undef;
5400 * HOLCF/IMP: updated and converted to new-style theory;
5405 * Isar: proper integration of logic-specific tools and packages,
5406 including theory commands '(co)inductive', '(co)datatype',
5407 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5408 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5410 * theory Main no longer includes AC; for the Axiom of Choice, base
5411 your theory on Main_ZFC;
5413 * the integer library now covers quotients and remainders, with many
5414 laws relating division to addition, multiplication, etc.;
5416 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5417 typeless version of the formalism;
5419 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5422 * ZF/Induct: new directory for examples of inductive definitions,
5423 including theory Multiset for multiset orderings; converted to
5424 new-style theory format;
5426 * ZF: many new theorems about lists, ordinals, etc.;
5431 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5432 variable proof controls level of detail: 0 = no proofs (only oracle
5433 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5434 also ref manual for further ML interfaces;
5436 * Pure/axclass: removed obsolete ML interface
5437 goal_subclass/goal_arity;
5439 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5440 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5441 separate tokens, so expressions involving minus need to be spaced
5444 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5445 rather than "infixl" or "infixr";
5447 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5448 sort constraint specifications in type inference; e.g. "x::_::foo"
5449 ensures that the type of "x" is of sort "foo" (but not necessarily a
5452 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5453 control output of nested => (types); the default behavior is
5456 * Pure/syntax: builtin parse translation for "_constify" turns valued
5457 tokens into AST constants;
5459 * Pure/syntax: prefer later declarations of translations and print
5460 translation functions; potential INCOMPATIBILITY: need to reverse
5461 multiple declarations for same syntax element constant;
5463 * Pure/show_hyps reset by default (in accordance to existing Isar
5466 * Provers/classical: renamed addaltern to addafter, addSaltern to
5469 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5472 * system: tested support for MacOS X; should be able to get Isabelle +
5473 Proof General to work in a plain Terminal after installing Poly/ML
5474 (e.g. from the Isabelle distribution area) and GNU bash alone
5475 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5476 support requires further installations, e.g. from
5477 http://fink.sourceforge.net/);
5479 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5481 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5482 of 40 MB), cf. ML_OPTIONS;
5484 * system: Proof General keywords specification is now part of the
5485 Isabelle distribution (see etc/isar-keywords.el);
5487 * system: support for persistent Proof General sessions (refrain from
5488 outdating all loaded theories on startup); user may create writable
5489 logic images like this: ``isabelle -q HOL Test'';
5491 * system: smart selection of Isabelle process versus Isabelle
5492 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5493 run both "isabelle" and "Isabelle" even if file names are badly
5494 damaged (executable inspects the case of the first letter of its own
5495 name); added separate "isabelle-process" and "isabelle-interface";
5497 * system: refrain from any attempt at filtering input streams; no
5498 longer support ``8bit'' encoding of old isabelle font, instead proper
5499 iso-latin characters may now be used; the related isatools
5500 "symbolinput" and "nonascii" have disappeared as well;
5502 * system: removed old "xterm" interface (the print modes "xterm" and
5503 "xterm_color" are still available for direct use in a suitable
5508 New in Isabelle99-2 (February 2001)
5509 -----------------------------------
5511 *** Overview of INCOMPATIBILITIES ***
5513 * HOL: please note that theories in the Library and elsewhere often use the
5514 new-style (Isar) format; to refer to their theorems in an ML script you must
5515 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5517 * HOL: inductive package no longer splits induction rule aggressively,
5518 but only as far as specified by the introductions given; the old
5519 format may be recovered via ML function complete_split_rule or attribute
5520 'split_rule (complete)';
5522 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5523 gfp_Tarski to gfp_unfold;
5525 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5527 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5528 relation); infix "^^" has been renamed "``"; infix "``" has been
5529 renamed "`"; "univalent" has been renamed "single_valued";
5531 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5534 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5536 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5538 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5539 consequence, it is no longer monotonic wrt. the local goal context
5540 (which is now passed through the inductive cases);
5542 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5543 \<gg> to \<ggreater>;
5546 *** Document preparation ***
5548 * \isabellestyle{NAME} selects version of Isabelle output (currently
5549 available: are "it" for near math-mode best-style output, "sl" for
5550 slanted text style, and "tt" for plain type-writer; if no
5551 \isabellestyle command is given, output is according to slanted
5554 * support sub/super scripts (for single symbols only), input syntax is
5555 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5557 * some more standard symbols; see Appendix A of the system manual for
5558 the complete list of symbols defined in isabellesym.sty;
5560 * improved isabelle style files; more abstract symbol implementation
5561 (should now use \isamath{...} and \isatext{...} in custom symbol
5564 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5565 state; Note that presentation of goal states does not conform to
5566 actual human-readable proof documents. Please do not include goal
5567 states into document output unless you really know what you are doing!
5569 * proper indentation of antiquoted output with proportional LaTeX
5572 * no_document ML operator temporarily disables LaTeX document
5575 * isatool unsymbolize tunes sources for plain ASCII communication;
5580 * Pure: Isar now suffers initial goal statements to contain unbound
5581 schematic variables (this does not conform to actual readable proof
5582 documents, due to unpredictable outcome and non-compositional proof
5583 checking); users who know what they are doing may use schematic goals
5584 for Prolog-style synthesis of proven results;
5586 * Pure: assumption method (an implicit finishing) now handles actual
5589 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5590 initial goal, declare "that" only as Pure intro (only for single
5591 steps); the "that" rule assumption may now be involved in implicit
5592 finishing, thus ".." becomes a feasible for trivial obtains;
5594 * Pure: default proof step now includes 'intro_classes'; thus trivial
5595 instance proofs may be performed by "..";
5597 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5600 * Pure: more robust selection of calculational rules;
5602 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5603 rule (as well as the assumption rule);
5605 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5606 lemmas, using the graph browser tool;
5608 * Pure: predict failure of "show" in interactive mode;
5610 * Pure: 'thms_containing' now takes actual terms as arguments;
5612 * HOL: improved method 'induct' --- now handles non-atomic goals
5613 (potential INCOMPATIBILITY); tuned error handling;
5615 * HOL: cases and induct rules now provide explicit hints about the
5616 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5617 any remaining facts are inserted into the goal verbatim;
5619 * HOL: local contexts (aka cases) may now contain term bindings as
5620 well; the 'cases' and 'induct' methods new provide a ?case binding for
5621 the result to be shown in each case;
5623 * HOL: added 'recdef_tc' command;
5625 * isatool convert assists in eliminating legacy ML scripts;
5630 * HOL/Library: a collection of generic theories to be used together
5631 with main HOL; the theory loader path already includes this directory
5632 by default; the following existing theories have been moved here:
5633 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5634 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5636 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5637 modelling and verification task performed in Isabelle/HOL +
5638 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5640 * HOL/Algebra: special summation operator SUM no longer exists, it has
5641 been replaced by setsum; infix 'assoc' now has priority 50 (like
5642 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5643 'domain', this makes the theory consistent with mathematical
5646 * HOL basics: added overloaded operations "inverse" and "divide"
5647 (infix "/"), syntax for generic "abs" operation, generic summation
5650 * HOL/typedef: simplified package, provide more useful rules (see also
5653 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5654 now expressed as a proper nested rule (old-style tactic scripts may
5655 require atomize_strip_tac to cope with non-atomic premises);
5657 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5658 to "split_conv" (old name still available for compatibility);
5660 * HOL: improved concrete syntax for strings (e.g. allows translation
5661 rules with string literals);
5663 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5664 and Fleuriot's mechanization of analysis, including the transcendental
5665 functions for the reals;
5667 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5672 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5673 "lam" is displayed as TWO lambda-symbols
5675 * CTT: theory Main now available, containing everything (that is, Bool
5681 * Pure: the Simplifier has been implemented properly as a derived rule
5682 outside of the actual kernel (at last!); the overall performance
5683 penalty in practical applications is about 50%, while reliability of
5684 the Isabelle inference kernel has been greatly improved;
5686 * print modes "brackets" and "no_brackets" control output of nested =>
5687 (types) and ==> (props); the default behaviour is "brackets";
5689 * Provers: fast_tac (and friends) now handle actual object-logic rules
5690 as assumptions as well;
5692 * system: support Poly/ML 4.0;
5694 * system: isatool install handles KDE version 1 or 2;
5698 New in Isabelle99-1 (October 2000)
5699 ----------------------------------
5701 *** Overview of INCOMPATIBILITIES ***
5703 * HOL: simplification of natural numbers is much changed; to partly
5704 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5705 issue the following ML commands:
5707 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5708 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5710 * HOL: simplification no longer dives into case-expressions; this is
5711 controlled by "t.weak_case_cong" for each datatype t;
5713 * HOL: nat_less_induct renamed to less_induct;
5715 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5716 fixsome to patch .thy and .ML sources automatically;
5718 select_equality -> some_equality
5719 select_eq_Ex -> some_eq_ex
5720 selectI2EX -> someI2_ex
5723 select1_equality -> some1_equality
5724 Eps_sym_eq -> some_sym_eq_trivial
5725 Eps_eq -> some_eq_trivial
5727 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5729 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5732 * HOL: the recursion equations generated by 'recdef' are now called
5733 f.simps instead of f.rules;
5735 * HOL: qed_spec_mp now also handles bounded ALL as well;
5737 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5738 sometimes be needed;
5740 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5742 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5744 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5745 product is now "<*>" instead of "Times"; the lexicographic product is
5746 now "<*lex*>" instead of "**";
5748 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5749 of main HOL, but was unused); better use HOL's datatype package;
5751 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5752 the old syntax may be recovered as follows:
5755 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5756 (infixl "\\<oplus>" 100)
5758 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5760 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5761 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5764 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5765 changed from A/r to A//r;
5767 * ZF: new treatment of arithmetic (nat & int) may break some old
5770 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5771 rulify -> rule_format, elimify -> elim_format, ...);
5773 * Isar/Provers: intro/elim/dest attributes changed; renamed
5774 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5775 should have to change intro!! to intro? only); replaced "delrule" by
5778 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5780 * Provers: strengthened force_tac by using new first_best_tac;
5782 * LaTeX document preparation: several changes of isabelle.sty (see
5786 *** Document preparation ***
5788 * formal comments (text blocks etc.) in new-style theories may now
5789 contain antiquotations of thm/prop/term/typ/text to be presented
5790 according to latex print mode; concrete syntax is like this:
5791 @{term[show_types] "f(x) = a + x"};
5793 * isatool mkdir provides easy setup of Isabelle session directories,
5794 including proper document sources;
5796 * generated LaTeX sources are now deleted after successful run
5797 (isatool document -c); may retain a copy somewhere else via -D option
5800 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5801 style files, achieving self-contained LaTeX sources and simplifying
5804 * old-style theories now produce (crude) LaTeX output as well;
5806 * browser info session directories are now self-contained (may be put
5807 on WWW server seperately); improved graphs of nested sessions; removed
5808 graph for 'all sessions';
5810 * several improvements in isabelle style files; \isabellestyle{it}
5811 produces fake math mode output; \isamarkupheader is now \section by
5812 default; see lib/texinputs/isabelle.sty etc.;
5817 * Isar/Pure: local results and corresponding term bindings are now
5818 subject to Hindley-Milner polymorphism (similar to ML); this
5819 accommodates incremental type-inference very nicely;
5821 * Isar/Pure: new derived language element 'obtain' supports
5822 generalized existence reasoning;
5824 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5825 support accumulation of results, without applying any rules yet;
5826 useful to collect intermediate results without explicit name
5827 references, and for use with transitivity rules with more than 2
5830 * Isar/Pure: scalable support for case-analysis type proofs: new
5831 'case' language element refers to local contexts symbolically, as
5832 produced by certain proof methods; internally, case names are attached
5833 to theorems as "tags";
5835 * Isar/Pure: theory command 'hide' removes declarations from
5836 class/type/const name spaces;
5838 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5839 indicate potential overloading;
5841 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5843 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5844 "{a,b,c}" instead of {a,b,c};
5846 * Isar/Pure now provides its own version of intro/elim/dest
5847 attributes; useful for building new logics, but beware of confusion
5848 with the version in Provers/classical;
5850 * Isar/Pure: the local context of (non-atomic) goals is provided via
5851 case name 'antecedent';
5853 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5854 to the current context is now done automatically);
5856 * Isar/Pure: theory command 'method_setup' provides a simple interface
5857 for definining proof methods in ML;
5859 * Isar/Provers: intro/elim/dest attributes changed; renamed
5860 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5861 most cases, one should have to change intro!! to intro? only);
5862 replaced "delrule" by "rule del";
5864 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5865 'symmetric' attribute (the latter supercedes [RS sym]);
5867 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5868 method modifier); 'simp' method: 'only:' modifier removes loopers as
5869 well (including splits);
5871 * Isar/Provers: Simplifier and Classical methods now support all kind
5872 of modifiers used in the past, including 'cong', 'iff', etc.
5874 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5875 of Simplifier and Classical reasoner);
5877 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5878 now support named cases; major packages (inductive, datatype, primrec,
5879 recdef) support case names and properly name parameters;
5881 * Isar/HOL: new transitivity rules for substitution in inequalities --
5882 monotonicity conditions are extracted to be proven at end of
5885 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5888 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5889 split_if split_if_asm; datatype package provides theorems foo.splits =
5890 foo.split foo.split_asm for each datatype;
5892 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5893 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5894 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5895 use "(cases (simplified))" method in proper proof texts);
5897 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5899 * Isar: names of theorems etc. may be natural numbers as well;
5901 * Isar: 'pr' command: optional arguments for goals_limit and
5902 ProofContext.prems_limit; no longer prints theory contexts, but only
5905 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5906 additional print modes to be specified; e.g. "pr(latex)" will print
5907 proof state according to the Isabelle LaTeX style;
5909 * Isar: improved support for emulating tactic scripts, including proof
5910 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5911 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5912 (for HOL datatypes);
5914 * Isar: simplified (more robust) goal selection of proof methods: 1st
5915 goal, all goals, or explicit goal specifier (tactic emulation); thus
5916 'proof method scripts' have to be in depth-first order;
5918 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5920 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5921 should instead use individual commands for printing items
5922 (print_commands, print_methods etc.);
5924 * Isar: added 'nothing' --- the empty list of theorems;
5929 * HOL/MicroJava: formalization of a fragment of Java, together with a
5930 corresponding virtual machine and a specification of its bytecode
5931 verifier and a lightweight bytecode verifier, including proofs of
5932 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5933 Cornelia Pusch (see also the homepage of project Bali at
5934 http://isabelle.in.tum.de/Bali/);
5936 * HOL/Algebra: new theory of rings and univariate polynomials, by
5939 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5940 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5943 * HOL/Lattice: fundamental concepts of lattice theory and order
5944 structures, including duals, properties of bounds versus algebraic
5945 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5946 Theorem for complete lattices etc.; may also serve as a demonstration
5947 for abstract algebraic reasoning using axiomatic type classes, and
5948 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5950 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5953 * HOL/IMPP: extension of IMP with local variables and mutually
5954 recursive procedures, by David von Oheimb;
5956 * HOL/Lambda: converted into new-style theory and document;
5958 * HOL/ex/Multiquote: example of multiple nested quotations and
5959 anti-quotations -- basically a generalized version of de-Bruijn
5960 representation; very useful in avoiding lifting of operations;
5962 * HOL/record: added general record equality rule to simpset; fixed
5963 select-update simplification procedure to handle extended records as
5964 well; admit "r" as field name;
5966 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5967 other numeric types and also as the identity of groups, rings, etc.;
5969 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5970 Types nat and int belong to this axclass;
5972 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5973 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5974 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5975 two terms #m*u and #n*u are replaced by #(m+n)*u
5976 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5977 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5978 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5980 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5981 powerful prover for predicate logic but knows nothing of clasets; see
5982 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5984 * HOL: new version of "case_tac" subsumes both boolean case split and
5985 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5986 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5988 * HOL: simplification no longer dives into case-expressions: only the
5989 selector expression is simplified, but not the remaining arms; to
5990 enable full simplification of case-expressions for datatype t, you may
5991 remove t.weak_case_cong from the simpset, either globally (Delcongs
5992 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5994 * HOL/recdef: the recursion equations generated by 'recdef' for
5995 function 'f' are now called f.simps instead of f.rules; if all
5996 termination conditions are proved automatically, these simplification
5997 rules are added to the simpset, as in primrec; rules may be named
5998 individually as well, resulting in a separate list of theorems for
6001 * HOL/While is a new theory that provides a while-combinator. It
6002 permits the definition of tail-recursive functions without the
6003 provision of a termination measure. The latter is necessary once the
6004 invariant proof rule for while is applied.
6006 * HOL: new (overloaded) notation for the set of elements below/above
6007 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6009 * HOL: theorems impI, allI, ballI bound as "strip";
6011 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6012 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6013 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6015 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6017 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6018 main HOL, but was unused);
6020 * HOL: fewer consts declared as global (e.g. have to refer to
6021 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6023 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6024 in case of overlap with user translations (e.g. judgements over
6025 tuples); (note that the underlying logical represenation is still
6031 * ZF: simplification automatically cancels common terms in arithmetic
6032 expressions over nat and int;
6034 * ZF: new treatment of nat to minimize type-checking: all operators
6035 coerce their operands to a natural number using the function natify,
6036 making the algebraic laws unconditional;
6038 * ZF: as above, for int: operators coerce their operands to an integer
6039 using the function intify;
6041 * ZF: the integer library now contains many of the usual laws for the
6042 orderings, including $<=, and monotonicity laws for $+ and $*;
6044 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6047 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6048 to the simplifier and classical reasoner simultaneously;
6053 * Provers: blast_tac now handles actual object-logic rules as
6054 assumptions; note that auto_tac uses blast_tac internally as well;
6056 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6057 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6059 * Provers: delrules now handles destruct rules as well (no longer need
6060 explicit make_elim);
6062 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6063 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6064 use instead the strong form,
6065 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6066 in HOL, FOL and ZF the function cla_make_elim will create such rules
6067 from destruct-rules;
6069 * Provers: Simplifier.easy_setup provides a fast path to basic
6070 Simplifier setup for new object-logics;
6072 * Pure: AST translation rules no longer require constant head on LHS;
6074 * Pure: improved name spaces: ambiguous output is qualified; support
6075 for hiding of names;
6077 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6078 XSYMBOL_HOME; no longer need to do manual configuration in most
6081 * system: compression of ML heaps images may now be controlled via -c
6082 option of isabelle and isatool usedir (currently only observed by
6085 * system: isatool installfonts may handle X-Symbol fonts as well (very
6086 useful for remote X11);
6088 * system: provide TAGS file for Isabelle sources;
6090 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6093 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6094 timing flag supersedes proof_timing and Toplevel.trace;
6096 * ML: new combinators |>> and |>>> for incremental transformations
6097 with secondary results (e.g. certain theory extensions):
6099 * ML: PureThy.add_defs gets additional argument to indicate potential
6100 overloading (usually false);
6102 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6107 New in Isabelle99 (October 1999)
6108 --------------------------------
6110 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6112 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6113 are no longer simplified. (This allows the simplifier to unfold recursive
6114 functional programs.) To restore the old behaviour, declare
6116 Delcongs [if_weak_cong];
6118 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6121 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6123 * HOL/datatype: mutual_induct_tac no longer exists --
6124 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6126 * HOL/typedef: fixed type inference for representing set; type
6127 arguments now have to occur explicitly on the rhs as type constraints;
6129 * ZF: The con_defs part of an inductive definition may no longer refer
6130 to constants declared in the same theory;
6132 * HOL, ZF: the function mk_cases, generated by the inductive
6133 definition package, has lost an argument. To simplify its result, it
6134 uses the default simpset instead of a supplied list of theorems.
6136 * HOL/List: the constructors of type list are now Nil and Cons;
6138 * Simplifier: the type of the infix ML functions
6139 setSSolver addSSolver setSolver addSolver
6140 is now simpset * solver -> simpset where `solver' is a new abstract type
6141 for packaging solvers. A solver is created via
6142 mk_solver: string -> (thm list -> int -> tactic) -> solver
6143 where the string argument is only a comment.
6148 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6149 decision procedure for linear arithmetic. Currently it is used for
6150 types `nat', `int', and `real' in HOL (see below); it can, should and
6151 will be instantiated for other types and logics as well.
6153 * The simplifier now accepts rewrite rules with flexible heads, eg
6154 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6155 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6161 * New Isabelle/Isar subsystem provides an alternative to traditional
6162 tactical theorem proving; together with the ProofGeneral/isar user
6163 interface it offers an interactive environment for developing human
6164 readable proof documents (Isar == Intelligible semi-automated
6165 reasoning); for further information see isatool doc isar-ref,
6166 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6168 * improved and simplified presentation of theories: better HTML markup
6169 (including colors), graph views in several sizes; isatool usedir now
6170 provides a proper interface for user theories (via -P option); actual
6171 document preparation based on (PDF)LaTeX is available as well (for
6172 new-style theories only); see isatool doc system for more information;
6174 * native support for Proof General, both for classic Isabelle and
6177 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6178 using the graph browser tool;
6180 * Isabelle manuals now also available as PDF;
6182 * theory loader rewritten from scratch (may not be fully
6183 bug-compatible); old loadpath variable has been replaced by show_path,
6184 add_path, del_path, reset_path functions; new operations such as
6185 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6188 * improved isatool install: option -k creates KDE application icon,
6189 option -p DIR installs standalone binaries;
6191 * added ML_PLATFORM setting (useful for cross-platform installations);
6192 more robust handling of platform specific ML images for SML/NJ;
6194 * the settings environment is now statically scoped, i.e. it is never
6195 created again in sub-processes invoked from isabelle, isatool, or
6198 * path element specification '~~' refers to '$ISABELLE_HOME';
6200 * in locales, the "assumes" and "defines" parts may be omitted if
6203 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6206 * new print_mode "HTML";
6208 * new flag show_tags controls display of tags of theorems (which are
6209 basically just comments that may be attached by some tools);
6211 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6212 mode and goal output format:
6214 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6216 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6218 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6219 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6221 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6223 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6225 * function bind_thms stores lists of theorems (cf. bind_thm);
6227 * new shorthand tactics ftac, eatac, datac, fatac;
6229 * qed (and friends) now accept "" as result name; in that case the
6230 theorem is not stored, but proper checks and presentation of the
6233 * theorem database now also indexes constants "Trueprop", "all",
6234 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6239 ** HOL arithmetic **
6241 * There are now decision procedures for linear arithmetic over nat and
6244 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6245 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6246 are treated as atomic; subformulae not involving type `nat' or `int'
6247 are ignored; quantified subformulae are ignored unless they are
6248 positive universal or negative existential. The tactic has to be
6249 invoked by hand and can be a little bit slow. In particular, the
6250 running time is exponential in the number of occurrences of `min' and
6251 `max', and `-' on `nat'.
6253 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6254 (negated) (in)equalities among the premises and the conclusion into
6255 account (i.e. no compound formulae) and does not know about `min' and
6256 `max', and `-' on `nat'. It is fast and is used automatically by the
6259 NB: At the moment, these decision procedures do not cope with mixed
6260 nat/int formulae where the two parts interact, such as `m < n ==>
6263 * HOL/Numeral provides a generic theory of numerals (encoded
6264 efficiently as bit strings); setup for types nat/int/real is in place;
6265 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6266 int, existing theories and proof scripts may require a few additional
6269 * integer division and remainder can now be performed on constant
6272 * many properties of integer multiplication, division and remainder
6275 * An interface to the Stanford Validity Checker (SVC) is available through the
6276 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6277 are proved automatically. SVC must be installed separately, and its results
6278 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6279 invocation of the underlying oracle). For SVC see
6280 http://verify.stanford.edu/SVC
6282 * IsaMakefile: the HOL-Real target now builds an actual image;
6287 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6288 (in Isabelle/Isar) -- by Gertrud Bauer;
6290 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6291 analysis for assembly languages with subtypes;
6293 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6294 -- avoids syntactic ambiguities and treats state, transition, and
6295 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6296 changed syntax and (many) tactics;
6298 * HOL/inductive: Now also handles more general introduction rules such
6299 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6300 theorems are now maintained within the theory (maintained via the
6303 * HOL/datatype: Now also handles arbitrarily branching datatypes
6304 (using function types) such as
6306 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6308 * HOL/record: record_simproc (part of the default simpset) takes care
6309 of selectors applied to updated records; record_split_tac is no longer
6310 part of the default claset; update_defs may now be removed from the
6311 simpset in many cases; COMPATIBILITY: old behavior achieved by
6313 claset_ref () := claset() addSWrapper record_split_wrapper;
6314 Delsimprocs [record_simproc]
6316 * HOL/typedef: fixed type inference for representing set; type
6317 arguments now have to occur explicitly on the rhs as type constraints;
6319 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6320 names rather than an ML expression;
6322 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6323 supplied later. Program schemes can be defined, such as
6324 "While B C s = (if B s then While B C (C s) else s)"
6325 where the well-founded relation can be chosen after B and C have been given.
6327 * HOL/List: the constructors of type list are now Nil and Cons;
6328 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6329 course, ML tools referring to List.list.op # etc. have to be adapted;
6331 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6332 disabled by default; run isabelle with option -m HOL to get back to
6333 the original Gordon/HOL-style output;
6335 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6336 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6338 * HOL basic syntax simplified (more orthogonal): all variants of
6339 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6340 Eps operator is provided as well: "SOME x. P[x]";
6342 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6344 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6345 thus available for user theories;
6347 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6348 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6351 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6352 several times and then mp;
6357 * the notation <<...>> is now available as a notation for sequences of
6360 * the simplifier is now installed
6362 * the axiom system has been generalized (thanks to Soren Heilmann)
6364 * the classical reasoner now has a default rule database
6369 * new primrec section allows primitive recursive functions to be given
6370 directly (as in HOL) over datatypes and the natural numbers;
6372 * new tactics induct_tac and exhaust_tac for induction (or case
6373 analysis) over datatypes and the natural numbers;
6375 * the datatype declaration of type T now defines the recursor T_rec;
6377 * simplification automatically does freeness reasoning for datatype
6380 * automatic type-inference, with AddTCs command to insert new
6381 type-checking rules;
6383 * datatype introduction rules are now added as Safe Introduction rules
6386 * the syntax "if P then x else y" is now available in addition to
6390 *** Internal programming interfaces ***
6392 * tuned simplifier trace output; new flag debug_simp;
6394 * structures Vartab / Termtab (instances of TableFun) offer efficient
6395 tables indexed by indexname_ord / term_ord (compatible with aconv);
6397 * AxClass.axclass_tac lost the theory argument;
6399 * tuned current_goals_markers semantics: begin / end goal avoids
6400 printing empty lines;
6402 * removed prs and prs_fn hook, which was broken because it did not
6403 include \n in its semantics, forcing writeln to add one
6404 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6405 string -> unit if you really want to output text without newline;
6407 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6408 plain output, interface builders may have to enable 'isabelle_font'
6409 mode to get Isabelle font glyphs as before;
6411 * refined token_translation interface; INCOMPATIBILITY: output length
6412 now of type real instead of int;
6414 * theory loader actions may be traced via new ThyInfo.add_hook
6415 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6416 your own database of information attached to *whole* theories -- as
6417 opposed to intra-theory data slots offered via TheoryDataFun;
6419 * proper handling of dangling sort hypotheses (at last!);
6420 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6421 extra sort hypotheses that can be witnessed from the type signature;
6422 the force_strip_shyps flag is gone, any remaining shyps are simply
6423 left in the theorem (with a warning issued by strip_shyps_warning);
6427 New in Isabelle98-1 (October 1998)
6428 ----------------------------------
6430 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6432 * several changes of automated proof tools;
6434 * HOL: major changes to the inductive and datatype packages, including
6435 some minor incompatibilities of theory syntax;
6437 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6440 * HOL: removed duplicate thms in Arith:
6441 less_imp_add_less should be replaced by trans_less_add1
6442 le_imp_add_le should be replaced by trans_le_add1
6444 * HOL: unary minus is now overloaded (new type constraints may be
6447 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6448 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6449 now taken as an integer constant.
6451 * Pure: ML function 'theory_of' renamed to 'theory';
6457 1. Asm_full_simp_tac is now more aggressive.
6458 1. It will sometimes reorient premises if that increases their power to
6460 2. It does no longer proceed strictly from left to right but may also
6461 rotate premises to achieve further simplification.
6462 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6463 old Asm_full_simp_tac in that it does not rotate premises.
6464 2. The simplifier now knows a little bit about nat-arithmetic.
6466 * Classical reasoner: wrapper mechanism for the classical reasoner now
6467 allows for selected deletion of wrappers, by introduction of names for
6468 wrapper functionals. This implies that addbefore, addSbefore,
6469 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6470 and that adding two tactics with the same name overwrites the first
6471 one (emitting a warning).
6472 type wrapper = (int -> tactic) -> (int -> tactic)
6473 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6474 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6475 delWrapper, delSWrapper: claset * string -> claset
6476 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6478 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6479 semantics; addbefore now affects only the unsafe part of step_tac
6480 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6481 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6484 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6485 compWrapper; added safe wrapper (and access functions for it);
6487 * HOL/split_all_tac is now much faster and fails if there is nothing
6488 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6489 and the names of the automatically generated variables have changed.
6490 split_all_tac has moved within claset() from unsafe wrappers to safe
6491 wrappers, which means that !!-bound variables are split much more
6492 aggressively, and safe_tac and clarify_tac now split such variables.
6493 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6494 Note: the same holds for record_split_tac, which does the job of
6495 split_all_tac for record fields.
6497 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6498 permanently to the default simpset using Addsplits just like
6499 Addsimps. They can be removed via Delsplits just like
6500 Delsimps. Lower-case versions are also available.
6502 * HOL/Simplifier: The rule split_if is now part of the default
6503 simpset. This means that the simplifier will eliminate all occurrences
6504 of if-then-else in the conclusion of a goal. To prevent this, you can
6505 either remove split_if completely from the default simpset by
6506 `Delsplits [split_if]' or remove it in a specific call of the
6507 simplifier using `... delsplits [split_if]'. You can also add/delete
6508 other case splitting rules to/from the default simpset: every datatype
6509 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6510 t is the name of the datatype).
6512 * Classical reasoner / Simplifier combination: new force_tac (and
6513 derivatives Force_tac, force) combines rewriting and classical
6514 reasoning (and whatever other tools) similarly to auto_tac, but is
6515 aimed to solve the given subgoal completely.
6520 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6521 and `goalw': the theory is no longer needed as an explicit argument -
6522 the current theory context is used; assumptions are no longer returned
6523 at the ML-level unless one of them starts with ==> or !!; it is
6524 recommended to convert to these new commands using isatool fixgoal
6525 (backup your sources first!);
6527 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6528 the current theory context, and 'theory' to lookup stored theories;
6530 * new theory section 'locale' for declaring constants, assumptions and
6531 definitions that have local scope;
6533 * new theory section 'nonterminals' for purely syntactic types;
6535 * new theory section 'setup' for generic ML setup functions
6536 (e.g. package initialization);
6538 * the distribution now includes Isabelle icons: see
6539 lib/logo/isabelle-{small,tiny}.xpm;
6541 * isatool install - install binaries with absolute references to
6544 * isatool logo -- create instances of the Isabelle logo (as EPS);
6546 * print mode 'emacs' reserved for Isamode;
6548 * support multiple print (ast) translations per constant name;
6550 * theorems involving oracles are now printed with a suffixed [!];
6555 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6557 * HOL/inductive package reorganized and improved: now supports mutual
6563 oddI "n : EVEN ==> Suc n : ODD"
6564 evenI "n : ODD ==> Suc n : EVEN"
6566 new theorem list "elims" contains an elimination rule for each of the
6567 recursive sets; inductive definitions now handle disjunctive premises
6568 correctly (also ZF);
6570 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6571 "mutual_induct" no longer exists - the induction rule is always
6572 contained in "induct";
6575 * HOL/datatype package re-implemented and greatly improved: now
6576 supports mutually recursive datatypes such as
6579 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6580 | SUM ('a aexp) ('a aexp)
6581 | DIFF ('a aexp) ('a aexp)
6584 'a bexp = LESS ('a aexp) ('a aexp)
6585 | AND ('a bexp) ('a bexp)
6586 | OR ('a bexp) ('a bexp)
6588 as well as indirectly recursive datatypes such as
6591 ('a, 'b) term = Var 'a
6592 | App 'b ((('a, 'b) term) list)
6594 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6595 induction on mutually / indirectly recursive datatypes.
6597 Primrec equations are now stored in theory and can be accessed via
6598 <function_name>.simps.
6602 - Theories using datatypes must now have theory Datatype as an
6604 - The specific <typename>.induct_tac no longer exists - use the
6605 generic induct_tac instead.
6606 - natE has been renamed to nat.exhaust - use exhaust_tac
6607 instead of res_inst_tac ... natE. Note that the variable
6608 names in nat.exhaust differ from the names in natE, this
6609 may cause some "fragile" proofs to fail.
6610 - The theorems split_<typename>_case and split_<typename>_case_asm
6611 have been renamed to <typename>.split and <typename>.split_asm.
6612 - Since default sorts of type variables are now handled correctly,
6613 some datatype definitions may have to be annotated with explicit
6615 - Primrec definitions no longer require function name and type
6616 of recursive argument.
6618 Consider using isatool fixdatatype to adapt your theories and proof
6619 scripts to the new package (backup your sources first!).
6622 * HOL/record package: considerably improved implementation; now
6623 includes concrete syntax for record types, terms, updates; theorems
6624 for surjective pairing and splitting !!-bound record variables; proof
6625 support is as follows:
6627 1) standard conversions (selectors or updates applied to record
6628 constructor terms) are part of the standard simpset;
6630 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6631 made part of standard simpset and claset via addIffs;
6633 3) a tactic for record field splitting (record_split_tac) is part of
6634 the standard claset (addSWrapper);
6636 To get a better idea about these rules you may retrieve them via
6637 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6638 the name of your record type.
6640 The split tactic 3) conceptually simplifies by the following rule:
6642 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6644 Thus any record variable that is bound by meta-all will automatically
6645 blow up into some record constructor term, consequently the
6646 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6647 solve record problems automatically.
6650 * reorganized the main HOL image: HOL/Integ and String loaded by
6651 default; theory Main includes everything;
6653 * automatic simplification of integer sums and comparisons, using cancellation;
6655 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6657 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6659 * many new identities for unions, intersections, set difference, etc.;
6661 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6662 called split_if, split_split, split_sum_case and split_nat_case (to go
6663 with add/delsplits);
6665 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6666 (?x::unit) = (); this is made part of the default simpset, which COULD
6667 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6668 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6669 unit_abs_eta_conv is added in order to counter the effect of
6670 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6673 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6676 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6677 It and 'sym RS equals0D' are now in the default claset, giving automatic
6678 disjointness reasoning but breaking a few old proofs.
6680 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6681 to 'converse' from 'inverse' (for compatibility with ZF and some
6684 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6685 the well-founded relation;
6687 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6688 Compl A. The "Compl" syntax remains available as input syntax for this
6691 * HOL/Update: new theory of function updates:
6692 f(a:=b) == %x. if x=a then b else f x
6693 may also be iterated as in f(a:=b,c:=d,...);
6695 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6698 - new function list_update written xs[i:=v] that updates the i-th
6699 list position. May also be iterated as in xs[i:=a,j:=b,...].
6700 - new function `upt' written [i..j(] which generates the list
6701 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6702 bound write [i..j], which is a shorthand for [i..j+1(].
6703 - new lexicographic orderings and corresponding wellfoundedness theorems.
6706 - removed 'pred' (predecessor) function;
6707 - generalized some theorems about n-1;
6708 - many new laws about "div" and "mod";
6709 - new laws about greatest common divisors (see theory ex/Primes);
6711 * HOL/Relation: renamed the relational operator r^-1 "converse"
6712 instead of "inverse";
6714 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6715 of the multiset ordering;
6717 * directory HOL/Real: a construction of the reals using Dedekind cuts
6718 (not included by default);
6720 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6722 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6723 programs, i.e. different program variables may have different types.
6725 * calling (stac rew i) now fails if "rew" has no effect on the goal
6726 [previously, this check worked only if the rewrite rule was unconditional]
6727 Now rew can involve either definitions or equalities (either == or =).
6732 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6733 only the theorems proved on ZF.ML;
6735 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6736 It and 'sym RS equals0D' are now in the default claset, giving automatic
6737 disjointness reasoning but breaking a few old proofs.
6739 * ZF/Update: new theory of function updates
6740 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6741 may also be iterated as in f(a:=b,c:=d,...);
6743 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6745 * calling (stac rew i) now fails if "rew" has no effect on the goal
6746 [previously, this check worked only if the rewrite rule was unconditional]
6747 Now rew can involve either definitions or equalities (either == or =).
6749 * case_tac provided for compatibility with HOL
6750 (like the old excluded_middle_tac, but with subgoals swapped)
6753 *** Internal programming interfaces ***
6755 * Pure: several new basic modules made available for general use, see
6756 also src/Pure/README;
6758 * improved the theory data mechanism to support encapsulation (data
6759 kind name replaced by private Object.kind, acting as authorization
6760 key); new type-safe user interface via functor TheoryDataFun; generic
6761 print_data function becomes basically useless;
6763 * removed global_names compatibility flag -- all theory declarations
6764 are qualified by default;
6766 * module Pure/Syntax now offers quote / antiquote translation
6767 functions (useful for Hoare logic etc. with implicit dependencies);
6768 see HOL/ex/Antiquote for an example use;
6770 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6773 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6776 * Display.print_goals function moved to Locale.print_goals;
6778 * standard print function for goals supports current_goals_markers
6779 variable for marking begin of proof, end of proof, start of goal; the
6780 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6781 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6786 New in Isabelle98 (January 1998)
6787 --------------------------------
6789 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6791 * changed lexical syntax of terms / types: dots made part of long
6792 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6794 * simpset (and claset) reference variable replaced by functions
6795 simpset / simpset_ref;
6797 * no longer supports theory aliases (via merge) and non-trivial
6798 implicit merge of thms' signatures;
6800 * most internal names of constants changed due to qualified names;
6802 * changed Pure/Sequence interface (see Pure/seq.ML);
6805 *** General Changes ***
6807 * hierachically structured name spaces (for consts, types, axms, thms
6808 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6809 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6810 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6811 long_names for fully qualified output names; NOTE: ML programs
6812 (special tactics, packages etc.) referring to internal names may have
6813 to be adapted to cope with fully qualified names; in case of severe
6814 backward campatibility problems try setting 'global_names' at compile
6815 time to have enrything declared within a flat name space; one may also
6816 fine tune name declarations in theories via the 'global' and 'local'
6819 * reimplemented the implicit simpset and claset using the new anytype
6820 data filed in signatures; references simpset:simpset ref etc. are
6821 replaced by functions simpset:unit->simpset and
6822 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6823 to patch your ML files accordingly;
6825 * HTML output now includes theory graph data for display with Java
6826 applet or isatool browser; data generated automatically via isatool
6827 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6829 * defs may now be conditional; improved rewrite_goals_tac to handle
6830 conditional equations;
6832 * defs now admits additional type arguments, using TYPE('a) syntax;
6834 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6835 creates a new theory node; implicit merge of thms' signatures is
6836 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6837 transfer:theory->thm->thm in (rare) cases;
6839 * improved handling of draft signatures / theories; draft thms (and
6840 ctyps, cterms) are automatically promoted to real ones;
6842 * slightly changed interfaces for oracles: admit many per theory, named
6843 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6845 * print_goals: optional output of const types (set show_consts and
6848 * improved output of warnings (###) and errors (***);
6850 * subgoal_tac displays a warning if the new subgoal has type variables;
6852 * removed old README and Makefiles;
6854 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6856 * removed obsolete init_pps and init_database;
6858 * deleted the obsolete tactical STATE, which was declared by
6859 fun STATE tacfun st = tacfun st st;
6861 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6862 (which abbreviates $HOME);
6864 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6865 use isatool fixseq to adapt your ML programs (this works for fully
6866 qualified references to the Sequence structure only!);
6868 * use_thy no longer requires writable current directory; it always
6869 reloads .ML *and* .thy file, if either one is out of date;
6872 *** Classical Reasoner ***
6874 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6875 tactics that use classical reasoning to simplify a subgoal without
6876 splitting it into several subgoals;
6878 * Safe_tac: like safe_tac but uses the default claset;
6883 * added simplification meta rules:
6884 (asm_)(full_)simplify: simpset -> thm -> thm;
6886 * simplifier.ML no longer part of Pure -- has to be loaded by object
6889 * added prems argument to simplification procedures;
6891 * HOL, FOL, ZF: added infix function `addsplits':
6892 instead of `<simpset> setloop (split_tac <thms>)'
6893 you can simply write `<simpset> addsplits <thms>'
6898 * TYPE('a) syntax for type reflection terms;
6900 * no longer handles consts with name "" -- declare as 'syntax' instead;
6902 * pretty printer: changed order of mixfix annotation preference (again!);
6904 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6909 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6910 with `addloop' of the simplifier to faciliate case splitting in premises.
6912 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6914 * HOL/Auth: new protocol proofs including some for the Internet
6917 * HOL/Map: new theory of `maps' a la VDM;
6919 * HOL/simplifier: simplification procedures nat_cancel_sums for
6920 cancelling out common nat summands from =, <, <= (in)equalities, or
6921 differences; simplification procedures nat_cancel_factor for
6922 cancelling common factor from =, <, <= (in)equalities over natural
6923 sums; nat_cancel contains both kinds of procedures, it is installed by
6924 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6926 * HOL/simplifier: terms of the form
6927 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6929 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6930 and those of the form
6931 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6933 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6936 Each datatype `t' now comes with a theorem `split_t_case' of the form
6938 P(t_case f1 ... fn x) =
6939 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6941 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6944 and a theorem `split_t_case_asm' of the form
6946 P(t_case f1 ... fn x) =
6947 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6949 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6951 which can be added to a simpset via `addsplits'. The existing theorems
6952 expand_list_case and expand_option_case have been renamed to
6953 split_list_case and split_option_case.
6956 - `pred n' is automatically converted to `n-1'.
6957 Users are strongly encouraged not to use `pred' any longer,
6958 because it will disappear altogether at some point.
6959 - Users are strongly encouraged to write "0 < n" rather than
6960 "n ~= 0". Theorems and proof tools have been modified towards this
6964 the function "set_of_list" has been renamed "set" (and its theorems too);
6965 the function "nth" now takes its arguments in the reverse order and
6966 has acquired the infix notation "!" as in "xs!n".
6968 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6970 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6971 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6973 * HOL/record: extensible records with schematic structural subtyping
6974 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6975 still lacks various theorems and concrete record syntax;
6980 * removed "axioms" and "generated by" sections;
6982 * replaced "ops" section by extended "consts" section, which is capable of
6983 handling the continuous function space "->" directly;
6986 . proves theorems immediately and stores them in the theory,
6987 . creates hierachical name space,
6988 . now uses normal mixfix annotations (instead of cinfix...),
6989 . minor changes to some names and values (for consistency),
6990 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6991 . separator between mutual domain defs: changed "," to "and",
6992 . improved handling of sort constraints; now they have to
6993 appear on the left-hand side of the equations only;
6995 * fixed LAM <x,y,zs>.b syntax;
6997 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6998 adm (%x. P (t x)), where P is chainfinite and t continuous;
7003 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7004 with `addloop' of the simplifier to faciliate case splitting in premises.
7006 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7007 in HOL, they strip ALL and --> from proved theorems;
7011 New in Isabelle94-8 (May 1997)
7012 ------------------------------
7014 *** General Changes ***
7016 * new utilities to build / run / maintain Isabelle etc. (in parts
7017 still somewhat experimental); old Makefiles etc. still functional;
7019 * new 'Isabelle System Manual';
7021 * INSTALL text, together with ./configure and ./build scripts;
7023 * reimplemented type inference for greater efficiency, better error
7024 messages and clean internal interface;
7026 * prlim command for dealing with lots of subgoals (an easier way of
7027 setting goals_limit);
7032 * supports alternative (named) syntax tables (parser and pretty
7033 printer); internal interface is provided by add_modesyntax(_i);
7035 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7036 be used in conjunction with the Isabelle symbol font; uses the
7037 "symbols" syntax table;
7039 * added token_translation interface (may translate name tokens in
7040 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7041 the current print_mode); IMPORTANT: user print translation functions
7042 are responsible for marking newly introduced bounds
7043 (Syntax.mark_boundT);
7045 * token translations for modes "xterm" and "xterm_color" that display
7046 names in bold, underline etc. or colors (which requires a color
7049 * infixes may now be declared with names independent of their syntax;
7051 * added typed_print_translation (like print_translation, but may
7052 access type of constant);
7055 *** Classical Reasoner ***
7057 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7058 some limitations. Blast_tac...
7059 + ignores addss, addbefore, addafter; this restriction is intrinsic
7060 + ignores elimination rules that don't have the correct format
7061 (the conclusion MUST be a formula variable)
7062 + ignores types, which can make HOL proofs fail
7063 + rules must not require higher-order unification, e.g. apply_type in ZF
7064 [message "Function Var's argument not a bound variable" relates to this]
7065 + its proof strategy is more general but can actually be slower
7067 * substitution with equality assumptions no longer permutes other
7070 * minor changes in semantics of addafter (now called addaltern); renamed
7071 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7072 (and access functions for it);
7074 * improved combination of classical reasoner and simplifier:
7075 + functions for handling clasimpsets
7076 + improvement of addss: now the simplifier is called _after_ the
7078 + safe variant of addss called addSss: uses safe simplifications
7079 _during_ the safe steps. It is more complete as it allows multiple
7080 instantiations of unknowns (e.g. with slow_tac).
7084 * added interface for simplification procedures (functions that
7085 produce *proven* rewrite rules on the fly, depending on current
7088 * ordering on terms as parameter (used for ordered rewriting);
7090 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7092 * the solver is now split into a safe and an unsafe part.
7093 This should be invisible for the normal user, except that the
7094 functions setsolver and addsolver have been renamed to setSolver and
7095 addSolver; added safe_asm_full_simp_tac;
7100 * a generic induction tactic `induct_tac' which works for all datatypes and
7101 also for type `nat';
7103 * a generic case distinction tactic `exhaust_tac' which works for all
7104 datatypes and also for type `nat';
7106 * each datatype comes with a function `size';
7108 * patterns in case expressions allow tuple patterns as arguments to
7109 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7111 * primrec now also works with type nat;
7113 * recdef: a new declaration form, allows general recursive functions to be
7114 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7116 * the constant for negation has been renamed from "not" to "Not" to
7117 harmonize with FOL, ZF, LK, etc.;
7119 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7122 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7124 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7125 problems in commutative rings, using axiomatic type classes for + and *;
7127 * more examples in HOL/MiniML and HOL/Auth;
7129 * more default rewrite rules for quantifiers, union/intersection;
7131 * a new constant `arbitrary == @x.False';
7133 * HOLCF/IOA replaces old HOL/IOA;
7135 * HOLCF changes: derived all rules and arities
7136 + axiomatic type classes instead of classes
7137 + typedef instead of faking type definitions
7138 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7139 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7140 + eliminated the types void, one, tr
7141 + use unit lift and bool lift (with translations) instead of one and tr
7142 + eliminated blift from Lift3.thy (use Def instead of blift)
7143 all eliminated rules are derived as theorems --> no visible changes ;
7148 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7149 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7150 as ZF_cs addSIs [equalityI];
7154 New in Isabelle94-7 (November 96)
7155 ---------------------------------
7157 * allowing negative levels (as offsets) in prlev and choplev;
7159 * super-linear speedup for large simplifications;
7161 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7162 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7163 FAIL); can suppress it using the command Delsimps (ex_simps @
7164 all_simps); De Morgan laws are also now included, by default;
7166 * improved printing of ==> : ~:
7168 * new object-logic "Sequents" adds linear logic, while replacing LK
7169 and Modal (thanks to Sara Kalvala);
7171 * HOL/Auth: correctness proofs for authentication protocols;
7173 * HOL: new auto_tac combines rewriting and classical reasoning (many
7174 examples on HOL/Auth);
7176 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7177 the rewriter and classical reasoner simultaneously;
7179 * function uresult no longer returns theorems in "standard" format;
7180 regain previous version by: val uresult = standard o uresult;
7187 * oracles -- these establish an interface between Isabelle and trusted
7188 external reasoners, which may deliver results as theorems;
7190 * proof objects (in particular record all uses of oracles);
7192 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7194 * "constdefs" section in theory files;
7196 * "primrec" section (HOL) no longer requires names;
7198 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7205 * reduced space requirements;
7207 * automatic HTML generation from theories;
7209 * theory files no longer require "..." (quotes) around most types;
7211 * new examples, including two proofs of the Church-Rosser theorem;
7213 * non-curried (1994) version of HOL is no longer distributed;
7220 * greatly reduced space requirements;
7222 * theory files (.thy) no longer require \...\ escapes at line breaks;
7224 * searchable theorem database (see the section "Retrieving theorems" on
7225 page 8 of the Reference Manual);
7227 * new examples, including Grabczewski's monumental case study of the
7230 * The previous version of HOL renamed to Old_HOL;
7232 * The new version of HOL (previously called CHOL) uses a curried syntax
7233 for functions. Application looks like f a b instead of f(a,b);
7235 * Mutually recursive inductive definitions finally work in HOL;
7237 * In ZF, pattern-matching on tuples is now available in all abstractions and
7238 translates to the operator "split";
7245 * new infix operator, addss, allowing the classical reasoner to
7246 perform simplification at each step of its search. Example:
7247 fast_tac (cs addss ss)
7249 * a new logic, CHOL, the same as HOL, but with a curried syntax
7250 for functions. Application looks like f a b instead of f(a,b). Also pairs
7251 look like (a,b) instead of <a,b>;
7253 * PLEASE NOTE: CHOL will eventually replace HOL!
7255 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7256 It translates to the operator "split". A new theory of integers is available;
7258 * In ZF, integer numerals now denote two's-complement binary integers.
7259 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7261 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7262 of the Axiom of Choice;
7269 * Significantly faster resolution;
7271 * the different sections in a .thy file can now be mixed and repeated
7274 * Database of theorems for FOL, HOL and ZF. New
7275 commands including qed, qed_goal and bind_thm store theorems in the database.
7277 * Simple database queries: return a named theorem (get_thm) or all theorems of
7278 a given theory (thms_of), or find out what theory a theorem was proved in
7281 * Bugs fixed in the inductive definition and datatype packages;
7283 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7284 and HOL_dup_cs obsolete;
7286 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7289 * Simpler definition of function space in ZF;
7291 * new results about cardinal and ordinal arithmetic in ZF;
7293 * 'subtype' facility in HOL for introducing new types as subsets of existing
7296 :mode=text:wrap=hard:maxLineLen=72: