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)
14 * Updated and extended reference manuals ("isar-ref" and
15 "implementation"); reduced remaining material in old "ref" manual.
17 * Rule attributes in local theory declarations (e.g. locale or class)
18 are now statically evaluated: the resulting theorem is stored instead
19 of the original expression. INCOMPATIBILITY in rare situations, where
20 the historic accident of dynamic re-evaluation in interpretations
23 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
24 declaration, and results are standardized before being stored. Thus
25 old-style "standard" after instantiation or composition of facts
26 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
27 indices of schematic variables.
29 * Renamed some inner syntax categories:
35 Minor INCOMPATIBILITY. Note that in practice "num_const" or
36 "num_position" etc. are mainly used instead (which also include
37 position information via constraints).
39 * Simplified configuration options for syntax ambiguity: see
40 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
41 manual. Minor INCOMPATIBILITY.
46 * Attribute "abs_def" turns an equation of the form "f x y == t" into
47 "f == %x y. t", which ensures that "simp" or "unfold" steps always
48 expand it. This also works for object-logic equality. (Formerly
49 undocumented feature.)
51 * Discontinued old "prems" fact, which used to refer to the accidental
52 collection of foundational premises in the context (marked as legacy
55 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
56 instead. INCOMPATIBILITY.
58 * Ancient code generator for SML and its commands 'code_module',
59 'code_library', 'consts_code', 'types_code' have been discontinued.
60 Use commands of the generic code generator instead. INCOMPATIBILITY.
62 * Redundant attribute 'code_inline' has been discontinued. Use
63 'code_unfold' instead. INCOMPATIBILITY.
65 * Dropped attribute 'code_unfold_post' in favor of the its dual
66 'code_abbrev', which yields a common pattern in definitions like
68 definition [code_abbrev]: "f = t"
72 * Sort constraints are now propagated in simultaneous statements, just
73 like type constraints. INCOMPATIBILITY in rare situations, where
74 distinct sorts used to be assigned accidentally. For example:
76 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
78 lemma "P (x::'a)" and "Q (y::'a::bar)"
79 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
84 * Type 'a set is now a proper type constructor (just as before
85 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
86 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
87 sets separate, it is often sufficient to rephrase sets S accidentally
88 used as predicates by "%x. x : S" and predicates P accidentally used
89 as sets by "{x. P x}". Corresponding proofs in a first step should be
90 pruned from any tinkering with former theorems mem_def and
91 Collect_def as far as possible.
92 For developments which deliberately mixed predicates and
93 sets, a planning step is necessary to determine what should become a
94 predicate and what a set. It can be helpful to carry out that step in
95 Isabelle2011-1 before jumping right into the current release.
97 * Code generation by default implements sets as container type rather
98 than predicates. INCOMPATIBILITY.
100 * New type synonym 'a rel = ('a * 'a) set
102 * More default pred/set conversions on a couple of relation operations
103 and predicates. Consolidation of some relation theorems:
105 converse_def ~> converse_unfold
106 rel_comp_def ~> rel_comp_unfold
107 symp_def ~> (dropped, use symp_def and sym_def instead)
108 transp_def ~> transp_trans
109 Domain_def ~> Domain_unfold
110 Range_def ~> Domain_converse [symmetric]
114 * Consolidated various theorem names relating to Finite_Set.fold
117 inf_INFI_fold_inf ~> inf_INF_fold_inf
118 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
119 INFI_fold_inf ~> INF_fold_inf
120 SUPR_fold_sup ~> SUP_fold_sup
121 union_set ~> union_set_fold
122 minus_set ~> minus_set_fold
126 * Consolidated theorem names concerning fold combinators:
128 INFI_set_fold ~> INF_set_fold
129 SUPR_set_fold ~> SUP_set_fold
130 INF_code ~> INF_set_foldr
131 SUP_code ~> SUP_set_foldr
132 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
133 foldl.simps ~> foldl_Nil foldl_Cons
134 foldr_fold_rev ~> foldr_def
135 foldl_fold ~> foldl_def
139 * Dropped rarely useful theorems concerning fold combinators:
140 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
141 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
142 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
143 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
144 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
145 Prefer "List.fold" with canonical argument order, or boil down
146 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
147 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
148 and "List.foldl plus 0", prefer "List.listsum".
150 * Congruence rules Option.map_cong and Option.bind_cong for recursion
151 through option types.
153 * Concrete syntax for case expressions includes constraints for source
154 positions, and thus produces Prover IDE markup for its bindings.
155 INCOMPATIBILITY for old-style syntax translations that augment the
156 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
159 * Discontinued configuration option "syntax_positions": atomic terms
160 in parse trees are always annotated by position constraints.
162 * Finite_Set.fold now qualified. INCOMPATIBILITY.
164 * Renamed some facts on canonical fold on lists, in order to avoid
165 problems with interpretation involving corresponding facts on foldl
166 with the same base names:
168 fold_set_remdups ~> fold_set_fold_remdups
169 fold_set ~> fold_set_fold
170 fold1_set ~> fold1_set_fold
174 * Renamed facts about the power operation on relations, i.e., relpow
175 to match the constant's name:
177 rel_pow_1 ~> relpow_1
178 rel_pow_0_I ~> relpow_0_I
179 rel_pow_Suc_I ~> relpow_Suc_I
180 rel_pow_Suc_I2 ~> relpow_Suc_I2
181 rel_pow_0_E ~> relpow_0_E
182 rel_pow_Suc_E ~> relpow_Suc_E
183 rel_pow_E ~> relpow_E
184 rel_pow_Suc_D2 ~> relpow_Suc_D2
185 rel_pow_Suc_E2 ~> relpow_Suc_E2
186 rel_pow_Suc_D2' ~> relpow_Suc_D2'
187 rel_pow_E2 ~> relpow_E2
188 rel_pow_add ~> relpow_add
189 rel_pow_commute ~> relpow
190 rel_pow_empty ~> relpow_empty:
191 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
192 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
193 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
194 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
195 rel_pow_fun_conv ~> relpow_fun_conv
196 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
197 rel_pow_finite_bounded ~> relpow_finite_bounded
198 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
199 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
200 single_valued_rel_pow ~> single_valued_relpow
204 * New theory HOL/Library/DAList provides an abstract type for association
205 lists with distinct keys.
207 * 'datatype' specifications allow explicit sort constraints.
209 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
210 use theory HOL/Library/Nat_Bijection instead.
212 * Session HOL-Word: Discontinued many redundant theorems specific to
213 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
216 word_sub_alt ~> word_sub_wi
217 word_add_alt ~> word_add_def
218 word_mult_alt ~> word_mult_def
219 word_minus_alt ~> word_minus_def
220 word_0_alt ~> word_0_wi
221 word_1_alt ~> word_1_wi
222 word_add_0 ~> add_0_left
223 word_add_0_right ~> add_0_right
224 word_mult_1 ~> mult_1_left
225 word_mult_1_right ~> mult_1_right
226 word_add_commute ~> add_commute
227 word_add_assoc ~> add_assoc
228 word_add_left_commute ~> add_left_commute
229 word_mult_commute ~> mult_commute
230 word_mult_assoc ~> mult_assoc
231 word_mult_left_commute ~> mult_left_commute
232 word_left_distrib ~> left_distrib
233 word_right_distrib ~> right_distrib
234 word_left_minus ~> left_minus
235 word_diff_0_right ~> diff_0_right
236 word_diff_self ~> diff_self
237 word_sub_def ~> diff_minus
238 word_diff_minus ~> diff_minus
239 word_add_ac ~> add_ac
240 word_mult_ac ~> mult_ac
241 word_plus_ac0 ~> add_0_left add_0_right add_ac
242 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
243 word_order_trans ~> order_trans
244 word_order_refl ~> order_refl
245 word_order_antisym ~> order_antisym
246 word_order_linear ~> linorder_linear
247 lenw1_zero_neq_one ~> zero_neq_one
248 word_number_of_eq ~> number_of_eq
249 word_of_int_add_hom ~> wi_hom_add
250 word_of_int_sub_hom ~> wi_hom_sub
251 word_of_int_mult_hom ~> wi_hom_mult
252 word_of_int_minus_hom ~> wi_hom_neg
253 word_of_int_succ_hom ~> wi_hom_succ
254 word_of_int_pred_hom ~> wi_hom_pred
255 word_of_int_0_hom ~> word_0_wi
256 word_of_int_1_hom ~> word_1_wi
258 * Clarified attribute "mono_set": pure declaration without modifying
259 the result of the fact expression.
261 * "Transitive_Closure.ntrancl": bounded transitive closure on
264 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
266 * "sublists" moved to theory More_List. INCOMPATIBILITY.
268 * Theory Int: Discontinued many legacy theorems specific to type int.
269 INCOMPATIBILITY, use the corresponding generic theorems instead.
271 zminus_zminus ~> minus_minus
272 zminus_0 ~> minus_zero
273 zminus_zadd_distrib ~> minus_add_distrib
274 zadd_commute ~> add_commute
275 zadd_assoc ~> add_assoc
276 zadd_left_commute ~> add_left_commute
280 zadd_0_right ~> add_0_right
281 zadd_zminus_inverse2 ~> left_minus
282 zmult_zminus ~> mult_minus_left
283 zmult_commute ~> mult_commute
284 zmult_assoc ~> mult_assoc
285 zadd_zmult_distrib ~> left_distrib
286 zadd_zmult_distrib2 ~> right_distrib
287 zdiff_zmult_distrib ~> left_diff_distrib
288 zdiff_zmult_distrib2 ~> right_diff_distrib
289 zmult_1 ~> mult_1_left
290 zmult_1_right ~> mult_1_right
291 zle_refl ~> order_refl
292 zle_trans ~> order_trans
293 zle_antisym ~> order_antisym
294 zle_linear ~> linorder_linear
295 zless_linear ~> linorder_less_linear
296 zadd_left_mono ~> add_left_mono
297 zadd_strict_right_mono ~> add_strict_right_mono
298 zadd_zless_mono ~> add_less_le_mono
299 int_0_less_1 ~> zero_less_one
300 int_0_neq_1 ~> zero_neq_one
302 zpower_zadd_distrib ~> power_add
303 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
304 zero_le_zpower_abs ~> zero_le_power_abs
306 * Theory Deriv: Renamed
308 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
310 * New "case_product" attribute to generate a case rule doing multiple
311 case distinctions at the same time. E.g.
313 list.exhaust [case_product nat.exhaust]
315 produces a rule which can be used to perform case distinction on both
318 * Improved code generation of multisets.
320 * New diagnostic command find_unused_assms to find potentially superfluous
321 assumptions in theorems using Quickcheck.
324 - Quickcheck returns variable assignments as counterexamples, which
325 allows to reveal the underspecification of functions under test.
326 For example, refuting "hd xs = x", it presents the variable
327 assignment xs = [] and x = a1 as a counterexample, assuming that
328 any property is false whenever "hd []" occurs in it.
329 These counterexample are marked as potentially spurious, as
330 Quickcheck also returns "xs = []" as a counterexample to the
331 obvious theorem "hd xs = hd xs".
332 After finding a potentially spurious counterexample, Quickcheck
333 continues searching for genuine ones.
334 By default, Quickcheck shows potentially spurious and genuine
335 counterexamples. The option "genuine_only" sets quickcheck to
336 only show genuine counterexamples.
338 - The command 'quickcheck_generator' creates random and exhaustive
339 value generators for a given type and operations.
340 It generates values by using the operations as if they were
341 constructors of that type.
343 - Support for multisets.
345 - Added "use_subtype" options.
348 - Fixed infinite loop caused by the 'peephole_optim' option and
349 affecting 'rat' and 'real'.
352 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
353 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
354 - Renamed "sound" option to "strict".
357 - Added possibility to specify lambda translations scheme as a
358 parenthesized argument (e.g., "by (metis (lifting) ...)").
361 - Renamed from 'try_methods'. INCOMPATIBILITY.
363 * New "eventually_elim" method as a generalized variant of the
364 eventually_elim* rules. Supports structured proofs.
369 * New "case_product" attribute (see HOL).
374 * Antiquotation @{keyword "name"} produces a parser for outer syntax
375 from a minor keyword introduced via theory header declaration.
377 * Local_Theory.define no longer hard-wires default theorem name
378 "foo_def": definitional packages need to make this explicit, and may
379 choose to omit theorem bindings for definitions by using
380 Binding.empty/Attrib.empty_binding. Potential INCOMPATIBILITY for
381 derived definitional packages.
383 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
384 conformance with similar operations in structure Term and Logic.
386 * Antiquotation @{attributes [...]} embeds attribute source
387 representation into the ML text, which is particularly useful with
388 declarations like Local_Theory.note.
390 * Structure Proof_Context follows standard naming scheme. Old
391 ProofContext has been discontinued. INCOMPATIBILITY.
393 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
394 change of semantics: update is applied to auxiliary local theory
397 * Modernized some old-style infix operations:
399 addeqcongs ~> Simplifier.add_eqcong
400 deleqcongs ~> Simplifier.del_eqcong
401 addcongs ~> Simplifier.add_cong
402 delcongs ~> Simplifier.del_cong
403 setmksimps ~> Simplifier.set_mksimps
404 setmkcong ~> Simplifier.set_mkcong
405 setmksym ~> Simplifier.set_mksym
406 setmkeqTrue ~> Simplifier.set_mkeqTrue
407 settermless ~> Simplifier.set_termless
408 setsubgoaler ~> Simplifier.set_subgoaler
409 addsplits ~> Splitter.add_split
410 delsplits ~> Splitter.del_split
414 New in Isabelle2011-1 (October 2011)
415 ------------------------------------
419 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
420 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
422 - Management of multiple theory files directly from the editor
423 buffer store -- bypassing the file-system (no requirement to save
426 - Markup of formal entities within the text buffer, with semantic
427 highlighting, tooltips and hyperlinks to jump to defining source
430 - Improved text rendering, with sub/superscripts in the source
431 buffer (including support for copy/paste wrt. output panel, HTML
432 theory output and other non-Isabelle text boxes).
434 - Refined scheduling of proof checking and printing of results,
435 based on interactive editor view. (Note: jEdit folding and
436 narrowing allows to restrict buffer perspectives explicitly.)
438 - Reduced CPU performance requirements, usable on machines with few
441 - Reduced memory requirements due to pruning of unused document
442 versions (garbage collection).
444 See also ~~/src/Tools/jEdit/README.html for further information,
445 including some remaining limitations.
447 * Theory loader: source files are exclusively located via the master
448 directory of each theory node (where the .thy file itself resides).
449 The global load path (such as src/HOL/Library) has been discontinued.
450 Note that the path element ~~ may be used to reference theories in the
451 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
454 * Theory loader: source files are identified by content via SHA1
455 digests. Discontinued former path/modtime identification and optional
456 ISABELLE_FILE_IDENT plugin scripts.
458 * Parallelization of nested Isar proofs is subject to
459 Goal.parallel_proofs_threshold (default 100). See also isabelle
462 * Name space: former unsynchronized references are now proper
463 configuration options, with more conventional names:
465 long_names ~> names_long
466 short_names ~> names_short
467 unique_names ~> names_unique
469 Minor INCOMPATIBILITY, need to declare options in context like this:
471 declare [[names_unique = false]]
473 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
474 that the result needs to be unique, which means fact specifications
475 may have to be refined after enriching a proof context.
477 * Attribute "case_names" has been refined: the assumptions in each case
478 can be named now by following the case name with [name1 name2 ...].
480 * Isabelle/Isar reference manual has been updated and extended:
481 - "Synopsis" provides a catalog of main Isar language concepts.
482 - Formal references in syntax diagrams, via @{rail} antiquotation.
483 - Updated material from classic "ref" manual, notably about
484 "Classical Reasoner".
489 * Class bot and top require underlying partial order rather than
490 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
492 * Class complete_lattice: generalized a couple of lemmas from sets;
493 generalized theorems INF_cong and SUP_cong. New type classes for
494 complete boolean algebras and complete linear orders. Lemmas
495 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
496 class complete_linorder.
498 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
499 Sup_fun_def, Inf_apply, Sup_apply.
501 Removed redundant lemmas (the right hand side gives hints how to
502 replace them for (metis ...), or (simp only: ...) proofs):
504 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
505 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
506 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
507 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
508 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
509 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
510 Inter_def ~> INF_def, image_def
511 Union_def ~> SUP_def, image_def
512 INT_eq ~> INF_def, and image_def
513 UN_eq ~> SUP_def, and image_def
514 INF_subset ~> INF_superset_mono [OF _ order_refl]
516 More consistent and comprehensive names:
518 INTER_eq_Inter_image ~> INF_def
519 UNION_eq_Union_image ~> SUP_def
523 INF_leI2 ~> INF_lower2
524 le_INFI ~> INF_greatest
526 le_SUPI2 ~> SUP_upper2
528 INFI_bool_eq ~> INF_bool_eq
529 SUPR_bool_eq ~> SUP_bool_eq
530 INFI_apply ~> INF_apply
531 SUPR_apply ~> SUP_apply
532 INTER_def ~> INTER_eq
533 UNION_def ~> UNION_eq
537 * Renamed theory Complete_Lattice to Complete_Lattices.
540 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
541 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
542 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
543 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
545 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
546 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
547 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
550 * Added syntactic classes "inf" and "sup" for the respective
551 constants. INCOMPATIBILITY: Changes in the argument order of the
552 (mostly internal) locale predicates for some derived classes.
554 * Theorem collections ball_simps and bex_simps do not contain theorems
555 referring to UNION any longer; these have been moved to collection
556 UN_ball_bex_simps. INCOMPATIBILITY.
558 * Theory Archimedean_Field: floor now is defined as parameter of a
559 separate type class floor_ceiling.
561 * Theory Finite_Set: more coherent development of fold_set locales:
563 locale fun_left_comm ~> locale comp_fun_commute
564 locale fun_left_comm_idem ~> locale comp_fun_idem
566 Both use point-free characterization; interpretation proofs may need
567 adjustment. INCOMPATIBILITY.
569 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
570 accordance with standard mathematical terminology. INCOMPATIBILITY.
572 * Theory Complex_Main: The locale interpretations for the
573 bounded_linear and bounded_bilinear locales have been removed, in
574 order to reduce the number of duplicate lemmas. Users must use the
575 original names for distributivity theorems, potential INCOMPATIBILITY.
577 divide.add ~> add_divide_distrib
578 divide.diff ~> diff_divide_distrib
579 divide.setsum ~> setsum_divide_distrib
580 mult.add_right ~> right_distrib
581 mult.diff_right ~> right_diff_distrib
582 mult_right.setsum ~> setsum_right_distrib
583 mult_left.diff ~> left_diff_distrib
585 * Theory Complex_Main: Several redundant theorems have been removed or
586 replaced by more general versions. INCOMPATIBILITY.
588 real_diff_def ~> minus_real_def
589 real_divide_def ~> divide_real_def
590 real_less_def ~> less_le
591 real_abs_def ~> abs_real_def
592 real_sgn_def ~> sgn_real_def
593 real_mult_commute ~> mult_commute
594 real_mult_assoc ~> mult_assoc
595 real_mult_1 ~> mult_1_left
596 real_add_mult_distrib ~> left_distrib
597 real_zero_not_eq_one ~> zero_neq_one
598 real_mult_inverse_left ~> left_inverse
599 INVERSE_ZERO ~> inverse_zero
600 real_le_refl ~> order_refl
601 real_le_antisym ~> order_antisym
602 real_le_trans ~> order_trans
603 real_le_linear ~> linear
604 real_le_eq_diff ~> le_iff_diff_le_0
605 real_add_left_mono ~> add_left_mono
606 real_mult_order ~> mult_pos_pos
607 real_mult_less_mono2 ~> mult_strict_left_mono
608 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
609 real_0_le_divide_iff ~> zero_le_divide_iff
610 realpow_two_disj ~> power2_eq_iff
611 real_squared_diff_one_factored ~> square_diff_one_factored
612 realpow_two_diff ~> square_diff_square_factored
613 reals_complete2 ~> complete_real
614 real_sum_squared_expand ~> power2_sum
615 exp_ln_eq ~> ln_unique
617 expi_zero ~> exp_zero
618 lemma_DERIV_subst ~> DERIV_cong
619 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
620 LIMSEQ_const ~> tendsto_const
621 LIMSEQ_norm ~> tendsto_norm
622 LIMSEQ_add ~> tendsto_add
623 LIMSEQ_minus ~> tendsto_minus
624 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
625 LIMSEQ_diff ~> tendsto_diff
626 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
627 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
628 LIMSEQ_mult ~> tendsto_mult
629 LIMSEQ_inverse ~> tendsto_inverse
630 LIMSEQ_divide ~> tendsto_divide
631 LIMSEQ_pow ~> tendsto_power
632 LIMSEQ_setsum ~> tendsto_setsum
633 LIMSEQ_setprod ~> tendsto_setprod
634 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
635 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
636 LIMSEQ_imp_rabs ~> tendsto_rabs
637 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
638 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
639 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
640 LIMSEQ_Complex ~> tendsto_Complex
641 LIM_ident ~> tendsto_ident_at
642 LIM_const ~> tendsto_const
643 LIM_add ~> tendsto_add
644 LIM_add_zero ~> tendsto_add_zero
645 LIM_minus ~> tendsto_minus
646 LIM_diff ~> tendsto_diff
647 LIM_norm ~> tendsto_norm
648 LIM_norm_zero ~> tendsto_norm_zero
649 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
650 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
651 LIM_rabs ~> tendsto_rabs
652 LIM_rabs_zero ~> tendsto_rabs_zero
653 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
654 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
655 LIM_compose ~> tendsto_compose
656 LIM_mult ~> tendsto_mult
657 LIM_scaleR ~> tendsto_scaleR
658 LIM_of_real ~> tendsto_of_real
659 LIM_power ~> tendsto_power
660 LIM_inverse ~> tendsto_inverse
661 LIM_sgn ~> tendsto_sgn
662 isCont_LIM_compose ~> isCont_tendsto_compose
663 bounded_linear.LIM ~> bounded_linear.tendsto
664 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
665 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
666 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
667 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
668 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
669 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
671 * Theory Complex_Main: The definition of infinite series was
672 generalized. Now it is defined on the type class {topological_space,
673 comm_monoid_add}. Hence it is useable also for extended real numbers.
675 * Theory Complex_Main: The complex exponential function "expi" is now
676 a type-constrained abbreviation for "exp :: complex => complex"; thus
677 several polymorphic lemmas about "exp" are now applicable to "expi".
681 - Theory Library/Code_Char_ord provides native ordering of
682 characters in the target language.
684 - Commands code_module and code_library are legacy, use export_code
687 - Method "evaluation" is legacy, use method "eval" instead.
689 - Legacy evaluator "SML" is deactivated by default. May be
690 reactivated by the following theory command:
692 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
694 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
696 * New proof method "induction" that gives induction hypotheses the
697 name "IH", thus distinguishing them from further hypotheses that come
698 from rule induction. The latter are still called "hyps". Method
699 "induction" is a thin wrapper around "induct" and follows the same
702 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
703 still available as a legacy feature for some time.
706 - Added "need" and "total_consts" options.
707 - Reintroduced "show_skolems" option by popular demand.
708 - Renamed attribute: nitpick_def ~> nitpick_unfold.
712 - Use quasi-sound (and efficient) translations by default.
713 - Added support for the following provers: E-ToFoF, LEO-II,
714 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
715 - Automatically preplay and minimize proofs before showing them if
716 this can be done within reasonable time.
717 - sledgehammer available_provers ~> sledgehammer supported_provers.
719 - Added "preplay_timeout", "slicing", "type_enc", "sound",
720 "max_mono_iters", and "max_new_mono_instances" options.
721 - Removed "explicit_apply" and "full_types" options as well as "Full
722 Types" Proof General menu item. INCOMPATIBILITY.
725 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
726 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
730 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
731 "elim:" options. INCOMPATIBILITY.
732 - Introduced 'try' that not only runs 'try_methods' but also
733 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
736 - Added "eval" option to evaluate terms for the found counterexample
737 (currently only supported by the default (exhaustive) tester).
738 - Added post-processing of terms to obtain readable counterexamples
739 (currently only supported by the default (exhaustive) tester).
740 - New counterexample generator quickcheck[narrowing] enables
741 narrowing-based testing. Requires the Glasgow Haskell compiler
742 with its installation location defined in the Isabelle settings
743 environment as ISABELLE_GHC.
744 - Removed quickcheck tester "SML" based on the SML code generator
745 (formly in HOL/Library).
747 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
748 use 'partial_function' instead.
750 * Theory Library/Extended_Reals replaces now the positive extended
751 reals found in probability theory. This file is extended by
752 Multivariate_Analysis/Extended_Real_Limits.
754 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
755 from where it must be imported explicitly if it is really required.
758 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
759 been moved here. INCOMPATIBILITY.
761 * Theory Library/Saturated provides type of numbers with saturated
764 * Theory Library/Product_Lattice defines a pointwise ordering for the
765 product type 'a * 'b, and provides instance proofs for various order
766 and lattice type classes.
768 * Theory Library/Countable now provides the "countable_datatype" proof
769 method for proving "countable" class instances for datatypes.
771 * Theory Library/Cset_Monad allows do notation for computable sets
772 (cset) via the generic monad ad-hoc overloading facility.
774 * Library: Theories of common data structures are split into theories
775 for implementation, an invariant-ensuring type, and connection to an
776 abstract type. INCOMPATIBILITY.
778 - RBT is split into RBT and RBT_Mapping.
779 - AssocList is split and renamed into AList and AList_Mapping.
780 - DList is split into DList_Impl, DList, and DList_Cset.
781 - Cset is split into Cset and List_Cset.
783 * Theory Library/Nat_Infinity has been renamed to
784 Library/Extended_Nat, with name changes of the following types and
787 type inat ~> type enat
789 Infty ~> infinity (overloaded)
793 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
794 been renamed accordingly. INCOMPATIBILITY.
796 * Session Multivariate_Analysis: The euclidean_space type class now
797 fixes a constant "Basis :: 'a set" consisting of the standard
798 orthonormal basis for the type. Users now have the option of
799 quantifying over this set instead of using the "basis" function, e.g.
800 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
802 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
803 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
804 "Cart_nth" and "Cart_lambda" have been respectively renamed to
805 "vec_nth" and "vec_lambda"; theorems mentioning those names have
806 changed to match. Definition theorems for overloaded constants now use
807 the standard "foo_vec_def" naming scheme. A few other theorems have
808 been renamed as follows (INCOMPATIBILITY):
810 Cart_eq ~> vec_eq_iff
811 dist_nth_le_cart ~> dist_vec_nth_le
812 tendsto_vector ~> vec_tendstoI
813 Cauchy_vector ~> vec_CauchyI
815 * Session Multivariate_Analysis: Several duplicate theorems have been
816 removed, and other theorems have been renamed or replaced with more
817 general versions. INCOMPATIBILITY.
819 finite_choice ~> finite_set_choice
820 eventually_conjI ~> eventually_conj
821 eventually_and ~> eventually_conj_iff
822 eventually_false ~> eventually_False
823 setsum_norm ~> norm_setsum
824 Lim_sequentially ~> LIMSEQ_def
825 Lim_ident_at ~> LIM_ident
826 Lim_const ~> tendsto_const
827 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
828 Lim_neg ~> tendsto_minus
829 Lim_add ~> tendsto_add
830 Lim_sub ~> tendsto_diff
831 Lim_mul ~> tendsto_scaleR
832 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
833 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
834 Lim_linear ~> bounded_linear.tendsto
835 Lim_component ~> tendsto_euclidean_component
836 Lim_component_cart ~> tendsto_vec_nth
837 Lim_inner ~> tendsto_inner [OF tendsto_const]
838 dot_lsum ~> inner_setsum_left
839 dot_rsum ~> inner_setsum_right
840 continuous_cmul ~> continuous_scaleR [OF continuous_const]
841 continuous_neg ~> continuous_minus
842 continuous_sub ~> continuous_diff
843 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
844 continuous_mul ~> continuous_scaleR
845 continuous_inv ~> continuous_inverse
846 continuous_at_within_inv ~> continuous_at_within_inverse
847 continuous_at_inv ~> continuous_at_inverse
848 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
849 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
850 continuous_at_component ~> continuous_component [OF continuous_at_id]
851 continuous_on_neg ~> continuous_on_minus
852 continuous_on_sub ~> continuous_on_diff
853 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
854 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
855 continuous_on_mul ~> continuous_on_scaleR
856 continuous_on_mul_real ~> continuous_on_mult
857 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
858 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
859 continuous_on_inverse ~> continuous_on_inv
860 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
861 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
862 subset_interior ~> interior_mono
863 subset_closure ~> closure_mono
864 closure_univ ~> closure_UNIV
865 real_arch_lt ~> reals_Archimedean2
866 real_arch ~> reals_Archimedean3
867 real_abs_norm ~> abs_norm_cancel
868 real_abs_sub_norm ~> norm_triangle_ineq3
869 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
871 * Session HOL-Probability:
872 - Caratheodory's extension lemma is now proved for ring_of_sets.
873 - Infinite products of probability measures are now available.
874 - Sigma closure is independent, if the generator is independent
875 - Use extended reals instead of positive extended
876 reals. INCOMPATIBILITY.
878 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
880 expand_fun_below ~> fun_below_iff
881 below_fun_ext ~> fun_belowI
882 expand_cfun_eq ~> cfun_eq_iff
884 expand_cfun_below ~> cfun_below_iff
885 below_cfun_ext ~> cfun_belowI
886 monofun_fun_fun ~> fun_belowD
887 monofun_fun_arg ~> monofunE
888 monofun_lub_fun ~> adm_monofun [THEN admD]
889 cont_lub_fun ~> adm_cont [THEN admD]
890 cont2cont_Rep_CFun ~> cont2cont_APP
891 cont_Rep_CFun_app ~> cont_APP_app
892 cont_Rep_CFun_app_app ~> cont_APP_app_app
893 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
894 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
895 contlub_cfun ~> lub_APP [symmetric]
896 contlub_LAM ~> lub_LAM [symmetric]
899 lift_distinct1 ~> lift.distinct(1)
900 lift_distinct2 ~> lift.distinct(2)
901 Def_not_UU ~> lift.distinct(2)
902 Def_inject ~> lift.inject
903 below_UU_iff ~> below_bottom_iff
904 eq_UU_iff ~> eq_bottom_iff
907 *** Document preparation ***
909 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
910 isar-ref manual, both for description and actual application of the
913 * Antiquotation @{value} evaluates the given term and presents its
916 * Antiquotations: term style "isub" provides ad-hoc conversion of
917 variables x1, y23 into subscripted form x\<^isub>1,
920 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
921 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
923 * Localized \isabellestyle switch can be used within blocks or groups
926 \isabellestyle{it} %preferred default
927 {\isabellestylett @{text "typewriter stuff"}}
929 * Discontinued special treatment of hard tabulators. Implicit
930 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
936 * The inner syntax of sort/type/term/prop supports inlined YXML
937 representations within quoted string tokens. By encoding logical
938 entities via Term_XML (in ML or Scala) concrete syntax can be
939 bypassed, which is particularly useful for producing bits of text
940 under external program control.
942 * Antiquotations for ML and document preparation are managed as theory
943 data, which requires explicit setup.
945 * Isabelle_Process.is_active allows tools to check if the official
946 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
947 (better known as Proof General).
949 * Structure Proof_Context follows standard naming scheme. Old
950 ProofContext is still available for some time as legacy alias.
952 * Structure Timing provides various operations for timing; supersedes
953 former start_timing/end_timing etc.
955 * Path.print is the official way to show file-system paths to users
956 (including quotes etc.).
958 * Inner syntax: identifiers in parse trees of generic categories
959 "logic", "aprop", "idt" etc. carry position information (disguised as
960 type constraints). Occasional INCOMPATIBILITY with non-compliant
961 translations that choke on unexpected type constraints. Positions can
962 be stripped in ML translations via Syntax.strip_positions /
963 Syntax.strip_positions_ast, or via the syntax constant
964 "_strip_positions" within parse trees. As last resort, positions can
965 be disabled via the configuration option Syntax.positions, which is
966 called "syntax_positions" in Isar attribute syntax.
968 * Discontinued special status of various ML structures that contribute
969 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
970 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
971 refer directly to Ast.Constant, Lexicon.is_identifier,
972 Syntax_Trans.mk_binder_tr etc.
974 * Typed print translation: discontinued show_sorts argument, which is
975 already available via context of "advanced" translation.
977 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
978 goal states; body tactic needs to address all subgoals uniformly.
980 * Slightly more special eq_list/eq_set, with shortcut involving
981 pointer equality (assumes that eq relation is reflexive).
983 * Classical tactics use proper Proof.context instead of historic types
984 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
985 operate directly on Proof.context. Raw type claset retains its use as
986 snapshot of the classical context, which can be recovered via
987 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
988 INCOMPATIBILITY, classical tactics and derived proof methods require
989 proper Proof.context.
994 * Discontinued support for Poly/ML 5.2, which was the last version
995 without proper multithreading and TimeLimit implementation.
997 * Discontinued old lib/scripts/polyml-platform, which has been
998 obsolete since Isabelle2009-2.
1000 * Various optional external tools are referenced more robustly and
1001 uniformly by explicit Isabelle settings as follows:
1003 ISABELLE_CSDP (formerly CSDP_EXE)
1004 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1005 ISABELLE_OCAML (formerly EXEC_OCAML)
1006 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1007 ISABELLE_YAP (formerly EXEC_YAP)
1009 Note that automated detection from the file-system or search path has
1010 been discontinued. INCOMPATIBILITY.
1012 * Scala layer provides JVM method invocation service for static
1013 methods of type (String)String, see Invoke_Scala.method in ML. For
1016 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1018 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1019 this allows to pass structured values between ML and Scala.
1021 * The IsabelleText fonts includes some further glyphs to support the
1022 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1023 installed a local copy (which is normally *not* required) need to
1024 delete or update it from ~~/lib/fonts/.
1028 New in Isabelle2011 (January 2011)
1029 ----------------------------------
1033 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1034 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1035 useful tooltips and hyperlinks produced from its static analysis. The
1036 bundled component provides an executable Isabelle tool that can be run
1039 Isabelle2011/bin/isabelle jedit
1041 * Significantly improved Isabelle/Isar implementation manual.
1043 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1044 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1045 while the default heap location within that directory lacks that extra
1046 suffix. This isolates multiple Isabelle installations from each
1047 other, avoiding problems with old settings in new versions.
1048 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1050 * Source files are always encoded as UTF-8, instead of old-fashioned
1051 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1052 the following package declarations:
1054 \usepackage[utf8]{inputenc}
1055 \usepackage{textcomp}
1057 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1058 a Unicode character is treated as a single symbol, not a sequence of
1059 non-ASCII bytes as before. Since Isabelle/ML string literals may
1060 contain symbols without further backslash escapes, Unicode can now be
1061 used here as well. Recall that Symbol.explode in ML provides a
1062 consistent view on symbols, while raw explode (or String.explode)
1063 merely give a byte-oriented representation.
1065 * Theory loader: source files are primarily located via the master
1066 directory of each theory node (where the .thy file itself resides).
1067 The global load path is still partially available as legacy feature.
1068 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1069 explicit paths, relatively to the theory.
1071 * Special treatment of ML file names has been discontinued.
1072 Historically, optional extensions .ML or .sml were added on demand --
1073 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1074 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1076 * Various options that affect pretty printing etc. are now properly
1077 handled within the context via configuration options, instead of
1078 unsynchronized references or print modes. There are both ML Config.T
1079 entities and Isar declaration attributes to access these.
1081 ML (Config.T) Isar (attribute)
1083 eta_contract eta_contract
1084 show_brackets show_brackets
1085 show_sorts show_sorts
1086 show_types show_types
1087 show_question_marks show_question_marks
1088 show_consts show_consts
1089 show_abbrevs show_abbrevs
1091 Syntax.ast_trace syntax_ast_trace
1092 Syntax.ast_stat syntax_ast_stat
1093 Syntax.ambiguity_level syntax_ambiguity_level
1095 Goal_Display.goals_limit goals_limit
1096 Goal_Display.show_main_goal show_main_goal
1098 Method.rule_trace rule_trace
1100 Thy_Output.display thy_output_display
1101 Thy_Output.quotes thy_output_quotes
1102 Thy_Output.indent thy_output_indent
1103 Thy_Output.source thy_output_source
1104 Thy_Output.break thy_output_break
1106 Note that corresponding "..._default" references in ML may only be
1107 changed globally at the ROOT session setup, but *not* within a theory.
1108 The option "show_abbrevs" supersedes the former print mode
1109 "no_abbrevs" with inverted meaning.
1111 * More systematic naming of some configuration options.
1114 trace_simp ~> simp_trace
1115 debug_simp ~> simp_debug
1117 * Support for real valued configuration options, using simplistic
1118 floating-point notation that coincides with the inner syntax for
1121 * Support for real valued preferences (with approximative PGIP type):
1122 front-ends need to accept "pgint" values in float notation.
1125 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1128 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1133 * Command 'type_synonym' (with single argument) replaces somewhat
1134 outdated 'types', which is still available as legacy feature for some
1137 * Command 'nonterminal' (with 'and' separated list of arguments)
1138 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1140 * Command 'notepad' replaces former 'example_proof' for
1141 experimentation in Isar without any result. INCOMPATIBILITY.
1143 * Locale interpretation commands 'interpret' and 'sublocale' accept
1144 lists of equations to map definitions in a locale to appropriate
1145 entities in the context of the interpretation. The 'interpretation'
1146 command already provided this functionality.
1148 * Diagnostic command 'print_dependencies' prints the locale instances
1149 that would be activated if the specified expression was interpreted in
1150 the current context. Variant "print_dependencies!" assumes a context
1151 without interpretations.
1153 * Diagnostic command 'print_interps' prints interpretations in proofs
1154 in addition to interpretations in theories.
1156 * Discontinued obsolete 'global' and 'local' commands to manipulate
1157 the theory name space. Rare INCOMPATIBILITY. The ML functions
1158 Sign.root_path and Sign.local_path may be applied directly where this
1159 feature is still required for historical reasons.
1161 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1162 'definition' instead.
1164 * The "prems" fact, which refers to the accidental collection of
1165 foundational premises in the context, is now explicitly marked as
1166 legacy feature and will be discontinued soon. Consider using "assms"
1167 of the head statement or reference facts by explicit names.
1169 * Document antiquotations @{class} and @{type} print classes and type
1172 * Document antiquotation @{file} checks file/directory entries within
1173 the local file system.
1178 * Coercive subtyping: functions can be declared as coercions and type
1179 inference will add them as necessary upon input of a term. Theory
1180 Complex_Main declares real :: nat => real and real :: int => real as
1181 coercions. A coercion function f is declared like this:
1183 declare [[coercion f]]
1185 To lift coercions through type constructors (e.g. from nat => real to
1186 nat list => real list), map functions can be declared, e.g.
1188 declare [[coercion_map map]]
1190 Currently coercion inference is activated only in theories including
1191 real numbers, i.e. descendants of Complex_Main. This is controlled by
1192 the configuration option "coercion_enabled", e.g. it can be enabled in
1193 other theories like this:
1195 declare [[coercion_enabled]]
1197 * Command 'partial_function' provides basic support for recursive
1198 function definitions over complete partial orders. Concrete instances
1199 are provided for i) the option type, ii) tail recursion on arbitrary
1200 types, and iii) the heap monad of Imperative_HOL. See
1201 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1204 * Function package: f.psimps rules are no longer implicitly declared
1205 as [simp]. INCOMPATIBILITY.
1207 * Datatype package: theorems generated for executable equality (class
1208 "eq") carry proper names and are treated as default code equations.
1210 * Inductive package: now offers command 'inductive_simps' to
1211 automatically derive instantiated and simplified equations for
1212 inductive predicates, similar to 'inductive_cases'.
1214 * Command 'enriched_type' allows to register properties of the
1215 functorial structure of types.
1217 * Improved infrastructure for term evaluation using code generator
1218 techniques, in particular static evaluation conversions.
1220 * Code generator: Scala (2.8 or higher) has been added to the target
1223 * Code generator: globbing constant expressions "*" and "Theory.*"
1224 have been replaced by the more idiomatic "_" and "Theory._".
1227 * Code generator: export_code without explicit file declaration prints
1228 to standard output. INCOMPATIBILITY.
1230 * Code generator: do not print function definitions for case
1231 combinators any longer.
1233 * Code generator: simplification with rules determined with
1234 src/Tools/Code/code_simp.ML and method "code_simp".
1236 * Code generator for records: more idiomatic representation of record
1237 types. Warning: records are not covered by ancient SML code
1238 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1239 rep_datatype declaration helps to succeed then:
1243 rep_datatype foo_ext ...
1245 * Records: logical foundation type for records does not carry a
1246 '_type' suffix any longer (obsolete due to authentic syntax).
1249 * Quickcheck now by default uses exhaustive testing instead of random
1250 testing. Random testing can be invoked by "quickcheck [random]",
1251 exhaustive testing by "quickcheck [exhaustive]".
1253 * Quickcheck instantiates polymorphic types with small finite
1254 datatypes by default. This enables a simple execution mechanism to
1255 handle quantifiers and function equality over the finite datatypes.
1257 * Quickcheck random generator has been renamed from "code" to
1258 "random". INCOMPATIBILITY.
1260 * Quickcheck now has a configurable time limit which is set to 30
1261 seconds by default. This can be changed by adding [timeout = n] to the
1262 quickcheck command. The time limit for Auto Quickcheck is still set
1265 * Quickcheck in locales considers interpretations of that locale for
1266 counter example search.
1269 - Added "smt" and "remote_smt" provers based on the "smt" proof
1270 method. See the Sledgehammer manual for details ("isabelle doc
1273 sledgehammer atp_info ~> sledgehammer running_provers
1274 sledgehammer atp_kill ~> sledgehammer kill_provers
1275 sledgehammer available_atps ~> sledgehammer available_provers
1278 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1279 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1280 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1281 (and "ms" and "min" are no longer supported)
1286 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1287 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1289 - Added support for partial quotient types.
1290 - Added local versions of the "Nitpick.register_xxx" functions.
1291 - Added "whack" option.
1292 - Allow registration of quotient types as codatatypes.
1293 - Improved "merge_type_vars" option to merge more types.
1294 - Removed unsound "fast_descrs" option.
1295 - Added custom symmetry breaking for datatypes, making it possible to reach
1296 higher cardinalities.
1297 - Prevent the expansion of too large definitions.
1299 * Proof methods "metis" and "meson" now have configuration options
1300 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1301 to diagnose these tools. E.g.
1303 using [[metis_trace = true]]
1305 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1306 manually as command 'solve_direct'.
1308 * The default SMT solver Z3 must be enabled explicitly (due to
1309 licensing issues) by setting the environment variable
1310 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1311 commercial applications, the SMT solver CVC3 is provided as fall-back;
1312 changing the SMT solver is done via the configuration option
1315 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1316 i.e. "remote_cvc3" and "remote_z3".
1318 * Added basic SMT support for datatypes, records, and typedefs using
1319 the oracle mode (no proofs). Direct support of pairs has been dropped
1320 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1321 support for a similar behavior). Minor INCOMPATIBILITY.
1323 * Changed SMT configuration options:
1325 z3_proofs ~> smt_oracle (with inverted meaning)
1326 z3_trace_assms ~> smt_trace_used_facts
1339 * Boogie output files (.b2i files) need to be declared in the theory
1342 * Simplification procedure "list_to_set_comprehension" rewrites list
1343 comprehensions applied to List.set to set comprehensions. Occasional
1344 INCOMPATIBILITY, may be deactivated like this:
1346 declare [[simproc del: list_to_set_comprehension]]
1348 * Removed old version of primrec package. INCOMPATIBILITY.
1350 * Removed simplifier congruence rule of "prod_case", as has for long
1351 been the case with "split". INCOMPATIBILITY.
1353 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1355 * Removed [split_format ... and ... and ...] version of
1356 [split_format]. Potential INCOMPATIBILITY.
1358 * Predicate "sorted" now defined inductively, with nice induction
1359 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1361 * Constant "contents" renamed to "the_elem", to free the generic name
1362 contents for other uses. INCOMPATIBILITY.
1364 * Renamed class eq and constant eq (for code generation) to class
1365 equal and constant equal, plus renaming of related facts and various
1366 tuning. INCOMPATIBILITY.
1368 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1370 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1373 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1374 avoid confusion with finite sets. INCOMPATIBILITY.
1376 * Abandoned locales equiv, congruent and congruent2 for equivalence
1377 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1380 * Some previously unqualified names have been qualified:
1387 Trueprop ~> HOL.Trueprop
1392 op --> ~> HOL.implies
1404 Pair ~> Product_Type.Pair
1405 fst ~> Product_Type.fst
1406 snd ~> Product_Type.snd
1407 curry ~> Product_Type.curry
1409 Collect ~> Set.Collect
1413 * More canonical naming convention for some fundamental definitions:
1415 bot_bool_eq ~> bot_bool_def
1416 top_bool_eq ~> top_bool_def
1417 inf_bool_eq ~> inf_bool_def
1418 sup_bool_eq ~> sup_bool_def
1419 bot_fun_eq ~> bot_fun_def
1420 top_fun_eq ~> top_fun_def
1421 inf_fun_eq ~> inf_fun_def
1422 sup_fun_eq ~> sup_fun_def
1426 * More stylized fact names:
1428 expand_fun_eq ~> fun_eq_iff
1429 expand_set_eq ~> set_eq_iff
1431 nat_number ~> eval_nat_numeral
1435 * Refactoring of code-generation specific operations in theory List:
1441 mem_iff ~> member_def
1442 null_empty ~> null_def
1444 INCOMPATIBILITY. Note that these were not supposed to be used
1445 regularly unless for striking reasons; their main purpose was code
1448 Various operations from the Haskell prelude are used for generating
1451 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1452 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1453 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1455 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1456 "*" and "+" respectively. INCOMPATIBILITY.
1458 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1459 "Sum_Type.Plus" instead.
1461 * Constant "split" has been merged with constant "prod_case"; names of
1462 ML functions, facts etc. involving split have been retained so far,
1463 though. INCOMPATIBILITY.
1465 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1466 instead. INCOMPATIBILITY.
1468 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1471 * Former theory Library/Enum is now part of the HOL-Main image.
1472 INCOMPATIBILITY: all constants of the Enum theory now have to be
1473 referred to by its qualified name.
1476 nlists ~> Enum.nlists
1477 product ~> Enum.product
1479 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1480 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1483 * Theory Library/SetsAndFunctions has been split into
1484 Library/Function_Algebras and Library/Set_Algebras; canonical names
1485 for instance definitions for functions; various improvements.
1488 * Theory Library/Multiset provides stable quicksort implementation of
1491 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1494 * Session Multivariate_Analysis: introduced a type class for euclidean
1495 space. Most theorems are now stated in terms of euclidean spaces
1496 instead of finite cartesian products.
1499 real ^ 'n ~> 'a::real_vector
1500 ~> 'a::euclidean_space
1501 ~> 'a::ordered_euclidean_space
1502 (depends on your needs)
1506 \<chi> x. _ ~> \<chi>\<chi> x. _
1509 Also note that the indices are now natural numbers and not from some
1510 finite type. Finite cartesian products of euclidean spaces, products
1511 of euclidean spaces the real and complex numbers are instantiated to
1512 be euclidean_spaces. INCOMPATIBILITY.
1514 * Session Probability: introduced pextreal as positive extended real
1515 numbers. Use pextreal as value for measures. Introduce the
1516 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1517 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1518 the integral in Multivariate Analysis. INCOMPATIBILITY.
1520 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1523 * Session SPARK (with image HOL-SPARK) provides commands to load and
1524 prove verification conditions generated by the SPARK Ada program
1525 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1530 * Theorems for additive ring operations (locale abelian_monoid and
1531 descendants) are generated by interpretation from their multiplicative
1532 counterparts. Names (in particular theorem names) have the mandatory
1533 qualifier 'add'. Previous theorem names are redeclared for
1536 * Structure "int_ring" is now an abbreviation (previously a
1537 definition). This fits more natural with advanced interpretations.
1542 * The domain package now runs in definitional mode by default: The
1543 former command 'new_domain' is now called 'domain'. To use the domain
1544 package in its original axiomatic mode, use 'domain (unsafe)'.
1547 * The new class "domain" is now the default sort. Class "predomain"
1548 is an unpointed version of "domain". Theories can be updated by
1549 replacing sort annotations as shown below. INCOMPATIBILITY.
1551 'a::type ~> 'a::countable
1552 'a::cpo ~> 'a::predomain
1553 'a::pcpo ~> 'a::domain
1555 * The old type class "rep" has been superseded by class "domain".
1556 Accordingly, users of the definitional package must remove any
1557 "default_sort rep" declarations. INCOMPATIBILITY.
1559 * The domain package (definitional mode) now supports unpointed
1560 predomain argument types, as long as they are marked 'lazy'. (Strict
1561 arguments must be in class "domain".) For example, the following
1562 domain definition now works:
1564 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1566 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1567 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1568 'a option, and 'a list. Additionally, it configures fixrec and the
1569 domain package to work with these types. For example:
1571 fixrec isInl :: "('a + 'b) u -> tr"
1572 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1574 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1576 * The "(permissive)" option of fixrec has been replaced with a
1577 per-equation "(unchecked)" option. See
1578 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1580 * The "bifinite" class no longer fixes a constant "approx"; the class
1581 now just asserts that such a function exists. INCOMPATIBILITY.
1583 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1584 defines an embedding of type 'a defl into udom by default; instances
1585 of "bifinite" and "domain" classes are available in
1586 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1588 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1590 * The predicate "directed" has been removed. INCOMPATIBILITY.
1592 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1594 * The function "cprod_map" has been renamed to "prod_map".
1597 * The monadic bind operator on each powerdomain has new binder syntax
1598 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1599 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1601 * The infix syntax for binary union on each powerdomain has changed
1602 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1603 syntax. INCOMPATIBILITY.
1605 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1606 still supported as an input translation.
1608 * Renamed some theorems (the original names are also still available).
1610 expand_fun_below ~> fun_below_iff
1611 below_fun_ext ~> fun_belowI
1612 expand_cfun_eq ~> cfun_eq_iff
1613 ext_cfun ~> cfun_eqI
1614 expand_cfun_below ~> cfun_below_iff
1615 below_cfun_ext ~> cfun_belowI
1616 cont2cont_Rep_CFun ~> cont2cont_APP
1618 * The Abs and Rep functions for various types have changed names.
1619 Related theorem names have also changed to match. INCOMPATIBILITY.
1621 Rep_CFun ~> Rep_cfun
1622 Abs_CFun ~> Abs_cfun
1623 Rep_Sprod ~> Rep_sprod
1624 Abs_Sprod ~> Abs_sprod
1625 Rep_Ssum ~> Rep_ssum
1626 Abs_Ssum ~> Abs_ssum
1628 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1629 been renamed to *_bottom_iff. INCOMPATIBILITY.
1631 * Various changes to bisimulation/coinduction with domain package:
1633 - Definitions of "bisim" constants no longer mention definedness.
1634 - With mutual recursion, "bisim" predicate is now curried.
1635 - With mutual recursion, each type gets a separate coind theorem.
1636 - Variable names in bisim_def and coinduct rules have changed.
1640 * Case combinators generated by the domain package for type "foo" are
1641 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1643 * Several theorems have been renamed to more accurately reflect the
1644 names of constants and types involved. INCOMPATIBILITY.
1646 thelub_const ~> lub_const
1647 lub_const ~> is_lub_const
1649 is_lub_lub ~> is_lubD2
1651 unique_lub ~> is_lub_unique
1652 is_ub_lub ~> is_lub_rangeD1
1653 lub_bin_chain ~> is_lub_bin_chain
1654 lub_fun ~> is_lub_fun
1655 thelub_fun ~> lub_fun
1656 thelub_cfun ~> lub_cfun
1657 thelub_Pair ~> lub_Pair
1658 lub_cprod ~> is_lub_prod
1659 thelub_cprod ~> lub_prod
1660 minimal_cprod ~> minimal_prod
1661 inst_cprod_pcpo ~> inst_prod_pcpo
1663 compact_UU ~> compact_bottom
1664 deflation_UU ~> deflation_bottom
1665 finite_deflation_UU ~> finite_deflation_bottom
1667 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1669 sq_ord_less_eq_trans ~> below_eq_trans
1670 sq_ord_eq_less_trans ~> eq_below_trans
1671 refl_less ~> below_refl
1672 trans_less ~> below_trans
1673 antisym_less ~> below_antisym
1674 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1675 box_less ~> box_below
1676 rev_trans_less ~> rev_below_trans
1677 not_less2not_eq ~> not_below2not_eq
1678 less_UU_iff ~> below_UU_iff
1679 flat_less_iff ~> flat_below_iff
1680 adm_less ~> adm_below
1681 adm_not_less ~> adm_not_below
1682 adm_compact_not_less ~> adm_compact_not_below
1683 less_fun_def ~> below_fun_def
1684 expand_fun_less ~> fun_below_iff
1685 less_fun_ext ~> fun_belowI
1686 less_discr_def ~> below_discr_def
1687 discr_less_eq ~> discr_below_eq
1688 less_unit_def ~> below_unit_def
1689 less_cprod_def ~> below_prod_def
1690 prod_lessI ~> prod_belowI
1691 Pair_less_iff ~> Pair_below_iff
1692 fst_less_iff ~> fst_below_iff
1693 snd_less_iff ~> snd_below_iff
1694 expand_cfun_less ~> cfun_below_iff
1695 less_cfun_ext ~> cfun_belowI
1696 injection_less ~> injection_below
1697 less_up_def ~> below_up_def
1698 not_Iup_less ~> not_Iup_below
1699 Iup_less ~> Iup_below
1701 Def_inject_less_eq ~> Def_below_Def
1702 Def_less_is_eq ~> Def_below_iff
1703 spair_less_iff ~> spair_below_iff
1704 less_sprod ~> below_sprod
1705 spair_less ~> spair_below
1706 sfst_less_iff ~> sfst_below_iff
1707 ssnd_less_iff ~> ssnd_below_iff
1708 fix_least_less ~> fix_least_below
1709 dist_less_one ~> dist_below_one
1710 less_ONE ~> below_ONE
1711 ONE_less_iff ~> ONE_below_iff
1712 less_sinlD ~> below_sinlD
1713 less_sinrD ~> below_sinrD
1718 * All constant names are now qualified internally and use proper
1719 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1724 * Antiquotation @{assert} inlines a function bool -> unit that raises
1725 Fail if the argument is false. Due to inlining the source position of
1726 failed assertions is included in the error output.
1728 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1729 text is in practice always evaluated with a stable theory checkpoint.
1730 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1732 * Antiquotation @{theory A} refers to theory A from the ancestry of
1733 the current context, not any accidental theory loader state as before.
1734 Potential INCOMPATIBILITY, subtle change in semantics.
1736 * Syntax.pretty_priority (default 0) configures the required priority
1737 of pretty-printed output and thus affects insertion of parentheses.
1739 * Syntax.default_root (default "any") configures the inner syntax
1740 category (nonterminal symbol) for parsing of terms.
1742 * Former exception Library.UnequalLengths now coincides with
1743 ListPair.UnequalLengths.
1745 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1746 main functionality is provided by structure Simplifier.
1748 * Renamed raw "explode" function to "raw_explode" to emphasize its
1749 meaning. Note that internally to Isabelle, Symbol.explode is used in
1750 almost all situations.
1752 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1753 See implementation manual for further details on exceptions in
1756 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1759 * Renamed structure PureThy to Pure_Thy and moved most of its
1760 operations to structure Global_Theory, to emphasize that this is
1761 rarely-used global-only stuff.
1763 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1764 instead (or tracing for high-volume output).
1766 * Configuration option show_question_marks only affects regular pretty
1767 printing of types and terms, not raw Term.string_of_vname.
1769 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1770 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1771 @{thms} for most purposes.
1773 * ML structure Unsynchronized is never opened, not even in Isar
1774 interaction mode as before. Old Unsynchronized.set etc. have been
1775 discontinued -- use plain := instead. This should be *rare* anyway,
1776 since modern tools always work via official context data, notably
1777 configuration options.
1779 * Parallel and asynchronous execution requires special care concerning
1780 interrupts. Structure Exn provides some convenience functions that
1781 avoid working directly with raw Interrupt. User code must not absorb
1782 interrupts -- intermediate handling (for cleanup etc.) needs to be
1783 followed by re-raising of the original exception. Another common
1784 source of mistakes are "handle _" patterns, which make the meaning of
1785 the program subject to physical effects of the environment.
1789 New in Isabelle2009-2 (June 2010)
1790 ---------------------------------
1794 * Authentic syntax for *all* logical entities (type classes, type
1795 constructors, term constants): provides simple and robust
1796 correspondence between formal entities and concrete syntax. Within
1797 the parse tree / AST representations, "constants" are decorated by
1798 their category (class, type, const) and spelled out explicitly with
1799 their full internal name.
1801 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1802 and translations (translation rules and translation functions in ML).
1803 Some hints on upgrading:
1805 - Many existing uses of 'syntax' and 'translations' can be replaced
1806 by more modern 'type_notation', 'notation' and 'abbreviation',
1807 which are independent of this issue.
1809 - 'translations' require markup within the AST; the term syntax
1810 provides the following special forms:
1812 CONST c -- produces syntax version of constant c from context
1813 XCONST c -- literally c, checked as constant from context
1814 c -- literally c, if declared by 'syntax'
1816 Plain identifiers are treated as AST variables -- occasionally the
1817 system indicates accidental variables via the error "rhs contains
1820 Type classes and type constructors are marked according to their
1821 concrete syntax. Some old translations rules need to be written
1822 for the "type" category, using type constructor application
1823 instead of pseudo-term application of the default category
1826 - 'parse_translation' etc. in ML may use the following
1829 @{class_syntax c} -- type class c within parse tree / AST
1830 @{term_syntax c} -- type constructor c within parse tree / AST
1831 @{const_syntax c} -- ML version of "CONST c" above
1832 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1834 - Literal types within 'typed_print_translations', i.e. those *not*
1835 represented as pseudo-terms are represented verbatim. Use @{class
1836 c} or @{type_name c} here instead of the above syntax
1839 Note that old non-authentic syntax was based on unqualified base
1840 names, so all of the above "constant" names would coincide. Recall
1841 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1842 diagnose syntax problems.
1844 * Type constructors admit general mixfix syntax, not just infix.
1846 * Concrete syntax may be attached to local entities without a proof
1847 body, too. This works via regular mixfix annotations for 'fix',
1848 'def', 'obtain' etc. or via the explicit 'write' command, which is
1849 similar to the 'notation' command in theory specifications.
1851 * Discontinued unnamed infix syntax (legacy feature for many years) --
1852 need to specify constant name and syntax separately. Internal ML
1853 datatype constructors have been renamed from InfixName to Infix etc.
1854 Minor INCOMPATIBILITY.
1856 * Schematic theorem statements need to be explicitly markup as such,
1857 via commands 'schematic_lemma', 'schematic_theorem',
1858 'schematic_corollary'. Thus the relevance of the proof is made
1859 syntactically clear, which impacts performance in a parallel or
1860 asynchronous interactive environment. Minor INCOMPATIBILITY.
1862 * Use of cumulative prems via "!" in some proof methods has been
1863 discontinued (old legacy feature).
1865 * References 'trace_simp' and 'debug_simp' have been replaced by
1866 configuration options stored in the context. Enabling tracing (the
1867 case of debugging is similar) in proofs works via
1869 using [[trace_simp = true]]
1871 Tracing is then active for all invocations of the simplifier in
1872 subsequent goal refinement steps. Tracing may also still be enabled or
1873 disabled via the ProofGeneral settings menu.
1875 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1876 'hide_fact' replace the former 'hide' KIND command. Minor
1879 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1880 more efficient than combinations with -q1 or -q2.
1885 * Proofterms record type-class reasoning explicitly, using the
1886 "unconstrain" operation internally. This eliminates all sort
1887 constraints from a theorem and proof, introducing explicit
1888 OFCLASS-premises. On the proof term level, this operation is
1889 automatically applied at theorem boundaries, such that closed proofs
1890 are always free of sort constraints. INCOMPATIBILITY for tools that
1891 inspect proof terms.
1893 * Local theory specifications may depend on extra type variables that
1894 are not present in the result type -- arguments TYPE('a) :: 'a itself
1895 are added internally. For example:
1897 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1899 * Predicates of locales introduced by classes carry a mandatory
1900 "class" prefix. INCOMPATIBILITY.
1902 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1904 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1907 * Command 'code_reflect' allows to incorporate generated ML code into
1908 runtime environment; replaces immature code_datatype antiquotation.
1911 * Code generator: simple concept for abstract datatypes obeying
1914 * Code generator: details of internal data cache have no impact on the
1915 user space functionality any longer.
1917 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1918 subgoals. This is more appropriate for interpretations with 'where'.
1921 * Command 'example_proof' opens an empty proof body. This allows to
1922 experiment with Isar, without producing any persistent result.
1924 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1925 within a local theory context, with explicit checking of the
1926 constructors involved (in contrast to the raw 'syntax' versions).
1928 * Commands 'types' and 'typedecl' now work within a local theory
1929 context -- without introducing dependencies on parameters or
1930 assumptions, which is not possible in Isabelle/Pure.
1932 * Command 'defaultsort' has been renamed to 'default_sort', it works
1933 within a local theory context. Minor INCOMPATIBILITY.
1938 * Command 'typedef' now works within a local theory context -- without
1939 introducing dependencies on parameters or assumptions, which is not
1940 possible in Isabelle/Pure/HOL. Note that the logical environment may
1941 contain multiple interpretations of local typedefs (with different
1942 non-emptiness proofs), even in a global theory context.
1944 * New package for quotient types. Commands 'quotient_type' and
1945 'quotient_definition' may be used for defining types and constants by
1946 quotient constructions. An example is the type of integers created by
1947 quotienting pairs of natural numbers:
1950 intrel :: "(nat * nat) => (nat * nat) => bool"
1952 "intrel (x, y) (u, v) = (x + v = u + y)"
1954 quotient_type int = "nat * nat" / intrel
1955 by (auto simp add: equivp_def expand_fun_eq)
1958 "0::int" is "(0::nat, 0::nat)"
1960 The method "lifting" can be used to lift of theorems from the
1961 underlying "raw" type to the quotient type. The example
1962 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1963 construction and provides a reasoning infrastructure for finite sets.
1965 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1966 clash with new theory Quotient in Main HOL.
1968 * Moved the SMT binding into the main HOL session, eliminating
1969 separate HOL-SMT session.
1971 * List membership infix mem operation is only an input abbreviation.
1974 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1975 for future developements; former Library/Word.thy is still present in
1976 the AFP entry RSAPPS.
1978 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1979 longer shadowed. INCOMPATIBILITY.
1981 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1984 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1987 * Dropped normalizing_semiring etc; use the facts in semiring classes
1988 instead. INCOMPATIBILITY.
1990 * Dropped several real-specific versions of lemmas about floor and
1991 ceiling; use the generic lemmas from theory "Archimedean_Field"
1992 instead. INCOMPATIBILITY.
1994 floor_number_of_eq ~> floor_number_of
1995 le_floor_eq_number_of ~> number_of_le_floor
1996 le_floor_eq_zero ~> zero_le_floor
1997 le_floor_eq_one ~> one_le_floor
1998 floor_less_eq_number_of ~> floor_less_number_of
1999 floor_less_eq_zero ~> floor_less_zero
2000 floor_less_eq_one ~> floor_less_one
2001 less_floor_eq_number_of ~> number_of_less_floor
2002 less_floor_eq_zero ~> zero_less_floor
2003 less_floor_eq_one ~> one_less_floor
2004 floor_le_eq_number_of ~> floor_le_number_of
2005 floor_le_eq_zero ~> floor_le_zero
2006 floor_le_eq_one ~> floor_le_one
2007 floor_subtract_number_of ~> floor_diff_number_of
2008 floor_subtract_one ~> floor_diff_one
2009 ceiling_number_of_eq ~> ceiling_number_of
2010 ceiling_le_eq_number_of ~> ceiling_le_number_of
2011 ceiling_le_zero_eq ~> ceiling_le_zero
2012 ceiling_le_eq_one ~> ceiling_le_one
2013 less_ceiling_eq_number_of ~> number_of_less_ceiling
2014 less_ceiling_eq_zero ~> zero_less_ceiling
2015 less_ceiling_eq_one ~> one_less_ceiling
2016 ceiling_less_eq_number_of ~> ceiling_less_number_of
2017 ceiling_less_eq_zero ~> ceiling_less_zero
2018 ceiling_less_eq_one ~> ceiling_less_one
2019 le_ceiling_eq_number_of ~> number_of_le_ceiling
2020 le_ceiling_eq_zero ~> zero_le_ceiling
2021 le_ceiling_eq_one ~> one_le_ceiling
2022 ceiling_subtract_number_of ~> ceiling_diff_number_of
2023 ceiling_subtract_one ~> ceiling_diff_one
2025 * Theory "Finite_Set": various folding_XXX locales facilitate the
2026 application of the various fold combinators on finite sets.
2028 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2029 provides abstract red-black tree type which is backed by "RBT_Impl" as
2030 implementation. INCOMPATIBILTY.
2032 * Theory Library/Coinductive_List has been removed -- superseded by
2033 AFP/thys/Coinductive.
2035 * Theory PReal, including the type "preal" and related operations, has
2036 been removed. INCOMPATIBILITY.
2038 * Real: new development using Cauchy Sequences.
2040 * Split off theory "Big_Operators" containing setsum, setprod,
2041 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2043 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2044 "Int" etc. INCOMPATIBILITY.
2046 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2048 * New set of rules "ac_simps" provides combined assoc / commute
2049 rewrites for all interpretations of the appropriate generic locales.
2051 * Renamed theory "OrderedGroup" to "Groups" and split theory
2052 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2053 appropriate and more consistent names suitable for name prefixes
2054 within the HOL theories. INCOMPATIBILITY.
2056 * Some generic constants have been put to appropriate theories:
2057 - less_eq, less: Orderings
2058 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2059 - inverse, divide: Rings
2062 * More consistent naming of type classes involving orderings (and
2065 lower_semilattice ~> semilattice_inf
2066 upper_semilattice ~> semilattice_sup
2068 dense_linear_order ~> dense_linorder
2070 pordered_ab_group_add ~> ordered_ab_group_add
2071 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2072 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2073 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2074 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2075 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2076 pordered_cancel_semiring ~> ordered_cancel_semiring
2077 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2078 pordered_comm_ring ~> ordered_comm_ring
2079 pordered_comm_semiring ~> ordered_comm_semiring
2080 pordered_ring ~> ordered_ring
2081 pordered_ring_abs ~> ordered_ring_abs
2082 pordered_semiring ~> ordered_semiring
2084 ordered_ab_group_add ~> linordered_ab_group_add
2085 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2086 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2087 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2088 ordered_field ~> linordered_field
2089 ordered_field_no_lb ~> linordered_field_no_lb
2090 ordered_field_no_ub ~> linordered_field_no_ub
2091 ordered_field_dense_linear_order ~> dense_linordered_field
2092 ordered_idom ~> linordered_idom
2093 ordered_ring ~> linordered_ring
2094 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2095 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2096 ordered_ring_strict ~> linordered_ring_strict
2097 ordered_semidom ~> linordered_semidom
2098 ordered_semiring ~> linordered_semiring
2099 ordered_semiring_1 ~> linordered_semiring_1
2100 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2101 ordered_semiring_strict ~> linordered_semiring_strict
2103 The following slightly odd type classes have been moved to a
2104 separate theory Library/Lattice_Algebras:
2106 lordered_ab_group_add ~> lattice_ab_group_add
2107 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2108 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2109 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2110 lordered_ring ~> lattice_ring
2114 * Refined field classes:
2115 - classes division_ring_inverse_zero, field_inverse_zero,
2116 linordered_field_inverse_zero include rule inverse 0 = 0 --
2117 subsumes former division_by_zero class;
2118 - numerous lemmas have been ported from field to division_ring.
2121 * Refined algebra theorem collections:
2122 - dropped theorem group group_simps, use algebra_simps instead;
2123 - dropped theorem group ring_simps, use field_simps instead;
2124 - proper theorem collection field_simps subsumes former theorem
2125 groups field_eq_simps and field_simps;
2126 - dropped lemma eq_minus_self_iff which is a duplicate for
2130 * Theory Finite_Set and List: some lemmas have been generalized from
2133 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2134 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2135 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2136 union_Union_fold_union ~> sup_Sup_fold_sup
2137 Inter_fold_inter ~> Inf_fold_inf
2138 Union_fold_union ~> Sup_fold_sup
2139 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2140 union_UNION_fold_union ~> sup_SUPR_fold_sup
2141 INTER_fold_inter ~> INFI_fold_inf
2142 UNION_fold_union ~> SUPR_fold_sup
2144 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2145 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2146 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2147 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2148 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2149 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2151 * Reorganized theory Multiset: swapped notation of pointwise and
2154 - pointwise ordering is instance of class order with standard syntax
2156 - multiset ordering has syntax <=# and <#; partial order properties
2157 are provided by means of interpretation with prefix
2159 - less duplication, less historical organization of sections,
2160 conversion from associations lists to multisets, rudimentary code
2162 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2167 multiset_eq_conv_count_eq ~> multiset_ext_iff
2168 multi_count_ext ~> multiset_ext
2169 diff_union_inverse2 ~> diff_union_cancelR
2173 * Theory Permutation: replaced local "remove" by List.remove1.
2175 * Code generation: ML and OCaml code is decorated with signatures.
2177 * Theory List: added transpose.
2179 * Library/Nat_Bijection.thy is a collection of bijective functions
2180 between nat and other types, which supersedes the older libraries
2181 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2184 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2185 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2186 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2187 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2188 Countable.pair_encode ~> prod_encode
2189 NatIso.prod2nat ~> prod_encode
2190 NatIso.nat2prod ~> prod_decode
2191 NatIso.sum2nat ~> sum_encode
2192 NatIso.nat2sum ~> sum_decode
2193 NatIso.list2nat ~> list_encode
2194 NatIso.nat2list ~> list_decode
2195 NatIso.set2nat ~> set_encode
2196 NatIso.nat2set ~> set_decode
2199 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2200 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2201 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2202 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2203 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2204 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2205 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2206 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2207 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2208 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2209 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2210 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2211 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2214 - Renamed ATP commands:
2215 atp_info ~> sledgehammer running_atps
2216 atp_kill ~> sledgehammer kill_atps
2217 atp_messages ~> sledgehammer messages
2218 atp_minimize ~> sledgehammer minimize
2219 print_atps ~> sledgehammer available_atps
2221 - Added user's manual ("isabelle doc sledgehammer").
2222 - Added option syntax and "sledgehammer_params" to customize
2223 Sledgehammer's behavior. See the manual for details.
2224 - Modified the Isar proof reconstruction code so that it produces
2225 direct proofs rather than proofs by contradiction. (This feature
2226 is still experimental.)
2227 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2229 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2232 - Added and implemented "binary_ints" and "bits" options.
2233 - Added "std" option and implemented support for nonstandard models.
2234 - Added and implemented "finitize" option to improve the precision
2235 of infinite datatypes based on a monotonicity analysis.
2236 - Added support for quotient types.
2237 - Added support for "specification" and "ax_specification"
2239 - Added support for local definitions (for "function" and
2240 "termination" proofs).
2241 - Added support for term postprocessors.
2242 - Optimized "Multiset.multiset" and "FinFun.finfun".
2243 - Improved efficiency of "destroy_constrs" optimization.
2244 - Fixed soundness bugs related to "destroy_constrs" optimization and
2246 - Fixed soundness bug related to higher-order constructors.
2247 - Fixed soundness bug when "full_descrs" is enabled.
2248 - Improved precision of set constructs.
2249 - Added "atoms" option.
2250 - Added cache to speed up repeated Kodkod invocations on the same
2252 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2253 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2254 "SAT4J_Light". INCOMPATIBILITY.
2255 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2256 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2257 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2259 * Method "induct" now takes instantiations of the form t, where t is not
2260 a variable, as a shorthand for "x == t", where x is a fresh variable.
2261 If this is not intended, t has to be enclosed in parentheses.
2262 By default, the equalities generated by definitional instantiations
2263 are pre-simplified, which may cause parameters of inductive cases
2264 to disappear, or may even delete some of the inductive cases.
2265 Use "induct (no_simp)" instead of "induct" to restore the old
2266 behaviour. The (no_simp) option is also understood by the "cases"
2267 and "nominal_induct" methods, which now perform pre-simplification, too.
2273 * Variable names in lemmas generated by the domain package have
2274 changed; the naming scheme is now consistent with the HOL datatype
2275 package. Some proof scripts may be affected, INCOMPATIBILITY.
2277 * The domain package no longer defines the function "foo_copy" for
2278 recursive domain "foo". The reach lemma is now stated directly in
2279 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2280 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2282 * Most definedness lemmas generated by the domain package (previously
2283 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2284 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2285 Proofs that used definedness lemmas as intro rules may break,
2286 potential INCOMPATIBILITY.
2288 * Induction and casedist rules generated by the domain package now
2289 declare proper case_names (one called "bottom", and one named for each
2290 constructor). INCOMPATIBILITY.
2292 * For mutually-recursive domains, separate "reach" and "take_lemma"
2293 rules are generated for each domain, INCOMPATIBILITY.
2295 foo_bar.reach ~> foo.reach bar.reach
2296 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2298 * Some lemmas generated by the domain package have been renamed for
2299 consistency with the datatype package, INCOMPATIBILITY.
2301 foo.ind ~> foo.induct
2302 foo.finite_ind ~> foo.finite_induct
2303 foo.coind ~> foo.coinduct
2304 foo.casedist ~> foo.exhaust
2305 foo.exhaust ~> foo.nchotomy
2307 * For consistency with other definition packages, the fixrec package
2308 now generates qualified theorem names, INCOMPATIBILITY.
2310 foo_simps ~> foo.simps
2311 foo_unfold ~> foo.unfold
2312 foo_induct ~> foo.induct
2314 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2315 method and internal fixrec proofs now use the default simpset instead.
2318 * The "contlub" predicate has been removed. Proof scripts should use
2319 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2321 * The "admw" predicate has been removed, INCOMPATIBILITY.
2323 * The constants cpair, cfst, and csnd have been removed in favor of
2324 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2329 * Antiquotations for basic formal entities:
2331 @{class NAME} -- type class
2332 @{class_syntax NAME} -- syntax representation of the above
2334 @{type_name NAME} -- logical type
2335 @{type_abbrev NAME} -- type abbreviation
2336 @{nonterminal NAME} -- type of concrete syntactic category
2337 @{type_syntax NAME} -- syntax representation of any of the above
2339 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2340 @{const_abbrev NAME} -- abbreviated constant
2341 @{const_syntax NAME} -- syntax representation of any of the above
2343 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2344 syntax constant (cf. 'syntax' command).
2346 * Antiquotation @{make_string} inlines a function to print arbitrary
2347 values similar to the ML toplevel. The result is compiler dependent
2348 and may fall back on "?" in certain situations.
2350 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2351 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2352 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2353 not work with the asynchronous Isar document model.
2355 * Configuration options now admit dynamic default values, depending on
2356 the context or even global references.
2358 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2359 uses an efficient external library if available (for Poly/ML).
2361 * Renamed some important ML structures, while keeping the old names
2362 for some time as aliases within the structure Legacy:
2364 OuterKeyword ~> Keyword
2367 OuterSyntax ~> Outer_Syntax
2368 PrintMode ~> Print_Mode
2369 SpecParse ~> Parse_Spec
2372 ThyOutput ~> Thy_Output
2373 TypeInfer ~> Type_Infer
2375 Note that "open Legacy" simplifies porting of sources, but forgetting
2376 to remove it again will complicate porting again in the future.
2378 * Most operations that refer to a global context are named
2379 accordingly, e.g. Simplifier.global_context or
2380 ProofContext.init_global. There are some situations where a global
2381 context actually works, but under normal circumstances one needs to
2382 pass the proper local context through the code!
2384 * Discontinued old TheoryDataFun with its copy/init operation -- data
2385 needs to be pure. Functor Theory_Data_PP retains the traditional
2386 Pretty.pp argument to merge, which is absent in the standard
2387 Theory_Data version.
2389 * Sorts.certify_sort and derived "cert" operations for types and terms
2390 no longer minimize sorts. Thus certification at the boundary of the
2391 inference kernel becomes invariant under addition of class relations,
2392 which is an important monotonicity principle. Sorts are now minimized
2393 in the syntax layer only, at the boundary between the end-user and the
2394 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2395 explicitly in rare situations.
2397 * Renamed old-style Drule.standard to Drule.export_without_context, to
2398 emphasize that this is in no way a standard operation.
2401 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2402 usual for resolution. Rare INCOMPATIBILITY.
2404 * Renamed varify/unvarify operations to varify_global/unvarify_global
2405 to emphasize that these only work in a global situation (which is
2408 * Curried take and drop in library.ML; negative length is interpreted
2409 as infinity (as in chop). Subtle INCOMPATIBILITY.
2411 * Proof terms: type substitutions on proof constants now use canonical
2412 order of type variables. INCOMPATIBILITY for tools working with proof
2415 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2416 may no longer carry premises. User-level specifications are
2417 transformed accordingly by Thm.add_axiom/add_def.
2422 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2423 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2424 proof terms are enabled unconditionally in the new HOL-Proofs image.
2426 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2427 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2430 * Old lib/scripts/polyml-platform is superseded by the
2431 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2432 variant, even on a 64 bit machine. The following example setting
2433 prefers 64 bit if available:
2435 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2437 * The preliminary Isabelle/jEdit application demonstrates the emerging
2438 Isabelle/Scala layer for advanced prover interaction and integration.
2439 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2442 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2443 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2444 similar to the default assignment of the document preparation system
2445 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2446 provides some operations for direct access to the font without asking
2447 the user for manual installation.
2451 New in Isabelle2009-1 (December 2009)
2452 -------------------------------------
2456 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2457 one backslash should be used, even in ML sources.
2462 * Locale interpretation propagates mixins along the locale hierarchy.
2463 The currently only available mixins are the equations used to map
2464 local definitions to terms of the target domain of an interpretation.
2466 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2467 loc" to print all interpretations of locale "loc" in the theory.
2468 Interpretations in proofs are not shown.
2470 * Thoroughly revised locales tutorial. New section on conditional
2473 * On instantiation of classes, remaining undefined class parameters
2474 are formally declared. INCOMPATIBILITY.
2477 *** Document preparation ***
2479 * New generalized style concept for printing terms: @{foo (style) ...}
2480 instead of @{foo_style style ...} (old form is still retained for
2481 backward compatibility). Styles can be also applied for
2482 antiquotations prop, term_type and typeof.
2487 * New proof method "smt" for a combination of first-order logic with
2488 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2489 fixed-size bitvectors; there is also basic support for higher-order
2490 features (esp. lambda abstractions). It is an incomplete decision
2491 procedure based on external SMT solvers using the oracle mechanism;
2492 for the SMT solver Z3, this method is proof-producing. Certificates
2493 are provided to avoid calling the external solvers solely for
2494 re-checking proofs. Due to a remote SMT service there is no need for
2495 installing SMT solvers locally. See src/HOL/SMT.
2497 * New commands to load and prove verification conditions generated by
2498 the Boogie program verifier or derived systems (e.g. the Verifying C
2499 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2501 * New counterexample generator tool 'nitpick' based on the Kodkod
2502 relational model finder. See src/HOL/Tools/Nitpick and
2503 src/HOL/Nitpick_Examples.
2505 * New commands 'code_pred' and 'values' to invoke the predicate
2506 compiler and to enumerate values of inductive predicates.
2508 * A tabled implementation of the reflexive transitive closure.
2510 * New implementation of quickcheck uses generic code generator;
2511 default generators are provided for all suitable HOL types, records
2512 and datatypes. Old quickcheck can be re-activated importing theory
2513 Library/SML_Quickcheck.
2515 * New testing tool Mirabelle for automated proof tools. Applies
2516 several tools and tactics like sledgehammer, metis, or quickcheck, to
2517 every proof step in a theory. To be used in batch mode via the
2518 "mirabelle" utility.
2520 * New proof method "sos" (sum of squares) for nonlinear real
2521 arithmetic (originally due to John Harison). It requires theory
2522 Library/Sum_Of_Squares. It is not a complete decision procedure but
2523 works well in practice on quantifier-free real arithmetic with +, -,
2524 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2525 inequalities between polynomials. It makes use of external
2526 semidefinite programming solvers. Method "sos" generates a
2527 certificate that can be pasted into the proof thus avoiding the need
2528 to call an external tool every time the proof is checked. See
2529 src/HOL/Library/Sum_Of_Squares.
2531 * New method "linarith" invokes existing linear arithmetic decision
2534 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2536 * New Sledgehammer option "Full Types" in Proof General settings menu.
2537 Causes full type information to be output to the ATPs. This slows
2538 ATPs down considerably but eliminates a source of unsound "proofs"
2541 * New method "metisFT": A version of metis that uses full type
2542 information in order to avoid failures of proof reconstruction.
2544 * New evaluator "approximate" approximates an real valued term using
2545 the same method as the approximation method.
2547 * Method "approximate" now supports arithmetic expressions as
2548 boundaries of intervals and implements interval splitting and Taylor
2551 * ML antiquotation @{code_datatype} inserts definition of a datatype
2552 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2554 * New theory SupInf of the supremum and infimum operators for sets of
2557 * New theory Probability, which contains a development of measure
2558 theory, eventually leading to Lebesgue integration and probability.
2560 * Extended Multivariate Analysis to include derivation and Brouwer's
2563 * Reorganization of number theory, INCOMPATIBILITY:
2564 - new number theory development for nat and int, in theories Divides
2565 and GCD as well as in new session Number_Theory
2566 - some constants and facts now suffixed with _nat and _int
2568 - former session NumberTheory now named Old_Number_Theory, including
2569 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2570 - moved theory Pocklington from src/HOL/Library to
2571 src/HOL/Old_Number_Theory
2573 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2574 lcm of finite and infinite sets. It is shown that they form a complete
2577 * Class semiring_div requires superclass no_zero_divisors and proof of
2578 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2579 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2580 generalized to class semiring_div, subsuming former theorems
2581 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2582 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2585 * Refinements to lattice classes and sets:
2586 - less default intro/elim rules in locale variant, more default
2587 intro/elim rules in class variant: more uniformity
2588 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2590 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2592 - renamed ACI to inf_sup_aci
2593 - new class "boolean_algebra"
2594 - class "complete_lattice" moved to separate theory
2595 "Complete_Lattice"; corresponding constants (and abbreviations)
2596 renamed and with authentic syntax:
2597 Set.Inf ~> Complete_Lattice.Inf
2598 Set.Sup ~> Complete_Lattice.Sup
2599 Set.INFI ~> Complete_Lattice.INFI
2600 Set.SUPR ~> Complete_Lattice.SUPR
2601 Set.Inter ~> Complete_Lattice.Inter
2602 Set.Union ~> Complete_Lattice.Union
2603 Set.INTER ~> Complete_Lattice.INTER
2604 Set.UNION ~> Complete_Lattice.UNION
2605 - authentic syntax for
2608 - mere abbreviations:
2611 Set.inter (for inf, formerly Set.Int)
2612 Set.union (for sup, formerly Set.Un)
2613 Complete_Lattice.Inter (for Inf)
2614 Complete_Lattice.Union (for Sup)
2615 Complete_Lattice.INTER (for INFI)
2616 Complete_Lattice.UNION (for SUPR)
2617 - object-logic definitions as far as appropriate
2619 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2620 Un_subset_iff are explicitly deleted as default simp rules; then also
2621 their lattice counterparts le_inf_iff and le_sup_iff have to be
2622 deleted to achieve the desired effect.
2624 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2625 rules by default any longer; the same applies to min_max.inf_absorb1
2626 etc. INCOMPATIBILITY.
2628 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2629 pred_set_conv by default. INCOMPATIBILITY.
2631 * Power operations on relations and functions are now one dedicated
2632 constant "compow" with infix syntax "^^". Power operation on
2633 multiplicative monoids retains syntax "^" and is now defined generic
2634 in class power. INCOMPATIBILITY.
2636 * Relation composition "R O S" now has a more standard argument order:
2637 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2638 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2639 break, since the O_assoc rule was not rewritten like this. Fix using
2640 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2642 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2643 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2646 * Most rules produced by inductive and datatype package have mandatory
2647 prefixes. INCOMPATIBILITY.
2649 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2650 the attribute of the same name. Each of the theorems in the list
2651 DERIV_intros assumes composition with an additional function and
2652 matches a variable to the derivative, which has to be solved by the
2653 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2654 of most elementary terms. Former Maclauren.DERIV_tac and
2655 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2658 * Code generator attributes follow the usual underscore convention:
2659 code_unfold replaces code unfold
2660 code_post replaces code post
2665 sizechange -> size_change
2666 induct_scheme -> induction_schema
2669 * Discontinued abbreviation "arbitrary" of constant "undefined".
2670 INCOMPATIBILITY, use "undefined" directly.
2673 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2674 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2675 Suc_plus1 -> Suc_eq_plus1
2676 *anti_sym -> *antisym*
2677 vector_less_eq_def -> vector_le_def
2680 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2683 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2689 * Theory Representable defines a class "rep" of domains that are
2690 representable (via an ep-pair) in the universal domain type "udom".
2691 Instances are provided for all type constructors defined in HOLCF.
2693 * The 'new_domain' command is a purely definitional version of the
2694 domain package, for representable domains. Syntax is identical to the
2695 old domain package. The 'new_domain' package also supports indirect
2696 recursion using previously-defined type constructors. See
2697 src/HOLCF/ex/New_Domain.thy for examples.
2699 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2700 on the left-hand side of an equation, and then performs
2701 simplification. Rewriting is done using rules declared with the
2702 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2703 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2705 * The pattern-match compiler in 'fixrec' can now handle constructors
2706 with HOL function types. Pattern-match combinators for the Pair
2707 constructor are pre-configured.
2709 * The 'fixrec' package now produces better fixed-point induction rules
2710 for mutually-recursive definitions: Induction rules have conclusions
2711 of the form "P foo bar" instead of "P <foo, bar>".
2713 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2714 been renamed to "below". The name "below" now replaces "less" in many
2715 theorem names. (Legacy theorem names using "less" are still supported
2718 * The 'fixrec' package now supports "bottom patterns". Bottom
2719 patterns can be used to generate strictness rules, or to make
2720 functions more strict (much like the bang-patterns supported by the
2721 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2727 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2728 errors and run-time exceptions, including detailed source positions.
2730 * Structure Name_Space (formerly NameSpace) now manages uniquely
2731 identified entries, with some additional information such as source
2732 position, logical grouping etc.
2734 * Theory and context data is now introduced by the simplified and
2735 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2736 to be pure, but the old TheoryDataFun for mutable data (with explicit
2737 copy operation) is still available for some time.
2739 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2740 provides a high-level programming interface to synchronized state
2741 variables with atomic update. This works via pure function
2742 application within a critical section -- its runtime should be as
2743 short as possible; beware of deadlocks if critical code is nested,
2744 either directly or indirectly via other synchronized variables!
2746 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2747 wraps raw ML references, explicitly indicating their non-thread-safe
2748 behaviour. The Isar toplevel keeps this structure open, to
2749 accommodate Proof General as well as quick and dirty interactive
2750 experiments with references.
2752 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2753 parallel tactical reasoning.
2755 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2756 are similar to SUBPROOF, but are slightly more flexible: only the
2757 specified parts of the subgoal are imported into the context, and the
2758 body tactic may introduce new subgoals and schematic variables.
2760 * Old tactical METAHYPS, which does not observe the proof context, has
2761 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2762 or Subgoal.FOCUS etc.
2764 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2765 functors have their own ML name space there is no point to mark them
2766 separately.) Minor INCOMPATIBILITY.
2768 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2770 * Renamed several structures FooBar to Foo_Bar. Occasional,
2773 * Operations of structure Skip_Proof no longer require quick_and_dirty
2774 mode, which avoids critical setmp.
2776 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2777 combinators for "args". INCOMPATIBILITY, need to use simplified
2778 Attrib/Method.setup introduced in Isabelle2009.
2780 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2781 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2782 last resort. INCOMPATIBILITY.
2784 * Display.pretty_thm now requires a proper context (cf. former
2785 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2786 or even Display.pretty_thm_without_context as last resort.
2789 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2790 Syntax.pretty_typ/term directly, preferably with proper context
2791 instead of global theory.
2796 * Further fine tuning of parallel proof checking, scales up to 8 cores
2797 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2800 * Support for additional "Isabelle components" via etc/components, see
2801 also the system manual.
2803 * The isabelle makeall tool now operates on all components with
2804 IsaMakefile, not just hardwired "logics".
2806 * Removed "compress" option from isabelle-process and isabelle usedir;
2807 this is always enabled.
2809 * Discontinued support for Poly/ML 4.x versions.
2811 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2812 on a given logic image. This requires the lighttpd webserver and is
2813 currently supported on Linux only.
2817 New in Isabelle2009 (April 2009)
2818 --------------------------------
2822 * Simplified main Isabelle executables, with less surprises on
2823 case-insensitive file-systems (such as Mac OS).
2825 - The main Isabelle tool wrapper is now called "isabelle" instead of
2828 - The former "isabelle" alias for "isabelle-process" has been
2829 removed (should rarely occur to regular users).
2831 - The former "isabelle-interface" and its alias "Isabelle" have been
2832 removed (interfaces are now regular Isabelle tools).
2834 Within scripts and make files, the Isabelle environment variables
2835 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2836 respectively. (The latter are still available as legacy feature.)
2838 The old isabelle-interface wrapper could react in confusing ways if
2839 the interface was uninstalled or changed otherwise. Individual
2840 interface tool configuration is now more explicit, see also the
2841 Isabelle system manual. In particular, Proof General is now available
2842 via "isabelle emacs".
2844 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2845 purge installed copies of Isabelle executables and re-run "isabelle
2846 install -p ...", or use symlinks.
2848 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2849 old ~/isabelle, which was slightly non-standard and apt to cause
2850 surprises on case-insensitive file-systems (such as Mac OS).
2852 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2853 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2854 care is required when using older releases of Isabelle. Note that
2855 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2856 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2858 * Proofs of fully specified statements are run in parallel on
2859 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2860 a regular 4-core machine, if the initial heap space is made reasonably
2861 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2863 * The main reference manuals ("isar-ref", "implementation", and
2864 "system") have been updated and extended. Formally checked references
2865 as hyperlinks are now available uniformly.
2870 * Complete re-implementation of locales. INCOMPATIBILITY in several
2871 respects. The most important changes are listed below. See the
2872 Tutorial on Locales ("locales" manual) for details.
2874 - In locale expressions, instantiation replaces renaming. Parameters
2875 must be declared in a for clause. To aid compatibility with previous
2876 parameter inheritance, in locale declarations, parameters that are not
2877 'touched' (instantiation position "_" or omitted) are implicitly added
2878 with their syntax at the beginning of the for clause.
2880 - Syntax from abbreviations and definitions in locales is available in
2881 locale expressions and context elements. The latter is particularly
2882 useful in locale declarations.
2884 - More flexible mechanisms to qualify names generated by locale
2885 expressions. Qualifiers (prefixes) may be specified in locale
2886 expressions, and can be marked as mandatory (syntax: "name!:") or
2887 optional (syntax "name?:"). The default depends for plain "name:"
2888 depends on the situation where a locale expression is used: in
2889 commands 'locale' and 'sublocale' prefixes are optional, in
2890 'interpretation' and 'interpret' prefixes are mandatory. The old
2891 implicit qualifiers derived from the parameter names of a locale are
2892 no longer generated.
2894 - Command "sublocale l < e" replaces "interpretation l < e". The
2895 instantiation clause in "interpretation" and "interpret" (square
2896 brackets) is no longer available. Use locale expressions.
2898 - When converting proof scripts, mandatory qualifiers in
2899 'interpretation' and 'interpret' should be retained by default, even
2900 if this is an INCOMPATIBILITY compared to former behavior. In the
2901 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2902 in locale expressions range over a single locale instance only.
2904 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2905 In existing theorem specifications replace the includes element by the
2906 respective context elements of the included locale, omitting those
2907 that are already present in the theorem specification. Multiple
2908 assume elements of a locale should be replaced by a single one
2909 involving the locale predicate. In the proof body, declarations (most
2910 notably theorems) may be regained by interpreting the respective
2911 locales in the proof context as required (command "interpret").
2913 If using "includes" in replacement of a target solely because the
2914 parameter types in the theorem are not as general as in the target,
2915 consider declaring a new locale with additional type constraints on
2916 the parameters (context element "constrains").
2918 - Discontinued "locale (open)". INCOMPATIBILITY.
2920 - Locale interpretation commands no longer attempt to simplify goal.
2921 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2922 methods intro_locales and unfold_locales to clarify.
2924 - Locale interpretation commands no longer accept interpretation
2925 attributes. INCOMPATIBILITY.
2927 * Class declaration: so-called "base sort" must not be given in import
2928 list any longer, but is inferred from the specification. Particularly
2935 class foo = type + ...
2937 * Class target: global versions of theorems stemming do not carry a
2938 parameter prefix any longer. INCOMPATIBILITY.
2940 * Class 'instance' command no longer accepts attached definitions.
2941 INCOMPATIBILITY, use proper 'instantiation' target instead.
2943 * Recovered hiding of consts, which was accidentally broken in
2944 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2945 makes c inaccessible; consider using ``hide (open) const c'' instead.
2947 * Slightly more coherent Pure syntax, with updated documentation in
2948 isar-ref manual. Removed locales meta_term_syntax and
2949 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2950 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2951 directly in regular applications.
2953 * There is a new syntactic category "float_const" for signed decimal
2954 fractions (e.g. 123.45 or -123.45).
2956 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2957 interface with 'setup' command instead.
2959 * Command 'local_setup' is similar to 'setup', but operates on a local
2962 * The 'axiomatization' command now only works within a global theory
2963 context. INCOMPATIBILITY.
2965 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2966 hypotheses. Sorts required in the course of reasoning need to be
2967 covered by the constraints in the initial statement, completed by the
2968 type instance information of the background theory. Non-trivial sort
2969 hypotheses, which rarely occur in practice, may be specified via
2970 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2972 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2974 The result contains an implicit sort hypotheses as before --
2975 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2978 * Generalized Isar history, with support for linear undo, direct state
2981 * Changed defaults for unify configuration options:
2983 unify_trace_bound = 50 (formerly 25)
2984 unify_search_bound = 60 (formerly 30)
2986 * Different bookkeeping for code equations (INCOMPATIBILITY):
2988 a) On theory merge, the last set of code equations for a particular
2989 constant is taken (in accordance with the policy applied by other
2990 parts of the code generator framework).
2992 b) Code equations stemming from explicit declarations (e.g. code
2993 attribute) gain priority over default code equations stemming
2994 from definition, primrec, fun etc.
2996 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2998 * Unified theorem tables for both code generators. Thus [code
2999 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3001 * Command 'find_consts' searches for constants based on type and name
3004 find_consts "_ => bool"
3006 By default, matching is against subtypes, but it may be restricted to
3007 the whole type. Searching by name is possible. Multiple queries are
3008 conjunctive and queries may be negated by prefixing them with a
3011 find_consts strict: "_ => bool" name: "Int" -"int => int"
3013 * New 'find_theorems' criterion "solves" matches theorems that
3014 directly solve the current goal (modulo higher-order unification).
3016 * Auto solve feature for main theorem statements: whenever a new goal
3017 is stated, "find_theorems solves" is called; any theorems that could
3018 solve the lemma directly are listed as part of the goal state.
3019 Cf. associated options in Proof General Isabelle settings menu,
3020 enabled by default, with reasonable timeout for pathological cases of
3021 higher-order unification.
3024 *** Document preparation ***
3026 * Antiquotation @{lemma} now imitates a regular terminal proof,
3027 demanding keyword 'by' and supporting the full method expression
3028 syntax just like the Isar command 'by'.
3033 * Integrated main parts of former image HOL-Complex with HOL. Entry
3034 points Main and Complex_Main remain as before.
3036 * Logic image HOL-Plain provides a minimal HOL with the most important
3037 tools available (inductive, datatype, primrec, ...). This facilitates
3038 experimentation and tool development. Note that user applications
3039 (and library theories) should never refer to anything below theory
3042 * Logic image HOL-Main stops at theory Main, and thus facilitates
3043 experimentation due to shorter build times.
3045 * Logic image HOL-NSA contains theories of nonstandard analysis which
3046 were previously part of former HOL-Complex. Entry point Hyperreal
3047 remains valid, but theories formerly using Complex_Main should now use
3048 new entry point Hypercomplex.
3050 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3051 Posix processes. Avoids potentially expensive forking of the ML
3052 process. New thread-based implementation also works on non-Unix
3053 platforms (Cygwin). Provers are no longer hardwired, but defined
3054 within the theory via plain ML wrapper functions. Basic Sledgehammer
3055 commands are covered in the isar-ref manual.
3057 * Wrapper scripts for remote SystemOnTPTP service allows to use
3058 sledgehammer without local ATP installation (Vampire etc.). Other
3059 provers may be included via suitable ML wrappers, see also
3060 src/HOL/ATP_Linkup.thy.
3062 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3065 * The metis method no longer fails because the theorem is too trivial
3066 (contains the empty clause).
3068 * The metis method now fails in the usual manner, rather than raising
3069 an exception, if it determines that it cannot prove the theorem.
3071 * Method "coherent" implements a prover for coherent logic (see also
3072 src/Tools/coherent.ML).
3074 * Constants "undefined" and "default" replace "arbitrary". Usually
3075 "undefined" is the right choice to replace "arbitrary", though
3076 logically there is no difference. INCOMPATIBILITY.
3078 * Command "value" now integrates different evaluation mechanisms. The
3079 result of the first successful evaluation mechanism is printed. In
3080 square brackets a particular named evaluation mechanisms may be
3081 specified (currently, [SML], [code] or [nbe]). See further
3082 src/HOL/ex/Eval_Examples.thy.
3084 * Normalization by evaluation now allows non-leftlinear equations.
3085 Declare with attribute [code nbe].
3087 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3088 as the structured Isar versions "cases" and "induct", cf. the
3089 corresponding "cases" and "induct" attributes. Mutual induction rules
3090 are now presented as a list of individual projections
3091 (e.g. foo_bar.inducts for types foo and bar); the old format with
3092 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3093 rare situations a different rule is selected --- notably nested tuple
3094 elimination instead of former prod.exhaust: use explicit (case_tac t
3095 rule: prod.exhaust) here.
3097 * Attributes "cases", "induct", "coinduct" support "del" option.
3099 * Removed fact "case_split_thm", which duplicates "case_split".
3101 * The option datatype has been moved to a new theory Option. Renamed
3102 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3104 * New predicate "strict_mono" classifies strict functions on partial
3105 orders. With strict functions on linear orders, reasoning about
3106 (in)equalities is facilitated by theorems "strict_mono_eq",
3107 "strict_mono_less_eq" and "strict_mono_less".
3109 * Some set operations are now proper qualified constants with
3110 authentic syntax. INCOMPATIBILITY:
3121 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3124 * Auxiliary class "itself" has disappeared -- classes without any
3125 parameter are treated as expected by the 'class' command.
3127 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3129 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3130 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3132 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3133 method "approximation". It proves formulas on real values by using
3134 interval arithmetic. In the formulas are also the transcendental
3135 functions sin, cos, tan, atan, ln, exp and the constant pi are
3136 allowed. For examples see
3137 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3139 * Theory "Reflection" now resides in HOL/Library.
3141 * Entry point to Word library now simply named "Word".
3144 * Made source layout more coherent with logical distribution
3147 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3148 src/HOL/Library/Code_Message.thy ~> src/HOL/
3149 src/HOL/Library/GCD.thy ~> src/HOL/
3150 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3151 src/HOL/Library/Parity.thy ~> src/HOL/
3152 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3153 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3154 src/HOL/Real/Lubs.thy ~> src/HOL/
3155 src/HOL/Real/PReal.thy ~> src/HOL/
3156 src/HOL/Real/Rational.thy ~> src/HOL/
3157 src/HOL/Real/RComplete.thy ~> src/HOL/
3158 src/HOL/Real/RealDef.thy ~> src/HOL/
3159 src/HOL/Real/RealPow.thy ~> src/HOL/
3160 src/HOL/Real/Real.thy ~> src/HOL/
3161 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3162 src/HOL/Complex/Complex.thy ~> src/HOL/
3163 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3164 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3165 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3166 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3167 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3168 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3169 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3170 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3171 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3172 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3173 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3174 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3175 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3176 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3177 src/HOL/Real/Float ~> src/HOL/Library/
3178 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3179 src/HOL/Real/RealVector.thy ~> src/HOL/
3181 src/HOL/arith_data.ML ~> src/HOL/Tools
3182 src/HOL/hologic.ML ~> src/HOL/Tools
3183 src/HOL/simpdata.ML ~> src/HOL/Tools
3184 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3185 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3186 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3187 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3188 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3189 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3190 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3192 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3193 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3194 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3195 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3196 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3197 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3199 * If methods "eval" and "evaluation" encounter a structured proof
3200 state with !!/==>, only the conclusion is evaluated to True (if
3201 possible), avoiding strange error messages.
3203 * Method "sizechange" automates termination proofs using (a
3204 modification of) the size-change principle. Requires SAT solver. See
3205 src/HOL/ex/Termination.thy for examples.
3207 * Simplifier: simproc for let expressions now unfolds if bound
3208 variable occurs at most once in let expression body. INCOMPATIBILITY.
3210 * Method "arith": Linear arithmetic now ignores all inequalities when
3211 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3213 * New attribute "arith" for facts that should always be used
3214 automatically by arithmetic. It is intended to be used locally in
3217 assumes [arith]: "x > 0"
3219 Global usage is discouraged because of possible performance impact.
3221 * New classes "top" and "bot" with corresponding operations "top" and
3222 "bot" in theory Orderings; instantiation of class "complete_lattice"
3223 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3225 * Changed definition lemma "less_fun_def" in order to provide an
3226 instance for preorders on functions; use lemma "less_le" instead.
3229 * Theory Orderings: class "wellorder" moved here, with explicit
3230 induction rule "less_induct" as assumption. For instantiation of
3231 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3234 * Theory Orderings: added class "preorder" as superclass of "order".
3235 INCOMPATIBILITY: Instantiation proofs for order, linorder
3236 etc. slightly changed. Some theorems named order_class.* now named
3239 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3242 * Theory Finite_Set: added a new fold combinator of type
3244 ('a => 'b => 'b) => 'b => 'a set => 'b
3246 Occasionally this is more convenient than the old fold combinator
3247 which is now defined in terms of the new one and renamed to
3250 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3251 and "ring_simps" have been replaced by "algebra_simps" (which can be
3252 extended with further lemmas!). At the moment both still exist but
3253 the former will disappear at some point.
3255 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3256 class recpower. Type-specific simp rules for various recpower types
3257 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3259 rat_power_0 -> power_0
3260 rat_power_Suc -> power_Suc
3261 realpow_0 -> power_0
3262 realpow_Suc -> power_Suc
3263 complexpow_0 -> power_0
3264 complexpow_Suc -> power_Suc
3265 power_poly_0 -> power_0
3266 power_poly_Suc -> power_Suc
3268 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3269 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3270 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3271 of lemmas from Divides has been generalized from nat to class
3272 semiring_div. INCOMPATIBILITY. This involves the following theorem
3273 renames resulting from duplicate elimination:
3275 dvd_def_mod ~> dvd_eq_mod_eq_0
3276 zero_dvd_iff ~> dvd_0_left_iff
3277 dvd_0 ~> dvd_0_right
3278 DIVISION_BY_ZERO_DIV ~> div_by_0
3279 DIVISION_BY_ZERO_MOD ~> mod_by_0
3280 mult_div ~> div_mult_self2_is_id
3281 mult_mod ~> mod_mult_self2_is_0
3283 * Theory IntDiv: removed many lemmas that are instances of class-based
3284 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3285 rename old lemmas as follows:
3287 dvd_diff -> nat_dvd_diff
3288 dvd_zminus_iff -> dvd_minus_iff
3289 mod_add1_eq -> mod_add_eq
3290 mod_mult1_eq -> mod_mult_right_eq
3291 mod_mult1_eq' -> mod_mult_left_eq
3292 mod_mult_distrib_mod -> mod_mult_eq
3293 nat_mod_add_left_eq -> mod_add_left_eq
3294 nat_mod_add_right_eq -> mod_add_right_eq
3295 nat_mod_div_trivial -> mod_div_trivial
3296 nat_mod_mod_trivial -> mod_mod_trivial
3297 zdiv_zadd_self1 -> div_add_self1
3298 zdiv_zadd_self2 -> div_add_self2
3299 zdiv_zmult_self1 -> div_mult_self2_is_id
3300 zdiv_zmult_self2 -> div_mult_self1_is_id
3301 zdvd_triv_left -> dvd_triv_left
3302 zdvd_triv_right -> dvd_triv_right
3303 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3304 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3305 zmod_zadd_left_eq -> mod_add_left_eq
3306 zmod_zadd_right_eq -> mod_add_right_eq
3307 zmod_zadd_self1 -> mod_add_self1
3308 zmod_zadd_self2 -> mod_add_self2
3309 zmod_zadd1_eq -> mod_add_eq
3310 zmod_zdiff1_eq -> mod_diff_eq
3311 zmod_zdvd_zmod -> mod_mod_cancel
3312 zmod_zmod_cancel -> mod_mod_cancel
3313 zmod_zmult_self1 -> mod_mult_self2_is_0
3314 zmod_zmult_self2 -> mod_mult_self1_is_0
3317 zdvd_abs1 -> abs_dvd_iff
3318 zdvd_abs2 -> dvd_abs_iff
3319 zdvd_refl -> dvd_refl
3320 zdvd_trans -> dvd_trans
3321 zdvd_zadd -> dvd_add
3322 zdvd_zdiff -> dvd_diff
3323 zdvd_zminus_iff -> dvd_minus_iff
3324 zdvd_zminus2_iff -> minus_dvd_iff
3325 zdvd_zmultD -> dvd_mult_right
3326 zdvd_zmultD2 -> dvd_mult_left
3327 zdvd_zmult_mono -> mult_dvd_mono
3328 zdvd_0_right -> dvd_0_right
3329 zdvd_0_left -> dvd_0_left_iff
3330 zdvd_1_left -> one_dvd
3331 zminus_dvd_iff -> minus_dvd_iff
3333 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3335 * The real numbers offer decimal input syntax: 12.34 is translated
3336 into 1234/10^2. This translation is not reversed upon output.
3338 * Theory Library/Polynomial defines an abstract type 'a poly of
3339 univariate polynomials with coefficients of type 'a. In addition to
3340 the standard ring operations, it also supports div and mod. Code
3341 generation is also supported, using list-style constructors.
3343 * Theory Library/Inner_Product defines a class of real_inner for real
3344 inner product spaces, with an overloaded operation inner :: 'a => 'a
3345 => real. Class real_inner is a subclass of real_normed_vector from
3348 * Theory Library/Product_Vector provides instances for the product
3349 type 'a * 'b of several classes from RealVector and Inner_Product.
3350 Definitions of addition, subtraction, scalar multiplication, norms,
3351 and inner products are included.
3353 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3354 addition to the field operations, numerals and case syntax are also
3357 * Theory Library/Diagonalize provides constructive version of Cantor's
3358 first diagonalization argument.
3360 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3361 zlcm (for int); carried together from various gcd/lcm developements in
3362 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3363 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3364 may recover tupled syntax as follows:
3366 hide (open) const gcd
3367 abbreviation gcd where
3368 "gcd == (%(a, b). GCD.gcd a b)"
3370 GCD.gcd ("gcd '(_, _')")
3372 The same works for lcm, zgcd, zlcm.
3374 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3375 instantiations for algebraic structures. Removed some duplicate
3376 theorems. Changes in simp rules. INCOMPATIBILITY.
3378 * ML antiquotation @{code} takes a constant as argument and generates
3379 corresponding code in background and inserts name of the corresponding
3380 resulting ML value/function/datatype constructor binding in place.
3381 All occurrences of @{code} with a single ML block are generated
3382 simultaneously. Provides a generic and safe interface for
3383 instrumentalizing code generation. See
3384 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3385 In future you ought to refrain from ad-hoc compiling generated SML
3386 code on the ML toplevel. Note that (for technical reasons) @{code}
3387 cannot refer to constants for which user-defined serializations are
3388 set. Refer to the corresponding ML counterpart directly in that
3391 * Command 'rep_datatype': instead of theorem names the command now
3392 takes a list of terms denoting the constructors of the type to be
3393 represented as datatype. The characteristic theorems have to be
3394 proven. INCOMPATIBILITY. Also observe that the following theorems
3395 have disappeared in favour of existing ones:
3397 unit_induct ~> unit.induct
3398 prod_induct ~> prod.induct
3399 sum_induct ~> sum.induct
3400 Suc_Suc_eq ~> nat.inject
3401 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3406 * New locales for orders and lattices where the equivalence relation
3407 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3408 locales use a record structure with field eq for the equivalence.
3410 * New theory of factorial domains.
3412 * Units_l_inv and Units_r_inv are now simp rules by default.
3413 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3414 and/or r_inv will now also require deletion of these lemmas.
3416 * Renamed the following theorems, INCOMPATIBILITY:
3418 UpperD ~> Upper_memD
3419 LowerD ~> Lower_memD
3420 least_carrier ~> least_closed
3421 greatest_carrier ~> greatest_closed
3422 greatest_Lower_above ~> greatest_Lower_below
3423 one_zero ~> carrier_one_zero
3424 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3429 * Nominal datatypes can now contain type-variables.
3431 * Commands 'nominal_inductive' and 'equivariance' work with local
3434 * Nominal primrec can now works with local theory targets and its
3435 specification syntax now conforms to the general format as seen in
3438 * Method "perm_simp" honours the standard simplifier attributes
3439 (no_asm), (no_asm_use) etc.
3441 * The new predicate #* is defined like freshness, except that on the
3442 left hand side can be a set or list of atoms.
3444 * Experimental command 'nominal_inductive2' derives strong induction
3445 principles for inductive definitions. In contrast to
3446 'nominal_inductive', which can only deal with a fixed number of
3447 binders, it can deal with arbitrary expressions standing for sets of
3448 atoms to be avoided. The only inductive definition we have at the
3449 moment that needs this generalisation is the typing rule for Lets in
3452 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3453 -----------------------------------------------------------------
3454 Gamma |- Let x be t1 in t2 : T2
3456 In this rule one wants to avoid all the binders that are introduced by
3457 "close Gamma T1". We are looking for other examples where this
3458 feature might be useful. Please let us know.
3463 * Reimplemented the simplification procedure for proving continuity
3464 subgoals. The new simproc is extensible; users can declare additional
3465 continuity introduction rules with the attribute [cont2cont].
3467 * The continuity simproc now uses a different introduction rule for
3468 solving continuity subgoals on terms with lambda abstractions. In
3469 some rare cases the new simproc may fail to solve subgoals that the
3470 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3471 Potential INCOMPATIBILITY.
3473 * Command 'fixrec': specification syntax now conforms to the general
3474 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3475 examples. INCOMPATIBILITY.
3480 * Proof of Zorn's Lemma for partial orders.
3485 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3486 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3487 depends on multithreading, so timouts will not work before Poly/ML
3490 * High-level support for concurrent ML programming, see
3491 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3492 particularly convenient to organize independent functional
3493 computations. The concept of "synchronized variables" provides a
3494 higher-order interface for components with shared state, avoiding the
3495 delicate details of mutexes and condition variables. (Requires
3496 Poly/ML 5.2.1 or later.)
3498 * ML bindings produced via Isar commands are stored within the Isar
3499 context (theory or proof). Consequently, commands like 'use' and 'ML'
3500 become thread-safe and work with undo as expected (concerning
3501 top-level bindings, not side-effects on global references).
3502 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3503 compiler at runtime; really global bindings need to be given outside a
3504 theory. (Requires Poly/ML 5.2 or later.)
3506 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3507 context. Top-level ML bindings are stored within the proof context in
3508 a purely sequential fashion, disregarding the nested proof structure.
3509 ML bindings introduced by 'ML_prf' are discarded at the end of the
3510 proof. (Requires Poly/ML 5.2 or later.)
3512 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3513 and Method.setup, as well as Isar commands 'attribute_setup' and
3514 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3515 existing code accordingly, or use plain 'setup' together with old
3518 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3519 to 'a -> thm, while results are always tagged with an authentic oracle
3520 name. The Isar command 'oracle' is now polymorphic, no argument type
3521 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3522 accordingly. Note that extra performance may be gained by producing
3523 the cterm carefully, avoiding slow Thm.cterm_of.
3525 * Simplified interface for defining document antiquotations via
3526 ThyOutput.antiquotation, ThyOutput.output, and optionally
3527 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3528 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3531 * More systematic treatment of long names, abstract name bindings, and
3532 name space operations. Basic operations on qualified names have been
3533 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3534 Long_Name.append. Old type bstring has been mostly replaced by
3535 abstract type binding (see structure Binding), which supports precise
3536 qualification by packages and local theory targets, as well as proper
3537 tracking of source positions. INCOMPATIBILITY, need to wrap old
3538 bstring values into Binding.name, or better pass through abstract
3539 bindings everywhere. See further src/Pure/General/long_name.ML,
3540 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3542 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3543 LocalTheory.note etc.) now refer to the *full* internal name, not the
3544 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3546 * Disposed old type and term read functions (Sign.read_def_typ,
3547 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3548 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3549 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3550 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3551 resort for legacy applications.
3553 * Disposed old declarations, tactics, tactic combinators that refer to
3554 the simpset or claset of an implicit theory (such as Addsimps,
3555 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3556 embedded ML text, or local_simpset_of with a proper context passed as
3557 explicit runtime argument.
3559 * Rules and tactics that read instantiations (read_instantiate,
3560 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3561 context, which is required for parsing and type-checking. Moreover,
3562 the variables are specified as plain indexnames, not string encodings
3563 thereof. INCOMPATIBILITY.
3565 * Generic Toplevel.add_hook interface allows to analyze the result of
3566 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3567 for theorem dependency output of transactions resulting in a new
3570 * ML antiquotations: block-structured compilation context indicated by
3571 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3573 @{binding name} - basic name binding
3574 @{let ?pat = term} - term abbreviation (HO matching)
3575 @{note name = fact} - fact abbreviation
3576 @{thm fact} - singleton fact (with attributes)
3577 @{thms fact} - general fact (with attributes)
3578 @{lemma prop by method} - singleton goal
3579 @{lemma prop by meth1 meth2} - singleton goal
3580 @{lemma prop1 ... propN by method} - general goal
3581 @{lemma prop1 ... propN by meth1 meth2} - general goal
3582 @{lemma (open) ...} - open derivation
3587 * The Isabelle "emacs" tool provides a specific interface to invoke
3588 Proof General / Emacs, with more explicit failure if that is not
3589 installed (the old isabelle-interface script silently falls back on
3590 isabelle-process). The PROOFGENERAL_HOME setting determines the
3591 installation location of the Proof General distribution.
3593 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3594 the Isabelle process into a JVM/Scala application. See
3595 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3596 process wrapper has been discontinued.)
3598 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3600 * Various status messages (with exact source position information) are
3601 emitted, if proper markup print mode is enabled. This allows
3602 user-interface components to provide detailed feedback on internal
3607 New in Isabelle2008 (June 2008)
3608 -------------------------------
3612 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3613 and updated, with formally checked references as hyperlinks.
3615 * Theory loader: use_thy (and similar operations) no longer set the
3616 implicit ML context, which was occasionally hard to predict and in
3617 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3618 provides a proper context already.
3620 * Theory loader: old-style ML proof scripts being *attached* to a thy
3621 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3622 'use' within a theory file will do the job.
3624 * Name space merge now observes canonical order, i.e. the second space
3625 is inserted into the first one, while existing entries in the first
3626 space take precedence. INCOMPATIBILITY in rare situations, may try to
3627 swap theory imports.
3629 * Syntax: symbol \<chi> is now considered a letter. Potential
3630 INCOMPATIBILITY in identifier syntax etc.
3632 * Outer syntax: string tokens no longer admit escaped white space,
3633 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3634 white space without escapes.
3636 * Outer syntax: string tokens may contain arbitrary character codes
3637 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3643 * Context-dependent token translations. Default setup reverts locally
3644 fixed variables, and adds hilite markup for undeclared frees.
3646 * Unused theorems can be found using the new command 'unused_thms'.
3647 There are three ways of invoking it:
3650 Only finds unused theorems in the current theory.
3652 (2) unused_thms thy_1 ... thy_n -
3653 Finds unused theorems in the current theory and all of its ancestors,
3654 excluding the theories thy_1 ... thy_n and all of their ancestors.
3656 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3657 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3658 their ancestors, excluding the theories thy_1 ... thy_n and all of
3661 In order to increase the readability of the list produced by
3662 unused_thms, theorems that have been created by a particular instance
3663 of a theory command such as 'inductive' or 'function' are considered
3664 to belong to the same "group", meaning that if at least one theorem in
3665 this group is used, the other theorems in the same group are no longer
3666 reported as unused. Moreover, if all theorems in the group are
3667 unused, only one theorem in the group is displayed.
3669 Note that proof objects have to be switched on in order for
3670 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3671 usually the case when using Proof General with the default settings).
3673 * Authentic naming of facts disallows ad-hoc overwriting of previous
3674 theorems within the same name space. INCOMPATIBILITY, need to remove
3675 duplicate fact bindings, or even accidental fact duplications. Note
3676 that tools may maintain dynamically scoped facts systematically, using
3677 PureThy.add_thms_dynamic.
3679 * Command 'hide' now allows to hide from "fact" name space as well.
3681 * Eliminated destructive theorem database, simpset, claset, and
3682 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3683 update of theories within ML code.
3685 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3686 INCOMPATIBILITY, object-logics depending on former Pure require
3687 additional setup PureThy.old_appl_syntax_setup; object-logics
3688 depending on former CPure need to refer to Pure.
3690 * Commands 'use' and 'ML' are now purely functional, operating on
3691 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3692 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3695 * Command 'setup': discontinued implicit version with ML reference.
3697 * Instantiation target allows for simultaneous specification of class
3698 instance operations together with an instantiation proof.
3699 Type-checking phase allows to refer to class operations uniformly.
3700 See src/HOL/Complex/Complex.thy for an Isar example and
3701 src/HOL/Library/Eval.thy for an ML example.
3703 * Indexing of literal facts: be more serious about including only
3704 facts from the visible specification/proof context, but not the
3705 background context (locale etc.). Affects `prop` notation and method
3706 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3709 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3710 "(open)" option, which used to expose internal bound variables to the
3713 * Isar statements: removed obsolete case "rule_context".
3714 INCOMPATIBILITY, better use explicit fixes/assumes.
3716 * Locale proofs: default proof step now includes 'unfold_locales';
3717 hence 'proof' without argument may be used to unfold locale
3721 *** Document preparation ***
3723 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3724 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3725 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3726 spot); renamed link color from "darkblue" to "linkcolor" (default
3727 value unchanged, can be redefined via \definecolor); no longer sets
3728 "a4paper" option (unnecessary or even intrusive).
3730 * Antiquotation @{lemma A method} proves proposition A by the given
3731 method (either a method name or a method name plus (optional) method
3732 arguments in parentheses) and prints A just like @{prop A}.
3737 * New primrec package. Specification syntax conforms in style to
3738 definition/function/.... No separate induction rule is provided. The
3739 "primrec" command distinguishes old-style and new-style specifications
3740 by syntax. The former primrec package is now named OldPrimrecPackage.
3741 When adjusting theories, beware: constants stemming from new-style
3742 primrec specifications have authentic syntax.
3744 * Metis prover is now an order of magnitude faster, and also works
3745 with multithreading.
3747 * Metis: the maximum number of clauses that can be produced from a
3748 theorem is now given by the attribute max_clauses. Theorems that
3749 exceed this number are ignored, with a warning printed.
3751 * Sledgehammer no longer produces structured proofs by default. To
3752 enable, declare [[sledgehammer_full = true]]. Attributes
3753 reconstruction_modulus, reconstruction_sorts renamed
3754 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3756 * Method "induct_scheme" derives user-specified induction rules
3757 from well-founded induction and completeness of patterns. This factors
3758 out some operations that are done internally by the function package
3759 and makes them available separately. See
3760 src/HOL/ex/Induction_Scheme.thy for examples.
3762 * More flexible generation of measure functions for termination
3763 proofs: Measure functions can be declared by proving a rule of the
3764 form "is_measure f" and giving it the [measure_function] attribute.
3765 The "is_measure" predicate is logically meaningless (always true), and
3766 just guides the heuristic. To find suitable measure functions, the
3767 termination prover sets up the goal "is_measure ?f" of the appropriate
3768 type and generates all solutions by prolog-style backwards proof using
3771 This setup also deals with rules like
3773 "is_measure f ==> is_measure (list_size f)"
3775 which accommodates nested datatypes that recurse through lists.
3776 Similar rules are predeclared for products and option types.
3778 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3782 - Definitions of overloaded constants on sets have to be replaced by
3783 definitions on => and bool.
3785 - Some definitions of overloaded operators on sets can now be proved
3786 using the definitions of the operators on => and bool. Therefore,
3787 the following theorems have been renamed:
3789 subset_def -> subset_eq
3790 psubset_def -> psubset_eq
3791 set_diff_def -> set_diff_eq
3792 Compl_def -> Compl_eq
3793 Sup_set_def -> Sup_set_eq
3794 Inf_set_def -> Inf_set_eq
3795 sup_set_def -> sup_set_eq
3796 inf_set_def -> inf_set_eq
3798 - Due to the incompleteness of the HO unification algorithm, some
3799 rules such as subst may require manual instantiation, if some of
3800 the unknowns in the rule is a set.
3802 - Higher order unification and forward proofs:
3805 have "P (S::'a set)" <...>
3806 then have "EX S. P S" ..
3808 no longer works (due to the incompleteness of the HO unification
3809 algorithm) and must be replaced by the pattern
3816 - Calculational reasoning with subst (or similar rules):
3819 have "P (S::'a set)" <...>
3820 also have "S = T" <...>
3821 finally have "P T" .
3823 no longer works (for similar reasons as the previous example) and
3824 must be replaced by something like
3826 have "P (S::'a set)" <...>
3827 moreover have "S = T" <...>
3828 ultimately have "P T" by simp
3830 - Tactics or packages written in ML code:
3831 Code performing pattern matching on types via
3833 Type ("set", [T]) => ...
3835 must be rewritten. Moreover, functions like strip_type or
3836 binder_types no longer return the right value when applied to a
3839 T1 => ... => Tn => U => bool
3843 T1 => ... => Tn => U set
3845 * Merged theories Wellfounded_Recursion, Accessible_Part and
3846 Wellfounded_Relations to theory Wellfounded.
3848 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3850 * Class finite no longer treats UNIV as class parameter. Use class
3851 enum from theory Library/Enum instead to achieve a similar effect.
3854 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3855 and "Cons". INCOMPATIBILITY.
3857 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3858 Potential INCOMPATIBILITY.
3860 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3861 injective_fst_snd removed, use split_eta and prod_eqI instead.
3862 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3864 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3865 the same name in theory Orderings:
3875 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3876 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3877 and different variable names.
3879 * Library/Option_ord.thy: Canonical order on option type.
3881 * Library/RBT.thy: Red-black trees, an efficient implementation of
3884 * Library/Countable.thy: Type class for countable types.
3886 * Theory Int: The representation of numerals has changed. The infix
3887 operator BIT and the bit datatype with constructors B0 and B1 have
3888 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3889 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3890 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3893 * Theory Nat: definition of <= and < on natural numbers no longer
3894 depend on well-founded relations. INCOMPATIBILITY. Definitions
3895 le_def and less_def have disappeared. Consider lemmas not_less
3896 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3898 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3899 (whose purpose mainly is for various fold_set functionals) have been
3900 abandoned in favor of the existing algebraic classes
3901 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3902 lower_semilattice (resp. upper_semilattice) and linorder.
3905 * Theory Transitive_Closure: induct and cases rules now declare proper
3906 case_names ("base" and "step"). INCOMPATIBILITY.
3908 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3909 lattices. The form set-specific version is available as
3910 Inductive.lfp_ordinal_induct_set.
3912 * Renamed theorems "power.simps" to "power_int.simps".
3915 * Class semiring_div provides basic abstract properties of semirings
3916 with division and modulo operations. Subsumes former class dvd_mod.
3918 * Merged theories IntDef, Numeral and IntArith into unified theory
3919 Int. INCOMPATIBILITY.
3921 * Theory Library/Code_Index: type "index" now represents natural
3922 numbers rather than integers. INCOMPATIBILITY.
3924 * New class "uminus" with operation "uminus" (split of from class
3925 "minus" which now only has operation "minus", binary).
3928 * Constants "card", "internal_split", "option_map" now with authentic
3929 syntax. INCOMPATIBILITY.
3931 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3932 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3933 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3934 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3935 Sup_set_def, le_def, less_def, option_map_def now with object
3936 equality. INCOMPATIBILITY.
3938 * Records. Removed K_record, and replaced it by pure lambda term
3939 %x. c. The simplifier setup is now more robust against eta expansion.
3940 INCOMPATIBILITY: in cases explicitly referring to K_record.
3942 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3944 * Library/ListVector: new theory of arithmetic vector operations.
3946 * Library/Order_Relation: new theory of various orderings as sets of
3947 pairs. Defines preorders, partial orders, linear orders and
3948 well-orders on sets and on types.
3953 * Renamed some theories to allow to loading both ZF and HOL in the
3956 Datatype -> Datatype_ZF
3957 Inductive -> Inductive_ZF
3964 INCOMPATIBILITY: ZF theories that import individual theories below
3965 Main might need to be adapted. Regular theory Main is still
3966 available, as trivial extension of Main_ZF.
3971 * ML within Isar: antiquotation @{const name} or @{const
3972 name(typargs)} produces statically-checked Const term.
3974 * Functor NamedThmsFun: data is available to the user as dynamic fact
3975 (of the same name). Removed obsolete print command.
3977 * Removed obsolete "use_legacy_bindings" function.
3979 * The ``print mode'' is now a thread-local value derived from a global
3980 template (the former print_mode reference), thus access becomes
3981 non-critical. The global print_mode reference is for session
3982 management only; user-code should use print_mode_value,
3983 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3985 * Functions system/system_out provide a robust way to invoke external
3986 shell commands, with propagation of interrupts (requires Poly/ML
3987 5.2.1). Do not use OS.Process.system etc. from the basis library!
3992 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3993 in accordance with Proof General 3.7, which prefers GNU emacs.
3995 * isatool tty runs Isabelle process with plain tty interaction;
3996 optional line editor may be specified via ISABELLE_LINE_EDITOR
3997 setting, the default settings attempt to locate "ledit" and "rlwrap".
3999 * isatool browser now works with Cygwin as well, using general
4000 "javapath" function defined in Isabelle process environment.
4002 * YXML notation provides a simple and efficient alternative to
4003 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4004 isatool yxml as described in the Isabelle system manual.
4006 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4007 provides general wrapper for managing an Isabelle process in a robust
4008 fashion, with ``cooked'' output from stdin/stderr.
4010 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4011 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4013 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4014 way of changing the user's settings is via
4015 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4018 * Multithreading.max_threads := 0 refers to the number of actual CPU
4019 cores of the underlying machine, which is a good starting point for
4020 optimal performance tuning. The corresponding usedir option -M allows
4021 "max" as an alias for "0". WARNING: does not work on certain versions
4022 of Mac OS (with Poly/ML 5.1).
4024 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4025 adverse effect of Isabelle flooding interactive front-ends (notably
4026 ProofGeneral / XEmacs).
4030 New in Isabelle2007 (November 2007)
4031 -----------------------------------
4035 * More uniform information about legacy features, notably a
4036 warning/error of "Legacy feature: ...", depending on the state of the
4037 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4038 legacy features will disappear eventually.
4040 * Theory syntax: the header format ``theory A = B + C:'' has been
4041 discontinued in favour of ``theory A imports B C begin''. Use isatool
4042 fixheaders to convert existing theory files. INCOMPATIBILITY.
4044 * Theory syntax: the old non-Isar theory file format has been
4045 discontinued altogether. Note that ML proof scripts may still be used
4046 with Isar theories; migration is usually quite simple with the ML
4047 function use_legacy_bindings. INCOMPATIBILITY.
4049 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4050 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4053 * Theory loader: be more serious about observing the static theory
4054 header specifications (including optional directories), but not the
4055 accidental file locations of previously successful loads. The strict
4056 update policy of former update_thy is now already performed by
4057 use_thy, so the former has been removed; use_thys updates several
4058 theories simultaneously, just as 'imports' within a theory header
4059 specification, but without merging the results. Potential
4060 INCOMPATIBILITY: may need to refine theory headers and commands
4061 ROOT.ML which depend on load order.
4063 * Theory loader: optional support for content-based file
4064 identification, instead of the traditional scheme of full physical
4065 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4066 (cf. the system manual). The new scheme allows to work with
4067 non-finished theories in persistent session images, such that source
4068 files may be moved later on without requiring reloads.
4070 * Theory loader: old-style ML proof scripts being *attached* to a thy
4071 file (with the same base name as the theory) are considered a legacy
4072 feature, which will disappear eventually. Even now, the theory loader
4073 no longer maintains dependencies on such files.
4075 * Syntax: the scope for resolving ambiguities via type-inference is
4076 now limited to individual terms, instead of whole simultaneous
4077 specifications as before. This greatly reduces the complexity of the
4078 syntax module and improves flexibility by separating parsing and
4079 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4080 'fixes' etc.) are required in rare situations.
4082 * Syntax: constants introduced by new-style packages ('definition',
4083 'abbreviation' etc.) are passed through the syntax module in
4084 ``authentic mode''. This means that associated mixfix annotations
4085 really stick to such constants, independently of potential name space
4086 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4087 trees are represented slightly differently, may need to adapt syntax
4088 translations accordingly. Use CONST marker in 'translations' and
4089 @{const_syntax} antiquotation in 'parse_translation' etc.
4091 * Legacy goal package: reduced interface to the bare minimum required
4092 to keep existing proof scripts running. Most other user-level
4093 functions are now part of the OldGoals structure, which is *not* open
4094 by default (consider isatool expandshort before open OldGoals).
4095 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4096 these tend to cause confusion about the actual goal (!) context being
4097 used here, which is not necessarily the same as the_context().
4099 * Command 'find_theorems': supports "*" wild-card in "name:"
4100 criterion; "with_dups" option. Certain ProofGeneral versions might
4101 support a specific search form (see ProofGeneral/CHANGES).
4103 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4104 by default, which means that "prems" (and also "fixed variables") are
4105 suppressed from proof state output. Note that the ProofGeneral
4106 settings mechanism allows to change and save options persistently, but
4107 older versions of Isabelle will fail to start up if a negative prems
4110 * Local theory targets may be specified by non-nested blocks of
4111 ``context/locale/class ... begin'' followed by ``end''. The body may
4112 contain definitions, theorems etc., including any derived mechanism
4113 that has been implemented on top of these primitives. This concept
4114 generalizes the existing ``theorem (in ...)'' towards more versatility
4117 * Proof General interface: proper undo of final 'end' command;
4118 discontinued Isabelle/classic mode (ML proof scripts).
4121 *** Document preparation ***
4123 * Added antiquotation @{theory name} which prints the given name,
4124 after checking that it refers to a valid ancestor theory in the
4127 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4128 check the given source text as ML type/structure, printing verbatim.
4130 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4131 "c args == rhs" given in the current context. (Any number of
4132 arguments may be given on the LHS.)
4137 * The 'class' package offers a combination of axclass and locale to
4138 achieve Haskell-like type classes in Isabelle. Definitions and
4139 theorems within a class context produce both relative results (with
4140 implicit parameters according to the locale context), and polymorphic
4141 constants with qualified polymorphism (according to the class
4142 context). Within the body context of a 'class' target, a separate
4143 syntax layer ("user space type system") takes care of converting
4144 between global polymorphic consts and internal locale representation.
4145 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4146 "isatool doc classes" provides a tutorial.
4148 * Generic code generator framework allows to generate executable
4149 code for ML and Haskell (including Isabelle classes). A short usage
4152 internal compilation:
4153 export_code <list of constants (term syntax)> in SML
4154 writing SML code to a file:
4155 export_code <list of constants (term syntax)> in SML <filename>
4156 writing OCaml code to a file:
4157 export_code <list of constants (term syntax)> in OCaml <filename>
4158 writing Haskell code to a bunch of files:
4159 export_code <list of constants (term syntax)> in Haskell <filename>
4161 evaluating closed propositions to True/False using code generation:
4164 Reasonable default setup of framework in HOL.
4166 Theorem attributs for selecting and transforming function equations theorems:
4168 [code fun]: select a theorem as function equation for a specific constant
4169 [code fun del]: deselect a theorem as function equation for a specific constant
4170 [code inline]: select an equation theorem for unfolding (inlining) in place
4171 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4173 User-defined serializations (target in {SML, OCaml, Haskell}):
4175 code_const <and-list of constants (term syntax)>
4176 {(target) <and-list of const target syntax>}+
4178 code_type <and-list of type constructors>
4179 {(target) <and-list of type target syntax>}+
4181 code_instance <and-list of instances>
4183 where instance ::= <type constructor> :: <class>
4185 code_class <and_list of classes>
4186 {(target) <and-list of class target syntax>}+
4187 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4189 code_instance and code_class only are effective to target Haskell.
4191 For example usage see src/HOL/ex/Codegenerator.thy and
4192 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4193 generation from Isabelle/HOL theories is available via "isatool doc
4196 * Code generator: consts in 'consts_code' Isar commands are now
4197 referred to by usual term syntax (including optional type
4200 * Command 'no_translations' removes translation rules from theory
4203 * Overloaded definitions are now actually checked for acyclic
4204 dependencies. The overloading scheme is slightly more general than
4205 that of Haskell98, although Isabelle does not demand an exact
4206 correspondence to type class and instance declarations.
4207 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4208 exotic versions of overloading -- at the discretion of the user!
4210 Polymorphic constants are represented via type arguments, i.e. the
4211 instantiation that matches an instance against the most general
4212 declaration given in the signature. For example, with the declaration
4213 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4214 as c(nat). Overloading is essentially simultaneous structural
4215 recursion over such type arguments. Incomplete specification patterns
4216 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4217 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4218 Command 'print_theory' outputs the normalized system of recursive
4219 equations, see section "definitions".
4221 * Configuration options are maintained within the theory or proof
4222 context (with name and type bool/int/string), providing a very simple
4223 interface to a poor-man's version of general context data. Tools may
4224 declare options in ML (e.g. using Attrib.config_int) and then refer to
4225 these values using Config.get etc. Users may change options via an
4226 associated attribute of the same name. This form of context
4227 declaration works particularly well with commands 'declare' or
4228 'using', for example ``declare [[foo = 42]]''. Thus it has become
4229 very easy to avoid global references, which would not observe Isar
4230 toplevel undo/redo and fail to work with multithreading.
4232 Various global ML references of Pure and HOL have been turned into
4233 configuration options:
4235 Unify.search_bound unify_search_bound
4236 Unify.trace_bound unify_trace_bound
4237 Unify.trace_simp unify_trace_simp
4238 Unify.trace_types unify_trace_types
4239 Simplifier.simp_depth_limit simp_depth_limit
4240 Blast.depth_limit blast_depth_limit
4241 DatatypeProp.dtK datatype_distinctness_limit
4242 fast_arith_neq_limit fast_arith_neq_limit
4243 fast_arith_split_limit fast_arith_split_limit
4245 * Named collections of theorems may be easily installed as context
4246 data using the functor NamedThmsFun (see also
4247 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4248 attributes; there is also a toplevel print command. This facility is
4249 just a common case of general context data, which is the preferred way
4250 for anything more complex than just a list of facts in canonical
4253 * Isar: command 'declaration' augments a local theory by generic
4254 declaration functions written in ML. This enables arbitrary content
4255 being added to the context, depending on a morphism that tells the
4256 difference of the original declaration context wrt. the application
4257 context encountered later on.
4259 * Isar: proper interfaces for simplification procedures. Command
4260 'simproc_setup' declares named simprocs (with match patterns, and body
4261 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4262 context. ML antiquotation @{simproc name} retrieves named simprocs.
4264 * Isar: an extra pair of brackets around attribute declarations
4265 abbreviates a theorem reference involving an internal dummy fact,
4266 which will be ignored later --- only the effect of the attribute on
4267 the background context will persist. This form of in-place
4268 declarations is particularly useful with commands like 'declare' and
4269 'using', for example ``have A using [[simproc a]] by simp''.
4271 * Isar: method "assumption" (and implicit closing of subproofs) now
4272 takes simple non-atomic goal assumptions into account: after applying
4273 an assumption as a rule the resulting subgoals are solved by atomic
4274 assumption steps. This is particularly useful to finish 'obtain'
4275 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4276 without referring to the original premise "!!x. P x ==> thesis" in the
4277 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4280 * Isar: implicit use of prems from the Isar proof context is
4281 considered a legacy feature. Common applications like ``have A .''
4282 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4283 referencing facts explicitly here improves readability and
4284 maintainability of proof texts.
4286 * Isar: improper proof element 'guess' is like 'obtain', but derives
4287 the obtained context from the course of reasoning! For example:
4289 assume "EX x y. A x & B y" -- "any previous fact"
4290 then guess x and y by clarify
4292 This technique is potentially adventurous, depending on the facts and
4293 proof tools being involved here.
4295 * Isar: known facts from the proof context may be specified as literal
4296 propositions, using ASCII back-quote syntax. This works wherever
4297 named facts used to be allowed so far, in proof commands, proof
4298 methods, attributes etc. Literal facts are retrieved from the context
4299 according to unification of type and term parameters. For example,
4300 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4301 theorems in the current context, then these are valid literal facts:
4302 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4304 There is also a proof method "fact" which does the same composition
4305 for explicit goal states, e.g. the following proof texts coincide with
4306 certain special cases of literal facts:
4308 have "A" by fact == note `A`
4309 have "A ==> B" by fact == note `A ==> B`
4310 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4311 have "P a ==> Q a" by fact == note `P a ==> Q a`
4313 * Isar: ":" (colon) is no longer a symbolic identifier character in
4314 outer syntax. Thus symbolic identifiers may be used without
4315 additional white space in declarations like this: ``assume *: A''.
4317 * Isar: 'print_facts' prints all local facts of the current context,
4318 both named and unnamed ones.
4320 * Isar: 'def' now admits simultaneous definitions, e.g.:
4322 def x == "t" and y == "u"
4324 * Isar: added command 'unfolding', which is structurally similar to
4325 'using', but affects both the goal state and facts by unfolding given
4326 rewrite rules. Thus many occurrences of the 'unfold' method or
4327 'unfolded' attribute may be replaced by first-class proof text.
4329 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4330 and command 'unfolding' now all support object-level equalities
4331 (potentially conditional). The underlying notion of rewrite rule is
4332 analogous to the 'rule_format' attribute, but *not* that of the
4333 Simplifier (which is usually more generous).
4335 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4336 premises of a theorem by n. Useful in conjunction with drule.
4338 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4339 method expression within a sandbox consisting of the first N
4340 sub-goals, which need to exist. For example, ``simp_all [3]''
4341 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4342 simplifies all new goals that emerge from applying rule foo to the
4343 originally first one.
4345 * Isar: schematic goals are no longer restricted to higher-order
4346 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4349 * Isar: the conclusion of a long theorem statement is now either
4350 'shows' (a simultaneous conjunction, as before), or 'obtains'
4351 (essentially a disjunction of cases with local parameters and
4352 assumptions). The latter allows to express general elimination rules
4353 adequately; in this notation common elimination rules look like this:
4355 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4357 obtains x where "P x"
4359 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4363 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4369 The subsequent classical rules even refer to the formal "thesis"
4372 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4375 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4376 obtains "thesis ==> something"
4378 The actual proof of an 'obtains' statement is analogous to that of the
4379 Isar proof element 'obtain', only that there may be several cases.
4380 Optional case names may be specified in parentheses; these will be
4381 available both in the present proof and as annotations in the
4382 resulting rule, for later use with the 'cases' method (cf. attribute
4385 * Isar: the assumptions of a long theorem statement are available as
4386 "assms" fact in the proof context. This is more appropriate than the
4387 (historical) "prems", which refers to all assumptions of the current
4388 context, including those from the target locale, proof body etc.
4390 * Isar: 'print_statement' prints theorems from the current theory or
4391 proof context in long statement form, according to the syntax of a
4394 * Isar: 'obtain' takes an optional case name for the local context
4395 introduction rule (default "that").
4397 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4398 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4401 * Pure: syntax "CONST name" produces a fully internalized constant
4402 according to the current context. This is particularly useful for
4403 syntax translations that should refer to internal constant
4404 representations independently of name spaces.
4406 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4407 instead of "FOO ". This allows multiple binder declarations to coexist
4408 in the same context. INCOMPATIBILITY.
4410 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4411 primitive that also works in a locale context (both for constants and
4412 fixed variables). Type declaration and internal syntactic representation
4413 of given constants retrieved from the context. Likewise, the
4414 'no_notation' command allows to remove given syntax annotations from the
4417 * Isar/locales: new derived specification elements 'axiomatization',
4418 'definition', 'abbreviation', which support type-inference, admit
4419 object-level specifications (equality, equivalence). See also the
4420 isar-ref manual. Examples:
4423 eq (infix "===" 50) where
4424 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4426 definition "f x y = x + y + 1"
4427 definition g where "g x = f x x"
4430 neq (infix "=!=" 50) where
4431 "x =!= y == ~ (x === y)"
4433 These specifications may be also used in a locale context. Then the
4434 constants being introduced depend on certain fixed parameters, and the
4435 constant name is qualified by the locale base name. An internal
4436 abbreviation takes care for convenient input and output, making the
4437 parameters implicit and using the original short name. See also
4438 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4439 entities from a monomorphic theory.
4441 Presently, abbreviations are only available 'in' a target locale, but
4442 not inherited by general import expressions. Also note that
4443 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4444 'translations' in common applications. The "no_abbrevs" print mode
4445 prevents folding of abbreviations in term output.
4447 Concrete syntax is attached to specified constants in internal form,
4448 independently of name spaces. The parse tree representation is
4449 slightly different -- use 'notation' instead of raw 'syntax', and
4450 'translations' with explicit "CONST" markup to accommodate this.
4452 * Pure/Isar: unified syntax for new-style specification mechanisms
4453 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4454 full type inference and dummy patterns ("_"). For example:
4456 definition "K x _ = x"
4458 inductive conj for A B
4459 where "A ==> B ==> conj A B"
4461 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4462 the current context. Print mode "no_abbrevs" prevents inversion of
4463 abbreviations on output.
4465 * Isar/locales: improved parameter handling: use of locales "var" and
4466 "struct" no longer necessary; - parameter renamings are no longer
4467 required to be injective. For example, this allows to define
4468 endomorphisms as locale endom = homom mult mult h.
4470 * Isar/locales: changed the way locales with predicates are defined.
4471 Instead of accumulating the specification, the imported expression is
4472 now an interpretation. INCOMPATIBILITY: different normal form of
4473 locale expressions. In particular, in interpretations of locales with
4474 predicates, goals repesenting already interpreted fragments are not
4475 removed automatically. Use methods `intro_locales' and
4476 `unfold_locales'; see below.
4478 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4479 provide backward reasoning on locales predicates. The methods are
4480 aware of interpretations and discharge corresponding goals.
4481 `intro_locales' is less aggressive then `unfold_locales' and does not
4482 unfold predicates to assumptions.
4484 * Isar/locales: the order in which locale fragments are accumulated
4485 has changed. This enables to override declarations from fragments due
4486 to interpretations -- for example, unwanted simp rules.
4488 * Isar/locales: interpretation in theories and proof contexts has been
4489 extended. One may now specify (and prove) equations, which are
4490 unfolded in interpreted theorems. This is useful for replacing
4491 defined concepts (constants depending on locale parameters) by
4492 concepts already existing in the target context. Example:
4494 interpretation partial_order ["op <= :: [int, int] => bool"]
4495 where "partial_order.less (op <=) (x::int) y = (x < y)"
4497 Typically, the constant `partial_order.less' is created by a
4498 definition specification element in the context of locale
4501 * Method "induct": improved internal context management to support
4502 local fixes and defines on-the-fly. Thus explicit meta-level
4503 connectives !! and ==> are rarely required anymore in inductive goals
4504 (using object-logic connectives for this purpose has been long
4505 obsolete anyway). Common proof patterns are explained in
4506 src/HOL/Induct/Common_Patterns.thy, see also
4507 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4510 * Method "induct": improved handling of simultaneous goals. Instead of
4511 introducing object-level conjunction, the statement is now split into
4512 several conclusions, while the corresponding symbolic cases are nested
4513 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4514 see src/HOL/Induct/Common_Patterns.thy, for example.
4516 * Method "induct": mutual induction rules are now specified as a list
4517 of rule sharing the same induction cases. HOL packages usually provide
4518 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4519 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4520 mutual induction rules differently, i.e. like this:
4522 (induct rule: foo_bar.inducts)
4523 (induct set: foo bar)
4524 (induct pred: foo bar)
4525 (induct type: foo bar)
4527 The ML function ProjectRule.projections turns old-style rules into the
4530 * Method "coinduct": dual of induction, see
4531 src/HOL/Library/Coinductive_List.thy for various examples.
4533 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4534 considered a legacy feature.
4536 * Attribute "symmetric" produces result with standardized schematic
4537 variables (index 0). Potential INCOMPATIBILITY.
4539 * Simplifier: by default the simplifier trace only shows top level
4540 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4541 default. Thus there is less danger of being flooded by the trace. The
4542 trace indicates where parts have been suppressed.
4544 * Provers/classical: removed obsolete classical version of elim_format
4545 attribute; classical elim/dest rules are now treated uniformly when
4546 manipulating the claset.
4548 * Provers/classical: stricter checks to ensure that supplied intro,
4549 dest and elim rules are well-formed; dest and elim rules must have at
4552 * Provers/classical: attributes dest/elim/intro take an optional
4553 weight argument for the rule (just as the Pure versions). Weights are
4554 ignored by automated tools, but determine the search order of single
4557 * Syntax: input syntax now supports dummy variable binding "%_. b",
4558 where the body does not mention the bound variable. Note that dummy
4559 patterns implicitly depend on their context of bounds, which makes
4560 "{_. _}" match any set comprehension as expected. Potential
4561 INCOMPATIBILITY -- parse translations need to cope with syntactic
4562 constant "_idtdummy" in the binding position.
4564 * Syntax: removed obsolete syntactic constant "_K" and its associated
4565 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4566 for example "A -> B" => "Pi A (%_. B)".
4568 * Pure: 'class_deps' command visualizes the subclass relation, using
4569 the graph browser tool.
4571 * Pure: 'print_theory' now suppresses certain internal declarations by
4572 default; use '!' option for full details.
4577 * Method "metis" proves goals by applying the Metis general-purpose
4578 resolution prover (see also http://gilith.com/software/metis/).
4579 Examples are in the directory MetisExamples. WARNING: the
4580 Isabelle/HOL-Metis integration does not yet work properly with
4583 * Command 'sledgehammer' invokes external automatic theorem provers as
4584 background processes. It generates calls to the "metis" method if
4585 successful. These can be pasted into the proof. Users do not have to
4586 wait for the automatic provers to return. WARNING: does not really
4587 work with multi-threading.
4589 * New "auto_quickcheck" feature tests outermost goal statements for
4590 potential counter-examples. Controlled by ML references
4591 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4592 5000 milliseconds). Fails silently if statements is outside of
4593 executable fragment, or any other codgenerator problem occurs.
4595 * New constant "undefined" with axiom "undefined x = undefined".
4597 * Added class "HOL.eq", allowing for code generation with polymorphic
4600 * Some renaming of class constants due to canonical name prefixing in
4601 the new 'class' package:
4603 HOL.abs ~> HOL.abs_class.abs
4604 HOL.divide ~> HOL.divide_class.divide
4605 0 ~> HOL.zero_class.zero
4606 1 ~> HOL.one_class.one
4607 op + ~> HOL.plus_class.plus
4608 op - ~> HOL.minus_class.minus
4609 uminus ~> HOL.minus_class.uminus
4610 op * ~> HOL.times_class.times
4611 op < ~> HOL.ord_class.less
4612 op <= > HOL.ord_class.less_eq
4613 Nat.power ~> Power.power_class.power
4614 Nat.size ~> Nat.size_class.size
4615 Numeral.number_of ~> Numeral.number_class.number_of
4616 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4617 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4618 Orderings.min ~> Orderings.ord_class.min
4619 Orderings.max ~> Orderings.ord_class.max
4620 Divides.op div ~> Divides.div_class.div
4621 Divides.op mod ~> Divides.div_class.mod
4622 Divides.op dvd ~> Divides.div_class.dvd
4624 INCOMPATIBILITY. Adaptions may be required in the following cases:
4626 a) User-defined constants using any of the names "plus", "minus",
4627 "times", "less" or "less_eq". The standard syntax translations for
4628 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4631 b) Variables named "plus", "minus", "times", "less", "less_eq"
4632 INCOMPATIBILITY: use more specific names.
4634 c) Permutative equations (e.g. "a + b = b + a")
4635 Since the change of names also changes the order of terms, permutative
4636 rewrite rules may get applied in a different order. Experience shows
4637 that this is rarely the case (only two adaptions in the whole Isabelle
4638 distribution). INCOMPATIBILITY: rewrite proofs
4640 d) ML code directly refering to constant names
4641 This in general only affects hand-written proof tactics, simprocs and
4642 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4643 Consider using @{const_name} antiquotation.
4645 * New class "default" with associated constant "default".
4647 * Function "sgn" is now overloaded and available on int, real, complex
4648 (and other numeric types), using class "sgn". Two possible defs of
4649 sgn are given as equational assumptions in the classes sgn_if and
4650 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4653 * Locale "partial_order" now unified with class "order" (cf. theory
4654 Orderings), added parameter "less". INCOMPATIBILITY.
4656 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4657 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4658 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4660 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4661 changed order of proof goals in instance proofs.
4663 * The transitivity reasoner for partial and linear orders is set up
4664 for classes "order" and "linorder". Instances of the reasoner are available
4665 in all contexts importing or interpreting the corresponding locales.
4666 Method "order" invokes the reasoner separately; the reasoner
4667 is also integrated with the Simplifier as a solver. Diagnostic
4668 command 'print_orders' shows the available instances of the reasoner
4669 in the current context.
4671 * Localized monotonicity predicate in theory "Orderings"; integrated
4672 lemmas max_of_mono and min_of_mono with this predicate.
4675 * Formulation of theorem "dense" changed slightly due to integration
4676 with new class dense_linear_order.
4678 * Uniform lattice theory development in HOL.
4680 constants "meet" and "join" now named "inf" and "sup"
4681 constant "Meet" now named "Inf"
4683 classes "meet_semilorder" and "join_semilorder" now named
4684 "lower_semilattice" and "upper_semilattice"
4685 class "lorder" now named "lattice"
4686 class "comp_lat" now named "complete_lattice"
4688 Instantiation of lattice classes allows explicit definitions
4689 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4691 INCOMPATIBILITY. Theorem renames:
4693 meet_left_le ~> inf_le1
4694 meet_right_le ~> inf_le2
4695 join_left_le ~> sup_ge1
4696 join_right_le ~> sup_ge2
4697 meet_join_le ~> inf_sup_ord
4700 le_meet ~> le_inf_iff
4701 le_join ~> ge_sup_conv
4702 meet_idempotent ~> inf_idem
4703 join_idempotent ~> sup_idem
4704 meet_comm ~> inf_commute
4705 join_comm ~> sup_commute
4706 meet_leI1 ~> le_infI1
4707 meet_leI2 ~> le_infI2
4708 le_joinI1 ~> le_supI1
4709 le_joinI2 ~> le_supI2
4710 meet_assoc ~> inf_assoc
4711 join_assoc ~> sup_assoc
4712 meet_left_comm ~> inf_left_commute
4713 meet_left_idempotent ~> inf_left_idem
4714 join_left_comm ~> sup_left_commute
4715 join_left_idempotent ~> sup_left_idem
4718 le_def_meet ~> le_iff_inf
4719 le_def_join ~> le_iff_sup
4720 join_absorp2 ~> sup_absorb2
4721 join_absorp1 ~> sup_absorb1
4722 meet_absorp1 ~> inf_absorb1
4723 meet_absorp2 ~> inf_absorb2
4724 meet_join_absorp ~> inf_sup_absorb
4725 join_meet_absorp ~> sup_inf_absorb
4726 distrib_join_le ~> distrib_sup_le
4727 distrib_meet_le ~> distrib_inf_le
4729 add_meet_distrib_left ~> add_inf_distrib_left
4730 add_join_distrib_left ~> add_sup_distrib_left
4731 is_join_neg_meet ~> is_join_neg_inf
4732 is_meet_neg_join ~> is_meet_neg_sup
4733 add_meet_distrib_right ~> add_inf_distrib_right
4734 add_join_distrib_right ~> add_sup_distrib_right
4735 add_meet_join_distribs ~> add_sup_inf_distribs
4736 join_eq_neg_meet ~> sup_eq_neg_inf
4737 meet_eq_neg_join ~> inf_eq_neg_sup
4738 add_eq_meet_join ~> add_eq_inf_sup
4739 meet_0_imp_0 ~> inf_0_imp_0
4740 join_0_imp_0 ~> sup_0_imp_0
4741 meet_0_eq_0 ~> inf_0_eq_0
4742 join_0_eq_0 ~> sup_0_eq_0
4743 neg_meet_eq_join ~> neg_inf_eq_sup
4744 neg_join_eq_meet ~> neg_sup_eq_inf
4745 join_eq_if ~> sup_eq_if
4747 mono_meet ~> mono_inf
4748 mono_join ~> mono_sup
4749 meet_bool_eq ~> inf_bool_eq
4750 join_bool_eq ~> sup_bool_eq
4751 meet_fun_eq ~> inf_fun_eq
4752 join_fun_eq ~> sup_fun_eq
4753 meet_set_eq ~> inf_set_eq
4754 join_set_eq ~> sup_set_eq
4755 meet1_iff ~> inf1_iff
4756 meet2_iff ~> inf2_iff
4765 join1_iff ~> sup1_iff
4766 join2_iff ~> sup2_iff
4776 is_meet_Meet ~> is_meet_Inf
4777 Meet_bool_def ~> Inf_bool_def
4778 Meet_fun_def ~> Inf_fun_def
4779 Meet_greatest ~> Inf_greatest
4780 Meet_lower ~> Inf_lower
4781 Meet_set_def ~> Inf_set_def
4784 Sup_bool_eq ~> Sup_bool_def
4785 Sup_fun_eq ~> Sup_fun_def
4786 Sup_set_eq ~> Sup_set_def
4788 listsp_meetI ~> listsp_infI
4789 listsp_meet_eq ~> listsp_inf_eq
4794 * Added syntactic class "size"; overloaded constant "size" now has
4795 type "'a::size ==> bool"
4797 * Internal reorganisation of `size' of datatypes: size theorems
4798 "foo.size" are no longer subsumed by "foo.simps" (but are still
4799 simplification rules by default!); theorems "prod.size" now named
4802 * Class "div" now inherits from class "times" rather than "type".
4805 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4806 Linorder etc. have disappeared; operations defined in terms of
4807 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4809 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4811 * HOL-Word: New extensive library and type for generic, fixed size
4812 machine words, with arithmetic, bit-wise, shifting and rotating
4813 operations, reflection into int, nat, and bool lists, automation for
4814 linear arithmetic (by automatic reflection into nat or int), including
4815 lemmas on overflow and monotonicity. Instantiated to all appropriate
4816 arithmetic type classes, supporting automatic simplification of
4817 numerals on all operations.
4819 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4821 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4823 * Code generator library theories:
4824 - Code_Integer represents HOL integers by big integer literals in target
4826 - Code_Char represents HOL characters by character literals in target
4828 - Code_Char_chr like Code_Char, but also offers treatment of character
4829 codes; includes Code_Integer.
4830 - Executable_Set allows to generate code for finite sets using lists.
4831 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4833 - Executable_Real implements a subset of real numbers, namly those
4834 representable by rational numbers.
4835 - Efficient_Nat implements natural numbers by integers, which in general will
4836 result in higher efficency; pattern matching with 0/Suc is eliminated;
4837 includes Code_Integer.
4838 - Code_Index provides an additional datatype index which is mapped to
4839 target-language built-in integers.
4840 - Code_Message provides an additional datatype message_string which is isomorphic to
4841 strings; messages are mapped to target-language strings.
4843 * New package for inductive predicates
4845 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4848 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4849 for z_1 :: U_1 and ... and z_n :: U_m
4851 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4854 with full support for type-inference, rather than
4856 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4858 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4859 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4861 inductive "s z_1 ... z_m"
4863 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4866 For backward compatibility, there is a wrapper allowing inductive
4867 sets to be defined with the new package via
4870 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4871 for z_1 :: U_1 and ... and z_n :: U_m
4873 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4879 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4880 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4881 for z_1 :: U_1 and ... and z_n :: U_m
4883 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4884 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4887 if the additional syntax "p ..." is required.
4889 Numerous examples can be found in the subdirectories src/HOL/Auth,
4890 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4894 - Since declaration and definition of inductive sets or predicates
4895 is no longer separated, abbreviations involving the newly
4896 introduced sets or predicates must be specified together with the
4897 introduction rules after the 'where' keyword (see above), rather
4898 than before the actual inductive definition.
4900 - The variables in induction and elimination rules are now
4901 quantified in the order of their occurrence in the introduction
4902 rules, rather than in alphabetical order. Since this may break
4903 some proofs, these proofs either have to be repaired, e.g. by
4904 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4905 statements of the form
4907 case (rule_i a_i_1 ... a_i_{k_i})
4909 or the old order of quantification has to be restored by explicitly adding
4910 meta-level quantifiers in the introduction rules, i.e.
4912 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4914 - The format of the elimination rules is now
4916 p z_1 ... z_m x_1 ... x_n ==>
4917 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4922 (x_1, ..., x_n) : s z_1 ... z_m ==>
4923 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4926 for sets rather than
4928 x : s z_1 ... z_m ==>
4929 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4932 This may require terms in goals to be expanded to n-tuples
4933 (e.g. using case_tac or simplification with the split_paired_all
4934 rule) before the above elimination rule is applicable.
4936 - The elimination or case analysis rules for (mutually) inductive
4937 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4938 list of rules "p_1_..._p_k.elims" is no longer available.
4940 * New package "function"/"fun" for general recursive functions,
4941 supporting mutual and nested recursion, definitions in local contexts,
4942 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4943 for small examples, and the separate tutorial on the function
4944 package. The old recdef "package" is still available as before, but
4945 users are encouraged to use the new package.
4947 * Method "lexicographic_order" automatically synthesizes termination
4948 relations as lexicographic combinations of size measures.
4950 * Case-expressions allow arbitrary constructor-patterns (including
4951 "_") and take their order into account, like in functional
4952 programming. Internally, this is translated into nested
4953 case-expressions; missing cases are added and mapped to the predefined
4954 constant "undefined". In complicated cases printing may no longer show
4955 the original input but the internal form. Lambda-abstractions allow
4956 the same form of pattern matching: "% pat1 => e1 | ..." is an
4957 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4960 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4961 is an abbreviation for "of_nat :: nat => int". The simplification
4962 rules for "of_nat" have been changed to work like "int" did
4963 previously. Potential INCOMPATIBILITY:
4964 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4965 - of_nat_diff and of_nat_mult are no longer default simp rules
4967 * Method "algebra" solves polynomial equations over (semi)rings using
4968 Groebner bases. The (semi)ring structure is defined by locales and the
4969 tool setup depends on that generic context. Installing the method for
4970 a specific type involves instantiating the locale and possibly adding
4971 declarations for computation on the coefficients. The method is
4972 already instantiated for natural numbers and for the axiomatic class
4973 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4974 CALCULEMUS 2007 for the general principles underlying this
4975 architecture of context-aware proof-tools.
4977 * Method "ferrack" implements quantifier elimination over
4978 special-purpose dense linear orders using locales (analogous to
4979 "algebra"). The method is already installed for class
4980 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4983 * Former constant "List.op @" now named "List.append". Use ML
4984 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4985 circumvent possible incompatibilities when working on ML level.
4987 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4989 * New function listsum :: 'a list => 'a for arbitrary monoids.
4990 Special syntax: "SUM x <- xs. f x" (and latex variants)
4992 * New syntax for Haskell-like list comprehension (input only), eg.
4993 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4995 * The special syntax for function "filter" has changed from [x :
4996 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4997 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4999 * [a..b] is now defined for arbitrary linear orders. It used to be
5000 defined on nat only, as an abbreviation for [a..<Suc b]
5003 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5005 * New functions "sorted" and "sort" in src/HOL/List.thy.
5007 * New lemma collection field_simps (an extension of ring_simps) for
5008 manipulating (in)equations involving division. Multiplies with all
5009 denominators that can be proved to be non-zero (in equations) or
5010 positive/negative (in inequations).
5012 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5013 have been improved and renamed to ring_simps, group_simps and
5014 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5015 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5017 * Theory Library/Commutative_Ring: switched from recdef to function
5018 package; constants add, mul, pow now curried. Infix syntax for
5019 algebraic operations.
5021 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5024 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5027 * HOL/records: generalised field-update to take a function on the
5028 field rather than the new value: r(|A := x|) is translated to A_update
5029 (K x) r The K-combinator that is internally used is called K_record.
5030 INCOMPATIBILITY: Usage of the plain update functions has to be
5033 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5034 * x = 0, which are required for a semiring. Richer structures do not
5035 inherit from semiring_0 anymore, because this property is a theorem
5036 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5037 there is more to prove, but this is mostly trivial.
5039 * Class "recpower" is generalized to arbitrary monoids, not just
5040 commutative semirings. INCOMPATIBILITY: may need to incorporate
5041 commutativity or semiring properties additionally.
5043 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5044 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5045 better use 'abbreviation'.
5047 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5049 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5050 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5051 significant changes for setting up numeral syntax for types:
5052 - New constants Numeral.pred and Numeral.succ instead
5053 of former Numeral.bin_pred and Numeral.bin_succ.
5054 - Use integer operations instead of bin_add, bin_mult and so on.
5055 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5056 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5058 See src/HOL/Integ/IntArith.thy for an example setup.
5060 * Command 'normal_form' computes the normal form of a term that may
5061 contain free variables. For example ``normal_form "rev [a, b, c]"''
5062 produces ``[b, c, a]'' (without proof). This command is suitable for
5063 heavy-duty computations because the functions are compiled to ML
5064 first. Correspondingly, a method "normalization" is provided. See
5065 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5067 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5068 25 like -->); output depends on the "iff" print_mode, the default is
5069 "A = B" (with priority 50).
5071 * Relations less (<) and less_eq (<=) are also available on type bool.
5072 Modified syntax to disallow nesting without explicit parentheses,
5073 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5076 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5078 * Relation composition operator "op O" now has precedence 75 and binds
5079 stronger than union and intersection. INCOMPATIBILITY.
5081 * The old set interval syntax "{m..n(}" (and relatives) has been
5082 removed. Use "{m..<n}" (and relatives) instead.
5084 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5085 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5086 ``declare [[simproc del: neq]]''.
5088 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5091 * Theorem Cons_eq_map_conv no longer declared as "simp".
5093 * Theorem setsum_mult renamed to setsum_right_distrib.
5095 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5098 * Reimplemented methods "sat" and "satx", with several improvements:
5099 goals no longer need to be stated as "<prems> ==> False", equivalences
5100 (i.e. "=" on type bool) are handled, variable names of the form
5101 "lit_<n>" are no longer reserved, significant speedup.
5103 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5104 zChaff is still supported as well.
5106 * 'inductive' and 'datatype': provide projections of mutual rules,
5107 bundled as foo_bar.inducts;
5109 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5112 * Library: moved theory Accessible_Part to main HOL.
5114 * Library: added theory Coinductive_List of potentially infinite lists
5115 as greatest fixed-point.
5117 * Library: added theory AssocList which implements (finite) maps as
5120 * Method "evaluation" solves goals (i.e. a boolean expression)
5121 efficiently by compiling it to ML. The goal is "proved" (via an
5122 oracle) if it evaluates to True.
5124 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5125 also when invoked by the simplifier. This results in the Simplifier
5126 being more powerful on arithmetic goals. INCOMPATIBILITY.
5127 Configuration option fast_arith_split_limit=0 recovers the old
5130 * Support for hex (0x20) and binary (0b1001) numerals.
5132 * New method: reify eqs (t), where eqs are equations for an
5133 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5134 parameter, computes a term s::'b and a list xs::'a list and proves the
5135 theorem I xs s = t. This is also known as reification or quoting. The
5136 resulting theorem is applied to the subgoal to substitute t with I xs
5137 s. If t is omitted, the subgoal itself is reified.
5139 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5140 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5141 where f is supposed to be a computable function (in the sense of code
5142 generattion). The method uses reify to compute s and xs as above then
5143 applies corr_thm and uses normalization by evaluation to "prove" f s =
5144 r and finally gets the theorem t = r, which is again applied to the
5145 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5147 * Reflection: Automatic reification now handels binding, an example is
5148 available in src/HOL/ex/ReflectionEx.thy
5150 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5151 command 'statespace' that is similar to 'record', but introduces an
5152 abstract specification based on the locale infrastructure instead of
5153 HOL types. This leads to extra flexibility in composing state spaces,
5154 in particular multiple inheritance and renaming of components.
5159 * Hyperreal: Functions root and sqrt are now defined on negative real
5160 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5161 Nonnegativity side conditions have been removed from many lemmas, so
5162 that more subgoals may now be solved by simplification; potential
5165 * Real: new type classes formalize real normed vector spaces and
5166 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5167 and norm :: 'a => real.
5169 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5170 reals into other types. The overloaded constant Reals :: 'a set is now
5171 defined as range of_real; potential INCOMPATIBILITY.
5173 * Real: proper support for ML code generation, including 'quickcheck'.
5174 Reals are implemented as arbitrary precision rationals.
5176 * Hyperreal: Several constants that previously worked only for the
5177 reals have been generalized, so they now work over arbitrary vector
5178 spaces. Type annotations may need to be added in some cases; potential
5181 Infinitesimal :: ('a::real_normed_vector) star set
5182 HFinite :: ('a::real_normed_vector) star set
5183 HInfinite :: ('a::real_normed_vector) star set
5184 approx :: ('a::real_normed_vector) star => 'a star => bool
5185 monad :: ('a::real_normed_vector) star => 'a star set
5186 galaxy :: ('a::real_normed_vector) star => 'a star set
5187 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5188 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5189 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5190 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5191 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5192 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5193 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5194 sgn :: 'a::real_normed_vector => 'a
5195 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5197 * Complex: Some complex-specific constants are now abbreviations for
5198 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5199 hnorm. Other constants have been entirely removed in favor of the
5200 polymorphic versions (INCOMPATIBILITY):
5204 HInfinite <-- CInfinite
5205 Infinitesimal <-- CInfinitesimal
5208 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5209 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5210 (ns)deriv <-- (ns)cderiv
5215 * Formalisation of ideals and the quotient construction over rings.
5217 * Order and lattice theory no longer based on records.
5220 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5221 greatest_closed. INCOMPATIBILITY.
5223 * Method algebra is now set up via an attribute. For examples see
5224 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5225 of algebraic structures.
5227 * Renamed theory CRing to Ring.
5232 * Substantial, yet incomplete support for nominal datatypes (binding
5233 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5234 src/HOL/Nominal/Examples. Prospective users should consult
5235 http://isabelle.in.tum.de/nominal/
5240 * ML basics: just one true type int, which coincides with IntInf.int
5243 * ML within Isar: antiquotations allow to embed statically-checked
5244 formal entities in the source, referring to the context available at
5245 compile-time. For example:
5247 ML {* @{sort "{zero,one}"} *}
5248 ML {* @{typ "'a => 'b"} *}
5249 ML {* @{term "%x. x"} *}
5250 ML {* @{prop "x == y"} *}
5251 ML {* @{ctyp "'a => 'b"} *}
5252 ML {* @{cterm "%x. x"} *}
5253 ML {* @{cprop "x == y"} *}
5254 ML {* @{thm asm_rl} *}
5255 ML {* @{thms asm_rl} *}
5256 ML {* @{type_name c} *}
5257 ML {* @{type_syntax c} *}
5258 ML {* @{const_name c} *}
5259 ML {* @{const_syntax c} *}
5262 ML {* @{theory Pure} *}
5263 ML {* @{theory_ref} *}
5264 ML {* @{theory_ref Pure} *}
5267 ML {* @{clasimpset} *}
5269 The same works for sources being ``used'' within an Isar context.
5271 * ML in Isar: improved error reporting; extra verbosity with
5272 ML_Context.trace enabled.
5274 * Pure/General/table.ML: the join operations now works via exceptions
5275 DUP/SAME instead of type option. This is simpler in simple cases, and
5276 admits slightly more efficient complex applications.
5278 * Pure: 'advanced' translation functions (parse_translation etc.) now
5279 use Context.generic instead of just theory.
5281 * Pure: datatype Context.generic joins theory/Proof.context and
5282 provides some facilities for code that works in either kind of
5283 context, notably GenericDataFun for uniform theory and proof data.
5285 * Pure: simplified internal attribute type, which is now always
5286 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5287 local (Proof.context) attributes have been discontinued, while
5288 minimizing code duplication. Thm.rule_attribute and
5289 Thm.declaration_attribute build canonical attributes; see also structure
5290 Context for further operations on Context.generic, notably
5291 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5292 declarations and definitions.
5294 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5295 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5296 init only required for impure data. INCOMPATIBILITY: empty really need
5297 to be empty (no dependencies on theory content!)
5299 * Pure/kernel: consts certification ignores sort constraints given in
5300 signature declarations. (This information is not relevant to the
5301 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5302 potential INCOMPATIBILITY.
5304 * Pure: axiomatic type classes are now purely definitional, with
5305 explicit proofs of class axioms and super class relations performed
5306 internally. See Pure/axclass.ML for the main internal interfaces --
5307 notably AxClass.define_class supercedes AxClass.add_axclass, and
5308 AxClass.axiomatize_class/classrel/arity supersede
5309 Sign.add_classes/classrel/arities.
5311 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5312 global/local versions on theory vs. Proof.context have been
5313 discontinued; Attrib.syntax and Method.syntax have been adapted
5314 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5315 attributes, methods, etc.
5317 * Pure: several functions of signature "... -> theory -> theory * ..."
5318 have been reoriented to "... -> theory -> ... * theory" in order to
5319 allow natural usage in combination with the ||>, ||>>, |-> and
5320 fold_map combinators.
5322 * Pure: official theorem names (closed derivations) and additional
5323 comments (tags) are now strictly separate. Name hints -- which are
5324 maintained as tags -- may be attached any time without affecting the
5327 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5328 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5329 achieve the old behaviour.
5331 * Pure: the "Goal" constant is now called "prop", supporting a
5332 slightly more general idea of ``protecting'' meta-level rule
5335 * Pure: Logic.(un)varify only works in a global context, which is now
5336 enforced instead of silently assumed. INCOMPATIBILITY, may use
5337 Logic.legacy_(un)varify as temporary workaround.
5339 * Pure: structure Name provides scalable operations for generating
5340 internal variable names, notably Name.variants etc. This replaces
5341 some popular functions from term.ML:
5343 Term.variant -> Name.variant
5344 Term.variantlist -> Name.variant_list
5345 Term.invent_names -> Name.invent_list
5347 Note that low-level renaming rarely occurs in new code -- operations
5348 from structure Variable are used instead (see below).
5350 * Pure: structure Variable provides fundamental operations for proper
5351 treatment of fixed/schematic variables in a context. For example,
5352 Variable.import introduces fixes for schematics of given facts and
5353 Variable.export reverses the effect (up to renaming) -- this replaces
5354 various freeze_thaw operations.
5356 * Pure: structure Goal provides simple interfaces for
5357 init/conclude/finish and tactical prove operations (replacing former
5358 Tactic.prove). Goal.prove is the canonical way to prove results
5359 within a given context; Goal.prove_global is a degraded version for
5360 theory level goals, including a global Drule.standard. Note that
5361 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5362 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5363 in a locale context).
5365 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5366 and type checking (Syntax.check_term etc.), with common combinations
5367 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5368 which are considered legacy and await removal.
5370 * Pure/Syntax: generic interfaces for type unchecking
5371 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5372 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5373 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5374 available for convenience, but refer to the very same operations using
5375 a mere theory instead of a full context.
5377 * Isar: simplified treatment of user-level errors, using exception
5378 ERROR of string uniformly. Function error now merely raises ERROR,
5379 without any side effect on output channels. The Isar toplevel takes
5380 care of proper display of ERROR exceptions. ML code may use plain
5381 handle/can/try; cat_error may be used to concatenate errors like this:
5383 ... handle ERROR msg => cat_error msg "..."
5385 Toplevel ML code (run directly or through the Isar toplevel) may be
5386 embedded into the Isar toplevel with exception display/debug like
5389 Isar.toplevel (fn () => ...)
5391 INCOMPATIBILITY, removed special transform_error facilities, removed
5392 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5393 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5394 -- use plain ERROR instead.
5396 * Isar: theory setup now has type (theory -> theory), instead of a
5397 list. INCOMPATIBILITY, may use #> to compose setup functions.
5399 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5400 ProofContext.debug/verbose flags.
5402 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5403 theory before entering a proof state. Transactions now always see a
5404 quasi-functional intermediate checkpoint, both in interactive and
5407 * Isar: simplified interfaces for outer syntax. Renamed
5408 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5409 OuterSyntax.add_parsers -- this functionality is now included in
5410 OuterSyntax.command etc. INCOMPATIBILITY.
5412 * Simplifier: the simpset of a running simplification process now
5413 contains a proof context (cf. Simplifier.the_context), which is the
5414 very context that the initial simpset has been retrieved from (by
5415 simpset_of/local_simpset_of). Consequently, all plug-in components
5416 (solver, looper etc.) may depend on arbitrary proof data.
5418 * Simplifier.inherit_context inherits the proof context (plus the
5419 local bounds) of the current simplification process; any simproc
5420 etc. that calls the Simplifier recursively should do this! Removed
5421 former Simplifier.inherit_bounds, which is already included here --
5422 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5423 specify an explicit context using Simplifier.context/theory_context.
5425 * Simplifier/Classical Reasoner: more abstract interfaces
5426 change_simpset/claset for modifying the simpset/claset reference of a
5427 theory; raw versions simpset/claset_ref etc. have been discontinued --
5430 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5436 * settings: the default heap location within ISABELLE_HOME_USER now
5437 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5438 Isabelle installations.
5440 * isabelle-process: option -S (secure mode) disables some critical
5441 operations, notably runtime compilation and evaluation of ML source
5444 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5446 * Support for parallel execution, using native multicore support of
5447 Poly/ML 5.1. The theory loader exploits parallelism when processing
5448 independent theories, according to the given theory header
5449 specifications. The maximum number of worker threads is specified via
5450 usedir option -M or the "max-threads" setting in Proof General. A
5451 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5452 to 6 on a 8-core machine. User-code needs to observe certain
5453 guidelines for thread-safe programming, see appendix A in the Isar
5454 Implementation manual.
5458 New in Isabelle2005 (October 2005)
5459 ----------------------------------
5463 * Theory headers: the new header syntax for Isar theories is
5466 imports <theory1> ... <theoryN>
5467 uses <file1> ... <fileM>
5470 where the 'uses' part is optional. The previous syntax
5472 theory <name> = <theory1> + ... + <theoryN>:
5474 will disappear in the next release. Use isatool fixheaders to convert
5475 existing theory files. Note that there is no change in ancient
5476 non-Isar theories now, but these will disappear soon.
5478 * Theory loader: parent theories can now also be referred to via
5479 relative and absolute paths.
5481 * Command 'find_theorems' searches for a list of criteria instead of a
5482 list of constants. Known criteria are: intro, elim, dest, name:string,
5483 simp:term, and any term. Criteria can be preceded by '-' to select
5484 theorems that do not match. Intro, elim, dest select theorems that
5485 match the current goal, name:s selects theorems whose fully qualified
5486 name contain s, and simp:term selects all simplification rules whose
5487 lhs match term. Any other term is interpreted as pattern and selects
5488 all theorems matching the pattern. Available in ProofGeneral under
5489 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5491 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5493 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5494 matching the current goal as introduction rule and not having "HOL."
5495 in their name (i.e. not being defined in theory HOL).
5497 * Command 'thms_containing' has been discontinued in favour of
5498 'find_theorems'; INCOMPATIBILITY.
5500 * Communication with Proof General is now 8bit clean, which means that
5501 Unicode text in UTF-8 encoding may be used within theory texts (both
5502 formal and informal parts). Cf. option -U of the Isabelle Proof
5503 General interface. Here are some simple examples (cf. src/HOL/ex):
5505 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5506 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5508 * Improved efficiency of the Simplifier and, to a lesser degree, the
5509 Classical Reasoner. Typical big applications run around 2 times
5513 *** Document preparation ***
5515 * Commands 'display_drafts' and 'print_drafts' perform simple output
5516 of raw sources. Only those symbols that do not require additional
5517 LaTeX packages (depending on comments in isabellesym.sty) are
5518 displayed properly, everything else is left verbatim. isatool display
5519 and isatool print are used as front ends (these are subject to the
5520 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5522 * Command tags control specific markup of certain regions of text,
5523 notably folding and hiding. Predefined tags include "theory" (for
5524 theory begin and end), "proof" for proof commands, and "ML" for
5525 commands involving ML code; the additional tags "visible" and
5526 "invisible" are unused by default. Users may give explicit tag
5527 specifications in the text, e.g. ''by %invisible (auto)''. The
5528 interpretation of tags is determined by the LaTeX job during document
5529 preparation: see option -V of isatool usedir, or options -n and -t of
5530 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5533 Several document versions may be produced at the same time via isatool
5534 usedir (the generated index.html will link all of them). Typical
5535 specifications include ''-V document=theory,proof,ML'' to present
5536 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5537 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5538 these parts without any formal replacement text. The Isabelle site
5539 default settings produce ''document'' and ''outline'' versions as
5542 * Several new antiquotations:
5544 @{term_type term} prints a term with its type annotated;
5546 @{typeof term} prints the type of a term;
5548 @{const const} is the same as @{term const}, but checks that the
5549 argument is a known logical constant;
5551 @{term_style style term} and @{thm_style style thm} print a term or
5552 theorem applying a "style" to it
5556 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5557 definitions, equations, inequations etc., 'concl' printing only the
5558 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5559 to print the specified premise. TermStyle.add_style provides an ML
5560 interface for introducing further styles. See also the "LaTeX Sugar"
5561 document practical applications. The ML antiquotation prints
5562 type-checked ML expressions verbatim.
5564 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5565 and 'text' support optional locale specification '(in loc)', which
5566 specifies the default context for interpreting antiquotations. For
5567 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5569 * Option 'locale=NAME' of antiquotations specifies an alternative
5570 context interpreting the subsequent argument. For example: @{thm
5571 [locale=lattice] inf_assoc}.
5573 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5576 * Proper output of antiquotations for theory commands involving a
5577 proof context (such as 'locale' or 'theorem (in loc) ...').
5579 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5580 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5582 * isatool usedir: new option -C (default true) controls whether option
5583 -D should include a copy of the original document directory; -C false
5584 prevents unwanted effects such as copying of administrative CVS data.
5589 * Considerably improved version of 'constdefs' command. Now performs
5590 automatic type-inference of declared constants; additional support for
5591 local structure declarations (cf. locales and HOL records), see also
5592 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5593 sequential dependencies of definitions within a single 'constdefs'
5594 section; moreover, the declared name needs to be an identifier. If
5595 all fails, consider to fall back on 'consts' and 'defs' separately.
5597 * Improved indexed syntax and implicit structures. First of all,
5598 indexed syntax provides a notational device for subscripted
5599 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5600 expressions. Secondly, in a local context with structure
5601 declarations, number indexes \<^sub>n or the empty index (default
5602 number 1) refer to a certain fixed variable implicitly; option
5603 show_structs controls printing of implicit structures. Typical
5604 applications of these concepts involve record types and locales.
5606 * New command 'no_syntax' removes grammar declarations (and
5607 translations) resulting from the given syntax specification, which is
5608 interpreted in the same manner as for the 'syntax' command.
5610 * 'Advanced' translation functions (parse_translation etc.) may depend
5611 on the signature of the theory context being presently used for
5612 parsing/printing, see also isar-ref manual.
5614 * Improved 'oracle' command provides a type-safe interface to turn an
5615 ML expression of type theory -> T -> term into a primitive rule of
5616 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5617 is already included here); see also FOL/ex/IffExample.thy;
5620 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5621 before); "cI" is no longer bound, use "c.intro" instead.
5622 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5623 axclasses vs. locales.
5625 * Improved internal renaming of symbolic identifiers -- attach primes
5626 instead of base 26 numbers.
5628 * New flag show_question_marks controls printing of leading question
5629 marks in schematic variable names.
5631 * In schematic variable names, *any* symbol following \<^isub> or
5632 \<^isup> is now treated as part of the base name. For example, the
5633 following works without printing of awkward ".0" indexes:
5635 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5638 * Inner syntax includes (*(*nested*) comments*).
5640 * Pretty printer now supports unbreakable blocks, specified in mixfix
5641 annotations as "(00...)".
5643 * Clear separation of logical types and nonterminals, where the latter
5644 may only occur in 'syntax' specifications or type abbreviations.
5645 Before that distinction was only partially implemented via type class
5646 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5647 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5648 exotic syntax specifications may require further adaption
5649 (e.g. Cube/Cube.thy).
5651 * Removed obsolete type class "logic", use the top sort {} instead.
5652 Note that non-logical types should be declared as 'nonterminals'
5653 rather than 'types'. INCOMPATIBILITY for new object-logic
5656 * Attributes 'induct' and 'cases': type or set names may now be
5657 locally fixed variables as well.
5659 * Simplifier: can now control the depth to which conditional rewriting
5660 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5663 * Simplifier: simplification procedures may now take the current
5664 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5665 interface), which is very useful for calling the Simplifier
5666 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5667 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5668 low-level mk_simproc no longer applies Logic.varify internally, to
5669 allow for use in a context of fixed variables.
5671 * thin_tac now works even if the assumption being deleted contains !!
5672 or ==>. More generally, erule now works even if the major premise of
5673 the elimination rule contains !! or ==>.
5675 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5677 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5678 from Pure, which contains all common declarations already. Both
5679 theories are defined via plain Isabelle/Isar .thy files.
5680 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5681 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5682 use isatool fixcpure to adapt your theory and ML sources.
5684 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5685 selections of theorems in named facts via index ranges.
5687 * 'print_theorems': in theory mode, really print the difference
5688 wrt. the last state (works for interactive theory development only),
5689 in proof mode print all local facts (cf. 'print_facts');
5691 * 'hide': option '(open)' hides only base names.
5693 * More efficient treatment of intermediate checkpoints in interactive
5696 * Code generator is now invoked via code_module (incremental code
5697 generation) and code_library (modular code generation, ML structures
5698 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5699 must be quoted when used as identifiers.
5701 * New 'value' command for reading, evaluating and printing terms using
5702 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5703 quoted when used as identifier.
5708 * New commands for the interpretation of locale expressions in
5709 theories (1), locales (2) and proof contexts (3). These generate
5710 proof obligations from the expression specification. After the
5711 obligations have been discharged, theorems of the expression are added
5712 to the theory, target locale or proof context. The synopsis of the
5713 commands is a follows:
5715 (1) interpretation expr inst
5716 (2) interpretation target < expr
5717 (3) interpret expr inst
5719 Interpretation in theories and proof contexts require a parameter
5720 instantiation of terms from the current context. This is applied to
5721 specifications and theorems of the interpreted expression.
5722 Interpretation in locales only permits parameter renaming through the
5723 locale expression. Interpretation is smart in that interpretations
5724 that are active already do not occur in proof obligations, neither are
5725 instantiated theorems stored in duplicate. Use 'print_interps' to
5726 inspect active interpretations of a particular locale. For details,
5727 see the Isar Reference manual. Examples can be found in
5728 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5730 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5731 'interpret' instead.
5733 * New context element 'constrains' for adding type constraints to
5736 * Context expressions: renaming of parameters with syntax
5739 * Locale declaration: 'includes' disallowed.
5741 * Proper static binding of attribute syntax -- i.e. types / terms /
5742 facts mentioned as arguments are always those of the locale definition
5743 context, independently of the context of later invocations. Moreover,
5744 locale operations (renaming and type / term instantiation) are applied
5745 to attribute arguments as expected.
5747 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5748 actual attributes; rare situations may require Attrib.attribute to
5749 embed those attributes into Attrib.src that lack concrete syntax.
5750 Attribute implementations need to cooperate properly with the static
5751 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5752 Attrib.XXX_thm etc. already do the right thing without further
5753 intervention. Only unusual applications -- such as "where" or "of"
5754 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5755 on the context and the facts involved -- may have to assign parsed
5756 values to argument tokens explicitly.
5758 * Changed parameter management in theorem generation for long goal
5759 statements with 'includes'. INCOMPATIBILITY: produces a different
5760 theorem statement in rare situations.
5762 * Locale inspection command 'print_locale' omits notes elements. Use
5763 'print_locale!' to have them included in the output.
5768 * Provers/hypsubst.ML: improved version of the subst method, for
5769 single-step rewriting: it now works in bound variable contexts. New is
5770 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5771 rewrite a different subterm than the original subst method, which is
5772 still available as 'simplesubst'.
5774 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5777 * Provers/trancl.ML: new transitivity reasoner for transitive and
5778 reflexive-transitive closure of relations.
5780 * Provers/blast.ML: new reference depth_limit to make blast's depth
5781 limit (previously hard-coded with a value of 20) user-definable.
5783 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5784 is peformed already. Object-logics merely need to finish their
5785 initial simpset configuration as before. INCOMPATIBILITY.
5790 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5793 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5795 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5796 and x-symbol; use option '-m epsilon' to get it actually printed.
5797 Moreover, the mathematically important symbolic identifier \<epsilon>
5798 becomes available as variable, constant etc. INCOMPATIBILITY,
5800 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5801 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5802 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5803 support corresponding Isar calculations.
5805 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5808 * theory SetInterval: changed the syntax for open intervals:
5817 The old syntax is still supported but will disappear in the next
5818 release. For conversion use the following Emacs search and replace
5819 patterns (these are not perfect but work quite well):
5821 {)\([^\.]*\)\.\. -> {\1<\.\.}
5822 \.\.\([^(}]*\)(} -> \.\.<\1}
5824 * Theory Commutative_Ring (in Library): method comm_ring for proving
5825 equalities in commutative rings; method 'algebra' provides a generic
5828 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5829 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5830 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5833 Some new syntax forms are available:
5835 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5836 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5837 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5838 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5840 The latter form "\<Sum>x < k. e" used to be based on a separate
5841 function "Summation", which has been discontinued.
5843 * theory Finite_Set: in structured induction proofs, the insert case
5844 is now 'case (insert x F)' instead of the old counterintuitive 'case
5847 * The 'refute' command has been extended to support a much larger
5848 fragment of HOL, including axiomatic type classes, constdefs and
5849 typedefs, inductive datatypes and recursion.
5851 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5852 Requires zChaff with proof generation to be installed. See
5853 HOL/ex/SAT_Examples.thy for examples.
5855 * Datatype induction via method 'induct' now preserves the name of the
5856 induction variable. For example, when proving P(xs::'a list) by
5857 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5858 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5859 in unstructured proof scripts.
5861 * Reworked implementation of records. Improved scalability for
5862 records with many fields, avoiding performance problems for type
5863 inference. Records are no longer composed of nested field types, but
5864 of nested extension types. Therefore the record type only grows linear
5865 in the number of extensions and not in the number of fields. The
5866 top-level (users) view on records is preserved. Potential
5867 INCOMPATIBILITY only in strange cases, where the theory depends on the
5868 old record representation. The type generated for a record is called
5869 <record_name>_ext_type.
5871 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5872 proofs triggered by a record definition or a simproc (if
5873 quick_and_dirty is enabled). Definitions of large records can take
5876 New simproc record_upd_simproc for simplification of multiple record
5877 updates enabled by default. Moreover, trivial updates are also
5878 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5879 occasionally, since simplification is more powerful by default.
5881 * typedef: proper support for polymorphic sets, which contain extra
5882 type-variables in the term.
5884 * Simplifier: automatically reasons about transitivity chains
5885 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5886 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5887 old proofs break occasionally as simplification may now solve more
5888 goals than previously.
5890 * Simplifier: converts x <= y into x = y if assumption y <= x is
5891 present. Works for all partial orders (class "order"), in particular
5892 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5895 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5896 bound variable or a constant then the let is unfolded. Otherwise
5897 first a is simplified to b, and then f b is simplified to g. If
5898 possible we abstract b from g arriving at "let x = b in h x",
5899 otherwise we unfold the let and arrive at g. The simproc can be
5900 enabled/disabled by the reference use_let_simproc. Potential
5901 INCOMPATIBILITY since simplification is more powerful by default.
5903 * Classical reasoning: the meson method now accepts theorems as arguments.
5905 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5906 jobs to provide advice on the provability of subgoals.
5908 * Theory OrderedGroup and Ring_and_Field: various additions and
5909 improvements to faciliate calculations involving equalities and
5912 The following theorems have been eliminated or modified
5915 abs_eq now named abs_of_nonneg
5916 abs_of_ge_0 now named abs_of_nonneg
5917 abs_minus_eq now named abs_of_nonpos
5918 imp_abs_id now named abs_of_nonneg
5919 imp_abs_neg_id now named abs_of_nonpos
5920 mult_pos now named mult_pos_pos
5921 mult_pos_le now named mult_nonneg_nonneg
5922 mult_pos_neg_le now named mult_nonneg_nonpos
5923 mult_pos_neg2_le now named mult_nonneg_nonpos2
5924 mult_neg now named mult_neg_neg
5925 mult_neg_le now named mult_nonpos_nonpos
5927 * The following lemmas in Ring_and_Field have been added to the simplifier:
5930 not_square_less_zero
5932 The following lemmas have been deleted from Real/RealPow:
5942 * Theory Parity: added rules for simplifying exponents.
5946 The following theorems have been eliminated or modified
5949 list_all_Nil now named list_all.simps(1)
5950 list_all_Cons now named list_all.simps(2)
5951 list_all_conv now named list_all_iff
5952 set_mem_eq now named mem_iff
5954 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5955 asymptotic "big O" calculations. See the notes in BigO.thy.
5960 * Theory RealDef: better support for embedding natural numbers and
5961 integers in the reals.
5963 The following theorems have been eliminated or modified
5966 exp_ge_add_one_self now requires no hypotheses
5967 real_of_int_add reversed direction of equality (use [symmetric])
5968 real_of_int_minus reversed direction of equality (use [symmetric])
5969 real_of_int_diff reversed direction of equality (use [symmetric])
5970 real_of_int_mult reversed direction of equality (use [symmetric])
5972 * Theory RComplete: expanded support for floor and ceiling functions.
5974 * Theory Ln is new, with properties of the natural logarithm
5976 * Hyperreal: There is a new type constructor "star" for making
5977 nonstandard types. The old type names are now type synonyms:
5981 hcomplex = complex star
5983 * Hyperreal: Many groups of similarly-defined constants have been
5984 replaced by polymorphic versions (INCOMPATIBILITY):
5986 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5988 starset <-- starsetNat, starsetC
5989 *s* <-- *sNat*, *sc*
5990 starset_n <-- starsetNat_n, starsetC_n
5991 *sn* <-- *sNatn*, *scn*
5992 InternalSets <-- InternalNatSets, InternalCSets
5994 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5995 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5996 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5997 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5998 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6000 * Hyperreal: Many type-specific theorems have been removed in favor of
6001 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6003 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6004 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6005 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6006 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6007 right_minus <-- hypreal_add_minus
6008 left_minus <-- {hypreal,hcomplex}_add_minus_left
6009 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6010 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6011 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6012 mult_1_right <-- hcomplex_mult_one_right
6013 mult_zero_left <-- hcomplex_mult_zero_left
6014 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6015 right_distrib <-- hypnat_add_mult_distrib2
6016 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6017 right_inverse <-- hypreal_mult_inverse
6018 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6019 order_refl <-- {hypreal,hypnat}_le_refl
6020 order_trans <-- {hypreal,hypnat}_le_trans
6021 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6022 order_less_le <-- {hypreal,hypnat}_less_le
6023 linorder_linear <-- {hypreal,hypnat}_le_linear
6024 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6025 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6026 add_nonneg_nonneg <-- hypreal_le_add_order
6028 * Hyperreal: Separate theorems having to do with type-specific
6029 versions of constants have been merged into theorems that apply to the
6030 new polymorphic constants (INCOMPATIBILITY):
6032 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6033 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6034 STAR_Un <-- {STAR,NatStar,STARC}_Un
6035 STAR_Int <-- {STAR,NatStar,STARC}_Int
6036 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6037 STAR_subset <-- {STAR,NatStar,STARC}_subset
6038 STAR_mem <-- {STAR,NatStar,STARC}_mem
6039 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6040 STAR_diff <-- {STAR,STARC}_diff
6041 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6042 STARC_hcomplex_of_complex}_image_subset
6043 starset_n_Un <-- starset{Nat,C}_n_Un
6044 starset_n_Int <-- starset{Nat,C}_n_Int
6045 starset_n_Compl <-- starset{Nat,C}_n_Compl
6046 starset_n_diff <-- starset{Nat,C}_n_diff
6047 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6048 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6049 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6050 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6051 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6052 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6053 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6054 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6055 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6056 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6057 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6058 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6059 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6060 starfun_diff <-- starfun{C,RC,CR}_diff
6061 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6062 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6063 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6064 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6065 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6066 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6067 starfun_Id <-- starfunC_Id
6068 starfun_approx <-- starfun{Nat,CR}_approx
6069 starfun_capprox <-- starfun{C,RC}_capprox
6070 starfun_abs <-- starfunNat_rabs
6071 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6072 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6073 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6074 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6075 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6076 starfun_add_approx <-- starfunCR_add_approx
6077 starfun_inverse_inverse <-- starfunC_inverse_inverse
6078 starfun_divide <-- starfun{C,CR,RC}_divide
6079 starfun_n <-- starfun{Nat,C}_n
6080 starfun_n_mult <-- starfun{Nat,C}_n_mult
6081 starfun_n_add <-- starfun{Nat,C}_n_add
6082 starfun_n_add_minus <-- starfunNat_n_add_minus
6083 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6084 starfun_n_minus <-- starfun{Nat,C}_n_minus
6085 starfun_n_eq <-- starfun{Nat,C}_n_eq
6087 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6088 star_n_minus <-- {hypreal,hcomplex}_minus
6089 star_n_diff <-- {hypreal,hcomplex}_diff
6090 star_n_mult <-- {hypreal,hcomplex}_mult
6091 star_n_inverse <-- {hypreal,hcomplex}_inverse
6092 star_n_le <-- {hypreal,hypnat}_le
6093 star_n_less <-- {hypreal,hypnat}_less
6094 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6095 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6096 star_n_abs <-- hypreal_hrabs
6097 star_n_divide <-- hcomplex_divide
6099 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6100 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6101 star_of_diff <-- hypreal_of_real_diff
6102 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6103 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6104 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6105 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6106 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6107 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6108 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6109 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6110 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6111 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6112 star_of_number_of <-- {hypreal,hcomplex}_number_of
6113 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6114 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6115 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6116 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6117 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6118 star_of_power <-- hypreal_of_real_power
6119 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6121 * Hyperreal: new method "transfer" that implements the transfer
6122 principle of nonstandard analysis. With a subgoal that mentions
6123 nonstandard types like "'a star", the command "apply transfer"
6124 replaces it with an equivalent one that mentions only standard types.
6125 To be successful, all free variables must have standard types; non-
6126 standard variables must have explicit universal quantifiers.
6128 * Hyperreal: A theory of Taylor series.
6133 * Discontinued special version of 'constdefs' (which used to support
6134 continuous functions) in favor of the general Pure one with full
6137 * New simplification procedure for solving continuity conditions; it
6138 is much faster on terms with many nested lambda abstractions (cubic
6139 instead of exponential time).
6141 * New syntax for domain package: selector names are now optional.
6142 Parentheses should be omitted unless argument is lazy, for example:
6144 domain 'a stream = cons "'a" (lazy "'a stream")
6146 * New command 'fixrec' for defining recursive functions with pattern
6147 matching; defining multiple functions with mutual recursion is also
6148 supported. Patterns may include the constants cpair, spair, up, sinl,
6149 sinr, or any data constructor defined by the domain package. The given
6150 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6151 syntax and examples.
6153 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6154 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6155 but the proof obligation additionally includes an admissibility
6156 requirement. The packages generate instances of class cpo or pcpo,
6157 with continuity and strictness theorems for Rep and Abs.
6159 * HOLCF: Many theorems have been renamed according to a more standard naming
6160 scheme (INCOMPATIBILITY):
6162 foo_inject: "foo$x = foo$y ==> x = y"
6163 foo_eq: "(foo$x = foo$y) = (x = y)"
6164 foo_less: "(foo$x << foo$y) = (x << y)"
6165 foo_strict: "foo$UU = UU"
6166 foo_defined: "... ==> foo$x ~= UU"
6167 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6172 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6173 including the First Isomorphism Theorem (on quotienting by the kernel
6176 * ZF/Simplifier: install second copy of type solver that actually
6177 makes use of TC rules declared to Isar proof contexts (or locales);
6178 the old version is still required for ML proof scripts.
6183 * Converted to Isar theory format; use locales instead of axiomatic
6189 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6192 * Pure/library.ML no longer defines its own option datatype, but uses
6193 that of the SML basis, which has constructors NONE and SOME instead of
6194 None and Some, as well as exception Option.Option instead of OPTION.
6195 The functions the, if_none, is_some, is_none have been adapted
6196 accordingly, while Option.map replaces apsome.
6198 * Pure/library.ML: the exception LIST has been given up in favour of
6199 the standard exceptions Empty and Subscript, as well as
6200 Library.UnequalLengths. Function like Library.hd and Library.tl are
6201 superceded by the standard hd and tl functions etc.
6203 A number of basic list functions are no longer exported to the ML
6204 toplevel, as they are variants of predefined functions. The following
6205 suggests how one can translate existing code:
6207 rev_append xs ys = List.revAppend (xs, ys)
6208 nth_elem (i, xs) = List.nth (xs, i)
6209 last_elem xs = List.last xs
6210 flat xss = List.concat xss
6211 seq fs = List.app fs
6212 partition P xs = List.partition P xs
6213 mapfilter f xs = List.mapPartial f xs
6215 * Pure/library.ML: several combinators for linear functional
6216 transformations, notably reverse application and composition:
6219 (x, y) |-> f f #-> g
6221 * Pure/library.ML: introduced/changed precedence of infix operators:
6223 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6225 infix 3 o oo ooo oooo;
6226 infix 4 ~~ upto downto;
6228 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6231 * Pure/library.ML: natural list combinators fold, fold_rev, and
6232 fold_map support linear functional transformations and nesting. For
6235 fold f [x1, ..., xN] y =
6236 y |> f x1 |> ... |> f xN
6238 (fold o fold) f [xs1, ..., xsN] y =
6239 y |> fold f xs1 |> ... |> fold f xsN
6241 fold f [x1, ..., xN] =
6244 (fold o fold) f [xs1, ..., xsN] =
6245 fold f xs1 #> ... #> fold f xsN
6247 * Pure/library.ML: the following selectors on type 'a option are
6250 the: 'a option -> 'a (*partial*)
6251 these: 'a option -> 'a where 'a = 'b list
6252 the_default: 'a -> 'a option -> 'a
6253 the_list: 'a option -> 'a list
6255 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6256 basic operations for association lists, following natural argument
6257 order; moreover the explicit equality predicate passed here avoids
6258 potentially expensive polymorphic runtime equality checks.
6259 The old functions may be expressed as follows:
6261 assoc = uncurry (AList.lookup (op =))
6262 assocs = these oo AList.lookup (op =)
6263 overwrite = uncurry (AList.update (op =)) o swap
6265 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6267 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6268 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6270 replacing make_keylist and keyfilter (occassionally used)
6273 make_keylist = AList.make
6274 keyfilter = AList.find (op =)
6276 * eq_fst and eq_snd now take explicit equality parameter, thus
6277 avoiding eqtypes. Naive rewrites:
6279 eq_fst = eq_fst (op =)
6280 eq_snd = eq_snd (op =)
6282 * Removed deprecated apl and apr (rarely used).
6285 apl (n, op) =>>= curry op n
6286 apr (op, m) =>>= fn n => op (n, m)
6288 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6289 provides a reasonably efficient light-weight implementation of sets as
6292 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6293 few new operations; existing lookup and update are now curried to
6294 follow natural argument order (for use with fold etc.);
6295 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6297 * Pure/General: output via the Isabelle channels of
6298 writeln/warning/error etc. is now passed through Output.output, with a
6299 hook for arbitrary transformations depending on the print_mode
6300 (cf. Output.add_mode -- the first active mode that provides a output
6301 function wins). Already formatted output may be embedded into further
6302 text via Output.raw; the result of Pretty.string_of/str_of and derived
6303 functions (string_of_term/cterm/thm etc.) is already marked raw to
6304 accommodate easy composition of diagnostic messages etc. Programmers
6305 rarely need to care about Output.output or Output.raw at all, with
6306 some notable exceptions: Output.output is required when bypassing the
6307 standard channels (writeln etc.), or in token translations to produce
6308 properly formatted results; Output.raw is required when capturing
6309 already output material that will eventually be presented to the user
6310 a second time. For the default print mode, both Output.output and
6311 Output.raw have no effect.
6313 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6314 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6315 cumulative results are displayed at the end of a batch session.
6317 * Pure/General: File.sysify_path and File.quote_sysify path have been
6318 replaced by File.platform_path and File.shell_path (with appropriate
6319 hooks). This provides a clean interface for unusual systems where the
6320 internal and external process view of file names are different.
6322 * Pure: more efficient orders for basic syntactic entities: added
6323 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6324 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6325 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6326 orders now -- potential INCOMPATIBILITY for code that depends on a
6327 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6328 Library.sort_strings on result).
6330 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6331 fold_types traverse types/terms from left to right, observing natural
6332 argument order. Supercedes previous foldl_XXX versions, add_frees,
6333 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6335 * Pure: name spaces have been refined, with significant changes of the
6336 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6337 to extern(_table). The plain name entry path is superceded by a
6338 general 'naming' context, which also includes the 'policy' to produce
6339 a fully qualified name and external accesses of a fully qualified
6340 name; NameSpace.extend is superceded by context dependent
6341 Sign.declare_name. Several theory and proof context operations modify
6342 the naming context. Especially note Theory.restore_naming and
6343 ProofContext.restore_naming to get back to a sane state; note that
6344 Theory.add_path is no longer sufficient to recover from
6345 Theory.absolute_path in particular.
6347 * Pure: new flags short_names (default false) and unique_names
6348 (default true) for controlling output of qualified names. If
6349 short_names is set, names are printed unqualified. If unique_names is
6350 reset, the name prefix is reduced to the minimum required to achieve
6351 the original result when interning again, even if there is an overlap
6352 with earlier declarations.
6354 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6355 now 'extend', and 'merge' gets an additional Pretty.pp argument
6356 (useful for printing error messages). INCOMPATIBILITY.
6358 * Pure: major reorganization of the theory context. Type Sign.sg and
6359 Theory.theory are now identified, referring to the universal
6360 Context.theory (see Pure/context.ML). Actual signature and theory
6361 content is managed as theory data. The old code and interfaces were
6362 spread over many files and structures; the new arrangement introduces
6363 considerable INCOMPATIBILITY to gain more clarity:
6365 Context -- theory management operations (name, identity, inclusion,
6366 parents, ancestors, merge, etc.), plus generic theory data;
6368 Sign -- logical signature and syntax operations (declaring consts,
6369 types, etc.), plus certify/read for common entities;
6371 Theory -- logical theory operations (stating axioms, definitions,
6372 oracles), plus a copy of logical signature operations (consts,
6373 types, etc.); also a few basic management operations (Theory.copy,
6376 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6377 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6378 for convenience -- they merely return the theory.
6380 * Pure: type Type.tsig is superceded by theory in most interfaces.
6382 * Pure: the Isar proof context type is already defined early in Pure
6383 as Context.proof (note that ProofContext.context and Proof.context are
6384 aliases, where the latter is the preferred name). This enables other
6385 Isabelle components to refer to that type even before Isar is present.
6387 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6388 typeK, constK, axiomK, oracleK), but provide explicit operations for
6389 any of these kinds. For example, Sign.intern typeK is now
6390 Sign.intern_type, Theory.hide_space Sign.typeK is now
6391 Theory.hide_types. Also note that former
6392 Theory.hide_classes/types/consts are now
6393 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6394 internalize their arguments! INCOMPATIBILITY.
6396 * Pure: get_thm interface (of PureThy and ProofContext) expects
6397 datatype thmref (with constructors Name and NameSelection) instead of
6398 plain string -- INCOMPATIBILITY;
6400 * Pure: cases produced by proof methods specify options, where NONE
6401 means to remove case bindings -- INCOMPATIBILITY in
6404 * Pure: the following operations retrieve axioms or theorems from a
6405 theory node or theory hierarchy, respectively:
6407 Theory.axioms_of: theory -> (string * term) list
6408 Theory.all_axioms_of: theory -> (string * term) list
6409 PureThy.thms_of: theory -> (string * thm) list
6410 PureThy.all_thms_of: theory -> (string * thm) list
6412 * Pure: print_tac now outputs the goal through the trace channel.
6414 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6415 Reference Toplevel.debug (default false) controls detailed printing
6416 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6417 controls execution profiling -- set to 1 for time and 2 for space
6418 (both increase the runtime).
6420 * Isar session: The initial use of ROOT.ML is now always timed,
6421 i.e. the log will show the actual process times, in contrast to the
6422 elapsed wall-clock time that the outer shell wrapper produces.
6424 * Simplifier: improved handling of bound variables (nameless
6425 representation, avoid allocating new strings). Simprocs that invoke
6426 the Simplifier recursively should use Simplifier.inherit_bounds to
6427 avoid local name clashes. Failure to do so produces warnings
6428 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6429 for further details.
6431 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6432 bindings for all theorems stored within a given theory; this may help
6433 in porting non-Isar theories to Isar ones, while keeping ML proof
6434 scripts for the time being.
6436 * ML operator HTML.with_charset specifies the charset begin used for
6437 generated HTML files. For example:
6439 HTML.with_charset "utf-8" use_thy "Hebrew";
6440 HTML.with_charset "utf-8" use_thy "Chinese";
6445 * Allow symlinks to all proper Isabelle executables (Isabelle,
6446 isabelle, isatool etc.).
6448 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6449 isatool doc, isatool mkdir, display_drafts etc.).
6451 * isatool usedir: option -f allows specification of the ML file to be
6452 used by Isabelle; default is ROOT.ML.
6454 * New isatool version outputs the version identifier of the Isabelle
6455 distribution being used.
6457 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6458 (containing Boolean satisfiability problems) into Isabelle/HOL
6463 New in Isabelle2004 (April 2004)
6464 --------------------------------
6468 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6469 Replaces linorder.ML.
6471 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6472 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6473 (\<a>...\<z>), are now considered normal letters, and can therefore
6474 be used anywhere where an ASCII letter (a...zA...Z) has until
6475 now. COMPATIBILITY: This obviously changes the parsing of some
6476 terms, especially where a symbol has been used as a binder, say
6477 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6478 as an identifier. Fix it by inserting a space around former
6479 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6480 existing theory and ML files.
6482 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6484 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6485 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6486 a normal (but invisible) letter. For multiple letter subscripts repeat
6487 \<^isub> like this: x\<^isub>1\<^isub>2.
6489 * Pure: There are now sub-/superscripts that can span more than one
6490 character. Text between \<^bsub> and \<^esub> is set in subscript in
6491 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6492 superscript. The new control characters are not identifier parts.
6494 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6495 content of "..." to the latex file instead of \isacntrl... . The "..."
6496 may consist of any printable characters excluding the end bracket >.
6498 * Pure: Using new Isar command "finalconsts" (or the ML functions
6499 Theory.add_finals or Theory.add_finals_i) it is now possible to
6500 declare constants "final", which prevents their being given a definition
6501 later. It is useful for constants whose behaviour is fixed axiomatically
6502 rather than definitionally, such as the meta-logic connectives.
6504 * Pure: 'instance' now handles general arities with general sorts
6505 (i.e. intersections of classes),
6507 * Presentation: generated HTML now uses a CSS style sheet to make layout
6508 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6509 It can be changed to alter the colors/layout of generated pages.
6514 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6515 cut_tac, subgoal_tac and thin_tac:
6516 - Now understand static (Isar) contexts. As a consequence, users of Isar
6517 locales are no longer forced to write Isar proof scripts.
6518 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6520 - INCOMPATIBILITY: names of variables to be instantiated may no
6521 longer be enclosed in quotes. Instead, precede variable name with `?'.
6522 This is consistent with the instantiation attribute "where".
6524 * Attributes "where" and "of":
6525 - Now take type variables of instantiated theorem into account when reading
6526 the instantiation string. This fixes a bug that caused instantiated
6527 theorems to have too special types in some circumstances.
6528 - "where" permits explicit instantiations of type variables.
6530 * Calculation commands "moreover" and "also" no longer interfere with
6531 current facts ("this"), admitting arbitrary combinations with "then"
6535 - Goal statements involving the context element "includes" no longer
6536 generate theorems with internal delta predicates (those ending on
6537 "_axioms") in the premise.
6538 Resolve particular premise with <locale>.intro to obtain old form.
6539 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6540 specification and "includes" elements in goal statement.
6541 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6542 [intro?] and [elim?] (respectively) by default.
6543 - Experimental command for instantiation of locales in proof contexts:
6544 instantiate <label>[<attrs>]: <loc>
6545 Instantiates locale <loc> and adds all its theorems to the current context
6546 taking into account their attributes. Label and attrs are optional
6547 modifiers, like in theorem declarations. If present, names of
6548 instantiated theorems are qualified with <label>, and the attributes
6549 <attrs> are applied after any attributes these theorems might have already.
6550 If the locale has assumptions, a chained fact of the form
6551 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6552 are derived. The command does not support old-style locales declared
6553 with "locale (open)".
6554 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6556 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6562 * Proof import: new image HOL4 contains the imported library from
6563 the HOL4 system with about 2500 theorems. It is imported by
6564 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6565 can be used like any other Isabelle image. See
6566 HOL/Import/HOL/README for more information.
6569 - Much improved handling of linear and partial orders.
6570 Reasoners for linear and partial orders are set up for type classes
6571 "linorder" and "order" respectively, and are added to the default simpset
6572 as solvers. This means that the simplifier can build transitivity chains
6573 to solve goals from the assumptions.
6574 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6575 of blast or auto after simplification become unnecessary because the goal
6576 is solved by simplification already.
6578 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6579 all proved in axiomatic type classes for semirings, rings and fields.
6582 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6583 now formalized using the Ring_and_Field theory mentioned above.
6584 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6585 than before, because now they are set up once in a generic manner.
6586 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6587 Look for the general versions in Ring_and_Field (and Power if they concern
6590 * Type "rat" of the rational numbers is now available in HOL-Complex.
6593 - Record types are now by default printed with their type abbreviation
6594 instead of the list of all field types. This can be configured via
6595 the reference "print_record_type_abbr".
6596 - Simproc "record_upd_simproc" for simplification of multiple updates added
6597 (not enabled by default).
6598 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6599 EX x. x = sel r to True (not enabled by default).
6600 - Tactic "record_split_simp_tac" to split and simplify records added.
6602 * 'specification' command added, allowing for definition by
6603 specification. There is also an 'ax_specification' command that
6604 introduces the new constants axiomatically.
6606 * arith(_tac) is now able to generate counterexamples for reals as well.
6608 * HOL-Algebra: new locale "ring" for non-commutative rings.
6610 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6611 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6613 * HOL-Matrix: a first theory for matrices in HOL with an application of
6614 matrix theory to linear programming.
6616 * Unions and Intersections:
6617 The latex output syntax of UN and INT has been changed
6618 from "\Union x \in A. B" to "\Union_{x \in A} B"
6619 i.e. the index formulae has become a subscript.
6620 Similarly for "\Union x. B", and for \Inter instead of \Union.
6622 * Unions and Intersections over Intervals:
6623 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6624 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6625 like in normal math, and corresponding versions for < and for intersection.
6627 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6628 lexicographic dictonary ordering has been added as "lexord".
6630 * ML: the legacy theory structures Int and List have been removed. They had
6631 conflicted with ML Basis Library structures having the same names.
6633 * 'refute' command added to search for (finite) countermodels. Only works
6634 for a fragment of HOL. The installation of an external SAT solver is
6635 highly recommended. See "HOL/Refute.thy" for details.
6637 * 'quickcheck' command: Allows to find counterexamples by evaluating
6638 formulae under an assignment of free variables to random values.
6639 In contrast to 'refute', it can deal with inductive datatypes,
6640 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6646 * Streams now come with concatenation and are part of the HOLCF image
6650 New in Isabelle2003 (May 2003)
6651 ------------------------------
6655 * Provers/simplifier:
6657 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6658 Assumptions are now subject to complete mutual simplification,
6659 not just from left to right. The simplifier now preserves
6660 the order of assumptions.
6662 Potential INCOMPATIBILITY:
6664 -- simp sometimes diverges where the old version did
6665 not, e.g. invoking simp on the goal
6667 [| P (f x); y = x; f x = f y |] ==> Q
6669 now gives rise to the infinite reduction sequence
6671 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6673 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6676 -- Tactics combining classical reasoner and simplification (such as auto)
6677 are also affected by this change, because many of them rely on
6678 simp. They may sometimes diverge as well or yield a different numbers
6679 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6680 in case of problems. Sometimes subsequent calls to the classical
6681 reasoner will fail because a preceeding call to the simplifier too
6682 eagerly simplified the goal, e.g. deleted redundant premises.
6684 - The simplifier trace now shows the names of the applied rewrite rules
6686 - You can limit the number of recursive invocations of the simplifier
6687 during conditional rewriting (where the simplifie tries to solve the
6688 conditions before applying the rewrite rule):
6689 ML "simp_depth_limit := n"
6690 where n is an integer. Thus you can force termination where previously
6691 the simplifier would diverge.
6693 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6695 - No longer aborts on failed congruence proof. Instead, the
6696 congruence is ignored.
6698 * Pure: New generic framework for extracting programs from constructive
6699 proofs. See HOL/Extraction.thy for an example instantiation, as well
6700 as HOL/Extraction for some case studies.
6702 * Pure: The main goal of the proof state is no longer shown by default, only
6703 the subgoals. This behaviour is controlled by a new flag.
6704 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6705 (ML: Proof.show_main_goal).
6707 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6708 rules whose conclusion matches subgoal 1:
6709 PG menu: Isabelle/Isar -> Show me -> matching rules
6710 The rules are ordered by how closely they match the subgoal.
6711 In particular, rules that solve a subgoal outright are displayed first
6712 (or rather last, the way they are printed).
6713 (ML: ProofGeneral.print_intros())
6715 * Pure: New flag trace_unify_fail causes unification to print
6716 diagnostic information (PG: in trace buffer) when it fails. This is
6717 useful for figuring out why single step proofs like rule, erule or
6720 * Pure: Locale specifications now produce predicate definitions
6721 according to the body of text (covering assumptions modulo local
6722 definitions); predicate "loc_axioms" covers newly introduced text,
6723 while "loc" is cumulative wrt. all included locale expressions; the
6724 latter view is presented only on export into the global theory
6725 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6726 on the old view without predicates;
6728 * Pure: predefined locales "var" and "struct" are useful for sharing
6729 parameters (as in CASL, for example); just specify something like
6730 ``var x + var y + struct M'' as import;
6732 * Pure: improved thms_containing: proper indexing of facts instead of
6733 raw theorems; check validity of results wrt. current name space;
6734 include local facts of proof configuration (also covers active
6735 locales), cover fixed variables in index; may use "_" in term
6736 specification; an optional limit for the number of printed facts may
6737 be given (the default is 40);
6739 * Pure: disallow duplicate fact bindings within new-style theory files
6742 * Provers: improved induct method: assumptions introduced by case
6743 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6744 the goal statement); "foo" still refers to all facts collectively;
6746 * Provers: the function blast.overloaded has been removed: all constants
6747 are regarded as potentially overloaded, which improves robustness in exchange
6748 for slight decrease in efficiency;
6750 * Provers/linorder: New generic prover for transitivity reasoning over
6751 linear orders. Note: this prover is not efficient!
6753 * Isar: preview of problems to finish 'show' now produce an error
6754 rather than just a warning (in interactive mode);
6761 - Produces a counter example if it cannot prove a goal.
6762 Note that the counter example may be spurious if the goal is not a formula
6763 of quantifier-free linear arithmetic.
6764 In ProofGeneral the counter example appears in the trace buffer.
6766 - Knows about div k and mod k where k is a numeral of type nat or int.
6768 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6769 linear arithmetic fails. This takes account of quantifiers and divisibility.
6770 Presburger arithmetic can also be called explicitly via presburger(_tac).
6772 * simp's arithmetic capabilities have been enhanced a bit: it now
6773 takes ~= in premises into account (by performing a case split);
6775 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6776 are distributed over a sum of terms;
6778 * New tactic "trans_tac" and method "trans" instantiate
6779 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6782 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6783 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6785 * 'typedef' command has new option "open" to suppress the set
6788 * functions Min and Max on finite sets have been introduced (theory
6791 * attribute [symmetric] now works for relations as well; it turns
6792 (x,y) : R^-1 into (y,x) : R, and vice versa;
6794 * induct over a !!-quantified statement (say !!x1..xn):
6795 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6797 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6798 %x. None. Warning: empty_def now refers to the previously hidden definition
6801 * Algebra: formalization of classical algebra. Intended as base for
6802 any algebraic development in Isabelle. Currently covers group theory
6803 (up to Sylow's theorem) and ring theory (Universal Property of
6804 Univariate Polynomials). Contributions welcome;
6806 * GroupTheory: deleted, since its material has been moved to Algebra;
6808 * Complex: new directory of the complex numbers with numeric constants,
6809 nonstandard complex numbers, and some complex analysis, standard and
6810 nonstandard (Jacques Fleuriot);
6812 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6814 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6817 * Real/HahnBanach: updated and adapted to locales;
6819 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6822 * UNITY: added the Meier-Sanders theory of progress sets;
6824 * MicroJava: bytecode verifier and lightweight bytecode verifier
6825 as abstract algorithms, instantiated to the JVM;
6827 * Bali: Java source language formalization. Type system, operational
6828 semantics, axiomatic semantics. Supported language features:
6829 classes, interfaces, objects,virtual methods, static methods,
6830 static/instance fields, arrays, access modifiers, definite
6831 assignment, exceptions.
6836 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6839 * Main ZF: virtually all theories converted to new-style format;
6844 * Pure: Tactic.prove provides sane interface for internal proofs;
6845 omits the infamous "standard" operation, so this is more appropriate
6846 than prove_goalw_cterm in many situations (e.g. in simprocs);
6848 * Pure: improved error reporting of simprocs;
6850 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6854 *** Document preparation ***
6856 * uses \par instead of \\ for line breaks in theory text. This may
6857 shift some page breaks in large documents. To get the old behaviour
6858 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6860 * minimized dependencies of isabelle.sty and isabellesym.sty on
6863 * \<euro> now needs package babel/greek instead of marvosym (which
6866 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6871 New in Isabelle2002 (March 2002)
6872 --------------------------------
6874 *** Document preparation ***
6876 * greatly simplified document preparation setup, including more
6877 graceful interpretation of isatool usedir -i/-d/-D options, and more
6878 instructive isatool mkdir; users should basically be able to get
6879 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6880 users may run a separate document processing stage manually like this:
6881 "isatool usedir -D output HOL Test && isatool document Test/output";
6883 * theory dependency graph may now be incorporated into documents;
6884 isatool usedir -g true will produce session_graph.eps/.pdf for use
6885 with \includegraphics of LaTeX;
6887 * proper spacing of consecutive markup elements, especially text
6888 blocks after section headings;
6890 * support bold style (for single symbols only), input syntax is like
6891 this: "\<^bold>\<alpha>" or "\<^bold>A";
6893 * \<bullet> is now output as bold \cdot by default, which looks much
6894 better in printed text;
6896 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6897 note that these symbols are currently unavailable in Proof General /
6898 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6900 * isatool latex no longer depends on changed TEXINPUTS, instead
6901 isatool document copies the Isabelle style files to the target
6907 * Pure/Provers: improved proof by cases and induction;
6908 - 'case' command admits impromptu naming of parameters (such as
6910 - 'induct' method divinates rule instantiation from the inductive
6911 claim; no longer requires excessive ?P bindings for proper
6912 instantiation of cases;
6913 - 'induct' method properly enumerates all possibilities of set/type
6914 rules; as a consequence facts may be also passed through *type*
6915 rules without further ado;
6916 - 'induct' method now derives symbolic cases from the *rulified*
6917 rule (before it used to rulify cases stemming from the internal
6918 atomized version); this means that the context of a non-atomic
6919 statement becomes is included in the hypothesis, avoiding the
6920 slightly cumbersome show "PROP ?case" form;
6921 - 'induct' may now use elim-style induction rules without chaining
6922 facts, using ``missing'' premises from the goal state; this allows
6923 rules stemming from inductive sets to be applied in unstructured
6924 scripts, while still benefitting from proper handling of non-atomic
6925 statements; NB: major inductive premises need to be put first, all
6926 the rest of the goal is passed through the induction;
6927 - 'induct' proper support for mutual induction involving non-atomic
6928 rule statements (uses the new concept of simultaneous goals, see
6930 - append all possible rule selections, but only use the first
6931 success (no backtracking);
6932 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6933 - undeclared rule case names default to numbers 1, 2, 3, ...;
6934 - added 'print_induct_rules' (covered by help item in recent Proof
6936 - moved induct/cases attributes to Pure, methods to Provers;
6937 - generic method setup instantiated for FOL and HOL;
6939 * Pure: support multiple simultaneous goal statements, for example
6940 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6941 meta-level mechanism, this acts as if several individual goals had
6942 been stated separately; in particular common proof methods need to be
6943 repeated in order to cover all claims; note that a single elimination
6944 step is *not* sufficient to establish the two conjunctions, so this
6947 assume "A & B" then have A and B .. (*".." fails*)
6949 better use "obtain" in situations as above; alternative refer to
6950 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6952 * Pure: proper integration with ``locales''; unlike the original
6953 version by Florian Kammller, Isar locales package high-level proof
6954 contexts rather than raw logical ones (e.g. we admit to include
6955 attributes everywhere); operations on locales include merge and
6956 rename; support for implicit arguments (``structures''); simultaneous
6957 type-inference over imports and text; see also HOL/ex/Locales.thy for
6960 * Pure: the following commands have been ``localized'', supporting a
6961 target locale specification "(in name)": 'lemma', 'theorem',
6962 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6963 stored both within the locale and at the theory level (exported and
6964 qualified by the locale name);
6966 * Pure: theory goals may now be specified in ``long'' form, with
6967 ad-hoc contexts consisting of arbitrary locale elements. for example
6968 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6969 definitions may be given, too); the result is a meta-level rule with
6970 the context elements being discharged in the obvious way;
6972 * Pure: new proof command 'using' allows to augment currently used
6973 facts after a goal statement ('using' is syntactically analogous to
6974 'apply', but acts on the goal's facts only); this allows chained facts
6975 to be separated into parts given before and after a claim, as in
6976 ``from a and b have C using d and e <proof>'';
6978 * Pure: renamed "antecedent" case to "rule_context";
6980 * Pure: new 'judgment' command records explicit information about the
6981 object-logic embedding (used by several tools internally); no longer
6982 use hard-wired "Trueprop";
6984 * Pure: added 'corollary' command;
6986 * Pure: fixed 'token_translation' command;
6988 * Pure: removed obsolete 'exported' attribute;
6990 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6991 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6992 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6994 * Pure: method 'atomize' presents local goal premises as object-level
6995 statements (atomic meta-level propositions); setup controlled via
6996 rewrite rules declarations of 'atomize' attribute; example
6997 application: 'induct' method with proper rule statements in improper
7000 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7001 now consider the syntactic context of assumptions, giving a better
7002 chance to get type-inference of the arguments right (this is
7003 especially important for locales);
7005 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7008 * Pure/obtain: the formal conclusion "thesis", being marked as
7009 ``internal'', may no longer be reference directly in the text;
7010 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7013 * Pure: generic 'sym' attribute which declares a rule both as pure
7014 'elim?' and for the 'symmetric' operation;
7016 * Pure: marginal comments ``--'' may now occur just anywhere in the
7017 text; the fixed correlation with particular command syntax has been
7020 * Pure: new method 'rules' is particularly well-suited for proof
7021 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7022 but often produces more compact proof terms with less detours;
7024 * Pure/Provers/classical: simplified integration with pure rule
7025 attributes and methods; the classical "intro?/elim?/dest?"
7026 declarations coincide with the pure ones; the "rule" method no longer
7027 includes classically swapped intros; "intro" and "elim" methods no
7028 longer pick rules from the context; also got rid of ML declarations
7029 AddXIs/AddXEs/AddXDs; all of this has some potential for
7032 * Provers/classical: attribute 'swapped' produces classical inversions
7033 of introduction rules;
7035 * Provers/simplifier: 'simplified' attribute may refer to explicit
7036 rules instead of full simplifier context; 'iff' attribute handles
7039 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7041 * HOL: 'recdef' now fails on unfinished automated proofs, use
7042 "(permissive)" option to recover old behavior;
7044 * HOL: 'inductive' no longer features separate (collective) attributes
7045 for 'intros' (was found too confusing);
7047 * HOL: properly declared induction rules less_induct and
7053 * HOL: moved over to sane numeral syntax; the new policy is as
7056 - 0 and 1 are polymorphic constants, which are defined on any
7057 numeric type (nat, int, real etc.);
7059 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7060 binary representation internally;
7062 - type nat has special constructor Suc, and generally prefers Suc 0
7063 over 1::nat and Suc (Suc 0) over 2::nat;
7065 This change may cause significant problems of INCOMPATIBILITY; here
7066 are some hints on converting existing sources:
7068 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7069 entities, so expressions involving "-" (unary or binary minus) need
7070 to be spaced properly;
7072 - existing occurrences of "1" may need to be constraint "1::nat" or
7073 even replaced by Suc 0; similar for old "2";
7075 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7077 - remove all special provisions on numerals in proofs;
7079 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7080 representation (depends on bin_arith_simps in the default context);
7082 * HOL: symbolic syntax for x^2 (numeral 2);
7084 * HOL: the class of all HOL types is now called "type" rather than
7085 "term"; INCOMPATIBILITY, need to adapt references to this type class
7086 in axclass/classes, instance/arities, and (usually rare) occurrences
7087 in typings (of consts etc.); internally the class is called
7088 "HOL.type", ML programs should refer to HOLogic.typeS;
7090 * HOL/record package improvements:
7091 - new derived operations "fields" to build a partial record section,
7092 "extend" to promote a fixed record to a record scheme, and
7093 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7094 declared as simp by default;
7095 - shared operations ("more", "fields", etc.) now need to be always
7096 qualified) --- potential INCOMPATIBILITY;
7097 - removed "make_scheme" operations (use "make" with "extend") --
7099 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7100 - provides cases/induct rules for use with corresponding Isar
7101 methods (for concrete records, record schemes, concrete more
7102 parts, and schematic more parts -- in that order);
7103 - internal definitions directly based on a light-weight abstract
7104 theory of product types over typedef rather than datatype;
7106 * HOL: generic code generator for generating executable ML code from
7107 specifications; specific support for HOL constructs such as inductive
7108 datatypes and sets, as well as recursive functions; can be invoked
7109 via 'generate_code' theory section;
7111 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7113 * HOL: consolidated and renamed several theories. In particular:
7114 Ord.thy has been absorbed into HOL.thy
7115 String.thy has been absorbed into List.thy
7117 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7118 (beware of argument permutation!);
7120 * HOL: linorder_less_split superseded by linorder_cases;
7122 * HOL/List: "nodups" renamed to "distinct";
7124 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7125 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7126 - Ex_def has changed, now need to use some_eq_ex
7128 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7129 in this (rare) case use:
7131 delSWrapper "split_all_tac"
7132 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7134 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7137 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7138 Isabelle's type classes, ^ on functions and relations has too general
7139 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7140 necessary to attach explicit type constraints;
7142 * HOL/Relation: the prefix name of the infix "O" has been changed from
7143 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7144 renamed accordingly (eg "compI" -> "rel_compI").
7146 * HOL: syntax translations now work properly with numerals and records
7149 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7150 of "lam" -- INCOMPATIBILITY;
7152 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7153 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7154 renamed "Product_Type.unit";
7156 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7158 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7159 the "cases" method);
7161 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7164 * HOL/IMP: updated and converted to new-style theory format; several
7165 parts turned into readable document, with proper Isar proof texts and
7166 some explanations (by Gerwin Klein);
7168 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7170 * HOL-Hyperreal is now a logic image;
7175 * Isar: consts/constdefs supports mixfix syntax for continuous
7178 * Isar: domain package adapted to new-style theory format, e.g. see
7181 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7182 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7183 lift.induct_tac, always use UU instead of Undef;
7185 * HOLCF/IMP: updated and converted to new-style theory;
7190 * Isar: proper integration of logic-specific tools and packages,
7191 including theory commands '(co)inductive', '(co)datatype',
7192 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7193 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7195 * theory Main no longer includes AC; for the Axiom of Choice, base
7196 your theory on Main_ZFC;
7198 * the integer library now covers quotients and remainders, with many
7199 laws relating division to addition, multiplication, etc.;
7201 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7202 typeless version of the formalism;
7204 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7207 * ZF/Induct: new directory for examples of inductive definitions,
7208 including theory Multiset for multiset orderings; converted to
7209 new-style theory format;
7211 * ZF: many new theorems about lists, ordinals, etc.;
7216 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7217 variable proof controls level of detail: 0 = no proofs (only oracle
7218 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7219 also ref manual for further ML interfaces;
7221 * Pure/axclass: removed obsolete ML interface
7222 goal_subclass/goal_arity;
7224 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7225 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7226 separate tokens, so expressions involving minus need to be spaced
7229 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7230 rather than "infixl" or "infixr";
7232 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7233 sort constraint specifications in type inference; e.g. "x::_::foo"
7234 ensures that the type of "x" is of sort "foo" (but not necessarily a
7237 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7238 control output of nested => (types); the default behavior is
7241 * Pure/syntax: builtin parse translation for "_constify" turns valued
7242 tokens into AST constants;
7244 * Pure/syntax: prefer later declarations of translations and print
7245 translation functions; potential INCOMPATIBILITY: need to reverse
7246 multiple declarations for same syntax element constant;
7248 * Pure/show_hyps reset by default (in accordance to existing Isar
7251 * Provers/classical: renamed addaltern to addafter, addSaltern to
7254 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7257 * system: tested support for MacOS X; should be able to get Isabelle +
7258 Proof General to work in a plain Terminal after installing Poly/ML
7259 (e.g. from the Isabelle distribution area) and GNU bash alone
7260 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7261 support requires further installations, e.g. from
7262 http://fink.sourceforge.net/);
7264 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7266 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7267 of 40 MB), cf. ML_OPTIONS;
7269 * system: Proof General keywords specification is now part of the
7270 Isabelle distribution (see etc/isar-keywords.el);
7272 * system: support for persistent Proof General sessions (refrain from
7273 outdating all loaded theories on startup); user may create writable
7274 logic images like this: ``isabelle -q HOL Test'';
7276 * system: smart selection of Isabelle process versus Isabelle
7277 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7278 run both "isabelle" and "Isabelle" even if file names are badly
7279 damaged (executable inspects the case of the first letter of its own
7280 name); added separate "isabelle-process" and "isabelle-interface";
7282 * system: refrain from any attempt at filtering input streams; no
7283 longer support ``8bit'' encoding of old isabelle font, instead proper
7284 iso-latin characters may now be used; the related isatools
7285 "symbolinput" and "nonascii" have disappeared as well;
7287 * system: removed old "xterm" interface (the print modes "xterm" and
7288 "xterm_color" are still available for direct use in a suitable
7293 New in Isabelle99-2 (February 2001)
7294 -----------------------------------
7296 *** Overview of INCOMPATIBILITIES ***
7298 * HOL: please note that theories in the Library and elsewhere often use the
7299 new-style (Isar) format; to refer to their theorems in an ML script you must
7300 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7302 * HOL: inductive package no longer splits induction rule aggressively,
7303 but only as far as specified by the introductions given; the old
7304 format may be recovered via ML function complete_split_rule or attribute
7305 'split_rule (complete)';
7307 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7308 gfp_Tarski to gfp_unfold;
7310 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7312 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7313 relation); infix "^^" has been renamed "``"; infix "``" has been
7314 renamed "`"; "univalent" has been renamed "single_valued";
7316 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7319 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7321 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7323 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7324 consequence, it is no longer monotonic wrt. the local goal context
7325 (which is now passed through the inductive cases);
7327 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7328 \<gg> to \<ggreater>;
7331 *** Document preparation ***
7333 * \isabellestyle{NAME} selects version of Isabelle output (currently
7334 available: are "it" for near math-mode best-style output, "sl" for
7335 slanted text style, and "tt" for plain type-writer; if no
7336 \isabellestyle command is given, output is according to slanted
7339 * support sub/super scripts (for single symbols only), input syntax is
7340 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7342 * some more standard symbols; see Appendix A of the system manual for
7343 the complete list of symbols defined in isabellesym.sty;
7345 * improved isabelle style files; more abstract symbol implementation
7346 (should now use \isamath{...} and \isatext{...} in custom symbol
7349 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7350 state; Note that presentation of goal states does not conform to
7351 actual human-readable proof documents. Please do not include goal
7352 states into document output unless you really know what you are doing!
7354 * proper indentation of antiquoted output with proportional LaTeX
7357 * no_document ML operator temporarily disables LaTeX document
7360 * isatool unsymbolize tunes sources for plain ASCII communication;
7365 * Pure: Isar now suffers initial goal statements to contain unbound
7366 schematic variables (this does not conform to actual readable proof
7367 documents, due to unpredictable outcome and non-compositional proof
7368 checking); users who know what they are doing may use schematic goals
7369 for Prolog-style synthesis of proven results;
7371 * Pure: assumption method (an implicit finishing) now handles actual
7374 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7375 initial goal, declare "that" only as Pure intro (only for single
7376 steps); the "that" rule assumption may now be involved in implicit
7377 finishing, thus ".." becomes a feasible for trivial obtains;
7379 * Pure: default proof step now includes 'intro_classes'; thus trivial
7380 instance proofs may be performed by "..";
7382 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7385 * Pure: more robust selection of calculational rules;
7387 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7388 rule (as well as the assumption rule);
7390 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7391 lemmas, using the graph browser tool;
7393 * Pure: predict failure of "show" in interactive mode;
7395 * Pure: 'thms_containing' now takes actual terms as arguments;
7397 * HOL: improved method 'induct' --- now handles non-atomic goals
7398 (potential INCOMPATIBILITY); tuned error handling;
7400 * HOL: cases and induct rules now provide explicit hints about the
7401 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7402 any remaining facts are inserted into the goal verbatim;
7404 * HOL: local contexts (aka cases) may now contain term bindings as
7405 well; the 'cases' and 'induct' methods new provide a ?case binding for
7406 the result to be shown in each case;
7408 * HOL: added 'recdef_tc' command;
7410 * isatool convert assists in eliminating legacy ML scripts;
7415 * HOL/Library: a collection of generic theories to be used together
7416 with main HOL; the theory loader path already includes this directory
7417 by default; the following existing theories have been moved here:
7418 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7419 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7421 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7422 modelling and verification task performed in Isabelle/HOL +
7423 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7425 * HOL/Algebra: special summation operator SUM no longer exists, it has
7426 been replaced by setsum; infix 'assoc' now has priority 50 (like
7427 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7428 'domain', this makes the theory consistent with mathematical
7431 * HOL basics: added overloaded operations "inverse" and "divide"
7432 (infix "/"), syntax for generic "abs" operation, generic summation
7435 * HOL/typedef: simplified package, provide more useful rules (see also
7438 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7439 now expressed as a proper nested rule (old-style tactic scripts may
7440 require atomize_strip_tac to cope with non-atomic premises);
7442 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7443 to "split_conv" (old name still available for compatibility);
7445 * HOL: improved concrete syntax for strings (e.g. allows translation
7446 rules with string literals);
7448 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7449 and Fleuriot's mechanization of analysis, including the transcendental
7450 functions for the reals;
7452 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7457 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7458 "lam" is displayed as TWO lambda-symbols
7460 * CTT: theory Main now available, containing everything (that is, Bool
7466 * Pure: the Simplifier has been implemented properly as a derived rule
7467 outside of the actual kernel (at last!); the overall performance
7468 penalty in practical applications is about 50%, while reliability of
7469 the Isabelle inference kernel has been greatly improved;
7471 * print modes "brackets" and "no_brackets" control output of nested =>
7472 (types) and ==> (props); the default behaviour is "brackets";
7474 * Provers: fast_tac (and friends) now handle actual object-logic rules
7475 as assumptions as well;
7477 * system: support Poly/ML 4.0;
7479 * system: isatool install handles KDE version 1 or 2;
7483 New in Isabelle99-1 (October 2000)
7484 ----------------------------------
7486 *** Overview of INCOMPATIBILITIES ***
7488 * HOL: simplification of natural numbers is much changed; to partly
7489 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7490 issue the following ML commands:
7492 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7493 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7495 * HOL: simplification no longer dives into case-expressions; this is
7496 controlled by "t.weak_case_cong" for each datatype t;
7498 * HOL: nat_less_induct renamed to less_induct;
7500 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7501 fixsome to patch .thy and .ML sources automatically;
7503 select_equality -> some_equality
7504 select_eq_Ex -> some_eq_ex
7505 selectI2EX -> someI2_ex
7508 select1_equality -> some1_equality
7509 Eps_sym_eq -> some_sym_eq_trivial
7510 Eps_eq -> some_eq_trivial
7512 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7514 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7517 * HOL: the recursion equations generated by 'recdef' are now called
7518 f.simps instead of f.rules;
7520 * HOL: qed_spec_mp now also handles bounded ALL as well;
7522 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7523 sometimes be needed;
7525 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7527 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7529 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7530 product is now "<*>" instead of "Times"; the lexicographic product is
7531 now "<*lex*>" instead of "**";
7533 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7534 of main HOL, but was unused); better use HOL's datatype package;
7536 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7537 the old syntax may be recovered as follows:
7540 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7541 (infixl "\\<oplus>" 100)
7543 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7545 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7546 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7549 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7550 changed from A/r to A//r;
7552 * ZF: new treatment of arithmetic (nat & int) may break some old
7555 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7556 rulify -> rule_format, elimify -> elim_format, ...);
7558 * Isar/Provers: intro/elim/dest attributes changed; renamed
7559 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7560 should have to change intro!! to intro? only); replaced "delrule" by
7563 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7565 * Provers: strengthened force_tac by using new first_best_tac;
7567 * LaTeX document preparation: several changes of isabelle.sty (see
7571 *** Document preparation ***
7573 * formal comments (text blocks etc.) in new-style theories may now
7574 contain antiquotations of thm/prop/term/typ/text to be presented
7575 according to latex print mode; concrete syntax is like this:
7576 @{term[show_types] "f(x) = a + x"};
7578 * isatool mkdir provides easy setup of Isabelle session directories,
7579 including proper document sources;
7581 * generated LaTeX sources are now deleted after successful run
7582 (isatool document -c); may retain a copy somewhere else via -D option
7585 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7586 style files, achieving self-contained LaTeX sources and simplifying
7589 * old-style theories now produce (crude) LaTeX output as well;
7591 * browser info session directories are now self-contained (may be put
7592 on WWW server seperately); improved graphs of nested sessions; removed
7593 graph for 'all sessions';
7595 * several improvements in isabelle style files; \isabellestyle{it}
7596 produces fake math mode output; \isamarkupheader is now \section by
7597 default; see lib/texinputs/isabelle.sty etc.;
7602 * Isar/Pure: local results and corresponding term bindings are now
7603 subject to Hindley-Milner polymorphism (similar to ML); this
7604 accommodates incremental type-inference very nicely;
7606 * Isar/Pure: new derived language element 'obtain' supports
7607 generalized existence reasoning;
7609 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7610 support accumulation of results, without applying any rules yet;
7611 useful to collect intermediate results without explicit name
7612 references, and for use with transitivity rules with more than 2
7615 * Isar/Pure: scalable support for case-analysis type proofs: new
7616 'case' language element refers to local contexts symbolically, as
7617 produced by certain proof methods; internally, case names are attached
7618 to theorems as "tags";
7620 * Isar/Pure: theory command 'hide' removes declarations from
7621 class/type/const name spaces;
7623 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7624 indicate potential overloading;
7626 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7628 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7629 "{a,b,c}" instead of {a,b,c};
7631 * Isar/Pure now provides its own version of intro/elim/dest
7632 attributes; useful for building new logics, but beware of confusion
7633 with the version in Provers/classical;
7635 * Isar/Pure: the local context of (non-atomic) goals is provided via
7636 case name 'antecedent';
7638 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7639 to the current context is now done automatically);
7641 * Isar/Pure: theory command 'method_setup' provides a simple interface
7642 for definining proof methods in ML;
7644 * Isar/Provers: intro/elim/dest attributes changed; renamed
7645 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7646 most cases, one should have to change intro!! to intro? only);
7647 replaced "delrule" by "rule del";
7649 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7650 'symmetric' attribute (the latter supercedes [RS sym]);
7652 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7653 method modifier); 'simp' method: 'only:' modifier removes loopers as
7654 well (including splits);
7656 * Isar/Provers: Simplifier and Classical methods now support all kind
7657 of modifiers used in the past, including 'cong', 'iff', etc.
7659 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7660 of Simplifier and Classical reasoner);
7662 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7663 now support named cases; major packages (inductive, datatype, primrec,
7664 recdef) support case names and properly name parameters;
7666 * Isar/HOL: new transitivity rules for substitution in inequalities --
7667 monotonicity conditions are extracted to be proven at end of
7670 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7673 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7674 split_if split_if_asm; datatype package provides theorems foo.splits =
7675 foo.split foo.split_asm for each datatype;
7677 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7678 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7679 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7680 use "(cases (simplified))" method in proper proof texts);
7682 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7684 * Isar: names of theorems etc. may be natural numbers as well;
7686 * Isar: 'pr' command: optional arguments for goals_limit and
7687 ProofContext.prems_limit; no longer prints theory contexts, but only
7690 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7691 additional print modes to be specified; e.g. "pr(latex)" will print
7692 proof state according to the Isabelle LaTeX style;
7694 * Isar: improved support for emulating tactic scripts, including proof
7695 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7696 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7697 (for HOL datatypes);
7699 * Isar: simplified (more robust) goal selection of proof methods: 1st
7700 goal, all goals, or explicit goal specifier (tactic emulation); thus
7701 'proof method scripts' have to be in depth-first order;
7703 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7705 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7706 should instead use individual commands for printing items
7707 (print_commands, print_methods etc.);
7709 * Isar: added 'nothing' --- the empty list of theorems;
7714 * HOL/MicroJava: formalization of a fragment of Java, together with a
7715 corresponding virtual machine and a specification of its bytecode
7716 verifier and a lightweight bytecode verifier, including proofs of
7717 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7718 Cornelia Pusch (see also the homepage of project Bali at
7719 http://isabelle.in.tum.de/Bali/);
7721 * HOL/Algebra: new theory of rings and univariate polynomials, by
7724 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7725 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7728 * HOL/Lattice: fundamental concepts of lattice theory and order
7729 structures, including duals, properties of bounds versus algebraic
7730 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7731 Theorem for complete lattices etc.; may also serve as a demonstration
7732 for abstract algebraic reasoning using axiomatic type classes, and
7733 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7735 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7738 * HOL/IMPP: extension of IMP with local variables and mutually
7739 recursive procedures, by David von Oheimb;
7741 * HOL/Lambda: converted into new-style theory and document;
7743 * HOL/ex/Multiquote: example of multiple nested quotations and
7744 anti-quotations -- basically a generalized version of de-Bruijn
7745 representation; very useful in avoiding lifting of operations;
7747 * HOL/record: added general record equality rule to simpset; fixed
7748 select-update simplification procedure to handle extended records as
7749 well; admit "r" as field name;
7751 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7752 other numeric types and also as the identity of groups, rings, etc.;
7754 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7755 Types nat and int belong to this axclass;
7757 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7758 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7759 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7760 two terms #m*u and #n*u are replaced by #(m+n)*u
7761 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7762 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7763 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7765 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7766 powerful prover for predicate logic but knows nothing of clasets; see
7767 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7769 * HOL: new version of "case_tac" subsumes both boolean case split and
7770 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7771 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7773 * HOL: simplification no longer dives into case-expressions: only the
7774 selector expression is simplified, but not the remaining arms; to
7775 enable full simplification of case-expressions for datatype t, you may
7776 remove t.weak_case_cong from the simpset, either globally (Delcongs
7777 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7779 * HOL/recdef: the recursion equations generated by 'recdef' for
7780 function 'f' are now called f.simps instead of f.rules; if all
7781 termination conditions are proved automatically, these simplification
7782 rules are added to the simpset, as in primrec; rules may be named
7783 individually as well, resulting in a separate list of theorems for
7786 * HOL/While is a new theory that provides a while-combinator. It
7787 permits the definition of tail-recursive functions without the
7788 provision of a termination measure. The latter is necessary once the
7789 invariant proof rule for while is applied.
7791 * HOL: new (overloaded) notation for the set of elements below/above
7792 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7794 * HOL: theorems impI, allI, ballI bound as "strip";
7796 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7797 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7798 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7800 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7802 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7803 main HOL, but was unused);
7805 * HOL: fewer consts declared as global (e.g. have to refer to
7806 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7808 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7809 in case of overlap with user translations (e.g. judgements over
7810 tuples); (note that the underlying logical represenation is still
7816 * ZF: simplification automatically cancels common terms in arithmetic
7817 expressions over nat and int;
7819 * ZF: new treatment of nat to minimize type-checking: all operators
7820 coerce their operands to a natural number using the function natify,
7821 making the algebraic laws unconditional;
7823 * ZF: as above, for int: operators coerce their operands to an integer
7824 using the function intify;
7826 * ZF: the integer library now contains many of the usual laws for the
7827 orderings, including $<=, and monotonicity laws for $+ and $*;
7829 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7832 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7833 to the simplifier and classical reasoner simultaneously;
7838 * Provers: blast_tac now handles actual object-logic rules as
7839 assumptions; note that auto_tac uses blast_tac internally as well;
7841 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7842 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7844 * Provers: delrules now handles destruct rules as well (no longer need
7845 explicit make_elim);
7847 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7848 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7849 use instead the strong form,
7850 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7851 in HOL, FOL and ZF the function cla_make_elim will create such rules
7852 from destruct-rules;
7854 * Provers: Simplifier.easy_setup provides a fast path to basic
7855 Simplifier setup for new object-logics;
7857 * Pure: AST translation rules no longer require constant head on LHS;
7859 * Pure: improved name spaces: ambiguous output is qualified; support
7860 for hiding of names;
7862 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7863 XSYMBOL_HOME; no longer need to do manual configuration in most
7866 * system: compression of ML heaps images may now be controlled via -c
7867 option of isabelle and isatool usedir (currently only observed by
7870 * system: isatool installfonts may handle X-Symbol fonts as well (very
7871 useful for remote X11);
7873 * system: provide TAGS file for Isabelle sources;
7875 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7878 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7879 timing flag supersedes proof_timing and Toplevel.trace;
7881 * ML: new combinators |>> and |>>> for incremental transformations
7882 with secondary results (e.g. certain theory extensions):
7884 * ML: PureThy.add_defs gets additional argument to indicate potential
7885 overloading (usually false);
7887 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7892 New in Isabelle99 (October 1999)
7893 --------------------------------
7895 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7897 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7898 are no longer simplified. (This allows the simplifier to unfold recursive
7899 functional programs.) To restore the old behaviour, declare
7901 Delcongs [if_weak_cong];
7903 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7906 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7908 * HOL/datatype: mutual_induct_tac no longer exists --
7909 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7911 * HOL/typedef: fixed type inference for representing set; type
7912 arguments now have to occur explicitly on the rhs as type constraints;
7914 * ZF: The con_defs part of an inductive definition may no longer refer
7915 to constants declared in the same theory;
7917 * HOL, ZF: the function mk_cases, generated by the inductive
7918 definition package, has lost an argument. To simplify its result, it
7919 uses the default simpset instead of a supplied list of theorems.
7921 * HOL/List: the constructors of type list are now Nil and Cons;
7923 * Simplifier: the type of the infix ML functions
7924 setSSolver addSSolver setSolver addSolver
7925 is now simpset * solver -> simpset where `solver' is a new abstract type
7926 for packaging solvers. A solver is created via
7927 mk_solver: string -> (thm list -> int -> tactic) -> solver
7928 where the string argument is only a comment.
7933 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7934 decision procedure for linear arithmetic. Currently it is used for
7935 types `nat', `int', and `real' in HOL (see below); it can, should and
7936 will be instantiated for other types and logics as well.
7938 * The simplifier now accepts rewrite rules with flexible heads, eg
7939 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7940 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7946 * New Isabelle/Isar subsystem provides an alternative to traditional
7947 tactical theorem proving; together with the ProofGeneral/isar user
7948 interface it offers an interactive environment for developing human
7949 readable proof documents (Isar == Intelligible semi-automated
7950 reasoning); for further information see isatool doc isar-ref,
7951 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7953 * improved and simplified presentation of theories: better HTML markup
7954 (including colors), graph views in several sizes; isatool usedir now
7955 provides a proper interface for user theories (via -P option); actual
7956 document preparation based on (PDF)LaTeX is available as well (for
7957 new-style theories only); see isatool doc system for more information;
7959 * native support for Proof General, both for classic Isabelle and
7962 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7963 using the graph browser tool;
7965 * Isabelle manuals now also available as PDF;
7967 * theory loader rewritten from scratch (may not be fully
7968 bug-compatible); old loadpath variable has been replaced by show_path,
7969 add_path, del_path, reset_path functions; new operations such as
7970 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7973 * improved isatool install: option -k creates KDE application icon,
7974 option -p DIR installs standalone binaries;
7976 * added ML_PLATFORM setting (useful for cross-platform installations);
7977 more robust handling of platform specific ML images for SML/NJ;
7979 * the settings environment is now statically scoped, i.e. it is never
7980 created again in sub-processes invoked from isabelle, isatool, or
7983 * path element specification '~~' refers to '$ISABELLE_HOME';
7985 * in locales, the "assumes" and "defines" parts may be omitted if
7988 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7991 * new print_mode "HTML";
7993 * new flag show_tags controls display of tags of theorems (which are
7994 basically just comments that may be attached by some tools);
7996 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7997 mode and goal output format:
7999 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8001 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8003 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8004 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8006 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8008 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8010 * function bind_thms stores lists of theorems (cf. bind_thm);
8012 * new shorthand tactics ftac, eatac, datac, fatac;
8014 * qed (and friends) now accept "" as result name; in that case the
8015 theorem is not stored, but proper checks and presentation of the
8018 * theorem database now also indexes constants "Trueprop", "all",
8019 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8024 ** HOL arithmetic **
8026 * There are now decision procedures for linear arithmetic over nat and
8029 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8030 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8031 are treated as atomic; subformulae not involving type `nat' or `int'
8032 are ignored; quantified subformulae are ignored unless they are
8033 positive universal or negative existential. The tactic has to be
8034 invoked by hand and can be a little bit slow. In particular, the
8035 running time is exponential in the number of occurrences of `min' and
8036 `max', and `-' on `nat'.
8038 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8039 (negated) (in)equalities among the premises and the conclusion into
8040 account (i.e. no compound formulae) and does not know about `min' and
8041 `max', and `-' on `nat'. It is fast and is used automatically by the
8044 NB: At the moment, these decision procedures do not cope with mixed
8045 nat/int formulae where the two parts interact, such as `m < n ==>
8048 * HOL/Numeral provides a generic theory of numerals (encoded
8049 efficiently as bit strings); setup for types nat/int/real is in place;
8050 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8051 int, existing theories and proof scripts may require a few additional
8054 * integer division and remainder can now be performed on constant
8057 * many properties of integer multiplication, division and remainder
8060 * An interface to the Stanford Validity Checker (SVC) is available through the
8061 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8062 are proved automatically. SVC must be installed separately, and its results
8063 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8064 invocation of the underlying oracle). For SVC see
8065 http://verify.stanford.edu/SVC
8067 * IsaMakefile: the HOL-Real target now builds an actual image;
8072 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8073 (in Isabelle/Isar) -- by Gertrud Bauer;
8075 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8076 analysis for assembly languages with subtypes;
8078 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8079 -- avoids syntactic ambiguities and treats state, transition, and
8080 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8081 changed syntax and (many) tactics;
8083 * HOL/inductive: Now also handles more general introduction rules such
8084 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8085 theorems are now maintained within the theory (maintained via the
8088 * HOL/datatype: Now also handles arbitrarily branching datatypes
8089 (using function types) such as
8091 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8093 * HOL/record: record_simproc (part of the default simpset) takes care
8094 of selectors applied to updated records; record_split_tac is no longer
8095 part of the default claset; update_defs may now be removed from the
8096 simpset in many cases; COMPATIBILITY: old behavior achieved by
8098 claset_ref () := claset() addSWrapper record_split_wrapper;
8099 Delsimprocs [record_simproc]
8101 * HOL/typedef: fixed type inference for representing set; type
8102 arguments now have to occur explicitly on the rhs as type constraints;
8104 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8105 names rather than an ML expression;
8107 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8108 supplied later. Program schemes can be defined, such as
8109 "While B C s = (if B s then While B C (C s) else s)"
8110 where the well-founded relation can be chosen after B and C have been given.
8112 * HOL/List: the constructors of type list are now Nil and Cons;
8113 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8114 course, ML tools referring to List.list.op # etc. have to be adapted;
8116 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8117 disabled by default; run isabelle with option -m HOL to get back to
8118 the original Gordon/HOL-style output;
8120 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8121 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8123 * HOL basic syntax simplified (more orthogonal): all variants of
8124 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8125 Eps operator is provided as well: "SOME x. P[x]";
8127 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8129 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8130 thus available for user theories;
8132 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8133 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8136 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8137 several times and then mp;
8142 * the notation <<...>> is now available as a notation for sequences of
8145 * the simplifier is now installed
8147 * the axiom system has been generalized (thanks to Soren Heilmann)
8149 * the classical reasoner now has a default rule database
8154 * new primrec section allows primitive recursive functions to be given
8155 directly (as in HOL) over datatypes and the natural numbers;
8157 * new tactics induct_tac and exhaust_tac for induction (or case
8158 analysis) over datatypes and the natural numbers;
8160 * the datatype declaration of type T now defines the recursor T_rec;
8162 * simplification automatically does freeness reasoning for datatype
8165 * automatic type-inference, with AddTCs command to insert new
8166 type-checking rules;
8168 * datatype introduction rules are now added as Safe Introduction rules
8171 * the syntax "if P then x else y" is now available in addition to
8175 *** Internal programming interfaces ***
8177 * tuned simplifier trace output; new flag debug_simp;
8179 * structures Vartab / Termtab (instances of TableFun) offer efficient
8180 tables indexed by indexname_ord / term_ord (compatible with aconv);
8182 * AxClass.axclass_tac lost the theory argument;
8184 * tuned current_goals_markers semantics: begin / end goal avoids
8185 printing empty lines;
8187 * removed prs and prs_fn hook, which was broken because it did not
8188 include \n in its semantics, forcing writeln to add one
8189 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8190 string -> unit if you really want to output text without newline;
8192 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8193 plain output, interface builders may have to enable 'isabelle_font'
8194 mode to get Isabelle font glyphs as before;
8196 * refined token_translation interface; INCOMPATIBILITY: output length
8197 now of type real instead of int;
8199 * theory loader actions may be traced via new ThyInfo.add_hook
8200 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8201 your own database of information attached to *whole* theories -- as
8202 opposed to intra-theory data slots offered via TheoryDataFun;
8204 * proper handling of dangling sort hypotheses (at last!);
8205 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8206 extra sort hypotheses that can be witnessed from the type signature;
8207 the force_strip_shyps flag is gone, any remaining shyps are simply
8208 left in the theorem (with a warning issued by strip_shyps_warning);
8212 New in Isabelle98-1 (October 1998)
8213 ----------------------------------
8215 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8217 * several changes of automated proof tools;
8219 * HOL: major changes to the inductive and datatype packages, including
8220 some minor incompatibilities of theory syntax;
8222 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8225 * HOL: removed duplicate thms in Arith:
8226 less_imp_add_less should be replaced by trans_less_add1
8227 le_imp_add_le should be replaced by trans_le_add1
8229 * HOL: unary minus is now overloaded (new type constraints may be
8232 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8233 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8234 now taken as an integer constant.
8236 * Pure: ML function 'theory_of' renamed to 'theory';
8242 1. Asm_full_simp_tac is now more aggressive.
8243 1. It will sometimes reorient premises if that increases their power to
8245 2. It does no longer proceed strictly from left to right but may also
8246 rotate premises to achieve further simplification.
8247 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8248 old Asm_full_simp_tac in that it does not rotate premises.
8249 2. The simplifier now knows a little bit about nat-arithmetic.
8251 * Classical reasoner: wrapper mechanism for the classical reasoner now
8252 allows for selected deletion of wrappers, by introduction of names for
8253 wrapper functionals. This implies that addbefore, addSbefore,
8254 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8255 and that adding two tactics with the same name overwrites the first
8256 one (emitting a warning).
8257 type wrapper = (int -> tactic) -> (int -> tactic)
8258 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8259 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8260 delWrapper, delSWrapper: claset * string -> claset
8261 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8263 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8264 semantics; addbefore now affects only the unsafe part of step_tac
8265 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8266 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8269 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8270 compWrapper; added safe wrapper (and access functions for it);
8272 * HOL/split_all_tac is now much faster and fails if there is nothing
8273 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8274 and the names of the automatically generated variables have changed.
8275 split_all_tac has moved within claset() from unsafe wrappers to safe
8276 wrappers, which means that !!-bound variables are split much more
8277 aggressively, and safe_tac and clarify_tac now split such variables.
8278 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8279 Note: the same holds for record_split_tac, which does the job of
8280 split_all_tac for record fields.
8282 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8283 permanently to the default simpset using Addsplits just like
8284 Addsimps. They can be removed via Delsplits just like
8285 Delsimps. Lower-case versions are also available.
8287 * HOL/Simplifier: The rule split_if is now part of the default
8288 simpset. This means that the simplifier will eliminate all occurrences
8289 of if-then-else in the conclusion of a goal. To prevent this, you can
8290 either remove split_if completely from the default simpset by
8291 `Delsplits [split_if]' or remove it in a specific call of the
8292 simplifier using `... delsplits [split_if]'. You can also add/delete
8293 other case splitting rules to/from the default simpset: every datatype
8294 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8295 t is the name of the datatype).
8297 * Classical reasoner / Simplifier combination: new force_tac (and
8298 derivatives Force_tac, force) combines rewriting and classical
8299 reasoning (and whatever other tools) similarly to auto_tac, but is
8300 aimed to solve the given subgoal completely.
8305 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8306 and `goalw': the theory is no longer needed as an explicit argument -
8307 the current theory context is used; assumptions are no longer returned
8308 at the ML-level unless one of them starts with ==> or !!; it is
8309 recommended to convert to these new commands using isatool fixgoal
8310 (backup your sources first!);
8312 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8313 the current theory context, and 'theory' to lookup stored theories;
8315 * new theory section 'locale' for declaring constants, assumptions and
8316 definitions that have local scope;
8318 * new theory section 'nonterminals' for purely syntactic types;
8320 * new theory section 'setup' for generic ML setup functions
8321 (e.g. package initialization);
8323 * the distribution now includes Isabelle icons: see
8324 lib/logo/isabelle-{small,tiny}.xpm;
8326 * isatool install - install binaries with absolute references to
8329 * isatool logo -- create instances of the Isabelle logo (as EPS);
8331 * print mode 'emacs' reserved for Isamode;
8333 * support multiple print (ast) translations per constant name;
8335 * theorems involving oracles are now printed with a suffixed [!];
8340 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8342 * HOL/inductive package reorganized and improved: now supports mutual
8348 oddI "n : EVEN ==> Suc n : ODD"
8349 evenI "n : ODD ==> Suc n : EVEN"
8351 new theorem list "elims" contains an elimination rule for each of the
8352 recursive sets; inductive definitions now handle disjunctive premises
8353 correctly (also ZF);
8355 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8356 "mutual_induct" no longer exists - the induction rule is always
8357 contained in "induct";
8360 * HOL/datatype package re-implemented and greatly improved: now
8361 supports mutually recursive datatypes such as
8364 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8365 | SUM ('a aexp) ('a aexp)
8366 | DIFF ('a aexp) ('a aexp)
8369 'a bexp = LESS ('a aexp) ('a aexp)
8370 | AND ('a bexp) ('a bexp)
8371 | OR ('a bexp) ('a bexp)
8373 as well as indirectly recursive datatypes such as
8376 ('a, 'b) term = Var 'a
8377 | App 'b ((('a, 'b) term) list)
8379 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8380 induction on mutually / indirectly recursive datatypes.
8382 Primrec equations are now stored in theory and can be accessed via
8383 <function_name>.simps.
8387 - Theories using datatypes must now have theory Datatype as an
8389 - The specific <typename>.induct_tac no longer exists - use the
8390 generic induct_tac instead.
8391 - natE has been renamed to nat.exhaust - use exhaust_tac
8392 instead of res_inst_tac ... natE. Note that the variable
8393 names in nat.exhaust differ from the names in natE, this
8394 may cause some "fragile" proofs to fail.
8395 - The theorems split_<typename>_case and split_<typename>_case_asm
8396 have been renamed to <typename>.split and <typename>.split_asm.
8397 - Since default sorts of type variables are now handled correctly,
8398 some datatype definitions may have to be annotated with explicit
8400 - Primrec definitions no longer require function name and type
8401 of recursive argument.
8403 Consider using isatool fixdatatype to adapt your theories and proof
8404 scripts to the new package (backup your sources first!).
8407 * HOL/record package: considerably improved implementation; now
8408 includes concrete syntax for record types, terms, updates; theorems
8409 for surjective pairing and splitting !!-bound record variables; proof
8410 support is as follows:
8412 1) standard conversions (selectors or updates applied to record
8413 constructor terms) are part of the standard simpset;
8415 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8416 made part of standard simpset and claset via addIffs;
8418 3) a tactic for record field splitting (record_split_tac) is part of
8419 the standard claset (addSWrapper);
8421 To get a better idea about these rules you may retrieve them via
8422 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8423 the name of your record type.
8425 The split tactic 3) conceptually simplifies by the following rule:
8427 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8429 Thus any record variable that is bound by meta-all will automatically
8430 blow up into some record constructor term, consequently the
8431 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8432 solve record problems automatically.
8435 * reorganized the main HOL image: HOL/Integ and String loaded by
8436 default; theory Main includes everything;
8438 * automatic simplification of integer sums and comparisons, using cancellation;
8440 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8442 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8444 * many new identities for unions, intersections, set difference, etc.;
8446 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8447 called split_if, split_split, split_sum_case and split_nat_case (to go
8448 with add/delsplits);
8450 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8451 (?x::unit) = (); this is made part of the default simpset, which COULD
8452 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8453 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8454 unit_abs_eta_conv is added in order to counter the effect of
8455 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8458 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8461 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8462 It and 'sym RS equals0D' are now in the default claset, giving automatic
8463 disjointness reasoning but breaking a few old proofs.
8465 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8466 to 'converse' from 'inverse' (for compatibility with ZF and some
8469 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8470 the well-founded relation;
8472 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8473 Compl A. The "Compl" syntax remains available as input syntax for this
8476 * HOL/Update: new theory of function updates:
8477 f(a:=b) == %x. if x=a then b else f x
8478 may also be iterated as in f(a:=b,c:=d,...);
8480 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8483 - new function list_update written xs[i:=v] that updates the i-th
8484 list position. May also be iterated as in xs[i:=a,j:=b,...].
8485 - new function `upt' written [i..j(] which generates the list
8486 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8487 bound write [i..j], which is a shorthand for [i..j+1(].
8488 - new lexicographic orderings and corresponding wellfoundedness theorems.
8491 - removed 'pred' (predecessor) function;
8492 - generalized some theorems about n-1;
8493 - many new laws about "div" and "mod";
8494 - new laws about greatest common divisors (see theory ex/Primes);
8496 * HOL/Relation: renamed the relational operator r^-1 "converse"
8497 instead of "inverse";
8499 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8500 of the multiset ordering;
8502 * directory HOL/Real: a construction of the reals using Dedekind cuts
8503 (not included by default);
8505 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8507 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8508 programs, i.e. different program variables may have different types.
8510 * calling (stac rew i) now fails if "rew" has no effect on the goal
8511 [previously, this check worked only if the rewrite rule was unconditional]
8512 Now rew can involve either definitions or equalities (either == or =).
8517 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8518 only the theorems proved on ZF.ML;
8520 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8521 It and 'sym RS equals0D' are now in the default claset, giving automatic
8522 disjointness reasoning but breaking a few old proofs.
8524 * ZF/Update: new theory of function updates
8525 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8526 may also be iterated as in f(a:=b,c:=d,...);
8528 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8530 * calling (stac rew i) now fails if "rew" has no effect on the goal
8531 [previously, this check worked only if the rewrite rule was unconditional]
8532 Now rew can involve either definitions or equalities (either == or =).
8534 * case_tac provided for compatibility with HOL
8535 (like the old excluded_middle_tac, but with subgoals swapped)
8538 *** Internal programming interfaces ***
8540 * Pure: several new basic modules made available for general use, see
8541 also src/Pure/README;
8543 * improved the theory data mechanism to support encapsulation (data
8544 kind name replaced by private Object.kind, acting as authorization
8545 key); new type-safe user interface via functor TheoryDataFun; generic
8546 print_data function becomes basically useless;
8548 * removed global_names compatibility flag -- all theory declarations
8549 are qualified by default;
8551 * module Pure/Syntax now offers quote / antiquote translation
8552 functions (useful for Hoare logic etc. with implicit dependencies);
8553 see HOL/ex/Antiquote for an example use;
8555 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8558 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8561 * Display.print_goals function moved to Locale.print_goals;
8563 * standard print function for goals supports current_goals_markers
8564 variable for marking begin of proof, end of proof, start of goal; the
8565 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8566 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8571 New in Isabelle98 (January 1998)
8572 --------------------------------
8574 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8576 * changed lexical syntax of terms / types: dots made part of long
8577 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8579 * simpset (and claset) reference variable replaced by functions
8580 simpset / simpset_ref;
8582 * no longer supports theory aliases (via merge) and non-trivial
8583 implicit merge of thms' signatures;
8585 * most internal names of constants changed due to qualified names;
8587 * changed Pure/Sequence interface (see Pure/seq.ML);
8590 *** General Changes ***
8592 * hierachically structured name spaces (for consts, types, axms, thms
8593 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8594 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8595 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8596 long_names for fully qualified output names; NOTE: ML programs
8597 (special tactics, packages etc.) referring to internal names may have
8598 to be adapted to cope with fully qualified names; in case of severe
8599 backward campatibility problems try setting 'global_names' at compile
8600 time to have enrything declared within a flat name space; one may also
8601 fine tune name declarations in theories via the 'global' and 'local'
8604 * reimplemented the implicit simpset and claset using the new anytype
8605 data filed in signatures; references simpset:simpset ref etc. are
8606 replaced by functions simpset:unit->simpset and
8607 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8608 to patch your ML files accordingly;
8610 * HTML output now includes theory graph data for display with Java
8611 applet or isatool browser; data generated automatically via isatool
8612 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8614 * defs may now be conditional; improved rewrite_goals_tac to handle
8615 conditional equations;
8617 * defs now admits additional type arguments, using TYPE('a) syntax;
8619 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8620 creates a new theory node; implicit merge of thms' signatures is
8621 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8622 transfer:theory->thm->thm in (rare) cases;
8624 * improved handling of draft signatures / theories; draft thms (and
8625 ctyps, cterms) are automatically promoted to real ones;
8627 * slightly changed interfaces for oracles: admit many per theory, named
8628 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8630 * print_goals: optional output of const types (set show_consts and
8633 * improved output of warnings (###) and errors (***);
8635 * subgoal_tac displays a warning if the new subgoal has type variables;
8637 * removed old README and Makefiles;
8639 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8641 * removed obsolete init_pps and init_database;
8643 * deleted the obsolete tactical STATE, which was declared by
8644 fun STATE tacfun st = tacfun st st;
8646 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8647 (which abbreviates $HOME);
8649 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8650 use isatool fixseq to adapt your ML programs (this works for fully
8651 qualified references to the Sequence structure only!);
8653 * use_thy no longer requires writable current directory; it always
8654 reloads .ML *and* .thy file, if either one is out of date;
8657 *** Classical Reasoner ***
8659 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8660 tactics that use classical reasoning to simplify a subgoal without
8661 splitting it into several subgoals;
8663 * Safe_tac: like safe_tac but uses the default claset;
8668 * added simplification meta rules:
8669 (asm_)(full_)simplify: simpset -> thm -> thm;
8671 * simplifier.ML no longer part of Pure -- has to be loaded by object
8674 * added prems argument to simplification procedures;
8676 * HOL, FOL, ZF: added infix function `addsplits':
8677 instead of `<simpset> setloop (split_tac <thms>)'
8678 you can simply write `<simpset> addsplits <thms>'
8683 * TYPE('a) syntax for type reflection terms;
8685 * no longer handles consts with name "" -- declare as 'syntax' instead;
8687 * pretty printer: changed order of mixfix annotation preference (again!);
8689 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8694 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8695 with `addloop' of the simplifier to faciliate case splitting in premises.
8697 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8699 * HOL/Auth: new protocol proofs including some for the Internet
8702 * HOL/Map: new theory of `maps' a la VDM;
8704 * HOL/simplifier: simplification procedures nat_cancel_sums for
8705 cancelling out common nat summands from =, <, <= (in)equalities, or
8706 differences; simplification procedures nat_cancel_factor for
8707 cancelling common factor from =, <, <= (in)equalities over natural
8708 sums; nat_cancel contains both kinds of procedures, it is installed by
8709 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8711 * HOL/simplifier: terms of the form
8712 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8714 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8715 and those of the form
8716 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8718 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8721 Each datatype `t' now comes with a theorem `split_t_case' of the form
8723 P(t_case f1 ... fn x) =
8724 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8726 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8729 and a theorem `split_t_case_asm' of the form
8731 P(t_case f1 ... fn x) =
8732 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8734 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8736 which can be added to a simpset via `addsplits'. The existing theorems
8737 expand_list_case and expand_option_case have been renamed to
8738 split_list_case and split_option_case.
8741 - `pred n' is automatically converted to `n-1'.
8742 Users are strongly encouraged not to use `pred' any longer,
8743 because it will disappear altogether at some point.
8744 - Users are strongly encouraged to write "0 < n" rather than
8745 "n ~= 0". Theorems and proof tools have been modified towards this
8749 the function "set_of_list" has been renamed "set" (and its theorems too);
8750 the function "nth" now takes its arguments in the reverse order and
8751 has acquired the infix notation "!" as in "xs!n".
8753 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8755 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8756 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8758 * HOL/record: extensible records with schematic structural subtyping
8759 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8760 still lacks various theorems and concrete record syntax;
8765 * removed "axioms" and "generated by" sections;
8767 * replaced "ops" section by extended "consts" section, which is capable of
8768 handling the continuous function space "->" directly;
8771 . proves theorems immediately and stores them in the theory,
8772 . creates hierachical name space,
8773 . now uses normal mixfix annotations (instead of cinfix...),
8774 . minor changes to some names and values (for consistency),
8775 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8776 . separator between mutual domain defs: changed "," to "and",
8777 . improved handling of sort constraints; now they have to
8778 appear on the left-hand side of the equations only;
8780 * fixed LAM <x,y,zs>.b syntax;
8782 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8783 adm (%x. P (t x)), where P is chainfinite and t continuous;
8788 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8789 with `addloop' of the simplifier to faciliate case splitting in premises.
8791 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8792 in HOL, they strip ALL and --> from proved theorems;
8796 New in Isabelle94-8 (May 1997)
8797 ------------------------------
8799 *** General Changes ***
8801 * new utilities to build / run / maintain Isabelle etc. (in parts
8802 still somewhat experimental); old Makefiles etc. still functional;
8804 * new 'Isabelle System Manual';
8806 * INSTALL text, together with ./configure and ./build scripts;
8808 * reimplemented type inference for greater efficiency, better error
8809 messages and clean internal interface;
8811 * prlim command for dealing with lots of subgoals (an easier way of
8812 setting goals_limit);
8817 * supports alternative (named) syntax tables (parser and pretty
8818 printer); internal interface is provided by add_modesyntax(_i);
8820 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8821 be used in conjunction with the Isabelle symbol font; uses the
8822 "symbols" syntax table;
8824 * added token_translation interface (may translate name tokens in
8825 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8826 the current print_mode); IMPORTANT: user print translation functions
8827 are responsible for marking newly introduced bounds
8828 (Syntax.mark_boundT);
8830 * token translations for modes "xterm" and "xterm_color" that display
8831 names in bold, underline etc. or colors (which requires a color
8834 * infixes may now be declared with names independent of their syntax;
8836 * added typed_print_translation (like print_translation, but may
8837 access type of constant);
8840 *** Classical Reasoner ***
8842 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8843 some limitations. Blast_tac...
8844 + ignores addss, addbefore, addafter; this restriction is intrinsic
8845 + ignores elimination rules that don't have the correct format
8846 (the conclusion MUST be a formula variable)
8847 + ignores types, which can make HOL proofs fail
8848 + rules must not require higher-order unification, e.g. apply_type in ZF
8849 [message "Function Var's argument not a bound variable" relates to this]
8850 + its proof strategy is more general but can actually be slower
8852 * substitution with equality assumptions no longer permutes other
8855 * minor changes in semantics of addafter (now called addaltern); renamed
8856 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8857 (and access functions for it);
8859 * improved combination of classical reasoner and simplifier:
8860 + functions for handling clasimpsets
8861 + improvement of addss: now the simplifier is called _after_ the
8863 + safe variant of addss called addSss: uses safe simplifications
8864 _during_ the safe steps. It is more complete as it allows multiple
8865 instantiations of unknowns (e.g. with slow_tac).
8869 * added interface for simplification procedures (functions that
8870 produce *proven* rewrite rules on the fly, depending on current
8873 * ordering on terms as parameter (used for ordered rewriting);
8875 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8877 * the solver is now split into a safe and an unsafe part.
8878 This should be invisible for the normal user, except that the
8879 functions setsolver and addsolver have been renamed to setSolver and
8880 addSolver; added safe_asm_full_simp_tac;
8885 * a generic induction tactic `induct_tac' which works for all datatypes and
8886 also for type `nat';
8888 * a generic case distinction tactic `exhaust_tac' which works for all
8889 datatypes and also for type `nat';
8891 * each datatype comes with a function `size';
8893 * patterns in case expressions allow tuple patterns as arguments to
8894 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8896 * primrec now also works with type nat;
8898 * recdef: a new declaration form, allows general recursive functions to be
8899 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8901 * the constant for negation has been renamed from "not" to "Not" to
8902 harmonize with FOL, ZF, LK, etc.;
8904 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8907 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8909 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8910 problems in commutative rings, using axiomatic type classes for + and *;
8912 * more examples in HOL/MiniML and HOL/Auth;
8914 * more default rewrite rules for quantifiers, union/intersection;
8916 * a new constant `arbitrary == @x.False';
8918 * HOLCF/IOA replaces old HOL/IOA;
8920 * HOLCF changes: derived all rules and arities
8921 + axiomatic type classes instead of classes
8922 + typedef instead of faking type definitions
8923 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8924 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8925 + eliminated the types void, one, tr
8926 + use unit lift and bool lift (with translations) instead of one and tr
8927 + eliminated blift from Lift3.thy (use Def instead of blift)
8928 all eliminated rules are derived as theorems --> no visible changes ;
8933 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8934 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8935 as ZF_cs addSIs [equalityI];
8939 New in Isabelle94-7 (November 96)
8940 ---------------------------------
8942 * allowing negative levels (as offsets) in prlev and choplev;
8944 * super-linear speedup for large simplifications;
8946 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8947 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8948 FAIL); can suppress it using the command Delsimps (ex_simps @
8949 all_simps); De Morgan laws are also now included, by default;
8951 * improved printing of ==> : ~:
8953 * new object-logic "Sequents" adds linear logic, while replacing LK
8954 and Modal (thanks to Sara Kalvala);
8956 * HOL/Auth: correctness proofs for authentication protocols;
8958 * HOL: new auto_tac combines rewriting and classical reasoning (many
8959 examples on HOL/Auth);
8961 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8962 the rewriter and classical reasoner simultaneously;
8964 * function uresult no longer returns theorems in "standard" format;
8965 regain previous version by: val uresult = standard o uresult;
8972 * oracles -- these establish an interface between Isabelle and trusted
8973 external reasoners, which may deliver results as theorems;
8975 * proof objects (in particular record all uses of oracles);
8977 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8979 * "constdefs" section in theory files;
8981 * "primrec" section (HOL) no longer requires names;
8983 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8990 * reduced space requirements;
8992 * automatic HTML generation from theories;
8994 * theory files no longer require "..." (quotes) around most types;
8996 * new examples, including two proofs of the Church-Rosser theorem;
8998 * non-curried (1994) version of HOL is no longer distributed;
9005 * greatly reduced space requirements;
9007 * theory files (.thy) no longer require \...\ escapes at line breaks;
9009 * searchable theorem database (see the section "Retrieving theorems" on
9010 page 8 of the Reference Manual);
9012 * new examples, including Grabczewski's monumental case study of the
9015 * The previous version of HOL renamed to Old_HOL;
9017 * The new version of HOL (previously called CHOL) uses a curried syntax
9018 for functions. Application looks like f a b instead of f(a,b);
9020 * Mutually recursive inductive definitions finally work in HOL;
9022 * In ZF, pattern-matching on tuples is now available in all abstractions and
9023 translates to the operator "split";
9030 * new infix operator, addss, allowing the classical reasoner to
9031 perform simplification at each step of its search. Example:
9032 fast_tac (cs addss ss)
9034 * a new logic, CHOL, the same as HOL, but with a curried syntax
9035 for functions. Application looks like f a b instead of f(a,b). Also pairs
9036 look like (a,b) instead of <a,b>;
9038 * PLEASE NOTE: CHOL will eventually replace HOL!
9040 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9041 It translates to the operator "split". A new theory of integers is available;
9043 * In ZF, integer numerals now denote two's-complement binary integers.
9044 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9046 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9047 of the Axiom of Choice;
9054 * Significantly faster resolution;
9056 * the different sections in a .thy file can now be mixed and repeated
9059 * Database of theorems for FOL, HOL and ZF. New
9060 commands including qed, qed_goal and bind_thm store theorems in the database.
9062 * Simple database queries: return a named theorem (get_thm) or all theorems of
9063 a given theory (thms_of), or find out what theory a theorem was proved in
9066 * Bugs fixed in the inductive definition and datatype packages;
9068 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9069 and HOL_dup_cs obsolete;
9071 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9074 * Simpler definition of function space in ZF;
9076 * new results about cardinal and ordinal arithmetic in ZF;
9078 * 'subtype' facility in HOL for introducing new types as subsets of existing
9081 :mode=text:wrap=hard:maxLineLen=72: