1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Prover IDE (PIDE) improvements:
11 - markup for bound variables
12 - markup for types of term variables (e.g. displayed as tooltips)
14 * Updated and extended reference manuals ("isar-ref" and
15 "implementation"); reduced remaining material in old "ref" manual.
17 * Rule attributes in local theory declarations (e.g. locale or class)
18 are now statically evaluated: the resulting theorem is stored instead
19 of the original expression. INCOMPATIBILITY in rare situations, where
20 the historic accident of dynamic re-evaluation in interpretations
23 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
24 declaration, and results are standardized before being stored. Thus
25 old-style "standard" after instantiation or composition of facts
26 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
27 indices of schematic variables.
29 * Renamed some inner syntax categories:
35 Minor INCOMPATIBILITY. Note that in practice "num_const" or
36 "num_position" etc. are mainly used instead (which also include
37 position information via constraints).
39 * Simplified configuration options for syntax ambiguity: see
40 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
41 manual. Minor INCOMPATIBILITY.
46 * Attribute "abs_def" turns an equation of the form "f x y == t" into
47 "f == %x y. t", which ensures that "simp" or "unfold" steps always
48 expand it. This also works for object-logic equality. (Formerly
49 undocumented feature.)
51 * Discontinued old "prems" fact, which used to refer to the accidental
52 collection of foundational premises in the context (marked as legacy
55 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
56 instead. INCOMPATIBILITY.
58 * Ancient code generator for SML and its commands 'code_module',
59 'code_library', 'consts_code', 'types_code' have been discontinued.
60 Use commands of the generic code generator instead. INCOMPATIBILITY.
62 * Redundant attribute 'code_inline' has been discontinued. Use
63 'code_unfold' instead. INCOMPATIBILITY.
65 * Dropped attribute 'code_unfold_post' in favor of the its dual
66 'code_abbrev', which yields a common pattern in definitions like
68 definition [code_abbrev]: "f = t"
72 * Sort constraints are now propagated in simultaneous statements, just
73 like type constraints. INCOMPATIBILITY in rare situations, where
74 distinct sorts used to be assigned accidentally. For example:
76 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
78 lemma "P (x::'a)" and "Q (y::'a::bar)"
79 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
84 * Type 'a set is now a proper type constructor (just as before
85 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
86 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
87 sets separate, it is often sufficient to rephrase sets S accidentally
88 used as predicates by "%x. x : S" and predicates P accidentally used
89 as sets by "{x. P x}". Corresponding proofs in a first step should be
90 pruned from any tinkering with former theorems mem_def and
91 Collect_def as far as possible.
92 For developments which deliberately mixed predicates and
93 sets, a planning step is necessary to determine what should become a
94 predicate and what a set. It can be helpful to carry out that step in
95 Isabelle2011-1 before jumping right into the current release.
97 * Code generation by default implements sets as container type rather
98 than predicates. INCOMPATIBILITY.
100 * New type synonym 'a rel = ('a * 'a) set
102 * More default pred/set conversions on a couple of relation operations
103 and predicates. Consolidation of some relation theorems:
105 converse_def ~> converse_unfold
106 rel_comp_def ~> rel_comp_unfold
107 symp_def ~> (dropped, use symp_def and sym_def instead)
108 transp_def ~> transp_trans
109 Domain_def ~> Domain_unfold
110 Range_def ~> Domain_converse [symmetric]
114 * Consolidated various theorem names relating to Finite_Set.fold
117 inf_INFI_fold_inf ~> inf_INF_fold_inf
118 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
119 INFI_fold_inf ~> INF_fold_inf
120 SUPR_fold_sup ~> SUP_fold_sup
121 union_set ~> union_set_fold
122 minus_set ~> minus_set_fold
126 * Consolidated theorem names concerning fold combinators:
128 INFI_set_fold ~> INF_set_fold
129 SUPR_set_fold ~> SUP_set_fold
130 INF_code ~> INF_set_foldr
131 SUP_code ~> SUP_set_foldr
132 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
133 foldl.simps ~> foldl_Nil foldl_Cons
134 foldr_fold_rev ~> foldr_def
135 foldl_fold ~> foldl_def
139 * Dropped rarely useful theorems concerning fold combinators:
140 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
141 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
142 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
143 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
144 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
145 Prefer "List.fold" with canonical argument order, or boil down
146 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
147 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
148 and "List.foldl plus 0", prefer "List.listsum".
150 * Congruence rules Option.map_cong and Option.bind_cong for recursion
151 through option types.
153 * Concrete syntax for case expressions includes constraints for source
154 positions, and thus produces Prover IDE markup for its bindings.
155 INCOMPATIBILITY for old-style syntax translations that augment the
156 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
159 * Discontinued configuration option "syntax_positions": atomic terms
160 in parse trees are always annotated by position constraints.
162 * Finite_Set.fold now qualified. INCOMPATIBILITY.
164 * Renamed some facts on canonical fold on lists, in order to avoid
165 problems with interpretation involving corresponding facts on foldl
166 with the same base names:
168 fold_set_remdups ~> fold_set_fold_remdups
169 fold_set ~> fold_set_fold
170 fold1_set ~> fold1_set_fold
174 * Renamed facts about the power operation on relations, i.e., relpow
175 to match the constant's name:
177 rel_pow_1 ~> relpow_1
178 rel_pow_0_I ~> relpow_0_I
179 rel_pow_Suc_I ~> relpow_Suc_I
180 rel_pow_Suc_I2 ~> relpow_Suc_I2
181 rel_pow_0_E ~> relpow_0_E
182 rel_pow_Suc_E ~> relpow_Suc_E
183 rel_pow_E ~> relpow_E
184 rel_pow_Suc_D2 ~> relpow_Suc_D2
185 rel_pow_Suc_E2 ~> relpow_Suc_E2
186 rel_pow_Suc_D2' ~> relpow_Suc_D2'
187 rel_pow_E2 ~> relpow_E2
188 rel_pow_add ~> relpow_add
189 rel_pow_commute ~> relpow
190 rel_pow_empty ~> relpow_empty:
191 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
192 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
193 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
194 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
195 rel_pow_fun_conv ~> relpow_fun_conv
196 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
197 rel_pow_finite_bounded ~> relpow_finite_bounded
198 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
199 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
200 single_valued_rel_pow ~> single_valued_relpow
204 * New theory HOL/Library/DAList provides an abstract type for association
205 lists with distinct keys.
207 * 'datatype' specifications allow explicit sort constraints.
209 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
210 use theory HOL/Library/Nat_Bijection instead.
212 * Session HOL-Word: Discontinued many redundant theorems specific to
213 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
216 word_sub_alt ~> word_sub_wi
217 word_add_alt ~> word_add_def
218 word_mult_alt ~> word_mult_def
219 word_minus_alt ~> word_minus_def
220 word_0_alt ~> word_0_wi
221 word_1_alt ~> word_1_wi
222 word_add_0 ~> add_0_left
223 word_add_0_right ~> add_0_right
224 word_mult_1 ~> mult_1_left
225 word_mult_1_right ~> mult_1_right
226 word_add_commute ~> add_commute
227 word_add_assoc ~> add_assoc
228 word_add_left_commute ~> add_left_commute
229 word_mult_commute ~> mult_commute
230 word_mult_assoc ~> mult_assoc
231 word_mult_left_commute ~> mult_left_commute
232 word_left_distrib ~> left_distrib
233 word_right_distrib ~> right_distrib
234 word_left_minus ~> left_minus
235 word_diff_0_right ~> diff_0_right
236 word_diff_self ~> diff_self
237 word_sub_def ~> diff_minus
238 word_diff_minus ~> diff_minus
239 word_add_ac ~> add_ac
240 word_mult_ac ~> mult_ac
241 word_plus_ac0 ~> add_0_left add_0_right add_ac
242 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
243 word_order_trans ~> order_trans
244 word_order_refl ~> order_refl
245 word_order_antisym ~> order_antisym
246 word_order_linear ~> linorder_linear
247 lenw1_zero_neq_one ~> zero_neq_one
248 word_number_of_eq ~> number_of_eq
249 word_of_int_add_hom ~> wi_hom_add
250 word_of_int_sub_hom ~> wi_hom_sub
251 word_of_int_mult_hom ~> wi_hom_mult
252 word_of_int_minus_hom ~> wi_hom_neg
253 word_of_int_succ_hom ~> wi_hom_succ
254 word_of_int_pred_hom ~> wi_hom_pred
255 word_of_int_0_hom ~> word_0_wi
256 word_of_int_1_hom ~> word_1_wi
258 * Clarified attribute "mono_set": pure declaration without modifying
259 the result of the fact expression.
261 * "Transitive_Closure.ntrancl": bounded transitive closure on
264 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
266 * "sublists" moved to theory More_List. INCOMPATIBILITY.
268 * Theory Int: Discontinued many legacy theorems specific to type int.
269 INCOMPATIBILITY, use the corresponding generic theorems instead.
271 zminus_zminus ~> minus_minus
272 zminus_0 ~> minus_zero
273 zminus_zadd_distrib ~> minus_add_distrib
274 zadd_commute ~> add_commute
275 zadd_assoc ~> add_assoc
276 zadd_left_commute ~> add_left_commute
280 zadd_0_right ~> add_0_right
281 zadd_zminus_inverse2 ~> left_minus
282 zmult_zminus ~> mult_minus_left
283 zmult_commute ~> mult_commute
284 zmult_assoc ~> mult_assoc
285 zadd_zmult_distrib ~> left_distrib
286 zadd_zmult_distrib2 ~> right_distrib
287 zdiff_zmult_distrib ~> left_diff_distrib
288 zdiff_zmult_distrib2 ~> right_diff_distrib
289 zmult_1 ~> mult_1_left
290 zmult_1_right ~> mult_1_right
291 zle_refl ~> order_refl
292 zle_trans ~> order_trans
293 zle_antisym ~> order_antisym
294 zle_linear ~> linorder_linear
295 zless_linear ~> linorder_less_linear
296 zadd_left_mono ~> add_left_mono
297 zadd_strict_right_mono ~> add_strict_right_mono
298 zadd_zless_mono ~> add_less_le_mono
299 int_0_less_1 ~> zero_less_one
300 int_0_neq_1 ~> zero_neq_one
302 zpower_zadd_distrib ~> power_add
303 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
304 zero_le_zpower_abs ~> zero_le_power_abs
306 * Theory Deriv: Renamed
308 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
310 * New "case_product" attribute to generate a case rule doing multiple
311 case distinctions at the same time. E.g.
313 list.exhaust [case_product nat.exhaust]
315 produces a rule which can be used to perform case distinction on both
318 * Improved code generation of multisets.
320 * New diagnostic command find_unused_assms to find potentially superfluous
321 assumptions in theorems using Quickcheck.
324 - Quickcheck returns variable assignments as counterexamples, which
325 allows to reveal the underspecification of functions under test.
326 For example, refuting "hd xs = x", it presents the variable
327 assignment xs = [] and x = a1 as a counterexample, assuming that
328 any property is false whenever "hd []" occurs in it.
329 These counterexample are marked as potentially spurious, as
330 Quickcheck also returns "xs = []" as a counterexample to the
331 obvious theorem "hd xs = hd xs".
332 After finding a potentially spurious counterexample, Quickcheck
333 continues searching for genuine ones.
334 By default, Quickcheck shows potentially spurious and genuine
335 counterexamples. The option "genuine_only" sets quickcheck to
336 only show genuine counterexamples.
338 - The command 'quickcheck_generator' creates random and exhaustive
339 value generators for a given type and operations.
340 It generates values by using the operations as if they were
341 constructors of that type.
343 - Support for multisets.
345 - Added "use_subtype" options.
348 - Fixed infinite loop caused by the 'peephole_optim' option and
349 affecting 'rat' and 'real'.
352 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
353 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
354 - Renamed "sound" option to "strict".
357 - Added possibility to specify lambda translations scheme as a
358 parenthesized argument (e.g., "by (metis (lifting) ...)").
361 - Renamed from 'try_methods'. INCOMPATIBILITY.
363 * New "eventually_elim" method as a generalized variant of the
364 eventually_elim* rules. Supports structured proofs.
369 * New "case_product" attribute (see HOL).
374 * Local_Theory.define no longer hard-wires default theorem name
375 "foo_def": definitional packages need to make this explicit, and may
376 choose to omit theorem bindings for definitions by using
377 Binding.empty/Attrib.empty_binding. Potential INCOMPATIBILITY for
378 derived definitional packages.
380 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
381 conformance with similar operations in structure Term and Logic.
383 * Antiquotation @{attributes [...]} embeds attribute source
384 representation into the ML text, which is particularly useful with
385 declarations like Local_Theory.note.
387 * Structure Proof_Context follows standard naming scheme. Old
388 ProofContext has been discontinued. INCOMPATIBILITY.
390 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
391 change of semantics: update is applied to auxiliary local theory
394 * Modernized some old-style infix operations:
396 addeqcongs ~> Simplifier.add_eqcong
397 deleqcongs ~> Simplifier.del_eqcong
398 addcongs ~> Simplifier.add_cong
399 delcongs ~> Simplifier.del_cong
400 setmksimps ~> Simplifier.set_mksimps
401 setmkcong ~> Simplifier.set_mkcong
402 setmksym ~> Simplifier.set_mksym
403 setmkeqTrue ~> Simplifier.set_mkeqTrue
404 settermless ~> Simplifier.set_termless
405 setsubgoaler ~> Simplifier.set_subgoaler
406 addsplits ~> Splitter.add_split
407 delsplits ~> Splitter.del_split
411 New in Isabelle2011-1 (October 2011)
412 ------------------------------------
416 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
417 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
419 - Management of multiple theory files directly from the editor
420 buffer store -- bypassing the file-system (no requirement to save
423 - Markup of formal entities within the text buffer, with semantic
424 highlighting, tooltips and hyperlinks to jump to defining source
427 - Improved text rendering, with sub/superscripts in the source
428 buffer (including support for copy/paste wrt. output panel, HTML
429 theory output and other non-Isabelle text boxes).
431 - Refined scheduling of proof checking and printing of results,
432 based on interactive editor view. (Note: jEdit folding and
433 narrowing allows to restrict buffer perspectives explicitly.)
435 - Reduced CPU performance requirements, usable on machines with few
438 - Reduced memory requirements due to pruning of unused document
439 versions (garbage collection).
441 See also ~~/src/Tools/jEdit/README.html for further information,
442 including some remaining limitations.
444 * Theory loader: source files are exclusively located via the master
445 directory of each theory node (where the .thy file itself resides).
446 The global load path (such as src/HOL/Library) has been discontinued.
447 Note that the path element ~~ may be used to reference theories in the
448 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
451 * Theory loader: source files are identified by content via SHA1
452 digests. Discontinued former path/modtime identification and optional
453 ISABELLE_FILE_IDENT plugin scripts.
455 * Parallelization of nested Isar proofs is subject to
456 Goal.parallel_proofs_threshold (default 100). See also isabelle
459 * Name space: former unsynchronized references are now proper
460 configuration options, with more conventional names:
462 long_names ~> names_long
463 short_names ~> names_short
464 unique_names ~> names_unique
466 Minor INCOMPATIBILITY, need to declare options in context like this:
468 declare [[names_unique = false]]
470 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
471 that the result needs to be unique, which means fact specifications
472 may have to be refined after enriching a proof context.
474 * Attribute "case_names" has been refined: the assumptions in each case
475 can be named now by following the case name with [name1 name2 ...].
477 * Isabelle/Isar reference manual has been updated and extended:
478 - "Synopsis" provides a catalog of main Isar language concepts.
479 - Formal references in syntax diagrams, via @{rail} antiquotation.
480 - Updated material from classic "ref" manual, notably about
481 "Classical Reasoner".
486 * Class bot and top require underlying partial order rather than
487 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
489 * Class complete_lattice: generalized a couple of lemmas from sets;
490 generalized theorems INF_cong and SUP_cong. New type classes for
491 complete boolean algebras and complete linear orders. Lemmas
492 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
493 class complete_linorder.
495 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
496 Sup_fun_def, Inf_apply, Sup_apply.
498 Removed redundant lemmas (the right hand side gives hints how to
499 replace them for (metis ...), or (simp only: ...) proofs):
501 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
502 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
503 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
504 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
505 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
506 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
507 Inter_def ~> INF_def, image_def
508 Union_def ~> SUP_def, image_def
509 INT_eq ~> INF_def, and image_def
510 UN_eq ~> SUP_def, and image_def
511 INF_subset ~> INF_superset_mono [OF _ order_refl]
513 More consistent and comprehensive names:
515 INTER_eq_Inter_image ~> INF_def
516 UNION_eq_Union_image ~> SUP_def
520 INF_leI2 ~> INF_lower2
521 le_INFI ~> INF_greatest
523 le_SUPI2 ~> SUP_upper2
525 INFI_bool_eq ~> INF_bool_eq
526 SUPR_bool_eq ~> SUP_bool_eq
527 INFI_apply ~> INF_apply
528 SUPR_apply ~> SUP_apply
529 INTER_def ~> INTER_eq
530 UNION_def ~> UNION_eq
534 * Renamed theory Complete_Lattice to Complete_Lattices.
537 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
538 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
539 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
540 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
542 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
543 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
544 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
547 * Added syntactic classes "inf" and "sup" for the respective
548 constants. INCOMPATIBILITY: Changes in the argument order of the
549 (mostly internal) locale predicates for some derived classes.
551 * Theorem collections ball_simps and bex_simps do not contain theorems
552 referring to UNION any longer; these have been moved to collection
553 UN_ball_bex_simps. INCOMPATIBILITY.
555 * Theory Archimedean_Field: floor now is defined as parameter of a
556 separate type class floor_ceiling.
558 * Theory Finite_Set: more coherent development of fold_set locales:
560 locale fun_left_comm ~> locale comp_fun_commute
561 locale fun_left_comm_idem ~> locale comp_fun_idem
563 Both use point-free characterization; interpretation proofs may need
564 adjustment. INCOMPATIBILITY.
566 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
567 accordance with standard mathematical terminology. INCOMPATIBILITY.
569 * Theory Complex_Main: The locale interpretations for the
570 bounded_linear and bounded_bilinear locales have been removed, in
571 order to reduce the number of duplicate lemmas. Users must use the
572 original names for distributivity theorems, potential INCOMPATIBILITY.
574 divide.add ~> add_divide_distrib
575 divide.diff ~> diff_divide_distrib
576 divide.setsum ~> setsum_divide_distrib
577 mult.add_right ~> right_distrib
578 mult.diff_right ~> right_diff_distrib
579 mult_right.setsum ~> setsum_right_distrib
580 mult_left.diff ~> left_diff_distrib
582 * Theory Complex_Main: Several redundant theorems have been removed or
583 replaced by more general versions. INCOMPATIBILITY.
585 real_diff_def ~> minus_real_def
586 real_divide_def ~> divide_real_def
587 real_less_def ~> less_le
588 real_abs_def ~> abs_real_def
589 real_sgn_def ~> sgn_real_def
590 real_mult_commute ~> mult_commute
591 real_mult_assoc ~> mult_assoc
592 real_mult_1 ~> mult_1_left
593 real_add_mult_distrib ~> left_distrib
594 real_zero_not_eq_one ~> zero_neq_one
595 real_mult_inverse_left ~> left_inverse
596 INVERSE_ZERO ~> inverse_zero
597 real_le_refl ~> order_refl
598 real_le_antisym ~> order_antisym
599 real_le_trans ~> order_trans
600 real_le_linear ~> linear
601 real_le_eq_diff ~> le_iff_diff_le_0
602 real_add_left_mono ~> add_left_mono
603 real_mult_order ~> mult_pos_pos
604 real_mult_less_mono2 ~> mult_strict_left_mono
605 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
606 real_0_le_divide_iff ~> zero_le_divide_iff
607 realpow_two_disj ~> power2_eq_iff
608 real_squared_diff_one_factored ~> square_diff_one_factored
609 realpow_two_diff ~> square_diff_square_factored
610 reals_complete2 ~> complete_real
611 real_sum_squared_expand ~> power2_sum
612 exp_ln_eq ~> ln_unique
614 expi_zero ~> exp_zero
615 lemma_DERIV_subst ~> DERIV_cong
616 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
617 LIMSEQ_const ~> tendsto_const
618 LIMSEQ_norm ~> tendsto_norm
619 LIMSEQ_add ~> tendsto_add
620 LIMSEQ_minus ~> tendsto_minus
621 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
622 LIMSEQ_diff ~> tendsto_diff
623 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
624 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
625 LIMSEQ_mult ~> tendsto_mult
626 LIMSEQ_inverse ~> tendsto_inverse
627 LIMSEQ_divide ~> tendsto_divide
628 LIMSEQ_pow ~> tendsto_power
629 LIMSEQ_setsum ~> tendsto_setsum
630 LIMSEQ_setprod ~> tendsto_setprod
631 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
632 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
633 LIMSEQ_imp_rabs ~> tendsto_rabs
634 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
635 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
636 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
637 LIMSEQ_Complex ~> tendsto_Complex
638 LIM_ident ~> tendsto_ident_at
639 LIM_const ~> tendsto_const
640 LIM_add ~> tendsto_add
641 LIM_add_zero ~> tendsto_add_zero
642 LIM_minus ~> tendsto_minus
643 LIM_diff ~> tendsto_diff
644 LIM_norm ~> tendsto_norm
645 LIM_norm_zero ~> tendsto_norm_zero
646 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
647 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
648 LIM_rabs ~> tendsto_rabs
649 LIM_rabs_zero ~> tendsto_rabs_zero
650 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
651 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
652 LIM_compose ~> tendsto_compose
653 LIM_mult ~> tendsto_mult
654 LIM_scaleR ~> tendsto_scaleR
655 LIM_of_real ~> tendsto_of_real
656 LIM_power ~> tendsto_power
657 LIM_inverse ~> tendsto_inverse
658 LIM_sgn ~> tendsto_sgn
659 isCont_LIM_compose ~> isCont_tendsto_compose
660 bounded_linear.LIM ~> bounded_linear.tendsto
661 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
662 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
663 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
664 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
665 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
666 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
668 * Theory Complex_Main: The definition of infinite series was
669 generalized. Now it is defined on the type class {topological_space,
670 comm_monoid_add}. Hence it is useable also for extended real numbers.
672 * Theory Complex_Main: The complex exponential function "expi" is now
673 a type-constrained abbreviation for "exp :: complex => complex"; thus
674 several polymorphic lemmas about "exp" are now applicable to "expi".
678 - Theory Library/Code_Char_ord provides native ordering of
679 characters in the target language.
681 - Commands code_module and code_library are legacy, use export_code
684 - Method "evaluation" is legacy, use method "eval" instead.
686 - Legacy evaluator "SML" is deactivated by default. May be
687 reactivated by the following theory command:
689 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
691 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
693 * New proof method "induction" that gives induction hypotheses the
694 name "IH", thus distinguishing them from further hypotheses that come
695 from rule induction. The latter are still called "hyps". Method
696 "induction" is a thin wrapper around "induct" and follows the same
699 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
700 still available as a legacy feature for some time.
703 - Added "need" and "total_consts" options.
704 - Reintroduced "show_skolems" option by popular demand.
705 - Renamed attribute: nitpick_def ~> nitpick_unfold.
709 - Use quasi-sound (and efficient) translations by default.
710 - Added support for the following provers: E-ToFoF, LEO-II,
711 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
712 - Automatically preplay and minimize proofs before showing them if
713 this can be done within reasonable time.
714 - sledgehammer available_provers ~> sledgehammer supported_provers.
716 - Added "preplay_timeout", "slicing", "type_enc", "sound",
717 "max_mono_iters", and "max_new_mono_instances" options.
718 - Removed "explicit_apply" and "full_types" options as well as "Full
719 Types" Proof General menu item. INCOMPATIBILITY.
722 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
723 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
727 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
728 "elim:" options. INCOMPATIBILITY.
729 - Introduced 'try' that not only runs 'try_methods' but also
730 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
733 - Added "eval" option to evaluate terms for the found counterexample
734 (currently only supported by the default (exhaustive) tester).
735 - Added post-processing of terms to obtain readable counterexamples
736 (currently only supported by the default (exhaustive) tester).
737 - New counterexample generator quickcheck[narrowing] enables
738 narrowing-based testing. Requires the Glasgow Haskell compiler
739 with its installation location defined in the Isabelle settings
740 environment as ISABELLE_GHC.
741 - Removed quickcheck tester "SML" based on the SML code generator
742 (formly in HOL/Library).
744 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
745 use 'partial_function' instead.
747 * Theory Library/Extended_Reals replaces now the positive extended
748 reals found in probability theory. This file is extended by
749 Multivariate_Analysis/Extended_Real_Limits.
751 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
752 from where it must be imported explicitly if it is really required.
755 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
756 been moved here. INCOMPATIBILITY.
758 * Theory Library/Saturated provides type of numbers with saturated
761 * Theory Library/Product_Lattice defines a pointwise ordering for the
762 product type 'a * 'b, and provides instance proofs for various order
763 and lattice type classes.
765 * Theory Library/Countable now provides the "countable_datatype" proof
766 method for proving "countable" class instances for datatypes.
768 * Theory Library/Cset_Monad allows do notation for computable sets
769 (cset) via the generic monad ad-hoc overloading facility.
771 * Library: Theories of common data structures are split into theories
772 for implementation, an invariant-ensuring type, and connection to an
773 abstract type. INCOMPATIBILITY.
775 - RBT is split into RBT and RBT_Mapping.
776 - AssocList is split and renamed into AList and AList_Mapping.
777 - DList is split into DList_Impl, DList, and DList_Cset.
778 - Cset is split into Cset and List_Cset.
780 * Theory Library/Nat_Infinity has been renamed to
781 Library/Extended_Nat, with name changes of the following types and
784 type inat ~> type enat
786 Infty ~> infinity (overloaded)
790 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
791 been renamed accordingly. INCOMPATIBILITY.
793 * Session Multivariate_Analysis: The euclidean_space type class now
794 fixes a constant "Basis :: 'a set" consisting of the standard
795 orthonormal basis for the type. Users now have the option of
796 quantifying over this set instead of using the "basis" function, e.g.
797 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
799 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
800 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
801 "Cart_nth" and "Cart_lambda" have been respectively renamed to
802 "vec_nth" and "vec_lambda"; theorems mentioning those names have
803 changed to match. Definition theorems for overloaded constants now use
804 the standard "foo_vec_def" naming scheme. A few other theorems have
805 been renamed as follows (INCOMPATIBILITY):
807 Cart_eq ~> vec_eq_iff
808 dist_nth_le_cart ~> dist_vec_nth_le
809 tendsto_vector ~> vec_tendstoI
810 Cauchy_vector ~> vec_CauchyI
812 * Session Multivariate_Analysis: Several duplicate theorems have been
813 removed, and other theorems have been renamed or replaced with more
814 general versions. INCOMPATIBILITY.
816 finite_choice ~> finite_set_choice
817 eventually_conjI ~> eventually_conj
818 eventually_and ~> eventually_conj_iff
819 eventually_false ~> eventually_False
820 setsum_norm ~> norm_setsum
821 Lim_sequentially ~> LIMSEQ_def
822 Lim_ident_at ~> LIM_ident
823 Lim_const ~> tendsto_const
824 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
825 Lim_neg ~> tendsto_minus
826 Lim_add ~> tendsto_add
827 Lim_sub ~> tendsto_diff
828 Lim_mul ~> tendsto_scaleR
829 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
830 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
831 Lim_linear ~> bounded_linear.tendsto
832 Lim_component ~> tendsto_euclidean_component
833 Lim_component_cart ~> tendsto_vec_nth
834 Lim_inner ~> tendsto_inner [OF tendsto_const]
835 dot_lsum ~> inner_setsum_left
836 dot_rsum ~> inner_setsum_right
837 continuous_cmul ~> continuous_scaleR [OF continuous_const]
838 continuous_neg ~> continuous_minus
839 continuous_sub ~> continuous_diff
840 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
841 continuous_mul ~> continuous_scaleR
842 continuous_inv ~> continuous_inverse
843 continuous_at_within_inv ~> continuous_at_within_inverse
844 continuous_at_inv ~> continuous_at_inverse
845 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
846 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
847 continuous_at_component ~> continuous_component [OF continuous_at_id]
848 continuous_on_neg ~> continuous_on_minus
849 continuous_on_sub ~> continuous_on_diff
850 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
851 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
852 continuous_on_mul ~> continuous_on_scaleR
853 continuous_on_mul_real ~> continuous_on_mult
854 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
855 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
856 continuous_on_inverse ~> continuous_on_inv
857 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
858 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
859 subset_interior ~> interior_mono
860 subset_closure ~> closure_mono
861 closure_univ ~> closure_UNIV
862 real_arch_lt ~> reals_Archimedean2
863 real_arch ~> reals_Archimedean3
864 real_abs_norm ~> abs_norm_cancel
865 real_abs_sub_norm ~> norm_triangle_ineq3
866 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
868 * Session HOL-Probability:
869 - Caratheodory's extension lemma is now proved for ring_of_sets.
870 - Infinite products of probability measures are now available.
871 - Sigma closure is independent, if the generator is independent
872 - Use extended reals instead of positive extended
873 reals. INCOMPATIBILITY.
875 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
877 expand_fun_below ~> fun_below_iff
878 below_fun_ext ~> fun_belowI
879 expand_cfun_eq ~> cfun_eq_iff
881 expand_cfun_below ~> cfun_below_iff
882 below_cfun_ext ~> cfun_belowI
883 monofun_fun_fun ~> fun_belowD
884 monofun_fun_arg ~> monofunE
885 monofun_lub_fun ~> adm_monofun [THEN admD]
886 cont_lub_fun ~> adm_cont [THEN admD]
887 cont2cont_Rep_CFun ~> cont2cont_APP
888 cont_Rep_CFun_app ~> cont_APP_app
889 cont_Rep_CFun_app_app ~> cont_APP_app_app
890 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
891 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
892 contlub_cfun ~> lub_APP [symmetric]
893 contlub_LAM ~> lub_LAM [symmetric]
896 lift_distinct1 ~> lift.distinct(1)
897 lift_distinct2 ~> lift.distinct(2)
898 Def_not_UU ~> lift.distinct(2)
899 Def_inject ~> lift.inject
900 below_UU_iff ~> below_bottom_iff
901 eq_UU_iff ~> eq_bottom_iff
904 *** Document preparation ***
906 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
907 isar-ref manual, both for description and actual application of the
910 * Antiquotation @{value} evaluates the given term and presents its
913 * Antiquotations: term style "isub" provides ad-hoc conversion of
914 variables x1, y23 into subscripted form x\<^isub>1,
917 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
918 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
920 * Localized \isabellestyle switch can be used within blocks or groups
923 \isabellestyle{it} %preferred default
924 {\isabellestylett @{text "typewriter stuff"}}
926 * Discontinued special treatment of hard tabulators. Implicit
927 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
933 * The inner syntax of sort/type/term/prop supports inlined YXML
934 representations within quoted string tokens. By encoding logical
935 entities via Term_XML (in ML or Scala) concrete syntax can be
936 bypassed, which is particularly useful for producing bits of text
937 under external program control.
939 * Antiquotations for ML and document preparation are managed as theory
940 data, which requires explicit setup.
942 * Isabelle_Process.is_active allows tools to check if the official
943 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
944 (better known as Proof General).
946 * Structure Proof_Context follows standard naming scheme. Old
947 ProofContext is still available for some time as legacy alias.
949 * Structure Timing provides various operations for timing; supersedes
950 former start_timing/end_timing etc.
952 * Path.print is the official way to show file-system paths to users
953 (including quotes etc.).
955 * Inner syntax: identifiers in parse trees of generic categories
956 "logic", "aprop", "idt" etc. carry position information (disguised as
957 type constraints). Occasional INCOMPATIBILITY with non-compliant
958 translations that choke on unexpected type constraints. Positions can
959 be stripped in ML translations via Syntax.strip_positions /
960 Syntax.strip_positions_ast, or via the syntax constant
961 "_strip_positions" within parse trees. As last resort, positions can
962 be disabled via the configuration option Syntax.positions, which is
963 called "syntax_positions" in Isar attribute syntax.
965 * Discontinued special status of various ML structures that contribute
966 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
967 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
968 refer directly to Ast.Constant, Lexicon.is_identifier,
969 Syntax_Trans.mk_binder_tr etc.
971 * Typed print translation: discontinued show_sorts argument, which is
972 already available via context of "advanced" translation.
974 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
975 goal states; body tactic needs to address all subgoals uniformly.
977 * Slightly more special eq_list/eq_set, with shortcut involving
978 pointer equality (assumes that eq relation is reflexive).
980 * Classical tactics use proper Proof.context instead of historic types
981 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
982 operate directly on Proof.context. Raw type claset retains its use as
983 snapshot of the classical context, which can be recovered via
984 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
985 INCOMPATIBILITY, classical tactics and derived proof methods require
986 proper Proof.context.
991 * Discontinued support for Poly/ML 5.2, which was the last version
992 without proper multithreading and TimeLimit implementation.
994 * Discontinued old lib/scripts/polyml-platform, which has been
995 obsolete since Isabelle2009-2.
997 * Various optional external tools are referenced more robustly and
998 uniformly by explicit Isabelle settings as follows:
1000 ISABELLE_CSDP (formerly CSDP_EXE)
1001 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1002 ISABELLE_OCAML (formerly EXEC_OCAML)
1003 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1004 ISABELLE_YAP (formerly EXEC_YAP)
1006 Note that automated detection from the file-system or search path has
1007 been discontinued. INCOMPATIBILITY.
1009 * Scala layer provides JVM method invocation service for static
1010 methods of type (String)String, see Invoke_Scala.method in ML. For
1013 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1015 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1016 this allows to pass structured values between ML and Scala.
1018 * The IsabelleText fonts includes some further glyphs to support the
1019 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1020 installed a local copy (which is normally *not* required) need to
1021 delete or update it from ~~/lib/fonts/.
1025 New in Isabelle2011 (January 2011)
1026 ----------------------------------
1030 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1031 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1032 useful tooltips and hyperlinks produced from its static analysis. The
1033 bundled component provides an executable Isabelle tool that can be run
1036 Isabelle2011/bin/isabelle jedit
1038 * Significantly improved Isabelle/Isar implementation manual.
1040 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1041 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1042 while the default heap location within that directory lacks that extra
1043 suffix. This isolates multiple Isabelle installations from each
1044 other, avoiding problems with old settings in new versions.
1045 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1047 * Source files are always encoded as UTF-8, instead of old-fashioned
1048 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1049 the following package declarations:
1051 \usepackage[utf8]{inputenc}
1052 \usepackage{textcomp}
1054 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1055 a Unicode character is treated as a single symbol, not a sequence of
1056 non-ASCII bytes as before. Since Isabelle/ML string literals may
1057 contain symbols without further backslash escapes, Unicode can now be
1058 used here as well. Recall that Symbol.explode in ML provides a
1059 consistent view on symbols, while raw explode (or String.explode)
1060 merely give a byte-oriented representation.
1062 * Theory loader: source files are primarily located via the master
1063 directory of each theory node (where the .thy file itself resides).
1064 The global load path is still partially available as legacy feature.
1065 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1066 explicit paths, relatively to the theory.
1068 * Special treatment of ML file names has been discontinued.
1069 Historically, optional extensions .ML or .sml were added on demand --
1070 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1071 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1073 * Various options that affect pretty printing etc. are now properly
1074 handled within the context via configuration options, instead of
1075 unsynchronized references or print modes. There are both ML Config.T
1076 entities and Isar declaration attributes to access these.
1078 ML (Config.T) Isar (attribute)
1080 eta_contract eta_contract
1081 show_brackets show_brackets
1082 show_sorts show_sorts
1083 show_types show_types
1084 show_question_marks show_question_marks
1085 show_consts show_consts
1086 show_abbrevs show_abbrevs
1088 Syntax.ast_trace syntax_ast_trace
1089 Syntax.ast_stat syntax_ast_stat
1090 Syntax.ambiguity_level syntax_ambiguity_level
1092 Goal_Display.goals_limit goals_limit
1093 Goal_Display.show_main_goal show_main_goal
1095 Method.rule_trace rule_trace
1097 Thy_Output.display thy_output_display
1098 Thy_Output.quotes thy_output_quotes
1099 Thy_Output.indent thy_output_indent
1100 Thy_Output.source thy_output_source
1101 Thy_Output.break thy_output_break
1103 Note that corresponding "..._default" references in ML may only be
1104 changed globally at the ROOT session setup, but *not* within a theory.
1105 The option "show_abbrevs" supersedes the former print mode
1106 "no_abbrevs" with inverted meaning.
1108 * More systematic naming of some configuration options.
1111 trace_simp ~> simp_trace
1112 debug_simp ~> simp_debug
1114 * Support for real valued configuration options, using simplistic
1115 floating-point notation that coincides with the inner syntax for
1118 * Support for real valued preferences (with approximative PGIP type):
1119 front-ends need to accept "pgint" values in float notation.
1122 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1125 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1130 * Command 'type_synonym' (with single argument) replaces somewhat
1131 outdated 'types', which is still available as legacy feature for some
1134 * Command 'nonterminal' (with 'and' separated list of arguments)
1135 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1137 * Command 'notepad' replaces former 'example_proof' for
1138 experimentation in Isar without any result. INCOMPATIBILITY.
1140 * Locale interpretation commands 'interpret' and 'sublocale' accept
1141 lists of equations to map definitions in a locale to appropriate
1142 entities in the context of the interpretation. The 'interpretation'
1143 command already provided this functionality.
1145 * Diagnostic command 'print_dependencies' prints the locale instances
1146 that would be activated if the specified expression was interpreted in
1147 the current context. Variant "print_dependencies!" assumes a context
1148 without interpretations.
1150 * Diagnostic command 'print_interps' prints interpretations in proofs
1151 in addition to interpretations in theories.
1153 * Discontinued obsolete 'global' and 'local' commands to manipulate
1154 the theory name space. Rare INCOMPATIBILITY. The ML functions
1155 Sign.root_path and Sign.local_path may be applied directly where this
1156 feature is still required for historical reasons.
1158 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1159 'definition' instead.
1161 * The "prems" fact, which refers to the accidental collection of
1162 foundational premises in the context, is now explicitly marked as
1163 legacy feature and will be discontinued soon. Consider using "assms"
1164 of the head statement or reference facts by explicit names.
1166 * Document antiquotations @{class} and @{type} print classes and type
1169 * Document antiquotation @{file} checks file/directory entries within
1170 the local file system.
1175 * Coercive subtyping: functions can be declared as coercions and type
1176 inference will add them as necessary upon input of a term. Theory
1177 Complex_Main declares real :: nat => real and real :: int => real as
1178 coercions. A coercion function f is declared like this:
1180 declare [[coercion f]]
1182 To lift coercions through type constructors (e.g. from nat => real to
1183 nat list => real list), map functions can be declared, e.g.
1185 declare [[coercion_map map]]
1187 Currently coercion inference is activated only in theories including
1188 real numbers, i.e. descendants of Complex_Main. This is controlled by
1189 the configuration option "coercion_enabled", e.g. it can be enabled in
1190 other theories like this:
1192 declare [[coercion_enabled]]
1194 * Command 'partial_function' provides basic support for recursive
1195 function definitions over complete partial orders. Concrete instances
1196 are provided for i) the option type, ii) tail recursion on arbitrary
1197 types, and iii) the heap monad of Imperative_HOL. See
1198 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1201 * Function package: f.psimps rules are no longer implicitly declared
1202 as [simp]. INCOMPATIBILITY.
1204 * Datatype package: theorems generated for executable equality (class
1205 "eq") carry proper names and are treated as default code equations.
1207 * Inductive package: now offers command 'inductive_simps' to
1208 automatically derive instantiated and simplified equations for
1209 inductive predicates, similar to 'inductive_cases'.
1211 * Command 'enriched_type' allows to register properties of the
1212 functorial structure of types.
1214 * Improved infrastructure for term evaluation using code generator
1215 techniques, in particular static evaluation conversions.
1217 * Code generator: Scala (2.8 or higher) has been added to the target
1220 * Code generator: globbing constant expressions "*" and "Theory.*"
1221 have been replaced by the more idiomatic "_" and "Theory._".
1224 * Code generator: export_code without explicit file declaration prints
1225 to standard output. INCOMPATIBILITY.
1227 * Code generator: do not print function definitions for case
1228 combinators any longer.
1230 * Code generator: simplification with rules determined with
1231 src/Tools/Code/code_simp.ML and method "code_simp".
1233 * Code generator for records: more idiomatic representation of record
1234 types. Warning: records are not covered by ancient SML code
1235 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1236 rep_datatype declaration helps to succeed then:
1240 rep_datatype foo_ext ...
1242 * Records: logical foundation type for records does not carry a
1243 '_type' suffix any longer (obsolete due to authentic syntax).
1246 * Quickcheck now by default uses exhaustive testing instead of random
1247 testing. Random testing can be invoked by "quickcheck [random]",
1248 exhaustive testing by "quickcheck [exhaustive]".
1250 * Quickcheck instantiates polymorphic types with small finite
1251 datatypes by default. This enables a simple execution mechanism to
1252 handle quantifiers and function equality over the finite datatypes.
1254 * Quickcheck random generator has been renamed from "code" to
1255 "random". INCOMPATIBILITY.
1257 * Quickcheck now has a configurable time limit which is set to 30
1258 seconds by default. This can be changed by adding [timeout = n] to the
1259 quickcheck command. The time limit for Auto Quickcheck is still set
1262 * Quickcheck in locales considers interpretations of that locale for
1263 counter example search.
1266 - Added "smt" and "remote_smt" provers based on the "smt" proof
1267 method. See the Sledgehammer manual for details ("isabelle doc
1270 sledgehammer atp_info ~> sledgehammer running_provers
1271 sledgehammer atp_kill ~> sledgehammer kill_provers
1272 sledgehammer available_atps ~> sledgehammer available_provers
1275 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1276 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1277 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1278 (and "ms" and "min" are no longer supported)
1283 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1284 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1286 - Added support for partial quotient types.
1287 - Added local versions of the "Nitpick.register_xxx" functions.
1288 - Added "whack" option.
1289 - Allow registration of quotient types as codatatypes.
1290 - Improved "merge_type_vars" option to merge more types.
1291 - Removed unsound "fast_descrs" option.
1292 - Added custom symmetry breaking for datatypes, making it possible to reach
1293 higher cardinalities.
1294 - Prevent the expansion of too large definitions.
1296 * Proof methods "metis" and "meson" now have configuration options
1297 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1298 to diagnose these tools. E.g.
1300 using [[metis_trace = true]]
1302 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1303 manually as command 'solve_direct'.
1305 * The default SMT solver Z3 must be enabled explicitly (due to
1306 licensing issues) by setting the environment variable
1307 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1308 commercial applications, the SMT solver CVC3 is provided as fall-back;
1309 changing the SMT solver is done via the configuration option
1312 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1313 i.e. "remote_cvc3" and "remote_z3".
1315 * Added basic SMT support for datatypes, records, and typedefs using
1316 the oracle mode (no proofs). Direct support of pairs has been dropped
1317 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1318 support for a similar behavior). Minor INCOMPATIBILITY.
1320 * Changed SMT configuration options:
1322 z3_proofs ~> smt_oracle (with inverted meaning)
1323 z3_trace_assms ~> smt_trace_used_facts
1336 * Boogie output files (.b2i files) need to be declared in the theory
1339 * Simplification procedure "list_to_set_comprehension" rewrites list
1340 comprehensions applied to List.set to set comprehensions. Occasional
1341 INCOMPATIBILITY, may be deactivated like this:
1343 declare [[simproc del: list_to_set_comprehension]]
1345 * Removed old version of primrec package. INCOMPATIBILITY.
1347 * Removed simplifier congruence rule of "prod_case", as has for long
1348 been the case with "split". INCOMPATIBILITY.
1350 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1352 * Removed [split_format ... and ... and ...] version of
1353 [split_format]. Potential INCOMPATIBILITY.
1355 * Predicate "sorted" now defined inductively, with nice induction
1356 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1358 * Constant "contents" renamed to "the_elem", to free the generic name
1359 contents for other uses. INCOMPATIBILITY.
1361 * Renamed class eq and constant eq (for code generation) to class
1362 equal and constant equal, plus renaming of related facts and various
1363 tuning. INCOMPATIBILITY.
1365 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1367 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1370 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1371 avoid confusion with finite sets. INCOMPATIBILITY.
1373 * Abandoned locales equiv, congruent and congruent2 for equivalence
1374 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1377 * Some previously unqualified names have been qualified:
1384 Trueprop ~> HOL.Trueprop
1389 op --> ~> HOL.implies
1401 Pair ~> Product_Type.Pair
1402 fst ~> Product_Type.fst
1403 snd ~> Product_Type.snd
1404 curry ~> Product_Type.curry
1406 Collect ~> Set.Collect
1410 * More canonical naming convention for some fundamental definitions:
1412 bot_bool_eq ~> bot_bool_def
1413 top_bool_eq ~> top_bool_def
1414 inf_bool_eq ~> inf_bool_def
1415 sup_bool_eq ~> sup_bool_def
1416 bot_fun_eq ~> bot_fun_def
1417 top_fun_eq ~> top_fun_def
1418 inf_fun_eq ~> inf_fun_def
1419 sup_fun_eq ~> sup_fun_def
1423 * More stylized fact names:
1425 expand_fun_eq ~> fun_eq_iff
1426 expand_set_eq ~> set_eq_iff
1428 nat_number ~> eval_nat_numeral
1432 * Refactoring of code-generation specific operations in theory List:
1438 mem_iff ~> member_def
1439 null_empty ~> null_def
1441 INCOMPATIBILITY. Note that these were not supposed to be used
1442 regularly unless for striking reasons; their main purpose was code
1445 Various operations from the Haskell prelude are used for generating
1448 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1449 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1450 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1452 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1453 "*" and "+" respectively. INCOMPATIBILITY.
1455 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1456 "Sum_Type.Plus" instead.
1458 * Constant "split" has been merged with constant "prod_case"; names of
1459 ML functions, facts etc. involving split have been retained so far,
1460 though. INCOMPATIBILITY.
1462 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1463 instead. INCOMPATIBILITY.
1465 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1468 * Former theory Library/Enum is now part of the HOL-Main image.
1469 INCOMPATIBILITY: all constants of the Enum theory now have to be
1470 referred to by its qualified name.
1473 nlists ~> Enum.nlists
1474 product ~> Enum.product
1476 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1477 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1480 * Theory Library/SetsAndFunctions has been split into
1481 Library/Function_Algebras and Library/Set_Algebras; canonical names
1482 for instance definitions for functions; various improvements.
1485 * Theory Library/Multiset provides stable quicksort implementation of
1488 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1491 * Session Multivariate_Analysis: introduced a type class for euclidean
1492 space. Most theorems are now stated in terms of euclidean spaces
1493 instead of finite cartesian products.
1496 real ^ 'n ~> 'a::real_vector
1497 ~> 'a::euclidean_space
1498 ~> 'a::ordered_euclidean_space
1499 (depends on your needs)
1503 \<chi> x. _ ~> \<chi>\<chi> x. _
1506 Also note that the indices are now natural numbers and not from some
1507 finite type. Finite cartesian products of euclidean spaces, products
1508 of euclidean spaces the real and complex numbers are instantiated to
1509 be euclidean_spaces. INCOMPATIBILITY.
1511 * Session Probability: introduced pextreal as positive extended real
1512 numbers. Use pextreal as value for measures. Introduce the
1513 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1514 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1515 the integral in Multivariate Analysis. INCOMPATIBILITY.
1517 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1520 * Session SPARK (with image HOL-SPARK) provides commands to load and
1521 prove verification conditions generated by the SPARK Ada program
1522 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1527 * Theorems for additive ring operations (locale abelian_monoid and
1528 descendants) are generated by interpretation from their multiplicative
1529 counterparts. Names (in particular theorem names) have the mandatory
1530 qualifier 'add'. Previous theorem names are redeclared for
1533 * Structure "int_ring" is now an abbreviation (previously a
1534 definition). This fits more natural with advanced interpretations.
1539 * The domain package now runs in definitional mode by default: The
1540 former command 'new_domain' is now called 'domain'. To use the domain
1541 package in its original axiomatic mode, use 'domain (unsafe)'.
1544 * The new class "domain" is now the default sort. Class "predomain"
1545 is an unpointed version of "domain". Theories can be updated by
1546 replacing sort annotations as shown below. INCOMPATIBILITY.
1548 'a::type ~> 'a::countable
1549 'a::cpo ~> 'a::predomain
1550 'a::pcpo ~> 'a::domain
1552 * The old type class "rep" has been superseded by class "domain".
1553 Accordingly, users of the definitional package must remove any
1554 "default_sort rep" declarations. INCOMPATIBILITY.
1556 * The domain package (definitional mode) now supports unpointed
1557 predomain argument types, as long as they are marked 'lazy'. (Strict
1558 arguments must be in class "domain".) For example, the following
1559 domain definition now works:
1561 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1563 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1564 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1565 'a option, and 'a list. Additionally, it configures fixrec and the
1566 domain package to work with these types. For example:
1568 fixrec isInl :: "('a + 'b) u -> tr"
1569 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1571 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1573 * The "(permissive)" option of fixrec has been replaced with a
1574 per-equation "(unchecked)" option. See
1575 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1577 * The "bifinite" class no longer fixes a constant "approx"; the class
1578 now just asserts that such a function exists. INCOMPATIBILITY.
1580 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1581 defines an embedding of type 'a defl into udom by default; instances
1582 of "bifinite" and "domain" classes are available in
1583 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1585 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1587 * The predicate "directed" has been removed. INCOMPATIBILITY.
1589 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1591 * The function "cprod_map" has been renamed to "prod_map".
1594 * The monadic bind operator on each powerdomain has new binder syntax
1595 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1596 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1598 * The infix syntax for binary union on each powerdomain has changed
1599 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1600 syntax. INCOMPATIBILITY.
1602 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1603 still supported as an input translation.
1605 * Renamed some theorems (the original names are also still available).
1607 expand_fun_below ~> fun_below_iff
1608 below_fun_ext ~> fun_belowI
1609 expand_cfun_eq ~> cfun_eq_iff
1610 ext_cfun ~> cfun_eqI
1611 expand_cfun_below ~> cfun_below_iff
1612 below_cfun_ext ~> cfun_belowI
1613 cont2cont_Rep_CFun ~> cont2cont_APP
1615 * The Abs and Rep functions for various types have changed names.
1616 Related theorem names have also changed to match. INCOMPATIBILITY.
1618 Rep_CFun ~> Rep_cfun
1619 Abs_CFun ~> Abs_cfun
1620 Rep_Sprod ~> Rep_sprod
1621 Abs_Sprod ~> Abs_sprod
1622 Rep_Ssum ~> Rep_ssum
1623 Abs_Ssum ~> Abs_ssum
1625 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1626 been renamed to *_bottom_iff. INCOMPATIBILITY.
1628 * Various changes to bisimulation/coinduction with domain package:
1630 - Definitions of "bisim" constants no longer mention definedness.
1631 - With mutual recursion, "bisim" predicate is now curried.
1632 - With mutual recursion, each type gets a separate coind theorem.
1633 - Variable names in bisim_def and coinduct rules have changed.
1637 * Case combinators generated by the domain package for type "foo" are
1638 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1640 * Several theorems have been renamed to more accurately reflect the
1641 names of constants and types involved. INCOMPATIBILITY.
1643 thelub_const ~> lub_const
1644 lub_const ~> is_lub_const
1646 is_lub_lub ~> is_lubD2
1648 unique_lub ~> is_lub_unique
1649 is_ub_lub ~> is_lub_rangeD1
1650 lub_bin_chain ~> is_lub_bin_chain
1651 lub_fun ~> is_lub_fun
1652 thelub_fun ~> lub_fun
1653 thelub_cfun ~> lub_cfun
1654 thelub_Pair ~> lub_Pair
1655 lub_cprod ~> is_lub_prod
1656 thelub_cprod ~> lub_prod
1657 minimal_cprod ~> minimal_prod
1658 inst_cprod_pcpo ~> inst_prod_pcpo
1660 compact_UU ~> compact_bottom
1661 deflation_UU ~> deflation_bottom
1662 finite_deflation_UU ~> finite_deflation_bottom
1664 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1666 sq_ord_less_eq_trans ~> below_eq_trans
1667 sq_ord_eq_less_trans ~> eq_below_trans
1668 refl_less ~> below_refl
1669 trans_less ~> below_trans
1670 antisym_less ~> below_antisym
1671 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1672 box_less ~> box_below
1673 rev_trans_less ~> rev_below_trans
1674 not_less2not_eq ~> not_below2not_eq
1675 less_UU_iff ~> below_UU_iff
1676 flat_less_iff ~> flat_below_iff
1677 adm_less ~> adm_below
1678 adm_not_less ~> adm_not_below
1679 adm_compact_not_less ~> adm_compact_not_below
1680 less_fun_def ~> below_fun_def
1681 expand_fun_less ~> fun_below_iff
1682 less_fun_ext ~> fun_belowI
1683 less_discr_def ~> below_discr_def
1684 discr_less_eq ~> discr_below_eq
1685 less_unit_def ~> below_unit_def
1686 less_cprod_def ~> below_prod_def
1687 prod_lessI ~> prod_belowI
1688 Pair_less_iff ~> Pair_below_iff
1689 fst_less_iff ~> fst_below_iff
1690 snd_less_iff ~> snd_below_iff
1691 expand_cfun_less ~> cfun_below_iff
1692 less_cfun_ext ~> cfun_belowI
1693 injection_less ~> injection_below
1694 less_up_def ~> below_up_def
1695 not_Iup_less ~> not_Iup_below
1696 Iup_less ~> Iup_below
1698 Def_inject_less_eq ~> Def_below_Def
1699 Def_less_is_eq ~> Def_below_iff
1700 spair_less_iff ~> spair_below_iff
1701 less_sprod ~> below_sprod
1702 spair_less ~> spair_below
1703 sfst_less_iff ~> sfst_below_iff
1704 ssnd_less_iff ~> ssnd_below_iff
1705 fix_least_less ~> fix_least_below
1706 dist_less_one ~> dist_below_one
1707 less_ONE ~> below_ONE
1708 ONE_less_iff ~> ONE_below_iff
1709 less_sinlD ~> below_sinlD
1710 less_sinrD ~> below_sinrD
1715 * All constant names are now qualified internally and use proper
1716 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1721 * Antiquotation @{assert} inlines a function bool -> unit that raises
1722 Fail if the argument is false. Due to inlining the source position of
1723 failed assertions is included in the error output.
1725 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1726 text is in practice always evaluated with a stable theory checkpoint.
1727 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1729 * Antiquotation @{theory A} refers to theory A from the ancestry of
1730 the current context, not any accidental theory loader state as before.
1731 Potential INCOMPATIBILITY, subtle change in semantics.
1733 * Syntax.pretty_priority (default 0) configures the required priority
1734 of pretty-printed output and thus affects insertion of parentheses.
1736 * Syntax.default_root (default "any") configures the inner syntax
1737 category (nonterminal symbol) for parsing of terms.
1739 * Former exception Library.UnequalLengths now coincides with
1740 ListPair.UnequalLengths.
1742 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1743 main functionality is provided by structure Simplifier.
1745 * Renamed raw "explode" function to "raw_explode" to emphasize its
1746 meaning. Note that internally to Isabelle, Symbol.explode is used in
1747 almost all situations.
1749 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1750 See implementation manual for further details on exceptions in
1753 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1756 * Renamed structure PureThy to Pure_Thy and moved most of its
1757 operations to structure Global_Theory, to emphasize that this is
1758 rarely-used global-only stuff.
1760 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1761 instead (or tracing for high-volume output).
1763 * Configuration option show_question_marks only affects regular pretty
1764 printing of types and terms, not raw Term.string_of_vname.
1766 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1767 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1768 @{thms} for most purposes.
1770 * ML structure Unsynchronized is never opened, not even in Isar
1771 interaction mode as before. Old Unsynchronized.set etc. have been
1772 discontinued -- use plain := instead. This should be *rare* anyway,
1773 since modern tools always work via official context data, notably
1774 configuration options.
1776 * Parallel and asynchronous execution requires special care concerning
1777 interrupts. Structure Exn provides some convenience functions that
1778 avoid working directly with raw Interrupt. User code must not absorb
1779 interrupts -- intermediate handling (for cleanup etc.) needs to be
1780 followed by re-raising of the original exception. Another common
1781 source of mistakes are "handle _" patterns, which make the meaning of
1782 the program subject to physical effects of the environment.
1786 New in Isabelle2009-2 (June 2010)
1787 ---------------------------------
1791 * Authentic syntax for *all* logical entities (type classes, type
1792 constructors, term constants): provides simple and robust
1793 correspondence between formal entities and concrete syntax. Within
1794 the parse tree / AST representations, "constants" are decorated by
1795 their category (class, type, const) and spelled out explicitly with
1796 their full internal name.
1798 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1799 and translations (translation rules and translation functions in ML).
1800 Some hints on upgrading:
1802 - Many existing uses of 'syntax' and 'translations' can be replaced
1803 by more modern 'type_notation', 'notation' and 'abbreviation',
1804 which are independent of this issue.
1806 - 'translations' require markup within the AST; the term syntax
1807 provides the following special forms:
1809 CONST c -- produces syntax version of constant c from context
1810 XCONST c -- literally c, checked as constant from context
1811 c -- literally c, if declared by 'syntax'
1813 Plain identifiers are treated as AST variables -- occasionally the
1814 system indicates accidental variables via the error "rhs contains
1817 Type classes and type constructors are marked according to their
1818 concrete syntax. Some old translations rules need to be written
1819 for the "type" category, using type constructor application
1820 instead of pseudo-term application of the default category
1823 - 'parse_translation' etc. in ML may use the following
1826 @{class_syntax c} -- type class c within parse tree / AST
1827 @{term_syntax c} -- type constructor c within parse tree / AST
1828 @{const_syntax c} -- ML version of "CONST c" above
1829 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1831 - Literal types within 'typed_print_translations', i.e. those *not*
1832 represented as pseudo-terms are represented verbatim. Use @{class
1833 c} or @{type_name c} here instead of the above syntax
1836 Note that old non-authentic syntax was based on unqualified base
1837 names, so all of the above "constant" names would coincide. Recall
1838 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1839 diagnose syntax problems.
1841 * Type constructors admit general mixfix syntax, not just infix.
1843 * Concrete syntax may be attached to local entities without a proof
1844 body, too. This works via regular mixfix annotations for 'fix',
1845 'def', 'obtain' etc. or via the explicit 'write' command, which is
1846 similar to the 'notation' command in theory specifications.
1848 * Discontinued unnamed infix syntax (legacy feature for many years) --
1849 need to specify constant name and syntax separately. Internal ML
1850 datatype constructors have been renamed from InfixName to Infix etc.
1851 Minor INCOMPATIBILITY.
1853 * Schematic theorem statements need to be explicitly markup as such,
1854 via commands 'schematic_lemma', 'schematic_theorem',
1855 'schematic_corollary'. Thus the relevance of the proof is made
1856 syntactically clear, which impacts performance in a parallel or
1857 asynchronous interactive environment. Minor INCOMPATIBILITY.
1859 * Use of cumulative prems via "!" in some proof methods has been
1860 discontinued (old legacy feature).
1862 * References 'trace_simp' and 'debug_simp' have been replaced by
1863 configuration options stored in the context. Enabling tracing (the
1864 case of debugging is similar) in proofs works via
1866 using [[trace_simp = true]]
1868 Tracing is then active for all invocations of the simplifier in
1869 subsequent goal refinement steps. Tracing may also still be enabled or
1870 disabled via the ProofGeneral settings menu.
1872 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1873 'hide_fact' replace the former 'hide' KIND command. Minor
1876 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1877 more efficient than combinations with -q1 or -q2.
1882 * Proofterms record type-class reasoning explicitly, using the
1883 "unconstrain" operation internally. This eliminates all sort
1884 constraints from a theorem and proof, introducing explicit
1885 OFCLASS-premises. On the proof term level, this operation is
1886 automatically applied at theorem boundaries, such that closed proofs
1887 are always free of sort constraints. INCOMPATIBILITY for tools that
1888 inspect proof terms.
1890 * Local theory specifications may depend on extra type variables that
1891 are not present in the result type -- arguments TYPE('a) :: 'a itself
1892 are added internally. For example:
1894 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1896 * Predicates of locales introduced by classes carry a mandatory
1897 "class" prefix. INCOMPATIBILITY.
1899 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1901 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1904 * Command 'code_reflect' allows to incorporate generated ML code into
1905 runtime environment; replaces immature code_datatype antiquotation.
1908 * Code generator: simple concept for abstract datatypes obeying
1911 * Code generator: details of internal data cache have no impact on the
1912 user space functionality any longer.
1914 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1915 subgoals. This is more appropriate for interpretations with 'where'.
1918 * Command 'example_proof' opens an empty proof body. This allows to
1919 experiment with Isar, without producing any persistent result.
1921 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1922 within a local theory context, with explicit checking of the
1923 constructors involved (in contrast to the raw 'syntax' versions).
1925 * Commands 'types' and 'typedecl' now work within a local theory
1926 context -- without introducing dependencies on parameters or
1927 assumptions, which is not possible in Isabelle/Pure.
1929 * Command 'defaultsort' has been renamed to 'default_sort', it works
1930 within a local theory context. Minor INCOMPATIBILITY.
1935 * Command 'typedef' now works within a local theory context -- without
1936 introducing dependencies on parameters or assumptions, which is not
1937 possible in Isabelle/Pure/HOL. Note that the logical environment may
1938 contain multiple interpretations of local typedefs (with different
1939 non-emptiness proofs), even in a global theory context.
1941 * New package for quotient types. Commands 'quotient_type' and
1942 'quotient_definition' may be used for defining types and constants by
1943 quotient constructions. An example is the type of integers created by
1944 quotienting pairs of natural numbers:
1947 intrel :: "(nat * nat) => (nat * nat) => bool"
1949 "intrel (x, y) (u, v) = (x + v = u + y)"
1951 quotient_type int = "nat * nat" / intrel
1952 by (auto simp add: equivp_def expand_fun_eq)
1955 "0::int" is "(0::nat, 0::nat)"
1957 The method "lifting" can be used to lift of theorems from the
1958 underlying "raw" type to the quotient type. The example
1959 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1960 construction and provides a reasoning infrastructure for finite sets.
1962 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1963 clash with new theory Quotient in Main HOL.
1965 * Moved the SMT binding into the main HOL session, eliminating
1966 separate HOL-SMT session.
1968 * List membership infix mem operation is only an input abbreviation.
1971 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1972 for future developements; former Library/Word.thy is still present in
1973 the AFP entry RSAPPS.
1975 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1976 longer shadowed. INCOMPATIBILITY.
1978 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1981 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1984 * Dropped normalizing_semiring etc; use the facts in semiring classes
1985 instead. INCOMPATIBILITY.
1987 * Dropped several real-specific versions of lemmas about floor and
1988 ceiling; use the generic lemmas from theory "Archimedean_Field"
1989 instead. INCOMPATIBILITY.
1991 floor_number_of_eq ~> floor_number_of
1992 le_floor_eq_number_of ~> number_of_le_floor
1993 le_floor_eq_zero ~> zero_le_floor
1994 le_floor_eq_one ~> one_le_floor
1995 floor_less_eq_number_of ~> floor_less_number_of
1996 floor_less_eq_zero ~> floor_less_zero
1997 floor_less_eq_one ~> floor_less_one
1998 less_floor_eq_number_of ~> number_of_less_floor
1999 less_floor_eq_zero ~> zero_less_floor
2000 less_floor_eq_one ~> one_less_floor
2001 floor_le_eq_number_of ~> floor_le_number_of
2002 floor_le_eq_zero ~> floor_le_zero
2003 floor_le_eq_one ~> floor_le_one
2004 floor_subtract_number_of ~> floor_diff_number_of
2005 floor_subtract_one ~> floor_diff_one
2006 ceiling_number_of_eq ~> ceiling_number_of
2007 ceiling_le_eq_number_of ~> ceiling_le_number_of
2008 ceiling_le_zero_eq ~> ceiling_le_zero
2009 ceiling_le_eq_one ~> ceiling_le_one
2010 less_ceiling_eq_number_of ~> number_of_less_ceiling
2011 less_ceiling_eq_zero ~> zero_less_ceiling
2012 less_ceiling_eq_one ~> one_less_ceiling
2013 ceiling_less_eq_number_of ~> ceiling_less_number_of
2014 ceiling_less_eq_zero ~> ceiling_less_zero
2015 ceiling_less_eq_one ~> ceiling_less_one
2016 le_ceiling_eq_number_of ~> number_of_le_ceiling
2017 le_ceiling_eq_zero ~> zero_le_ceiling
2018 le_ceiling_eq_one ~> one_le_ceiling
2019 ceiling_subtract_number_of ~> ceiling_diff_number_of
2020 ceiling_subtract_one ~> ceiling_diff_one
2022 * Theory "Finite_Set": various folding_XXX locales facilitate the
2023 application of the various fold combinators on finite sets.
2025 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2026 provides abstract red-black tree type which is backed by "RBT_Impl" as
2027 implementation. INCOMPATIBILTY.
2029 * Theory Library/Coinductive_List has been removed -- superseded by
2030 AFP/thys/Coinductive.
2032 * Theory PReal, including the type "preal" and related operations, has
2033 been removed. INCOMPATIBILITY.
2035 * Real: new development using Cauchy Sequences.
2037 * Split off theory "Big_Operators" containing setsum, setprod,
2038 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2040 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2041 "Int" etc. INCOMPATIBILITY.
2043 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2045 * New set of rules "ac_simps" provides combined assoc / commute
2046 rewrites for all interpretations of the appropriate generic locales.
2048 * Renamed theory "OrderedGroup" to "Groups" and split theory
2049 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2050 appropriate and more consistent names suitable for name prefixes
2051 within the HOL theories. INCOMPATIBILITY.
2053 * Some generic constants have been put to appropriate theories:
2054 - less_eq, less: Orderings
2055 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2056 - inverse, divide: Rings
2059 * More consistent naming of type classes involving orderings (and
2062 lower_semilattice ~> semilattice_inf
2063 upper_semilattice ~> semilattice_sup
2065 dense_linear_order ~> dense_linorder
2067 pordered_ab_group_add ~> ordered_ab_group_add
2068 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2069 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2070 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2071 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2072 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2073 pordered_cancel_semiring ~> ordered_cancel_semiring
2074 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2075 pordered_comm_ring ~> ordered_comm_ring
2076 pordered_comm_semiring ~> ordered_comm_semiring
2077 pordered_ring ~> ordered_ring
2078 pordered_ring_abs ~> ordered_ring_abs
2079 pordered_semiring ~> ordered_semiring
2081 ordered_ab_group_add ~> linordered_ab_group_add
2082 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2083 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2084 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2085 ordered_field ~> linordered_field
2086 ordered_field_no_lb ~> linordered_field_no_lb
2087 ordered_field_no_ub ~> linordered_field_no_ub
2088 ordered_field_dense_linear_order ~> dense_linordered_field
2089 ordered_idom ~> linordered_idom
2090 ordered_ring ~> linordered_ring
2091 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2092 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2093 ordered_ring_strict ~> linordered_ring_strict
2094 ordered_semidom ~> linordered_semidom
2095 ordered_semiring ~> linordered_semiring
2096 ordered_semiring_1 ~> linordered_semiring_1
2097 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2098 ordered_semiring_strict ~> linordered_semiring_strict
2100 The following slightly odd type classes have been moved to a
2101 separate theory Library/Lattice_Algebras:
2103 lordered_ab_group_add ~> lattice_ab_group_add
2104 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2105 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2106 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2107 lordered_ring ~> lattice_ring
2111 * Refined field classes:
2112 - classes division_ring_inverse_zero, field_inverse_zero,
2113 linordered_field_inverse_zero include rule inverse 0 = 0 --
2114 subsumes former division_by_zero class;
2115 - numerous lemmas have been ported from field to division_ring.
2118 * Refined algebra theorem collections:
2119 - dropped theorem group group_simps, use algebra_simps instead;
2120 - dropped theorem group ring_simps, use field_simps instead;
2121 - proper theorem collection field_simps subsumes former theorem
2122 groups field_eq_simps and field_simps;
2123 - dropped lemma eq_minus_self_iff which is a duplicate for
2127 * Theory Finite_Set and List: some lemmas have been generalized from
2130 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2131 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2132 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2133 union_Union_fold_union ~> sup_Sup_fold_sup
2134 Inter_fold_inter ~> Inf_fold_inf
2135 Union_fold_union ~> Sup_fold_sup
2136 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2137 union_UNION_fold_union ~> sup_SUPR_fold_sup
2138 INTER_fold_inter ~> INFI_fold_inf
2139 UNION_fold_union ~> SUPR_fold_sup
2141 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2142 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2143 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2144 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2145 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2146 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2148 * Reorganized theory Multiset: swapped notation of pointwise and
2151 - pointwise ordering is instance of class order with standard syntax
2153 - multiset ordering has syntax <=# and <#; partial order properties
2154 are provided by means of interpretation with prefix
2156 - less duplication, less historical organization of sections,
2157 conversion from associations lists to multisets, rudimentary code
2159 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2164 multiset_eq_conv_count_eq ~> multiset_ext_iff
2165 multi_count_ext ~> multiset_ext
2166 diff_union_inverse2 ~> diff_union_cancelR
2170 * Theory Permutation: replaced local "remove" by List.remove1.
2172 * Code generation: ML and OCaml code is decorated with signatures.
2174 * Theory List: added transpose.
2176 * Library/Nat_Bijection.thy is a collection of bijective functions
2177 between nat and other types, which supersedes the older libraries
2178 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2181 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2182 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2183 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2184 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2185 Countable.pair_encode ~> prod_encode
2186 NatIso.prod2nat ~> prod_encode
2187 NatIso.nat2prod ~> prod_decode
2188 NatIso.sum2nat ~> sum_encode
2189 NatIso.nat2sum ~> sum_decode
2190 NatIso.list2nat ~> list_encode
2191 NatIso.nat2list ~> list_decode
2192 NatIso.set2nat ~> set_encode
2193 NatIso.nat2set ~> set_decode
2196 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2197 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2198 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2199 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2200 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2201 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2202 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2203 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2204 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2205 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2206 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2207 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2208 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2211 - Renamed ATP commands:
2212 atp_info ~> sledgehammer running_atps
2213 atp_kill ~> sledgehammer kill_atps
2214 atp_messages ~> sledgehammer messages
2215 atp_minimize ~> sledgehammer minimize
2216 print_atps ~> sledgehammer available_atps
2218 - Added user's manual ("isabelle doc sledgehammer").
2219 - Added option syntax and "sledgehammer_params" to customize
2220 Sledgehammer's behavior. See the manual for details.
2221 - Modified the Isar proof reconstruction code so that it produces
2222 direct proofs rather than proofs by contradiction. (This feature
2223 is still experimental.)
2224 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2226 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2229 - Added and implemented "binary_ints" and "bits" options.
2230 - Added "std" option and implemented support for nonstandard models.
2231 - Added and implemented "finitize" option to improve the precision
2232 of infinite datatypes based on a monotonicity analysis.
2233 - Added support for quotient types.
2234 - Added support for "specification" and "ax_specification"
2236 - Added support for local definitions (for "function" and
2237 "termination" proofs).
2238 - Added support for term postprocessors.
2239 - Optimized "Multiset.multiset" and "FinFun.finfun".
2240 - Improved efficiency of "destroy_constrs" optimization.
2241 - Fixed soundness bugs related to "destroy_constrs" optimization and
2243 - Fixed soundness bug related to higher-order constructors.
2244 - Fixed soundness bug when "full_descrs" is enabled.
2245 - Improved precision of set constructs.
2246 - Added "atoms" option.
2247 - Added cache to speed up repeated Kodkod invocations on the same
2249 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2250 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2251 "SAT4J_Light". INCOMPATIBILITY.
2252 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2253 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2254 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2256 * Method "induct" now takes instantiations of the form t, where t is not
2257 a variable, as a shorthand for "x == t", where x is a fresh variable.
2258 If this is not intended, t has to be enclosed in parentheses.
2259 By default, the equalities generated by definitional instantiations
2260 are pre-simplified, which may cause parameters of inductive cases
2261 to disappear, or may even delete some of the inductive cases.
2262 Use "induct (no_simp)" instead of "induct" to restore the old
2263 behaviour. The (no_simp) option is also understood by the "cases"
2264 and "nominal_induct" methods, which now perform pre-simplification, too.
2270 * Variable names in lemmas generated by the domain package have
2271 changed; the naming scheme is now consistent with the HOL datatype
2272 package. Some proof scripts may be affected, INCOMPATIBILITY.
2274 * The domain package no longer defines the function "foo_copy" for
2275 recursive domain "foo". The reach lemma is now stated directly in
2276 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2277 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2279 * Most definedness lemmas generated by the domain package (previously
2280 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2281 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2282 Proofs that used definedness lemmas as intro rules may break,
2283 potential INCOMPATIBILITY.
2285 * Induction and casedist rules generated by the domain package now
2286 declare proper case_names (one called "bottom", and one named for each
2287 constructor). INCOMPATIBILITY.
2289 * For mutually-recursive domains, separate "reach" and "take_lemma"
2290 rules are generated for each domain, INCOMPATIBILITY.
2292 foo_bar.reach ~> foo.reach bar.reach
2293 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2295 * Some lemmas generated by the domain package have been renamed for
2296 consistency with the datatype package, INCOMPATIBILITY.
2298 foo.ind ~> foo.induct
2299 foo.finite_ind ~> foo.finite_induct
2300 foo.coind ~> foo.coinduct
2301 foo.casedist ~> foo.exhaust
2302 foo.exhaust ~> foo.nchotomy
2304 * For consistency with other definition packages, the fixrec package
2305 now generates qualified theorem names, INCOMPATIBILITY.
2307 foo_simps ~> foo.simps
2308 foo_unfold ~> foo.unfold
2309 foo_induct ~> foo.induct
2311 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2312 method and internal fixrec proofs now use the default simpset instead.
2315 * The "contlub" predicate has been removed. Proof scripts should use
2316 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2318 * The "admw" predicate has been removed, INCOMPATIBILITY.
2320 * The constants cpair, cfst, and csnd have been removed in favor of
2321 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2326 * Antiquotations for basic formal entities:
2328 @{class NAME} -- type class
2329 @{class_syntax NAME} -- syntax representation of the above
2331 @{type_name NAME} -- logical type
2332 @{type_abbrev NAME} -- type abbreviation
2333 @{nonterminal NAME} -- type of concrete syntactic category
2334 @{type_syntax NAME} -- syntax representation of any of the above
2336 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2337 @{const_abbrev NAME} -- abbreviated constant
2338 @{const_syntax NAME} -- syntax representation of any of the above
2340 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2341 syntax constant (cf. 'syntax' command).
2343 * Antiquotation @{make_string} inlines a function to print arbitrary
2344 values similar to the ML toplevel. The result is compiler dependent
2345 and may fall back on "?" in certain situations.
2347 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2348 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2349 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2350 not work with the asynchronous Isar document model.
2352 * Configuration options now admit dynamic default values, depending on
2353 the context or even global references.
2355 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2356 uses an efficient external library if available (for Poly/ML).
2358 * Renamed some important ML structures, while keeping the old names
2359 for some time as aliases within the structure Legacy:
2361 OuterKeyword ~> Keyword
2364 OuterSyntax ~> Outer_Syntax
2365 PrintMode ~> Print_Mode
2366 SpecParse ~> Parse_Spec
2369 ThyOutput ~> Thy_Output
2370 TypeInfer ~> Type_Infer
2372 Note that "open Legacy" simplifies porting of sources, but forgetting
2373 to remove it again will complicate porting again in the future.
2375 * Most operations that refer to a global context are named
2376 accordingly, e.g. Simplifier.global_context or
2377 ProofContext.init_global. There are some situations where a global
2378 context actually works, but under normal circumstances one needs to
2379 pass the proper local context through the code!
2381 * Discontinued old TheoryDataFun with its copy/init operation -- data
2382 needs to be pure. Functor Theory_Data_PP retains the traditional
2383 Pretty.pp argument to merge, which is absent in the standard
2384 Theory_Data version.
2386 * Sorts.certify_sort and derived "cert" operations for types and terms
2387 no longer minimize sorts. Thus certification at the boundary of the
2388 inference kernel becomes invariant under addition of class relations,
2389 which is an important monotonicity principle. Sorts are now minimized
2390 in the syntax layer only, at the boundary between the end-user and the
2391 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2392 explicitly in rare situations.
2394 * Renamed old-style Drule.standard to Drule.export_without_context, to
2395 emphasize that this is in no way a standard operation.
2398 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2399 usual for resolution. Rare INCOMPATIBILITY.
2401 * Renamed varify/unvarify operations to varify_global/unvarify_global
2402 to emphasize that these only work in a global situation (which is
2405 * Curried take and drop in library.ML; negative length is interpreted
2406 as infinity (as in chop). Subtle INCOMPATIBILITY.
2408 * Proof terms: type substitutions on proof constants now use canonical
2409 order of type variables. INCOMPATIBILITY for tools working with proof
2412 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2413 may no longer carry premises. User-level specifications are
2414 transformed accordingly by Thm.add_axiom/add_def.
2419 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2420 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2421 proof terms are enabled unconditionally in the new HOL-Proofs image.
2423 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2424 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2427 * Old lib/scripts/polyml-platform is superseded by the
2428 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2429 variant, even on a 64 bit machine. The following example setting
2430 prefers 64 bit if available:
2432 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2434 * The preliminary Isabelle/jEdit application demonstrates the emerging
2435 Isabelle/Scala layer for advanced prover interaction and integration.
2436 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2439 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2440 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2441 similar to the default assignment of the document preparation system
2442 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2443 provides some operations for direct access to the font without asking
2444 the user for manual installation.
2448 New in Isabelle2009-1 (December 2009)
2449 -------------------------------------
2453 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2454 one backslash should be used, even in ML sources.
2459 * Locale interpretation propagates mixins along the locale hierarchy.
2460 The currently only available mixins are the equations used to map
2461 local definitions to terms of the target domain of an interpretation.
2463 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2464 loc" to print all interpretations of locale "loc" in the theory.
2465 Interpretations in proofs are not shown.
2467 * Thoroughly revised locales tutorial. New section on conditional
2470 * On instantiation of classes, remaining undefined class parameters
2471 are formally declared. INCOMPATIBILITY.
2474 *** Document preparation ***
2476 * New generalized style concept for printing terms: @{foo (style) ...}
2477 instead of @{foo_style style ...} (old form is still retained for
2478 backward compatibility). Styles can be also applied for
2479 antiquotations prop, term_type and typeof.
2484 * New proof method "smt" for a combination of first-order logic with
2485 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2486 fixed-size bitvectors; there is also basic support for higher-order
2487 features (esp. lambda abstractions). It is an incomplete decision
2488 procedure based on external SMT solvers using the oracle mechanism;
2489 for the SMT solver Z3, this method is proof-producing. Certificates
2490 are provided to avoid calling the external solvers solely for
2491 re-checking proofs. Due to a remote SMT service there is no need for
2492 installing SMT solvers locally. See src/HOL/SMT.
2494 * New commands to load and prove verification conditions generated by
2495 the Boogie program verifier or derived systems (e.g. the Verifying C
2496 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2498 * New counterexample generator tool 'nitpick' based on the Kodkod
2499 relational model finder. See src/HOL/Tools/Nitpick and
2500 src/HOL/Nitpick_Examples.
2502 * New commands 'code_pred' and 'values' to invoke the predicate
2503 compiler and to enumerate values of inductive predicates.
2505 * A tabled implementation of the reflexive transitive closure.
2507 * New implementation of quickcheck uses generic code generator;
2508 default generators are provided for all suitable HOL types, records
2509 and datatypes. Old quickcheck can be re-activated importing theory
2510 Library/SML_Quickcheck.
2512 * New testing tool Mirabelle for automated proof tools. Applies
2513 several tools and tactics like sledgehammer, metis, or quickcheck, to
2514 every proof step in a theory. To be used in batch mode via the
2515 "mirabelle" utility.
2517 * New proof method "sos" (sum of squares) for nonlinear real
2518 arithmetic (originally due to John Harison). It requires theory
2519 Library/Sum_Of_Squares. It is not a complete decision procedure but
2520 works well in practice on quantifier-free real arithmetic with +, -,
2521 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2522 inequalities between polynomials. It makes use of external
2523 semidefinite programming solvers. Method "sos" generates a
2524 certificate that can be pasted into the proof thus avoiding the need
2525 to call an external tool every time the proof is checked. See
2526 src/HOL/Library/Sum_Of_Squares.
2528 * New method "linarith" invokes existing linear arithmetic decision
2531 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2533 * New Sledgehammer option "Full Types" in Proof General settings menu.
2534 Causes full type information to be output to the ATPs. This slows
2535 ATPs down considerably but eliminates a source of unsound "proofs"
2538 * New method "metisFT": A version of metis that uses full type
2539 information in order to avoid failures of proof reconstruction.
2541 * New evaluator "approximate" approximates an real valued term using
2542 the same method as the approximation method.
2544 * Method "approximate" now supports arithmetic expressions as
2545 boundaries of intervals and implements interval splitting and Taylor
2548 * ML antiquotation @{code_datatype} inserts definition of a datatype
2549 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2551 * New theory SupInf of the supremum and infimum operators for sets of
2554 * New theory Probability, which contains a development of measure
2555 theory, eventually leading to Lebesgue integration and probability.
2557 * Extended Multivariate Analysis to include derivation and Brouwer's
2560 * Reorganization of number theory, INCOMPATIBILITY:
2561 - new number theory development for nat and int, in theories Divides
2562 and GCD as well as in new session Number_Theory
2563 - some constants and facts now suffixed with _nat and _int
2565 - former session NumberTheory now named Old_Number_Theory, including
2566 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2567 - moved theory Pocklington from src/HOL/Library to
2568 src/HOL/Old_Number_Theory
2570 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2571 lcm of finite and infinite sets. It is shown that they form a complete
2574 * Class semiring_div requires superclass no_zero_divisors and proof of
2575 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2576 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2577 generalized to class semiring_div, subsuming former theorems
2578 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2579 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2582 * Refinements to lattice classes and sets:
2583 - less default intro/elim rules in locale variant, more default
2584 intro/elim rules in class variant: more uniformity
2585 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2587 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2589 - renamed ACI to inf_sup_aci
2590 - new class "boolean_algebra"
2591 - class "complete_lattice" moved to separate theory
2592 "Complete_Lattice"; corresponding constants (and abbreviations)
2593 renamed and with authentic syntax:
2594 Set.Inf ~> Complete_Lattice.Inf
2595 Set.Sup ~> Complete_Lattice.Sup
2596 Set.INFI ~> Complete_Lattice.INFI
2597 Set.SUPR ~> Complete_Lattice.SUPR
2598 Set.Inter ~> Complete_Lattice.Inter
2599 Set.Union ~> Complete_Lattice.Union
2600 Set.INTER ~> Complete_Lattice.INTER
2601 Set.UNION ~> Complete_Lattice.UNION
2602 - authentic syntax for
2605 - mere abbreviations:
2608 Set.inter (for inf, formerly Set.Int)
2609 Set.union (for sup, formerly Set.Un)
2610 Complete_Lattice.Inter (for Inf)
2611 Complete_Lattice.Union (for Sup)
2612 Complete_Lattice.INTER (for INFI)
2613 Complete_Lattice.UNION (for SUPR)
2614 - object-logic definitions as far as appropriate
2616 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2617 Un_subset_iff are explicitly deleted as default simp rules; then also
2618 their lattice counterparts le_inf_iff and le_sup_iff have to be
2619 deleted to achieve the desired effect.
2621 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2622 rules by default any longer; the same applies to min_max.inf_absorb1
2623 etc. INCOMPATIBILITY.
2625 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2626 pred_set_conv by default. INCOMPATIBILITY.
2628 * Power operations on relations and functions are now one dedicated
2629 constant "compow" with infix syntax "^^". Power operation on
2630 multiplicative monoids retains syntax "^" and is now defined generic
2631 in class power. INCOMPATIBILITY.
2633 * Relation composition "R O S" now has a more standard argument order:
2634 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2635 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2636 break, since the O_assoc rule was not rewritten like this. Fix using
2637 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2639 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2640 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2643 * Most rules produced by inductive and datatype package have mandatory
2644 prefixes. INCOMPATIBILITY.
2646 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2647 the attribute of the same name. Each of the theorems in the list
2648 DERIV_intros assumes composition with an additional function and
2649 matches a variable to the derivative, which has to be solved by the
2650 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2651 of most elementary terms. Former Maclauren.DERIV_tac and
2652 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2655 * Code generator attributes follow the usual underscore convention:
2656 code_unfold replaces code unfold
2657 code_post replaces code post
2662 sizechange -> size_change
2663 induct_scheme -> induction_schema
2666 * Discontinued abbreviation "arbitrary" of constant "undefined".
2667 INCOMPATIBILITY, use "undefined" directly.
2670 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2671 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2672 Suc_plus1 -> Suc_eq_plus1
2673 *anti_sym -> *antisym*
2674 vector_less_eq_def -> vector_le_def
2677 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2680 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2686 * Theory Representable defines a class "rep" of domains that are
2687 representable (via an ep-pair) in the universal domain type "udom".
2688 Instances are provided for all type constructors defined in HOLCF.
2690 * The 'new_domain' command is a purely definitional version of the
2691 domain package, for representable domains. Syntax is identical to the
2692 old domain package. The 'new_domain' package also supports indirect
2693 recursion using previously-defined type constructors. See
2694 src/HOLCF/ex/New_Domain.thy for examples.
2696 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2697 on the left-hand side of an equation, and then performs
2698 simplification. Rewriting is done using rules declared with the
2699 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2700 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2702 * The pattern-match compiler in 'fixrec' can now handle constructors
2703 with HOL function types. Pattern-match combinators for the Pair
2704 constructor are pre-configured.
2706 * The 'fixrec' package now produces better fixed-point induction rules
2707 for mutually-recursive definitions: Induction rules have conclusions
2708 of the form "P foo bar" instead of "P <foo, bar>".
2710 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2711 been renamed to "below". The name "below" now replaces "less" in many
2712 theorem names. (Legacy theorem names using "less" are still supported
2715 * The 'fixrec' package now supports "bottom patterns". Bottom
2716 patterns can be used to generate strictness rules, or to make
2717 functions more strict (much like the bang-patterns supported by the
2718 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2724 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2725 errors and run-time exceptions, including detailed source positions.
2727 * Structure Name_Space (formerly NameSpace) now manages uniquely
2728 identified entries, with some additional information such as source
2729 position, logical grouping etc.
2731 * Theory and context data is now introduced by the simplified and
2732 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2733 to be pure, but the old TheoryDataFun for mutable data (with explicit
2734 copy operation) is still available for some time.
2736 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2737 provides a high-level programming interface to synchronized state
2738 variables with atomic update. This works via pure function
2739 application within a critical section -- its runtime should be as
2740 short as possible; beware of deadlocks if critical code is nested,
2741 either directly or indirectly via other synchronized variables!
2743 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2744 wraps raw ML references, explicitly indicating their non-thread-safe
2745 behaviour. The Isar toplevel keeps this structure open, to
2746 accommodate Proof General as well as quick and dirty interactive
2747 experiments with references.
2749 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2750 parallel tactical reasoning.
2752 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2753 are similar to SUBPROOF, but are slightly more flexible: only the
2754 specified parts of the subgoal are imported into the context, and the
2755 body tactic may introduce new subgoals and schematic variables.
2757 * Old tactical METAHYPS, which does not observe the proof context, has
2758 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2759 or Subgoal.FOCUS etc.
2761 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2762 functors have their own ML name space there is no point to mark them
2763 separately.) Minor INCOMPATIBILITY.
2765 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2767 * Renamed several structures FooBar to Foo_Bar. Occasional,
2770 * Operations of structure Skip_Proof no longer require quick_and_dirty
2771 mode, which avoids critical setmp.
2773 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2774 combinators for "args". INCOMPATIBILITY, need to use simplified
2775 Attrib/Method.setup introduced in Isabelle2009.
2777 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2778 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2779 last resort. INCOMPATIBILITY.
2781 * Display.pretty_thm now requires a proper context (cf. former
2782 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2783 or even Display.pretty_thm_without_context as last resort.
2786 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2787 Syntax.pretty_typ/term directly, preferably with proper context
2788 instead of global theory.
2793 * Further fine tuning of parallel proof checking, scales up to 8 cores
2794 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2797 * Support for additional "Isabelle components" via etc/components, see
2798 also the system manual.
2800 * The isabelle makeall tool now operates on all components with
2801 IsaMakefile, not just hardwired "logics".
2803 * Removed "compress" option from isabelle-process and isabelle usedir;
2804 this is always enabled.
2806 * Discontinued support for Poly/ML 4.x versions.
2808 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2809 on a given logic image. This requires the lighttpd webserver and is
2810 currently supported on Linux only.
2814 New in Isabelle2009 (April 2009)
2815 --------------------------------
2819 * Simplified main Isabelle executables, with less surprises on
2820 case-insensitive file-systems (such as Mac OS).
2822 - The main Isabelle tool wrapper is now called "isabelle" instead of
2825 - The former "isabelle" alias for "isabelle-process" has been
2826 removed (should rarely occur to regular users).
2828 - The former "isabelle-interface" and its alias "Isabelle" have been
2829 removed (interfaces are now regular Isabelle tools).
2831 Within scripts and make files, the Isabelle environment variables
2832 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2833 respectively. (The latter are still available as legacy feature.)
2835 The old isabelle-interface wrapper could react in confusing ways if
2836 the interface was uninstalled or changed otherwise. Individual
2837 interface tool configuration is now more explicit, see also the
2838 Isabelle system manual. In particular, Proof General is now available
2839 via "isabelle emacs".
2841 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2842 purge installed copies of Isabelle executables and re-run "isabelle
2843 install -p ...", or use symlinks.
2845 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2846 old ~/isabelle, which was slightly non-standard and apt to cause
2847 surprises on case-insensitive file-systems (such as Mac OS).
2849 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2850 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2851 care is required when using older releases of Isabelle. Note that
2852 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2853 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2855 * Proofs of fully specified statements are run in parallel on
2856 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2857 a regular 4-core machine, if the initial heap space is made reasonably
2858 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2860 * The main reference manuals ("isar-ref", "implementation", and
2861 "system") have been updated and extended. Formally checked references
2862 as hyperlinks are now available uniformly.
2867 * Complete re-implementation of locales. INCOMPATIBILITY in several
2868 respects. The most important changes are listed below. See the
2869 Tutorial on Locales ("locales" manual) for details.
2871 - In locale expressions, instantiation replaces renaming. Parameters
2872 must be declared in a for clause. To aid compatibility with previous
2873 parameter inheritance, in locale declarations, parameters that are not
2874 'touched' (instantiation position "_" or omitted) are implicitly added
2875 with their syntax at the beginning of the for clause.
2877 - Syntax from abbreviations and definitions in locales is available in
2878 locale expressions and context elements. The latter is particularly
2879 useful in locale declarations.
2881 - More flexible mechanisms to qualify names generated by locale
2882 expressions. Qualifiers (prefixes) may be specified in locale
2883 expressions, and can be marked as mandatory (syntax: "name!:") or
2884 optional (syntax "name?:"). The default depends for plain "name:"
2885 depends on the situation where a locale expression is used: in
2886 commands 'locale' and 'sublocale' prefixes are optional, in
2887 'interpretation' and 'interpret' prefixes are mandatory. The old
2888 implicit qualifiers derived from the parameter names of a locale are
2889 no longer generated.
2891 - Command "sublocale l < e" replaces "interpretation l < e". The
2892 instantiation clause in "interpretation" and "interpret" (square
2893 brackets) is no longer available. Use locale expressions.
2895 - When converting proof scripts, mandatory qualifiers in
2896 'interpretation' and 'interpret' should be retained by default, even
2897 if this is an INCOMPATIBILITY compared to former behavior. In the
2898 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2899 in locale expressions range over a single locale instance only.
2901 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2902 In existing theorem specifications replace the includes element by the
2903 respective context elements of the included locale, omitting those
2904 that are already present in the theorem specification. Multiple
2905 assume elements of a locale should be replaced by a single one
2906 involving the locale predicate. In the proof body, declarations (most
2907 notably theorems) may be regained by interpreting the respective
2908 locales in the proof context as required (command "interpret").
2910 If using "includes" in replacement of a target solely because the
2911 parameter types in the theorem are not as general as in the target,
2912 consider declaring a new locale with additional type constraints on
2913 the parameters (context element "constrains").
2915 - Discontinued "locale (open)". INCOMPATIBILITY.
2917 - Locale interpretation commands no longer attempt to simplify goal.
2918 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2919 methods intro_locales and unfold_locales to clarify.
2921 - Locale interpretation commands no longer accept interpretation
2922 attributes. INCOMPATIBILITY.
2924 * Class declaration: so-called "base sort" must not be given in import
2925 list any longer, but is inferred from the specification. Particularly
2932 class foo = type + ...
2934 * Class target: global versions of theorems stemming do not carry a
2935 parameter prefix any longer. INCOMPATIBILITY.
2937 * Class 'instance' command no longer accepts attached definitions.
2938 INCOMPATIBILITY, use proper 'instantiation' target instead.
2940 * Recovered hiding of consts, which was accidentally broken in
2941 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2942 makes c inaccessible; consider using ``hide (open) const c'' instead.
2944 * Slightly more coherent Pure syntax, with updated documentation in
2945 isar-ref manual. Removed locales meta_term_syntax and
2946 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2947 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2948 directly in regular applications.
2950 * There is a new syntactic category "float_const" for signed decimal
2951 fractions (e.g. 123.45 or -123.45).
2953 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2954 interface with 'setup' command instead.
2956 * Command 'local_setup' is similar to 'setup', but operates on a local
2959 * The 'axiomatization' command now only works within a global theory
2960 context. INCOMPATIBILITY.
2962 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2963 hypotheses. Sorts required in the course of reasoning need to be
2964 covered by the constraints in the initial statement, completed by the
2965 type instance information of the background theory. Non-trivial sort
2966 hypotheses, which rarely occur in practice, may be specified via
2967 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2969 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2971 The result contains an implicit sort hypotheses as before --
2972 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2975 * Generalized Isar history, with support for linear undo, direct state
2978 * Changed defaults for unify configuration options:
2980 unify_trace_bound = 50 (formerly 25)
2981 unify_search_bound = 60 (formerly 30)
2983 * Different bookkeeping for code equations (INCOMPATIBILITY):
2985 a) On theory merge, the last set of code equations for a particular
2986 constant is taken (in accordance with the policy applied by other
2987 parts of the code generator framework).
2989 b) Code equations stemming from explicit declarations (e.g. code
2990 attribute) gain priority over default code equations stemming
2991 from definition, primrec, fun etc.
2993 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2995 * Unified theorem tables for both code generators. Thus [code
2996 func] has disappeared and only [code] remains. INCOMPATIBILITY.
2998 * Command 'find_consts' searches for constants based on type and name
3001 find_consts "_ => bool"
3003 By default, matching is against subtypes, but it may be restricted to
3004 the whole type. Searching by name is possible. Multiple queries are
3005 conjunctive and queries may be negated by prefixing them with a
3008 find_consts strict: "_ => bool" name: "Int" -"int => int"
3010 * New 'find_theorems' criterion "solves" matches theorems that
3011 directly solve the current goal (modulo higher-order unification).
3013 * Auto solve feature for main theorem statements: whenever a new goal
3014 is stated, "find_theorems solves" is called; any theorems that could
3015 solve the lemma directly are listed as part of the goal state.
3016 Cf. associated options in Proof General Isabelle settings menu,
3017 enabled by default, with reasonable timeout for pathological cases of
3018 higher-order unification.
3021 *** Document preparation ***
3023 * Antiquotation @{lemma} now imitates a regular terminal proof,
3024 demanding keyword 'by' and supporting the full method expression
3025 syntax just like the Isar command 'by'.
3030 * Integrated main parts of former image HOL-Complex with HOL. Entry
3031 points Main and Complex_Main remain as before.
3033 * Logic image HOL-Plain provides a minimal HOL with the most important
3034 tools available (inductive, datatype, primrec, ...). This facilitates
3035 experimentation and tool development. Note that user applications
3036 (and library theories) should never refer to anything below theory
3039 * Logic image HOL-Main stops at theory Main, and thus facilitates
3040 experimentation due to shorter build times.
3042 * Logic image HOL-NSA contains theories of nonstandard analysis which
3043 were previously part of former HOL-Complex. Entry point Hyperreal
3044 remains valid, but theories formerly using Complex_Main should now use
3045 new entry point Hypercomplex.
3047 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3048 Posix processes. Avoids potentially expensive forking of the ML
3049 process. New thread-based implementation also works on non-Unix
3050 platforms (Cygwin). Provers are no longer hardwired, but defined
3051 within the theory via plain ML wrapper functions. Basic Sledgehammer
3052 commands are covered in the isar-ref manual.
3054 * Wrapper scripts for remote SystemOnTPTP service allows to use
3055 sledgehammer without local ATP installation (Vampire etc.). Other
3056 provers may be included via suitable ML wrappers, see also
3057 src/HOL/ATP_Linkup.thy.
3059 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3062 * The metis method no longer fails because the theorem is too trivial
3063 (contains the empty clause).
3065 * The metis method now fails in the usual manner, rather than raising
3066 an exception, if it determines that it cannot prove the theorem.
3068 * Method "coherent" implements a prover for coherent logic (see also
3069 src/Tools/coherent.ML).
3071 * Constants "undefined" and "default" replace "arbitrary". Usually
3072 "undefined" is the right choice to replace "arbitrary", though
3073 logically there is no difference. INCOMPATIBILITY.
3075 * Command "value" now integrates different evaluation mechanisms. The
3076 result of the first successful evaluation mechanism is printed. In
3077 square brackets a particular named evaluation mechanisms may be
3078 specified (currently, [SML], [code] or [nbe]). See further
3079 src/HOL/ex/Eval_Examples.thy.
3081 * Normalization by evaluation now allows non-leftlinear equations.
3082 Declare with attribute [code nbe].
3084 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3085 as the structured Isar versions "cases" and "induct", cf. the
3086 corresponding "cases" and "induct" attributes. Mutual induction rules
3087 are now presented as a list of individual projections
3088 (e.g. foo_bar.inducts for types foo and bar); the old format with
3089 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3090 rare situations a different rule is selected --- notably nested tuple
3091 elimination instead of former prod.exhaust: use explicit (case_tac t
3092 rule: prod.exhaust) here.
3094 * Attributes "cases", "induct", "coinduct" support "del" option.
3096 * Removed fact "case_split_thm", which duplicates "case_split".
3098 * The option datatype has been moved to a new theory Option. Renamed
3099 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3101 * New predicate "strict_mono" classifies strict functions on partial
3102 orders. With strict functions on linear orders, reasoning about
3103 (in)equalities is facilitated by theorems "strict_mono_eq",
3104 "strict_mono_less_eq" and "strict_mono_less".
3106 * Some set operations are now proper qualified constants with
3107 authentic syntax. INCOMPATIBILITY:
3118 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3121 * Auxiliary class "itself" has disappeared -- classes without any
3122 parameter are treated as expected by the 'class' command.
3124 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3126 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3127 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3129 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3130 method "approximation". It proves formulas on real values by using
3131 interval arithmetic. In the formulas are also the transcendental
3132 functions sin, cos, tan, atan, ln, exp and the constant pi are
3133 allowed. For examples see
3134 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3136 * Theory "Reflection" now resides in HOL/Library.
3138 * Entry point to Word library now simply named "Word".
3141 * Made source layout more coherent with logical distribution
3144 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3145 src/HOL/Library/Code_Message.thy ~> src/HOL/
3146 src/HOL/Library/GCD.thy ~> src/HOL/
3147 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3148 src/HOL/Library/Parity.thy ~> src/HOL/
3149 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3150 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3151 src/HOL/Real/Lubs.thy ~> src/HOL/
3152 src/HOL/Real/PReal.thy ~> src/HOL/
3153 src/HOL/Real/Rational.thy ~> src/HOL/
3154 src/HOL/Real/RComplete.thy ~> src/HOL/
3155 src/HOL/Real/RealDef.thy ~> src/HOL/
3156 src/HOL/Real/RealPow.thy ~> src/HOL/
3157 src/HOL/Real/Real.thy ~> src/HOL/
3158 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3159 src/HOL/Complex/Complex.thy ~> src/HOL/
3160 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3161 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3162 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3163 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3164 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3165 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3166 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3167 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3168 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3169 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3170 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3171 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3172 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3173 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3174 src/HOL/Real/Float ~> src/HOL/Library/
3175 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3176 src/HOL/Real/RealVector.thy ~> src/HOL/
3178 src/HOL/arith_data.ML ~> src/HOL/Tools
3179 src/HOL/hologic.ML ~> src/HOL/Tools
3180 src/HOL/simpdata.ML ~> src/HOL/Tools
3181 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3182 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3183 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3184 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3185 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3186 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3187 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3189 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3190 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3191 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3192 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3193 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3194 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3196 * If methods "eval" and "evaluation" encounter a structured proof
3197 state with !!/==>, only the conclusion is evaluated to True (if
3198 possible), avoiding strange error messages.
3200 * Method "sizechange" automates termination proofs using (a
3201 modification of) the size-change principle. Requires SAT solver. See
3202 src/HOL/ex/Termination.thy for examples.
3204 * Simplifier: simproc for let expressions now unfolds if bound
3205 variable occurs at most once in let expression body. INCOMPATIBILITY.
3207 * Method "arith": Linear arithmetic now ignores all inequalities when
3208 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3210 * New attribute "arith" for facts that should always be used
3211 automatically by arithmetic. It is intended to be used locally in
3214 assumes [arith]: "x > 0"
3216 Global usage is discouraged because of possible performance impact.
3218 * New classes "top" and "bot" with corresponding operations "top" and
3219 "bot" in theory Orderings; instantiation of class "complete_lattice"
3220 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3222 * Changed definition lemma "less_fun_def" in order to provide an
3223 instance for preorders on functions; use lemma "less_le" instead.
3226 * Theory Orderings: class "wellorder" moved here, with explicit
3227 induction rule "less_induct" as assumption. For instantiation of
3228 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3231 * Theory Orderings: added class "preorder" as superclass of "order".
3232 INCOMPATIBILITY: Instantiation proofs for order, linorder
3233 etc. slightly changed. Some theorems named order_class.* now named
3236 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3239 * Theory Finite_Set: added a new fold combinator of type
3241 ('a => 'b => 'b) => 'b => 'a set => 'b
3243 Occasionally this is more convenient than the old fold combinator
3244 which is now defined in terms of the new one and renamed to
3247 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3248 and "ring_simps" have been replaced by "algebra_simps" (which can be
3249 extended with further lemmas!). At the moment both still exist but
3250 the former will disappear at some point.
3252 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3253 class recpower. Type-specific simp rules for various recpower types
3254 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3256 rat_power_0 -> power_0
3257 rat_power_Suc -> power_Suc
3258 realpow_0 -> power_0
3259 realpow_Suc -> power_Suc
3260 complexpow_0 -> power_0
3261 complexpow_Suc -> power_Suc
3262 power_poly_0 -> power_0
3263 power_poly_Suc -> power_Suc
3265 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3266 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3267 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3268 of lemmas from Divides has been generalized from nat to class
3269 semiring_div. INCOMPATIBILITY. This involves the following theorem
3270 renames resulting from duplicate elimination:
3272 dvd_def_mod ~> dvd_eq_mod_eq_0
3273 zero_dvd_iff ~> dvd_0_left_iff
3274 dvd_0 ~> dvd_0_right
3275 DIVISION_BY_ZERO_DIV ~> div_by_0
3276 DIVISION_BY_ZERO_MOD ~> mod_by_0
3277 mult_div ~> div_mult_self2_is_id
3278 mult_mod ~> mod_mult_self2_is_0
3280 * Theory IntDiv: removed many lemmas that are instances of class-based
3281 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3282 rename old lemmas as follows:
3284 dvd_diff -> nat_dvd_diff
3285 dvd_zminus_iff -> dvd_minus_iff
3286 mod_add1_eq -> mod_add_eq
3287 mod_mult1_eq -> mod_mult_right_eq
3288 mod_mult1_eq' -> mod_mult_left_eq
3289 mod_mult_distrib_mod -> mod_mult_eq
3290 nat_mod_add_left_eq -> mod_add_left_eq
3291 nat_mod_add_right_eq -> mod_add_right_eq
3292 nat_mod_div_trivial -> mod_div_trivial
3293 nat_mod_mod_trivial -> mod_mod_trivial
3294 zdiv_zadd_self1 -> div_add_self1
3295 zdiv_zadd_self2 -> div_add_self2
3296 zdiv_zmult_self1 -> div_mult_self2_is_id
3297 zdiv_zmult_self2 -> div_mult_self1_is_id
3298 zdvd_triv_left -> dvd_triv_left
3299 zdvd_triv_right -> dvd_triv_right
3300 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3301 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3302 zmod_zadd_left_eq -> mod_add_left_eq
3303 zmod_zadd_right_eq -> mod_add_right_eq
3304 zmod_zadd_self1 -> mod_add_self1
3305 zmod_zadd_self2 -> mod_add_self2
3306 zmod_zadd1_eq -> mod_add_eq
3307 zmod_zdiff1_eq -> mod_diff_eq
3308 zmod_zdvd_zmod -> mod_mod_cancel
3309 zmod_zmod_cancel -> mod_mod_cancel
3310 zmod_zmult_self1 -> mod_mult_self2_is_0
3311 zmod_zmult_self2 -> mod_mult_self1_is_0
3314 zdvd_abs1 -> abs_dvd_iff
3315 zdvd_abs2 -> dvd_abs_iff
3316 zdvd_refl -> dvd_refl
3317 zdvd_trans -> dvd_trans
3318 zdvd_zadd -> dvd_add
3319 zdvd_zdiff -> dvd_diff
3320 zdvd_zminus_iff -> dvd_minus_iff
3321 zdvd_zminus2_iff -> minus_dvd_iff
3322 zdvd_zmultD -> dvd_mult_right
3323 zdvd_zmultD2 -> dvd_mult_left
3324 zdvd_zmult_mono -> mult_dvd_mono
3325 zdvd_0_right -> dvd_0_right
3326 zdvd_0_left -> dvd_0_left_iff
3327 zdvd_1_left -> one_dvd
3328 zminus_dvd_iff -> minus_dvd_iff
3330 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3332 * The real numbers offer decimal input syntax: 12.34 is translated
3333 into 1234/10^2. This translation is not reversed upon output.
3335 * Theory Library/Polynomial defines an abstract type 'a poly of
3336 univariate polynomials with coefficients of type 'a. In addition to
3337 the standard ring operations, it also supports div and mod. Code
3338 generation is also supported, using list-style constructors.
3340 * Theory Library/Inner_Product defines a class of real_inner for real
3341 inner product spaces, with an overloaded operation inner :: 'a => 'a
3342 => real. Class real_inner is a subclass of real_normed_vector from
3345 * Theory Library/Product_Vector provides instances for the product
3346 type 'a * 'b of several classes from RealVector and Inner_Product.
3347 Definitions of addition, subtraction, scalar multiplication, norms,
3348 and inner products are included.
3350 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3351 addition to the field operations, numerals and case syntax are also
3354 * Theory Library/Diagonalize provides constructive version of Cantor's
3355 first diagonalization argument.
3357 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3358 zlcm (for int); carried together from various gcd/lcm developements in
3359 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3360 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3361 may recover tupled syntax as follows:
3363 hide (open) const gcd
3364 abbreviation gcd where
3365 "gcd == (%(a, b). GCD.gcd a b)"
3367 GCD.gcd ("gcd '(_, _')")
3369 The same works for lcm, zgcd, zlcm.
3371 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3372 instantiations for algebraic structures. Removed some duplicate
3373 theorems. Changes in simp rules. INCOMPATIBILITY.
3375 * ML antiquotation @{code} takes a constant as argument and generates
3376 corresponding code in background and inserts name of the corresponding
3377 resulting ML value/function/datatype constructor binding in place.
3378 All occurrences of @{code} with a single ML block are generated
3379 simultaneously. Provides a generic and safe interface for
3380 instrumentalizing code generation. See
3381 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3382 In future you ought to refrain from ad-hoc compiling generated SML
3383 code on the ML toplevel. Note that (for technical reasons) @{code}
3384 cannot refer to constants for which user-defined serializations are
3385 set. Refer to the corresponding ML counterpart directly in that
3388 * Command 'rep_datatype': instead of theorem names the command now
3389 takes a list of terms denoting the constructors of the type to be
3390 represented as datatype. The characteristic theorems have to be
3391 proven. INCOMPATIBILITY. Also observe that the following theorems
3392 have disappeared in favour of existing ones:
3394 unit_induct ~> unit.induct
3395 prod_induct ~> prod.induct
3396 sum_induct ~> sum.induct
3397 Suc_Suc_eq ~> nat.inject
3398 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3403 * New locales for orders and lattices where the equivalence relation
3404 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3405 locales use a record structure with field eq for the equivalence.
3407 * New theory of factorial domains.
3409 * Units_l_inv and Units_r_inv are now simp rules by default.
3410 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3411 and/or r_inv will now also require deletion of these lemmas.
3413 * Renamed the following theorems, INCOMPATIBILITY:
3415 UpperD ~> Upper_memD
3416 LowerD ~> Lower_memD
3417 least_carrier ~> least_closed
3418 greatest_carrier ~> greatest_closed
3419 greatest_Lower_above ~> greatest_Lower_below
3420 one_zero ~> carrier_one_zero
3421 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3426 * Nominal datatypes can now contain type-variables.
3428 * Commands 'nominal_inductive' and 'equivariance' work with local
3431 * Nominal primrec can now works with local theory targets and its
3432 specification syntax now conforms to the general format as seen in
3435 * Method "perm_simp" honours the standard simplifier attributes
3436 (no_asm), (no_asm_use) etc.
3438 * The new predicate #* is defined like freshness, except that on the
3439 left hand side can be a set or list of atoms.
3441 * Experimental command 'nominal_inductive2' derives strong induction
3442 principles for inductive definitions. In contrast to
3443 'nominal_inductive', which can only deal with a fixed number of
3444 binders, it can deal with arbitrary expressions standing for sets of
3445 atoms to be avoided. The only inductive definition we have at the
3446 moment that needs this generalisation is the typing rule for Lets in
3449 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3450 -----------------------------------------------------------------
3451 Gamma |- Let x be t1 in t2 : T2
3453 In this rule one wants to avoid all the binders that are introduced by
3454 "close Gamma T1". We are looking for other examples where this
3455 feature might be useful. Please let us know.
3460 * Reimplemented the simplification procedure for proving continuity
3461 subgoals. The new simproc is extensible; users can declare additional
3462 continuity introduction rules with the attribute [cont2cont].
3464 * The continuity simproc now uses a different introduction rule for
3465 solving continuity subgoals on terms with lambda abstractions. In
3466 some rare cases the new simproc may fail to solve subgoals that the
3467 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3468 Potential INCOMPATIBILITY.
3470 * Command 'fixrec': specification syntax now conforms to the general
3471 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3472 examples. INCOMPATIBILITY.
3477 * Proof of Zorn's Lemma for partial orders.
3482 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3483 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3484 depends on multithreading, so timouts will not work before Poly/ML
3487 * High-level support for concurrent ML programming, see
3488 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3489 particularly convenient to organize independent functional
3490 computations. The concept of "synchronized variables" provides a
3491 higher-order interface for components with shared state, avoiding the
3492 delicate details of mutexes and condition variables. (Requires
3493 Poly/ML 5.2.1 or later.)
3495 * ML bindings produced via Isar commands are stored within the Isar
3496 context (theory or proof). Consequently, commands like 'use' and 'ML'
3497 become thread-safe and work with undo as expected (concerning
3498 top-level bindings, not side-effects on global references).
3499 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3500 compiler at runtime; really global bindings need to be given outside a
3501 theory. (Requires Poly/ML 5.2 or later.)
3503 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3504 context. Top-level ML bindings are stored within the proof context in
3505 a purely sequential fashion, disregarding the nested proof structure.
3506 ML bindings introduced by 'ML_prf' are discarded at the end of the
3507 proof. (Requires Poly/ML 5.2 or later.)
3509 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3510 and Method.setup, as well as Isar commands 'attribute_setup' and
3511 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3512 existing code accordingly, or use plain 'setup' together with old
3515 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3516 to 'a -> thm, while results are always tagged with an authentic oracle
3517 name. The Isar command 'oracle' is now polymorphic, no argument type
3518 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3519 accordingly. Note that extra performance may be gained by producing
3520 the cterm carefully, avoiding slow Thm.cterm_of.
3522 * Simplified interface for defining document antiquotations via
3523 ThyOutput.antiquotation, ThyOutput.output, and optionally
3524 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3525 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3528 * More systematic treatment of long names, abstract name bindings, and
3529 name space operations. Basic operations on qualified names have been
3530 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3531 Long_Name.append. Old type bstring has been mostly replaced by
3532 abstract type binding (see structure Binding), which supports precise
3533 qualification by packages and local theory targets, as well as proper
3534 tracking of source positions. INCOMPATIBILITY, need to wrap old
3535 bstring values into Binding.name, or better pass through abstract
3536 bindings everywhere. See further src/Pure/General/long_name.ML,
3537 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3539 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3540 LocalTheory.note etc.) now refer to the *full* internal name, not the
3541 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3543 * Disposed old type and term read functions (Sign.read_def_typ,
3544 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3545 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3546 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3547 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3548 resort for legacy applications.
3550 * Disposed old declarations, tactics, tactic combinators that refer to
3551 the simpset or claset of an implicit theory (such as Addsimps,
3552 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3553 embedded ML text, or local_simpset_of with a proper context passed as
3554 explicit runtime argument.
3556 * Rules and tactics that read instantiations (read_instantiate,
3557 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3558 context, which is required for parsing and type-checking. Moreover,
3559 the variables are specified as plain indexnames, not string encodings
3560 thereof. INCOMPATIBILITY.
3562 * Generic Toplevel.add_hook interface allows to analyze the result of
3563 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3564 for theorem dependency output of transactions resulting in a new
3567 * ML antiquotations: block-structured compilation context indicated by
3568 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3570 @{binding name} - basic name binding
3571 @{let ?pat = term} - term abbreviation (HO matching)
3572 @{note name = fact} - fact abbreviation
3573 @{thm fact} - singleton fact (with attributes)
3574 @{thms fact} - general fact (with attributes)
3575 @{lemma prop by method} - singleton goal
3576 @{lemma prop by meth1 meth2} - singleton goal
3577 @{lemma prop1 ... propN by method} - general goal
3578 @{lemma prop1 ... propN by meth1 meth2} - general goal
3579 @{lemma (open) ...} - open derivation
3584 * The Isabelle "emacs" tool provides a specific interface to invoke
3585 Proof General / Emacs, with more explicit failure if that is not
3586 installed (the old isabelle-interface script silently falls back on
3587 isabelle-process). The PROOFGENERAL_HOME setting determines the
3588 installation location of the Proof General distribution.
3590 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3591 the Isabelle process into a JVM/Scala application. See
3592 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3593 process wrapper has been discontinued.)
3595 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3597 * Various status messages (with exact source position information) are
3598 emitted, if proper markup print mode is enabled. This allows
3599 user-interface components to provide detailed feedback on internal
3604 New in Isabelle2008 (June 2008)
3605 -------------------------------
3609 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3610 and updated, with formally checked references as hyperlinks.
3612 * Theory loader: use_thy (and similar operations) no longer set the
3613 implicit ML context, which was occasionally hard to predict and in
3614 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3615 provides a proper context already.
3617 * Theory loader: old-style ML proof scripts being *attached* to a thy
3618 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3619 'use' within a theory file will do the job.
3621 * Name space merge now observes canonical order, i.e. the second space
3622 is inserted into the first one, while existing entries in the first
3623 space take precedence. INCOMPATIBILITY in rare situations, may try to
3624 swap theory imports.
3626 * Syntax: symbol \<chi> is now considered a letter. Potential
3627 INCOMPATIBILITY in identifier syntax etc.
3629 * Outer syntax: string tokens no longer admit escaped white space,
3630 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3631 white space without escapes.
3633 * Outer syntax: string tokens may contain arbitrary character codes
3634 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3640 * Context-dependent token translations. Default setup reverts locally
3641 fixed variables, and adds hilite markup for undeclared frees.
3643 * Unused theorems can be found using the new command 'unused_thms'.
3644 There are three ways of invoking it:
3647 Only finds unused theorems in the current theory.
3649 (2) unused_thms thy_1 ... thy_n -
3650 Finds unused theorems in the current theory and all of its ancestors,
3651 excluding the theories thy_1 ... thy_n and all of their ancestors.
3653 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3654 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3655 their ancestors, excluding the theories thy_1 ... thy_n and all of
3658 In order to increase the readability of the list produced by
3659 unused_thms, theorems that have been created by a particular instance
3660 of a theory command such as 'inductive' or 'function' are considered
3661 to belong to the same "group", meaning that if at least one theorem in
3662 this group is used, the other theorems in the same group are no longer
3663 reported as unused. Moreover, if all theorems in the group are
3664 unused, only one theorem in the group is displayed.
3666 Note that proof objects have to be switched on in order for
3667 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3668 usually the case when using Proof General with the default settings).
3670 * Authentic naming of facts disallows ad-hoc overwriting of previous
3671 theorems within the same name space. INCOMPATIBILITY, need to remove
3672 duplicate fact bindings, or even accidental fact duplications. Note
3673 that tools may maintain dynamically scoped facts systematically, using
3674 PureThy.add_thms_dynamic.
3676 * Command 'hide' now allows to hide from "fact" name space as well.
3678 * Eliminated destructive theorem database, simpset, claset, and
3679 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3680 update of theories within ML code.
3682 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3683 INCOMPATIBILITY, object-logics depending on former Pure require
3684 additional setup PureThy.old_appl_syntax_setup; object-logics
3685 depending on former CPure need to refer to Pure.
3687 * Commands 'use' and 'ML' are now purely functional, operating on
3688 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3689 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3692 * Command 'setup': discontinued implicit version with ML reference.
3694 * Instantiation target allows for simultaneous specification of class
3695 instance operations together with an instantiation proof.
3696 Type-checking phase allows to refer to class operations uniformly.
3697 See src/HOL/Complex/Complex.thy for an Isar example and
3698 src/HOL/Library/Eval.thy for an ML example.
3700 * Indexing of literal facts: be more serious about including only
3701 facts from the visible specification/proof context, but not the
3702 background context (locale etc.). Affects `prop` notation and method
3703 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3706 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3707 "(open)" option, which used to expose internal bound variables to the
3710 * Isar statements: removed obsolete case "rule_context".
3711 INCOMPATIBILITY, better use explicit fixes/assumes.
3713 * Locale proofs: default proof step now includes 'unfold_locales';
3714 hence 'proof' without argument may be used to unfold locale
3718 *** Document preparation ***
3720 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3721 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3722 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3723 spot); renamed link color from "darkblue" to "linkcolor" (default
3724 value unchanged, can be redefined via \definecolor); no longer sets
3725 "a4paper" option (unnecessary or even intrusive).
3727 * Antiquotation @{lemma A method} proves proposition A by the given
3728 method (either a method name or a method name plus (optional) method
3729 arguments in parentheses) and prints A just like @{prop A}.
3734 * New primrec package. Specification syntax conforms in style to
3735 definition/function/.... No separate induction rule is provided. The
3736 "primrec" command distinguishes old-style and new-style specifications
3737 by syntax. The former primrec package is now named OldPrimrecPackage.
3738 When adjusting theories, beware: constants stemming from new-style
3739 primrec specifications have authentic syntax.
3741 * Metis prover is now an order of magnitude faster, and also works
3742 with multithreading.
3744 * Metis: the maximum number of clauses that can be produced from a
3745 theorem is now given by the attribute max_clauses. Theorems that
3746 exceed this number are ignored, with a warning printed.
3748 * Sledgehammer no longer produces structured proofs by default. To
3749 enable, declare [[sledgehammer_full = true]]. Attributes
3750 reconstruction_modulus, reconstruction_sorts renamed
3751 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3753 * Method "induct_scheme" derives user-specified induction rules
3754 from well-founded induction and completeness of patterns. This factors
3755 out some operations that are done internally by the function package
3756 and makes them available separately. See
3757 src/HOL/ex/Induction_Scheme.thy for examples.
3759 * More flexible generation of measure functions for termination
3760 proofs: Measure functions can be declared by proving a rule of the
3761 form "is_measure f" and giving it the [measure_function] attribute.
3762 The "is_measure" predicate is logically meaningless (always true), and
3763 just guides the heuristic. To find suitable measure functions, the
3764 termination prover sets up the goal "is_measure ?f" of the appropriate
3765 type and generates all solutions by prolog-style backwards proof using
3768 This setup also deals with rules like
3770 "is_measure f ==> is_measure (list_size f)"
3772 which accommodates nested datatypes that recurse through lists.
3773 Similar rules are predeclared for products and option types.
3775 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3779 - Definitions of overloaded constants on sets have to be replaced by
3780 definitions on => and bool.
3782 - Some definitions of overloaded operators on sets can now be proved
3783 using the definitions of the operators on => and bool. Therefore,
3784 the following theorems have been renamed:
3786 subset_def -> subset_eq
3787 psubset_def -> psubset_eq
3788 set_diff_def -> set_diff_eq
3789 Compl_def -> Compl_eq
3790 Sup_set_def -> Sup_set_eq
3791 Inf_set_def -> Inf_set_eq
3792 sup_set_def -> sup_set_eq
3793 inf_set_def -> inf_set_eq
3795 - Due to the incompleteness of the HO unification algorithm, some
3796 rules such as subst may require manual instantiation, if some of
3797 the unknowns in the rule is a set.
3799 - Higher order unification and forward proofs:
3802 have "P (S::'a set)" <...>
3803 then have "EX S. P S" ..
3805 no longer works (due to the incompleteness of the HO unification
3806 algorithm) and must be replaced by the pattern
3813 - Calculational reasoning with subst (or similar rules):
3816 have "P (S::'a set)" <...>
3817 also have "S = T" <...>
3818 finally have "P T" .
3820 no longer works (for similar reasons as the previous example) and
3821 must be replaced by something like
3823 have "P (S::'a set)" <...>
3824 moreover have "S = T" <...>
3825 ultimately have "P T" by simp
3827 - Tactics or packages written in ML code:
3828 Code performing pattern matching on types via
3830 Type ("set", [T]) => ...
3832 must be rewritten. Moreover, functions like strip_type or
3833 binder_types no longer return the right value when applied to a
3836 T1 => ... => Tn => U => bool
3840 T1 => ... => Tn => U set
3842 * Merged theories Wellfounded_Recursion, Accessible_Part and
3843 Wellfounded_Relations to theory Wellfounded.
3845 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3847 * Class finite no longer treats UNIV as class parameter. Use class
3848 enum from theory Library/Enum instead to achieve a similar effect.
3851 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3852 and "Cons". INCOMPATIBILITY.
3854 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3855 Potential INCOMPATIBILITY.
3857 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3858 injective_fst_snd removed, use split_eta and prod_eqI instead.
3859 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3861 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3862 the same name in theory Orderings:
3872 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3873 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3874 and different variable names.
3876 * Library/Option_ord.thy: Canonical order on option type.
3878 * Library/RBT.thy: Red-black trees, an efficient implementation of
3881 * Library/Countable.thy: Type class for countable types.
3883 * Theory Int: The representation of numerals has changed. The infix
3884 operator BIT and the bit datatype with constructors B0 and B1 have
3885 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3886 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3887 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3890 * Theory Nat: definition of <= and < on natural numbers no longer
3891 depend on well-founded relations. INCOMPATIBILITY. Definitions
3892 le_def and less_def have disappeared. Consider lemmas not_less
3893 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3895 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3896 (whose purpose mainly is for various fold_set functionals) have been
3897 abandoned in favor of the existing algebraic classes
3898 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3899 lower_semilattice (resp. upper_semilattice) and linorder.
3902 * Theory Transitive_Closure: induct and cases rules now declare proper
3903 case_names ("base" and "step"). INCOMPATIBILITY.
3905 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3906 lattices. The form set-specific version is available as
3907 Inductive.lfp_ordinal_induct_set.
3909 * Renamed theorems "power.simps" to "power_int.simps".
3912 * Class semiring_div provides basic abstract properties of semirings
3913 with division and modulo operations. Subsumes former class dvd_mod.
3915 * Merged theories IntDef, Numeral and IntArith into unified theory
3916 Int. INCOMPATIBILITY.
3918 * Theory Library/Code_Index: type "index" now represents natural
3919 numbers rather than integers. INCOMPATIBILITY.
3921 * New class "uminus" with operation "uminus" (split of from class
3922 "minus" which now only has operation "minus", binary).
3925 * Constants "card", "internal_split", "option_map" now with authentic
3926 syntax. INCOMPATIBILITY.
3928 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3929 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3930 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3931 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3932 Sup_set_def, le_def, less_def, option_map_def now with object
3933 equality. INCOMPATIBILITY.
3935 * Records. Removed K_record, and replaced it by pure lambda term
3936 %x. c. The simplifier setup is now more robust against eta expansion.
3937 INCOMPATIBILITY: in cases explicitly referring to K_record.
3939 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3941 * Library/ListVector: new theory of arithmetic vector operations.
3943 * Library/Order_Relation: new theory of various orderings as sets of
3944 pairs. Defines preorders, partial orders, linear orders and
3945 well-orders on sets and on types.
3950 * Renamed some theories to allow to loading both ZF and HOL in the
3953 Datatype -> Datatype_ZF
3954 Inductive -> Inductive_ZF
3961 INCOMPATIBILITY: ZF theories that import individual theories below
3962 Main might need to be adapted. Regular theory Main is still
3963 available, as trivial extension of Main_ZF.
3968 * ML within Isar: antiquotation @{const name} or @{const
3969 name(typargs)} produces statically-checked Const term.
3971 * Functor NamedThmsFun: data is available to the user as dynamic fact
3972 (of the same name). Removed obsolete print command.
3974 * Removed obsolete "use_legacy_bindings" function.
3976 * The ``print mode'' is now a thread-local value derived from a global
3977 template (the former print_mode reference), thus access becomes
3978 non-critical. The global print_mode reference is for session
3979 management only; user-code should use print_mode_value,
3980 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3982 * Functions system/system_out provide a robust way to invoke external
3983 shell commands, with propagation of interrupts (requires Poly/ML
3984 5.2.1). Do not use OS.Process.system etc. from the basis library!
3989 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3990 in accordance with Proof General 3.7, which prefers GNU emacs.
3992 * isatool tty runs Isabelle process with plain tty interaction;
3993 optional line editor may be specified via ISABELLE_LINE_EDITOR
3994 setting, the default settings attempt to locate "ledit" and "rlwrap".
3996 * isatool browser now works with Cygwin as well, using general
3997 "javapath" function defined in Isabelle process environment.
3999 * YXML notation provides a simple and efficient alternative to
4000 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4001 isatool yxml as described in the Isabelle system manual.
4003 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4004 provides general wrapper for managing an Isabelle process in a robust
4005 fashion, with ``cooked'' output from stdin/stderr.
4007 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4008 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4010 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4011 way of changing the user's settings is via
4012 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4015 * Multithreading.max_threads := 0 refers to the number of actual CPU
4016 cores of the underlying machine, which is a good starting point for
4017 optimal performance tuning. The corresponding usedir option -M allows
4018 "max" as an alias for "0". WARNING: does not work on certain versions
4019 of Mac OS (with Poly/ML 5.1).
4021 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4022 adverse effect of Isabelle flooding interactive front-ends (notably
4023 ProofGeneral / XEmacs).
4027 New in Isabelle2007 (November 2007)
4028 -----------------------------------
4032 * More uniform information about legacy features, notably a
4033 warning/error of "Legacy feature: ...", depending on the state of the
4034 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4035 legacy features will disappear eventually.
4037 * Theory syntax: the header format ``theory A = B + C:'' has been
4038 discontinued in favour of ``theory A imports B C begin''. Use isatool
4039 fixheaders to convert existing theory files. INCOMPATIBILITY.
4041 * Theory syntax: the old non-Isar theory file format has been
4042 discontinued altogether. Note that ML proof scripts may still be used
4043 with Isar theories; migration is usually quite simple with the ML
4044 function use_legacy_bindings. INCOMPATIBILITY.
4046 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4047 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4050 * Theory loader: be more serious about observing the static theory
4051 header specifications (including optional directories), but not the
4052 accidental file locations of previously successful loads. The strict
4053 update policy of former update_thy is now already performed by
4054 use_thy, so the former has been removed; use_thys updates several
4055 theories simultaneously, just as 'imports' within a theory header
4056 specification, but without merging the results. Potential
4057 INCOMPATIBILITY: may need to refine theory headers and commands
4058 ROOT.ML which depend on load order.
4060 * Theory loader: optional support for content-based file
4061 identification, instead of the traditional scheme of full physical
4062 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4063 (cf. the system manual). The new scheme allows to work with
4064 non-finished theories in persistent session images, such that source
4065 files may be moved later on without requiring reloads.
4067 * Theory loader: old-style ML proof scripts being *attached* to a thy
4068 file (with the same base name as the theory) are considered a legacy
4069 feature, which will disappear eventually. Even now, the theory loader
4070 no longer maintains dependencies on such files.
4072 * Syntax: the scope for resolving ambiguities via type-inference is
4073 now limited to individual terms, instead of whole simultaneous
4074 specifications as before. This greatly reduces the complexity of the
4075 syntax module and improves flexibility by separating parsing and
4076 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4077 'fixes' etc.) are required in rare situations.
4079 * Syntax: constants introduced by new-style packages ('definition',
4080 'abbreviation' etc.) are passed through the syntax module in
4081 ``authentic mode''. This means that associated mixfix annotations
4082 really stick to such constants, independently of potential name space
4083 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4084 trees are represented slightly differently, may need to adapt syntax
4085 translations accordingly. Use CONST marker in 'translations' and
4086 @{const_syntax} antiquotation in 'parse_translation' etc.
4088 * Legacy goal package: reduced interface to the bare minimum required
4089 to keep existing proof scripts running. Most other user-level
4090 functions are now part of the OldGoals structure, which is *not* open
4091 by default (consider isatool expandshort before open OldGoals).
4092 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4093 these tend to cause confusion about the actual goal (!) context being
4094 used here, which is not necessarily the same as the_context().
4096 * Command 'find_theorems': supports "*" wild-card in "name:"
4097 criterion; "with_dups" option. Certain ProofGeneral versions might
4098 support a specific search form (see ProofGeneral/CHANGES).
4100 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4101 by default, which means that "prems" (and also "fixed variables") are
4102 suppressed from proof state output. Note that the ProofGeneral
4103 settings mechanism allows to change and save options persistently, but
4104 older versions of Isabelle will fail to start up if a negative prems
4107 * Local theory targets may be specified by non-nested blocks of
4108 ``context/locale/class ... begin'' followed by ``end''. The body may
4109 contain definitions, theorems etc., including any derived mechanism
4110 that has been implemented on top of these primitives. This concept
4111 generalizes the existing ``theorem (in ...)'' towards more versatility
4114 * Proof General interface: proper undo of final 'end' command;
4115 discontinued Isabelle/classic mode (ML proof scripts).
4118 *** Document preparation ***
4120 * Added antiquotation @{theory name} which prints the given name,
4121 after checking that it refers to a valid ancestor theory in the
4124 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4125 check the given source text as ML type/structure, printing verbatim.
4127 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4128 "c args == rhs" given in the current context. (Any number of
4129 arguments may be given on the LHS.)
4134 * The 'class' package offers a combination of axclass and locale to
4135 achieve Haskell-like type classes in Isabelle. Definitions and
4136 theorems within a class context produce both relative results (with
4137 implicit parameters according to the locale context), and polymorphic
4138 constants with qualified polymorphism (according to the class
4139 context). Within the body context of a 'class' target, a separate
4140 syntax layer ("user space type system") takes care of converting
4141 between global polymorphic consts and internal locale representation.
4142 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4143 "isatool doc classes" provides a tutorial.
4145 * Generic code generator framework allows to generate executable
4146 code for ML and Haskell (including Isabelle classes). A short usage
4149 internal compilation:
4150 export_code <list of constants (term syntax)> in SML
4151 writing SML code to a file:
4152 export_code <list of constants (term syntax)> in SML <filename>
4153 writing OCaml code to a file:
4154 export_code <list of constants (term syntax)> in OCaml <filename>
4155 writing Haskell code to a bunch of files:
4156 export_code <list of constants (term syntax)> in Haskell <filename>
4158 evaluating closed propositions to True/False using code generation:
4161 Reasonable default setup of framework in HOL.
4163 Theorem attributs for selecting and transforming function equations theorems:
4165 [code fun]: select a theorem as function equation for a specific constant
4166 [code fun del]: deselect a theorem as function equation for a specific constant
4167 [code inline]: select an equation theorem for unfolding (inlining) in place
4168 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4170 User-defined serializations (target in {SML, OCaml, Haskell}):
4172 code_const <and-list of constants (term syntax)>
4173 {(target) <and-list of const target syntax>}+
4175 code_type <and-list of type constructors>
4176 {(target) <and-list of type target syntax>}+
4178 code_instance <and-list of instances>
4180 where instance ::= <type constructor> :: <class>
4182 code_class <and_list of classes>
4183 {(target) <and-list of class target syntax>}+
4184 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4186 code_instance and code_class only are effective to target Haskell.
4188 For example usage see src/HOL/ex/Codegenerator.thy and
4189 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4190 generation from Isabelle/HOL theories is available via "isatool doc
4193 * Code generator: consts in 'consts_code' Isar commands are now
4194 referred to by usual term syntax (including optional type
4197 * Command 'no_translations' removes translation rules from theory
4200 * Overloaded definitions are now actually checked for acyclic
4201 dependencies. The overloading scheme is slightly more general than
4202 that of Haskell98, although Isabelle does not demand an exact
4203 correspondence to type class and instance declarations.
4204 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4205 exotic versions of overloading -- at the discretion of the user!
4207 Polymorphic constants are represented via type arguments, i.e. the
4208 instantiation that matches an instance against the most general
4209 declaration given in the signature. For example, with the declaration
4210 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4211 as c(nat). Overloading is essentially simultaneous structural
4212 recursion over such type arguments. Incomplete specification patterns
4213 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4214 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4215 Command 'print_theory' outputs the normalized system of recursive
4216 equations, see section "definitions".
4218 * Configuration options are maintained within the theory or proof
4219 context (with name and type bool/int/string), providing a very simple
4220 interface to a poor-man's version of general context data. Tools may
4221 declare options in ML (e.g. using Attrib.config_int) and then refer to
4222 these values using Config.get etc. Users may change options via an
4223 associated attribute of the same name. This form of context
4224 declaration works particularly well with commands 'declare' or
4225 'using', for example ``declare [[foo = 42]]''. Thus it has become
4226 very easy to avoid global references, which would not observe Isar
4227 toplevel undo/redo and fail to work with multithreading.
4229 Various global ML references of Pure and HOL have been turned into
4230 configuration options:
4232 Unify.search_bound unify_search_bound
4233 Unify.trace_bound unify_trace_bound
4234 Unify.trace_simp unify_trace_simp
4235 Unify.trace_types unify_trace_types
4236 Simplifier.simp_depth_limit simp_depth_limit
4237 Blast.depth_limit blast_depth_limit
4238 DatatypeProp.dtK datatype_distinctness_limit
4239 fast_arith_neq_limit fast_arith_neq_limit
4240 fast_arith_split_limit fast_arith_split_limit
4242 * Named collections of theorems may be easily installed as context
4243 data using the functor NamedThmsFun (see also
4244 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4245 attributes; there is also a toplevel print command. This facility is
4246 just a common case of general context data, which is the preferred way
4247 for anything more complex than just a list of facts in canonical
4250 * Isar: command 'declaration' augments a local theory by generic
4251 declaration functions written in ML. This enables arbitrary content
4252 being added to the context, depending on a morphism that tells the
4253 difference of the original declaration context wrt. the application
4254 context encountered later on.
4256 * Isar: proper interfaces for simplification procedures. Command
4257 'simproc_setup' declares named simprocs (with match patterns, and body
4258 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4259 context. ML antiquotation @{simproc name} retrieves named simprocs.
4261 * Isar: an extra pair of brackets around attribute declarations
4262 abbreviates a theorem reference involving an internal dummy fact,
4263 which will be ignored later --- only the effect of the attribute on
4264 the background context will persist. This form of in-place
4265 declarations is particularly useful with commands like 'declare' and
4266 'using', for example ``have A using [[simproc a]] by simp''.
4268 * Isar: method "assumption" (and implicit closing of subproofs) now
4269 takes simple non-atomic goal assumptions into account: after applying
4270 an assumption as a rule the resulting subgoals are solved by atomic
4271 assumption steps. This is particularly useful to finish 'obtain'
4272 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4273 without referring to the original premise "!!x. P x ==> thesis" in the
4274 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4277 * Isar: implicit use of prems from the Isar proof context is
4278 considered a legacy feature. Common applications like ``have A .''
4279 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4280 referencing facts explicitly here improves readability and
4281 maintainability of proof texts.
4283 * Isar: improper proof element 'guess' is like 'obtain', but derives
4284 the obtained context from the course of reasoning! For example:
4286 assume "EX x y. A x & B y" -- "any previous fact"
4287 then guess x and y by clarify
4289 This technique is potentially adventurous, depending on the facts and
4290 proof tools being involved here.
4292 * Isar: known facts from the proof context may be specified as literal
4293 propositions, using ASCII back-quote syntax. This works wherever
4294 named facts used to be allowed so far, in proof commands, proof
4295 methods, attributes etc. Literal facts are retrieved from the context
4296 according to unification of type and term parameters. For example,
4297 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4298 theorems in the current context, then these are valid literal facts:
4299 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4301 There is also a proof method "fact" which does the same composition
4302 for explicit goal states, e.g. the following proof texts coincide with
4303 certain special cases of literal facts:
4305 have "A" by fact == note `A`
4306 have "A ==> B" by fact == note `A ==> B`
4307 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4308 have "P a ==> Q a" by fact == note `P a ==> Q a`
4310 * Isar: ":" (colon) is no longer a symbolic identifier character in
4311 outer syntax. Thus symbolic identifiers may be used without
4312 additional white space in declarations like this: ``assume *: A''.
4314 * Isar: 'print_facts' prints all local facts of the current context,
4315 both named and unnamed ones.
4317 * Isar: 'def' now admits simultaneous definitions, e.g.:
4319 def x == "t" and y == "u"
4321 * Isar: added command 'unfolding', which is structurally similar to
4322 'using', but affects both the goal state and facts by unfolding given
4323 rewrite rules. Thus many occurrences of the 'unfold' method or
4324 'unfolded' attribute may be replaced by first-class proof text.
4326 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4327 and command 'unfolding' now all support object-level equalities
4328 (potentially conditional). The underlying notion of rewrite rule is
4329 analogous to the 'rule_format' attribute, but *not* that of the
4330 Simplifier (which is usually more generous).
4332 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4333 premises of a theorem by n. Useful in conjunction with drule.
4335 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4336 method expression within a sandbox consisting of the first N
4337 sub-goals, which need to exist. For example, ``simp_all [3]''
4338 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4339 simplifies all new goals that emerge from applying rule foo to the
4340 originally first one.
4342 * Isar: schematic goals are no longer restricted to higher-order
4343 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4346 * Isar: the conclusion of a long theorem statement is now either
4347 'shows' (a simultaneous conjunction, as before), or 'obtains'
4348 (essentially a disjunction of cases with local parameters and
4349 assumptions). The latter allows to express general elimination rules
4350 adequately; in this notation common elimination rules look like this:
4352 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4354 obtains x where "P x"
4356 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4360 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4366 The subsequent classical rules even refer to the formal "thesis"
4369 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4372 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4373 obtains "thesis ==> something"
4375 The actual proof of an 'obtains' statement is analogous to that of the
4376 Isar proof element 'obtain', only that there may be several cases.
4377 Optional case names may be specified in parentheses; these will be
4378 available both in the present proof and as annotations in the
4379 resulting rule, for later use with the 'cases' method (cf. attribute
4382 * Isar: the assumptions of a long theorem statement are available as
4383 "assms" fact in the proof context. This is more appropriate than the
4384 (historical) "prems", which refers to all assumptions of the current
4385 context, including those from the target locale, proof body etc.
4387 * Isar: 'print_statement' prints theorems from the current theory or
4388 proof context in long statement form, according to the syntax of a
4391 * Isar: 'obtain' takes an optional case name for the local context
4392 introduction rule (default "that").
4394 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4395 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4398 * Pure: syntax "CONST name" produces a fully internalized constant
4399 according to the current context. This is particularly useful for
4400 syntax translations that should refer to internal constant
4401 representations independently of name spaces.
4403 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4404 instead of "FOO ". This allows multiple binder declarations to coexist
4405 in the same context. INCOMPATIBILITY.
4407 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4408 primitive that also works in a locale context (both for constants and
4409 fixed variables). Type declaration and internal syntactic representation
4410 of given constants retrieved from the context. Likewise, the
4411 'no_notation' command allows to remove given syntax annotations from the
4414 * Isar/locales: new derived specification elements 'axiomatization',
4415 'definition', 'abbreviation', which support type-inference, admit
4416 object-level specifications (equality, equivalence). See also the
4417 isar-ref manual. Examples:
4420 eq (infix "===" 50) where
4421 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4423 definition "f x y = x + y + 1"
4424 definition g where "g x = f x x"
4427 neq (infix "=!=" 50) where
4428 "x =!= y == ~ (x === y)"
4430 These specifications may be also used in a locale context. Then the
4431 constants being introduced depend on certain fixed parameters, and the
4432 constant name is qualified by the locale base name. An internal
4433 abbreviation takes care for convenient input and output, making the
4434 parameters implicit and using the original short name. See also
4435 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4436 entities from a monomorphic theory.
4438 Presently, abbreviations are only available 'in' a target locale, but
4439 not inherited by general import expressions. Also note that
4440 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4441 'translations' in common applications. The "no_abbrevs" print mode
4442 prevents folding of abbreviations in term output.
4444 Concrete syntax is attached to specified constants in internal form,
4445 independently of name spaces. The parse tree representation is
4446 slightly different -- use 'notation' instead of raw 'syntax', and
4447 'translations' with explicit "CONST" markup to accommodate this.
4449 * Pure/Isar: unified syntax for new-style specification mechanisms
4450 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4451 full type inference and dummy patterns ("_"). For example:
4453 definition "K x _ = x"
4455 inductive conj for A B
4456 where "A ==> B ==> conj A B"
4458 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4459 the current context. Print mode "no_abbrevs" prevents inversion of
4460 abbreviations on output.
4462 * Isar/locales: improved parameter handling: use of locales "var" and
4463 "struct" no longer necessary; - parameter renamings are no longer
4464 required to be injective. For example, this allows to define
4465 endomorphisms as locale endom = homom mult mult h.
4467 * Isar/locales: changed the way locales with predicates are defined.
4468 Instead of accumulating the specification, the imported expression is
4469 now an interpretation. INCOMPATIBILITY: different normal form of
4470 locale expressions. In particular, in interpretations of locales with
4471 predicates, goals repesenting already interpreted fragments are not
4472 removed automatically. Use methods `intro_locales' and
4473 `unfold_locales'; see below.
4475 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4476 provide backward reasoning on locales predicates. The methods are
4477 aware of interpretations and discharge corresponding goals.
4478 `intro_locales' is less aggressive then `unfold_locales' and does not
4479 unfold predicates to assumptions.
4481 * Isar/locales: the order in which locale fragments are accumulated
4482 has changed. This enables to override declarations from fragments due
4483 to interpretations -- for example, unwanted simp rules.
4485 * Isar/locales: interpretation in theories and proof contexts has been
4486 extended. One may now specify (and prove) equations, which are
4487 unfolded in interpreted theorems. This is useful for replacing
4488 defined concepts (constants depending on locale parameters) by
4489 concepts already existing in the target context. Example:
4491 interpretation partial_order ["op <= :: [int, int] => bool"]
4492 where "partial_order.less (op <=) (x::int) y = (x < y)"
4494 Typically, the constant `partial_order.less' is created by a
4495 definition specification element in the context of locale
4498 * Method "induct": improved internal context management to support
4499 local fixes and defines on-the-fly. Thus explicit meta-level
4500 connectives !! and ==> are rarely required anymore in inductive goals
4501 (using object-logic connectives for this purpose has been long
4502 obsolete anyway). Common proof patterns are explained in
4503 src/HOL/Induct/Common_Patterns.thy, see also
4504 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4507 * Method "induct": improved handling of simultaneous goals. Instead of
4508 introducing object-level conjunction, the statement is now split into
4509 several conclusions, while the corresponding symbolic cases are nested
4510 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4511 see src/HOL/Induct/Common_Patterns.thy, for example.
4513 * Method "induct": mutual induction rules are now specified as a list
4514 of rule sharing the same induction cases. HOL packages usually provide
4515 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4516 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4517 mutual induction rules differently, i.e. like this:
4519 (induct rule: foo_bar.inducts)
4520 (induct set: foo bar)
4521 (induct pred: foo bar)
4522 (induct type: foo bar)
4524 The ML function ProjectRule.projections turns old-style rules into the
4527 * Method "coinduct": dual of induction, see
4528 src/HOL/Library/Coinductive_List.thy for various examples.
4530 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4531 considered a legacy feature.
4533 * Attribute "symmetric" produces result with standardized schematic
4534 variables (index 0). Potential INCOMPATIBILITY.
4536 * Simplifier: by default the simplifier trace only shows top level
4537 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4538 default. Thus there is less danger of being flooded by the trace. The
4539 trace indicates where parts have been suppressed.
4541 * Provers/classical: removed obsolete classical version of elim_format
4542 attribute; classical elim/dest rules are now treated uniformly when
4543 manipulating the claset.
4545 * Provers/classical: stricter checks to ensure that supplied intro,
4546 dest and elim rules are well-formed; dest and elim rules must have at
4549 * Provers/classical: attributes dest/elim/intro take an optional
4550 weight argument for the rule (just as the Pure versions). Weights are
4551 ignored by automated tools, but determine the search order of single
4554 * Syntax: input syntax now supports dummy variable binding "%_. b",
4555 where the body does not mention the bound variable. Note that dummy
4556 patterns implicitly depend on their context of bounds, which makes
4557 "{_. _}" match any set comprehension as expected. Potential
4558 INCOMPATIBILITY -- parse translations need to cope with syntactic
4559 constant "_idtdummy" in the binding position.
4561 * Syntax: removed obsolete syntactic constant "_K" and its associated
4562 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4563 for example "A -> B" => "Pi A (%_. B)".
4565 * Pure: 'class_deps' command visualizes the subclass relation, using
4566 the graph browser tool.
4568 * Pure: 'print_theory' now suppresses certain internal declarations by
4569 default; use '!' option for full details.
4574 * Method "metis" proves goals by applying the Metis general-purpose
4575 resolution prover (see also http://gilith.com/software/metis/).
4576 Examples are in the directory MetisExamples. WARNING: the
4577 Isabelle/HOL-Metis integration does not yet work properly with
4580 * Command 'sledgehammer' invokes external automatic theorem provers as
4581 background processes. It generates calls to the "metis" method if
4582 successful. These can be pasted into the proof. Users do not have to
4583 wait for the automatic provers to return. WARNING: does not really
4584 work with multi-threading.
4586 * New "auto_quickcheck" feature tests outermost goal statements for
4587 potential counter-examples. Controlled by ML references
4588 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4589 5000 milliseconds). Fails silently if statements is outside of
4590 executable fragment, or any other codgenerator problem occurs.
4592 * New constant "undefined" with axiom "undefined x = undefined".
4594 * Added class "HOL.eq", allowing for code generation with polymorphic
4597 * Some renaming of class constants due to canonical name prefixing in
4598 the new 'class' package:
4600 HOL.abs ~> HOL.abs_class.abs
4601 HOL.divide ~> HOL.divide_class.divide
4602 0 ~> HOL.zero_class.zero
4603 1 ~> HOL.one_class.one
4604 op + ~> HOL.plus_class.plus
4605 op - ~> HOL.minus_class.minus
4606 uminus ~> HOL.minus_class.uminus
4607 op * ~> HOL.times_class.times
4608 op < ~> HOL.ord_class.less
4609 op <= > HOL.ord_class.less_eq
4610 Nat.power ~> Power.power_class.power
4611 Nat.size ~> Nat.size_class.size
4612 Numeral.number_of ~> Numeral.number_class.number_of
4613 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4614 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4615 Orderings.min ~> Orderings.ord_class.min
4616 Orderings.max ~> Orderings.ord_class.max
4617 Divides.op div ~> Divides.div_class.div
4618 Divides.op mod ~> Divides.div_class.mod
4619 Divides.op dvd ~> Divides.div_class.dvd
4621 INCOMPATIBILITY. Adaptions may be required in the following cases:
4623 a) User-defined constants using any of the names "plus", "minus",
4624 "times", "less" or "less_eq". The standard syntax translations for
4625 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4628 b) Variables named "plus", "minus", "times", "less", "less_eq"
4629 INCOMPATIBILITY: use more specific names.
4631 c) Permutative equations (e.g. "a + b = b + a")
4632 Since the change of names also changes the order of terms, permutative
4633 rewrite rules may get applied in a different order. Experience shows
4634 that this is rarely the case (only two adaptions in the whole Isabelle
4635 distribution). INCOMPATIBILITY: rewrite proofs
4637 d) ML code directly refering to constant names
4638 This in general only affects hand-written proof tactics, simprocs and
4639 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4640 Consider using @{const_name} antiquotation.
4642 * New class "default" with associated constant "default".
4644 * Function "sgn" is now overloaded and available on int, real, complex
4645 (and other numeric types), using class "sgn". Two possible defs of
4646 sgn are given as equational assumptions in the classes sgn_if and
4647 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4650 * Locale "partial_order" now unified with class "order" (cf. theory
4651 Orderings), added parameter "less". INCOMPATIBILITY.
4653 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4654 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4655 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4657 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4658 changed order of proof goals in instance proofs.
4660 * The transitivity reasoner for partial and linear orders is set up
4661 for classes "order" and "linorder". Instances of the reasoner are available
4662 in all contexts importing or interpreting the corresponding locales.
4663 Method "order" invokes the reasoner separately; the reasoner
4664 is also integrated with the Simplifier as a solver. Diagnostic
4665 command 'print_orders' shows the available instances of the reasoner
4666 in the current context.
4668 * Localized monotonicity predicate in theory "Orderings"; integrated
4669 lemmas max_of_mono and min_of_mono with this predicate.
4672 * Formulation of theorem "dense" changed slightly due to integration
4673 with new class dense_linear_order.
4675 * Uniform lattice theory development in HOL.
4677 constants "meet" and "join" now named "inf" and "sup"
4678 constant "Meet" now named "Inf"
4680 classes "meet_semilorder" and "join_semilorder" now named
4681 "lower_semilattice" and "upper_semilattice"
4682 class "lorder" now named "lattice"
4683 class "comp_lat" now named "complete_lattice"
4685 Instantiation of lattice classes allows explicit definitions
4686 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4688 INCOMPATIBILITY. Theorem renames:
4690 meet_left_le ~> inf_le1
4691 meet_right_le ~> inf_le2
4692 join_left_le ~> sup_ge1
4693 join_right_le ~> sup_ge2
4694 meet_join_le ~> inf_sup_ord
4697 le_meet ~> le_inf_iff
4698 le_join ~> ge_sup_conv
4699 meet_idempotent ~> inf_idem
4700 join_idempotent ~> sup_idem
4701 meet_comm ~> inf_commute
4702 join_comm ~> sup_commute
4703 meet_leI1 ~> le_infI1
4704 meet_leI2 ~> le_infI2
4705 le_joinI1 ~> le_supI1
4706 le_joinI2 ~> le_supI2
4707 meet_assoc ~> inf_assoc
4708 join_assoc ~> sup_assoc
4709 meet_left_comm ~> inf_left_commute
4710 meet_left_idempotent ~> inf_left_idem
4711 join_left_comm ~> sup_left_commute
4712 join_left_idempotent ~> sup_left_idem
4715 le_def_meet ~> le_iff_inf
4716 le_def_join ~> le_iff_sup
4717 join_absorp2 ~> sup_absorb2
4718 join_absorp1 ~> sup_absorb1
4719 meet_absorp1 ~> inf_absorb1
4720 meet_absorp2 ~> inf_absorb2
4721 meet_join_absorp ~> inf_sup_absorb
4722 join_meet_absorp ~> sup_inf_absorb
4723 distrib_join_le ~> distrib_sup_le
4724 distrib_meet_le ~> distrib_inf_le
4726 add_meet_distrib_left ~> add_inf_distrib_left
4727 add_join_distrib_left ~> add_sup_distrib_left
4728 is_join_neg_meet ~> is_join_neg_inf
4729 is_meet_neg_join ~> is_meet_neg_sup
4730 add_meet_distrib_right ~> add_inf_distrib_right
4731 add_join_distrib_right ~> add_sup_distrib_right
4732 add_meet_join_distribs ~> add_sup_inf_distribs
4733 join_eq_neg_meet ~> sup_eq_neg_inf
4734 meet_eq_neg_join ~> inf_eq_neg_sup
4735 add_eq_meet_join ~> add_eq_inf_sup
4736 meet_0_imp_0 ~> inf_0_imp_0
4737 join_0_imp_0 ~> sup_0_imp_0
4738 meet_0_eq_0 ~> inf_0_eq_0
4739 join_0_eq_0 ~> sup_0_eq_0
4740 neg_meet_eq_join ~> neg_inf_eq_sup
4741 neg_join_eq_meet ~> neg_sup_eq_inf
4742 join_eq_if ~> sup_eq_if
4744 mono_meet ~> mono_inf
4745 mono_join ~> mono_sup
4746 meet_bool_eq ~> inf_bool_eq
4747 join_bool_eq ~> sup_bool_eq
4748 meet_fun_eq ~> inf_fun_eq
4749 join_fun_eq ~> sup_fun_eq
4750 meet_set_eq ~> inf_set_eq
4751 join_set_eq ~> sup_set_eq
4752 meet1_iff ~> inf1_iff
4753 meet2_iff ~> inf2_iff
4762 join1_iff ~> sup1_iff
4763 join2_iff ~> sup2_iff
4773 is_meet_Meet ~> is_meet_Inf
4774 Meet_bool_def ~> Inf_bool_def
4775 Meet_fun_def ~> Inf_fun_def
4776 Meet_greatest ~> Inf_greatest
4777 Meet_lower ~> Inf_lower
4778 Meet_set_def ~> Inf_set_def
4781 Sup_bool_eq ~> Sup_bool_def
4782 Sup_fun_eq ~> Sup_fun_def
4783 Sup_set_eq ~> Sup_set_def
4785 listsp_meetI ~> listsp_infI
4786 listsp_meet_eq ~> listsp_inf_eq
4791 * Added syntactic class "size"; overloaded constant "size" now has
4792 type "'a::size ==> bool"
4794 * Internal reorganisation of `size' of datatypes: size theorems
4795 "foo.size" are no longer subsumed by "foo.simps" (but are still
4796 simplification rules by default!); theorems "prod.size" now named
4799 * Class "div" now inherits from class "times" rather than "type".
4802 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4803 Linorder etc. have disappeared; operations defined in terms of
4804 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4806 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4808 * HOL-Word: New extensive library and type for generic, fixed size
4809 machine words, with arithmetic, bit-wise, shifting and rotating
4810 operations, reflection into int, nat, and bool lists, automation for
4811 linear arithmetic (by automatic reflection into nat or int), including
4812 lemmas on overflow and monotonicity. Instantiated to all appropriate
4813 arithmetic type classes, supporting automatic simplification of
4814 numerals on all operations.
4816 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4818 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4820 * Code generator library theories:
4821 - Code_Integer represents HOL integers by big integer literals in target
4823 - Code_Char represents HOL characters by character literals in target
4825 - Code_Char_chr like Code_Char, but also offers treatment of character
4826 codes; includes Code_Integer.
4827 - Executable_Set allows to generate code for finite sets using lists.
4828 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4830 - Executable_Real implements a subset of real numbers, namly those
4831 representable by rational numbers.
4832 - Efficient_Nat implements natural numbers by integers, which in general will
4833 result in higher efficency; pattern matching with 0/Suc is eliminated;
4834 includes Code_Integer.
4835 - Code_Index provides an additional datatype index which is mapped to
4836 target-language built-in integers.
4837 - Code_Message provides an additional datatype message_string which is isomorphic to
4838 strings; messages are mapped to target-language strings.
4840 * New package for inductive predicates
4842 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4845 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4846 for z_1 :: U_1 and ... and z_n :: U_m
4848 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4851 with full support for type-inference, rather than
4853 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4855 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4856 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4858 inductive "s z_1 ... z_m"
4860 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4863 For backward compatibility, there is a wrapper allowing inductive
4864 sets to be defined with the new package via
4867 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4868 for z_1 :: U_1 and ... and z_n :: U_m
4870 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4876 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4877 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4878 for z_1 :: U_1 and ... and z_n :: U_m
4880 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4881 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4884 if the additional syntax "p ..." is required.
4886 Numerous examples can be found in the subdirectories src/HOL/Auth,
4887 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4891 - Since declaration and definition of inductive sets or predicates
4892 is no longer separated, abbreviations involving the newly
4893 introduced sets or predicates must be specified together with the
4894 introduction rules after the 'where' keyword (see above), rather
4895 than before the actual inductive definition.
4897 - The variables in induction and elimination rules are now
4898 quantified in the order of their occurrence in the introduction
4899 rules, rather than in alphabetical order. Since this may break
4900 some proofs, these proofs either have to be repaired, e.g. by
4901 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4902 statements of the form
4904 case (rule_i a_i_1 ... a_i_{k_i})
4906 or the old order of quantification has to be restored by explicitly adding
4907 meta-level quantifiers in the introduction rules, i.e.
4909 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4911 - The format of the elimination rules is now
4913 p z_1 ... z_m x_1 ... x_n ==>
4914 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4919 (x_1, ..., x_n) : s z_1 ... z_m ==>
4920 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4923 for sets rather than
4925 x : s z_1 ... z_m ==>
4926 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4929 This may require terms in goals to be expanded to n-tuples
4930 (e.g. using case_tac or simplification with the split_paired_all
4931 rule) before the above elimination rule is applicable.
4933 - The elimination or case analysis rules for (mutually) inductive
4934 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4935 list of rules "p_1_..._p_k.elims" is no longer available.
4937 * New package "function"/"fun" for general recursive functions,
4938 supporting mutual and nested recursion, definitions in local contexts,
4939 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4940 for small examples, and the separate tutorial on the function
4941 package. The old recdef "package" is still available as before, but
4942 users are encouraged to use the new package.
4944 * Method "lexicographic_order" automatically synthesizes termination
4945 relations as lexicographic combinations of size measures.
4947 * Case-expressions allow arbitrary constructor-patterns (including
4948 "_") and take their order into account, like in functional
4949 programming. Internally, this is translated into nested
4950 case-expressions; missing cases are added and mapped to the predefined
4951 constant "undefined". In complicated cases printing may no longer show
4952 the original input but the internal form. Lambda-abstractions allow
4953 the same form of pattern matching: "% pat1 => e1 | ..." is an
4954 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4957 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4958 is an abbreviation for "of_nat :: nat => int". The simplification
4959 rules for "of_nat" have been changed to work like "int" did
4960 previously. Potential INCOMPATIBILITY:
4961 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4962 - of_nat_diff and of_nat_mult are no longer default simp rules
4964 * Method "algebra" solves polynomial equations over (semi)rings using
4965 Groebner bases. The (semi)ring structure is defined by locales and the
4966 tool setup depends on that generic context. Installing the method for
4967 a specific type involves instantiating the locale and possibly adding
4968 declarations for computation on the coefficients. The method is
4969 already instantiated for natural numbers and for the axiomatic class
4970 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4971 CALCULEMUS 2007 for the general principles underlying this
4972 architecture of context-aware proof-tools.
4974 * Method "ferrack" implements quantifier elimination over
4975 special-purpose dense linear orders using locales (analogous to
4976 "algebra"). The method is already installed for class
4977 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4980 * Former constant "List.op @" now named "List.append". Use ML
4981 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4982 circumvent possible incompatibilities when working on ML level.
4984 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4986 * New function listsum :: 'a list => 'a for arbitrary monoids.
4987 Special syntax: "SUM x <- xs. f x" (and latex variants)
4989 * New syntax for Haskell-like list comprehension (input only), eg.
4990 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4992 * The special syntax for function "filter" has changed from [x :
4993 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4994 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4996 * [a..b] is now defined for arbitrary linear orders. It used to be
4997 defined on nat only, as an abbreviation for [a..<Suc b]
5000 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5002 * New functions "sorted" and "sort" in src/HOL/List.thy.
5004 * New lemma collection field_simps (an extension of ring_simps) for
5005 manipulating (in)equations involving division. Multiplies with all
5006 denominators that can be proved to be non-zero (in equations) or
5007 positive/negative (in inequations).
5009 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5010 have been improved and renamed to ring_simps, group_simps and
5011 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5012 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5014 * Theory Library/Commutative_Ring: switched from recdef to function
5015 package; constants add, mul, pow now curried. Infix syntax for
5016 algebraic operations.
5018 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5021 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5024 * HOL/records: generalised field-update to take a function on the
5025 field rather than the new value: r(|A := x|) is translated to A_update
5026 (K x) r The K-combinator that is internally used is called K_record.
5027 INCOMPATIBILITY: Usage of the plain update functions has to be
5030 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5031 * x = 0, which are required for a semiring. Richer structures do not
5032 inherit from semiring_0 anymore, because this property is a theorem
5033 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5034 there is more to prove, but this is mostly trivial.
5036 * Class "recpower" is generalized to arbitrary monoids, not just
5037 commutative semirings. INCOMPATIBILITY: may need to incorporate
5038 commutativity or semiring properties additionally.
5040 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5041 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5042 better use 'abbreviation'.
5044 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5046 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5047 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5048 significant changes for setting up numeral syntax for types:
5049 - New constants Numeral.pred and Numeral.succ instead
5050 of former Numeral.bin_pred and Numeral.bin_succ.
5051 - Use integer operations instead of bin_add, bin_mult and so on.
5052 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5053 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5055 See src/HOL/Integ/IntArith.thy for an example setup.
5057 * Command 'normal_form' computes the normal form of a term that may
5058 contain free variables. For example ``normal_form "rev [a, b, c]"''
5059 produces ``[b, c, a]'' (without proof). This command is suitable for
5060 heavy-duty computations because the functions are compiled to ML
5061 first. Correspondingly, a method "normalization" is provided. See
5062 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5064 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5065 25 like -->); output depends on the "iff" print_mode, the default is
5066 "A = B" (with priority 50).
5068 * Relations less (<) and less_eq (<=) are also available on type bool.
5069 Modified syntax to disallow nesting without explicit parentheses,
5070 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5073 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5075 * Relation composition operator "op O" now has precedence 75 and binds
5076 stronger than union and intersection. INCOMPATIBILITY.
5078 * The old set interval syntax "{m..n(}" (and relatives) has been
5079 removed. Use "{m..<n}" (and relatives) instead.
5081 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5082 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5083 ``declare [[simproc del: neq]]''.
5085 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5088 * Theorem Cons_eq_map_conv no longer declared as "simp".
5090 * Theorem setsum_mult renamed to setsum_right_distrib.
5092 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5095 * Reimplemented methods "sat" and "satx", with several improvements:
5096 goals no longer need to be stated as "<prems> ==> False", equivalences
5097 (i.e. "=" on type bool) are handled, variable names of the form
5098 "lit_<n>" are no longer reserved, significant speedup.
5100 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5101 zChaff is still supported as well.
5103 * 'inductive' and 'datatype': provide projections of mutual rules,
5104 bundled as foo_bar.inducts;
5106 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5109 * Library: moved theory Accessible_Part to main HOL.
5111 * Library: added theory Coinductive_List of potentially infinite lists
5112 as greatest fixed-point.
5114 * Library: added theory AssocList which implements (finite) maps as
5117 * Method "evaluation" solves goals (i.e. a boolean expression)
5118 efficiently by compiling it to ML. The goal is "proved" (via an
5119 oracle) if it evaluates to True.
5121 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5122 also when invoked by the simplifier. This results in the Simplifier
5123 being more powerful on arithmetic goals. INCOMPATIBILITY.
5124 Configuration option fast_arith_split_limit=0 recovers the old
5127 * Support for hex (0x20) and binary (0b1001) numerals.
5129 * New method: reify eqs (t), where eqs are equations for an
5130 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5131 parameter, computes a term s::'b and a list xs::'a list and proves the
5132 theorem I xs s = t. This is also known as reification or quoting. The
5133 resulting theorem is applied to the subgoal to substitute t with I xs
5134 s. If t is omitted, the subgoal itself is reified.
5136 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5137 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5138 where f is supposed to be a computable function (in the sense of code
5139 generattion). The method uses reify to compute s and xs as above then
5140 applies corr_thm and uses normalization by evaluation to "prove" f s =
5141 r and finally gets the theorem t = r, which is again applied to the
5142 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5144 * Reflection: Automatic reification now handels binding, an example is
5145 available in src/HOL/ex/ReflectionEx.thy
5147 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5148 command 'statespace' that is similar to 'record', but introduces an
5149 abstract specification based on the locale infrastructure instead of
5150 HOL types. This leads to extra flexibility in composing state spaces,
5151 in particular multiple inheritance and renaming of components.
5156 * Hyperreal: Functions root and sqrt are now defined on negative real
5157 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5158 Nonnegativity side conditions have been removed from many lemmas, so
5159 that more subgoals may now be solved by simplification; potential
5162 * Real: new type classes formalize real normed vector spaces and
5163 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5164 and norm :: 'a => real.
5166 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5167 reals into other types. The overloaded constant Reals :: 'a set is now
5168 defined as range of_real; potential INCOMPATIBILITY.
5170 * Real: proper support for ML code generation, including 'quickcheck'.
5171 Reals are implemented as arbitrary precision rationals.
5173 * Hyperreal: Several constants that previously worked only for the
5174 reals have been generalized, so they now work over arbitrary vector
5175 spaces. Type annotations may need to be added in some cases; potential
5178 Infinitesimal :: ('a::real_normed_vector) star set
5179 HFinite :: ('a::real_normed_vector) star set
5180 HInfinite :: ('a::real_normed_vector) star set
5181 approx :: ('a::real_normed_vector) star => 'a star => bool
5182 monad :: ('a::real_normed_vector) star => 'a star set
5183 galaxy :: ('a::real_normed_vector) star => 'a star set
5184 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5185 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5186 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5187 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5188 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5189 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5190 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5191 sgn :: 'a::real_normed_vector => 'a
5192 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5194 * Complex: Some complex-specific constants are now abbreviations for
5195 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5196 hnorm. Other constants have been entirely removed in favor of the
5197 polymorphic versions (INCOMPATIBILITY):
5201 HInfinite <-- CInfinite
5202 Infinitesimal <-- CInfinitesimal
5205 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5206 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5207 (ns)deriv <-- (ns)cderiv
5212 * Formalisation of ideals and the quotient construction over rings.
5214 * Order and lattice theory no longer based on records.
5217 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5218 greatest_closed. INCOMPATIBILITY.
5220 * Method algebra is now set up via an attribute. For examples see
5221 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5222 of algebraic structures.
5224 * Renamed theory CRing to Ring.
5229 * Substantial, yet incomplete support for nominal datatypes (binding
5230 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5231 src/HOL/Nominal/Examples. Prospective users should consult
5232 http://isabelle.in.tum.de/nominal/
5237 * ML basics: just one true type int, which coincides with IntInf.int
5240 * ML within Isar: antiquotations allow to embed statically-checked
5241 formal entities in the source, referring to the context available at
5242 compile-time. For example:
5244 ML {* @{sort "{zero,one}"} *}
5245 ML {* @{typ "'a => 'b"} *}
5246 ML {* @{term "%x. x"} *}
5247 ML {* @{prop "x == y"} *}
5248 ML {* @{ctyp "'a => 'b"} *}
5249 ML {* @{cterm "%x. x"} *}
5250 ML {* @{cprop "x == y"} *}
5251 ML {* @{thm asm_rl} *}
5252 ML {* @{thms asm_rl} *}
5253 ML {* @{type_name c} *}
5254 ML {* @{type_syntax c} *}
5255 ML {* @{const_name c} *}
5256 ML {* @{const_syntax c} *}
5259 ML {* @{theory Pure} *}
5260 ML {* @{theory_ref} *}
5261 ML {* @{theory_ref Pure} *}
5264 ML {* @{clasimpset} *}
5266 The same works for sources being ``used'' within an Isar context.
5268 * ML in Isar: improved error reporting; extra verbosity with
5269 ML_Context.trace enabled.
5271 * Pure/General/table.ML: the join operations now works via exceptions
5272 DUP/SAME instead of type option. This is simpler in simple cases, and
5273 admits slightly more efficient complex applications.
5275 * Pure: 'advanced' translation functions (parse_translation etc.) now
5276 use Context.generic instead of just theory.
5278 * Pure: datatype Context.generic joins theory/Proof.context and
5279 provides some facilities for code that works in either kind of
5280 context, notably GenericDataFun for uniform theory and proof data.
5282 * Pure: simplified internal attribute type, which is now always
5283 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5284 local (Proof.context) attributes have been discontinued, while
5285 minimizing code duplication. Thm.rule_attribute and
5286 Thm.declaration_attribute build canonical attributes; see also structure
5287 Context for further operations on Context.generic, notably
5288 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5289 declarations and definitions.
5291 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5292 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5293 init only required for impure data. INCOMPATIBILITY: empty really need
5294 to be empty (no dependencies on theory content!)
5296 * Pure/kernel: consts certification ignores sort constraints given in
5297 signature declarations. (This information is not relevant to the
5298 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5299 potential INCOMPATIBILITY.
5301 * Pure: axiomatic type classes are now purely definitional, with
5302 explicit proofs of class axioms and super class relations performed
5303 internally. See Pure/axclass.ML for the main internal interfaces --
5304 notably AxClass.define_class supercedes AxClass.add_axclass, and
5305 AxClass.axiomatize_class/classrel/arity supersede
5306 Sign.add_classes/classrel/arities.
5308 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5309 global/local versions on theory vs. Proof.context have been
5310 discontinued; Attrib.syntax and Method.syntax have been adapted
5311 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5312 attributes, methods, etc.
5314 * Pure: several functions of signature "... -> theory -> theory * ..."
5315 have been reoriented to "... -> theory -> ... * theory" in order to
5316 allow natural usage in combination with the ||>, ||>>, |-> and
5317 fold_map combinators.
5319 * Pure: official theorem names (closed derivations) and additional
5320 comments (tags) are now strictly separate. Name hints -- which are
5321 maintained as tags -- may be attached any time without affecting the
5324 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5325 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5326 achieve the old behaviour.
5328 * Pure: the "Goal" constant is now called "prop", supporting a
5329 slightly more general idea of ``protecting'' meta-level rule
5332 * Pure: Logic.(un)varify only works in a global context, which is now
5333 enforced instead of silently assumed. INCOMPATIBILITY, may use
5334 Logic.legacy_(un)varify as temporary workaround.
5336 * Pure: structure Name provides scalable operations for generating
5337 internal variable names, notably Name.variants etc. This replaces
5338 some popular functions from term.ML:
5340 Term.variant -> Name.variant
5341 Term.variantlist -> Name.variant_list
5342 Term.invent_names -> Name.invent_list
5344 Note that low-level renaming rarely occurs in new code -- operations
5345 from structure Variable are used instead (see below).
5347 * Pure: structure Variable provides fundamental operations for proper
5348 treatment of fixed/schematic variables in a context. For example,
5349 Variable.import introduces fixes for schematics of given facts and
5350 Variable.export reverses the effect (up to renaming) -- this replaces
5351 various freeze_thaw operations.
5353 * Pure: structure Goal provides simple interfaces for
5354 init/conclude/finish and tactical prove operations (replacing former
5355 Tactic.prove). Goal.prove is the canonical way to prove results
5356 within a given context; Goal.prove_global is a degraded version for
5357 theory level goals, including a global Drule.standard. Note that
5358 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5359 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5360 in a locale context).
5362 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5363 and type checking (Syntax.check_term etc.), with common combinations
5364 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5365 which are considered legacy and await removal.
5367 * Pure/Syntax: generic interfaces for type unchecking
5368 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5369 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5370 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5371 available for convenience, but refer to the very same operations using
5372 a mere theory instead of a full context.
5374 * Isar: simplified treatment of user-level errors, using exception
5375 ERROR of string uniformly. Function error now merely raises ERROR,
5376 without any side effect on output channels. The Isar toplevel takes
5377 care of proper display of ERROR exceptions. ML code may use plain
5378 handle/can/try; cat_error may be used to concatenate errors like this:
5380 ... handle ERROR msg => cat_error msg "..."
5382 Toplevel ML code (run directly or through the Isar toplevel) may be
5383 embedded into the Isar toplevel with exception display/debug like
5386 Isar.toplevel (fn () => ...)
5388 INCOMPATIBILITY, removed special transform_error facilities, removed
5389 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5390 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5391 -- use plain ERROR instead.
5393 * Isar: theory setup now has type (theory -> theory), instead of a
5394 list. INCOMPATIBILITY, may use #> to compose setup functions.
5396 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5397 ProofContext.debug/verbose flags.
5399 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5400 theory before entering a proof state. Transactions now always see a
5401 quasi-functional intermediate checkpoint, both in interactive and
5404 * Isar: simplified interfaces for outer syntax. Renamed
5405 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5406 OuterSyntax.add_parsers -- this functionality is now included in
5407 OuterSyntax.command etc. INCOMPATIBILITY.
5409 * Simplifier: the simpset of a running simplification process now
5410 contains a proof context (cf. Simplifier.the_context), which is the
5411 very context that the initial simpset has been retrieved from (by
5412 simpset_of/local_simpset_of). Consequently, all plug-in components
5413 (solver, looper etc.) may depend on arbitrary proof data.
5415 * Simplifier.inherit_context inherits the proof context (plus the
5416 local bounds) of the current simplification process; any simproc
5417 etc. that calls the Simplifier recursively should do this! Removed
5418 former Simplifier.inherit_bounds, which is already included here --
5419 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5420 specify an explicit context using Simplifier.context/theory_context.
5422 * Simplifier/Classical Reasoner: more abstract interfaces
5423 change_simpset/claset for modifying the simpset/claset reference of a
5424 theory; raw versions simpset/claset_ref etc. have been discontinued --
5427 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5433 * settings: the default heap location within ISABELLE_HOME_USER now
5434 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5435 Isabelle installations.
5437 * isabelle-process: option -S (secure mode) disables some critical
5438 operations, notably runtime compilation and evaluation of ML source
5441 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5443 * Support for parallel execution, using native multicore support of
5444 Poly/ML 5.1. The theory loader exploits parallelism when processing
5445 independent theories, according to the given theory header
5446 specifications. The maximum number of worker threads is specified via
5447 usedir option -M or the "max-threads" setting in Proof General. A
5448 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5449 to 6 on a 8-core machine. User-code needs to observe certain
5450 guidelines for thread-safe programming, see appendix A in the Isar
5451 Implementation manual.
5455 New in Isabelle2005 (October 2005)
5456 ----------------------------------
5460 * Theory headers: the new header syntax for Isar theories is
5463 imports <theory1> ... <theoryN>
5464 uses <file1> ... <fileM>
5467 where the 'uses' part is optional. The previous syntax
5469 theory <name> = <theory1> + ... + <theoryN>:
5471 will disappear in the next release. Use isatool fixheaders to convert
5472 existing theory files. Note that there is no change in ancient
5473 non-Isar theories now, but these will disappear soon.
5475 * Theory loader: parent theories can now also be referred to via
5476 relative and absolute paths.
5478 * Command 'find_theorems' searches for a list of criteria instead of a
5479 list of constants. Known criteria are: intro, elim, dest, name:string,
5480 simp:term, and any term. Criteria can be preceded by '-' to select
5481 theorems that do not match. Intro, elim, dest select theorems that
5482 match the current goal, name:s selects theorems whose fully qualified
5483 name contain s, and simp:term selects all simplification rules whose
5484 lhs match term. Any other term is interpreted as pattern and selects
5485 all theorems matching the pattern. Available in ProofGeneral under
5486 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5488 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5490 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5491 matching the current goal as introduction rule and not having "HOL."
5492 in their name (i.e. not being defined in theory HOL).
5494 * Command 'thms_containing' has been discontinued in favour of
5495 'find_theorems'; INCOMPATIBILITY.
5497 * Communication with Proof General is now 8bit clean, which means that
5498 Unicode text in UTF-8 encoding may be used within theory texts (both
5499 formal and informal parts). Cf. option -U of the Isabelle Proof
5500 General interface. Here are some simple examples (cf. src/HOL/ex):
5502 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5503 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5505 * Improved efficiency of the Simplifier and, to a lesser degree, the
5506 Classical Reasoner. Typical big applications run around 2 times
5510 *** Document preparation ***
5512 * Commands 'display_drafts' and 'print_drafts' perform simple output
5513 of raw sources. Only those symbols that do not require additional
5514 LaTeX packages (depending on comments in isabellesym.sty) are
5515 displayed properly, everything else is left verbatim. isatool display
5516 and isatool print are used as front ends (these are subject to the
5517 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5519 * Command tags control specific markup of certain regions of text,
5520 notably folding and hiding. Predefined tags include "theory" (for
5521 theory begin and end), "proof" for proof commands, and "ML" for
5522 commands involving ML code; the additional tags "visible" and
5523 "invisible" are unused by default. Users may give explicit tag
5524 specifications in the text, e.g. ''by %invisible (auto)''. The
5525 interpretation of tags is determined by the LaTeX job during document
5526 preparation: see option -V of isatool usedir, or options -n and -t of
5527 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5530 Several document versions may be produced at the same time via isatool
5531 usedir (the generated index.html will link all of them). Typical
5532 specifications include ''-V document=theory,proof,ML'' to present
5533 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5534 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5535 these parts without any formal replacement text. The Isabelle site
5536 default settings produce ''document'' and ''outline'' versions as
5539 * Several new antiquotations:
5541 @{term_type term} prints a term with its type annotated;
5543 @{typeof term} prints the type of a term;
5545 @{const const} is the same as @{term const}, but checks that the
5546 argument is a known logical constant;
5548 @{term_style style term} and @{thm_style style thm} print a term or
5549 theorem applying a "style" to it
5553 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5554 definitions, equations, inequations etc., 'concl' printing only the
5555 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5556 to print the specified premise. TermStyle.add_style provides an ML
5557 interface for introducing further styles. See also the "LaTeX Sugar"
5558 document practical applications. The ML antiquotation prints
5559 type-checked ML expressions verbatim.
5561 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5562 and 'text' support optional locale specification '(in loc)', which
5563 specifies the default context for interpreting antiquotations. For
5564 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5566 * Option 'locale=NAME' of antiquotations specifies an alternative
5567 context interpreting the subsequent argument. For example: @{thm
5568 [locale=lattice] inf_assoc}.
5570 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5573 * Proper output of antiquotations for theory commands involving a
5574 proof context (such as 'locale' or 'theorem (in loc) ...').
5576 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5577 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5579 * isatool usedir: new option -C (default true) controls whether option
5580 -D should include a copy of the original document directory; -C false
5581 prevents unwanted effects such as copying of administrative CVS data.
5586 * Considerably improved version of 'constdefs' command. Now performs
5587 automatic type-inference of declared constants; additional support for
5588 local structure declarations (cf. locales and HOL records), see also
5589 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5590 sequential dependencies of definitions within a single 'constdefs'
5591 section; moreover, the declared name needs to be an identifier. If
5592 all fails, consider to fall back on 'consts' and 'defs' separately.
5594 * Improved indexed syntax and implicit structures. First of all,
5595 indexed syntax provides a notational device for subscripted
5596 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5597 expressions. Secondly, in a local context with structure
5598 declarations, number indexes \<^sub>n or the empty index (default
5599 number 1) refer to a certain fixed variable implicitly; option
5600 show_structs controls printing of implicit structures. Typical
5601 applications of these concepts involve record types and locales.
5603 * New command 'no_syntax' removes grammar declarations (and
5604 translations) resulting from the given syntax specification, which is
5605 interpreted in the same manner as for the 'syntax' command.
5607 * 'Advanced' translation functions (parse_translation etc.) may depend
5608 on the signature of the theory context being presently used for
5609 parsing/printing, see also isar-ref manual.
5611 * Improved 'oracle' command provides a type-safe interface to turn an
5612 ML expression of type theory -> T -> term into a primitive rule of
5613 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5614 is already included here); see also FOL/ex/IffExample.thy;
5617 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5618 before); "cI" is no longer bound, use "c.intro" instead.
5619 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5620 axclasses vs. locales.
5622 * Improved internal renaming of symbolic identifiers -- attach primes
5623 instead of base 26 numbers.
5625 * New flag show_question_marks controls printing of leading question
5626 marks in schematic variable names.
5628 * In schematic variable names, *any* symbol following \<^isub> or
5629 \<^isup> is now treated as part of the base name. For example, the
5630 following works without printing of awkward ".0" indexes:
5632 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5635 * Inner syntax includes (*(*nested*) comments*).
5637 * Pretty printer now supports unbreakable blocks, specified in mixfix
5638 annotations as "(00...)".
5640 * Clear separation of logical types and nonterminals, where the latter
5641 may only occur in 'syntax' specifications or type abbreviations.
5642 Before that distinction was only partially implemented via type class
5643 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5644 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5645 exotic syntax specifications may require further adaption
5646 (e.g. Cube/Cube.thy).
5648 * Removed obsolete type class "logic", use the top sort {} instead.
5649 Note that non-logical types should be declared as 'nonterminals'
5650 rather than 'types'. INCOMPATIBILITY for new object-logic
5653 * Attributes 'induct' and 'cases': type or set names may now be
5654 locally fixed variables as well.
5656 * Simplifier: can now control the depth to which conditional rewriting
5657 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5660 * Simplifier: simplification procedures may now take the current
5661 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5662 interface), which is very useful for calling the Simplifier
5663 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5664 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5665 low-level mk_simproc no longer applies Logic.varify internally, to
5666 allow for use in a context of fixed variables.
5668 * thin_tac now works even if the assumption being deleted contains !!
5669 or ==>. More generally, erule now works even if the major premise of
5670 the elimination rule contains !! or ==>.
5672 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5674 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5675 from Pure, which contains all common declarations already. Both
5676 theories are defined via plain Isabelle/Isar .thy files.
5677 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5678 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5679 use isatool fixcpure to adapt your theory and ML sources.
5681 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5682 selections of theorems in named facts via index ranges.
5684 * 'print_theorems': in theory mode, really print the difference
5685 wrt. the last state (works for interactive theory development only),
5686 in proof mode print all local facts (cf. 'print_facts');
5688 * 'hide': option '(open)' hides only base names.
5690 * More efficient treatment of intermediate checkpoints in interactive
5693 * Code generator is now invoked via code_module (incremental code
5694 generation) and code_library (modular code generation, ML structures
5695 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5696 must be quoted when used as identifiers.
5698 * New 'value' command for reading, evaluating and printing terms using
5699 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5700 quoted when used as identifier.
5705 * New commands for the interpretation of locale expressions in
5706 theories (1), locales (2) and proof contexts (3). These generate
5707 proof obligations from the expression specification. After the
5708 obligations have been discharged, theorems of the expression are added
5709 to the theory, target locale or proof context. The synopsis of the
5710 commands is a follows:
5712 (1) interpretation expr inst
5713 (2) interpretation target < expr
5714 (3) interpret expr inst
5716 Interpretation in theories and proof contexts require a parameter
5717 instantiation of terms from the current context. This is applied to
5718 specifications and theorems of the interpreted expression.
5719 Interpretation in locales only permits parameter renaming through the
5720 locale expression. Interpretation is smart in that interpretations
5721 that are active already do not occur in proof obligations, neither are
5722 instantiated theorems stored in duplicate. Use 'print_interps' to
5723 inspect active interpretations of a particular locale. For details,
5724 see the Isar Reference manual. Examples can be found in
5725 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5727 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5728 'interpret' instead.
5730 * New context element 'constrains' for adding type constraints to
5733 * Context expressions: renaming of parameters with syntax
5736 * Locale declaration: 'includes' disallowed.
5738 * Proper static binding of attribute syntax -- i.e. types / terms /
5739 facts mentioned as arguments are always those of the locale definition
5740 context, independently of the context of later invocations. Moreover,
5741 locale operations (renaming and type / term instantiation) are applied
5742 to attribute arguments as expected.
5744 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5745 actual attributes; rare situations may require Attrib.attribute to
5746 embed those attributes into Attrib.src that lack concrete syntax.
5747 Attribute implementations need to cooperate properly with the static
5748 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5749 Attrib.XXX_thm etc. already do the right thing without further
5750 intervention. Only unusual applications -- such as "where" or "of"
5751 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5752 on the context and the facts involved -- may have to assign parsed
5753 values to argument tokens explicitly.
5755 * Changed parameter management in theorem generation for long goal
5756 statements with 'includes'. INCOMPATIBILITY: produces a different
5757 theorem statement in rare situations.
5759 * Locale inspection command 'print_locale' omits notes elements. Use
5760 'print_locale!' to have them included in the output.
5765 * Provers/hypsubst.ML: improved version of the subst method, for
5766 single-step rewriting: it now works in bound variable contexts. New is
5767 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5768 rewrite a different subterm than the original subst method, which is
5769 still available as 'simplesubst'.
5771 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5774 * Provers/trancl.ML: new transitivity reasoner for transitive and
5775 reflexive-transitive closure of relations.
5777 * Provers/blast.ML: new reference depth_limit to make blast's depth
5778 limit (previously hard-coded with a value of 20) user-definable.
5780 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5781 is peformed already. Object-logics merely need to finish their
5782 initial simpset configuration as before. INCOMPATIBILITY.
5787 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5790 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5792 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5793 and x-symbol; use option '-m epsilon' to get it actually printed.
5794 Moreover, the mathematically important symbolic identifier \<epsilon>
5795 becomes available as variable, constant etc. INCOMPATIBILITY,
5797 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5798 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5799 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5800 support corresponding Isar calculations.
5802 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5805 * theory SetInterval: changed the syntax for open intervals:
5814 The old syntax is still supported but will disappear in the next
5815 release. For conversion use the following Emacs search and replace
5816 patterns (these are not perfect but work quite well):
5818 {)\([^\.]*\)\.\. -> {\1<\.\.}
5819 \.\.\([^(}]*\)(} -> \.\.<\1}
5821 * Theory Commutative_Ring (in Library): method comm_ring for proving
5822 equalities in commutative rings; method 'algebra' provides a generic
5825 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5826 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5827 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5830 Some new syntax forms are available:
5832 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5833 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5834 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5835 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5837 The latter form "\<Sum>x < k. e" used to be based on a separate
5838 function "Summation", which has been discontinued.
5840 * theory Finite_Set: in structured induction proofs, the insert case
5841 is now 'case (insert x F)' instead of the old counterintuitive 'case
5844 * The 'refute' command has been extended to support a much larger
5845 fragment of HOL, including axiomatic type classes, constdefs and
5846 typedefs, inductive datatypes and recursion.
5848 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5849 Requires zChaff with proof generation to be installed. See
5850 HOL/ex/SAT_Examples.thy for examples.
5852 * Datatype induction via method 'induct' now preserves the name of the
5853 induction variable. For example, when proving P(xs::'a list) by
5854 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5855 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5856 in unstructured proof scripts.
5858 * Reworked implementation of records. Improved scalability for
5859 records with many fields, avoiding performance problems for type
5860 inference. Records are no longer composed of nested field types, but
5861 of nested extension types. Therefore the record type only grows linear
5862 in the number of extensions and not in the number of fields. The
5863 top-level (users) view on records is preserved. Potential
5864 INCOMPATIBILITY only in strange cases, where the theory depends on the
5865 old record representation. The type generated for a record is called
5866 <record_name>_ext_type.
5868 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5869 proofs triggered by a record definition or a simproc (if
5870 quick_and_dirty is enabled). Definitions of large records can take
5873 New simproc record_upd_simproc for simplification of multiple record
5874 updates enabled by default. Moreover, trivial updates are also
5875 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5876 occasionally, since simplification is more powerful by default.
5878 * typedef: proper support for polymorphic sets, which contain extra
5879 type-variables in the term.
5881 * Simplifier: automatically reasons about transitivity chains
5882 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5883 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5884 old proofs break occasionally as simplification may now solve more
5885 goals than previously.
5887 * Simplifier: converts x <= y into x = y if assumption y <= x is
5888 present. Works for all partial orders (class "order"), in particular
5889 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5892 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5893 bound variable or a constant then the let is unfolded. Otherwise
5894 first a is simplified to b, and then f b is simplified to g. If
5895 possible we abstract b from g arriving at "let x = b in h x",
5896 otherwise we unfold the let and arrive at g. The simproc can be
5897 enabled/disabled by the reference use_let_simproc. Potential
5898 INCOMPATIBILITY since simplification is more powerful by default.
5900 * Classical reasoning: the meson method now accepts theorems as arguments.
5902 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5903 jobs to provide advice on the provability of subgoals.
5905 * Theory OrderedGroup and Ring_and_Field: various additions and
5906 improvements to faciliate calculations involving equalities and
5909 The following theorems have been eliminated or modified
5912 abs_eq now named abs_of_nonneg
5913 abs_of_ge_0 now named abs_of_nonneg
5914 abs_minus_eq now named abs_of_nonpos
5915 imp_abs_id now named abs_of_nonneg
5916 imp_abs_neg_id now named abs_of_nonpos
5917 mult_pos now named mult_pos_pos
5918 mult_pos_le now named mult_nonneg_nonneg
5919 mult_pos_neg_le now named mult_nonneg_nonpos
5920 mult_pos_neg2_le now named mult_nonneg_nonpos2
5921 mult_neg now named mult_neg_neg
5922 mult_neg_le now named mult_nonpos_nonpos
5924 * The following lemmas in Ring_and_Field have been added to the simplifier:
5927 not_square_less_zero
5929 The following lemmas have been deleted from Real/RealPow:
5939 * Theory Parity: added rules for simplifying exponents.
5943 The following theorems have been eliminated or modified
5946 list_all_Nil now named list_all.simps(1)
5947 list_all_Cons now named list_all.simps(2)
5948 list_all_conv now named list_all_iff
5949 set_mem_eq now named mem_iff
5951 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5952 asymptotic "big O" calculations. See the notes in BigO.thy.
5957 * Theory RealDef: better support for embedding natural numbers and
5958 integers in the reals.
5960 The following theorems have been eliminated or modified
5963 exp_ge_add_one_self now requires no hypotheses
5964 real_of_int_add reversed direction of equality (use [symmetric])
5965 real_of_int_minus reversed direction of equality (use [symmetric])
5966 real_of_int_diff reversed direction of equality (use [symmetric])
5967 real_of_int_mult reversed direction of equality (use [symmetric])
5969 * Theory RComplete: expanded support for floor and ceiling functions.
5971 * Theory Ln is new, with properties of the natural logarithm
5973 * Hyperreal: There is a new type constructor "star" for making
5974 nonstandard types. The old type names are now type synonyms:
5978 hcomplex = complex star
5980 * Hyperreal: Many groups of similarly-defined constants have been
5981 replaced by polymorphic versions (INCOMPATIBILITY):
5983 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5985 starset <-- starsetNat, starsetC
5986 *s* <-- *sNat*, *sc*
5987 starset_n <-- starsetNat_n, starsetC_n
5988 *sn* <-- *sNatn*, *scn*
5989 InternalSets <-- InternalNatSets, InternalCSets
5991 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5992 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5993 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5994 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5995 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
5997 * Hyperreal: Many type-specific theorems have been removed in favor of
5998 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6000 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6001 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6002 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6003 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6004 right_minus <-- hypreal_add_minus
6005 left_minus <-- {hypreal,hcomplex}_add_minus_left
6006 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6007 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6008 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6009 mult_1_right <-- hcomplex_mult_one_right
6010 mult_zero_left <-- hcomplex_mult_zero_left
6011 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6012 right_distrib <-- hypnat_add_mult_distrib2
6013 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6014 right_inverse <-- hypreal_mult_inverse
6015 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6016 order_refl <-- {hypreal,hypnat}_le_refl
6017 order_trans <-- {hypreal,hypnat}_le_trans
6018 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6019 order_less_le <-- {hypreal,hypnat}_less_le
6020 linorder_linear <-- {hypreal,hypnat}_le_linear
6021 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6022 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6023 add_nonneg_nonneg <-- hypreal_le_add_order
6025 * Hyperreal: Separate theorems having to do with type-specific
6026 versions of constants have been merged into theorems that apply to the
6027 new polymorphic constants (INCOMPATIBILITY):
6029 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6030 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6031 STAR_Un <-- {STAR,NatStar,STARC}_Un
6032 STAR_Int <-- {STAR,NatStar,STARC}_Int
6033 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6034 STAR_subset <-- {STAR,NatStar,STARC}_subset
6035 STAR_mem <-- {STAR,NatStar,STARC}_mem
6036 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6037 STAR_diff <-- {STAR,STARC}_diff
6038 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6039 STARC_hcomplex_of_complex}_image_subset
6040 starset_n_Un <-- starset{Nat,C}_n_Un
6041 starset_n_Int <-- starset{Nat,C}_n_Int
6042 starset_n_Compl <-- starset{Nat,C}_n_Compl
6043 starset_n_diff <-- starset{Nat,C}_n_diff
6044 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6045 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6046 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6047 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6048 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6049 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6050 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6051 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6052 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6053 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6054 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6055 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6056 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6057 starfun_diff <-- starfun{C,RC,CR}_diff
6058 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6059 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6060 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6061 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6062 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6063 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6064 starfun_Id <-- starfunC_Id
6065 starfun_approx <-- starfun{Nat,CR}_approx
6066 starfun_capprox <-- starfun{C,RC}_capprox
6067 starfun_abs <-- starfunNat_rabs
6068 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6069 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6070 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6071 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6072 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6073 starfun_add_approx <-- starfunCR_add_approx
6074 starfun_inverse_inverse <-- starfunC_inverse_inverse
6075 starfun_divide <-- starfun{C,CR,RC}_divide
6076 starfun_n <-- starfun{Nat,C}_n
6077 starfun_n_mult <-- starfun{Nat,C}_n_mult
6078 starfun_n_add <-- starfun{Nat,C}_n_add
6079 starfun_n_add_minus <-- starfunNat_n_add_minus
6080 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6081 starfun_n_minus <-- starfun{Nat,C}_n_minus
6082 starfun_n_eq <-- starfun{Nat,C}_n_eq
6084 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6085 star_n_minus <-- {hypreal,hcomplex}_minus
6086 star_n_diff <-- {hypreal,hcomplex}_diff
6087 star_n_mult <-- {hypreal,hcomplex}_mult
6088 star_n_inverse <-- {hypreal,hcomplex}_inverse
6089 star_n_le <-- {hypreal,hypnat}_le
6090 star_n_less <-- {hypreal,hypnat}_less
6091 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6092 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6093 star_n_abs <-- hypreal_hrabs
6094 star_n_divide <-- hcomplex_divide
6096 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6097 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6098 star_of_diff <-- hypreal_of_real_diff
6099 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6100 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6101 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6102 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6103 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6104 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6105 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6106 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6107 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6108 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6109 star_of_number_of <-- {hypreal,hcomplex}_number_of
6110 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6111 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6112 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6113 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6114 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6115 star_of_power <-- hypreal_of_real_power
6116 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6118 * Hyperreal: new method "transfer" that implements the transfer
6119 principle of nonstandard analysis. With a subgoal that mentions
6120 nonstandard types like "'a star", the command "apply transfer"
6121 replaces it with an equivalent one that mentions only standard types.
6122 To be successful, all free variables must have standard types; non-
6123 standard variables must have explicit universal quantifiers.
6125 * Hyperreal: A theory of Taylor series.
6130 * Discontinued special version of 'constdefs' (which used to support
6131 continuous functions) in favor of the general Pure one with full
6134 * New simplification procedure for solving continuity conditions; it
6135 is much faster on terms with many nested lambda abstractions (cubic
6136 instead of exponential time).
6138 * New syntax for domain package: selector names are now optional.
6139 Parentheses should be omitted unless argument is lazy, for example:
6141 domain 'a stream = cons "'a" (lazy "'a stream")
6143 * New command 'fixrec' for defining recursive functions with pattern
6144 matching; defining multiple functions with mutual recursion is also
6145 supported. Patterns may include the constants cpair, spair, up, sinl,
6146 sinr, or any data constructor defined by the domain package. The given
6147 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6148 syntax and examples.
6150 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6151 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6152 but the proof obligation additionally includes an admissibility
6153 requirement. The packages generate instances of class cpo or pcpo,
6154 with continuity and strictness theorems for Rep and Abs.
6156 * HOLCF: Many theorems have been renamed according to a more standard naming
6157 scheme (INCOMPATIBILITY):
6159 foo_inject: "foo$x = foo$y ==> x = y"
6160 foo_eq: "(foo$x = foo$y) = (x = y)"
6161 foo_less: "(foo$x << foo$y) = (x << y)"
6162 foo_strict: "foo$UU = UU"
6163 foo_defined: "... ==> foo$x ~= UU"
6164 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6169 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6170 including the First Isomorphism Theorem (on quotienting by the kernel
6173 * ZF/Simplifier: install second copy of type solver that actually
6174 makes use of TC rules declared to Isar proof contexts (or locales);
6175 the old version is still required for ML proof scripts.
6180 * Converted to Isar theory format; use locales instead of axiomatic
6186 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6189 * Pure/library.ML no longer defines its own option datatype, but uses
6190 that of the SML basis, which has constructors NONE and SOME instead of
6191 None and Some, as well as exception Option.Option instead of OPTION.
6192 The functions the, if_none, is_some, is_none have been adapted
6193 accordingly, while Option.map replaces apsome.
6195 * Pure/library.ML: the exception LIST has been given up in favour of
6196 the standard exceptions Empty and Subscript, as well as
6197 Library.UnequalLengths. Function like Library.hd and Library.tl are
6198 superceded by the standard hd and tl functions etc.
6200 A number of basic list functions are no longer exported to the ML
6201 toplevel, as they are variants of predefined functions. The following
6202 suggests how one can translate existing code:
6204 rev_append xs ys = List.revAppend (xs, ys)
6205 nth_elem (i, xs) = List.nth (xs, i)
6206 last_elem xs = List.last xs
6207 flat xss = List.concat xss
6208 seq fs = List.app fs
6209 partition P xs = List.partition P xs
6210 mapfilter f xs = List.mapPartial f xs
6212 * Pure/library.ML: several combinators for linear functional
6213 transformations, notably reverse application and composition:
6216 (x, y) |-> f f #-> g
6218 * Pure/library.ML: introduced/changed precedence of infix operators:
6220 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6222 infix 3 o oo ooo oooo;
6223 infix 4 ~~ upto downto;
6225 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6228 * Pure/library.ML: natural list combinators fold, fold_rev, and
6229 fold_map support linear functional transformations and nesting. For
6232 fold f [x1, ..., xN] y =
6233 y |> f x1 |> ... |> f xN
6235 (fold o fold) f [xs1, ..., xsN] y =
6236 y |> fold f xs1 |> ... |> fold f xsN
6238 fold f [x1, ..., xN] =
6241 (fold o fold) f [xs1, ..., xsN] =
6242 fold f xs1 #> ... #> fold f xsN
6244 * Pure/library.ML: the following selectors on type 'a option are
6247 the: 'a option -> 'a (*partial*)
6248 these: 'a option -> 'a where 'a = 'b list
6249 the_default: 'a -> 'a option -> 'a
6250 the_list: 'a option -> 'a list
6252 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6253 basic operations for association lists, following natural argument
6254 order; moreover the explicit equality predicate passed here avoids
6255 potentially expensive polymorphic runtime equality checks.
6256 The old functions may be expressed as follows:
6258 assoc = uncurry (AList.lookup (op =))
6259 assocs = these oo AList.lookup (op =)
6260 overwrite = uncurry (AList.update (op =)) o swap
6262 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6264 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6265 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6267 replacing make_keylist and keyfilter (occassionally used)
6270 make_keylist = AList.make
6271 keyfilter = AList.find (op =)
6273 * eq_fst and eq_snd now take explicit equality parameter, thus
6274 avoiding eqtypes. Naive rewrites:
6276 eq_fst = eq_fst (op =)
6277 eq_snd = eq_snd (op =)
6279 * Removed deprecated apl and apr (rarely used).
6282 apl (n, op) =>>= curry op n
6283 apr (op, m) =>>= fn n => op (n, m)
6285 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6286 provides a reasonably efficient light-weight implementation of sets as
6289 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6290 few new operations; existing lookup and update are now curried to
6291 follow natural argument order (for use with fold etc.);
6292 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6294 * Pure/General: output via the Isabelle channels of
6295 writeln/warning/error etc. is now passed through Output.output, with a
6296 hook for arbitrary transformations depending on the print_mode
6297 (cf. Output.add_mode -- the first active mode that provides a output
6298 function wins). Already formatted output may be embedded into further
6299 text via Output.raw; the result of Pretty.string_of/str_of and derived
6300 functions (string_of_term/cterm/thm etc.) is already marked raw to
6301 accommodate easy composition of diagnostic messages etc. Programmers
6302 rarely need to care about Output.output or Output.raw at all, with
6303 some notable exceptions: Output.output is required when bypassing the
6304 standard channels (writeln etc.), or in token translations to produce
6305 properly formatted results; Output.raw is required when capturing
6306 already output material that will eventually be presented to the user
6307 a second time. For the default print mode, both Output.output and
6308 Output.raw have no effect.
6310 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6311 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6312 cumulative results are displayed at the end of a batch session.
6314 * Pure/General: File.sysify_path and File.quote_sysify path have been
6315 replaced by File.platform_path and File.shell_path (with appropriate
6316 hooks). This provides a clean interface for unusual systems where the
6317 internal and external process view of file names are different.
6319 * Pure: more efficient orders for basic syntactic entities: added
6320 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6321 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6322 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6323 orders now -- potential INCOMPATIBILITY for code that depends on a
6324 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6325 Library.sort_strings on result).
6327 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6328 fold_types traverse types/terms from left to right, observing natural
6329 argument order. Supercedes previous foldl_XXX versions, add_frees,
6330 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6332 * Pure: name spaces have been refined, with significant changes of the
6333 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6334 to extern(_table). The plain name entry path is superceded by a
6335 general 'naming' context, which also includes the 'policy' to produce
6336 a fully qualified name and external accesses of a fully qualified
6337 name; NameSpace.extend is superceded by context dependent
6338 Sign.declare_name. Several theory and proof context operations modify
6339 the naming context. Especially note Theory.restore_naming and
6340 ProofContext.restore_naming to get back to a sane state; note that
6341 Theory.add_path is no longer sufficient to recover from
6342 Theory.absolute_path in particular.
6344 * Pure: new flags short_names (default false) and unique_names
6345 (default true) for controlling output of qualified names. If
6346 short_names is set, names are printed unqualified. If unique_names is
6347 reset, the name prefix is reduced to the minimum required to achieve
6348 the original result when interning again, even if there is an overlap
6349 with earlier declarations.
6351 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6352 now 'extend', and 'merge' gets an additional Pretty.pp argument
6353 (useful for printing error messages). INCOMPATIBILITY.
6355 * Pure: major reorganization of the theory context. Type Sign.sg and
6356 Theory.theory are now identified, referring to the universal
6357 Context.theory (see Pure/context.ML). Actual signature and theory
6358 content is managed as theory data. The old code and interfaces were
6359 spread over many files and structures; the new arrangement introduces
6360 considerable INCOMPATIBILITY to gain more clarity:
6362 Context -- theory management operations (name, identity, inclusion,
6363 parents, ancestors, merge, etc.), plus generic theory data;
6365 Sign -- logical signature and syntax operations (declaring consts,
6366 types, etc.), plus certify/read for common entities;
6368 Theory -- logical theory operations (stating axioms, definitions,
6369 oracles), plus a copy of logical signature operations (consts,
6370 types, etc.); also a few basic management operations (Theory.copy,
6373 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6374 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6375 for convenience -- they merely return the theory.
6377 * Pure: type Type.tsig is superceded by theory in most interfaces.
6379 * Pure: the Isar proof context type is already defined early in Pure
6380 as Context.proof (note that ProofContext.context and Proof.context are
6381 aliases, where the latter is the preferred name). This enables other
6382 Isabelle components to refer to that type even before Isar is present.
6384 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6385 typeK, constK, axiomK, oracleK), but provide explicit operations for
6386 any of these kinds. For example, Sign.intern typeK is now
6387 Sign.intern_type, Theory.hide_space Sign.typeK is now
6388 Theory.hide_types. Also note that former
6389 Theory.hide_classes/types/consts are now
6390 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6391 internalize their arguments! INCOMPATIBILITY.
6393 * Pure: get_thm interface (of PureThy and ProofContext) expects
6394 datatype thmref (with constructors Name and NameSelection) instead of
6395 plain string -- INCOMPATIBILITY;
6397 * Pure: cases produced by proof methods specify options, where NONE
6398 means to remove case bindings -- INCOMPATIBILITY in
6401 * Pure: the following operations retrieve axioms or theorems from a
6402 theory node or theory hierarchy, respectively:
6404 Theory.axioms_of: theory -> (string * term) list
6405 Theory.all_axioms_of: theory -> (string * term) list
6406 PureThy.thms_of: theory -> (string * thm) list
6407 PureThy.all_thms_of: theory -> (string * thm) list
6409 * Pure: print_tac now outputs the goal through the trace channel.
6411 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6412 Reference Toplevel.debug (default false) controls detailed printing
6413 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6414 controls execution profiling -- set to 1 for time and 2 for space
6415 (both increase the runtime).
6417 * Isar session: The initial use of ROOT.ML is now always timed,
6418 i.e. the log will show the actual process times, in contrast to the
6419 elapsed wall-clock time that the outer shell wrapper produces.
6421 * Simplifier: improved handling of bound variables (nameless
6422 representation, avoid allocating new strings). Simprocs that invoke
6423 the Simplifier recursively should use Simplifier.inherit_bounds to
6424 avoid local name clashes. Failure to do so produces warnings
6425 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6426 for further details.
6428 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6429 bindings for all theorems stored within a given theory; this may help
6430 in porting non-Isar theories to Isar ones, while keeping ML proof
6431 scripts for the time being.
6433 * ML operator HTML.with_charset specifies the charset begin used for
6434 generated HTML files. For example:
6436 HTML.with_charset "utf-8" use_thy "Hebrew";
6437 HTML.with_charset "utf-8" use_thy "Chinese";
6442 * Allow symlinks to all proper Isabelle executables (Isabelle,
6443 isabelle, isatool etc.).
6445 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6446 isatool doc, isatool mkdir, display_drafts etc.).
6448 * isatool usedir: option -f allows specification of the ML file to be
6449 used by Isabelle; default is ROOT.ML.
6451 * New isatool version outputs the version identifier of the Isabelle
6452 distribution being used.
6454 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6455 (containing Boolean satisfiability problems) into Isabelle/HOL
6460 New in Isabelle2004 (April 2004)
6461 --------------------------------
6465 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6466 Replaces linorder.ML.
6468 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6469 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6470 (\<a>...\<z>), are now considered normal letters, and can therefore
6471 be used anywhere where an ASCII letter (a...zA...Z) has until
6472 now. COMPATIBILITY: This obviously changes the parsing of some
6473 terms, especially where a symbol has been used as a binder, say
6474 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6475 as an identifier. Fix it by inserting a space around former
6476 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6477 existing theory and ML files.
6479 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6481 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6482 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6483 a normal (but invisible) letter. For multiple letter subscripts repeat
6484 \<^isub> like this: x\<^isub>1\<^isub>2.
6486 * Pure: There are now sub-/superscripts that can span more than one
6487 character. Text between \<^bsub> and \<^esub> is set in subscript in
6488 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6489 superscript. The new control characters are not identifier parts.
6491 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6492 content of "..." to the latex file instead of \isacntrl... . The "..."
6493 may consist of any printable characters excluding the end bracket >.
6495 * Pure: Using new Isar command "finalconsts" (or the ML functions
6496 Theory.add_finals or Theory.add_finals_i) it is now possible to
6497 declare constants "final", which prevents their being given a definition
6498 later. It is useful for constants whose behaviour is fixed axiomatically
6499 rather than definitionally, such as the meta-logic connectives.
6501 * Pure: 'instance' now handles general arities with general sorts
6502 (i.e. intersections of classes),
6504 * Presentation: generated HTML now uses a CSS style sheet to make layout
6505 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6506 It can be changed to alter the colors/layout of generated pages.
6511 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6512 cut_tac, subgoal_tac and thin_tac:
6513 - Now understand static (Isar) contexts. As a consequence, users of Isar
6514 locales are no longer forced to write Isar proof scripts.
6515 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6517 - INCOMPATIBILITY: names of variables to be instantiated may no
6518 longer be enclosed in quotes. Instead, precede variable name with `?'.
6519 This is consistent with the instantiation attribute "where".
6521 * Attributes "where" and "of":
6522 - Now take type variables of instantiated theorem into account when reading
6523 the instantiation string. This fixes a bug that caused instantiated
6524 theorems to have too special types in some circumstances.
6525 - "where" permits explicit instantiations of type variables.
6527 * Calculation commands "moreover" and "also" no longer interfere with
6528 current facts ("this"), admitting arbitrary combinations with "then"
6532 - Goal statements involving the context element "includes" no longer
6533 generate theorems with internal delta predicates (those ending on
6534 "_axioms") in the premise.
6535 Resolve particular premise with <locale>.intro to obtain old form.
6536 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6537 specification and "includes" elements in goal statement.
6538 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6539 [intro?] and [elim?] (respectively) by default.
6540 - Experimental command for instantiation of locales in proof contexts:
6541 instantiate <label>[<attrs>]: <loc>
6542 Instantiates locale <loc> and adds all its theorems to the current context
6543 taking into account their attributes. Label and attrs are optional
6544 modifiers, like in theorem declarations. If present, names of
6545 instantiated theorems are qualified with <label>, and the attributes
6546 <attrs> are applied after any attributes these theorems might have already.
6547 If the locale has assumptions, a chained fact of the form
6548 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6549 are derived. The command does not support old-style locales declared
6550 with "locale (open)".
6551 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6553 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6559 * Proof import: new image HOL4 contains the imported library from
6560 the HOL4 system with about 2500 theorems. It is imported by
6561 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6562 can be used like any other Isabelle image. See
6563 HOL/Import/HOL/README for more information.
6566 - Much improved handling of linear and partial orders.
6567 Reasoners for linear and partial orders are set up for type classes
6568 "linorder" and "order" respectively, and are added to the default simpset
6569 as solvers. This means that the simplifier can build transitivity chains
6570 to solve goals from the assumptions.
6571 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6572 of blast or auto after simplification become unnecessary because the goal
6573 is solved by simplification already.
6575 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6576 all proved in axiomatic type classes for semirings, rings and fields.
6579 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6580 now formalized using the Ring_and_Field theory mentioned above.
6581 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6582 than before, because now they are set up once in a generic manner.
6583 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6584 Look for the general versions in Ring_and_Field (and Power if they concern
6587 * Type "rat" of the rational numbers is now available in HOL-Complex.
6590 - Record types are now by default printed with their type abbreviation
6591 instead of the list of all field types. This can be configured via
6592 the reference "print_record_type_abbr".
6593 - Simproc "record_upd_simproc" for simplification of multiple updates added
6594 (not enabled by default).
6595 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6596 EX x. x = sel r to True (not enabled by default).
6597 - Tactic "record_split_simp_tac" to split and simplify records added.
6599 * 'specification' command added, allowing for definition by
6600 specification. There is also an 'ax_specification' command that
6601 introduces the new constants axiomatically.
6603 * arith(_tac) is now able to generate counterexamples for reals as well.
6605 * HOL-Algebra: new locale "ring" for non-commutative rings.
6607 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6608 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6610 * HOL-Matrix: a first theory for matrices in HOL with an application of
6611 matrix theory to linear programming.
6613 * Unions and Intersections:
6614 The latex output syntax of UN and INT has been changed
6615 from "\Union x \in A. B" to "\Union_{x \in A} B"
6616 i.e. the index formulae has become a subscript.
6617 Similarly for "\Union x. B", and for \Inter instead of \Union.
6619 * Unions and Intersections over Intervals:
6620 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6621 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6622 like in normal math, and corresponding versions for < and for intersection.
6624 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6625 lexicographic dictonary ordering has been added as "lexord".
6627 * ML: the legacy theory structures Int and List have been removed. They had
6628 conflicted with ML Basis Library structures having the same names.
6630 * 'refute' command added to search for (finite) countermodels. Only works
6631 for a fragment of HOL. The installation of an external SAT solver is
6632 highly recommended. See "HOL/Refute.thy" for details.
6634 * 'quickcheck' command: Allows to find counterexamples by evaluating
6635 formulae under an assignment of free variables to random values.
6636 In contrast to 'refute', it can deal with inductive datatypes,
6637 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6643 * Streams now come with concatenation and are part of the HOLCF image
6647 New in Isabelle2003 (May 2003)
6648 ------------------------------
6652 * Provers/simplifier:
6654 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6655 Assumptions are now subject to complete mutual simplification,
6656 not just from left to right. The simplifier now preserves
6657 the order of assumptions.
6659 Potential INCOMPATIBILITY:
6661 -- simp sometimes diverges where the old version did
6662 not, e.g. invoking simp on the goal
6664 [| P (f x); y = x; f x = f y |] ==> Q
6666 now gives rise to the infinite reduction sequence
6668 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6670 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6673 -- Tactics combining classical reasoner and simplification (such as auto)
6674 are also affected by this change, because many of them rely on
6675 simp. They may sometimes diverge as well or yield a different numbers
6676 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6677 in case of problems. Sometimes subsequent calls to the classical
6678 reasoner will fail because a preceeding call to the simplifier too
6679 eagerly simplified the goal, e.g. deleted redundant premises.
6681 - The simplifier trace now shows the names of the applied rewrite rules
6683 - You can limit the number of recursive invocations of the simplifier
6684 during conditional rewriting (where the simplifie tries to solve the
6685 conditions before applying the rewrite rule):
6686 ML "simp_depth_limit := n"
6687 where n is an integer. Thus you can force termination where previously
6688 the simplifier would diverge.
6690 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6692 - No longer aborts on failed congruence proof. Instead, the
6693 congruence is ignored.
6695 * Pure: New generic framework for extracting programs from constructive
6696 proofs. See HOL/Extraction.thy for an example instantiation, as well
6697 as HOL/Extraction for some case studies.
6699 * Pure: The main goal of the proof state is no longer shown by default, only
6700 the subgoals. This behaviour is controlled by a new flag.
6701 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6702 (ML: Proof.show_main_goal).
6704 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6705 rules whose conclusion matches subgoal 1:
6706 PG menu: Isabelle/Isar -> Show me -> matching rules
6707 The rules are ordered by how closely they match the subgoal.
6708 In particular, rules that solve a subgoal outright are displayed first
6709 (or rather last, the way they are printed).
6710 (ML: ProofGeneral.print_intros())
6712 * Pure: New flag trace_unify_fail causes unification to print
6713 diagnostic information (PG: in trace buffer) when it fails. This is
6714 useful for figuring out why single step proofs like rule, erule or
6717 * Pure: Locale specifications now produce predicate definitions
6718 according to the body of text (covering assumptions modulo local
6719 definitions); predicate "loc_axioms" covers newly introduced text,
6720 while "loc" is cumulative wrt. all included locale expressions; the
6721 latter view is presented only on export into the global theory
6722 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6723 on the old view without predicates;
6725 * Pure: predefined locales "var" and "struct" are useful for sharing
6726 parameters (as in CASL, for example); just specify something like
6727 ``var x + var y + struct M'' as import;
6729 * Pure: improved thms_containing: proper indexing of facts instead of
6730 raw theorems; check validity of results wrt. current name space;
6731 include local facts of proof configuration (also covers active
6732 locales), cover fixed variables in index; may use "_" in term
6733 specification; an optional limit for the number of printed facts may
6734 be given (the default is 40);
6736 * Pure: disallow duplicate fact bindings within new-style theory files
6739 * Provers: improved induct method: assumptions introduced by case
6740 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6741 the goal statement); "foo" still refers to all facts collectively;
6743 * Provers: the function blast.overloaded has been removed: all constants
6744 are regarded as potentially overloaded, which improves robustness in exchange
6745 for slight decrease in efficiency;
6747 * Provers/linorder: New generic prover for transitivity reasoning over
6748 linear orders. Note: this prover is not efficient!
6750 * Isar: preview of problems to finish 'show' now produce an error
6751 rather than just a warning (in interactive mode);
6758 - Produces a counter example if it cannot prove a goal.
6759 Note that the counter example may be spurious if the goal is not a formula
6760 of quantifier-free linear arithmetic.
6761 In ProofGeneral the counter example appears in the trace buffer.
6763 - Knows about div k and mod k where k is a numeral of type nat or int.
6765 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6766 linear arithmetic fails. This takes account of quantifiers and divisibility.
6767 Presburger arithmetic can also be called explicitly via presburger(_tac).
6769 * simp's arithmetic capabilities have been enhanced a bit: it now
6770 takes ~= in premises into account (by performing a case split);
6772 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6773 are distributed over a sum of terms;
6775 * New tactic "trans_tac" and method "trans" instantiate
6776 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6779 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6780 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6782 * 'typedef' command has new option "open" to suppress the set
6785 * functions Min and Max on finite sets have been introduced (theory
6788 * attribute [symmetric] now works for relations as well; it turns
6789 (x,y) : R^-1 into (y,x) : R, and vice versa;
6791 * induct over a !!-quantified statement (say !!x1..xn):
6792 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6794 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6795 %x. None. Warning: empty_def now refers to the previously hidden definition
6798 * Algebra: formalization of classical algebra. Intended as base for
6799 any algebraic development in Isabelle. Currently covers group theory
6800 (up to Sylow's theorem) and ring theory (Universal Property of
6801 Univariate Polynomials). Contributions welcome;
6803 * GroupTheory: deleted, since its material has been moved to Algebra;
6805 * Complex: new directory of the complex numbers with numeric constants,
6806 nonstandard complex numbers, and some complex analysis, standard and
6807 nonstandard (Jacques Fleuriot);
6809 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6811 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6814 * Real/HahnBanach: updated and adapted to locales;
6816 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6819 * UNITY: added the Meier-Sanders theory of progress sets;
6821 * MicroJava: bytecode verifier and lightweight bytecode verifier
6822 as abstract algorithms, instantiated to the JVM;
6824 * Bali: Java source language formalization. Type system, operational
6825 semantics, axiomatic semantics. Supported language features:
6826 classes, interfaces, objects,virtual methods, static methods,
6827 static/instance fields, arrays, access modifiers, definite
6828 assignment, exceptions.
6833 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6836 * Main ZF: virtually all theories converted to new-style format;
6841 * Pure: Tactic.prove provides sane interface for internal proofs;
6842 omits the infamous "standard" operation, so this is more appropriate
6843 than prove_goalw_cterm in many situations (e.g. in simprocs);
6845 * Pure: improved error reporting of simprocs;
6847 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6851 *** Document preparation ***
6853 * uses \par instead of \\ for line breaks in theory text. This may
6854 shift some page breaks in large documents. To get the old behaviour
6855 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6857 * minimized dependencies of isabelle.sty and isabellesym.sty on
6860 * \<euro> now needs package babel/greek instead of marvosym (which
6863 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6868 New in Isabelle2002 (March 2002)
6869 --------------------------------
6871 *** Document preparation ***
6873 * greatly simplified document preparation setup, including more
6874 graceful interpretation of isatool usedir -i/-d/-D options, and more
6875 instructive isatool mkdir; users should basically be able to get
6876 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6877 users may run a separate document processing stage manually like this:
6878 "isatool usedir -D output HOL Test && isatool document Test/output";
6880 * theory dependency graph may now be incorporated into documents;
6881 isatool usedir -g true will produce session_graph.eps/.pdf for use
6882 with \includegraphics of LaTeX;
6884 * proper spacing of consecutive markup elements, especially text
6885 blocks after section headings;
6887 * support bold style (for single symbols only), input syntax is like
6888 this: "\<^bold>\<alpha>" or "\<^bold>A";
6890 * \<bullet> is now output as bold \cdot by default, which looks much
6891 better in printed text;
6893 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6894 note that these symbols are currently unavailable in Proof General /
6895 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6897 * isatool latex no longer depends on changed TEXINPUTS, instead
6898 isatool document copies the Isabelle style files to the target
6904 * Pure/Provers: improved proof by cases and induction;
6905 - 'case' command admits impromptu naming of parameters (such as
6907 - 'induct' method divinates rule instantiation from the inductive
6908 claim; no longer requires excessive ?P bindings for proper
6909 instantiation of cases;
6910 - 'induct' method properly enumerates all possibilities of set/type
6911 rules; as a consequence facts may be also passed through *type*
6912 rules without further ado;
6913 - 'induct' method now derives symbolic cases from the *rulified*
6914 rule (before it used to rulify cases stemming from the internal
6915 atomized version); this means that the context of a non-atomic
6916 statement becomes is included in the hypothesis, avoiding the
6917 slightly cumbersome show "PROP ?case" form;
6918 - 'induct' may now use elim-style induction rules without chaining
6919 facts, using ``missing'' premises from the goal state; this allows
6920 rules stemming from inductive sets to be applied in unstructured
6921 scripts, while still benefitting from proper handling of non-atomic
6922 statements; NB: major inductive premises need to be put first, all
6923 the rest of the goal is passed through the induction;
6924 - 'induct' proper support for mutual induction involving non-atomic
6925 rule statements (uses the new concept of simultaneous goals, see
6927 - append all possible rule selections, but only use the first
6928 success (no backtracking);
6929 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6930 - undeclared rule case names default to numbers 1, 2, 3, ...;
6931 - added 'print_induct_rules' (covered by help item in recent Proof
6933 - moved induct/cases attributes to Pure, methods to Provers;
6934 - generic method setup instantiated for FOL and HOL;
6936 * Pure: support multiple simultaneous goal statements, for example
6937 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6938 meta-level mechanism, this acts as if several individual goals had
6939 been stated separately; in particular common proof methods need to be
6940 repeated in order to cover all claims; note that a single elimination
6941 step is *not* sufficient to establish the two conjunctions, so this
6944 assume "A & B" then have A and B .. (*".." fails*)
6946 better use "obtain" in situations as above; alternative refer to
6947 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6949 * Pure: proper integration with ``locales''; unlike the original
6950 version by Florian Kammller, Isar locales package high-level proof
6951 contexts rather than raw logical ones (e.g. we admit to include
6952 attributes everywhere); operations on locales include merge and
6953 rename; support for implicit arguments (``structures''); simultaneous
6954 type-inference over imports and text; see also HOL/ex/Locales.thy for
6957 * Pure: the following commands have been ``localized'', supporting a
6958 target locale specification "(in name)": 'lemma', 'theorem',
6959 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6960 stored both within the locale and at the theory level (exported and
6961 qualified by the locale name);
6963 * Pure: theory goals may now be specified in ``long'' form, with
6964 ad-hoc contexts consisting of arbitrary locale elements. for example
6965 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6966 definitions may be given, too); the result is a meta-level rule with
6967 the context elements being discharged in the obvious way;
6969 * Pure: new proof command 'using' allows to augment currently used
6970 facts after a goal statement ('using' is syntactically analogous to
6971 'apply', but acts on the goal's facts only); this allows chained facts
6972 to be separated into parts given before and after a claim, as in
6973 ``from a and b have C using d and e <proof>'';
6975 * Pure: renamed "antecedent" case to "rule_context";
6977 * Pure: new 'judgment' command records explicit information about the
6978 object-logic embedding (used by several tools internally); no longer
6979 use hard-wired "Trueprop";
6981 * Pure: added 'corollary' command;
6983 * Pure: fixed 'token_translation' command;
6985 * Pure: removed obsolete 'exported' attribute;
6987 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6988 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6989 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6991 * Pure: method 'atomize' presents local goal premises as object-level
6992 statements (atomic meta-level propositions); setup controlled via
6993 rewrite rules declarations of 'atomize' attribute; example
6994 application: 'induct' method with proper rule statements in improper
6997 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
6998 now consider the syntactic context of assumptions, giving a better
6999 chance to get type-inference of the arguments right (this is
7000 especially important for locales);
7002 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7005 * Pure/obtain: the formal conclusion "thesis", being marked as
7006 ``internal'', may no longer be reference directly in the text;
7007 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7010 * Pure: generic 'sym' attribute which declares a rule both as pure
7011 'elim?' and for the 'symmetric' operation;
7013 * Pure: marginal comments ``--'' may now occur just anywhere in the
7014 text; the fixed correlation with particular command syntax has been
7017 * Pure: new method 'rules' is particularly well-suited for proof
7018 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7019 but often produces more compact proof terms with less detours;
7021 * Pure/Provers/classical: simplified integration with pure rule
7022 attributes and methods; the classical "intro?/elim?/dest?"
7023 declarations coincide with the pure ones; the "rule" method no longer
7024 includes classically swapped intros; "intro" and "elim" methods no
7025 longer pick rules from the context; also got rid of ML declarations
7026 AddXIs/AddXEs/AddXDs; all of this has some potential for
7029 * Provers/classical: attribute 'swapped' produces classical inversions
7030 of introduction rules;
7032 * Provers/simplifier: 'simplified' attribute may refer to explicit
7033 rules instead of full simplifier context; 'iff' attribute handles
7036 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7038 * HOL: 'recdef' now fails on unfinished automated proofs, use
7039 "(permissive)" option to recover old behavior;
7041 * HOL: 'inductive' no longer features separate (collective) attributes
7042 for 'intros' (was found too confusing);
7044 * HOL: properly declared induction rules less_induct and
7050 * HOL: moved over to sane numeral syntax; the new policy is as
7053 - 0 and 1 are polymorphic constants, which are defined on any
7054 numeric type (nat, int, real etc.);
7056 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7057 binary representation internally;
7059 - type nat has special constructor Suc, and generally prefers Suc 0
7060 over 1::nat and Suc (Suc 0) over 2::nat;
7062 This change may cause significant problems of INCOMPATIBILITY; here
7063 are some hints on converting existing sources:
7065 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7066 entities, so expressions involving "-" (unary or binary minus) need
7067 to be spaced properly;
7069 - existing occurrences of "1" may need to be constraint "1::nat" or
7070 even replaced by Suc 0; similar for old "2";
7072 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7074 - remove all special provisions on numerals in proofs;
7076 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7077 representation (depends on bin_arith_simps in the default context);
7079 * HOL: symbolic syntax for x^2 (numeral 2);
7081 * HOL: the class of all HOL types is now called "type" rather than
7082 "term"; INCOMPATIBILITY, need to adapt references to this type class
7083 in axclass/classes, instance/arities, and (usually rare) occurrences
7084 in typings (of consts etc.); internally the class is called
7085 "HOL.type", ML programs should refer to HOLogic.typeS;
7087 * HOL/record package improvements:
7088 - new derived operations "fields" to build a partial record section,
7089 "extend" to promote a fixed record to a record scheme, and
7090 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7091 declared as simp by default;
7092 - shared operations ("more", "fields", etc.) now need to be always
7093 qualified) --- potential INCOMPATIBILITY;
7094 - removed "make_scheme" operations (use "make" with "extend") --
7096 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7097 - provides cases/induct rules for use with corresponding Isar
7098 methods (for concrete records, record schemes, concrete more
7099 parts, and schematic more parts -- in that order);
7100 - internal definitions directly based on a light-weight abstract
7101 theory of product types over typedef rather than datatype;
7103 * HOL: generic code generator for generating executable ML code from
7104 specifications; specific support for HOL constructs such as inductive
7105 datatypes and sets, as well as recursive functions; can be invoked
7106 via 'generate_code' theory section;
7108 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7110 * HOL: consolidated and renamed several theories. In particular:
7111 Ord.thy has been absorbed into HOL.thy
7112 String.thy has been absorbed into List.thy
7114 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7115 (beware of argument permutation!);
7117 * HOL: linorder_less_split superseded by linorder_cases;
7119 * HOL/List: "nodups" renamed to "distinct";
7121 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7122 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7123 - Ex_def has changed, now need to use some_eq_ex
7125 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7126 in this (rare) case use:
7128 delSWrapper "split_all_tac"
7129 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7131 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7134 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7135 Isabelle's type classes, ^ on functions and relations has too general
7136 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7137 necessary to attach explicit type constraints;
7139 * HOL/Relation: the prefix name of the infix "O" has been changed from
7140 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7141 renamed accordingly (eg "compI" -> "rel_compI").
7143 * HOL: syntax translations now work properly with numerals and records
7146 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7147 of "lam" -- INCOMPATIBILITY;
7149 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7150 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7151 renamed "Product_Type.unit";
7153 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7155 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7156 the "cases" method);
7158 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7161 * HOL/IMP: updated and converted to new-style theory format; several
7162 parts turned into readable document, with proper Isar proof texts and
7163 some explanations (by Gerwin Klein);
7165 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7167 * HOL-Hyperreal is now a logic image;
7172 * Isar: consts/constdefs supports mixfix syntax for continuous
7175 * Isar: domain package adapted to new-style theory format, e.g. see
7178 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7179 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7180 lift.induct_tac, always use UU instead of Undef;
7182 * HOLCF/IMP: updated and converted to new-style theory;
7187 * Isar: proper integration of logic-specific tools and packages,
7188 including theory commands '(co)inductive', '(co)datatype',
7189 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7190 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7192 * theory Main no longer includes AC; for the Axiom of Choice, base
7193 your theory on Main_ZFC;
7195 * the integer library now covers quotients and remainders, with many
7196 laws relating division to addition, multiplication, etc.;
7198 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7199 typeless version of the formalism;
7201 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7204 * ZF/Induct: new directory for examples of inductive definitions,
7205 including theory Multiset for multiset orderings; converted to
7206 new-style theory format;
7208 * ZF: many new theorems about lists, ordinals, etc.;
7213 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7214 variable proof controls level of detail: 0 = no proofs (only oracle
7215 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7216 also ref manual for further ML interfaces;
7218 * Pure/axclass: removed obsolete ML interface
7219 goal_subclass/goal_arity;
7221 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7222 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7223 separate tokens, so expressions involving minus need to be spaced
7226 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7227 rather than "infixl" or "infixr";
7229 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7230 sort constraint specifications in type inference; e.g. "x::_::foo"
7231 ensures that the type of "x" is of sort "foo" (but not necessarily a
7234 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7235 control output of nested => (types); the default behavior is
7238 * Pure/syntax: builtin parse translation for "_constify" turns valued
7239 tokens into AST constants;
7241 * Pure/syntax: prefer later declarations of translations and print
7242 translation functions; potential INCOMPATIBILITY: need to reverse
7243 multiple declarations for same syntax element constant;
7245 * Pure/show_hyps reset by default (in accordance to existing Isar
7248 * Provers/classical: renamed addaltern to addafter, addSaltern to
7251 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7254 * system: tested support for MacOS X; should be able to get Isabelle +
7255 Proof General to work in a plain Terminal after installing Poly/ML
7256 (e.g. from the Isabelle distribution area) and GNU bash alone
7257 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7258 support requires further installations, e.g. from
7259 http://fink.sourceforge.net/);
7261 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7263 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7264 of 40 MB), cf. ML_OPTIONS;
7266 * system: Proof General keywords specification is now part of the
7267 Isabelle distribution (see etc/isar-keywords.el);
7269 * system: support for persistent Proof General sessions (refrain from
7270 outdating all loaded theories on startup); user may create writable
7271 logic images like this: ``isabelle -q HOL Test'';
7273 * system: smart selection of Isabelle process versus Isabelle
7274 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7275 run both "isabelle" and "Isabelle" even if file names are badly
7276 damaged (executable inspects the case of the first letter of its own
7277 name); added separate "isabelle-process" and "isabelle-interface";
7279 * system: refrain from any attempt at filtering input streams; no
7280 longer support ``8bit'' encoding of old isabelle font, instead proper
7281 iso-latin characters may now be used; the related isatools
7282 "symbolinput" and "nonascii" have disappeared as well;
7284 * system: removed old "xterm" interface (the print modes "xterm" and
7285 "xterm_color" are still available for direct use in a suitable
7290 New in Isabelle99-2 (February 2001)
7291 -----------------------------------
7293 *** Overview of INCOMPATIBILITIES ***
7295 * HOL: please note that theories in the Library and elsewhere often use the
7296 new-style (Isar) format; to refer to their theorems in an ML script you must
7297 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7299 * HOL: inductive package no longer splits induction rule aggressively,
7300 but only as far as specified by the introductions given; the old
7301 format may be recovered via ML function complete_split_rule or attribute
7302 'split_rule (complete)';
7304 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7305 gfp_Tarski to gfp_unfold;
7307 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7309 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7310 relation); infix "^^" has been renamed "``"; infix "``" has been
7311 renamed "`"; "univalent" has been renamed "single_valued";
7313 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7316 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7318 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7320 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7321 consequence, it is no longer monotonic wrt. the local goal context
7322 (which is now passed through the inductive cases);
7324 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7325 \<gg> to \<ggreater>;
7328 *** Document preparation ***
7330 * \isabellestyle{NAME} selects version of Isabelle output (currently
7331 available: are "it" for near math-mode best-style output, "sl" for
7332 slanted text style, and "tt" for plain type-writer; if no
7333 \isabellestyle command is given, output is according to slanted
7336 * support sub/super scripts (for single symbols only), input syntax is
7337 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7339 * some more standard symbols; see Appendix A of the system manual for
7340 the complete list of symbols defined in isabellesym.sty;
7342 * improved isabelle style files; more abstract symbol implementation
7343 (should now use \isamath{...} and \isatext{...} in custom symbol
7346 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7347 state; Note that presentation of goal states does not conform to
7348 actual human-readable proof documents. Please do not include goal
7349 states into document output unless you really know what you are doing!
7351 * proper indentation of antiquoted output with proportional LaTeX
7354 * no_document ML operator temporarily disables LaTeX document
7357 * isatool unsymbolize tunes sources for plain ASCII communication;
7362 * Pure: Isar now suffers initial goal statements to contain unbound
7363 schematic variables (this does not conform to actual readable proof
7364 documents, due to unpredictable outcome and non-compositional proof
7365 checking); users who know what they are doing may use schematic goals
7366 for Prolog-style synthesis of proven results;
7368 * Pure: assumption method (an implicit finishing) now handles actual
7371 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7372 initial goal, declare "that" only as Pure intro (only for single
7373 steps); the "that" rule assumption may now be involved in implicit
7374 finishing, thus ".." becomes a feasible for trivial obtains;
7376 * Pure: default proof step now includes 'intro_classes'; thus trivial
7377 instance proofs may be performed by "..";
7379 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7382 * Pure: more robust selection of calculational rules;
7384 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7385 rule (as well as the assumption rule);
7387 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7388 lemmas, using the graph browser tool;
7390 * Pure: predict failure of "show" in interactive mode;
7392 * Pure: 'thms_containing' now takes actual terms as arguments;
7394 * HOL: improved method 'induct' --- now handles non-atomic goals
7395 (potential INCOMPATIBILITY); tuned error handling;
7397 * HOL: cases and induct rules now provide explicit hints about the
7398 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7399 any remaining facts are inserted into the goal verbatim;
7401 * HOL: local contexts (aka cases) may now contain term bindings as
7402 well; the 'cases' and 'induct' methods new provide a ?case binding for
7403 the result to be shown in each case;
7405 * HOL: added 'recdef_tc' command;
7407 * isatool convert assists in eliminating legacy ML scripts;
7412 * HOL/Library: a collection of generic theories to be used together
7413 with main HOL; the theory loader path already includes this directory
7414 by default; the following existing theories have been moved here:
7415 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7416 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7418 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7419 modelling and verification task performed in Isabelle/HOL +
7420 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7422 * HOL/Algebra: special summation operator SUM no longer exists, it has
7423 been replaced by setsum; infix 'assoc' now has priority 50 (like
7424 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7425 'domain', this makes the theory consistent with mathematical
7428 * HOL basics: added overloaded operations "inverse" and "divide"
7429 (infix "/"), syntax for generic "abs" operation, generic summation
7432 * HOL/typedef: simplified package, provide more useful rules (see also
7435 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7436 now expressed as a proper nested rule (old-style tactic scripts may
7437 require atomize_strip_tac to cope with non-atomic premises);
7439 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7440 to "split_conv" (old name still available for compatibility);
7442 * HOL: improved concrete syntax for strings (e.g. allows translation
7443 rules with string literals);
7445 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7446 and Fleuriot's mechanization of analysis, including the transcendental
7447 functions for the reals;
7449 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7454 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7455 "lam" is displayed as TWO lambda-symbols
7457 * CTT: theory Main now available, containing everything (that is, Bool
7463 * Pure: the Simplifier has been implemented properly as a derived rule
7464 outside of the actual kernel (at last!); the overall performance
7465 penalty in practical applications is about 50%, while reliability of
7466 the Isabelle inference kernel has been greatly improved;
7468 * print modes "brackets" and "no_brackets" control output of nested =>
7469 (types) and ==> (props); the default behaviour is "brackets";
7471 * Provers: fast_tac (and friends) now handle actual object-logic rules
7472 as assumptions as well;
7474 * system: support Poly/ML 4.0;
7476 * system: isatool install handles KDE version 1 or 2;
7480 New in Isabelle99-1 (October 2000)
7481 ----------------------------------
7483 *** Overview of INCOMPATIBILITIES ***
7485 * HOL: simplification of natural numbers is much changed; to partly
7486 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7487 issue the following ML commands:
7489 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7490 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7492 * HOL: simplification no longer dives into case-expressions; this is
7493 controlled by "t.weak_case_cong" for each datatype t;
7495 * HOL: nat_less_induct renamed to less_induct;
7497 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7498 fixsome to patch .thy and .ML sources automatically;
7500 select_equality -> some_equality
7501 select_eq_Ex -> some_eq_ex
7502 selectI2EX -> someI2_ex
7505 select1_equality -> some1_equality
7506 Eps_sym_eq -> some_sym_eq_trivial
7507 Eps_eq -> some_eq_trivial
7509 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7511 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7514 * HOL: the recursion equations generated by 'recdef' are now called
7515 f.simps instead of f.rules;
7517 * HOL: qed_spec_mp now also handles bounded ALL as well;
7519 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7520 sometimes be needed;
7522 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7524 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7526 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7527 product is now "<*>" instead of "Times"; the lexicographic product is
7528 now "<*lex*>" instead of "**";
7530 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7531 of main HOL, but was unused); better use HOL's datatype package;
7533 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7534 the old syntax may be recovered as follows:
7537 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7538 (infixl "\\<oplus>" 100)
7540 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7542 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7543 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7546 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7547 changed from A/r to A//r;
7549 * ZF: new treatment of arithmetic (nat & int) may break some old
7552 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7553 rulify -> rule_format, elimify -> elim_format, ...);
7555 * Isar/Provers: intro/elim/dest attributes changed; renamed
7556 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7557 should have to change intro!! to intro? only); replaced "delrule" by
7560 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7562 * Provers: strengthened force_tac by using new first_best_tac;
7564 * LaTeX document preparation: several changes of isabelle.sty (see
7568 *** Document preparation ***
7570 * formal comments (text blocks etc.) in new-style theories may now
7571 contain antiquotations of thm/prop/term/typ/text to be presented
7572 according to latex print mode; concrete syntax is like this:
7573 @{term[show_types] "f(x) = a + x"};
7575 * isatool mkdir provides easy setup of Isabelle session directories,
7576 including proper document sources;
7578 * generated LaTeX sources are now deleted after successful run
7579 (isatool document -c); may retain a copy somewhere else via -D option
7582 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7583 style files, achieving self-contained LaTeX sources and simplifying
7586 * old-style theories now produce (crude) LaTeX output as well;
7588 * browser info session directories are now self-contained (may be put
7589 on WWW server seperately); improved graphs of nested sessions; removed
7590 graph for 'all sessions';
7592 * several improvements in isabelle style files; \isabellestyle{it}
7593 produces fake math mode output; \isamarkupheader is now \section by
7594 default; see lib/texinputs/isabelle.sty etc.;
7599 * Isar/Pure: local results and corresponding term bindings are now
7600 subject to Hindley-Milner polymorphism (similar to ML); this
7601 accommodates incremental type-inference very nicely;
7603 * Isar/Pure: new derived language element 'obtain' supports
7604 generalized existence reasoning;
7606 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7607 support accumulation of results, without applying any rules yet;
7608 useful to collect intermediate results without explicit name
7609 references, and for use with transitivity rules with more than 2
7612 * Isar/Pure: scalable support for case-analysis type proofs: new
7613 'case' language element refers to local contexts symbolically, as
7614 produced by certain proof methods; internally, case names are attached
7615 to theorems as "tags";
7617 * Isar/Pure: theory command 'hide' removes declarations from
7618 class/type/const name spaces;
7620 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7621 indicate potential overloading;
7623 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7625 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7626 "{a,b,c}" instead of {a,b,c};
7628 * Isar/Pure now provides its own version of intro/elim/dest
7629 attributes; useful for building new logics, but beware of confusion
7630 with the version in Provers/classical;
7632 * Isar/Pure: the local context of (non-atomic) goals is provided via
7633 case name 'antecedent';
7635 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7636 to the current context is now done automatically);
7638 * Isar/Pure: theory command 'method_setup' provides a simple interface
7639 for definining proof methods in ML;
7641 * Isar/Provers: intro/elim/dest attributes changed; renamed
7642 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7643 most cases, one should have to change intro!! to intro? only);
7644 replaced "delrule" by "rule del";
7646 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7647 'symmetric' attribute (the latter supercedes [RS sym]);
7649 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7650 method modifier); 'simp' method: 'only:' modifier removes loopers as
7651 well (including splits);
7653 * Isar/Provers: Simplifier and Classical methods now support all kind
7654 of modifiers used in the past, including 'cong', 'iff', etc.
7656 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7657 of Simplifier and Classical reasoner);
7659 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7660 now support named cases; major packages (inductive, datatype, primrec,
7661 recdef) support case names and properly name parameters;
7663 * Isar/HOL: new transitivity rules for substitution in inequalities --
7664 monotonicity conditions are extracted to be proven at end of
7667 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7670 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7671 split_if split_if_asm; datatype package provides theorems foo.splits =
7672 foo.split foo.split_asm for each datatype;
7674 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7675 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7676 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7677 use "(cases (simplified))" method in proper proof texts);
7679 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7681 * Isar: names of theorems etc. may be natural numbers as well;
7683 * Isar: 'pr' command: optional arguments for goals_limit and
7684 ProofContext.prems_limit; no longer prints theory contexts, but only
7687 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7688 additional print modes to be specified; e.g. "pr(latex)" will print
7689 proof state according to the Isabelle LaTeX style;
7691 * Isar: improved support for emulating tactic scripts, including proof
7692 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7693 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7694 (for HOL datatypes);
7696 * Isar: simplified (more robust) goal selection of proof methods: 1st
7697 goal, all goals, or explicit goal specifier (tactic emulation); thus
7698 'proof method scripts' have to be in depth-first order;
7700 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7702 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7703 should instead use individual commands for printing items
7704 (print_commands, print_methods etc.);
7706 * Isar: added 'nothing' --- the empty list of theorems;
7711 * HOL/MicroJava: formalization of a fragment of Java, together with a
7712 corresponding virtual machine and a specification of its bytecode
7713 verifier and a lightweight bytecode verifier, including proofs of
7714 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7715 Cornelia Pusch (see also the homepage of project Bali at
7716 http://isabelle.in.tum.de/Bali/);
7718 * HOL/Algebra: new theory of rings and univariate polynomials, by
7721 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7722 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7725 * HOL/Lattice: fundamental concepts of lattice theory and order
7726 structures, including duals, properties of bounds versus algebraic
7727 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7728 Theorem for complete lattices etc.; may also serve as a demonstration
7729 for abstract algebraic reasoning using axiomatic type classes, and
7730 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7732 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7735 * HOL/IMPP: extension of IMP with local variables and mutually
7736 recursive procedures, by David von Oheimb;
7738 * HOL/Lambda: converted into new-style theory and document;
7740 * HOL/ex/Multiquote: example of multiple nested quotations and
7741 anti-quotations -- basically a generalized version of de-Bruijn
7742 representation; very useful in avoiding lifting of operations;
7744 * HOL/record: added general record equality rule to simpset; fixed
7745 select-update simplification procedure to handle extended records as
7746 well; admit "r" as field name;
7748 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7749 other numeric types and also as the identity of groups, rings, etc.;
7751 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7752 Types nat and int belong to this axclass;
7754 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7755 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7756 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7757 two terms #m*u and #n*u are replaced by #(m+n)*u
7758 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7759 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7760 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7762 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7763 powerful prover for predicate logic but knows nothing of clasets; see
7764 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7766 * HOL: new version of "case_tac" subsumes both boolean case split and
7767 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7768 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7770 * HOL: simplification no longer dives into case-expressions: only the
7771 selector expression is simplified, but not the remaining arms; to
7772 enable full simplification of case-expressions for datatype t, you may
7773 remove t.weak_case_cong from the simpset, either globally (Delcongs
7774 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7776 * HOL/recdef: the recursion equations generated by 'recdef' for
7777 function 'f' are now called f.simps instead of f.rules; if all
7778 termination conditions are proved automatically, these simplification
7779 rules are added to the simpset, as in primrec; rules may be named
7780 individually as well, resulting in a separate list of theorems for
7783 * HOL/While is a new theory that provides a while-combinator. It
7784 permits the definition of tail-recursive functions without the
7785 provision of a termination measure. The latter is necessary once the
7786 invariant proof rule for while is applied.
7788 * HOL: new (overloaded) notation for the set of elements below/above
7789 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7791 * HOL: theorems impI, allI, ballI bound as "strip";
7793 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7794 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7795 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7797 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7799 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7800 main HOL, but was unused);
7802 * HOL: fewer consts declared as global (e.g. have to refer to
7803 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7805 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7806 in case of overlap with user translations (e.g. judgements over
7807 tuples); (note that the underlying logical represenation is still
7813 * ZF: simplification automatically cancels common terms in arithmetic
7814 expressions over nat and int;
7816 * ZF: new treatment of nat to minimize type-checking: all operators
7817 coerce their operands to a natural number using the function natify,
7818 making the algebraic laws unconditional;
7820 * ZF: as above, for int: operators coerce their operands to an integer
7821 using the function intify;
7823 * ZF: the integer library now contains many of the usual laws for the
7824 orderings, including $<=, and monotonicity laws for $+ and $*;
7826 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7829 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7830 to the simplifier and classical reasoner simultaneously;
7835 * Provers: blast_tac now handles actual object-logic rules as
7836 assumptions; note that auto_tac uses blast_tac internally as well;
7838 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7839 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7841 * Provers: delrules now handles destruct rules as well (no longer need
7842 explicit make_elim);
7844 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7845 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7846 use instead the strong form,
7847 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7848 in HOL, FOL and ZF the function cla_make_elim will create such rules
7849 from destruct-rules;
7851 * Provers: Simplifier.easy_setup provides a fast path to basic
7852 Simplifier setup for new object-logics;
7854 * Pure: AST translation rules no longer require constant head on LHS;
7856 * Pure: improved name spaces: ambiguous output is qualified; support
7857 for hiding of names;
7859 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7860 XSYMBOL_HOME; no longer need to do manual configuration in most
7863 * system: compression of ML heaps images may now be controlled via -c
7864 option of isabelle and isatool usedir (currently only observed by
7867 * system: isatool installfonts may handle X-Symbol fonts as well (very
7868 useful for remote X11);
7870 * system: provide TAGS file for Isabelle sources;
7872 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7875 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7876 timing flag supersedes proof_timing and Toplevel.trace;
7878 * ML: new combinators |>> and |>>> for incremental transformations
7879 with secondary results (e.g. certain theory extensions):
7881 * ML: PureThy.add_defs gets additional argument to indicate potential
7882 overloading (usually false);
7884 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7889 New in Isabelle99 (October 1999)
7890 --------------------------------
7892 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7894 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7895 are no longer simplified. (This allows the simplifier to unfold recursive
7896 functional programs.) To restore the old behaviour, declare
7898 Delcongs [if_weak_cong];
7900 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7903 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7905 * HOL/datatype: mutual_induct_tac no longer exists --
7906 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7908 * HOL/typedef: fixed type inference for representing set; type
7909 arguments now have to occur explicitly on the rhs as type constraints;
7911 * ZF: The con_defs part of an inductive definition may no longer refer
7912 to constants declared in the same theory;
7914 * HOL, ZF: the function mk_cases, generated by the inductive
7915 definition package, has lost an argument. To simplify its result, it
7916 uses the default simpset instead of a supplied list of theorems.
7918 * HOL/List: the constructors of type list are now Nil and Cons;
7920 * Simplifier: the type of the infix ML functions
7921 setSSolver addSSolver setSolver addSolver
7922 is now simpset * solver -> simpset where `solver' is a new abstract type
7923 for packaging solvers. A solver is created via
7924 mk_solver: string -> (thm list -> int -> tactic) -> solver
7925 where the string argument is only a comment.
7930 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7931 decision procedure for linear arithmetic. Currently it is used for
7932 types `nat', `int', and `real' in HOL (see below); it can, should and
7933 will be instantiated for other types and logics as well.
7935 * The simplifier now accepts rewrite rules with flexible heads, eg
7936 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7937 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7943 * New Isabelle/Isar subsystem provides an alternative to traditional
7944 tactical theorem proving; together with the ProofGeneral/isar user
7945 interface it offers an interactive environment for developing human
7946 readable proof documents (Isar == Intelligible semi-automated
7947 reasoning); for further information see isatool doc isar-ref,
7948 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7950 * improved and simplified presentation of theories: better HTML markup
7951 (including colors), graph views in several sizes; isatool usedir now
7952 provides a proper interface for user theories (via -P option); actual
7953 document preparation based on (PDF)LaTeX is available as well (for
7954 new-style theories only); see isatool doc system for more information;
7956 * native support for Proof General, both for classic Isabelle and
7959 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7960 using the graph browser tool;
7962 * Isabelle manuals now also available as PDF;
7964 * theory loader rewritten from scratch (may not be fully
7965 bug-compatible); old loadpath variable has been replaced by show_path,
7966 add_path, del_path, reset_path functions; new operations such as
7967 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7970 * improved isatool install: option -k creates KDE application icon,
7971 option -p DIR installs standalone binaries;
7973 * added ML_PLATFORM setting (useful for cross-platform installations);
7974 more robust handling of platform specific ML images for SML/NJ;
7976 * the settings environment is now statically scoped, i.e. it is never
7977 created again in sub-processes invoked from isabelle, isatool, or
7980 * path element specification '~~' refers to '$ISABELLE_HOME';
7982 * in locales, the "assumes" and "defines" parts may be omitted if
7985 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7988 * new print_mode "HTML";
7990 * new flag show_tags controls display of tags of theorems (which are
7991 basically just comments that may be attached by some tools);
7993 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7994 mode and goal output format:
7996 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
7998 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8000 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8001 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8003 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8005 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8007 * function bind_thms stores lists of theorems (cf. bind_thm);
8009 * new shorthand tactics ftac, eatac, datac, fatac;
8011 * qed (and friends) now accept "" as result name; in that case the
8012 theorem is not stored, but proper checks and presentation of the
8015 * theorem database now also indexes constants "Trueprop", "all",
8016 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8021 ** HOL arithmetic **
8023 * There are now decision procedures for linear arithmetic over nat and
8026 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8027 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8028 are treated as atomic; subformulae not involving type `nat' or `int'
8029 are ignored; quantified subformulae are ignored unless they are
8030 positive universal or negative existential. The tactic has to be
8031 invoked by hand and can be a little bit slow. In particular, the
8032 running time is exponential in the number of occurrences of `min' and
8033 `max', and `-' on `nat'.
8035 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8036 (negated) (in)equalities among the premises and the conclusion into
8037 account (i.e. no compound formulae) and does not know about `min' and
8038 `max', and `-' on `nat'. It is fast and is used automatically by the
8041 NB: At the moment, these decision procedures do not cope with mixed
8042 nat/int formulae where the two parts interact, such as `m < n ==>
8045 * HOL/Numeral provides a generic theory of numerals (encoded
8046 efficiently as bit strings); setup for types nat/int/real is in place;
8047 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8048 int, existing theories and proof scripts may require a few additional
8051 * integer division and remainder can now be performed on constant
8054 * many properties of integer multiplication, division and remainder
8057 * An interface to the Stanford Validity Checker (SVC) is available through the
8058 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8059 are proved automatically. SVC must be installed separately, and its results
8060 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8061 invocation of the underlying oracle). For SVC see
8062 http://verify.stanford.edu/SVC
8064 * IsaMakefile: the HOL-Real target now builds an actual image;
8069 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8070 (in Isabelle/Isar) -- by Gertrud Bauer;
8072 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8073 analysis for assembly languages with subtypes;
8075 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8076 -- avoids syntactic ambiguities and treats state, transition, and
8077 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8078 changed syntax and (many) tactics;
8080 * HOL/inductive: Now also handles more general introduction rules such
8081 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8082 theorems are now maintained within the theory (maintained via the
8085 * HOL/datatype: Now also handles arbitrarily branching datatypes
8086 (using function types) such as
8088 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8090 * HOL/record: record_simproc (part of the default simpset) takes care
8091 of selectors applied to updated records; record_split_tac is no longer
8092 part of the default claset; update_defs may now be removed from the
8093 simpset in many cases; COMPATIBILITY: old behavior achieved by
8095 claset_ref () := claset() addSWrapper record_split_wrapper;
8096 Delsimprocs [record_simproc]
8098 * HOL/typedef: fixed type inference for representing set; type
8099 arguments now have to occur explicitly on the rhs as type constraints;
8101 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8102 names rather than an ML expression;
8104 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8105 supplied later. Program schemes can be defined, such as
8106 "While B C s = (if B s then While B C (C s) else s)"
8107 where the well-founded relation can be chosen after B and C have been given.
8109 * HOL/List: the constructors of type list are now Nil and Cons;
8110 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8111 course, ML tools referring to List.list.op # etc. have to be adapted;
8113 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8114 disabled by default; run isabelle with option -m HOL to get back to
8115 the original Gordon/HOL-style output;
8117 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8118 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8120 * HOL basic syntax simplified (more orthogonal): all variants of
8121 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8122 Eps operator is provided as well: "SOME x. P[x]";
8124 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8126 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8127 thus available for user theories;
8129 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8130 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8133 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8134 several times and then mp;
8139 * the notation <<...>> is now available as a notation for sequences of
8142 * the simplifier is now installed
8144 * the axiom system has been generalized (thanks to Soren Heilmann)
8146 * the classical reasoner now has a default rule database
8151 * new primrec section allows primitive recursive functions to be given
8152 directly (as in HOL) over datatypes and the natural numbers;
8154 * new tactics induct_tac and exhaust_tac for induction (or case
8155 analysis) over datatypes and the natural numbers;
8157 * the datatype declaration of type T now defines the recursor T_rec;
8159 * simplification automatically does freeness reasoning for datatype
8162 * automatic type-inference, with AddTCs command to insert new
8163 type-checking rules;
8165 * datatype introduction rules are now added as Safe Introduction rules
8168 * the syntax "if P then x else y" is now available in addition to
8172 *** Internal programming interfaces ***
8174 * tuned simplifier trace output; new flag debug_simp;
8176 * structures Vartab / Termtab (instances of TableFun) offer efficient
8177 tables indexed by indexname_ord / term_ord (compatible with aconv);
8179 * AxClass.axclass_tac lost the theory argument;
8181 * tuned current_goals_markers semantics: begin / end goal avoids
8182 printing empty lines;
8184 * removed prs and prs_fn hook, which was broken because it did not
8185 include \n in its semantics, forcing writeln to add one
8186 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8187 string -> unit if you really want to output text without newline;
8189 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8190 plain output, interface builders may have to enable 'isabelle_font'
8191 mode to get Isabelle font glyphs as before;
8193 * refined token_translation interface; INCOMPATIBILITY: output length
8194 now of type real instead of int;
8196 * theory loader actions may be traced via new ThyInfo.add_hook
8197 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8198 your own database of information attached to *whole* theories -- as
8199 opposed to intra-theory data slots offered via TheoryDataFun;
8201 * proper handling of dangling sort hypotheses (at last!);
8202 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8203 extra sort hypotheses that can be witnessed from the type signature;
8204 the force_strip_shyps flag is gone, any remaining shyps are simply
8205 left in the theorem (with a warning issued by strip_shyps_warning);
8209 New in Isabelle98-1 (October 1998)
8210 ----------------------------------
8212 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8214 * several changes of automated proof tools;
8216 * HOL: major changes to the inductive and datatype packages, including
8217 some minor incompatibilities of theory syntax;
8219 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8222 * HOL: removed duplicate thms in Arith:
8223 less_imp_add_less should be replaced by trans_less_add1
8224 le_imp_add_le should be replaced by trans_le_add1
8226 * HOL: unary minus is now overloaded (new type constraints may be
8229 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8230 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8231 now taken as an integer constant.
8233 * Pure: ML function 'theory_of' renamed to 'theory';
8239 1. Asm_full_simp_tac is now more aggressive.
8240 1. It will sometimes reorient premises if that increases their power to
8242 2. It does no longer proceed strictly from left to right but may also
8243 rotate premises to achieve further simplification.
8244 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8245 old Asm_full_simp_tac in that it does not rotate premises.
8246 2. The simplifier now knows a little bit about nat-arithmetic.
8248 * Classical reasoner: wrapper mechanism for the classical reasoner now
8249 allows for selected deletion of wrappers, by introduction of names for
8250 wrapper functionals. This implies that addbefore, addSbefore,
8251 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8252 and that adding two tactics with the same name overwrites the first
8253 one (emitting a warning).
8254 type wrapper = (int -> tactic) -> (int -> tactic)
8255 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8256 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8257 delWrapper, delSWrapper: claset * string -> claset
8258 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8260 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8261 semantics; addbefore now affects only the unsafe part of step_tac
8262 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8263 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8266 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8267 compWrapper; added safe wrapper (and access functions for it);
8269 * HOL/split_all_tac is now much faster and fails if there is nothing
8270 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8271 and the names of the automatically generated variables have changed.
8272 split_all_tac has moved within claset() from unsafe wrappers to safe
8273 wrappers, which means that !!-bound variables are split much more
8274 aggressively, and safe_tac and clarify_tac now split such variables.
8275 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8276 Note: the same holds for record_split_tac, which does the job of
8277 split_all_tac for record fields.
8279 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8280 permanently to the default simpset using Addsplits just like
8281 Addsimps. They can be removed via Delsplits just like
8282 Delsimps. Lower-case versions are also available.
8284 * HOL/Simplifier: The rule split_if is now part of the default
8285 simpset. This means that the simplifier will eliminate all occurrences
8286 of if-then-else in the conclusion of a goal. To prevent this, you can
8287 either remove split_if completely from the default simpset by
8288 `Delsplits [split_if]' or remove it in a specific call of the
8289 simplifier using `... delsplits [split_if]'. You can also add/delete
8290 other case splitting rules to/from the default simpset: every datatype
8291 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8292 t is the name of the datatype).
8294 * Classical reasoner / Simplifier combination: new force_tac (and
8295 derivatives Force_tac, force) combines rewriting and classical
8296 reasoning (and whatever other tools) similarly to auto_tac, but is
8297 aimed to solve the given subgoal completely.
8302 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8303 and `goalw': the theory is no longer needed as an explicit argument -
8304 the current theory context is used; assumptions are no longer returned
8305 at the ML-level unless one of them starts with ==> or !!; it is
8306 recommended to convert to these new commands using isatool fixgoal
8307 (backup your sources first!);
8309 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8310 the current theory context, and 'theory' to lookup stored theories;
8312 * new theory section 'locale' for declaring constants, assumptions and
8313 definitions that have local scope;
8315 * new theory section 'nonterminals' for purely syntactic types;
8317 * new theory section 'setup' for generic ML setup functions
8318 (e.g. package initialization);
8320 * the distribution now includes Isabelle icons: see
8321 lib/logo/isabelle-{small,tiny}.xpm;
8323 * isatool install - install binaries with absolute references to
8326 * isatool logo -- create instances of the Isabelle logo (as EPS);
8328 * print mode 'emacs' reserved for Isamode;
8330 * support multiple print (ast) translations per constant name;
8332 * theorems involving oracles are now printed with a suffixed [!];
8337 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8339 * HOL/inductive package reorganized and improved: now supports mutual
8345 oddI "n : EVEN ==> Suc n : ODD"
8346 evenI "n : ODD ==> Suc n : EVEN"
8348 new theorem list "elims" contains an elimination rule for each of the
8349 recursive sets; inductive definitions now handle disjunctive premises
8350 correctly (also ZF);
8352 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8353 "mutual_induct" no longer exists - the induction rule is always
8354 contained in "induct";
8357 * HOL/datatype package re-implemented and greatly improved: now
8358 supports mutually recursive datatypes such as
8361 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8362 | SUM ('a aexp) ('a aexp)
8363 | DIFF ('a aexp) ('a aexp)
8366 'a bexp = LESS ('a aexp) ('a aexp)
8367 | AND ('a bexp) ('a bexp)
8368 | OR ('a bexp) ('a bexp)
8370 as well as indirectly recursive datatypes such as
8373 ('a, 'b) term = Var 'a
8374 | App 'b ((('a, 'b) term) list)
8376 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8377 induction on mutually / indirectly recursive datatypes.
8379 Primrec equations are now stored in theory and can be accessed via
8380 <function_name>.simps.
8384 - Theories using datatypes must now have theory Datatype as an
8386 - The specific <typename>.induct_tac no longer exists - use the
8387 generic induct_tac instead.
8388 - natE has been renamed to nat.exhaust - use exhaust_tac
8389 instead of res_inst_tac ... natE. Note that the variable
8390 names in nat.exhaust differ from the names in natE, this
8391 may cause some "fragile" proofs to fail.
8392 - The theorems split_<typename>_case and split_<typename>_case_asm
8393 have been renamed to <typename>.split and <typename>.split_asm.
8394 - Since default sorts of type variables are now handled correctly,
8395 some datatype definitions may have to be annotated with explicit
8397 - Primrec definitions no longer require function name and type
8398 of recursive argument.
8400 Consider using isatool fixdatatype to adapt your theories and proof
8401 scripts to the new package (backup your sources first!).
8404 * HOL/record package: considerably improved implementation; now
8405 includes concrete syntax for record types, terms, updates; theorems
8406 for surjective pairing and splitting !!-bound record variables; proof
8407 support is as follows:
8409 1) standard conversions (selectors or updates applied to record
8410 constructor terms) are part of the standard simpset;
8412 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8413 made part of standard simpset and claset via addIffs;
8415 3) a tactic for record field splitting (record_split_tac) is part of
8416 the standard claset (addSWrapper);
8418 To get a better idea about these rules you may retrieve them via
8419 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8420 the name of your record type.
8422 The split tactic 3) conceptually simplifies by the following rule:
8424 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8426 Thus any record variable that is bound by meta-all will automatically
8427 blow up into some record constructor term, consequently the
8428 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8429 solve record problems automatically.
8432 * reorganized the main HOL image: HOL/Integ and String loaded by
8433 default; theory Main includes everything;
8435 * automatic simplification of integer sums and comparisons, using cancellation;
8437 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8439 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8441 * many new identities for unions, intersections, set difference, etc.;
8443 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8444 called split_if, split_split, split_sum_case and split_nat_case (to go
8445 with add/delsplits);
8447 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8448 (?x::unit) = (); this is made part of the default simpset, which COULD
8449 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8450 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8451 unit_abs_eta_conv is added in order to counter the effect of
8452 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8455 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8458 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8459 It and 'sym RS equals0D' are now in the default claset, giving automatic
8460 disjointness reasoning but breaking a few old proofs.
8462 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8463 to 'converse' from 'inverse' (for compatibility with ZF and some
8466 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8467 the well-founded relation;
8469 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8470 Compl A. The "Compl" syntax remains available as input syntax for this
8473 * HOL/Update: new theory of function updates:
8474 f(a:=b) == %x. if x=a then b else f x
8475 may also be iterated as in f(a:=b,c:=d,...);
8477 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8480 - new function list_update written xs[i:=v] that updates the i-th
8481 list position. May also be iterated as in xs[i:=a,j:=b,...].
8482 - new function `upt' written [i..j(] which generates the list
8483 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8484 bound write [i..j], which is a shorthand for [i..j+1(].
8485 - new lexicographic orderings and corresponding wellfoundedness theorems.
8488 - removed 'pred' (predecessor) function;
8489 - generalized some theorems about n-1;
8490 - many new laws about "div" and "mod";
8491 - new laws about greatest common divisors (see theory ex/Primes);
8493 * HOL/Relation: renamed the relational operator r^-1 "converse"
8494 instead of "inverse";
8496 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8497 of the multiset ordering;
8499 * directory HOL/Real: a construction of the reals using Dedekind cuts
8500 (not included by default);
8502 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8504 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8505 programs, i.e. different program variables may have different types.
8507 * calling (stac rew i) now fails if "rew" has no effect on the goal
8508 [previously, this check worked only if the rewrite rule was unconditional]
8509 Now rew can involve either definitions or equalities (either == or =).
8514 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8515 only the theorems proved on ZF.ML;
8517 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8518 It and 'sym RS equals0D' are now in the default claset, giving automatic
8519 disjointness reasoning but breaking a few old proofs.
8521 * ZF/Update: new theory of function updates
8522 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8523 may also be iterated as in f(a:=b,c:=d,...);
8525 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8527 * calling (stac rew i) now fails if "rew" has no effect on the goal
8528 [previously, this check worked only if the rewrite rule was unconditional]
8529 Now rew can involve either definitions or equalities (either == or =).
8531 * case_tac provided for compatibility with HOL
8532 (like the old excluded_middle_tac, but with subgoals swapped)
8535 *** Internal programming interfaces ***
8537 * Pure: several new basic modules made available for general use, see
8538 also src/Pure/README;
8540 * improved the theory data mechanism to support encapsulation (data
8541 kind name replaced by private Object.kind, acting as authorization
8542 key); new type-safe user interface via functor TheoryDataFun; generic
8543 print_data function becomes basically useless;
8545 * removed global_names compatibility flag -- all theory declarations
8546 are qualified by default;
8548 * module Pure/Syntax now offers quote / antiquote translation
8549 functions (useful for Hoare logic etc. with implicit dependencies);
8550 see HOL/ex/Antiquote for an example use;
8552 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8555 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8558 * Display.print_goals function moved to Locale.print_goals;
8560 * standard print function for goals supports current_goals_markers
8561 variable for marking begin of proof, end of proof, start of goal; the
8562 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8563 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8568 New in Isabelle98 (January 1998)
8569 --------------------------------
8571 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8573 * changed lexical syntax of terms / types: dots made part of long
8574 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8576 * simpset (and claset) reference variable replaced by functions
8577 simpset / simpset_ref;
8579 * no longer supports theory aliases (via merge) and non-trivial
8580 implicit merge of thms' signatures;
8582 * most internal names of constants changed due to qualified names;
8584 * changed Pure/Sequence interface (see Pure/seq.ML);
8587 *** General Changes ***
8589 * hierachically structured name spaces (for consts, types, axms, thms
8590 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8591 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8592 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8593 long_names for fully qualified output names; NOTE: ML programs
8594 (special tactics, packages etc.) referring to internal names may have
8595 to be adapted to cope with fully qualified names; in case of severe
8596 backward campatibility problems try setting 'global_names' at compile
8597 time to have enrything declared within a flat name space; one may also
8598 fine tune name declarations in theories via the 'global' and 'local'
8601 * reimplemented the implicit simpset and claset using the new anytype
8602 data filed in signatures; references simpset:simpset ref etc. are
8603 replaced by functions simpset:unit->simpset and
8604 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8605 to patch your ML files accordingly;
8607 * HTML output now includes theory graph data for display with Java
8608 applet or isatool browser; data generated automatically via isatool
8609 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8611 * defs may now be conditional; improved rewrite_goals_tac to handle
8612 conditional equations;
8614 * defs now admits additional type arguments, using TYPE('a) syntax;
8616 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8617 creates a new theory node; implicit merge of thms' signatures is
8618 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8619 transfer:theory->thm->thm in (rare) cases;
8621 * improved handling of draft signatures / theories; draft thms (and
8622 ctyps, cterms) are automatically promoted to real ones;
8624 * slightly changed interfaces for oracles: admit many per theory, named
8625 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8627 * print_goals: optional output of const types (set show_consts and
8630 * improved output of warnings (###) and errors (***);
8632 * subgoal_tac displays a warning if the new subgoal has type variables;
8634 * removed old README and Makefiles;
8636 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8638 * removed obsolete init_pps and init_database;
8640 * deleted the obsolete tactical STATE, which was declared by
8641 fun STATE tacfun st = tacfun st st;
8643 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8644 (which abbreviates $HOME);
8646 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8647 use isatool fixseq to adapt your ML programs (this works for fully
8648 qualified references to the Sequence structure only!);
8650 * use_thy no longer requires writable current directory; it always
8651 reloads .ML *and* .thy file, if either one is out of date;
8654 *** Classical Reasoner ***
8656 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8657 tactics that use classical reasoning to simplify a subgoal without
8658 splitting it into several subgoals;
8660 * Safe_tac: like safe_tac but uses the default claset;
8665 * added simplification meta rules:
8666 (asm_)(full_)simplify: simpset -> thm -> thm;
8668 * simplifier.ML no longer part of Pure -- has to be loaded by object
8671 * added prems argument to simplification procedures;
8673 * HOL, FOL, ZF: added infix function `addsplits':
8674 instead of `<simpset> setloop (split_tac <thms>)'
8675 you can simply write `<simpset> addsplits <thms>'
8680 * TYPE('a) syntax for type reflection terms;
8682 * no longer handles consts with name "" -- declare as 'syntax' instead;
8684 * pretty printer: changed order of mixfix annotation preference (again!);
8686 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8691 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8692 with `addloop' of the simplifier to faciliate case splitting in premises.
8694 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8696 * HOL/Auth: new protocol proofs including some for the Internet
8699 * HOL/Map: new theory of `maps' a la VDM;
8701 * HOL/simplifier: simplification procedures nat_cancel_sums for
8702 cancelling out common nat summands from =, <, <= (in)equalities, or
8703 differences; simplification procedures nat_cancel_factor for
8704 cancelling common factor from =, <, <= (in)equalities over natural
8705 sums; nat_cancel contains both kinds of procedures, it is installed by
8706 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8708 * HOL/simplifier: terms of the form
8709 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8711 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8712 and those of the form
8713 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8715 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8718 Each datatype `t' now comes with a theorem `split_t_case' of the form
8720 P(t_case f1 ... fn x) =
8721 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8723 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8726 and a theorem `split_t_case_asm' of the form
8728 P(t_case f1 ... fn x) =
8729 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8731 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8733 which can be added to a simpset via `addsplits'. The existing theorems
8734 expand_list_case and expand_option_case have been renamed to
8735 split_list_case and split_option_case.
8738 - `pred n' is automatically converted to `n-1'.
8739 Users are strongly encouraged not to use `pred' any longer,
8740 because it will disappear altogether at some point.
8741 - Users are strongly encouraged to write "0 < n" rather than
8742 "n ~= 0". Theorems and proof tools have been modified towards this
8746 the function "set_of_list" has been renamed "set" (and its theorems too);
8747 the function "nth" now takes its arguments in the reverse order and
8748 has acquired the infix notation "!" as in "xs!n".
8750 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8752 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8753 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8755 * HOL/record: extensible records with schematic structural subtyping
8756 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8757 still lacks various theorems and concrete record syntax;
8762 * removed "axioms" and "generated by" sections;
8764 * replaced "ops" section by extended "consts" section, which is capable of
8765 handling the continuous function space "->" directly;
8768 . proves theorems immediately and stores them in the theory,
8769 . creates hierachical name space,
8770 . now uses normal mixfix annotations (instead of cinfix...),
8771 . minor changes to some names and values (for consistency),
8772 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8773 . separator between mutual domain defs: changed "," to "and",
8774 . improved handling of sort constraints; now they have to
8775 appear on the left-hand side of the equations only;
8777 * fixed LAM <x,y,zs>.b syntax;
8779 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8780 adm (%x. P (t x)), where P is chainfinite and t continuous;
8785 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8786 with `addloop' of the simplifier to faciliate case splitting in premises.
8788 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8789 in HOL, they strip ALL and --> from proved theorems;
8793 New in Isabelle94-8 (May 1997)
8794 ------------------------------
8796 *** General Changes ***
8798 * new utilities to build / run / maintain Isabelle etc. (in parts
8799 still somewhat experimental); old Makefiles etc. still functional;
8801 * new 'Isabelle System Manual';
8803 * INSTALL text, together with ./configure and ./build scripts;
8805 * reimplemented type inference for greater efficiency, better error
8806 messages and clean internal interface;
8808 * prlim command for dealing with lots of subgoals (an easier way of
8809 setting goals_limit);
8814 * supports alternative (named) syntax tables (parser and pretty
8815 printer); internal interface is provided by add_modesyntax(_i);
8817 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8818 be used in conjunction with the Isabelle symbol font; uses the
8819 "symbols" syntax table;
8821 * added token_translation interface (may translate name tokens in
8822 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8823 the current print_mode); IMPORTANT: user print translation functions
8824 are responsible for marking newly introduced bounds
8825 (Syntax.mark_boundT);
8827 * token translations for modes "xterm" and "xterm_color" that display
8828 names in bold, underline etc. or colors (which requires a color
8831 * infixes may now be declared with names independent of their syntax;
8833 * added typed_print_translation (like print_translation, but may
8834 access type of constant);
8837 *** Classical Reasoner ***
8839 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8840 some limitations. Blast_tac...
8841 + ignores addss, addbefore, addafter; this restriction is intrinsic
8842 + ignores elimination rules that don't have the correct format
8843 (the conclusion MUST be a formula variable)
8844 + ignores types, which can make HOL proofs fail
8845 + rules must not require higher-order unification, e.g. apply_type in ZF
8846 [message "Function Var's argument not a bound variable" relates to this]
8847 + its proof strategy is more general but can actually be slower
8849 * substitution with equality assumptions no longer permutes other
8852 * minor changes in semantics of addafter (now called addaltern); renamed
8853 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8854 (and access functions for it);
8856 * improved combination of classical reasoner and simplifier:
8857 + functions for handling clasimpsets
8858 + improvement of addss: now the simplifier is called _after_ the
8860 + safe variant of addss called addSss: uses safe simplifications
8861 _during_ the safe steps. It is more complete as it allows multiple
8862 instantiations of unknowns (e.g. with slow_tac).
8866 * added interface for simplification procedures (functions that
8867 produce *proven* rewrite rules on the fly, depending on current
8870 * ordering on terms as parameter (used for ordered rewriting);
8872 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8874 * the solver is now split into a safe and an unsafe part.
8875 This should be invisible for the normal user, except that the
8876 functions setsolver and addsolver have been renamed to setSolver and
8877 addSolver; added safe_asm_full_simp_tac;
8882 * a generic induction tactic `induct_tac' which works for all datatypes and
8883 also for type `nat';
8885 * a generic case distinction tactic `exhaust_tac' which works for all
8886 datatypes and also for type `nat';
8888 * each datatype comes with a function `size';
8890 * patterns in case expressions allow tuple patterns as arguments to
8891 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8893 * primrec now also works with type nat;
8895 * recdef: a new declaration form, allows general recursive functions to be
8896 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8898 * the constant for negation has been renamed from "not" to "Not" to
8899 harmonize with FOL, ZF, LK, etc.;
8901 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8904 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8906 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8907 problems in commutative rings, using axiomatic type classes for + and *;
8909 * more examples in HOL/MiniML and HOL/Auth;
8911 * more default rewrite rules for quantifiers, union/intersection;
8913 * a new constant `arbitrary == @x.False';
8915 * HOLCF/IOA replaces old HOL/IOA;
8917 * HOLCF changes: derived all rules and arities
8918 + axiomatic type classes instead of classes
8919 + typedef instead of faking type definitions
8920 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8921 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8922 + eliminated the types void, one, tr
8923 + use unit lift and bool lift (with translations) instead of one and tr
8924 + eliminated blift from Lift3.thy (use Def instead of blift)
8925 all eliminated rules are derived as theorems --> no visible changes ;
8930 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8931 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8932 as ZF_cs addSIs [equalityI];
8936 New in Isabelle94-7 (November 96)
8937 ---------------------------------
8939 * allowing negative levels (as offsets) in prlev and choplev;
8941 * super-linear speedup for large simplifications;
8943 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8944 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8945 FAIL); can suppress it using the command Delsimps (ex_simps @
8946 all_simps); De Morgan laws are also now included, by default;
8948 * improved printing of ==> : ~:
8950 * new object-logic "Sequents" adds linear logic, while replacing LK
8951 and Modal (thanks to Sara Kalvala);
8953 * HOL/Auth: correctness proofs for authentication protocols;
8955 * HOL: new auto_tac combines rewriting and classical reasoning (many
8956 examples on HOL/Auth);
8958 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8959 the rewriter and classical reasoner simultaneously;
8961 * function uresult no longer returns theorems in "standard" format;
8962 regain previous version by: val uresult = standard o uresult;
8969 * oracles -- these establish an interface between Isabelle and trusted
8970 external reasoners, which may deliver results as theorems;
8972 * proof objects (in particular record all uses of oracles);
8974 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8976 * "constdefs" section in theory files;
8978 * "primrec" section (HOL) no longer requires names;
8980 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8987 * reduced space requirements;
8989 * automatic HTML generation from theories;
8991 * theory files no longer require "..." (quotes) around most types;
8993 * new examples, including two proofs of the Church-Rosser theorem;
8995 * non-curried (1994) version of HOL is no longer distributed;
9002 * greatly reduced space requirements;
9004 * theory files (.thy) no longer require \...\ escapes at line breaks;
9006 * searchable theorem database (see the section "Retrieving theorems" on
9007 page 8 of the Reference Manual);
9009 * new examples, including Grabczewski's monumental case study of the
9012 * The previous version of HOL renamed to Old_HOL;
9014 * The new version of HOL (previously called CHOL) uses a curried syntax
9015 for functions. Application looks like f a b instead of f(a,b);
9017 * Mutually recursive inductive definitions finally work in HOL;
9019 * In ZF, pattern-matching on tuples is now available in all abstractions and
9020 translates to the operator "split";
9027 * new infix operator, addss, allowing the classical reasoner to
9028 perform simplification at each step of its search. Example:
9029 fast_tac (cs addss ss)
9031 * a new logic, CHOL, the same as HOL, but with a curried syntax
9032 for functions. Application looks like f a b instead of f(a,b). Also pairs
9033 look like (a,b) instead of <a,b>;
9035 * PLEASE NOTE: CHOL will eventually replace HOL!
9037 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9038 It translates to the operator "split". A new theory of integers is available;
9040 * In ZF, integer numerals now denote two's-complement binary integers.
9041 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9043 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9044 of the Axiom of Choice;
9051 * Significantly faster resolution;
9053 * the different sections in a .thy file can now be mixed and repeated
9056 * Database of theorems for FOL, HOL and ZF. New
9057 commands including qed, qed_goal and bind_thm store theorems in the database.
9059 * Simple database queries: return a named theorem (get_thm) or all theorems of
9060 a given theory (thms_of), or find out what theory a theorem was proved in
9063 * Bugs fixed in the inductive definition and datatype packages;
9065 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9066 and HOL_dup_cs obsolete;
9068 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9071 * Simpler definition of function space in ZF;
9073 * new results about cardinal and ordinal arithmetic in ZF;
9075 * 'subtype' facility in HOL for introducing new types as subsets of existing
9078 :mode=text:wrap=hard:maxLineLen=72: