1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Prover IDE (PIDE) improvements:
11 - markup for bound variables
12 - markup for types of term variables (e.g. displayed as tooltips)
13 - support for user-defined Isar commands within the running session
15 * Updated and extended reference manuals ("isar-ref" and
16 "implementation"); reduced remaining material in old "ref" manual.
18 * Rule attributes in local theory declarations (e.g. locale or class)
19 are now statically evaluated: the resulting theorem is stored instead
20 of the original expression. INCOMPATIBILITY in rare situations, where
21 the historic accident of dynamic re-evaluation in interpretations
24 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
25 declaration, and results are standardized before being stored. Thus
26 old-style "standard" after instantiation or composition of facts
27 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
28 indices of schematic variables.
30 * Renamed some inner syntax categories:
36 Minor INCOMPATIBILITY. Note that in practice "num_const" or
37 "num_position" etc. are mainly used instead (which also include
38 position information via constraints).
40 * Simplified configuration options for syntax ambiguity: see
41 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
42 manual. Minor INCOMPATIBILITY.
44 * Forward declaration of outer syntax keywords within the theory
45 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
46 commands to be used in the same theory where defined.
51 * Attribute "abs_def" turns an equation of the form "f x y == t" into
52 "f == %x y. t", which ensures that "simp" or "unfold" steps always
53 expand it. This also works for object-logic equality. (Formerly
54 undocumented feature.)
56 * Discontinued old "prems" fact, which used to refer to the accidental
57 collection of foundational premises in the context (marked as legacy
60 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
61 instead. INCOMPATIBILITY.
63 * Ancient code generator for SML and its commands 'code_module',
64 'code_library', 'consts_code', 'types_code' have been discontinued.
65 Use commands of the generic code generator instead. INCOMPATIBILITY.
67 * Redundant attribute 'code_inline' has been discontinued. Use
68 'code_unfold' instead. INCOMPATIBILITY.
70 * Dropped attribute 'code_unfold_post' in favor of the its dual
71 'code_abbrev', which yields a common pattern in definitions like
73 definition [code_abbrev]: "f = t"
77 * Sort constraints are now propagated in simultaneous statements, just
78 like type constraints. INCOMPATIBILITY in rare situations, where
79 distinct sorts used to be assigned accidentally. For example:
81 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
83 lemma "P (x::'a)" and "Q (y::'a::bar)"
84 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
89 * Type 'a set is now a proper type constructor (just as before
90 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
91 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
92 sets separate, it is often sufficient to rephrase sets S accidentally
93 used as predicates by "%x. x : S" and predicates P accidentally used
94 as sets by "{x. P x}". Corresponding proofs in a first step should be
95 pruned from any tinkering with former theorems mem_def and
96 Collect_def as far as possible.
97 For developments which deliberately mixed predicates and
98 sets, a planning step is necessary to determine what should become a
99 predicate and what a set. It can be helpful to carry out that step in
100 Isabelle2011-1 before jumping right into the current release.
102 * Code generation by default implements sets as container type rather
103 than predicates. INCOMPATIBILITY.
105 * New type synonym 'a rel = ('a * 'a) set
107 * More default pred/set conversions on a couple of relation operations
108 and predicates. Consolidation of some relation theorems:
110 converse_def ~> converse_unfold
111 rel_comp_def ~> rel_comp_unfold
112 symp_def ~> (dropped, use symp_def and sym_def instead)
113 transp_def ~> transp_trans
114 Domain_def ~> Domain_unfold
115 Range_def ~> Domain_converse [symmetric]
119 * Consolidated various theorem names relating to Finite_Set.fold
122 inf_INFI_fold_inf ~> inf_INF_fold_inf
123 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
124 INFI_fold_inf ~> INF_fold_inf
125 SUPR_fold_sup ~> SUP_fold_sup
126 union_set ~> union_set_fold
127 minus_set ~> minus_set_fold
131 * Consolidated theorem names concerning fold combinators:
133 INFI_set_fold ~> INF_set_fold
134 SUPR_set_fold ~> SUP_set_fold
135 INF_code ~> INF_set_foldr
136 SUP_code ~> SUP_set_foldr
137 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
138 foldl.simps ~> foldl_Nil foldl_Cons
139 foldr_fold_rev ~> foldr_def
140 foldl_fold ~> foldl_def
144 * Dropped rarely useful theorems concerning fold combinators:
145 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
146 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
147 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
148 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
149 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
150 Prefer "List.fold" with canonical argument order, or boil down
151 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
152 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
153 and "List.foldl plus 0", prefer "List.listsum".
155 * Congruence rules Option.map_cong and Option.bind_cong for recursion
156 through option types.
158 * Concrete syntax for case expressions includes constraints for source
159 positions, and thus produces Prover IDE markup for its bindings.
160 INCOMPATIBILITY for old-style syntax translations that augment the
161 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
164 * Discontinued configuration option "syntax_positions": atomic terms
165 in parse trees are always annotated by position constraints.
167 * Finite_Set.fold now qualified. INCOMPATIBILITY.
169 * Renamed some facts on canonical fold on lists, in order to avoid
170 problems with interpretation involving corresponding facts on foldl
171 with the same base names:
173 fold_set_remdups ~> fold_set_fold_remdups
174 fold_set ~> fold_set_fold
175 fold1_set ~> fold1_set_fold
179 * Renamed facts about the power operation on relations, i.e., relpow
180 to match the constant's name:
182 rel_pow_1 ~> relpow_1
183 rel_pow_0_I ~> relpow_0_I
184 rel_pow_Suc_I ~> relpow_Suc_I
185 rel_pow_Suc_I2 ~> relpow_Suc_I2
186 rel_pow_0_E ~> relpow_0_E
187 rel_pow_Suc_E ~> relpow_Suc_E
188 rel_pow_E ~> relpow_E
189 rel_pow_Suc_D2 ~> relpow_Suc_D2
190 rel_pow_Suc_E2 ~> relpow_Suc_E2
191 rel_pow_Suc_D2' ~> relpow_Suc_D2'
192 rel_pow_E2 ~> relpow_E2
193 rel_pow_add ~> relpow_add
194 rel_pow_commute ~> relpow
195 rel_pow_empty ~> relpow_empty:
196 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
197 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
198 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
199 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
200 rel_pow_fun_conv ~> relpow_fun_conv
201 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
202 rel_pow_finite_bounded ~> relpow_finite_bounded
203 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
204 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
205 single_valued_rel_pow ~> single_valued_relpow
209 * New theory HOL/Library/DAList provides an abstract type for association
210 lists with distinct keys.
212 * 'datatype' specifications allow explicit sort constraints.
214 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
215 use theory HOL/Library/Nat_Bijection instead.
217 * Session HOL-Word: Discontinued many redundant theorems specific to
218 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
221 word_sub_alt ~> word_sub_wi
222 word_add_alt ~> word_add_def
223 word_mult_alt ~> word_mult_def
224 word_minus_alt ~> word_minus_def
225 word_0_alt ~> word_0_wi
226 word_1_alt ~> word_1_wi
227 word_add_0 ~> add_0_left
228 word_add_0_right ~> add_0_right
229 word_mult_1 ~> mult_1_left
230 word_mult_1_right ~> mult_1_right
231 word_add_commute ~> add_commute
232 word_add_assoc ~> add_assoc
233 word_add_left_commute ~> add_left_commute
234 word_mult_commute ~> mult_commute
235 word_mult_assoc ~> mult_assoc
236 word_mult_left_commute ~> mult_left_commute
237 word_left_distrib ~> left_distrib
238 word_right_distrib ~> right_distrib
239 word_left_minus ~> left_minus
240 word_diff_0_right ~> diff_0_right
241 word_diff_self ~> diff_self
242 word_sub_def ~> diff_minus
243 word_diff_minus ~> diff_minus
244 word_add_ac ~> add_ac
245 word_mult_ac ~> mult_ac
246 word_plus_ac0 ~> add_0_left add_0_right add_ac
247 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
248 word_order_trans ~> order_trans
249 word_order_refl ~> order_refl
250 word_order_antisym ~> order_antisym
251 word_order_linear ~> linorder_linear
252 lenw1_zero_neq_one ~> zero_neq_one
253 word_number_of_eq ~> number_of_eq
254 word_of_int_add_hom ~> wi_hom_add
255 word_of_int_sub_hom ~> wi_hom_sub
256 word_of_int_mult_hom ~> wi_hom_mult
257 word_of_int_minus_hom ~> wi_hom_neg
258 word_of_int_succ_hom ~> wi_hom_succ
259 word_of_int_pred_hom ~> wi_hom_pred
260 word_of_int_0_hom ~> word_0_wi
261 word_of_int_1_hom ~> word_1_wi
263 * Clarified attribute "mono_set": pure declaration without modifying
264 the result of the fact expression.
266 * "Transitive_Closure.ntrancl": bounded transitive closure on
269 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
271 * "sublists" moved to theory More_List. INCOMPATIBILITY.
273 * Theory Int: Discontinued many legacy theorems specific to type int.
274 INCOMPATIBILITY, use the corresponding generic theorems instead.
276 zminus_zminus ~> minus_minus
277 zminus_0 ~> minus_zero
278 zminus_zadd_distrib ~> minus_add_distrib
279 zadd_commute ~> add_commute
280 zadd_assoc ~> add_assoc
281 zadd_left_commute ~> add_left_commute
285 zadd_0_right ~> add_0_right
286 zadd_zminus_inverse2 ~> left_minus
287 zmult_zminus ~> mult_minus_left
288 zmult_commute ~> mult_commute
289 zmult_assoc ~> mult_assoc
290 zadd_zmult_distrib ~> left_distrib
291 zadd_zmult_distrib2 ~> right_distrib
292 zdiff_zmult_distrib ~> left_diff_distrib
293 zdiff_zmult_distrib2 ~> right_diff_distrib
294 zmult_1 ~> mult_1_left
295 zmult_1_right ~> mult_1_right
296 zle_refl ~> order_refl
297 zle_trans ~> order_trans
298 zle_antisym ~> order_antisym
299 zle_linear ~> linorder_linear
300 zless_linear ~> linorder_less_linear
301 zadd_left_mono ~> add_left_mono
302 zadd_strict_right_mono ~> add_strict_right_mono
303 zadd_zless_mono ~> add_less_le_mono
304 int_0_less_1 ~> zero_less_one
305 int_0_neq_1 ~> zero_neq_one
307 zpower_zadd_distrib ~> power_add
308 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
309 zero_le_zpower_abs ~> zero_le_power_abs
311 * Theory Deriv: Renamed
313 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
315 * New "case_product" attribute to generate a case rule doing multiple
316 case distinctions at the same time. E.g.
318 list.exhaust [case_product nat.exhaust]
320 produces a rule which can be used to perform case distinction on both
323 * Improved code generation of multisets.
325 * New diagnostic command find_unused_assms to find potentially superfluous
326 assumptions in theorems using Quickcheck.
329 - Quickcheck returns variable assignments as counterexamples, which
330 allows to reveal the underspecification of functions under test.
331 For example, refuting "hd xs = x", it presents the variable
332 assignment xs = [] and x = a1 as a counterexample, assuming that
333 any property is false whenever "hd []" occurs in it.
334 These counterexample are marked as potentially spurious, as
335 Quickcheck also returns "xs = []" as a counterexample to the
336 obvious theorem "hd xs = hd xs".
337 After finding a potentially spurious counterexample, Quickcheck
338 continues searching for genuine ones.
339 By default, Quickcheck shows potentially spurious and genuine
340 counterexamples. The option "genuine_only" sets quickcheck to
341 only show genuine counterexamples.
343 - The command 'quickcheck_generator' creates random and exhaustive
344 value generators for a given type and operations.
345 It generates values by using the operations as if they were
346 constructors of that type.
348 - Support for multisets.
350 - Added "use_subtype" options.
353 - Fixed infinite loop caused by the 'peephole_optim' option and
354 affecting 'rat' and 'real'.
357 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
358 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
359 - Renamed "sound" option to "strict".
362 - Added possibility to specify lambda translations scheme as a
363 parenthesized argument (e.g., "by (metis (lifting) ...)").
366 - Renamed from 'try_methods'. INCOMPATIBILITY.
368 * New "eventually_elim" method as a generalized variant of the
369 eventually_elim* rules. Supports structured proofs.
374 * New "case_product" attribute (see HOL).
379 * Antiquotation @{keyword "name"} produces a parser for outer syntax
380 from a minor keyword introduced via theory header declaration.
382 * Local_Theory.define no longer hard-wires default theorem name
383 "foo_def": definitional packages need to make this explicit, and may
384 choose to omit theorem bindings for definitions by using
385 Binding.empty/Attrib.empty_binding. Potential INCOMPATIBILITY for
386 derived definitional packages.
388 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
389 conformance with similar operations in structure Term and Logic.
391 * Antiquotation @{attributes [...]} embeds attribute source
392 representation into the ML text, which is particularly useful with
393 declarations like Local_Theory.note.
395 * Structure Proof_Context follows standard naming scheme. Old
396 ProofContext has been discontinued. INCOMPATIBILITY.
398 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
399 change of semantics: update is applied to auxiliary local theory
402 * Modernized some old-style infix operations:
404 addeqcongs ~> Simplifier.add_eqcong
405 deleqcongs ~> Simplifier.del_eqcong
406 addcongs ~> Simplifier.add_cong
407 delcongs ~> Simplifier.del_cong
408 setmksimps ~> Simplifier.set_mksimps
409 setmkcong ~> Simplifier.set_mkcong
410 setmksym ~> Simplifier.set_mksym
411 setmkeqTrue ~> Simplifier.set_mkeqTrue
412 settermless ~> Simplifier.set_termless
413 setsubgoaler ~> Simplifier.set_subgoaler
414 addsplits ~> Splitter.add_split
415 delsplits ~> Splitter.del_split
419 New in Isabelle2011-1 (October 2011)
420 ------------------------------------
424 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
425 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
427 - Management of multiple theory files directly from the editor
428 buffer store -- bypassing the file-system (no requirement to save
431 - Markup of formal entities within the text buffer, with semantic
432 highlighting, tooltips and hyperlinks to jump to defining source
435 - Improved text rendering, with sub/superscripts in the source
436 buffer (including support for copy/paste wrt. output panel, HTML
437 theory output and other non-Isabelle text boxes).
439 - Refined scheduling of proof checking and printing of results,
440 based on interactive editor view. (Note: jEdit folding and
441 narrowing allows to restrict buffer perspectives explicitly.)
443 - Reduced CPU performance requirements, usable on machines with few
446 - Reduced memory requirements due to pruning of unused document
447 versions (garbage collection).
449 See also ~~/src/Tools/jEdit/README.html for further information,
450 including some remaining limitations.
452 * Theory loader: source files are exclusively located via the master
453 directory of each theory node (where the .thy file itself resides).
454 The global load path (such as src/HOL/Library) has been discontinued.
455 Note that the path element ~~ may be used to reference theories in the
456 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
459 * Theory loader: source files are identified by content via SHA1
460 digests. Discontinued former path/modtime identification and optional
461 ISABELLE_FILE_IDENT plugin scripts.
463 * Parallelization of nested Isar proofs is subject to
464 Goal.parallel_proofs_threshold (default 100). See also isabelle
467 * Name space: former unsynchronized references are now proper
468 configuration options, with more conventional names:
470 long_names ~> names_long
471 short_names ~> names_short
472 unique_names ~> names_unique
474 Minor INCOMPATIBILITY, need to declare options in context like this:
476 declare [[names_unique = false]]
478 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
479 that the result needs to be unique, which means fact specifications
480 may have to be refined after enriching a proof context.
482 * Attribute "case_names" has been refined: the assumptions in each case
483 can be named now by following the case name with [name1 name2 ...].
485 * Isabelle/Isar reference manual has been updated and extended:
486 - "Synopsis" provides a catalog of main Isar language concepts.
487 - Formal references in syntax diagrams, via @{rail} antiquotation.
488 - Updated material from classic "ref" manual, notably about
489 "Classical Reasoner".
494 * Class bot and top require underlying partial order rather than
495 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
497 * Class complete_lattice: generalized a couple of lemmas from sets;
498 generalized theorems INF_cong and SUP_cong. New type classes for
499 complete boolean algebras and complete linear orders. Lemmas
500 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
501 class complete_linorder.
503 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
504 Sup_fun_def, Inf_apply, Sup_apply.
506 Removed redundant lemmas (the right hand side gives hints how to
507 replace them for (metis ...), or (simp only: ...) proofs):
509 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
510 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
511 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
512 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
513 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
514 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
515 Inter_def ~> INF_def, image_def
516 Union_def ~> SUP_def, image_def
517 INT_eq ~> INF_def, and image_def
518 UN_eq ~> SUP_def, and image_def
519 INF_subset ~> INF_superset_mono [OF _ order_refl]
521 More consistent and comprehensive names:
523 INTER_eq_Inter_image ~> INF_def
524 UNION_eq_Union_image ~> SUP_def
528 INF_leI2 ~> INF_lower2
529 le_INFI ~> INF_greatest
531 le_SUPI2 ~> SUP_upper2
533 INFI_bool_eq ~> INF_bool_eq
534 SUPR_bool_eq ~> SUP_bool_eq
535 INFI_apply ~> INF_apply
536 SUPR_apply ~> SUP_apply
537 INTER_def ~> INTER_eq
538 UNION_def ~> UNION_eq
542 * Renamed theory Complete_Lattice to Complete_Lattices.
545 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
546 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
547 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
548 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
550 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
551 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
552 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
555 * Added syntactic classes "inf" and "sup" for the respective
556 constants. INCOMPATIBILITY: Changes in the argument order of the
557 (mostly internal) locale predicates for some derived classes.
559 * Theorem collections ball_simps and bex_simps do not contain theorems
560 referring to UNION any longer; these have been moved to collection
561 UN_ball_bex_simps. INCOMPATIBILITY.
563 * Theory Archimedean_Field: floor now is defined as parameter of a
564 separate type class floor_ceiling.
566 * Theory Finite_Set: more coherent development of fold_set locales:
568 locale fun_left_comm ~> locale comp_fun_commute
569 locale fun_left_comm_idem ~> locale comp_fun_idem
571 Both use point-free characterization; interpretation proofs may need
572 adjustment. INCOMPATIBILITY.
574 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
575 accordance with standard mathematical terminology. INCOMPATIBILITY.
577 * Theory Complex_Main: The locale interpretations for the
578 bounded_linear and bounded_bilinear locales have been removed, in
579 order to reduce the number of duplicate lemmas. Users must use the
580 original names for distributivity theorems, potential INCOMPATIBILITY.
582 divide.add ~> add_divide_distrib
583 divide.diff ~> diff_divide_distrib
584 divide.setsum ~> setsum_divide_distrib
585 mult.add_right ~> right_distrib
586 mult.diff_right ~> right_diff_distrib
587 mult_right.setsum ~> setsum_right_distrib
588 mult_left.diff ~> left_diff_distrib
590 * Theory Complex_Main: Several redundant theorems have been removed or
591 replaced by more general versions. INCOMPATIBILITY.
593 real_diff_def ~> minus_real_def
594 real_divide_def ~> divide_real_def
595 real_less_def ~> less_le
596 real_abs_def ~> abs_real_def
597 real_sgn_def ~> sgn_real_def
598 real_mult_commute ~> mult_commute
599 real_mult_assoc ~> mult_assoc
600 real_mult_1 ~> mult_1_left
601 real_add_mult_distrib ~> left_distrib
602 real_zero_not_eq_one ~> zero_neq_one
603 real_mult_inverse_left ~> left_inverse
604 INVERSE_ZERO ~> inverse_zero
605 real_le_refl ~> order_refl
606 real_le_antisym ~> order_antisym
607 real_le_trans ~> order_trans
608 real_le_linear ~> linear
609 real_le_eq_diff ~> le_iff_diff_le_0
610 real_add_left_mono ~> add_left_mono
611 real_mult_order ~> mult_pos_pos
612 real_mult_less_mono2 ~> mult_strict_left_mono
613 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
614 real_0_le_divide_iff ~> zero_le_divide_iff
615 realpow_two_disj ~> power2_eq_iff
616 real_squared_diff_one_factored ~> square_diff_one_factored
617 realpow_two_diff ~> square_diff_square_factored
618 reals_complete2 ~> complete_real
619 real_sum_squared_expand ~> power2_sum
620 exp_ln_eq ~> ln_unique
622 expi_zero ~> exp_zero
623 lemma_DERIV_subst ~> DERIV_cong
624 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
625 LIMSEQ_const ~> tendsto_const
626 LIMSEQ_norm ~> tendsto_norm
627 LIMSEQ_add ~> tendsto_add
628 LIMSEQ_minus ~> tendsto_minus
629 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
630 LIMSEQ_diff ~> tendsto_diff
631 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
632 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
633 LIMSEQ_mult ~> tendsto_mult
634 LIMSEQ_inverse ~> tendsto_inverse
635 LIMSEQ_divide ~> tendsto_divide
636 LIMSEQ_pow ~> tendsto_power
637 LIMSEQ_setsum ~> tendsto_setsum
638 LIMSEQ_setprod ~> tendsto_setprod
639 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
640 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
641 LIMSEQ_imp_rabs ~> tendsto_rabs
642 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
643 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
644 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
645 LIMSEQ_Complex ~> tendsto_Complex
646 LIM_ident ~> tendsto_ident_at
647 LIM_const ~> tendsto_const
648 LIM_add ~> tendsto_add
649 LIM_add_zero ~> tendsto_add_zero
650 LIM_minus ~> tendsto_minus
651 LIM_diff ~> tendsto_diff
652 LIM_norm ~> tendsto_norm
653 LIM_norm_zero ~> tendsto_norm_zero
654 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
655 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
656 LIM_rabs ~> tendsto_rabs
657 LIM_rabs_zero ~> tendsto_rabs_zero
658 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
659 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
660 LIM_compose ~> tendsto_compose
661 LIM_mult ~> tendsto_mult
662 LIM_scaleR ~> tendsto_scaleR
663 LIM_of_real ~> tendsto_of_real
664 LIM_power ~> tendsto_power
665 LIM_inverse ~> tendsto_inverse
666 LIM_sgn ~> tendsto_sgn
667 isCont_LIM_compose ~> isCont_tendsto_compose
668 bounded_linear.LIM ~> bounded_linear.tendsto
669 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
670 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
671 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
672 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
673 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
674 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
676 * Theory Complex_Main: The definition of infinite series was
677 generalized. Now it is defined on the type class {topological_space,
678 comm_monoid_add}. Hence it is useable also for extended real numbers.
680 * Theory Complex_Main: The complex exponential function "expi" is now
681 a type-constrained abbreviation for "exp :: complex => complex"; thus
682 several polymorphic lemmas about "exp" are now applicable to "expi".
686 - Theory Library/Code_Char_ord provides native ordering of
687 characters in the target language.
689 - Commands code_module and code_library are legacy, use export_code
692 - Method "evaluation" is legacy, use method "eval" instead.
694 - Legacy evaluator "SML" is deactivated by default. May be
695 reactivated by the following theory command:
697 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
699 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
701 * New proof method "induction" that gives induction hypotheses the
702 name "IH", thus distinguishing them from further hypotheses that come
703 from rule induction. The latter are still called "hyps". Method
704 "induction" is a thin wrapper around "induct" and follows the same
707 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
708 still available as a legacy feature for some time.
711 - Added "need" and "total_consts" options.
712 - Reintroduced "show_skolems" option by popular demand.
713 - Renamed attribute: nitpick_def ~> nitpick_unfold.
717 - Use quasi-sound (and efficient) translations by default.
718 - Added support for the following provers: E-ToFoF, LEO-II,
719 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
720 - Automatically preplay and minimize proofs before showing them if
721 this can be done within reasonable time.
722 - sledgehammer available_provers ~> sledgehammer supported_provers.
724 - Added "preplay_timeout", "slicing", "type_enc", "sound",
725 "max_mono_iters", and "max_new_mono_instances" options.
726 - Removed "explicit_apply" and "full_types" options as well as "Full
727 Types" Proof General menu item. INCOMPATIBILITY.
730 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
731 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
735 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
736 "elim:" options. INCOMPATIBILITY.
737 - Introduced 'try' that not only runs 'try_methods' but also
738 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
741 - Added "eval" option to evaluate terms for the found counterexample
742 (currently only supported by the default (exhaustive) tester).
743 - Added post-processing of terms to obtain readable counterexamples
744 (currently only supported by the default (exhaustive) tester).
745 - New counterexample generator quickcheck[narrowing] enables
746 narrowing-based testing. Requires the Glasgow Haskell compiler
747 with its installation location defined in the Isabelle settings
748 environment as ISABELLE_GHC.
749 - Removed quickcheck tester "SML" based on the SML code generator
750 (formly in HOL/Library).
752 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
753 use 'partial_function' instead.
755 * Theory Library/Extended_Reals replaces now the positive extended
756 reals found in probability theory. This file is extended by
757 Multivariate_Analysis/Extended_Real_Limits.
759 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
760 from where it must be imported explicitly if it is really required.
763 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
764 been moved here. INCOMPATIBILITY.
766 * Theory Library/Saturated provides type of numbers with saturated
769 * Theory Library/Product_Lattice defines a pointwise ordering for the
770 product type 'a * 'b, and provides instance proofs for various order
771 and lattice type classes.
773 * Theory Library/Countable now provides the "countable_datatype" proof
774 method for proving "countable" class instances for datatypes.
776 * Theory Library/Cset_Monad allows do notation for computable sets
777 (cset) via the generic monad ad-hoc overloading facility.
779 * Library: Theories of common data structures are split into theories
780 for implementation, an invariant-ensuring type, and connection to an
781 abstract type. INCOMPATIBILITY.
783 - RBT is split into RBT and RBT_Mapping.
784 - AssocList is split and renamed into AList and AList_Mapping.
785 - DList is split into DList_Impl, DList, and DList_Cset.
786 - Cset is split into Cset and List_Cset.
788 * Theory Library/Nat_Infinity has been renamed to
789 Library/Extended_Nat, with name changes of the following types and
792 type inat ~> type enat
794 Infty ~> infinity (overloaded)
798 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
799 been renamed accordingly. INCOMPATIBILITY.
801 * Session Multivariate_Analysis: The euclidean_space type class now
802 fixes a constant "Basis :: 'a set" consisting of the standard
803 orthonormal basis for the type. Users now have the option of
804 quantifying over this set instead of using the "basis" function, e.g.
805 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
807 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
808 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
809 "Cart_nth" and "Cart_lambda" have been respectively renamed to
810 "vec_nth" and "vec_lambda"; theorems mentioning those names have
811 changed to match. Definition theorems for overloaded constants now use
812 the standard "foo_vec_def" naming scheme. A few other theorems have
813 been renamed as follows (INCOMPATIBILITY):
815 Cart_eq ~> vec_eq_iff
816 dist_nth_le_cart ~> dist_vec_nth_le
817 tendsto_vector ~> vec_tendstoI
818 Cauchy_vector ~> vec_CauchyI
820 * Session Multivariate_Analysis: Several duplicate theorems have been
821 removed, and other theorems have been renamed or replaced with more
822 general versions. INCOMPATIBILITY.
824 finite_choice ~> finite_set_choice
825 eventually_conjI ~> eventually_conj
826 eventually_and ~> eventually_conj_iff
827 eventually_false ~> eventually_False
828 setsum_norm ~> norm_setsum
829 Lim_sequentially ~> LIMSEQ_def
830 Lim_ident_at ~> LIM_ident
831 Lim_const ~> tendsto_const
832 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
833 Lim_neg ~> tendsto_minus
834 Lim_add ~> tendsto_add
835 Lim_sub ~> tendsto_diff
836 Lim_mul ~> tendsto_scaleR
837 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
838 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
839 Lim_linear ~> bounded_linear.tendsto
840 Lim_component ~> tendsto_euclidean_component
841 Lim_component_cart ~> tendsto_vec_nth
842 Lim_inner ~> tendsto_inner [OF tendsto_const]
843 dot_lsum ~> inner_setsum_left
844 dot_rsum ~> inner_setsum_right
845 continuous_cmul ~> continuous_scaleR [OF continuous_const]
846 continuous_neg ~> continuous_minus
847 continuous_sub ~> continuous_diff
848 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
849 continuous_mul ~> continuous_scaleR
850 continuous_inv ~> continuous_inverse
851 continuous_at_within_inv ~> continuous_at_within_inverse
852 continuous_at_inv ~> continuous_at_inverse
853 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
854 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
855 continuous_at_component ~> continuous_component [OF continuous_at_id]
856 continuous_on_neg ~> continuous_on_minus
857 continuous_on_sub ~> continuous_on_diff
858 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
859 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
860 continuous_on_mul ~> continuous_on_scaleR
861 continuous_on_mul_real ~> continuous_on_mult
862 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
863 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
864 continuous_on_inverse ~> continuous_on_inv
865 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
866 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
867 subset_interior ~> interior_mono
868 subset_closure ~> closure_mono
869 closure_univ ~> closure_UNIV
870 real_arch_lt ~> reals_Archimedean2
871 real_arch ~> reals_Archimedean3
872 real_abs_norm ~> abs_norm_cancel
873 real_abs_sub_norm ~> norm_triangle_ineq3
874 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
876 * Session HOL-Probability:
877 - Caratheodory's extension lemma is now proved for ring_of_sets.
878 - Infinite products of probability measures are now available.
879 - Sigma closure is independent, if the generator is independent
880 - Use extended reals instead of positive extended
881 reals. INCOMPATIBILITY.
883 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
885 expand_fun_below ~> fun_below_iff
886 below_fun_ext ~> fun_belowI
887 expand_cfun_eq ~> cfun_eq_iff
889 expand_cfun_below ~> cfun_below_iff
890 below_cfun_ext ~> cfun_belowI
891 monofun_fun_fun ~> fun_belowD
892 monofun_fun_arg ~> monofunE
893 monofun_lub_fun ~> adm_monofun [THEN admD]
894 cont_lub_fun ~> adm_cont [THEN admD]
895 cont2cont_Rep_CFun ~> cont2cont_APP
896 cont_Rep_CFun_app ~> cont_APP_app
897 cont_Rep_CFun_app_app ~> cont_APP_app_app
898 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
899 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
900 contlub_cfun ~> lub_APP [symmetric]
901 contlub_LAM ~> lub_LAM [symmetric]
904 lift_distinct1 ~> lift.distinct(1)
905 lift_distinct2 ~> lift.distinct(2)
906 Def_not_UU ~> lift.distinct(2)
907 Def_inject ~> lift.inject
908 below_UU_iff ~> below_bottom_iff
909 eq_UU_iff ~> eq_bottom_iff
912 *** Document preparation ***
914 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
915 isar-ref manual, both for description and actual application of the
918 * Antiquotation @{value} evaluates the given term and presents its
921 * Antiquotations: term style "isub" provides ad-hoc conversion of
922 variables x1, y23 into subscripted form x\<^isub>1,
925 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
926 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
928 * Localized \isabellestyle switch can be used within blocks or groups
931 \isabellestyle{it} %preferred default
932 {\isabellestylett @{text "typewriter stuff"}}
934 * Discontinued special treatment of hard tabulators. Implicit
935 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
941 * The inner syntax of sort/type/term/prop supports inlined YXML
942 representations within quoted string tokens. By encoding logical
943 entities via Term_XML (in ML or Scala) concrete syntax can be
944 bypassed, which is particularly useful for producing bits of text
945 under external program control.
947 * Antiquotations for ML and document preparation are managed as theory
948 data, which requires explicit setup.
950 * Isabelle_Process.is_active allows tools to check if the official
951 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
952 (better known as Proof General).
954 * Structure Proof_Context follows standard naming scheme. Old
955 ProofContext is still available for some time as legacy alias.
957 * Structure Timing provides various operations for timing; supersedes
958 former start_timing/end_timing etc.
960 * Path.print is the official way to show file-system paths to users
961 (including quotes etc.).
963 * Inner syntax: identifiers in parse trees of generic categories
964 "logic", "aprop", "idt" etc. carry position information (disguised as
965 type constraints). Occasional INCOMPATIBILITY with non-compliant
966 translations that choke on unexpected type constraints. Positions can
967 be stripped in ML translations via Syntax.strip_positions /
968 Syntax.strip_positions_ast, or via the syntax constant
969 "_strip_positions" within parse trees. As last resort, positions can
970 be disabled via the configuration option Syntax.positions, which is
971 called "syntax_positions" in Isar attribute syntax.
973 * Discontinued special status of various ML structures that contribute
974 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
975 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
976 refer directly to Ast.Constant, Lexicon.is_identifier,
977 Syntax_Trans.mk_binder_tr etc.
979 * Typed print translation: discontinued show_sorts argument, which is
980 already available via context of "advanced" translation.
982 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
983 goal states; body tactic needs to address all subgoals uniformly.
985 * Slightly more special eq_list/eq_set, with shortcut involving
986 pointer equality (assumes that eq relation is reflexive).
988 * Classical tactics use proper Proof.context instead of historic types
989 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
990 operate directly on Proof.context. Raw type claset retains its use as
991 snapshot of the classical context, which can be recovered via
992 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
993 INCOMPATIBILITY, classical tactics and derived proof methods require
994 proper Proof.context.
999 * Discontinued support for Poly/ML 5.2, which was the last version
1000 without proper multithreading and TimeLimit implementation.
1002 * Discontinued old lib/scripts/polyml-platform, which has been
1003 obsolete since Isabelle2009-2.
1005 * Various optional external tools are referenced more robustly and
1006 uniformly by explicit Isabelle settings as follows:
1008 ISABELLE_CSDP (formerly CSDP_EXE)
1009 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1010 ISABELLE_OCAML (formerly EXEC_OCAML)
1011 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1012 ISABELLE_YAP (formerly EXEC_YAP)
1014 Note that automated detection from the file-system or search path has
1015 been discontinued. INCOMPATIBILITY.
1017 * Scala layer provides JVM method invocation service for static
1018 methods of type (String)String, see Invoke_Scala.method in ML. For
1021 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1023 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1024 this allows to pass structured values between ML and Scala.
1026 * The IsabelleText fonts includes some further glyphs to support the
1027 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1028 installed a local copy (which is normally *not* required) need to
1029 delete or update it from ~~/lib/fonts/.
1033 New in Isabelle2011 (January 2011)
1034 ----------------------------------
1038 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1039 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1040 useful tooltips and hyperlinks produced from its static analysis. The
1041 bundled component provides an executable Isabelle tool that can be run
1044 Isabelle2011/bin/isabelle jedit
1046 * Significantly improved Isabelle/Isar implementation manual.
1048 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1049 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1050 while the default heap location within that directory lacks that extra
1051 suffix. This isolates multiple Isabelle installations from each
1052 other, avoiding problems with old settings in new versions.
1053 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1055 * Source files are always encoded as UTF-8, instead of old-fashioned
1056 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1057 the following package declarations:
1059 \usepackage[utf8]{inputenc}
1060 \usepackage{textcomp}
1062 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1063 a Unicode character is treated as a single symbol, not a sequence of
1064 non-ASCII bytes as before. Since Isabelle/ML string literals may
1065 contain symbols without further backslash escapes, Unicode can now be
1066 used here as well. Recall that Symbol.explode in ML provides a
1067 consistent view on symbols, while raw explode (or String.explode)
1068 merely give a byte-oriented representation.
1070 * Theory loader: source files are primarily located via the master
1071 directory of each theory node (where the .thy file itself resides).
1072 The global load path is still partially available as legacy feature.
1073 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1074 explicit paths, relatively to the theory.
1076 * Special treatment of ML file names has been discontinued.
1077 Historically, optional extensions .ML or .sml were added on demand --
1078 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1079 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1081 * Various options that affect pretty printing etc. are now properly
1082 handled within the context via configuration options, instead of
1083 unsynchronized references or print modes. There are both ML Config.T
1084 entities and Isar declaration attributes to access these.
1086 ML (Config.T) Isar (attribute)
1088 eta_contract eta_contract
1089 show_brackets show_brackets
1090 show_sorts show_sorts
1091 show_types show_types
1092 show_question_marks show_question_marks
1093 show_consts show_consts
1094 show_abbrevs show_abbrevs
1096 Syntax.ast_trace syntax_ast_trace
1097 Syntax.ast_stat syntax_ast_stat
1098 Syntax.ambiguity_level syntax_ambiguity_level
1100 Goal_Display.goals_limit goals_limit
1101 Goal_Display.show_main_goal show_main_goal
1103 Method.rule_trace rule_trace
1105 Thy_Output.display thy_output_display
1106 Thy_Output.quotes thy_output_quotes
1107 Thy_Output.indent thy_output_indent
1108 Thy_Output.source thy_output_source
1109 Thy_Output.break thy_output_break
1111 Note that corresponding "..._default" references in ML may only be
1112 changed globally at the ROOT session setup, but *not* within a theory.
1113 The option "show_abbrevs" supersedes the former print mode
1114 "no_abbrevs" with inverted meaning.
1116 * More systematic naming of some configuration options.
1119 trace_simp ~> simp_trace
1120 debug_simp ~> simp_debug
1122 * Support for real valued configuration options, using simplistic
1123 floating-point notation that coincides with the inner syntax for
1126 * Support for real valued preferences (with approximative PGIP type):
1127 front-ends need to accept "pgint" values in float notation.
1130 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1133 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1138 * Command 'type_synonym' (with single argument) replaces somewhat
1139 outdated 'types', which is still available as legacy feature for some
1142 * Command 'nonterminal' (with 'and' separated list of arguments)
1143 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1145 * Command 'notepad' replaces former 'example_proof' for
1146 experimentation in Isar without any result. INCOMPATIBILITY.
1148 * Locale interpretation commands 'interpret' and 'sublocale' accept
1149 lists of equations to map definitions in a locale to appropriate
1150 entities in the context of the interpretation. The 'interpretation'
1151 command already provided this functionality.
1153 * Diagnostic command 'print_dependencies' prints the locale instances
1154 that would be activated if the specified expression was interpreted in
1155 the current context. Variant "print_dependencies!" assumes a context
1156 without interpretations.
1158 * Diagnostic command 'print_interps' prints interpretations in proofs
1159 in addition to interpretations in theories.
1161 * Discontinued obsolete 'global' and 'local' commands to manipulate
1162 the theory name space. Rare INCOMPATIBILITY. The ML functions
1163 Sign.root_path and Sign.local_path may be applied directly where this
1164 feature is still required for historical reasons.
1166 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1167 'definition' instead.
1169 * The "prems" fact, which refers to the accidental collection of
1170 foundational premises in the context, is now explicitly marked as
1171 legacy feature and will be discontinued soon. Consider using "assms"
1172 of the head statement or reference facts by explicit names.
1174 * Document antiquotations @{class} and @{type} print classes and type
1177 * Document antiquotation @{file} checks file/directory entries within
1178 the local file system.
1183 * Coercive subtyping: functions can be declared as coercions and type
1184 inference will add them as necessary upon input of a term. Theory
1185 Complex_Main declares real :: nat => real and real :: int => real as
1186 coercions. A coercion function f is declared like this:
1188 declare [[coercion f]]
1190 To lift coercions through type constructors (e.g. from nat => real to
1191 nat list => real list), map functions can be declared, e.g.
1193 declare [[coercion_map map]]
1195 Currently coercion inference is activated only in theories including
1196 real numbers, i.e. descendants of Complex_Main. This is controlled by
1197 the configuration option "coercion_enabled", e.g. it can be enabled in
1198 other theories like this:
1200 declare [[coercion_enabled]]
1202 * Command 'partial_function' provides basic support for recursive
1203 function definitions over complete partial orders. Concrete instances
1204 are provided for i) the option type, ii) tail recursion on arbitrary
1205 types, and iii) the heap monad of Imperative_HOL. See
1206 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1209 * Function package: f.psimps rules are no longer implicitly declared
1210 as [simp]. INCOMPATIBILITY.
1212 * Datatype package: theorems generated for executable equality (class
1213 "eq") carry proper names and are treated as default code equations.
1215 * Inductive package: now offers command 'inductive_simps' to
1216 automatically derive instantiated and simplified equations for
1217 inductive predicates, similar to 'inductive_cases'.
1219 * Command 'enriched_type' allows to register properties of the
1220 functorial structure of types.
1222 * Improved infrastructure for term evaluation using code generator
1223 techniques, in particular static evaluation conversions.
1225 * Code generator: Scala (2.8 or higher) has been added to the target
1228 * Code generator: globbing constant expressions "*" and "Theory.*"
1229 have been replaced by the more idiomatic "_" and "Theory._".
1232 * Code generator: export_code without explicit file declaration prints
1233 to standard output. INCOMPATIBILITY.
1235 * Code generator: do not print function definitions for case
1236 combinators any longer.
1238 * Code generator: simplification with rules determined with
1239 src/Tools/Code/code_simp.ML and method "code_simp".
1241 * Code generator for records: more idiomatic representation of record
1242 types. Warning: records are not covered by ancient SML code
1243 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1244 rep_datatype declaration helps to succeed then:
1248 rep_datatype foo_ext ...
1250 * Records: logical foundation type for records does not carry a
1251 '_type' suffix any longer (obsolete due to authentic syntax).
1254 * Quickcheck now by default uses exhaustive testing instead of random
1255 testing. Random testing can be invoked by "quickcheck [random]",
1256 exhaustive testing by "quickcheck [exhaustive]".
1258 * Quickcheck instantiates polymorphic types with small finite
1259 datatypes by default. This enables a simple execution mechanism to
1260 handle quantifiers and function equality over the finite datatypes.
1262 * Quickcheck random generator has been renamed from "code" to
1263 "random". INCOMPATIBILITY.
1265 * Quickcheck now has a configurable time limit which is set to 30
1266 seconds by default. This can be changed by adding [timeout = n] to the
1267 quickcheck command. The time limit for Auto Quickcheck is still set
1270 * Quickcheck in locales considers interpretations of that locale for
1271 counter example search.
1274 - Added "smt" and "remote_smt" provers based on the "smt" proof
1275 method. See the Sledgehammer manual for details ("isabelle doc
1278 sledgehammer atp_info ~> sledgehammer running_provers
1279 sledgehammer atp_kill ~> sledgehammer kill_provers
1280 sledgehammer available_atps ~> sledgehammer available_provers
1283 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1284 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1285 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1286 (and "ms" and "min" are no longer supported)
1291 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1292 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1294 - Added support for partial quotient types.
1295 - Added local versions of the "Nitpick.register_xxx" functions.
1296 - Added "whack" option.
1297 - Allow registration of quotient types as codatatypes.
1298 - Improved "merge_type_vars" option to merge more types.
1299 - Removed unsound "fast_descrs" option.
1300 - Added custom symmetry breaking for datatypes, making it possible to reach
1301 higher cardinalities.
1302 - Prevent the expansion of too large definitions.
1304 * Proof methods "metis" and "meson" now have configuration options
1305 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1306 to diagnose these tools. E.g.
1308 using [[metis_trace = true]]
1310 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1311 manually as command 'solve_direct'.
1313 * The default SMT solver Z3 must be enabled explicitly (due to
1314 licensing issues) by setting the environment variable
1315 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1316 commercial applications, the SMT solver CVC3 is provided as fall-back;
1317 changing the SMT solver is done via the configuration option
1320 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1321 i.e. "remote_cvc3" and "remote_z3".
1323 * Added basic SMT support for datatypes, records, and typedefs using
1324 the oracle mode (no proofs). Direct support of pairs has been dropped
1325 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1326 support for a similar behavior). Minor INCOMPATIBILITY.
1328 * Changed SMT configuration options:
1330 z3_proofs ~> smt_oracle (with inverted meaning)
1331 z3_trace_assms ~> smt_trace_used_facts
1344 * Boogie output files (.b2i files) need to be declared in the theory
1347 * Simplification procedure "list_to_set_comprehension" rewrites list
1348 comprehensions applied to List.set to set comprehensions. Occasional
1349 INCOMPATIBILITY, may be deactivated like this:
1351 declare [[simproc del: list_to_set_comprehension]]
1353 * Removed old version of primrec package. INCOMPATIBILITY.
1355 * Removed simplifier congruence rule of "prod_case", as has for long
1356 been the case with "split". INCOMPATIBILITY.
1358 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1360 * Removed [split_format ... and ... and ...] version of
1361 [split_format]. Potential INCOMPATIBILITY.
1363 * Predicate "sorted" now defined inductively, with nice induction
1364 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1366 * Constant "contents" renamed to "the_elem", to free the generic name
1367 contents for other uses. INCOMPATIBILITY.
1369 * Renamed class eq and constant eq (for code generation) to class
1370 equal and constant equal, plus renaming of related facts and various
1371 tuning. INCOMPATIBILITY.
1373 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1375 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1378 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1379 avoid confusion with finite sets. INCOMPATIBILITY.
1381 * Abandoned locales equiv, congruent and congruent2 for equivalence
1382 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1385 * Some previously unqualified names have been qualified:
1392 Trueprop ~> HOL.Trueprop
1397 op --> ~> HOL.implies
1409 Pair ~> Product_Type.Pair
1410 fst ~> Product_Type.fst
1411 snd ~> Product_Type.snd
1412 curry ~> Product_Type.curry
1414 Collect ~> Set.Collect
1418 * More canonical naming convention for some fundamental definitions:
1420 bot_bool_eq ~> bot_bool_def
1421 top_bool_eq ~> top_bool_def
1422 inf_bool_eq ~> inf_bool_def
1423 sup_bool_eq ~> sup_bool_def
1424 bot_fun_eq ~> bot_fun_def
1425 top_fun_eq ~> top_fun_def
1426 inf_fun_eq ~> inf_fun_def
1427 sup_fun_eq ~> sup_fun_def
1431 * More stylized fact names:
1433 expand_fun_eq ~> fun_eq_iff
1434 expand_set_eq ~> set_eq_iff
1436 nat_number ~> eval_nat_numeral
1440 * Refactoring of code-generation specific operations in theory List:
1446 mem_iff ~> member_def
1447 null_empty ~> null_def
1449 INCOMPATIBILITY. Note that these were not supposed to be used
1450 regularly unless for striking reasons; their main purpose was code
1453 Various operations from the Haskell prelude are used for generating
1456 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1457 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1458 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1460 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1461 "*" and "+" respectively. INCOMPATIBILITY.
1463 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1464 "Sum_Type.Plus" instead.
1466 * Constant "split" has been merged with constant "prod_case"; names of
1467 ML functions, facts etc. involving split have been retained so far,
1468 though. INCOMPATIBILITY.
1470 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1471 instead. INCOMPATIBILITY.
1473 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1476 * Former theory Library/Enum is now part of the HOL-Main image.
1477 INCOMPATIBILITY: all constants of the Enum theory now have to be
1478 referred to by its qualified name.
1481 nlists ~> Enum.nlists
1482 product ~> Enum.product
1484 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1485 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1488 * Theory Library/SetsAndFunctions has been split into
1489 Library/Function_Algebras and Library/Set_Algebras; canonical names
1490 for instance definitions for functions; various improvements.
1493 * Theory Library/Multiset provides stable quicksort implementation of
1496 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1499 * Session Multivariate_Analysis: introduced a type class for euclidean
1500 space. Most theorems are now stated in terms of euclidean spaces
1501 instead of finite cartesian products.
1504 real ^ 'n ~> 'a::real_vector
1505 ~> 'a::euclidean_space
1506 ~> 'a::ordered_euclidean_space
1507 (depends on your needs)
1511 \<chi> x. _ ~> \<chi>\<chi> x. _
1514 Also note that the indices are now natural numbers and not from some
1515 finite type. Finite cartesian products of euclidean spaces, products
1516 of euclidean spaces the real and complex numbers are instantiated to
1517 be euclidean_spaces. INCOMPATIBILITY.
1519 * Session Probability: introduced pextreal as positive extended real
1520 numbers. Use pextreal as value for measures. Introduce the
1521 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1522 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1523 the integral in Multivariate Analysis. INCOMPATIBILITY.
1525 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1528 * Session SPARK (with image HOL-SPARK) provides commands to load and
1529 prove verification conditions generated by the SPARK Ada program
1530 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1535 * Theorems for additive ring operations (locale abelian_monoid and
1536 descendants) are generated by interpretation from their multiplicative
1537 counterparts. Names (in particular theorem names) have the mandatory
1538 qualifier 'add'. Previous theorem names are redeclared for
1541 * Structure "int_ring" is now an abbreviation (previously a
1542 definition). This fits more natural with advanced interpretations.
1547 * The domain package now runs in definitional mode by default: The
1548 former command 'new_domain' is now called 'domain'. To use the domain
1549 package in its original axiomatic mode, use 'domain (unsafe)'.
1552 * The new class "domain" is now the default sort. Class "predomain"
1553 is an unpointed version of "domain". Theories can be updated by
1554 replacing sort annotations as shown below. INCOMPATIBILITY.
1556 'a::type ~> 'a::countable
1557 'a::cpo ~> 'a::predomain
1558 'a::pcpo ~> 'a::domain
1560 * The old type class "rep" has been superseded by class "domain".
1561 Accordingly, users of the definitional package must remove any
1562 "default_sort rep" declarations. INCOMPATIBILITY.
1564 * The domain package (definitional mode) now supports unpointed
1565 predomain argument types, as long as they are marked 'lazy'. (Strict
1566 arguments must be in class "domain".) For example, the following
1567 domain definition now works:
1569 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1571 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1572 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1573 'a option, and 'a list. Additionally, it configures fixrec and the
1574 domain package to work with these types. For example:
1576 fixrec isInl :: "('a + 'b) u -> tr"
1577 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1579 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1581 * The "(permissive)" option of fixrec has been replaced with a
1582 per-equation "(unchecked)" option. See
1583 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1585 * The "bifinite" class no longer fixes a constant "approx"; the class
1586 now just asserts that such a function exists. INCOMPATIBILITY.
1588 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1589 defines an embedding of type 'a defl into udom by default; instances
1590 of "bifinite" and "domain" classes are available in
1591 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1593 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1595 * The predicate "directed" has been removed. INCOMPATIBILITY.
1597 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1599 * The function "cprod_map" has been renamed to "prod_map".
1602 * The monadic bind operator on each powerdomain has new binder syntax
1603 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1604 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1606 * The infix syntax for binary union on each powerdomain has changed
1607 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1608 syntax. INCOMPATIBILITY.
1610 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1611 still supported as an input translation.
1613 * Renamed some theorems (the original names are also still available).
1615 expand_fun_below ~> fun_below_iff
1616 below_fun_ext ~> fun_belowI
1617 expand_cfun_eq ~> cfun_eq_iff
1618 ext_cfun ~> cfun_eqI
1619 expand_cfun_below ~> cfun_below_iff
1620 below_cfun_ext ~> cfun_belowI
1621 cont2cont_Rep_CFun ~> cont2cont_APP
1623 * The Abs and Rep functions for various types have changed names.
1624 Related theorem names have also changed to match. INCOMPATIBILITY.
1626 Rep_CFun ~> Rep_cfun
1627 Abs_CFun ~> Abs_cfun
1628 Rep_Sprod ~> Rep_sprod
1629 Abs_Sprod ~> Abs_sprod
1630 Rep_Ssum ~> Rep_ssum
1631 Abs_Ssum ~> Abs_ssum
1633 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1634 been renamed to *_bottom_iff. INCOMPATIBILITY.
1636 * Various changes to bisimulation/coinduction with domain package:
1638 - Definitions of "bisim" constants no longer mention definedness.
1639 - With mutual recursion, "bisim" predicate is now curried.
1640 - With mutual recursion, each type gets a separate coind theorem.
1641 - Variable names in bisim_def and coinduct rules have changed.
1645 * Case combinators generated by the domain package for type "foo" are
1646 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1648 * Several theorems have been renamed to more accurately reflect the
1649 names of constants and types involved. INCOMPATIBILITY.
1651 thelub_const ~> lub_const
1652 lub_const ~> is_lub_const
1654 is_lub_lub ~> is_lubD2
1656 unique_lub ~> is_lub_unique
1657 is_ub_lub ~> is_lub_rangeD1
1658 lub_bin_chain ~> is_lub_bin_chain
1659 lub_fun ~> is_lub_fun
1660 thelub_fun ~> lub_fun
1661 thelub_cfun ~> lub_cfun
1662 thelub_Pair ~> lub_Pair
1663 lub_cprod ~> is_lub_prod
1664 thelub_cprod ~> lub_prod
1665 minimal_cprod ~> minimal_prod
1666 inst_cprod_pcpo ~> inst_prod_pcpo
1668 compact_UU ~> compact_bottom
1669 deflation_UU ~> deflation_bottom
1670 finite_deflation_UU ~> finite_deflation_bottom
1672 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1674 sq_ord_less_eq_trans ~> below_eq_trans
1675 sq_ord_eq_less_trans ~> eq_below_trans
1676 refl_less ~> below_refl
1677 trans_less ~> below_trans
1678 antisym_less ~> below_antisym
1679 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1680 box_less ~> box_below
1681 rev_trans_less ~> rev_below_trans
1682 not_less2not_eq ~> not_below2not_eq
1683 less_UU_iff ~> below_UU_iff
1684 flat_less_iff ~> flat_below_iff
1685 adm_less ~> adm_below
1686 adm_not_less ~> adm_not_below
1687 adm_compact_not_less ~> adm_compact_not_below
1688 less_fun_def ~> below_fun_def
1689 expand_fun_less ~> fun_below_iff
1690 less_fun_ext ~> fun_belowI
1691 less_discr_def ~> below_discr_def
1692 discr_less_eq ~> discr_below_eq
1693 less_unit_def ~> below_unit_def
1694 less_cprod_def ~> below_prod_def
1695 prod_lessI ~> prod_belowI
1696 Pair_less_iff ~> Pair_below_iff
1697 fst_less_iff ~> fst_below_iff
1698 snd_less_iff ~> snd_below_iff
1699 expand_cfun_less ~> cfun_below_iff
1700 less_cfun_ext ~> cfun_belowI
1701 injection_less ~> injection_below
1702 less_up_def ~> below_up_def
1703 not_Iup_less ~> not_Iup_below
1704 Iup_less ~> Iup_below
1706 Def_inject_less_eq ~> Def_below_Def
1707 Def_less_is_eq ~> Def_below_iff
1708 spair_less_iff ~> spair_below_iff
1709 less_sprod ~> below_sprod
1710 spair_less ~> spair_below
1711 sfst_less_iff ~> sfst_below_iff
1712 ssnd_less_iff ~> ssnd_below_iff
1713 fix_least_less ~> fix_least_below
1714 dist_less_one ~> dist_below_one
1715 less_ONE ~> below_ONE
1716 ONE_less_iff ~> ONE_below_iff
1717 less_sinlD ~> below_sinlD
1718 less_sinrD ~> below_sinrD
1723 * All constant names are now qualified internally and use proper
1724 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1728 * Greater support for structured proofs involving induction or case analysis.
1730 * Much greater use of special symbols.
1732 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1736 * Antiquotation @{assert} inlines a function bool -> unit that raises
1737 Fail if the argument is false. Due to inlining the source position of
1738 failed assertions is included in the error output.
1740 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1741 text is in practice always evaluated with a stable theory checkpoint.
1742 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1744 * Antiquotation @{theory A} refers to theory A from the ancestry of
1745 the current context, not any accidental theory loader state as before.
1746 Potential INCOMPATIBILITY, subtle change in semantics.
1748 * Syntax.pretty_priority (default 0) configures the required priority
1749 of pretty-printed output and thus affects insertion of parentheses.
1751 * Syntax.default_root (default "any") configures the inner syntax
1752 category (nonterminal symbol) for parsing of terms.
1754 * Former exception Library.UnequalLengths now coincides with
1755 ListPair.UnequalLengths.
1757 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1758 main functionality is provided by structure Simplifier.
1760 * Renamed raw "explode" function to "raw_explode" to emphasize its
1761 meaning. Note that internally to Isabelle, Symbol.explode is used in
1762 almost all situations.
1764 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1765 See implementation manual for further details on exceptions in
1768 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1771 * Renamed structure PureThy to Pure_Thy and moved most of its
1772 operations to structure Global_Theory, to emphasize that this is
1773 rarely-used global-only stuff.
1775 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1776 instead (or tracing for high-volume output).
1778 * Configuration option show_question_marks only affects regular pretty
1779 printing of types and terms, not raw Term.string_of_vname.
1781 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1782 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1783 @{thms} for most purposes.
1785 * ML structure Unsynchronized is never opened, not even in Isar
1786 interaction mode as before. Old Unsynchronized.set etc. have been
1787 discontinued -- use plain := instead. This should be *rare* anyway,
1788 since modern tools always work via official context data, notably
1789 configuration options.
1791 * Parallel and asynchronous execution requires special care concerning
1792 interrupts. Structure Exn provides some convenience functions that
1793 avoid working directly with raw Interrupt. User code must not absorb
1794 interrupts -- intermediate handling (for cleanup etc.) needs to be
1795 followed by re-raising of the original exception. Another common
1796 source of mistakes are "handle _" patterns, which make the meaning of
1797 the program subject to physical effects of the environment.
1801 New in Isabelle2009-2 (June 2010)
1802 ---------------------------------
1806 * Authentic syntax for *all* logical entities (type classes, type
1807 constructors, term constants): provides simple and robust
1808 correspondence between formal entities and concrete syntax. Within
1809 the parse tree / AST representations, "constants" are decorated by
1810 their category (class, type, const) and spelled out explicitly with
1811 their full internal name.
1813 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1814 and translations (translation rules and translation functions in ML).
1815 Some hints on upgrading:
1817 - Many existing uses of 'syntax' and 'translations' can be replaced
1818 by more modern 'type_notation', 'notation' and 'abbreviation',
1819 which are independent of this issue.
1821 - 'translations' require markup within the AST; the term syntax
1822 provides the following special forms:
1824 CONST c -- produces syntax version of constant c from context
1825 XCONST c -- literally c, checked as constant from context
1826 c -- literally c, if declared by 'syntax'
1828 Plain identifiers are treated as AST variables -- occasionally the
1829 system indicates accidental variables via the error "rhs contains
1832 Type classes and type constructors are marked according to their
1833 concrete syntax. Some old translations rules need to be written
1834 for the "type" category, using type constructor application
1835 instead of pseudo-term application of the default category
1838 - 'parse_translation' etc. in ML may use the following
1841 @{class_syntax c} -- type class c within parse tree / AST
1842 @{term_syntax c} -- type constructor c within parse tree / AST
1843 @{const_syntax c} -- ML version of "CONST c" above
1844 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1846 - Literal types within 'typed_print_translations', i.e. those *not*
1847 represented as pseudo-terms are represented verbatim. Use @{class
1848 c} or @{type_name c} here instead of the above syntax
1851 Note that old non-authentic syntax was based on unqualified base
1852 names, so all of the above "constant" names would coincide. Recall
1853 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1854 diagnose syntax problems.
1856 * Type constructors admit general mixfix syntax, not just infix.
1858 * Concrete syntax may be attached to local entities without a proof
1859 body, too. This works via regular mixfix annotations for 'fix',
1860 'def', 'obtain' etc. or via the explicit 'write' command, which is
1861 similar to the 'notation' command in theory specifications.
1863 * Discontinued unnamed infix syntax (legacy feature for many years) --
1864 need to specify constant name and syntax separately. Internal ML
1865 datatype constructors have been renamed from InfixName to Infix etc.
1866 Minor INCOMPATIBILITY.
1868 * Schematic theorem statements need to be explicitly markup as such,
1869 via commands 'schematic_lemma', 'schematic_theorem',
1870 'schematic_corollary'. Thus the relevance of the proof is made
1871 syntactically clear, which impacts performance in a parallel or
1872 asynchronous interactive environment. Minor INCOMPATIBILITY.
1874 * Use of cumulative prems via "!" in some proof methods has been
1875 discontinued (old legacy feature).
1877 * References 'trace_simp' and 'debug_simp' have been replaced by
1878 configuration options stored in the context. Enabling tracing (the
1879 case of debugging is similar) in proofs works via
1881 using [[trace_simp = true]]
1883 Tracing is then active for all invocations of the simplifier in
1884 subsequent goal refinement steps. Tracing may also still be enabled or
1885 disabled via the ProofGeneral settings menu.
1887 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1888 'hide_fact' replace the former 'hide' KIND command. Minor
1891 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1892 more efficient than combinations with -q1 or -q2.
1897 * Proofterms record type-class reasoning explicitly, using the
1898 "unconstrain" operation internally. This eliminates all sort
1899 constraints from a theorem and proof, introducing explicit
1900 OFCLASS-premises. On the proof term level, this operation is
1901 automatically applied at theorem boundaries, such that closed proofs
1902 are always free of sort constraints. INCOMPATIBILITY for tools that
1903 inspect proof terms.
1905 * Local theory specifications may depend on extra type variables that
1906 are not present in the result type -- arguments TYPE('a) :: 'a itself
1907 are added internally. For example:
1909 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1911 * Predicates of locales introduced by classes carry a mandatory
1912 "class" prefix. INCOMPATIBILITY.
1914 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1916 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1919 * Command 'code_reflect' allows to incorporate generated ML code into
1920 runtime environment; replaces immature code_datatype antiquotation.
1923 * Code generator: simple concept for abstract datatypes obeying
1926 * Code generator: details of internal data cache have no impact on the
1927 user space functionality any longer.
1929 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1930 subgoals. This is more appropriate for interpretations with 'where'.
1933 * Command 'example_proof' opens an empty proof body. This allows to
1934 experiment with Isar, without producing any persistent result.
1936 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1937 within a local theory context, with explicit checking of the
1938 constructors involved (in contrast to the raw 'syntax' versions).
1940 * Commands 'types' and 'typedecl' now work within a local theory
1941 context -- without introducing dependencies on parameters or
1942 assumptions, which is not possible in Isabelle/Pure.
1944 * Command 'defaultsort' has been renamed to 'default_sort', it works
1945 within a local theory context. Minor INCOMPATIBILITY.
1950 * Command 'typedef' now works within a local theory context -- without
1951 introducing dependencies on parameters or assumptions, which is not
1952 possible in Isabelle/Pure/HOL. Note that the logical environment may
1953 contain multiple interpretations of local typedefs (with different
1954 non-emptiness proofs), even in a global theory context.
1956 * New package for quotient types. Commands 'quotient_type' and
1957 'quotient_definition' may be used for defining types and constants by
1958 quotient constructions. An example is the type of integers created by
1959 quotienting pairs of natural numbers:
1962 intrel :: "(nat * nat) => (nat * nat) => bool"
1964 "intrel (x, y) (u, v) = (x + v = u + y)"
1966 quotient_type int = "nat * nat" / intrel
1967 by (auto simp add: equivp_def expand_fun_eq)
1970 "0::int" is "(0::nat, 0::nat)"
1972 The method "lifting" can be used to lift of theorems from the
1973 underlying "raw" type to the quotient type. The example
1974 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1975 construction and provides a reasoning infrastructure for finite sets.
1977 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1978 clash with new theory Quotient in Main HOL.
1980 * Moved the SMT binding into the main HOL session, eliminating
1981 separate HOL-SMT session.
1983 * List membership infix mem operation is only an input abbreviation.
1986 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1987 for future developements; former Library/Word.thy is still present in
1988 the AFP entry RSAPPS.
1990 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1991 longer shadowed. INCOMPATIBILITY.
1993 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1996 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1999 * Dropped normalizing_semiring etc; use the facts in semiring classes
2000 instead. INCOMPATIBILITY.
2002 * Dropped several real-specific versions of lemmas about floor and
2003 ceiling; use the generic lemmas from theory "Archimedean_Field"
2004 instead. INCOMPATIBILITY.
2006 floor_number_of_eq ~> floor_number_of
2007 le_floor_eq_number_of ~> number_of_le_floor
2008 le_floor_eq_zero ~> zero_le_floor
2009 le_floor_eq_one ~> one_le_floor
2010 floor_less_eq_number_of ~> floor_less_number_of
2011 floor_less_eq_zero ~> floor_less_zero
2012 floor_less_eq_one ~> floor_less_one
2013 less_floor_eq_number_of ~> number_of_less_floor
2014 less_floor_eq_zero ~> zero_less_floor
2015 less_floor_eq_one ~> one_less_floor
2016 floor_le_eq_number_of ~> floor_le_number_of
2017 floor_le_eq_zero ~> floor_le_zero
2018 floor_le_eq_one ~> floor_le_one
2019 floor_subtract_number_of ~> floor_diff_number_of
2020 floor_subtract_one ~> floor_diff_one
2021 ceiling_number_of_eq ~> ceiling_number_of
2022 ceiling_le_eq_number_of ~> ceiling_le_number_of
2023 ceiling_le_zero_eq ~> ceiling_le_zero
2024 ceiling_le_eq_one ~> ceiling_le_one
2025 less_ceiling_eq_number_of ~> number_of_less_ceiling
2026 less_ceiling_eq_zero ~> zero_less_ceiling
2027 less_ceiling_eq_one ~> one_less_ceiling
2028 ceiling_less_eq_number_of ~> ceiling_less_number_of
2029 ceiling_less_eq_zero ~> ceiling_less_zero
2030 ceiling_less_eq_one ~> ceiling_less_one
2031 le_ceiling_eq_number_of ~> number_of_le_ceiling
2032 le_ceiling_eq_zero ~> zero_le_ceiling
2033 le_ceiling_eq_one ~> one_le_ceiling
2034 ceiling_subtract_number_of ~> ceiling_diff_number_of
2035 ceiling_subtract_one ~> ceiling_diff_one
2037 * Theory "Finite_Set": various folding_XXX locales facilitate the
2038 application of the various fold combinators on finite sets.
2040 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2041 provides abstract red-black tree type which is backed by "RBT_Impl" as
2042 implementation. INCOMPATIBILTY.
2044 * Theory Library/Coinductive_List has been removed -- superseded by
2045 AFP/thys/Coinductive.
2047 * Theory PReal, including the type "preal" and related operations, has
2048 been removed. INCOMPATIBILITY.
2050 * Real: new development using Cauchy Sequences.
2052 * Split off theory "Big_Operators" containing setsum, setprod,
2053 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2055 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2056 "Int" etc. INCOMPATIBILITY.
2058 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2060 * New set of rules "ac_simps" provides combined assoc / commute
2061 rewrites for all interpretations of the appropriate generic locales.
2063 * Renamed theory "OrderedGroup" to "Groups" and split theory
2064 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2065 appropriate and more consistent names suitable for name prefixes
2066 within the HOL theories. INCOMPATIBILITY.
2068 * Some generic constants have been put to appropriate theories:
2069 - less_eq, less: Orderings
2070 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2071 - inverse, divide: Rings
2074 * More consistent naming of type classes involving orderings (and
2077 lower_semilattice ~> semilattice_inf
2078 upper_semilattice ~> semilattice_sup
2080 dense_linear_order ~> dense_linorder
2082 pordered_ab_group_add ~> ordered_ab_group_add
2083 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2084 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2085 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2086 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2087 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2088 pordered_cancel_semiring ~> ordered_cancel_semiring
2089 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2090 pordered_comm_ring ~> ordered_comm_ring
2091 pordered_comm_semiring ~> ordered_comm_semiring
2092 pordered_ring ~> ordered_ring
2093 pordered_ring_abs ~> ordered_ring_abs
2094 pordered_semiring ~> ordered_semiring
2096 ordered_ab_group_add ~> linordered_ab_group_add
2097 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2098 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2099 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2100 ordered_field ~> linordered_field
2101 ordered_field_no_lb ~> linordered_field_no_lb
2102 ordered_field_no_ub ~> linordered_field_no_ub
2103 ordered_field_dense_linear_order ~> dense_linordered_field
2104 ordered_idom ~> linordered_idom
2105 ordered_ring ~> linordered_ring
2106 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2107 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2108 ordered_ring_strict ~> linordered_ring_strict
2109 ordered_semidom ~> linordered_semidom
2110 ordered_semiring ~> linordered_semiring
2111 ordered_semiring_1 ~> linordered_semiring_1
2112 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2113 ordered_semiring_strict ~> linordered_semiring_strict
2115 The following slightly odd type classes have been moved to a
2116 separate theory Library/Lattice_Algebras:
2118 lordered_ab_group_add ~> lattice_ab_group_add
2119 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2120 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2121 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2122 lordered_ring ~> lattice_ring
2126 * Refined field classes:
2127 - classes division_ring_inverse_zero, field_inverse_zero,
2128 linordered_field_inverse_zero include rule inverse 0 = 0 --
2129 subsumes former division_by_zero class;
2130 - numerous lemmas have been ported from field to division_ring.
2133 * Refined algebra theorem collections:
2134 - dropped theorem group group_simps, use algebra_simps instead;
2135 - dropped theorem group ring_simps, use field_simps instead;
2136 - proper theorem collection field_simps subsumes former theorem
2137 groups field_eq_simps and field_simps;
2138 - dropped lemma eq_minus_self_iff which is a duplicate for
2142 * Theory Finite_Set and List: some lemmas have been generalized from
2145 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2146 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2147 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2148 union_Union_fold_union ~> sup_Sup_fold_sup
2149 Inter_fold_inter ~> Inf_fold_inf
2150 Union_fold_union ~> Sup_fold_sup
2151 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2152 union_UNION_fold_union ~> sup_SUPR_fold_sup
2153 INTER_fold_inter ~> INFI_fold_inf
2154 UNION_fold_union ~> SUPR_fold_sup
2156 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2157 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2158 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2159 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2160 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2161 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2163 * Reorganized theory Multiset: swapped notation of pointwise and
2166 - pointwise ordering is instance of class order with standard syntax
2168 - multiset ordering has syntax <=# and <#; partial order properties
2169 are provided by means of interpretation with prefix
2171 - less duplication, less historical organization of sections,
2172 conversion from associations lists to multisets, rudimentary code
2174 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2179 multiset_eq_conv_count_eq ~> multiset_ext_iff
2180 multi_count_ext ~> multiset_ext
2181 diff_union_inverse2 ~> diff_union_cancelR
2185 * Theory Permutation: replaced local "remove" by List.remove1.
2187 * Code generation: ML and OCaml code is decorated with signatures.
2189 * Theory List: added transpose.
2191 * Library/Nat_Bijection.thy is a collection of bijective functions
2192 between nat and other types, which supersedes the older libraries
2193 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2196 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2197 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2198 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2199 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2200 Countable.pair_encode ~> prod_encode
2201 NatIso.prod2nat ~> prod_encode
2202 NatIso.nat2prod ~> prod_decode
2203 NatIso.sum2nat ~> sum_encode
2204 NatIso.nat2sum ~> sum_decode
2205 NatIso.list2nat ~> list_encode
2206 NatIso.nat2list ~> list_decode
2207 NatIso.set2nat ~> set_encode
2208 NatIso.nat2set ~> set_decode
2211 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2212 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2213 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2214 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2215 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2216 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2217 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2218 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2219 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2220 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2221 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2222 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2223 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2226 - Renamed ATP commands:
2227 atp_info ~> sledgehammer running_atps
2228 atp_kill ~> sledgehammer kill_atps
2229 atp_messages ~> sledgehammer messages
2230 atp_minimize ~> sledgehammer minimize
2231 print_atps ~> sledgehammer available_atps
2233 - Added user's manual ("isabelle doc sledgehammer").
2234 - Added option syntax and "sledgehammer_params" to customize
2235 Sledgehammer's behavior. See the manual for details.
2236 - Modified the Isar proof reconstruction code so that it produces
2237 direct proofs rather than proofs by contradiction. (This feature
2238 is still experimental.)
2239 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2241 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2244 - Added and implemented "binary_ints" and "bits" options.
2245 - Added "std" option and implemented support for nonstandard models.
2246 - Added and implemented "finitize" option to improve the precision
2247 of infinite datatypes based on a monotonicity analysis.
2248 - Added support for quotient types.
2249 - Added support for "specification" and "ax_specification"
2251 - Added support for local definitions (for "function" and
2252 "termination" proofs).
2253 - Added support for term postprocessors.
2254 - Optimized "Multiset.multiset" and "FinFun.finfun".
2255 - Improved efficiency of "destroy_constrs" optimization.
2256 - Fixed soundness bugs related to "destroy_constrs" optimization and
2258 - Fixed soundness bug related to higher-order constructors.
2259 - Fixed soundness bug when "full_descrs" is enabled.
2260 - Improved precision of set constructs.
2261 - Added "atoms" option.
2262 - Added cache to speed up repeated Kodkod invocations on the same
2264 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2265 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2266 "SAT4J_Light". INCOMPATIBILITY.
2267 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2268 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2269 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2271 * Method "induct" now takes instantiations of the form t, where t is not
2272 a variable, as a shorthand for "x == t", where x is a fresh variable.
2273 If this is not intended, t has to be enclosed in parentheses.
2274 By default, the equalities generated by definitional instantiations
2275 are pre-simplified, which may cause parameters of inductive cases
2276 to disappear, or may even delete some of the inductive cases.
2277 Use "induct (no_simp)" instead of "induct" to restore the old
2278 behaviour. The (no_simp) option is also understood by the "cases"
2279 and "nominal_induct" methods, which now perform pre-simplification, too.
2285 * Variable names in lemmas generated by the domain package have
2286 changed; the naming scheme is now consistent with the HOL datatype
2287 package. Some proof scripts may be affected, INCOMPATIBILITY.
2289 * The domain package no longer defines the function "foo_copy" for
2290 recursive domain "foo". The reach lemma is now stated directly in
2291 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2292 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2294 * Most definedness lemmas generated by the domain package (previously
2295 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2296 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2297 Proofs that used definedness lemmas as intro rules may break,
2298 potential INCOMPATIBILITY.
2300 * Induction and casedist rules generated by the domain package now
2301 declare proper case_names (one called "bottom", and one named for each
2302 constructor). INCOMPATIBILITY.
2304 * For mutually-recursive domains, separate "reach" and "take_lemma"
2305 rules are generated for each domain, INCOMPATIBILITY.
2307 foo_bar.reach ~> foo.reach bar.reach
2308 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2310 * Some lemmas generated by the domain package have been renamed for
2311 consistency with the datatype package, INCOMPATIBILITY.
2313 foo.ind ~> foo.induct
2314 foo.finite_ind ~> foo.finite_induct
2315 foo.coind ~> foo.coinduct
2316 foo.casedist ~> foo.exhaust
2317 foo.exhaust ~> foo.nchotomy
2319 * For consistency with other definition packages, the fixrec package
2320 now generates qualified theorem names, INCOMPATIBILITY.
2322 foo_simps ~> foo.simps
2323 foo_unfold ~> foo.unfold
2324 foo_induct ~> foo.induct
2326 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2327 method and internal fixrec proofs now use the default simpset instead.
2330 * The "contlub" predicate has been removed. Proof scripts should use
2331 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2333 * The "admw" predicate has been removed, INCOMPATIBILITY.
2335 * The constants cpair, cfst, and csnd have been removed in favor of
2336 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2341 * Antiquotations for basic formal entities:
2343 @{class NAME} -- type class
2344 @{class_syntax NAME} -- syntax representation of the above
2346 @{type_name NAME} -- logical type
2347 @{type_abbrev NAME} -- type abbreviation
2348 @{nonterminal NAME} -- type of concrete syntactic category
2349 @{type_syntax NAME} -- syntax representation of any of the above
2351 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2352 @{const_abbrev NAME} -- abbreviated constant
2353 @{const_syntax NAME} -- syntax representation of any of the above
2355 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2356 syntax constant (cf. 'syntax' command).
2358 * Antiquotation @{make_string} inlines a function to print arbitrary
2359 values similar to the ML toplevel. The result is compiler dependent
2360 and may fall back on "?" in certain situations.
2362 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2363 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2364 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2365 not work with the asynchronous Isar document model.
2367 * Configuration options now admit dynamic default values, depending on
2368 the context or even global references.
2370 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2371 uses an efficient external library if available (for Poly/ML).
2373 * Renamed some important ML structures, while keeping the old names
2374 for some time as aliases within the structure Legacy:
2376 OuterKeyword ~> Keyword
2379 OuterSyntax ~> Outer_Syntax
2380 PrintMode ~> Print_Mode
2381 SpecParse ~> Parse_Spec
2384 ThyOutput ~> Thy_Output
2385 TypeInfer ~> Type_Infer
2387 Note that "open Legacy" simplifies porting of sources, but forgetting
2388 to remove it again will complicate porting again in the future.
2390 * Most operations that refer to a global context are named
2391 accordingly, e.g. Simplifier.global_context or
2392 ProofContext.init_global. There are some situations where a global
2393 context actually works, but under normal circumstances one needs to
2394 pass the proper local context through the code!
2396 * Discontinued old TheoryDataFun with its copy/init operation -- data
2397 needs to be pure. Functor Theory_Data_PP retains the traditional
2398 Pretty.pp argument to merge, which is absent in the standard
2399 Theory_Data version.
2401 * Sorts.certify_sort and derived "cert" operations for types and terms
2402 no longer minimize sorts. Thus certification at the boundary of the
2403 inference kernel becomes invariant under addition of class relations,
2404 which is an important monotonicity principle. Sorts are now minimized
2405 in the syntax layer only, at the boundary between the end-user and the
2406 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2407 explicitly in rare situations.
2409 * Renamed old-style Drule.standard to Drule.export_without_context, to
2410 emphasize that this is in no way a standard operation.
2413 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2414 usual for resolution. Rare INCOMPATIBILITY.
2416 * Renamed varify/unvarify operations to varify_global/unvarify_global
2417 to emphasize that these only work in a global situation (which is
2420 * Curried take and drop in library.ML; negative length is interpreted
2421 as infinity (as in chop). Subtle INCOMPATIBILITY.
2423 * Proof terms: type substitutions on proof constants now use canonical
2424 order of type variables. INCOMPATIBILITY for tools working with proof
2427 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2428 may no longer carry premises. User-level specifications are
2429 transformed accordingly by Thm.add_axiom/add_def.
2434 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2435 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2436 proof terms are enabled unconditionally in the new HOL-Proofs image.
2438 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2439 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2442 * Old lib/scripts/polyml-platform is superseded by the
2443 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2444 variant, even on a 64 bit machine. The following example setting
2445 prefers 64 bit if available:
2447 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2449 * The preliminary Isabelle/jEdit application demonstrates the emerging
2450 Isabelle/Scala layer for advanced prover interaction and integration.
2451 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2454 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2455 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2456 similar to the default assignment of the document preparation system
2457 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2458 provides some operations for direct access to the font without asking
2459 the user for manual installation.
2463 New in Isabelle2009-1 (December 2009)
2464 -------------------------------------
2468 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2469 one backslash should be used, even in ML sources.
2474 * Locale interpretation propagates mixins along the locale hierarchy.
2475 The currently only available mixins are the equations used to map
2476 local definitions to terms of the target domain of an interpretation.
2478 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2479 loc" to print all interpretations of locale "loc" in the theory.
2480 Interpretations in proofs are not shown.
2482 * Thoroughly revised locales tutorial. New section on conditional
2485 * On instantiation of classes, remaining undefined class parameters
2486 are formally declared. INCOMPATIBILITY.
2489 *** Document preparation ***
2491 * New generalized style concept for printing terms: @{foo (style) ...}
2492 instead of @{foo_style style ...} (old form is still retained for
2493 backward compatibility). Styles can be also applied for
2494 antiquotations prop, term_type and typeof.
2499 * New proof method "smt" for a combination of first-order logic with
2500 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2501 fixed-size bitvectors; there is also basic support for higher-order
2502 features (esp. lambda abstractions). It is an incomplete decision
2503 procedure based on external SMT solvers using the oracle mechanism;
2504 for the SMT solver Z3, this method is proof-producing. Certificates
2505 are provided to avoid calling the external solvers solely for
2506 re-checking proofs. Due to a remote SMT service there is no need for
2507 installing SMT solvers locally. See src/HOL/SMT.
2509 * New commands to load and prove verification conditions generated by
2510 the Boogie program verifier or derived systems (e.g. the Verifying C
2511 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2513 * New counterexample generator tool 'nitpick' based on the Kodkod
2514 relational model finder. See src/HOL/Tools/Nitpick and
2515 src/HOL/Nitpick_Examples.
2517 * New commands 'code_pred' and 'values' to invoke the predicate
2518 compiler and to enumerate values of inductive predicates.
2520 * A tabled implementation of the reflexive transitive closure.
2522 * New implementation of quickcheck uses generic code generator;
2523 default generators are provided for all suitable HOL types, records
2524 and datatypes. Old quickcheck can be re-activated importing theory
2525 Library/SML_Quickcheck.
2527 * New testing tool Mirabelle for automated proof tools. Applies
2528 several tools and tactics like sledgehammer, metis, or quickcheck, to
2529 every proof step in a theory. To be used in batch mode via the
2530 "mirabelle" utility.
2532 * New proof method "sos" (sum of squares) for nonlinear real
2533 arithmetic (originally due to John Harison). It requires theory
2534 Library/Sum_Of_Squares. It is not a complete decision procedure but
2535 works well in practice on quantifier-free real arithmetic with +, -,
2536 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2537 inequalities between polynomials. It makes use of external
2538 semidefinite programming solvers. Method "sos" generates a
2539 certificate that can be pasted into the proof thus avoiding the need
2540 to call an external tool every time the proof is checked. See
2541 src/HOL/Library/Sum_Of_Squares.
2543 * New method "linarith" invokes existing linear arithmetic decision
2546 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2548 * New Sledgehammer option "Full Types" in Proof General settings menu.
2549 Causes full type information to be output to the ATPs. This slows
2550 ATPs down considerably but eliminates a source of unsound "proofs"
2553 * New method "metisFT": A version of metis that uses full type
2554 information in order to avoid failures of proof reconstruction.
2556 * New evaluator "approximate" approximates an real valued term using
2557 the same method as the approximation method.
2559 * Method "approximate" now supports arithmetic expressions as
2560 boundaries of intervals and implements interval splitting and Taylor
2563 * ML antiquotation @{code_datatype} inserts definition of a datatype
2564 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2566 * New theory SupInf of the supremum and infimum operators for sets of
2569 * New theory Probability, which contains a development of measure
2570 theory, eventually leading to Lebesgue integration and probability.
2572 * Extended Multivariate Analysis to include derivation and Brouwer's
2575 * Reorganization of number theory, INCOMPATIBILITY:
2576 - new number theory development for nat and int, in theories Divides
2577 and GCD as well as in new session Number_Theory
2578 - some constants and facts now suffixed with _nat and _int
2580 - former session NumberTheory now named Old_Number_Theory, including
2581 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2582 - moved theory Pocklington from src/HOL/Library to
2583 src/HOL/Old_Number_Theory
2585 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2586 lcm of finite and infinite sets. It is shown that they form a complete
2589 * Class semiring_div requires superclass no_zero_divisors and proof of
2590 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2591 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2592 generalized to class semiring_div, subsuming former theorems
2593 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2594 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2597 * Refinements to lattice classes and sets:
2598 - less default intro/elim rules in locale variant, more default
2599 intro/elim rules in class variant: more uniformity
2600 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2602 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2604 - renamed ACI to inf_sup_aci
2605 - new class "boolean_algebra"
2606 - class "complete_lattice" moved to separate theory
2607 "Complete_Lattice"; corresponding constants (and abbreviations)
2608 renamed and with authentic syntax:
2609 Set.Inf ~> Complete_Lattice.Inf
2610 Set.Sup ~> Complete_Lattice.Sup
2611 Set.INFI ~> Complete_Lattice.INFI
2612 Set.SUPR ~> Complete_Lattice.SUPR
2613 Set.Inter ~> Complete_Lattice.Inter
2614 Set.Union ~> Complete_Lattice.Union
2615 Set.INTER ~> Complete_Lattice.INTER
2616 Set.UNION ~> Complete_Lattice.UNION
2617 - authentic syntax for
2620 - mere abbreviations:
2623 Set.inter (for inf, formerly Set.Int)
2624 Set.union (for sup, formerly Set.Un)
2625 Complete_Lattice.Inter (for Inf)
2626 Complete_Lattice.Union (for Sup)
2627 Complete_Lattice.INTER (for INFI)
2628 Complete_Lattice.UNION (for SUPR)
2629 - object-logic definitions as far as appropriate
2631 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2632 Un_subset_iff are explicitly deleted as default simp rules; then also
2633 their lattice counterparts le_inf_iff and le_sup_iff have to be
2634 deleted to achieve the desired effect.
2636 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2637 rules by default any longer; the same applies to min_max.inf_absorb1
2638 etc. INCOMPATIBILITY.
2640 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2641 pred_set_conv by default. INCOMPATIBILITY.
2643 * Power operations on relations and functions are now one dedicated
2644 constant "compow" with infix syntax "^^". Power operation on
2645 multiplicative monoids retains syntax "^" and is now defined generic
2646 in class power. INCOMPATIBILITY.
2648 * Relation composition "R O S" now has a more standard argument order:
2649 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2650 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2651 break, since the O_assoc rule was not rewritten like this. Fix using
2652 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2654 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2655 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2658 * Most rules produced by inductive and datatype package have mandatory
2659 prefixes. INCOMPATIBILITY.
2661 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2662 the attribute of the same name. Each of the theorems in the list
2663 DERIV_intros assumes composition with an additional function and
2664 matches a variable to the derivative, which has to be solved by the
2665 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2666 of most elementary terms. Former Maclauren.DERIV_tac and
2667 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2670 * Code generator attributes follow the usual underscore convention:
2671 code_unfold replaces code unfold
2672 code_post replaces code post
2677 sizechange -> size_change
2678 induct_scheme -> induction_schema
2681 * Discontinued abbreviation "arbitrary" of constant "undefined".
2682 INCOMPATIBILITY, use "undefined" directly.
2685 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2686 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2687 Suc_plus1 -> Suc_eq_plus1
2688 *anti_sym -> *antisym*
2689 vector_less_eq_def -> vector_le_def
2692 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2695 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2701 * Theory Representable defines a class "rep" of domains that are
2702 representable (via an ep-pair) in the universal domain type "udom".
2703 Instances are provided for all type constructors defined in HOLCF.
2705 * The 'new_domain' command is a purely definitional version of the
2706 domain package, for representable domains. Syntax is identical to the
2707 old domain package. The 'new_domain' package also supports indirect
2708 recursion using previously-defined type constructors. See
2709 src/HOLCF/ex/New_Domain.thy for examples.
2711 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2712 on the left-hand side of an equation, and then performs
2713 simplification. Rewriting is done using rules declared with the
2714 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2715 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2717 * The pattern-match compiler in 'fixrec' can now handle constructors
2718 with HOL function types. Pattern-match combinators for the Pair
2719 constructor are pre-configured.
2721 * The 'fixrec' package now produces better fixed-point induction rules
2722 for mutually-recursive definitions: Induction rules have conclusions
2723 of the form "P foo bar" instead of "P <foo, bar>".
2725 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2726 been renamed to "below". The name "below" now replaces "less" in many
2727 theorem names. (Legacy theorem names using "less" are still supported
2730 * The 'fixrec' package now supports "bottom patterns". Bottom
2731 patterns can be used to generate strictness rules, or to make
2732 functions more strict (much like the bang-patterns supported by the
2733 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2739 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2740 errors and run-time exceptions, including detailed source positions.
2742 * Structure Name_Space (formerly NameSpace) now manages uniquely
2743 identified entries, with some additional information such as source
2744 position, logical grouping etc.
2746 * Theory and context data is now introduced by the simplified and
2747 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2748 to be pure, but the old TheoryDataFun for mutable data (with explicit
2749 copy operation) is still available for some time.
2751 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2752 provides a high-level programming interface to synchronized state
2753 variables with atomic update. This works via pure function
2754 application within a critical section -- its runtime should be as
2755 short as possible; beware of deadlocks if critical code is nested,
2756 either directly or indirectly via other synchronized variables!
2758 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2759 wraps raw ML references, explicitly indicating their non-thread-safe
2760 behaviour. The Isar toplevel keeps this structure open, to
2761 accommodate Proof General as well as quick and dirty interactive
2762 experiments with references.
2764 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2765 parallel tactical reasoning.
2767 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2768 are similar to SUBPROOF, but are slightly more flexible: only the
2769 specified parts of the subgoal are imported into the context, and the
2770 body tactic may introduce new subgoals and schematic variables.
2772 * Old tactical METAHYPS, which does not observe the proof context, has
2773 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2774 or Subgoal.FOCUS etc.
2776 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2777 functors have their own ML name space there is no point to mark them
2778 separately.) Minor INCOMPATIBILITY.
2780 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2782 * Renamed several structures FooBar to Foo_Bar. Occasional,
2785 * Operations of structure Skip_Proof no longer require quick_and_dirty
2786 mode, which avoids critical setmp.
2788 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2789 combinators for "args". INCOMPATIBILITY, need to use simplified
2790 Attrib/Method.setup introduced in Isabelle2009.
2792 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2793 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2794 last resort. INCOMPATIBILITY.
2796 * Display.pretty_thm now requires a proper context (cf. former
2797 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2798 or even Display.pretty_thm_without_context as last resort.
2801 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2802 Syntax.pretty_typ/term directly, preferably with proper context
2803 instead of global theory.
2808 * Further fine tuning of parallel proof checking, scales up to 8 cores
2809 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2812 * Support for additional "Isabelle components" via etc/components, see
2813 also the system manual.
2815 * The isabelle makeall tool now operates on all components with
2816 IsaMakefile, not just hardwired "logics".
2818 * Removed "compress" option from isabelle-process and isabelle usedir;
2819 this is always enabled.
2821 * Discontinued support for Poly/ML 4.x versions.
2823 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2824 on a given logic image. This requires the lighttpd webserver and is
2825 currently supported on Linux only.
2829 New in Isabelle2009 (April 2009)
2830 --------------------------------
2834 * Simplified main Isabelle executables, with less surprises on
2835 case-insensitive file-systems (such as Mac OS).
2837 - The main Isabelle tool wrapper is now called "isabelle" instead of
2840 - The former "isabelle" alias for "isabelle-process" has been
2841 removed (should rarely occur to regular users).
2843 - The former "isabelle-interface" and its alias "Isabelle" have been
2844 removed (interfaces are now regular Isabelle tools).
2846 Within scripts and make files, the Isabelle environment variables
2847 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2848 respectively. (The latter are still available as legacy feature.)
2850 The old isabelle-interface wrapper could react in confusing ways if
2851 the interface was uninstalled or changed otherwise. Individual
2852 interface tool configuration is now more explicit, see also the
2853 Isabelle system manual. In particular, Proof General is now available
2854 via "isabelle emacs".
2856 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2857 purge installed copies of Isabelle executables and re-run "isabelle
2858 install -p ...", or use symlinks.
2860 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2861 old ~/isabelle, which was slightly non-standard and apt to cause
2862 surprises on case-insensitive file-systems (such as Mac OS).
2864 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2865 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2866 care is required when using older releases of Isabelle. Note that
2867 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2868 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2870 * Proofs of fully specified statements are run in parallel on
2871 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2872 a regular 4-core machine, if the initial heap space is made reasonably
2873 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2875 * The main reference manuals ("isar-ref", "implementation", and
2876 "system") have been updated and extended. Formally checked references
2877 as hyperlinks are now available uniformly.
2882 * Complete re-implementation of locales. INCOMPATIBILITY in several
2883 respects. The most important changes are listed below. See the
2884 Tutorial on Locales ("locales" manual) for details.
2886 - In locale expressions, instantiation replaces renaming. Parameters
2887 must be declared in a for clause. To aid compatibility with previous
2888 parameter inheritance, in locale declarations, parameters that are not
2889 'touched' (instantiation position "_" or omitted) are implicitly added
2890 with their syntax at the beginning of the for clause.
2892 - Syntax from abbreviations and definitions in locales is available in
2893 locale expressions and context elements. The latter is particularly
2894 useful in locale declarations.
2896 - More flexible mechanisms to qualify names generated by locale
2897 expressions. Qualifiers (prefixes) may be specified in locale
2898 expressions, and can be marked as mandatory (syntax: "name!:") or
2899 optional (syntax "name?:"). The default depends for plain "name:"
2900 depends on the situation where a locale expression is used: in
2901 commands 'locale' and 'sublocale' prefixes are optional, in
2902 'interpretation' and 'interpret' prefixes are mandatory. The old
2903 implicit qualifiers derived from the parameter names of a locale are
2904 no longer generated.
2906 - Command "sublocale l < e" replaces "interpretation l < e". The
2907 instantiation clause in "interpretation" and "interpret" (square
2908 brackets) is no longer available. Use locale expressions.
2910 - When converting proof scripts, mandatory qualifiers in
2911 'interpretation' and 'interpret' should be retained by default, even
2912 if this is an INCOMPATIBILITY compared to former behavior. In the
2913 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2914 in locale expressions range over a single locale instance only.
2916 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2917 In existing theorem specifications replace the includes element by the
2918 respective context elements of the included locale, omitting those
2919 that are already present in the theorem specification. Multiple
2920 assume elements of a locale should be replaced by a single one
2921 involving the locale predicate. In the proof body, declarations (most
2922 notably theorems) may be regained by interpreting the respective
2923 locales in the proof context as required (command "interpret").
2925 If using "includes" in replacement of a target solely because the
2926 parameter types in the theorem are not as general as in the target,
2927 consider declaring a new locale with additional type constraints on
2928 the parameters (context element "constrains").
2930 - Discontinued "locale (open)". INCOMPATIBILITY.
2932 - Locale interpretation commands no longer attempt to simplify goal.
2933 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2934 methods intro_locales and unfold_locales to clarify.
2936 - Locale interpretation commands no longer accept interpretation
2937 attributes. INCOMPATIBILITY.
2939 * Class declaration: so-called "base sort" must not be given in import
2940 list any longer, but is inferred from the specification. Particularly
2947 class foo = type + ...
2949 * Class target: global versions of theorems stemming do not carry a
2950 parameter prefix any longer. INCOMPATIBILITY.
2952 * Class 'instance' command no longer accepts attached definitions.
2953 INCOMPATIBILITY, use proper 'instantiation' target instead.
2955 * Recovered hiding of consts, which was accidentally broken in
2956 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2957 makes c inaccessible; consider using ``hide (open) const c'' instead.
2959 * Slightly more coherent Pure syntax, with updated documentation in
2960 isar-ref manual. Removed locales meta_term_syntax and
2961 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2962 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2963 directly in regular applications.
2965 * There is a new syntactic category "float_const" for signed decimal
2966 fractions (e.g. 123.45 or -123.45).
2968 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2969 interface with 'setup' command instead.
2971 * Command 'local_setup' is similar to 'setup', but operates on a local
2974 * The 'axiomatization' command now only works within a global theory
2975 context. INCOMPATIBILITY.
2977 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2978 hypotheses. Sorts required in the course of reasoning need to be
2979 covered by the constraints in the initial statement, completed by the
2980 type instance information of the background theory. Non-trivial sort
2981 hypotheses, which rarely occur in practice, may be specified via
2982 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2984 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2986 The result contains an implicit sort hypotheses as before --
2987 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2990 * Generalized Isar history, with support for linear undo, direct state
2993 * Changed defaults for unify configuration options:
2995 unify_trace_bound = 50 (formerly 25)
2996 unify_search_bound = 60 (formerly 30)
2998 * Different bookkeeping for code equations (INCOMPATIBILITY):
3000 a) On theory merge, the last set of code equations for a particular
3001 constant is taken (in accordance with the policy applied by other
3002 parts of the code generator framework).
3004 b) Code equations stemming from explicit declarations (e.g. code
3005 attribute) gain priority over default code equations stemming
3006 from definition, primrec, fun etc.
3008 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3010 * Unified theorem tables for both code generators. Thus [code
3011 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3013 * Command 'find_consts' searches for constants based on type and name
3016 find_consts "_ => bool"
3018 By default, matching is against subtypes, but it may be restricted to
3019 the whole type. Searching by name is possible. Multiple queries are
3020 conjunctive and queries may be negated by prefixing them with a
3023 find_consts strict: "_ => bool" name: "Int" -"int => int"
3025 * New 'find_theorems' criterion "solves" matches theorems that
3026 directly solve the current goal (modulo higher-order unification).
3028 * Auto solve feature for main theorem statements: whenever a new goal
3029 is stated, "find_theorems solves" is called; any theorems that could
3030 solve the lemma directly are listed as part of the goal state.
3031 Cf. associated options in Proof General Isabelle settings menu,
3032 enabled by default, with reasonable timeout for pathological cases of
3033 higher-order unification.
3036 *** Document preparation ***
3038 * Antiquotation @{lemma} now imitates a regular terminal proof,
3039 demanding keyword 'by' and supporting the full method expression
3040 syntax just like the Isar command 'by'.
3045 * Integrated main parts of former image HOL-Complex with HOL. Entry
3046 points Main and Complex_Main remain as before.
3048 * Logic image HOL-Plain provides a minimal HOL with the most important
3049 tools available (inductive, datatype, primrec, ...). This facilitates
3050 experimentation and tool development. Note that user applications
3051 (and library theories) should never refer to anything below theory
3054 * Logic image HOL-Main stops at theory Main, and thus facilitates
3055 experimentation due to shorter build times.
3057 * Logic image HOL-NSA contains theories of nonstandard analysis which
3058 were previously part of former HOL-Complex. Entry point Hyperreal
3059 remains valid, but theories formerly using Complex_Main should now use
3060 new entry point Hypercomplex.
3062 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3063 Posix processes. Avoids potentially expensive forking of the ML
3064 process. New thread-based implementation also works on non-Unix
3065 platforms (Cygwin). Provers are no longer hardwired, but defined
3066 within the theory via plain ML wrapper functions. Basic Sledgehammer
3067 commands are covered in the isar-ref manual.
3069 * Wrapper scripts for remote SystemOnTPTP service allows to use
3070 sledgehammer without local ATP installation (Vampire etc.). Other
3071 provers may be included via suitable ML wrappers, see also
3072 src/HOL/ATP_Linkup.thy.
3074 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3077 * The metis method no longer fails because the theorem is too trivial
3078 (contains the empty clause).
3080 * The metis method now fails in the usual manner, rather than raising
3081 an exception, if it determines that it cannot prove the theorem.
3083 * Method "coherent" implements a prover for coherent logic (see also
3084 src/Tools/coherent.ML).
3086 * Constants "undefined" and "default" replace "arbitrary". Usually
3087 "undefined" is the right choice to replace "arbitrary", though
3088 logically there is no difference. INCOMPATIBILITY.
3090 * Command "value" now integrates different evaluation mechanisms. The
3091 result of the first successful evaluation mechanism is printed. In
3092 square brackets a particular named evaluation mechanisms may be
3093 specified (currently, [SML], [code] or [nbe]). See further
3094 src/HOL/ex/Eval_Examples.thy.
3096 * Normalization by evaluation now allows non-leftlinear equations.
3097 Declare with attribute [code nbe].
3099 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3100 as the structured Isar versions "cases" and "induct", cf. the
3101 corresponding "cases" and "induct" attributes. Mutual induction rules
3102 are now presented as a list of individual projections
3103 (e.g. foo_bar.inducts for types foo and bar); the old format with
3104 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3105 rare situations a different rule is selected --- notably nested tuple
3106 elimination instead of former prod.exhaust: use explicit (case_tac t
3107 rule: prod.exhaust) here.
3109 * Attributes "cases", "induct", "coinduct" support "del" option.
3111 * Removed fact "case_split_thm", which duplicates "case_split".
3113 * The option datatype has been moved to a new theory Option. Renamed
3114 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3116 * New predicate "strict_mono" classifies strict functions on partial
3117 orders. With strict functions on linear orders, reasoning about
3118 (in)equalities is facilitated by theorems "strict_mono_eq",
3119 "strict_mono_less_eq" and "strict_mono_less".
3121 * Some set operations are now proper qualified constants with
3122 authentic syntax. INCOMPATIBILITY:
3133 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3136 * Auxiliary class "itself" has disappeared -- classes without any
3137 parameter are treated as expected by the 'class' command.
3139 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3141 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3142 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3144 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3145 method "approximation". It proves formulas on real values by using
3146 interval arithmetic. In the formulas are also the transcendental
3147 functions sin, cos, tan, atan, ln, exp and the constant pi are
3148 allowed. For examples see
3149 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3151 * Theory "Reflection" now resides in HOL/Library.
3153 * Entry point to Word library now simply named "Word".
3156 * Made source layout more coherent with logical distribution
3159 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3160 src/HOL/Library/Code_Message.thy ~> src/HOL/
3161 src/HOL/Library/GCD.thy ~> src/HOL/
3162 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3163 src/HOL/Library/Parity.thy ~> src/HOL/
3164 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3165 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3166 src/HOL/Real/Lubs.thy ~> src/HOL/
3167 src/HOL/Real/PReal.thy ~> src/HOL/
3168 src/HOL/Real/Rational.thy ~> src/HOL/
3169 src/HOL/Real/RComplete.thy ~> src/HOL/
3170 src/HOL/Real/RealDef.thy ~> src/HOL/
3171 src/HOL/Real/RealPow.thy ~> src/HOL/
3172 src/HOL/Real/Real.thy ~> src/HOL/
3173 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3174 src/HOL/Complex/Complex.thy ~> src/HOL/
3175 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3176 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3177 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3178 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3179 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3180 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3181 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3182 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3183 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3184 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3185 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3186 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3187 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3188 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3189 src/HOL/Real/Float ~> src/HOL/Library/
3190 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3191 src/HOL/Real/RealVector.thy ~> src/HOL/
3193 src/HOL/arith_data.ML ~> src/HOL/Tools
3194 src/HOL/hologic.ML ~> src/HOL/Tools
3195 src/HOL/simpdata.ML ~> src/HOL/Tools
3196 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3197 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3198 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3199 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3200 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3201 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3202 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3204 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3205 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3206 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3207 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3208 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3209 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3211 * If methods "eval" and "evaluation" encounter a structured proof
3212 state with !!/==>, only the conclusion is evaluated to True (if
3213 possible), avoiding strange error messages.
3215 * Method "sizechange" automates termination proofs using (a
3216 modification of) the size-change principle. Requires SAT solver. See
3217 src/HOL/ex/Termination.thy for examples.
3219 * Simplifier: simproc for let expressions now unfolds if bound
3220 variable occurs at most once in let expression body. INCOMPATIBILITY.
3222 * Method "arith": Linear arithmetic now ignores all inequalities when
3223 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3225 * New attribute "arith" for facts that should always be used
3226 automatically by arithmetic. It is intended to be used locally in
3229 assumes [arith]: "x > 0"
3231 Global usage is discouraged because of possible performance impact.
3233 * New classes "top" and "bot" with corresponding operations "top" and
3234 "bot" in theory Orderings; instantiation of class "complete_lattice"
3235 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3237 * Changed definition lemma "less_fun_def" in order to provide an
3238 instance for preorders on functions; use lemma "less_le" instead.
3241 * Theory Orderings: class "wellorder" moved here, with explicit
3242 induction rule "less_induct" as assumption. For instantiation of
3243 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3246 * Theory Orderings: added class "preorder" as superclass of "order".
3247 INCOMPATIBILITY: Instantiation proofs for order, linorder
3248 etc. slightly changed. Some theorems named order_class.* now named
3251 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3254 * Theory Finite_Set: added a new fold combinator of type
3256 ('a => 'b => 'b) => 'b => 'a set => 'b
3258 Occasionally this is more convenient than the old fold combinator
3259 which is now defined in terms of the new one and renamed to
3262 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3263 and "ring_simps" have been replaced by "algebra_simps" (which can be
3264 extended with further lemmas!). At the moment both still exist but
3265 the former will disappear at some point.
3267 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3268 class recpower. Type-specific simp rules for various recpower types
3269 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3271 rat_power_0 -> power_0
3272 rat_power_Suc -> power_Suc
3273 realpow_0 -> power_0
3274 realpow_Suc -> power_Suc
3275 complexpow_0 -> power_0
3276 complexpow_Suc -> power_Suc
3277 power_poly_0 -> power_0
3278 power_poly_Suc -> power_Suc
3280 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3281 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3282 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3283 of lemmas from Divides has been generalized from nat to class
3284 semiring_div. INCOMPATIBILITY. This involves the following theorem
3285 renames resulting from duplicate elimination:
3287 dvd_def_mod ~> dvd_eq_mod_eq_0
3288 zero_dvd_iff ~> dvd_0_left_iff
3289 dvd_0 ~> dvd_0_right
3290 DIVISION_BY_ZERO_DIV ~> div_by_0
3291 DIVISION_BY_ZERO_MOD ~> mod_by_0
3292 mult_div ~> div_mult_self2_is_id
3293 mult_mod ~> mod_mult_self2_is_0
3295 * Theory IntDiv: removed many lemmas that are instances of class-based
3296 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3297 rename old lemmas as follows:
3299 dvd_diff -> nat_dvd_diff
3300 dvd_zminus_iff -> dvd_minus_iff
3301 mod_add1_eq -> mod_add_eq
3302 mod_mult1_eq -> mod_mult_right_eq
3303 mod_mult1_eq' -> mod_mult_left_eq
3304 mod_mult_distrib_mod -> mod_mult_eq
3305 nat_mod_add_left_eq -> mod_add_left_eq
3306 nat_mod_add_right_eq -> mod_add_right_eq
3307 nat_mod_div_trivial -> mod_div_trivial
3308 nat_mod_mod_trivial -> mod_mod_trivial
3309 zdiv_zadd_self1 -> div_add_self1
3310 zdiv_zadd_self2 -> div_add_self2
3311 zdiv_zmult_self1 -> div_mult_self2_is_id
3312 zdiv_zmult_self2 -> div_mult_self1_is_id
3313 zdvd_triv_left -> dvd_triv_left
3314 zdvd_triv_right -> dvd_triv_right
3315 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3316 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3317 zmod_zadd_left_eq -> mod_add_left_eq
3318 zmod_zadd_right_eq -> mod_add_right_eq
3319 zmod_zadd_self1 -> mod_add_self1
3320 zmod_zadd_self2 -> mod_add_self2
3321 zmod_zadd1_eq -> mod_add_eq
3322 zmod_zdiff1_eq -> mod_diff_eq
3323 zmod_zdvd_zmod -> mod_mod_cancel
3324 zmod_zmod_cancel -> mod_mod_cancel
3325 zmod_zmult_self1 -> mod_mult_self2_is_0
3326 zmod_zmult_self2 -> mod_mult_self1_is_0
3329 zdvd_abs1 -> abs_dvd_iff
3330 zdvd_abs2 -> dvd_abs_iff
3331 zdvd_refl -> dvd_refl
3332 zdvd_trans -> dvd_trans
3333 zdvd_zadd -> dvd_add
3334 zdvd_zdiff -> dvd_diff
3335 zdvd_zminus_iff -> dvd_minus_iff
3336 zdvd_zminus2_iff -> minus_dvd_iff
3337 zdvd_zmultD -> dvd_mult_right
3338 zdvd_zmultD2 -> dvd_mult_left
3339 zdvd_zmult_mono -> mult_dvd_mono
3340 zdvd_0_right -> dvd_0_right
3341 zdvd_0_left -> dvd_0_left_iff
3342 zdvd_1_left -> one_dvd
3343 zminus_dvd_iff -> minus_dvd_iff
3345 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3347 * The real numbers offer decimal input syntax: 12.34 is translated
3348 into 1234/10^2. This translation is not reversed upon output.
3350 * Theory Library/Polynomial defines an abstract type 'a poly of
3351 univariate polynomials with coefficients of type 'a. In addition to
3352 the standard ring operations, it also supports div and mod. Code
3353 generation is also supported, using list-style constructors.
3355 * Theory Library/Inner_Product defines a class of real_inner for real
3356 inner product spaces, with an overloaded operation inner :: 'a => 'a
3357 => real. Class real_inner is a subclass of real_normed_vector from
3360 * Theory Library/Product_Vector provides instances for the product
3361 type 'a * 'b of several classes from RealVector and Inner_Product.
3362 Definitions of addition, subtraction, scalar multiplication, norms,
3363 and inner products are included.
3365 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3366 addition to the field operations, numerals and case syntax are also
3369 * Theory Library/Diagonalize provides constructive version of Cantor's
3370 first diagonalization argument.
3372 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3373 zlcm (for int); carried together from various gcd/lcm developements in
3374 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3375 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3376 may recover tupled syntax as follows:
3378 hide (open) const gcd
3379 abbreviation gcd where
3380 "gcd == (%(a, b). GCD.gcd a b)"
3382 GCD.gcd ("gcd '(_, _')")
3384 The same works for lcm, zgcd, zlcm.
3386 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3387 instantiations for algebraic structures. Removed some duplicate
3388 theorems. Changes in simp rules. INCOMPATIBILITY.
3390 * ML antiquotation @{code} takes a constant as argument and generates
3391 corresponding code in background and inserts name of the corresponding
3392 resulting ML value/function/datatype constructor binding in place.
3393 All occurrences of @{code} with a single ML block are generated
3394 simultaneously. Provides a generic and safe interface for
3395 instrumentalizing code generation. See
3396 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3397 In future you ought to refrain from ad-hoc compiling generated SML
3398 code on the ML toplevel. Note that (for technical reasons) @{code}
3399 cannot refer to constants for which user-defined serializations are
3400 set. Refer to the corresponding ML counterpart directly in that
3403 * Command 'rep_datatype': instead of theorem names the command now
3404 takes a list of terms denoting the constructors of the type to be
3405 represented as datatype. The characteristic theorems have to be
3406 proven. INCOMPATIBILITY. Also observe that the following theorems
3407 have disappeared in favour of existing ones:
3409 unit_induct ~> unit.induct
3410 prod_induct ~> prod.induct
3411 sum_induct ~> sum.induct
3412 Suc_Suc_eq ~> nat.inject
3413 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3418 * New locales for orders and lattices where the equivalence relation
3419 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3420 locales use a record structure with field eq for the equivalence.
3422 * New theory of factorial domains.
3424 * Units_l_inv and Units_r_inv are now simp rules by default.
3425 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3426 and/or r_inv will now also require deletion of these lemmas.
3428 * Renamed the following theorems, INCOMPATIBILITY:
3430 UpperD ~> Upper_memD
3431 LowerD ~> Lower_memD
3432 least_carrier ~> least_closed
3433 greatest_carrier ~> greatest_closed
3434 greatest_Lower_above ~> greatest_Lower_below
3435 one_zero ~> carrier_one_zero
3436 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3441 * Nominal datatypes can now contain type-variables.
3443 * Commands 'nominal_inductive' and 'equivariance' work with local
3446 * Nominal primrec can now works with local theory targets and its
3447 specification syntax now conforms to the general format as seen in
3450 * Method "perm_simp" honours the standard simplifier attributes
3451 (no_asm), (no_asm_use) etc.
3453 * The new predicate #* is defined like freshness, except that on the
3454 left hand side can be a set or list of atoms.
3456 * Experimental command 'nominal_inductive2' derives strong induction
3457 principles for inductive definitions. In contrast to
3458 'nominal_inductive', which can only deal with a fixed number of
3459 binders, it can deal with arbitrary expressions standing for sets of
3460 atoms to be avoided. The only inductive definition we have at the
3461 moment that needs this generalisation is the typing rule for Lets in
3464 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3465 -----------------------------------------------------------------
3466 Gamma |- Let x be t1 in t2 : T2
3468 In this rule one wants to avoid all the binders that are introduced by
3469 "close Gamma T1". We are looking for other examples where this
3470 feature might be useful. Please let us know.
3475 * Reimplemented the simplification procedure for proving continuity
3476 subgoals. The new simproc is extensible; users can declare additional
3477 continuity introduction rules with the attribute [cont2cont].
3479 * The continuity simproc now uses a different introduction rule for
3480 solving continuity subgoals on terms with lambda abstractions. In
3481 some rare cases the new simproc may fail to solve subgoals that the
3482 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3483 Potential INCOMPATIBILITY.
3485 * Command 'fixrec': specification syntax now conforms to the general
3486 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3487 examples. INCOMPATIBILITY.
3492 * Proof of Zorn's Lemma for partial orders.
3497 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3498 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3499 depends on multithreading, so timouts will not work before Poly/ML
3502 * High-level support for concurrent ML programming, see
3503 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3504 particularly convenient to organize independent functional
3505 computations. The concept of "synchronized variables" provides a
3506 higher-order interface for components with shared state, avoiding the
3507 delicate details of mutexes and condition variables. (Requires
3508 Poly/ML 5.2.1 or later.)
3510 * ML bindings produced via Isar commands are stored within the Isar
3511 context (theory or proof). Consequently, commands like 'use' and 'ML'
3512 become thread-safe and work with undo as expected (concerning
3513 top-level bindings, not side-effects on global references).
3514 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3515 compiler at runtime; really global bindings need to be given outside a
3516 theory. (Requires Poly/ML 5.2 or later.)
3518 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3519 context. Top-level ML bindings are stored within the proof context in
3520 a purely sequential fashion, disregarding the nested proof structure.
3521 ML bindings introduced by 'ML_prf' are discarded at the end of the
3522 proof. (Requires Poly/ML 5.2 or later.)
3524 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3525 and Method.setup, as well as Isar commands 'attribute_setup' and
3526 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3527 existing code accordingly, or use plain 'setup' together with old
3530 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3531 to 'a -> thm, while results are always tagged with an authentic oracle
3532 name. The Isar command 'oracle' is now polymorphic, no argument type
3533 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3534 accordingly. Note that extra performance may be gained by producing
3535 the cterm carefully, avoiding slow Thm.cterm_of.
3537 * Simplified interface for defining document antiquotations via
3538 ThyOutput.antiquotation, ThyOutput.output, and optionally
3539 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3540 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3543 * More systematic treatment of long names, abstract name bindings, and
3544 name space operations. Basic operations on qualified names have been
3545 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3546 Long_Name.append. Old type bstring has been mostly replaced by
3547 abstract type binding (see structure Binding), which supports precise
3548 qualification by packages and local theory targets, as well as proper
3549 tracking of source positions. INCOMPATIBILITY, need to wrap old
3550 bstring values into Binding.name, or better pass through abstract
3551 bindings everywhere. See further src/Pure/General/long_name.ML,
3552 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3554 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3555 LocalTheory.note etc.) now refer to the *full* internal name, not the
3556 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3558 * Disposed old type and term read functions (Sign.read_def_typ,
3559 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3560 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3561 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3562 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3563 resort for legacy applications.
3565 * Disposed old declarations, tactics, tactic combinators that refer to
3566 the simpset or claset of an implicit theory (such as Addsimps,
3567 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3568 embedded ML text, or local_simpset_of with a proper context passed as
3569 explicit runtime argument.
3571 * Rules and tactics that read instantiations (read_instantiate,
3572 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3573 context, which is required for parsing and type-checking. Moreover,
3574 the variables are specified as plain indexnames, not string encodings
3575 thereof. INCOMPATIBILITY.
3577 * Generic Toplevel.add_hook interface allows to analyze the result of
3578 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3579 for theorem dependency output of transactions resulting in a new
3582 * ML antiquotations: block-structured compilation context indicated by
3583 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3585 @{binding name} - basic name binding
3586 @{let ?pat = term} - term abbreviation (HO matching)
3587 @{note name = fact} - fact abbreviation
3588 @{thm fact} - singleton fact (with attributes)
3589 @{thms fact} - general fact (with attributes)
3590 @{lemma prop by method} - singleton goal
3591 @{lemma prop by meth1 meth2} - singleton goal
3592 @{lemma prop1 ... propN by method} - general goal
3593 @{lemma prop1 ... propN by meth1 meth2} - general goal
3594 @{lemma (open) ...} - open derivation
3599 * The Isabelle "emacs" tool provides a specific interface to invoke
3600 Proof General / Emacs, with more explicit failure if that is not
3601 installed (the old isabelle-interface script silently falls back on
3602 isabelle-process). The PROOFGENERAL_HOME setting determines the
3603 installation location of the Proof General distribution.
3605 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3606 the Isabelle process into a JVM/Scala application. See
3607 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3608 process wrapper has been discontinued.)
3610 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3612 * Various status messages (with exact source position information) are
3613 emitted, if proper markup print mode is enabled. This allows
3614 user-interface components to provide detailed feedback on internal
3619 New in Isabelle2008 (June 2008)
3620 -------------------------------
3624 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3625 and updated, with formally checked references as hyperlinks.
3627 * Theory loader: use_thy (and similar operations) no longer set the
3628 implicit ML context, which was occasionally hard to predict and in
3629 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3630 provides a proper context already.
3632 * Theory loader: old-style ML proof scripts being *attached* to a thy
3633 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3634 'use' within a theory file will do the job.
3636 * Name space merge now observes canonical order, i.e. the second space
3637 is inserted into the first one, while existing entries in the first
3638 space take precedence. INCOMPATIBILITY in rare situations, may try to
3639 swap theory imports.
3641 * Syntax: symbol \<chi> is now considered a letter. Potential
3642 INCOMPATIBILITY in identifier syntax etc.
3644 * Outer syntax: string tokens no longer admit escaped white space,
3645 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3646 white space without escapes.
3648 * Outer syntax: string tokens may contain arbitrary character codes
3649 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3655 * Context-dependent token translations. Default setup reverts locally
3656 fixed variables, and adds hilite markup for undeclared frees.
3658 * Unused theorems can be found using the new command 'unused_thms'.
3659 There are three ways of invoking it:
3662 Only finds unused theorems in the current theory.
3664 (2) unused_thms thy_1 ... thy_n -
3665 Finds unused theorems in the current theory and all of its ancestors,
3666 excluding the theories thy_1 ... thy_n and all of their ancestors.
3668 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3669 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3670 their ancestors, excluding the theories thy_1 ... thy_n and all of
3673 In order to increase the readability of the list produced by
3674 unused_thms, theorems that have been created by a particular instance
3675 of a theory command such as 'inductive' or 'function' are considered
3676 to belong to the same "group", meaning that if at least one theorem in
3677 this group is used, the other theorems in the same group are no longer
3678 reported as unused. Moreover, if all theorems in the group are
3679 unused, only one theorem in the group is displayed.
3681 Note that proof objects have to be switched on in order for
3682 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3683 usually the case when using Proof General with the default settings).
3685 * Authentic naming of facts disallows ad-hoc overwriting of previous
3686 theorems within the same name space. INCOMPATIBILITY, need to remove
3687 duplicate fact bindings, or even accidental fact duplications. Note
3688 that tools may maintain dynamically scoped facts systematically, using
3689 PureThy.add_thms_dynamic.
3691 * Command 'hide' now allows to hide from "fact" name space as well.
3693 * Eliminated destructive theorem database, simpset, claset, and
3694 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3695 update of theories within ML code.
3697 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3698 INCOMPATIBILITY, object-logics depending on former Pure require
3699 additional setup PureThy.old_appl_syntax_setup; object-logics
3700 depending on former CPure need to refer to Pure.
3702 * Commands 'use' and 'ML' are now purely functional, operating on
3703 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3704 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3707 * Command 'setup': discontinued implicit version with ML reference.
3709 * Instantiation target allows for simultaneous specification of class
3710 instance operations together with an instantiation proof.
3711 Type-checking phase allows to refer to class operations uniformly.
3712 See src/HOL/Complex/Complex.thy for an Isar example and
3713 src/HOL/Library/Eval.thy for an ML example.
3715 * Indexing of literal facts: be more serious about including only
3716 facts from the visible specification/proof context, but not the
3717 background context (locale etc.). Affects `prop` notation and method
3718 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3721 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3722 "(open)" option, which used to expose internal bound variables to the
3725 * Isar statements: removed obsolete case "rule_context".
3726 INCOMPATIBILITY, better use explicit fixes/assumes.
3728 * Locale proofs: default proof step now includes 'unfold_locales';
3729 hence 'proof' without argument may be used to unfold locale
3733 *** Document preparation ***
3735 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3736 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3737 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3738 spot); renamed link color from "darkblue" to "linkcolor" (default
3739 value unchanged, can be redefined via \definecolor); no longer sets
3740 "a4paper" option (unnecessary or even intrusive).
3742 * Antiquotation @{lemma A method} proves proposition A by the given
3743 method (either a method name or a method name plus (optional) method
3744 arguments in parentheses) and prints A just like @{prop A}.
3749 * New primrec package. Specification syntax conforms in style to
3750 definition/function/.... No separate induction rule is provided. The
3751 "primrec" command distinguishes old-style and new-style specifications
3752 by syntax. The former primrec package is now named OldPrimrecPackage.
3753 When adjusting theories, beware: constants stemming from new-style
3754 primrec specifications have authentic syntax.
3756 * Metis prover is now an order of magnitude faster, and also works
3757 with multithreading.
3759 * Metis: the maximum number of clauses that can be produced from a
3760 theorem is now given by the attribute max_clauses. Theorems that
3761 exceed this number are ignored, with a warning printed.
3763 * Sledgehammer no longer produces structured proofs by default. To
3764 enable, declare [[sledgehammer_full = true]]. Attributes
3765 reconstruction_modulus, reconstruction_sorts renamed
3766 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3768 * Method "induct_scheme" derives user-specified induction rules
3769 from well-founded induction and completeness of patterns. This factors
3770 out some operations that are done internally by the function package
3771 and makes them available separately. See
3772 src/HOL/ex/Induction_Scheme.thy for examples.
3774 * More flexible generation of measure functions for termination
3775 proofs: Measure functions can be declared by proving a rule of the
3776 form "is_measure f" and giving it the [measure_function] attribute.
3777 The "is_measure" predicate is logically meaningless (always true), and
3778 just guides the heuristic. To find suitable measure functions, the
3779 termination prover sets up the goal "is_measure ?f" of the appropriate
3780 type and generates all solutions by prolog-style backwards proof using
3783 This setup also deals with rules like
3785 "is_measure f ==> is_measure (list_size f)"
3787 which accommodates nested datatypes that recurse through lists.
3788 Similar rules are predeclared for products and option types.
3790 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3794 - Definitions of overloaded constants on sets have to be replaced by
3795 definitions on => and bool.
3797 - Some definitions of overloaded operators on sets can now be proved
3798 using the definitions of the operators on => and bool. Therefore,
3799 the following theorems have been renamed:
3801 subset_def -> subset_eq
3802 psubset_def -> psubset_eq
3803 set_diff_def -> set_diff_eq
3804 Compl_def -> Compl_eq
3805 Sup_set_def -> Sup_set_eq
3806 Inf_set_def -> Inf_set_eq
3807 sup_set_def -> sup_set_eq
3808 inf_set_def -> inf_set_eq
3810 - Due to the incompleteness of the HO unification algorithm, some
3811 rules such as subst may require manual instantiation, if some of
3812 the unknowns in the rule is a set.
3814 - Higher order unification and forward proofs:
3817 have "P (S::'a set)" <...>
3818 then have "EX S. P S" ..
3820 no longer works (due to the incompleteness of the HO unification
3821 algorithm) and must be replaced by the pattern
3828 - Calculational reasoning with subst (or similar rules):
3831 have "P (S::'a set)" <...>
3832 also have "S = T" <...>
3833 finally have "P T" .
3835 no longer works (for similar reasons as the previous example) and
3836 must be replaced by something like
3838 have "P (S::'a set)" <...>
3839 moreover have "S = T" <...>
3840 ultimately have "P T" by simp
3842 - Tactics or packages written in ML code:
3843 Code performing pattern matching on types via
3845 Type ("set", [T]) => ...
3847 must be rewritten. Moreover, functions like strip_type or
3848 binder_types no longer return the right value when applied to a
3851 T1 => ... => Tn => U => bool
3855 T1 => ... => Tn => U set
3857 * Merged theories Wellfounded_Recursion, Accessible_Part and
3858 Wellfounded_Relations to theory Wellfounded.
3860 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3862 * Class finite no longer treats UNIV as class parameter. Use class
3863 enum from theory Library/Enum instead to achieve a similar effect.
3866 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3867 and "Cons". INCOMPATIBILITY.
3869 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3870 Potential INCOMPATIBILITY.
3872 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3873 injective_fst_snd removed, use split_eta and prod_eqI instead.
3874 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3876 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3877 the same name in theory Orderings:
3887 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3888 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3889 and different variable names.
3891 * Library/Option_ord.thy: Canonical order on option type.
3893 * Library/RBT.thy: Red-black trees, an efficient implementation of
3896 * Library/Countable.thy: Type class for countable types.
3898 * Theory Int: The representation of numerals has changed. The infix
3899 operator BIT and the bit datatype with constructors B0 and B1 have
3900 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3901 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3902 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3905 * Theory Nat: definition of <= and < on natural numbers no longer
3906 depend on well-founded relations. INCOMPATIBILITY. Definitions
3907 le_def and less_def have disappeared. Consider lemmas not_less
3908 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3910 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3911 (whose purpose mainly is for various fold_set functionals) have been
3912 abandoned in favor of the existing algebraic classes
3913 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3914 lower_semilattice (resp. upper_semilattice) and linorder.
3917 * Theory Transitive_Closure: induct and cases rules now declare proper
3918 case_names ("base" and "step"). INCOMPATIBILITY.
3920 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3921 lattices. The form set-specific version is available as
3922 Inductive.lfp_ordinal_induct_set.
3924 * Renamed theorems "power.simps" to "power_int.simps".
3927 * Class semiring_div provides basic abstract properties of semirings
3928 with division and modulo operations. Subsumes former class dvd_mod.
3930 * Merged theories IntDef, Numeral and IntArith into unified theory
3931 Int. INCOMPATIBILITY.
3933 * Theory Library/Code_Index: type "index" now represents natural
3934 numbers rather than integers. INCOMPATIBILITY.
3936 * New class "uminus" with operation "uminus" (split of from class
3937 "minus" which now only has operation "minus", binary).
3940 * Constants "card", "internal_split", "option_map" now with authentic
3941 syntax. INCOMPATIBILITY.
3943 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3944 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3945 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3946 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3947 Sup_set_def, le_def, less_def, option_map_def now with object
3948 equality. INCOMPATIBILITY.
3950 * Records. Removed K_record, and replaced it by pure lambda term
3951 %x. c. The simplifier setup is now more robust against eta expansion.
3952 INCOMPATIBILITY: in cases explicitly referring to K_record.
3954 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3956 * Library/ListVector: new theory of arithmetic vector operations.
3958 * Library/Order_Relation: new theory of various orderings as sets of
3959 pairs. Defines preorders, partial orders, linear orders and
3960 well-orders on sets and on types.
3965 * Renamed some theories to allow to loading both ZF and HOL in the
3968 Datatype -> Datatype_ZF
3969 Inductive -> Inductive_ZF
3976 INCOMPATIBILITY: ZF theories that import individual theories below
3977 Main might need to be adapted. Regular theory Main is still
3978 available, as trivial extension of Main_ZF.
3983 * ML within Isar: antiquotation @{const name} or @{const
3984 name(typargs)} produces statically-checked Const term.
3986 * Functor NamedThmsFun: data is available to the user as dynamic fact
3987 (of the same name). Removed obsolete print command.
3989 * Removed obsolete "use_legacy_bindings" function.
3991 * The ``print mode'' is now a thread-local value derived from a global
3992 template (the former print_mode reference), thus access becomes
3993 non-critical. The global print_mode reference is for session
3994 management only; user-code should use print_mode_value,
3995 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3997 * Functions system/system_out provide a robust way to invoke external
3998 shell commands, with propagation of interrupts (requires Poly/ML
3999 5.2.1). Do not use OS.Process.system etc. from the basis library!
4004 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4005 in accordance with Proof General 3.7, which prefers GNU emacs.
4007 * isatool tty runs Isabelle process with plain tty interaction;
4008 optional line editor may be specified via ISABELLE_LINE_EDITOR
4009 setting, the default settings attempt to locate "ledit" and "rlwrap".
4011 * isatool browser now works with Cygwin as well, using general
4012 "javapath" function defined in Isabelle process environment.
4014 * YXML notation provides a simple and efficient alternative to
4015 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4016 isatool yxml as described in the Isabelle system manual.
4018 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4019 provides general wrapper for managing an Isabelle process in a robust
4020 fashion, with ``cooked'' output from stdin/stderr.
4022 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4023 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4025 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4026 way of changing the user's settings is via
4027 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4030 * Multithreading.max_threads := 0 refers to the number of actual CPU
4031 cores of the underlying machine, which is a good starting point for
4032 optimal performance tuning. The corresponding usedir option -M allows
4033 "max" as an alias for "0". WARNING: does not work on certain versions
4034 of Mac OS (with Poly/ML 5.1).
4036 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4037 adverse effect of Isabelle flooding interactive front-ends (notably
4038 ProofGeneral / XEmacs).
4042 New in Isabelle2007 (November 2007)
4043 -----------------------------------
4047 * More uniform information about legacy features, notably a
4048 warning/error of "Legacy feature: ...", depending on the state of the
4049 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4050 legacy features will disappear eventually.
4052 * Theory syntax: the header format ``theory A = B + C:'' has been
4053 discontinued in favour of ``theory A imports B C begin''. Use isatool
4054 fixheaders to convert existing theory files. INCOMPATIBILITY.
4056 * Theory syntax: the old non-Isar theory file format has been
4057 discontinued altogether. Note that ML proof scripts may still be used
4058 with Isar theories; migration is usually quite simple with the ML
4059 function use_legacy_bindings. INCOMPATIBILITY.
4061 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4062 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4065 * Theory loader: be more serious about observing the static theory
4066 header specifications (including optional directories), but not the
4067 accidental file locations of previously successful loads. The strict
4068 update policy of former update_thy is now already performed by
4069 use_thy, so the former has been removed; use_thys updates several
4070 theories simultaneously, just as 'imports' within a theory header
4071 specification, but without merging the results. Potential
4072 INCOMPATIBILITY: may need to refine theory headers and commands
4073 ROOT.ML which depend on load order.
4075 * Theory loader: optional support for content-based file
4076 identification, instead of the traditional scheme of full physical
4077 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4078 (cf. the system manual). The new scheme allows to work with
4079 non-finished theories in persistent session images, such that source
4080 files may be moved later on without requiring reloads.
4082 * Theory loader: old-style ML proof scripts being *attached* to a thy
4083 file (with the same base name as the theory) are considered a legacy
4084 feature, which will disappear eventually. Even now, the theory loader
4085 no longer maintains dependencies on such files.
4087 * Syntax: the scope for resolving ambiguities via type-inference is
4088 now limited to individual terms, instead of whole simultaneous
4089 specifications as before. This greatly reduces the complexity of the
4090 syntax module and improves flexibility by separating parsing and
4091 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4092 'fixes' etc.) are required in rare situations.
4094 * Syntax: constants introduced by new-style packages ('definition',
4095 'abbreviation' etc.) are passed through the syntax module in
4096 ``authentic mode''. This means that associated mixfix annotations
4097 really stick to such constants, independently of potential name space
4098 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4099 trees are represented slightly differently, may need to adapt syntax
4100 translations accordingly. Use CONST marker in 'translations' and
4101 @{const_syntax} antiquotation in 'parse_translation' etc.
4103 * Legacy goal package: reduced interface to the bare minimum required
4104 to keep existing proof scripts running. Most other user-level
4105 functions are now part of the OldGoals structure, which is *not* open
4106 by default (consider isatool expandshort before open OldGoals).
4107 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4108 these tend to cause confusion about the actual goal (!) context being
4109 used here, which is not necessarily the same as the_context().
4111 * Command 'find_theorems': supports "*" wild-card in "name:"
4112 criterion; "with_dups" option. Certain ProofGeneral versions might
4113 support a specific search form (see ProofGeneral/CHANGES).
4115 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4116 by default, which means that "prems" (and also "fixed variables") are
4117 suppressed from proof state output. Note that the ProofGeneral
4118 settings mechanism allows to change and save options persistently, but
4119 older versions of Isabelle will fail to start up if a negative prems
4122 * Local theory targets may be specified by non-nested blocks of
4123 ``context/locale/class ... begin'' followed by ``end''. The body may
4124 contain definitions, theorems etc., including any derived mechanism
4125 that has been implemented on top of these primitives. This concept
4126 generalizes the existing ``theorem (in ...)'' towards more versatility
4129 * Proof General interface: proper undo of final 'end' command;
4130 discontinued Isabelle/classic mode (ML proof scripts).
4133 *** Document preparation ***
4135 * Added antiquotation @{theory name} which prints the given name,
4136 after checking that it refers to a valid ancestor theory in the
4139 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4140 check the given source text as ML type/structure, printing verbatim.
4142 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4143 "c args == rhs" given in the current context. (Any number of
4144 arguments may be given on the LHS.)
4149 * The 'class' package offers a combination of axclass and locale to
4150 achieve Haskell-like type classes in Isabelle. Definitions and
4151 theorems within a class context produce both relative results (with
4152 implicit parameters according to the locale context), and polymorphic
4153 constants with qualified polymorphism (according to the class
4154 context). Within the body context of a 'class' target, a separate
4155 syntax layer ("user space type system") takes care of converting
4156 between global polymorphic consts and internal locale representation.
4157 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4158 "isatool doc classes" provides a tutorial.
4160 * Generic code generator framework allows to generate executable
4161 code for ML and Haskell (including Isabelle classes). A short usage
4164 internal compilation:
4165 export_code <list of constants (term syntax)> in SML
4166 writing SML code to a file:
4167 export_code <list of constants (term syntax)> in SML <filename>
4168 writing OCaml code to a file:
4169 export_code <list of constants (term syntax)> in OCaml <filename>
4170 writing Haskell code to a bunch of files:
4171 export_code <list of constants (term syntax)> in Haskell <filename>
4173 evaluating closed propositions to True/False using code generation:
4176 Reasonable default setup of framework in HOL.
4178 Theorem attributs for selecting and transforming function equations theorems:
4180 [code fun]: select a theorem as function equation for a specific constant
4181 [code fun del]: deselect a theorem as function equation for a specific constant
4182 [code inline]: select an equation theorem for unfolding (inlining) in place
4183 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4185 User-defined serializations (target in {SML, OCaml, Haskell}):
4187 code_const <and-list of constants (term syntax)>
4188 {(target) <and-list of const target syntax>}+
4190 code_type <and-list of type constructors>
4191 {(target) <and-list of type target syntax>}+
4193 code_instance <and-list of instances>
4195 where instance ::= <type constructor> :: <class>
4197 code_class <and_list of classes>
4198 {(target) <and-list of class target syntax>}+
4199 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4201 code_instance and code_class only are effective to target Haskell.
4203 For example usage see src/HOL/ex/Codegenerator.thy and
4204 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4205 generation from Isabelle/HOL theories is available via "isatool doc
4208 * Code generator: consts in 'consts_code' Isar commands are now
4209 referred to by usual term syntax (including optional type
4212 * Command 'no_translations' removes translation rules from theory
4215 * Overloaded definitions are now actually checked for acyclic
4216 dependencies. The overloading scheme is slightly more general than
4217 that of Haskell98, although Isabelle does not demand an exact
4218 correspondence to type class and instance declarations.
4219 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4220 exotic versions of overloading -- at the discretion of the user!
4222 Polymorphic constants are represented via type arguments, i.e. the
4223 instantiation that matches an instance against the most general
4224 declaration given in the signature. For example, with the declaration
4225 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4226 as c(nat). Overloading is essentially simultaneous structural
4227 recursion over such type arguments. Incomplete specification patterns
4228 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4229 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4230 Command 'print_theory' outputs the normalized system of recursive
4231 equations, see section "definitions".
4233 * Configuration options are maintained within the theory or proof
4234 context (with name and type bool/int/string), providing a very simple
4235 interface to a poor-man's version of general context data. Tools may
4236 declare options in ML (e.g. using Attrib.config_int) and then refer to
4237 these values using Config.get etc. Users may change options via an
4238 associated attribute of the same name. This form of context
4239 declaration works particularly well with commands 'declare' or
4240 'using', for example ``declare [[foo = 42]]''. Thus it has become
4241 very easy to avoid global references, which would not observe Isar
4242 toplevel undo/redo and fail to work with multithreading.
4244 Various global ML references of Pure and HOL have been turned into
4245 configuration options:
4247 Unify.search_bound unify_search_bound
4248 Unify.trace_bound unify_trace_bound
4249 Unify.trace_simp unify_trace_simp
4250 Unify.trace_types unify_trace_types
4251 Simplifier.simp_depth_limit simp_depth_limit
4252 Blast.depth_limit blast_depth_limit
4253 DatatypeProp.dtK datatype_distinctness_limit
4254 fast_arith_neq_limit fast_arith_neq_limit
4255 fast_arith_split_limit fast_arith_split_limit
4257 * Named collections of theorems may be easily installed as context
4258 data using the functor NamedThmsFun (see also
4259 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4260 attributes; there is also a toplevel print command. This facility is
4261 just a common case of general context data, which is the preferred way
4262 for anything more complex than just a list of facts in canonical
4265 * Isar: command 'declaration' augments a local theory by generic
4266 declaration functions written in ML. This enables arbitrary content
4267 being added to the context, depending on a morphism that tells the
4268 difference of the original declaration context wrt. the application
4269 context encountered later on.
4271 * Isar: proper interfaces for simplification procedures. Command
4272 'simproc_setup' declares named simprocs (with match patterns, and body
4273 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4274 context. ML antiquotation @{simproc name} retrieves named simprocs.
4276 * Isar: an extra pair of brackets around attribute declarations
4277 abbreviates a theorem reference involving an internal dummy fact,
4278 which will be ignored later --- only the effect of the attribute on
4279 the background context will persist. This form of in-place
4280 declarations is particularly useful with commands like 'declare' and
4281 'using', for example ``have A using [[simproc a]] by simp''.
4283 * Isar: method "assumption" (and implicit closing of subproofs) now
4284 takes simple non-atomic goal assumptions into account: after applying
4285 an assumption as a rule the resulting subgoals are solved by atomic
4286 assumption steps. This is particularly useful to finish 'obtain'
4287 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4288 without referring to the original premise "!!x. P x ==> thesis" in the
4289 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4292 * Isar: implicit use of prems from the Isar proof context is
4293 considered a legacy feature. Common applications like ``have A .''
4294 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4295 referencing facts explicitly here improves readability and
4296 maintainability of proof texts.
4298 * Isar: improper proof element 'guess' is like 'obtain', but derives
4299 the obtained context from the course of reasoning! For example:
4301 assume "EX x y. A x & B y" -- "any previous fact"
4302 then guess x and y by clarify
4304 This technique is potentially adventurous, depending on the facts and
4305 proof tools being involved here.
4307 * Isar: known facts from the proof context may be specified as literal
4308 propositions, using ASCII back-quote syntax. This works wherever
4309 named facts used to be allowed so far, in proof commands, proof
4310 methods, attributes etc. Literal facts are retrieved from the context
4311 according to unification of type and term parameters. For example,
4312 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4313 theorems in the current context, then these are valid literal facts:
4314 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4316 There is also a proof method "fact" which does the same composition
4317 for explicit goal states, e.g. the following proof texts coincide with
4318 certain special cases of literal facts:
4320 have "A" by fact == note `A`
4321 have "A ==> B" by fact == note `A ==> B`
4322 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4323 have "P a ==> Q a" by fact == note `P a ==> Q a`
4325 * Isar: ":" (colon) is no longer a symbolic identifier character in
4326 outer syntax. Thus symbolic identifiers may be used without
4327 additional white space in declarations like this: ``assume *: A''.
4329 * Isar: 'print_facts' prints all local facts of the current context,
4330 both named and unnamed ones.
4332 * Isar: 'def' now admits simultaneous definitions, e.g.:
4334 def x == "t" and y == "u"
4336 * Isar: added command 'unfolding', which is structurally similar to
4337 'using', but affects both the goal state and facts by unfolding given
4338 rewrite rules. Thus many occurrences of the 'unfold' method or
4339 'unfolded' attribute may be replaced by first-class proof text.
4341 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4342 and command 'unfolding' now all support object-level equalities
4343 (potentially conditional). The underlying notion of rewrite rule is
4344 analogous to the 'rule_format' attribute, but *not* that of the
4345 Simplifier (which is usually more generous).
4347 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4348 premises of a theorem by n. Useful in conjunction with drule.
4350 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4351 method expression within a sandbox consisting of the first N
4352 sub-goals, which need to exist. For example, ``simp_all [3]''
4353 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4354 simplifies all new goals that emerge from applying rule foo to the
4355 originally first one.
4357 * Isar: schematic goals are no longer restricted to higher-order
4358 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4361 * Isar: the conclusion of a long theorem statement is now either
4362 'shows' (a simultaneous conjunction, as before), or 'obtains'
4363 (essentially a disjunction of cases with local parameters and
4364 assumptions). The latter allows to express general elimination rules
4365 adequately; in this notation common elimination rules look like this:
4367 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4369 obtains x where "P x"
4371 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4375 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4381 The subsequent classical rules even refer to the formal "thesis"
4384 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4387 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4388 obtains "thesis ==> something"
4390 The actual proof of an 'obtains' statement is analogous to that of the
4391 Isar proof element 'obtain', only that there may be several cases.
4392 Optional case names may be specified in parentheses; these will be
4393 available both in the present proof and as annotations in the
4394 resulting rule, for later use with the 'cases' method (cf. attribute
4397 * Isar: the assumptions of a long theorem statement are available as
4398 "assms" fact in the proof context. This is more appropriate than the
4399 (historical) "prems", which refers to all assumptions of the current
4400 context, including those from the target locale, proof body etc.
4402 * Isar: 'print_statement' prints theorems from the current theory or
4403 proof context in long statement form, according to the syntax of a
4406 * Isar: 'obtain' takes an optional case name for the local context
4407 introduction rule (default "that").
4409 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4410 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4413 * Pure: syntax "CONST name" produces a fully internalized constant
4414 according to the current context. This is particularly useful for
4415 syntax translations that should refer to internal constant
4416 representations independently of name spaces.
4418 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4419 instead of "FOO ". This allows multiple binder declarations to coexist
4420 in the same context. INCOMPATIBILITY.
4422 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4423 primitive that also works in a locale context (both for constants and
4424 fixed variables). Type declaration and internal syntactic representation
4425 of given constants retrieved from the context. Likewise, the
4426 'no_notation' command allows to remove given syntax annotations from the
4429 * Isar/locales: new derived specification elements 'axiomatization',
4430 'definition', 'abbreviation', which support type-inference, admit
4431 object-level specifications (equality, equivalence). See also the
4432 isar-ref manual. Examples:
4435 eq (infix "===" 50) where
4436 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4438 definition "f x y = x + y + 1"
4439 definition g where "g x = f x x"
4442 neq (infix "=!=" 50) where
4443 "x =!= y == ~ (x === y)"
4445 These specifications may be also used in a locale context. Then the
4446 constants being introduced depend on certain fixed parameters, and the
4447 constant name is qualified by the locale base name. An internal
4448 abbreviation takes care for convenient input and output, making the
4449 parameters implicit and using the original short name. See also
4450 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4451 entities from a monomorphic theory.
4453 Presently, abbreviations are only available 'in' a target locale, but
4454 not inherited by general import expressions. Also note that
4455 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4456 'translations' in common applications. The "no_abbrevs" print mode
4457 prevents folding of abbreviations in term output.
4459 Concrete syntax is attached to specified constants in internal form,
4460 independently of name spaces. The parse tree representation is
4461 slightly different -- use 'notation' instead of raw 'syntax', and
4462 'translations' with explicit "CONST" markup to accommodate this.
4464 * Pure/Isar: unified syntax for new-style specification mechanisms
4465 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4466 full type inference and dummy patterns ("_"). For example:
4468 definition "K x _ = x"
4470 inductive conj for A B
4471 where "A ==> B ==> conj A B"
4473 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4474 the current context. Print mode "no_abbrevs" prevents inversion of
4475 abbreviations on output.
4477 * Isar/locales: improved parameter handling: use of locales "var" and
4478 "struct" no longer necessary; - parameter renamings are no longer
4479 required to be injective. For example, this allows to define
4480 endomorphisms as locale endom = homom mult mult h.
4482 * Isar/locales: changed the way locales with predicates are defined.
4483 Instead of accumulating the specification, the imported expression is
4484 now an interpretation. INCOMPATIBILITY: different normal form of
4485 locale expressions. In particular, in interpretations of locales with
4486 predicates, goals repesenting already interpreted fragments are not
4487 removed automatically. Use methods `intro_locales' and
4488 `unfold_locales'; see below.
4490 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4491 provide backward reasoning on locales predicates. The methods are
4492 aware of interpretations and discharge corresponding goals.
4493 `intro_locales' is less aggressive then `unfold_locales' and does not
4494 unfold predicates to assumptions.
4496 * Isar/locales: the order in which locale fragments are accumulated
4497 has changed. This enables to override declarations from fragments due
4498 to interpretations -- for example, unwanted simp rules.
4500 * Isar/locales: interpretation in theories and proof contexts has been
4501 extended. One may now specify (and prove) equations, which are
4502 unfolded in interpreted theorems. This is useful for replacing
4503 defined concepts (constants depending on locale parameters) by
4504 concepts already existing in the target context. Example:
4506 interpretation partial_order ["op <= :: [int, int] => bool"]
4507 where "partial_order.less (op <=) (x::int) y = (x < y)"
4509 Typically, the constant `partial_order.less' is created by a
4510 definition specification element in the context of locale
4513 * Method "induct": improved internal context management to support
4514 local fixes and defines on-the-fly. Thus explicit meta-level
4515 connectives !! and ==> are rarely required anymore in inductive goals
4516 (using object-logic connectives for this purpose has been long
4517 obsolete anyway). Common proof patterns are explained in
4518 src/HOL/Induct/Common_Patterns.thy, see also
4519 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4522 * Method "induct": improved handling of simultaneous goals. Instead of
4523 introducing object-level conjunction, the statement is now split into
4524 several conclusions, while the corresponding symbolic cases are nested
4525 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4526 see src/HOL/Induct/Common_Patterns.thy, for example.
4528 * Method "induct": mutual induction rules are now specified as a list
4529 of rule sharing the same induction cases. HOL packages usually provide
4530 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4531 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4532 mutual induction rules differently, i.e. like this:
4534 (induct rule: foo_bar.inducts)
4535 (induct set: foo bar)
4536 (induct pred: foo bar)
4537 (induct type: foo bar)
4539 The ML function ProjectRule.projections turns old-style rules into the
4542 * Method "coinduct": dual of induction, see
4543 src/HOL/Library/Coinductive_List.thy for various examples.
4545 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4546 considered a legacy feature.
4548 * Attribute "symmetric" produces result with standardized schematic
4549 variables (index 0). Potential INCOMPATIBILITY.
4551 * Simplifier: by default the simplifier trace only shows top level
4552 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4553 default. Thus there is less danger of being flooded by the trace. The
4554 trace indicates where parts have been suppressed.
4556 * Provers/classical: removed obsolete classical version of elim_format
4557 attribute; classical elim/dest rules are now treated uniformly when
4558 manipulating the claset.
4560 * Provers/classical: stricter checks to ensure that supplied intro,
4561 dest and elim rules are well-formed; dest and elim rules must have at
4564 * Provers/classical: attributes dest/elim/intro take an optional
4565 weight argument for the rule (just as the Pure versions). Weights are
4566 ignored by automated tools, but determine the search order of single
4569 * Syntax: input syntax now supports dummy variable binding "%_. b",
4570 where the body does not mention the bound variable. Note that dummy
4571 patterns implicitly depend on their context of bounds, which makes
4572 "{_. _}" match any set comprehension as expected. Potential
4573 INCOMPATIBILITY -- parse translations need to cope with syntactic
4574 constant "_idtdummy" in the binding position.
4576 * Syntax: removed obsolete syntactic constant "_K" and its associated
4577 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4578 for example "A -> B" => "Pi A (%_. B)".
4580 * Pure: 'class_deps' command visualizes the subclass relation, using
4581 the graph browser tool.
4583 * Pure: 'print_theory' now suppresses certain internal declarations by
4584 default; use '!' option for full details.
4589 * Method "metis" proves goals by applying the Metis general-purpose
4590 resolution prover (see also http://gilith.com/software/metis/).
4591 Examples are in the directory MetisExamples. WARNING: the
4592 Isabelle/HOL-Metis integration does not yet work properly with
4595 * Command 'sledgehammer' invokes external automatic theorem provers as
4596 background processes. It generates calls to the "metis" method if
4597 successful. These can be pasted into the proof. Users do not have to
4598 wait for the automatic provers to return. WARNING: does not really
4599 work with multi-threading.
4601 * New "auto_quickcheck" feature tests outermost goal statements for
4602 potential counter-examples. Controlled by ML references
4603 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4604 5000 milliseconds). Fails silently if statements is outside of
4605 executable fragment, or any other codgenerator problem occurs.
4607 * New constant "undefined" with axiom "undefined x = undefined".
4609 * Added class "HOL.eq", allowing for code generation with polymorphic
4612 * Some renaming of class constants due to canonical name prefixing in
4613 the new 'class' package:
4615 HOL.abs ~> HOL.abs_class.abs
4616 HOL.divide ~> HOL.divide_class.divide
4617 0 ~> HOL.zero_class.zero
4618 1 ~> HOL.one_class.one
4619 op + ~> HOL.plus_class.plus
4620 op - ~> HOL.minus_class.minus
4621 uminus ~> HOL.minus_class.uminus
4622 op * ~> HOL.times_class.times
4623 op < ~> HOL.ord_class.less
4624 op <= > HOL.ord_class.less_eq
4625 Nat.power ~> Power.power_class.power
4626 Nat.size ~> Nat.size_class.size
4627 Numeral.number_of ~> Numeral.number_class.number_of
4628 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4629 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4630 Orderings.min ~> Orderings.ord_class.min
4631 Orderings.max ~> Orderings.ord_class.max
4632 Divides.op div ~> Divides.div_class.div
4633 Divides.op mod ~> Divides.div_class.mod
4634 Divides.op dvd ~> Divides.div_class.dvd
4636 INCOMPATIBILITY. Adaptions may be required in the following cases:
4638 a) User-defined constants using any of the names "plus", "minus",
4639 "times", "less" or "less_eq". The standard syntax translations for
4640 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4643 b) Variables named "plus", "minus", "times", "less", "less_eq"
4644 INCOMPATIBILITY: use more specific names.
4646 c) Permutative equations (e.g. "a + b = b + a")
4647 Since the change of names also changes the order of terms, permutative
4648 rewrite rules may get applied in a different order. Experience shows
4649 that this is rarely the case (only two adaptions in the whole Isabelle
4650 distribution). INCOMPATIBILITY: rewrite proofs
4652 d) ML code directly refering to constant names
4653 This in general only affects hand-written proof tactics, simprocs and
4654 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4655 Consider using @{const_name} antiquotation.
4657 * New class "default" with associated constant "default".
4659 * Function "sgn" is now overloaded and available on int, real, complex
4660 (and other numeric types), using class "sgn". Two possible defs of
4661 sgn are given as equational assumptions in the classes sgn_if and
4662 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4665 * Locale "partial_order" now unified with class "order" (cf. theory
4666 Orderings), added parameter "less". INCOMPATIBILITY.
4668 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4669 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4670 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4672 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4673 changed order of proof goals in instance proofs.
4675 * The transitivity reasoner for partial and linear orders is set up
4676 for classes "order" and "linorder". Instances of the reasoner are available
4677 in all contexts importing or interpreting the corresponding locales.
4678 Method "order" invokes the reasoner separately; the reasoner
4679 is also integrated with the Simplifier as a solver. Diagnostic
4680 command 'print_orders' shows the available instances of the reasoner
4681 in the current context.
4683 * Localized monotonicity predicate in theory "Orderings"; integrated
4684 lemmas max_of_mono and min_of_mono with this predicate.
4687 * Formulation of theorem "dense" changed slightly due to integration
4688 with new class dense_linear_order.
4690 * Uniform lattice theory development in HOL.
4692 constants "meet" and "join" now named "inf" and "sup"
4693 constant "Meet" now named "Inf"
4695 classes "meet_semilorder" and "join_semilorder" now named
4696 "lower_semilattice" and "upper_semilattice"
4697 class "lorder" now named "lattice"
4698 class "comp_lat" now named "complete_lattice"
4700 Instantiation of lattice classes allows explicit definitions
4701 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4703 INCOMPATIBILITY. Theorem renames:
4705 meet_left_le ~> inf_le1
4706 meet_right_le ~> inf_le2
4707 join_left_le ~> sup_ge1
4708 join_right_le ~> sup_ge2
4709 meet_join_le ~> inf_sup_ord
4712 le_meet ~> le_inf_iff
4713 le_join ~> ge_sup_conv
4714 meet_idempotent ~> inf_idem
4715 join_idempotent ~> sup_idem
4716 meet_comm ~> inf_commute
4717 join_comm ~> sup_commute
4718 meet_leI1 ~> le_infI1
4719 meet_leI2 ~> le_infI2
4720 le_joinI1 ~> le_supI1
4721 le_joinI2 ~> le_supI2
4722 meet_assoc ~> inf_assoc
4723 join_assoc ~> sup_assoc
4724 meet_left_comm ~> inf_left_commute
4725 meet_left_idempotent ~> inf_left_idem
4726 join_left_comm ~> sup_left_commute
4727 join_left_idempotent ~> sup_left_idem
4730 le_def_meet ~> le_iff_inf
4731 le_def_join ~> le_iff_sup
4732 join_absorp2 ~> sup_absorb2
4733 join_absorp1 ~> sup_absorb1
4734 meet_absorp1 ~> inf_absorb1
4735 meet_absorp2 ~> inf_absorb2
4736 meet_join_absorp ~> inf_sup_absorb
4737 join_meet_absorp ~> sup_inf_absorb
4738 distrib_join_le ~> distrib_sup_le
4739 distrib_meet_le ~> distrib_inf_le
4741 add_meet_distrib_left ~> add_inf_distrib_left
4742 add_join_distrib_left ~> add_sup_distrib_left
4743 is_join_neg_meet ~> is_join_neg_inf
4744 is_meet_neg_join ~> is_meet_neg_sup
4745 add_meet_distrib_right ~> add_inf_distrib_right
4746 add_join_distrib_right ~> add_sup_distrib_right
4747 add_meet_join_distribs ~> add_sup_inf_distribs
4748 join_eq_neg_meet ~> sup_eq_neg_inf
4749 meet_eq_neg_join ~> inf_eq_neg_sup
4750 add_eq_meet_join ~> add_eq_inf_sup
4751 meet_0_imp_0 ~> inf_0_imp_0
4752 join_0_imp_0 ~> sup_0_imp_0
4753 meet_0_eq_0 ~> inf_0_eq_0
4754 join_0_eq_0 ~> sup_0_eq_0
4755 neg_meet_eq_join ~> neg_inf_eq_sup
4756 neg_join_eq_meet ~> neg_sup_eq_inf
4757 join_eq_if ~> sup_eq_if
4759 mono_meet ~> mono_inf
4760 mono_join ~> mono_sup
4761 meet_bool_eq ~> inf_bool_eq
4762 join_bool_eq ~> sup_bool_eq
4763 meet_fun_eq ~> inf_fun_eq
4764 join_fun_eq ~> sup_fun_eq
4765 meet_set_eq ~> inf_set_eq
4766 join_set_eq ~> sup_set_eq
4767 meet1_iff ~> inf1_iff
4768 meet2_iff ~> inf2_iff
4777 join1_iff ~> sup1_iff
4778 join2_iff ~> sup2_iff
4788 is_meet_Meet ~> is_meet_Inf
4789 Meet_bool_def ~> Inf_bool_def
4790 Meet_fun_def ~> Inf_fun_def
4791 Meet_greatest ~> Inf_greatest
4792 Meet_lower ~> Inf_lower
4793 Meet_set_def ~> Inf_set_def
4796 Sup_bool_eq ~> Sup_bool_def
4797 Sup_fun_eq ~> Sup_fun_def
4798 Sup_set_eq ~> Sup_set_def
4800 listsp_meetI ~> listsp_infI
4801 listsp_meet_eq ~> listsp_inf_eq
4806 * Added syntactic class "size"; overloaded constant "size" now has
4807 type "'a::size ==> bool"
4809 * Internal reorganisation of `size' of datatypes: size theorems
4810 "foo.size" are no longer subsumed by "foo.simps" (but are still
4811 simplification rules by default!); theorems "prod.size" now named
4814 * Class "div" now inherits from class "times" rather than "type".
4817 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4818 Linorder etc. have disappeared; operations defined in terms of
4819 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4821 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4823 * HOL-Word: New extensive library and type for generic, fixed size
4824 machine words, with arithmetic, bit-wise, shifting and rotating
4825 operations, reflection into int, nat, and bool lists, automation for
4826 linear arithmetic (by automatic reflection into nat or int), including
4827 lemmas on overflow and monotonicity. Instantiated to all appropriate
4828 arithmetic type classes, supporting automatic simplification of
4829 numerals on all operations.
4831 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4833 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4835 * Code generator library theories:
4836 - Code_Integer represents HOL integers by big integer literals in target
4838 - Code_Char represents HOL characters by character literals in target
4840 - Code_Char_chr like Code_Char, but also offers treatment of character
4841 codes; includes Code_Integer.
4842 - Executable_Set allows to generate code for finite sets using lists.
4843 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4845 - Executable_Real implements a subset of real numbers, namly those
4846 representable by rational numbers.
4847 - Efficient_Nat implements natural numbers by integers, which in general will
4848 result in higher efficency; pattern matching with 0/Suc is eliminated;
4849 includes Code_Integer.
4850 - Code_Index provides an additional datatype index which is mapped to
4851 target-language built-in integers.
4852 - Code_Message provides an additional datatype message_string which is isomorphic to
4853 strings; messages are mapped to target-language strings.
4855 * New package for inductive predicates
4857 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4860 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4861 for z_1 :: U_1 and ... and z_n :: U_m
4863 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4866 with full support for type-inference, rather than
4868 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4870 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4871 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4873 inductive "s z_1 ... z_m"
4875 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4878 For backward compatibility, there is a wrapper allowing inductive
4879 sets to be defined with the new package via
4882 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4883 for z_1 :: U_1 and ... and z_n :: U_m
4885 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4891 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4892 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4893 for z_1 :: U_1 and ... and z_n :: U_m
4895 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4896 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4899 if the additional syntax "p ..." is required.
4901 Numerous examples can be found in the subdirectories src/HOL/Auth,
4902 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4906 - Since declaration and definition of inductive sets or predicates
4907 is no longer separated, abbreviations involving the newly
4908 introduced sets or predicates must be specified together with the
4909 introduction rules after the 'where' keyword (see above), rather
4910 than before the actual inductive definition.
4912 - The variables in induction and elimination rules are now
4913 quantified in the order of their occurrence in the introduction
4914 rules, rather than in alphabetical order. Since this may break
4915 some proofs, these proofs either have to be repaired, e.g. by
4916 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4917 statements of the form
4919 case (rule_i a_i_1 ... a_i_{k_i})
4921 or the old order of quantification has to be restored by explicitly adding
4922 meta-level quantifiers in the introduction rules, i.e.
4924 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4926 - The format of the elimination rules is now
4928 p z_1 ... z_m x_1 ... x_n ==>
4929 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4934 (x_1, ..., x_n) : s z_1 ... z_m ==>
4935 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4938 for sets rather than
4940 x : s z_1 ... z_m ==>
4941 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4944 This may require terms in goals to be expanded to n-tuples
4945 (e.g. using case_tac or simplification with the split_paired_all
4946 rule) before the above elimination rule is applicable.
4948 - The elimination or case analysis rules for (mutually) inductive
4949 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4950 list of rules "p_1_..._p_k.elims" is no longer available.
4952 * New package "function"/"fun" for general recursive functions,
4953 supporting mutual and nested recursion, definitions in local contexts,
4954 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4955 for small examples, and the separate tutorial on the function
4956 package. The old recdef "package" is still available as before, but
4957 users are encouraged to use the new package.
4959 * Method "lexicographic_order" automatically synthesizes termination
4960 relations as lexicographic combinations of size measures.
4962 * Case-expressions allow arbitrary constructor-patterns (including
4963 "_") and take their order into account, like in functional
4964 programming. Internally, this is translated into nested
4965 case-expressions; missing cases are added and mapped to the predefined
4966 constant "undefined". In complicated cases printing may no longer show
4967 the original input but the internal form. Lambda-abstractions allow
4968 the same form of pattern matching: "% pat1 => e1 | ..." is an
4969 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4972 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4973 is an abbreviation for "of_nat :: nat => int". The simplification
4974 rules for "of_nat" have been changed to work like "int" did
4975 previously. Potential INCOMPATIBILITY:
4976 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4977 - of_nat_diff and of_nat_mult are no longer default simp rules
4979 * Method "algebra" solves polynomial equations over (semi)rings using
4980 Groebner bases. The (semi)ring structure is defined by locales and the
4981 tool setup depends on that generic context. Installing the method for
4982 a specific type involves instantiating the locale and possibly adding
4983 declarations for computation on the coefficients. The method is
4984 already instantiated for natural numbers and for the axiomatic class
4985 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4986 CALCULEMUS 2007 for the general principles underlying this
4987 architecture of context-aware proof-tools.
4989 * Method "ferrack" implements quantifier elimination over
4990 special-purpose dense linear orders using locales (analogous to
4991 "algebra"). The method is already installed for class
4992 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4995 * Former constant "List.op @" now named "List.append". Use ML
4996 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4997 circumvent possible incompatibilities when working on ML level.
4999 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5001 * New function listsum :: 'a list => 'a for arbitrary monoids.
5002 Special syntax: "SUM x <- xs. f x" (and latex variants)
5004 * New syntax for Haskell-like list comprehension (input only), eg.
5005 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5007 * The special syntax for function "filter" has changed from [x :
5008 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5009 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5011 * [a..b] is now defined for arbitrary linear orders. It used to be
5012 defined on nat only, as an abbreviation for [a..<Suc b]
5015 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5017 * New functions "sorted" and "sort" in src/HOL/List.thy.
5019 * New lemma collection field_simps (an extension of ring_simps) for
5020 manipulating (in)equations involving division. Multiplies with all
5021 denominators that can be proved to be non-zero (in equations) or
5022 positive/negative (in inequations).
5024 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5025 have been improved and renamed to ring_simps, group_simps and
5026 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5027 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5029 * Theory Library/Commutative_Ring: switched from recdef to function
5030 package; constants add, mul, pow now curried. Infix syntax for
5031 algebraic operations.
5033 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5036 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5039 * HOL/records: generalised field-update to take a function on the
5040 field rather than the new value: r(|A := x|) is translated to A_update
5041 (K x) r The K-combinator that is internally used is called K_record.
5042 INCOMPATIBILITY: Usage of the plain update functions has to be
5045 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5046 * x = 0, which are required for a semiring. Richer structures do not
5047 inherit from semiring_0 anymore, because this property is a theorem
5048 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5049 there is more to prove, but this is mostly trivial.
5051 * Class "recpower" is generalized to arbitrary monoids, not just
5052 commutative semirings. INCOMPATIBILITY: may need to incorporate
5053 commutativity or semiring properties additionally.
5055 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5056 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5057 better use 'abbreviation'.
5059 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5061 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5062 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5063 significant changes for setting up numeral syntax for types:
5064 - New constants Numeral.pred and Numeral.succ instead
5065 of former Numeral.bin_pred and Numeral.bin_succ.
5066 - Use integer operations instead of bin_add, bin_mult and so on.
5067 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5068 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5070 See src/HOL/Integ/IntArith.thy for an example setup.
5072 * Command 'normal_form' computes the normal form of a term that may
5073 contain free variables. For example ``normal_form "rev [a, b, c]"''
5074 produces ``[b, c, a]'' (without proof). This command is suitable for
5075 heavy-duty computations because the functions are compiled to ML
5076 first. Correspondingly, a method "normalization" is provided. See
5077 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5079 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5080 25 like -->); output depends on the "iff" print_mode, the default is
5081 "A = B" (with priority 50).
5083 * Relations less (<) and less_eq (<=) are also available on type bool.
5084 Modified syntax to disallow nesting without explicit parentheses,
5085 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5088 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5090 * Relation composition operator "op O" now has precedence 75 and binds
5091 stronger than union and intersection. INCOMPATIBILITY.
5093 * The old set interval syntax "{m..n(}" (and relatives) has been
5094 removed. Use "{m..<n}" (and relatives) instead.
5096 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5097 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5098 ``declare [[simproc del: neq]]''.
5100 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5103 * Theorem Cons_eq_map_conv no longer declared as "simp".
5105 * Theorem setsum_mult renamed to setsum_right_distrib.
5107 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5110 * Reimplemented methods "sat" and "satx", with several improvements:
5111 goals no longer need to be stated as "<prems> ==> False", equivalences
5112 (i.e. "=" on type bool) are handled, variable names of the form
5113 "lit_<n>" are no longer reserved, significant speedup.
5115 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5116 zChaff is still supported as well.
5118 * 'inductive' and 'datatype': provide projections of mutual rules,
5119 bundled as foo_bar.inducts;
5121 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5124 * Library: moved theory Accessible_Part to main HOL.
5126 * Library: added theory Coinductive_List of potentially infinite lists
5127 as greatest fixed-point.
5129 * Library: added theory AssocList which implements (finite) maps as
5132 * Method "evaluation" solves goals (i.e. a boolean expression)
5133 efficiently by compiling it to ML. The goal is "proved" (via an
5134 oracle) if it evaluates to True.
5136 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5137 also when invoked by the simplifier. This results in the Simplifier
5138 being more powerful on arithmetic goals. INCOMPATIBILITY.
5139 Configuration option fast_arith_split_limit=0 recovers the old
5142 * Support for hex (0x20) and binary (0b1001) numerals.
5144 * New method: reify eqs (t), where eqs are equations for an
5145 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5146 parameter, computes a term s::'b and a list xs::'a list and proves the
5147 theorem I xs s = t. This is also known as reification or quoting. The
5148 resulting theorem is applied to the subgoal to substitute t with I xs
5149 s. If t is omitted, the subgoal itself is reified.
5151 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5152 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5153 where f is supposed to be a computable function (in the sense of code
5154 generattion). The method uses reify to compute s and xs as above then
5155 applies corr_thm and uses normalization by evaluation to "prove" f s =
5156 r and finally gets the theorem t = r, which is again applied to the
5157 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5159 * Reflection: Automatic reification now handels binding, an example is
5160 available in src/HOL/ex/ReflectionEx.thy
5162 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5163 command 'statespace' that is similar to 'record', but introduces an
5164 abstract specification based on the locale infrastructure instead of
5165 HOL types. This leads to extra flexibility in composing state spaces,
5166 in particular multiple inheritance and renaming of components.
5171 * Hyperreal: Functions root and sqrt are now defined on negative real
5172 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5173 Nonnegativity side conditions have been removed from many lemmas, so
5174 that more subgoals may now be solved by simplification; potential
5177 * Real: new type classes formalize real normed vector spaces and
5178 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5179 and norm :: 'a => real.
5181 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5182 reals into other types. The overloaded constant Reals :: 'a set is now
5183 defined as range of_real; potential INCOMPATIBILITY.
5185 * Real: proper support for ML code generation, including 'quickcheck'.
5186 Reals are implemented as arbitrary precision rationals.
5188 * Hyperreal: Several constants that previously worked only for the
5189 reals have been generalized, so they now work over arbitrary vector
5190 spaces. Type annotations may need to be added in some cases; potential
5193 Infinitesimal :: ('a::real_normed_vector) star set
5194 HFinite :: ('a::real_normed_vector) star set
5195 HInfinite :: ('a::real_normed_vector) star set
5196 approx :: ('a::real_normed_vector) star => 'a star => bool
5197 monad :: ('a::real_normed_vector) star => 'a star set
5198 galaxy :: ('a::real_normed_vector) star => 'a star set
5199 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5200 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5201 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5202 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5203 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5204 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5205 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5206 sgn :: 'a::real_normed_vector => 'a
5207 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5209 * Complex: Some complex-specific constants are now abbreviations for
5210 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5211 hnorm. Other constants have been entirely removed in favor of the
5212 polymorphic versions (INCOMPATIBILITY):
5216 HInfinite <-- CInfinite
5217 Infinitesimal <-- CInfinitesimal
5220 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5221 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5222 (ns)deriv <-- (ns)cderiv
5227 * Formalisation of ideals and the quotient construction over rings.
5229 * Order and lattice theory no longer based on records.
5232 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5233 greatest_closed. INCOMPATIBILITY.
5235 * Method algebra is now set up via an attribute. For examples see
5236 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5237 of algebraic structures.
5239 * Renamed theory CRing to Ring.
5244 * Substantial, yet incomplete support for nominal datatypes (binding
5245 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5246 src/HOL/Nominal/Examples. Prospective users should consult
5247 http://isabelle.in.tum.de/nominal/
5252 * ML basics: just one true type int, which coincides with IntInf.int
5255 * ML within Isar: antiquotations allow to embed statically-checked
5256 formal entities in the source, referring to the context available at
5257 compile-time. For example:
5259 ML {* @{sort "{zero,one}"} *}
5260 ML {* @{typ "'a => 'b"} *}
5261 ML {* @{term "%x. x"} *}
5262 ML {* @{prop "x == y"} *}
5263 ML {* @{ctyp "'a => 'b"} *}
5264 ML {* @{cterm "%x. x"} *}
5265 ML {* @{cprop "x == y"} *}
5266 ML {* @{thm asm_rl} *}
5267 ML {* @{thms asm_rl} *}
5268 ML {* @{type_name c} *}
5269 ML {* @{type_syntax c} *}
5270 ML {* @{const_name c} *}
5271 ML {* @{const_syntax c} *}
5274 ML {* @{theory Pure} *}
5275 ML {* @{theory_ref} *}
5276 ML {* @{theory_ref Pure} *}
5279 ML {* @{clasimpset} *}
5281 The same works for sources being ``used'' within an Isar context.
5283 * ML in Isar: improved error reporting; extra verbosity with
5284 ML_Context.trace enabled.
5286 * Pure/General/table.ML: the join operations now works via exceptions
5287 DUP/SAME instead of type option. This is simpler in simple cases, and
5288 admits slightly more efficient complex applications.
5290 * Pure: 'advanced' translation functions (parse_translation etc.) now
5291 use Context.generic instead of just theory.
5293 * Pure: datatype Context.generic joins theory/Proof.context and
5294 provides some facilities for code that works in either kind of
5295 context, notably GenericDataFun for uniform theory and proof data.
5297 * Pure: simplified internal attribute type, which is now always
5298 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5299 local (Proof.context) attributes have been discontinued, while
5300 minimizing code duplication. Thm.rule_attribute and
5301 Thm.declaration_attribute build canonical attributes; see also structure
5302 Context for further operations on Context.generic, notably
5303 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5304 declarations and definitions.
5306 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5307 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5308 init only required for impure data. INCOMPATIBILITY: empty really need
5309 to be empty (no dependencies on theory content!)
5311 * Pure/kernel: consts certification ignores sort constraints given in
5312 signature declarations. (This information is not relevant to the
5313 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5314 potential INCOMPATIBILITY.
5316 * Pure: axiomatic type classes are now purely definitional, with
5317 explicit proofs of class axioms and super class relations performed
5318 internally. See Pure/axclass.ML for the main internal interfaces --
5319 notably AxClass.define_class supercedes AxClass.add_axclass, and
5320 AxClass.axiomatize_class/classrel/arity supersede
5321 Sign.add_classes/classrel/arities.
5323 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5324 global/local versions on theory vs. Proof.context have been
5325 discontinued; Attrib.syntax and Method.syntax have been adapted
5326 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5327 attributes, methods, etc.
5329 * Pure: several functions of signature "... -> theory -> theory * ..."
5330 have been reoriented to "... -> theory -> ... * theory" in order to
5331 allow natural usage in combination with the ||>, ||>>, |-> and
5332 fold_map combinators.
5334 * Pure: official theorem names (closed derivations) and additional
5335 comments (tags) are now strictly separate. Name hints -- which are
5336 maintained as tags -- may be attached any time without affecting the
5339 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5340 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5341 achieve the old behaviour.
5343 * Pure: the "Goal" constant is now called "prop", supporting a
5344 slightly more general idea of ``protecting'' meta-level rule
5347 * Pure: Logic.(un)varify only works in a global context, which is now
5348 enforced instead of silently assumed. INCOMPATIBILITY, may use
5349 Logic.legacy_(un)varify as temporary workaround.
5351 * Pure: structure Name provides scalable operations for generating
5352 internal variable names, notably Name.variants etc. This replaces
5353 some popular functions from term.ML:
5355 Term.variant -> Name.variant
5356 Term.variantlist -> Name.variant_list
5357 Term.invent_names -> Name.invent_list
5359 Note that low-level renaming rarely occurs in new code -- operations
5360 from structure Variable are used instead (see below).
5362 * Pure: structure Variable provides fundamental operations for proper
5363 treatment of fixed/schematic variables in a context. For example,
5364 Variable.import introduces fixes for schematics of given facts and
5365 Variable.export reverses the effect (up to renaming) -- this replaces
5366 various freeze_thaw operations.
5368 * Pure: structure Goal provides simple interfaces for
5369 init/conclude/finish and tactical prove operations (replacing former
5370 Tactic.prove). Goal.prove is the canonical way to prove results
5371 within a given context; Goal.prove_global is a degraded version for
5372 theory level goals, including a global Drule.standard. Note that
5373 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5374 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5375 in a locale context).
5377 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5378 and type checking (Syntax.check_term etc.), with common combinations
5379 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5380 which are considered legacy and await removal.
5382 * Pure/Syntax: generic interfaces for type unchecking
5383 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5384 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5385 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5386 available for convenience, but refer to the very same operations using
5387 a mere theory instead of a full context.
5389 * Isar: simplified treatment of user-level errors, using exception
5390 ERROR of string uniformly. Function error now merely raises ERROR,
5391 without any side effect on output channels. The Isar toplevel takes
5392 care of proper display of ERROR exceptions. ML code may use plain
5393 handle/can/try; cat_error may be used to concatenate errors like this:
5395 ... handle ERROR msg => cat_error msg "..."
5397 Toplevel ML code (run directly or through the Isar toplevel) may be
5398 embedded into the Isar toplevel with exception display/debug like
5401 Isar.toplevel (fn () => ...)
5403 INCOMPATIBILITY, removed special transform_error facilities, removed
5404 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5405 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5406 -- use plain ERROR instead.
5408 * Isar: theory setup now has type (theory -> theory), instead of a
5409 list. INCOMPATIBILITY, may use #> to compose setup functions.
5411 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5412 ProofContext.debug/verbose flags.
5414 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5415 theory before entering a proof state. Transactions now always see a
5416 quasi-functional intermediate checkpoint, both in interactive and
5419 * Isar: simplified interfaces for outer syntax. Renamed
5420 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5421 OuterSyntax.add_parsers -- this functionality is now included in
5422 OuterSyntax.command etc. INCOMPATIBILITY.
5424 * Simplifier: the simpset of a running simplification process now
5425 contains a proof context (cf. Simplifier.the_context), which is the
5426 very context that the initial simpset has been retrieved from (by
5427 simpset_of/local_simpset_of). Consequently, all plug-in components
5428 (solver, looper etc.) may depend on arbitrary proof data.
5430 * Simplifier.inherit_context inherits the proof context (plus the
5431 local bounds) of the current simplification process; any simproc
5432 etc. that calls the Simplifier recursively should do this! Removed
5433 former Simplifier.inherit_bounds, which is already included here --
5434 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5435 specify an explicit context using Simplifier.context/theory_context.
5437 * Simplifier/Classical Reasoner: more abstract interfaces
5438 change_simpset/claset for modifying the simpset/claset reference of a
5439 theory; raw versions simpset/claset_ref etc. have been discontinued --
5442 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5448 * settings: the default heap location within ISABELLE_HOME_USER now
5449 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5450 Isabelle installations.
5452 * isabelle-process: option -S (secure mode) disables some critical
5453 operations, notably runtime compilation and evaluation of ML source
5456 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5458 * Support for parallel execution, using native multicore support of
5459 Poly/ML 5.1. The theory loader exploits parallelism when processing
5460 independent theories, according to the given theory header
5461 specifications. The maximum number of worker threads is specified via
5462 usedir option -M or the "max-threads" setting in Proof General. A
5463 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5464 to 6 on a 8-core machine. User-code needs to observe certain
5465 guidelines for thread-safe programming, see appendix A in the Isar
5466 Implementation manual.
5470 New in Isabelle2005 (October 2005)
5471 ----------------------------------
5475 * Theory headers: the new header syntax for Isar theories is
5478 imports <theory1> ... <theoryN>
5479 uses <file1> ... <fileM>
5482 where the 'uses' part is optional. The previous syntax
5484 theory <name> = <theory1> + ... + <theoryN>:
5486 will disappear in the next release. Use isatool fixheaders to convert
5487 existing theory files. Note that there is no change in ancient
5488 non-Isar theories now, but these will disappear soon.
5490 * Theory loader: parent theories can now also be referred to via
5491 relative and absolute paths.
5493 * Command 'find_theorems' searches for a list of criteria instead of a
5494 list of constants. Known criteria are: intro, elim, dest, name:string,
5495 simp:term, and any term. Criteria can be preceded by '-' to select
5496 theorems that do not match. Intro, elim, dest select theorems that
5497 match the current goal, name:s selects theorems whose fully qualified
5498 name contain s, and simp:term selects all simplification rules whose
5499 lhs match term. Any other term is interpreted as pattern and selects
5500 all theorems matching the pattern. Available in ProofGeneral under
5501 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5503 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5505 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5506 matching the current goal as introduction rule and not having "HOL."
5507 in their name (i.e. not being defined in theory HOL).
5509 * Command 'thms_containing' has been discontinued in favour of
5510 'find_theorems'; INCOMPATIBILITY.
5512 * Communication with Proof General is now 8bit clean, which means that
5513 Unicode text in UTF-8 encoding may be used within theory texts (both
5514 formal and informal parts). Cf. option -U of the Isabelle Proof
5515 General interface. Here are some simple examples (cf. src/HOL/ex):
5517 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5518 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5520 * Improved efficiency of the Simplifier and, to a lesser degree, the
5521 Classical Reasoner. Typical big applications run around 2 times
5525 *** Document preparation ***
5527 * Commands 'display_drafts' and 'print_drafts' perform simple output
5528 of raw sources. Only those symbols that do not require additional
5529 LaTeX packages (depending on comments in isabellesym.sty) are
5530 displayed properly, everything else is left verbatim. isatool display
5531 and isatool print are used as front ends (these are subject to the
5532 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5534 * Command tags control specific markup of certain regions of text,
5535 notably folding and hiding. Predefined tags include "theory" (for
5536 theory begin and end), "proof" for proof commands, and "ML" for
5537 commands involving ML code; the additional tags "visible" and
5538 "invisible" are unused by default. Users may give explicit tag
5539 specifications in the text, e.g. ''by %invisible (auto)''. The
5540 interpretation of tags is determined by the LaTeX job during document
5541 preparation: see option -V of isatool usedir, or options -n and -t of
5542 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5545 Several document versions may be produced at the same time via isatool
5546 usedir (the generated index.html will link all of them). Typical
5547 specifications include ''-V document=theory,proof,ML'' to present
5548 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5549 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5550 these parts without any formal replacement text. The Isabelle site
5551 default settings produce ''document'' and ''outline'' versions as
5554 * Several new antiquotations:
5556 @{term_type term} prints a term with its type annotated;
5558 @{typeof term} prints the type of a term;
5560 @{const const} is the same as @{term const}, but checks that the
5561 argument is a known logical constant;
5563 @{term_style style term} and @{thm_style style thm} print a term or
5564 theorem applying a "style" to it
5568 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5569 definitions, equations, inequations etc., 'concl' printing only the
5570 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5571 to print the specified premise. TermStyle.add_style provides an ML
5572 interface for introducing further styles. See also the "LaTeX Sugar"
5573 document practical applications. The ML antiquotation prints
5574 type-checked ML expressions verbatim.
5576 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5577 and 'text' support optional locale specification '(in loc)', which
5578 specifies the default context for interpreting antiquotations. For
5579 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5581 * Option 'locale=NAME' of antiquotations specifies an alternative
5582 context interpreting the subsequent argument. For example: @{thm
5583 [locale=lattice] inf_assoc}.
5585 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5588 * Proper output of antiquotations for theory commands involving a
5589 proof context (such as 'locale' or 'theorem (in loc) ...').
5591 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5592 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5594 * isatool usedir: new option -C (default true) controls whether option
5595 -D should include a copy of the original document directory; -C false
5596 prevents unwanted effects such as copying of administrative CVS data.
5601 * Considerably improved version of 'constdefs' command. Now performs
5602 automatic type-inference of declared constants; additional support for
5603 local structure declarations (cf. locales and HOL records), see also
5604 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5605 sequential dependencies of definitions within a single 'constdefs'
5606 section; moreover, the declared name needs to be an identifier. If
5607 all fails, consider to fall back on 'consts' and 'defs' separately.
5609 * Improved indexed syntax and implicit structures. First of all,
5610 indexed syntax provides a notational device for subscripted
5611 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5612 expressions. Secondly, in a local context with structure
5613 declarations, number indexes \<^sub>n or the empty index (default
5614 number 1) refer to a certain fixed variable implicitly; option
5615 show_structs controls printing of implicit structures. Typical
5616 applications of these concepts involve record types and locales.
5618 * New command 'no_syntax' removes grammar declarations (and
5619 translations) resulting from the given syntax specification, which is
5620 interpreted in the same manner as for the 'syntax' command.
5622 * 'Advanced' translation functions (parse_translation etc.) may depend
5623 on the signature of the theory context being presently used for
5624 parsing/printing, see also isar-ref manual.
5626 * Improved 'oracle' command provides a type-safe interface to turn an
5627 ML expression of type theory -> T -> term into a primitive rule of
5628 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5629 is already included here); see also FOL/ex/IffExample.thy;
5632 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5633 before); "cI" is no longer bound, use "c.intro" instead.
5634 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5635 axclasses vs. locales.
5637 * Improved internal renaming of symbolic identifiers -- attach primes
5638 instead of base 26 numbers.
5640 * New flag show_question_marks controls printing of leading question
5641 marks in schematic variable names.
5643 * In schematic variable names, *any* symbol following \<^isub> or
5644 \<^isup> is now treated as part of the base name. For example, the
5645 following works without printing of awkward ".0" indexes:
5647 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5650 * Inner syntax includes (*(*nested*) comments*).
5652 * Pretty printer now supports unbreakable blocks, specified in mixfix
5653 annotations as "(00...)".
5655 * Clear separation of logical types and nonterminals, where the latter
5656 may only occur in 'syntax' specifications or type abbreviations.
5657 Before that distinction was only partially implemented via type class
5658 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5659 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5660 exotic syntax specifications may require further adaption
5661 (e.g. Cube/Cube.thy).
5663 * Removed obsolete type class "logic", use the top sort {} instead.
5664 Note that non-logical types should be declared as 'nonterminals'
5665 rather than 'types'. INCOMPATIBILITY for new object-logic
5668 * Attributes 'induct' and 'cases': type or set names may now be
5669 locally fixed variables as well.
5671 * Simplifier: can now control the depth to which conditional rewriting
5672 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5675 * Simplifier: simplification procedures may now take the current
5676 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5677 interface), which is very useful for calling the Simplifier
5678 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5679 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5680 low-level mk_simproc no longer applies Logic.varify internally, to
5681 allow for use in a context of fixed variables.
5683 * thin_tac now works even if the assumption being deleted contains !!
5684 or ==>. More generally, erule now works even if the major premise of
5685 the elimination rule contains !! or ==>.
5687 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5689 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5690 from Pure, which contains all common declarations already. Both
5691 theories are defined via plain Isabelle/Isar .thy files.
5692 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5693 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5694 use isatool fixcpure to adapt your theory and ML sources.
5696 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5697 selections of theorems in named facts via index ranges.
5699 * 'print_theorems': in theory mode, really print the difference
5700 wrt. the last state (works for interactive theory development only),
5701 in proof mode print all local facts (cf. 'print_facts');
5703 * 'hide': option '(open)' hides only base names.
5705 * More efficient treatment of intermediate checkpoints in interactive
5708 * Code generator is now invoked via code_module (incremental code
5709 generation) and code_library (modular code generation, ML structures
5710 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5711 must be quoted when used as identifiers.
5713 * New 'value' command for reading, evaluating and printing terms using
5714 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5715 quoted when used as identifier.
5720 * New commands for the interpretation of locale expressions in
5721 theories (1), locales (2) and proof contexts (3). These generate
5722 proof obligations from the expression specification. After the
5723 obligations have been discharged, theorems of the expression are added
5724 to the theory, target locale or proof context. The synopsis of the
5725 commands is a follows:
5727 (1) interpretation expr inst
5728 (2) interpretation target < expr
5729 (3) interpret expr inst
5731 Interpretation in theories and proof contexts require a parameter
5732 instantiation of terms from the current context. This is applied to
5733 specifications and theorems of the interpreted expression.
5734 Interpretation in locales only permits parameter renaming through the
5735 locale expression. Interpretation is smart in that interpretations
5736 that are active already do not occur in proof obligations, neither are
5737 instantiated theorems stored in duplicate. Use 'print_interps' to
5738 inspect active interpretations of a particular locale. For details,
5739 see the Isar Reference manual. Examples can be found in
5740 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5742 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5743 'interpret' instead.
5745 * New context element 'constrains' for adding type constraints to
5748 * Context expressions: renaming of parameters with syntax
5751 * Locale declaration: 'includes' disallowed.
5753 * Proper static binding of attribute syntax -- i.e. types / terms /
5754 facts mentioned as arguments are always those of the locale definition
5755 context, independently of the context of later invocations. Moreover,
5756 locale operations (renaming and type / term instantiation) are applied
5757 to attribute arguments as expected.
5759 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5760 actual attributes; rare situations may require Attrib.attribute to
5761 embed those attributes into Attrib.src that lack concrete syntax.
5762 Attribute implementations need to cooperate properly with the static
5763 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5764 Attrib.XXX_thm etc. already do the right thing without further
5765 intervention. Only unusual applications -- such as "where" or "of"
5766 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5767 on the context and the facts involved -- may have to assign parsed
5768 values to argument tokens explicitly.
5770 * Changed parameter management in theorem generation for long goal
5771 statements with 'includes'. INCOMPATIBILITY: produces a different
5772 theorem statement in rare situations.
5774 * Locale inspection command 'print_locale' omits notes elements. Use
5775 'print_locale!' to have them included in the output.
5780 * Provers/hypsubst.ML: improved version of the subst method, for
5781 single-step rewriting: it now works in bound variable contexts. New is
5782 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5783 rewrite a different subterm than the original subst method, which is
5784 still available as 'simplesubst'.
5786 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5789 * Provers/trancl.ML: new transitivity reasoner for transitive and
5790 reflexive-transitive closure of relations.
5792 * Provers/blast.ML: new reference depth_limit to make blast's depth
5793 limit (previously hard-coded with a value of 20) user-definable.
5795 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5796 is peformed already. Object-logics merely need to finish their
5797 initial simpset configuration as before. INCOMPATIBILITY.
5802 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5805 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5807 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5808 and x-symbol; use option '-m epsilon' to get it actually printed.
5809 Moreover, the mathematically important symbolic identifier \<epsilon>
5810 becomes available as variable, constant etc. INCOMPATIBILITY,
5812 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5813 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5814 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5815 support corresponding Isar calculations.
5817 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5820 * theory SetInterval: changed the syntax for open intervals:
5829 The old syntax is still supported but will disappear in the next
5830 release. For conversion use the following Emacs search and replace
5831 patterns (these are not perfect but work quite well):
5833 {)\([^\.]*\)\.\. -> {\1<\.\.}
5834 \.\.\([^(}]*\)(} -> \.\.<\1}
5836 * Theory Commutative_Ring (in Library): method comm_ring for proving
5837 equalities in commutative rings; method 'algebra' provides a generic
5840 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5841 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5842 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5845 Some new syntax forms are available:
5847 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5848 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5849 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5850 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5852 The latter form "\<Sum>x < k. e" used to be based on a separate
5853 function "Summation", which has been discontinued.
5855 * theory Finite_Set: in structured induction proofs, the insert case
5856 is now 'case (insert x F)' instead of the old counterintuitive 'case
5859 * The 'refute' command has been extended to support a much larger
5860 fragment of HOL, including axiomatic type classes, constdefs and
5861 typedefs, inductive datatypes and recursion.
5863 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5864 Requires zChaff with proof generation to be installed. See
5865 HOL/ex/SAT_Examples.thy for examples.
5867 * Datatype induction via method 'induct' now preserves the name of the
5868 induction variable. For example, when proving P(xs::'a list) by
5869 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5870 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5871 in unstructured proof scripts.
5873 * Reworked implementation of records. Improved scalability for
5874 records with many fields, avoiding performance problems for type
5875 inference. Records are no longer composed of nested field types, but
5876 of nested extension types. Therefore the record type only grows linear
5877 in the number of extensions and not in the number of fields. The
5878 top-level (users) view on records is preserved. Potential
5879 INCOMPATIBILITY only in strange cases, where the theory depends on the
5880 old record representation. The type generated for a record is called
5881 <record_name>_ext_type.
5883 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5884 proofs triggered by a record definition or a simproc (if
5885 quick_and_dirty is enabled). Definitions of large records can take
5888 New simproc record_upd_simproc for simplification of multiple record
5889 updates enabled by default. Moreover, trivial updates are also
5890 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5891 occasionally, since simplification is more powerful by default.
5893 * typedef: proper support for polymorphic sets, which contain extra
5894 type-variables in the term.
5896 * Simplifier: automatically reasons about transitivity chains
5897 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5898 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5899 old proofs break occasionally as simplification may now solve more
5900 goals than previously.
5902 * Simplifier: converts x <= y into x = y if assumption y <= x is
5903 present. Works for all partial orders (class "order"), in particular
5904 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5907 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5908 bound variable or a constant then the let is unfolded. Otherwise
5909 first a is simplified to b, and then f b is simplified to g. If
5910 possible we abstract b from g arriving at "let x = b in h x",
5911 otherwise we unfold the let and arrive at g. The simproc can be
5912 enabled/disabled by the reference use_let_simproc. Potential
5913 INCOMPATIBILITY since simplification is more powerful by default.
5915 * Classical reasoning: the meson method now accepts theorems as arguments.
5917 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5918 jobs to provide advice on the provability of subgoals.
5920 * Theory OrderedGroup and Ring_and_Field: various additions and
5921 improvements to faciliate calculations involving equalities and
5924 The following theorems have been eliminated or modified
5927 abs_eq now named abs_of_nonneg
5928 abs_of_ge_0 now named abs_of_nonneg
5929 abs_minus_eq now named abs_of_nonpos
5930 imp_abs_id now named abs_of_nonneg
5931 imp_abs_neg_id now named abs_of_nonpos
5932 mult_pos now named mult_pos_pos
5933 mult_pos_le now named mult_nonneg_nonneg
5934 mult_pos_neg_le now named mult_nonneg_nonpos
5935 mult_pos_neg2_le now named mult_nonneg_nonpos2
5936 mult_neg now named mult_neg_neg
5937 mult_neg_le now named mult_nonpos_nonpos
5939 * The following lemmas in Ring_and_Field have been added to the simplifier:
5942 not_square_less_zero
5944 The following lemmas have been deleted from Real/RealPow:
5954 * Theory Parity: added rules for simplifying exponents.
5958 The following theorems have been eliminated or modified
5961 list_all_Nil now named list_all.simps(1)
5962 list_all_Cons now named list_all.simps(2)
5963 list_all_conv now named list_all_iff
5964 set_mem_eq now named mem_iff
5966 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5967 asymptotic "big O" calculations. See the notes in BigO.thy.
5972 * Theory RealDef: better support for embedding natural numbers and
5973 integers in the reals.
5975 The following theorems have been eliminated or modified
5978 exp_ge_add_one_self now requires no hypotheses
5979 real_of_int_add reversed direction of equality (use [symmetric])
5980 real_of_int_minus reversed direction of equality (use [symmetric])
5981 real_of_int_diff reversed direction of equality (use [symmetric])
5982 real_of_int_mult reversed direction of equality (use [symmetric])
5984 * Theory RComplete: expanded support for floor and ceiling functions.
5986 * Theory Ln is new, with properties of the natural logarithm
5988 * Hyperreal: There is a new type constructor "star" for making
5989 nonstandard types. The old type names are now type synonyms:
5993 hcomplex = complex star
5995 * Hyperreal: Many groups of similarly-defined constants have been
5996 replaced by polymorphic versions (INCOMPATIBILITY):
5998 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6000 starset <-- starsetNat, starsetC
6001 *s* <-- *sNat*, *sc*
6002 starset_n <-- starsetNat_n, starsetC_n
6003 *sn* <-- *sNatn*, *scn*
6004 InternalSets <-- InternalNatSets, InternalCSets
6006 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6007 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6008 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6009 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6010 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6012 * Hyperreal: Many type-specific theorems have been removed in favor of
6013 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6015 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6016 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6017 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6018 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6019 right_minus <-- hypreal_add_minus
6020 left_minus <-- {hypreal,hcomplex}_add_minus_left
6021 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6022 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6023 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6024 mult_1_right <-- hcomplex_mult_one_right
6025 mult_zero_left <-- hcomplex_mult_zero_left
6026 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6027 right_distrib <-- hypnat_add_mult_distrib2
6028 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6029 right_inverse <-- hypreal_mult_inverse
6030 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6031 order_refl <-- {hypreal,hypnat}_le_refl
6032 order_trans <-- {hypreal,hypnat}_le_trans
6033 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6034 order_less_le <-- {hypreal,hypnat}_less_le
6035 linorder_linear <-- {hypreal,hypnat}_le_linear
6036 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6037 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6038 add_nonneg_nonneg <-- hypreal_le_add_order
6040 * Hyperreal: Separate theorems having to do with type-specific
6041 versions of constants have been merged into theorems that apply to the
6042 new polymorphic constants (INCOMPATIBILITY):
6044 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6045 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6046 STAR_Un <-- {STAR,NatStar,STARC}_Un
6047 STAR_Int <-- {STAR,NatStar,STARC}_Int
6048 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6049 STAR_subset <-- {STAR,NatStar,STARC}_subset
6050 STAR_mem <-- {STAR,NatStar,STARC}_mem
6051 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6052 STAR_diff <-- {STAR,STARC}_diff
6053 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6054 STARC_hcomplex_of_complex}_image_subset
6055 starset_n_Un <-- starset{Nat,C}_n_Un
6056 starset_n_Int <-- starset{Nat,C}_n_Int
6057 starset_n_Compl <-- starset{Nat,C}_n_Compl
6058 starset_n_diff <-- starset{Nat,C}_n_diff
6059 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6060 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6061 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6062 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6063 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6064 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6065 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6066 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6067 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6068 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6069 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6070 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6071 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6072 starfun_diff <-- starfun{C,RC,CR}_diff
6073 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6074 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6075 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6076 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6077 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6078 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6079 starfun_Id <-- starfunC_Id
6080 starfun_approx <-- starfun{Nat,CR}_approx
6081 starfun_capprox <-- starfun{C,RC}_capprox
6082 starfun_abs <-- starfunNat_rabs
6083 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6084 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6085 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6086 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6087 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6088 starfun_add_approx <-- starfunCR_add_approx
6089 starfun_inverse_inverse <-- starfunC_inverse_inverse
6090 starfun_divide <-- starfun{C,CR,RC}_divide
6091 starfun_n <-- starfun{Nat,C}_n
6092 starfun_n_mult <-- starfun{Nat,C}_n_mult
6093 starfun_n_add <-- starfun{Nat,C}_n_add
6094 starfun_n_add_minus <-- starfunNat_n_add_minus
6095 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6096 starfun_n_minus <-- starfun{Nat,C}_n_minus
6097 starfun_n_eq <-- starfun{Nat,C}_n_eq
6099 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6100 star_n_minus <-- {hypreal,hcomplex}_minus
6101 star_n_diff <-- {hypreal,hcomplex}_diff
6102 star_n_mult <-- {hypreal,hcomplex}_mult
6103 star_n_inverse <-- {hypreal,hcomplex}_inverse
6104 star_n_le <-- {hypreal,hypnat}_le
6105 star_n_less <-- {hypreal,hypnat}_less
6106 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6107 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6108 star_n_abs <-- hypreal_hrabs
6109 star_n_divide <-- hcomplex_divide
6111 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6112 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6113 star_of_diff <-- hypreal_of_real_diff
6114 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6115 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6116 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6117 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6118 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6119 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6120 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6121 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6122 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6123 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6124 star_of_number_of <-- {hypreal,hcomplex}_number_of
6125 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6126 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6127 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6128 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6129 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6130 star_of_power <-- hypreal_of_real_power
6131 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6133 * Hyperreal: new method "transfer" that implements the transfer
6134 principle of nonstandard analysis. With a subgoal that mentions
6135 nonstandard types like "'a star", the command "apply transfer"
6136 replaces it with an equivalent one that mentions only standard types.
6137 To be successful, all free variables must have standard types; non-
6138 standard variables must have explicit universal quantifiers.
6140 * Hyperreal: A theory of Taylor series.
6145 * Discontinued special version of 'constdefs' (which used to support
6146 continuous functions) in favor of the general Pure one with full
6149 * New simplification procedure for solving continuity conditions; it
6150 is much faster on terms with many nested lambda abstractions (cubic
6151 instead of exponential time).
6153 * New syntax for domain package: selector names are now optional.
6154 Parentheses should be omitted unless argument is lazy, for example:
6156 domain 'a stream = cons "'a" (lazy "'a stream")
6158 * New command 'fixrec' for defining recursive functions with pattern
6159 matching; defining multiple functions with mutual recursion is also
6160 supported. Patterns may include the constants cpair, spair, up, sinl,
6161 sinr, or any data constructor defined by the domain package. The given
6162 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6163 syntax and examples.
6165 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6166 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6167 but the proof obligation additionally includes an admissibility
6168 requirement. The packages generate instances of class cpo or pcpo,
6169 with continuity and strictness theorems for Rep and Abs.
6171 * HOLCF: Many theorems have been renamed according to a more standard naming
6172 scheme (INCOMPATIBILITY):
6174 foo_inject: "foo$x = foo$y ==> x = y"
6175 foo_eq: "(foo$x = foo$y) = (x = y)"
6176 foo_less: "(foo$x << foo$y) = (x << y)"
6177 foo_strict: "foo$UU = UU"
6178 foo_defined: "... ==> foo$x ~= UU"
6179 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6184 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6185 including the First Isomorphism Theorem (on quotienting by the kernel
6188 * ZF/Simplifier: install second copy of type solver that actually
6189 makes use of TC rules declared to Isar proof contexts (or locales);
6190 the old version is still required for ML proof scripts.
6195 * Converted to Isar theory format; use locales instead of axiomatic
6201 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6204 * Pure/library.ML no longer defines its own option datatype, but uses
6205 that of the SML basis, which has constructors NONE and SOME instead of
6206 None and Some, as well as exception Option.Option instead of OPTION.
6207 The functions the, if_none, is_some, is_none have been adapted
6208 accordingly, while Option.map replaces apsome.
6210 * Pure/library.ML: the exception LIST has been given up in favour of
6211 the standard exceptions Empty and Subscript, as well as
6212 Library.UnequalLengths. Function like Library.hd and Library.tl are
6213 superceded by the standard hd and tl functions etc.
6215 A number of basic list functions are no longer exported to the ML
6216 toplevel, as they are variants of predefined functions. The following
6217 suggests how one can translate existing code:
6219 rev_append xs ys = List.revAppend (xs, ys)
6220 nth_elem (i, xs) = List.nth (xs, i)
6221 last_elem xs = List.last xs
6222 flat xss = List.concat xss
6223 seq fs = List.app fs
6224 partition P xs = List.partition P xs
6225 mapfilter f xs = List.mapPartial f xs
6227 * Pure/library.ML: several combinators for linear functional
6228 transformations, notably reverse application and composition:
6231 (x, y) |-> f f #-> g
6233 * Pure/library.ML: introduced/changed precedence of infix operators:
6235 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6237 infix 3 o oo ooo oooo;
6238 infix 4 ~~ upto downto;
6240 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6243 * Pure/library.ML: natural list combinators fold, fold_rev, and
6244 fold_map support linear functional transformations and nesting. For
6247 fold f [x1, ..., xN] y =
6248 y |> f x1 |> ... |> f xN
6250 (fold o fold) f [xs1, ..., xsN] y =
6251 y |> fold f xs1 |> ... |> fold f xsN
6253 fold f [x1, ..., xN] =
6256 (fold o fold) f [xs1, ..., xsN] =
6257 fold f xs1 #> ... #> fold f xsN
6259 * Pure/library.ML: the following selectors on type 'a option are
6262 the: 'a option -> 'a (*partial*)
6263 these: 'a option -> 'a where 'a = 'b list
6264 the_default: 'a -> 'a option -> 'a
6265 the_list: 'a option -> 'a list
6267 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6268 basic operations for association lists, following natural argument
6269 order; moreover the explicit equality predicate passed here avoids
6270 potentially expensive polymorphic runtime equality checks.
6271 The old functions may be expressed as follows:
6273 assoc = uncurry (AList.lookup (op =))
6274 assocs = these oo AList.lookup (op =)
6275 overwrite = uncurry (AList.update (op =)) o swap
6277 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6279 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6280 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6282 replacing make_keylist and keyfilter (occassionally used)
6285 make_keylist = AList.make
6286 keyfilter = AList.find (op =)
6288 * eq_fst and eq_snd now take explicit equality parameter, thus
6289 avoiding eqtypes. Naive rewrites:
6291 eq_fst = eq_fst (op =)
6292 eq_snd = eq_snd (op =)
6294 * Removed deprecated apl and apr (rarely used).
6297 apl (n, op) =>>= curry op n
6298 apr (op, m) =>>= fn n => op (n, m)
6300 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6301 provides a reasonably efficient light-weight implementation of sets as
6304 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6305 few new operations; existing lookup and update are now curried to
6306 follow natural argument order (for use with fold etc.);
6307 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6309 * Pure/General: output via the Isabelle channels of
6310 writeln/warning/error etc. is now passed through Output.output, with a
6311 hook for arbitrary transformations depending on the print_mode
6312 (cf. Output.add_mode -- the first active mode that provides a output
6313 function wins). Already formatted output may be embedded into further
6314 text via Output.raw; the result of Pretty.string_of/str_of and derived
6315 functions (string_of_term/cterm/thm etc.) is already marked raw to
6316 accommodate easy composition of diagnostic messages etc. Programmers
6317 rarely need to care about Output.output or Output.raw at all, with
6318 some notable exceptions: Output.output is required when bypassing the
6319 standard channels (writeln etc.), or in token translations to produce
6320 properly formatted results; Output.raw is required when capturing
6321 already output material that will eventually be presented to the user
6322 a second time. For the default print mode, both Output.output and
6323 Output.raw have no effect.
6325 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6326 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6327 cumulative results are displayed at the end of a batch session.
6329 * Pure/General: File.sysify_path and File.quote_sysify path have been
6330 replaced by File.platform_path and File.shell_path (with appropriate
6331 hooks). This provides a clean interface for unusual systems where the
6332 internal and external process view of file names are different.
6334 * Pure: more efficient orders for basic syntactic entities: added
6335 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6336 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6337 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6338 orders now -- potential INCOMPATIBILITY for code that depends on a
6339 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6340 Library.sort_strings on result).
6342 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6343 fold_types traverse types/terms from left to right, observing natural
6344 argument order. Supercedes previous foldl_XXX versions, add_frees,
6345 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6347 * Pure: name spaces have been refined, with significant changes of the
6348 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6349 to extern(_table). The plain name entry path is superceded by a
6350 general 'naming' context, which also includes the 'policy' to produce
6351 a fully qualified name and external accesses of a fully qualified
6352 name; NameSpace.extend is superceded by context dependent
6353 Sign.declare_name. Several theory and proof context operations modify
6354 the naming context. Especially note Theory.restore_naming and
6355 ProofContext.restore_naming to get back to a sane state; note that
6356 Theory.add_path is no longer sufficient to recover from
6357 Theory.absolute_path in particular.
6359 * Pure: new flags short_names (default false) and unique_names
6360 (default true) for controlling output of qualified names. If
6361 short_names is set, names are printed unqualified. If unique_names is
6362 reset, the name prefix is reduced to the minimum required to achieve
6363 the original result when interning again, even if there is an overlap
6364 with earlier declarations.
6366 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6367 now 'extend', and 'merge' gets an additional Pretty.pp argument
6368 (useful for printing error messages). INCOMPATIBILITY.
6370 * Pure: major reorganization of the theory context. Type Sign.sg and
6371 Theory.theory are now identified, referring to the universal
6372 Context.theory (see Pure/context.ML). Actual signature and theory
6373 content is managed as theory data. The old code and interfaces were
6374 spread over many files and structures; the new arrangement introduces
6375 considerable INCOMPATIBILITY to gain more clarity:
6377 Context -- theory management operations (name, identity, inclusion,
6378 parents, ancestors, merge, etc.), plus generic theory data;
6380 Sign -- logical signature and syntax operations (declaring consts,
6381 types, etc.), plus certify/read for common entities;
6383 Theory -- logical theory operations (stating axioms, definitions,
6384 oracles), plus a copy of logical signature operations (consts,
6385 types, etc.); also a few basic management operations (Theory.copy,
6388 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6389 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6390 for convenience -- they merely return the theory.
6392 * Pure: type Type.tsig is superceded by theory in most interfaces.
6394 * Pure: the Isar proof context type is already defined early in Pure
6395 as Context.proof (note that ProofContext.context and Proof.context are
6396 aliases, where the latter is the preferred name). This enables other
6397 Isabelle components to refer to that type even before Isar is present.
6399 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6400 typeK, constK, axiomK, oracleK), but provide explicit operations for
6401 any of these kinds. For example, Sign.intern typeK is now
6402 Sign.intern_type, Theory.hide_space Sign.typeK is now
6403 Theory.hide_types. Also note that former
6404 Theory.hide_classes/types/consts are now
6405 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6406 internalize their arguments! INCOMPATIBILITY.
6408 * Pure: get_thm interface (of PureThy and ProofContext) expects
6409 datatype thmref (with constructors Name and NameSelection) instead of
6410 plain string -- INCOMPATIBILITY;
6412 * Pure: cases produced by proof methods specify options, where NONE
6413 means to remove case bindings -- INCOMPATIBILITY in
6416 * Pure: the following operations retrieve axioms or theorems from a
6417 theory node or theory hierarchy, respectively:
6419 Theory.axioms_of: theory -> (string * term) list
6420 Theory.all_axioms_of: theory -> (string * term) list
6421 PureThy.thms_of: theory -> (string * thm) list
6422 PureThy.all_thms_of: theory -> (string * thm) list
6424 * Pure: print_tac now outputs the goal through the trace channel.
6426 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6427 Reference Toplevel.debug (default false) controls detailed printing
6428 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6429 controls execution profiling -- set to 1 for time and 2 for space
6430 (both increase the runtime).
6432 * Isar session: The initial use of ROOT.ML is now always timed,
6433 i.e. the log will show the actual process times, in contrast to the
6434 elapsed wall-clock time that the outer shell wrapper produces.
6436 * Simplifier: improved handling of bound variables (nameless
6437 representation, avoid allocating new strings). Simprocs that invoke
6438 the Simplifier recursively should use Simplifier.inherit_bounds to
6439 avoid local name clashes. Failure to do so produces warnings
6440 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6441 for further details.
6443 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6444 bindings for all theorems stored within a given theory; this may help
6445 in porting non-Isar theories to Isar ones, while keeping ML proof
6446 scripts for the time being.
6448 * ML operator HTML.with_charset specifies the charset begin used for
6449 generated HTML files. For example:
6451 HTML.with_charset "utf-8" use_thy "Hebrew";
6452 HTML.with_charset "utf-8" use_thy "Chinese";
6457 * Allow symlinks to all proper Isabelle executables (Isabelle,
6458 isabelle, isatool etc.).
6460 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6461 isatool doc, isatool mkdir, display_drafts etc.).
6463 * isatool usedir: option -f allows specification of the ML file to be
6464 used by Isabelle; default is ROOT.ML.
6466 * New isatool version outputs the version identifier of the Isabelle
6467 distribution being used.
6469 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6470 (containing Boolean satisfiability problems) into Isabelle/HOL
6475 New in Isabelle2004 (April 2004)
6476 --------------------------------
6480 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6481 Replaces linorder.ML.
6483 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6484 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6485 (\<a>...\<z>), are now considered normal letters, and can therefore
6486 be used anywhere where an ASCII letter (a...zA...Z) has until
6487 now. COMPATIBILITY: This obviously changes the parsing of some
6488 terms, especially where a symbol has been used as a binder, say
6489 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6490 as an identifier. Fix it by inserting a space around former
6491 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6492 existing theory and ML files.
6494 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6496 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6497 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6498 a normal (but invisible) letter. For multiple letter subscripts repeat
6499 \<^isub> like this: x\<^isub>1\<^isub>2.
6501 * Pure: There are now sub-/superscripts that can span more than one
6502 character. Text between \<^bsub> and \<^esub> is set in subscript in
6503 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6504 superscript. The new control characters are not identifier parts.
6506 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6507 content of "..." to the latex file instead of \isacntrl... . The "..."
6508 may consist of any printable characters excluding the end bracket >.
6510 * Pure: Using new Isar command "finalconsts" (or the ML functions
6511 Theory.add_finals or Theory.add_finals_i) it is now possible to
6512 declare constants "final", which prevents their being given a definition
6513 later. It is useful for constants whose behaviour is fixed axiomatically
6514 rather than definitionally, such as the meta-logic connectives.
6516 * Pure: 'instance' now handles general arities with general sorts
6517 (i.e. intersections of classes),
6519 * Presentation: generated HTML now uses a CSS style sheet to make layout
6520 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6521 It can be changed to alter the colors/layout of generated pages.
6526 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6527 cut_tac, subgoal_tac and thin_tac:
6528 - Now understand static (Isar) contexts. As a consequence, users of Isar
6529 locales are no longer forced to write Isar proof scripts.
6530 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6532 - INCOMPATIBILITY: names of variables to be instantiated may no
6533 longer be enclosed in quotes. Instead, precede variable name with `?'.
6534 This is consistent with the instantiation attribute "where".
6536 * Attributes "where" and "of":
6537 - Now take type variables of instantiated theorem into account when reading
6538 the instantiation string. This fixes a bug that caused instantiated
6539 theorems to have too special types in some circumstances.
6540 - "where" permits explicit instantiations of type variables.
6542 * Calculation commands "moreover" and "also" no longer interfere with
6543 current facts ("this"), admitting arbitrary combinations with "then"
6547 - Goal statements involving the context element "includes" no longer
6548 generate theorems with internal delta predicates (those ending on
6549 "_axioms") in the premise.
6550 Resolve particular premise with <locale>.intro to obtain old form.
6551 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6552 specification and "includes" elements in goal statement.
6553 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6554 [intro?] and [elim?] (respectively) by default.
6555 - Experimental command for instantiation of locales in proof contexts:
6556 instantiate <label>[<attrs>]: <loc>
6557 Instantiates locale <loc> and adds all its theorems to the current context
6558 taking into account their attributes. Label and attrs are optional
6559 modifiers, like in theorem declarations. If present, names of
6560 instantiated theorems are qualified with <label>, and the attributes
6561 <attrs> are applied after any attributes these theorems might have already.
6562 If the locale has assumptions, a chained fact of the form
6563 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6564 are derived. The command does not support old-style locales declared
6565 with "locale (open)".
6566 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6568 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6574 * Proof import: new image HOL4 contains the imported library from
6575 the HOL4 system with about 2500 theorems. It is imported by
6576 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6577 can be used like any other Isabelle image. See
6578 HOL/Import/HOL/README for more information.
6581 - Much improved handling of linear and partial orders.
6582 Reasoners for linear and partial orders are set up for type classes
6583 "linorder" and "order" respectively, and are added to the default simpset
6584 as solvers. This means that the simplifier can build transitivity chains
6585 to solve goals from the assumptions.
6586 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6587 of blast or auto after simplification become unnecessary because the goal
6588 is solved by simplification already.
6590 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6591 all proved in axiomatic type classes for semirings, rings and fields.
6594 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6595 now formalized using the Ring_and_Field theory mentioned above.
6596 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6597 than before, because now they are set up once in a generic manner.
6598 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6599 Look for the general versions in Ring_and_Field (and Power if they concern
6602 * Type "rat" of the rational numbers is now available in HOL-Complex.
6605 - Record types are now by default printed with their type abbreviation
6606 instead of the list of all field types. This can be configured via
6607 the reference "print_record_type_abbr".
6608 - Simproc "record_upd_simproc" for simplification of multiple updates added
6609 (not enabled by default).
6610 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6611 EX x. x = sel r to True (not enabled by default).
6612 - Tactic "record_split_simp_tac" to split and simplify records added.
6614 * 'specification' command added, allowing for definition by
6615 specification. There is also an 'ax_specification' command that
6616 introduces the new constants axiomatically.
6618 * arith(_tac) is now able to generate counterexamples for reals as well.
6620 * HOL-Algebra: new locale "ring" for non-commutative rings.
6622 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6623 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6625 * HOL-Matrix: a first theory for matrices in HOL with an application of
6626 matrix theory to linear programming.
6628 * Unions and Intersections:
6629 The latex output syntax of UN and INT has been changed
6630 from "\Union x \in A. B" to "\Union_{x \in A} B"
6631 i.e. the index formulae has become a subscript.
6632 Similarly for "\Union x. B", and for \Inter instead of \Union.
6634 * Unions and Intersections over Intervals:
6635 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6636 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6637 like in normal math, and corresponding versions for < and for intersection.
6639 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6640 lexicographic dictonary ordering has been added as "lexord".
6642 * ML: the legacy theory structures Int and List have been removed. They had
6643 conflicted with ML Basis Library structures having the same names.
6645 * 'refute' command added to search for (finite) countermodels. Only works
6646 for a fragment of HOL. The installation of an external SAT solver is
6647 highly recommended. See "HOL/Refute.thy" for details.
6649 * 'quickcheck' command: Allows to find counterexamples by evaluating
6650 formulae under an assignment of free variables to random values.
6651 In contrast to 'refute', it can deal with inductive datatypes,
6652 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6658 * Streams now come with concatenation and are part of the HOLCF image
6662 New in Isabelle2003 (May 2003)
6663 ------------------------------
6667 * Provers/simplifier:
6669 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6670 Assumptions are now subject to complete mutual simplification,
6671 not just from left to right. The simplifier now preserves
6672 the order of assumptions.
6674 Potential INCOMPATIBILITY:
6676 -- simp sometimes diverges where the old version did
6677 not, e.g. invoking simp on the goal
6679 [| P (f x); y = x; f x = f y |] ==> Q
6681 now gives rise to the infinite reduction sequence
6683 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6685 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6688 -- Tactics combining classical reasoner and simplification (such as auto)
6689 are also affected by this change, because many of them rely on
6690 simp. They may sometimes diverge as well or yield a different numbers
6691 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6692 in case of problems. Sometimes subsequent calls to the classical
6693 reasoner will fail because a preceeding call to the simplifier too
6694 eagerly simplified the goal, e.g. deleted redundant premises.
6696 - The simplifier trace now shows the names of the applied rewrite rules
6698 - You can limit the number of recursive invocations of the simplifier
6699 during conditional rewriting (where the simplifie tries to solve the
6700 conditions before applying the rewrite rule):
6701 ML "simp_depth_limit := n"
6702 where n is an integer. Thus you can force termination where previously
6703 the simplifier would diverge.
6705 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6707 - No longer aborts on failed congruence proof. Instead, the
6708 congruence is ignored.
6710 * Pure: New generic framework for extracting programs from constructive
6711 proofs. See HOL/Extraction.thy for an example instantiation, as well
6712 as HOL/Extraction for some case studies.
6714 * Pure: The main goal of the proof state is no longer shown by default, only
6715 the subgoals. This behaviour is controlled by a new flag.
6716 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6717 (ML: Proof.show_main_goal).
6719 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6720 rules whose conclusion matches subgoal 1:
6721 PG menu: Isabelle/Isar -> Show me -> matching rules
6722 The rules are ordered by how closely they match the subgoal.
6723 In particular, rules that solve a subgoal outright are displayed first
6724 (or rather last, the way they are printed).
6725 (ML: ProofGeneral.print_intros())
6727 * Pure: New flag trace_unify_fail causes unification to print
6728 diagnostic information (PG: in trace buffer) when it fails. This is
6729 useful for figuring out why single step proofs like rule, erule or
6732 * Pure: Locale specifications now produce predicate definitions
6733 according to the body of text (covering assumptions modulo local
6734 definitions); predicate "loc_axioms" covers newly introduced text,
6735 while "loc" is cumulative wrt. all included locale expressions; the
6736 latter view is presented only on export into the global theory
6737 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6738 on the old view without predicates;
6740 * Pure: predefined locales "var" and "struct" are useful for sharing
6741 parameters (as in CASL, for example); just specify something like
6742 ``var x + var y + struct M'' as import;
6744 * Pure: improved thms_containing: proper indexing of facts instead of
6745 raw theorems; check validity of results wrt. current name space;
6746 include local facts of proof configuration (also covers active
6747 locales), cover fixed variables in index; may use "_" in term
6748 specification; an optional limit for the number of printed facts may
6749 be given (the default is 40);
6751 * Pure: disallow duplicate fact bindings within new-style theory files
6754 * Provers: improved induct method: assumptions introduced by case
6755 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6756 the goal statement); "foo" still refers to all facts collectively;
6758 * Provers: the function blast.overloaded has been removed: all constants
6759 are regarded as potentially overloaded, which improves robustness in exchange
6760 for slight decrease in efficiency;
6762 * Provers/linorder: New generic prover for transitivity reasoning over
6763 linear orders. Note: this prover is not efficient!
6765 * Isar: preview of problems to finish 'show' now produce an error
6766 rather than just a warning (in interactive mode);
6773 - Produces a counter example if it cannot prove a goal.
6774 Note that the counter example may be spurious if the goal is not a formula
6775 of quantifier-free linear arithmetic.
6776 In ProofGeneral the counter example appears in the trace buffer.
6778 - Knows about div k and mod k where k is a numeral of type nat or int.
6780 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6781 linear arithmetic fails. This takes account of quantifiers and divisibility.
6782 Presburger arithmetic can also be called explicitly via presburger(_tac).
6784 * simp's arithmetic capabilities have been enhanced a bit: it now
6785 takes ~= in premises into account (by performing a case split);
6787 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6788 are distributed over a sum of terms;
6790 * New tactic "trans_tac" and method "trans" instantiate
6791 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6794 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6795 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6797 * 'typedef' command has new option "open" to suppress the set
6800 * functions Min and Max on finite sets have been introduced (theory
6803 * attribute [symmetric] now works for relations as well; it turns
6804 (x,y) : R^-1 into (y,x) : R, and vice versa;
6806 * induct over a !!-quantified statement (say !!x1..xn):
6807 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6809 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6810 %x. None. Warning: empty_def now refers to the previously hidden definition
6813 * Algebra: formalization of classical algebra. Intended as base for
6814 any algebraic development in Isabelle. Currently covers group theory
6815 (up to Sylow's theorem) and ring theory (Universal Property of
6816 Univariate Polynomials). Contributions welcome;
6818 * GroupTheory: deleted, since its material has been moved to Algebra;
6820 * Complex: new directory of the complex numbers with numeric constants,
6821 nonstandard complex numbers, and some complex analysis, standard and
6822 nonstandard (Jacques Fleuriot);
6824 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6826 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6829 * Real/HahnBanach: updated and adapted to locales;
6831 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6834 * UNITY: added the Meier-Sanders theory of progress sets;
6836 * MicroJava: bytecode verifier and lightweight bytecode verifier
6837 as abstract algorithms, instantiated to the JVM;
6839 * Bali: Java source language formalization. Type system, operational
6840 semantics, axiomatic semantics. Supported language features:
6841 classes, interfaces, objects,virtual methods, static methods,
6842 static/instance fields, arrays, access modifiers, definite
6843 assignment, exceptions.
6848 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6851 * Main ZF: virtually all theories converted to new-style format;
6856 * Pure: Tactic.prove provides sane interface for internal proofs;
6857 omits the infamous "standard" operation, so this is more appropriate
6858 than prove_goalw_cterm in many situations (e.g. in simprocs);
6860 * Pure: improved error reporting of simprocs;
6862 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6866 *** Document preparation ***
6868 * uses \par instead of \\ for line breaks in theory text. This may
6869 shift some page breaks in large documents. To get the old behaviour
6870 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6872 * minimized dependencies of isabelle.sty and isabellesym.sty on
6875 * \<euro> now needs package babel/greek instead of marvosym (which
6878 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6883 New in Isabelle2002 (March 2002)
6884 --------------------------------
6886 *** Document preparation ***
6888 * greatly simplified document preparation setup, including more
6889 graceful interpretation of isatool usedir -i/-d/-D options, and more
6890 instructive isatool mkdir; users should basically be able to get
6891 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6892 users may run a separate document processing stage manually like this:
6893 "isatool usedir -D output HOL Test && isatool document Test/output";
6895 * theory dependency graph may now be incorporated into documents;
6896 isatool usedir -g true will produce session_graph.eps/.pdf for use
6897 with \includegraphics of LaTeX;
6899 * proper spacing of consecutive markup elements, especially text
6900 blocks after section headings;
6902 * support bold style (for single symbols only), input syntax is like
6903 this: "\<^bold>\<alpha>" or "\<^bold>A";
6905 * \<bullet> is now output as bold \cdot by default, which looks much
6906 better in printed text;
6908 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6909 note that these symbols are currently unavailable in Proof General /
6910 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6912 * isatool latex no longer depends on changed TEXINPUTS, instead
6913 isatool document copies the Isabelle style files to the target
6919 * Pure/Provers: improved proof by cases and induction;
6920 - 'case' command admits impromptu naming of parameters (such as
6922 - 'induct' method divinates rule instantiation from the inductive
6923 claim; no longer requires excessive ?P bindings for proper
6924 instantiation of cases;
6925 - 'induct' method properly enumerates all possibilities of set/type
6926 rules; as a consequence facts may be also passed through *type*
6927 rules without further ado;
6928 - 'induct' method now derives symbolic cases from the *rulified*
6929 rule (before it used to rulify cases stemming from the internal
6930 atomized version); this means that the context of a non-atomic
6931 statement becomes is included in the hypothesis, avoiding the
6932 slightly cumbersome show "PROP ?case" form;
6933 - 'induct' may now use elim-style induction rules without chaining
6934 facts, using ``missing'' premises from the goal state; this allows
6935 rules stemming from inductive sets to be applied in unstructured
6936 scripts, while still benefitting from proper handling of non-atomic
6937 statements; NB: major inductive premises need to be put first, all
6938 the rest of the goal is passed through the induction;
6939 - 'induct' proper support for mutual induction involving non-atomic
6940 rule statements (uses the new concept of simultaneous goals, see
6942 - append all possible rule selections, but only use the first
6943 success (no backtracking);
6944 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6945 - undeclared rule case names default to numbers 1, 2, 3, ...;
6946 - added 'print_induct_rules' (covered by help item in recent Proof
6948 - moved induct/cases attributes to Pure, methods to Provers;
6949 - generic method setup instantiated for FOL and HOL;
6951 * Pure: support multiple simultaneous goal statements, for example
6952 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6953 meta-level mechanism, this acts as if several individual goals had
6954 been stated separately; in particular common proof methods need to be
6955 repeated in order to cover all claims; note that a single elimination
6956 step is *not* sufficient to establish the two conjunctions, so this
6959 assume "A & B" then have A and B .. (*".." fails*)
6961 better use "obtain" in situations as above; alternative refer to
6962 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6964 * Pure: proper integration with ``locales''; unlike the original
6965 version by Florian Kammller, Isar locales package high-level proof
6966 contexts rather than raw logical ones (e.g. we admit to include
6967 attributes everywhere); operations on locales include merge and
6968 rename; support for implicit arguments (``structures''); simultaneous
6969 type-inference over imports and text; see also HOL/ex/Locales.thy for
6972 * Pure: the following commands have been ``localized'', supporting a
6973 target locale specification "(in name)": 'lemma', 'theorem',
6974 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6975 stored both within the locale and at the theory level (exported and
6976 qualified by the locale name);
6978 * Pure: theory goals may now be specified in ``long'' form, with
6979 ad-hoc contexts consisting of arbitrary locale elements. for example
6980 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6981 definitions may be given, too); the result is a meta-level rule with
6982 the context elements being discharged in the obvious way;
6984 * Pure: new proof command 'using' allows to augment currently used
6985 facts after a goal statement ('using' is syntactically analogous to
6986 'apply', but acts on the goal's facts only); this allows chained facts
6987 to be separated into parts given before and after a claim, as in
6988 ``from a and b have C using d and e <proof>'';
6990 * Pure: renamed "antecedent" case to "rule_context";
6992 * Pure: new 'judgment' command records explicit information about the
6993 object-logic embedding (used by several tools internally); no longer
6994 use hard-wired "Trueprop";
6996 * Pure: added 'corollary' command;
6998 * Pure: fixed 'token_translation' command;
7000 * Pure: removed obsolete 'exported' attribute;
7002 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7003 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7004 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7006 * Pure: method 'atomize' presents local goal premises as object-level
7007 statements (atomic meta-level propositions); setup controlled via
7008 rewrite rules declarations of 'atomize' attribute; example
7009 application: 'induct' method with proper rule statements in improper
7012 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7013 now consider the syntactic context of assumptions, giving a better
7014 chance to get type-inference of the arguments right (this is
7015 especially important for locales);
7017 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7020 * Pure/obtain: the formal conclusion "thesis", being marked as
7021 ``internal'', may no longer be reference directly in the text;
7022 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7025 * Pure: generic 'sym' attribute which declares a rule both as pure
7026 'elim?' and for the 'symmetric' operation;
7028 * Pure: marginal comments ``--'' may now occur just anywhere in the
7029 text; the fixed correlation with particular command syntax has been
7032 * Pure: new method 'rules' is particularly well-suited for proof
7033 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7034 but often produces more compact proof terms with less detours;
7036 * Pure/Provers/classical: simplified integration with pure rule
7037 attributes and methods; the classical "intro?/elim?/dest?"
7038 declarations coincide with the pure ones; the "rule" method no longer
7039 includes classically swapped intros; "intro" and "elim" methods no
7040 longer pick rules from the context; also got rid of ML declarations
7041 AddXIs/AddXEs/AddXDs; all of this has some potential for
7044 * Provers/classical: attribute 'swapped' produces classical inversions
7045 of introduction rules;
7047 * Provers/simplifier: 'simplified' attribute may refer to explicit
7048 rules instead of full simplifier context; 'iff' attribute handles
7051 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7053 * HOL: 'recdef' now fails on unfinished automated proofs, use
7054 "(permissive)" option to recover old behavior;
7056 * HOL: 'inductive' no longer features separate (collective) attributes
7057 for 'intros' (was found too confusing);
7059 * HOL: properly declared induction rules less_induct and
7065 * HOL: moved over to sane numeral syntax; the new policy is as
7068 - 0 and 1 are polymorphic constants, which are defined on any
7069 numeric type (nat, int, real etc.);
7071 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7072 binary representation internally;
7074 - type nat has special constructor Suc, and generally prefers Suc 0
7075 over 1::nat and Suc (Suc 0) over 2::nat;
7077 This change may cause significant problems of INCOMPATIBILITY; here
7078 are some hints on converting existing sources:
7080 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7081 entities, so expressions involving "-" (unary or binary minus) need
7082 to be spaced properly;
7084 - existing occurrences of "1" may need to be constraint "1::nat" or
7085 even replaced by Suc 0; similar for old "2";
7087 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7089 - remove all special provisions on numerals in proofs;
7091 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7092 representation (depends on bin_arith_simps in the default context);
7094 * HOL: symbolic syntax for x^2 (numeral 2);
7096 * HOL: the class of all HOL types is now called "type" rather than
7097 "term"; INCOMPATIBILITY, need to adapt references to this type class
7098 in axclass/classes, instance/arities, and (usually rare) occurrences
7099 in typings (of consts etc.); internally the class is called
7100 "HOL.type", ML programs should refer to HOLogic.typeS;
7102 * HOL/record package improvements:
7103 - new derived operations "fields" to build a partial record section,
7104 "extend" to promote a fixed record to a record scheme, and
7105 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7106 declared as simp by default;
7107 - shared operations ("more", "fields", etc.) now need to be always
7108 qualified) --- potential INCOMPATIBILITY;
7109 - removed "make_scheme" operations (use "make" with "extend") --
7111 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7112 - provides cases/induct rules for use with corresponding Isar
7113 methods (for concrete records, record schemes, concrete more
7114 parts, and schematic more parts -- in that order);
7115 - internal definitions directly based on a light-weight abstract
7116 theory of product types over typedef rather than datatype;
7118 * HOL: generic code generator for generating executable ML code from
7119 specifications; specific support for HOL constructs such as inductive
7120 datatypes and sets, as well as recursive functions; can be invoked
7121 via 'generate_code' theory section;
7123 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7125 * HOL: consolidated and renamed several theories. In particular:
7126 Ord.thy has been absorbed into HOL.thy
7127 String.thy has been absorbed into List.thy
7129 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7130 (beware of argument permutation!);
7132 * HOL: linorder_less_split superseded by linorder_cases;
7134 * HOL/List: "nodups" renamed to "distinct";
7136 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7137 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7138 - Ex_def has changed, now need to use some_eq_ex
7140 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7141 in this (rare) case use:
7143 delSWrapper "split_all_tac"
7144 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7146 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7149 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7150 Isabelle's type classes, ^ on functions and relations has too general
7151 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7152 necessary to attach explicit type constraints;
7154 * HOL/Relation: the prefix name of the infix "O" has been changed from
7155 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7156 renamed accordingly (eg "compI" -> "rel_compI").
7158 * HOL: syntax translations now work properly with numerals and records
7161 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7162 of "lam" -- INCOMPATIBILITY;
7164 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7165 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7166 renamed "Product_Type.unit";
7168 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7170 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7171 the "cases" method);
7173 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7176 * HOL/IMP: updated and converted to new-style theory format; several
7177 parts turned into readable document, with proper Isar proof texts and
7178 some explanations (by Gerwin Klein);
7180 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7182 * HOL-Hyperreal is now a logic image;
7187 * Isar: consts/constdefs supports mixfix syntax for continuous
7190 * Isar: domain package adapted to new-style theory format, e.g. see
7193 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7194 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7195 lift.induct_tac, always use UU instead of Undef;
7197 * HOLCF/IMP: updated and converted to new-style theory;
7202 * Isar: proper integration of logic-specific tools and packages,
7203 including theory commands '(co)inductive', '(co)datatype',
7204 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7205 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7207 * theory Main no longer includes AC; for the Axiom of Choice, base
7208 your theory on Main_ZFC;
7210 * the integer library now covers quotients and remainders, with many
7211 laws relating division to addition, multiplication, etc.;
7213 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7214 typeless version of the formalism;
7216 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7219 * ZF/Induct: new directory for examples of inductive definitions,
7220 including theory Multiset for multiset orderings; converted to
7221 new-style theory format;
7223 * ZF: many new theorems about lists, ordinals, etc.;
7228 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7229 variable proof controls level of detail: 0 = no proofs (only oracle
7230 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7231 also ref manual for further ML interfaces;
7233 * Pure/axclass: removed obsolete ML interface
7234 goal_subclass/goal_arity;
7236 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7237 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7238 separate tokens, so expressions involving minus need to be spaced
7241 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7242 rather than "infixl" or "infixr";
7244 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7245 sort constraint specifications in type inference; e.g. "x::_::foo"
7246 ensures that the type of "x" is of sort "foo" (but not necessarily a
7249 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7250 control output of nested => (types); the default behavior is
7253 * Pure/syntax: builtin parse translation for "_constify" turns valued
7254 tokens into AST constants;
7256 * Pure/syntax: prefer later declarations of translations and print
7257 translation functions; potential INCOMPATIBILITY: need to reverse
7258 multiple declarations for same syntax element constant;
7260 * Pure/show_hyps reset by default (in accordance to existing Isar
7263 * Provers/classical: renamed addaltern to addafter, addSaltern to
7266 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7269 * system: tested support for MacOS X; should be able to get Isabelle +
7270 Proof General to work in a plain Terminal after installing Poly/ML
7271 (e.g. from the Isabelle distribution area) and GNU bash alone
7272 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7273 support requires further installations, e.g. from
7274 http://fink.sourceforge.net/);
7276 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7278 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7279 of 40 MB), cf. ML_OPTIONS;
7281 * system: Proof General keywords specification is now part of the
7282 Isabelle distribution (see etc/isar-keywords.el);
7284 * system: support for persistent Proof General sessions (refrain from
7285 outdating all loaded theories on startup); user may create writable
7286 logic images like this: ``isabelle -q HOL Test'';
7288 * system: smart selection of Isabelle process versus Isabelle
7289 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7290 run both "isabelle" and "Isabelle" even if file names are badly
7291 damaged (executable inspects the case of the first letter of its own
7292 name); added separate "isabelle-process" and "isabelle-interface";
7294 * system: refrain from any attempt at filtering input streams; no
7295 longer support ``8bit'' encoding of old isabelle font, instead proper
7296 iso-latin characters may now be used; the related isatools
7297 "symbolinput" and "nonascii" have disappeared as well;
7299 * system: removed old "xterm" interface (the print modes "xterm" and
7300 "xterm_color" are still available for direct use in a suitable
7305 New in Isabelle99-2 (February 2001)
7306 -----------------------------------
7308 *** Overview of INCOMPATIBILITIES ***
7310 * HOL: please note that theories in the Library and elsewhere often use the
7311 new-style (Isar) format; to refer to their theorems in an ML script you must
7312 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7314 * HOL: inductive package no longer splits induction rule aggressively,
7315 but only as far as specified by the introductions given; the old
7316 format may be recovered via ML function complete_split_rule or attribute
7317 'split_rule (complete)';
7319 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7320 gfp_Tarski to gfp_unfold;
7322 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7324 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7325 relation); infix "^^" has been renamed "``"; infix "``" has been
7326 renamed "`"; "univalent" has been renamed "single_valued";
7328 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7331 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7333 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7335 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7336 consequence, it is no longer monotonic wrt. the local goal context
7337 (which is now passed through the inductive cases);
7339 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7340 \<gg> to \<ggreater>;
7343 *** Document preparation ***
7345 * \isabellestyle{NAME} selects version of Isabelle output (currently
7346 available: are "it" for near math-mode best-style output, "sl" for
7347 slanted text style, and "tt" for plain type-writer; if no
7348 \isabellestyle command is given, output is according to slanted
7351 * support sub/super scripts (for single symbols only), input syntax is
7352 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7354 * some more standard symbols; see Appendix A of the system manual for
7355 the complete list of symbols defined in isabellesym.sty;
7357 * improved isabelle style files; more abstract symbol implementation
7358 (should now use \isamath{...} and \isatext{...} in custom symbol
7361 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7362 state; Note that presentation of goal states does not conform to
7363 actual human-readable proof documents. Please do not include goal
7364 states into document output unless you really know what you are doing!
7366 * proper indentation of antiquoted output with proportional LaTeX
7369 * no_document ML operator temporarily disables LaTeX document
7372 * isatool unsymbolize tunes sources for plain ASCII communication;
7377 * Pure: Isar now suffers initial goal statements to contain unbound
7378 schematic variables (this does not conform to actual readable proof
7379 documents, due to unpredictable outcome and non-compositional proof
7380 checking); users who know what they are doing may use schematic goals
7381 for Prolog-style synthesis of proven results;
7383 * Pure: assumption method (an implicit finishing) now handles actual
7386 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7387 initial goal, declare "that" only as Pure intro (only for single
7388 steps); the "that" rule assumption may now be involved in implicit
7389 finishing, thus ".." becomes a feasible for trivial obtains;
7391 * Pure: default proof step now includes 'intro_classes'; thus trivial
7392 instance proofs may be performed by "..";
7394 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7397 * Pure: more robust selection of calculational rules;
7399 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7400 rule (as well as the assumption rule);
7402 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7403 lemmas, using the graph browser tool;
7405 * Pure: predict failure of "show" in interactive mode;
7407 * Pure: 'thms_containing' now takes actual terms as arguments;
7409 * HOL: improved method 'induct' --- now handles non-atomic goals
7410 (potential INCOMPATIBILITY); tuned error handling;
7412 * HOL: cases and induct rules now provide explicit hints about the
7413 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7414 any remaining facts are inserted into the goal verbatim;
7416 * HOL: local contexts (aka cases) may now contain term bindings as
7417 well; the 'cases' and 'induct' methods new provide a ?case binding for
7418 the result to be shown in each case;
7420 * HOL: added 'recdef_tc' command;
7422 * isatool convert assists in eliminating legacy ML scripts;
7427 * HOL/Library: a collection of generic theories to be used together
7428 with main HOL; the theory loader path already includes this directory
7429 by default; the following existing theories have been moved here:
7430 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7431 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7433 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7434 modelling and verification task performed in Isabelle/HOL +
7435 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7437 * HOL/Algebra: special summation operator SUM no longer exists, it has
7438 been replaced by setsum; infix 'assoc' now has priority 50 (like
7439 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7440 'domain', this makes the theory consistent with mathematical
7443 * HOL basics: added overloaded operations "inverse" and "divide"
7444 (infix "/"), syntax for generic "abs" operation, generic summation
7447 * HOL/typedef: simplified package, provide more useful rules (see also
7450 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7451 now expressed as a proper nested rule (old-style tactic scripts may
7452 require atomize_strip_tac to cope with non-atomic premises);
7454 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7455 to "split_conv" (old name still available for compatibility);
7457 * HOL: improved concrete syntax for strings (e.g. allows translation
7458 rules with string literals);
7460 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7461 and Fleuriot's mechanization of analysis, including the transcendental
7462 functions for the reals;
7464 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7469 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7470 "lam" is displayed as TWO lambda-symbols
7472 * CTT: theory Main now available, containing everything (that is, Bool
7478 * Pure: the Simplifier has been implemented properly as a derived rule
7479 outside of the actual kernel (at last!); the overall performance
7480 penalty in practical applications is about 50%, while reliability of
7481 the Isabelle inference kernel has been greatly improved;
7483 * print modes "brackets" and "no_brackets" control output of nested =>
7484 (types) and ==> (props); the default behaviour is "brackets";
7486 * Provers: fast_tac (and friends) now handle actual object-logic rules
7487 as assumptions as well;
7489 * system: support Poly/ML 4.0;
7491 * system: isatool install handles KDE version 1 or 2;
7495 New in Isabelle99-1 (October 2000)
7496 ----------------------------------
7498 *** Overview of INCOMPATIBILITIES ***
7500 * HOL: simplification of natural numbers is much changed; to partly
7501 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7502 issue the following ML commands:
7504 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7505 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7507 * HOL: simplification no longer dives into case-expressions; this is
7508 controlled by "t.weak_case_cong" for each datatype t;
7510 * HOL: nat_less_induct renamed to less_induct;
7512 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7513 fixsome to patch .thy and .ML sources automatically;
7515 select_equality -> some_equality
7516 select_eq_Ex -> some_eq_ex
7517 selectI2EX -> someI2_ex
7520 select1_equality -> some1_equality
7521 Eps_sym_eq -> some_sym_eq_trivial
7522 Eps_eq -> some_eq_trivial
7524 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7526 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7529 * HOL: the recursion equations generated by 'recdef' are now called
7530 f.simps instead of f.rules;
7532 * HOL: qed_spec_mp now also handles bounded ALL as well;
7534 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7535 sometimes be needed;
7537 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7539 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7541 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7542 product is now "<*>" instead of "Times"; the lexicographic product is
7543 now "<*lex*>" instead of "**";
7545 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7546 of main HOL, but was unused); better use HOL's datatype package;
7548 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7549 the old syntax may be recovered as follows:
7552 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7553 (infixl "\\<oplus>" 100)
7555 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7557 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7558 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7561 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7562 changed from A/r to A//r;
7564 * ZF: new treatment of arithmetic (nat & int) may break some old
7567 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7568 rulify -> rule_format, elimify -> elim_format, ...);
7570 * Isar/Provers: intro/elim/dest attributes changed; renamed
7571 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7572 should have to change intro!! to intro? only); replaced "delrule" by
7575 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7577 * Provers: strengthened force_tac by using new first_best_tac;
7579 * LaTeX document preparation: several changes of isabelle.sty (see
7583 *** Document preparation ***
7585 * formal comments (text blocks etc.) in new-style theories may now
7586 contain antiquotations of thm/prop/term/typ/text to be presented
7587 according to latex print mode; concrete syntax is like this:
7588 @{term[show_types] "f(x) = a + x"};
7590 * isatool mkdir provides easy setup of Isabelle session directories,
7591 including proper document sources;
7593 * generated LaTeX sources are now deleted after successful run
7594 (isatool document -c); may retain a copy somewhere else via -D option
7597 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7598 style files, achieving self-contained LaTeX sources and simplifying
7601 * old-style theories now produce (crude) LaTeX output as well;
7603 * browser info session directories are now self-contained (may be put
7604 on WWW server seperately); improved graphs of nested sessions; removed
7605 graph for 'all sessions';
7607 * several improvements in isabelle style files; \isabellestyle{it}
7608 produces fake math mode output; \isamarkupheader is now \section by
7609 default; see lib/texinputs/isabelle.sty etc.;
7614 * Isar/Pure: local results and corresponding term bindings are now
7615 subject to Hindley-Milner polymorphism (similar to ML); this
7616 accommodates incremental type-inference very nicely;
7618 * Isar/Pure: new derived language element 'obtain' supports
7619 generalized existence reasoning;
7621 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7622 support accumulation of results, without applying any rules yet;
7623 useful to collect intermediate results without explicit name
7624 references, and for use with transitivity rules with more than 2
7627 * Isar/Pure: scalable support for case-analysis type proofs: new
7628 'case' language element refers to local contexts symbolically, as
7629 produced by certain proof methods; internally, case names are attached
7630 to theorems as "tags";
7632 * Isar/Pure: theory command 'hide' removes declarations from
7633 class/type/const name spaces;
7635 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7636 indicate potential overloading;
7638 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7640 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7641 "{a,b,c}" instead of {a,b,c};
7643 * Isar/Pure now provides its own version of intro/elim/dest
7644 attributes; useful for building new logics, but beware of confusion
7645 with the version in Provers/classical;
7647 * Isar/Pure: the local context of (non-atomic) goals is provided via
7648 case name 'antecedent';
7650 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7651 to the current context is now done automatically);
7653 * Isar/Pure: theory command 'method_setup' provides a simple interface
7654 for definining proof methods in ML;
7656 * Isar/Provers: intro/elim/dest attributes changed; renamed
7657 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7658 most cases, one should have to change intro!! to intro? only);
7659 replaced "delrule" by "rule del";
7661 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7662 'symmetric' attribute (the latter supercedes [RS sym]);
7664 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7665 method modifier); 'simp' method: 'only:' modifier removes loopers as
7666 well (including splits);
7668 * Isar/Provers: Simplifier and Classical methods now support all kind
7669 of modifiers used in the past, including 'cong', 'iff', etc.
7671 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7672 of Simplifier and Classical reasoner);
7674 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7675 now support named cases; major packages (inductive, datatype, primrec,
7676 recdef) support case names and properly name parameters;
7678 * Isar/HOL: new transitivity rules for substitution in inequalities --
7679 monotonicity conditions are extracted to be proven at end of
7682 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7685 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7686 split_if split_if_asm; datatype package provides theorems foo.splits =
7687 foo.split foo.split_asm for each datatype;
7689 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7690 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7691 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7692 use "(cases (simplified))" method in proper proof texts);
7694 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7696 * Isar: names of theorems etc. may be natural numbers as well;
7698 * Isar: 'pr' command: optional arguments for goals_limit and
7699 ProofContext.prems_limit; no longer prints theory contexts, but only
7702 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7703 additional print modes to be specified; e.g. "pr(latex)" will print
7704 proof state according to the Isabelle LaTeX style;
7706 * Isar: improved support for emulating tactic scripts, including proof
7707 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7708 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7709 (for HOL datatypes);
7711 * Isar: simplified (more robust) goal selection of proof methods: 1st
7712 goal, all goals, or explicit goal specifier (tactic emulation); thus
7713 'proof method scripts' have to be in depth-first order;
7715 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7717 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7718 should instead use individual commands for printing items
7719 (print_commands, print_methods etc.);
7721 * Isar: added 'nothing' --- the empty list of theorems;
7726 * HOL/MicroJava: formalization of a fragment of Java, together with a
7727 corresponding virtual machine and a specification of its bytecode
7728 verifier and a lightweight bytecode verifier, including proofs of
7729 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7730 Cornelia Pusch (see also the homepage of project Bali at
7731 http://isabelle.in.tum.de/Bali/);
7733 * HOL/Algebra: new theory of rings and univariate polynomials, by
7736 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7737 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7740 * HOL/Lattice: fundamental concepts of lattice theory and order
7741 structures, including duals, properties of bounds versus algebraic
7742 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7743 Theorem for complete lattices etc.; may also serve as a demonstration
7744 for abstract algebraic reasoning using axiomatic type classes, and
7745 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7747 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7750 * HOL/IMPP: extension of IMP with local variables and mutually
7751 recursive procedures, by David von Oheimb;
7753 * HOL/Lambda: converted into new-style theory and document;
7755 * HOL/ex/Multiquote: example of multiple nested quotations and
7756 anti-quotations -- basically a generalized version of de-Bruijn
7757 representation; very useful in avoiding lifting of operations;
7759 * HOL/record: added general record equality rule to simpset; fixed
7760 select-update simplification procedure to handle extended records as
7761 well; admit "r" as field name;
7763 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7764 other numeric types and also as the identity of groups, rings, etc.;
7766 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7767 Types nat and int belong to this axclass;
7769 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7770 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7771 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7772 two terms #m*u and #n*u are replaced by #(m+n)*u
7773 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7774 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7775 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7777 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7778 powerful prover for predicate logic but knows nothing of clasets; see
7779 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7781 * HOL: new version of "case_tac" subsumes both boolean case split and
7782 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7783 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7785 * HOL: simplification no longer dives into case-expressions: only the
7786 selector expression is simplified, but not the remaining arms; to
7787 enable full simplification of case-expressions for datatype t, you may
7788 remove t.weak_case_cong from the simpset, either globally (Delcongs
7789 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7791 * HOL/recdef: the recursion equations generated by 'recdef' for
7792 function 'f' are now called f.simps instead of f.rules; if all
7793 termination conditions are proved automatically, these simplification
7794 rules are added to the simpset, as in primrec; rules may be named
7795 individually as well, resulting in a separate list of theorems for
7798 * HOL/While is a new theory that provides a while-combinator. It
7799 permits the definition of tail-recursive functions without the
7800 provision of a termination measure. The latter is necessary once the
7801 invariant proof rule for while is applied.
7803 * HOL: new (overloaded) notation for the set of elements below/above
7804 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7806 * HOL: theorems impI, allI, ballI bound as "strip";
7808 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7809 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7810 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7812 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7814 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7815 main HOL, but was unused);
7817 * HOL: fewer consts declared as global (e.g. have to refer to
7818 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7820 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7821 in case of overlap with user translations (e.g. judgements over
7822 tuples); (note that the underlying logical represenation is still
7828 * ZF: simplification automatically cancels common terms in arithmetic
7829 expressions over nat and int;
7831 * ZF: new treatment of nat to minimize type-checking: all operators
7832 coerce their operands to a natural number using the function natify,
7833 making the algebraic laws unconditional;
7835 * ZF: as above, for int: operators coerce their operands to an integer
7836 using the function intify;
7838 * ZF: the integer library now contains many of the usual laws for the
7839 orderings, including $<=, and monotonicity laws for $+ and $*;
7841 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7844 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7845 to the simplifier and classical reasoner simultaneously;
7850 * Provers: blast_tac now handles actual object-logic rules as
7851 assumptions; note that auto_tac uses blast_tac internally as well;
7853 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7854 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7856 * Provers: delrules now handles destruct rules as well (no longer need
7857 explicit make_elim);
7859 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7860 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7861 use instead the strong form,
7862 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7863 in HOL, FOL and ZF the function cla_make_elim will create such rules
7864 from destruct-rules;
7866 * Provers: Simplifier.easy_setup provides a fast path to basic
7867 Simplifier setup for new object-logics;
7869 * Pure: AST translation rules no longer require constant head on LHS;
7871 * Pure: improved name spaces: ambiguous output is qualified; support
7872 for hiding of names;
7874 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7875 XSYMBOL_HOME; no longer need to do manual configuration in most
7878 * system: compression of ML heaps images may now be controlled via -c
7879 option of isabelle and isatool usedir (currently only observed by
7882 * system: isatool installfonts may handle X-Symbol fonts as well (very
7883 useful for remote X11);
7885 * system: provide TAGS file for Isabelle sources;
7887 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7890 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7891 timing flag supersedes proof_timing and Toplevel.trace;
7893 * ML: new combinators |>> and |>>> for incremental transformations
7894 with secondary results (e.g. certain theory extensions):
7896 * ML: PureThy.add_defs gets additional argument to indicate potential
7897 overloading (usually false);
7899 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7904 New in Isabelle99 (October 1999)
7905 --------------------------------
7907 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7909 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7910 are no longer simplified. (This allows the simplifier to unfold recursive
7911 functional programs.) To restore the old behaviour, declare
7913 Delcongs [if_weak_cong];
7915 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7918 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7920 * HOL/datatype: mutual_induct_tac no longer exists --
7921 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7923 * HOL/typedef: fixed type inference for representing set; type
7924 arguments now have to occur explicitly on the rhs as type constraints;
7926 * ZF: The con_defs part of an inductive definition may no longer refer
7927 to constants declared in the same theory;
7929 * HOL, ZF: the function mk_cases, generated by the inductive
7930 definition package, has lost an argument. To simplify its result, it
7931 uses the default simpset instead of a supplied list of theorems.
7933 * HOL/List: the constructors of type list are now Nil and Cons;
7935 * Simplifier: the type of the infix ML functions
7936 setSSolver addSSolver setSolver addSolver
7937 is now simpset * solver -> simpset where `solver' is a new abstract type
7938 for packaging solvers. A solver is created via
7939 mk_solver: string -> (thm list -> int -> tactic) -> solver
7940 where the string argument is only a comment.
7945 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7946 decision procedure for linear arithmetic. Currently it is used for
7947 types `nat', `int', and `real' in HOL (see below); it can, should and
7948 will be instantiated for other types and logics as well.
7950 * The simplifier now accepts rewrite rules with flexible heads, eg
7951 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7952 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7958 * New Isabelle/Isar subsystem provides an alternative to traditional
7959 tactical theorem proving; together with the ProofGeneral/isar user
7960 interface it offers an interactive environment for developing human
7961 readable proof documents (Isar == Intelligible semi-automated
7962 reasoning); for further information see isatool doc isar-ref,
7963 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7965 * improved and simplified presentation of theories: better HTML markup
7966 (including colors), graph views in several sizes; isatool usedir now
7967 provides a proper interface for user theories (via -P option); actual
7968 document preparation based on (PDF)LaTeX is available as well (for
7969 new-style theories only); see isatool doc system for more information;
7971 * native support for Proof General, both for classic Isabelle and
7974 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7975 using the graph browser tool;
7977 * Isabelle manuals now also available as PDF;
7979 * theory loader rewritten from scratch (may not be fully
7980 bug-compatible); old loadpath variable has been replaced by show_path,
7981 add_path, del_path, reset_path functions; new operations such as
7982 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7985 * improved isatool install: option -k creates KDE application icon,
7986 option -p DIR installs standalone binaries;
7988 * added ML_PLATFORM setting (useful for cross-platform installations);
7989 more robust handling of platform specific ML images for SML/NJ;
7991 * the settings environment is now statically scoped, i.e. it is never
7992 created again in sub-processes invoked from isabelle, isatool, or
7995 * path element specification '~~' refers to '$ISABELLE_HOME';
7997 * in locales, the "assumes" and "defines" parts may be omitted if
8000 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8003 * new print_mode "HTML";
8005 * new flag show_tags controls display of tags of theorems (which are
8006 basically just comments that may be attached by some tools);
8008 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8009 mode and goal output format:
8011 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8013 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8015 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8016 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8018 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8020 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8022 * function bind_thms stores lists of theorems (cf. bind_thm);
8024 * new shorthand tactics ftac, eatac, datac, fatac;
8026 * qed (and friends) now accept "" as result name; in that case the
8027 theorem is not stored, but proper checks and presentation of the
8030 * theorem database now also indexes constants "Trueprop", "all",
8031 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8036 ** HOL arithmetic **
8038 * There are now decision procedures for linear arithmetic over nat and
8041 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8042 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8043 are treated as atomic; subformulae not involving type `nat' or `int'
8044 are ignored; quantified subformulae are ignored unless they are
8045 positive universal or negative existential. The tactic has to be
8046 invoked by hand and can be a little bit slow. In particular, the
8047 running time is exponential in the number of occurrences of `min' and
8048 `max', and `-' on `nat'.
8050 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8051 (negated) (in)equalities among the premises and the conclusion into
8052 account (i.e. no compound formulae) and does not know about `min' and
8053 `max', and `-' on `nat'. It is fast and is used automatically by the
8056 NB: At the moment, these decision procedures do not cope with mixed
8057 nat/int formulae where the two parts interact, such as `m < n ==>
8060 * HOL/Numeral provides a generic theory of numerals (encoded
8061 efficiently as bit strings); setup for types nat/int/real is in place;
8062 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8063 int, existing theories and proof scripts may require a few additional
8066 * integer division and remainder can now be performed on constant
8069 * many properties of integer multiplication, division and remainder
8072 * An interface to the Stanford Validity Checker (SVC) is available through the
8073 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8074 are proved automatically. SVC must be installed separately, and its results
8075 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8076 invocation of the underlying oracle). For SVC see
8077 http://verify.stanford.edu/SVC
8079 * IsaMakefile: the HOL-Real target now builds an actual image;
8084 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8085 (in Isabelle/Isar) -- by Gertrud Bauer;
8087 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8088 analysis for assembly languages with subtypes;
8090 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8091 -- avoids syntactic ambiguities and treats state, transition, and
8092 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8093 changed syntax and (many) tactics;
8095 * HOL/inductive: Now also handles more general introduction rules such
8096 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8097 theorems are now maintained within the theory (maintained via the
8100 * HOL/datatype: Now also handles arbitrarily branching datatypes
8101 (using function types) such as
8103 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8105 * HOL/record: record_simproc (part of the default simpset) takes care
8106 of selectors applied to updated records; record_split_tac is no longer
8107 part of the default claset; update_defs may now be removed from the
8108 simpset in many cases; COMPATIBILITY: old behavior achieved by
8110 claset_ref () := claset() addSWrapper record_split_wrapper;
8111 Delsimprocs [record_simproc]
8113 * HOL/typedef: fixed type inference for representing set; type
8114 arguments now have to occur explicitly on the rhs as type constraints;
8116 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8117 names rather than an ML expression;
8119 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8120 supplied later. Program schemes can be defined, such as
8121 "While B C s = (if B s then While B C (C s) else s)"
8122 where the well-founded relation can be chosen after B and C have been given.
8124 * HOL/List: the constructors of type list are now Nil and Cons;
8125 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8126 course, ML tools referring to List.list.op # etc. have to be adapted;
8128 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8129 disabled by default; run isabelle with option -m HOL to get back to
8130 the original Gordon/HOL-style output;
8132 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8133 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8135 * HOL basic syntax simplified (more orthogonal): all variants of
8136 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8137 Eps operator is provided as well: "SOME x. P[x]";
8139 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8141 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8142 thus available for user theories;
8144 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8145 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8148 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8149 several times and then mp;
8154 * the notation <<...>> is now available as a notation for sequences of
8157 * the simplifier is now installed
8159 * the axiom system has been generalized (thanks to Soren Heilmann)
8161 * the classical reasoner now has a default rule database
8166 * new primrec section allows primitive recursive functions to be given
8167 directly (as in HOL) over datatypes and the natural numbers;
8169 * new tactics induct_tac and exhaust_tac for induction (or case
8170 analysis) over datatypes and the natural numbers;
8172 * the datatype declaration of type T now defines the recursor T_rec;
8174 * simplification automatically does freeness reasoning for datatype
8177 * automatic type-inference, with AddTCs command to insert new
8178 type-checking rules;
8180 * datatype introduction rules are now added as Safe Introduction rules
8183 * the syntax "if P then x else y" is now available in addition to
8187 *** Internal programming interfaces ***
8189 * tuned simplifier trace output; new flag debug_simp;
8191 * structures Vartab / Termtab (instances of TableFun) offer efficient
8192 tables indexed by indexname_ord / term_ord (compatible with aconv);
8194 * AxClass.axclass_tac lost the theory argument;
8196 * tuned current_goals_markers semantics: begin / end goal avoids
8197 printing empty lines;
8199 * removed prs and prs_fn hook, which was broken because it did not
8200 include \n in its semantics, forcing writeln to add one
8201 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8202 string -> unit if you really want to output text without newline;
8204 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8205 plain output, interface builders may have to enable 'isabelle_font'
8206 mode to get Isabelle font glyphs as before;
8208 * refined token_translation interface; INCOMPATIBILITY: output length
8209 now of type real instead of int;
8211 * theory loader actions may be traced via new ThyInfo.add_hook
8212 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8213 your own database of information attached to *whole* theories -- as
8214 opposed to intra-theory data slots offered via TheoryDataFun;
8216 * proper handling of dangling sort hypotheses (at last!);
8217 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8218 extra sort hypotheses that can be witnessed from the type signature;
8219 the force_strip_shyps flag is gone, any remaining shyps are simply
8220 left in the theorem (with a warning issued by strip_shyps_warning);
8224 New in Isabelle98-1 (October 1998)
8225 ----------------------------------
8227 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8229 * several changes of automated proof tools;
8231 * HOL: major changes to the inductive and datatype packages, including
8232 some minor incompatibilities of theory syntax;
8234 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8237 * HOL: removed duplicate thms in Arith:
8238 less_imp_add_less should be replaced by trans_less_add1
8239 le_imp_add_le should be replaced by trans_le_add1
8241 * HOL: unary minus is now overloaded (new type constraints may be
8244 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8245 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8246 now taken as an integer constant.
8248 * Pure: ML function 'theory_of' renamed to 'theory';
8254 1. Asm_full_simp_tac is now more aggressive.
8255 1. It will sometimes reorient premises if that increases their power to
8257 2. It does no longer proceed strictly from left to right but may also
8258 rotate premises to achieve further simplification.
8259 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8260 old Asm_full_simp_tac in that it does not rotate premises.
8261 2. The simplifier now knows a little bit about nat-arithmetic.
8263 * Classical reasoner: wrapper mechanism for the classical reasoner now
8264 allows for selected deletion of wrappers, by introduction of names for
8265 wrapper functionals. This implies that addbefore, addSbefore,
8266 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8267 and that adding two tactics with the same name overwrites the first
8268 one (emitting a warning).
8269 type wrapper = (int -> tactic) -> (int -> tactic)
8270 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8271 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8272 delWrapper, delSWrapper: claset * string -> claset
8273 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8275 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8276 semantics; addbefore now affects only the unsafe part of step_tac
8277 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8278 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8281 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8282 compWrapper; added safe wrapper (and access functions for it);
8284 * HOL/split_all_tac is now much faster and fails if there is nothing
8285 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8286 and the names of the automatically generated variables have changed.
8287 split_all_tac has moved within claset() from unsafe wrappers to safe
8288 wrappers, which means that !!-bound variables are split much more
8289 aggressively, and safe_tac and clarify_tac now split such variables.
8290 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8291 Note: the same holds for record_split_tac, which does the job of
8292 split_all_tac for record fields.
8294 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8295 permanently to the default simpset using Addsplits just like
8296 Addsimps. They can be removed via Delsplits just like
8297 Delsimps. Lower-case versions are also available.
8299 * HOL/Simplifier: The rule split_if is now part of the default
8300 simpset. This means that the simplifier will eliminate all occurrences
8301 of if-then-else in the conclusion of a goal. To prevent this, you can
8302 either remove split_if completely from the default simpset by
8303 `Delsplits [split_if]' or remove it in a specific call of the
8304 simplifier using `... delsplits [split_if]'. You can also add/delete
8305 other case splitting rules to/from the default simpset: every datatype
8306 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8307 t is the name of the datatype).
8309 * Classical reasoner / Simplifier combination: new force_tac (and
8310 derivatives Force_tac, force) combines rewriting and classical
8311 reasoning (and whatever other tools) similarly to auto_tac, but is
8312 aimed to solve the given subgoal completely.
8317 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8318 and `goalw': the theory is no longer needed as an explicit argument -
8319 the current theory context is used; assumptions are no longer returned
8320 at the ML-level unless one of them starts with ==> or !!; it is
8321 recommended to convert to these new commands using isatool fixgoal
8322 (backup your sources first!);
8324 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8325 the current theory context, and 'theory' to lookup stored theories;
8327 * new theory section 'locale' for declaring constants, assumptions and
8328 definitions that have local scope;
8330 * new theory section 'nonterminals' for purely syntactic types;
8332 * new theory section 'setup' for generic ML setup functions
8333 (e.g. package initialization);
8335 * the distribution now includes Isabelle icons: see
8336 lib/logo/isabelle-{small,tiny}.xpm;
8338 * isatool install - install binaries with absolute references to
8341 * isatool logo -- create instances of the Isabelle logo (as EPS);
8343 * print mode 'emacs' reserved for Isamode;
8345 * support multiple print (ast) translations per constant name;
8347 * theorems involving oracles are now printed with a suffixed [!];
8352 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8354 * HOL/inductive package reorganized and improved: now supports mutual
8360 oddI "n : EVEN ==> Suc n : ODD"
8361 evenI "n : ODD ==> Suc n : EVEN"
8363 new theorem list "elims" contains an elimination rule for each of the
8364 recursive sets; inductive definitions now handle disjunctive premises
8365 correctly (also ZF);
8367 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8368 "mutual_induct" no longer exists - the induction rule is always
8369 contained in "induct";
8372 * HOL/datatype package re-implemented and greatly improved: now
8373 supports mutually recursive datatypes such as
8376 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8377 | SUM ('a aexp) ('a aexp)
8378 | DIFF ('a aexp) ('a aexp)
8381 'a bexp = LESS ('a aexp) ('a aexp)
8382 | AND ('a bexp) ('a bexp)
8383 | OR ('a bexp) ('a bexp)
8385 as well as indirectly recursive datatypes such as
8388 ('a, 'b) term = Var 'a
8389 | App 'b ((('a, 'b) term) list)
8391 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8392 induction on mutually / indirectly recursive datatypes.
8394 Primrec equations are now stored in theory and can be accessed via
8395 <function_name>.simps.
8399 - Theories using datatypes must now have theory Datatype as an
8401 - The specific <typename>.induct_tac no longer exists - use the
8402 generic induct_tac instead.
8403 - natE has been renamed to nat.exhaust - use exhaust_tac
8404 instead of res_inst_tac ... natE. Note that the variable
8405 names in nat.exhaust differ from the names in natE, this
8406 may cause some "fragile" proofs to fail.
8407 - The theorems split_<typename>_case and split_<typename>_case_asm
8408 have been renamed to <typename>.split and <typename>.split_asm.
8409 - Since default sorts of type variables are now handled correctly,
8410 some datatype definitions may have to be annotated with explicit
8412 - Primrec definitions no longer require function name and type
8413 of recursive argument.
8415 Consider using isatool fixdatatype to adapt your theories and proof
8416 scripts to the new package (backup your sources first!).
8419 * HOL/record package: considerably improved implementation; now
8420 includes concrete syntax for record types, terms, updates; theorems
8421 for surjective pairing and splitting !!-bound record variables; proof
8422 support is as follows:
8424 1) standard conversions (selectors or updates applied to record
8425 constructor terms) are part of the standard simpset;
8427 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8428 made part of standard simpset and claset via addIffs;
8430 3) a tactic for record field splitting (record_split_tac) is part of
8431 the standard claset (addSWrapper);
8433 To get a better idea about these rules you may retrieve them via
8434 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8435 the name of your record type.
8437 The split tactic 3) conceptually simplifies by the following rule:
8439 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8441 Thus any record variable that is bound by meta-all will automatically
8442 blow up into some record constructor term, consequently the
8443 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8444 solve record problems automatically.
8447 * reorganized the main HOL image: HOL/Integ and String loaded by
8448 default; theory Main includes everything;
8450 * automatic simplification of integer sums and comparisons, using cancellation;
8452 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8454 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8456 * many new identities for unions, intersections, set difference, etc.;
8458 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8459 called split_if, split_split, split_sum_case and split_nat_case (to go
8460 with add/delsplits);
8462 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8463 (?x::unit) = (); this is made part of the default simpset, which COULD
8464 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8465 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8466 unit_abs_eta_conv is added in order to counter the effect of
8467 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8470 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8473 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8474 It and 'sym RS equals0D' are now in the default claset, giving automatic
8475 disjointness reasoning but breaking a few old proofs.
8477 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8478 to 'converse' from 'inverse' (for compatibility with ZF and some
8481 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8482 the well-founded relation;
8484 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8485 Compl A. The "Compl" syntax remains available as input syntax for this
8488 * HOL/Update: new theory of function updates:
8489 f(a:=b) == %x. if x=a then b else f x
8490 may also be iterated as in f(a:=b,c:=d,...);
8492 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8495 - new function list_update written xs[i:=v] that updates the i-th
8496 list position. May also be iterated as in xs[i:=a,j:=b,...].
8497 - new function `upt' written [i..j(] which generates the list
8498 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8499 bound write [i..j], which is a shorthand for [i..j+1(].
8500 - new lexicographic orderings and corresponding wellfoundedness theorems.
8503 - removed 'pred' (predecessor) function;
8504 - generalized some theorems about n-1;
8505 - many new laws about "div" and "mod";
8506 - new laws about greatest common divisors (see theory ex/Primes);
8508 * HOL/Relation: renamed the relational operator r^-1 "converse"
8509 instead of "inverse";
8511 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8512 of the multiset ordering;
8514 * directory HOL/Real: a construction of the reals using Dedekind cuts
8515 (not included by default);
8517 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8519 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8520 programs, i.e. different program variables may have different types.
8522 * calling (stac rew i) now fails if "rew" has no effect on the goal
8523 [previously, this check worked only if the rewrite rule was unconditional]
8524 Now rew can involve either definitions or equalities (either == or =).
8529 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8530 only the theorems proved on ZF.ML;
8532 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8533 It and 'sym RS equals0D' are now in the default claset, giving automatic
8534 disjointness reasoning but breaking a few old proofs.
8536 * ZF/Update: new theory of function updates
8537 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8538 may also be iterated as in f(a:=b,c:=d,...);
8540 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8542 * calling (stac rew i) now fails if "rew" has no effect on the goal
8543 [previously, this check worked only if the rewrite rule was unconditional]
8544 Now rew can involve either definitions or equalities (either == or =).
8546 * case_tac provided for compatibility with HOL
8547 (like the old excluded_middle_tac, but with subgoals swapped)
8550 *** Internal programming interfaces ***
8552 * Pure: several new basic modules made available for general use, see
8553 also src/Pure/README;
8555 * improved the theory data mechanism to support encapsulation (data
8556 kind name replaced by private Object.kind, acting as authorization
8557 key); new type-safe user interface via functor TheoryDataFun; generic
8558 print_data function becomes basically useless;
8560 * removed global_names compatibility flag -- all theory declarations
8561 are qualified by default;
8563 * module Pure/Syntax now offers quote / antiquote translation
8564 functions (useful for Hoare logic etc. with implicit dependencies);
8565 see HOL/ex/Antiquote for an example use;
8567 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8570 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8573 * Display.print_goals function moved to Locale.print_goals;
8575 * standard print function for goals supports current_goals_markers
8576 variable for marking begin of proof, end of proof, start of goal; the
8577 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8578 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8583 New in Isabelle98 (January 1998)
8584 --------------------------------
8586 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8588 * changed lexical syntax of terms / types: dots made part of long
8589 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8591 * simpset (and claset) reference variable replaced by functions
8592 simpset / simpset_ref;
8594 * no longer supports theory aliases (via merge) and non-trivial
8595 implicit merge of thms' signatures;
8597 * most internal names of constants changed due to qualified names;
8599 * changed Pure/Sequence interface (see Pure/seq.ML);
8602 *** General Changes ***
8604 * hierachically structured name spaces (for consts, types, axms, thms
8605 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8606 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8607 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8608 long_names for fully qualified output names; NOTE: ML programs
8609 (special tactics, packages etc.) referring to internal names may have
8610 to be adapted to cope with fully qualified names; in case of severe
8611 backward campatibility problems try setting 'global_names' at compile
8612 time to have enrything declared within a flat name space; one may also
8613 fine tune name declarations in theories via the 'global' and 'local'
8616 * reimplemented the implicit simpset and claset using the new anytype
8617 data filed in signatures; references simpset:simpset ref etc. are
8618 replaced by functions simpset:unit->simpset and
8619 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8620 to patch your ML files accordingly;
8622 * HTML output now includes theory graph data for display with Java
8623 applet or isatool browser; data generated automatically via isatool
8624 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8626 * defs may now be conditional; improved rewrite_goals_tac to handle
8627 conditional equations;
8629 * defs now admits additional type arguments, using TYPE('a) syntax;
8631 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8632 creates a new theory node; implicit merge of thms' signatures is
8633 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8634 transfer:theory->thm->thm in (rare) cases;
8636 * improved handling of draft signatures / theories; draft thms (and
8637 ctyps, cterms) are automatically promoted to real ones;
8639 * slightly changed interfaces for oracles: admit many per theory, named
8640 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8642 * print_goals: optional output of const types (set show_consts and
8645 * improved output of warnings (###) and errors (***);
8647 * subgoal_tac displays a warning if the new subgoal has type variables;
8649 * removed old README and Makefiles;
8651 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8653 * removed obsolete init_pps and init_database;
8655 * deleted the obsolete tactical STATE, which was declared by
8656 fun STATE tacfun st = tacfun st st;
8658 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8659 (which abbreviates $HOME);
8661 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8662 use isatool fixseq to adapt your ML programs (this works for fully
8663 qualified references to the Sequence structure only!);
8665 * use_thy no longer requires writable current directory; it always
8666 reloads .ML *and* .thy file, if either one is out of date;
8669 *** Classical Reasoner ***
8671 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8672 tactics that use classical reasoning to simplify a subgoal without
8673 splitting it into several subgoals;
8675 * Safe_tac: like safe_tac but uses the default claset;
8680 * added simplification meta rules:
8681 (asm_)(full_)simplify: simpset -> thm -> thm;
8683 * simplifier.ML no longer part of Pure -- has to be loaded by object
8686 * added prems argument to simplification procedures;
8688 * HOL, FOL, ZF: added infix function `addsplits':
8689 instead of `<simpset> setloop (split_tac <thms>)'
8690 you can simply write `<simpset> addsplits <thms>'
8695 * TYPE('a) syntax for type reflection terms;
8697 * no longer handles consts with name "" -- declare as 'syntax' instead;
8699 * pretty printer: changed order of mixfix annotation preference (again!);
8701 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8706 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8707 with `addloop' of the simplifier to faciliate case splitting in premises.
8709 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8711 * HOL/Auth: new protocol proofs including some for the Internet
8714 * HOL/Map: new theory of `maps' a la VDM;
8716 * HOL/simplifier: simplification procedures nat_cancel_sums for
8717 cancelling out common nat summands from =, <, <= (in)equalities, or
8718 differences; simplification procedures nat_cancel_factor for
8719 cancelling common factor from =, <, <= (in)equalities over natural
8720 sums; nat_cancel contains both kinds of procedures, it is installed by
8721 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8723 * HOL/simplifier: terms of the form
8724 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8726 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8727 and those of the form
8728 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8730 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8733 Each datatype `t' now comes with a theorem `split_t_case' of the form
8735 P(t_case f1 ... fn x) =
8736 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8738 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8741 and a theorem `split_t_case_asm' of the form
8743 P(t_case f1 ... fn x) =
8744 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8746 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8748 which can be added to a simpset via `addsplits'. The existing theorems
8749 expand_list_case and expand_option_case have been renamed to
8750 split_list_case and split_option_case.
8753 - `pred n' is automatically converted to `n-1'.
8754 Users are strongly encouraged not to use `pred' any longer,
8755 because it will disappear altogether at some point.
8756 - Users are strongly encouraged to write "0 < n" rather than
8757 "n ~= 0". Theorems and proof tools have been modified towards this
8761 the function "set_of_list" has been renamed "set" (and its theorems too);
8762 the function "nth" now takes its arguments in the reverse order and
8763 has acquired the infix notation "!" as in "xs!n".
8765 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8767 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8768 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8770 * HOL/record: extensible records with schematic structural subtyping
8771 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8772 still lacks various theorems and concrete record syntax;
8777 * removed "axioms" and "generated by" sections;
8779 * replaced "ops" section by extended "consts" section, which is capable of
8780 handling the continuous function space "->" directly;
8783 . proves theorems immediately and stores them in the theory,
8784 . creates hierachical name space,
8785 . now uses normal mixfix annotations (instead of cinfix...),
8786 . minor changes to some names and values (for consistency),
8787 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8788 . separator between mutual domain defs: changed "," to "and",
8789 . improved handling of sort constraints; now they have to
8790 appear on the left-hand side of the equations only;
8792 * fixed LAM <x,y,zs>.b syntax;
8794 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8795 adm (%x. P (t x)), where P is chainfinite and t continuous;
8800 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8801 with `addloop' of the simplifier to faciliate case splitting in premises.
8803 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8804 in HOL, they strip ALL and --> from proved theorems;
8808 New in Isabelle94-8 (May 1997)
8809 ------------------------------
8811 *** General Changes ***
8813 * new utilities to build / run / maintain Isabelle etc. (in parts
8814 still somewhat experimental); old Makefiles etc. still functional;
8816 * new 'Isabelle System Manual';
8818 * INSTALL text, together with ./configure and ./build scripts;
8820 * reimplemented type inference for greater efficiency, better error
8821 messages and clean internal interface;
8823 * prlim command for dealing with lots of subgoals (an easier way of
8824 setting goals_limit);
8829 * supports alternative (named) syntax tables (parser and pretty
8830 printer); internal interface is provided by add_modesyntax(_i);
8832 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8833 be used in conjunction with the Isabelle symbol font; uses the
8834 "symbols" syntax table;
8836 * added token_translation interface (may translate name tokens in
8837 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8838 the current print_mode); IMPORTANT: user print translation functions
8839 are responsible for marking newly introduced bounds
8840 (Syntax.mark_boundT);
8842 * token translations for modes "xterm" and "xterm_color" that display
8843 names in bold, underline etc. or colors (which requires a color
8846 * infixes may now be declared with names independent of their syntax;
8848 * added typed_print_translation (like print_translation, but may
8849 access type of constant);
8852 *** Classical Reasoner ***
8854 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8855 some limitations. Blast_tac...
8856 + ignores addss, addbefore, addafter; this restriction is intrinsic
8857 + ignores elimination rules that don't have the correct format
8858 (the conclusion MUST be a formula variable)
8859 + ignores types, which can make HOL proofs fail
8860 + rules must not require higher-order unification, e.g. apply_type in ZF
8861 [message "Function Var's argument not a bound variable" relates to this]
8862 + its proof strategy is more general but can actually be slower
8864 * substitution with equality assumptions no longer permutes other
8867 * minor changes in semantics of addafter (now called addaltern); renamed
8868 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8869 (and access functions for it);
8871 * improved combination of classical reasoner and simplifier:
8872 + functions for handling clasimpsets
8873 + improvement of addss: now the simplifier is called _after_ the
8875 + safe variant of addss called addSss: uses safe simplifications
8876 _during_ the safe steps. It is more complete as it allows multiple
8877 instantiations of unknowns (e.g. with slow_tac).
8881 * added interface for simplification procedures (functions that
8882 produce *proven* rewrite rules on the fly, depending on current
8885 * ordering on terms as parameter (used for ordered rewriting);
8887 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8889 * the solver is now split into a safe and an unsafe part.
8890 This should be invisible for the normal user, except that the
8891 functions setsolver and addsolver have been renamed to setSolver and
8892 addSolver; added safe_asm_full_simp_tac;
8897 * a generic induction tactic `induct_tac' which works for all datatypes and
8898 also for type `nat';
8900 * a generic case distinction tactic `exhaust_tac' which works for all
8901 datatypes and also for type `nat';
8903 * each datatype comes with a function `size';
8905 * patterns in case expressions allow tuple patterns as arguments to
8906 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8908 * primrec now also works with type nat;
8910 * recdef: a new declaration form, allows general recursive functions to be
8911 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8913 * the constant for negation has been renamed from "not" to "Not" to
8914 harmonize with FOL, ZF, LK, etc.;
8916 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8919 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8921 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8922 problems in commutative rings, using axiomatic type classes for + and *;
8924 * more examples in HOL/MiniML and HOL/Auth;
8926 * more default rewrite rules for quantifiers, union/intersection;
8928 * a new constant `arbitrary == @x.False';
8930 * HOLCF/IOA replaces old HOL/IOA;
8932 * HOLCF changes: derived all rules and arities
8933 + axiomatic type classes instead of classes
8934 + typedef instead of faking type definitions
8935 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8936 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8937 + eliminated the types void, one, tr
8938 + use unit lift and bool lift (with translations) instead of one and tr
8939 + eliminated blift from Lift3.thy (use Def instead of blift)
8940 all eliminated rules are derived as theorems --> no visible changes ;
8945 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8946 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8947 as ZF_cs addSIs [equalityI];
8951 New in Isabelle94-7 (November 96)
8952 ---------------------------------
8954 * allowing negative levels (as offsets) in prlev and choplev;
8956 * super-linear speedup for large simplifications;
8958 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8959 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8960 FAIL); can suppress it using the command Delsimps (ex_simps @
8961 all_simps); De Morgan laws are also now included, by default;
8963 * improved printing of ==> : ~:
8965 * new object-logic "Sequents" adds linear logic, while replacing LK
8966 and Modal (thanks to Sara Kalvala);
8968 * HOL/Auth: correctness proofs for authentication protocols;
8970 * HOL: new auto_tac combines rewriting and classical reasoning (many
8971 examples on HOL/Auth);
8973 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8974 the rewriter and classical reasoner simultaneously;
8976 * function uresult no longer returns theorems in "standard" format;
8977 regain previous version by: val uresult = standard o uresult;
8984 * oracles -- these establish an interface between Isabelle and trusted
8985 external reasoners, which may deliver results as theorems;
8987 * proof objects (in particular record all uses of oracles);
8989 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8991 * "constdefs" section in theory files;
8993 * "primrec" section (HOL) no longer requires names;
8995 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9002 * reduced space requirements;
9004 * automatic HTML generation from theories;
9006 * theory files no longer require "..." (quotes) around most types;
9008 * new examples, including two proofs of the Church-Rosser theorem;
9010 * non-curried (1994) version of HOL is no longer distributed;
9017 * greatly reduced space requirements;
9019 * theory files (.thy) no longer require \...\ escapes at line breaks;
9021 * searchable theorem database (see the section "Retrieving theorems" on
9022 page 8 of the Reference Manual);
9024 * new examples, including Grabczewski's monumental case study of the
9027 * The previous version of HOL renamed to Old_HOL;
9029 * The new version of HOL (previously called CHOL) uses a curried syntax
9030 for functions. Application looks like f a b instead of f(a,b);
9032 * Mutually recursive inductive definitions finally work in HOL;
9034 * In ZF, pattern-matching on tuples is now available in all abstractions and
9035 translates to the operator "split";
9042 * new infix operator, addss, allowing the classical reasoner to
9043 perform simplification at each step of its search. Example:
9044 fast_tac (cs addss ss)
9046 * a new logic, CHOL, the same as HOL, but with a curried syntax
9047 for functions. Application looks like f a b instead of f(a,b). Also pairs
9048 look like (a,b) instead of <a,b>;
9050 * PLEASE NOTE: CHOL will eventually replace HOL!
9052 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9053 It translates to the operator "split". A new theory of integers is available;
9055 * In ZF, integer numerals now denote two's-complement binary integers.
9056 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9058 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9059 of the Axiom of Choice;
9066 * Significantly faster resolution;
9068 * the different sections in a .thy file can now be mixed and repeated
9071 * Database of theorems for FOL, HOL and ZF. New
9072 commands including qed, qed_goal and bind_thm store theorems in the database.
9074 * Simple database queries: return a named theorem (get_thm) or all theorems of
9075 a given theory (thms_of), or find out what theory a theorem was proved in
9078 * Bugs fixed in the inductive definition and datatype packages;
9080 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9081 and HOL_dup_cs obsolete;
9083 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9086 * Simpler definition of function space in ZF;
9088 * new results about cardinal and ordinal arithmetic in ZF;
9090 * 'subtype' facility in HOL for introducing new types as subsets of existing
9093 :mode=text:wrap=hard:maxLineLen=72: