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 * Rule attributes in local theory declarations (e.g. locale or class)
15 are now statically evaluated: the resulting theorem is stored instead
16 of the original expression. INCOMPATIBILITY in rare situations, where
17 the historic accident of dynamic re-evaluation in interpretations
20 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
21 declaration, and results are standardized before being stored. Thus
22 old-style "standard" after instantiation or composition of facts
23 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
24 indices of schematic variables.
26 * Renamed inner syntax categories "num" to "num_token" and "xnum" to
27 "xnum_token", in accordance to existing "float_token". Minor
28 INCOMPATIBILITY. Note that in practice "num_const" etc. are mainly
34 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
35 instead. INCOMPATIBILITY.
37 * Ancient code generator for SML and its commands 'code_module',
38 'code_library', 'consts_code', 'types_code' have been discontinued.
39 Use commands of the generic code generator instead. INCOMPATIBILITY.
41 * Redundant attribute 'code_inline' has been discontinued. Use
42 'code_unfold' instead. INCOMPATIBILITY.
44 * Dropped attribute 'code_unfold_post' in favor of the its dual
45 'code_abbrev', which yields a common pattern in definitions like
47 definition [code_abbrev]: "f = t"
51 * Sort constraints are now propagated in simultaneous statements, just
52 like type constraints. INCOMPATIBILITY in rare situations, where
53 distinct sorts used to be assigned accidentally. For example:
55 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
57 lemma "P (x::'a)" and "Q (y::'a::bar)"
58 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
63 * Type 'a set is now a proper type constructor (just as before
64 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
65 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
66 sets separate, it is often sufficient to rephrase sets S accidentally
67 used as predicates by "%x. x : S" and predicates P accidentally used
68 as sets by "{x. P x}". Corresponding proofs in a first step should be
69 pruned from any tinkering with former theorems mem_def and
70 Collect_def. For developments which deliberately mixed predicates and
71 sets, a planning step is necessary to determine what should become a
72 predicate and what a set. It can be helpful to carry out that step in
73 Isabelle2011-1 before jumping right into the current release.
75 * Consolidated various theorem names relating to Finite_Set.fold
78 inf_INFI_fold_inf ~> inf_INF_fold_inf
79 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
80 INFI_fold_inf ~> INF_fold_inf
81 SUPR_fold_sup ~> SUP_fold_sup
82 union_set ~> union_set_fold
83 minus_set ~> minus_set_fold
87 * Consolidated theorem names concerning fold combinators:
89 INFI_set_fold ~> INF_set_fold
90 SUPR_set_fold ~> SUP_set_fold
91 INF_code ~> INF_set_foldr
92 SUP_code ~> SUP_set_foldr
93 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
94 foldl.simps ~> foldl_Nil foldl_Cons
95 foldr_fold_rev ~> foldr_def
96 foldl_fold ~> foldl_def
100 * Dropped rarely useful theorems concerning fold combinators:
101 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
102 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
103 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
104 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
105 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
106 Prefer "List.fold" with canonical argument order, or boil down
107 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
108 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
109 and "List.foldl plus 0", prefer "List.listsum".
111 * Concrete syntax for case expressions includes constraints for source
112 positions, and thus produces Prover IDE markup for its bindings.
113 INCOMPATIBILITY for old-style syntax translations that augment the
114 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
117 * Discontinued configuration option "syntax_positions": atomic terms
118 in parse trees are always annotated by position constraints.
120 * Finite_Set.fold now qualified. INCOMPATIBILITY.
122 * Renamed some facts on canonical fold on lists, in order to avoid
123 problems with interpretation involving corresponding facts on foldl
124 with the same base names:
126 fold_set_remdups ~> fold_set_fold_remdups
127 fold_set ~> fold_set_fold
128 fold1_set ~> fold1_set_fold
132 * Theory HOL/Library/AList has been renamed to
133 AList_Impl. INCOMPATIBILITY.
135 * 'datatype' specifications allow explicit sort constraints.
137 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
138 use theory HOL/Library/Nat_Bijection instead.
140 * Session HOL-Word: Discontinued many redundant theorems specific to
141 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
144 word_sub_alt ~> word_sub_wi
145 word_add_alt ~> word_add_def
146 word_mult_alt ~> word_mult_def
147 word_minus_alt ~> word_minus_def
148 word_0_alt ~> word_0_wi
149 word_1_alt ~> word_1_wi
150 word_add_0 ~> add_0_left
151 word_add_0_right ~> add_0_right
152 word_mult_1 ~> mult_1_left
153 word_mult_1_right ~> mult_1_right
154 word_add_commute ~> add_commute
155 word_add_assoc ~> add_assoc
156 word_add_left_commute ~> add_left_commute
157 word_mult_commute ~> mult_commute
158 word_mult_assoc ~> mult_assoc
159 word_mult_left_commute ~> mult_left_commute
160 word_left_distrib ~> left_distrib
161 word_right_distrib ~> right_distrib
162 word_left_minus ~> left_minus
163 word_diff_0_right ~> diff_0_right
164 word_diff_self ~> diff_self
165 word_sub_def ~> diff_minus
166 word_diff_minus ~> diff_minus
167 word_add_ac ~> add_ac
168 word_mult_ac ~> mult_ac
169 word_plus_ac0 ~> add_0_left add_0_right add_ac
170 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
171 word_order_trans ~> order_trans
172 word_order_refl ~> order_refl
173 word_order_antisym ~> order_antisym
174 word_order_linear ~> linorder_linear
175 lenw1_zero_neq_one ~> zero_neq_one
176 word_number_of_eq ~> number_of_eq
177 word_of_int_add_hom ~> wi_hom_add
178 word_of_int_sub_hom ~> wi_hom_sub
179 word_of_int_mult_hom ~> wi_hom_mult
180 word_of_int_minus_hom ~> wi_hom_neg
181 word_of_int_succ_hom ~> wi_hom_succ
182 word_of_int_pred_hom ~> wi_hom_pred
183 word_of_int_0_hom ~> word_0_wi
184 word_of_int_1_hom ~> word_1_wi
186 * Clarified attribute "mono_set": pure declaration without modifying
187 the result of the fact expression.
189 * "Transitive_Closure.ntrancl": bounded transitive closure on
192 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
194 * "sublists" moved to theory More_List. INCOMPATIBILITY.
196 * Theory Int: Discontinued many legacy theorems specific to type int.
197 INCOMPATIBILITY, use the corresponding generic theorems instead.
199 zminus_zminus ~> minus_minus
200 zminus_0 ~> minus_zero
201 zminus_zadd_distrib ~> minus_add_distrib
202 zadd_commute ~> add_commute
203 zadd_assoc ~> add_assoc
204 zadd_left_commute ~> add_left_commute
208 zadd_0_right ~> add_0_right
209 zadd_zminus_inverse2 ~> left_minus
210 zmult_zminus ~> mult_minus_left
211 zmult_commute ~> mult_commute
212 zmult_assoc ~> mult_assoc
213 zadd_zmult_distrib ~> left_distrib
214 zadd_zmult_distrib2 ~> right_distrib
215 zdiff_zmult_distrib ~> left_diff_distrib
216 zdiff_zmult_distrib2 ~> right_diff_distrib
217 zmult_1 ~> mult_1_left
218 zmult_1_right ~> mult_1_right
219 zle_refl ~> order_refl
220 zle_trans ~> order_trans
221 zle_antisym ~> order_antisym
222 zle_linear ~> linorder_linear
223 zless_linear ~> linorder_less_linear
224 zadd_left_mono ~> add_left_mono
225 zadd_strict_right_mono ~> add_strict_right_mono
226 zadd_zless_mono ~> add_less_le_mono
227 int_0_less_1 ~> zero_less_one
228 int_0_neq_1 ~> zero_neq_one
230 zpower_zadd_distrib ~> power_add
231 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
232 zero_le_zpower_abs ~> zero_le_power_abs
234 * Theory Deriv: Renamed
236 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
238 * New "case_product" attribute to generate a case rule doing multiple
239 case distinctions at the same time. E.g.
241 list.exhaust [case_product nat.exhaust]
243 produces a rule which can be used to perform case distinction on both
246 * Improved code generation of multisets.
249 - Quickcheck returns variable assignments as counterexamples, which
250 allows to reveal the underspecification of functions under test.
251 For example, refuting "hd xs = x", it presents the variable
252 assignment xs = [] and x = a1 as a counterexample, assuming that
253 any property is false whenever "hd []" occurs in it.
254 These counterexample are marked as potentially spurious, as
255 Quickcheck also returns "xs = []" as a counterexample to the
256 obvious theorem "hd xs = hd xs".
257 After finding a potentially spurious counterexample, Quickcheck
258 continues searching for genuine ones.
259 By default, Quickcheck shows potentially spurious and genuine
260 counterexamples. The option "genuine_only" sets quickcheck to
261 only show genuine counterexamples.
263 - The command 'quickcheck_generator' creates random and exhaustive
264 value generators for a given type and operations.
265 It generates values by using the operations as if they were
266 constructors of that type.
268 - Support for multisets.
271 - Fixed infinite loop caused by the 'peephole_optim' option and
272 affecting 'rat' and 'real'.
275 - Added "lam_trans" and "minimize" options.
276 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
279 - Added possibility to specify lambda translations scheme as a
280 parenthesized argument (e.g., "by (metis (lam_lifting) ...)").
285 * New "case_product" attribute (see HOL).
290 * Antiquotation @{attributes [...]} embeds attribute source
291 representation into the ML text, which is particularly useful with
292 declarations like Local_Theory.note.
294 * Structure Proof_Context follows standard naming scheme. Old
295 ProofContext has been discontinued. INCOMPATIBILITY.
297 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
298 change of semantics: update is applied to auxiliary local theory
301 * Modernized some old-style infix operations:
303 addeqcongs ~> Simplifier.add_eqcong
304 deleqcongs ~> Simplifier.del_eqcong
305 addcongs ~> Simplifier.add_cong
306 delcongs ~> Simplifier.del_cong
307 setmksimps ~> Simplifier.set_mksimps
308 setmkcong ~> Simplifier.set_mkcong
309 setmksym ~> Simplifier.set_mksym
310 setmkeqTrue ~> Simplifier.set_mkeqTrue
311 settermless ~> Simplifier.set_termless
312 setsubgoaler ~> Simplifier.set_subgoaler
313 addsplits ~> Splitter.add_split
314 delsplits ~> Splitter.del_split
318 New in Isabelle2011-1 (October 2011)
319 ------------------------------------
323 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
324 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
326 - Management of multiple theory files directly from the editor
327 buffer store -- bypassing the file-system (no requirement to save
330 - Markup of formal entities within the text buffer, with semantic
331 highlighting, tooltips and hyperlinks to jump to defining source
334 - Improved text rendering, with sub/superscripts in the source
335 buffer (including support for copy/paste wrt. output panel, HTML
336 theory output and other non-Isabelle text boxes).
338 - Refined scheduling of proof checking and printing of results,
339 based on interactive editor view. (Note: jEdit folding and
340 narrowing allows to restrict buffer perspectives explicitly.)
342 - Reduced CPU performance requirements, usable on machines with few
345 - Reduced memory requirements due to pruning of unused document
346 versions (garbage collection).
348 See also ~~/src/Tools/jEdit/README.html for further information,
349 including some remaining limitations.
351 * Theory loader: source files are exclusively located via the master
352 directory of each theory node (where the .thy file itself resides).
353 The global load path (such as src/HOL/Library) has been discontinued.
354 Note that the path element ~~ may be used to reference theories in the
355 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
358 * Theory loader: source files are identified by content via SHA1
359 digests. Discontinued former path/modtime identification and optional
360 ISABELLE_FILE_IDENT plugin scripts.
362 * Parallelization of nested Isar proofs is subject to
363 Goal.parallel_proofs_threshold (default 100). See also isabelle
366 * Name space: former unsynchronized references are now proper
367 configuration options, with more conventional names:
369 long_names ~> names_long
370 short_names ~> names_short
371 unique_names ~> names_unique
373 Minor INCOMPATIBILITY, need to declare options in context like this:
375 declare [[names_unique = false]]
377 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
378 that the result needs to be unique, which means fact specifications
379 may have to be refined after enriching a proof context.
381 * Attribute "case_names" has been refined: the assumptions in each case
382 can be named now by following the case name with [name1 name2 ...].
384 * Isabelle/Isar reference manual has been updated and extended:
385 - "Synopsis" provides a catalog of main Isar language concepts.
386 - Formal references in syntax diagrams, via @{rail} antiquotation.
387 - Updated material from classic "ref" manual, notably about
388 "Classical Reasoner".
393 * Class bot and top require underlying partial order rather than
394 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
396 * Class complete_lattice: generalized a couple of lemmas from sets;
397 generalized theorems INF_cong and SUP_cong. New type classes for
398 complete boolean algebras and complete linear orders. Lemmas
399 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
400 class complete_linorder.
402 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
403 Sup_fun_def, Inf_apply, Sup_apply.
405 Removed redundant lemmas (the right hand side gives hints how to
406 replace them for (metis ...), or (simp only: ...) proofs):
408 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
409 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
410 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
411 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
412 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
413 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
414 Inter_def ~> INF_def, image_def
415 Union_def ~> SUP_def, image_def
416 INT_eq ~> INF_def, and image_def
417 UN_eq ~> SUP_def, and image_def
418 INF_subset ~> INF_superset_mono [OF _ order_refl]
420 More consistent and comprehensive names:
422 INTER_eq_Inter_image ~> INF_def
423 UNION_eq_Union_image ~> SUP_def
427 INF_leI2 ~> INF_lower2
428 le_INFI ~> INF_greatest
430 le_SUPI2 ~> SUP_upper2
432 INFI_bool_eq ~> INF_bool_eq
433 SUPR_bool_eq ~> SUP_bool_eq
434 INFI_apply ~> INF_apply
435 SUPR_apply ~> SUP_apply
436 INTER_def ~> INTER_eq
437 UNION_def ~> UNION_eq
441 * Renamed theory Complete_Lattice to Complete_Lattices.
444 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
445 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
446 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
447 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
449 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
450 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
451 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
454 * Added syntactic classes "inf" and "sup" for the respective
455 constants. INCOMPATIBILITY: Changes in the argument order of the
456 (mostly internal) locale predicates for some derived classes.
458 * Theorem collections ball_simps and bex_simps do not contain theorems
459 referring to UNION any longer; these have been moved to collection
460 UN_ball_bex_simps. INCOMPATIBILITY.
462 * Theory Archimedean_Field: floor now is defined as parameter of a
463 separate type class floor_ceiling.
465 * Theory Finite_Set: more coherent development of fold_set locales:
467 locale fun_left_comm ~> locale comp_fun_commute
468 locale fun_left_comm_idem ~> locale comp_fun_idem
470 Both use point-free characterization; interpretation proofs may need
471 adjustment. INCOMPATIBILITY.
473 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
474 accordance with standard mathematical terminology. INCOMPATIBILITY.
476 * Theory Complex_Main: The locale interpretations for the
477 bounded_linear and bounded_bilinear locales have been removed, in
478 order to reduce the number of duplicate lemmas. Users must use the
479 original names for distributivity theorems, potential INCOMPATIBILITY.
481 divide.add ~> add_divide_distrib
482 divide.diff ~> diff_divide_distrib
483 divide.setsum ~> setsum_divide_distrib
484 mult.add_right ~> right_distrib
485 mult.diff_right ~> right_diff_distrib
486 mult_right.setsum ~> setsum_right_distrib
487 mult_left.diff ~> left_diff_distrib
489 * Theory Complex_Main: Several redundant theorems have been removed or
490 replaced by more general versions. INCOMPATIBILITY.
492 real_diff_def ~> minus_real_def
493 real_divide_def ~> divide_real_def
494 real_less_def ~> less_le
495 real_abs_def ~> abs_real_def
496 real_sgn_def ~> sgn_real_def
497 real_mult_commute ~> mult_commute
498 real_mult_assoc ~> mult_assoc
499 real_mult_1 ~> mult_1_left
500 real_add_mult_distrib ~> left_distrib
501 real_zero_not_eq_one ~> zero_neq_one
502 real_mult_inverse_left ~> left_inverse
503 INVERSE_ZERO ~> inverse_zero
504 real_le_refl ~> order_refl
505 real_le_antisym ~> order_antisym
506 real_le_trans ~> order_trans
507 real_le_linear ~> linear
508 real_le_eq_diff ~> le_iff_diff_le_0
509 real_add_left_mono ~> add_left_mono
510 real_mult_order ~> mult_pos_pos
511 real_mult_less_mono2 ~> mult_strict_left_mono
512 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
513 real_0_le_divide_iff ~> zero_le_divide_iff
514 realpow_two_disj ~> power2_eq_iff
515 real_squared_diff_one_factored ~> square_diff_one_factored
516 realpow_two_diff ~> square_diff_square_factored
517 reals_complete2 ~> complete_real
518 real_sum_squared_expand ~> power2_sum
519 exp_ln_eq ~> ln_unique
521 expi_zero ~> exp_zero
522 lemma_DERIV_subst ~> DERIV_cong
523 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
524 LIMSEQ_const ~> tendsto_const
525 LIMSEQ_norm ~> tendsto_norm
526 LIMSEQ_add ~> tendsto_add
527 LIMSEQ_minus ~> tendsto_minus
528 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
529 LIMSEQ_diff ~> tendsto_diff
530 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
531 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
532 LIMSEQ_mult ~> tendsto_mult
533 LIMSEQ_inverse ~> tendsto_inverse
534 LIMSEQ_divide ~> tendsto_divide
535 LIMSEQ_pow ~> tendsto_power
536 LIMSEQ_setsum ~> tendsto_setsum
537 LIMSEQ_setprod ~> tendsto_setprod
538 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
539 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
540 LIMSEQ_imp_rabs ~> tendsto_rabs
541 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
542 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
543 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
544 LIMSEQ_Complex ~> tendsto_Complex
545 LIM_ident ~> tendsto_ident_at
546 LIM_const ~> tendsto_const
547 LIM_add ~> tendsto_add
548 LIM_add_zero ~> tendsto_add_zero
549 LIM_minus ~> tendsto_minus
550 LIM_diff ~> tendsto_diff
551 LIM_norm ~> tendsto_norm
552 LIM_norm_zero ~> tendsto_norm_zero
553 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
554 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
555 LIM_rabs ~> tendsto_rabs
556 LIM_rabs_zero ~> tendsto_rabs_zero
557 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
558 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
559 LIM_compose ~> tendsto_compose
560 LIM_mult ~> tendsto_mult
561 LIM_scaleR ~> tendsto_scaleR
562 LIM_of_real ~> tendsto_of_real
563 LIM_power ~> tendsto_power
564 LIM_inverse ~> tendsto_inverse
565 LIM_sgn ~> tendsto_sgn
566 isCont_LIM_compose ~> isCont_tendsto_compose
567 bounded_linear.LIM ~> bounded_linear.tendsto
568 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
569 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
570 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
571 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
572 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
573 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
575 * Theory Complex_Main: The definition of infinite series was
576 generalized. Now it is defined on the type class {topological_space,
577 comm_monoid_add}. Hence it is useable also for extended real numbers.
579 * Theory Complex_Main: The complex exponential function "expi" is now
580 a type-constrained abbreviation for "exp :: complex => complex"; thus
581 several polymorphic lemmas about "exp" are now applicable to "expi".
585 - Theory Library/Code_Char_ord provides native ordering of
586 characters in the target language.
588 - Commands code_module and code_library are legacy, use export_code
591 - Method "evaluation" is legacy, use method "eval" instead.
593 - Legacy evaluator "SML" is deactivated by default. May be
594 reactivated by the following theory command:
596 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
598 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
600 * New proof method "induction" that gives induction hypotheses the
601 name "IH", thus distinguishing them from further hypotheses that come
602 from rule induction. The latter are still called "hyps". Method
603 "induction" is a thin wrapper around "induct" and follows the same
606 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
607 still available as a legacy feature for some time.
610 - Added "need" and "total_consts" options.
611 - Reintroduced "show_skolems" option by popular demand.
612 - Renamed attribute: nitpick_def ~> nitpick_unfold.
616 - Use quasi-sound (and efficient) translations by default.
617 - Added support for the following provers: E-ToFoF, LEO-II,
618 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
619 - Automatically preplay and minimize proofs before showing them if
620 this can be done within reasonable time.
621 - sledgehammer available_provers ~> sledgehammer supported_provers.
623 - Added "preplay_timeout", "slicing", "type_enc", "sound",
624 "max_mono_iters", and "max_new_mono_instances" options.
625 - Removed "explicit_apply" and "full_types" options as well as "Full
626 Types" Proof General menu item. INCOMPATIBILITY.
629 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
630 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
634 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
635 "elim:" options. INCOMPATIBILITY.
636 - Introduced 'try' that not only runs 'try_methods' but also
637 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
640 - Added "eval" option to evaluate terms for the found counterexample
641 (currently only supported by the default (exhaustive) tester).
642 - Added post-processing of terms to obtain readable counterexamples
643 (currently only supported by the default (exhaustive) tester).
644 - New counterexample generator quickcheck[narrowing] enables
645 narrowing-based testing. Requires the Glasgow Haskell compiler
646 with its installation location defined in the Isabelle settings
647 environment as ISABELLE_GHC.
648 - Removed quickcheck tester "SML" based on the SML code generator
649 (formly in HOL/Library).
651 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
652 use 'partial_function' instead.
654 * Theory Library/Extended_Reals replaces now the positive extended
655 reals found in probability theory. This file is extended by
656 Multivariate_Analysis/Extended_Real_Limits.
658 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
659 from where it must be imported explicitly if it is really required.
662 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
663 been moved here. INCOMPATIBILITY.
665 * Theory Library/Saturated provides type of numbers with saturated
668 * Theory Library/Product_Lattice defines a pointwise ordering for the
669 product type 'a * 'b, and provides instance proofs for various order
670 and lattice type classes.
672 * Theory Library/Countable now provides the "countable_datatype" proof
673 method for proving "countable" class instances for datatypes.
675 * Theory Library/Cset_Monad allows do notation for computable sets
676 (cset) via the generic monad ad-hoc overloading facility.
678 * Library: Theories of common data structures are split into theories
679 for implementation, an invariant-ensuring type, and connection to an
680 abstract type. INCOMPATIBILITY.
682 - RBT is split into RBT and RBT_Mapping.
683 - AssocList is split and renamed into AList and AList_Mapping.
684 - DList is split into DList_Impl, DList, and DList_Cset.
685 - Cset is split into Cset and List_Cset.
687 * Theory Library/Nat_Infinity has been renamed to
688 Library/Extended_Nat, with name changes of the following types and
691 type inat ~> type enat
693 Infty ~> infinity (overloaded)
697 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
698 been renamed accordingly. INCOMPATIBILITY.
700 * Session Multivariate_Analysis: The euclidean_space type class now
701 fixes a constant "Basis :: 'a set" consisting of the standard
702 orthonormal basis for the type. Users now have the option of
703 quantifying over this set instead of using the "basis" function, e.g.
704 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
706 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
707 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
708 "Cart_nth" and "Cart_lambda" have been respectively renamed to
709 "vec_nth" and "vec_lambda"; theorems mentioning those names have
710 changed to match. Definition theorems for overloaded constants now use
711 the standard "foo_vec_def" naming scheme. A few other theorems have
712 been renamed as follows (INCOMPATIBILITY):
714 Cart_eq ~> vec_eq_iff
715 dist_nth_le_cart ~> dist_vec_nth_le
716 tendsto_vector ~> vec_tendstoI
717 Cauchy_vector ~> vec_CauchyI
719 * Session Multivariate_Analysis: Several duplicate theorems have been
720 removed, and other theorems have been renamed or replaced with more
721 general versions. INCOMPATIBILITY.
723 finite_choice ~> finite_set_choice
724 eventually_conjI ~> eventually_conj
725 eventually_and ~> eventually_conj_iff
726 eventually_false ~> eventually_False
727 setsum_norm ~> norm_setsum
728 Lim_sequentially ~> LIMSEQ_def
729 Lim_ident_at ~> LIM_ident
730 Lim_const ~> tendsto_const
731 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
732 Lim_neg ~> tendsto_minus
733 Lim_add ~> tendsto_add
734 Lim_sub ~> tendsto_diff
735 Lim_mul ~> tendsto_scaleR
736 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
737 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
738 Lim_linear ~> bounded_linear.tendsto
739 Lim_component ~> tendsto_euclidean_component
740 Lim_component_cart ~> tendsto_vec_nth
741 Lim_inner ~> tendsto_inner [OF tendsto_const]
742 dot_lsum ~> inner_setsum_left
743 dot_rsum ~> inner_setsum_right
744 continuous_cmul ~> continuous_scaleR [OF continuous_const]
745 continuous_neg ~> continuous_minus
746 continuous_sub ~> continuous_diff
747 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
748 continuous_mul ~> continuous_scaleR
749 continuous_inv ~> continuous_inverse
750 continuous_at_within_inv ~> continuous_at_within_inverse
751 continuous_at_inv ~> continuous_at_inverse
752 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
753 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
754 continuous_at_component ~> continuous_component [OF continuous_at_id]
755 continuous_on_neg ~> continuous_on_minus
756 continuous_on_sub ~> continuous_on_diff
757 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
758 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
759 continuous_on_mul ~> continuous_on_scaleR
760 continuous_on_mul_real ~> continuous_on_mult
761 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
762 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
763 continuous_on_inverse ~> continuous_on_inv
764 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
765 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
766 subset_interior ~> interior_mono
767 subset_closure ~> closure_mono
768 closure_univ ~> closure_UNIV
769 real_arch_lt ~> reals_Archimedean2
770 real_arch ~> reals_Archimedean3
771 real_abs_norm ~> abs_norm_cancel
772 real_abs_sub_norm ~> norm_triangle_ineq3
773 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
775 * Session HOL-Probability:
776 - Caratheodory's extension lemma is now proved for ring_of_sets.
777 - Infinite products of probability measures are now available.
778 - Sigma closure is independent, if the generator is independent
779 - Use extended reals instead of positive extended
780 reals. INCOMPATIBILITY.
782 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
784 expand_fun_below ~> fun_below_iff
785 below_fun_ext ~> fun_belowI
786 expand_cfun_eq ~> cfun_eq_iff
788 expand_cfun_below ~> cfun_below_iff
789 below_cfun_ext ~> cfun_belowI
790 monofun_fun_fun ~> fun_belowD
791 monofun_fun_arg ~> monofunE
792 monofun_lub_fun ~> adm_monofun [THEN admD]
793 cont_lub_fun ~> adm_cont [THEN admD]
794 cont2cont_Rep_CFun ~> cont2cont_APP
795 cont_Rep_CFun_app ~> cont_APP_app
796 cont_Rep_CFun_app_app ~> cont_APP_app_app
797 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
798 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
799 contlub_cfun ~> lub_APP [symmetric]
800 contlub_LAM ~> lub_LAM [symmetric]
803 lift_distinct1 ~> lift.distinct(1)
804 lift_distinct2 ~> lift.distinct(2)
805 Def_not_UU ~> lift.distinct(2)
806 Def_inject ~> lift.inject
807 below_UU_iff ~> below_bottom_iff
808 eq_UU_iff ~> eq_bottom_iff
811 *** Document preparation ***
813 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
814 isar-ref manual, both for description and actual application of the
817 * Antiquotation @{value} evaluates the given term and presents its
820 * Antiquotations: term style "isub" provides ad-hoc conversion of
821 variables x1, y23 into subscripted form x\<^isub>1,
824 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
825 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
827 * Localized \isabellestyle switch can be used within blocks or groups
830 \isabellestyle{it} %preferred default
831 {\isabellestylett @{text "typewriter stuff"}}
833 * Discontinued special treatment of hard tabulators. Implicit
834 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
840 * The inner syntax of sort/type/term/prop supports inlined YXML
841 representations within quoted string tokens. By encoding logical
842 entities via Term_XML (in ML or Scala) concrete syntax can be
843 bypassed, which is particularly useful for producing bits of text
844 under external program control.
846 * Antiquotations for ML and document preparation are managed as theory
847 data, which requires explicit setup.
849 * Isabelle_Process.is_active allows tools to check if the official
850 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
851 (better known as Proof General).
853 * Structure Proof_Context follows standard naming scheme. Old
854 ProofContext is still available for some time as legacy alias.
856 * Structure Timing provides various operations for timing; supersedes
857 former start_timing/end_timing etc.
859 * Path.print is the official way to show file-system paths to users
860 (including quotes etc.).
862 * Inner syntax: identifiers in parse trees of generic categories
863 "logic", "aprop", "idt" etc. carry position information (disguised as
864 type constraints). Occasional INCOMPATIBILITY with non-compliant
865 translations that choke on unexpected type constraints. Positions can
866 be stripped in ML translations via Syntax.strip_positions /
867 Syntax.strip_positions_ast, or via the syntax constant
868 "_strip_positions" within parse trees. As last resort, positions can
869 be disabled via the configuration option Syntax.positions, which is
870 called "syntax_positions" in Isar attribute syntax.
872 * Discontinued special status of various ML structures that contribute
873 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
874 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
875 refer directly to Ast.Constant, Lexicon.is_identifier,
876 Syntax_Trans.mk_binder_tr etc.
878 * Typed print translation: discontinued show_sorts argument, which is
879 already available via context of "advanced" translation.
881 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
882 goal states; body tactic needs to address all subgoals uniformly.
884 * Slightly more special eq_list/eq_set, with shortcut involving
885 pointer equality (assumes that eq relation is reflexive).
887 * Classical tactics use proper Proof.context instead of historic types
888 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
889 operate directly on Proof.context. Raw type claset retains its use as
890 snapshot of the classical context, which can be recovered via
891 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
892 INCOMPATIBILITY, classical tactics and derived proof methods require
893 proper Proof.context.
898 * Discontinued support for Poly/ML 5.2, which was the last version
899 without proper multithreading and TimeLimit implementation.
901 * Discontinued old lib/scripts/polyml-platform, which has been
902 obsolete since Isabelle2009-2.
904 * Various optional external tools are referenced more robustly and
905 uniformly by explicit Isabelle settings as follows:
907 ISABELLE_CSDP (formerly CSDP_EXE)
908 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
909 ISABELLE_OCAML (formerly EXEC_OCAML)
910 ISABELLE_SWIPL (formerly EXEC_SWIPL)
911 ISABELLE_YAP (formerly EXEC_YAP)
913 Note that automated detection from the file-system or search path has
914 been discontinued. INCOMPATIBILITY.
916 * Scala layer provides JVM method invocation service for static
917 methods of type (String)String, see Invoke_Scala.method in ML. For
920 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
922 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
923 this allows to pass structured values between ML and Scala.
925 * The IsabelleText fonts includes some further glyphs to support the
926 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
927 installed a local copy (which is normally *not* required) need to
928 delete or update it from ~~/lib/fonts/.
932 New in Isabelle2011 (January 2011)
933 ----------------------------------
937 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
938 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
939 useful tooltips and hyperlinks produced from its static analysis. The
940 bundled component provides an executable Isabelle tool that can be run
943 Isabelle2011/bin/isabelle jedit
945 * Significantly improved Isabelle/Isar implementation manual.
947 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
948 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
949 while the default heap location within that directory lacks that extra
950 suffix. This isolates multiple Isabelle installations from each
951 other, avoiding problems with old settings in new versions.
952 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
954 * Source files are always encoded as UTF-8, instead of old-fashioned
955 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
956 the following package declarations:
958 \usepackage[utf8]{inputenc}
959 \usepackage{textcomp}
961 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
962 a Unicode character is treated as a single symbol, not a sequence of
963 non-ASCII bytes as before. Since Isabelle/ML string literals may
964 contain symbols without further backslash escapes, Unicode can now be
965 used here as well. Recall that Symbol.explode in ML provides a
966 consistent view on symbols, while raw explode (or String.explode)
967 merely give a byte-oriented representation.
969 * Theory loader: source files are primarily located via the master
970 directory of each theory node (where the .thy file itself resides).
971 The global load path is still partially available as legacy feature.
972 Minor INCOMPATIBILITY due to subtle change in file lookup: use
973 explicit paths, relatively to the theory.
975 * Special treatment of ML file names has been discontinued.
976 Historically, optional extensions .ML or .sml were added on demand --
977 at the cost of clarity of file dependencies. Recall that Isabelle/ML
978 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
980 * Various options that affect pretty printing etc. are now properly
981 handled within the context via configuration options, instead of
982 unsynchronized references or print modes. There are both ML Config.T
983 entities and Isar declaration attributes to access these.
985 ML (Config.T) Isar (attribute)
987 eta_contract eta_contract
988 show_brackets show_brackets
989 show_sorts show_sorts
990 show_types show_types
991 show_question_marks show_question_marks
992 show_consts show_consts
993 show_abbrevs show_abbrevs
995 Syntax.ast_trace syntax_ast_trace
996 Syntax.ast_stat syntax_ast_stat
997 Syntax.ambiguity_level syntax_ambiguity_level
999 Goal_Display.goals_limit goals_limit
1000 Goal_Display.show_main_goal show_main_goal
1002 Method.rule_trace rule_trace
1004 Thy_Output.display thy_output_display
1005 Thy_Output.quotes thy_output_quotes
1006 Thy_Output.indent thy_output_indent
1007 Thy_Output.source thy_output_source
1008 Thy_Output.break thy_output_break
1010 Note that corresponding "..._default" references in ML may only be
1011 changed globally at the ROOT session setup, but *not* within a theory.
1012 The option "show_abbrevs" supersedes the former print mode
1013 "no_abbrevs" with inverted meaning.
1015 * More systematic naming of some configuration options.
1018 trace_simp ~> simp_trace
1019 debug_simp ~> simp_debug
1021 * Support for real valued configuration options, using simplistic
1022 floating-point notation that coincides with the inner syntax for
1025 * Support for real valued preferences (with approximative PGIP type):
1026 front-ends need to accept "pgint" values in float notation.
1029 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1032 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1037 * Command 'type_synonym' (with single argument) replaces somewhat
1038 outdated 'types', which is still available as legacy feature for some
1041 * Command 'nonterminal' (with 'and' separated list of arguments)
1042 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1044 * Command 'notepad' replaces former 'example_proof' for
1045 experimentation in Isar without any result. INCOMPATIBILITY.
1047 * Locale interpretation commands 'interpret' and 'sublocale' accept
1048 lists of equations to map definitions in a locale to appropriate
1049 entities in the context of the interpretation. The 'interpretation'
1050 command already provided this functionality.
1052 * Diagnostic command 'print_dependencies' prints the locale instances
1053 that would be activated if the specified expression was interpreted in
1054 the current context. Variant "print_dependencies!" assumes a context
1055 without interpretations.
1057 * Diagnostic command 'print_interps' prints interpretations in proofs
1058 in addition to interpretations in theories.
1060 * Discontinued obsolete 'global' and 'local' commands to manipulate
1061 the theory name space. Rare INCOMPATIBILITY. The ML functions
1062 Sign.root_path and Sign.local_path may be applied directly where this
1063 feature is still required for historical reasons.
1065 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1066 'definition' instead.
1068 * The "prems" fact, which refers to the accidental collection of
1069 foundational premises in the context, is now explicitly marked as
1070 legacy feature and will be discontinued soon. Consider using "assms"
1071 of the head statement or reference facts by explicit names.
1073 * Document antiquotations @{class} and @{type} print classes and type
1076 * Document antiquotation @{file} checks file/directory entries within
1077 the local file system.
1082 * Coercive subtyping: functions can be declared as coercions and type
1083 inference will add them as necessary upon input of a term. Theory
1084 Complex_Main declares real :: nat => real and real :: int => real as
1085 coercions. A coercion function f is declared like this:
1087 declare [[coercion f]]
1089 To lift coercions through type constructors (e.g. from nat => real to
1090 nat list => real list), map functions can be declared, e.g.
1092 declare [[coercion_map map]]
1094 Currently coercion inference is activated only in theories including
1095 real numbers, i.e. descendants of Complex_Main. This is controlled by
1096 the configuration option "coercion_enabled", e.g. it can be enabled in
1097 other theories like this:
1099 declare [[coercion_enabled]]
1101 * Command 'partial_function' provides basic support for recursive
1102 function definitions over complete partial orders. Concrete instances
1103 are provided for i) the option type, ii) tail recursion on arbitrary
1104 types, and iii) the heap monad of Imperative_HOL. See
1105 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1108 * Function package: f.psimps rules are no longer implicitly declared
1109 as [simp]. INCOMPATIBILITY.
1111 * Datatype package: theorems generated for executable equality (class
1112 "eq") carry proper names and are treated as default code equations.
1114 * Inductive package: now offers command 'inductive_simps' to
1115 automatically derive instantiated and simplified equations for
1116 inductive predicates, similar to 'inductive_cases'.
1118 * Command 'enriched_type' allows to register properties of the
1119 functorial structure of types.
1121 * Improved infrastructure for term evaluation using code generator
1122 techniques, in particular static evaluation conversions.
1124 * Code generator: Scala (2.8 or higher) has been added to the target
1127 * Code generator: globbing constant expressions "*" and "Theory.*"
1128 have been replaced by the more idiomatic "_" and "Theory._".
1131 * Code generator: export_code without explicit file declaration prints
1132 to standard output. INCOMPATIBILITY.
1134 * Code generator: do not print function definitions for case
1135 combinators any longer.
1137 * Code generator: simplification with rules determined with
1138 src/Tools/Code/code_simp.ML and method "code_simp".
1140 * Code generator for records: more idiomatic representation of record
1141 types. Warning: records are not covered by ancient SML code
1142 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1143 rep_datatype declaration helps to succeed then:
1147 rep_datatype foo_ext ...
1149 * Records: logical foundation type for records does not carry a
1150 '_type' suffix any longer (obsolete due to authentic syntax).
1153 * Quickcheck now by default uses exhaustive testing instead of random
1154 testing. Random testing can be invoked by "quickcheck [random]",
1155 exhaustive testing by "quickcheck [exhaustive]".
1157 * Quickcheck instantiates polymorphic types with small finite
1158 datatypes by default. This enables a simple execution mechanism to
1159 handle quantifiers and function equality over the finite datatypes.
1161 * Quickcheck random generator has been renamed from "code" to
1162 "random". INCOMPATIBILITY.
1164 * Quickcheck now has a configurable time limit which is set to 30
1165 seconds by default. This can be changed by adding [timeout = n] to the
1166 quickcheck command. The time limit for Auto Quickcheck is still set
1169 * Quickcheck in locales considers interpretations of that locale for
1170 counter example search.
1173 - Added "smt" and "remote_smt" provers based on the "smt" proof
1174 method. See the Sledgehammer manual for details ("isabelle doc
1177 sledgehammer atp_info ~> sledgehammer running_provers
1178 sledgehammer atp_kill ~> sledgehammer kill_provers
1179 sledgehammer available_atps ~> sledgehammer available_provers
1182 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1183 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1184 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1185 (and "ms" and "min" are no longer supported)
1190 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1191 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1193 - Added support for partial quotient types.
1194 - Added local versions of the "Nitpick.register_xxx" functions.
1195 - Added "whack" option.
1196 - Allow registration of quotient types as codatatypes.
1197 - Improved "merge_type_vars" option to merge more types.
1198 - Removed unsound "fast_descrs" option.
1199 - Added custom symmetry breaking for datatypes, making it possible to reach
1200 higher cardinalities.
1201 - Prevent the expansion of too large definitions.
1203 * Proof methods "metis" and "meson" now have configuration options
1204 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1205 to diagnose these tools. E.g.
1207 using [[metis_trace = true]]
1209 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1210 manually as command 'solve_direct'.
1212 * The default SMT solver Z3 must be enabled explicitly (due to
1213 licensing issues) by setting the environment variable
1214 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1215 commercial applications, the SMT solver CVC3 is provided as fall-back;
1216 changing the SMT solver is done via the configuration option
1219 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1220 i.e. "remote_cvc3" and "remote_z3".
1222 * Added basic SMT support for datatypes, records, and typedefs using
1223 the oracle mode (no proofs). Direct support of pairs has been dropped
1224 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1225 support for a similar behavior). Minor INCOMPATIBILITY.
1227 * Changed SMT configuration options:
1229 z3_proofs ~> smt_oracle (with inverted meaning)
1230 z3_trace_assms ~> smt_trace_used_facts
1243 * Boogie output files (.b2i files) need to be declared in the theory
1246 * Simplification procedure "list_to_set_comprehension" rewrites list
1247 comprehensions applied to List.set to set comprehensions. Occasional
1248 INCOMPATIBILITY, may be deactivated like this:
1250 declare [[simproc del: list_to_set_comprehension]]
1252 * Removed old version of primrec package. INCOMPATIBILITY.
1254 * Removed simplifier congruence rule of "prod_case", as has for long
1255 been the case with "split". INCOMPATIBILITY.
1257 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1259 * Removed [split_format ... and ... and ...] version of
1260 [split_format]. Potential INCOMPATIBILITY.
1262 * Predicate "sorted" now defined inductively, with nice induction
1263 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1265 * Constant "contents" renamed to "the_elem", to free the generic name
1266 contents for other uses. INCOMPATIBILITY.
1268 * Renamed class eq and constant eq (for code generation) to class
1269 equal and constant equal, plus renaming of related facts and various
1270 tuning. INCOMPATIBILITY.
1272 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1274 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1277 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1278 avoid confusion with finite sets. INCOMPATIBILITY.
1280 * Abandoned locales equiv, congruent and congruent2 for equivalence
1281 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1284 * Some previously unqualified names have been qualified:
1291 Trueprop ~> HOL.Trueprop
1296 op --> ~> HOL.implies
1308 Pair ~> Product_Type.Pair
1309 fst ~> Product_Type.fst
1310 snd ~> Product_Type.snd
1311 curry ~> Product_Type.curry
1313 Collect ~> Set.Collect
1317 * More canonical naming convention for some fundamental definitions:
1319 bot_bool_eq ~> bot_bool_def
1320 top_bool_eq ~> top_bool_def
1321 inf_bool_eq ~> inf_bool_def
1322 sup_bool_eq ~> sup_bool_def
1323 bot_fun_eq ~> bot_fun_def
1324 top_fun_eq ~> top_fun_def
1325 inf_fun_eq ~> inf_fun_def
1326 sup_fun_eq ~> sup_fun_def
1330 * More stylized fact names:
1332 expand_fun_eq ~> fun_eq_iff
1333 expand_set_eq ~> set_eq_iff
1335 nat_number ~> eval_nat_numeral
1339 * Refactoring of code-generation specific operations in theory List:
1345 mem_iff ~> member_def
1346 null_empty ~> null_def
1348 INCOMPATIBILITY. Note that these were not supposed to be used
1349 regularly unless for striking reasons; their main purpose was code
1352 Various operations from the Haskell prelude are used for generating
1355 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1356 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1357 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1359 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1360 "*" and "+" respectively. INCOMPATIBILITY.
1362 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1363 "Sum_Type.Plus" instead.
1365 * Constant "split" has been merged with constant "prod_case"; names of
1366 ML functions, facts etc. involving split have been retained so far,
1367 though. INCOMPATIBILITY.
1369 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1370 instead. INCOMPATIBILITY.
1372 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1375 * Former theory Library/Enum is now part of the HOL-Main image.
1376 INCOMPATIBILITY: all constants of the Enum theory now have to be
1377 referred to by its qualified name.
1380 nlists ~> Enum.nlists
1381 product ~> Enum.product
1383 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1384 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1387 * Theory Library/SetsAndFunctions has been split into
1388 Library/Function_Algebras and Library/Set_Algebras; canonical names
1389 for instance definitions for functions; various improvements.
1392 * Theory Library/Multiset provides stable quicksort implementation of
1395 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1398 * Session Multivariate_Analysis: introduced a type class for euclidean
1399 space. Most theorems are now stated in terms of euclidean spaces
1400 instead of finite cartesian products.
1403 real ^ 'n ~> 'a::real_vector
1404 ~> 'a::euclidean_space
1405 ~> 'a::ordered_euclidean_space
1406 (depends on your needs)
1410 \<chi> x. _ ~> \<chi>\<chi> x. _
1413 Also note that the indices are now natural numbers and not from some
1414 finite type. Finite cartesian products of euclidean spaces, products
1415 of euclidean spaces the real and complex numbers are instantiated to
1416 be euclidean_spaces. INCOMPATIBILITY.
1418 * Session Probability: introduced pextreal as positive extended real
1419 numbers. Use pextreal as value for measures. Introduce the
1420 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1421 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1422 the integral in Multivariate Analysis. INCOMPATIBILITY.
1424 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1427 * Session SPARK (with image HOL-SPARK) provides commands to load and
1428 prove verification conditions generated by the SPARK Ada program
1429 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1434 * Theorems for additive ring operations (locale abelian_monoid and
1435 descendants) are generated by interpretation from their multiplicative
1436 counterparts. Names (in particular theorem names) have the mandatory
1437 qualifier 'add'. Previous theorem names are redeclared for
1440 * Structure "int_ring" is now an abbreviation (previously a
1441 definition). This fits more natural with advanced interpretations.
1446 * The domain package now runs in definitional mode by default: The
1447 former command 'new_domain' is now called 'domain'. To use the domain
1448 package in its original axiomatic mode, use 'domain (unsafe)'.
1451 * The new class "domain" is now the default sort. Class "predomain"
1452 is an unpointed version of "domain". Theories can be updated by
1453 replacing sort annotations as shown below. INCOMPATIBILITY.
1455 'a::type ~> 'a::countable
1456 'a::cpo ~> 'a::predomain
1457 'a::pcpo ~> 'a::domain
1459 * The old type class "rep" has been superseded by class "domain".
1460 Accordingly, users of the definitional package must remove any
1461 "default_sort rep" declarations. INCOMPATIBILITY.
1463 * The domain package (definitional mode) now supports unpointed
1464 predomain argument types, as long as they are marked 'lazy'. (Strict
1465 arguments must be in class "domain".) For example, the following
1466 domain definition now works:
1468 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1470 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1471 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1472 'a option, and 'a list. Additionally, it configures fixrec and the
1473 domain package to work with these types. For example:
1475 fixrec isInl :: "('a + 'b) u -> tr"
1476 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1478 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1480 * The "(permissive)" option of fixrec has been replaced with a
1481 per-equation "(unchecked)" option. See
1482 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1484 * The "bifinite" class no longer fixes a constant "approx"; the class
1485 now just asserts that such a function exists. INCOMPATIBILITY.
1487 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1488 defines an embedding of type 'a defl into udom by default; instances
1489 of "bifinite" and "domain" classes are available in
1490 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1492 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1494 * The predicate "directed" has been removed. INCOMPATIBILITY.
1496 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1498 * The function "cprod_map" has been renamed to "prod_map".
1501 * The monadic bind operator on each powerdomain has new binder syntax
1502 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1503 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1505 * The infix syntax for binary union on each powerdomain has changed
1506 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1507 syntax. INCOMPATIBILITY.
1509 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1510 still supported as an input translation.
1512 * Renamed some theorems (the original names are also still available).
1514 expand_fun_below ~> fun_below_iff
1515 below_fun_ext ~> fun_belowI
1516 expand_cfun_eq ~> cfun_eq_iff
1517 ext_cfun ~> cfun_eqI
1518 expand_cfun_below ~> cfun_below_iff
1519 below_cfun_ext ~> cfun_belowI
1520 cont2cont_Rep_CFun ~> cont2cont_APP
1522 * The Abs and Rep functions for various types have changed names.
1523 Related theorem names have also changed to match. INCOMPATIBILITY.
1525 Rep_CFun ~> Rep_cfun
1526 Abs_CFun ~> Abs_cfun
1527 Rep_Sprod ~> Rep_sprod
1528 Abs_Sprod ~> Abs_sprod
1529 Rep_Ssum ~> Rep_ssum
1530 Abs_Ssum ~> Abs_ssum
1532 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1533 been renamed to *_bottom_iff. INCOMPATIBILITY.
1535 * Various changes to bisimulation/coinduction with domain package:
1537 - Definitions of "bisim" constants no longer mention definedness.
1538 - With mutual recursion, "bisim" predicate is now curried.
1539 - With mutual recursion, each type gets a separate coind theorem.
1540 - Variable names in bisim_def and coinduct rules have changed.
1544 * Case combinators generated by the domain package for type "foo" are
1545 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1547 * Several theorems have been renamed to more accurately reflect the
1548 names of constants and types involved. INCOMPATIBILITY.
1550 thelub_const ~> lub_const
1551 lub_const ~> is_lub_const
1553 is_lub_lub ~> is_lubD2
1555 unique_lub ~> is_lub_unique
1556 is_ub_lub ~> is_lub_rangeD1
1557 lub_bin_chain ~> is_lub_bin_chain
1558 lub_fun ~> is_lub_fun
1559 thelub_fun ~> lub_fun
1560 thelub_cfun ~> lub_cfun
1561 thelub_Pair ~> lub_Pair
1562 lub_cprod ~> is_lub_prod
1563 thelub_cprod ~> lub_prod
1564 minimal_cprod ~> minimal_prod
1565 inst_cprod_pcpo ~> inst_prod_pcpo
1567 compact_UU ~> compact_bottom
1568 deflation_UU ~> deflation_bottom
1569 finite_deflation_UU ~> finite_deflation_bottom
1571 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1573 sq_ord_less_eq_trans ~> below_eq_trans
1574 sq_ord_eq_less_trans ~> eq_below_trans
1575 refl_less ~> below_refl
1576 trans_less ~> below_trans
1577 antisym_less ~> below_antisym
1578 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1579 box_less ~> box_below
1580 rev_trans_less ~> rev_below_trans
1581 not_less2not_eq ~> not_below2not_eq
1582 less_UU_iff ~> below_UU_iff
1583 flat_less_iff ~> flat_below_iff
1584 adm_less ~> adm_below
1585 adm_not_less ~> adm_not_below
1586 adm_compact_not_less ~> adm_compact_not_below
1587 less_fun_def ~> below_fun_def
1588 expand_fun_less ~> fun_below_iff
1589 less_fun_ext ~> fun_belowI
1590 less_discr_def ~> below_discr_def
1591 discr_less_eq ~> discr_below_eq
1592 less_unit_def ~> below_unit_def
1593 less_cprod_def ~> below_prod_def
1594 prod_lessI ~> prod_belowI
1595 Pair_less_iff ~> Pair_below_iff
1596 fst_less_iff ~> fst_below_iff
1597 snd_less_iff ~> snd_below_iff
1598 expand_cfun_less ~> cfun_below_iff
1599 less_cfun_ext ~> cfun_belowI
1600 injection_less ~> injection_below
1601 less_up_def ~> below_up_def
1602 not_Iup_less ~> not_Iup_below
1603 Iup_less ~> Iup_below
1605 Def_inject_less_eq ~> Def_below_Def
1606 Def_less_is_eq ~> Def_below_iff
1607 spair_less_iff ~> spair_below_iff
1608 less_sprod ~> below_sprod
1609 spair_less ~> spair_below
1610 sfst_less_iff ~> sfst_below_iff
1611 ssnd_less_iff ~> ssnd_below_iff
1612 fix_least_less ~> fix_least_below
1613 dist_less_one ~> dist_below_one
1614 less_ONE ~> below_ONE
1615 ONE_less_iff ~> ONE_below_iff
1616 less_sinlD ~> below_sinlD
1617 less_sinrD ~> below_sinrD
1622 * All constant names are now qualified internally and use proper
1623 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1628 * Antiquotation @{assert} inlines a function bool -> unit that raises
1629 Fail if the argument is false. Due to inlining the source position of
1630 failed assertions is included in the error output.
1632 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1633 text is in practice always evaluated with a stable theory checkpoint.
1634 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1636 * Antiquotation @{theory A} refers to theory A from the ancestry of
1637 the current context, not any accidental theory loader state as before.
1638 Potential INCOMPATIBILITY, subtle change in semantics.
1640 * Syntax.pretty_priority (default 0) configures the required priority
1641 of pretty-printed output and thus affects insertion of parentheses.
1643 * Syntax.default_root (default "any") configures the inner syntax
1644 category (nonterminal symbol) for parsing of terms.
1646 * Former exception Library.UnequalLengths now coincides with
1647 ListPair.UnequalLengths.
1649 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1650 main functionality is provided by structure Simplifier.
1652 * Renamed raw "explode" function to "raw_explode" to emphasize its
1653 meaning. Note that internally to Isabelle, Symbol.explode is used in
1654 almost all situations.
1656 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1657 See implementation manual for further details on exceptions in
1660 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1663 * Renamed structure PureThy to Pure_Thy and moved most of its
1664 operations to structure Global_Theory, to emphasize that this is
1665 rarely-used global-only stuff.
1667 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1668 instead (or tracing for high-volume output).
1670 * Configuration option show_question_marks only affects regular pretty
1671 printing of types and terms, not raw Term.string_of_vname.
1673 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1674 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1675 @{thms} for most purposes.
1677 * ML structure Unsynchronized is never opened, not even in Isar
1678 interaction mode as before. Old Unsynchronized.set etc. have been
1679 discontinued -- use plain := instead. This should be *rare* anyway,
1680 since modern tools always work via official context data, notably
1681 configuration options.
1683 * Parallel and asynchronous execution requires special care concerning
1684 interrupts. Structure Exn provides some convenience functions that
1685 avoid working directly with raw Interrupt. User code must not absorb
1686 interrupts -- intermediate handling (for cleanup etc.) needs to be
1687 followed by re-raising of the original exception. Another common
1688 source of mistakes are "handle _" patterns, which make the meaning of
1689 the program subject to physical effects of the environment.
1693 New in Isabelle2009-2 (June 2010)
1694 ---------------------------------
1698 * Authentic syntax for *all* logical entities (type classes, type
1699 constructors, term constants): provides simple and robust
1700 correspondence between formal entities and concrete syntax. Within
1701 the parse tree / AST representations, "constants" are decorated by
1702 their category (class, type, const) and spelled out explicitly with
1703 their full internal name.
1705 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1706 and translations (translation rules and translation functions in ML).
1707 Some hints on upgrading:
1709 - Many existing uses of 'syntax' and 'translations' can be replaced
1710 by more modern 'type_notation', 'notation' and 'abbreviation',
1711 which are independent of this issue.
1713 - 'translations' require markup within the AST; the term syntax
1714 provides the following special forms:
1716 CONST c -- produces syntax version of constant c from context
1717 XCONST c -- literally c, checked as constant from context
1718 c -- literally c, if declared by 'syntax'
1720 Plain identifiers are treated as AST variables -- occasionally the
1721 system indicates accidental variables via the error "rhs contains
1724 Type classes and type constructors are marked according to their
1725 concrete syntax. Some old translations rules need to be written
1726 for the "type" category, using type constructor application
1727 instead of pseudo-term application of the default category
1730 - 'parse_translation' etc. in ML may use the following
1733 @{class_syntax c} -- type class c within parse tree / AST
1734 @{term_syntax c} -- type constructor c within parse tree / AST
1735 @{const_syntax c} -- ML version of "CONST c" above
1736 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1738 - Literal types within 'typed_print_translations', i.e. those *not*
1739 represented as pseudo-terms are represented verbatim. Use @{class
1740 c} or @{type_name c} here instead of the above syntax
1743 Note that old non-authentic syntax was based on unqualified base
1744 names, so all of the above "constant" names would coincide. Recall
1745 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1746 diagnose syntax problems.
1748 * Type constructors admit general mixfix syntax, not just infix.
1750 * Concrete syntax may be attached to local entities without a proof
1751 body, too. This works via regular mixfix annotations for 'fix',
1752 'def', 'obtain' etc. or via the explicit 'write' command, which is
1753 similar to the 'notation' command in theory specifications.
1755 * Discontinued unnamed infix syntax (legacy feature for many years) --
1756 need to specify constant name and syntax separately. Internal ML
1757 datatype constructors have been renamed from InfixName to Infix etc.
1758 Minor INCOMPATIBILITY.
1760 * Schematic theorem statements need to be explicitly markup as such,
1761 via commands 'schematic_lemma', 'schematic_theorem',
1762 'schematic_corollary'. Thus the relevance of the proof is made
1763 syntactically clear, which impacts performance in a parallel or
1764 asynchronous interactive environment. Minor INCOMPATIBILITY.
1766 * Use of cumulative prems via "!" in some proof methods has been
1767 discontinued (old legacy feature).
1769 * References 'trace_simp' and 'debug_simp' have been replaced by
1770 configuration options stored in the context. Enabling tracing (the
1771 case of debugging is similar) in proofs works via
1773 using [[trace_simp = true]]
1775 Tracing is then active for all invocations of the simplifier in
1776 subsequent goal refinement steps. Tracing may also still be enabled or
1777 disabled via the ProofGeneral settings menu.
1779 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1780 'hide_fact' replace the former 'hide' KIND command. Minor
1783 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1784 more efficient than combinations with -q1 or -q2.
1789 * Proofterms record type-class reasoning explicitly, using the
1790 "unconstrain" operation internally. This eliminates all sort
1791 constraints from a theorem and proof, introducing explicit
1792 OFCLASS-premises. On the proof term level, this operation is
1793 automatically applied at theorem boundaries, such that closed proofs
1794 are always free of sort constraints. INCOMPATIBILITY for tools that
1795 inspect proof terms.
1797 * Local theory specifications may depend on extra type variables that
1798 are not present in the result type -- arguments TYPE('a) :: 'a itself
1799 are added internally. For example:
1801 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1803 * Predicates of locales introduced by classes carry a mandatory
1804 "class" prefix. INCOMPATIBILITY.
1806 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1808 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1811 * Command 'code_reflect' allows to incorporate generated ML code into
1812 runtime environment; replaces immature code_datatype antiquotation.
1815 * Code generator: simple concept for abstract datatypes obeying
1818 * Code generator: details of internal data cache have no impact on the
1819 user space functionality any longer.
1821 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1822 subgoals. This is more appropriate for interpretations with 'where'.
1825 * Command 'example_proof' opens an empty proof body. This allows to
1826 experiment with Isar, without producing any persistent result.
1828 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1829 within a local theory context, with explicit checking of the
1830 constructors involved (in contrast to the raw 'syntax' versions).
1832 * Commands 'types' and 'typedecl' now work within a local theory
1833 context -- without introducing dependencies on parameters or
1834 assumptions, which is not possible in Isabelle/Pure.
1836 * Command 'defaultsort' has been renamed to 'default_sort', it works
1837 within a local theory context. Minor INCOMPATIBILITY.
1842 * Command 'typedef' now works within a local theory context -- without
1843 introducing dependencies on parameters or assumptions, which is not
1844 possible in Isabelle/Pure/HOL. Note that the logical environment may
1845 contain multiple interpretations of local typedefs (with different
1846 non-emptiness proofs), even in a global theory context.
1848 * New package for quotient types. Commands 'quotient_type' and
1849 'quotient_definition' may be used for defining types and constants by
1850 quotient constructions. An example is the type of integers created by
1851 quotienting pairs of natural numbers:
1854 intrel :: "(nat * nat) => (nat * nat) => bool"
1856 "intrel (x, y) (u, v) = (x + v = u + y)"
1858 quotient_type int = "nat * nat" / intrel
1859 by (auto simp add: equivp_def expand_fun_eq)
1862 "0::int" is "(0::nat, 0::nat)"
1864 The method "lifting" can be used to lift of theorems from the
1865 underlying "raw" type to the quotient type. The example
1866 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1867 construction and provides a reasoning infrastructure for finite sets.
1869 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1870 clash with new theory Quotient in Main HOL.
1872 * Moved the SMT binding into the main HOL session, eliminating
1873 separate HOL-SMT session.
1875 * List membership infix mem operation is only an input abbreviation.
1878 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1879 for future developements; former Library/Word.thy is still present in
1880 the AFP entry RSAPPS.
1882 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1883 longer shadowed. INCOMPATIBILITY.
1885 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1888 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1891 * Dropped normalizing_semiring etc; use the facts in semiring classes
1892 instead. INCOMPATIBILITY.
1894 * Dropped several real-specific versions of lemmas about floor and
1895 ceiling; use the generic lemmas from theory "Archimedean_Field"
1896 instead. INCOMPATIBILITY.
1898 floor_number_of_eq ~> floor_number_of
1899 le_floor_eq_number_of ~> number_of_le_floor
1900 le_floor_eq_zero ~> zero_le_floor
1901 le_floor_eq_one ~> one_le_floor
1902 floor_less_eq_number_of ~> floor_less_number_of
1903 floor_less_eq_zero ~> floor_less_zero
1904 floor_less_eq_one ~> floor_less_one
1905 less_floor_eq_number_of ~> number_of_less_floor
1906 less_floor_eq_zero ~> zero_less_floor
1907 less_floor_eq_one ~> one_less_floor
1908 floor_le_eq_number_of ~> floor_le_number_of
1909 floor_le_eq_zero ~> floor_le_zero
1910 floor_le_eq_one ~> floor_le_one
1911 floor_subtract_number_of ~> floor_diff_number_of
1912 floor_subtract_one ~> floor_diff_one
1913 ceiling_number_of_eq ~> ceiling_number_of
1914 ceiling_le_eq_number_of ~> ceiling_le_number_of
1915 ceiling_le_zero_eq ~> ceiling_le_zero
1916 ceiling_le_eq_one ~> ceiling_le_one
1917 less_ceiling_eq_number_of ~> number_of_less_ceiling
1918 less_ceiling_eq_zero ~> zero_less_ceiling
1919 less_ceiling_eq_one ~> one_less_ceiling
1920 ceiling_less_eq_number_of ~> ceiling_less_number_of
1921 ceiling_less_eq_zero ~> ceiling_less_zero
1922 ceiling_less_eq_one ~> ceiling_less_one
1923 le_ceiling_eq_number_of ~> number_of_le_ceiling
1924 le_ceiling_eq_zero ~> zero_le_ceiling
1925 le_ceiling_eq_one ~> one_le_ceiling
1926 ceiling_subtract_number_of ~> ceiling_diff_number_of
1927 ceiling_subtract_one ~> ceiling_diff_one
1929 * Theory "Finite_Set": various folding_XXX locales facilitate the
1930 application of the various fold combinators on finite sets.
1932 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1933 provides abstract red-black tree type which is backed by "RBT_Impl" as
1934 implementation. INCOMPATIBILTY.
1936 * Theory Library/Coinductive_List has been removed -- superseded by
1937 AFP/thys/Coinductive.
1939 * Theory PReal, including the type "preal" and related operations, has
1940 been removed. INCOMPATIBILITY.
1942 * Real: new development using Cauchy Sequences.
1944 * Split off theory "Big_Operators" containing setsum, setprod,
1945 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
1947 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
1948 "Int" etc. INCOMPATIBILITY.
1950 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
1952 * New set of rules "ac_simps" provides combined assoc / commute
1953 rewrites for all interpretations of the appropriate generic locales.
1955 * Renamed theory "OrderedGroup" to "Groups" and split theory
1956 "Ring_and_Field" into theories "Rings" and "Fields"; for more
1957 appropriate and more consistent names suitable for name prefixes
1958 within the HOL theories. INCOMPATIBILITY.
1960 * Some generic constants have been put to appropriate theories:
1961 - less_eq, less: Orderings
1962 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
1963 - inverse, divide: Rings
1966 * More consistent naming of type classes involving orderings (and
1969 lower_semilattice ~> semilattice_inf
1970 upper_semilattice ~> semilattice_sup
1972 dense_linear_order ~> dense_linorder
1974 pordered_ab_group_add ~> ordered_ab_group_add
1975 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
1976 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
1977 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
1978 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
1979 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
1980 pordered_cancel_semiring ~> ordered_cancel_semiring
1981 pordered_comm_monoid_add ~> ordered_comm_monoid_add
1982 pordered_comm_ring ~> ordered_comm_ring
1983 pordered_comm_semiring ~> ordered_comm_semiring
1984 pordered_ring ~> ordered_ring
1985 pordered_ring_abs ~> ordered_ring_abs
1986 pordered_semiring ~> ordered_semiring
1988 ordered_ab_group_add ~> linordered_ab_group_add
1989 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
1990 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
1991 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
1992 ordered_field ~> linordered_field
1993 ordered_field_no_lb ~> linordered_field_no_lb
1994 ordered_field_no_ub ~> linordered_field_no_ub
1995 ordered_field_dense_linear_order ~> dense_linordered_field
1996 ordered_idom ~> linordered_idom
1997 ordered_ring ~> linordered_ring
1998 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
1999 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2000 ordered_ring_strict ~> linordered_ring_strict
2001 ordered_semidom ~> linordered_semidom
2002 ordered_semiring ~> linordered_semiring
2003 ordered_semiring_1 ~> linordered_semiring_1
2004 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2005 ordered_semiring_strict ~> linordered_semiring_strict
2007 The following slightly odd type classes have been moved to a
2008 separate theory Library/Lattice_Algebras:
2010 lordered_ab_group_add ~> lattice_ab_group_add
2011 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2012 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2013 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2014 lordered_ring ~> lattice_ring
2018 * Refined field classes:
2019 - classes division_ring_inverse_zero, field_inverse_zero,
2020 linordered_field_inverse_zero include rule inverse 0 = 0 --
2021 subsumes former division_by_zero class;
2022 - numerous lemmas have been ported from field to division_ring.
2025 * Refined algebra theorem collections:
2026 - dropped theorem group group_simps, use algebra_simps instead;
2027 - dropped theorem group ring_simps, use field_simps instead;
2028 - proper theorem collection field_simps subsumes former theorem
2029 groups field_eq_simps and field_simps;
2030 - dropped lemma eq_minus_self_iff which is a duplicate for
2034 * Theory Finite_Set and List: some lemmas have been generalized from
2037 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2038 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2039 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2040 union_Union_fold_union ~> sup_Sup_fold_sup
2041 Inter_fold_inter ~> Inf_fold_inf
2042 Union_fold_union ~> Sup_fold_sup
2043 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2044 union_UNION_fold_union ~> sup_SUPR_fold_sup
2045 INTER_fold_inter ~> INFI_fold_inf
2046 UNION_fold_union ~> SUPR_fold_sup
2048 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2049 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2050 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2051 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2052 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2053 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2055 * Reorganized theory Multiset: swapped notation of pointwise and
2058 - pointwise ordering is instance of class order with standard syntax
2060 - multiset ordering has syntax <=# and <#; partial order properties
2061 are provided by means of interpretation with prefix
2063 - less duplication, less historical organization of sections,
2064 conversion from associations lists to multisets, rudimentary code
2066 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2071 multiset_eq_conv_count_eq ~> multiset_ext_iff
2072 multi_count_ext ~> multiset_ext
2073 diff_union_inverse2 ~> diff_union_cancelR
2077 * Theory Permutation: replaced local "remove" by List.remove1.
2079 * Code generation: ML and OCaml code is decorated with signatures.
2081 * Theory List: added transpose.
2083 * Library/Nat_Bijection.thy is a collection of bijective functions
2084 between nat and other types, which supersedes the older libraries
2085 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2088 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2089 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2090 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2091 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2092 Countable.pair_encode ~> prod_encode
2093 NatIso.prod2nat ~> prod_encode
2094 NatIso.nat2prod ~> prod_decode
2095 NatIso.sum2nat ~> sum_encode
2096 NatIso.nat2sum ~> sum_decode
2097 NatIso.list2nat ~> list_encode
2098 NatIso.nat2list ~> list_decode
2099 NatIso.set2nat ~> set_encode
2100 NatIso.nat2set ~> set_decode
2103 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2104 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2105 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2106 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2107 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2108 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2109 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2110 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2111 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2112 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2113 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2114 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2115 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2118 - Renamed ATP commands:
2119 atp_info ~> sledgehammer running_atps
2120 atp_kill ~> sledgehammer kill_atps
2121 atp_messages ~> sledgehammer messages
2122 atp_minimize ~> sledgehammer minimize
2123 print_atps ~> sledgehammer available_atps
2125 - Added user's manual ("isabelle doc sledgehammer").
2126 - Added option syntax and "sledgehammer_params" to customize
2127 Sledgehammer's behavior. See the manual for details.
2128 - Modified the Isar proof reconstruction code so that it produces
2129 direct proofs rather than proofs by contradiction. (This feature
2130 is still experimental.)
2131 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2133 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2136 - Added and implemented "binary_ints" and "bits" options.
2137 - Added "std" option and implemented support for nonstandard models.
2138 - Added and implemented "finitize" option to improve the precision
2139 of infinite datatypes based on a monotonicity analysis.
2140 - Added support for quotient types.
2141 - Added support for "specification" and "ax_specification"
2143 - Added support for local definitions (for "function" and
2144 "termination" proofs).
2145 - Added support for term postprocessors.
2146 - Optimized "Multiset.multiset" and "FinFun.finfun".
2147 - Improved efficiency of "destroy_constrs" optimization.
2148 - Fixed soundness bugs related to "destroy_constrs" optimization and
2150 - Fixed soundness bug related to higher-order constructors.
2151 - Fixed soundness bug when "full_descrs" is enabled.
2152 - Improved precision of set constructs.
2153 - Added "atoms" option.
2154 - Added cache to speed up repeated Kodkod invocations on the same
2156 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2157 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2158 "SAT4J_Light". INCOMPATIBILITY.
2159 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2160 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2161 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2163 * Method "induct" now takes instantiations of the form t, where t is not
2164 a variable, as a shorthand for "x == t", where x is a fresh variable.
2165 If this is not intended, t has to be enclosed in parentheses.
2166 By default, the equalities generated by definitional instantiations
2167 are pre-simplified, which may cause parameters of inductive cases
2168 to disappear, or may even delete some of the inductive cases.
2169 Use "induct (no_simp)" instead of "induct" to restore the old
2170 behaviour. The (no_simp) option is also understood by the "cases"
2171 and "nominal_induct" methods, which now perform pre-simplification, too.
2177 * Variable names in lemmas generated by the domain package have
2178 changed; the naming scheme is now consistent with the HOL datatype
2179 package. Some proof scripts may be affected, INCOMPATIBILITY.
2181 * The domain package no longer defines the function "foo_copy" for
2182 recursive domain "foo". The reach lemma is now stated directly in
2183 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2184 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2186 * Most definedness lemmas generated by the domain package (previously
2187 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2188 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2189 Proofs that used definedness lemmas as intro rules may break,
2190 potential INCOMPATIBILITY.
2192 * Induction and casedist rules generated by the domain package now
2193 declare proper case_names (one called "bottom", and one named for each
2194 constructor). INCOMPATIBILITY.
2196 * For mutually-recursive domains, separate "reach" and "take_lemma"
2197 rules are generated for each domain, INCOMPATIBILITY.
2199 foo_bar.reach ~> foo.reach bar.reach
2200 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2202 * Some lemmas generated by the domain package have been renamed for
2203 consistency with the datatype package, INCOMPATIBILITY.
2205 foo.ind ~> foo.induct
2206 foo.finite_ind ~> foo.finite_induct
2207 foo.coind ~> foo.coinduct
2208 foo.casedist ~> foo.exhaust
2209 foo.exhaust ~> foo.nchotomy
2211 * For consistency with other definition packages, the fixrec package
2212 now generates qualified theorem names, INCOMPATIBILITY.
2214 foo_simps ~> foo.simps
2215 foo_unfold ~> foo.unfold
2216 foo_induct ~> foo.induct
2218 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2219 method and internal fixrec proofs now use the default simpset instead.
2222 * The "contlub" predicate has been removed. Proof scripts should use
2223 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2225 * The "admw" predicate has been removed, INCOMPATIBILITY.
2227 * The constants cpair, cfst, and csnd have been removed in favor of
2228 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2233 * Antiquotations for basic formal entities:
2235 @{class NAME} -- type class
2236 @{class_syntax NAME} -- syntax representation of the above
2238 @{type_name NAME} -- logical type
2239 @{type_abbrev NAME} -- type abbreviation
2240 @{nonterminal NAME} -- type of concrete syntactic category
2241 @{type_syntax NAME} -- syntax representation of any of the above
2243 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2244 @{const_abbrev NAME} -- abbreviated constant
2245 @{const_syntax NAME} -- syntax representation of any of the above
2247 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2248 syntax constant (cf. 'syntax' command).
2250 * Antiquotation @{make_string} inlines a function to print arbitrary
2251 values similar to the ML toplevel. The result is compiler dependent
2252 and may fall back on "?" in certain situations.
2254 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2255 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2256 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2257 not work with the asynchronous Isar document model.
2259 * Configuration options now admit dynamic default values, depending on
2260 the context or even global references.
2262 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2263 uses an efficient external library if available (for Poly/ML).
2265 * Renamed some important ML structures, while keeping the old names
2266 for some time as aliases within the structure Legacy:
2268 OuterKeyword ~> Keyword
2271 OuterSyntax ~> Outer_Syntax
2272 PrintMode ~> Print_Mode
2273 SpecParse ~> Parse_Spec
2276 ThyOutput ~> Thy_Output
2277 TypeInfer ~> Type_Infer
2279 Note that "open Legacy" simplifies porting of sources, but forgetting
2280 to remove it again will complicate porting again in the future.
2282 * Most operations that refer to a global context are named
2283 accordingly, e.g. Simplifier.global_context or
2284 ProofContext.init_global. There are some situations where a global
2285 context actually works, but under normal circumstances one needs to
2286 pass the proper local context through the code!
2288 * Discontinued old TheoryDataFun with its copy/init operation -- data
2289 needs to be pure. Functor Theory_Data_PP retains the traditional
2290 Pretty.pp argument to merge, which is absent in the standard
2291 Theory_Data version.
2293 * Sorts.certify_sort and derived "cert" operations for types and terms
2294 no longer minimize sorts. Thus certification at the boundary of the
2295 inference kernel becomes invariant under addition of class relations,
2296 which is an important monotonicity principle. Sorts are now minimized
2297 in the syntax layer only, at the boundary between the end-user and the
2298 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2299 explicitly in rare situations.
2301 * Renamed old-style Drule.standard to Drule.export_without_context, to
2302 emphasize that this is in no way a standard operation.
2305 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2306 usual for resolution. Rare INCOMPATIBILITY.
2308 * Renamed varify/unvarify operations to varify_global/unvarify_global
2309 to emphasize that these only work in a global situation (which is
2312 * Curried take and drop in library.ML; negative length is interpreted
2313 as infinity (as in chop). Subtle INCOMPATIBILITY.
2315 * Proof terms: type substitutions on proof constants now use canonical
2316 order of type variables. INCOMPATIBILITY for tools working with proof
2319 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2320 may no longer carry premises. User-level specifications are
2321 transformed accordingly by Thm.add_axiom/add_def.
2326 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2327 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2328 proof terms are enabled unconditionally in the new HOL-Proofs image.
2330 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2331 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2334 * Old lib/scripts/polyml-platform is superseded by the
2335 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2336 variant, even on a 64 bit machine. The following example setting
2337 prefers 64 bit if available:
2339 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2341 * The preliminary Isabelle/jEdit application demonstrates the emerging
2342 Isabelle/Scala layer for advanced prover interaction and integration.
2343 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2346 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2347 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2348 similar to the default assignment of the document preparation system
2349 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2350 provides some operations for direct access to the font without asking
2351 the user for manual installation.
2355 New in Isabelle2009-1 (December 2009)
2356 -------------------------------------
2360 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2361 one backslash should be used, even in ML sources.
2366 * Locale interpretation propagates mixins along the locale hierarchy.
2367 The currently only available mixins are the equations used to map
2368 local definitions to terms of the target domain of an interpretation.
2370 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2371 loc" to print all interpretations of locale "loc" in the theory.
2372 Interpretations in proofs are not shown.
2374 * Thoroughly revised locales tutorial. New section on conditional
2377 * On instantiation of classes, remaining undefined class parameters
2378 are formally declared. INCOMPATIBILITY.
2381 *** Document preparation ***
2383 * New generalized style concept for printing terms: @{foo (style) ...}
2384 instead of @{foo_style style ...} (old form is still retained for
2385 backward compatibility). Styles can be also applied for
2386 antiquotations prop, term_type and typeof.
2391 * New proof method "smt" for a combination of first-order logic with
2392 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2393 fixed-size bitvectors; there is also basic support for higher-order
2394 features (esp. lambda abstractions). It is an incomplete decision
2395 procedure based on external SMT solvers using the oracle mechanism;
2396 for the SMT solver Z3, this method is proof-producing. Certificates
2397 are provided to avoid calling the external solvers solely for
2398 re-checking proofs. Due to a remote SMT service there is no need for
2399 installing SMT solvers locally. See src/HOL/SMT.
2401 * New commands to load and prove verification conditions generated by
2402 the Boogie program verifier or derived systems (e.g. the Verifying C
2403 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2405 * New counterexample generator tool 'nitpick' based on the Kodkod
2406 relational model finder. See src/HOL/Tools/Nitpick and
2407 src/HOL/Nitpick_Examples.
2409 * New commands 'code_pred' and 'values' to invoke the predicate
2410 compiler and to enumerate values of inductive predicates.
2412 * A tabled implementation of the reflexive transitive closure.
2414 * New implementation of quickcheck uses generic code generator;
2415 default generators are provided for all suitable HOL types, records
2416 and datatypes. Old quickcheck can be re-activated importing theory
2417 Library/SML_Quickcheck.
2419 * New testing tool Mirabelle for automated proof tools. Applies
2420 several tools and tactics like sledgehammer, metis, or quickcheck, to
2421 every proof step in a theory. To be used in batch mode via the
2422 "mirabelle" utility.
2424 * New proof method "sos" (sum of squares) for nonlinear real
2425 arithmetic (originally due to John Harison). It requires theory
2426 Library/Sum_Of_Squares. It is not a complete decision procedure but
2427 works well in practice on quantifier-free real arithmetic with +, -,
2428 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2429 inequalities between polynomials. It makes use of external
2430 semidefinite programming solvers. Method "sos" generates a
2431 certificate that can be pasted into the proof thus avoiding the need
2432 to call an external tool every time the proof is checked. See
2433 src/HOL/Library/Sum_Of_Squares.
2435 * New method "linarith" invokes existing linear arithmetic decision
2438 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2440 * New Sledgehammer option "Full Types" in Proof General settings menu.
2441 Causes full type information to be output to the ATPs. This slows
2442 ATPs down considerably but eliminates a source of unsound "proofs"
2445 * New method "metisFT": A version of metis that uses full type
2446 information in order to avoid failures of proof reconstruction.
2448 * New evaluator "approximate" approximates an real valued term using
2449 the same method as the approximation method.
2451 * Method "approximate" now supports arithmetic expressions as
2452 boundaries of intervals and implements interval splitting and Taylor
2455 * ML antiquotation @{code_datatype} inserts definition of a datatype
2456 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2458 * New theory SupInf of the supremum and infimum operators for sets of
2461 * New theory Probability, which contains a development of measure
2462 theory, eventually leading to Lebesgue integration and probability.
2464 * Extended Multivariate Analysis to include derivation and Brouwer's
2467 * Reorganization of number theory, INCOMPATIBILITY:
2468 - new number theory development for nat and int, in theories Divides
2469 and GCD as well as in new session Number_Theory
2470 - some constants and facts now suffixed with _nat and _int
2472 - former session NumberTheory now named Old_Number_Theory, including
2473 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2474 - moved theory Pocklington from src/HOL/Library to
2475 src/HOL/Old_Number_Theory
2477 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2478 lcm of finite and infinite sets. It is shown that they form a complete
2481 * Class semiring_div requires superclass no_zero_divisors and proof of
2482 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2483 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2484 generalized to class semiring_div, subsuming former theorems
2485 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2486 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2489 * Refinements to lattice classes and sets:
2490 - less default intro/elim rules in locale variant, more default
2491 intro/elim rules in class variant: more uniformity
2492 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2494 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2496 - renamed ACI to inf_sup_aci
2497 - new class "boolean_algebra"
2498 - class "complete_lattice" moved to separate theory
2499 "Complete_Lattice"; corresponding constants (and abbreviations)
2500 renamed and with authentic syntax:
2501 Set.Inf ~> Complete_Lattice.Inf
2502 Set.Sup ~> Complete_Lattice.Sup
2503 Set.INFI ~> Complete_Lattice.INFI
2504 Set.SUPR ~> Complete_Lattice.SUPR
2505 Set.Inter ~> Complete_Lattice.Inter
2506 Set.Union ~> Complete_Lattice.Union
2507 Set.INTER ~> Complete_Lattice.INTER
2508 Set.UNION ~> Complete_Lattice.UNION
2509 - authentic syntax for
2512 - mere abbreviations:
2515 Set.inter (for inf, formerly Set.Int)
2516 Set.union (for sup, formerly Set.Un)
2517 Complete_Lattice.Inter (for Inf)
2518 Complete_Lattice.Union (for Sup)
2519 Complete_Lattice.INTER (for INFI)
2520 Complete_Lattice.UNION (for SUPR)
2521 - object-logic definitions as far as appropriate
2523 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2524 Un_subset_iff are explicitly deleted as default simp rules; then also
2525 their lattice counterparts le_inf_iff and le_sup_iff have to be
2526 deleted to achieve the desired effect.
2528 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2529 rules by default any longer; the same applies to min_max.inf_absorb1
2530 etc. INCOMPATIBILITY.
2532 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2533 pred_set_conv by default. INCOMPATIBILITY.
2535 * Power operations on relations and functions are now one dedicated
2536 constant "compow" with infix syntax "^^". Power operation on
2537 multiplicative monoids retains syntax "^" and is now defined generic
2538 in class power. INCOMPATIBILITY.
2540 * Relation composition "R O S" now has a more standard argument order:
2541 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2542 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2543 break, since the O_assoc rule was not rewritten like this. Fix using
2544 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2546 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2547 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2550 * Most rules produced by inductive and datatype package have mandatory
2551 prefixes. INCOMPATIBILITY.
2553 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2554 the attribute of the same name. Each of the theorems in the list
2555 DERIV_intros assumes composition with an additional function and
2556 matches a variable to the derivative, which has to be solved by the
2557 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2558 of most elementary terms. Former Maclauren.DERIV_tac and
2559 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2562 * Code generator attributes follow the usual underscore convention:
2563 code_unfold replaces code unfold
2564 code_post replaces code post
2569 sizechange -> size_change
2570 induct_scheme -> induction_schema
2573 * Discontinued abbreviation "arbitrary" of constant "undefined".
2574 INCOMPATIBILITY, use "undefined" directly.
2577 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2578 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2579 Suc_plus1 -> Suc_eq_plus1
2580 *anti_sym -> *antisym*
2581 vector_less_eq_def -> vector_le_def
2584 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2587 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2593 * Theory Representable defines a class "rep" of domains that are
2594 representable (via an ep-pair) in the universal domain type "udom".
2595 Instances are provided for all type constructors defined in HOLCF.
2597 * The 'new_domain' command is a purely definitional version of the
2598 domain package, for representable domains. Syntax is identical to the
2599 old domain package. The 'new_domain' package also supports indirect
2600 recursion using previously-defined type constructors. See
2601 src/HOLCF/ex/New_Domain.thy for examples.
2603 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2604 on the left-hand side of an equation, and then performs
2605 simplification. Rewriting is done using rules declared with the
2606 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2607 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2609 * The pattern-match compiler in 'fixrec' can now handle constructors
2610 with HOL function types. Pattern-match combinators for the Pair
2611 constructor are pre-configured.
2613 * The 'fixrec' package now produces better fixed-point induction rules
2614 for mutually-recursive definitions: Induction rules have conclusions
2615 of the form "P foo bar" instead of "P <foo, bar>".
2617 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2618 been renamed to "below". The name "below" now replaces "less" in many
2619 theorem names. (Legacy theorem names using "less" are still supported
2622 * The 'fixrec' package now supports "bottom patterns". Bottom
2623 patterns can be used to generate strictness rules, or to make
2624 functions more strict (much like the bang-patterns supported by the
2625 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2631 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2632 errors and run-time exceptions, including detailed source positions.
2634 * Structure Name_Space (formerly NameSpace) now manages uniquely
2635 identified entries, with some additional information such as source
2636 position, logical grouping etc.
2638 * Theory and context data is now introduced by the simplified and
2639 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2640 to be pure, but the old TheoryDataFun for mutable data (with explicit
2641 copy operation) is still available for some time.
2643 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2644 provides a high-level programming interface to synchronized state
2645 variables with atomic update. This works via pure function
2646 application within a critical section -- its runtime should be as
2647 short as possible; beware of deadlocks if critical code is nested,
2648 either directly or indirectly via other synchronized variables!
2650 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2651 wraps raw ML references, explicitly indicating their non-thread-safe
2652 behaviour. The Isar toplevel keeps this structure open, to
2653 accommodate Proof General as well as quick and dirty interactive
2654 experiments with references.
2656 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2657 parallel tactical reasoning.
2659 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2660 are similar to SUBPROOF, but are slightly more flexible: only the
2661 specified parts of the subgoal are imported into the context, and the
2662 body tactic may introduce new subgoals and schematic variables.
2664 * Old tactical METAHYPS, which does not observe the proof context, has
2665 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2666 or Subgoal.FOCUS etc.
2668 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2669 functors have their own ML name space there is no point to mark them
2670 separately.) Minor INCOMPATIBILITY.
2672 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2674 * Renamed several structures FooBar to Foo_Bar. Occasional,
2677 * Operations of structure Skip_Proof no longer require quick_and_dirty
2678 mode, which avoids critical setmp.
2680 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2681 combinators for "args". INCOMPATIBILITY, need to use simplified
2682 Attrib/Method.setup introduced in Isabelle2009.
2684 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2685 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2686 last resort. INCOMPATIBILITY.
2688 * Display.pretty_thm now requires a proper context (cf. former
2689 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2690 or even Display.pretty_thm_without_context as last resort.
2693 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2694 Syntax.pretty_typ/term directly, preferably with proper context
2695 instead of global theory.
2700 * Further fine tuning of parallel proof checking, scales up to 8 cores
2701 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2704 * Support for additional "Isabelle components" via etc/components, see
2705 also the system manual.
2707 * The isabelle makeall tool now operates on all components with
2708 IsaMakefile, not just hardwired "logics".
2710 * Removed "compress" option from isabelle-process and isabelle usedir;
2711 this is always enabled.
2713 * Discontinued support for Poly/ML 4.x versions.
2715 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2716 on a given logic image. This requires the lighttpd webserver and is
2717 currently supported on Linux only.
2721 New in Isabelle2009 (April 2009)
2722 --------------------------------
2726 * Simplified main Isabelle executables, with less surprises on
2727 case-insensitive file-systems (such as Mac OS).
2729 - The main Isabelle tool wrapper is now called "isabelle" instead of
2732 - The former "isabelle" alias for "isabelle-process" has been
2733 removed (should rarely occur to regular users).
2735 - The former "isabelle-interface" and its alias "Isabelle" have been
2736 removed (interfaces are now regular Isabelle tools).
2738 Within scripts and make files, the Isabelle environment variables
2739 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2740 respectively. (The latter are still available as legacy feature.)
2742 The old isabelle-interface wrapper could react in confusing ways if
2743 the interface was uninstalled or changed otherwise. Individual
2744 interface tool configuration is now more explicit, see also the
2745 Isabelle system manual. In particular, Proof General is now available
2746 via "isabelle emacs".
2748 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2749 purge installed copies of Isabelle executables and re-run "isabelle
2750 install -p ...", or use symlinks.
2752 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2753 old ~/isabelle, which was slightly non-standard and apt to cause
2754 surprises on case-insensitive file-systems (such as Mac OS).
2756 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2757 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2758 care is required when using older releases of Isabelle. Note that
2759 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2760 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2762 * Proofs of fully specified statements are run in parallel on
2763 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2764 a regular 4-core machine, if the initial heap space is made reasonably
2765 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2767 * The main reference manuals ("isar-ref", "implementation", and
2768 "system") have been updated and extended. Formally checked references
2769 as hyperlinks are now available uniformly.
2774 * Complete re-implementation of locales. INCOMPATIBILITY in several
2775 respects. The most important changes are listed below. See the
2776 Tutorial on Locales ("locales" manual) for details.
2778 - In locale expressions, instantiation replaces renaming. Parameters
2779 must be declared in a for clause. To aid compatibility with previous
2780 parameter inheritance, in locale declarations, parameters that are not
2781 'touched' (instantiation position "_" or omitted) are implicitly added
2782 with their syntax at the beginning of the for clause.
2784 - Syntax from abbreviations and definitions in locales is available in
2785 locale expressions and context elements. The latter is particularly
2786 useful in locale declarations.
2788 - More flexible mechanisms to qualify names generated by locale
2789 expressions. Qualifiers (prefixes) may be specified in locale
2790 expressions, and can be marked as mandatory (syntax: "name!:") or
2791 optional (syntax "name?:"). The default depends for plain "name:"
2792 depends on the situation where a locale expression is used: in
2793 commands 'locale' and 'sublocale' prefixes are optional, in
2794 'interpretation' and 'interpret' prefixes are mandatory. The old
2795 implicit qualifiers derived from the parameter names of a locale are
2796 no longer generated.
2798 - Command "sublocale l < e" replaces "interpretation l < e". The
2799 instantiation clause in "interpretation" and "interpret" (square
2800 brackets) is no longer available. Use locale expressions.
2802 - When converting proof scripts, mandatory qualifiers in
2803 'interpretation' and 'interpret' should be retained by default, even
2804 if this is an INCOMPATIBILITY compared to former behavior. In the
2805 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2806 in locale expressions range over a single locale instance only.
2808 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2809 In existing theorem specifications replace the includes element by the
2810 respective context elements of the included locale, omitting those
2811 that are already present in the theorem specification. Multiple
2812 assume elements of a locale should be replaced by a single one
2813 involving the locale predicate. In the proof body, declarations (most
2814 notably theorems) may be regained by interpreting the respective
2815 locales in the proof context as required (command "interpret").
2817 If using "includes" in replacement of a target solely because the
2818 parameter types in the theorem are not as general as in the target,
2819 consider declaring a new locale with additional type constraints on
2820 the parameters (context element "constrains").
2822 - Discontinued "locale (open)". INCOMPATIBILITY.
2824 - Locale interpretation commands no longer attempt to simplify goal.
2825 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2826 methods intro_locales and unfold_locales to clarify.
2828 - Locale interpretation commands no longer accept interpretation
2829 attributes. INCOMPATIBILITY.
2831 * Class declaration: so-called "base sort" must not be given in import
2832 list any longer, but is inferred from the specification. Particularly
2839 class foo = type + ...
2841 * Class target: global versions of theorems stemming do not carry a
2842 parameter prefix any longer. INCOMPATIBILITY.
2844 * Class 'instance' command no longer accepts attached definitions.
2845 INCOMPATIBILITY, use proper 'instantiation' target instead.
2847 * Recovered hiding of consts, which was accidentally broken in
2848 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2849 makes c inaccessible; consider using ``hide (open) const c'' instead.
2851 * Slightly more coherent Pure syntax, with updated documentation in
2852 isar-ref manual. Removed locales meta_term_syntax and
2853 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2854 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2855 directly in regular applications.
2857 * There is a new syntactic category "float_const" for signed decimal
2858 fractions (e.g. 123.45 or -123.45).
2860 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2861 interface with 'setup' command instead.
2863 * Command 'local_setup' is similar to 'setup', but operates on a local
2866 * The 'axiomatization' command now only works within a global theory
2867 context. INCOMPATIBILITY.
2869 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2870 hypotheses. Sorts required in the course of reasoning need to be
2871 covered by the constraints in the initial statement, completed by the
2872 type instance information of the background theory. Non-trivial sort
2873 hypotheses, which rarely occur in practice, may be specified via
2874 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2876 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2878 The result contains an implicit sort hypotheses as before --
2879 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2882 * Generalized Isar history, with support for linear undo, direct state
2885 * Changed defaults for unify configuration options:
2887 unify_trace_bound = 50 (formerly 25)
2888 unify_search_bound = 60 (formerly 30)
2890 * Different bookkeeping for code equations (INCOMPATIBILITY):
2892 a) On theory merge, the last set of code equations for a particular
2893 constant is taken (in accordance with the policy applied by other
2894 parts of the code generator framework).
2896 b) Code equations stemming from explicit declarations (e.g. code
2897 attribute) gain priority over default code equations stemming
2898 from definition, primrec, fun etc.
2900 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2902 * Unified theorem tables for both code generators. Thus [code
2903 func] has disappeared and only [code] remains. INCOMPATIBILITY.
2905 * Command 'find_consts' searches for constants based on type and name
2908 find_consts "_ => bool"
2910 By default, matching is against subtypes, but it may be restricted to
2911 the whole type. Searching by name is possible. Multiple queries are
2912 conjunctive and queries may be negated by prefixing them with a
2915 find_consts strict: "_ => bool" name: "Int" -"int => int"
2917 * New 'find_theorems' criterion "solves" matches theorems that
2918 directly solve the current goal (modulo higher-order unification).
2920 * Auto solve feature for main theorem statements: whenever a new goal
2921 is stated, "find_theorems solves" is called; any theorems that could
2922 solve the lemma directly are listed as part of the goal state.
2923 Cf. associated options in Proof General Isabelle settings menu,
2924 enabled by default, with reasonable timeout for pathological cases of
2925 higher-order unification.
2928 *** Document preparation ***
2930 * Antiquotation @{lemma} now imitates a regular terminal proof,
2931 demanding keyword 'by' and supporting the full method expression
2932 syntax just like the Isar command 'by'.
2937 * Integrated main parts of former image HOL-Complex with HOL. Entry
2938 points Main and Complex_Main remain as before.
2940 * Logic image HOL-Plain provides a minimal HOL with the most important
2941 tools available (inductive, datatype, primrec, ...). This facilitates
2942 experimentation and tool development. Note that user applications
2943 (and library theories) should never refer to anything below theory
2946 * Logic image HOL-Main stops at theory Main, and thus facilitates
2947 experimentation due to shorter build times.
2949 * Logic image HOL-NSA contains theories of nonstandard analysis which
2950 were previously part of former HOL-Complex. Entry point Hyperreal
2951 remains valid, but theories formerly using Complex_Main should now use
2952 new entry point Hypercomplex.
2954 * Generic ATP manager for Sledgehammer, based on ML threads instead of
2955 Posix processes. Avoids potentially expensive forking of the ML
2956 process. New thread-based implementation also works on non-Unix
2957 platforms (Cygwin). Provers are no longer hardwired, but defined
2958 within the theory via plain ML wrapper functions. Basic Sledgehammer
2959 commands are covered in the isar-ref manual.
2961 * Wrapper scripts for remote SystemOnTPTP service allows to use
2962 sledgehammer without local ATP installation (Vampire etc.). Other
2963 provers may be included via suitable ML wrappers, see also
2964 src/HOL/ATP_Linkup.thy.
2966 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
2969 * The metis method no longer fails because the theorem is too trivial
2970 (contains the empty clause).
2972 * The metis method now fails in the usual manner, rather than raising
2973 an exception, if it determines that it cannot prove the theorem.
2975 * Method "coherent" implements a prover for coherent logic (see also
2976 src/Tools/coherent.ML).
2978 * Constants "undefined" and "default" replace "arbitrary". Usually
2979 "undefined" is the right choice to replace "arbitrary", though
2980 logically there is no difference. INCOMPATIBILITY.
2982 * Command "value" now integrates different evaluation mechanisms. The
2983 result of the first successful evaluation mechanism is printed. In
2984 square brackets a particular named evaluation mechanisms may be
2985 specified (currently, [SML], [code] or [nbe]). See further
2986 src/HOL/ex/Eval_Examples.thy.
2988 * Normalization by evaluation now allows non-leftlinear equations.
2989 Declare with attribute [code nbe].
2991 * Methods "case_tac" and "induct_tac" now refer to the very same rules
2992 as the structured Isar versions "cases" and "induct", cf. the
2993 corresponding "cases" and "induct" attributes. Mutual induction rules
2994 are now presented as a list of individual projections
2995 (e.g. foo_bar.inducts for types foo and bar); the old format with
2996 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
2997 rare situations a different rule is selected --- notably nested tuple
2998 elimination instead of former prod.exhaust: use explicit (case_tac t
2999 rule: prod.exhaust) here.
3001 * Attributes "cases", "induct", "coinduct" support "del" option.
3003 * Removed fact "case_split_thm", which duplicates "case_split".
3005 * The option datatype has been moved to a new theory Option. Renamed
3006 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3008 * New predicate "strict_mono" classifies strict functions on partial
3009 orders. With strict functions on linear orders, reasoning about
3010 (in)equalities is facilitated by theorems "strict_mono_eq",
3011 "strict_mono_less_eq" and "strict_mono_less".
3013 * Some set operations are now proper qualified constants with
3014 authentic syntax. INCOMPATIBILITY:
3025 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3028 * Auxiliary class "itself" has disappeared -- classes without any
3029 parameter are treated as expected by the 'class' command.
3031 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3033 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3034 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3036 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3037 method "approximation". It proves formulas on real values by using
3038 interval arithmetic. In the formulas are also the transcendental
3039 functions sin, cos, tan, atan, ln, exp and the constant pi are
3040 allowed. For examples see
3041 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3043 * Theory "Reflection" now resides in HOL/Library.
3045 * Entry point to Word library now simply named "Word".
3048 * Made source layout more coherent with logical distribution
3051 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3052 src/HOL/Library/Code_Message.thy ~> src/HOL/
3053 src/HOL/Library/GCD.thy ~> src/HOL/
3054 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3055 src/HOL/Library/Parity.thy ~> src/HOL/
3056 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3057 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3058 src/HOL/Real/Lubs.thy ~> src/HOL/
3059 src/HOL/Real/PReal.thy ~> src/HOL/
3060 src/HOL/Real/Rational.thy ~> src/HOL/
3061 src/HOL/Real/RComplete.thy ~> src/HOL/
3062 src/HOL/Real/RealDef.thy ~> src/HOL/
3063 src/HOL/Real/RealPow.thy ~> src/HOL/
3064 src/HOL/Real/Real.thy ~> src/HOL/
3065 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3066 src/HOL/Complex/Complex.thy ~> src/HOL/
3067 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3068 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3069 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3070 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3071 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3072 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3073 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3074 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3075 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3076 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3077 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3078 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3079 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3080 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3081 src/HOL/Real/Float ~> src/HOL/Library/
3082 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3083 src/HOL/Real/RealVector.thy ~> src/HOL/
3085 src/HOL/arith_data.ML ~> src/HOL/Tools
3086 src/HOL/hologic.ML ~> src/HOL/Tools
3087 src/HOL/simpdata.ML ~> src/HOL/Tools
3088 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3089 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3090 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3091 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3092 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3093 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3094 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3096 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3097 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3098 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3099 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3100 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3101 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3103 * If methods "eval" and "evaluation" encounter a structured proof
3104 state with !!/==>, only the conclusion is evaluated to True (if
3105 possible), avoiding strange error messages.
3107 * Method "sizechange" automates termination proofs using (a
3108 modification of) the size-change principle. Requires SAT solver. See
3109 src/HOL/ex/Termination.thy for examples.
3111 * Simplifier: simproc for let expressions now unfolds if bound
3112 variable occurs at most once in let expression body. INCOMPATIBILITY.
3114 * Method "arith": Linear arithmetic now ignores all inequalities when
3115 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3117 * New attribute "arith" for facts that should always be used
3118 automatically by arithmetic. It is intended to be used locally in
3121 assumes [arith]: "x > 0"
3123 Global usage is discouraged because of possible performance impact.
3125 * New classes "top" and "bot" with corresponding operations "top" and
3126 "bot" in theory Orderings; instantiation of class "complete_lattice"
3127 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3129 * Changed definition lemma "less_fun_def" in order to provide an
3130 instance for preorders on functions; use lemma "less_le" instead.
3133 * Theory Orderings: class "wellorder" moved here, with explicit
3134 induction rule "less_induct" as assumption. For instantiation of
3135 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3138 * Theory Orderings: added class "preorder" as superclass of "order".
3139 INCOMPATIBILITY: Instantiation proofs for order, linorder
3140 etc. slightly changed. Some theorems named order_class.* now named
3143 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3146 * Theory Finite_Set: added a new fold combinator of type
3148 ('a => 'b => 'b) => 'b => 'a set => 'b
3150 Occasionally this is more convenient than the old fold combinator
3151 which is now defined in terms of the new one and renamed to
3154 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3155 and "ring_simps" have been replaced by "algebra_simps" (which can be
3156 extended with further lemmas!). At the moment both still exist but
3157 the former will disappear at some point.
3159 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3160 class recpower. Type-specific simp rules for various recpower types
3161 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3163 rat_power_0 -> power_0
3164 rat_power_Suc -> power_Suc
3165 realpow_0 -> power_0
3166 realpow_Suc -> power_Suc
3167 complexpow_0 -> power_0
3168 complexpow_Suc -> power_Suc
3169 power_poly_0 -> power_0
3170 power_poly_Suc -> power_Suc
3172 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3173 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3174 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3175 of lemmas from Divides has been generalized from nat to class
3176 semiring_div. INCOMPATIBILITY. This involves the following theorem
3177 renames resulting from duplicate elimination:
3179 dvd_def_mod ~> dvd_eq_mod_eq_0
3180 zero_dvd_iff ~> dvd_0_left_iff
3181 dvd_0 ~> dvd_0_right
3182 DIVISION_BY_ZERO_DIV ~> div_by_0
3183 DIVISION_BY_ZERO_MOD ~> mod_by_0
3184 mult_div ~> div_mult_self2_is_id
3185 mult_mod ~> mod_mult_self2_is_0
3187 * Theory IntDiv: removed many lemmas that are instances of class-based
3188 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3189 rename old lemmas as follows:
3191 dvd_diff -> nat_dvd_diff
3192 dvd_zminus_iff -> dvd_minus_iff
3193 mod_add1_eq -> mod_add_eq
3194 mod_mult1_eq -> mod_mult_right_eq
3195 mod_mult1_eq' -> mod_mult_left_eq
3196 mod_mult_distrib_mod -> mod_mult_eq
3197 nat_mod_add_left_eq -> mod_add_left_eq
3198 nat_mod_add_right_eq -> mod_add_right_eq
3199 nat_mod_div_trivial -> mod_div_trivial
3200 nat_mod_mod_trivial -> mod_mod_trivial
3201 zdiv_zadd_self1 -> div_add_self1
3202 zdiv_zadd_self2 -> div_add_self2
3203 zdiv_zmult_self1 -> div_mult_self2_is_id
3204 zdiv_zmult_self2 -> div_mult_self1_is_id
3205 zdvd_triv_left -> dvd_triv_left
3206 zdvd_triv_right -> dvd_triv_right
3207 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3208 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3209 zmod_zadd_left_eq -> mod_add_left_eq
3210 zmod_zadd_right_eq -> mod_add_right_eq
3211 zmod_zadd_self1 -> mod_add_self1
3212 zmod_zadd_self2 -> mod_add_self2
3213 zmod_zadd1_eq -> mod_add_eq
3214 zmod_zdiff1_eq -> mod_diff_eq
3215 zmod_zdvd_zmod -> mod_mod_cancel
3216 zmod_zmod_cancel -> mod_mod_cancel
3217 zmod_zmult_self1 -> mod_mult_self2_is_0
3218 zmod_zmult_self2 -> mod_mult_self1_is_0
3221 zdvd_abs1 -> abs_dvd_iff
3222 zdvd_abs2 -> dvd_abs_iff
3223 zdvd_refl -> dvd_refl
3224 zdvd_trans -> dvd_trans
3225 zdvd_zadd -> dvd_add
3226 zdvd_zdiff -> dvd_diff
3227 zdvd_zminus_iff -> dvd_minus_iff
3228 zdvd_zminus2_iff -> minus_dvd_iff
3229 zdvd_zmultD -> dvd_mult_right
3230 zdvd_zmultD2 -> dvd_mult_left
3231 zdvd_zmult_mono -> mult_dvd_mono
3232 zdvd_0_right -> dvd_0_right
3233 zdvd_0_left -> dvd_0_left_iff
3234 zdvd_1_left -> one_dvd
3235 zminus_dvd_iff -> minus_dvd_iff
3237 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3239 * The real numbers offer decimal input syntax: 12.34 is translated
3240 into 1234/10^2. This translation is not reversed upon output.
3242 * Theory Library/Polynomial defines an abstract type 'a poly of
3243 univariate polynomials with coefficients of type 'a. In addition to
3244 the standard ring operations, it also supports div and mod. Code
3245 generation is also supported, using list-style constructors.
3247 * Theory Library/Inner_Product defines a class of real_inner for real
3248 inner product spaces, with an overloaded operation inner :: 'a => 'a
3249 => real. Class real_inner is a subclass of real_normed_vector from
3252 * Theory Library/Product_Vector provides instances for the product
3253 type 'a * 'b of several classes from RealVector and Inner_Product.
3254 Definitions of addition, subtraction, scalar multiplication, norms,
3255 and inner products are included.
3257 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3258 addition to the field operations, numerals and case syntax are also
3261 * Theory Library/Diagonalize provides constructive version of Cantor's
3262 first diagonalization argument.
3264 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3265 zlcm (for int); carried together from various gcd/lcm developements in
3266 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3267 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3268 may recover tupled syntax as follows:
3270 hide (open) const gcd
3271 abbreviation gcd where
3272 "gcd == (%(a, b). GCD.gcd a b)"
3274 GCD.gcd ("gcd '(_, _')")
3276 The same works for lcm, zgcd, zlcm.
3278 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3279 instantiations for algebraic structures. Removed some duplicate
3280 theorems. Changes in simp rules. INCOMPATIBILITY.
3282 * ML antiquotation @{code} takes a constant as argument and generates
3283 corresponding code in background and inserts name of the corresponding
3284 resulting ML value/function/datatype constructor binding in place.
3285 All occurrences of @{code} with a single ML block are generated
3286 simultaneously. Provides a generic and safe interface for
3287 instrumentalizing code generation. See
3288 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3289 In future you ought to refrain from ad-hoc compiling generated SML
3290 code on the ML toplevel. Note that (for technical reasons) @{code}
3291 cannot refer to constants for which user-defined serializations are
3292 set. Refer to the corresponding ML counterpart directly in that
3295 * Command 'rep_datatype': instead of theorem names the command now
3296 takes a list of terms denoting the constructors of the type to be
3297 represented as datatype. The characteristic theorems have to be
3298 proven. INCOMPATIBILITY. Also observe that the following theorems
3299 have disappeared in favour of existing ones:
3301 unit_induct ~> unit.induct
3302 prod_induct ~> prod.induct
3303 sum_induct ~> sum.induct
3304 Suc_Suc_eq ~> nat.inject
3305 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3310 * New locales for orders and lattices where the equivalence relation
3311 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3312 locales use a record structure with field eq for the equivalence.
3314 * New theory of factorial domains.
3316 * Units_l_inv and Units_r_inv are now simp rules by default.
3317 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3318 and/or r_inv will now also require deletion of these lemmas.
3320 * Renamed the following theorems, INCOMPATIBILITY:
3322 UpperD ~> Upper_memD
3323 LowerD ~> Lower_memD
3324 least_carrier ~> least_closed
3325 greatest_carrier ~> greatest_closed
3326 greatest_Lower_above ~> greatest_Lower_below
3327 one_zero ~> carrier_one_zero
3328 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3333 * Nominal datatypes can now contain type-variables.
3335 * Commands 'nominal_inductive' and 'equivariance' work with local
3338 * Nominal primrec can now works with local theory targets and its
3339 specification syntax now conforms to the general format as seen in
3342 * Method "perm_simp" honours the standard simplifier attributes
3343 (no_asm), (no_asm_use) etc.
3345 * The new predicate #* is defined like freshness, except that on the
3346 left hand side can be a set or list of atoms.
3348 * Experimental command 'nominal_inductive2' derives strong induction
3349 principles for inductive definitions. In contrast to
3350 'nominal_inductive', which can only deal with a fixed number of
3351 binders, it can deal with arbitrary expressions standing for sets of
3352 atoms to be avoided. The only inductive definition we have at the
3353 moment that needs this generalisation is the typing rule for Lets in
3356 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3357 -----------------------------------------------------------------
3358 Gamma |- Let x be t1 in t2 : T2
3360 In this rule one wants to avoid all the binders that are introduced by
3361 "close Gamma T1". We are looking for other examples where this
3362 feature might be useful. Please let us know.
3367 * Reimplemented the simplification procedure for proving continuity
3368 subgoals. The new simproc is extensible; users can declare additional
3369 continuity introduction rules with the attribute [cont2cont].
3371 * The continuity simproc now uses a different introduction rule for
3372 solving continuity subgoals on terms with lambda abstractions. In
3373 some rare cases the new simproc may fail to solve subgoals that the
3374 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3375 Potential INCOMPATIBILITY.
3377 * Command 'fixrec': specification syntax now conforms to the general
3378 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3379 examples. INCOMPATIBILITY.
3384 * Proof of Zorn's Lemma for partial orders.
3389 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3390 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3391 depends on multithreading, so timouts will not work before Poly/ML
3394 * High-level support for concurrent ML programming, see
3395 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3396 particularly convenient to organize independent functional
3397 computations. The concept of "synchronized variables" provides a
3398 higher-order interface for components with shared state, avoiding the
3399 delicate details of mutexes and condition variables. (Requires
3400 Poly/ML 5.2.1 or later.)
3402 * ML bindings produced via Isar commands are stored within the Isar
3403 context (theory or proof). Consequently, commands like 'use' and 'ML'
3404 become thread-safe and work with undo as expected (concerning
3405 top-level bindings, not side-effects on global references).
3406 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3407 compiler at runtime; really global bindings need to be given outside a
3408 theory. (Requires Poly/ML 5.2 or later.)
3410 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3411 context. Top-level ML bindings are stored within the proof context in
3412 a purely sequential fashion, disregarding the nested proof structure.
3413 ML bindings introduced by 'ML_prf' are discarded at the end of the
3414 proof. (Requires Poly/ML 5.2 or later.)
3416 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3417 and Method.setup, as well as Isar commands 'attribute_setup' and
3418 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3419 existing code accordingly, or use plain 'setup' together with old
3422 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3423 to 'a -> thm, while results are always tagged with an authentic oracle
3424 name. The Isar command 'oracle' is now polymorphic, no argument type
3425 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3426 accordingly. Note that extra performance may be gained by producing
3427 the cterm carefully, avoiding slow Thm.cterm_of.
3429 * Simplified interface for defining document antiquotations via
3430 ThyOutput.antiquotation, ThyOutput.output, and optionally
3431 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3432 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3435 * More systematic treatment of long names, abstract name bindings, and
3436 name space operations. Basic operations on qualified names have been
3437 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3438 Long_Name.append. Old type bstring has been mostly replaced by
3439 abstract type binding (see structure Binding), which supports precise
3440 qualification by packages and local theory targets, as well as proper
3441 tracking of source positions. INCOMPATIBILITY, need to wrap old
3442 bstring values into Binding.name, or better pass through abstract
3443 bindings everywhere. See further src/Pure/General/long_name.ML,
3444 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3446 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3447 LocalTheory.note etc.) now refer to the *full* internal name, not the
3448 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3450 * Disposed old type and term read functions (Sign.read_def_typ,
3451 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3452 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3453 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3454 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3455 resort for legacy applications.
3457 * Disposed old declarations, tactics, tactic combinators that refer to
3458 the simpset or claset of an implicit theory (such as Addsimps,
3459 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3460 embedded ML text, or local_simpset_of with a proper context passed as
3461 explicit runtime argument.
3463 * Rules and tactics that read instantiations (read_instantiate,
3464 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3465 context, which is required for parsing and type-checking. Moreover,
3466 the variables are specified as plain indexnames, not string encodings
3467 thereof. INCOMPATIBILITY.
3469 * Generic Toplevel.add_hook interface allows to analyze the result of
3470 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3471 for theorem dependency output of transactions resulting in a new
3474 * ML antiquotations: block-structured compilation context indicated by
3475 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3477 @{binding name} - basic name binding
3478 @{let ?pat = term} - term abbreviation (HO matching)
3479 @{note name = fact} - fact abbreviation
3480 @{thm fact} - singleton fact (with attributes)
3481 @{thms fact} - general fact (with attributes)
3482 @{lemma prop by method} - singleton goal
3483 @{lemma prop by meth1 meth2} - singleton goal
3484 @{lemma prop1 ... propN by method} - general goal
3485 @{lemma prop1 ... propN by meth1 meth2} - general goal
3486 @{lemma (open) ...} - open derivation
3491 * The Isabelle "emacs" tool provides a specific interface to invoke
3492 Proof General / Emacs, with more explicit failure if that is not
3493 installed (the old isabelle-interface script silently falls back on
3494 isabelle-process). The PROOFGENERAL_HOME setting determines the
3495 installation location of the Proof General distribution.
3497 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3498 the Isabelle process into a JVM/Scala application. See
3499 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3500 process wrapper has been discontinued.)
3502 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3504 * Various status messages (with exact source position information) are
3505 emitted, if proper markup print mode is enabled. This allows
3506 user-interface components to provide detailed feedback on internal
3511 New in Isabelle2008 (June 2008)
3512 -------------------------------
3516 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3517 and updated, with formally checked references as hyperlinks.
3519 * Theory loader: use_thy (and similar operations) no longer set the
3520 implicit ML context, which was occasionally hard to predict and in
3521 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3522 provides a proper context already.
3524 * Theory loader: old-style ML proof scripts being *attached* to a thy
3525 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3526 'use' within a theory file will do the job.
3528 * Name space merge now observes canonical order, i.e. the second space
3529 is inserted into the first one, while existing entries in the first
3530 space take precedence. INCOMPATIBILITY in rare situations, may try to
3531 swap theory imports.
3533 * Syntax: symbol \<chi> is now considered a letter. Potential
3534 INCOMPATIBILITY in identifier syntax etc.
3536 * Outer syntax: string tokens no longer admit escaped white space,
3537 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3538 white space without escapes.
3540 * Outer syntax: string tokens may contain arbitrary character codes
3541 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3547 * Context-dependent token translations. Default setup reverts locally
3548 fixed variables, and adds hilite markup for undeclared frees.
3550 * Unused theorems can be found using the new command 'unused_thms'.
3551 There are three ways of invoking it:
3554 Only finds unused theorems in the current theory.
3556 (2) unused_thms thy_1 ... thy_n -
3557 Finds unused theorems in the current theory and all of its ancestors,
3558 excluding the theories thy_1 ... thy_n and all of their ancestors.
3560 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3561 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3562 their ancestors, excluding the theories thy_1 ... thy_n and all of
3565 In order to increase the readability of the list produced by
3566 unused_thms, theorems that have been created by a particular instance
3567 of a theory command such as 'inductive' or 'function' are considered
3568 to belong to the same "group", meaning that if at least one theorem in
3569 this group is used, the other theorems in the same group are no longer
3570 reported as unused. Moreover, if all theorems in the group are
3571 unused, only one theorem in the group is displayed.
3573 Note that proof objects have to be switched on in order for
3574 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3575 usually the case when using Proof General with the default settings).
3577 * Authentic naming of facts disallows ad-hoc overwriting of previous
3578 theorems within the same name space. INCOMPATIBILITY, need to remove
3579 duplicate fact bindings, or even accidental fact duplications. Note
3580 that tools may maintain dynamically scoped facts systematically, using
3581 PureThy.add_thms_dynamic.
3583 * Command 'hide' now allows to hide from "fact" name space as well.
3585 * Eliminated destructive theorem database, simpset, claset, and
3586 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3587 update of theories within ML code.
3589 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3590 INCOMPATIBILITY, object-logics depending on former Pure require
3591 additional setup PureThy.old_appl_syntax_setup; object-logics
3592 depending on former CPure need to refer to Pure.
3594 * Commands 'use' and 'ML' are now purely functional, operating on
3595 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3596 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3599 * Command 'setup': discontinued implicit version with ML reference.
3601 * Instantiation target allows for simultaneous specification of class
3602 instance operations together with an instantiation proof.
3603 Type-checking phase allows to refer to class operations uniformly.
3604 See src/HOL/Complex/Complex.thy for an Isar example and
3605 src/HOL/Library/Eval.thy for an ML example.
3607 * Indexing of literal facts: be more serious about including only
3608 facts from the visible specification/proof context, but not the
3609 background context (locale etc.). Affects `prop` notation and method
3610 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3613 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3614 "(open)" option, which used to expose internal bound variables to the
3617 * Isar statements: removed obsolete case "rule_context".
3618 INCOMPATIBILITY, better use explicit fixes/assumes.
3620 * Locale proofs: default proof step now includes 'unfold_locales';
3621 hence 'proof' without argument may be used to unfold locale
3625 *** Document preparation ***
3627 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3628 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3629 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3630 spot); renamed link color from "darkblue" to "linkcolor" (default
3631 value unchanged, can be redefined via \definecolor); no longer sets
3632 "a4paper" option (unnecessary or even intrusive).
3634 * Antiquotation @{lemma A method} proves proposition A by the given
3635 method (either a method name or a method name plus (optional) method
3636 arguments in parentheses) and prints A just like @{prop A}.
3641 * New primrec package. Specification syntax conforms in style to
3642 definition/function/.... No separate induction rule is provided. The
3643 "primrec" command distinguishes old-style and new-style specifications
3644 by syntax. The former primrec package is now named OldPrimrecPackage.
3645 When adjusting theories, beware: constants stemming from new-style
3646 primrec specifications have authentic syntax.
3648 * Metis prover is now an order of magnitude faster, and also works
3649 with multithreading.
3651 * Metis: the maximum number of clauses that can be produced from a
3652 theorem is now given by the attribute max_clauses. Theorems that
3653 exceed this number are ignored, with a warning printed.
3655 * Sledgehammer no longer produces structured proofs by default. To
3656 enable, declare [[sledgehammer_full = true]]. Attributes
3657 reconstruction_modulus, reconstruction_sorts renamed
3658 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3660 * Method "induct_scheme" derives user-specified induction rules
3661 from well-founded induction and completeness of patterns. This factors
3662 out some operations that are done internally by the function package
3663 and makes them available separately. See
3664 src/HOL/ex/Induction_Scheme.thy for examples.
3666 * More flexible generation of measure functions for termination
3667 proofs: Measure functions can be declared by proving a rule of the
3668 form "is_measure f" and giving it the [measure_function] attribute.
3669 The "is_measure" predicate is logically meaningless (always true), and
3670 just guides the heuristic. To find suitable measure functions, the
3671 termination prover sets up the goal "is_measure ?f" of the appropriate
3672 type and generates all solutions by prolog-style backwards proof using
3675 This setup also deals with rules like
3677 "is_measure f ==> is_measure (list_size f)"
3679 which accommodates nested datatypes that recurse through lists.
3680 Similar rules are predeclared for products and option types.
3682 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3686 - Definitions of overloaded constants on sets have to be replaced by
3687 definitions on => and bool.
3689 - Some definitions of overloaded operators on sets can now be proved
3690 using the definitions of the operators on => and bool. Therefore,
3691 the following theorems have been renamed:
3693 subset_def -> subset_eq
3694 psubset_def -> psubset_eq
3695 set_diff_def -> set_diff_eq
3696 Compl_def -> Compl_eq
3697 Sup_set_def -> Sup_set_eq
3698 Inf_set_def -> Inf_set_eq
3699 sup_set_def -> sup_set_eq
3700 inf_set_def -> inf_set_eq
3702 - Due to the incompleteness of the HO unification algorithm, some
3703 rules such as subst may require manual instantiation, if some of
3704 the unknowns in the rule is a set.
3706 - Higher order unification and forward proofs:
3709 have "P (S::'a set)" <...>
3710 then have "EX S. P S" ..
3712 no longer works (due to the incompleteness of the HO unification
3713 algorithm) and must be replaced by the pattern
3720 - Calculational reasoning with subst (or similar rules):
3723 have "P (S::'a set)" <...>
3724 also have "S = T" <...>
3725 finally have "P T" .
3727 no longer works (for similar reasons as the previous example) and
3728 must be replaced by something like
3730 have "P (S::'a set)" <...>
3731 moreover have "S = T" <...>
3732 ultimately have "P T" by simp
3734 - Tactics or packages written in ML code:
3735 Code performing pattern matching on types via
3737 Type ("set", [T]) => ...
3739 must be rewritten. Moreover, functions like strip_type or
3740 binder_types no longer return the right value when applied to a
3743 T1 => ... => Tn => U => bool
3747 T1 => ... => Tn => U set
3749 * Merged theories Wellfounded_Recursion, Accessible_Part and
3750 Wellfounded_Relations to theory Wellfounded.
3752 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3754 * Class finite no longer treats UNIV as class parameter. Use class
3755 enum from theory Library/Enum instead to achieve a similar effect.
3758 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3759 and "Cons". INCOMPATIBILITY.
3761 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3762 Potential INCOMPATIBILITY.
3764 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3765 injective_fst_snd removed, use split_eta and prod_eqI instead.
3766 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3768 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3769 the same name in theory Orderings:
3779 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3780 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3781 and different variable names.
3783 * Library/Option_ord.thy: Canonical order on option type.
3785 * Library/RBT.thy: Red-black trees, an efficient implementation of
3788 * Library/Countable.thy: Type class for countable types.
3790 * Theory Int: The representation of numerals has changed. The infix
3791 operator BIT and the bit datatype with constructors B0 and B1 have
3792 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3793 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3794 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3797 * Theory Nat: definition of <= and < on natural numbers no longer
3798 depend on well-founded relations. INCOMPATIBILITY. Definitions
3799 le_def and less_def have disappeared. Consider lemmas not_less
3800 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3802 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3803 (whose purpose mainly is for various fold_set functionals) have been
3804 abandoned in favor of the existing algebraic classes
3805 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3806 lower_semilattice (resp. upper_semilattice) and linorder.
3809 * Theory Transitive_Closure: induct and cases rules now declare proper
3810 case_names ("base" and "step"). INCOMPATIBILITY.
3812 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3813 lattices. The form set-specific version is available as
3814 Inductive.lfp_ordinal_induct_set.
3816 * Renamed theorems "power.simps" to "power_int.simps".
3819 * Class semiring_div provides basic abstract properties of semirings
3820 with division and modulo operations. Subsumes former class dvd_mod.
3822 * Merged theories IntDef, Numeral and IntArith into unified theory
3823 Int. INCOMPATIBILITY.
3825 * Theory Library/Code_Index: type "index" now represents natural
3826 numbers rather than integers. INCOMPATIBILITY.
3828 * New class "uminus" with operation "uminus" (split of from class
3829 "minus" which now only has operation "minus", binary).
3832 * Constants "card", "internal_split", "option_map" now with authentic
3833 syntax. INCOMPATIBILITY.
3835 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3836 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3837 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3838 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3839 Sup_set_def, le_def, less_def, option_map_def now with object
3840 equality. INCOMPATIBILITY.
3842 * Records. Removed K_record, and replaced it by pure lambda term
3843 %x. c. The simplifier setup is now more robust against eta expansion.
3844 INCOMPATIBILITY: in cases explicitly referring to K_record.
3846 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3848 * Library/ListVector: new theory of arithmetic vector operations.
3850 * Library/Order_Relation: new theory of various orderings as sets of
3851 pairs. Defines preorders, partial orders, linear orders and
3852 well-orders on sets and on types.
3857 * Renamed some theories to allow to loading both ZF and HOL in the
3860 Datatype -> Datatype_ZF
3861 Inductive -> Inductive_ZF
3868 INCOMPATIBILITY: ZF theories that import individual theories below
3869 Main might need to be adapted. Regular theory Main is still
3870 available, as trivial extension of Main_ZF.
3875 * ML within Isar: antiquotation @{const name} or @{const
3876 name(typargs)} produces statically-checked Const term.
3878 * Functor NamedThmsFun: data is available to the user as dynamic fact
3879 (of the same name). Removed obsolete print command.
3881 * Removed obsolete "use_legacy_bindings" function.
3883 * The ``print mode'' is now a thread-local value derived from a global
3884 template (the former print_mode reference), thus access becomes
3885 non-critical. The global print_mode reference is for session
3886 management only; user-code should use print_mode_value,
3887 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3889 * Functions system/system_out provide a robust way to invoke external
3890 shell commands, with propagation of interrupts (requires Poly/ML
3891 5.2.1). Do not use OS.Process.system etc. from the basis library!
3896 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3897 in accordance with Proof General 3.7, which prefers GNU emacs.
3899 * isatool tty runs Isabelle process with plain tty interaction;
3900 optional line editor may be specified via ISABELLE_LINE_EDITOR
3901 setting, the default settings attempt to locate "ledit" and "rlwrap".
3903 * isatool browser now works with Cygwin as well, using general
3904 "javapath" function defined in Isabelle process environment.
3906 * YXML notation provides a simple and efficient alternative to
3907 standard XML transfer syntax. See src/Pure/General/yxml.ML and
3908 isatool yxml as described in the Isabelle system manual.
3910 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
3911 provides general wrapper for managing an Isabelle process in a robust
3912 fashion, with ``cooked'' output from stdin/stderr.
3914 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
3915 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
3917 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
3918 way of changing the user's settings is via
3919 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
3922 * Multithreading.max_threads := 0 refers to the number of actual CPU
3923 cores of the underlying machine, which is a good starting point for
3924 optimal performance tuning. The corresponding usedir option -M allows
3925 "max" as an alias for "0". WARNING: does not work on certain versions
3926 of Mac OS (with Poly/ML 5.1).
3928 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3929 adverse effect of Isabelle flooding interactive front-ends (notably
3930 ProofGeneral / XEmacs).
3934 New in Isabelle2007 (November 2007)
3935 -----------------------------------
3939 * More uniform information about legacy features, notably a
3940 warning/error of "Legacy feature: ...", depending on the state of the
3941 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
3942 legacy features will disappear eventually.
3944 * Theory syntax: the header format ``theory A = B + C:'' has been
3945 discontinued in favour of ``theory A imports B C begin''. Use isatool
3946 fixheaders to convert existing theory files. INCOMPATIBILITY.
3948 * Theory syntax: the old non-Isar theory file format has been
3949 discontinued altogether. Note that ML proof scripts may still be used
3950 with Isar theories; migration is usually quite simple with the ML
3951 function use_legacy_bindings. INCOMPATIBILITY.
3953 * Theory syntax: some popular names (e.g. 'class', 'declaration',
3954 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
3957 * Theory loader: be more serious about observing the static theory
3958 header specifications (including optional directories), but not the
3959 accidental file locations of previously successful loads. The strict
3960 update policy of former update_thy is now already performed by
3961 use_thy, so the former has been removed; use_thys updates several
3962 theories simultaneously, just as 'imports' within a theory header
3963 specification, but without merging the results. Potential
3964 INCOMPATIBILITY: may need to refine theory headers and commands
3965 ROOT.ML which depend on load order.
3967 * Theory loader: optional support for content-based file
3968 identification, instead of the traditional scheme of full physical
3969 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
3970 (cf. the system manual). The new scheme allows to work with
3971 non-finished theories in persistent session images, such that source
3972 files may be moved later on without requiring reloads.
3974 * Theory loader: old-style ML proof scripts being *attached* to a thy
3975 file (with the same base name as the theory) are considered a legacy
3976 feature, which will disappear eventually. Even now, the theory loader
3977 no longer maintains dependencies on such files.
3979 * Syntax: the scope for resolving ambiguities via type-inference is
3980 now limited to individual terms, instead of whole simultaneous
3981 specifications as before. This greatly reduces the complexity of the
3982 syntax module and improves flexibility by separating parsing and
3983 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
3984 'fixes' etc.) are required in rare situations.
3986 * Syntax: constants introduced by new-style packages ('definition',
3987 'abbreviation' etc.) are passed through the syntax module in
3988 ``authentic mode''. This means that associated mixfix annotations
3989 really stick to such constants, independently of potential name space
3990 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
3991 trees are represented slightly differently, may need to adapt syntax
3992 translations accordingly. Use CONST marker in 'translations' and
3993 @{const_syntax} antiquotation in 'parse_translation' etc.
3995 * Legacy goal package: reduced interface to the bare minimum required
3996 to keep existing proof scripts running. Most other user-level
3997 functions are now part of the OldGoals structure, which is *not* open
3998 by default (consider isatool expandshort before open OldGoals).
3999 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4000 these tend to cause confusion about the actual goal (!) context being
4001 used here, which is not necessarily the same as the_context().
4003 * Command 'find_theorems': supports "*" wild-card in "name:"
4004 criterion; "with_dups" option. Certain ProofGeneral versions might
4005 support a specific search form (see ProofGeneral/CHANGES).
4007 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4008 by default, which means that "prems" (and also "fixed variables") are
4009 suppressed from proof state output. Note that the ProofGeneral
4010 settings mechanism allows to change and save options persistently, but
4011 older versions of Isabelle will fail to start up if a negative prems
4014 * Local theory targets may be specified by non-nested blocks of
4015 ``context/locale/class ... begin'' followed by ``end''. The body may
4016 contain definitions, theorems etc., including any derived mechanism
4017 that has been implemented on top of these primitives. This concept
4018 generalizes the existing ``theorem (in ...)'' towards more versatility
4021 * Proof General interface: proper undo of final 'end' command;
4022 discontinued Isabelle/classic mode (ML proof scripts).
4025 *** Document preparation ***
4027 * Added antiquotation @{theory name} which prints the given name,
4028 after checking that it refers to a valid ancestor theory in the
4031 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4032 check the given source text as ML type/structure, printing verbatim.
4034 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4035 "c args == rhs" given in the current context. (Any number of
4036 arguments may be given on the LHS.)
4041 * The 'class' package offers a combination of axclass and locale to
4042 achieve Haskell-like type classes in Isabelle. Definitions and
4043 theorems within a class context produce both relative results (with
4044 implicit parameters according to the locale context), and polymorphic
4045 constants with qualified polymorphism (according to the class
4046 context). Within the body context of a 'class' target, a separate
4047 syntax layer ("user space type system") takes care of converting
4048 between global polymorphic consts and internal locale representation.
4049 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4050 "isatool doc classes" provides a tutorial.
4052 * Generic code generator framework allows to generate executable
4053 code for ML and Haskell (including Isabelle classes). A short usage
4056 internal compilation:
4057 export_code <list of constants (term syntax)> in SML
4058 writing SML code to a file:
4059 export_code <list of constants (term syntax)> in SML <filename>
4060 writing OCaml code to a file:
4061 export_code <list of constants (term syntax)> in OCaml <filename>
4062 writing Haskell code to a bunch of files:
4063 export_code <list of constants (term syntax)> in Haskell <filename>
4065 evaluating closed propositions to True/False using code generation:
4068 Reasonable default setup of framework in HOL.
4070 Theorem attributs for selecting and transforming function equations theorems:
4072 [code fun]: select a theorem as function equation for a specific constant
4073 [code fun del]: deselect a theorem as function equation for a specific constant
4074 [code inline]: select an equation theorem for unfolding (inlining) in place
4075 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4077 User-defined serializations (target in {SML, OCaml, Haskell}):
4079 code_const <and-list of constants (term syntax)>
4080 {(target) <and-list of const target syntax>}+
4082 code_type <and-list of type constructors>
4083 {(target) <and-list of type target syntax>}+
4085 code_instance <and-list of instances>
4087 where instance ::= <type constructor> :: <class>
4089 code_class <and_list of classes>
4090 {(target) <and-list of class target syntax>}+
4091 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4093 code_instance and code_class only are effective to target Haskell.
4095 For example usage see src/HOL/ex/Codegenerator.thy and
4096 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4097 generation from Isabelle/HOL theories is available via "isatool doc
4100 * Code generator: consts in 'consts_code' Isar commands are now
4101 referred to by usual term syntax (including optional type
4104 * Command 'no_translations' removes translation rules from theory
4107 * Overloaded definitions are now actually checked for acyclic
4108 dependencies. The overloading scheme is slightly more general than
4109 that of Haskell98, although Isabelle does not demand an exact
4110 correspondence to type class and instance declarations.
4111 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4112 exotic versions of overloading -- at the discretion of the user!
4114 Polymorphic constants are represented via type arguments, i.e. the
4115 instantiation that matches an instance against the most general
4116 declaration given in the signature. For example, with the declaration
4117 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4118 as c(nat). Overloading is essentially simultaneous structural
4119 recursion over such type arguments. Incomplete specification patterns
4120 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4121 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4122 Command 'print_theory' outputs the normalized system of recursive
4123 equations, see section "definitions".
4125 * Configuration options are maintained within the theory or proof
4126 context (with name and type bool/int/string), providing a very simple
4127 interface to a poor-man's version of general context data. Tools may
4128 declare options in ML (e.g. using Attrib.config_int) and then refer to
4129 these values using Config.get etc. Users may change options via an
4130 associated attribute of the same name. This form of context
4131 declaration works particularly well with commands 'declare' or
4132 'using', for example ``declare [[foo = 42]]''. Thus it has become
4133 very easy to avoid global references, which would not observe Isar
4134 toplevel undo/redo and fail to work with multithreading.
4136 Various global ML references of Pure and HOL have been turned into
4137 configuration options:
4139 Unify.search_bound unify_search_bound
4140 Unify.trace_bound unify_trace_bound
4141 Unify.trace_simp unify_trace_simp
4142 Unify.trace_types unify_trace_types
4143 Simplifier.simp_depth_limit simp_depth_limit
4144 Blast.depth_limit blast_depth_limit
4145 DatatypeProp.dtK datatype_distinctness_limit
4146 fast_arith_neq_limit fast_arith_neq_limit
4147 fast_arith_split_limit fast_arith_split_limit
4149 * Named collections of theorems may be easily installed as context
4150 data using the functor NamedThmsFun (see also
4151 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4152 attributes; there is also a toplevel print command. This facility is
4153 just a common case of general context data, which is the preferred way
4154 for anything more complex than just a list of facts in canonical
4157 * Isar: command 'declaration' augments a local theory by generic
4158 declaration functions written in ML. This enables arbitrary content
4159 being added to the context, depending on a morphism that tells the
4160 difference of the original declaration context wrt. the application
4161 context encountered later on.
4163 * Isar: proper interfaces for simplification procedures. Command
4164 'simproc_setup' declares named simprocs (with match patterns, and body
4165 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4166 context. ML antiquotation @{simproc name} retrieves named simprocs.
4168 * Isar: an extra pair of brackets around attribute declarations
4169 abbreviates a theorem reference involving an internal dummy fact,
4170 which will be ignored later --- only the effect of the attribute on
4171 the background context will persist. This form of in-place
4172 declarations is particularly useful with commands like 'declare' and
4173 'using', for example ``have A using [[simproc a]] by simp''.
4175 * Isar: method "assumption" (and implicit closing of subproofs) now
4176 takes simple non-atomic goal assumptions into account: after applying
4177 an assumption as a rule the resulting subgoals are solved by atomic
4178 assumption steps. This is particularly useful to finish 'obtain'
4179 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4180 without referring to the original premise "!!x. P x ==> thesis" in the
4181 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4184 * Isar: implicit use of prems from the Isar proof context is
4185 considered a legacy feature. Common applications like ``have A .''
4186 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4187 referencing facts explicitly here improves readability and
4188 maintainability of proof texts.
4190 * Isar: improper proof element 'guess' is like 'obtain', but derives
4191 the obtained context from the course of reasoning! For example:
4193 assume "EX x y. A x & B y" -- "any previous fact"
4194 then guess x and y by clarify
4196 This technique is potentially adventurous, depending on the facts and
4197 proof tools being involved here.
4199 * Isar: known facts from the proof context may be specified as literal
4200 propositions, using ASCII back-quote syntax. This works wherever
4201 named facts used to be allowed so far, in proof commands, proof
4202 methods, attributes etc. Literal facts are retrieved from the context
4203 according to unification of type and term parameters. For example,
4204 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4205 theorems in the current context, then these are valid literal facts:
4206 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4208 There is also a proof method "fact" which does the same composition
4209 for explicit goal states, e.g. the following proof texts coincide with
4210 certain special cases of literal facts:
4212 have "A" by fact == note `A`
4213 have "A ==> B" by fact == note `A ==> B`
4214 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4215 have "P a ==> Q a" by fact == note `P a ==> Q a`
4217 * Isar: ":" (colon) is no longer a symbolic identifier character in
4218 outer syntax. Thus symbolic identifiers may be used without
4219 additional white space in declarations like this: ``assume *: A''.
4221 * Isar: 'print_facts' prints all local facts of the current context,
4222 both named and unnamed ones.
4224 * Isar: 'def' now admits simultaneous definitions, e.g.:
4226 def x == "t" and y == "u"
4228 * Isar: added command 'unfolding', which is structurally similar to
4229 'using', but affects both the goal state and facts by unfolding given
4230 rewrite rules. Thus many occurrences of the 'unfold' method or
4231 'unfolded' attribute may be replaced by first-class proof text.
4233 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4234 and command 'unfolding' now all support object-level equalities
4235 (potentially conditional). The underlying notion of rewrite rule is
4236 analogous to the 'rule_format' attribute, but *not* that of the
4237 Simplifier (which is usually more generous).
4239 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4240 premises of a theorem by n. Useful in conjunction with drule.
4242 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4243 method expression within a sandbox consisting of the first N
4244 sub-goals, which need to exist. For example, ``simp_all [3]''
4245 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4246 simplifies all new goals that emerge from applying rule foo to the
4247 originally first one.
4249 * Isar: schematic goals are no longer restricted to higher-order
4250 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4253 * Isar: the conclusion of a long theorem statement is now either
4254 'shows' (a simultaneous conjunction, as before), or 'obtains'
4255 (essentially a disjunction of cases with local parameters and
4256 assumptions). The latter allows to express general elimination rules
4257 adequately; in this notation common elimination rules look like this:
4259 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4261 obtains x where "P x"
4263 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4267 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4273 The subsequent classical rules even refer to the formal "thesis"
4276 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4279 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4280 obtains "thesis ==> something"
4282 The actual proof of an 'obtains' statement is analogous to that of the
4283 Isar proof element 'obtain', only that there may be several cases.
4284 Optional case names may be specified in parentheses; these will be
4285 available both in the present proof and as annotations in the
4286 resulting rule, for later use with the 'cases' method (cf. attribute
4289 * Isar: the assumptions of a long theorem statement are available as
4290 "assms" fact in the proof context. This is more appropriate than the
4291 (historical) "prems", which refers to all assumptions of the current
4292 context, including those from the target locale, proof body etc.
4294 * Isar: 'print_statement' prints theorems from the current theory or
4295 proof context in long statement form, according to the syntax of a
4298 * Isar: 'obtain' takes an optional case name for the local context
4299 introduction rule (default "that").
4301 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4302 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4305 * Pure: syntax "CONST name" produces a fully internalized constant
4306 according to the current context. This is particularly useful for
4307 syntax translations that should refer to internal constant
4308 representations independently of name spaces.
4310 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4311 instead of "FOO ". This allows multiple binder declarations to coexist
4312 in the same context. INCOMPATIBILITY.
4314 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4315 primitive that also works in a locale context (both for constants and
4316 fixed variables). Type declaration and internal syntactic representation
4317 of given constants retrieved from the context. Likewise, the
4318 'no_notation' command allows to remove given syntax annotations from the
4321 * Isar/locales: new derived specification elements 'axiomatization',
4322 'definition', 'abbreviation', which support type-inference, admit
4323 object-level specifications (equality, equivalence). See also the
4324 isar-ref manual. Examples:
4327 eq (infix "===" 50) where
4328 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4330 definition "f x y = x + y + 1"
4331 definition g where "g x = f x x"
4334 neq (infix "=!=" 50) where
4335 "x =!= y == ~ (x === y)"
4337 These specifications may be also used in a locale context. Then the
4338 constants being introduced depend on certain fixed parameters, and the
4339 constant name is qualified by the locale base name. An internal
4340 abbreviation takes care for convenient input and output, making the
4341 parameters implicit and using the original short name. See also
4342 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4343 entities from a monomorphic theory.
4345 Presently, abbreviations are only available 'in' a target locale, but
4346 not inherited by general import expressions. Also note that
4347 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4348 'translations' in common applications. The "no_abbrevs" print mode
4349 prevents folding of abbreviations in term output.
4351 Concrete syntax is attached to specified constants in internal form,
4352 independently of name spaces. The parse tree representation is
4353 slightly different -- use 'notation' instead of raw 'syntax', and
4354 'translations' with explicit "CONST" markup to accommodate this.
4356 * Pure/Isar: unified syntax for new-style specification mechanisms
4357 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4358 full type inference and dummy patterns ("_"). For example:
4360 definition "K x _ = x"
4362 inductive conj for A B
4363 where "A ==> B ==> conj A B"
4365 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4366 the current context. Print mode "no_abbrevs" prevents inversion of
4367 abbreviations on output.
4369 * Isar/locales: improved parameter handling: use of locales "var" and
4370 "struct" no longer necessary; - parameter renamings are no longer
4371 required to be injective. For example, this allows to define
4372 endomorphisms as locale endom = homom mult mult h.
4374 * Isar/locales: changed the way locales with predicates are defined.
4375 Instead of accumulating the specification, the imported expression is
4376 now an interpretation. INCOMPATIBILITY: different normal form of
4377 locale expressions. In particular, in interpretations of locales with
4378 predicates, goals repesenting already interpreted fragments are not
4379 removed automatically. Use methods `intro_locales' and
4380 `unfold_locales'; see below.
4382 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4383 provide backward reasoning on locales predicates. The methods are
4384 aware of interpretations and discharge corresponding goals.
4385 `intro_locales' is less aggressive then `unfold_locales' and does not
4386 unfold predicates to assumptions.
4388 * Isar/locales: the order in which locale fragments are accumulated
4389 has changed. This enables to override declarations from fragments due
4390 to interpretations -- for example, unwanted simp rules.
4392 * Isar/locales: interpretation in theories and proof contexts has been
4393 extended. One may now specify (and prove) equations, which are
4394 unfolded in interpreted theorems. This is useful for replacing
4395 defined concepts (constants depending on locale parameters) by
4396 concepts already existing in the target context. Example:
4398 interpretation partial_order ["op <= :: [int, int] => bool"]
4399 where "partial_order.less (op <=) (x::int) y = (x < y)"
4401 Typically, the constant `partial_order.less' is created by a
4402 definition specification element in the context of locale
4405 * Method "induct": improved internal context management to support
4406 local fixes and defines on-the-fly. Thus explicit meta-level
4407 connectives !! and ==> are rarely required anymore in inductive goals
4408 (using object-logic connectives for this purpose has been long
4409 obsolete anyway). Common proof patterns are explained in
4410 src/HOL/Induct/Common_Patterns.thy, see also
4411 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4414 * Method "induct": improved handling of simultaneous goals. Instead of
4415 introducing object-level conjunction, the statement is now split into
4416 several conclusions, while the corresponding symbolic cases are nested
4417 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4418 see src/HOL/Induct/Common_Patterns.thy, for example.
4420 * Method "induct": mutual induction rules are now specified as a list
4421 of rule sharing the same induction cases. HOL packages usually provide
4422 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4423 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4424 mutual induction rules differently, i.e. like this:
4426 (induct rule: foo_bar.inducts)
4427 (induct set: foo bar)
4428 (induct pred: foo bar)
4429 (induct type: foo bar)
4431 The ML function ProjectRule.projections turns old-style rules into the
4434 * Method "coinduct": dual of induction, see
4435 src/HOL/Library/Coinductive_List.thy for various examples.
4437 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4438 considered a legacy feature.
4440 * Attribute "symmetric" produces result with standardized schematic
4441 variables (index 0). Potential INCOMPATIBILITY.
4443 * Simplifier: by default the simplifier trace only shows top level
4444 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4445 default. Thus there is less danger of being flooded by the trace. The
4446 trace indicates where parts have been suppressed.
4448 * Provers/classical: removed obsolete classical version of elim_format
4449 attribute; classical elim/dest rules are now treated uniformly when
4450 manipulating the claset.
4452 * Provers/classical: stricter checks to ensure that supplied intro,
4453 dest and elim rules are well-formed; dest and elim rules must have at
4456 * Provers/classical: attributes dest/elim/intro take an optional
4457 weight argument for the rule (just as the Pure versions). Weights are
4458 ignored by automated tools, but determine the search order of single
4461 * Syntax: input syntax now supports dummy variable binding "%_. b",
4462 where the body does not mention the bound variable. Note that dummy
4463 patterns implicitly depend on their context of bounds, which makes
4464 "{_. _}" match any set comprehension as expected. Potential
4465 INCOMPATIBILITY -- parse translations need to cope with syntactic
4466 constant "_idtdummy" in the binding position.
4468 * Syntax: removed obsolete syntactic constant "_K" and its associated
4469 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4470 for example "A -> B" => "Pi A (%_. B)".
4472 * Pure: 'class_deps' command visualizes the subclass relation, using
4473 the graph browser tool.
4475 * Pure: 'print_theory' now suppresses certain internal declarations by
4476 default; use '!' option for full details.
4481 * Method "metis" proves goals by applying the Metis general-purpose
4482 resolution prover (see also http://gilith.com/software/metis/).
4483 Examples are in the directory MetisExamples. WARNING: the
4484 Isabelle/HOL-Metis integration does not yet work properly with
4487 * Command 'sledgehammer' invokes external automatic theorem provers as
4488 background processes. It generates calls to the "metis" method if
4489 successful. These can be pasted into the proof. Users do not have to
4490 wait for the automatic provers to return. WARNING: does not really
4491 work with multi-threading.
4493 * New "auto_quickcheck" feature tests outermost goal statements for
4494 potential counter-examples. Controlled by ML references
4495 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4496 5000 milliseconds). Fails silently if statements is outside of
4497 executable fragment, or any other codgenerator problem occurs.
4499 * New constant "undefined" with axiom "undefined x = undefined".
4501 * Added class "HOL.eq", allowing for code generation with polymorphic
4504 * Some renaming of class constants due to canonical name prefixing in
4505 the new 'class' package:
4507 HOL.abs ~> HOL.abs_class.abs
4508 HOL.divide ~> HOL.divide_class.divide
4509 0 ~> HOL.zero_class.zero
4510 1 ~> HOL.one_class.one
4511 op + ~> HOL.plus_class.plus
4512 op - ~> HOL.minus_class.minus
4513 uminus ~> HOL.minus_class.uminus
4514 op * ~> HOL.times_class.times
4515 op < ~> HOL.ord_class.less
4516 op <= > HOL.ord_class.less_eq
4517 Nat.power ~> Power.power_class.power
4518 Nat.size ~> Nat.size_class.size
4519 Numeral.number_of ~> Numeral.number_class.number_of
4520 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4521 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4522 Orderings.min ~> Orderings.ord_class.min
4523 Orderings.max ~> Orderings.ord_class.max
4524 Divides.op div ~> Divides.div_class.div
4525 Divides.op mod ~> Divides.div_class.mod
4526 Divides.op dvd ~> Divides.div_class.dvd
4528 INCOMPATIBILITY. Adaptions may be required in the following cases:
4530 a) User-defined constants using any of the names "plus", "minus",
4531 "times", "less" or "less_eq". The standard syntax translations for
4532 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4535 b) Variables named "plus", "minus", "times", "less", "less_eq"
4536 INCOMPATIBILITY: use more specific names.
4538 c) Permutative equations (e.g. "a + b = b + a")
4539 Since the change of names also changes the order of terms, permutative
4540 rewrite rules may get applied in a different order. Experience shows
4541 that this is rarely the case (only two adaptions in the whole Isabelle
4542 distribution). INCOMPATIBILITY: rewrite proofs
4544 d) ML code directly refering to constant names
4545 This in general only affects hand-written proof tactics, simprocs and
4546 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4547 Consider using @{const_name} antiquotation.
4549 * New class "default" with associated constant "default".
4551 * Function "sgn" is now overloaded and available on int, real, complex
4552 (and other numeric types), using class "sgn". Two possible defs of
4553 sgn are given as equational assumptions in the classes sgn_if and
4554 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4557 * Locale "partial_order" now unified with class "order" (cf. theory
4558 Orderings), added parameter "less". INCOMPATIBILITY.
4560 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4561 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4562 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4564 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4565 changed order of proof goals in instance proofs.
4567 * The transitivity reasoner for partial and linear orders is set up
4568 for classes "order" and "linorder". Instances of the reasoner are available
4569 in all contexts importing or interpreting the corresponding locales.
4570 Method "order" invokes the reasoner separately; the reasoner
4571 is also integrated with the Simplifier as a solver. Diagnostic
4572 command 'print_orders' shows the available instances of the reasoner
4573 in the current context.
4575 * Localized monotonicity predicate in theory "Orderings"; integrated
4576 lemmas max_of_mono and min_of_mono with this predicate.
4579 * Formulation of theorem "dense" changed slightly due to integration
4580 with new class dense_linear_order.
4582 * Uniform lattice theory development in HOL.
4584 constants "meet" and "join" now named "inf" and "sup"
4585 constant "Meet" now named "Inf"
4587 classes "meet_semilorder" and "join_semilorder" now named
4588 "lower_semilattice" and "upper_semilattice"
4589 class "lorder" now named "lattice"
4590 class "comp_lat" now named "complete_lattice"
4592 Instantiation of lattice classes allows explicit definitions
4593 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4595 INCOMPATIBILITY. Theorem renames:
4597 meet_left_le ~> inf_le1
4598 meet_right_le ~> inf_le2
4599 join_left_le ~> sup_ge1
4600 join_right_le ~> sup_ge2
4601 meet_join_le ~> inf_sup_ord
4604 le_meet ~> le_inf_iff
4605 le_join ~> ge_sup_conv
4606 meet_idempotent ~> inf_idem
4607 join_idempotent ~> sup_idem
4608 meet_comm ~> inf_commute
4609 join_comm ~> sup_commute
4610 meet_leI1 ~> le_infI1
4611 meet_leI2 ~> le_infI2
4612 le_joinI1 ~> le_supI1
4613 le_joinI2 ~> le_supI2
4614 meet_assoc ~> inf_assoc
4615 join_assoc ~> sup_assoc
4616 meet_left_comm ~> inf_left_commute
4617 meet_left_idempotent ~> inf_left_idem
4618 join_left_comm ~> sup_left_commute
4619 join_left_idempotent ~> sup_left_idem
4622 le_def_meet ~> le_iff_inf
4623 le_def_join ~> le_iff_sup
4624 join_absorp2 ~> sup_absorb2
4625 join_absorp1 ~> sup_absorb1
4626 meet_absorp1 ~> inf_absorb1
4627 meet_absorp2 ~> inf_absorb2
4628 meet_join_absorp ~> inf_sup_absorb
4629 join_meet_absorp ~> sup_inf_absorb
4630 distrib_join_le ~> distrib_sup_le
4631 distrib_meet_le ~> distrib_inf_le
4633 add_meet_distrib_left ~> add_inf_distrib_left
4634 add_join_distrib_left ~> add_sup_distrib_left
4635 is_join_neg_meet ~> is_join_neg_inf
4636 is_meet_neg_join ~> is_meet_neg_sup
4637 add_meet_distrib_right ~> add_inf_distrib_right
4638 add_join_distrib_right ~> add_sup_distrib_right
4639 add_meet_join_distribs ~> add_sup_inf_distribs
4640 join_eq_neg_meet ~> sup_eq_neg_inf
4641 meet_eq_neg_join ~> inf_eq_neg_sup
4642 add_eq_meet_join ~> add_eq_inf_sup
4643 meet_0_imp_0 ~> inf_0_imp_0
4644 join_0_imp_0 ~> sup_0_imp_0
4645 meet_0_eq_0 ~> inf_0_eq_0
4646 join_0_eq_0 ~> sup_0_eq_0
4647 neg_meet_eq_join ~> neg_inf_eq_sup
4648 neg_join_eq_meet ~> neg_sup_eq_inf
4649 join_eq_if ~> sup_eq_if
4651 mono_meet ~> mono_inf
4652 mono_join ~> mono_sup
4653 meet_bool_eq ~> inf_bool_eq
4654 join_bool_eq ~> sup_bool_eq
4655 meet_fun_eq ~> inf_fun_eq
4656 join_fun_eq ~> sup_fun_eq
4657 meet_set_eq ~> inf_set_eq
4658 join_set_eq ~> sup_set_eq
4659 meet1_iff ~> inf1_iff
4660 meet2_iff ~> inf2_iff
4669 join1_iff ~> sup1_iff
4670 join2_iff ~> sup2_iff
4680 is_meet_Meet ~> is_meet_Inf
4681 Meet_bool_def ~> Inf_bool_def
4682 Meet_fun_def ~> Inf_fun_def
4683 Meet_greatest ~> Inf_greatest
4684 Meet_lower ~> Inf_lower
4685 Meet_set_def ~> Inf_set_def
4688 Sup_bool_eq ~> Sup_bool_def
4689 Sup_fun_eq ~> Sup_fun_def
4690 Sup_set_eq ~> Sup_set_def
4692 listsp_meetI ~> listsp_infI
4693 listsp_meet_eq ~> listsp_inf_eq
4698 * Added syntactic class "size"; overloaded constant "size" now has
4699 type "'a::size ==> bool"
4701 * Internal reorganisation of `size' of datatypes: size theorems
4702 "foo.size" are no longer subsumed by "foo.simps" (but are still
4703 simplification rules by default!); theorems "prod.size" now named
4706 * Class "div" now inherits from class "times" rather than "type".
4709 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4710 Linorder etc. have disappeared; operations defined in terms of
4711 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4713 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4715 * HOL-Word: New extensive library and type for generic, fixed size
4716 machine words, with arithemtic, bit-wise, shifting and rotating
4717 operations, reflection into int, nat, and bool lists, automation for
4718 linear arithmetic (by automatic reflection into nat or int), including
4719 lemmas on overflow and monotonicity. Instantiated to all appropriate
4720 arithmetic type classes, supporting automatic simplification of
4721 numerals on all operations.
4723 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4725 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4727 * Code generator library theories:
4728 - Code_Integer represents HOL integers by big integer literals in target
4730 - Code_Char represents HOL characters by character literals in target
4732 - Code_Char_chr like Code_Char, but also offers treatment of character
4733 codes; includes Code_Integer.
4734 - Executable_Set allows to generate code for finite sets using lists.
4735 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4737 - Executable_Real implements a subset of real numbers, namly those
4738 representable by rational numbers.
4739 - Efficient_Nat implements natural numbers by integers, which in general will
4740 result in higher efficency; pattern matching with 0/Suc is eliminated;
4741 includes Code_Integer.
4742 - Code_Index provides an additional datatype index which is mapped to
4743 target-language built-in integers.
4744 - Code_Message provides an additional datatype message_string which is isomorphic to
4745 strings; messages are mapped to target-language strings.
4747 * New package for inductive predicates
4749 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4752 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4753 for z_1 :: U_1 and ... and z_n :: U_m
4755 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4758 with full support for type-inference, rather than
4760 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4762 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4763 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4765 inductive "s z_1 ... z_m"
4767 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4770 For backward compatibility, there is a wrapper allowing inductive
4771 sets to be defined with the new package via
4774 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4775 for z_1 :: U_1 and ... and z_n :: U_m
4777 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4783 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4784 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4785 for z_1 :: U_1 and ... and z_n :: U_m
4787 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4788 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4791 if the additional syntax "p ..." is required.
4793 Numerous examples can be found in the subdirectories src/HOL/Auth,
4794 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4798 - Since declaration and definition of inductive sets or predicates
4799 is no longer separated, abbreviations involving the newly
4800 introduced sets or predicates must be specified together with the
4801 introduction rules after the 'where' keyword (see above), rather
4802 than before the actual inductive definition.
4804 - The variables in induction and elimination rules are now
4805 quantified in the order of their occurrence in the introduction
4806 rules, rather than in alphabetical order. Since this may break
4807 some proofs, these proofs either have to be repaired, e.g. by
4808 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4809 statements of the form
4811 case (rule_i a_i_1 ... a_i_{k_i})
4813 or the old order of quantification has to be restored by explicitly adding
4814 meta-level quantifiers in the introduction rules, i.e.
4816 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4818 - The format of the elimination rules is now
4820 p z_1 ... z_m x_1 ... x_n ==>
4821 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4826 (x_1, ..., x_n) : s z_1 ... z_m ==>
4827 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4830 for sets rather than
4832 x : s z_1 ... z_m ==>
4833 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4836 This may require terms in goals to be expanded to n-tuples
4837 (e.g. using case_tac or simplification with the split_paired_all
4838 rule) before the above elimination rule is applicable.
4840 - The elimination or case analysis rules for (mutually) inductive
4841 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4842 list of rules "p_1_..._p_k.elims" is no longer available.
4844 * New package "function"/"fun" for general recursive functions,
4845 supporting mutual and nested recursion, definitions in local contexts,
4846 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4847 for small examples, and the separate tutorial on the function
4848 package. The old recdef "package" is still available as before, but
4849 users are encouraged to use the new package.
4851 * Method "lexicographic_order" automatically synthesizes termination
4852 relations as lexicographic combinations of size measures.
4854 * Case-expressions allow arbitrary constructor-patterns (including
4855 "_") and take their order into account, like in functional
4856 programming. Internally, this is translated into nested
4857 case-expressions; missing cases are added and mapped to the predefined
4858 constant "undefined". In complicated cases printing may no longer show
4859 the original input but the internal form. Lambda-abstractions allow
4860 the same form of pattern matching: "% pat1 => e1 | ..." is an
4861 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4864 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4865 is an abbreviation for "of_nat :: nat => int". The simplification
4866 rules for "of_nat" have been changed to work like "int" did
4867 previously. Potential INCOMPATIBILITY:
4868 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4869 - of_nat_diff and of_nat_mult are no longer default simp rules
4871 * Method "algebra" solves polynomial equations over (semi)rings using
4872 Groebner bases. The (semi)ring structure is defined by locales and the
4873 tool setup depends on that generic context. Installing the method for
4874 a specific type involves instantiating the locale and possibly adding
4875 declarations for computation on the coefficients. The method is
4876 already instantiated for natural numbers and for the axiomatic class
4877 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4878 CALCULEMUS 2007 for the general principles underlying this
4879 architecture of context-aware proof-tools.
4881 * Method "ferrack" implements quantifier elimination over
4882 special-purpose dense linear orders using locales (analogous to
4883 "algebra"). The method is already installed for class
4884 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4887 * Former constant "List.op @" now named "List.append". Use ML
4888 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4889 circumvent possible incompatibilities when working on ML level.
4891 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4893 * New function listsum :: 'a list => 'a for arbitrary monoids.
4894 Special syntax: "SUM x <- xs. f x" (and latex variants)
4896 * New syntax for Haskell-like list comprehension (input only), eg.
4897 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4899 * The special syntax for function "filter" has changed from [x :
4900 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4901 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4903 * [a..b] is now defined for arbitrary linear orders. It used to be
4904 defined on nat only, as an abbreviation for [a..<Suc b]
4907 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
4909 * New functions "sorted" and "sort" in src/HOL/List.thy.
4911 * New lemma collection field_simps (an extension of ring_simps) for
4912 manipulating (in)equations involving division. Multiplies with all
4913 denominators that can be proved to be non-zero (in equations) or
4914 positive/negative (in inequations).
4916 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
4917 have been improved and renamed to ring_simps, group_simps and
4918 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
4919 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
4921 * Theory Library/Commutative_Ring: switched from recdef to function
4922 package; constants add, mul, pow now curried. Infix syntax for
4923 algebraic operations.
4925 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4928 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4931 * HOL/records: generalised field-update to take a function on the
4932 field rather than the new value: r(|A := x|) is translated to A_update
4933 (K x) r The K-combinator that is internally used is called K_record.
4934 INCOMPATIBILITY: Usage of the plain update functions has to be
4937 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
4938 * x = 0, which are required for a semiring. Richer structures do not
4939 inherit from semiring_0 anymore, because this property is a theorem
4940 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
4941 there is more to prove, but this is mostly trivial.
4943 * Class "recpower" is generalized to arbitrary monoids, not just
4944 commutative semirings. INCOMPATIBILITY: may need to incorporate
4945 commutativity or semiring properties additionally.
4947 * Constant "List.list_all2" in List.thy now uses authentic syntax.
4948 INCOMPATIBILITY: translations containing list_all2 may go wrong,
4949 better use 'abbreviation'.
4951 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
4953 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
4954 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
4955 significant changes for setting up numeral syntax for types:
4956 - New constants Numeral.pred and Numeral.succ instead
4957 of former Numeral.bin_pred and Numeral.bin_succ.
4958 - Use integer operations instead of bin_add, bin_mult and so on.
4959 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
4960 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
4962 See src/HOL/Integ/IntArith.thy for an example setup.
4964 * Command 'normal_form' computes the normal form of a term that may
4965 contain free variables. For example ``normal_form "rev [a, b, c]"''
4966 produces ``[b, c, a]'' (without proof). This command is suitable for
4967 heavy-duty computations because the functions are compiled to ML
4968 first. Correspondingly, a method "normalization" is provided. See
4969 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
4971 * Alternative iff syntax "A <-> B" for equality on bool (with priority
4972 25 like -->); output depends on the "iff" print_mode, the default is
4973 "A = B" (with priority 50).
4975 * Relations less (<) and less_eq (<=) are also available on type bool.
4976 Modified syntax to disallow nesting without explicit parentheses,
4977 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
4980 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
4982 * Relation composition operator "op O" now has precedence 75 and binds
4983 stronger than union and intersection. INCOMPATIBILITY.
4985 * The old set interval syntax "{m..n(}" (and relatives) has been
4986 removed. Use "{m..<n}" (and relatives) instead.
4988 * In the context of the assumption "~(s = t)" the Simplifier rewrites
4989 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
4990 ``declare [[simproc del: neq]]''.
4992 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
4995 * Theorem Cons_eq_map_conv no longer declared as "simp".
4997 * Theorem setsum_mult renamed to setsum_right_distrib.
4999 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5002 * Reimplemented methods "sat" and "satx", with several improvements:
5003 goals no longer need to be stated as "<prems> ==> False", equivalences
5004 (i.e. "=" on type bool) are handled, variable names of the form
5005 "lit_<n>" are no longer reserved, significant speedup.
5007 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5008 zChaff is still supported as well.
5010 * 'inductive' and 'datatype': provide projections of mutual rules,
5011 bundled as foo_bar.inducts;
5013 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5016 * Library: moved theory Accessible_Part to main HOL.
5018 * Library: added theory Coinductive_List of potentially infinite lists
5019 as greatest fixed-point.
5021 * Library: added theory AssocList which implements (finite) maps as
5024 * Method "evaluation" solves goals (i.e. a boolean expression)
5025 efficiently by compiling it to ML. The goal is "proved" (via an
5026 oracle) if it evaluates to True.
5028 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5029 also when invoked by the simplifier. This results in the Simplifier
5030 being more powerful on arithmetic goals. INCOMPATIBILITY.
5031 Configuration option fast_arith_split_limit=0 recovers the old
5034 * Support for hex (0x20) and binary (0b1001) numerals.
5036 * New method: reify eqs (t), where eqs are equations for an
5037 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5038 parameter, computes a term s::'b and a list xs::'a list and proves the
5039 theorem I xs s = t. This is also known as reification or quoting. The
5040 resulting theorem is applied to the subgoal to substitute t with I xs
5041 s. If t is omitted, the subgoal itself is reified.
5043 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5044 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5045 where f is supposed to be a computable function (in the sense of code
5046 generattion). The method uses reify to compute s and xs as above then
5047 applies corr_thm and uses normalization by evaluation to "prove" f s =
5048 r and finally gets the theorem t = r, which is again applied to the
5049 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5051 * Reflection: Automatic reification now handels binding, an example is
5052 available in src/HOL/ex/ReflectionEx.thy
5054 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5055 command 'statespace' that is similar to 'record', but introduces an
5056 abstract specification based on the locale infrastructure instead of
5057 HOL types. This leads to extra flexibility in composing state spaces,
5058 in particular multiple inheritance and renaming of components.
5063 * Hyperreal: Functions root and sqrt are now defined on negative real
5064 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5065 Nonnegativity side conditions have been removed from many lemmas, so
5066 that more subgoals may now be solved by simplification; potential
5069 * Real: new type classes formalize real normed vector spaces and
5070 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5071 and norm :: 'a => real.
5073 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5074 reals into other types. The overloaded constant Reals :: 'a set is now
5075 defined as range of_real; potential INCOMPATIBILITY.
5077 * Real: proper support for ML code generation, including 'quickcheck'.
5078 Reals are implemented as arbitrary precision rationals.
5080 * Hyperreal: Several constants that previously worked only for the
5081 reals have been generalized, so they now work over arbitrary vector
5082 spaces. Type annotations may need to be added in some cases; potential
5085 Infinitesimal :: ('a::real_normed_vector) star set
5086 HFinite :: ('a::real_normed_vector) star set
5087 HInfinite :: ('a::real_normed_vector) star set
5088 approx :: ('a::real_normed_vector) star => 'a star => bool
5089 monad :: ('a::real_normed_vector) star => 'a star set
5090 galaxy :: ('a::real_normed_vector) star => 'a star set
5091 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5092 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5093 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5094 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5095 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5096 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5097 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5098 sgn :: 'a::real_normed_vector => 'a
5099 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5101 * Complex: Some complex-specific constants are now abbreviations for
5102 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5103 hnorm. Other constants have been entirely removed in favor of the
5104 polymorphic versions (INCOMPATIBILITY):
5108 HInfinite <-- CInfinite
5109 Infinitesimal <-- CInfinitesimal
5112 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5113 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5114 (ns)deriv <-- (ns)cderiv
5119 * Formalisation of ideals and the quotient construction over rings.
5121 * Order and lattice theory no longer based on records.
5124 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5125 greatest_closed. INCOMPATIBILITY.
5127 * Method algebra is now set up via an attribute. For examples see
5128 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5129 of algebraic structures.
5131 * Renamed theory CRing to Ring.
5136 * Substantial, yet incomplete support for nominal datatypes (binding
5137 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5138 src/HOL/Nominal/Examples. Prospective users should consult
5139 http://isabelle.in.tum.de/nominal/
5144 * ML basics: just one true type int, which coincides with IntInf.int
5147 * ML within Isar: antiquotations allow to embed statically-checked
5148 formal entities in the source, referring to the context available at
5149 compile-time. For example:
5151 ML {* @{sort "{zero,one}"} *}
5152 ML {* @{typ "'a => 'b"} *}
5153 ML {* @{term "%x. x"} *}
5154 ML {* @{prop "x == y"} *}
5155 ML {* @{ctyp "'a => 'b"} *}
5156 ML {* @{cterm "%x. x"} *}
5157 ML {* @{cprop "x == y"} *}
5158 ML {* @{thm asm_rl} *}
5159 ML {* @{thms asm_rl} *}
5160 ML {* @{type_name c} *}
5161 ML {* @{type_syntax c} *}
5162 ML {* @{const_name c} *}
5163 ML {* @{const_syntax c} *}
5166 ML {* @{theory Pure} *}
5167 ML {* @{theory_ref} *}
5168 ML {* @{theory_ref Pure} *}
5171 ML {* @{clasimpset} *}
5173 The same works for sources being ``used'' within an Isar context.
5175 * ML in Isar: improved error reporting; extra verbosity with
5176 ML_Context.trace enabled.
5178 * Pure/General/table.ML: the join operations now works via exceptions
5179 DUP/SAME instead of type option. This is simpler in simple cases, and
5180 admits slightly more efficient complex applications.
5182 * Pure: 'advanced' translation functions (parse_translation etc.) now
5183 use Context.generic instead of just theory.
5185 * Pure: datatype Context.generic joins theory/Proof.context and
5186 provides some facilities for code that works in either kind of
5187 context, notably GenericDataFun for uniform theory and proof data.
5189 * Pure: simplified internal attribute type, which is now always
5190 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5191 local (Proof.context) attributes have been discontinued, while
5192 minimizing code duplication. Thm.rule_attribute and
5193 Thm.declaration_attribute build canonical attributes; see also structure
5194 Context for further operations on Context.generic, notably
5195 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5196 declarations and definitions.
5198 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5199 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5200 init only required for impure data. INCOMPATIBILITY: empty really need
5201 to be empty (no dependencies on theory content!)
5203 * Pure/kernel: consts certification ignores sort constraints given in
5204 signature declarations. (This information is not relevant to the
5205 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5206 potential INCOMPATIBILITY.
5208 * Pure: axiomatic type classes are now purely definitional, with
5209 explicit proofs of class axioms and super class relations performed
5210 internally. See Pure/axclass.ML for the main internal interfaces --
5211 notably AxClass.define_class supercedes AxClass.add_axclass, and
5212 AxClass.axiomatize_class/classrel/arity supersede
5213 Sign.add_classes/classrel/arities.
5215 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5216 global/local versions on theory vs. Proof.context have been
5217 discontinued; Attrib.syntax and Method.syntax have been adapted
5218 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5219 attributes, methods, etc.
5221 * Pure: several functions of signature "... -> theory -> theory * ..."
5222 have been reoriented to "... -> theory -> ... * theory" in order to
5223 allow natural usage in combination with the ||>, ||>>, |-> and
5224 fold_map combinators.
5226 * Pure: official theorem names (closed derivations) and additional
5227 comments (tags) are now strictly separate. Name hints -- which are
5228 maintained as tags -- may be attached any time without affecting the
5231 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5232 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5233 achieve the old behaviour.
5235 * Pure: the "Goal" constant is now called "prop", supporting a
5236 slightly more general idea of ``protecting'' meta-level rule
5239 * Pure: Logic.(un)varify only works in a global context, which is now
5240 enforced instead of silently assumed. INCOMPATIBILITY, may use
5241 Logic.legacy_(un)varify as temporary workaround.
5243 * Pure: structure Name provides scalable operations for generating
5244 internal variable names, notably Name.variants etc. This replaces
5245 some popular functions from term.ML:
5247 Term.variant -> Name.variant
5248 Term.variantlist -> Name.variant_list
5249 Term.invent_names -> Name.invent_list
5251 Note that low-level renaming rarely occurs in new code -- operations
5252 from structure Variable are used instead (see below).
5254 * Pure: structure Variable provides fundamental operations for proper
5255 treatment of fixed/schematic variables in a context. For example,
5256 Variable.import introduces fixes for schematics of given facts and
5257 Variable.export reverses the effect (up to renaming) -- this replaces
5258 various freeze_thaw operations.
5260 * Pure: structure Goal provides simple interfaces for
5261 init/conclude/finish and tactical prove operations (replacing former
5262 Tactic.prove). Goal.prove is the canonical way to prove results
5263 within a given context; Goal.prove_global is a degraded version for
5264 theory level goals, including a global Drule.standard. Note that
5265 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5266 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5267 in a locale context).
5269 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5270 and type checking (Syntax.check_term etc.), with common combinations
5271 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5272 which are considered legacy and await removal.
5274 * Pure/Syntax: generic interfaces for type unchecking
5275 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5276 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5277 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5278 available for convenience, but refer to the very same operations using
5279 a mere theory instead of a full context.
5281 * Isar: simplified treatment of user-level errors, using exception
5282 ERROR of string uniformly. Function error now merely raises ERROR,
5283 without any side effect on output channels. The Isar toplevel takes
5284 care of proper display of ERROR exceptions. ML code may use plain
5285 handle/can/try; cat_error may be used to concatenate errors like this:
5287 ... handle ERROR msg => cat_error msg "..."
5289 Toplevel ML code (run directly or through the Isar toplevel) may be
5290 embedded into the Isar toplevel with exception display/debug like
5293 Isar.toplevel (fn () => ...)
5295 INCOMPATIBILITY, removed special transform_error facilities, removed
5296 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5297 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5298 -- use plain ERROR instead.
5300 * Isar: theory setup now has type (theory -> theory), instead of a
5301 list. INCOMPATIBILITY, may use #> to compose setup functions.
5303 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5304 ProofContext.debug/verbose flags.
5306 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5307 theory before entering a proof state. Transactions now always see a
5308 quasi-functional intermediate checkpoint, both in interactive and
5311 * Isar: simplified interfaces for outer syntax. Renamed
5312 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5313 OuterSyntax.add_parsers -- this functionality is now included in
5314 OuterSyntax.command etc. INCOMPATIBILITY.
5316 * Simplifier: the simpset of a running simplification process now
5317 contains a proof context (cf. Simplifier.the_context), which is the
5318 very context that the initial simpset has been retrieved from (by
5319 simpset_of/local_simpset_of). Consequently, all plug-in components
5320 (solver, looper etc.) may depend on arbitrary proof data.
5322 * Simplifier.inherit_context inherits the proof context (plus the
5323 local bounds) of the current simplification process; any simproc
5324 etc. that calls the Simplifier recursively should do this! Removed
5325 former Simplifier.inherit_bounds, which is already included here --
5326 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5327 specify an explicit context using Simplifier.context/theory_context.
5329 * Simplifier/Classical Reasoner: more abstract interfaces
5330 change_simpset/claset for modifying the simpset/claset reference of a
5331 theory; raw versions simpset/claset_ref etc. have been discontinued --
5334 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5340 * settings: the default heap location within ISABELLE_HOME_USER now
5341 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5342 Isabelle installations.
5344 * isabelle-process: option -S (secure mode) disables some critical
5345 operations, notably runtime compilation and evaluation of ML source
5348 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5350 * Support for parallel execution, using native multicore support of
5351 Poly/ML 5.1. The theory loader exploits parallelism when processing
5352 independent theories, according to the given theory header
5353 specifications. The maximum number of worker threads is specified via
5354 usedir option -M or the "max-threads" setting in Proof General. A
5355 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5356 to 6 on a 8-core machine. User-code needs to observe certain
5357 guidelines for thread-safe programming, see appendix A in the Isar
5358 Implementation manual.
5362 New in Isabelle2005 (October 2005)
5363 ----------------------------------
5367 * Theory headers: the new header syntax for Isar theories is
5370 imports <theory1> ... <theoryN>
5371 uses <file1> ... <fileM>
5374 where the 'uses' part is optional. The previous syntax
5376 theory <name> = <theory1> + ... + <theoryN>:
5378 will disappear in the next release. Use isatool fixheaders to convert
5379 existing theory files. Note that there is no change in ancient
5380 non-Isar theories now, but these will disappear soon.
5382 * Theory loader: parent theories can now also be referred to via
5383 relative and absolute paths.
5385 * Command 'find_theorems' searches for a list of criteria instead of a
5386 list of constants. Known criteria are: intro, elim, dest, name:string,
5387 simp:term, and any term. Criteria can be preceded by '-' to select
5388 theorems that do not match. Intro, elim, dest select theorems that
5389 match the current goal, name:s selects theorems whose fully qualified
5390 name contain s, and simp:term selects all simplification rules whose
5391 lhs match term. Any other term is interpreted as pattern and selects
5392 all theorems matching the pattern. Available in ProofGeneral under
5393 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5395 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5397 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5398 matching the current goal as introduction rule and not having "HOL."
5399 in their name (i.e. not being defined in theory HOL).
5401 * Command 'thms_containing' has been discontinued in favour of
5402 'find_theorems'; INCOMPATIBILITY.
5404 * Communication with Proof General is now 8bit clean, which means that
5405 Unicode text in UTF-8 encoding may be used within theory texts (both
5406 formal and informal parts). Cf. option -U of the Isabelle Proof
5407 General interface. Here are some simple examples (cf. src/HOL/ex):
5409 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5410 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5412 * Improved efficiency of the Simplifier and, to a lesser degree, the
5413 Classical Reasoner. Typical big applications run around 2 times
5417 *** Document preparation ***
5419 * Commands 'display_drafts' and 'print_drafts' perform simple output
5420 of raw sources. Only those symbols that do not require additional
5421 LaTeX packages (depending on comments in isabellesym.sty) are
5422 displayed properly, everything else is left verbatim. isatool display
5423 and isatool print are used as front ends (these are subject to the
5424 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5426 * Command tags control specific markup of certain regions of text,
5427 notably folding and hiding. Predefined tags include "theory" (for
5428 theory begin and end), "proof" for proof commands, and "ML" for
5429 commands involving ML code; the additional tags "visible" and
5430 "invisible" are unused by default. Users may give explicit tag
5431 specifications in the text, e.g. ''by %invisible (auto)''. The
5432 interpretation of tags is determined by the LaTeX job during document
5433 preparation: see option -V of isatool usedir, or options -n and -t of
5434 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5437 Several document versions may be produced at the same time via isatool
5438 usedir (the generated index.html will link all of them). Typical
5439 specifications include ''-V document=theory,proof,ML'' to present
5440 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5441 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5442 these parts without any formal replacement text. The Isabelle site
5443 default settings produce ''document'' and ''outline'' versions as
5446 * Several new antiquotations:
5448 @{term_type term} prints a term with its type annotated;
5450 @{typeof term} prints the type of a term;
5452 @{const const} is the same as @{term const}, but checks that the
5453 argument is a known logical constant;
5455 @{term_style style term} and @{thm_style style thm} print a term or
5456 theorem applying a "style" to it
5460 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5461 definitions, equations, inequations etc., 'concl' printing only the
5462 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5463 to print the specified premise. TermStyle.add_style provides an ML
5464 interface for introducing further styles. See also the "LaTeX Sugar"
5465 document practical applications. The ML antiquotation prints
5466 type-checked ML expressions verbatim.
5468 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5469 and 'text' support optional locale specification '(in loc)', which
5470 specifies the default context for interpreting antiquotations. For
5471 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5473 * Option 'locale=NAME' of antiquotations specifies an alternative
5474 context interpreting the subsequent argument. For example: @{thm
5475 [locale=lattice] inf_assoc}.
5477 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5480 * Proper output of antiquotations for theory commands involving a
5481 proof context (such as 'locale' or 'theorem (in loc) ...').
5483 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5484 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5486 * isatool usedir: new option -C (default true) controls whether option
5487 -D should include a copy of the original document directory; -C false
5488 prevents unwanted effects such as copying of administrative CVS data.
5493 * Considerably improved version of 'constdefs' command. Now performs
5494 automatic type-inference of declared constants; additional support for
5495 local structure declarations (cf. locales and HOL records), see also
5496 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5497 sequential dependencies of definitions within a single 'constdefs'
5498 section; moreover, the declared name needs to be an identifier. If
5499 all fails, consider to fall back on 'consts' and 'defs' separately.
5501 * Improved indexed syntax and implicit structures. First of all,
5502 indexed syntax provides a notational device for subscripted
5503 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5504 expressions. Secondly, in a local context with structure
5505 declarations, number indexes \<^sub>n or the empty index (default
5506 number 1) refer to a certain fixed variable implicitly; option
5507 show_structs controls printing of implicit structures. Typical
5508 applications of these concepts involve record types and locales.
5510 * New command 'no_syntax' removes grammar declarations (and
5511 translations) resulting from the given syntax specification, which is
5512 interpreted in the same manner as for the 'syntax' command.
5514 * 'Advanced' translation functions (parse_translation etc.) may depend
5515 on the signature of the theory context being presently used for
5516 parsing/printing, see also isar-ref manual.
5518 * Improved 'oracle' command provides a type-safe interface to turn an
5519 ML expression of type theory -> T -> term into a primitive rule of
5520 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5521 is already included here); see also FOL/ex/IffExample.thy;
5524 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5525 before); "cI" is no longer bound, use "c.intro" instead.
5526 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5527 axclasses vs. locales.
5529 * Improved internal renaming of symbolic identifiers -- attach primes
5530 instead of base 26 numbers.
5532 * New flag show_question_marks controls printing of leading question
5533 marks in schematic variable names.
5535 * In schematic variable names, *any* symbol following \<^isub> or
5536 \<^isup> is now treated as part of the base name. For example, the
5537 following works without printing of awkward ".0" indexes:
5539 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5542 * Inner syntax includes (*(*nested*) comments*).
5544 * Pretty printer now supports unbreakable blocks, specified in mixfix
5545 annotations as "(00...)".
5547 * Clear separation of logical types and nonterminals, where the latter
5548 may only occur in 'syntax' specifications or type abbreviations.
5549 Before that distinction was only partially implemented via type class
5550 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5551 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5552 exotic syntax specifications may require further adaption
5553 (e.g. Cube/Cube.thy).
5555 * Removed obsolete type class "logic", use the top sort {} instead.
5556 Note that non-logical types should be declared as 'nonterminals'
5557 rather than 'types'. INCOMPATIBILITY for new object-logic
5560 * Attributes 'induct' and 'cases': type or set names may now be
5561 locally fixed variables as well.
5563 * Simplifier: can now control the depth to which conditional rewriting
5564 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5567 * Simplifier: simplification procedures may now take the current
5568 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5569 interface), which is very useful for calling the Simplifier
5570 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5571 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5572 low-level mk_simproc no longer applies Logic.varify internally, to
5573 allow for use in a context of fixed variables.
5575 * thin_tac now works even if the assumption being deleted contains !!
5576 or ==>. More generally, erule now works even if the major premise of
5577 the elimination rule contains !! or ==>.
5579 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5581 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5582 from Pure, which contains all common declarations already. Both
5583 theories are defined via plain Isabelle/Isar .thy files.
5584 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5585 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5586 use isatool fixcpure to adapt your theory and ML sources.
5588 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5589 selections of theorems in named facts via index ranges.
5591 * 'print_theorems': in theory mode, really print the difference
5592 wrt. the last state (works for interactive theory development only),
5593 in proof mode print all local facts (cf. 'print_facts');
5595 * 'hide': option '(open)' hides only base names.
5597 * More efficient treatment of intermediate checkpoints in interactive
5600 * Code generator is now invoked via code_module (incremental code
5601 generation) and code_library (modular code generation, ML structures
5602 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5603 must be quoted when used as identifiers.
5605 * New 'value' command for reading, evaluating and printing terms using
5606 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5607 quoted when used as identifier.
5612 * New commands for the interpretation of locale expressions in
5613 theories (1), locales (2) and proof contexts (3). These generate
5614 proof obligations from the expression specification. After the
5615 obligations have been discharged, theorems of the expression are added
5616 to the theory, target locale or proof context. The synopsis of the
5617 commands is a follows:
5619 (1) interpretation expr inst
5620 (2) interpretation target < expr
5621 (3) interpret expr inst
5623 Interpretation in theories and proof contexts require a parameter
5624 instantiation of terms from the current context. This is applied to
5625 specifications and theorems of the interpreted expression.
5626 Interpretation in locales only permits parameter renaming through the
5627 locale expression. Interpretation is smart in that interpretations
5628 that are active already do not occur in proof obligations, neither are
5629 instantiated theorems stored in duplicate. Use 'print_interps' to
5630 inspect active interpretations of a particular locale. For details,
5631 see the Isar Reference manual. Examples can be found in
5632 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5634 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5635 'interpret' instead.
5637 * New context element 'constrains' for adding type constraints to
5640 * Context expressions: renaming of parameters with syntax
5643 * Locale declaration: 'includes' disallowed.
5645 * Proper static binding of attribute syntax -- i.e. types / terms /
5646 facts mentioned as arguments are always those of the locale definition
5647 context, independently of the context of later invocations. Moreover,
5648 locale operations (renaming and type / term instantiation) are applied
5649 to attribute arguments as expected.
5651 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5652 actual attributes; rare situations may require Attrib.attribute to
5653 embed those attributes into Attrib.src that lack concrete syntax.
5654 Attribute implementations need to cooperate properly with the static
5655 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5656 Attrib.XXX_thm etc. already do the right thing without further
5657 intervention. Only unusual applications -- such as "where" or "of"
5658 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5659 on the context and the facts involved -- may have to assign parsed
5660 values to argument tokens explicitly.
5662 * Changed parameter management in theorem generation for long goal
5663 statements with 'includes'. INCOMPATIBILITY: produces a different
5664 theorem statement in rare situations.
5666 * Locale inspection command 'print_locale' omits notes elements. Use
5667 'print_locale!' to have them included in the output.
5672 * Provers/hypsubst.ML: improved version of the subst method, for
5673 single-step rewriting: it now works in bound variable contexts. New is
5674 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5675 rewrite a different subterm than the original subst method, which is
5676 still available as 'simplesubst'.
5678 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5681 * Provers/trancl.ML: new transitivity reasoner for transitive and
5682 reflexive-transitive closure of relations.
5684 * Provers/blast.ML: new reference depth_limit to make blast's depth
5685 limit (previously hard-coded with a value of 20) user-definable.
5687 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5688 is peformed already. Object-logics merely need to finish their
5689 initial simpset configuration as before. INCOMPATIBILITY.
5694 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5697 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5699 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5700 and x-symbol; use option '-m epsilon' to get it actually printed.
5701 Moreover, the mathematically important symbolic identifier \<epsilon>
5702 becomes available as variable, constant etc. INCOMPATIBILITY,
5704 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5705 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5706 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5707 support corresponding Isar calculations.
5709 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5712 * theory SetInterval: changed the syntax for open intervals:
5721 The old syntax is still supported but will disappear in the next
5722 release. For conversion use the following Emacs search and replace
5723 patterns (these are not perfect but work quite well):
5725 {)\([^\.]*\)\.\. -> {\1<\.\.}
5726 \.\.\([^(}]*\)(} -> \.\.<\1}
5728 * Theory Commutative_Ring (in Library): method comm_ring for proving
5729 equalities in commutative rings; method 'algebra' provides a generic
5732 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5733 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5734 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5737 Some new syntax forms are available:
5739 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5740 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5741 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5742 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5744 The latter form "\<Sum>x < k. e" used to be based on a separate
5745 function "Summation", which has been discontinued.
5747 * theory Finite_Set: in structured induction proofs, the insert case
5748 is now 'case (insert x F)' instead of the old counterintuitive 'case
5751 * The 'refute' command has been extended to support a much larger
5752 fragment of HOL, including axiomatic type classes, constdefs and
5753 typedefs, inductive datatypes and recursion.
5755 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5756 Requires zChaff with proof generation to be installed. See
5757 HOL/ex/SAT_Examples.thy for examples.
5759 * Datatype induction via method 'induct' now preserves the name of the
5760 induction variable. For example, when proving P(xs::'a list) by
5761 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5762 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5763 in unstructured proof scripts.
5765 * Reworked implementation of records. Improved scalability for
5766 records with many fields, avoiding performance problems for type
5767 inference. Records are no longer composed of nested field types, but
5768 of nested extension types. Therefore the record type only grows linear
5769 in the number of extensions and not in the number of fields. The
5770 top-level (users) view on records is preserved. Potential
5771 INCOMPATIBILITY only in strange cases, where the theory depends on the
5772 old record representation. The type generated for a record is called
5773 <record_name>_ext_type.
5775 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5776 proofs triggered by a record definition or a simproc (if
5777 quick_and_dirty is enabled). Definitions of large records can take
5780 New simproc record_upd_simproc for simplification of multiple record
5781 updates enabled by default. Moreover, trivial updates are also
5782 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5783 occasionally, since simplification is more powerful by default.
5785 * typedef: proper support for polymorphic sets, which contain extra
5786 type-variables in the term.
5788 * Simplifier: automatically reasons about transitivity chains
5789 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5790 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5791 old proofs break occasionally as simplification may now solve more
5792 goals than previously.
5794 * Simplifier: converts x <= y into x = y if assumption y <= x is
5795 present. Works for all partial orders (class "order"), in particular
5796 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5799 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5800 bound variable or a constant then the let is unfolded. Otherwise
5801 first a is simplified to b, and then f b is simplified to g. If
5802 possible we abstract b from g arriving at "let x = b in h x",
5803 otherwise we unfold the let and arrive at g. The simproc can be
5804 enabled/disabled by the reference use_let_simproc. Potential
5805 INCOMPATIBILITY since simplification is more powerful by default.
5807 * Classical reasoning: the meson method now accepts theorems as arguments.
5809 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5810 jobs to provide advice on the provability of subgoals.
5812 * Theory OrderedGroup and Ring_and_Field: various additions and
5813 improvements to faciliate calculations involving equalities and
5816 The following theorems have been eliminated or modified
5819 abs_eq now named abs_of_nonneg
5820 abs_of_ge_0 now named abs_of_nonneg
5821 abs_minus_eq now named abs_of_nonpos
5822 imp_abs_id now named abs_of_nonneg
5823 imp_abs_neg_id now named abs_of_nonpos
5824 mult_pos now named mult_pos_pos
5825 mult_pos_le now named mult_nonneg_nonneg
5826 mult_pos_neg_le now named mult_nonneg_nonpos
5827 mult_pos_neg2_le now named mult_nonneg_nonpos2
5828 mult_neg now named mult_neg_neg
5829 mult_neg_le now named mult_nonpos_nonpos
5831 * The following lemmas in Ring_and_Field have been added to the simplifier:
5834 not_square_less_zero
5836 The following lemmas have been deleted from Real/RealPow:
5846 * Theory Parity: added rules for simplifying exponents.
5850 The following theorems have been eliminated or modified
5853 list_all_Nil now named list_all.simps(1)
5854 list_all_Cons now named list_all.simps(2)
5855 list_all_conv now named list_all_iff
5856 set_mem_eq now named mem_iff
5858 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5859 asymptotic "big O" calculations. See the notes in BigO.thy.
5864 * Theory RealDef: better support for embedding natural numbers and
5865 integers in the reals.
5867 The following theorems have been eliminated or modified
5870 exp_ge_add_one_self now requires no hypotheses
5871 real_of_int_add reversed direction of equality (use [symmetric])
5872 real_of_int_minus reversed direction of equality (use [symmetric])
5873 real_of_int_diff reversed direction of equality (use [symmetric])
5874 real_of_int_mult reversed direction of equality (use [symmetric])
5876 * Theory RComplete: expanded support for floor and ceiling functions.
5878 * Theory Ln is new, with properties of the natural logarithm
5880 * Hyperreal: There is a new type constructor "star" for making
5881 nonstandard types. The old type names are now type synonyms:
5885 hcomplex = complex star
5887 * Hyperreal: Many groups of similarly-defined constants have been
5888 replaced by polymorphic versions (INCOMPATIBILITY):
5890 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5892 starset <-- starsetNat, starsetC
5893 *s* <-- *sNat*, *sc*
5894 starset_n <-- starsetNat_n, starsetC_n
5895 *sn* <-- *sNatn*, *scn*
5896 InternalSets <-- InternalNatSets, InternalCSets
5898 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5899 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5900 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5901 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5902 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
5904 * Hyperreal: Many type-specific theorems have been removed in favor of
5905 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
5907 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
5908 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
5909 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
5910 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
5911 right_minus <-- hypreal_add_minus
5912 left_minus <-- {hypreal,hcomplex}_add_minus_left
5913 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
5914 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
5915 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
5916 mult_1_right <-- hcomplex_mult_one_right
5917 mult_zero_left <-- hcomplex_mult_zero_left
5918 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
5919 right_distrib <-- hypnat_add_mult_distrib2
5920 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
5921 right_inverse <-- hypreal_mult_inverse
5922 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
5923 order_refl <-- {hypreal,hypnat}_le_refl
5924 order_trans <-- {hypreal,hypnat}_le_trans
5925 order_antisym <-- {hypreal,hypnat}_le_anti_sym
5926 order_less_le <-- {hypreal,hypnat}_less_le
5927 linorder_linear <-- {hypreal,hypnat}_le_linear
5928 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5929 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5930 add_nonneg_nonneg <-- hypreal_le_add_order
5932 * Hyperreal: Separate theorems having to do with type-specific
5933 versions of constants have been merged into theorems that apply to the
5934 new polymorphic constants (INCOMPATIBILITY):
5936 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
5937 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
5938 STAR_Un <-- {STAR,NatStar,STARC}_Un
5939 STAR_Int <-- {STAR,NatStar,STARC}_Int
5940 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
5941 STAR_subset <-- {STAR,NatStar,STARC}_subset
5942 STAR_mem <-- {STAR,NatStar,STARC}_mem
5943 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
5944 STAR_diff <-- {STAR,STARC}_diff
5945 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
5946 STARC_hcomplex_of_complex}_image_subset
5947 starset_n_Un <-- starset{Nat,C}_n_Un
5948 starset_n_Int <-- starset{Nat,C}_n_Int
5949 starset_n_Compl <-- starset{Nat,C}_n_Compl
5950 starset_n_diff <-- starset{Nat,C}_n_diff
5951 InternalSets_Un <-- Internal{Nat,C}Sets_Un
5952 InternalSets_Int <-- Internal{Nat,C}Sets_Int
5953 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
5954 InternalSets_diff <-- Internal{Nat,C}Sets_diff
5955 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
5956 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
5957 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
5958 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
5959 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
5960 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5961 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
5962 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
5963 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
5964 starfun_diff <-- starfun{C,RC,CR}_diff
5965 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
5966 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
5967 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
5968 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
5969 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
5970 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
5971 starfun_Id <-- starfunC_Id
5972 starfun_approx <-- starfun{Nat,CR}_approx
5973 starfun_capprox <-- starfun{C,RC}_capprox
5974 starfun_abs <-- starfunNat_rabs
5975 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
5976 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
5977 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
5978 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
5979 starfun_add_capprox <-- starfun{C,RC}_add_capprox
5980 starfun_add_approx <-- starfunCR_add_approx
5981 starfun_inverse_inverse <-- starfunC_inverse_inverse
5982 starfun_divide <-- starfun{C,CR,RC}_divide
5983 starfun_n <-- starfun{Nat,C}_n
5984 starfun_n_mult <-- starfun{Nat,C}_n_mult
5985 starfun_n_add <-- starfun{Nat,C}_n_add
5986 starfun_n_add_minus <-- starfunNat_n_add_minus
5987 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
5988 starfun_n_minus <-- starfun{Nat,C}_n_minus
5989 starfun_n_eq <-- starfun{Nat,C}_n_eq
5991 star_n_add <-- {hypreal,hypnat,hcomplex}_add
5992 star_n_minus <-- {hypreal,hcomplex}_minus
5993 star_n_diff <-- {hypreal,hcomplex}_diff
5994 star_n_mult <-- {hypreal,hcomplex}_mult
5995 star_n_inverse <-- {hypreal,hcomplex}_inverse
5996 star_n_le <-- {hypreal,hypnat}_le
5997 star_n_less <-- {hypreal,hypnat}_less
5998 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
5999 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6000 star_n_abs <-- hypreal_hrabs
6001 star_n_divide <-- hcomplex_divide
6003 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6004 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6005 star_of_diff <-- hypreal_of_real_diff
6006 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6007 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6008 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6009 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6010 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6011 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6012 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6013 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6014 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6015 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6016 star_of_number_of <-- {hypreal,hcomplex}_number_of
6017 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6018 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6019 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6020 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6021 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6022 star_of_power <-- hypreal_of_real_power
6023 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6025 * Hyperreal: new method "transfer" that implements the transfer
6026 principle of nonstandard analysis. With a subgoal that mentions
6027 nonstandard types like "'a star", the command "apply transfer"
6028 replaces it with an equivalent one that mentions only standard types.
6029 To be successful, all free variables must have standard types; non-
6030 standard variables must have explicit universal quantifiers.
6032 * Hyperreal: A theory of Taylor series.
6037 * Discontinued special version of 'constdefs' (which used to support
6038 continuous functions) in favor of the general Pure one with full
6041 * New simplification procedure for solving continuity conditions; it
6042 is much faster on terms with many nested lambda abstractions (cubic
6043 instead of exponential time).
6045 * New syntax for domain package: selector names are now optional.
6046 Parentheses should be omitted unless argument is lazy, for example:
6048 domain 'a stream = cons "'a" (lazy "'a stream")
6050 * New command 'fixrec' for defining recursive functions with pattern
6051 matching; defining multiple functions with mutual recursion is also
6052 supported. Patterns may include the constants cpair, spair, up, sinl,
6053 sinr, or any data constructor defined by the domain package. The given
6054 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6055 syntax and examples.
6057 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6058 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6059 but the proof obligation additionally includes an admissibility
6060 requirement. The packages generate instances of class cpo or pcpo,
6061 with continuity and strictness theorems for Rep and Abs.
6063 * HOLCF: Many theorems have been renamed according to a more standard naming
6064 scheme (INCOMPATIBILITY):
6066 foo_inject: "foo$x = foo$y ==> x = y"
6067 foo_eq: "(foo$x = foo$y) = (x = y)"
6068 foo_less: "(foo$x << foo$y) = (x << y)"
6069 foo_strict: "foo$UU = UU"
6070 foo_defined: "... ==> foo$x ~= UU"
6071 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6076 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6077 including the First Isomorphism Theorem (on quotienting by the kernel
6080 * ZF/Simplifier: install second copy of type solver that actually
6081 makes use of TC rules declared to Isar proof contexts (or locales);
6082 the old version is still required for ML proof scripts.
6087 * Converted to Isar theory format; use locales instead of axiomatic
6093 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6096 * Pure/library.ML no longer defines its own option datatype, but uses
6097 that of the SML basis, which has constructors NONE and SOME instead of
6098 None and Some, as well as exception Option.Option instead of OPTION.
6099 The functions the, if_none, is_some, is_none have been adapted
6100 accordingly, while Option.map replaces apsome.
6102 * Pure/library.ML: the exception LIST has been given up in favour of
6103 the standard exceptions Empty and Subscript, as well as
6104 Library.UnequalLengths. Function like Library.hd and Library.tl are
6105 superceded by the standard hd and tl functions etc.
6107 A number of basic list functions are no longer exported to the ML
6108 toplevel, as they are variants of predefined functions. The following
6109 suggests how one can translate existing code:
6111 rev_append xs ys = List.revAppend (xs, ys)
6112 nth_elem (i, xs) = List.nth (xs, i)
6113 last_elem xs = List.last xs
6114 flat xss = List.concat xss
6115 seq fs = List.app fs
6116 partition P xs = List.partition P xs
6117 mapfilter f xs = List.mapPartial f xs
6119 * Pure/library.ML: several combinators for linear functional
6120 transformations, notably reverse application and composition:
6123 (x, y) |-> f f #-> g
6125 * Pure/library.ML: introduced/changed precedence of infix operators:
6127 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6129 infix 3 o oo ooo oooo;
6130 infix 4 ~~ upto downto;
6132 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6135 * Pure/library.ML: natural list combinators fold, fold_rev, and
6136 fold_map support linear functional transformations and nesting. For
6139 fold f [x1, ..., xN] y =
6140 y |> f x1 |> ... |> f xN
6142 (fold o fold) f [xs1, ..., xsN] y =
6143 y |> fold f xs1 |> ... |> fold f xsN
6145 fold f [x1, ..., xN] =
6148 (fold o fold) f [xs1, ..., xsN] =
6149 fold f xs1 #> ... #> fold f xsN
6151 * Pure/library.ML: the following selectors on type 'a option are
6154 the: 'a option -> 'a (*partial*)
6155 these: 'a option -> 'a where 'a = 'b list
6156 the_default: 'a -> 'a option -> 'a
6157 the_list: 'a option -> 'a list
6159 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6160 basic operations for association lists, following natural argument
6161 order; moreover the explicit equality predicate passed here avoids
6162 potentially expensive polymorphic runtime equality checks.
6163 The old functions may be expressed as follows:
6165 assoc = uncurry (AList.lookup (op =))
6166 assocs = these oo AList.lookup (op =)
6167 overwrite = uncurry (AList.update (op =)) o swap
6169 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6171 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6172 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6174 replacing make_keylist and keyfilter (occassionally used)
6177 make_keylist = AList.make
6178 keyfilter = AList.find (op =)
6180 * eq_fst and eq_snd now take explicit equality parameter, thus
6181 avoiding eqtypes. Naive rewrites:
6183 eq_fst = eq_fst (op =)
6184 eq_snd = eq_snd (op =)
6186 * Removed deprecated apl and apr (rarely used).
6189 apl (n, op) =>>= curry op n
6190 apr (op, m) =>>= fn n => op (n, m)
6192 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6193 provides a reasonably efficient light-weight implementation of sets as
6196 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6197 few new operations; existing lookup and update are now curried to
6198 follow natural argument order (for use with fold etc.);
6199 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6201 * Pure/General: output via the Isabelle channels of
6202 writeln/warning/error etc. is now passed through Output.output, with a
6203 hook for arbitrary transformations depending on the print_mode
6204 (cf. Output.add_mode -- the first active mode that provides a output
6205 function wins). Already formatted output may be embedded into further
6206 text via Output.raw; the result of Pretty.string_of/str_of and derived
6207 functions (string_of_term/cterm/thm etc.) is already marked raw to
6208 accommodate easy composition of diagnostic messages etc. Programmers
6209 rarely need to care about Output.output or Output.raw at all, with
6210 some notable exceptions: Output.output is required when bypassing the
6211 standard channels (writeln etc.), or in token translations to produce
6212 properly formatted results; Output.raw is required when capturing
6213 already output material that will eventually be presented to the user
6214 a second time. For the default print mode, both Output.output and
6215 Output.raw have no effect.
6217 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6218 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6219 cumulative results are displayed at the end of a batch session.
6221 * Pure/General: File.sysify_path and File.quote_sysify path have been
6222 replaced by File.platform_path and File.shell_path (with appropriate
6223 hooks). This provides a clean interface for unusual systems where the
6224 internal and external process view of file names are different.
6226 * Pure: more efficient orders for basic syntactic entities: added
6227 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6228 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6229 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6230 orders now -- potential INCOMPATIBILITY for code that depends on a
6231 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6232 Library.sort_strings on result).
6234 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6235 fold_types traverse types/terms from left to right, observing natural
6236 argument order. Supercedes previous foldl_XXX versions, add_frees,
6237 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6239 * Pure: name spaces have been refined, with significant changes of the
6240 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6241 to extern(_table). The plain name entry path is superceded by a
6242 general 'naming' context, which also includes the 'policy' to produce
6243 a fully qualified name and external accesses of a fully qualified
6244 name; NameSpace.extend is superceded by context dependent
6245 Sign.declare_name. Several theory and proof context operations modify
6246 the naming context. Especially note Theory.restore_naming and
6247 ProofContext.restore_naming to get back to a sane state; note that
6248 Theory.add_path is no longer sufficient to recover from
6249 Theory.absolute_path in particular.
6251 * Pure: new flags short_names (default false) and unique_names
6252 (default true) for controlling output of qualified names. If
6253 short_names is set, names are printed unqualified. If unique_names is
6254 reset, the name prefix is reduced to the minimum required to achieve
6255 the original result when interning again, even if there is an overlap
6256 with earlier declarations.
6258 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6259 now 'extend', and 'merge' gets an additional Pretty.pp argument
6260 (useful for printing error messages). INCOMPATIBILITY.
6262 * Pure: major reorganization of the theory context. Type Sign.sg and
6263 Theory.theory are now identified, referring to the universal
6264 Context.theory (see Pure/context.ML). Actual signature and theory
6265 content is managed as theory data. The old code and interfaces were
6266 spread over many files and structures; the new arrangement introduces
6267 considerable INCOMPATIBILITY to gain more clarity:
6269 Context -- theory management operations (name, identity, inclusion,
6270 parents, ancestors, merge, etc.), plus generic theory data;
6272 Sign -- logical signature and syntax operations (declaring consts,
6273 types, etc.), plus certify/read for common entities;
6275 Theory -- logical theory operations (stating axioms, definitions,
6276 oracles), plus a copy of logical signature operations (consts,
6277 types, etc.); also a few basic management operations (Theory.copy,
6280 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6281 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6282 for convenience -- they merely return the theory.
6284 * Pure: type Type.tsig is superceded by theory in most interfaces.
6286 * Pure: the Isar proof context type is already defined early in Pure
6287 as Context.proof (note that ProofContext.context and Proof.context are
6288 aliases, where the latter is the preferred name). This enables other
6289 Isabelle components to refer to that type even before Isar is present.
6291 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6292 typeK, constK, axiomK, oracleK), but provide explicit operations for
6293 any of these kinds. For example, Sign.intern typeK is now
6294 Sign.intern_type, Theory.hide_space Sign.typeK is now
6295 Theory.hide_types. Also note that former
6296 Theory.hide_classes/types/consts are now
6297 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6298 internalize their arguments! INCOMPATIBILITY.
6300 * Pure: get_thm interface (of PureThy and ProofContext) expects
6301 datatype thmref (with constructors Name and NameSelection) instead of
6302 plain string -- INCOMPATIBILITY;
6304 * Pure: cases produced by proof methods specify options, where NONE
6305 means to remove case bindings -- INCOMPATIBILITY in
6308 * Pure: the following operations retrieve axioms or theorems from a
6309 theory node or theory hierarchy, respectively:
6311 Theory.axioms_of: theory -> (string * term) list
6312 Theory.all_axioms_of: theory -> (string * term) list
6313 PureThy.thms_of: theory -> (string * thm) list
6314 PureThy.all_thms_of: theory -> (string * thm) list
6316 * Pure: print_tac now outputs the goal through the trace channel.
6318 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6319 Reference Toplevel.debug (default false) controls detailed printing
6320 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6321 controls execution profiling -- set to 1 for time and 2 for space
6322 (both increase the runtime).
6324 * Isar session: The initial use of ROOT.ML is now always timed,
6325 i.e. the log will show the actual process times, in contrast to the
6326 elapsed wall-clock time that the outer shell wrapper produces.
6328 * Simplifier: improved handling of bound variables (nameless
6329 representation, avoid allocating new strings). Simprocs that invoke
6330 the Simplifier recursively should use Simplifier.inherit_bounds to
6331 avoid local name clashes. Failure to do so produces warnings
6332 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6333 for further details.
6335 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6336 bindings for all theorems stored within a given theory; this may help
6337 in porting non-Isar theories to Isar ones, while keeping ML proof
6338 scripts for the time being.
6340 * ML operator HTML.with_charset specifies the charset begin used for
6341 generated HTML files. For example:
6343 HTML.with_charset "utf-8" use_thy "Hebrew";
6344 HTML.with_charset "utf-8" use_thy "Chinese";
6349 * Allow symlinks to all proper Isabelle executables (Isabelle,
6350 isabelle, isatool etc.).
6352 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6353 isatool doc, isatool mkdir, display_drafts etc.).
6355 * isatool usedir: option -f allows specification of the ML file to be
6356 used by Isabelle; default is ROOT.ML.
6358 * New isatool version outputs the version identifier of the Isabelle
6359 distribution being used.
6361 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6362 (containing Boolean satisfiability problems) into Isabelle/HOL
6367 New in Isabelle2004 (April 2004)
6368 --------------------------------
6372 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6373 Replaces linorder.ML.
6375 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6376 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6377 (\<a>...\<z>), are now considered normal letters, and can therefore
6378 be used anywhere where an ASCII letter (a...zA...Z) has until
6379 now. COMPATIBILITY: This obviously changes the parsing of some
6380 terms, especially where a symbol has been used as a binder, say
6381 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6382 as an identifier. Fix it by inserting a space around former
6383 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6384 existing theory and ML files.
6386 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6388 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6389 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6390 a normal (but invisible) letter. For multiple letter subscripts repeat
6391 \<^isub> like this: x\<^isub>1\<^isub>2.
6393 * Pure: There are now sub-/superscripts that can span more than one
6394 character. Text between \<^bsub> and \<^esub> is set in subscript in
6395 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6396 superscript. The new control characters are not identifier parts.
6398 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6399 content of "..." to the latex file instead of \isacntrl... . The "..."
6400 may consist of any printable characters excluding the end bracket >.
6402 * Pure: Using new Isar command "finalconsts" (or the ML functions
6403 Theory.add_finals or Theory.add_finals_i) it is now possible to
6404 declare constants "final", which prevents their being given a definition
6405 later. It is useful for constants whose behaviour is fixed axiomatically
6406 rather than definitionally, such as the meta-logic connectives.
6408 * Pure: 'instance' now handles general arities with general sorts
6409 (i.e. intersections of classes),
6411 * Presentation: generated HTML now uses a CSS style sheet to make layout
6412 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6413 It can be changed to alter the colors/layout of generated pages.
6418 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6419 cut_tac, subgoal_tac and thin_tac:
6420 - Now understand static (Isar) contexts. As a consequence, users of Isar
6421 locales are no longer forced to write Isar proof scripts.
6422 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6424 - INCOMPATIBILITY: names of variables to be instantiated may no
6425 longer be enclosed in quotes. Instead, precede variable name with `?'.
6426 This is consistent with the instantiation attribute "where".
6428 * Attributes "where" and "of":
6429 - Now take type variables of instantiated theorem into account when reading
6430 the instantiation string. This fixes a bug that caused instantiated
6431 theorems to have too special types in some circumstances.
6432 - "where" permits explicit instantiations of type variables.
6434 * Calculation commands "moreover" and "also" no longer interfere with
6435 current facts ("this"), admitting arbitrary combinations with "then"
6439 - Goal statements involving the context element "includes" no longer
6440 generate theorems with internal delta predicates (those ending on
6441 "_axioms") in the premise.
6442 Resolve particular premise with <locale>.intro to obtain old form.
6443 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6444 specification and "includes" elements in goal statement.
6445 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6446 [intro?] and [elim?] (respectively) by default.
6447 - Experimental command for instantiation of locales in proof contexts:
6448 instantiate <label>[<attrs>]: <loc>
6449 Instantiates locale <loc> and adds all its theorems to the current context
6450 taking into account their attributes. Label and attrs are optional
6451 modifiers, like in theorem declarations. If present, names of
6452 instantiated theorems are qualified with <label>, and the attributes
6453 <attrs> are applied after any attributes these theorems might have already.
6454 If the locale has assumptions, a chained fact of the form
6455 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6456 are derived. The command does not support old-style locales declared
6457 with "locale (open)".
6458 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6460 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6466 * Proof import: new image HOL4 contains the imported library from
6467 the HOL4 system with about 2500 theorems. It is imported by
6468 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6469 can be used like any other Isabelle image. See
6470 HOL/Import/HOL/README for more information.
6473 - Much improved handling of linear and partial orders.
6474 Reasoners for linear and partial orders are set up for type classes
6475 "linorder" and "order" respectively, and are added to the default simpset
6476 as solvers. This means that the simplifier can build transitivity chains
6477 to solve goals from the assumptions.
6478 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6479 of blast or auto after simplification become unnecessary because the goal
6480 is solved by simplification already.
6482 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6483 all proved in axiomatic type classes for semirings, rings and fields.
6486 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6487 now formalized using the Ring_and_Field theory mentioned above.
6488 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6489 than before, because now they are set up once in a generic manner.
6490 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6491 Look for the general versions in Ring_and_Field (and Power if they concern
6494 * Type "rat" of the rational numbers is now available in HOL-Complex.
6497 - Record types are now by default printed with their type abbreviation
6498 instead of the list of all field types. This can be configured via
6499 the reference "print_record_type_abbr".
6500 - Simproc "record_upd_simproc" for simplification of multiple updates added
6501 (not enabled by default).
6502 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6503 EX x. x = sel r to True (not enabled by default).
6504 - Tactic "record_split_simp_tac" to split and simplify records added.
6506 * 'specification' command added, allowing for definition by
6507 specification. There is also an 'ax_specification' command that
6508 introduces the new constants axiomatically.
6510 * arith(_tac) is now able to generate counterexamples for reals as well.
6512 * HOL-Algebra: new locale "ring" for non-commutative rings.
6514 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6515 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6517 * HOL-Matrix: a first theory for matrices in HOL with an application of
6518 matrix theory to linear programming.
6520 * Unions and Intersections:
6521 The latex output syntax of UN and INT has been changed
6522 from "\Union x \in A. B" to "\Union_{x \in A} B"
6523 i.e. the index formulae has become a subscript.
6524 Similarly for "\Union x. B", and for \Inter instead of \Union.
6526 * Unions and Intersections over Intervals:
6527 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6528 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6529 like in normal math, and corresponding versions for < and for intersection.
6531 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6532 lexicographic dictonary ordering has been added as "lexord".
6534 * ML: the legacy theory structures Int and List have been removed. They had
6535 conflicted with ML Basis Library structures having the same names.
6537 * 'refute' command added to search for (finite) countermodels. Only works
6538 for a fragment of HOL. The installation of an external SAT solver is
6539 highly recommended. See "HOL/Refute.thy" for details.
6541 * 'quickcheck' command: Allows to find counterexamples by evaluating
6542 formulae under an assignment of free variables to random values.
6543 In contrast to 'refute', it can deal with inductive datatypes,
6544 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6550 * Streams now come with concatenation and are part of the HOLCF image
6554 New in Isabelle2003 (May 2003)
6555 ------------------------------
6559 * Provers/simplifier:
6561 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6562 Assumptions are now subject to complete mutual simplification,
6563 not just from left to right. The simplifier now preserves
6564 the order of assumptions.
6566 Potential INCOMPATIBILITY:
6568 -- simp sometimes diverges where the old version did
6569 not, e.g. invoking simp on the goal
6571 [| P (f x); y = x; f x = f y |] ==> Q
6573 now gives rise to the infinite reduction sequence
6575 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6577 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6580 -- Tactics combining classical reasoner and simplification (such as auto)
6581 are also affected by this change, because many of them rely on
6582 simp. They may sometimes diverge as well or yield a different numbers
6583 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6584 in case of problems. Sometimes subsequent calls to the classical
6585 reasoner will fail because a preceeding call to the simplifier too
6586 eagerly simplified the goal, e.g. deleted redundant premises.
6588 - The simplifier trace now shows the names of the applied rewrite rules
6590 - You can limit the number of recursive invocations of the simplifier
6591 during conditional rewriting (where the simplifie tries to solve the
6592 conditions before applying the rewrite rule):
6593 ML "simp_depth_limit := n"
6594 where n is an integer. Thus you can force termination where previously
6595 the simplifier would diverge.
6597 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6599 - No longer aborts on failed congruence proof. Instead, the
6600 congruence is ignored.
6602 * Pure: New generic framework for extracting programs from constructive
6603 proofs. See HOL/Extraction.thy for an example instantiation, as well
6604 as HOL/Extraction for some case studies.
6606 * Pure: The main goal of the proof state is no longer shown by default, only
6607 the subgoals. This behaviour is controlled by a new flag.
6608 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6609 (ML: Proof.show_main_goal).
6611 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6612 rules whose conclusion matches subgoal 1:
6613 PG menu: Isabelle/Isar -> Show me -> matching rules
6614 The rules are ordered by how closely they match the subgoal.
6615 In particular, rules that solve a subgoal outright are displayed first
6616 (or rather last, the way they are printed).
6617 (ML: ProofGeneral.print_intros())
6619 * Pure: New flag trace_unify_fail causes unification to print
6620 diagnostic information (PG: in trace buffer) when it fails. This is
6621 useful for figuring out why single step proofs like rule, erule or
6624 * Pure: Locale specifications now produce predicate definitions
6625 according to the body of text (covering assumptions modulo local
6626 definitions); predicate "loc_axioms" covers newly introduced text,
6627 while "loc" is cumulative wrt. all included locale expressions; the
6628 latter view is presented only on export into the global theory
6629 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6630 on the old view without predicates;
6632 * Pure: predefined locales "var" and "struct" are useful for sharing
6633 parameters (as in CASL, for example); just specify something like
6634 ``var x + var y + struct M'' as import;
6636 * Pure: improved thms_containing: proper indexing of facts instead of
6637 raw theorems; check validity of results wrt. current name space;
6638 include local facts of proof configuration (also covers active
6639 locales), cover fixed variables in index; may use "_" in term
6640 specification; an optional limit for the number of printed facts may
6641 be given (the default is 40);
6643 * Pure: disallow duplicate fact bindings within new-style theory files
6646 * Provers: improved induct method: assumptions introduced by case
6647 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6648 the goal statement); "foo" still refers to all facts collectively;
6650 * Provers: the function blast.overloaded has been removed: all constants
6651 are regarded as potentially overloaded, which improves robustness in exchange
6652 for slight decrease in efficiency;
6654 * Provers/linorder: New generic prover for transitivity reasoning over
6655 linear orders. Note: this prover is not efficient!
6657 * Isar: preview of problems to finish 'show' now produce an error
6658 rather than just a warning (in interactive mode);
6665 - Produces a counter example if it cannot prove a goal.
6666 Note that the counter example may be spurious if the goal is not a formula
6667 of quantifier-free linear arithmetic.
6668 In ProofGeneral the counter example appears in the trace buffer.
6670 - Knows about div k and mod k where k is a numeral of type nat or int.
6672 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6673 linear arithmetic fails. This takes account of quantifiers and divisibility.
6674 Presburger arithmetic can also be called explicitly via presburger(_tac).
6676 * simp's arithmetic capabilities have been enhanced a bit: it now
6677 takes ~= in premises into account (by performing a case split);
6679 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6680 are distributed over a sum of terms;
6682 * New tactic "trans_tac" and method "trans" instantiate
6683 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6686 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6687 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6689 * 'typedef' command has new option "open" to suppress the set
6692 * functions Min and Max on finite sets have been introduced (theory
6695 * attribute [symmetric] now works for relations as well; it turns
6696 (x,y) : R^-1 into (y,x) : R, and vice versa;
6698 * induct over a !!-quantified statement (say !!x1..xn):
6699 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6701 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6702 %x. None. Warning: empty_def now refers to the previously hidden definition
6705 * Algebra: formalization of classical algebra. Intended as base for
6706 any algebraic development in Isabelle. Currently covers group theory
6707 (up to Sylow's theorem) and ring theory (Universal Property of
6708 Univariate Polynomials). Contributions welcome;
6710 * GroupTheory: deleted, since its material has been moved to Algebra;
6712 * Complex: new directory of the complex numbers with numeric constants,
6713 nonstandard complex numbers, and some complex analysis, standard and
6714 nonstandard (Jacques Fleuriot);
6716 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6718 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6721 * Real/HahnBanach: updated and adapted to locales;
6723 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6726 * UNITY: added the Meier-Sanders theory of progress sets;
6728 * MicroJava: bytecode verifier and lightweight bytecode verifier
6729 as abstract algorithms, instantiated to the JVM;
6731 * Bali: Java source language formalization. Type system, operational
6732 semantics, axiomatic semantics. Supported language features:
6733 classes, interfaces, objects,virtual methods, static methods,
6734 static/instance fields, arrays, access modifiers, definite
6735 assignment, exceptions.
6740 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6743 * Main ZF: virtually all theories converted to new-style format;
6748 * Pure: Tactic.prove provides sane interface for internal proofs;
6749 omits the infamous "standard" operation, so this is more appropriate
6750 than prove_goalw_cterm in many situations (e.g. in simprocs);
6752 * Pure: improved error reporting of simprocs;
6754 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6758 *** Document preparation ***
6760 * uses \par instead of \\ for line breaks in theory text. This may
6761 shift some page breaks in large documents. To get the old behaviour
6762 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6764 * minimized dependencies of isabelle.sty and isabellesym.sty on
6767 * \<euro> now needs package babel/greek instead of marvosym (which
6770 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6775 New in Isabelle2002 (March 2002)
6776 --------------------------------
6778 *** Document preparation ***
6780 * greatly simplified document preparation setup, including more
6781 graceful interpretation of isatool usedir -i/-d/-D options, and more
6782 instructive isatool mkdir; users should basically be able to get
6783 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6784 users may run a separate document processing stage manually like this:
6785 "isatool usedir -D output HOL Test && isatool document Test/output";
6787 * theory dependency graph may now be incorporated into documents;
6788 isatool usedir -g true will produce session_graph.eps/.pdf for use
6789 with \includegraphics of LaTeX;
6791 * proper spacing of consecutive markup elements, especially text
6792 blocks after section headings;
6794 * support bold style (for single symbols only), input syntax is like
6795 this: "\<^bold>\<alpha>" or "\<^bold>A";
6797 * \<bullet> is now output as bold \cdot by default, which looks much
6798 better in printed text;
6800 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6801 note that these symbols are currently unavailable in Proof General /
6802 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6804 * isatool latex no longer depends on changed TEXINPUTS, instead
6805 isatool document copies the Isabelle style files to the target
6811 * Pure/Provers: improved proof by cases and induction;
6812 - 'case' command admits impromptu naming of parameters (such as
6814 - 'induct' method divinates rule instantiation from the inductive
6815 claim; no longer requires excessive ?P bindings for proper
6816 instantiation of cases;
6817 - 'induct' method properly enumerates all possibilities of set/type
6818 rules; as a consequence facts may be also passed through *type*
6819 rules without further ado;
6820 - 'induct' method now derives symbolic cases from the *rulified*
6821 rule (before it used to rulify cases stemming from the internal
6822 atomized version); this means that the context of a non-atomic
6823 statement becomes is included in the hypothesis, avoiding the
6824 slightly cumbersome show "PROP ?case" form;
6825 - 'induct' may now use elim-style induction rules without chaining
6826 facts, using ``missing'' premises from the goal state; this allows
6827 rules stemming from inductive sets to be applied in unstructured
6828 scripts, while still benefitting from proper handling of non-atomic
6829 statements; NB: major inductive premises need to be put first, all
6830 the rest of the goal is passed through the induction;
6831 - 'induct' proper support for mutual induction involving non-atomic
6832 rule statements (uses the new concept of simultaneous goals, see
6834 - append all possible rule selections, but only use the first
6835 success (no backtracking);
6836 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6837 - undeclared rule case names default to numbers 1, 2, 3, ...;
6838 - added 'print_induct_rules' (covered by help item in recent Proof
6840 - moved induct/cases attributes to Pure, methods to Provers;
6841 - generic method setup instantiated for FOL and HOL;
6843 * Pure: support multiple simultaneous goal statements, for example
6844 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6845 meta-level mechanism, this acts as if several individual goals had
6846 been stated separately; in particular common proof methods need to be
6847 repeated in order to cover all claims; note that a single elimination
6848 step is *not* sufficient to establish the two conjunctions, so this
6851 assume "A & B" then have A and B .. (*".." fails*)
6853 better use "obtain" in situations as above; alternative refer to
6854 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6856 * Pure: proper integration with ``locales''; unlike the original
6857 version by Florian Kammller, Isar locales package high-level proof
6858 contexts rather than raw logical ones (e.g. we admit to include
6859 attributes everywhere); operations on locales include merge and
6860 rename; support for implicit arguments (``structures''); simultaneous
6861 type-inference over imports and text; see also HOL/ex/Locales.thy for
6864 * Pure: the following commands have been ``localized'', supporting a
6865 target locale specification "(in name)": 'lemma', 'theorem',
6866 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6867 stored both within the locale and at the theory level (exported and
6868 qualified by the locale name);
6870 * Pure: theory goals may now be specified in ``long'' form, with
6871 ad-hoc contexts consisting of arbitrary locale elements. for example
6872 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6873 definitions may be given, too); the result is a meta-level rule with
6874 the context elements being discharged in the obvious way;
6876 * Pure: new proof command 'using' allows to augment currently used
6877 facts after a goal statement ('using' is syntactically analogous to
6878 'apply', but acts on the goal's facts only); this allows chained facts
6879 to be separated into parts given before and after a claim, as in
6880 ``from a and b have C using d and e <proof>'';
6882 * Pure: renamed "antecedent" case to "rule_context";
6884 * Pure: new 'judgment' command records explicit information about the
6885 object-logic embedding (used by several tools internally); no longer
6886 use hard-wired "Trueprop";
6888 * Pure: added 'corollary' command;
6890 * Pure: fixed 'token_translation' command;
6892 * Pure: removed obsolete 'exported' attribute;
6894 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6895 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6896 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6898 * Pure: method 'atomize' presents local goal premises as object-level
6899 statements (atomic meta-level propositions); setup controlled via
6900 rewrite rules declarations of 'atomize' attribute; example
6901 application: 'induct' method with proper rule statements in improper
6904 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
6905 now consider the syntactic context of assumptions, giving a better
6906 chance to get type-inference of the arguments right (this is
6907 especially important for locales);
6909 * Pure: "sorry" no longer requires quick_and_dirty in interactive
6912 * Pure/obtain: the formal conclusion "thesis", being marked as
6913 ``internal'', may no longer be reference directly in the text;
6914 potential INCOMPATIBILITY, may need to use "?thesis" in rare
6917 * Pure: generic 'sym' attribute which declares a rule both as pure
6918 'elim?' and for the 'symmetric' operation;
6920 * Pure: marginal comments ``--'' may now occur just anywhere in the
6921 text; the fixed correlation with particular command syntax has been
6924 * Pure: new method 'rules' is particularly well-suited for proof
6925 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
6926 but often produces more compact proof terms with less detours;
6928 * Pure/Provers/classical: simplified integration with pure rule
6929 attributes and methods; the classical "intro?/elim?/dest?"
6930 declarations coincide with the pure ones; the "rule" method no longer
6931 includes classically swapped intros; "intro" and "elim" methods no
6932 longer pick rules from the context; also got rid of ML declarations
6933 AddXIs/AddXEs/AddXDs; all of this has some potential for
6936 * Provers/classical: attribute 'swapped' produces classical inversions
6937 of introduction rules;
6939 * Provers/simplifier: 'simplified' attribute may refer to explicit
6940 rules instead of full simplifier context; 'iff' attribute handles
6943 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
6945 * HOL: 'recdef' now fails on unfinished automated proofs, use
6946 "(permissive)" option to recover old behavior;
6948 * HOL: 'inductive' no longer features separate (collective) attributes
6949 for 'intros' (was found too confusing);
6951 * HOL: properly declared induction rules less_induct and
6957 * HOL: moved over to sane numeral syntax; the new policy is as
6960 - 0 and 1 are polymorphic constants, which are defined on any
6961 numeric type (nat, int, real etc.);
6963 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
6964 binary representation internally;
6966 - type nat has special constructor Suc, and generally prefers Suc 0
6967 over 1::nat and Suc (Suc 0) over 2::nat;
6969 This change may cause significant problems of INCOMPATIBILITY; here
6970 are some hints on converting existing sources:
6972 - due to the new "num" token, "-0" and "-1" etc. are now atomic
6973 entities, so expressions involving "-" (unary or binary minus) need
6974 to be spaced properly;
6976 - existing occurrences of "1" may need to be constraint "1::nat" or
6977 even replaced by Suc 0; similar for old "2";
6979 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
6981 - remove all special provisions on numerals in proofs;
6983 * HOL: simp rules nat_number expand numerals on nat to Suc/0
6984 representation (depends on bin_arith_simps in the default context);
6986 * HOL: symbolic syntax for x^2 (numeral 2);
6988 * HOL: the class of all HOL types is now called "type" rather than
6989 "term"; INCOMPATIBILITY, need to adapt references to this type class
6990 in axclass/classes, instance/arities, and (usually rare) occurrences
6991 in typings (of consts etc.); internally the class is called
6992 "HOL.type", ML programs should refer to HOLogic.typeS;
6994 * HOL/record package improvements:
6995 - new derived operations "fields" to build a partial record section,
6996 "extend" to promote a fixed record to a record scheme, and
6997 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
6998 declared as simp by default;
6999 - shared operations ("more", "fields", etc.) now need to be always
7000 qualified) --- potential INCOMPATIBILITY;
7001 - removed "make_scheme" operations (use "make" with "extend") --
7003 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7004 - provides cases/induct rules for use with corresponding Isar
7005 methods (for concrete records, record schemes, concrete more
7006 parts, and schematic more parts -- in that order);
7007 - internal definitions directly based on a light-weight abstract
7008 theory of product types over typedef rather than datatype;
7010 * HOL: generic code generator for generating executable ML code from
7011 specifications; specific support for HOL constructs such as inductive
7012 datatypes and sets, as well as recursive functions; can be invoked
7013 via 'generate_code' theory section;
7015 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7017 * HOL: consolidated and renamed several theories. In particular:
7018 Ord.thy has been absorbed into HOL.thy
7019 String.thy has been absorbed into List.thy
7021 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7022 (beware of argument permutation!);
7024 * HOL: linorder_less_split superseded by linorder_cases;
7026 * HOL/List: "nodups" renamed to "distinct";
7028 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7029 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7030 - Ex_def has changed, now need to use some_eq_ex
7032 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7033 in this (rare) case use:
7035 delSWrapper "split_all_tac"
7036 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7038 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7041 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7042 Isabelle's type classes, ^ on functions and relations has too general
7043 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7044 necessary to attach explicit type constraints;
7046 * HOL/Relation: the prefix name of the infix "O" has been changed from
7047 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7048 renamed accordingly (eg "compI" -> "rel_compI").
7050 * HOL: syntax translations now work properly with numerals and records
7053 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7054 of "lam" -- INCOMPATIBILITY;
7056 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7057 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7058 renamed "Product_Type.unit";
7060 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7062 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7063 the "cases" method);
7065 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7068 * HOL/IMP: updated and converted to new-style theory format; several
7069 parts turned into readable document, with proper Isar proof texts and
7070 some explanations (by Gerwin Klein);
7072 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7074 * HOL-Hyperreal is now a logic image;
7079 * Isar: consts/constdefs supports mixfix syntax for continuous
7082 * Isar: domain package adapted to new-style theory format, e.g. see
7085 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7086 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7087 lift.induct_tac, always use UU instead of Undef;
7089 * HOLCF/IMP: updated and converted to new-style theory;
7094 * Isar: proper integration of logic-specific tools and packages,
7095 including theory commands '(co)inductive', '(co)datatype',
7096 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7097 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7099 * theory Main no longer includes AC; for the Axiom of Choice, base
7100 your theory on Main_ZFC;
7102 * the integer library now covers quotients and remainders, with many
7103 laws relating division to addition, multiplication, etc.;
7105 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7106 typeless version of the formalism;
7108 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7111 * ZF/Induct: new directory for examples of inductive definitions,
7112 including theory Multiset for multiset orderings; converted to
7113 new-style theory format;
7115 * ZF: many new theorems about lists, ordinals, etc.;
7120 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7121 variable proof controls level of detail: 0 = no proofs (only oracle
7122 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7123 also ref manual for further ML interfaces;
7125 * Pure/axclass: removed obsolete ML interface
7126 goal_subclass/goal_arity;
7128 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7129 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7130 separate tokens, so expressions involving minus need to be spaced
7133 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7134 rather than "infixl" or "infixr";
7136 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7137 sort constraint specifications in type inference; e.g. "x::_::foo"
7138 ensures that the type of "x" is of sort "foo" (but not necessarily a
7141 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7142 control output of nested => (types); the default behavior is
7145 * Pure/syntax: builtin parse translation for "_constify" turns valued
7146 tokens into AST constants;
7148 * Pure/syntax: prefer later declarations of translations and print
7149 translation functions; potential INCOMPATIBILITY: need to reverse
7150 multiple declarations for same syntax element constant;
7152 * Pure/show_hyps reset by default (in accordance to existing Isar
7155 * Provers/classical: renamed addaltern to addafter, addSaltern to
7158 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7161 * system: tested support for MacOS X; should be able to get Isabelle +
7162 Proof General to work in a plain Terminal after installing Poly/ML
7163 (e.g. from the Isabelle distribution area) and GNU bash alone
7164 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7165 support requires further installations, e.g. from
7166 http://fink.sourceforge.net/);
7168 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7170 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7171 of 40 MB), cf. ML_OPTIONS;
7173 * system: Proof General keywords specification is now part of the
7174 Isabelle distribution (see etc/isar-keywords.el);
7176 * system: support for persistent Proof General sessions (refrain from
7177 outdating all loaded theories on startup); user may create writable
7178 logic images like this: ``isabelle -q HOL Test'';
7180 * system: smart selection of Isabelle process versus Isabelle
7181 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7182 run both "isabelle" and "Isabelle" even if file names are badly
7183 damaged (executable inspects the case of the first letter of its own
7184 name); added separate "isabelle-process" and "isabelle-interface";
7186 * system: refrain from any attempt at filtering input streams; no
7187 longer support ``8bit'' encoding of old isabelle font, instead proper
7188 iso-latin characters may now be used; the related isatools
7189 "symbolinput" and "nonascii" have disappeared as well;
7191 * system: removed old "xterm" interface (the print modes "xterm" and
7192 "xterm_color" are still available for direct use in a suitable
7197 New in Isabelle99-2 (February 2001)
7198 -----------------------------------
7200 *** Overview of INCOMPATIBILITIES ***
7202 * HOL: please note that theories in the Library and elsewhere often use the
7203 new-style (Isar) format; to refer to their theorems in an ML script you must
7204 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7206 * HOL: inductive package no longer splits induction rule aggressively,
7207 but only as far as specified by the introductions given; the old
7208 format may be recovered via ML function complete_split_rule or attribute
7209 'split_rule (complete)';
7211 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7212 gfp_Tarski to gfp_unfold;
7214 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7216 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7217 relation); infix "^^" has been renamed "``"; infix "``" has been
7218 renamed "`"; "univalent" has been renamed "single_valued";
7220 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7223 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7225 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7227 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7228 consequence, it is no longer monotonic wrt. the local goal context
7229 (which is now passed through the inductive cases);
7231 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7232 \<gg> to \<ggreater>;
7235 *** Document preparation ***
7237 * \isabellestyle{NAME} selects version of Isabelle output (currently
7238 available: are "it" for near math-mode best-style output, "sl" for
7239 slanted text style, and "tt" for plain type-writer; if no
7240 \isabellestyle command is given, output is according to slanted
7243 * support sub/super scripts (for single symbols only), input syntax is
7244 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7246 * some more standard symbols; see Appendix A of the system manual for
7247 the complete list of symbols defined in isabellesym.sty;
7249 * improved isabelle style files; more abstract symbol implementation
7250 (should now use \isamath{...} and \isatext{...} in custom symbol
7253 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7254 state; Note that presentation of goal states does not conform to
7255 actual human-readable proof documents. Please do not include goal
7256 states into document output unless you really know what you are doing!
7258 * proper indentation of antiquoted output with proportional LaTeX
7261 * no_document ML operator temporarily disables LaTeX document
7264 * isatool unsymbolize tunes sources for plain ASCII communication;
7269 * Pure: Isar now suffers initial goal statements to contain unbound
7270 schematic variables (this does not conform to actual readable proof
7271 documents, due to unpredictable outcome and non-compositional proof
7272 checking); users who know what they are doing may use schematic goals
7273 for Prolog-style synthesis of proven results;
7275 * Pure: assumption method (an implicit finishing) now handles actual
7278 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7279 initial goal, declare "that" only as Pure intro (only for single
7280 steps); the "that" rule assumption may now be involved in implicit
7281 finishing, thus ".." becomes a feasible for trivial obtains;
7283 * Pure: default proof step now includes 'intro_classes'; thus trivial
7284 instance proofs may be performed by "..";
7286 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7289 * Pure: more robust selection of calculational rules;
7291 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7292 rule (as well as the assumption rule);
7294 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7295 lemmas, using the graph browser tool;
7297 * Pure: predict failure of "show" in interactive mode;
7299 * Pure: 'thms_containing' now takes actual terms as arguments;
7301 * HOL: improved method 'induct' --- now handles non-atomic goals
7302 (potential INCOMPATIBILITY); tuned error handling;
7304 * HOL: cases and induct rules now provide explicit hints about the
7305 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7306 any remaining facts are inserted into the goal verbatim;
7308 * HOL: local contexts (aka cases) may now contain term bindings as
7309 well; the 'cases' and 'induct' methods new provide a ?case binding for
7310 the result to be shown in each case;
7312 * HOL: added 'recdef_tc' command;
7314 * isatool convert assists in eliminating legacy ML scripts;
7319 * HOL/Library: a collection of generic theories to be used together
7320 with main HOL; the theory loader path already includes this directory
7321 by default; the following existing theories have been moved here:
7322 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7323 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7325 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7326 modelling and verification task performed in Isabelle/HOL +
7327 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7329 * HOL/Algebra: special summation operator SUM no longer exists, it has
7330 been replaced by setsum; infix 'assoc' now has priority 50 (like
7331 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7332 'domain', this makes the theory consistent with mathematical
7335 * HOL basics: added overloaded operations "inverse" and "divide"
7336 (infix "/"), syntax for generic "abs" operation, generic summation
7339 * HOL/typedef: simplified package, provide more useful rules (see also
7342 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7343 now expressed as a proper nested rule (old-style tactic scripts may
7344 require atomize_strip_tac to cope with non-atomic premises);
7346 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7347 to "split_conv" (old name still available for compatibility);
7349 * HOL: improved concrete syntax for strings (e.g. allows translation
7350 rules with string literals);
7352 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7353 and Fleuriot's mechanization of analysis, including the transcendental
7354 functions for the reals;
7356 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7361 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7362 "lam" is displayed as TWO lambda-symbols
7364 * CTT: theory Main now available, containing everything (that is, Bool
7370 * Pure: the Simplifier has been implemented properly as a derived rule
7371 outside of the actual kernel (at last!); the overall performance
7372 penalty in practical applications is about 50%, while reliability of
7373 the Isabelle inference kernel has been greatly improved;
7375 * print modes "brackets" and "no_brackets" control output of nested =>
7376 (types) and ==> (props); the default behaviour is "brackets";
7378 * Provers: fast_tac (and friends) now handle actual object-logic rules
7379 as assumptions as well;
7381 * system: support Poly/ML 4.0;
7383 * system: isatool install handles KDE version 1 or 2;
7387 New in Isabelle99-1 (October 2000)
7388 ----------------------------------
7390 *** Overview of INCOMPATIBILITIES ***
7392 * HOL: simplification of natural numbers is much changed; to partly
7393 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7394 issue the following ML commands:
7396 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7397 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7399 * HOL: simplification no longer dives into case-expressions; this is
7400 controlled by "t.weak_case_cong" for each datatype t;
7402 * HOL: nat_less_induct renamed to less_induct;
7404 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7405 fixsome to patch .thy and .ML sources automatically;
7407 select_equality -> some_equality
7408 select_eq_Ex -> some_eq_ex
7409 selectI2EX -> someI2_ex
7412 select1_equality -> some1_equality
7413 Eps_sym_eq -> some_sym_eq_trivial
7414 Eps_eq -> some_eq_trivial
7416 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7418 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7421 * HOL: the recursion equations generated by 'recdef' are now called
7422 f.simps instead of f.rules;
7424 * HOL: qed_spec_mp now also handles bounded ALL as well;
7426 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7427 sometimes be needed;
7429 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7431 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7433 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7434 product is now "<*>" instead of "Times"; the lexicographic product is
7435 now "<*lex*>" instead of "**";
7437 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7438 of main HOL, but was unused); better use HOL's datatype package;
7440 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7441 the old syntax may be recovered as follows:
7444 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7445 (infixl "\\<oplus>" 100)
7447 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7449 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7450 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7453 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7454 changed from A/r to A//r;
7456 * ZF: new treatment of arithmetic (nat & int) may break some old
7459 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7460 rulify -> rule_format, elimify -> elim_format, ...);
7462 * Isar/Provers: intro/elim/dest attributes changed; renamed
7463 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7464 should have to change intro!! to intro? only); replaced "delrule" by
7467 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7469 * Provers: strengthened force_tac by using new first_best_tac;
7471 * LaTeX document preparation: several changes of isabelle.sty (see
7475 *** Document preparation ***
7477 * formal comments (text blocks etc.) in new-style theories may now
7478 contain antiquotations of thm/prop/term/typ/text to be presented
7479 according to latex print mode; concrete syntax is like this:
7480 @{term[show_types] "f(x) = a + x"};
7482 * isatool mkdir provides easy setup of Isabelle session directories,
7483 including proper document sources;
7485 * generated LaTeX sources are now deleted after successful run
7486 (isatool document -c); may retain a copy somewhere else via -D option
7489 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7490 style files, achieving self-contained LaTeX sources and simplifying
7493 * old-style theories now produce (crude) LaTeX output as well;
7495 * browser info session directories are now self-contained (may be put
7496 on WWW server seperately); improved graphs of nested sessions; removed
7497 graph for 'all sessions';
7499 * several improvements in isabelle style files; \isabellestyle{it}
7500 produces fake math mode output; \isamarkupheader is now \section by
7501 default; see lib/texinputs/isabelle.sty etc.;
7506 * Isar/Pure: local results and corresponding term bindings are now
7507 subject to Hindley-Milner polymorphism (similar to ML); this
7508 accommodates incremental type-inference very nicely;
7510 * Isar/Pure: new derived language element 'obtain' supports
7511 generalized existence reasoning;
7513 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7514 support accumulation of results, without applying any rules yet;
7515 useful to collect intermediate results without explicit name
7516 references, and for use with transitivity rules with more than 2
7519 * Isar/Pure: scalable support for case-analysis type proofs: new
7520 'case' language element refers to local contexts symbolically, as
7521 produced by certain proof methods; internally, case names are attached
7522 to theorems as "tags";
7524 * Isar/Pure: theory command 'hide' removes declarations from
7525 class/type/const name spaces;
7527 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7528 indicate potential overloading;
7530 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7532 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7533 "{a,b,c}" instead of {a,b,c};
7535 * Isar/Pure now provides its own version of intro/elim/dest
7536 attributes; useful for building new logics, but beware of confusion
7537 with the version in Provers/classical;
7539 * Isar/Pure: the local context of (non-atomic) goals is provided via
7540 case name 'antecedent';
7542 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7543 to the current context is now done automatically);
7545 * Isar/Pure: theory command 'method_setup' provides a simple interface
7546 for definining proof methods in ML;
7548 * Isar/Provers: intro/elim/dest attributes changed; renamed
7549 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7550 most cases, one should have to change intro!! to intro? only);
7551 replaced "delrule" by "rule del";
7553 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7554 'symmetric' attribute (the latter supercedes [RS sym]);
7556 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7557 method modifier); 'simp' method: 'only:' modifier removes loopers as
7558 well (including splits);
7560 * Isar/Provers: Simplifier and Classical methods now support all kind
7561 of modifiers used in the past, including 'cong', 'iff', etc.
7563 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7564 of Simplifier and Classical reasoner);
7566 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7567 now support named cases; major packages (inductive, datatype, primrec,
7568 recdef) support case names and properly name parameters;
7570 * Isar/HOL: new transitivity rules for substitution in inequalities --
7571 monotonicity conditions are extracted to be proven at end of
7574 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7577 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7578 split_if split_if_asm; datatype package provides theorems foo.splits =
7579 foo.split foo.split_asm for each datatype;
7581 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7582 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7583 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7584 use "(cases (simplified))" method in proper proof texts);
7586 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7588 * Isar: names of theorems etc. may be natural numbers as well;
7590 * Isar: 'pr' command: optional arguments for goals_limit and
7591 ProofContext.prems_limit; no longer prints theory contexts, but only
7594 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7595 additional print modes to be specified; e.g. "pr(latex)" will print
7596 proof state according to the Isabelle LaTeX style;
7598 * Isar: improved support for emulating tactic scripts, including proof
7599 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7600 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7601 (for HOL datatypes);
7603 * Isar: simplified (more robust) goal selection of proof methods: 1st
7604 goal, all goals, or explicit goal specifier (tactic emulation); thus
7605 'proof method scripts' have to be in depth-first order;
7607 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7609 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7610 should instead use individual commands for printing items
7611 (print_commands, print_methods etc.);
7613 * Isar: added 'nothing' --- the empty list of theorems;
7618 * HOL/MicroJava: formalization of a fragment of Java, together with a
7619 corresponding virtual machine and a specification of its bytecode
7620 verifier and a lightweight bytecode verifier, including proofs of
7621 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7622 Cornelia Pusch (see also the homepage of project Bali at
7623 http://isabelle.in.tum.de/Bali/);
7625 * HOL/Algebra: new theory of rings and univariate polynomials, by
7628 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7629 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7632 * HOL/Lattice: fundamental concepts of lattice theory and order
7633 structures, including duals, properties of bounds versus algebraic
7634 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7635 Theorem for complete lattices etc.; may also serve as a demonstration
7636 for abstract algebraic reasoning using axiomatic type classes, and
7637 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7639 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7642 * HOL/IMPP: extension of IMP with local variables and mutually
7643 recursive procedures, by David von Oheimb;
7645 * HOL/Lambda: converted into new-style theory and document;
7647 * HOL/ex/Multiquote: example of multiple nested quotations and
7648 anti-quotations -- basically a generalized version of de-Bruijn
7649 representation; very useful in avoiding lifting of operations;
7651 * HOL/record: added general record equality rule to simpset; fixed
7652 select-update simplification procedure to handle extended records as
7653 well; admit "r" as field name;
7655 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7656 other numeric types and also as the identity of groups, rings, etc.;
7658 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7659 Types nat and int belong to this axclass;
7661 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7662 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7663 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7664 two terms #m*u and #n*u are replaced by #(m+n)*u
7665 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7666 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7667 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7669 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7670 powerful prover for predicate logic but knows nothing of clasets; see
7671 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7673 * HOL: new version of "case_tac" subsumes both boolean case split and
7674 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7675 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7677 * HOL: simplification no longer dives into case-expressions: only the
7678 selector expression is simplified, but not the remaining arms; to
7679 enable full simplification of case-expressions for datatype t, you may
7680 remove t.weak_case_cong from the simpset, either globally (Delcongs
7681 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7683 * HOL/recdef: the recursion equations generated by 'recdef' for
7684 function 'f' are now called f.simps instead of f.rules; if all
7685 termination conditions are proved automatically, these simplification
7686 rules are added to the simpset, as in primrec; rules may be named
7687 individually as well, resulting in a separate list of theorems for
7690 * HOL/While is a new theory that provides a while-combinator. It
7691 permits the definition of tail-recursive functions without the
7692 provision of a termination measure. The latter is necessary once the
7693 invariant proof rule for while is applied.
7695 * HOL: new (overloaded) notation for the set of elements below/above
7696 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7698 * HOL: theorems impI, allI, ballI bound as "strip";
7700 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7701 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7702 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7704 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7706 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7707 main HOL, but was unused);
7709 * HOL: fewer consts declared as global (e.g. have to refer to
7710 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7712 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7713 in case of overlap with user translations (e.g. judgements over
7714 tuples); (note that the underlying logical represenation is still
7720 * ZF: simplification automatically cancels common terms in arithmetic
7721 expressions over nat and int;
7723 * ZF: new treatment of nat to minimize type-checking: all operators
7724 coerce their operands to a natural number using the function natify,
7725 making the algebraic laws unconditional;
7727 * ZF: as above, for int: operators coerce their operands to an integer
7728 using the function intify;
7730 * ZF: the integer library now contains many of the usual laws for the
7731 orderings, including $<=, and monotonicity laws for $+ and $*;
7733 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7736 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7737 to the simplifier and classical reasoner simultaneously;
7742 * Provers: blast_tac now handles actual object-logic rules as
7743 assumptions; note that auto_tac uses blast_tac internally as well;
7745 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7746 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7748 * Provers: delrules now handles destruct rules as well (no longer need
7749 explicit make_elim);
7751 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7752 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7753 use instead the strong form,
7754 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7755 in HOL, FOL and ZF the function cla_make_elim will create such rules
7756 from destruct-rules;
7758 * Provers: Simplifier.easy_setup provides a fast path to basic
7759 Simplifier setup for new object-logics;
7761 * Pure: AST translation rules no longer require constant head on LHS;
7763 * Pure: improved name spaces: ambiguous output is qualified; support
7764 for hiding of names;
7766 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7767 XSYMBOL_HOME; no longer need to do manual configuration in most
7770 * system: compression of ML heaps images may now be controlled via -c
7771 option of isabelle and isatool usedir (currently only observed by
7774 * system: isatool installfonts may handle X-Symbol fonts as well (very
7775 useful for remote X11);
7777 * system: provide TAGS file for Isabelle sources;
7779 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7782 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7783 timing flag supersedes proof_timing and Toplevel.trace;
7785 * ML: new combinators |>> and |>>> for incremental transformations
7786 with secondary results (e.g. certain theory extensions):
7788 * ML: PureThy.add_defs gets additional argument to indicate potential
7789 overloading (usually false);
7791 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7796 New in Isabelle99 (October 1999)
7797 --------------------------------
7799 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7801 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7802 are no longer simplified. (This allows the simplifier to unfold recursive
7803 functional programs.) To restore the old behaviour, declare
7805 Delcongs [if_weak_cong];
7807 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7810 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7812 * HOL/datatype: mutual_induct_tac no longer exists --
7813 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7815 * HOL/typedef: fixed type inference for representing set; type
7816 arguments now have to occur explicitly on the rhs as type constraints;
7818 * ZF: The con_defs part of an inductive definition may no longer refer
7819 to constants declared in the same theory;
7821 * HOL, ZF: the function mk_cases, generated by the inductive
7822 definition package, has lost an argument. To simplify its result, it
7823 uses the default simpset instead of a supplied list of theorems.
7825 * HOL/List: the constructors of type list are now Nil and Cons;
7827 * Simplifier: the type of the infix ML functions
7828 setSSolver addSSolver setSolver addSolver
7829 is now simpset * solver -> simpset where `solver' is a new abstract type
7830 for packaging solvers. A solver is created via
7831 mk_solver: string -> (thm list -> int -> tactic) -> solver
7832 where the string argument is only a comment.
7837 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7838 decision procedure for linear arithmetic. Currently it is used for
7839 types `nat', `int', and `real' in HOL (see below); it can, should and
7840 will be instantiated for other types and logics as well.
7842 * The simplifier now accepts rewrite rules with flexible heads, eg
7843 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7844 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7850 * New Isabelle/Isar subsystem provides an alternative to traditional
7851 tactical theorem proving; together with the ProofGeneral/isar user
7852 interface it offers an interactive environment for developing human
7853 readable proof documents (Isar == Intelligible semi-automated
7854 reasoning); for further information see isatool doc isar-ref,
7855 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7857 * improved and simplified presentation of theories: better HTML markup
7858 (including colors), graph views in several sizes; isatool usedir now
7859 provides a proper interface for user theories (via -P option); actual
7860 document preparation based on (PDF)LaTeX is available as well (for
7861 new-style theories only); see isatool doc system for more information;
7863 * native support for Proof General, both for classic Isabelle and
7866 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7867 using the graph browser tool;
7869 * Isabelle manuals now also available as PDF;
7871 * theory loader rewritten from scratch (may not be fully
7872 bug-compatible); old loadpath variable has been replaced by show_path,
7873 add_path, del_path, reset_path functions; new operations such as
7874 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7877 * improved isatool install: option -k creates KDE application icon,
7878 option -p DIR installs standalone binaries;
7880 * added ML_PLATFORM setting (useful for cross-platform installations);
7881 more robust handling of platform specific ML images for SML/NJ;
7883 * the settings environment is now statically scoped, i.e. it is never
7884 created again in sub-processes invoked from isabelle, isatool, or
7887 * path element specification '~~' refers to '$ISABELLE_HOME';
7889 * in locales, the "assumes" and "defines" parts may be omitted if
7892 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7895 * new print_mode "HTML";
7897 * new flag show_tags controls display of tags of theorems (which are
7898 basically just comments that may be attached by some tools);
7900 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7901 mode and goal output format:
7903 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
7905 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
7907 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
7908 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
7910 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
7912 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
7914 * function bind_thms stores lists of theorems (cf. bind_thm);
7916 * new shorthand tactics ftac, eatac, datac, fatac;
7918 * qed (and friends) now accept "" as result name; in that case the
7919 theorem is not stored, but proper checks and presentation of the
7922 * theorem database now also indexes constants "Trueprop", "all",
7923 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7928 ** HOL arithmetic **
7930 * There are now decision procedures for linear arithmetic over nat and
7933 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7934 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7935 are treated as atomic; subformulae not involving type `nat' or `int'
7936 are ignored; quantified subformulae are ignored unless they are
7937 positive universal or negative existential. The tactic has to be
7938 invoked by hand and can be a little bit slow. In particular, the
7939 running time is exponential in the number of occurrences of `min' and
7940 `max', and `-' on `nat'.
7942 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
7943 (negated) (in)equalities among the premises and the conclusion into
7944 account (i.e. no compound formulae) and does not know about `min' and
7945 `max', and `-' on `nat'. It is fast and is used automatically by the
7948 NB: At the moment, these decision procedures do not cope with mixed
7949 nat/int formulae where the two parts interact, such as `m < n ==>
7952 * HOL/Numeral provides a generic theory of numerals (encoded
7953 efficiently as bit strings); setup for types nat/int/real is in place;
7954 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
7955 int, existing theories and proof scripts may require a few additional
7958 * integer division and remainder can now be performed on constant
7961 * many properties of integer multiplication, division and remainder
7964 * An interface to the Stanford Validity Checker (SVC) is available through the
7965 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
7966 are proved automatically. SVC must be installed separately, and its results
7967 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
7968 invocation of the underlying oracle). For SVC see
7969 http://verify.stanford.edu/SVC
7971 * IsaMakefile: the HOL-Real target now builds an actual image;
7976 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
7977 (in Isabelle/Isar) -- by Gertrud Bauer;
7979 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
7980 analysis for assembly languages with subtypes;
7982 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
7983 -- avoids syntactic ambiguities and treats state, transition, and
7984 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
7985 changed syntax and (many) tactics;
7987 * HOL/inductive: Now also handles more general introduction rules such
7988 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
7989 theorems are now maintained within the theory (maintained via the
7992 * HOL/datatype: Now also handles arbitrarily branching datatypes
7993 (using function types) such as
7995 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
7997 * HOL/record: record_simproc (part of the default simpset) takes care
7998 of selectors applied to updated records; record_split_tac is no longer
7999 part of the default claset; update_defs may now be removed from the
8000 simpset in many cases; COMPATIBILITY: old behavior achieved by
8002 claset_ref () := claset() addSWrapper record_split_wrapper;
8003 Delsimprocs [record_simproc]
8005 * HOL/typedef: fixed type inference for representing set; type
8006 arguments now have to occur explicitly on the rhs as type constraints;
8008 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8009 names rather than an ML expression;
8011 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8012 supplied later. Program schemes can be defined, such as
8013 "While B C s = (if B s then While B C (C s) else s)"
8014 where the well-founded relation can be chosen after B and C have been given.
8016 * HOL/List: the constructors of type list are now Nil and Cons;
8017 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8018 course, ML tools referring to List.list.op # etc. have to be adapted;
8020 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8021 disabled by default; run isabelle with option -m HOL to get back to
8022 the original Gordon/HOL-style output;
8024 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8025 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8027 * HOL basic syntax simplified (more orthogonal): all variants of
8028 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8029 Eps operator is provided as well: "SOME x. P[x]";
8031 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8033 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8034 thus available for user theories;
8036 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8037 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8040 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8041 several times and then mp;
8046 * the notation <<...>> is now available as a notation for sequences of
8049 * the simplifier is now installed
8051 * the axiom system has been generalized (thanks to Soren Heilmann)
8053 * the classical reasoner now has a default rule database
8058 * new primrec section allows primitive recursive functions to be given
8059 directly (as in HOL) over datatypes and the natural numbers;
8061 * new tactics induct_tac and exhaust_tac for induction (or case
8062 analysis) over datatypes and the natural numbers;
8064 * the datatype declaration of type T now defines the recursor T_rec;
8066 * simplification automatically does freeness reasoning for datatype
8069 * automatic type-inference, with AddTCs command to insert new
8070 type-checking rules;
8072 * datatype introduction rules are now added as Safe Introduction rules
8075 * the syntax "if P then x else y" is now available in addition to
8079 *** Internal programming interfaces ***
8081 * tuned simplifier trace output; new flag debug_simp;
8083 * structures Vartab / Termtab (instances of TableFun) offer efficient
8084 tables indexed by indexname_ord / term_ord (compatible with aconv);
8086 * AxClass.axclass_tac lost the theory argument;
8088 * tuned current_goals_markers semantics: begin / end goal avoids
8089 printing empty lines;
8091 * removed prs and prs_fn hook, which was broken because it did not
8092 include \n in its semantics, forcing writeln to add one
8093 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8094 string -> unit if you really want to output text without newline;
8096 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8097 plain output, interface builders may have to enable 'isabelle_font'
8098 mode to get Isabelle font glyphs as before;
8100 * refined token_translation interface; INCOMPATIBILITY: output length
8101 now of type real instead of int;
8103 * theory loader actions may be traced via new ThyInfo.add_hook
8104 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8105 your own database of information attached to *whole* theories -- as
8106 opposed to intra-theory data slots offered via TheoryDataFun;
8108 * proper handling of dangling sort hypotheses (at last!);
8109 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8110 extra sort hypotheses that can be witnessed from the type signature;
8111 the force_strip_shyps flag is gone, any remaining shyps are simply
8112 left in the theorem (with a warning issued by strip_shyps_warning);
8116 New in Isabelle98-1 (October 1998)
8117 ----------------------------------
8119 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8121 * several changes of automated proof tools;
8123 * HOL: major changes to the inductive and datatype packages, including
8124 some minor incompatibilities of theory syntax;
8126 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8129 * HOL: removed duplicate thms in Arith:
8130 less_imp_add_less should be replaced by trans_less_add1
8131 le_imp_add_le should be replaced by trans_le_add1
8133 * HOL: unary minus is now overloaded (new type constraints may be
8136 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8137 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8138 now taken as an integer constant.
8140 * Pure: ML function 'theory_of' renamed to 'theory';
8146 1. Asm_full_simp_tac is now more aggressive.
8147 1. It will sometimes reorient premises if that increases their power to
8149 2. It does no longer proceed strictly from left to right but may also
8150 rotate premises to achieve further simplification.
8151 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8152 old Asm_full_simp_tac in that it does not rotate premises.
8153 2. The simplifier now knows a little bit about nat-arithmetic.
8155 * Classical reasoner: wrapper mechanism for the classical reasoner now
8156 allows for selected deletion of wrappers, by introduction of names for
8157 wrapper functionals. This implies that addbefore, addSbefore,
8158 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8159 and that adding two tactics with the same name overwrites the first
8160 one (emitting a warning).
8161 type wrapper = (int -> tactic) -> (int -> tactic)
8162 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8163 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8164 delWrapper, delSWrapper: claset * string -> claset
8165 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8167 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8168 semantics; addbefore now affects only the unsafe part of step_tac
8169 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8170 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8173 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8174 compWrapper; added safe wrapper (and access functions for it);
8176 * HOL/split_all_tac is now much faster and fails if there is nothing
8177 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8178 and the names of the automatically generated variables have changed.
8179 split_all_tac has moved within claset() from unsafe wrappers to safe
8180 wrappers, which means that !!-bound variables are split much more
8181 aggressively, and safe_tac and clarify_tac now split such variables.
8182 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8183 Note: the same holds for record_split_tac, which does the job of
8184 split_all_tac for record fields.
8186 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8187 permanently to the default simpset using Addsplits just like
8188 Addsimps. They can be removed via Delsplits just like
8189 Delsimps. Lower-case versions are also available.
8191 * HOL/Simplifier: The rule split_if is now part of the default
8192 simpset. This means that the simplifier will eliminate all occurrences
8193 of if-then-else in the conclusion of a goal. To prevent this, you can
8194 either remove split_if completely from the default simpset by
8195 `Delsplits [split_if]' or remove it in a specific call of the
8196 simplifier using `... delsplits [split_if]'. You can also add/delete
8197 other case splitting rules to/from the default simpset: every datatype
8198 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8199 t is the name of the datatype).
8201 * Classical reasoner / Simplifier combination: new force_tac (and
8202 derivatives Force_tac, force) combines rewriting and classical
8203 reasoning (and whatever other tools) similarly to auto_tac, but is
8204 aimed to solve the given subgoal completely.
8209 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8210 and `goalw': the theory is no longer needed as an explicit argument -
8211 the current theory context is used; assumptions are no longer returned
8212 at the ML-level unless one of them starts with ==> or !!; it is
8213 recommended to convert to these new commands using isatool fixgoal
8214 (backup your sources first!);
8216 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8217 the current theory context, and 'theory' to lookup stored theories;
8219 * new theory section 'locale' for declaring constants, assumptions and
8220 definitions that have local scope;
8222 * new theory section 'nonterminals' for purely syntactic types;
8224 * new theory section 'setup' for generic ML setup functions
8225 (e.g. package initialization);
8227 * the distribution now includes Isabelle icons: see
8228 lib/logo/isabelle-{small,tiny}.xpm;
8230 * isatool install - install binaries with absolute references to
8233 * isatool logo -- create instances of the Isabelle logo (as EPS);
8235 * print mode 'emacs' reserved for Isamode;
8237 * support multiple print (ast) translations per constant name;
8239 * theorems involving oracles are now printed with a suffixed [!];
8244 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8246 * HOL/inductive package reorganized and improved: now supports mutual
8252 oddI "n : EVEN ==> Suc n : ODD"
8253 evenI "n : ODD ==> Suc n : EVEN"
8255 new theorem list "elims" contains an elimination rule for each of the
8256 recursive sets; inductive definitions now handle disjunctive premises
8257 correctly (also ZF);
8259 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8260 "mutual_induct" no longer exists - the induction rule is always
8261 contained in "induct";
8264 * HOL/datatype package re-implemented and greatly improved: now
8265 supports mutually recursive datatypes such as
8268 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8269 | SUM ('a aexp) ('a aexp)
8270 | DIFF ('a aexp) ('a aexp)
8273 'a bexp = LESS ('a aexp) ('a aexp)
8274 | AND ('a bexp) ('a bexp)
8275 | OR ('a bexp) ('a bexp)
8277 as well as indirectly recursive datatypes such as
8280 ('a, 'b) term = Var 'a
8281 | App 'b ((('a, 'b) term) list)
8283 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8284 induction on mutually / indirectly recursive datatypes.
8286 Primrec equations are now stored in theory and can be accessed via
8287 <function_name>.simps.
8291 - Theories using datatypes must now have theory Datatype as an
8293 - The specific <typename>.induct_tac no longer exists - use the
8294 generic induct_tac instead.
8295 - natE has been renamed to nat.exhaust - use exhaust_tac
8296 instead of res_inst_tac ... natE. Note that the variable
8297 names in nat.exhaust differ from the names in natE, this
8298 may cause some "fragile" proofs to fail.
8299 - The theorems split_<typename>_case and split_<typename>_case_asm
8300 have been renamed to <typename>.split and <typename>.split_asm.
8301 - Since default sorts of type variables are now handled correctly,
8302 some datatype definitions may have to be annotated with explicit
8304 - Primrec definitions no longer require function name and type
8305 of recursive argument.
8307 Consider using isatool fixdatatype to adapt your theories and proof
8308 scripts to the new package (backup your sources first!).
8311 * HOL/record package: considerably improved implementation; now
8312 includes concrete syntax for record types, terms, updates; theorems
8313 for surjective pairing and splitting !!-bound record variables; proof
8314 support is as follows:
8316 1) standard conversions (selectors or updates applied to record
8317 constructor terms) are part of the standard simpset;
8319 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8320 made part of standard simpset and claset via addIffs;
8322 3) a tactic for record field splitting (record_split_tac) is part of
8323 the standard claset (addSWrapper);
8325 To get a better idea about these rules you may retrieve them via
8326 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8327 the name of your record type.
8329 The split tactic 3) conceptually simplifies by the following rule:
8331 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8333 Thus any record variable that is bound by meta-all will automatically
8334 blow up into some record constructor term, consequently the
8335 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8336 solve record problems automatically.
8339 * reorganized the main HOL image: HOL/Integ and String loaded by
8340 default; theory Main includes everything;
8342 * automatic simplification of integer sums and comparisons, using cancellation;
8344 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8346 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8348 * many new identities for unions, intersections, set difference, etc.;
8350 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8351 called split_if, split_split, split_sum_case and split_nat_case (to go
8352 with add/delsplits);
8354 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8355 (?x::unit) = (); this is made part of the default simpset, which COULD
8356 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8357 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8358 unit_abs_eta_conv is added in order to counter the effect of
8359 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8362 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8365 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8366 It and 'sym RS equals0D' are now in the default claset, giving automatic
8367 disjointness reasoning but breaking a few old proofs.
8369 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8370 to 'converse' from 'inverse' (for compatibility with ZF and some
8373 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8374 the well-founded relation;
8376 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8377 Compl A. The "Compl" syntax remains available as input syntax for this
8380 * HOL/Update: new theory of function updates:
8381 f(a:=b) == %x. if x=a then b else f x
8382 may also be iterated as in f(a:=b,c:=d,...);
8384 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8387 - new function list_update written xs[i:=v] that updates the i-th
8388 list position. May also be iterated as in xs[i:=a,j:=b,...].
8389 - new function `upt' written [i..j(] which generates the list
8390 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8391 bound write [i..j], which is a shorthand for [i..j+1(].
8392 - new lexicographic orderings and corresponding wellfoundedness theorems.
8395 - removed 'pred' (predecessor) function;
8396 - generalized some theorems about n-1;
8397 - many new laws about "div" and "mod";
8398 - new laws about greatest common divisors (see theory ex/Primes);
8400 * HOL/Relation: renamed the relational operator r^-1 "converse"
8401 instead of "inverse";
8403 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8404 of the multiset ordering;
8406 * directory HOL/Real: a construction of the reals using Dedekind cuts
8407 (not included by default);
8409 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8411 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8412 programs, i.e. different program variables may have different types.
8414 * calling (stac rew i) now fails if "rew" has no effect on the goal
8415 [previously, this check worked only if the rewrite rule was unconditional]
8416 Now rew can involve either definitions or equalities (either == or =).
8421 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8422 only the theorems proved on ZF.ML;
8424 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8425 It and 'sym RS equals0D' are now in the default claset, giving automatic
8426 disjointness reasoning but breaking a few old proofs.
8428 * ZF/Update: new theory of function updates
8429 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8430 may also be iterated as in f(a:=b,c:=d,...);
8432 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8434 * calling (stac rew i) now fails if "rew" has no effect on the goal
8435 [previously, this check worked only if the rewrite rule was unconditional]
8436 Now rew can involve either definitions or equalities (either == or =).
8438 * case_tac provided for compatibility with HOL
8439 (like the old excluded_middle_tac, but with subgoals swapped)
8442 *** Internal programming interfaces ***
8444 * Pure: several new basic modules made available for general use, see
8445 also src/Pure/README;
8447 * improved the theory data mechanism to support encapsulation (data
8448 kind name replaced by private Object.kind, acting as authorization
8449 key); new type-safe user interface via functor TheoryDataFun; generic
8450 print_data function becomes basically useless;
8452 * removed global_names compatibility flag -- all theory declarations
8453 are qualified by default;
8455 * module Pure/Syntax now offers quote / antiquote translation
8456 functions (useful for Hoare logic etc. with implicit dependencies);
8457 see HOL/ex/Antiquote for an example use;
8459 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8462 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8465 * Display.print_goals function moved to Locale.print_goals;
8467 * standard print function for goals supports current_goals_markers
8468 variable for marking begin of proof, end of proof, start of goal; the
8469 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8470 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8475 New in Isabelle98 (January 1998)
8476 --------------------------------
8478 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8480 * changed lexical syntax of terms / types: dots made part of long
8481 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8483 * simpset (and claset) reference variable replaced by functions
8484 simpset / simpset_ref;
8486 * no longer supports theory aliases (via merge) and non-trivial
8487 implicit merge of thms' signatures;
8489 * most internal names of constants changed due to qualified names;
8491 * changed Pure/Sequence interface (see Pure/seq.ML);
8494 *** General Changes ***
8496 * hierachically structured name spaces (for consts, types, axms, thms
8497 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8498 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8499 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8500 long_names for fully qualified output names; NOTE: ML programs
8501 (special tactics, packages etc.) referring to internal names may have
8502 to be adapted to cope with fully qualified names; in case of severe
8503 backward campatibility problems try setting 'global_names' at compile
8504 time to have enrything declared within a flat name space; one may also
8505 fine tune name declarations in theories via the 'global' and 'local'
8508 * reimplemented the implicit simpset and claset using the new anytype
8509 data filed in signatures; references simpset:simpset ref etc. are
8510 replaced by functions simpset:unit->simpset and
8511 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8512 to patch your ML files accordingly;
8514 * HTML output now includes theory graph data for display with Java
8515 applet or isatool browser; data generated automatically via isatool
8516 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8518 * defs may now be conditional; improved rewrite_goals_tac to handle
8519 conditional equations;
8521 * defs now admits additional type arguments, using TYPE('a) syntax;
8523 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8524 creates a new theory node; implicit merge of thms' signatures is
8525 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8526 transfer:theory->thm->thm in (rare) cases;
8528 * improved handling of draft signatures / theories; draft thms (and
8529 ctyps, cterms) are automatically promoted to real ones;
8531 * slightly changed interfaces for oracles: admit many per theory, named
8532 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8534 * print_goals: optional output of const types (set show_consts and
8537 * improved output of warnings (###) and errors (***);
8539 * subgoal_tac displays a warning if the new subgoal has type variables;
8541 * removed old README and Makefiles;
8543 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8545 * removed obsolete init_pps and init_database;
8547 * deleted the obsolete tactical STATE, which was declared by
8548 fun STATE tacfun st = tacfun st st;
8550 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8551 (which abbreviates $HOME);
8553 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8554 use isatool fixseq to adapt your ML programs (this works for fully
8555 qualified references to the Sequence structure only!);
8557 * use_thy no longer requires writable current directory; it always
8558 reloads .ML *and* .thy file, if either one is out of date;
8561 *** Classical Reasoner ***
8563 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8564 tactics that use classical reasoning to simplify a subgoal without
8565 splitting it into several subgoals;
8567 * Safe_tac: like safe_tac but uses the default claset;
8572 * added simplification meta rules:
8573 (asm_)(full_)simplify: simpset -> thm -> thm;
8575 * simplifier.ML no longer part of Pure -- has to be loaded by object
8578 * added prems argument to simplification procedures;
8580 * HOL, FOL, ZF: added infix function `addsplits':
8581 instead of `<simpset> setloop (split_tac <thms>)'
8582 you can simply write `<simpset> addsplits <thms>'
8587 * TYPE('a) syntax for type reflection terms;
8589 * no longer handles consts with name "" -- declare as 'syntax' instead;
8591 * pretty printer: changed order of mixfix annotation preference (again!);
8593 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8598 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8599 with `addloop' of the simplifier to faciliate case splitting in premises.
8601 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8603 * HOL/Auth: new protocol proofs including some for the Internet
8606 * HOL/Map: new theory of `maps' a la VDM;
8608 * HOL/simplifier: simplification procedures nat_cancel_sums for
8609 cancelling out common nat summands from =, <, <= (in)equalities, or
8610 differences; simplification procedures nat_cancel_factor for
8611 cancelling common factor from =, <, <= (in)equalities over natural
8612 sums; nat_cancel contains both kinds of procedures, it is installed by
8613 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8615 * HOL/simplifier: terms of the form
8616 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8618 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8619 and those of the form
8620 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8622 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8625 Each datatype `t' now comes with a theorem `split_t_case' of the form
8627 P(t_case f1 ... fn x) =
8628 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8630 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8633 and a theorem `split_t_case_asm' of the form
8635 P(t_case f1 ... fn x) =
8636 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8638 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8640 which can be added to a simpset via `addsplits'. The existing theorems
8641 expand_list_case and expand_option_case have been renamed to
8642 split_list_case and split_option_case.
8645 - `pred n' is automatically converted to `n-1'.
8646 Users are strongly encouraged not to use `pred' any longer,
8647 because it will disappear altogether at some point.
8648 - Users are strongly encouraged to write "0 < n" rather than
8649 "n ~= 0". Theorems and proof tools have been modified towards this
8653 the function "set_of_list" has been renamed "set" (and its theorems too);
8654 the function "nth" now takes its arguments in the reverse order and
8655 has acquired the infix notation "!" as in "xs!n".
8657 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8659 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8660 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8662 * HOL/record: extensible records with schematic structural subtyping
8663 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8664 still lacks various theorems and concrete record syntax;
8669 * removed "axioms" and "generated by" sections;
8671 * replaced "ops" section by extended "consts" section, which is capable of
8672 handling the continuous function space "->" directly;
8675 . proves theorems immediately and stores them in the theory,
8676 . creates hierachical name space,
8677 . now uses normal mixfix annotations (instead of cinfix...),
8678 . minor changes to some names and values (for consistency),
8679 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8680 . separator between mutual domain defs: changed "," to "and",
8681 . improved handling of sort constraints; now they have to
8682 appear on the left-hand side of the equations only;
8684 * fixed LAM <x,y,zs>.b syntax;
8686 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8687 adm (%x. P (t x)), where P is chainfinite and t continuous;
8692 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8693 with `addloop' of the simplifier to faciliate case splitting in premises.
8695 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8696 in HOL, they strip ALL and --> from proved theorems;
8700 New in Isabelle94-8 (May 1997)
8701 ------------------------------
8703 *** General Changes ***
8705 * new utilities to build / run / maintain Isabelle etc. (in parts
8706 still somewhat experimental); old Makefiles etc. still functional;
8708 * new 'Isabelle System Manual';
8710 * INSTALL text, together with ./configure and ./build scripts;
8712 * reimplemented type inference for greater efficiency, better error
8713 messages and clean internal interface;
8715 * prlim command for dealing with lots of subgoals (an easier way of
8716 setting goals_limit);
8721 * supports alternative (named) syntax tables (parser and pretty
8722 printer); internal interface is provided by add_modesyntax(_i);
8724 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8725 be used in conjunction with the Isabelle symbol font; uses the
8726 "symbols" syntax table;
8728 * added token_translation interface (may translate name tokens in
8729 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8730 the current print_mode); IMPORTANT: user print translation functions
8731 are responsible for marking newly introduced bounds
8732 (Syntax.mark_boundT);
8734 * token translations for modes "xterm" and "xterm_color" that display
8735 names in bold, underline etc. or colors (which requires a color
8738 * infixes may now be declared with names independent of their syntax;
8740 * added typed_print_translation (like print_translation, but may
8741 access type of constant);
8744 *** Classical Reasoner ***
8746 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8747 some limitations. Blast_tac...
8748 + ignores addss, addbefore, addafter; this restriction is intrinsic
8749 + ignores elimination rules that don't have the correct format
8750 (the conclusion MUST be a formula variable)
8751 + ignores types, which can make HOL proofs fail
8752 + rules must not require higher-order unification, e.g. apply_type in ZF
8753 [message "Function Var's argument not a bound variable" relates to this]
8754 + its proof strategy is more general but can actually be slower
8756 * substitution with equality assumptions no longer permutes other
8759 * minor changes in semantics of addafter (now called addaltern); renamed
8760 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8761 (and access functions for it);
8763 * improved combination of classical reasoner and simplifier:
8764 + functions for handling clasimpsets
8765 + improvement of addss: now the simplifier is called _after_ the
8767 + safe variant of addss called addSss: uses safe simplifications
8768 _during_ the safe steps. It is more complete as it allows multiple
8769 instantiations of unknowns (e.g. with slow_tac).
8773 * added interface for simplification procedures (functions that
8774 produce *proven* rewrite rules on the fly, depending on current
8777 * ordering on terms as parameter (used for ordered rewriting);
8779 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8781 * the solver is now split into a safe and an unsafe part.
8782 This should be invisible for the normal user, except that the
8783 functions setsolver and addsolver have been renamed to setSolver and
8784 addSolver; added safe_asm_full_simp_tac;
8789 * a generic induction tactic `induct_tac' which works for all datatypes and
8790 also for type `nat';
8792 * a generic case distinction tactic `exhaust_tac' which works for all
8793 datatypes and also for type `nat';
8795 * each datatype comes with a function `size';
8797 * patterns in case expressions allow tuple patterns as arguments to
8798 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8800 * primrec now also works with type nat;
8802 * recdef: a new declaration form, allows general recursive functions to be
8803 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8805 * the constant for negation has been renamed from "not" to "Not" to
8806 harmonize with FOL, ZF, LK, etc.;
8808 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8811 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8813 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8814 problems in commutative rings, using axiomatic type classes for + and *;
8816 * more examples in HOL/MiniML and HOL/Auth;
8818 * more default rewrite rules for quantifiers, union/intersection;
8820 * a new constant `arbitrary == @x.False';
8822 * HOLCF/IOA replaces old HOL/IOA;
8824 * HOLCF changes: derived all rules and arities
8825 + axiomatic type classes instead of classes
8826 + typedef instead of faking type definitions
8827 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8828 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8829 + eliminated the types void, one, tr
8830 + use unit lift and bool lift (with translations) instead of one and tr
8831 + eliminated blift from Lift3.thy (use Def instead of blift)
8832 all eliminated rules are derived as theorems --> no visible changes ;
8837 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8838 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8839 as ZF_cs addSIs [equalityI];
8843 New in Isabelle94-7 (November 96)
8844 ---------------------------------
8846 * allowing negative levels (as offsets) in prlev and choplev;
8848 * super-linear speedup for large simplifications;
8850 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8851 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8852 FAIL); can suppress it using the command Delsimps (ex_simps @
8853 all_simps); De Morgan laws are also now included, by default;
8855 * improved printing of ==> : ~:
8857 * new object-logic "Sequents" adds linear logic, while replacing LK
8858 and Modal (thanks to Sara Kalvala);
8860 * HOL/Auth: correctness proofs for authentication protocols;
8862 * HOL: new auto_tac combines rewriting and classical reasoning (many
8863 examples on HOL/Auth);
8865 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8866 the rewriter and classical reasoner simultaneously;
8868 * function uresult no longer returns theorems in "standard" format;
8869 regain previous version by: val uresult = standard o uresult;
8876 * oracles -- these establish an interface between Isabelle and trusted
8877 external reasoners, which may deliver results as theorems;
8879 * proof objects (in particular record all uses of oracles);
8881 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8883 * "constdefs" section in theory files;
8885 * "primrec" section (HOL) no longer requires names;
8887 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8894 * reduced space requirements;
8896 * automatic HTML generation from theories;
8898 * theory files no longer require "..." (quotes) around most types;
8900 * new examples, including two proofs of the Church-Rosser theorem;
8902 * non-curried (1994) version of HOL is no longer distributed;
8909 * greatly reduced space requirements;
8911 * theory files (.thy) no longer require \...\ escapes at line breaks;
8913 * searchable theorem database (see the section "Retrieving theorems" on
8914 page 8 of the Reference Manual);
8916 * new examples, including Grabczewski's monumental case study of the
8919 * The previous version of HOL renamed to Old_HOL;
8921 * The new version of HOL (previously called CHOL) uses a curried syntax
8922 for functions. Application looks like f a b instead of f(a,b);
8924 * Mutually recursive inductive definitions finally work in HOL;
8926 * In ZF, pattern-matching on tuples is now available in all abstractions and
8927 translates to the operator "split";
8934 * new infix operator, addss, allowing the classical reasoner to
8935 perform simplification at each step of its search. Example:
8936 fast_tac (cs addss ss)
8938 * a new logic, CHOL, the same as HOL, but with a curried syntax
8939 for functions. Application looks like f a b instead of f(a,b). Also pairs
8940 look like (a,b) instead of <a,b>;
8942 * PLEASE NOTE: CHOL will eventually replace HOL!
8944 * In CHOL, pattern-matching on tuples is now available in all abstractions.
8945 It translates to the operator "split". A new theory of integers is available;
8947 * In ZF, integer numerals now denote two's-complement binary integers.
8948 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
8950 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
8951 of the Axiom of Choice;
8958 * Significantly faster resolution;
8960 * the different sections in a .thy file can now be mixed and repeated
8963 * Database of theorems for FOL, HOL and ZF. New
8964 commands including qed, qed_goal and bind_thm store theorems in the database.
8966 * Simple database queries: return a named theorem (get_thm) or all theorems of
8967 a given theory (thms_of), or find out what theory a theorem was proved in
8970 * Bugs fixed in the inductive definition and datatype packages;
8972 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
8973 and HOL_dup_cs obsolete;
8975 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
8978 * Simpler definition of function space in ZF;
8980 * new results about cardinal and ordinal arithmetic in ZF;
8982 * 'subtype' facility in HOL for introducing new types as subsets of existing
8985 :mode=text:wrap=hard:maxLineLen=72: