reactivated Find_Unused_Assms_Examples to avoid untested / dead stuff in the repository;
moved the whole HOL-Quickcheck_Examples target from "all" to "full" for now -- it does not terminate in certain situations (to be investigated further);
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 * Discontinued old "prems" fact, which used to refer to the accidental
47 collection of foundational premises in the context (marked as legacy
50 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
51 instead. INCOMPATIBILITY.
53 * Ancient code generator for SML and its commands 'code_module',
54 'code_library', 'consts_code', 'types_code' have been discontinued.
55 Use commands of the generic code generator instead. INCOMPATIBILITY.
57 * Redundant attribute 'code_inline' has been discontinued. Use
58 'code_unfold' instead. INCOMPATIBILITY.
60 * Dropped attribute 'code_unfold_post' in favor of the its dual
61 'code_abbrev', which yields a common pattern in definitions like
63 definition [code_abbrev]: "f = t"
67 * Sort constraints are now propagated in simultaneous statements, just
68 like type constraints. INCOMPATIBILITY in rare situations, where
69 distinct sorts used to be assigned accidentally. For example:
71 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
73 lemma "P (x::'a)" and "Q (y::'a::bar)"
74 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
79 * Type 'a set is now a proper type constructor (just as before
80 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
81 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
82 sets separate, it is often sufficient to rephrase sets S accidentally
83 used as predicates by "%x. x : S" and predicates P accidentally used
84 as sets by "{x. P x}". Corresponding proofs in a first step should be
85 pruned from any tinkering with former theorems mem_def and
86 Collect_def. For developments which deliberately mixed predicates and
87 sets, a planning step is necessary to determine what should become a
88 predicate and what a set. It can be helpful to carry out that step in
89 Isabelle2011-1 before jumping right into the current release.
91 * New type synonym 'a rel = ('a * 'a) set
93 * Consolidated various theorem names relating to Finite_Set.fold
96 inf_INFI_fold_inf ~> inf_INF_fold_inf
97 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
98 INFI_fold_inf ~> INF_fold_inf
99 SUPR_fold_sup ~> SUP_fold_sup
100 union_set ~> union_set_fold
101 minus_set ~> minus_set_fold
105 * Consolidated theorem names concerning fold combinators:
107 INFI_set_fold ~> INF_set_fold
108 SUPR_set_fold ~> SUP_set_fold
109 INF_code ~> INF_set_foldr
110 SUP_code ~> SUP_set_foldr
111 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
112 foldl.simps ~> foldl_Nil foldl_Cons
113 foldr_fold_rev ~> foldr_def
114 foldl_fold ~> foldl_def
118 * Dropped rarely useful theorems concerning fold combinators:
119 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
120 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
121 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
122 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
123 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
124 Prefer "List.fold" with canonical argument order, or boil down
125 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
126 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
127 and "List.foldl plus 0", prefer "List.listsum".
129 * Congruence rules Option.map_cong and Option.bind_cong for recursion
130 through option types.
132 * Concrete syntax for case expressions includes constraints for source
133 positions, and thus produces Prover IDE markup for its bindings.
134 INCOMPATIBILITY for old-style syntax translations that augment the
135 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
138 * Discontinued configuration option "syntax_positions": atomic terms
139 in parse trees are always annotated by position constraints.
141 * Finite_Set.fold now qualified. INCOMPATIBILITY.
143 * Renamed some facts on canonical fold on lists, in order to avoid
144 problems with interpretation involving corresponding facts on foldl
145 with the same base names:
147 fold_set_remdups ~> fold_set_fold_remdups
148 fold_set ~> fold_set_fold
149 fold1_set ~> fold1_set_fold
153 * Renamed facts about the power operation on relations, i.e., relpow
154 to match the constant's name:
156 rel_pow_1 ~> relpow_1
157 rel_pow_0_I ~> relpow_0_I
158 rel_pow_Suc_I ~> relpow_Suc_I
159 rel_pow_Suc_I2 ~> relpow_Suc_I2
160 rel_pow_0_E ~> relpow_0_E
161 rel_pow_Suc_E ~> relpow_Suc_E
162 rel_pow_E ~> relpow_E
163 rel_pow_Suc_D2 ~> relpow_Suc_D2
164 rel_pow_Suc_E2 ~> relpow_Suc_E2
165 rel_pow_Suc_D2' ~> relpow_Suc_D2'
166 rel_pow_E2 ~> relpow_E2
167 rel_pow_add ~> relpow_add
168 rel_pow_commute ~> relpow
169 rel_pow_empty ~> relpow_empty:
170 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
171 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
172 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
173 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
174 rel_pow_fun_conv ~> relpow_fun_conv
175 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
176 rel_pow_finite_bounded ~> relpow_finite_bounded
177 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
178 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
179 single_valued_rel_pow ~> single_valued_relpow
183 * New theory HOL/Library/DAList provides an abstract type for association
184 lists with distinct keys.
186 * 'datatype' specifications allow explicit sort constraints.
188 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
189 use theory HOL/Library/Nat_Bijection instead.
191 * Session HOL-Word: Discontinued many redundant theorems specific to
192 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
195 word_sub_alt ~> word_sub_wi
196 word_add_alt ~> word_add_def
197 word_mult_alt ~> word_mult_def
198 word_minus_alt ~> word_minus_def
199 word_0_alt ~> word_0_wi
200 word_1_alt ~> word_1_wi
201 word_add_0 ~> add_0_left
202 word_add_0_right ~> add_0_right
203 word_mult_1 ~> mult_1_left
204 word_mult_1_right ~> mult_1_right
205 word_add_commute ~> add_commute
206 word_add_assoc ~> add_assoc
207 word_add_left_commute ~> add_left_commute
208 word_mult_commute ~> mult_commute
209 word_mult_assoc ~> mult_assoc
210 word_mult_left_commute ~> mult_left_commute
211 word_left_distrib ~> left_distrib
212 word_right_distrib ~> right_distrib
213 word_left_minus ~> left_minus
214 word_diff_0_right ~> diff_0_right
215 word_diff_self ~> diff_self
216 word_sub_def ~> diff_minus
217 word_diff_minus ~> diff_minus
218 word_add_ac ~> add_ac
219 word_mult_ac ~> mult_ac
220 word_plus_ac0 ~> add_0_left add_0_right add_ac
221 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
222 word_order_trans ~> order_trans
223 word_order_refl ~> order_refl
224 word_order_antisym ~> order_antisym
225 word_order_linear ~> linorder_linear
226 lenw1_zero_neq_one ~> zero_neq_one
227 word_number_of_eq ~> number_of_eq
228 word_of_int_add_hom ~> wi_hom_add
229 word_of_int_sub_hom ~> wi_hom_sub
230 word_of_int_mult_hom ~> wi_hom_mult
231 word_of_int_minus_hom ~> wi_hom_neg
232 word_of_int_succ_hom ~> wi_hom_succ
233 word_of_int_pred_hom ~> wi_hom_pred
234 word_of_int_0_hom ~> word_0_wi
235 word_of_int_1_hom ~> word_1_wi
237 * Clarified attribute "mono_set": pure declaration without modifying
238 the result of the fact expression.
240 * "Transitive_Closure.ntrancl": bounded transitive closure on
243 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
245 * "sublists" moved to theory More_List. INCOMPATIBILITY.
247 * Theory Int: Discontinued many legacy theorems specific to type int.
248 INCOMPATIBILITY, use the corresponding generic theorems instead.
250 zminus_zminus ~> minus_minus
251 zminus_0 ~> minus_zero
252 zminus_zadd_distrib ~> minus_add_distrib
253 zadd_commute ~> add_commute
254 zadd_assoc ~> add_assoc
255 zadd_left_commute ~> add_left_commute
259 zadd_0_right ~> add_0_right
260 zadd_zminus_inverse2 ~> left_minus
261 zmult_zminus ~> mult_minus_left
262 zmult_commute ~> mult_commute
263 zmult_assoc ~> mult_assoc
264 zadd_zmult_distrib ~> left_distrib
265 zadd_zmult_distrib2 ~> right_distrib
266 zdiff_zmult_distrib ~> left_diff_distrib
267 zdiff_zmult_distrib2 ~> right_diff_distrib
268 zmult_1 ~> mult_1_left
269 zmult_1_right ~> mult_1_right
270 zle_refl ~> order_refl
271 zle_trans ~> order_trans
272 zle_antisym ~> order_antisym
273 zle_linear ~> linorder_linear
274 zless_linear ~> linorder_less_linear
275 zadd_left_mono ~> add_left_mono
276 zadd_strict_right_mono ~> add_strict_right_mono
277 zadd_zless_mono ~> add_less_le_mono
278 int_0_less_1 ~> zero_less_one
279 int_0_neq_1 ~> zero_neq_one
281 zpower_zadd_distrib ~> power_add
282 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
283 zero_le_zpower_abs ~> zero_le_power_abs
285 * Theory Deriv: Renamed
287 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
289 * New "case_product" attribute to generate a case rule doing multiple
290 case distinctions at the same time. E.g.
292 list.exhaust [case_product nat.exhaust]
294 produces a rule which can be used to perform case distinction on both
297 * Improved code generation of multisets.
299 * New diagnostic command find_unused_assms to find potentially superfluous
300 assumptions in theorems using Quickcheck.
303 - Quickcheck returns variable assignments as counterexamples, which
304 allows to reveal the underspecification of functions under test.
305 For example, refuting "hd xs = x", it presents the variable
306 assignment xs = [] and x = a1 as a counterexample, assuming that
307 any property is false whenever "hd []" occurs in it.
308 These counterexample are marked as potentially spurious, as
309 Quickcheck also returns "xs = []" as a counterexample to the
310 obvious theorem "hd xs = hd xs".
311 After finding a potentially spurious counterexample, Quickcheck
312 continues searching for genuine ones.
313 By default, Quickcheck shows potentially spurious and genuine
314 counterexamples. The option "genuine_only" sets quickcheck to
315 only show genuine counterexamples.
317 - The command 'quickcheck_generator' creates random and exhaustive
318 value generators for a given type and operations.
319 It generates values by using the operations as if they were
320 constructors of that type.
322 - Support for multisets.
324 - Added "use_subtype" options.
327 - Fixed infinite loop caused by the 'peephole_optim' option and
328 affecting 'rat' and 'real'.
331 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
332 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
333 - Renamed "sound" option to "strict".
336 - Added possibility to specify lambda translations scheme as a
337 parenthesized argument (e.g., "by (metis (lifting) ...)").
340 - Renamed from 'try_methods'. INCOMPATIBILITY.
345 * New "case_product" attribute (see HOL).
350 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
351 conformance with similar operations in structure Term and Logic.
353 * Antiquotation @{attributes [...]} embeds attribute source
354 representation into the ML text, which is particularly useful with
355 declarations like Local_Theory.note.
357 * Structure Proof_Context follows standard naming scheme. Old
358 ProofContext has been discontinued. INCOMPATIBILITY.
360 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
361 change of semantics: update is applied to auxiliary local theory
364 * Modernized some old-style infix operations:
366 addeqcongs ~> Simplifier.add_eqcong
367 deleqcongs ~> Simplifier.del_eqcong
368 addcongs ~> Simplifier.add_cong
369 delcongs ~> Simplifier.del_cong
370 setmksimps ~> Simplifier.set_mksimps
371 setmkcong ~> Simplifier.set_mkcong
372 setmksym ~> Simplifier.set_mksym
373 setmkeqTrue ~> Simplifier.set_mkeqTrue
374 settermless ~> Simplifier.set_termless
375 setsubgoaler ~> Simplifier.set_subgoaler
376 addsplits ~> Splitter.add_split
377 delsplits ~> Splitter.del_split
381 New in Isabelle2011-1 (October 2011)
382 ------------------------------------
386 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
387 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
389 - Management of multiple theory files directly from the editor
390 buffer store -- bypassing the file-system (no requirement to save
393 - Markup of formal entities within the text buffer, with semantic
394 highlighting, tooltips and hyperlinks to jump to defining source
397 - Improved text rendering, with sub/superscripts in the source
398 buffer (including support for copy/paste wrt. output panel, HTML
399 theory output and other non-Isabelle text boxes).
401 - Refined scheduling of proof checking and printing of results,
402 based on interactive editor view. (Note: jEdit folding and
403 narrowing allows to restrict buffer perspectives explicitly.)
405 - Reduced CPU performance requirements, usable on machines with few
408 - Reduced memory requirements due to pruning of unused document
409 versions (garbage collection).
411 See also ~~/src/Tools/jEdit/README.html for further information,
412 including some remaining limitations.
414 * Theory loader: source files are exclusively located via the master
415 directory of each theory node (where the .thy file itself resides).
416 The global load path (such as src/HOL/Library) has been discontinued.
417 Note that the path element ~~ may be used to reference theories in the
418 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
421 * Theory loader: source files are identified by content via SHA1
422 digests. Discontinued former path/modtime identification and optional
423 ISABELLE_FILE_IDENT plugin scripts.
425 * Parallelization of nested Isar proofs is subject to
426 Goal.parallel_proofs_threshold (default 100). See also isabelle
429 * Name space: former unsynchronized references are now proper
430 configuration options, with more conventional names:
432 long_names ~> names_long
433 short_names ~> names_short
434 unique_names ~> names_unique
436 Minor INCOMPATIBILITY, need to declare options in context like this:
438 declare [[names_unique = false]]
440 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
441 that the result needs to be unique, which means fact specifications
442 may have to be refined after enriching a proof context.
444 * Attribute "case_names" has been refined: the assumptions in each case
445 can be named now by following the case name with [name1 name2 ...].
447 * Isabelle/Isar reference manual has been updated and extended:
448 - "Synopsis" provides a catalog of main Isar language concepts.
449 - Formal references in syntax diagrams, via @{rail} antiquotation.
450 - Updated material from classic "ref" manual, notably about
451 "Classical Reasoner".
456 * Class bot and top require underlying partial order rather than
457 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
459 * Class complete_lattice: generalized a couple of lemmas from sets;
460 generalized theorems INF_cong and SUP_cong. New type classes for
461 complete boolean algebras and complete linear orders. Lemmas
462 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
463 class complete_linorder.
465 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
466 Sup_fun_def, Inf_apply, Sup_apply.
468 Removed redundant lemmas (the right hand side gives hints how to
469 replace them for (metis ...), or (simp only: ...) proofs):
471 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
472 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
473 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
474 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
475 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
476 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
477 Inter_def ~> INF_def, image_def
478 Union_def ~> SUP_def, image_def
479 INT_eq ~> INF_def, and image_def
480 UN_eq ~> SUP_def, and image_def
481 INF_subset ~> INF_superset_mono [OF _ order_refl]
483 More consistent and comprehensive names:
485 INTER_eq_Inter_image ~> INF_def
486 UNION_eq_Union_image ~> SUP_def
490 INF_leI2 ~> INF_lower2
491 le_INFI ~> INF_greatest
493 le_SUPI2 ~> SUP_upper2
495 INFI_bool_eq ~> INF_bool_eq
496 SUPR_bool_eq ~> SUP_bool_eq
497 INFI_apply ~> INF_apply
498 SUPR_apply ~> SUP_apply
499 INTER_def ~> INTER_eq
500 UNION_def ~> UNION_eq
504 * Renamed theory Complete_Lattice to Complete_Lattices.
507 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
508 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
509 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
510 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
512 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
513 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
514 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
517 * Added syntactic classes "inf" and "sup" for the respective
518 constants. INCOMPATIBILITY: Changes in the argument order of the
519 (mostly internal) locale predicates for some derived classes.
521 * Theorem collections ball_simps and bex_simps do not contain theorems
522 referring to UNION any longer; these have been moved to collection
523 UN_ball_bex_simps. INCOMPATIBILITY.
525 * Theory Archimedean_Field: floor now is defined as parameter of a
526 separate type class floor_ceiling.
528 * Theory Finite_Set: more coherent development of fold_set locales:
530 locale fun_left_comm ~> locale comp_fun_commute
531 locale fun_left_comm_idem ~> locale comp_fun_idem
533 Both use point-free characterization; interpretation proofs may need
534 adjustment. INCOMPATIBILITY.
536 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
537 accordance with standard mathematical terminology. INCOMPATIBILITY.
539 * Theory Complex_Main: The locale interpretations for the
540 bounded_linear and bounded_bilinear locales have been removed, in
541 order to reduce the number of duplicate lemmas. Users must use the
542 original names for distributivity theorems, potential INCOMPATIBILITY.
544 divide.add ~> add_divide_distrib
545 divide.diff ~> diff_divide_distrib
546 divide.setsum ~> setsum_divide_distrib
547 mult.add_right ~> right_distrib
548 mult.diff_right ~> right_diff_distrib
549 mult_right.setsum ~> setsum_right_distrib
550 mult_left.diff ~> left_diff_distrib
552 * Theory Complex_Main: Several redundant theorems have been removed or
553 replaced by more general versions. INCOMPATIBILITY.
555 real_diff_def ~> minus_real_def
556 real_divide_def ~> divide_real_def
557 real_less_def ~> less_le
558 real_abs_def ~> abs_real_def
559 real_sgn_def ~> sgn_real_def
560 real_mult_commute ~> mult_commute
561 real_mult_assoc ~> mult_assoc
562 real_mult_1 ~> mult_1_left
563 real_add_mult_distrib ~> left_distrib
564 real_zero_not_eq_one ~> zero_neq_one
565 real_mult_inverse_left ~> left_inverse
566 INVERSE_ZERO ~> inverse_zero
567 real_le_refl ~> order_refl
568 real_le_antisym ~> order_antisym
569 real_le_trans ~> order_trans
570 real_le_linear ~> linear
571 real_le_eq_diff ~> le_iff_diff_le_0
572 real_add_left_mono ~> add_left_mono
573 real_mult_order ~> mult_pos_pos
574 real_mult_less_mono2 ~> mult_strict_left_mono
575 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
576 real_0_le_divide_iff ~> zero_le_divide_iff
577 realpow_two_disj ~> power2_eq_iff
578 real_squared_diff_one_factored ~> square_diff_one_factored
579 realpow_two_diff ~> square_diff_square_factored
580 reals_complete2 ~> complete_real
581 real_sum_squared_expand ~> power2_sum
582 exp_ln_eq ~> ln_unique
584 expi_zero ~> exp_zero
585 lemma_DERIV_subst ~> DERIV_cong
586 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
587 LIMSEQ_const ~> tendsto_const
588 LIMSEQ_norm ~> tendsto_norm
589 LIMSEQ_add ~> tendsto_add
590 LIMSEQ_minus ~> tendsto_minus
591 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
592 LIMSEQ_diff ~> tendsto_diff
593 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
594 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
595 LIMSEQ_mult ~> tendsto_mult
596 LIMSEQ_inverse ~> tendsto_inverse
597 LIMSEQ_divide ~> tendsto_divide
598 LIMSEQ_pow ~> tendsto_power
599 LIMSEQ_setsum ~> tendsto_setsum
600 LIMSEQ_setprod ~> tendsto_setprod
601 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
602 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
603 LIMSEQ_imp_rabs ~> tendsto_rabs
604 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
605 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
606 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
607 LIMSEQ_Complex ~> tendsto_Complex
608 LIM_ident ~> tendsto_ident_at
609 LIM_const ~> tendsto_const
610 LIM_add ~> tendsto_add
611 LIM_add_zero ~> tendsto_add_zero
612 LIM_minus ~> tendsto_minus
613 LIM_diff ~> tendsto_diff
614 LIM_norm ~> tendsto_norm
615 LIM_norm_zero ~> tendsto_norm_zero
616 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
617 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
618 LIM_rabs ~> tendsto_rabs
619 LIM_rabs_zero ~> tendsto_rabs_zero
620 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
621 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
622 LIM_compose ~> tendsto_compose
623 LIM_mult ~> tendsto_mult
624 LIM_scaleR ~> tendsto_scaleR
625 LIM_of_real ~> tendsto_of_real
626 LIM_power ~> tendsto_power
627 LIM_inverse ~> tendsto_inverse
628 LIM_sgn ~> tendsto_sgn
629 isCont_LIM_compose ~> isCont_tendsto_compose
630 bounded_linear.LIM ~> bounded_linear.tendsto
631 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
632 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
633 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
634 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
635 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
636 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
638 * Theory Complex_Main: The definition of infinite series was
639 generalized. Now it is defined on the type class {topological_space,
640 comm_monoid_add}. Hence it is useable also for extended real numbers.
642 * Theory Complex_Main: The complex exponential function "expi" is now
643 a type-constrained abbreviation for "exp :: complex => complex"; thus
644 several polymorphic lemmas about "exp" are now applicable to "expi".
648 - Theory Library/Code_Char_ord provides native ordering of
649 characters in the target language.
651 - Commands code_module and code_library are legacy, use export_code
654 - Method "evaluation" is legacy, use method "eval" instead.
656 - Legacy evaluator "SML" is deactivated by default. May be
657 reactivated by the following theory command:
659 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
661 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
663 * New proof method "induction" that gives induction hypotheses the
664 name "IH", thus distinguishing them from further hypotheses that come
665 from rule induction. The latter are still called "hyps". Method
666 "induction" is a thin wrapper around "induct" and follows the same
669 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
670 still available as a legacy feature for some time.
673 - Added "need" and "total_consts" options.
674 - Reintroduced "show_skolems" option by popular demand.
675 - Renamed attribute: nitpick_def ~> nitpick_unfold.
679 - Use quasi-sound (and efficient) translations by default.
680 - Added support for the following provers: E-ToFoF, LEO-II,
681 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
682 - Automatically preplay and minimize proofs before showing them if
683 this can be done within reasonable time.
684 - sledgehammer available_provers ~> sledgehammer supported_provers.
686 - Added "preplay_timeout", "slicing", "type_enc", "sound",
687 "max_mono_iters", and "max_new_mono_instances" options.
688 - Removed "explicit_apply" and "full_types" options as well as "Full
689 Types" Proof General menu item. INCOMPATIBILITY.
692 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
693 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
697 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
698 "elim:" options. INCOMPATIBILITY.
699 - Introduced 'try' that not only runs 'try_methods' but also
700 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
703 - Added "eval" option to evaluate terms for the found counterexample
704 (currently only supported by the default (exhaustive) tester).
705 - Added post-processing of terms to obtain readable counterexamples
706 (currently only supported by the default (exhaustive) tester).
707 - New counterexample generator quickcheck[narrowing] enables
708 narrowing-based testing. Requires the Glasgow Haskell compiler
709 with its installation location defined in the Isabelle settings
710 environment as ISABELLE_GHC.
711 - Removed quickcheck tester "SML" based on the SML code generator
712 (formly in HOL/Library).
714 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
715 use 'partial_function' instead.
717 * Theory Library/Extended_Reals replaces now the positive extended
718 reals found in probability theory. This file is extended by
719 Multivariate_Analysis/Extended_Real_Limits.
721 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
722 from where it must be imported explicitly if it is really required.
725 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
726 been moved here. INCOMPATIBILITY.
728 * Theory Library/Saturated provides type of numbers with saturated
731 * Theory Library/Product_Lattice defines a pointwise ordering for the
732 product type 'a * 'b, and provides instance proofs for various order
733 and lattice type classes.
735 * Theory Library/Countable now provides the "countable_datatype" proof
736 method for proving "countable" class instances for datatypes.
738 * Theory Library/Cset_Monad allows do notation for computable sets
739 (cset) via the generic monad ad-hoc overloading facility.
741 * Library: Theories of common data structures are split into theories
742 for implementation, an invariant-ensuring type, and connection to an
743 abstract type. INCOMPATIBILITY.
745 - RBT is split into RBT and RBT_Mapping.
746 - AssocList is split and renamed into AList and AList_Mapping.
747 - DList is split into DList_Impl, DList, and DList_Cset.
748 - Cset is split into Cset and List_Cset.
750 * Theory Library/Nat_Infinity has been renamed to
751 Library/Extended_Nat, with name changes of the following types and
754 type inat ~> type enat
756 Infty ~> infinity (overloaded)
760 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
761 been renamed accordingly. INCOMPATIBILITY.
763 * Session Multivariate_Analysis: The euclidean_space type class now
764 fixes a constant "Basis :: 'a set" consisting of the standard
765 orthonormal basis for the type. Users now have the option of
766 quantifying over this set instead of using the "basis" function, e.g.
767 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
769 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
770 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
771 "Cart_nth" and "Cart_lambda" have been respectively renamed to
772 "vec_nth" and "vec_lambda"; theorems mentioning those names have
773 changed to match. Definition theorems for overloaded constants now use
774 the standard "foo_vec_def" naming scheme. A few other theorems have
775 been renamed as follows (INCOMPATIBILITY):
777 Cart_eq ~> vec_eq_iff
778 dist_nth_le_cart ~> dist_vec_nth_le
779 tendsto_vector ~> vec_tendstoI
780 Cauchy_vector ~> vec_CauchyI
782 * Session Multivariate_Analysis: Several duplicate theorems have been
783 removed, and other theorems have been renamed or replaced with more
784 general versions. INCOMPATIBILITY.
786 finite_choice ~> finite_set_choice
787 eventually_conjI ~> eventually_conj
788 eventually_and ~> eventually_conj_iff
789 eventually_false ~> eventually_False
790 setsum_norm ~> norm_setsum
791 Lim_sequentially ~> LIMSEQ_def
792 Lim_ident_at ~> LIM_ident
793 Lim_const ~> tendsto_const
794 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
795 Lim_neg ~> tendsto_minus
796 Lim_add ~> tendsto_add
797 Lim_sub ~> tendsto_diff
798 Lim_mul ~> tendsto_scaleR
799 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
800 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
801 Lim_linear ~> bounded_linear.tendsto
802 Lim_component ~> tendsto_euclidean_component
803 Lim_component_cart ~> tendsto_vec_nth
804 Lim_inner ~> tendsto_inner [OF tendsto_const]
805 dot_lsum ~> inner_setsum_left
806 dot_rsum ~> inner_setsum_right
807 continuous_cmul ~> continuous_scaleR [OF continuous_const]
808 continuous_neg ~> continuous_minus
809 continuous_sub ~> continuous_diff
810 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
811 continuous_mul ~> continuous_scaleR
812 continuous_inv ~> continuous_inverse
813 continuous_at_within_inv ~> continuous_at_within_inverse
814 continuous_at_inv ~> continuous_at_inverse
815 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
816 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
817 continuous_at_component ~> continuous_component [OF continuous_at_id]
818 continuous_on_neg ~> continuous_on_minus
819 continuous_on_sub ~> continuous_on_diff
820 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
821 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
822 continuous_on_mul ~> continuous_on_scaleR
823 continuous_on_mul_real ~> continuous_on_mult
824 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
825 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
826 continuous_on_inverse ~> continuous_on_inv
827 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
828 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
829 subset_interior ~> interior_mono
830 subset_closure ~> closure_mono
831 closure_univ ~> closure_UNIV
832 real_arch_lt ~> reals_Archimedean2
833 real_arch ~> reals_Archimedean3
834 real_abs_norm ~> abs_norm_cancel
835 real_abs_sub_norm ~> norm_triangle_ineq3
836 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
838 * Session HOL-Probability:
839 - Caratheodory's extension lemma is now proved for ring_of_sets.
840 - Infinite products of probability measures are now available.
841 - Sigma closure is independent, if the generator is independent
842 - Use extended reals instead of positive extended
843 reals. INCOMPATIBILITY.
845 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
847 expand_fun_below ~> fun_below_iff
848 below_fun_ext ~> fun_belowI
849 expand_cfun_eq ~> cfun_eq_iff
851 expand_cfun_below ~> cfun_below_iff
852 below_cfun_ext ~> cfun_belowI
853 monofun_fun_fun ~> fun_belowD
854 monofun_fun_arg ~> monofunE
855 monofun_lub_fun ~> adm_monofun [THEN admD]
856 cont_lub_fun ~> adm_cont [THEN admD]
857 cont2cont_Rep_CFun ~> cont2cont_APP
858 cont_Rep_CFun_app ~> cont_APP_app
859 cont_Rep_CFun_app_app ~> cont_APP_app_app
860 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
861 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
862 contlub_cfun ~> lub_APP [symmetric]
863 contlub_LAM ~> lub_LAM [symmetric]
866 lift_distinct1 ~> lift.distinct(1)
867 lift_distinct2 ~> lift.distinct(2)
868 Def_not_UU ~> lift.distinct(2)
869 Def_inject ~> lift.inject
870 below_UU_iff ~> below_bottom_iff
871 eq_UU_iff ~> eq_bottom_iff
874 *** Document preparation ***
876 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
877 isar-ref manual, both for description and actual application of the
880 * Antiquotation @{value} evaluates the given term and presents its
883 * Antiquotations: term style "isub" provides ad-hoc conversion of
884 variables x1, y23 into subscripted form x\<^isub>1,
887 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
888 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
890 * Localized \isabellestyle switch can be used within blocks or groups
893 \isabellestyle{it} %preferred default
894 {\isabellestylett @{text "typewriter stuff"}}
896 * Discontinued special treatment of hard tabulators. Implicit
897 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
903 * The inner syntax of sort/type/term/prop supports inlined YXML
904 representations within quoted string tokens. By encoding logical
905 entities via Term_XML (in ML or Scala) concrete syntax can be
906 bypassed, which is particularly useful for producing bits of text
907 under external program control.
909 * Antiquotations for ML and document preparation are managed as theory
910 data, which requires explicit setup.
912 * Isabelle_Process.is_active allows tools to check if the official
913 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
914 (better known as Proof General).
916 * Structure Proof_Context follows standard naming scheme. Old
917 ProofContext is still available for some time as legacy alias.
919 * Structure Timing provides various operations for timing; supersedes
920 former start_timing/end_timing etc.
922 * Path.print is the official way to show file-system paths to users
923 (including quotes etc.).
925 * Inner syntax: identifiers in parse trees of generic categories
926 "logic", "aprop", "idt" etc. carry position information (disguised as
927 type constraints). Occasional INCOMPATIBILITY with non-compliant
928 translations that choke on unexpected type constraints. Positions can
929 be stripped in ML translations via Syntax.strip_positions /
930 Syntax.strip_positions_ast, or via the syntax constant
931 "_strip_positions" within parse trees. As last resort, positions can
932 be disabled via the configuration option Syntax.positions, which is
933 called "syntax_positions" in Isar attribute syntax.
935 * Discontinued special status of various ML structures that contribute
936 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
937 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
938 refer directly to Ast.Constant, Lexicon.is_identifier,
939 Syntax_Trans.mk_binder_tr etc.
941 * Typed print translation: discontinued show_sorts argument, which is
942 already available via context of "advanced" translation.
944 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
945 goal states; body tactic needs to address all subgoals uniformly.
947 * Slightly more special eq_list/eq_set, with shortcut involving
948 pointer equality (assumes that eq relation is reflexive).
950 * Classical tactics use proper Proof.context instead of historic types
951 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
952 operate directly on Proof.context. Raw type claset retains its use as
953 snapshot of the classical context, which can be recovered via
954 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
955 INCOMPATIBILITY, classical tactics and derived proof methods require
956 proper Proof.context.
961 * Discontinued support for Poly/ML 5.2, which was the last version
962 without proper multithreading and TimeLimit implementation.
964 * Discontinued old lib/scripts/polyml-platform, which has been
965 obsolete since Isabelle2009-2.
967 * Various optional external tools are referenced more robustly and
968 uniformly by explicit Isabelle settings as follows:
970 ISABELLE_CSDP (formerly CSDP_EXE)
971 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
972 ISABELLE_OCAML (formerly EXEC_OCAML)
973 ISABELLE_SWIPL (formerly EXEC_SWIPL)
974 ISABELLE_YAP (formerly EXEC_YAP)
976 Note that automated detection from the file-system or search path has
977 been discontinued. INCOMPATIBILITY.
979 * Scala layer provides JVM method invocation service for static
980 methods of type (String)String, see Invoke_Scala.method in ML. For
983 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
985 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
986 this allows to pass structured values between ML and Scala.
988 * The IsabelleText fonts includes some further glyphs to support the
989 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
990 installed a local copy (which is normally *not* required) need to
991 delete or update it from ~~/lib/fonts/.
995 New in Isabelle2011 (January 2011)
996 ----------------------------------
1000 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1001 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1002 useful tooltips and hyperlinks produced from its static analysis. The
1003 bundled component provides an executable Isabelle tool that can be run
1006 Isabelle2011/bin/isabelle jedit
1008 * Significantly improved Isabelle/Isar implementation manual.
1010 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1011 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1012 while the default heap location within that directory lacks that extra
1013 suffix. This isolates multiple Isabelle installations from each
1014 other, avoiding problems with old settings in new versions.
1015 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1017 * Source files are always encoded as UTF-8, instead of old-fashioned
1018 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1019 the following package declarations:
1021 \usepackage[utf8]{inputenc}
1022 \usepackage{textcomp}
1024 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1025 a Unicode character is treated as a single symbol, not a sequence of
1026 non-ASCII bytes as before. Since Isabelle/ML string literals may
1027 contain symbols without further backslash escapes, Unicode can now be
1028 used here as well. Recall that Symbol.explode in ML provides a
1029 consistent view on symbols, while raw explode (or String.explode)
1030 merely give a byte-oriented representation.
1032 * Theory loader: source files are primarily located via the master
1033 directory of each theory node (where the .thy file itself resides).
1034 The global load path is still partially available as legacy feature.
1035 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1036 explicit paths, relatively to the theory.
1038 * Special treatment of ML file names has been discontinued.
1039 Historically, optional extensions .ML or .sml were added on demand --
1040 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1041 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1043 * Various options that affect pretty printing etc. are now properly
1044 handled within the context via configuration options, instead of
1045 unsynchronized references or print modes. There are both ML Config.T
1046 entities and Isar declaration attributes to access these.
1048 ML (Config.T) Isar (attribute)
1050 eta_contract eta_contract
1051 show_brackets show_brackets
1052 show_sorts show_sorts
1053 show_types show_types
1054 show_question_marks show_question_marks
1055 show_consts show_consts
1056 show_abbrevs show_abbrevs
1058 Syntax.ast_trace syntax_ast_trace
1059 Syntax.ast_stat syntax_ast_stat
1060 Syntax.ambiguity_level syntax_ambiguity_level
1062 Goal_Display.goals_limit goals_limit
1063 Goal_Display.show_main_goal show_main_goal
1065 Method.rule_trace rule_trace
1067 Thy_Output.display thy_output_display
1068 Thy_Output.quotes thy_output_quotes
1069 Thy_Output.indent thy_output_indent
1070 Thy_Output.source thy_output_source
1071 Thy_Output.break thy_output_break
1073 Note that corresponding "..._default" references in ML may only be
1074 changed globally at the ROOT session setup, but *not* within a theory.
1075 The option "show_abbrevs" supersedes the former print mode
1076 "no_abbrevs" with inverted meaning.
1078 * More systematic naming of some configuration options.
1081 trace_simp ~> simp_trace
1082 debug_simp ~> simp_debug
1084 * Support for real valued configuration options, using simplistic
1085 floating-point notation that coincides with the inner syntax for
1088 * Support for real valued preferences (with approximative PGIP type):
1089 front-ends need to accept "pgint" values in float notation.
1092 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1095 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1100 * Command 'type_synonym' (with single argument) replaces somewhat
1101 outdated 'types', which is still available as legacy feature for some
1104 * Command 'nonterminal' (with 'and' separated list of arguments)
1105 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1107 * Command 'notepad' replaces former 'example_proof' for
1108 experimentation in Isar without any result. INCOMPATIBILITY.
1110 * Locale interpretation commands 'interpret' and 'sublocale' accept
1111 lists of equations to map definitions in a locale to appropriate
1112 entities in the context of the interpretation. The 'interpretation'
1113 command already provided this functionality.
1115 * Diagnostic command 'print_dependencies' prints the locale instances
1116 that would be activated if the specified expression was interpreted in
1117 the current context. Variant "print_dependencies!" assumes a context
1118 without interpretations.
1120 * Diagnostic command 'print_interps' prints interpretations in proofs
1121 in addition to interpretations in theories.
1123 * Discontinued obsolete 'global' and 'local' commands to manipulate
1124 the theory name space. Rare INCOMPATIBILITY. The ML functions
1125 Sign.root_path and Sign.local_path may be applied directly where this
1126 feature is still required for historical reasons.
1128 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1129 'definition' instead.
1131 * The "prems" fact, which refers to the accidental collection of
1132 foundational premises in the context, is now explicitly marked as
1133 legacy feature and will be discontinued soon. Consider using "assms"
1134 of the head statement or reference facts by explicit names.
1136 * Document antiquotations @{class} and @{type} print classes and type
1139 * Document antiquotation @{file} checks file/directory entries within
1140 the local file system.
1145 * Coercive subtyping: functions can be declared as coercions and type
1146 inference will add them as necessary upon input of a term. Theory
1147 Complex_Main declares real :: nat => real and real :: int => real as
1148 coercions. A coercion function f is declared like this:
1150 declare [[coercion f]]
1152 To lift coercions through type constructors (e.g. from nat => real to
1153 nat list => real list), map functions can be declared, e.g.
1155 declare [[coercion_map map]]
1157 Currently coercion inference is activated only in theories including
1158 real numbers, i.e. descendants of Complex_Main. This is controlled by
1159 the configuration option "coercion_enabled", e.g. it can be enabled in
1160 other theories like this:
1162 declare [[coercion_enabled]]
1164 * Command 'partial_function' provides basic support for recursive
1165 function definitions over complete partial orders. Concrete instances
1166 are provided for i) the option type, ii) tail recursion on arbitrary
1167 types, and iii) the heap monad of Imperative_HOL. See
1168 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1171 * Function package: f.psimps rules are no longer implicitly declared
1172 as [simp]. INCOMPATIBILITY.
1174 * Datatype package: theorems generated for executable equality (class
1175 "eq") carry proper names and are treated as default code equations.
1177 * Inductive package: now offers command 'inductive_simps' to
1178 automatically derive instantiated and simplified equations for
1179 inductive predicates, similar to 'inductive_cases'.
1181 * Command 'enriched_type' allows to register properties of the
1182 functorial structure of types.
1184 * Improved infrastructure for term evaluation using code generator
1185 techniques, in particular static evaluation conversions.
1187 * Code generator: Scala (2.8 or higher) has been added to the target
1190 * Code generator: globbing constant expressions "*" and "Theory.*"
1191 have been replaced by the more idiomatic "_" and "Theory._".
1194 * Code generator: export_code without explicit file declaration prints
1195 to standard output. INCOMPATIBILITY.
1197 * Code generator: do not print function definitions for case
1198 combinators any longer.
1200 * Code generator: simplification with rules determined with
1201 src/Tools/Code/code_simp.ML and method "code_simp".
1203 * Code generator for records: more idiomatic representation of record
1204 types. Warning: records are not covered by ancient SML code
1205 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1206 rep_datatype declaration helps to succeed then:
1210 rep_datatype foo_ext ...
1212 * Records: logical foundation type for records does not carry a
1213 '_type' suffix any longer (obsolete due to authentic syntax).
1216 * Quickcheck now by default uses exhaustive testing instead of random
1217 testing. Random testing can be invoked by "quickcheck [random]",
1218 exhaustive testing by "quickcheck [exhaustive]".
1220 * Quickcheck instantiates polymorphic types with small finite
1221 datatypes by default. This enables a simple execution mechanism to
1222 handle quantifiers and function equality over the finite datatypes.
1224 * Quickcheck random generator has been renamed from "code" to
1225 "random". INCOMPATIBILITY.
1227 * Quickcheck now has a configurable time limit which is set to 30
1228 seconds by default. This can be changed by adding [timeout = n] to the
1229 quickcheck command. The time limit for Auto Quickcheck is still set
1232 * Quickcheck in locales considers interpretations of that locale for
1233 counter example search.
1236 - Added "smt" and "remote_smt" provers based on the "smt" proof
1237 method. See the Sledgehammer manual for details ("isabelle doc
1240 sledgehammer atp_info ~> sledgehammer running_provers
1241 sledgehammer atp_kill ~> sledgehammer kill_provers
1242 sledgehammer available_atps ~> sledgehammer available_provers
1245 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1246 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1247 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1248 (and "ms" and "min" are no longer supported)
1253 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1254 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1256 - Added support for partial quotient types.
1257 - Added local versions of the "Nitpick.register_xxx" functions.
1258 - Added "whack" option.
1259 - Allow registration of quotient types as codatatypes.
1260 - Improved "merge_type_vars" option to merge more types.
1261 - Removed unsound "fast_descrs" option.
1262 - Added custom symmetry breaking for datatypes, making it possible to reach
1263 higher cardinalities.
1264 - Prevent the expansion of too large definitions.
1266 * Proof methods "metis" and "meson" now have configuration options
1267 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1268 to diagnose these tools. E.g.
1270 using [[metis_trace = true]]
1272 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1273 manually as command 'solve_direct'.
1275 * The default SMT solver Z3 must be enabled explicitly (due to
1276 licensing issues) by setting the environment variable
1277 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1278 commercial applications, the SMT solver CVC3 is provided as fall-back;
1279 changing the SMT solver is done via the configuration option
1282 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1283 i.e. "remote_cvc3" and "remote_z3".
1285 * Added basic SMT support for datatypes, records, and typedefs using
1286 the oracle mode (no proofs). Direct support of pairs has been dropped
1287 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1288 support for a similar behavior). Minor INCOMPATIBILITY.
1290 * Changed SMT configuration options:
1292 z3_proofs ~> smt_oracle (with inverted meaning)
1293 z3_trace_assms ~> smt_trace_used_facts
1306 * Boogie output files (.b2i files) need to be declared in the theory
1309 * Simplification procedure "list_to_set_comprehension" rewrites list
1310 comprehensions applied to List.set to set comprehensions. Occasional
1311 INCOMPATIBILITY, may be deactivated like this:
1313 declare [[simproc del: list_to_set_comprehension]]
1315 * Removed old version of primrec package. INCOMPATIBILITY.
1317 * Removed simplifier congruence rule of "prod_case", as has for long
1318 been the case with "split". INCOMPATIBILITY.
1320 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1322 * Removed [split_format ... and ... and ...] version of
1323 [split_format]. Potential INCOMPATIBILITY.
1325 * Predicate "sorted" now defined inductively, with nice induction
1326 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1328 * Constant "contents" renamed to "the_elem", to free the generic name
1329 contents for other uses. INCOMPATIBILITY.
1331 * Renamed class eq and constant eq (for code generation) to class
1332 equal and constant equal, plus renaming of related facts and various
1333 tuning. INCOMPATIBILITY.
1335 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1337 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1340 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1341 avoid confusion with finite sets. INCOMPATIBILITY.
1343 * Abandoned locales equiv, congruent and congruent2 for equivalence
1344 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1347 * Some previously unqualified names have been qualified:
1354 Trueprop ~> HOL.Trueprop
1359 op --> ~> HOL.implies
1371 Pair ~> Product_Type.Pair
1372 fst ~> Product_Type.fst
1373 snd ~> Product_Type.snd
1374 curry ~> Product_Type.curry
1376 Collect ~> Set.Collect
1380 * More canonical naming convention for some fundamental definitions:
1382 bot_bool_eq ~> bot_bool_def
1383 top_bool_eq ~> top_bool_def
1384 inf_bool_eq ~> inf_bool_def
1385 sup_bool_eq ~> sup_bool_def
1386 bot_fun_eq ~> bot_fun_def
1387 top_fun_eq ~> top_fun_def
1388 inf_fun_eq ~> inf_fun_def
1389 sup_fun_eq ~> sup_fun_def
1393 * More stylized fact names:
1395 expand_fun_eq ~> fun_eq_iff
1396 expand_set_eq ~> set_eq_iff
1398 nat_number ~> eval_nat_numeral
1402 * Refactoring of code-generation specific operations in theory List:
1408 mem_iff ~> member_def
1409 null_empty ~> null_def
1411 INCOMPATIBILITY. Note that these were not supposed to be used
1412 regularly unless for striking reasons; their main purpose was code
1415 Various operations from the Haskell prelude are used for generating
1418 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1419 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1420 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1422 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1423 "*" and "+" respectively. INCOMPATIBILITY.
1425 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1426 "Sum_Type.Plus" instead.
1428 * Constant "split" has been merged with constant "prod_case"; names of
1429 ML functions, facts etc. involving split have been retained so far,
1430 though. INCOMPATIBILITY.
1432 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1433 instead. INCOMPATIBILITY.
1435 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1438 * Former theory Library/Enum is now part of the HOL-Main image.
1439 INCOMPATIBILITY: all constants of the Enum theory now have to be
1440 referred to by its qualified name.
1443 nlists ~> Enum.nlists
1444 product ~> Enum.product
1446 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1447 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1450 * Theory Library/SetsAndFunctions has been split into
1451 Library/Function_Algebras and Library/Set_Algebras; canonical names
1452 for instance definitions for functions; various improvements.
1455 * Theory Library/Multiset provides stable quicksort implementation of
1458 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1461 * Session Multivariate_Analysis: introduced a type class for euclidean
1462 space. Most theorems are now stated in terms of euclidean spaces
1463 instead of finite cartesian products.
1466 real ^ 'n ~> 'a::real_vector
1467 ~> 'a::euclidean_space
1468 ~> 'a::ordered_euclidean_space
1469 (depends on your needs)
1473 \<chi> x. _ ~> \<chi>\<chi> x. _
1476 Also note that the indices are now natural numbers and not from some
1477 finite type. Finite cartesian products of euclidean spaces, products
1478 of euclidean spaces the real and complex numbers are instantiated to
1479 be euclidean_spaces. INCOMPATIBILITY.
1481 * Session Probability: introduced pextreal as positive extended real
1482 numbers. Use pextreal as value for measures. Introduce the
1483 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1484 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1485 the integral in Multivariate Analysis. INCOMPATIBILITY.
1487 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1490 * Session SPARK (with image HOL-SPARK) provides commands to load and
1491 prove verification conditions generated by the SPARK Ada program
1492 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1497 * Theorems for additive ring operations (locale abelian_monoid and
1498 descendants) are generated by interpretation from their multiplicative
1499 counterparts. Names (in particular theorem names) have the mandatory
1500 qualifier 'add'. Previous theorem names are redeclared for
1503 * Structure "int_ring" is now an abbreviation (previously a
1504 definition). This fits more natural with advanced interpretations.
1509 * The domain package now runs in definitional mode by default: The
1510 former command 'new_domain' is now called 'domain'. To use the domain
1511 package in its original axiomatic mode, use 'domain (unsafe)'.
1514 * The new class "domain" is now the default sort. Class "predomain"
1515 is an unpointed version of "domain". Theories can be updated by
1516 replacing sort annotations as shown below. INCOMPATIBILITY.
1518 'a::type ~> 'a::countable
1519 'a::cpo ~> 'a::predomain
1520 'a::pcpo ~> 'a::domain
1522 * The old type class "rep" has been superseded by class "domain".
1523 Accordingly, users of the definitional package must remove any
1524 "default_sort rep" declarations. INCOMPATIBILITY.
1526 * The domain package (definitional mode) now supports unpointed
1527 predomain argument types, as long as they are marked 'lazy'. (Strict
1528 arguments must be in class "domain".) For example, the following
1529 domain definition now works:
1531 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1533 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1534 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1535 'a option, and 'a list. Additionally, it configures fixrec and the
1536 domain package to work with these types. For example:
1538 fixrec isInl :: "('a + 'b) u -> tr"
1539 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1541 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1543 * The "(permissive)" option of fixrec has been replaced with a
1544 per-equation "(unchecked)" option. See
1545 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1547 * The "bifinite" class no longer fixes a constant "approx"; the class
1548 now just asserts that such a function exists. INCOMPATIBILITY.
1550 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1551 defines an embedding of type 'a defl into udom by default; instances
1552 of "bifinite" and "domain" classes are available in
1553 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1555 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1557 * The predicate "directed" has been removed. INCOMPATIBILITY.
1559 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1561 * The function "cprod_map" has been renamed to "prod_map".
1564 * The monadic bind operator on each powerdomain has new binder syntax
1565 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1566 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1568 * The infix syntax for binary union on each powerdomain has changed
1569 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1570 syntax. INCOMPATIBILITY.
1572 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1573 still supported as an input translation.
1575 * Renamed some theorems (the original names are also still available).
1577 expand_fun_below ~> fun_below_iff
1578 below_fun_ext ~> fun_belowI
1579 expand_cfun_eq ~> cfun_eq_iff
1580 ext_cfun ~> cfun_eqI
1581 expand_cfun_below ~> cfun_below_iff
1582 below_cfun_ext ~> cfun_belowI
1583 cont2cont_Rep_CFun ~> cont2cont_APP
1585 * The Abs and Rep functions for various types have changed names.
1586 Related theorem names have also changed to match. INCOMPATIBILITY.
1588 Rep_CFun ~> Rep_cfun
1589 Abs_CFun ~> Abs_cfun
1590 Rep_Sprod ~> Rep_sprod
1591 Abs_Sprod ~> Abs_sprod
1592 Rep_Ssum ~> Rep_ssum
1593 Abs_Ssum ~> Abs_ssum
1595 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1596 been renamed to *_bottom_iff. INCOMPATIBILITY.
1598 * Various changes to bisimulation/coinduction with domain package:
1600 - Definitions of "bisim" constants no longer mention definedness.
1601 - With mutual recursion, "bisim" predicate is now curried.
1602 - With mutual recursion, each type gets a separate coind theorem.
1603 - Variable names in bisim_def and coinduct rules have changed.
1607 * Case combinators generated by the domain package for type "foo" are
1608 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1610 * Several theorems have been renamed to more accurately reflect the
1611 names of constants and types involved. INCOMPATIBILITY.
1613 thelub_const ~> lub_const
1614 lub_const ~> is_lub_const
1616 is_lub_lub ~> is_lubD2
1618 unique_lub ~> is_lub_unique
1619 is_ub_lub ~> is_lub_rangeD1
1620 lub_bin_chain ~> is_lub_bin_chain
1621 lub_fun ~> is_lub_fun
1622 thelub_fun ~> lub_fun
1623 thelub_cfun ~> lub_cfun
1624 thelub_Pair ~> lub_Pair
1625 lub_cprod ~> is_lub_prod
1626 thelub_cprod ~> lub_prod
1627 minimal_cprod ~> minimal_prod
1628 inst_cprod_pcpo ~> inst_prod_pcpo
1630 compact_UU ~> compact_bottom
1631 deflation_UU ~> deflation_bottom
1632 finite_deflation_UU ~> finite_deflation_bottom
1634 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1636 sq_ord_less_eq_trans ~> below_eq_trans
1637 sq_ord_eq_less_trans ~> eq_below_trans
1638 refl_less ~> below_refl
1639 trans_less ~> below_trans
1640 antisym_less ~> below_antisym
1641 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1642 box_less ~> box_below
1643 rev_trans_less ~> rev_below_trans
1644 not_less2not_eq ~> not_below2not_eq
1645 less_UU_iff ~> below_UU_iff
1646 flat_less_iff ~> flat_below_iff
1647 adm_less ~> adm_below
1648 adm_not_less ~> adm_not_below
1649 adm_compact_not_less ~> adm_compact_not_below
1650 less_fun_def ~> below_fun_def
1651 expand_fun_less ~> fun_below_iff
1652 less_fun_ext ~> fun_belowI
1653 less_discr_def ~> below_discr_def
1654 discr_less_eq ~> discr_below_eq
1655 less_unit_def ~> below_unit_def
1656 less_cprod_def ~> below_prod_def
1657 prod_lessI ~> prod_belowI
1658 Pair_less_iff ~> Pair_below_iff
1659 fst_less_iff ~> fst_below_iff
1660 snd_less_iff ~> snd_below_iff
1661 expand_cfun_less ~> cfun_below_iff
1662 less_cfun_ext ~> cfun_belowI
1663 injection_less ~> injection_below
1664 less_up_def ~> below_up_def
1665 not_Iup_less ~> not_Iup_below
1666 Iup_less ~> Iup_below
1668 Def_inject_less_eq ~> Def_below_Def
1669 Def_less_is_eq ~> Def_below_iff
1670 spair_less_iff ~> spair_below_iff
1671 less_sprod ~> below_sprod
1672 spair_less ~> spair_below
1673 sfst_less_iff ~> sfst_below_iff
1674 ssnd_less_iff ~> ssnd_below_iff
1675 fix_least_less ~> fix_least_below
1676 dist_less_one ~> dist_below_one
1677 less_ONE ~> below_ONE
1678 ONE_less_iff ~> ONE_below_iff
1679 less_sinlD ~> below_sinlD
1680 less_sinrD ~> below_sinrD
1685 * All constant names are now qualified internally and use proper
1686 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1691 * Antiquotation @{assert} inlines a function bool -> unit that raises
1692 Fail if the argument is false. Due to inlining the source position of
1693 failed assertions is included in the error output.
1695 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1696 text is in practice always evaluated with a stable theory checkpoint.
1697 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1699 * Antiquotation @{theory A} refers to theory A from the ancestry of
1700 the current context, not any accidental theory loader state as before.
1701 Potential INCOMPATIBILITY, subtle change in semantics.
1703 * Syntax.pretty_priority (default 0) configures the required priority
1704 of pretty-printed output and thus affects insertion of parentheses.
1706 * Syntax.default_root (default "any") configures the inner syntax
1707 category (nonterminal symbol) for parsing of terms.
1709 * Former exception Library.UnequalLengths now coincides with
1710 ListPair.UnequalLengths.
1712 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1713 main functionality is provided by structure Simplifier.
1715 * Renamed raw "explode" function to "raw_explode" to emphasize its
1716 meaning. Note that internally to Isabelle, Symbol.explode is used in
1717 almost all situations.
1719 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1720 See implementation manual for further details on exceptions in
1723 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1726 * Renamed structure PureThy to Pure_Thy and moved most of its
1727 operations to structure Global_Theory, to emphasize that this is
1728 rarely-used global-only stuff.
1730 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1731 instead (or tracing for high-volume output).
1733 * Configuration option show_question_marks only affects regular pretty
1734 printing of types and terms, not raw Term.string_of_vname.
1736 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1737 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1738 @{thms} for most purposes.
1740 * ML structure Unsynchronized is never opened, not even in Isar
1741 interaction mode as before. Old Unsynchronized.set etc. have been
1742 discontinued -- use plain := instead. This should be *rare* anyway,
1743 since modern tools always work via official context data, notably
1744 configuration options.
1746 * Parallel and asynchronous execution requires special care concerning
1747 interrupts. Structure Exn provides some convenience functions that
1748 avoid working directly with raw Interrupt. User code must not absorb
1749 interrupts -- intermediate handling (for cleanup etc.) needs to be
1750 followed by re-raising of the original exception. Another common
1751 source of mistakes are "handle _" patterns, which make the meaning of
1752 the program subject to physical effects of the environment.
1756 New in Isabelle2009-2 (June 2010)
1757 ---------------------------------
1761 * Authentic syntax for *all* logical entities (type classes, type
1762 constructors, term constants): provides simple and robust
1763 correspondence between formal entities and concrete syntax. Within
1764 the parse tree / AST representations, "constants" are decorated by
1765 their category (class, type, const) and spelled out explicitly with
1766 their full internal name.
1768 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1769 and translations (translation rules and translation functions in ML).
1770 Some hints on upgrading:
1772 - Many existing uses of 'syntax' and 'translations' can be replaced
1773 by more modern 'type_notation', 'notation' and 'abbreviation',
1774 which are independent of this issue.
1776 - 'translations' require markup within the AST; the term syntax
1777 provides the following special forms:
1779 CONST c -- produces syntax version of constant c from context
1780 XCONST c -- literally c, checked as constant from context
1781 c -- literally c, if declared by 'syntax'
1783 Plain identifiers are treated as AST variables -- occasionally the
1784 system indicates accidental variables via the error "rhs contains
1787 Type classes and type constructors are marked according to their
1788 concrete syntax. Some old translations rules need to be written
1789 for the "type" category, using type constructor application
1790 instead of pseudo-term application of the default category
1793 - 'parse_translation' etc. in ML may use the following
1796 @{class_syntax c} -- type class c within parse tree / AST
1797 @{term_syntax c} -- type constructor c within parse tree / AST
1798 @{const_syntax c} -- ML version of "CONST c" above
1799 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1801 - Literal types within 'typed_print_translations', i.e. those *not*
1802 represented as pseudo-terms are represented verbatim. Use @{class
1803 c} or @{type_name c} here instead of the above syntax
1806 Note that old non-authentic syntax was based on unqualified base
1807 names, so all of the above "constant" names would coincide. Recall
1808 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1809 diagnose syntax problems.
1811 * Type constructors admit general mixfix syntax, not just infix.
1813 * Concrete syntax may be attached to local entities without a proof
1814 body, too. This works via regular mixfix annotations for 'fix',
1815 'def', 'obtain' etc. or via the explicit 'write' command, which is
1816 similar to the 'notation' command in theory specifications.
1818 * Discontinued unnamed infix syntax (legacy feature for many years) --
1819 need to specify constant name and syntax separately. Internal ML
1820 datatype constructors have been renamed from InfixName to Infix etc.
1821 Minor INCOMPATIBILITY.
1823 * Schematic theorem statements need to be explicitly markup as such,
1824 via commands 'schematic_lemma', 'schematic_theorem',
1825 'schematic_corollary'. Thus the relevance of the proof is made
1826 syntactically clear, which impacts performance in a parallel or
1827 asynchronous interactive environment. Minor INCOMPATIBILITY.
1829 * Use of cumulative prems via "!" in some proof methods has been
1830 discontinued (old legacy feature).
1832 * References 'trace_simp' and 'debug_simp' have been replaced by
1833 configuration options stored in the context. Enabling tracing (the
1834 case of debugging is similar) in proofs works via
1836 using [[trace_simp = true]]
1838 Tracing is then active for all invocations of the simplifier in
1839 subsequent goal refinement steps. Tracing may also still be enabled or
1840 disabled via the ProofGeneral settings menu.
1842 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1843 'hide_fact' replace the former 'hide' KIND command. Minor
1846 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1847 more efficient than combinations with -q1 or -q2.
1852 * Proofterms record type-class reasoning explicitly, using the
1853 "unconstrain" operation internally. This eliminates all sort
1854 constraints from a theorem and proof, introducing explicit
1855 OFCLASS-premises. On the proof term level, this operation is
1856 automatically applied at theorem boundaries, such that closed proofs
1857 are always free of sort constraints. INCOMPATIBILITY for tools that
1858 inspect proof terms.
1860 * Local theory specifications may depend on extra type variables that
1861 are not present in the result type -- arguments TYPE('a) :: 'a itself
1862 are added internally. For example:
1864 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1866 * Predicates of locales introduced by classes carry a mandatory
1867 "class" prefix. INCOMPATIBILITY.
1869 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1871 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1874 * Command 'code_reflect' allows to incorporate generated ML code into
1875 runtime environment; replaces immature code_datatype antiquotation.
1878 * Code generator: simple concept for abstract datatypes obeying
1881 * Code generator: details of internal data cache have no impact on the
1882 user space functionality any longer.
1884 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1885 subgoals. This is more appropriate for interpretations with 'where'.
1888 * Command 'example_proof' opens an empty proof body. This allows to
1889 experiment with Isar, without producing any persistent result.
1891 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1892 within a local theory context, with explicit checking of the
1893 constructors involved (in contrast to the raw 'syntax' versions).
1895 * Commands 'types' and 'typedecl' now work within a local theory
1896 context -- without introducing dependencies on parameters or
1897 assumptions, which is not possible in Isabelle/Pure.
1899 * Command 'defaultsort' has been renamed to 'default_sort', it works
1900 within a local theory context. Minor INCOMPATIBILITY.
1905 * Command 'typedef' now works within a local theory context -- without
1906 introducing dependencies on parameters or assumptions, which is not
1907 possible in Isabelle/Pure/HOL. Note that the logical environment may
1908 contain multiple interpretations of local typedefs (with different
1909 non-emptiness proofs), even in a global theory context.
1911 * New package for quotient types. Commands 'quotient_type' and
1912 'quotient_definition' may be used for defining types and constants by
1913 quotient constructions. An example is the type of integers created by
1914 quotienting pairs of natural numbers:
1917 intrel :: "(nat * nat) => (nat * nat) => bool"
1919 "intrel (x, y) (u, v) = (x + v = u + y)"
1921 quotient_type int = "nat * nat" / intrel
1922 by (auto simp add: equivp_def expand_fun_eq)
1925 "0::int" is "(0::nat, 0::nat)"
1927 The method "lifting" can be used to lift of theorems from the
1928 underlying "raw" type to the quotient type. The example
1929 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1930 construction and provides a reasoning infrastructure for finite sets.
1932 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1933 clash with new theory Quotient in Main HOL.
1935 * Moved the SMT binding into the main HOL session, eliminating
1936 separate HOL-SMT session.
1938 * List membership infix mem operation is only an input abbreviation.
1941 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1942 for future developements; former Library/Word.thy is still present in
1943 the AFP entry RSAPPS.
1945 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1946 longer shadowed. INCOMPATIBILITY.
1948 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1951 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1954 * Dropped normalizing_semiring etc; use the facts in semiring classes
1955 instead. INCOMPATIBILITY.
1957 * Dropped several real-specific versions of lemmas about floor and
1958 ceiling; use the generic lemmas from theory "Archimedean_Field"
1959 instead. INCOMPATIBILITY.
1961 floor_number_of_eq ~> floor_number_of
1962 le_floor_eq_number_of ~> number_of_le_floor
1963 le_floor_eq_zero ~> zero_le_floor
1964 le_floor_eq_one ~> one_le_floor
1965 floor_less_eq_number_of ~> floor_less_number_of
1966 floor_less_eq_zero ~> floor_less_zero
1967 floor_less_eq_one ~> floor_less_one
1968 less_floor_eq_number_of ~> number_of_less_floor
1969 less_floor_eq_zero ~> zero_less_floor
1970 less_floor_eq_one ~> one_less_floor
1971 floor_le_eq_number_of ~> floor_le_number_of
1972 floor_le_eq_zero ~> floor_le_zero
1973 floor_le_eq_one ~> floor_le_one
1974 floor_subtract_number_of ~> floor_diff_number_of
1975 floor_subtract_one ~> floor_diff_one
1976 ceiling_number_of_eq ~> ceiling_number_of
1977 ceiling_le_eq_number_of ~> ceiling_le_number_of
1978 ceiling_le_zero_eq ~> ceiling_le_zero
1979 ceiling_le_eq_one ~> ceiling_le_one
1980 less_ceiling_eq_number_of ~> number_of_less_ceiling
1981 less_ceiling_eq_zero ~> zero_less_ceiling
1982 less_ceiling_eq_one ~> one_less_ceiling
1983 ceiling_less_eq_number_of ~> ceiling_less_number_of
1984 ceiling_less_eq_zero ~> ceiling_less_zero
1985 ceiling_less_eq_one ~> ceiling_less_one
1986 le_ceiling_eq_number_of ~> number_of_le_ceiling
1987 le_ceiling_eq_zero ~> zero_le_ceiling
1988 le_ceiling_eq_one ~> one_le_ceiling
1989 ceiling_subtract_number_of ~> ceiling_diff_number_of
1990 ceiling_subtract_one ~> ceiling_diff_one
1992 * Theory "Finite_Set": various folding_XXX locales facilitate the
1993 application of the various fold combinators on finite sets.
1995 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1996 provides abstract red-black tree type which is backed by "RBT_Impl" as
1997 implementation. INCOMPATIBILTY.
1999 * Theory Library/Coinductive_List has been removed -- superseded by
2000 AFP/thys/Coinductive.
2002 * Theory PReal, including the type "preal" and related operations, has
2003 been removed. INCOMPATIBILITY.
2005 * Real: new development using Cauchy Sequences.
2007 * Split off theory "Big_Operators" containing setsum, setprod,
2008 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2010 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2011 "Int" etc. INCOMPATIBILITY.
2013 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2015 * New set of rules "ac_simps" provides combined assoc / commute
2016 rewrites for all interpretations of the appropriate generic locales.
2018 * Renamed theory "OrderedGroup" to "Groups" and split theory
2019 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2020 appropriate and more consistent names suitable for name prefixes
2021 within the HOL theories. INCOMPATIBILITY.
2023 * Some generic constants have been put to appropriate theories:
2024 - less_eq, less: Orderings
2025 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2026 - inverse, divide: Rings
2029 * More consistent naming of type classes involving orderings (and
2032 lower_semilattice ~> semilattice_inf
2033 upper_semilattice ~> semilattice_sup
2035 dense_linear_order ~> dense_linorder
2037 pordered_ab_group_add ~> ordered_ab_group_add
2038 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2039 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2040 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2041 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2042 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2043 pordered_cancel_semiring ~> ordered_cancel_semiring
2044 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2045 pordered_comm_ring ~> ordered_comm_ring
2046 pordered_comm_semiring ~> ordered_comm_semiring
2047 pordered_ring ~> ordered_ring
2048 pordered_ring_abs ~> ordered_ring_abs
2049 pordered_semiring ~> ordered_semiring
2051 ordered_ab_group_add ~> linordered_ab_group_add
2052 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2053 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2054 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2055 ordered_field ~> linordered_field
2056 ordered_field_no_lb ~> linordered_field_no_lb
2057 ordered_field_no_ub ~> linordered_field_no_ub
2058 ordered_field_dense_linear_order ~> dense_linordered_field
2059 ordered_idom ~> linordered_idom
2060 ordered_ring ~> linordered_ring
2061 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2062 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2063 ordered_ring_strict ~> linordered_ring_strict
2064 ordered_semidom ~> linordered_semidom
2065 ordered_semiring ~> linordered_semiring
2066 ordered_semiring_1 ~> linordered_semiring_1
2067 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2068 ordered_semiring_strict ~> linordered_semiring_strict
2070 The following slightly odd type classes have been moved to a
2071 separate theory Library/Lattice_Algebras:
2073 lordered_ab_group_add ~> lattice_ab_group_add
2074 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2075 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2076 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2077 lordered_ring ~> lattice_ring
2081 * Refined field classes:
2082 - classes division_ring_inverse_zero, field_inverse_zero,
2083 linordered_field_inverse_zero include rule inverse 0 = 0 --
2084 subsumes former division_by_zero class;
2085 - numerous lemmas have been ported from field to division_ring.
2088 * Refined algebra theorem collections:
2089 - dropped theorem group group_simps, use algebra_simps instead;
2090 - dropped theorem group ring_simps, use field_simps instead;
2091 - proper theorem collection field_simps subsumes former theorem
2092 groups field_eq_simps and field_simps;
2093 - dropped lemma eq_minus_self_iff which is a duplicate for
2097 * Theory Finite_Set and List: some lemmas have been generalized from
2100 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2101 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2102 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2103 union_Union_fold_union ~> sup_Sup_fold_sup
2104 Inter_fold_inter ~> Inf_fold_inf
2105 Union_fold_union ~> Sup_fold_sup
2106 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2107 union_UNION_fold_union ~> sup_SUPR_fold_sup
2108 INTER_fold_inter ~> INFI_fold_inf
2109 UNION_fold_union ~> SUPR_fold_sup
2111 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2112 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2113 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2114 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2115 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2116 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2118 * Reorganized theory Multiset: swapped notation of pointwise and
2121 - pointwise ordering is instance of class order with standard syntax
2123 - multiset ordering has syntax <=# and <#; partial order properties
2124 are provided by means of interpretation with prefix
2126 - less duplication, less historical organization of sections,
2127 conversion from associations lists to multisets, rudimentary code
2129 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2134 multiset_eq_conv_count_eq ~> multiset_ext_iff
2135 multi_count_ext ~> multiset_ext
2136 diff_union_inverse2 ~> diff_union_cancelR
2140 * Theory Permutation: replaced local "remove" by List.remove1.
2142 * Code generation: ML and OCaml code is decorated with signatures.
2144 * Theory List: added transpose.
2146 * Library/Nat_Bijection.thy is a collection of bijective functions
2147 between nat and other types, which supersedes the older libraries
2148 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2151 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2152 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2153 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2154 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2155 Countable.pair_encode ~> prod_encode
2156 NatIso.prod2nat ~> prod_encode
2157 NatIso.nat2prod ~> prod_decode
2158 NatIso.sum2nat ~> sum_encode
2159 NatIso.nat2sum ~> sum_decode
2160 NatIso.list2nat ~> list_encode
2161 NatIso.nat2list ~> list_decode
2162 NatIso.set2nat ~> set_encode
2163 NatIso.nat2set ~> set_decode
2166 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2167 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2168 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2169 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2170 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2171 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2172 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2173 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2174 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2175 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2176 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2177 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2178 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2181 - Renamed ATP commands:
2182 atp_info ~> sledgehammer running_atps
2183 atp_kill ~> sledgehammer kill_atps
2184 atp_messages ~> sledgehammer messages
2185 atp_minimize ~> sledgehammer minimize
2186 print_atps ~> sledgehammer available_atps
2188 - Added user's manual ("isabelle doc sledgehammer").
2189 - Added option syntax and "sledgehammer_params" to customize
2190 Sledgehammer's behavior. See the manual for details.
2191 - Modified the Isar proof reconstruction code so that it produces
2192 direct proofs rather than proofs by contradiction. (This feature
2193 is still experimental.)
2194 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2196 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2199 - Added and implemented "binary_ints" and "bits" options.
2200 - Added "std" option and implemented support for nonstandard models.
2201 - Added and implemented "finitize" option to improve the precision
2202 of infinite datatypes based on a monotonicity analysis.
2203 - Added support for quotient types.
2204 - Added support for "specification" and "ax_specification"
2206 - Added support for local definitions (for "function" and
2207 "termination" proofs).
2208 - Added support for term postprocessors.
2209 - Optimized "Multiset.multiset" and "FinFun.finfun".
2210 - Improved efficiency of "destroy_constrs" optimization.
2211 - Fixed soundness bugs related to "destroy_constrs" optimization and
2213 - Fixed soundness bug related to higher-order constructors.
2214 - Fixed soundness bug when "full_descrs" is enabled.
2215 - Improved precision of set constructs.
2216 - Added "atoms" option.
2217 - Added cache to speed up repeated Kodkod invocations on the same
2219 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2220 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2221 "SAT4J_Light". INCOMPATIBILITY.
2222 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2223 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2224 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2226 * Method "induct" now takes instantiations of the form t, where t is not
2227 a variable, as a shorthand for "x == t", where x is a fresh variable.
2228 If this is not intended, t has to be enclosed in parentheses.
2229 By default, the equalities generated by definitional instantiations
2230 are pre-simplified, which may cause parameters of inductive cases
2231 to disappear, or may even delete some of the inductive cases.
2232 Use "induct (no_simp)" instead of "induct" to restore the old
2233 behaviour. The (no_simp) option is also understood by the "cases"
2234 and "nominal_induct" methods, which now perform pre-simplification, too.
2240 * Variable names in lemmas generated by the domain package have
2241 changed; the naming scheme is now consistent with the HOL datatype
2242 package. Some proof scripts may be affected, INCOMPATIBILITY.
2244 * The domain package no longer defines the function "foo_copy" for
2245 recursive domain "foo". The reach lemma is now stated directly in
2246 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2247 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2249 * Most definedness lemmas generated by the domain package (previously
2250 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2251 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2252 Proofs that used definedness lemmas as intro rules may break,
2253 potential INCOMPATIBILITY.
2255 * Induction and casedist rules generated by the domain package now
2256 declare proper case_names (one called "bottom", and one named for each
2257 constructor). INCOMPATIBILITY.
2259 * For mutually-recursive domains, separate "reach" and "take_lemma"
2260 rules are generated for each domain, INCOMPATIBILITY.
2262 foo_bar.reach ~> foo.reach bar.reach
2263 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2265 * Some lemmas generated by the domain package have been renamed for
2266 consistency with the datatype package, INCOMPATIBILITY.
2268 foo.ind ~> foo.induct
2269 foo.finite_ind ~> foo.finite_induct
2270 foo.coind ~> foo.coinduct
2271 foo.casedist ~> foo.exhaust
2272 foo.exhaust ~> foo.nchotomy
2274 * For consistency with other definition packages, the fixrec package
2275 now generates qualified theorem names, INCOMPATIBILITY.
2277 foo_simps ~> foo.simps
2278 foo_unfold ~> foo.unfold
2279 foo_induct ~> foo.induct
2281 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2282 method and internal fixrec proofs now use the default simpset instead.
2285 * The "contlub" predicate has been removed. Proof scripts should use
2286 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2288 * The "admw" predicate has been removed, INCOMPATIBILITY.
2290 * The constants cpair, cfst, and csnd have been removed in favor of
2291 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2296 * Antiquotations for basic formal entities:
2298 @{class NAME} -- type class
2299 @{class_syntax NAME} -- syntax representation of the above
2301 @{type_name NAME} -- logical type
2302 @{type_abbrev NAME} -- type abbreviation
2303 @{nonterminal NAME} -- type of concrete syntactic category
2304 @{type_syntax NAME} -- syntax representation of any of the above
2306 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2307 @{const_abbrev NAME} -- abbreviated constant
2308 @{const_syntax NAME} -- syntax representation of any of the above
2310 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2311 syntax constant (cf. 'syntax' command).
2313 * Antiquotation @{make_string} inlines a function to print arbitrary
2314 values similar to the ML toplevel. The result is compiler dependent
2315 and may fall back on "?" in certain situations.
2317 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2318 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2319 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2320 not work with the asynchronous Isar document model.
2322 * Configuration options now admit dynamic default values, depending on
2323 the context or even global references.
2325 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2326 uses an efficient external library if available (for Poly/ML).
2328 * Renamed some important ML structures, while keeping the old names
2329 for some time as aliases within the structure Legacy:
2331 OuterKeyword ~> Keyword
2334 OuterSyntax ~> Outer_Syntax
2335 PrintMode ~> Print_Mode
2336 SpecParse ~> Parse_Spec
2339 ThyOutput ~> Thy_Output
2340 TypeInfer ~> Type_Infer
2342 Note that "open Legacy" simplifies porting of sources, but forgetting
2343 to remove it again will complicate porting again in the future.
2345 * Most operations that refer to a global context are named
2346 accordingly, e.g. Simplifier.global_context or
2347 ProofContext.init_global. There are some situations where a global
2348 context actually works, but under normal circumstances one needs to
2349 pass the proper local context through the code!
2351 * Discontinued old TheoryDataFun with its copy/init operation -- data
2352 needs to be pure. Functor Theory_Data_PP retains the traditional
2353 Pretty.pp argument to merge, which is absent in the standard
2354 Theory_Data version.
2356 * Sorts.certify_sort and derived "cert" operations for types and terms
2357 no longer minimize sorts. Thus certification at the boundary of the
2358 inference kernel becomes invariant under addition of class relations,
2359 which is an important monotonicity principle. Sorts are now minimized
2360 in the syntax layer only, at the boundary between the end-user and the
2361 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2362 explicitly in rare situations.
2364 * Renamed old-style Drule.standard to Drule.export_without_context, to
2365 emphasize that this is in no way a standard operation.
2368 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2369 usual for resolution. Rare INCOMPATIBILITY.
2371 * Renamed varify/unvarify operations to varify_global/unvarify_global
2372 to emphasize that these only work in a global situation (which is
2375 * Curried take and drop in library.ML; negative length is interpreted
2376 as infinity (as in chop). Subtle INCOMPATIBILITY.
2378 * Proof terms: type substitutions on proof constants now use canonical
2379 order of type variables. INCOMPATIBILITY for tools working with proof
2382 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2383 may no longer carry premises. User-level specifications are
2384 transformed accordingly by Thm.add_axiom/add_def.
2389 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2390 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2391 proof terms are enabled unconditionally in the new HOL-Proofs image.
2393 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2394 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2397 * Old lib/scripts/polyml-platform is superseded by the
2398 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2399 variant, even on a 64 bit machine. The following example setting
2400 prefers 64 bit if available:
2402 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2404 * The preliminary Isabelle/jEdit application demonstrates the emerging
2405 Isabelle/Scala layer for advanced prover interaction and integration.
2406 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2409 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2410 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2411 similar to the default assignment of the document preparation system
2412 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2413 provides some operations for direct access to the font without asking
2414 the user for manual installation.
2418 New in Isabelle2009-1 (December 2009)
2419 -------------------------------------
2423 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2424 one backslash should be used, even in ML sources.
2429 * Locale interpretation propagates mixins along the locale hierarchy.
2430 The currently only available mixins are the equations used to map
2431 local definitions to terms of the target domain of an interpretation.
2433 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2434 loc" to print all interpretations of locale "loc" in the theory.
2435 Interpretations in proofs are not shown.
2437 * Thoroughly revised locales tutorial. New section on conditional
2440 * On instantiation of classes, remaining undefined class parameters
2441 are formally declared. INCOMPATIBILITY.
2444 *** Document preparation ***
2446 * New generalized style concept for printing terms: @{foo (style) ...}
2447 instead of @{foo_style style ...} (old form is still retained for
2448 backward compatibility). Styles can be also applied for
2449 antiquotations prop, term_type and typeof.
2454 * New proof method "smt" for a combination of first-order logic with
2455 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2456 fixed-size bitvectors; there is also basic support for higher-order
2457 features (esp. lambda abstractions). It is an incomplete decision
2458 procedure based on external SMT solvers using the oracle mechanism;
2459 for the SMT solver Z3, this method is proof-producing. Certificates
2460 are provided to avoid calling the external solvers solely for
2461 re-checking proofs. Due to a remote SMT service there is no need for
2462 installing SMT solvers locally. See src/HOL/SMT.
2464 * New commands to load and prove verification conditions generated by
2465 the Boogie program verifier or derived systems (e.g. the Verifying C
2466 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2468 * New counterexample generator tool 'nitpick' based on the Kodkod
2469 relational model finder. See src/HOL/Tools/Nitpick and
2470 src/HOL/Nitpick_Examples.
2472 * New commands 'code_pred' and 'values' to invoke the predicate
2473 compiler and to enumerate values of inductive predicates.
2475 * A tabled implementation of the reflexive transitive closure.
2477 * New implementation of quickcheck uses generic code generator;
2478 default generators are provided for all suitable HOL types, records
2479 and datatypes. Old quickcheck can be re-activated importing theory
2480 Library/SML_Quickcheck.
2482 * New testing tool Mirabelle for automated proof tools. Applies
2483 several tools and tactics like sledgehammer, metis, or quickcheck, to
2484 every proof step in a theory. To be used in batch mode via the
2485 "mirabelle" utility.
2487 * New proof method "sos" (sum of squares) for nonlinear real
2488 arithmetic (originally due to John Harison). It requires theory
2489 Library/Sum_Of_Squares. It is not a complete decision procedure but
2490 works well in practice on quantifier-free real arithmetic with +, -,
2491 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2492 inequalities between polynomials. It makes use of external
2493 semidefinite programming solvers. Method "sos" generates a
2494 certificate that can be pasted into the proof thus avoiding the need
2495 to call an external tool every time the proof is checked. See
2496 src/HOL/Library/Sum_Of_Squares.
2498 * New method "linarith" invokes existing linear arithmetic decision
2501 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2503 * New Sledgehammer option "Full Types" in Proof General settings menu.
2504 Causes full type information to be output to the ATPs. This slows
2505 ATPs down considerably but eliminates a source of unsound "proofs"
2508 * New method "metisFT": A version of metis that uses full type
2509 information in order to avoid failures of proof reconstruction.
2511 * New evaluator "approximate" approximates an real valued term using
2512 the same method as the approximation method.
2514 * Method "approximate" now supports arithmetic expressions as
2515 boundaries of intervals and implements interval splitting and Taylor
2518 * ML antiquotation @{code_datatype} inserts definition of a datatype
2519 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2521 * New theory SupInf of the supremum and infimum operators for sets of
2524 * New theory Probability, which contains a development of measure
2525 theory, eventually leading to Lebesgue integration and probability.
2527 * Extended Multivariate Analysis to include derivation and Brouwer's
2530 * Reorganization of number theory, INCOMPATIBILITY:
2531 - new number theory development for nat and int, in theories Divides
2532 and GCD as well as in new session Number_Theory
2533 - some constants and facts now suffixed with _nat and _int
2535 - former session NumberTheory now named Old_Number_Theory, including
2536 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2537 - moved theory Pocklington from src/HOL/Library to
2538 src/HOL/Old_Number_Theory
2540 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2541 lcm of finite and infinite sets. It is shown that they form a complete
2544 * Class semiring_div requires superclass no_zero_divisors and proof of
2545 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2546 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2547 generalized to class semiring_div, subsuming former theorems
2548 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2549 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2552 * Refinements to lattice classes and sets:
2553 - less default intro/elim rules in locale variant, more default
2554 intro/elim rules in class variant: more uniformity
2555 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2557 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2559 - renamed ACI to inf_sup_aci
2560 - new class "boolean_algebra"
2561 - class "complete_lattice" moved to separate theory
2562 "Complete_Lattice"; corresponding constants (and abbreviations)
2563 renamed and with authentic syntax:
2564 Set.Inf ~> Complete_Lattice.Inf
2565 Set.Sup ~> Complete_Lattice.Sup
2566 Set.INFI ~> Complete_Lattice.INFI
2567 Set.SUPR ~> Complete_Lattice.SUPR
2568 Set.Inter ~> Complete_Lattice.Inter
2569 Set.Union ~> Complete_Lattice.Union
2570 Set.INTER ~> Complete_Lattice.INTER
2571 Set.UNION ~> Complete_Lattice.UNION
2572 - authentic syntax for
2575 - mere abbreviations:
2578 Set.inter (for inf, formerly Set.Int)
2579 Set.union (for sup, formerly Set.Un)
2580 Complete_Lattice.Inter (for Inf)
2581 Complete_Lattice.Union (for Sup)
2582 Complete_Lattice.INTER (for INFI)
2583 Complete_Lattice.UNION (for SUPR)
2584 - object-logic definitions as far as appropriate
2586 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2587 Un_subset_iff are explicitly deleted as default simp rules; then also
2588 their lattice counterparts le_inf_iff and le_sup_iff have to be
2589 deleted to achieve the desired effect.
2591 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2592 rules by default any longer; the same applies to min_max.inf_absorb1
2593 etc. INCOMPATIBILITY.
2595 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2596 pred_set_conv by default. INCOMPATIBILITY.
2598 * Power operations on relations and functions are now one dedicated
2599 constant "compow" with infix syntax "^^". Power operation on
2600 multiplicative monoids retains syntax "^" and is now defined generic
2601 in class power. INCOMPATIBILITY.
2603 * Relation composition "R O S" now has a more standard argument order:
2604 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2605 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2606 break, since the O_assoc rule was not rewritten like this. Fix using
2607 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2609 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2610 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2613 * Most rules produced by inductive and datatype package have mandatory
2614 prefixes. INCOMPATIBILITY.
2616 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2617 the attribute of the same name. Each of the theorems in the list
2618 DERIV_intros assumes composition with an additional function and
2619 matches a variable to the derivative, which has to be solved by the
2620 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2621 of most elementary terms. Former Maclauren.DERIV_tac and
2622 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2625 * Code generator attributes follow the usual underscore convention:
2626 code_unfold replaces code unfold
2627 code_post replaces code post
2632 sizechange -> size_change
2633 induct_scheme -> induction_schema
2636 * Discontinued abbreviation "arbitrary" of constant "undefined".
2637 INCOMPATIBILITY, use "undefined" directly.
2640 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2641 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2642 Suc_plus1 -> Suc_eq_plus1
2643 *anti_sym -> *antisym*
2644 vector_less_eq_def -> vector_le_def
2647 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2650 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2656 * Theory Representable defines a class "rep" of domains that are
2657 representable (via an ep-pair) in the universal domain type "udom".
2658 Instances are provided for all type constructors defined in HOLCF.
2660 * The 'new_domain' command is a purely definitional version of the
2661 domain package, for representable domains. Syntax is identical to the
2662 old domain package. The 'new_domain' package also supports indirect
2663 recursion using previously-defined type constructors. See
2664 src/HOLCF/ex/New_Domain.thy for examples.
2666 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2667 on the left-hand side of an equation, and then performs
2668 simplification. Rewriting is done using rules declared with the
2669 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2670 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2672 * The pattern-match compiler in 'fixrec' can now handle constructors
2673 with HOL function types. Pattern-match combinators for the Pair
2674 constructor are pre-configured.
2676 * The 'fixrec' package now produces better fixed-point induction rules
2677 for mutually-recursive definitions: Induction rules have conclusions
2678 of the form "P foo bar" instead of "P <foo, bar>".
2680 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2681 been renamed to "below". The name "below" now replaces "less" in many
2682 theorem names. (Legacy theorem names using "less" are still supported
2685 * The 'fixrec' package now supports "bottom patterns". Bottom
2686 patterns can be used to generate strictness rules, or to make
2687 functions more strict (much like the bang-patterns supported by the
2688 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2694 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2695 errors and run-time exceptions, including detailed source positions.
2697 * Structure Name_Space (formerly NameSpace) now manages uniquely
2698 identified entries, with some additional information such as source
2699 position, logical grouping etc.
2701 * Theory and context data is now introduced by the simplified and
2702 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2703 to be pure, but the old TheoryDataFun for mutable data (with explicit
2704 copy operation) is still available for some time.
2706 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2707 provides a high-level programming interface to synchronized state
2708 variables with atomic update. This works via pure function
2709 application within a critical section -- its runtime should be as
2710 short as possible; beware of deadlocks if critical code is nested,
2711 either directly or indirectly via other synchronized variables!
2713 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2714 wraps raw ML references, explicitly indicating their non-thread-safe
2715 behaviour. The Isar toplevel keeps this structure open, to
2716 accommodate Proof General as well as quick and dirty interactive
2717 experiments with references.
2719 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2720 parallel tactical reasoning.
2722 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2723 are similar to SUBPROOF, but are slightly more flexible: only the
2724 specified parts of the subgoal are imported into the context, and the
2725 body tactic may introduce new subgoals and schematic variables.
2727 * Old tactical METAHYPS, which does not observe the proof context, has
2728 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2729 or Subgoal.FOCUS etc.
2731 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2732 functors have their own ML name space there is no point to mark them
2733 separately.) Minor INCOMPATIBILITY.
2735 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2737 * Renamed several structures FooBar to Foo_Bar. Occasional,
2740 * Operations of structure Skip_Proof no longer require quick_and_dirty
2741 mode, which avoids critical setmp.
2743 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2744 combinators for "args". INCOMPATIBILITY, need to use simplified
2745 Attrib/Method.setup introduced in Isabelle2009.
2747 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2748 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2749 last resort. INCOMPATIBILITY.
2751 * Display.pretty_thm now requires a proper context (cf. former
2752 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2753 or even Display.pretty_thm_without_context as last resort.
2756 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2757 Syntax.pretty_typ/term directly, preferably with proper context
2758 instead of global theory.
2763 * Further fine tuning of parallel proof checking, scales up to 8 cores
2764 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2767 * Support for additional "Isabelle components" via etc/components, see
2768 also the system manual.
2770 * The isabelle makeall tool now operates on all components with
2771 IsaMakefile, not just hardwired "logics".
2773 * Removed "compress" option from isabelle-process and isabelle usedir;
2774 this is always enabled.
2776 * Discontinued support for Poly/ML 4.x versions.
2778 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2779 on a given logic image. This requires the lighttpd webserver and is
2780 currently supported on Linux only.
2784 New in Isabelle2009 (April 2009)
2785 --------------------------------
2789 * Simplified main Isabelle executables, with less surprises on
2790 case-insensitive file-systems (such as Mac OS).
2792 - The main Isabelle tool wrapper is now called "isabelle" instead of
2795 - The former "isabelle" alias for "isabelle-process" has been
2796 removed (should rarely occur to regular users).
2798 - The former "isabelle-interface" and its alias "Isabelle" have been
2799 removed (interfaces are now regular Isabelle tools).
2801 Within scripts and make files, the Isabelle environment variables
2802 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2803 respectively. (The latter are still available as legacy feature.)
2805 The old isabelle-interface wrapper could react in confusing ways if
2806 the interface was uninstalled or changed otherwise. Individual
2807 interface tool configuration is now more explicit, see also the
2808 Isabelle system manual. In particular, Proof General is now available
2809 via "isabelle emacs".
2811 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2812 purge installed copies of Isabelle executables and re-run "isabelle
2813 install -p ...", or use symlinks.
2815 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2816 old ~/isabelle, which was slightly non-standard and apt to cause
2817 surprises on case-insensitive file-systems (such as Mac OS).
2819 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2820 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2821 care is required when using older releases of Isabelle. Note that
2822 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2823 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2825 * Proofs of fully specified statements are run in parallel on
2826 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2827 a regular 4-core machine, if the initial heap space is made reasonably
2828 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2830 * The main reference manuals ("isar-ref", "implementation", and
2831 "system") have been updated and extended. Formally checked references
2832 as hyperlinks are now available uniformly.
2837 * Complete re-implementation of locales. INCOMPATIBILITY in several
2838 respects. The most important changes are listed below. See the
2839 Tutorial on Locales ("locales" manual) for details.
2841 - In locale expressions, instantiation replaces renaming. Parameters
2842 must be declared in a for clause. To aid compatibility with previous
2843 parameter inheritance, in locale declarations, parameters that are not
2844 'touched' (instantiation position "_" or omitted) are implicitly added
2845 with their syntax at the beginning of the for clause.
2847 - Syntax from abbreviations and definitions in locales is available in
2848 locale expressions and context elements. The latter is particularly
2849 useful in locale declarations.
2851 - More flexible mechanisms to qualify names generated by locale
2852 expressions. Qualifiers (prefixes) may be specified in locale
2853 expressions, and can be marked as mandatory (syntax: "name!:") or
2854 optional (syntax "name?:"). The default depends for plain "name:"
2855 depends on the situation where a locale expression is used: in
2856 commands 'locale' and 'sublocale' prefixes are optional, in
2857 'interpretation' and 'interpret' prefixes are mandatory. The old
2858 implicit qualifiers derived from the parameter names of a locale are
2859 no longer generated.
2861 - Command "sublocale l < e" replaces "interpretation l < e". The
2862 instantiation clause in "interpretation" and "interpret" (square
2863 brackets) is no longer available. Use locale expressions.
2865 - When converting proof scripts, mandatory qualifiers in
2866 'interpretation' and 'interpret' should be retained by default, even
2867 if this is an INCOMPATIBILITY compared to former behavior. In the
2868 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2869 in locale expressions range over a single locale instance only.
2871 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2872 In existing theorem specifications replace the includes element by the
2873 respective context elements of the included locale, omitting those
2874 that are already present in the theorem specification. Multiple
2875 assume elements of a locale should be replaced by a single one
2876 involving the locale predicate. In the proof body, declarations (most
2877 notably theorems) may be regained by interpreting the respective
2878 locales in the proof context as required (command "interpret").
2880 If using "includes" in replacement of a target solely because the
2881 parameter types in the theorem are not as general as in the target,
2882 consider declaring a new locale with additional type constraints on
2883 the parameters (context element "constrains").
2885 - Discontinued "locale (open)". INCOMPATIBILITY.
2887 - Locale interpretation commands no longer attempt to simplify goal.
2888 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2889 methods intro_locales and unfold_locales to clarify.
2891 - Locale interpretation commands no longer accept interpretation
2892 attributes. INCOMPATIBILITY.
2894 * Class declaration: so-called "base sort" must not be given in import
2895 list any longer, but is inferred from the specification. Particularly
2902 class foo = type + ...
2904 * Class target: global versions of theorems stemming do not carry a
2905 parameter prefix any longer. INCOMPATIBILITY.
2907 * Class 'instance' command no longer accepts attached definitions.
2908 INCOMPATIBILITY, use proper 'instantiation' target instead.
2910 * Recovered hiding of consts, which was accidentally broken in
2911 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2912 makes c inaccessible; consider using ``hide (open) const c'' instead.
2914 * Slightly more coherent Pure syntax, with updated documentation in
2915 isar-ref manual. Removed locales meta_term_syntax and
2916 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2917 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2918 directly in regular applications.
2920 * There is a new syntactic category "float_const" for signed decimal
2921 fractions (e.g. 123.45 or -123.45).
2923 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2924 interface with 'setup' command instead.
2926 * Command 'local_setup' is similar to 'setup', but operates on a local
2929 * The 'axiomatization' command now only works within a global theory
2930 context. INCOMPATIBILITY.
2932 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2933 hypotheses. Sorts required in the course of reasoning need to be
2934 covered by the constraints in the initial statement, completed by the
2935 type instance information of the background theory. Non-trivial sort
2936 hypotheses, which rarely occur in practice, may be specified via
2937 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2939 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2941 The result contains an implicit sort hypotheses as before --
2942 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2945 * Generalized Isar history, with support for linear undo, direct state
2948 * Changed defaults for unify configuration options:
2950 unify_trace_bound = 50 (formerly 25)
2951 unify_search_bound = 60 (formerly 30)
2953 * Different bookkeeping for code equations (INCOMPATIBILITY):
2955 a) On theory merge, the last set of code equations for a particular
2956 constant is taken (in accordance with the policy applied by other
2957 parts of the code generator framework).
2959 b) Code equations stemming from explicit declarations (e.g. code
2960 attribute) gain priority over default code equations stemming
2961 from definition, primrec, fun etc.
2963 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2965 * Unified theorem tables for both code generators. Thus [code
2966 func] has disappeared and only [code] remains. INCOMPATIBILITY.
2968 * Command 'find_consts' searches for constants based on type and name
2971 find_consts "_ => bool"
2973 By default, matching is against subtypes, but it may be restricted to
2974 the whole type. Searching by name is possible. Multiple queries are
2975 conjunctive and queries may be negated by prefixing them with a
2978 find_consts strict: "_ => bool" name: "Int" -"int => int"
2980 * New 'find_theorems' criterion "solves" matches theorems that
2981 directly solve the current goal (modulo higher-order unification).
2983 * Auto solve feature for main theorem statements: whenever a new goal
2984 is stated, "find_theorems solves" is called; any theorems that could
2985 solve the lemma directly are listed as part of the goal state.
2986 Cf. associated options in Proof General Isabelle settings menu,
2987 enabled by default, with reasonable timeout for pathological cases of
2988 higher-order unification.
2991 *** Document preparation ***
2993 * Antiquotation @{lemma} now imitates a regular terminal proof,
2994 demanding keyword 'by' and supporting the full method expression
2995 syntax just like the Isar command 'by'.
3000 * Integrated main parts of former image HOL-Complex with HOL. Entry
3001 points Main and Complex_Main remain as before.
3003 * Logic image HOL-Plain provides a minimal HOL with the most important
3004 tools available (inductive, datatype, primrec, ...). This facilitates
3005 experimentation and tool development. Note that user applications
3006 (and library theories) should never refer to anything below theory
3009 * Logic image HOL-Main stops at theory Main, and thus facilitates
3010 experimentation due to shorter build times.
3012 * Logic image HOL-NSA contains theories of nonstandard analysis which
3013 were previously part of former HOL-Complex. Entry point Hyperreal
3014 remains valid, but theories formerly using Complex_Main should now use
3015 new entry point Hypercomplex.
3017 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3018 Posix processes. Avoids potentially expensive forking of the ML
3019 process. New thread-based implementation also works on non-Unix
3020 platforms (Cygwin). Provers are no longer hardwired, but defined
3021 within the theory via plain ML wrapper functions. Basic Sledgehammer
3022 commands are covered in the isar-ref manual.
3024 * Wrapper scripts for remote SystemOnTPTP service allows to use
3025 sledgehammer without local ATP installation (Vampire etc.). Other
3026 provers may be included via suitable ML wrappers, see also
3027 src/HOL/ATP_Linkup.thy.
3029 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3032 * The metis method no longer fails because the theorem is too trivial
3033 (contains the empty clause).
3035 * The metis method now fails in the usual manner, rather than raising
3036 an exception, if it determines that it cannot prove the theorem.
3038 * Method "coherent" implements a prover for coherent logic (see also
3039 src/Tools/coherent.ML).
3041 * Constants "undefined" and "default" replace "arbitrary". Usually
3042 "undefined" is the right choice to replace "arbitrary", though
3043 logically there is no difference. INCOMPATIBILITY.
3045 * Command "value" now integrates different evaluation mechanisms. The
3046 result of the first successful evaluation mechanism is printed. In
3047 square brackets a particular named evaluation mechanisms may be
3048 specified (currently, [SML], [code] or [nbe]). See further
3049 src/HOL/ex/Eval_Examples.thy.
3051 * Normalization by evaluation now allows non-leftlinear equations.
3052 Declare with attribute [code nbe].
3054 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3055 as the structured Isar versions "cases" and "induct", cf. the
3056 corresponding "cases" and "induct" attributes. Mutual induction rules
3057 are now presented as a list of individual projections
3058 (e.g. foo_bar.inducts for types foo and bar); the old format with
3059 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3060 rare situations a different rule is selected --- notably nested tuple
3061 elimination instead of former prod.exhaust: use explicit (case_tac t
3062 rule: prod.exhaust) here.
3064 * Attributes "cases", "induct", "coinduct" support "del" option.
3066 * Removed fact "case_split_thm", which duplicates "case_split".
3068 * The option datatype has been moved to a new theory Option. Renamed
3069 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3071 * New predicate "strict_mono" classifies strict functions on partial
3072 orders. With strict functions on linear orders, reasoning about
3073 (in)equalities is facilitated by theorems "strict_mono_eq",
3074 "strict_mono_less_eq" and "strict_mono_less".
3076 * Some set operations are now proper qualified constants with
3077 authentic syntax. INCOMPATIBILITY:
3088 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3091 * Auxiliary class "itself" has disappeared -- classes without any
3092 parameter are treated as expected by the 'class' command.
3094 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3096 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3097 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3099 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3100 method "approximation". It proves formulas on real values by using
3101 interval arithmetic. In the formulas are also the transcendental
3102 functions sin, cos, tan, atan, ln, exp and the constant pi are
3103 allowed. For examples see
3104 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3106 * Theory "Reflection" now resides in HOL/Library.
3108 * Entry point to Word library now simply named "Word".
3111 * Made source layout more coherent with logical distribution
3114 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3115 src/HOL/Library/Code_Message.thy ~> src/HOL/
3116 src/HOL/Library/GCD.thy ~> src/HOL/
3117 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3118 src/HOL/Library/Parity.thy ~> src/HOL/
3119 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3120 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3121 src/HOL/Real/Lubs.thy ~> src/HOL/
3122 src/HOL/Real/PReal.thy ~> src/HOL/
3123 src/HOL/Real/Rational.thy ~> src/HOL/
3124 src/HOL/Real/RComplete.thy ~> src/HOL/
3125 src/HOL/Real/RealDef.thy ~> src/HOL/
3126 src/HOL/Real/RealPow.thy ~> src/HOL/
3127 src/HOL/Real/Real.thy ~> src/HOL/
3128 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3129 src/HOL/Complex/Complex.thy ~> src/HOL/
3130 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3131 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3132 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3133 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3134 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3135 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3136 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3137 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3138 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3139 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3140 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3141 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3142 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3143 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3144 src/HOL/Real/Float ~> src/HOL/Library/
3145 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3146 src/HOL/Real/RealVector.thy ~> src/HOL/
3148 src/HOL/arith_data.ML ~> src/HOL/Tools
3149 src/HOL/hologic.ML ~> src/HOL/Tools
3150 src/HOL/simpdata.ML ~> src/HOL/Tools
3151 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3152 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3153 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3154 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3155 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3156 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3157 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3159 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3160 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3161 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3162 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3163 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3164 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3166 * If methods "eval" and "evaluation" encounter a structured proof
3167 state with !!/==>, only the conclusion is evaluated to True (if
3168 possible), avoiding strange error messages.
3170 * Method "sizechange" automates termination proofs using (a
3171 modification of) the size-change principle. Requires SAT solver. See
3172 src/HOL/ex/Termination.thy for examples.
3174 * Simplifier: simproc for let expressions now unfolds if bound
3175 variable occurs at most once in let expression body. INCOMPATIBILITY.
3177 * Method "arith": Linear arithmetic now ignores all inequalities when
3178 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3180 * New attribute "arith" for facts that should always be used
3181 automatically by arithmetic. It is intended to be used locally in
3184 assumes [arith]: "x > 0"
3186 Global usage is discouraged because of possible performance impact.
3188 * New classes "top" and "bot" with corresponding operations "top" and
3189 "bot" in theory Orderings; instantiation of class "complete_lattice"
3190 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3192 * Changed definition lemma "less_fun_def" in order to provide an
3193 instance for preorders on functions; use lemma "less_le" instead.
3196 * Theory Orderings: class "wellorder" moved here, with explicit
3197 induction rule "less_induct" as assumption. For instantiation of
3198 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3201 * Theory Orderings: added class "preorder" as superclass of "order".
3202 INCOMPATIBILITY: Instantiation proofs for order, linorder
3203 etc. slightly changed. Some theorems named order_class.* now named
3206 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3209 * Theory Finite_Set: added a new fold combinator of type
3211 ('a => 'b => 'b) => 'b => 'a set => 'b
3213 Occasionally this is more convenient than the old fold combinator
3214 which is now defined in terms of the new one and renamed to
3217 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3218 and "ring_simps" have been replaced by "algebra_simps" (which can be
3219 extended with further lemmas!). At the moment both still exist but
3220 the former will disappear at some point.
3222 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3223 class recpower. Type-specific simp rules for various recpower types
3224 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3226 rat_power_0 -> power_0
3227 rat_power_Suc -> power_Suc
3228 realpow_0 -> power_0
3229 realpow_Suc -> power_Suc
3230 complexpow_0 -> power_0
3231 complexpow_Suc -> power_Suc
3232 power_poly_0 -> power_0
3233 power_poly_Suc -> power_Suc
3235 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3236 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3237 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3238 of lemmas from Divides has been generalized from nat to class
3239 semiring_div. INCOMPATIBILITY. This involves the following theorem
3240 renames resulting from duplicate elimination:
3242 dvd_def_mod ~> dvd_eq_mod_eq_0
3243 zero_dvd_iff ~> dvd_0_left_iff
3244 dvd_0 ~> dvd_0_right
3245 DIVISION_BY_ZERO_DIV ~> div_by_0
3246 DIVISION_BY_ZERO_MOD ~> mod_by_0
3247 mult_div ~> div_mult_self2_is_id
3248 mult_mod ~> mod_mult_self2_is_0
3250 * Theory IntDiv: removed many lemmas that are instances of class-based
3251 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3252 rename old lemmas as follows:
3254 dvd_diff -> nat_dvd_diff
3255 dvd_zminus_iff -> dvd_minus_iff
3256 mod_add1_eq -> mod_add_eq
3257 mod_mult1_eq -> mod_mult_right_eq
3258 mod_mult1_eq' -> mod_mult_left_eq
3259 mod_mult_distrib_mod -> mod_mult_eq
3260 nat_mod_add_left_eq -> mod_add_left_eq
3261 nat_mod_add_right_eq -> mod_add_right_eq
3262 nat_mod_div_trivial -> mod_div_trivial
3263 nat_mod_mod_trivial -> mod_mod_trivial
3264 zdiv_zadd_self1 -> div_add_self1
3265 zdiv_zadd_self2 -> div_add_self2
3266 zdiv_zmult_self1 -> div_mult_self2_is_id
3267 zdiv_zmult_self2 -> div_mult_self1_is_id
3268 zdvd_triv_left -> dvd_triv_left
3269 zdvd_triv_right -> dvd_triv_right
3270 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3271 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3272 zmod_zadd_left_eq -> mod_add_left_eq
3273 zmod_zadd_right_eq -> mod_add_right_eq
3274 zmod_zadd_self1 -> mod_add_self1
3275 zmod_zadd_self2 -> mod_add_self2
3276 zmod_zadd1_eq -> mod_add_eq
3277 zmod_zdiff1_eq -> mod_diff_eq
3278 zmod_zdvd_zmod -> mod_mod_cancel
3279 zmod_zmod_cancel -> mod_mod_cancel
3280 zmod_zmult_self1 -> mod_mult_self2_is_0
3281 zmod_zmult_self2 -> mod_mult_self1_is_0
3284 zdvd_abs1 -> abs_dvd_iff
3285 zdvd_abs2 -> dvd_abs_iff
3286 zdvd_refl -> dvd_refl
3287 zdvd_trans -> dvd_trans
3288 zdvd_zadd -> dvd_add
3289 zdvd_zdiff -> dvd_diff
3290 zdvd_zminus_iff -> dvd_minus_iff
3291 zdvd_zminus2_iff -> minus_dvd_iff
3292 zdvd_zmultD -> dvd_mult_right
3293 zdvd_zmultD2 -> dvd_mult_left
3294 zdvd_zmult_mono -> mult_dvd_mono
3295 zdvd_0_right -> dvd_0_right
3296 zdvd_0_left -> dvd_0_left_iff
3297 zdvd_1_left -> one_dvd
3298 zminus_dvd_iff -> minus_dvd_iff
3300 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3302 * The real numbers offer decimal input syntax: 12.34 is translated
3303 into 1234/10^2. This translation is not reversed upon output.
3305 * Theory Library/Polynomial defines an abstract type 'a poly of
3306 univariate polynomials with coefficients of type 'a. In addition to
3307 the standard ring operations, it also supports div and mod. Code
3308 generation is also supported, using list-style constructors.
3310 * Theory Library/Inner_Product defines a class of real_inner for real
3311 inner product spaces, with an overloaded operation inner :: 'a => 'a
3312 => real. Class real_inner is a subclass of real_normed_vector from
3315 * Theory Library/Product_Vector provides instances for the product
3316 type 'a * 'b of several classes from RealVector and Inner_Product.
3317 Definitions of addition, subtraction, scalar multiplication, norms,
3318 and inner products are included.
3320 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3321 addition to the field operations, numerals and case syntax are also
3324 * Theory Library/Diagonalize provides constructive version of Cantor's
3325 first diagonalization argument.
3327 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3328 zlcm (for int); carried together from various gcd/lcm developements in
3329 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3330 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3331 may recover tupled syntax as follows:
3333 hide (open) const gcd
3334 abbreviation gcd where
3335 "gcd == (%(a, b). GCD.gcd a b)"
3337 GCD.gcd ("gcd '(_, _')")
3339 The same works for lcm, zgcd, zlcm.
3341 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3342 instantiations for algebraic structures. Removed some duplicate
3343 theorems. Changes in simp rules. INCOMPATIBILITY.
3345 * ML antiquotation @{code} takes a constant as argument and generates
3346 corresponding code in background and inserts name of the corresponding
3347 resulting ML value/function/datatype constructor binding in place.
3348 All occurrences of @{code} with a single ML block are generated
3349 simultaneously. Provides a generic and safe interface for
3350 instrumentalizing code generation. See
3351 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3352 In future you ought to refrain from ad-hoc compiling generated SML
3353 code on the ML toplevel. Note that (for technical reasons) @{code}
3354 cannot refer to constants for which user-defined serializations are
3355 set. Refer to the corresponding ML counterpart directly in that
3358 * Command 'rep_datatype': instead of theorem names the command now
3359 takes a list of terms denoting the constructors of the type to be
3360 represented as datatype. The characteristic theorems have to be
3361 proven. INCOMPATIBILITY. Also observe that the following theorems
3362 have disappeared in favour of existing ones:
3364 unit_induct ~> unit.induct
3365 prod_induct ~> prod.induct
3366 sum_induct ~> sum.induct
3367 Suc_Suc_eq ~> nat.inject
3368 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3373 * New locales for orders and lattices where the equivalence relation
3374 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3375 locales use a record structure with field eq for the equivalence.
3377 * New theory of factorial domains.
3379 * Units_l_inv and Units_r_inv are now simp rules by default.
3380 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3381 and/or r_inv will now also require deletion of these lemmas.
3383 * Renamed the following theorems, INCOMPATIBILITY:
3385 UpperD ~> Upper_memD
3386 LowerD ~> Lower_memD
3387 least_carrier ~> least_closed
3388 greatest_carrier ~> greatest_closed
3389 greatest_Lower_above ~> greatest_Lower_below
3390 one_zero ~> carrier_one_zero
3391 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3396 * Nominal datatypes can now contain type-variables.
3398 * Commands 'nominal_inductive' and 'equivariance' work with local
3401 * Nominal primrec can now works with local theory targets and its
3402 specification syntax now conforms to the general format as seen in
3405 * Method "perm_simp" honours the standard simplifier attributes
3406 (no_asm), (no_asm_use) etc.
3408 * The new predicate #* is defined like freshness, except that on the
3409 left hand side can be a set or list of atoms.
3411 * Experimental command 'nominal_inductive2' derives strong induction
3412 principles for inductive definitions. In contrast to
3413 'nominal_inductive', which can only deal with a fixed number of
3414 binders, it can deal with arbitrary expressions standing for sets of
3415 atoms to be avoided. The only inductive definition we have at the
3416 moment that needs this generalisation is the typing rule for Lets in
3419 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3420 -----------------------------------------------------------------
3421 Gamma |- Let x be t1 in t2 : T2
3423 In this rule one wants to avoid all the binders that are introduced by
3424 "close Gamma T1". We are looking for other examples where this
3425 feature might be useful. Please let us know.
3430 * Reimplemented the simplification procedure for proving continuity
3431 subgoals. The new simproc is extensible; users can declare additional
3432 continuity introduction rules with the attribute [cont2cont].
3434 * The continuity simproc now uses a different introduction rule for
3435 solving continuity subgoals on terms with lambda abstractions. In
3436 some rare cases the new simproc may fail to solve subgoals that the
3437 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3438 Potential INCOMPATIBILITY.
3440 * Command 'fixrec': specification syntax now conforms to the general
3441 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3442 examples. INCOMPATIBILITY.
3447 * Proof of Zorn's Lemma for partial orders.
3452 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3453 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3454 depends on multithreading, so timouts will not work before Poly/ML
3457 * High-level support for concurrent ML programming, see
3458 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3459 particularly convenient to organize independent functional
3460 computations. The concept of "synchronized variables" provides a
3461 higher-order interface for components with shared state, avoiding the
3462 delicate details of mutexes and condition variables. (Requires
3463 Poly/ML 5.2.1 or later.)
3465 * ML bindings produced via Isar commands are stored within the Isar
3466 context (theory or proof). Consequently, commands like 'use' and 'ML'
3467 become thread-safe and work with undo as expected (concerning
3468 top-level bindings, not side-effects on global references).
3469 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3470 compiler at runtime; really global bindings need to be given outside a
3471 theory. (Requires Poly/ML 5.2 or later.)
3473 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3474 context. Top-level ML bindings are stored within the proof context in
3475 a purely sequential fashion, disregarding the nested proof structure.
3476 ML bindings introduced by 'ML_prf' are discarded at the end of the
3477 proof. (Requires Poly/ML 5.2 or later.)
3479 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3480 and Method.setup, as well as Isar commands 'attribute_setup' and
3481 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3482 existing code accordingly, or use plain 'setup' together with old
3485 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3486 to 'a -> thm, while results are always tagged with an authentic oracle
3487 name. The Isar command 'oracle' is now polymorphic, no argument type
3488 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3489 accordingly. Note that extra performance may be gained by producing
3490 the cterm carefully, avoiding slow Thm.cterm_of.
3492 * Simplified interface for defining document antiquotations via
3493 ThyOutput.antiquotation, ThyOutput.output, and optionally
3494 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3495 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3498 * More systematic treatment of long names, abstract name bindings, and
3499 name space operations. Basic operations on qualified names have been
3500 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3501 Long_Name.append. Old type bstring has been mostly replaced by
3502 abstract type binding (see structure Binding), which supports precise
3503 qualification by packages and local theory targets, as well as proper
3504 tracking of source positions. INCOMPATIBILITY, need to wrap old
3505 bstring values into Binding.name, or better pass through abstract
3506 bindings everywhere. See further src/Pure/General/long_name.ML,
3507 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3509 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3510 LocalTheory.note etc.) now refer to the *full* internal name, not the
3511 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3513 * Disposed old type and term read functions (Sign.read_def_typ,
3514 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3515 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3516 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3517 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3518 resort for legacy applications.
3520 * Disposed old declarations, tactics, tactic combinators that refer to
3521 the simpset or claset of an implicit theory (such as Addsimps,
3522 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3523 embedded ML text, or local_simpset_of with a proper context passed as
3524 explicit runtime argument.
3526 * Rules and tactics that read instantiations (read_instantiate,
3527 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3528 context, which is required for parsing and type-checking. Moreover,
3529 the variables are specified as plain indexnames, not string encodings
3530 thereof. INCOMPATIBILITY.
3532 * Generic Toplevel.add_hook interface allows to analyze the result of
3533 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3534 for theorem dependency output of transactions resulting in a new
3537 * ML antiquotations: block-structured compilation context indicated by
3538 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3540 @{binding name} - basic name binding
3541 @{let ?pat = term} - term abbreviation (HO matching)
3542 @{note name = fact} - fact abbreviation
3543 @{thm fact} - singleton fact (with attributes)
3544 @{thms fact} - general fact (with attributes)
3545 @{lemma prop by method} - singleton goal
3546 @{lemma prop by meth1 meth2} - singleton goal
3547 @{lemma prop1 ... propN by method} - general goal
3548 @{lemma prop1 ... propN by meth1 meth2} - general goal
3549 @{lemma (open) ...} - open derivation
3554 * The Isabelle "emacs" tool provides a specific interface to invoke
3555 Proof General / Emacs, with more explicit failure if that is not
3556 installed (the old isabelle-interface script silently falls back on
3557 isabelle-process). The PROOFGENERAL_HOME setting determines the
3558 installation location of the Proof General distribution.
3560 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3561 the Isabelle process into a JVM/Scala application. See
3562 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3563 process wrapper has been discontinued.)
3565 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3567 * Various status messages (with exact source position information) are
3568 emitted, if proper markup print mode is enabled. This allows
3569 user-interface components to provide detailed feedback on internal
3574 New in Isabelle2008 (June 2008)
3575 -------------------------------
3579 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3580 and updated, with formally checked references as hyperlinks.
3582 * Theory loader: use_thy (and similar operations) no longer set the
3583 implicit ML context, which was occasionally hard to predict and in
3584 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3585 provides a proper context already.
3587 * Theory loader: old-style ML proof scripts being *attached* to a thy
3588 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3589 'use' within a theory file will do the job.
3591 * Name space merge now observes canonical order, i.e. the second space
3592 is inserted into the first one, while existing entries in the first
3593 space take precedence. INCOMPATIBILITY in rare situations, may try to
3594 swap theory imports.
3596 * Syntax: symbol \<chi> is now considered a letter. Potential
3597 INCOMPATIBILITY in identifier syntax etc.
3599 * Outer syntax: string tokens no longer admit escaped white space,
3600 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3601 white space without escapes.
3603 * Outer syntax: string tokens may contain arbitrary character codes
3604 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3610 * Context-dependent token translations. Default setup reverts locally
3611 fixed variables, and adds hilite markup for undeclared frees.
3613 * Unused theorems can be found using the new command 'unused_thms'.
3614 There are three ways of invoking it:
3617 Only finds unused theorems in the current theory.
3619 (2) unused_thms thy_1 ... thy_n -
3620 Finds unused theorems in the current theory and all of its ancestors,
3621 excluding the theories thy_1 ... thy_n and all of their ancestors.
3623 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3624 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3625 their ancestors, excluding the theories thy_1 ... thy_n and all of
3628 In order to increase the readability of the list produced by
3629 unused_thms, theorems that have been created by a particular instance
3630 of a theory command such as 'inductive' or 'function' are considered
3631 to belong to the same "group", meaning that if at least one theorem in
3632 this group is used, the other theorems in the same group are no longer
3633 reported as unused. Moreover, if all theorems in the group are
3634 unused, only one theorem in the group is displayed.
3636 Note that proof objects have to be switched on in order for
3637 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3638 usually the case when using Proof General with the default settings).
3640 * Authentic naming of facts disallows ad-hoc overwriting of previous
3641 theorems within the same name space. INCOMPATIBILITY, need to remove
3642 duplicate fact bindings, or even accidental fact duplications. Note
3643 that tools may maintain dynamically scoped facts systematically, using
3644 PureThy.add_thms_dynamic.
3646 * Command 'hide' now allows to hide from "fact" name space as well.
3648 * Eliminated destructive theorem database, simpset, claset, and
3649 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3650 update of theories within ML code.
3652 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3653 INCOMPATIBILITY, object-logics depending on former Pure require
3654 additional setup PureThy.old_appl_syntax_setup; object-logics
3655 depending on former CPure need to refer to Pure.
3657 * Commands 'use' and 'ML' are now purely functional, operating on
3658 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3659 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3662 * Command 'setup': discontinued implicit version with ML reference.
3664 * Instantiation target allows for simultaneous specification of class
3665 instance operations together with an instantiation proof.
3666 Type-checking phase allows to refer to class operations uniformly.
3667 See src/HOL/Complex/Complex.thy for an Isar example and
3668 src/HOL/Library/Eval.thy for an ML example.
3670 * Indexing of literal facts: be more serious about including only
3671 facts from the visible specification/proof context, but not the
3672 background context (locale etc.). Affects `prop` notation and method
3673 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3676 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3677 "(open)" option, which used to expose internal bound variables to the
3680 * Isar statements: removed obsolete case "rule_context".
3681 INCOMPATIBILITY, better use explicit fixes/assumes.
3683 * Locale proofs: default proof step now includes 'unfold_locales';
3684 hence 'proof' without argument may be used to unfold locale
3688 *** Document preparation ***
3690 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3691 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3692 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3693 spot); renamed link color from "darkblue" to "linkcolor" (default
3694 value unchanged, can be redefined via \definecolor); no longer sets
3695 "a4paper" option (unnecessary or even intrusive).
3697 * Antiquotation @{lemma A method} proves proposition A by the given
3698 method (either a method name or a method name plus (optional) method
3699 arguments in parentheses) and prints A just like @{prop A}.
3704 * New primrec package. Specification syntax conforms in style to
3705 definition/function/.... No separate induction rule is provided. The
3706 "primrec" command distinguishes old-style and new-style specifications
3707 by syntax. The former primrec package is now named OldPrimrecPackage.
3708 When adjusting theories, beware: constants stemming from new-style
3709 primrec specifications have authentic syntax.
3711 * Metis prover is now an order of magnitude faster, and also works
3712 with multithreading.
3714 * Metis: the maximum number of clauses that can be produced from a
3715 theorem is now given by the attribute max_clauses. Theorems that
3716 exceed this number are ignored, with a warning printed.
3718 * Sledgehammer no longer produces structured proofs by default. To
3719 enable, declare [[sledgehammer_full = true]]. Attributes
3720 reconstruction_modulus, reconstruction_sorts renamed
3721 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3723 * Method "induct_scheme" derives user-specified induction rules
3724 from well-founded induction and completeness of patterns. This factors
3725 out some operations that are done internally by the function package
3726 and makes them available separately. See
3727 src/HOL/ex/Induction_Scheme.thy for examples.
3729 * More flexible generation of measure functions for termination
3730 proofs: Measure functions can be declared by proving a rule of the
3731 form "is_measure f" and giving it the [measure_function] attribute.
3732 The "is_measure" predicate is logically meaningless (always true), and
3733 just guides the heuristic. To find suitable measure functions, the
3734 termination prover sets up the goal "is_measure ?f" of the appropriate
3735 type and generates all solutions by prolog-style backwards proof using
3738 This setup also deals with rules like
3740 "is_measure f ==> is_measure (list_size f)"
3742 which accommodates nested datatypes that recurse through lists.
3743 Similar rules are predeclared for products and option types.
3745 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3749 - Definitions of overloaded constants on sets have to be replaced by
3750 definitions on => and bool.
3752 - Some definitions of overloaded operators on sets can now be proved
3753 using the definitions of the operators on => and bool. Therefore,
3754 the following theorems have been renamed:
3756 subset_def -> subset_eq
3757 psubset_def -> psubset_eq
3758 set_diff_def -> set_diff_eq
3759 Compl_def -> Compl_eq
3760 Sup_set_def -> Sup_set_eq
3761 Inf_set_def -> Inf_set_eq
3762 sup_set_def -> sup_set_eq
3763 inf_set_def -> inf_set_eq
3765 - Due to the incompleteness of the HO unification algorithm, some
3766 rules such as subst may require manual instantiation, if some of
3767 the unknowns in the rule is a set.
3769 - Higher order unification and forward proofs:
3772 have "P (S::'a set)" <...>
3773 then have "EX S. P S" ..
3775 no longer works (due to the incompleteness of the HO unification
3776 algorithm) and must be replaced by the pattern
3783 - Calculational reasoning with subst (or similar rules):
3786 have "P (S::'a set)" <...>
3787 also have "S = T" <...>
3788 finally have "P T" .
3790 no longer works (for similar reasons as the previous example) and
3791 must be replaced by something like
3793 have "P (S::'a set)" <...>
3794 moreover have "S = T" <...>
3795 ultimately have "P T" by simp
3797 - Tactics or packages written in ML code:
3798 Code performing pattern matching on types via
3800 Type ("set", [T]) => ...
3802 must be rewritten. Moreover, functions like strip_type or
3803 binder_types no longer return the right value when applied to a
3806 T1 => ... => Tn => U => bool
3810 T1 => ... => Tn => U set
3812 * Merged theories Wellfounded_Recursion, Accessible_Part and
3813 Wellfounded_Relations to theory Wellfounded.
3815 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3817 * Class finite no longer treats UNIV as class parameter. Use class
3818 enum from theory Library/Enum instead to achieve a similar effect.
3821 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3822 and "Cons". INCOMPATIBILITY.
3824 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3825 Potential INCOMPATIBILITY.
3827 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3828 injective_fst_snd removed, use split_eta and prod_eqI instead.
3829 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3831 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3832 the same name in theory Orderings:
3842 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3843 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3844 and different variable names.
3846 * Library/Option_ord.thy: Canonical order on option type.
3848 * Library/RBT.thy: Red-black trees, an efficient implementation of
3851 * Library/Countable.thy: Type class for countable types.
3853 * Theory Int: The representation of numerals has changed. The infix
3854 operator BIT and the bit datatype with constructors B0 and B1 have
3855 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3856 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3857 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3860 * Theory Nat: definition of <= and < on natural numbers no longer
3861 depend on well-founded relations. INCOMPATIBILITY. Definitions
3862 le_def and less_def have disappeared. Consider lemmas not_less
3863 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3865 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3866 (whose purpose mainly is for various fold_set functionals) have been
3867 abandoned in favor of the existing algebraic classes
3868 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3869 lower_semilattice (resp. upper_semilattice) and linorder.
3872 * Theory Transitive_Closure: induct and cases rules now declare proper
3873 case_names ("base" and "step"). INCOMPATIBILITY.
3875 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3876 lattices. The form set-specific version is available as
3877 Inductive.lfp_ordinal_induct_set.
3879 * Renamed theorems "power.simps" to "power_int.simps".
3882 * Class semiring_div provides basic abstract properties of semirings
3883 with division and modulo operations. Subsumes former class dvd_mod.
3885 * Merged theories IntDef, Numeral and IntArith into unified theory
3886 Int. INCOMPATIBILITY.
3888 * Theory Library/Code_Index: type "index" now represents natural
3889 numbers rather than integers. INCOMPATIBILITY.
3891 * New class "uminus" with operation "uminus" (split of from class
3892 "minus" which now only has operation "minus", binary).
3895 * Constants "card", "internal_split", "option_map" now with authentic
3896 syntax. INCOMPATIBILITY.
3898 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3899 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3900 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3901 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3902 Sup_set_def, le_def, less_def, option_map_def now with object
3903 equality. INCOMPATIBILITY.
3905 * Records. Removed K_record, and replaced it by pure lambda term
3906 %x. c. The simplifier setup is now more robust against eta expansion.
3907 INCOMPATIBILITY: in cases explicitly referring to K_record.
3909 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3911 * Library/ListVector: new theory of arithmetic vector operations.
3913 * Library/Order_Relation: new theory of various orderings as sets of
3914 pairs. Defines preorders, partial orders, linear orders and
3915 well-orders on sets and on types.
3920 * Renamed some theories to allow to loading both ZF and HOL in the
3923 Datatype -> Datatype_ZF
3924 Inductive -> Inductive_ZF
3931 INCOMPATIBILITY: ZF theories that import individual theories below
3932 Main might need to be adapted. Regular theory Main is still
3933 available, as trivial extension of Main_ZF.
3938 * ML within Isar: antiquotation @{const name} or @{const
3939 name(typargs)} produces statically-checked Const term.
3941 * Functor NamedThmsFun: data is available to the user as dynamic fact
3942 (of the same name). Removed obsolete print command.
3944 * Removed obsolete "use_legacy_bindings" function.
3946 * The ``print mode'' is now a thread-local value derived from a global
3947 template (the former print_mode reference), thus access becomes
3948 non-critical. The global print_mode reference is for session
3949 management only; user-code should use print_mode_value,
3950 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3952 * Functions system/system_out provide a robust way to invoke external
3953 shell commands, with propagation of interrupts (requires Poly/ML
3954 5.2.1). Do not use OS.Process.system etc. from the basis library!
3959 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3960 in accordance with Proof General 3.7, which prefers GNU emacs.
3962 * isatool tty runs Isabelle process with plain tty interaction;
3963 optional line editor may be specified via ISABELLE_LINE_EDITOR
3964 setting, the default settings attempt to locate "ledit" and "rlwrap".
3966 * isatool browser now works with Cygwin as well, using general
3967 "javapath" function defined in Isabelle process environment.
3969 * YXML notation provides a simple and efficient alternative to
3970 standard XML transfer syntax. See src/Pure/General/yxml.ML and
3971 isatool yxml as described in the Isabelle system manual.
3973 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
3974 provides general wrapper for managing an Isabelle process in a robust
3975 fashion, with ``cooked'' output from stdin/stderr.
3977 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
3978 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
3980 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
3981 way of changing the user's settings is via
3982 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
3985 * Multithreading.max_threads := 0 refers to the number of actual CPU
3986 cores of the underlying machine, which is a good starting point for
3987 optimal performance tuning. The corresponding usedir option -M allows
3988 "max" as an alias for "0". WARNING: does not work on certain versions
3989 of Mac OS (with Poly/ML 5.1).
3991 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3992 adverse effect of Isabelle flooding interactive front-ends (notably
3993 ProofGeneral / XEmacs).
3997 New in Isabelle2007 (November 2007)
3998 -----------------------------------
4002 * More uniform information about legacy features, notably a
4003 warning/error of "Legacy feature: ...", depending on the state of the
4004 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4005 legacy features will disappear eventually.
4007 * Theory syntax: the header format ``theory A = B + C:'' has been
4008 discontinued in favour of ``theory A imports B C begin''. Use isatool
4009 fixheaders to convert existing theory files. INCOMPATIBILITY.
4011 * Theory syntax: the old non-Isar theory file format has been
4012 discontinued altogether. Note that ML proof scripts may still be used
4013 with Isar theories; migration is usually quite simple with the ML
4014 function use_legacy_bindings. INCOMPATIBILITY.
4016 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4017 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4020 * Theory loader: be more serious about observing the static theory
4021 header specifications (including optional directories), but not the
4022 accidental file locations of previously successful loads. The strict
4023 update policy of former update_thy is now already performed by
4024 use_thy, so the former has been removed; use_thys updates several
4025 theories simultaneously, just as 'imports' within a theory header
4026 specification, but without merging the results. Potential
4027 INCOMPATIBILITY: may need to refine theory headers and commands
4028 ROOT.ML which depend on load order.
4030 * Theory loader: optional support for content-based file
4031 identification, instead of the traditional scheme of full physical
4032 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4033 (cf. the system manual). The new scheme allows to work with
4034 non-finished theories in persistent session images, such that source
4035 files may be moved later on without requiring reloads.
4037 * Theory loader: old-style ML proof scripts being *attached* to a thy
4038 file (with the same base name as the theory) are considered a legacy
4039 feature, which will disappear eventually. Even now, the theory loader
4040 no longer maintains dependencies on such files.
4042 * Syntax: the scope for resolving ambiguities via type-inference is
4043 now limited to individual terms, instead of whole simultaneous
4044 specifications as before. This greatly reduces the complexity of the
4045 syntax module and improves flexibility by separating parsing and
4046 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4047 'fixes' etc.) are required in rare situations.
4049 * Syntax: constants introduced by new-style packages ('definition',
4050 'abbreviation' etc.) are passed through the syntax module in
4051 ``authentic mode''. This means that associated mixfix annotations
4052 really stick to such constants, independently of potential name space
4053 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4054 trees are represented slightly differently, may need to adapt syntax
4055 translations accordingly. Use CONST marker in 'translations' and
4056 @{const_syntax} antiquotation in 'parse_translation' etc.
4058 * Legacy goal package: reduced interface to the bare minimum required
4059 to keep existing proof scripts running. Most other user-level
4060 functions are now part of the OldGoals structure, which is *not* open
4061 by default (consider isatool expandshort before open OldGoals).
4062 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4063 these tend to cause confusion about the actual goal (!) context being
4064 used here, which is not necessarily the same as the_context().
4066 * Command 'find_theorems': supports "*" wild-card in "name:"
4067 criterion; "with_dups" option. Certain ProofGeneral versions might
4068 support a specific search form (see ProofGeneral/CHANGES).
4070 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4071 by default, which means that "prems" (and also "fixed variables") are
4072 suppressed from proof state output. Note that the ProofGeneral
4073 settings mechanism allows to change and save options persistently, but
4074 older versions of Isabelle will fail to start up if a negative prems
4077 * Local theory targets may be specified by non-nested blocks of
4078 ``context/locale/class ... begin'' followed by ``end''. The body may
4079 contain definitions, theorems etc., including any derived mechanism
4080 that has been implemented on top of these primitives. This concept
4081 generalizes the existing ``theorem (in ...)'' towards more versatility
4084 * Proof General interface: proper undo of final 'end' command;
4085 discontinued Isabelle/classic mode (ML proof scripts).
4088 *** Document preparation ***
4090 * Added antiquotation @{theory name} which prints the given name,
4091 after checking that it refers to a valid ancestor theory in the
4094 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4095 check the given source text as ML type/structure, printing verbatim.
4097 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4098 "c args == rhs" given in the current context. (Any number of
4099 arguments may be given on the LHS.)
4104 * The 'class' package offers a combination of axclass and locale to
4105 achieve Haskell-like type classes in Isabelle. Definitions and
4106 theorems within a class context produce both relative results (with
4107 implicit parameters according to the locale context), and polymorphic
4108 constants with qualified polymorphism (according to the class
4109 context). Within the body context of a 'class' target, a separate
4110 syntax layer ("user space type system") takes care of converting
4111 between global polymorphic consts and internal locale representation.
4112 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4113 "isatool doc classes" provides a tutorial.
4115 * Generic code generator framework allows to generate executable
4116 code for ML and Haskell (including Isabelle classes). A short usage
4119 internal compilation:
4120 export_code <list of constants (term syntax)> in SML
4121 writing SML code to a file:
4122 export_code <list of constants (term syntax)> in SML <filename>
4123 writing OCaml code to a file:
4124 export_code <list of constants (term syntax)> in OCaml <filename>
4125 writing Haskell code to a bunch of files:
4126 export_code <list of constants (term syntax)> in Haskell <filename>
4128 evaluating closed propositions to True/False using code generation:
4131 Reasonable default setup of framework in HOL.
4133 Theorem attributs for selecting and transforming function equations theorems:
4135 [code fun]: select a theorem as function equation for a specific constant
4136 [code fun del]: deselect a theorem as function equation for a specific constant
4137 [code inline]: select an equation theorem for unfolding (inlining) in place
4138 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4140 User-defined serializations (target in {SML, OCaml, Haskell}):
4142 code_const <and-list of constants (term syntax)>
4143 {(target) <and-list of const target syntax>}+
4145 code_type <and-list of type constructors>
4146 {(target) <and-list of type target syntax>}+
4148 code_instance <and-list of instances>
4150 where instance ::= <type constructor> :: <class>
4152 code_class <and_list of classes>
4153 {(target) <and-list of class target syntax>}+
4154 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4156 code_instance and code_class only are effective to target Haskell.
4158 For example usage see src/HOL/ex/Codegenerator.thy and
4159 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4160 generation from Isabelle/HOL theories is available via "isatool doc
4163 * Code generator: consts in 'consts_code' Isar commands are now
4164 referred to by usual term syntax (including optional type
4167 * Command 'no_translations' removes translation rules from theory
4170 * Overloaded definitions are now actually checked for acyclic
4171 dependencies. The overloading scheme is slightly more general than
4172 that of Haskell98, although Isabelle does not demand an exact
4173 correspondence to type class and instance declarations.
4174 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4175 exotic versions of overloading -- at the discretion of the user!
4177 Polymorphic constants are represented via type arguments, i.e. the
4178 instantiation that matches an instance against the most general
4179 declaration given in the signature. For example, with the declaration
4180 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4181 as c(nat). Overloading is essentially simultaneous structural
4182 recursion over such type arguments. Incomplete specification patterns
4183 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4184 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4185 Command 'print_theory' outputs the normalized system of recursive
4186 equations, see section "definitions".
4188 * Configuration options are maintained within the theory or proof
4189 context (with name and type bool/int/string), providing a very simple
4190 interface to a poor-man's version of general context data. Tools may
4191 declare options in ML (e.g. using Attrib.config_int) and then refer to
4192 these values using Config.get etc. Users may change options via an
4193 associated attribute of the same name. This form of context
4194 declaration works particularly well with commands 'declare' or
4195 'using', for example ``declare [[foo = 42]]''. Thus it has become
4196 very easy to avoid global references, which would not observe Isar
4197 toplevel undo/redo and fail to work with multithreading.
4199 Various global ML references of Pure and HOL have been turned into
4200 configuration options:
4202 Unify.search_bound unify_search_bound
4203 Unify.trace_bound unify_trace_bound
4204 Unify.trace_simp unify_trace_simp
4205 Unify.trace_types unify_trace_types
4206 Simplifier.simp_depth_limit simp_depth_limit
4207 Blast.depth_limit blast_depth_limit
4208 DatatypeProp.dtK datatype_distinctness_limit
4209 fast_arith_neq_limit fast_arith_neq_limit
4210 fast_arith_split_limit fast_arith_split_limit
4212 * Named collections of theorems may be easily installed as context
4213 data using the functor NamedThmsFun (see also
4214 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4215 attributes; there is also a toplevel print command. This facility is
4216 just a common case of general context data, which is the preferred way
4217 for anything more complex than just a list of facts in canonical
4220 * Isar: command 'declaration' augments a local theory by generic
4221 declaration functions written in ML. This enables arbitrary content
4222 being added to the context, depending on a morphism that tells the
4223 difference of the original declaration context wrt. the application
4224 context encountered later on.
4226 * Isar: proper interfaces for simplification procedures. Command
4227 'simproc_setup' declares named simprocs (with match patterns, and body
4228 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4229 context. ML antiquotation @{simproc name} retrieves named simprocs.
4231 * Isar: an extra pair of brackets around attribute declarations
4232 abbreviates a theorem reference involving an internal dummy fact,
4233 which will be ignored later --- only the effect of the attribute on
4234 the background context will persist. This form of in-place
4235 declarations is particularly useful with commands like 'declare' and
4236 'using', for example ``have A using [[simproc a]] by simp''.
4238 * Isar: method "assumption" (and implicit closing of subproofs) now
4239 takes simple non-atomic goal assumptions into account: after applying
4240 an assumption as a rule the resulting subgoals are solved by atomic
4241 assumption steps. This is particularly useful to finish 'obtain'
4242 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4243 without referring to the original premise "!!x. P x ==> thesis" in the
4244 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4247 * Isar: implicit use of prems from the Isar proof context is
4248 considered a legacy feature. Common applications like ``have A .''
4249 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4250 referencing facts explicitly here improves readability and
4251 maintainability of proof texts.
4253 * Isar: improper proof element 'guess' is like 'obtain', but derives
4254 the obtained context from the course of reasoning! For example:
4256 assume "EX x y. A x & B y" -- "any previous fact"
4257 then guess x and y by clarify
4259 This technique is potentially adventurous, depending on the facts and
4260 proof tools being involved here.
4262 * Isar: known facts from the proof context may be specified as literal
4263 propositions, using ASCII back-quote syntax. This works wherever
4264 named facts used to be allowed so far, in proof commands, proof
4265 methods, attributes etc. Literal facts are retrieved from the context
4266 according to unification of type and term parameters. For example,
4267 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4268 theorems in the current context, then these are valid literal facts:
4269 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4271 There is also a proof method "fact" which does the same composition
4272 for explicit goal states, e.g. the following proof texts coincide with
4273 certain special cases of literal facts:
4275 have "A" by fact == note `A`
4276 have "A ==> B" by fact == note `A ==> B`
4277 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4278 have "P a ==> Q a" by fact == note `P a ==> Q a`
4280 * Isar: ":" (colon) is no longer a symbolic identifier character in
4281 outer syntax. Thus symbolic identifiers may be used without
4282 additional white space in declarations like this: ``assume *: A''.
4284 * Isar: 'print_facts' prints all local facts of the current context,
4285 both named and unnamed ones.
4287 * Isar: 'def' now admits simultaneous definitions, e.g.:
4289 def x == "t" and y == "u"
4291 * Isar: added command 'unfolding', which is structurally similar to
4292 'using', but affects both the goal state and facts by unfolding given
4293 rewrite rules. Thus many occurrences of the 'unfold' method or
4294 'unfolded' attribute may be replaced by first-class proof text.
4296 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4297 and command 'unfolding' now all support object-level equalities
4298 (potentially conditional). The underlying notion of rewrite rule is
4299 analogous to the 'rule_format' attribute, but *not* that of the
4300 Simplifier (which is usually more generous).
4302 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4303 premises of a theorem by n. Useful in conjunction with drule.
4305 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4306 method expression within a sandbox consisting of the first N
4307 sub-goals, which need to exist. For example, ``simp_all [3]''
4308 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4309 simplifies all new goals that emerge from applying rule foo to the
4310 originally first one.
4312 * Isar: schematic goals are no longer restricted to higher-order
4313 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4316 * Isar: the conclusion of a long theorem statement is now either
4317 'shows' (a simultaneous conjunction, as before), or 'obtains'
4318 (essentially a disjunction of cases with local parameters and
4319 assumptions). The latter allows to express general elimination rules
4320 adequately; in this notation common elimination rules look like this:
4322 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4324 obtains x where "P x"
4326 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4330 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4336 The subsequent classical rules even refer to the formal "thesis"
4339 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4342 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4343 obtains "thesis ==> something"
4345 The actual proof of an 'obtains' statement is analogous to that of the
4346 Isar proof element 'obtain', only that there may be several cases.
4347 Optional case names may be specified in parentheses; these will be
4348 available both in the present proof and as annotations in the
4349 resulting rule, for later use with the 'cases' method (cf. attribute
4352 * Isar: the assumptions of a long theorem statement are available as
4353 "assms" fact in the proof context. This is more appropriate than the
4354 (historical) "prems", which refers to all assumptions of the current
4355 context, including those from the target locale, proof body etc.
4357 * Isar: 'print_statement' prints theorems from the current theory or
4358 proof context in long statement form, according to the syntax of a
4361 * Isar: 'obtain' takes an optional case name for the local context
4362 introduction rule (default "that").
4364 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4365 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4368 * Pure: syntax "CONST name" produces a fully internalized constant
4369 according to the current context. This is particularly useful for
4370 syntax translations that should refer to internal constant
4371 representations independently of name spaces.
4373 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4374 instead of "FOO ". This allows multiple binder declarations to coexist
4375 in the same context. INCOMPATIBILITY.
4377 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4378 primitive that also works in a locale context (both for constants and
4379 fixed variables). Type declaration and internal syntactic representation
4380 of given constants retrieved from the context. Likewise, the
4381 'no_notation' command allows to remove given syntax annotations from the
4384 * Isar/locales: new derived specification elements 'axiomatization',
4385 'definition', 'abbreviation', which support type-inference, admit
4386 object-level specifications (equality, equivalence). See also the
4387 isar-ref manual. Examples:
4390 eq (infix "===" 50) where
4391 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4393 definition "f x y = x + y + 1"
4394 definition g where "g x = f x x"
4397 neq (infix "=!=" 50) where
4398 "x =!= y == ~ (x === y)"
4400 These specifications may be also used in a locale context. Then the
4401 constants being introduced depend on certain fixed parameters, and the
4402 constant name is qualified by the locale base name. An internal
4403 abbreviation takes care for convenient input and output, making the
4404 parameters implicit and using the original short name. See also
4405 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4406 entities from a monomorphic theory.
4408 Presently, abbreviations are only available 'in' a target locale, but
4409 not inherited by general import expressions. Also note that
4410 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4411 'translations' in common applications. The "no_abbrevs" print mode
4412 prevents folding of abbreviations in term output.
4414 Concrete syntax is attached to specified constants in internal form,
4415 independently of name spaces. The parse tree representation is
4416 slightly different -- use 'notation' instead of raw 'syntax', and
4417 'translations' with explicit "CONST" markup to accommodate this.
4419 * Pure/Isar: unified syntax for new-style specification mechanisms
4420 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4421 full type inference and dummy patterns ("_"). For example:
4423 definition "K x _ = x"
4425 inductive conj for A B
4426 where "A ==> B ==> conj A B"
4428 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4429 the current context. Print mode "no_abbrevs" prevents inversion of
4430 abbreviations on output.
4432 * Isar/locales: improved parameter handling: use of locales "var" and
4433 "struct" no longer necessary; - parameter renamings are no longer
4434 required to be injective. For example, this allows to define
4435 endomorphisms as locale endom = homom mult mult h.
4437 * Isar/locales: changed the way locales with predicates are defined.
4438 Instead of accumulating the specification, the imported expression is
4439 now an interpretation. INCOMPATIBILITY: different normal form of
4440 locale expressions. In particular, in interpretations of locales with
4441 predicates, goals repesenting already interpreted fragments are not
4442 removed automatically. Use methods `intro_locales' and
4443 `unfold_locales'; see below.
4445 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4446 provide backward reasoning on locales predicates. The methods are
4447 aware of interpretations and discharge corresponding goals.
4448 `intro_locales' is less aggressive then `unfold_locales' and does not
4449 unfold predicates to assumptions.
4451 * Isar/locales: the order in which locale fragments are accumulated
4452 has changed. This enables to override declarations from fragments due
4453 to interpretations -- for example, unwanted simp rules.
4455 * Isar/locales: interpretation in theories and proof contexts has been
4456 extended. One may now specify (and prove) equations, which are
4457 unfolded in interpreted theorems. This is useful for replacing
4458 defined concepts (constants depending on locale parameters) by
4459 concepts already existing in the target context. Example:
4461 interpretation partial_order ["op <= :: [int, int] => bool"]
4462 where "partial_order.less (op <=) (x::int) y = (x < y)"
4464 Typically, the constant `partial_order.less' is created by a
4465 definition specification element in the context of locale
4468 * Method "induct": improved internal context management to support
4469 local fixes and defines on-the-fly. Thus explicit meta-level
4470 connectives !! and ==> are rarely required anymore in inductive goals
4471 (using object-logic connectives for this purpose has been long
4472 obsolete anyway). Common proof patterns are explained in
4473 src/HOL/Induct/Common_Patterns.thy, see also
4474 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4477 * Method "induct": improved handling of simultaneous goals. Instead of
4478 introducing object-level conjunction, the statement is now split into
4479 several conclusions, while the corresponding symbolic cases are nested
4480 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4481 see src/HOL/Induct/Common_Patterns.thy, for example.
4483 * Method "induct": mutual induction rules are now specified as a list
4484 of rule sharing the same induction cases. HOL packages usually provide
4485 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4486 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4487 mutual induction rules differently, i.e. like this:
4489 (induct rule: foo_bar.inducts)
4490 (induct set: foo bar)
4491 (induct pred: foo bar)
4492 (induct type: foo bar)
4494 The ML function ProjectRule.projections turns old-style rules into the
4497 * Method "coinduct": dual of induction, see
4498 src/HOL/Library/Coinductive_List.thy for various examples.
4500 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4501 considered a legacy feature.
4503 * Attribute "symmetric" produces result with standardized schematic
4504 variables (index 0). Potential INCOMPATIBILITY.
4506 * Simplifier: by default the simplifier trace only shows top level
4507 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4508 default. Thus there is less danger of being flooded by the trace. The
4509 trace indicates where parts have been suppressed.
4511 * Provers/classical: removed obsolete classical version of elim_format
4512 attribute; classical elim/dest rules are now treated uniformly when
4513 manipulating the claset.
4515 * Provers/classical: stricter checks to ensure that supplied intro,
4516 dest and elim rules are well-formed; dest and elim rules must have at
4519 * Provers/classical: attributes dest/elim/intro take an optional
4520 weight argument for the rule (just as the Pure versions). Weights are
4521 ignored by automated tools, but determine the search order of single
4524 * Syntax: input syntax now supports dummy variable binding "%_. b",
4525 where the body does not mention the bound variable. Note that dummy
4526 patterns implicitly depend on their context of bounds, which makes
4527 "{_. _}" match any set comprehension as expected. Potential
4528 INCOMPATIBILITY -- parse translations need to cope with syntactic
4529 constant "_idtdummy" in the binding position.
4531 * Syntax: removed obsolete syntactic constant "_K" and its associated
4532 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4533 for example "A -> B" => "Pi A (%_. B)".
4535 * Pure: 'class_deps' command visualizes the subclass relation, using
4536 the graph browser tool.
4538 * Pure: 'print_theory' now suppresses certain internal declarations by
4539 default; use '!' option for full details.
4544 * Method "metis" proves goals by applying the Metis general-purpose
4545 resolution prover (see also http://gilith.com/software/metis/).
4546 Examples are in the directory MetisExamples. WARNING: the
4547 Isabelle/HOL-Metis integration does not yet work properly with
4550 * Command 'sledgehammer' invokes external automatic theorem provers as
4551 background processes. It generates calls to the "metis" method if
4552 successful. These can be pasted into the proof. Users do not have to
4553 wait for the automatic provers to return. WARNING: does not really
4554 work with multi-threading.
4556 * New "auto_quickcheck" feature tests outermost goal statements for
4557 potential counter-examples. Controlled by ML references
4558 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4559 5000 milliseconds). Fails silently if statements is outside of
4560 executable fragment, or any other codgenerator problem occurs.
4562 * New constant "undefined" with axiom "undefined x = undefined".
4564 * Added class "HOL.eq", allowing for code generation with polymorphic
4567 * Some renaming of class constants due to canonical name prefixing in
4568 the new 'class' package:
4570 HOL.abs ~> HOL.abs_class.abs
4571 HOL.divide ~> HOL.divide_class.divide
4572 0 ~> HOL.zero_class.zero
4573 1 ~> HOL.one_class.one
4574 op + ~> HOL.plus_class.plus
4575 op - ~> HOL.minus_class.minus
4576 uminus ~> HOL.minus_class.uminus
4577 op * ~> HOL.times_class.times
4578 op < ~> HOL.ord_class.less
4579 op <= > HOL.ord_class.less_eq
4580 Nat.power ~> Power.power_class.power
4581 Nat.size ~> Nat.size_class.size
4582 Numeral.number_of ~> Numeral.number_class.number_of
4583 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4584 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4585 Orderings.min ~> Orderings.ord_class.min
4586 Orderings.max ~> Orderings.ord_class.max
4587 Divides.op div ~> Divides.div_class.div
4588 Divides.op mod ~> Divides.div_class.mod
4589 Divides.op dvd ~> Divides.div_class.dvd
4591 INCOMPATIBILITY. Adaptions may be required in the following cases:
4593 a) User-defined constants using any of the names "plus", "minus",
4594 "times", "less" or "less_eq". The standard syntax translations for
4595 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4598 b) Variables named "plus", "minus", "times", "less", "less_eq"
4599 INCOMPATIBILITY: use more specific names.
4601 c) Permutative equations (e.g. "a + b = b + a")
4602 Since the change of names also changes the order of terms, permutative
4603 rewrite rules may get applied in a different order. Experience shows
4604 that this is rarely the case (only two adaptions in the whole Isabelle
4605 distribution). INCOMPATIBILITY: rewrite proofs
4607 d) ML code directly refering to constant names
4608 This in general only affects hand-written proof tactics, simprocs and
4609 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4610 Consider using @{const_name} antiquotation.
4612 * New class "default" with associated constant "default".
4614 * Function "sgn" is now overloaded and available on int, real, complex
4615 (and other numeric types), using class "sgn". Two possible defs of
4616 sgn are given as equational assumptions in the classes sgn_if and
4617 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4620 * Locale "partial_order" now unified with class "order" (cf. theory
4621 Orderings), added parameter "less". INCOMPATIBILITY.
4623 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4624 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4625 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4627 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4628 changed order of proof goals in instance proofs.
4630 * The transitivity reasoner for partial and linear orders is set up
4631 for classes "order" and "linorder". Instances of the reasoner are available
4632 in all contexts importing or interpreting the corresponding locales.
4633 Method "order" invokes the reasoner separately; the reasoner
4634 is also integrated with the Simplifier as a solver. Diagnostic
4635 command 'print_orders' shows the available instances of the reasoner
4636 in the current context.
4638 * Localized monotonicity predicate in theory "Orderings"; integrated
4639 lemmas max_of_mono and min_of_mono with this predicate.
4642 * Formulation of theorem "dense" changed slightly due to integration
4643 with new class dense_linear_order.
4645 * Uniform lattice theory development in HOL.
4647 constants "meet" and "join" now named "inf" and "sup"
4648 constant "Meet" now named "Inf"
4650 classes "meet_semilorder" and "join_semilorder" now named
4651 "lower_semilattice" and "upper_semilattice"
4652 class "lorder" now named "lattice"
4653 class "comp_lat" now named "complete_lattice"
4655 Instantiation of lattice classes allows explicit definitions
4656 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4658 INCOMPATIBILITY. Theorem renames:
4660 meet_left_le ~> inf_le1
4661 meet_right_le ~> inf_le2
4662 join_left_le ~> sup_ge1
4663 join_right_le ~> sup_ge2
4664 meet_join_le ~> inf_sup_ord
4667 le_meet ~> le_inf_iff
4668 le_join ~> ge_sup_conv
4669 meet_idempotent ~> inf_idem
4670 join_idempotent ~> sup_idem
4671 meet_comm ~> inf_commute
4672 join_comm ~> sup_commute
4673 meet_leI1 ~> le_infI1
4674 meet_leI2 ~> le_infI2
4675 le_joinI1 ~> le_supI1
4676 le_joinI2 ~> le_supI2
4677 meet_assoc ~> inf_assoc
4678 join_assoc ~> sup_assoc
4679 meet_left_comm ~> inf_left_commute
4680 meet_left_idempotent ~> inf_left_idem
4681 join_left_comm ~> sup_left_commute
4682 join_left_idempotent ~> sup_left_idem
4685 le_def_meet ~> le_iff_inf
4686 le_def_join ~> le_iff_sup
4687 join_absorp2 ~> sup_absorb2
4688 join_absorp1 ~> sup_absorb1
4689 meet_absorp1 ~> inf_absorb1
4690 meet_absorp2 ~> inf_absorb2
4691 meet_join_absorp ~> inf_sup_absorb
4692 join_meet_absorp ~> sup_inf_absorb
4693 distrib_join_le ~> distrib_sup_le
4694 distrib_meet_le ~> distrib_inf_le
4696 add_meet_distrib_left ~> add_inf_distrib_left
4697 add_join_distrib_left ~> add_sup_distrib_left
4698 is_join_neg_meet ~> is_join_neg_inf
4699 is_meet_neg_join ~> is_meet_neg_sup
4700 add_meet_distrib_right ~> add_inf_distrib_right
4701 add_join_distrib_right ~> add_sup_distrib_right
4702 add_meet_join_distribs ~> add_sup_inf_distribs
4703 join_eq_neg_meet ~> sup_eq_neg_inf
4704 meet_eq_neg_join ~> inf_eq_neg_sup
4705 add_eq_meet_join ~> add_eq_inf_sup
4706 meet_0_imp_0 ~> inf_0_imp_0
4707 join_0_imp_0 ~> sup_0_imp_0
4708 meet_0_eq_0 ~> inf_0_eq_0
4709 join_0_eq_0 ~> sup_0_eq_0
4710 neg_meet_eq_join ~> neg_inf_eq_sup
4711 neg_join_eq_meet ~> neg_sup_eq_inf
4712 join_eq_if ~> sup_eq_if
4714 mono_meet ~> mono_inf
4715 mono_join ~> mono_sup
4716 meet_bool_eq ~> inf_bool_eq
4717 join_bool_eq ~> sup_bool_eq
4718 meet_fun_eq ~> inf_fun_eq
4719 join_fun_eq ~> sup_fun_eq
4720 meet_set_eq ~> inf_set_eq
4721 join_set_eq ~> sup_set_eq
4722 meet1_iff ~> inf1_iff
4723 meet2_iff ~> inf2_iff
4732 join1_iff ~> sup1_iff
4733 join2_iff ~> sup2_iff
4743 is_meet_Meet ~> is_meet_Inf
4744 Meet_bool_def ~> Inf_bool_def
4745 Meet_fun_def ~> Inf_fun_def
4746 Meet_greatest ~> Inf_greatest
4747 Meet_lower ~> Inf_lower
4748 Meet_set_def ~> Inf_set_def
4751 Sup_bool_eq ~> Sup_bool_def
4752 Sup_fun_eq ~> Sup_fun_def
4753 Sup_set_eq ~> Sup_set_def
4755 listsp_meetI ~> listsp_infI
4756 listsp_meet_eq ~> listsp_inf_eq
4761 * Added syntactic class "size"; overloaded constant "size" now has
4762 type "'a::size ==> bool"
4764 * Internal reorganisation of `size' of datatypes: size theorems
4765 "foo.size" are no longer subsumed by "foo.simps" (but are still
4766 simplification rules by default!); theorems "prod.size" now named
4769 * Class "div" now inherits from class "times" rather than "type".
4772 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4773 Linorder etc. have disappeared; operations defined in terms of
4774 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4776 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4778 * HOL-Word: New extensive library and type for generic, fixed size
4779 machine words, with arithemtic, bit-wise, shifting and rotating
4780 operations, reflection into int, nat, and bool lists, automation for
4781 linear arithmetic (by automatic reflection into nat or int), including
4782 lemmas on overflow and monotonicity. Instantiated to all appropriate
4783 arithmetic type classes, supporting automatic simplification of
4784 numerals on all operations.
4786 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4788 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4790 * Code generator library theories:
4791 - Code_Integer represents HOL integers by big integer literals in target
4793 - Code_Char represents HOL characters by character literals in target
4795 - Code_Char_chr like Code_Char, but also offers treatment of character
4796 codes; includes Code_Integer.
4797 - Executable_Set allows to generate code for finite sets using lists.
4798 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4800 - Executable_Real implements a subset of real numbers, namly those
4801 representable by rational numbers.
4802 - Efficient_Nat implements natural numbers by integers, which in general will
4803 result in higher efficency; pattern matching with 0/Suc is eliminated;
4804 includes Code_Integer.
4805 - Code_Index provides an additional datatype index which is mapped to
4806 target-language built-in integers.
4807 - Code_Message provides an additional datatype message_string which is isomorphic to
4808 strings; messages are mapped to target-language strings.
4810 * New package for inductive predicates
4812 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4815 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4816 for z_1 :: U_1 and ... and z_n :: U_m
4818 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4821 with full support for type-inference, rather than
4823 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4825 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4826 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4828 inductive "s z_1 ... z_m"
4830 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4833 For backward compatibility, there is a wrapper allowing inductive
4834 sets to be defined with the new package via
4837 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4838 for z_1 :: U_1 and ... and z_n :: U_m
4840 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4846 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4847 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4848 for z_1 :: U_1 and ... and z_n :: U_m
4850 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4851 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4854 if the additional syntax "p ..." is required.
4856 Numerous examples can be found in the subdirectories src/HOL/Auth,
4857 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4861 - Since declaration and definition of inductive sets or predicates
4862 is no longer separated, abbreviations involving the newly
4863 introduced sets or predicates must be specified together with the
4864 introduction rules after the 'where' keyword (see above), rather
4865 than before the actual inductive definition.
4867 - The variables in induction and elimination rules are now
4868 quantified in the order of their occurrence in the introduction
4869 rules, rather than in alphabetical order. Since this may break
4870 some proofs, these proofs either have to be repaired, e.g. by
4871 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4872 statements of the form
4874 case (rule_i a_i_1 ... a_i_{k_i})
4876 or the old order of quantification has to be restored by explicitly adding
4877 meta-level quantifiers in the introduction rules, i.e.
4879 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4881 - The format of the elimination rules is now
4883 p z_1 ... z_m x_1 ... x_n ==>
4884 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4889 (x_1, ..., x_n) : s z_1 ... z_m ==>
4890 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4893 for sets rather than
4895 x : s z_1 ... z_m ==>
4896 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4899 This may require terms in goals to be expanded to n-tuples
4900 (e.g. using case_tac or simplification with the split_paired_all
4901 rule) before the above elimination rule is applicable.
4903 - The elimination or case analysis rules for (mutually) inductive
4904 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4905 list of rules "p_1_..._p_k.elims" is no longer available.
4907 * New package "function"/"fun" for general recursive functions,
4908 supporting mutual and nested recursion, definitions in local contexts,
4909 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4910 for small examples, and the separate tutorial on the function
4911 package. The old recdef "package" is still available as before, but
4912 users are encouraged to use the new package.
4914 * Method "lexicographic_order" automatically synthesizes termination
4915 relations as lexicographic combinations of size measures.
4917 * Case-expressions allow arbitrary constructor-patterns (including
4918 "_") and take their order into account, like in functional
4919 programming. Internally, this is translated into nested
4920 case-expressions; missing cases are added and mapped to the predefined
4921 constant "undefined". In complicated cases printing may no longer show
4922 the original input but the internal form. Lambda-abstractions allow
4923 the same form of pattern matching: "% pat1 => e1 | ..." is an
4924 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4927 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4928 is an abbreviation for "of_nat :: nat => int". The simplification
4929 rules for "of_nat" have been changed to work like "int" did
4930 previously. Potential INCOMPATIBILITY:
4931 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4932 - of_nat_diff and of_nat_mult are no longer default simp rules
4934 * Method "algebra" solves polynomial equations over (semi)rings using
4935 Groebner bases. The (semi)ring structure is defined by locales and the
4936 tool setup depends on that generic context. Installing the method for
4937 a specific type involves instantiating the locale and possibly adding
4938 declarations for computation on the coefficients. The method is
4939 already instantiated for natural numbers and for the axiomatic class
4940 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4941 CALCULEMUS 2007 for the general principles underlying this
4942 architecture of context-aware proof-tools.
4944 * Method "ferrack" implements quantifier elimination over
4945 special-purpose dense linear orders using locales (analogous to
4946 "algebra"). The method is already installed for class
4947 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4950 * Former constant "List.op @" now named "List.append". Use ML
4951 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4952 circumvent possible incompatibilities when working on ML level.
4954 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4956 * New function listsum :: 'a list => 'a for arbitrary monoids.
4957 Special syntax: "SUM x <- xs. f x" (and latex variants)
4959 * New syntax for Haskell-like list comprehension (input only), eg.
4960 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4962 * The special syntax for function "filter" has changed from [x :
4963 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4964 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4966 * [a..b] is now defined for arbitrary linear orders. It used to be
4967 defined on nat only, as an abbreviation for [a..<Suc b]
4970 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
4972 * New functions "sorted" and "sort" in src/HOL/List.thy.
4974 * New lemma collection field_simps (an extension of ring_simps) for
4975 manipulating (in)equations involving division. Multiplies with all
4976 denominators that can be proved to be non-zero (in equations) or
4977 positive/negative (in inequations).
4979 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
4980 have been improved and renamed to ring_simps, group_simps and
4981 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
4982 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
4984 * Theory Library/Commutative_Ring: switched from recdef to function
4985 package; constants add, mul, pow now curried. Infix syntax for
4986 algebraic operations.
4988 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4991 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4994 * HOL/records: generalised field-update to take a function on the
4995 field rather than the new value: r(|A := x|) is translated to A_update
4996 (K x) r The K-combinator that is internally used is called K_record.
4997 INCOMPATIBILITY: Usage of the plain update functions has to be
5000 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5001 * x = 0, which are required for a semiring. Richer structures do not
5002 inherit from semiring_0 anymore, because this property is a theorem
5003 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5004 there is more to prove, but this is mostly trivial.
5006 * Class "recpower" is generalized to arbitrary monoids, not just
5007 commutative semirings. INCOMPATIBILITY: may need to incorporate
5008 commutativity or semiring properties additionally.
5010 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5011 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5012 better use 'abbreviation'.
5014 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5016 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5017 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5018 significant changes for setting up numeral syntax for types:
5019 - New constants Numeral.pred and Numeral.succ instead
5020 of former Numeral.bin_pred and Numeral.bin_succ.
5021 - Use integer operations instead of bin_add, bin_mult and so on.
5022 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5023 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5025 See src/HOL/Integ/IntArith.thy for an example setup.
5027 * Command 'normal_form' computes the normal form of a term that may
5028 contain free variables. For example ``normal_form "rev [a, b, c]"''
5029 produces ``[b, c, a]'' (without proof). This command is suitable for
5030 heavy-duty computations because the functions are compiled to ML
5031 first. Correspondingly, a method "normalization" is provided. See
5032 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5034 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5035 25 like -->); output depends on the "iff" print_mode, the default is
5036 "A = B" (with priority 50).
5038 * Relations less (<) and less_eq (<=) are also available on type bool.
5039 Modified syntax to disallow nesting without explicit parentheses,
5040 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5043 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5045 * Relation composition operator "op O" now has precedence 75 and binds
5046 stronger than union and intersection. INCOMPATIBILITY.
5048 * The old set interval syntax "{m..n(}" (and relatives) has been
5049 removed. Use "{m..<n}" (and relatives) instead.
5051 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5052 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5053 ``declare [[simproc del: neq]]''.
5055 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5058 * Theorem Cons_eq_map_conv no longer declared as "simp".
5060 * Theorem setsum_mult renamed to setsum_right_distrib.
5062 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5065 * Reimplemented methods "sat" and "satx", with several improvements:
5066 goals no longer need to be stated as "<prems> ==> False", equivalences
5067 (i.e. "=" on type bool) are handled, variable names of the form
5068 "lit_<n>" are no longer reserved, significant speedup.
5070 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5071 zChaff is still supported as well.
5073 * 'inductive' and 'datatype': provide projections of mutual rules,
5074 bundled as foo_bar.inducts;
5076 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5079 * Library: moved theory Accessible_Part to main HOL.
5081 * Library: added theory Coinductive_List of potentially infinite lists
5082 as greatest fixed-point.
5084 * Library: added theory AssocList which implements (finite) maps as
5087 * Method "evaluation" solves goals (i.e. a boolean expression)
5088 efficiently by compiling it to ML. The goal is "proved" (via an
5089 oracle) if it evaluates to True.
5091 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5092 also when invoked by the simplifier. This results in the Simplifier
5093 being more powerful on arithmetic goals. INCOMPATIBILITY.
5094 Configuration option fast_arith_split_limit=0 recovers the old
5097 * Support for hex (0x20) and binary (0b1001) numerals.
5099 * New method: reify eqs (t), where eqs are equations for an
5100 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5101 parameter, computes a term s::'b and a list xs::'a list and proves the
5102 theorem I xs s = t. This is also known as reification or quoting. The
5103 resulting theorem is applied to the subgoal to substitute t with I xs
5104 s. If t is omitted, the subgoal itself is reified.
5106 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5107 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5108 where f is supposed to be a computable function (in the sense of code
5109 generattion). The method uses reify to compute s and xs as above then
5110 applies corr_thm and uses normalization by evaluation to "prove" f s =
5111 r and finally gets the theorem t = r, which is again applied to the
5112 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5114 * Reflection: Automatic reification now handels binding, an example is
5115 available in src/HOL/ex/ReflectionEx.thy
5117 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5118 command 'statespace' that is similar to 'record', but introduces an
5119 abstract specification based on the locale infrastructure instead of
5120 HOL types. This leads to extra flexibility in composing state spaces,
5121 in particular multiple inheritance and renaming of components.
5126 * Hyperreal: Functions root and sqrt are now defined on negative real
5127 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5128 Nonnegativity side conditions have been removed from many lemmas, so
5129 that more subgoals may now be solved by simplification; potential
5132 * Real: new type classes formalize real normed vector spaces and
5133 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5134 and norm :: 'a => real.
5136 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5137 reals into other types. The overloaded constant Reals :: 'a set is now
5138 defined as range of_real; potential INCOMPATIBILITY.
5140 * Real: proper support for ML code generation, including 'quickcheck'.
5141 Reals are implemented as arbitrary precision rationals.
5143 * Hyperreal: Several constants that previously worked only for the
5144 reals have been generalized, so they now work over arbitrary vector
5145 spaces. Type annotations may need to be added in some cases; potential
5148 Infinitesimal :: ('a::real_normed_vector) star set
5149 HFinite :: ('a::real_normed_vector) star set
5150 HInfinite :: ('a::real_normed_vector) star set
5151 approx :: ('a::real_normed_vector) star => 'a star => bool
5152 monad :: ('a::real_normed_vector) star => 'a star set
5153 galaxy :: ('a::real_normed_vector) star => 'a star set
5154 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5155 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5156 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5157 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5158 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5159 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5160 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5161 sgn :: 'a::real_normed_vector => 'a
5162 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5164 * Complex: Some complex-specific constants are now abbreviations for
5165 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5166 hnorm. Other constants have been entirely removed in favor of the
5167 polymorphic versions (INCOMPATIBILITY):
5171 HInfinite <-- CInfinite
5172 Infinitesimal <-- CInfinitesimal
5175 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5176 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5177 (ns)deriv <-- (ns)cderiv
5182 * Formalisation of ideals and the quotient construction over rings.
5184 * Order and lattice theory no longer based on records.
5187 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5188 greatest_closed. INCOMPATIBILITY.
5190 * Method algebra is now set up via an attribute. For examples see
5191 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5192 of algebraic structures.
5194 * Renamed theory CRing to Ring.
5199 * Substantial, yet incomplete support for nominal datatypes (binding
5200 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5201 src/HOL/Nominal/Examples. Prospective users should consult
5202 http://isabelle.in.tum.de/nominal/
5207 * ML basics: just one true type int, which coincides with IntInf.int
5210 * ML within Isar: antiquotations allow to embed statically-checked
5211 formal entities in the source, referring to the context available at
5212 compile-time. For example:
5214 ML {* @{sort "{zero,one}"} *}
5215 ML {* @{typ "'a => 'b"} *}
5216 ML {* @{term "%x. x"} *}
5217 ML {* @{prop "x == y"} *}
5218 ML {* @{ctyp "'a => 'b"} *}
5219 ML {* @{cterm "%x. x"} *}
5220 ML {* @{cprop "x == y"} *}
5221 ML {* @{thm asm_rl} *}
5222 ML {* @{thms asm_rl} *}
5223 ML {* @{type_name c} *}
5224 ML {* @{type_syntax c} *}
5225 ML {* @{const_name c} *}
5226 ML {* @{const_syntax c} *}
5229 ML {* @{theory Pure} *}
5230 ML {* @{theory_ref} *}
5231 ML {* @{theory_ref Pure} *}
5234 ML {* @{clasimpset} *}
5236 The same works for sources being ``used'' within an Isar context.
5238 * ML in Isar: improved error reporting; extra verbosity with
5239 ML_Context.trace enabled.
5241 * Pure/General/table.ML: the join operations now works via exceptions
5242 DUP/SAME instead of type option. This is simpler in simple cases, and
5243 admits slightly more efficient complex applications.
5245 * Pure: 'advanced' translation functions (parse_translation etc.) now
5246 use Context.generic instead of just theory.
5248 * Pure: datatype Context.generic joins theory/Proof.context and
5249 provides some facilities for code that works in either kind of
5250 context, notably GenericDataFun for uniform theory and proof data.
5252 * Pure: simplified internal attribute type, which is now always
5253 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5254 local (Proof.context) attributes have been discontinued, while
5255 minimizing code duplication. Thm.rule_attribute and
5256 Thm.declaration_attribute build canonical attributes; see also structure
5257 Context for further operations on Context.generic, notably
5258 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5259 declarations and definitions.
5261 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5262 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5263 init only required for impure data. INCOMPATIBILITY: empty really need
5264 to be empty (no dependencies on theory content!)
5266 * Pure/kernel: consts certification ignores sort constraints given in
5267 signature declarations. (This information is not relevant to the
5268 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5269 potential INCOMPATIBILITY.
5271 * Pure: axiomatic type classes are now purely definitional, with
5272 explicit proofs of class axioms and super class relations performed
5273 internally. See Pure/axclass.ML for the main internal interfaces --
5274 notably AxClass.define_class supercedes AxClass.add_axclass, and
5275 AxClass.axiomatize_class/classrel/arity supersede
5276 Sign.add_classes/classrel/arities.
5278 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5279 global/local versions on theory vs. Proof.context have been
5280 discontinued; Attrib.syntax and Method.syntax have been adapted
5281 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5282 attributes, methods, etc.
5284 * Pure: several functions of signature "... -> theory -> theory * ..."
5285 have been reoriented to "... -> theory -> ... * theory" in order to
5286 allow natural usage in combination with the ||>, ||>>, |-> and
5287 fold_map combinators.
5289 * Pure: official theorem names (closed derivations) and additional
5290 comments (tags) are now strictly separate. Name hints -- which are
5291 maintained as tags -- may be attached any time without affecting the
5294 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5295 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5296 achieve the old behaviour.
5298 * Pure: the "Goal" constant is now called "prop", supporting a
5299 slightly more general idea of ``protecting'' meta-level rule
5302 * Pure: Logic.(un)varify only works in a global context, which is now
5303 enforced instead of silently assumed. INCOMPATIBILITY, may use
5304 Logic.legacy_(un)varify as temporary workaround.
5306 * Pure: structure Name provides scalable operations for generating
5307 internal variable names, notably Name.variants etc. This replaces
5308 some popular functions from term.ML:
5310 Term.variant -> Name.variant
5311 Term.variantlist -> Name.variant_list
5312 Term.invent_names -> Name.invent_list
5314 Note that low-level renaming rarely occurs in new code -- operations
5315 from structure Variable are used instead (see below).
5317 * Pure: structure Variable provides fundamental operations for proper
5318 treatment of fixed/schematic variables in a context. For example,
5319 Variable.import introduces fixes for schematics of given facts and
5320 Variable.export reverses the effect (up to renaming) -- this replaces
5321 various freeze_thaw operations.
5323 * Pure: structure Goal provides simple interfaces for
5324 init/conclude/finish and tactical prove operations (replacing former
5325 Tactic.prove). Goal.prove is the canonical way to prove results
5326 within a given context; Goal.prove_global is a degraded version for
5327 theory level goals, including a global Drule.standard. Note that
5328 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5329 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5330 in a locale context).
5332 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5333 and type checking (Syntax.check_term etc.), with common combinations
5334 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5335 which are considered legacy and await removal.
5337 * Pure/Syntax: generic interfaces for type unchecking
5338 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5339 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5340 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5341 available for convenience, but refer to the very same operations using
5342 a mere theory instead of a full context.
5344 * Isar: simplified treatment of user-level errors, using exception
5345 ERROR of string uniformly. Function error now merely raises ERROR,
5346 without any side effect on output channels. The Isar toplevel takes
5347 care of proper display of ERROR exceptions. ML code may use plain
5348 handle/can/try; cat_error may be used to concatenate errors like this:
5350 ... handle ERROR msg => cat_error msg "..."
5352 Toplevel ML code (run directly or through the Isar toplevel) may be
5353 embedded into the Isar toplevel with exception display/debug like
5356 Isar.toplevel (fn () => ...)
5358 INCOMPATIBILITY, removed special transform_error facilities, removed
5359 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5360 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5361 -- use plain ERROR instead.
5363 * Isar: theory setup now has type (theory -> theory), instead of a
5364 list. INCOMPATIBILITY, may use #> to compose setup functions.
5366 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5367 ProofContext.debug/verbose flags.
5369 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5370 theory before entering a proof state. Transactions now always see a
5371 quasi-functional intermediate checkpoint, both in interactive and
5374 * Isar: simplified interfaces for outer syntax. Renamed
5375 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5376 OuterSyntax.add_parsers -- this functionality is now included in
5377 OuterSyntax.command etc. INCOMPATIBILITY.
5379 * Simplifier: the simpset of a running simplification process now
5380 contains a proof context (cf. Simplifier.the_context), which is the
5381 very context that the initial simpset has been retrieved from (by
5382 simpset_of/local_simpset_of). Consequently, all plug-in components
5383 (solver, looper etc.) may depend on arbitrary proof data.
5385 * Simplifier.inherit_context inherits the proof context (plus the
5386 local bounds) of the current simplification process; any simproc
5387 etc. that calls the Simplifier recursively should do this! Removed
5388 former Simplifier.inherit_bounds, which is already included here --
5389 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5390 specify an explicit context using Simplifier.context/theory_context.
5392 * Simplifier/Classical Reasoner: more abstract interfaces
5393 change_simpset/claset for modifying the simpset/claset reference of a
5394 theory; raw versions simpset/claset_ref etc. have been discontinued --
5397 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5403 * settings: the default heap location within ISABELLE_HOME_USER now
5404 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5405 Isabelle installations.
5407 * isabelle-process: option -S (secure mode) disables some critical
5408 operations, notably runtime compilation and evaluation of ML source
5411 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5413 * Support for parallel execution, using native multicore support of
5414 Poly/ML 5.1. The theory loader exploits parallelism when processing
5415 independent theories, according to the given theory header
5416 specifications. The maximum number of worker threads is specified via
5417 usedir option -M or the "max-threads" setting in Proof General. A
5418 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5419 to 6 on a 8-core machine. User-code needs to observe certain
5420 guidelines for thread-safe programming, see appendix A in the Isar
5421 Implementation manual.
5425 New in Isabelle2005 (October 2005)
5426 ----------------------------------
5430 * Theory headers: the new header syntax for Isar theories is
5433 imports <theory1> ... <theoryN>
5434 uses <file1> ... <fileM>
5437 where the 'uses' part is optional. The previous syntax
5439 theory <name> = <theory1> + ... + <theoryN>:
5441 will disappear in the next release. Use isatool fixheaders to convert
5442 existing theory files. Note that there is no change in ancient
5443 non-Isar theories now, but these will disappear soon.
5445 * Theory loader: parent theories can now also be referred to via
5446 relative and absolute paths.
5448 * Command 'find_theorems' searches for a list of criteria instead of a
5449 list of constants. Known criteria are: intro, elim, dest, name:string,
5450 simp:term, and any term. Criteria can be preceded by '-' to select
5451 theorems that do not match. Intro, elim, dest select theorems that
5452 match the current goal, name:s selects theorems whose fully qualified
5453 name contain s, and simp:term selects all simplification rules whose
5454 lhs match term. Any other term is interpreted as pattern and selects
5455 all theorems matching the pattern. Available in ProofGeneral under
5456 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5458 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5460 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5461 matching the current goal as introduction rule and not having "HOL."
5462 in their name (i.e. not being defined in theory HOL).
5464 * Command 'thms_containing' has been discontinued in favour of
5465 'find_theorems'; INCOMPATIBILITY.
5467 * Communication with Proof General is now 8bit clean, which means that
5468 Unicode text in UTF-8 encoding may be used within theory texts (both
5469 formal and informal parts). Cf. option -U of the Isabelle Proof
5470 General interface. Here are some simple examples (cf. src/HOL/ex):
5472 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5473 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5475 * Improved efficiency of the Simplifier and, to a lesser degree, the
5476 Classical Reasoner. Typical big applications run around 2 times
5480 *** Document preparation ***
5482 * Commands 'display_drafts' and 'print_drafts' perform simple output
5483 of raw sources. Only those symbols that do not require additional
5484 LaTeX packages (depending on comments in isabellesym.sty) are
5485 displayed properly, everything else is left verbatim. isatool display
5486 and isatool print are used as front ends (these are subject to the
5487 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5489 * Command tags control specific markup of certain regions of text,
5490 notably folding and hiding. Predefined tags include "theory" (for
5491 theory begin and end), "proof" for proof commands, and "ML" for
5492 commands involving ML code; the additional tags "visible" and
5493 "invisible" are unused by default. Users may give explicit tag
5494 specifications in the text, e.g. ''by %invisible (auto)''. The
5495 interpretation of tags is determined by the LaTeX job during document
5496 preparation: see option -V of isatool usedir, or options -n and -t of
5497 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5500 Several document versions may be produced at the same time via isatool
5501 usedir (the generated index.html will link all of them). Typical
5502 specifications include ''-V document=theory,proof,ML'' to present
5503 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5504 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5505 these parts without any formal replacement text. The Isabelle site
5506 default settings produce ''document'' and ''outline'' versions as
5509 * Several new antiquotations:
5511 @{term_type term} prints a term with its type annotated;
5513 @{typeof term} prints the type of a term;
5515 @{const const} is the same as @{term const}, but checks that the
5516 argument is a known logical constant;
5518 @{term_style style term} and @{thm_style style thm} print a term or
5519 theorem applying a "style" to it
5523 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5524 definitions, equations, inequations etc., 'concl' printing only the
5525 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5526 to print the specified premise. TermStyle.add_style provides an ML
5527 interface for introducing further styles. See also the "LaTeX Sugar"
5528 document practical applications. The ML antiquotation prints
5529 type-checked ML expressions verbatim.
5531 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5532 and 'text' support optional locale specification '(in loc)', which
5533 specifies the default context for interpreting antiquotations. For
5534 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5536 * Option 'locale=NAME' of antiquotations specifies an alternative
5537 context interpreting the subsequent argument. For example: @{thm
5538 [locale=lattice] inf_assoc}.
5540 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5543 * Proper output of antiquotations for theory commands involving a
5544 proof context (such as 'locale' or 'theorem (in loc) ...').
5546 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5547 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5549 * isatool usedir: new option -C (default true) controls whether option
5550 -D should include a copy of the original document directory; -C false
5551 prevents unwanted effects such as copying of administrative CVS data.
5556 * Considerably improved version of 'constdefs' command. Now performs
5557 automatic type-inference of declared constants; additional support for
5558 local structure declarations (cf. locales and HOL records), see also
5559 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5560 sequential dependencies of definitions within a single 'constdefs'
5561 section; moreover, the declared name needs to be an identifier. If
5562 all fails, consider to fall back on 'consts' and 'defs' separately.
5564 * Improved indexed syntax and implicit structures. First of all,
5565 indexed syntax provides a notational device for subscripted
5566 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5567 expressions. Secondly, in a local context with structure
5568 declarations, number indexes \<^sub>n or the empty index (default
5569 number 1) refer to a certain fixed variable implicitly; option
5570 show_structs controls printing of implicit structures. Typical
5571 applications of these concepts involve record types and locales.
5573 * New command 'no_syntax' removes grammar declarations (and
5574 translations) resulting from the given syntax specification, which is
5575 interpreted in the same manner as for the 'syntax' command.
5577 * 'Advanced' translation functions (parse_translation etc.) may depend
5578 on the signature of the theory context being presently used for
5579 parsing/printing, see also isar-ref manual.
5581 * Improved 'oracle' command provides a type-safe interface to turn an
5582 ML expression of type theory -> T -> term into a primitive rule of
5583 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5584 is already included here); see also FOL/ex/IffExample.thy;
5587 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5588 before); "cI" is no longer bound, use "c.intro" instead.
5589 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5590 axclasses vs. locales.
5592 * Improved internal renaming of symbolic identifiers -- attach primes
5593 instead of base 26 numbers.
5595 * New flag show_question_marks controls printing of leading question
5596 marks in schematic variable names.
5598 * In schematic variable names, *any* symbol following \<^isub> or
5599 \<^isup> is now treated as part of the base name. For example, the
5600 following works without printing of awkward ".0" indexes:
5602 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5605 * Inner syntax includes (*(*nested*) comments*).
5607 * Pretty printer now supports unbreakable blocks, specified in mixfix
5608 annotations as "(00...)".
5610 * Clear separation of logical types and nonterminals, where the latter
5611 may only occur in 'syntax' specifications or type abbreviations.
5612 Before that distinction was only partially implemented via type class
5613 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5614 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5615 exotic syntax specifications may require further adaption
5616 (e.g. Cube/Cube.thy).
5618 * Removed obsolete type class "logic", use the top sort {} instead.
5619 Note that non-logical types should be declared as 'nonterminals'
5620 rather than 'types'. INCOMPATIBILITY for new object-logic
5623 * Attributes 'induct' and 'cases': type or set names may now be
5624 locally fixed variables as well.
5626 * Simplifier: can now control the depth to which conditional rewriting
5627 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5630 * Simplifier: simplification procedures may now take the current
5631 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5632 interface), which is very useful for calling the Simplifier
5633 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5634 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5635 low-level mk_simproc no longer applies Logic.varify internally, to
5636 allow for use in a context of fixed variables.
5638 * thin_tac now works even if the assumption being deleted contains !!
5639 or ==>. More generally, erule now works even if the major premise of
5640 the elimination rule contains !! or ==>.
5642 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5644 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5645 from Pure, which contains all common declarations already. Both
5646 theories are defined via plain Isabelle/Isar .thy files.
5647 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5648 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5649 use isatool fixcpure to adapt your theory and ML sources.
5651 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5652 selections of theorems in named facts via index ranges.
5654 * 'print_theorems': in theory mode, really print the difference
5655 wrt. the last state (works for interactive theory development only),
5656 in proof mode print all local facts (cf. 'print_facts');
5658 * 'hide': option '(open)' hides only base names.
5660 * More efficient treatment of intermediate checkpoints in interactive
5663 * Code generator is now invoked via code_module (incremental code
5664 generation) and code_library (modular code generation, ML structures
5665 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5666 must be quoted when used as identifiers.
5668 * New 'value' command for reading, evaluating and printing terms using
5669 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5670 quoted when used as identifier.
5675 * New commands for the interpretation of locale expressions in
5676 theories (1), locales (2) and proof contexts (3). These generate
5677 proof obligations from the expression specification. After the
5678 obligations have been discharged, theorems of the expression are added
5679 to the theory, target locale or proof context. The synopsis of the
5680 commands is a follows:
5682 (1) interpretation expr inst
5683 (2) interpretation target < expr
5684 (3) interpret expr inst
5686 Interpretation in theories and proof contexts require a parameter
5687 instantiation of terms from the current context. This is applied to
5688 specifications and theorems of the interpreted expression.
5689 Interpretation in locales only permits parameter renaming through the
5690 locale expression. Interpretation is smart in that interpretations
5691 that are active already do not occur in proof obligations, neither are
5692 instantiated theorems stored in duplicate. Use 'print_interps' to
5693 inspect active interpretations of a particular locale. For details,
5694 see the Isar Reference manual. Examples can be found in
5695 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5697 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5698 'interpret' instead.
5700 * New context element 'constrains' for adding type constraints to
5703 * Context expressions: renaming of parameters with syntax
5706 * Locale declaration: 'includes' disallowed.
5708 * Proper static binding of attribute syntax -- i.e. types / terms /
5709 facts mentioned as arguments are always those of the locale definition
5710 context, independently of the context of later invocations. Moreover,
5711 locale operations (renaming and type / term instantiation) are applied
5712 to attribute arguments as expected.
5714 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5715 actual attributes; rare situations may require Attrib.attribute to
5716 embed those attributes into Attrib.src that lack concrete syntax.
5717 Attribute implementations need to cooperate properly with the static
5718 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5719 Attrib.XXX_thm etc. already do the right thing without further
5720 intervention. Only unusual applications -- such as "where" or "of"
5721 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5722 on the context and the facts involved -- may have to assign parsed
5723 values to argument tokens explicitly.
5725 * Changed parameter management in theorem generation for long goal
5726 statements with 'includes'. INCOMPATIBILITY: produces a different
5727 theorem statement in rare situations.
5729 * Locale inspection command 'print_locale' omits notes elements. Use
5730 'print_locale!' to have them included in the output.
5735 * Provers/hypsubst.ML: improved version of the subst method, for
5736 single-step rewriting: it now works in bound variable contexts. New is
5737 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5738 rewrite a different subterm than the original subst method, which is
5739 still available as 'simplesubst'.
5741 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5744 * Provers/trancl.ML: new transitivity reasoner for transitive and
5745 reflexive-transitive closure of relations.
5747 * Provers/blast.ML: new reference depth_limit to make blast's depth
5748 limit (previously hard-coded with a value of 20) user-definable.
5750 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5751 is peformed already. Object-logics merely need to finish their
5752 initial simpset configuration as before. INCOMPATIBILITY.
5757 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5760 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5762 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5763 and x-symbol; use option '-m epsilon' to get it actually printed.
5764 Moreover, the mathematically important symbolic identifier \<epsilon>
5765 becomes available as variable, constant etc. INCOMPATIBILITY,
5767 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5768 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5769 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5770 support corresponding Isar calculations.
5772 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5775 * theory SetInterval: changed the syntax for open intervals:
5784 The old syntax is still supported but will disappear in the next
5785 release. For conversion use the following Emacs search and replace
5786 patterns (these are not perfect but work quite well):
5788 {)\([^\.]*\)\.\. -> {\1<\.\.}
5789 \.\.\([^(}]*\)(} -> \.\.<\1}
5791 * Theory Commutative_Ring (in Library): method comm_ring for proving
5792 equalities in commutative rings; method 'algebra' provides a generic
5795 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5796 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5797 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5800 Some new syntax forms are available:
5802 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5803 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5804 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5805 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5807 The latter form "\<Sum>x < k. e" used to be based on a separate
5808 function "Summation", which has been discontinued.
5810 * theory Finite_Set: in structured induction proofs, the insert case
5811 is now 'case (insert x F)' instead of the old counterintuitive 'case
5814 * The 'refute' command has been extended to support a much larger
5815 fragment of HOL, including axiomatic type classes, constdefs and
5816 typedefs, inductive datatypes and recursion.
5818 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5819 Requires zChaff with proof generation to be installed. See
5820 HOL/ex/SAT_Examples.thy for examples.
5822 * Datatype induction via method 'induct' now preserves the name of the
5823 induction variable. For example, when proving P(xs::'a list) by
5824 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5825 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5826 in unstructured proof scripts.
5828 * Reworked implementation of records. Improved scalability for
5829 records with many fields, avoiding performance problems for type
5830 inference. Records are no longer composed of nested field types, but
5831 of nested extension types. Therefore the record type only grows linear
5832 in the number of extensions and not in the number of fields. The
5833 top-level (users) view on records is preserved. Potential
5834 INCOMPATIBILITY only in strange cases, where the theory depends on the
5835 old record representation. The type generated for a record is called
5836 <record_name>_ext_type.
5838 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5839 proofs triggered by a record definition or a simproc (if
5840 quick_and_dirty is enabled). Definitions of large records can take
5843 New simproc record_upd_simproc for simplification of multiple record
5844 updates enabled by default. Moreover, trivial updates are also
5845 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5846 occasionally, since simplification is more powerful by default.
5848 * typedef: proper support for polymorphic sets, which contain extra
5849 type-variables in the term.
5851 * Simplifier: automatically reasons about transitivity chains
5852 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5853 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5854 old proofs break occasionally as simplification may now solve more
5855 goals than previously.
5857 * Simplifier: converts x <= y into x = y if assumption y <= x is
5858 present. Works for all partial orders (class "order"), in particular
5859 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5862 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5863 bound variable or a constant then the let is unfolded. Otherwise
5864 first a is simplified to b, and then f b is simplified to g. If
5865 possible we abstract b from g arriving at "let x = b in h x",
5866 otherwise we unfold the let and arrive at g. The simproc can be
5867 enabled/disabled by the reference use_let_simproc. Potential
5868 INCOMPATIBILITY since simplification is more powerful by default.
5870 * Classical reasoning: the meson method now accepts theorems as arguments.
5872 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5873 jobs to provide advice on the provability of subgoals.
5875 * Theory OrderedGroup and Ring_and_Field: various additions and
5876 improvements to faciliate calculations involving equalities and
5879 The following theorems have been eliminated or modified
5882 abs_eq now named abs_of_nonneg
5883 abs_of_ge_0 now named abs_of_nonneg
5884 abs_minus_eq now named abs_of_nonpos
5885 imp_abs_id now named abs_of_nonneg
5886 imp_abs_neg_id now named abs_of_nonpos
5887 mult_pos now named mult_pos_pos
5888 mult_pos_le now named mult_nonneg_nonneg
5889 mult_pos_neg_le now named mult_nonneg_nonpos
5890 mult_pos_neg2_le now named mult_nonneg_nonpos2
5891 mult_neg now named mult_neg_neg
5892 mult_neg_le now named mult_nonpos_nonpos
5894 * The following lemmas in Ring_and_Field have been added to the simplifier:
5897 not_square_less_zero
5899 The following lemmas have been deleted from Real/RealPow:
5909 * Theory Parity: added rules for simplifying exponents.
5913 The following theorems have been eliminated or modified
5916 list_all_Nil now named list_all.simps(1)
5917 list_all_Cons now named list_all.simps(2)
5918 list_all_conv now named list_all_iff
5919 set_mem_eq now named mem_iff
5921 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5922 asymptotic "big O" calculations. See the notes in BigO.thy.
5927 * Theory RealDef: better support for embedding natural numbers and
5928 integers in the reals.
5930 The following theorems have been eliminated or modified
5933 exp_ge_add_one_self now requires no hypotheses
5934 real_of_int_add reversed direction of equality (use [symmetric])
5935 real_of_int_minus reversed direction of equality (use [symmetric])
5936 real_of_int_diff reversed direction of equality (use [symmetric])
5937 real_of_int_mult reversed direction of equality (use [symmetric])
5939 * Theory RComplete: expanded support for floor and ceiling functions.
5941 * Theory Ln is new, with properties of the natural logarithm
5943 * Hyperreal: There is a new type constructor "star" for making
5944 nonstandard types. The old type names are now type synonyms:
5948 hcomplex = complex star
5950 * Hyperreal: Many groups of similarly-defined constants have been
5951 replaced by polymorphic versions (INCOMPATIBILITY):
5953 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5955 starset <-- starsetNat, starsetC
5956 *s* <-- *sNat*, *sc*
5957 starset_n <-- starsetNat_n, starsetC_n
5958 *sn* <-- *sNatn*, *scn*
5959 InternalSets <-- InternalNatSets, InternalCSets
5961 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5962 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5963 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5964 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5965 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
5967 * Hyperreal: Many type-specific theorems have been removed in favor of
5968 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
5970 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
5971 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
5972 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
5973 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
5974 right_minus <-- hypreal_add_minus
5975 left_minus <-- {hypreal,hcomplex}_add_minus_left
5976 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
5977 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
5978 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
5979 mult_1_right <-- hcomplex_mult_one_right
5980 mult_zero_left <-- hcomplex_mult_zero_left
5981 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
5982 right_distrib <-- hypnat_add_mult_distrib2
5983 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
5984 right_inverse <-- hypreal_mult_inverse
5985 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
5986 order_refl <-- {hypreal,hypnat}_le_refl
5987 order_trans <-- {hypreal,hypnat}_le_trans
5988 order_antisym <-- {hypreal,hypnat}_le_anti_sym
5989 order_less_le <-- {hypreal,hypnat}_less_le
5990 linorder_linear <-- {hypreal,hypnat}_le_linear
5991 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5992 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5993 add_nonneg_nonneg <-- hypreal_le_add_order
5995 * Hyperreal: Separate theorems having to do with type-specific
5996 versions of constants have been merged into theorems that apply to the
5997 new polymorphic constants (INCOMPATIBILITY):
5999 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6000 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6001 STAR_Un <-- {STAR,NatStar,STARC}_Un
6002 STAR_Int <-- {STAR,NatStar,STARC}_Int
6003 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6004 STAR_subset <-- {STAR,NatStar,STARC}_subset
6005 STAR_mem <-- {STAR,NatStar,STARC}_mem
6006 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6007 STAR_diff <-- {STAR,STARC}_diff
6008 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6009 STARC_hcomplex_of_complex}_image_subset
6010 starset_n_Un <-- starset{Nat,C}_n_Un
6011 starset_n_Int <-- starset{Nat,C}_n_Int
6012 starset_n_Compl <-- starset{Nat,C}_n_Compl
6013 starset_n_diff <-- starset{Nat,C}_n_diff
6014 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6015 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6016 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6017 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6018 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6019 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6020 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6021 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6022 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6023 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6024 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6025 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6026 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6027 starfun_diff <-- starfun{C,RC,CR}_diff
6028 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6029 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6030 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6031 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6032 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6033 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6034 starfun_Id <-- starfunC_Id
6035 starfun_approx <-- starfun{Nat,CR}_approx
6036 starfun_capprox <-- starfun{C,RC}_capprox
6037 starfun_abs <-- starfunNat_rabs
6038 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6039 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6040 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6041 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6042 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6043 starfun_add_approx <-- starfunCR_add_approx
6044 starfun_inverse_inverse <-- starfunC_inverse_inverse
6045 starfun_divide <-- starfun{C,CR,RC}_divide
6046 starfun_n <-- starfun{Nat,C}_n
6047 starfun_n_mult <-- starfun{Nat,C}_n_mult
6048 starfun_n_add <-- starfun{Nat,C}_n_add
6049 starfun_n_add_minus <-- starfunNat_n_add_minus
6050 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6051 starfun_n_minus <-- starfun{Nat,C}_n_minus
6052 starfun_n_eq <-- starfun{Nat,C}_n_eq
6054 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6055 star_n_minus <-- {hypreal,hcomplex}_minus
6056 star_n_diff <-- {hypreal,hcomplex}_diff
6057 star_n_mult <-- {hypreal,hcomplex}_mult
6058 star_n_inverse <-- {hypreal,hcomplex}_inverse
6059 star_n_le <-- {hypreal,hypnat}_le
6060 star_n_less <-- {hypreal,hypnat}_less
6061 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6062 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6063 star_n_abs <-- hypreal_hrabs
6064 star_n_divide <-- hcomplex_divide
6066 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6067 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6068 star_of_diff <-- hypreal_of_real_diff
6069 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6070 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6071 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6072 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6073 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6074 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6075 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6076 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6077 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6078 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6079 star_of_number_of <-- {hypreal,hcomplex}_number_of
6080 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6081 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6082 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6083 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6084 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6085 star_of_power <-- hypreal_of_real_power
6086 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6088 * Hyperreal: new method "transfer" that implements the transfer
6089 principle of nonstandard analysis. With a subgoal that mentions
6090 nonstandard types like "'a star", the command "apply transfer"
6091 replaces it with an equivalent one that mentions only standard types.
6092 To be successful, all free variables must have standard types; non-
6093 standard variables must have explicit universal quantifiers.
6095 * Hyperreal: A theory of Taylor series.
6100 * Discontinued special version of 'constdefs' (which used to support
6101 continuous functions) in favor of the general Pure one with full
6104 * New simplification procedure for solving continuity conditions; it
6105 is much faster on terms with many nested lambda abstractions (cubic
6106 instead of exponential time).
6108 * New syntax for domain package: selector names are now optional.
6109 Parentheses should be omitted unless argument is lazy, for example:
6111 domain 'a stream = cons "'a" (lazy "'a stream")
6113 * New command 'fixrec' for defining recursive functions with pattern
6114 matching; defining multiple functions with mutual recursion is also
6115 supported. Patterns may include the constants cpair, spair, up, sinl,
6116 sinr, or any data constructor defined by the domain package. The given
6117 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6118 syntax and examples.
6120 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6121 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6122 but the proof obligation additionally includes an admissibility
6123 requirement. The packages generate instances of class cpo or pcpo,
6124 with continuity and strictness theorems for Rep and Abs.
6126 * HOLCF: Many theorems have been renamed according to a more standard naming
6127 scheme (INCOMPATIBILITY):
6129 foo_inject: "foo$x = foo$y ==> x = y"
6130 foo_eq: "(foo$x = foo$y) = (x = y)"
6131 foo_less: "(foo$x << foo$y) = (x << y)"
6132 foo_strict: "foo$UU = UU"
6133 foo_defined: "... ==> foo$x ~= UU"
6134 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6139 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6140 including the First Isomorphism Theorem (on quotienting by the kernel
6143 * ZF/Simplifier: install second copy of type solver that actually
6144 makes use of TC rules declared to Isar proof contexts (or locales);
6145 the old version is still required for ML proof scripts.
6150 * Converted to Isar theory format; use locales instead of axiomatic
6156 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6159 * Pure/library.ML no longer defines its own option datatype, but uses
6160 that of the SML basis, which has constructors NONE and SOME instead of
6161 None and Some, as well as exception Option.Option instead of OPTION.
6162 The functions the, if_none, is_some, is_none have been adapted
6163 accordingly, while Option.map replaces apsome.
6165 * Pure/library.ML: the exception LIST has been given up in favour of
6166 the standard exceptions Empty and Subscript, as well as
6167 Library.UnequalLengths. Function like Library.hd and Library.tl are
6168 superceded by the standard hd and tl functions etc.
6170 A number of basic list functions are no longer exported to the ML
6171 toplevel, as they are variants of predefined functions. The following
6172 suggests how one can translate existing code:
6174 rev_append xs ys = List.revAppend (xs, ys)
6175 nth_elem (i, xs) = List.nth (xs, i)
6176 last_elem xs = List.last xs
6177 flat xss = List.concat xss
6178 seq fs = List.app fs
6179 partition P xs = List.partition P xs
6180 mapfilter f xs = List.mapPartial f xs
6182 * Pure/library.ML: several combinators for linear functional
6183 transformations, notably reverse application and composition:
6186 (x, y) |-> f f #-> g
6188 * Pure/library.ML: introduced/changed precedence of infix operators:
6190 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6192 infix 3 o oo ooo oooo;
6193 infix 4 ~~ upto downto;
6195 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6198 * Pure/library.ML: natural list combinators fold, fold_rev, and
6199 fold_map support linear functional transformations and nesting. For
6202 fold f [x1, ..., xN] y =
6203 y |> f x1 |> ... |> f xN
6205 (fold o fold) f [xs1, ..., xsN] y =
6206 y |> fold f xs1 |> ... |> fold f xsN
6208 fold f [x1, ..., xN] =
6211 (fold o fold) f [xs1, ..., xsN] =
6212 fold f xs1 #> ... #> fold f xsN
6214 * Pure/library.ML: the following selectors on type 'a option are
6217 the: 'a option -> 'a (*partial*)
6218 these: 'a option -> 'a where 'a = 'b list
6219 the_default: 'a -> 'a option -> 'a
6220 the_list: 'a option -> 'a list
6222 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6223 basic operations for association lists, following natural argument
6224 order; moreover the explicit equality predicate passed here avoids
6225 potentially expensive polymorphic runtime equality checks.
6226 The old functions may be expressed as follows:
6228 assoc = uncurry (AList.lookup (op =))
6229 assocs = these oo AList.lookup (op =)
6230 overwrite = uncurry (AList.update (op =)) o swap
6232 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6234 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6235 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6237 replacing make_keylist and keyfilter (occassionally used)
6240 make_keylist = AList.make
6241 keyfilter = AList.find (op =)
6243 * eq_fst and eq_snd now take explicit equality parameter, thus
6244 avoiding eqtypes. Naive rewrites:
6246 eq_fst = eq_fst (op =)
6247 eq_snd = eq_snd (op =)
6249 * Removed deprecated apl and apr (rarely used).
6252 apl (n, op) =>>= curry op n
6253 apr (op, m) =>>= fn n => op (n, m)
6255 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6256 provides a reasonably efficient light-weight implementation of sets as
6259 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6260 few new operations; existing lookup and update are now curried to
6261 follow natural argument order (for use with fold etc.);
6262 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6264 * Pure/General: output via the Isabelle channels of
6265 writeln/warning/error etc. is now passed through Output.output, with a
6266 hook for arbitrary transformations depending on the print_mode
6267 (cf. Output.add_mode -- the first active mode that provides a output
6268 function wins). Already formatted output may be embedded into further
6269 text via Output.raw; the result of Pretty.string_of/str_of and derived
6270 functions (string_of_term/cterm/thm etc.) is already marked raw to
6271 accommodate easy composition of diagnostic messages etc. Programmers
6272 rarely need to care about Output.output or Output.raw at all, with
6273 some notable exceptions: Output.output is required when bypassing the
6274 standard channels (writeln etc.), or in token translations to produce
6275 properly formatted results; Output.raw is required when capturing
6276 already output material that will eventually be presented to the user
6277 a second time. For the default print mode, both Output.output and
6278 Output.raw have no effect.
6280 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6281 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6282 cumulative results are displayed at the end of a batch session.
6284 * Pure/General: File.sysify_path and File.quote_sysify path have been
6285 replaced by File.platform_path and File.shell_path (with appropriate
6286 hooks). This provides a clean interface for unusual systems where the
6287 internal and external process view of file names are different.
6289 * Pure: more efficient orders for basic syntactic entities: added
6290 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6291 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6292 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6293 orders now -- potential INCOMPATIBILITY for code that depends on a
6294 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6295 Library.sort_strings on result).
6297 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6298 fold_types traverse types/terms from left to right, observing natural
6299 argument order. Supercedes previous foldl_XXX versions, add_frees,
6300 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6302 * Pure: name spaces have been refined, with significant changes of the
6303 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6304 to extern(_table). The plain name entry path is superceded by a
6305 general 'naming' context, which also includes the 'policy' to produce
6306 a fully qualified name and external accesses of a fully qualified
6307 name; NameSpace.extend is superceded by context dependent
6308 Sign.declare_name. Several theory and proof context operations modify
6309 the naming context. Especially note Theory.restore_naming and
6310 ProofContext.restore_naming to get back to a sane state; note that
6311 Theory.add_path is no longer sufficient to recover from
6312 Theory.absolute_path in particular.
6314 * Pure: new flags short_names (default false) and unique_names
6315 (default true) for controlling output of qualified names. If
6316 short_names is set, names are printed unqualified. If unique_names is
6317 reset, the name prefix is reduced to the minimum required to achieve
6318 the original result when interning again, even if there is an overlap
6319 with earlier declarations.
6321 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6322 now 'extend', and 'merge' gets an additional Pretty.pp argument
6323 (useful for printing error messages). INCOMPATIBILITY.
6325 * Pure: major reorganization of the theory context. Type Sign.sg and
6326 Theory.theory are now identified, referring to the universal
6327 Context.theory (see Pure/context.ML). Actual signature and theory
6328 content is managed as theory data. The old code and interfaces were
6329 spread over many files and structures; the new arrangement introduces
6330 considerable INCOMPATIBILITY to gain more clarity:
6332 Context -- theory management operations (name, identity, inclusion,
6333 parents, ancestors, merge, etc.), plus generic theory data;
6335 Sign -- logical signature and syntax operations (declaring consts,
6336 types, etc.), plus certify/read for common entities;
6338 Theory -- logical theory operations (stating axioms, definitions,
6339 oracles), plus a copy of logical signature operations (consts,
6340 types, etc.); also a few basic management operations (Theory.copy,
6343 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6344 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6345 for convenience -- they merely return the theory.
6347 * Pure: type Type.tsig is superceded by theory in most interfaces.
6349 * Pure: the Isar proof context type is already defined early in Pure
6350 as Context.proof (note that ProofContext.context and Proof.context are
6351 aliases, where the latter is the preferred name). This enables other
6352 Isabelle components to refer to that type even before Isar is present.
6354 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6355 typeK, constK, axiomK, oracleK), but provide explicit operations for
6356 any of these kinds. For example, Sign.intern typeK is now
6357 Sign.intern_type, Theory.hide_space Sign.typeK is now
6358 Theory.hide_types. Also note that former
6359 Theory.hide_classes/types/consts are now
6360 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6361 internalize their arguments! INCOMPATIBILITY.
6363 * Pure: get_thm interface (of PureThy and ProofContext) expects
6364 datatype thmref (with constructors Name and NameSelection) instead of
6365 plain string -- INCOMPATIBILITY;
6367 * Pure: cases produced by proof methods specify options, where NONE
6368 means to remove case bindings -- INCOMPATIBILITY in
6371 * Pure: the following operations retrieve axioms or theorems from a
6372 theory node or theory hierarchy, respectively:
6374 Theory.axioms_of: theory -> (string * term) list
6375 Theory.all_axioms_of: theory -> (string * term) list
6376 PureThy.thms_of: theory -> (string * thm) list
6377 PureThy.all_thms_of: theory -> (string * thm) list
6379 * Pure: print_tac now outputs the goal through the trace channel.
6381 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6382 Reference Toplevel.debug (default false) controls detailed printing
6383 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6384 controls execution profiling -- set to 1 for time and 2 for space
6385 (both increase the runtime).
6387 * Isar session: The initial use of ROOT.ML is now always timed,
6388 i.e. the log will show the actual process times, in contrast to the
6389 elapsed wall-clock time that the outer shell wrapper produces.
6391 * Simplifier: improved handling of bound variables (nameless
6392 representation, avoid allocating new strings). Simprocs that invoke
6393 the Simplifier recursively should use Simplifier.inherit_bounds to
6394 avoid local name clashes. Failure to do so produces warnings
6395 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6396 for further details.
6398 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6399 bindings for all theorems stored within a given theory; this may help
6400 in porting non-Isar theories to Isar ones, while keeping ML proof
6401 scripts for the time being.
6403 * ML operator HTML.with_charset specifies the charset begin used for
6404 generated HTML files. For example:
6406 HTML.with_charset "utf-8" use_thy "Hebrew";
6407 HTML.with_charset "utf-8" use_thy "Chinese";
6412 * Allow symlinks to all proper Isabelle executables (Isabelle,
6413 isabelle, isatool etc.).
6415 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6416 isatool doc, isatool mkdir, display_drafts etc.).
6418 * isatool usedir: option -f allows specification of the ML file to be
6419 used by Isabelle; default is ROOT.ML.
6421 * New isatool version outputs the version identifier of the Isabelle
6422 distribution being used.
6424 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6425 (containing Boolean satisfiability problems) into Isabelle/HOL
6430 New in Isabelle2004 (April 2004)
6431 --------------------------------
6435 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6436 Replaces linorder.ML.
6438 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6439 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6440 (\<a>...\<z>), are now considered normal letters, and can therefore
6441 be used anywhere where an ASCII letter (a...zA...Z) has until
6442 now. COMPATIBILITY: This obviously changes the parsing of some
6443 terms, especially where a symbol has been used as a binder, say
6444 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6445 as an identifier. Fix it by inserting a space around former
6446 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6447 existing theory and ML files.
6449 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6451 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6452 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6453 a normal (but invisible) letter. For multiple letter subscripts repeat
6454 \<^isub> like this: x\<^isub>1\<^isub>2.
6456 * Pure: There are now sub-/superscripts that can span more than one
6457 character. Text between \<^bsub> and \<^esub> is set in subscript in
6458 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6459 superscript. The new control characters are not identifier parts.
6461 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6462 content of "..." to the latex file instead of \isacntrl... . The "..."
6463 may consist of any printable characters excluding the end bracket >.
6465 * Pure: Using new Isar command "finalconsts" (or the ML functions
6466 Theory.add_finals or Theory.add_finals_i) it is now possible to
6467 declare constants "final", which prevents their being given a definition
6468 later. It is useful for constants whose behaviour is fixed axiomatically
6469 rather than definitionally, such as the meta-logic connectives.
6471 * Pure: 'instance' now handles general arities with general sorts
6472 (i.e. intersections of classes),
6474 * Presentation: generated HTML now uses a CSS style sheet to make layout
6475 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6476 It can be changed to alter the colors/layout of generated pages.
6481 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6482 cut_tac, subgoal_tac and thin_tac:
6483 - Now understand static (Isar) contexts. As a consequence, users of Isar
6484 locales are no longer forced to write Isar proof scripts.
6485 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6487 - INCOMPATIBILITY: names of variables to be instantiated may no
6488 longer be enclosed in quotes. Instead, precede variable name with `?'.
6489 This is consistent with the instantiation attribute "where".
6491 * Attributes "where" and "of":
6492 - Now take type variables of instantiated theorem into account when reading
6493 the instantiation string. This fixes a bug that caused instantiated
6494 theorems to have too special types in some circumstances.
6495 - "where" permits explicit instantiations of type variables.
6497 * Calculation commands "moreover" and "also" no longer interfere with
6498 current facts ("this"), admitting arbitrary combinations with "then"
6502 - Goal statements involving the context element "includes" no longer
6503 generate theorems with internal delta predicates (those ending on
6504 "_axioms") in the premise.
6505 Resolve particular premise with <locale>.intro to obtain old form.
6506 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6507 specification and "includes" elements in goal statement.
6508 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6509 [intro?] and [elim?] (respectively) by default.
6510 - Experimental command for instantiation of locales in proof contexts:
6511 instantiate <label>[<attrs>]: <loc>
6512 Instantiates locale <loc> and adds all its theorems to the current context
6513 taking into account their attributes. Label and attrs are optional
6514 modifiers, like in theorem declarations. If present, names of
6515 instantiated theorems are qualified with <label>, and the attributes
6516 <attrs> are applied after any attributes these theorems might have already.
6517 If the locale has assumptions, a chained fact of the form
6518 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6519 are derived. The command does not support old-style locales declared
6520 with "locale (open)".
6521 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6523 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6529 * Proof import: new image HOL4 contains the imported library from
6530 the HOL4 system with about 2500 theorems. It is imported by
6531 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6532 can be used like any other Isabelle image. See
6533 HOL/Import/HOL/README for more information.
6536 - Much improved handling of linear and partial orders.
6537 Reasoners for linear and partial orders are set up for type classes
6538 "linorder" and "order" respectively, and are added to the default simpset
6539 as solvers. This means that the simplifier can build transitivity chains
6540 to solve goals from the assumptions.
6541 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6542 of blast or auto after simplification become unnecessary because the goal
6543 is solved by simplification already.
6545 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6546 all proved in axiomatic type classes for semirings, rings and fields.
6549 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6550 now formalized using the Ring_and_Field theory mentioned above.
6551 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6552 than before, because now they are set up once in a generic manner.
6553 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6554 Look for the general versions in Ring_and_Field (and Power if they concern
6557 * Type "rat" of the rational numbers is now available in HOL-Complex.
6560 - Record types are now by default printed with their type abbreviation
6561 instead of the list of all field types. This can be configured via
6562 the reference "print_record_type_abbr".
6563 - Simproc "record_upd_simproc" for simplification of multiple updates added
6564 (not enabled by default).
6565 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6566 EX x. x = sel r to True (not enabled by default).
6567 - Tactic "record_split_simp_tac" to split and simplify records added.
6569 * 'specification' command added, allowing for definition by
6570 specification. There is also an 'ax_specification' command that
6571 introduces the new constants axiomatically.
6573 * arith(_tac) is now able to generate counterexamples for reals as well.
6575 * HOL-Algebra: new locale "ring" for non-commutative rings.
6577 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6578 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6580 * HOL-Matrix: a first theory for matrices in HOL with an application of
6581 matrix theory to linear programming.
6583 * Unions and Intersections:
6584 The latex output syntax of UN and INT has been changed
6585 from "\Union x \in A. B" to "\Union_{x \in A} B"
6586 i.e. the index formulae has become a subscript.
6587 Similarly for "\Union x. B", and for \Inter instead of \Union.
6589 * Unions and Intersections over Intervals:
6590 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6591 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6592 like in normal math, and corresponding versions for < and for intersection.
6594 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6595 lexicographic dictonary ordering has been added as "lexord".
6597 * ML: the legacy theory structures Int and List have been removed. They had
6598 conflicted with ML Basis Library structures having the same names.
6600 * 'refute' command added to search for (finite) countermodels. Only works
6601 for a fragment of HOL. The installation of an external SAT solver is
6602 highly recommended. See "HOL/Refute.thy" for details.
6604 * 'quickcheck' command: Allows to find counterexamples by evaluating
6605 formulae under an assignment of free variables to random values.
6606 In contrast to 'refute', it can deal with inductive datatypes,
6607 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6613 * Streams now come with concatenation and are part of the HOLCF image
6617 New in Isabelle2003 (May 2003)
6618 ------------------------------
6622 * Provers/simplifier:
6624 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6625 Assumptions are now subject to complete mutual simplification,
6626 not just from left to right. The simplifier now preserves
6627 the order of assumptions.
6629 Potential INCOMPATIBILITY:
6631 -- simp sometimes diverges where the old version did
6632 not, e.g. invoking simp on the goal
6634 [| P (f x); y = x; f x = f y |] ==> Q
6636 now gives rise to the infinite reduction sequence
6638 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6640 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6643 -- Tactics combining classical reasoner and simplification (such as auto)
6644 are also affected by this change, because many of them rely on
6645 simp. They may sometimes diverge as well or yield a different numbers
6646 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6647 in case of problems. Sometimes subsequent calls to the classical
6648 reasoner will fail because a preceeding call to the simplifier too
6649 eagerly simplified the goal, e.g. deleted redundant premises.
6651 - The simplifier trace now shows the names of the applied rewrite rules
6653 - You can limit the number of recursive invocations of the simplifier
6654 during conditional rewriting (where the simplifie tries to solve the
6655 conditions before applying the rewrite rule):
6656 ML "simp_depth_limit := n"
6657 where n is an integer. Thus you can force termination where previously
6658 the simplifier would diverge.
6660 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6662 - No longer aborts on failed congruence proof. Instead, the
6663 congruence is ignored.
6665 * Pure: New generic framework for extracting programs from constructive
6666 proofs. See HOL/Extraction.thy for an example instantiation, as well
6667 as HOL/Extraction for some case studies.
6669 * Pure: The main goal of the proof state is no longer shown by default, only
6670 the subgoals. This behaviour is controlled by a new flag.
6671 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6672 (ML: Proof.show_main_goal).
6674 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6675 rules whose conclusion matches subgoal 1:
6676 PG menu: Isabelle/Isar -> Show me -> matching rules
6677 The rules are ordered by how closely they match the subgoal.
6678 In particular, rules that solve a subgoal outright are displayed first
6679 (or rather last, the way they are printed).
6680 (ML: ProofGeneral.print_intros())
6682 * Pure: New flag trace_unify_fail causes unification to print
6683 diagnostic information (PG: in trace buffer) when it fails. This is
6684 useful for figuring out why single step proofs like rule, erule or
6687 * Pure: Locale specifications now produce predicate definitions
6688 according to the body of text (covering assumptions modulo local
6689 definitions); predicate "loc_axioms" covers newly introduced text,
6690 while "loc" is cumulative wrt. all included locale expressions; the
6691 latter view is presented only on export into the global theory
6692 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6693 on the old view without predicates;
6695 * Pure: predefined locales "var" and "struct" are useful for sharing
6696 parameters (as in CASL, for example); just specify something like
6697 ``var x + var y + struct M'' as import;
6699 * Pure: improved thms_containing: proper indexing of facts instead of
6700 raw theorems; check validity of results wrt. current name space;
6701 include local facts of proof configuration (also covers active
6702 locales), cover fixed variables in index; may use "_" in term
6703 specification; an optional limit for the number of printed facts may
6704 be given (the default is 40);
6706 * Pure: disallow duplicate fact bindings within new-style theory files
6709 * Provers: improved induct method: assumptions introduced by case
6710 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6711 the goal statement); "foo" still refers to all facts collectively;
6713 * Provers: the function blast.overloaded has been removed: all constants
6714 are regarded as potentially overloaded, which improves robustness in exchange
6715 for slight decrease in efficiency;
6717 * Provers/linorder: New generic prover for transitivity reasoning over
6718 linear orders. Note: this prover is not efficient!
6720 * Isar: preview of problems to finish 'show' now produce an error
6721 rather than just a warning (in interactive mode);
6728 - Produces a counter example if it cannot prove a goal.
6729 Note that the counter example may be spurious if the goal is not a formula
6730 of quantifier-free linear arithmetic.
6731 In ProofGeneral the counter example appears in the trace buffer.
6733 - Knows about div k and mod k where k is a numeral of type nat or int.
6735 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6736 linear arithmetic fails. This takes account of quantifiers and divisibility.
6737 Presburger arithmetic can also be called explicitly via presburger(_tac).
6739 * simp's arithmetic capabilities have been enhanced a bit: it now
6740 takes ~= in premises into account (by performing a case split);
6742 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6743 are distributed over a sum of terms;
6745 * New tactic "trans_tac" and method "trans" instantiate
6746 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6749 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6750 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6752 * 'typedef' command has new option "open" to suppress the set
6755 * functions Min and Max on finite sets have been introduced (theory
6758 * attribute [symmetric] now works for relations as well; it turns
6759 (x,y) : R^-1 into (y,x) : R, and vice versa;
6761 * induct over a !!-quantified statement (say !!x1..xn):
6762 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6764 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6765 %x. None. Warning: empty_def now refers to the previously hidden definition
6768 * Algebra: formalization of classical algebra. Intended as base for
6769 any algebraic development in Isabelle. Currently covers group theory
6770 (up to Sylow's theorem) and ring theory (Universal Property of
6771 Univariate Polynomials). Contributions welcome;
6773 * GroupTheory: deleted, since its material has been moved to Algebra;
6775 * Complex: new directory of the complex numbers with numeric constants,
6776 nonstandard complex numbers, and some complex analysis, standard and
6777 nonstandard (Jacques Fleuriot);
6779 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6781 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6784 * Real/HahnBanach: updated and adapted to locales;
6786 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6789 * UNITY: added the Meier-Sanders theory of progress sets;
6791 * MicroJava: bytecode verifier and lightweight bytecode verifier
6792 as abstract algorithms, instantiated to the JVM;
6794 * Bali: Java source language formalization. Type system, operational
6795 semantics, axiomatic semantics. Supported language features:
6796 classes, interfaces, objects,virtual methods, static methods,
6797 static/instance fields, arrays, access modifiers, definite
6798 assignment, exceptions.
6803 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6806 * Main ZF: virtually all theories converted to new-style format;
6811 * Pure: Tactic.prove provides sane interface for internal proofs;
6812 omits the infamous "standard" operation, so this is more appropriate
6813 than prove_goalw_cterm in many situations (e.g. in simprocs);
6815 * Pure: improved error reporting of simprocs;
6817 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6821 *** Document preparation ***
6823 * uses \par instead of \\ for line breaks in theory text. This may
6824 shift some page breaks in large documents. To get the old behaviour
6825 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6827 * minimized dependencies of isabelle.sty and isabellesym.sty on
6830 * \<euro> now needs package babel/greek instead of marvosym (which
6833 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6838 New in Isabelle2002 (March 2002)
6839 --------------------------------
6841 *** Document preparation ***
6843 * greatly simplified document preparation setup, including more
6844 graceful interpretation of isatool usedir -i/-d/-D options, and more
6845 instructive isatool mkdir; users should basically be able to get
6846 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6847 users may run a separate document processing stage manually like this:
6848 "isatool usedir -D output HOL Test && isatool document Test/output";
6850 * theory dependency graph may now be incorporated into documents;
6851 isatool usedir -g true will produce session_graph.eps/.pdf for use
6852 with \includegraphics of LaTeX;
6854 * proper spacing of consecutive markup elements, especially text
6855 blocks after section headings;
6857 * support bold style (for single symbols only), input syntax is like
6858 this: "\<^bold>\<alpha>" or "\<^bold>A";
6860 * \<bullet> is now output as bold \cdot by default, which looks much
6861 better in printed text;
6863 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6864 note that these symbols are currently unavailable in Proof General /
6865 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6867 * isatool latex no longer depends on changed TEXINPUTS, instead
6868 isatool document copies the Isabelle style files to the target
6874 * Pure/Provers: improved proof by cases and induction;
6875 - 'case' command admits impromptu naming of parameters (such as
6877 - 'induct' method divinates rule instantiation from the inductive
6878 claim; no longer requires excessive ?P bindings for proper
6879 instantiation of cases;
6880 - 'induct' method properly enumerates all possibilities of set/type
6881 rules; as a consequence facts may be also passed through *type*
6882 rules without further ado;
6883 - 'induct' method now derives symbolic cases from the *rulified*
6884 rule (before it used to rulify cases stemming from the internal
6885 atomized version); this means that the context of a non-atomic
6886 statement becomes is included in the hypothesis, avoiding the
6887 slightly cumbersome show "PROP ?case" form;
6888 - 'induct' may now use elim-style induction rules without chaining
6889 facts, using ``missing'' premises from the goal state; this allows
6890 rules stemming from inductive sets to be applied in unstructured
6891 scripts, while still benefitting from proper handling of non-atomic
6892 statements; NB: major inductive premises need to be put first, all
6893 the rest of the goal is passed through the induction;
6894 - 'induct' proper support for mutual induction involving non-atomic
6895 rule statements (uses the new concept of simultaneous goals, see
6897 - append all possible rule selections, but only use the first
6898 success (no backtracking);
6899 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6900 - undeclared rule case names default to numbers 1, 2, 3, ...;
6901 - added 'print_induct_rules' (covered by help item in recent Proof
6903 - moved induct/cases attributes to Pure, methods to Provers;
6904 - generic method setup instantiated for FOL and HOL;
6906 * Pure: support multiple simultaneous goal statements, for example
6907 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6908 meta-level mechanism, this acts as if several individual goals had
6909 been stated separately; in particular common proof methods need to be
6910 repeated in order to cover all claims; note that a single elimination
6911 step is *not* sufficient to establish the two conjunctions, so this
6914 assume "A & B" then have A and B .. (*".." fails*)
6916 better use "obtain" in situations as above; alternative refer to
6917 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6919 * Pure: proper integration with ``locales''; unlike the original
6920 version by Florian Kammller, Isar locales package high-level proof
6921 contexts rather than raw logical ones (e.g. we admit to include
6922 attributes everywhere); operations on locales include merge and
6923 rename; support for implicit arguments (``structures''); simultaneous
6924 type-inference over imports and text; see also HOL/ex/Locales.thy for
6927 * Pure: the following commands have been ``localized'', supporting a
6928 target locale specification "(in name)": 'lemma', 'theorem',
6929 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6930 stored both within the locale and at the theory level (exported and
6931 qualified by the locale name);
6933 * Pure: theory goals may now be specified in ``long'' form, with
6934 ad-hoc contexts consisting of arbitrary locale elements. for example
6935 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6936 definitions may be given, too); the result is a meta-level rule with
6937 the context elements being discharged in the obvious way;
6939 * Pure: new proof command 'using' allows to augment currently used
6940 facts after a goal statement ('using' is syntactically analogous to
6941 'apply', but acts on the goal's facts only); this allows chained facts
6942 to be separated into parts given before and after a claim, as in
6943 ``from a and b have C using d and e <proof>'';
6945 * Pure: renamed "antecedent" case to "rule_context";
6947 * Pure: new 'judgment' command records explicit information about the
6948 object-logic embedding (used by several tools internally); no longer
6949 use hard-wired "Trueprop";
6951 * Pure: added 'corollary' command;
6953 * Pure: fixed 'token_translation' command;
6955 * Pure: removed obsolete 'exported' attribute;
6957 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6958 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6959 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6961 * Pure: method 'atomize' presents local goal premises as object-level
6962 statements (atomic meta-level propositions); setup controlled via
6963 rewrite rules declarations of 'atomize' attribute; example
6964 application: 'induct' method with proper rule statements in improper
6967 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
6968 now consider the syntactic context of assumptions, giving a better
6969 chance to get type-inference of the arguments right (this is
6970 especially important for locales);
6972 * Pure: "sorry" no longer requires quick_and_dirty in interactive
6975 * Pure/obtain: the formal conclusion "thesis", being marked as
6976 ``internal'', may no longer be reference directly in the text;
6977 potential INCOMPATIBILITY, may need to use "?thesis" in rare
6980 * Pure: generic 'sym' attribute which declares a rule both as pure
6981 'elim?' and for the 'symmetric' operation;
6983 * Pure: marginal comments ``--'' may now occur just anywhere in the
6984 text; the fixed correlation with particular command syntax has been
6987 * Pure: new method 'rules' is particularly well-suited for proof
6988 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
6989 but often produces more compact proof terms with less detours;
6991 * Pure/Provers/classical: simplified integration with pure rule
6992 attributes and methods; the classical "intro?/elim?/dest?"
6993 declarations coincide with the pure ones; the "rule" method no longer
6994 includes classically swapped intros; "intro" and "elim" methods no
6995 longer pick rules from the context; also got rid of ML declarations
6996 AddXIs/AddXEs/AddXDs; all of this has some potential for
6999 * Provers/classical: attribute 'swapped' produces classical inversions
7000 of introduction rules;
7002 * Provers/simplifier: 'simplified' attribute may refer to explicit
7003 rules instead of full simplifier context; 'iff' attribute handles
7006 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7008 * HOL: 'recdef' now fails on unfinished automated proofs, use
7009 "(permissive)" option to recover old behavior;
7011 * HOL: 'inductive' no longer features separate (collective) attributes
7012 for 'intros' (was found too confusing);
7014 * HOL: properly declared induction rules less_induct and
7020 * HOL: moved over to sane numeral syntax; the new policy is as
7023 - 0 and 1 are polymorphic constants, which are defined on any
7024 numeric type (nat, int, real etc.);
7026 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7027 binary representation internally;
7029 - type nat has special constructor Suc, and generally prefers Suc 0
7030 over 1::nat and Suc (Suc 0) over 2::nat;
7032 This change may cause significant problems of INCOMPATIBILITY; here
7033 are some hints on converting existing sources:
7035 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7036 entities, so expressions involving "-" (unary or binary minus) need
7037 to be spaced properly;
7039 - existing occurrences of "1" may need to be constraint "1::nat" or
7040 even replaced by Suc 0; similar for old "2";
7042 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7044 - remove all special provisions on numerals in proofs;
7046 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7047 representation (depends on bin_arith_simps in the default context);
7049 * HOL: symbolic syntax for x^2 (numeral 2);
7051 * HOL: the class of all HOL types is now called "type" rather than
7052 "term"; INCOMPATIBILITY, need to adapt references to this type class
7053 in axclass/classes, instance/arities, and (usually rare) occurrences
7054 in typings (of consts etc.); internally the class is called
7055 "HOL.type", ML programs should refer to HOLogic.typeS;
7057 * HOL/record package improvements:
7058 - new derived operations "fields" to build a partial record section,
7059 "extend" to promote a fixed record to a record scheme, and
7060 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7061 declared as simp by default;
7062 - shared operations ("more", "fields", etc.) now need to be always
7063 qualified) --- potential INCOMPATIBILITY;
7064 - removed "make_scheme" operations (use "make" with "extend") --
7066 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7067 - provides cases/induct rules for use with corresponding Isar
7068 methods (for concrete records, record schemes, concrete more
7069 parts, and schematic more parts -- in that order);
7070 - internal definitions directly based on a light-weight abstract
7071 theory of product types over typedef rather than datatype;
7073 * HOL: generic code generator for generating executable ML code from
7074 specifications; specific support for HOL constructs such as inductive
7075 datatypes and sets, as well as recursive functions; can be invoked
7076 via 'generate_code' theory section;
7078 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7080 * HOL: consolidated and renamed several theories. In particular:
7081 Ord.thy has been absorbed into HOL.thy
7082 String.thy has been absorbed into List.thy
7084 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7085 (beware of argument permutation!);
7087 * HOL: linorder_less_split superseded by linorder_cases;
7089 * HOL/List: "nodups" renamed to "distinct";
7091 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7092 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7093 - Ex_def has changed, now need to use some_eq_ex
7095 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7096 in this (rare) case use:
7098 delSWrapper "split_all_tac"
7099 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7101 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7104 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7105 Isabelle's type classes, ^ on functions and relations has too general
7106 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7107 necessary to attach explicit type constraints;
7109 * HOL/Relation: the prefix name of the infix "O" has been changed from
7110 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7111 renamed accordingly (eg "compI" -> "rel_compI").
7113 * HOL: syntax translations now work properly with numerals and records
7116 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7117 of "lam" -- INCOMPATIBILITY;
7119 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7120 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7121 renamed "Product_Type.unit";
7123 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7125 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7126 the "cases" method);
7128 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7131 * HOL/IMP: updated and converted to new-style theory format; several
7132 parts turned into readable document, with proper Isar proof texts and
7133 some explanations (by Gerwin Klein);
7135 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7137 * HOL-Hyperreal is now a logic image;
7142 * Isar: consts/constdefs supports mixfix syntax for continuous
7145 * Isar: domain package adapted to new-style theory format, e.g. see
7148 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7149 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7150 lift.induct_tac, always use UU instead of Undef;
7152 * HOLCF/IMP: updated and converted to new-style theory;
7157 * Isar: proper integration of logic-specific tools and packages,
7158 including theory commands '(co)inductive', '(co)datatype',
7159 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7160 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7162 * theory Main no longer includes AC; for the Axiom of Choice, base
7163 your theory on Main_ZFC;
7165 * the integer library now covers quotients and remainders, with many
7166 laws relating division to addition, multiplication, etc.;
7168 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7169 typeless version of the formalism;
7171 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7174 * ZF/Induct: new directory for examples of inductive definitions,
7175 including theory Multiset for multiset orderings; converted to
7176 new-style theory format;
7178 * ZF: many new theorems about lists, ordinals, etc.;
7183 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7184 variable proof controls level of detail: 0 = no proofs (only oracle
7185 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7186 also ref manual for further ML interfaces;
7188 * Pure/axclass: removed obsolete ML interface
7189 goal_subclass/goal_arity;
7191 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7192 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7193 separate tokens, so expressions involving minus need to be spaced
7196 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7197 rather than "infixl" or "infixr";
7199 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7200 sort constraint specifications in type inference; e.g. "x::_::foo"
7201 ensures that the type of "x" is of sort "foo" (but not necessarily a
7204 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7205 control output of nested => (types); the default behavior is
7208 * Pure/syntax: builtin parse translation for "_constify" turns valued
7209 tokens into AST constants;
7211 * Pure/syntax: prefer later declarations of translations and print
7212 translation functions; potential INCOMPATIBILITY: need to reverse
7213 multiple declarations for same syntax element constant;
7215 * Pure/show_hyps reset by default (in accordance to existing Isar
7218 * Provers/classical: renamed addaltern to addafter, addSaltern to
7221 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7224 * system: tested support for MacOS X; should be able to get Isabelle +
7225 Proof General to work in a plain Terminal after installing Poly/ML
7226 (e.g. from the Isabelle distribution area) and GNU bash alone
7227 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7228 support requires further installations, e.g. from
7229 http://fink.sourceforge.net/);
7231 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7233 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7234 of 40 MB), cf. ML_OPTIONS;
7236 * system: Proof General keywords specification is now part of the
7237 Isabelle distribution (see etc/isar-keywords.el);
7239 * system: support for persistent Proof General sessions (refrain from
7240 outdating all loaded theories on startup); user may create writable
7241 logic images like this: ``isabelle -q HOL Test'';
7243 * system: smart selection of Isabelle process versus Isabelle
7244 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7245 run both "isabelle" and "Isabelle" even if file names are badly
7246 damaged (executable inspects the case of the first letter of its own
7247 name); added separate "isabelle-process" and "isabelle-interface";
7249 * system: refrain from any attempt at filtering input streams; no
7250 longer support ``8bit'' encoding of old isabelle font, instead proper
7251 iso-latin characters may now be used; the related isatools
7252 "symbolinput" and "nonascii" have disappeared as well;
7254 * system: removed old "xterm" interface (the print modes "xterm" and
7255 "xterm_color" are still available for direct use in a suitable
7260 New in Isabelle99-2 (February 2001)
7261 -----------------------------------
7263 *** Overview of INCOMPATIBILITIES ***
7265 * HOL: please note that theories in the Library and elsewhere often use the
7266 new-style (Isar) format; to refer to their theorems in an ML script you must
7267 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7269 * HOL: inductive package no longer splits induction rule aggressively,
7270 but only as far as specified by the introductions given; the old
7271 format may be recovered via ML function complete_split_rule or attribute
7272 'split_rule (complete)';
7274 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7275 gfp_Tarski to gfp_unfold;
7277 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7279 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7280 relation); infix "^^" has been renamed "``"; infix "``" has been
7281 renamed "`"; "univalent" has been renamed "single_valued";
7283 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7286 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7288 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7290 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7291 consequence, it is no longer monotonic wrt. the local goal context
7292 (which is now passed through the inductive cases);
7294 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7295 \<gg> to \<ggreater>;
7298 *** Document preparation ***
7300 * \isabellestyle{NAME} selects version of Isabelle output (currently
7301 available: are "it" for near math-mode best-style output, "sl" for
7302 slanted text style, and "tt" for plain type-writer; if no
7303 \isabellestyle command is given, output is according to slanted
7306 * support sub/super scripts (for single symbols only), input syntax is
7307 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7309 * some more standard symbols; see Appendix A of the system manual for
7310 the complete list of symbols defined in isabellesym.sty;
7312 * improved isabelle style files; more abstract symbol implementation
7313 (should now use \isamath{...} and \isatext{...} in custom symbol
7316 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7317 state; Note that presentation of goal states does not conform to
7318 actual human-readable proof documents. Please do not include goal
7319 states into document output unless you really know what you are doing!
7321 * proper indentation of antiquoted output with proportional LaTeX
7324 * no_document ML operator temporarily disables LaTeX document
7327 * isatool unsymbolize tunes sources for plain ASCII communication;
7332 * Pure: Isar now suffers initial goal statements to contain unbound
7333 schematic variables (this does not conform to actual readable proof
7334 documents, due to unpredictable outcome and non-compositional proof
7335 checking); users who know what they are doing may use schematic goals
7336 for Prolog-style synthesis of proven results;
7338 * Pure: assumption method (an implicit finishing) now handles actual
7341 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7342 initial goal, declare "that" only as Pure intro (only for single
7343 steps); the "that" rule assumption may now be involved in implicit
7344 finishing, thus ".." becomes a feasible for trivial obtains;
7346 * Pure: default proof step now includes 'intro_classes'; thus trivial
7347 instance proofs may be performed by "..";
7349 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7352 * Pure: more robust selection of calculational rules;
7354 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7355 rule (as well as the assumption rule);
7357 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7358 lemmas, using the graph browser tool;
7360 * Pure: predict failure of "show" in interactive mode;
7362 * Pure: 'thms_containing' now takes actual terms as arguments;
7364 * HOL: improved method 'induct' --- now handles non-atomic goals
7365 (potential INCOMPATIBILITY); tuned error handling;
7367 * HOL: cases and induct rules now provide explicit hints about the
7368 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7369 any remaining facts are inserted into the goal verbatim;
7371 * HOL: local contexts (aka cases) may now contain term bindings as
7372 well; the 'cases' and 'induct' methods new provide a ?case binding for
7373 the result to be shown in each case;
7375 * HOL: added 'recdef_tc' command;
7377 * isatool convert assists in eliminating legacy ML scripts;
7382 * HOL/Library: a collection of generic theories to be used together
7383 with main HOL; the theory loader path already includes this directory
7384 by default; the following existing theories have been moved here:
7385 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7386 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7388 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7389 modelling and verification task performed in Isabelle/HOL +
7390 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7392 * HOL/Algebra: special summation operator SUM no longer exists, it has
7393 been replaced by setsum; infix 'assoc' now has priority 50 (like
7394 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7395 'domain', this makes the theory consistent with mathematical
7398 * HOL basics: added overloaded operations "inverse" and "divide"
7399 (infix "/"), syntax for generic "abs" operation, generic summation
7402 * HOL/typedef: simplified package, provide more useful rules (see also
7405 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7406 now expressed as a proper nested rule (old-style tactic scripts may
7407 require atomize_strip_tac to cope with non-atomic premises);
7409 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7410 to "split_conv" (old name still available for compatibility);
7412 * HOL: improved concrete syntax for strings (e.g. allows translation
7413 rules with string literals);
7415 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7416 and Fleuriot's mechanization of analysis, including the transcendental
7417 functions for the reals;
7419 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7424 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7425 "lam" is displayed as TWO lambda-symbols
7427 * CTT: theory Main now available, containing everything (that is, Bool
7433 * Pure: the Simplifier has been implemented properly as a derived rule
7434 outside of the actual kernel (at last!); the overall performance
7435 penalty in practical applications is about 50%, while reliability of
7436 the Isabelle inference kernel has been greatly improved;
7438 * print modes "brackets" and "no_brackets" control output of nested =>
7439 (types) and ==> (props); the default behaviour is "brackets";
7441 * Provers: fast_tac (and friends) now handle actual object-logic rules
7442 as assumptions as well;
7444 * system: support Poly/ML 4.0;
7446 * system: isatool install handles KDE version 1 or 2;
7450 New in Isabelle99-1 (October 2000)
7451 ----------------------------------
7453 *** Overview of INCOMPATIBILITIES ***
7455 * HOL: simplification of natural numbers is much changed; to partly
7456 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7457 issue the following ML commands:
7459 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7460 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7462 * HOL: simplification no longer dives into case-expressions; this is
7463 controlled by "t.weak_case_cong" for each datatype t;
7465 * HOL: nat_less_induct renamed to less_induct;
7467 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7468 fixsome to patch .thy and .ML sources automatically;
7470 select_equality -> some_equality
7471 select_eq_Ex -> some_eq_ex
7472 selectI2EX -> someI2_ex
7475 select1_equality -> some1_equality
7476 Eps_sym_eq -> some_sym_eq_trivial
7477 Eps_eq -> some_eq_trivial
7479 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7481 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7484 * HOL: the recursion equations generated by 'recdef' are now called
7485 f.simps instead of f.rules;
7487 * HOL: qed_spec_mp now also handles bounded ALL as well;
7489 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7490 sometimes be needed;
7492 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7494 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7496 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7497 product is now "<*>" instead of "Times"; the lexicographic product is
7498 now "<*lex*>" instead of "**";
7500 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7501 of main HOL, but was unused); better use HOL's datatype package;
7503 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7504 the old syntax may be recovered as follows:
7507 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7508 (infixl "\\<oplus>" 100)
7510 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7512 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7513 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7516 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7517 changed from A/r to A//r;
7519 * ZF: new treatment of arithmetic (nat & int) may break some old
7522 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7523 rulify -> rule_format, elimify -> elim_format, ...);
7525 * Isar/Provers: intro/elim/dest attributes changed; renamed
7526 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7527 should have to change intro!! to intro? only); replaced "delrule" by
7530 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7532 * Provers: strengthened force_tac by using new first_best_tac;
7534 * LaTeX document preparation: several changes of isabelle.sty (see
7538 *** Document preparation ***
7540 * formal comments (text blocks etc.) in new-style theories may now
7541 contain antiquotations of thm/prop/term/typ/text to be presented
7542 according to latex print mode; concrete syntax is like this:
7543 @{term[show_types] "f(x) = a + x"};
7545 * isatool mkdir provides easy setup of Isabelle session directories,
7546 including proper document sources;
7548 * generated LaTeX sources are now deleted after successful run
7549 (isatool document -c); may retain a copy somewhere else via -D option
7552 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7553 style files, achieving self-contained LaTeX sources and simplifying
7556 * old-style theories now produce (crude) LaTeX output as well;
7558 * browser info session directories are now self-contained (may be put
7559 on WWW server seperately); improved graphs of nested sessions; removed
7560 graph for 'all sessions';
7562 * several improvements in isabelle style files; \isabellestyle{it}
7563 produces fake math mode output; \isamarkupheader is now \section by
7564 default; see lib/texinputs/isabelle.sty etc.;
7569 * Isar/Pure: local results and corresponding term bindings are now
7570 subject to Hindley-Milner polymorphism (similar to ML); this
7571 accommodates incremental type-inference very nicely;
7573 * Isar/Pure: new derived language element 'obtain' supports
7574 generalized existence reasoning;
7576 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7577 support accumulation of results, without applying any rules yet;
7578 useful to collect intermediate results without explicit name
7579 references, and for use with transitivity rules with more than 2
7582 * Isar/Pure: scalable support for case-analysis type proofs: new
7583 'case' language element refers to local contexts symbolically, as
7584 produced by certain proof methods; internally, case names are attached
7585 to theorems as "tags";
7587 * Isar/Pure: theory command 'hide' removes declarations from
7588 class/type/const name spaces;
7590 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7591 indicate potential overloading;
7593 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7595 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7596 "{a,b,c}" instead of {a,b,c};
7598 * Isar/Pure now provides its own version of intro/elim/dest
7599 attributes; useful for building new logics, but beware of confusion
7600 with the version in Provers/classical;
7602 * Isar/Pure: the local context of (non-atomic) goals is provided via
7603 case name 'antecedent';
7605 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7606 to the current context is now done automatically);
7608 * Isar/Pure: theory command 'method_setup' provides a simple interface
7609 for definining proof methods in ML;
7611 * Isar/Provers: intro/elim/dest attributes changed; renamed
7612 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7613 most cases, one should have to change intro!! to intro? only);
7614 replaced "delrule" by "rule del";
7616 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7617 'symmetric' attribute (the latter supercedes [RS sym]);
7619 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7620 method modifier); 'simp' method: 'only:' modifier removes loopers as
7621 well (including splits);
7623 * Isar/Provers: Simplifier and Classical methods now support all kind
7624 of modifiers used in the past, including 'cong', 'iff', etc.
7626 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7627 of Simplifier and Classical reasoner);
7629 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7630 now support named cases; major packages (inductive, datatype, primrec,
7631 recdef) support case names and properly name parameters;
7633 * Isar/HOL: new transitivity rules for substitution in inequalities --
7634 monotonicity conditions are extracted to be proven at end of
7637 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7640 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7641 split_if split_if_asm; datatype package provides theorems foo.splits =
7642 foo.split foo.split_asm for each datatype;
7644 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7645 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7646 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7647 use "(cases (simplified))" method in proper proof texts);
7649 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7651 * Isar: names of theorems etc. may be natural numbers as well;
7653 * Isar: 'pr' command: optional arguments for goals_limit and
7654 ProofContext.prems_limit; no longer prints theory contexts, but only
7657 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7658 additional print modes to be specified; e.g. "pr(latex)" will print
7659 proof state according to the Isabelle LaTeX style;
7661 * Isar: improved support for emulating tactic scripts, including proof
7662 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7663 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7664 (for HOL datatypes);
7666 * Isar: simplified (more robust) goal selection of proof methods: 1st
7667 goal, all goals, or explicit goal specifier (tactic emulation); thus
7668 'proof method scripts' have to be in depth-first order;
7670 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7672 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7673 should instead use individual commands for printing items
7674 (print_commands, print_methods etc.);
7676 * Isar: added 'nothing' --- the empty list of theorems;
7681 * HOL/MicroJava: formalization of a fragment of Java, together with a
7682 corresponding virtual machine and a specification of its bytecode
7683 verifier and a lightweight bytecode verifier, including proofs of
7684 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7685 Cornelia Pusch (see also the homepage of project Bali at
7686 http://isabelle.in.tum.de/Bali/);
7688 * HOL/Algebra: new theory of rings and univariate polynomials, by
7691 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7692 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7695 * HOL/Lattice: fundamental concepts of lattice theory and order
7696 structures, including duals, properties of bounds versus algebraic
7697 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7698 Theorem for complete lattices etc.; may also serve as a demonstration
7699 for abstract algebraic reasoning using axiomatic type classes, and
7700 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7702 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7705 * HOL/IMPP: extension of IMP with local variables and mutually
7706 recursive procedures, by David von Oheimb;
7708 * HOL/Lambda: converted into new-style theory and document;
7710 * HOL/ex/Multiquote: example of multiple nested quotations and
7711 anti-quotations -- basically a generalized version of de-Bruijn
7712 representation; very useful in avoiding lifting of operations;
7714 * HOL/record: added general record equality rule to simpset; fixed
7715 select-update simplification procedure to handle extended records as
7716 well; admit "r" as field name;
7718 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7719 other numeric types and also as the identity of groups, rings, etc.;
7721 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7722 Types nat and int belong to this axclass;
7724 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7725 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7726 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7727 two terms #m*u and #n*u are replaced by #(m+n)*u
7728 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7729 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7730 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7732 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7733 powerful prover for predicate logic but knows nothing of clasets; see
7734 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7736 * HOL: new version of "case_tac" subsumes both boolean case split and
7737 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7738 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7740 * HOL: simplification no longer dives into case-expressions: only the
7741 selector expression is simplified, but not the remaining arms; to
7742 enable full simplification of case-expressions for datatype t, you may
7743 remove t.weak_case_cong from the simpset, either globally (Delcongs
7744 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7746 * HOL/recdef: the recursion equations generated by 'recdef' for
7747 function 'f' are now called f.simps instead of f.rules; if all
7748 termination conditions are proved automatically, these simplification
7749 rules are added to the simpset, as in primrec; rules may be named
7750 individually as well, resulting in a separate list of theorems for
7753 * HOL/While is a new theory that provides a while-combinator. It
7754 permits the definition of tail-recursive functions without the
7755 provision of a termination measure. The latter is necessary once the
7756 invariant proof rule for while is applied.
7758 * HOL: new (overloaded) notation for the set of elements below/above
7759 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7761 * HOL: theorems impI, allI, ballI bound as "strip";
7763 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7764 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7765 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7767 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7769 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7770 main HOL, but was unused);
7772 * HOL: fewer consts declared as global (e.g. have to refer to
7773 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7775 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7776 in case of overlap with user translations (e.g. judgements over
7777 tuples); (note that the underlying logical represenation is still
7783 * ZF: simplification automatically cancels common terms in arithmetic
7784 expressions over nat and int;
7786 * ZF: new treatment of nat to minimize type-checking: all operators
7787 coerce their operands to a natural number using the function natify,
7788 making the algebraic laws unconditional;
7790 * ZF: as above, for int: operators coerce their operands to an integer
7791 using the function intify;
7793 * ZF: the integer library now contains many of the usual laws for the
7794 orderings, including $<=, and monotonicity laws for $+ and $*;
7796 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7799 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7800 to the simplifier and classical reasoner simultaneously;
7805 * Provers: blast_tac now handles actual object-logic rules as
7806 assumptions; note that auto_tac uses blast_tac internally as well;
7808 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7809 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7811 * Provers: delrules now handles destruct rules as well (no longer need
7812 explicit make_elim);
7814 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7815 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7816 use instead the strong form,
7817 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7818 in HOL, FOL and ZF the function cla_make_elim will create such rules
7819 from destruct-rules;
7821 * Provers: Simplifier.easy_setup provides a fast path to basic
7822 Simplifier setup for new object-logics;
7824 * Pure: AST translation rules no longer require constant head on LHS;
7826 * Pure: improved name spaces: ambiguous output is qualified; support
7827 for hiding of names;
7829 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7830 XSYMBOL_HOME; no longer need to do manual configuration in most
7833 * system: compression of ML heaps images may now be controlled via -c
7834 option of isabelle and isatool usedir (currently only observed by
7837 * system: isatool installfonts may handle X-Symbol fonts as well (very
7838 useful for remote X11);
7840 * system: provide TAGS file for Isabelle sources;
7842 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7845 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7846 timing flag supersedes proof_timing and Toplevel.trace;
7848 * ML: new combinators |>> and |>>> for incremental transformations
7849 with secondary results (e.g. certain theory extensions):
7851 * ML: PureThy.add_defs gets additional argument to indicate potential
7852 overloading (usually false);
7854 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7859 New in Isabelle99 (October 1999)
7860 --------------------------------
7862 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7864 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7865 are no longer simplified. (This allows the simplifier to unfold recursive
7866 functional programs.) To restore the old behaviour, declare
7868 Delcongs [if_weak_cong];
7870 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7873 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7875 * HOL/datatype: mutual_induct_tac no longer exists --
7876 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7878 * HOL/typedef: fixed type inference for representing set; type
7879 arguments now have to occur explicitly on the rhs as type constraints;
7881 * ZF: The con_defs part of an inductive definition may no longer refer
7882 to constants declared in the same theory;
7884 * HOL, ZF: the function mk_cases, generated by the inductive
7885 definition package, has lost an argument. To simplify its result, it
7886 uses the default simpset instead of a supplied list of theorems.
7888 * HOL/List: the constructors of type list are now Nil and Cons;
7890 * Simplifier: the type of the infix ML functions
7891 setSSolver addSSolver setSolver addSolver
7892 is now simpset * solver -> simpset where `solver' is a new abstract type
7893 for packaging solvers. A solver is created via
7894 mk_solver: string -> (thm list -> int -> tactic) -> solver
7895 where the string argument is only a comment.
7900 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7901 decision procedure for linear arithmetic. Currently it is used for
7902 types `nat', `int', and `real' in HOL (see below); it can, should and
7903 will be instantiated for other types and logics as well.
7905 * The simplifier now accepts rewrite rules with flexible heads, eg
7906 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7907 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7913 * New Isabelle/Isar subsystem provides an alternative to traditional
7914 tactical theorem proving; together with the ProofGeneral/isar user
7915 interface it offers an interactive environment for developing human
7916 readable proof documents (Isar == Intelligible semi-automated
7917 reasoning); for further information see isatool doc isar-ref,
7918 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7920 * improved and simplified presentation of theories: better HTML markup
7921 (including colors), graph views in several sizes; isatool usedir now
7922 provides a proper interface for user theories (via -P option); actual
7923 document preparation based on (PDF)LaTeX is available as well (for
7924 new-style theories only); see isatool doc system for more information;
7926 * native support for Proof General, both for classic Isabelle and
7929 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7930 using the graph browser tool;
7932 * Isabelle manuals now also available as PDF;
7934 * theory loader rewritten from scratch (may not be fully
7935 bug-compatible); old loadpath variable has been replaced by show_path,
7936 add_path, del_path, reset_path functions; new operations such as
7937 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7940 * improved isatool install: option -k creates KDE application icon,
7941 option -p DIR installs standalone binaries;
7943 * added ML_PLATFORM setting (useful for cross-platform installations);
7944 more robust handling of platform specific ML images for SML/NJ;
7946 * the settings environment is now statically scoped, i.e. it is never
7947 created again in sub-processes invoked from isabelle, isatool, or
7950 * path element specification '~~' refers to '$ISABELLE_HOME';
7952 * in locales, the "assumes" and "defines" parts may be omitted if
7955 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7958 * new print_mode "HTML";
7960 * new flag show_tags controls display of tags of theorems (which are
7961 basically just comments that may be attached by some tools);
7963 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7964 mode and goal output format:
7966 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
7968 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
7970 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
7971 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
7973 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
7975 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
7977 * function bind_thms stores lists of theorems (cf. bind_thm);
7979 * new shorthand tactics ftac, eatac, datac, fatac;
7981 * qed (and friends) now accept "" as result name; in that case the
7982 theorem is not stored, but proper checks and presentation of the
7985 * theorem database now also indexes constants "Trueprop", "all",
7986 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7991 ** HOL arithmetic **
7993 * There are now decision procedures for linear arithmetic over nat and
7996 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7997 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7998 are treated as atomic; subformulae not involving type `nat' or `int'
7999 are ignored; quantified subformulae are ignored unless they are
8000 positive universal or negative existential. The tactic has to be
8001 invoked by hand and can be a little bit slow. In particular, the
8002 running time is exponential in the number of occurrences of `min' and
8003 `max', and `-' on `nat'.
8005 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8006 (negated) (in)equalities among the premises and the conclusion into
8007 account (i.e. no compound formulae) and does not know about `min' and
8008 `max', and `-' on `nat'. It is fast and is used automatically by the
8011 NB: At the moment, these decision procedures do not cope with mixed
8012 nat/int formulae where the two parts interact, such as `m < n ==>
8015 * HOL/Numeral provides a generic theory of numerals (encoded
8016 efficiently as bit strings); setup for types nat/int/real is in place;
8017 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8018 int, existing theories and proof scripts may require a few additional
8021 * integer division and remainder can now be performed on constant
8024 * many properties of integer multiplication, division and remainder
8027 * An interface to the Stanford Validity Checker (SVC) is available through the
8028 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8029 are proved automatically. SVC must be installed separately, and its results
8030 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8031 invocation of the underlying oracle). For SVC see
8032 http://verify.stanford.edu/SVC
8034 * IsaMakefile: the HOL-Real target now builds an actual image;
8039 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8040 (in Isabelle/Isar) -- by Gertrud Bauer;
8042 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8043 analysis for assembly languages with subtypes;
8045 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8046 -- avoids syntactic ambiguities and treats state, transition, and
8047 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8048 changed syntax and (many) tactics;
8050 * HOL/inductive: Now also handles more general introduction rules such
8051 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8052 theorems are now maintained within the theory (maintained via the
8055 * HOL/datatype: Now also handles arbitrarily branching datatypes
8056 (using function types) such as
8058 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8060 * HOL/record: record_simproc (part of the default simpset) takes care
8061 of selectors applied to updated records; record_split_tac is no longer
8062 part of the default claset; update_defs may now be removed from the
8063 simpset in many cases; COMPATIBILITY: old behavior achieved by
8065 claset_ref () := claset() addSWrapper record_split_wrapper;
8066 Delsimprocs [record_simproc]
8068 * HOL/typedef: fixed type inference for representing set; type
8069 arguments now have to occur explicitly on the rhs as type constraints;
8071 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8072 names rather than an ML expression;
8074 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8075 supplied later. Program schemes can be defined, such as
8076 "While B C s = (if B s then While B C (C s) else s)"
8077 where the well-founded relation can be chosen after B and C have been given.
8079 * HOL/List: the constructors of type list are now Nil and Cons;
8080 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8081 course, ML tools referring to List.list.op # etc. have to be adapted;
8083 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8084 disabled by default; run isabelle with option -m HOL to get back to
8085 the original Gordon/HOL-style output;
8087 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8088 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8090 * HOL basic syntax simplified (more orthogonal): all variants of
8091 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8092 Eps operator is provided as well: "SOME x. P[x]";
8094 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8096 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8097 thus available for user theories;
8099 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8100 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8103 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8104 several times and then mp;
8109 * the notation <<...>> is now available as a notation for sequences of
8112 * the simplifier is now installed
8114 * the axiom system has been generalized (thanks to Soren Heilmann)
8116 * the classical reasoner now has a default rule database
8121 * new primrec section allows primitive recursive functions to be given
8122 directly (as in HOL) over datatypes and the natural numbers;
8124 * new tactics induct_tac and exhaust_tac for induction (or case
8125 analysis) over datatypes and the natural numbers;
8127 * the datatype declaration of type T now defines the recursor T_rec;
8129 * simplification automatically does freeness reasoning for datatype
8132 * automatic type-inference, with AddTCs command to insert new
8133 type-checking rules;
8135 * datatype introduction rules are now added as Safe Introduction rules
8138 * the syntax "if P then x else y" is now available in addition to
8142 *** Internal programming interfaces ***
8144 * tuned simplifier trace output; new flag debug_simp;
8146 * structures Vartab / Termtab (instances of TableFun) offer efficient
8147 tables indexed by indexname_ord / term_ord (compatible with aconv);
8149 * AxClass.axclass_tac lost the theory argument;
8151 * tuned current_goals_markers semantics: begin / end goal avoids
8152 printing empty lines;
8154 * removed prs and prs_fn hook, which was broken because it did not
8155 include \n in its semantics, forcing writeln to add one
8156 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8157 string -> unit if you really want to output text without newline;
8159 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8160 plain output, interface builders may have to enable 'isabelle_font'
8161 mode to get Isabelle font glyphs as before;
8163 * refined token_translation interface; INCOMPATIBILITY: output length
8164 now of type real instead of int;
8166 * theory loader actions may be traced via new ThyInfo.add_hook
8167 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8168 your own database of information attached to *whole* theories -- as
8169 opposed to intra-theory data slots offered via TheoryDataFun;
8171 * proper handling of dangling sort hypotheses (at last!);
8172 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8173 extra sort hypotheses that can be witnessed from the type signature;
8174 the force_strip_shyps flag is gone, any remaining shyps are simply
8175 left in the theorem (with a warning issued by strip_shyps_warning);
8179 New in Isabelle98-1 (October 1998)
8180 ----------------------------------
8182 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8184 * several changes of automated proof tools;
8186 * HOL: major changes to the inductive and datatype packages, including
8187 some minor incompatibilities of theory syntax;
8189 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8192 * HOL: removed duplicate thms in Arith:
8193 less_imp_add_less should be replaced by trans_less_add1
8194 le_imp_add_le should be replaced by trans_le_add1
8196 * HOL: unary minus is now overloaded (new type constraints may be
8199 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8200 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8201 now taken as an integer constant.
8203 * Pure: ML function 'theory_of' renamed to 'theory';
8209 1. Asm_full_simp_tac is now more aggressive.
8210 1. It will sometimes reorient premises if that increases their power to
8212 2. It does no longer proceed strictly from left to right but may also
8213 rotate premises to achieve further simplification.
8214 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8215 old Asm_full_simp_tac in that it does not rotate premises.
8216 2. The simplifier now knows a little bit about nat-arithmetic.
8218 * Classical reasoner: wrapper mechanism for the classical reasoner now
8219 allows for selected deletion of wrappers, by introduction of names for
8220 wrapper functionals. This implies that addbefore, addSbefore,
8221 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8222 and that adding two tactics with the same name overwrites the first
8223 one (emitting a warning).
8224 type wrapper = (int -> tactic) -> (int -> tactic)
8225 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8226 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8227 delWrapper, delSWrapper: claset * string -> claset
8228 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8230 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8231 semantics; addbefore now affects only the unsafe part of step_tac
8232 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8233 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8236 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8237 compWrapper; added safe wrapper (and access functions for it);
8239 * HOL/split_all_tac is now much faster and fails if there is nothing
8240 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8241 and the names of the automatically generated variables have changed.
8242 split_all_tac has moved within claset() from unsafe wrappers to safe
8243 wrappers, which means that !!-bound variables are split much more
8244 aggressively, and safe_tac and clarify_tac now split such variables.
8245 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8246 Note: the same holds for record_split_tac, which does the job of
8247 split_all_tac for record fields.
8249 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8250 permanently to the default simpset using Addsplits just like
8251 Addsimps. They can be removed via Delsplits just like
8252 Delsimps. Lower-case versions are also available.
8254 * HOL/Simplifier: The rule split_if is now part of the default
8255 simpset. This means that the simplifier will eliminate all occurrences
8256 of if-then-else in the conclusion of a goal. To prevent this, you can
8257 either remove split_if completely from the default simpset by
8258 `Delsplits [split_if]' or remove it in a specific call of the
8259 simplifier using `... delsplits [split_if]'. You can also add/delete
8260 other case splitting rules to/from the default simpset: every datatype
8261 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8262 t is the name of the datatype).
8264 * Classical reasoner / Simplifier combination: new force_tac (and
8265 derivatives Force_tac, force) combines rewriting and classical
8266 reasoning (and whatever other tools) similarly to auto_tac, but is
8267 aimed to solve the given subgoal completely.
8272 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8273 and `goalw': the theory is no longer needed as an explicit argument -
8274 the current theory context is used; assumptions are no longer returned
8275 at the ML-level unless one of them starts with ==> or !!; it is
8276 recommended to convert to these new commands using isatool fixgoal
8277 (backup your sources first!);
8279 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8280 the current theory context, and 'theory' to lookup stored theories;
8282 * new theory section 'locale' for declaring constants, assumptions and
8283 definitions that have local scope;
8285 * new theory section 'nonterminals' for purely syntactic types;
8287 * new theory section 'setup' for generic ML setup functions
8288 (e.g. package initialization);
8290 * the distribution now includes Isabelle icons: see
8291 lib/logo/isabelle-{small,tiny}.xpm;
8293 * isatool install - install binaries with absolute references to
8296 * isatool logo -- create instances of the Isabelle logo (as EPS);
8298 * print mode 'emacs' reserved for Isamode;
8300 * support multiple print (ast) translations per constant name;
8302 * theorems involving oracles are now printed with a suffixed [!];
8307 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8309 * HOL/inductive package reorganized and improved: now supports mutual
8315 oddI "n : EVEN ==> Suc n : ODD"
8316 evenI "n : ODD ==> Suc n : EVEN"
8318 new theorem list "elims" contains an elimination rule for each of the
8319 recursive sets; inductive definitions now handle disjunctive premises
8320 correctly (also ZF);
8322 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8323 "mutual_induct" no longer exists - the induction rule is always
8324 contained in "induct";
8327 * HOL/datatype package re-implemented and greatly improved: now
8328 supports mutually recursive datatypes such as
8331 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8332 | SUM ('a aexp) ('a aexp)
8333 | DIFF ('a aexp) ('a aexp)
8336 'a bexp = LESS ('a aexp) ('a aexp)
8337 | AND ('a bexp) ('a bexp)
8338 | OR ('a bexp) ('a bexp)
8340 as well as indirectly recursive datatypes such as
8343 ('a, 'b) term = Var 'a
8344 | App 'b ((('a, 'b) term) list)
8346 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8347 induction on mutually / indirectly recursive datatypes.
8349 Primrec equations are now stored in theory and can be accessed via
8350 <function_name>.simps.
8354 - Theories using datatypes must now have theory Datatype as an
8356 - The specific <typename>.induct_tac no longer exists - use the
8357 generic induct_tac instead.
8358 - natE has been renamed to nat.exhaust - use exhaust_tac
8359 instead of res_inst_tac ... natE. Note that the variable
8360 names in nat.exhaust differ from the names in natE, this
8361 may cause some "fragile" proofs to fail.
8362 - The theorems split_<typename>_case and split_<typename>_case_asm
8363 have been renamed to <typename>.split and <typename>.split_asm.
8364 - Since default sorts of type variables are now handled correctly,
8365 some datatype definitions may have to be annotated with explicit
8367 - Primrec definitions no longer require function name and type
8368 of recursive argument.
8370 Consider using isatool fixdatatype to adapt your theories and proof
8371 scripts to the new package (backup your sources first!).
8374 * HOL/record package: considerably improved implementation; now
8375 includes concrete syntax for record types, terms, updates; theorems
8376 for surjective pairing and splitting !!-bound record variables; proof
8377 support is as follows:
8379 1) standard conversions (selectors or updates applied to record
8380 constructor terms) are part of the standard simpset;
8382 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8383 made part of standard simpset and claset via addIffs;
8385 3) a tactic for record field splitting (record_split_tac) is part of
8386 the standard claset (addSWrapper);
8388 To get a better idea about these rules you may retrieve them via
8389 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8390 the name of your record type.
8392 The split tactic 3) conceptually simplifies by the following rule:
8394 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8396 Thus any record variable that is bound by meta-all will automatically
8397 blow up into some record constructor term, consequently the
8398 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8399 solve record problems automatically.
8402 * reorganized the main HOL image: HOL/Integ and String loaded by
8403 default; theory Main includes everything;
8405 * automatic simplification of integer sums and comparisons, using cancellation;
8407 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8409 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8411 * many new identities for unions, intersections, set difference, etc.;
8413 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8414 called split_if, split_split, split_sum_case and split_nat_case (to go
8415 with add/delsplits);
8417 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8418 (?x::unit) = (); this is made part of the default simpset, which COULD
8419 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8420 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8421 unit_abs_eta_conv is added in order to counter the effect of
8422 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8425 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8428 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8429 It and 'sym RS equals0D' are now in the default claset, giving automatic
8430 disjointness reasoning but breaking a few old proofs.
8432 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8433 to 'converse' from 'inverse' (for compatibility with ZF and some
8436 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8437 the well-founded relation;
8439 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8440 Compl A. The "Compl" syntax remains available as input syntax for this
8443 * HOL/Update: new theory of function updates:
8444 f(a:=b) == %x. if x=a then b else f x
8445 may also be iterated as in f(a:=b,c:=d,...);
8447 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8450 - new function list_update written xs[i:=v] that updates the i-th
8451 list position. May also be iterated as in xs[i:=a,j:=b,...].
8452 - new function `upt' written [i..j(] which generates the list
8453 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8454 bound write [i..j], which is a shorthand for [i..j+1(].
8455 - new lexicographic orderings and corresponding wellfoundedness theorems.
8458 - removed 'pred' (predecessor) function;
8459 - generalized some theorems about n-1;
8460 - many new laws about "div" and "mod";
8461 - new laws about greatest common divisors (see theory ex/Primes);
8463 * HOL/Relation: renamed the relational operator r^-1 "converse"
8464 instead of "inverse";
8466 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8467 of the multiset ordering;
8469 * directory HOL/Real: a construction of the reals using Dedekind cuts
8470 (not included by default);
8472 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8474 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8475 programs, i.e. different program variables may have different types.
8477 * calling (stac rew i) now fails if "rew" has no effect on the goal
8478 [previously, this check worked only if the rewrite rule was unconditional]
8479 Now rew can involve either definitions or equalities (either == or =).
8484 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8485 only the theorems proved on ZF.ML;
8487 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8488 It and 'sym RS equals0D' are now in the default claset, giving automatic
8489 disjointness reasoning but breaking a few old proofs.
8491 * ZF/Update: new theory of function updates
8492 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8493 may also be iterated as in f(a:=b,c:=d,...);
8495 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8497 * calling (stac rew i) now fails if "rew" has no effect on the goal
8498 [previously, this check worked only if the rewrite rule was unconditional]
8499 Now rew can involve either definitions or equalities (either == or =).
8501 * case_tac provided for compatibility with HOL
8502 (like the old excluded_middle_tac, but with subgoals swapped)
8505 *** Internal programming interfaces ***
8507 * Pure: several new basic modules made available for general use, see
8508 also src/Pure/README;
8510 * improved the theory data mechanism to support encapsulation (data
8511 kind name replaced by private Object.kind, acting as authorization
8512 key); new type-safe user interface via functor TheoryDataFun; generic
8513 print_data function becomes basically useless;
8515 * removed global_names compatibility flag -- all theory declarations
8516 are qualified by default;
8518 * module Pure/Syntax now offers quote / antiquote translation
8519 functions (useful for Hoare logic etc. with implicit dependencies);
8520 see HOL/ex/Antiquote for an example use;
8522 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8525 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8528 * Display.print_goals function moved to Locale.print_goals;
8530 * standard print function for goals supports current_goals_markers
8531 variable for marking begin of proof, end of proof, start of goal; the
8532 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8533 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8538 New in Isabelle98 (January 1998)
8539 --------------------------------
8541 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8543 * changed lexical syntax of terms / types: dots made part of long
8544 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8546 * simpset (and claset) reference variable replaced by functions
8547 simpset / simpset_ref;
8549 * no longer supports theory aliases (via merge) and non-trivial
8550 implicit merge of thms' signatures;
8552 * most internal names of constants changed due to qualified names;
8554 * changed Pure/Sequence interface (see Pure/seq.ML);
8557 *** General Changes ***
8559 * hierachically structured name spaces (for consts, types, axms, thms
8560 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8561 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8562 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8563 long_names for fully qualified output names; NOTE: ML programs
8564 (special tactics, packages etc.) referring to internal names may have
8565 to be adapted to cope with fully qualified names; in case of severe
8566 backward campatibility problems try setting 'global_names' at compile
8567 time to have enrything declared within a flat name space; one may also
8568 fine tune name declarations in theories via the 'global' and 'local'
8571 * reimplemented the implicit simpset and claset using the new anytype
8572 data filed in signatures; references simpset:simpset ref etc. are
8573 replaced by functions simpset:unit->simpset and
8574 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8575 to patch your ML files accordingly;
8577 * HTML output now includes theory graph data for display with Java
8578 applet or isatool browser; data generated automatically via isatool
8579 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8581 * defs may now be conditional; improved rewrite_goals_tac to handle
8582 conditional equations;
8584 * defs now admits additional type arguments, using TYPE('a) syntax;
8586 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8587 creates a new theory node; implicit merge of thms' signatures is
8588 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8589 transfer:theory->thm->thm in (rare) cases;
8591 * improved handling of draft signatures / theories; draft thms (and
8592 ctyps, cterms) are automatically promoted to real ones;
8594 * slightly changed interfaces for oracles: admit many per theory, named
8595 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8597 * print_goals: optional output of const types (set show_consts and
8600 * improved output of warnings (###) and errors (***);
8602 * subgoal_tac displays a warning if the new subgoal has type variables;
8604 * removed old README and Makefiles;
8606 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8608 * removed obsolete init_pps and init_database;
8610 * deleted the obsolete tactical STATE, which was declared by
8611 fun STATE tacfun st = tacfun st st;
8613 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8614 (which abbreviates $HOME);
8616 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8617 use isatool fixseq to adapt your ML programs (this works for fully
8618 qualified references to the Sequence structure only!);
8620 * use_thy no longer requires writable current directory; it always
8621 reloads .ML *and* .thy file, if either one is out of date;
8624 *** Classical Reasoner ***
8626 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8627 tactics that use classical reasoning to simplify a subgoal without
8628 splitting it into several subgoals;
8630 * Safe_tac: like safe_tac but uses the default claset;
8635 * added simplification meta rules:
8636 (asm_)(full_)simplify: simpset -> thm -> thm;
8638 * simplifier.ML no longer part of Pure -- has to be loaded by object
8641 * added prems argument to simplification procedures;
8643 * HOL, FOL, ZF: added infix function `addsplits':
8644 instead of `<simpset> setloop (split_tac <thms>)'
8645 you can simply write `<simpset> addsplits <thms>'
8650 * TYPE('a) syntax for type reflection terms;
8652 * no longer handles consts with name "" -- declare as 'syntax' instead;
8654 * pretty printer: changed order of mixfix annotation preference (again!);
8656 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8661 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8662 with `addloop' of the simplifier to faciliate case splitting in premises.
8664 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8666 * HOL/Auth: new protocol proofs including some for the Internet
8669 * HOL/Map: new theory of `maps' a la VDM;
8671 * HOL/simplifier: simplification procedures nat_cancel_sums for
8672 cancelling out common nat summands from =, <, <= (in)equalities, or
8673 differences; simplification procedures nat_cancel_factor for
8674 cancelling common factor from =, <, <= (in)equalities over natural
8675 sums; nat_cancel contains both kinds of procedures, it is installed by
8676 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8678 * HOL/simplifier: terms of the form
8679 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8681 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8682 and those of the form
8683 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8685 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8688 Each datatype `t' now comes with a theorem `split_t_case' of the form
8690 P(t_case f1 ... fn x) =
8691 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8693 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8696 and a theorem `split_t_case_asm' of the form
8698 P(t_case f1 ... fn x) =
8699 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8701 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8703 which can be added to a simpset via `addsplits'. The existing theorems
8704 expand_list_case and expand_option_case have been renamed to
8705 split_list_case and split_option_case.
8708 - `pred n' is automatically converted to `n-1'.
8709 Users are strongly encouraged not to use `pred' any longer,
8710 because it will disappear altogether at some point.
8711 - Users are strongly encouraged to write "0 < n" rather than
8712 "n ~= 0". Theorems and proof tools have been modified towards this
8716 the function "set_of_list" has been renamed "set" (and its theorems too);
8717 the function "nth" now takes its arguments in the reverse order and
8718 has acquired the infix notation "!" as in "xs!n".
8720 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8722 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8723 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8725 * HOL/record: extensible records with schematic structural subtyping
8726 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8727 still lacks various theorems and concrete record syntax;
8732 * removed "axioms" and "generated by" sections;
8734 * replaced "ops" section by extended "consts" section, which is capable of
8735 handling the continuous function space "->" directly;
8738 . proves theorems immediately and stores them in the theory,
8739 . creates hierachical name space,
8740 . now uses normal mixfix annotations (instead of cinfix...),
8741 . minor changes to some names and values (for consistency),
8742 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8743 . separator between mutual domain defs: changed "," to "and",
8744 . improved handling of sort constraints; now they have to
8745 appear on the left-hand side of the equations only;
8747 * fixed LAM <x,y,zs>.b syntax;
8749 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8750 adm (%x. P (t x)), where P is chainfinite and t continuous;
8755 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8756 with `addloop' of the simplifier to faciliate case splitting in premises.
8758 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8759 in HOL, they strip ALL and --> from proved theorems;
8763 New in Isabelle94-8 (May 1997)
8764 ------------------------------
8766 *** General Changes ***
8768 * new utilities to build / run / maintain Isabelle etc. (in parts
8769 still somewhat experimental); old Makefiles etc. still functional;
8771 * new 'Isabelle System Manual';
8773 * INSTALL text, together with ./configure and ./build scripts;
8775 * reimplemented type inference for greater efficiency, better error
8776 messages and clean internal interface;
8778 * prlim command for dealing with lots of subgoals (an easier way of
8779 setting goals_limit);
8784 * supports alternative (named) syntax tables (parser and pretty
8785 printer); internal interface is provided by add_modesyntax(_i);
8787 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8788 be used in conjunction with the Isabelle symbol font; uses the
8789 "symbols" syntax table;
8791 * added token_translation interface (may translate name tokens in
8792 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8793 the current print_mode); IMPORTANT: user print translation functions
8794 are responsible for marking newly introduced bounds
8795 (Syntax.mark_boundT);
8797 * token translations for modes "xterm" and "xterm_color" that display
8798 names in bold, underline etc. or colors (which requires a color
8801 * infixes may now be declared with names independent of their syntax;
8803 * added typed_print_translation (like print_translation, but may
8804 access type of constant);
8807 *** Classical Reasoner ***
8809 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8810 some limitations. Blast_tac...
8811 + ignores addss, addbefore, addafter; this restriction is intrinsic
8812 + ignores elimination rules that don't have the correct format
8813 (the conclusion MUST be a formula variable)
8814 + ignores types, which can make HOL proofs fail
8815 + rules must not require higher-order unification, e.g. apply_type in ZF
8816 [message "Function Var's argument not a bound variable" relates to this]
8817 + its proof strategy is more general but can actually be slower
8819 * substitution with equality assumptions no longer permutes other
8822 * minor changes in semantics of addafter (now called addaltern); renamed
8823 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8824 (and access functions for it);
8826 * improved combination of classical reasoner and simplifier:
8827 + functions for handling clasimpsets
8828 + improvement of addss: now the simplifier is called _after_ the
8830 + safe variant of addss called addSss: uses safe simplifications
8831 _during_ the safe steps. It is more complete as it allows multiple
8832 instantiations of unknowns (e.g. with slow_tac).
8836 * added interface for simplification procedures (functions that
8837 produce *proven* rewrite rules on the fly, depending on current
8840 * ordering on terms as parameter (used for ordered rewriting);
8842 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8844 * the solver is now split into a safe and an unsafe part.
8845 This should be invisible for the normal user, except that the
8846 functions setsolver and addsolver have been renamed to setSolver and
8847 addSolver; added safe_asm_full_simp_tac;
8852 * a generic induction tactic `induct_tac' which works for all datatypes and
8853 also for type `nat';
8855 * a generic case distinction tactic `exhaust_tac' which works for all
8856 datatypes and also for type `nat';
8858 * each datatype comes with a function `size';
8860 * patterns in case expressions allow tuple patterns as arguments to
8861 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8863 * primrec now also works with type nat;
8865 * recdef: a new declaration form, allows general recursive functions to be
8866 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8868 * the constant for negation has been renamed from "not" to "Not" to
8869 harmonize with FOL, ZF, LK, etc.;
8871 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8874 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8876 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8877 problems in commutative rings, using axiomatic type classes for + and *;
8879 * more examples in HOL/MiniML and HOL/Auth;
8881 * more default rewrite rules for quantifiers, union/intersection;
8883 * a new constant `arbitrary == @x.False';
8885 * HOLCF/IOA replaces old HOL/IOA;
8887 * HOLCF changes: derived all rules and arities
8888 + axiomatic type classes instead of classes
8889 + typedef instead of faking type definitions
8890 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8891 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8892 + eliminated the types void, one, tr
8893 + use unit lift and bool lift (with translations) instead of one and tr
8894 + eliminated blift from Lift3.thy (use Def instead of blift)
8895 all eliminated rules are derived as theorems --> no visible changes ;
8900 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8901 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8902 as ZF_cs addSIs [equalityI];
8906 New in Isabelle94-7 (November 96)
8907 ---------------------------------
8909 * allowing negative levels (as offsets) in prlev and choplev;
8911 * super-linear speedup for large simplifications;
8913 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8914 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8915 FAIL); can suppress it using the command Delsimps (ex_simps @
8916 all_simps); De Morgan laws are also now included, by default;
8918 * improved printing of ==> : ~:
8920 * new object-logic "Sequents" adds linear logic, while replacing LK
8921 and Modal (thanks to Sara Kalvala);
8923 * HOL/Auth: correctness proofs for authentication protocols;
8925 * HOL: new auto_tac combines rewriting and classical reasoning (many
8926 examples on HOL/Auth);
8928 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8929 the rewriter and classical reasoner simultaneously;
8931 * function uresult no longer returns theorems in "standard" format;
8932 regain previous version by: val uresult = standard o uresult;
8939 * oracles -- these establish an interface between Isabelle and trusted
8940 external reasoners, which may deliver results as theorems;
8942 * proof objects (in particular record all uses of oracles);
8944 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8946 * "constdefs" section in theory files;
8948 * "primrec" section (HOL) no longer requires names;
8950 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8957 * reduced space requirements;
8959 * automatic HTML generation from theories;
8961 * theory files no longer require "..." (quotes) around most types;
8963 * new examples, including two proofs of the Church-Rosser theorem;
8965 * non-curried (1994) version of HOL is no longer distributed;
8972 * greatly reduced space requirements;
8974 * theory files (.thy) no longer require \...\ escapes at line breaks;
8976 * searchable theorem database (see the section "Retrieving theorems" on
8977 page 8 of the Reference Manual);
8979 * new examples, including Grabczewski's monumental case study of the
8982 * The previous version of HOL renamed to Old_HOL;
8984 * The new version of HOL (previously called CHOL) uses a curried syntax
8985 for functions. Application looks like f a b instead of f(a,b);
8987 * Mutually recursive inductive definitions finally work in HOL;
8989 * In ZF, pattern-matching on tuples is now available in all abstractions and
8990 translates to the operator "split";
8997 * new infix operator, addss, allowing the classical reasoner to
8998 perform simplification at each step of its search. Example:
8999 fast_tac (cs addss ss)
9001 * a new logic, CHOL, the same as HOL, but with a curried syntax
9002 for functions. Application looks like f a b instead of f(a,b). Also pairs
9003 look like (a,b) instead of <a,b>;
9005 * PLEASE NOTE: CHOL will eventually replace HOL!
9007 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9008 It translates to the operator "split". A new theory of integers is available;
9010 * In ZF, integer numerals now denote two's-complement binary integers.
9011 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9013 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9014 of the Axiom of Choice;
9021 * Significantly faster resolution;
9023 * the different sections in a .thy file can now be mixed and repeated
9026 * Database of theorems for FOL, HOL and ZF. New
9027 commands including qed, qed_goal and bind_thm store theorems in the database.
9029 * Simple database queries: return a named theorem (get_thm) or all theorems of
9030 a given theory (thms_of), or find out what theory a theorem was proved in
9033 * Bugs fixed in the inductive definition and datatype packages;
9035 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9036 and HOL_dup_cs obsolete;
9038 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9041 * Simpler definition of function space in ZF;
9043 * new results about cardinal and ordinal arithmetic in ZF;
9045 * 'subtype' facility in HOL for introducing new types as subsets of existing
9048 :mode=text:wrap=hard:maxLineLen=72: