1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Prover IDE (PIDE) improvements:
11 - markup for bound variables
12 - markup for types of term variables (e.g. displayed as tooltips)
13 - support for user-defined Isar commands within the running session
15 * Updated and extended reference manuals ("isar-ref" and
16 "implementation"); reduced remaining material in old "ref" manual.
18 * Rule attributes in local theory declarations (e.g. locale or class)
19 are now statically evaluated: the resulting theorem is stored instead
20 of the original expression. INCOMPATIBILITY in rare situations, where
21 the historic accident of dynamic re-evaluation in interpretations
24 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
25 declaration, and results are standardized before being stored. Thus
26 old-style "standard" after instantiation or composition of facts
27 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
28 indices of schematic variables.
30 * Renamed some inner syntax categories:
36 Minor INCOMPATIBILITY. Note that in practice "num_const" or
37 "num_position" etc. are mainly used instead (which also include
38 position information via constraints).
40 * Simplified configuration options for syntax ambiguity: see
41 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
42 manual. Minor INCOMPATIBILITY.
44 * Forward declaration of outer syntax keywords within the theory
45 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
46 commands to be used in the same theory where defined.
51 * Attribute "abs_def" turns an equation of the form "f x y == t" into
52 "f == %x y. t", which ensures that "simp" or "unfold" steps always
53 expand it. This also works for object-logic equality. (Formerly
54 undocumented feature.)
56 * Discontinued old "prems" fact, which used to refer to the accidental
57 collection of foundational premises in the context (marked as legacy
60 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
61 instead. INCOMPATIBILITY.
63 * Ancient code generator for SML and its commands 'code_module',
64 'code_library', 'consts_code', 'types_code' have been discontinued.
65 Use commands of the generic code generator instead. INCOMPATIBILITY.
67 * Redundant attribute 'code_inline' has been discontinued. Use
68 'code_unfold' instead. INCOMPATIBILITY.
70 * Dropped attribute 'code_unfold_post' in favor of the its dual
71 'code_abbrev', which yields a common pattern in definitions like
73 definition [code_abbrev]: "f = t"
77 * Sort constraints are now propagated in simultaneous statements, just
78 like type constraints. INCOMPATIBILITY in rare situations, where
79 distinct sorts used to be assigned accidentally. For example:
81 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
83 lemma "P (x::'a)" and "Q (y::'a::bar)"
84 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
89 * Type 'a set is now a proper type constructor (just as before
90 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
91 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
92 sets separate, it is often sufficient to rephrase sets S accidentally
93 used as predicates by "%x. x : S" and predicates P accidentally used
94 as sets by "{x. P x}". Corresponding proofs in a first step should be
95 pruned from any tinkering with former theorems mem_def and
96 Collect_def as far as possible.
97 For developments which deliberately mixed predicates and
98 sets, a planning step is necessary to determine what should become a
99 predicate and what a set. It can be helpful to carry out that step in
100 Isabelle2011-1 before jumping right into the current release.
102 * Code generation by default implements sets as container type rather
103 than predicates. INCOMPATIBILITY.
105 * New type synonym 'a rel = ('a * 'a) set
107 * More default pred/set conversions on a couple of relation operations
108 and predicates. Consolidation of some relation theorems:
110 converse_def ~> converse_unfold
111 rel_comp_def ~> rel_comp_unfold
112 symp_def ~> (dropped, use symp_def and sym_def instead)
113 transp_def ~> transp_trans
114 Domain_def ~> Domain_unfold
115 Range_def ~> Domain_converse [symmetric]
119 * Consolidated various theorem names relating to Finite_Set.fold
122 inf_INFI_fold_inf ~> inf_INF_fold_inf
123 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
124 INFI_fold_inf ~> INF_fold_inf
125 SUPR_fold_sup ~> SUP_fold_sup
126 union_set ~> union_set_fold
127 minus_set ~> minus_set_fold
131 * Consolidated theorem names concerning fold combinators:
133 INFI_set_fold ~> INF_set_fold
134 SUPR_set_fold ~> SUP_set_fold
135 INF_code ~> INF_set_foldr
136 SUP_code ~> SUP_set_foldr
137 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
138 foldl.simps ~> foldl_Nil foldl_Cons
139 foldr_fold_rev ~> foldr_def
140 foldl_fold ~> foldl_def
144 * Dropped rarely useful theorems concerning fold combinators:
145 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
146 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
147 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
148 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
149 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
150 Prefer "List.fold" with canonical argument order, or boil down
151 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
152 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
153 and "List.foldl plus 0", prefer "List.listsum".
155 * Congruence rules Option.map_cong and Option.bind_cong for recursion
156 through option types.
158 * Concrete syntax for case expressions includes constraints for source
159 positions, and thus produces Prover IDE markup for its bindings.
160 INCOMPATIBILITY for old-style syntax translations that augment the
161 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
164 * Discontinued configuration option "syntax_positions": atomic terms
165 in parse trees are always annotated by position constraints.
167 * Finite_Set.fold now qualified. INCOMPATIBILITY.
169 * Renamed some facts on canonical fold on lists, in order to avoid
170 problems with interpretation involving corresponding facts on foldl
171 with the same base names:
173 fold_set_remdups ~> fold_set_fold_remdups
174 fold_set ~> fold_set_fold
175 fold1_set ~> fold1_set_fold
179 * Renamed facts about the power operation on relations, i.e., relpow
180 to match the constant's name:
182 rel_pow_1 ~> relpow_1
183 rel_pow_0_I ~> relpow_0_I
184 rel_pow_Suc_I ~> relpow_Suc_I
185 rel_pow_Suc_I2 ~> relpow_Suc_I2
186 rel_pow_0_E ~> relpow_0_E
187 rel_pow_Suc_E ~> relpow_Suc_E
188 rel_pow_E ~> relpow_E
189 rel_pow_Suc_D2 ~> relpow_Suc_D2
190 rel_pow_Suc_E2 ~> relpow_Suc_E2
191 rel_pow_Suc_D2' ~> relpow_Suc_D2'
192 rel_pow_E2 ~> relpow_E2
193 rel_pow_add ~> relpow_add
194 rel_pow_commute ~> relpow
195 rel_pow_empty ~> relpow_empty:
196 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
197 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
198 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
199 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
200 rel_pow_fun_conv ~> relpow_fun_conv
201 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
202 rel_pow_finite_bounded ~> relpow_finite_bounded
203 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
204 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
205 single_valued_rel_pow ~> single_valued_relpow
209 * New theory HOL/Library/DAList provides an abstract type for association
210 lists with distinct keys.
212 * 'datatype' specifications allow explicit sort constraints.
214 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
215 use theory HOL/Library/Nat_Bijection instead.
217 * Session HOL-Word: Discontinued many redundant theorems specific to
218 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
221 word_sub_alt ~> word_sub_wi
222 word_add_alt ~> word_add_def
223 word_mult_alt ~> word_mult_def
224 word_minus_alt ~> word_minus_def
225 word_0_alt ~> word_0_wi
226 word_1_alt ~> word_1_wi
227 word_add_0 ~> add_0_left
228 word_add_0_right ~> add_0_right
229 word_mult_1 ~> mult_1_left
230 word_mult_1_right ~> mult_1_right
231 word_add_commute ~> add_commute
232 word_add_assoc ~> add_assoc
233 word_add_left_commute ~> add_left_commute
234 word_mult_commute ~> mult_commute
235 word_mult_assoc ~> mult_assoc
236 word_mult_left_commute ~> mult_left_commute
237 word_left_distrib ~> left_distrib
238 word_right_distrib ~> right_distrib
239 word_left_minus ~> left_minus
240 word_diff_0_right ~> diff_0_right
241 word_diff_self ~> diff_self
242 word_sub_def ~> diff_minus
243 word_diff_minus ~> diff_minus
244 word_add_ac ~> add_ac
245 word_mult_ac ~> mult_ac
246 word_plus_ac0 ~> add_0_left add_0_right add_ac
247 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
248 word_order_trans ~> order_trans
249 word_order_refl ~> order_refl
250 word_order_antisym ~> order_antisym
251 word_order_linear ~> linorder_linear
252 lenw1_zero_neq_one ~> zero_neq_one
253 word_number_of_eq ~> number_of_eq
254 word_of_int_add_hom ~> wi_hom_add
255 word_of_int_sub_hom ~> wi_hom_sub
256 word_of_int_mult_hom ~> wi_hom_mult
257 word_of_int_minus_hom ~> wi_hom_neg
258 word_of_int_succ_hom ~> wi_hom_succ
259 word_of_int_pred_hom ~> wi_hom_pred
260 word_of_int_0_hom ~> word_0_wi
261 word_of_int_1_hom ~> word_1_wi
263 * Clarified attribute "mono_set": pure declaration without modifying
264 the result of the fact expression.
266 * "Transitive_Closure.ntrancl": bounded transitive closure on
269 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
271 * "sublists" moved to theory More_List. INCOMPATIBILITY.
273 * Theory Int: Discontinued many legacy theorems specific to type int.
274 INCOMPATIBILITY, use the corresponding generic theorems instead.
276 zminus_zminus ~> minus_minus
277 zminus_0 ~> minus_zero
278 zminus_zadd_distrib ~> minus_add_distrib
279 zadd_commute ~> add_commute
280 zadd_assoc ~> add_assoc
281 zadd_left_commute ~> add_left_commute
285 zadd_0_right ~> add_0_right
286 zadd_zminus_inverse2 ~> left_minus
287 zmult_zminus ~> mult_minus_left
288 zmult_commute ~> mult_commute
289 zmult_assoc ~> mult_assoc
290 zadd_zmult_distrib ~> left_distrib
291 zadd_zmult_distrib2 ~> right_distrib
292 zdiff_zmult_distrib ~> left_diff_distrib
293 zdiff_zmult_distrib2 ~> right_diff_distrib
294 zmult_1 ~> mult_1_left
295 zmult_1_right ~> mult_1_right
296 zle_refl ~> order_refl
297 zle_trans ~> order_trans
298 zle_antisym ~> order_antisym
299 zle_linear ~> linorder_linear
300 zless_linear ~> linorder_less_linear
301 zadd_left_mono ~> add_left_mono
302 zadd_strict_right_mono ~> add_strict_right_mono
303 zadd_zless_mono ~> add_less_le_mono
304 int_0_less_1 ~> zero_less_one
305 int_0_neq_1 ~> zero_neq_one
307 zpower_zadd_distrib ~> power_add
308 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
309 zero_le_zpower_abs ~> zero_le_power_abs
311 * Theory Deriv: Renamed
313 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
315 * New "case_product" attribute to generate a case rule doing multiple
316 case distinctions at the same time. E.g.
318 list.exhaust [case_product nat.exhaust]
320 produces a rule which can be used to perform case distinction on both
323 * Improved code generation of multisets.
325 * New diagnostic command find_unused_assms to find potentially superfluous
326 assumptions in theorems using Quickcheck.
329 - Quickcheck returns variable assignments as counterexamples, which
330 allows to reveal the underspecification of functions under test.
331 For example, refuting "hd xs = x", it presents the variable
332 assignment xs = [] and x = a1 as a counterexample, assuming that
333 any property is false whenever "hd []" occurs in it.
334 These counterexample are marked as potentially spurious, as
335 Quickcheck also returns "xs = []" as a counterexample to the
336 obvious theorem "hd xs = hd xs".
337 After finding a potentially spurious counterexample, Quickcheck
338 continues searching for genuine ones.
339 By default, Quickcheck shows potentially spurious and genuine
340 counterexamples. The option "genuine_only" sets quickcheck to
341 only show genuine counterexamples.
343 - The command 'quickcheck_generator' creates random and exhaustive
344 value generators for a given type and operations.
345 It generates values by using the operations as if they were
346 constructors of that type.
348 - Support for multisets.
350 - Added "use_subtype" options.
353 - Fixed infinite loop caused by the 'peephole_optim' option and
354 affecting 'rat' and 'real'.
357 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
358 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
359 - Renamed "sound" option to "strict".
362 - Added possibility to specify lambda translations scheme as a
363 parenthesized argument (e.g., "by (metis (lifting) ...)").
366 - Renamed from 'try_methods'. INCOMPATIBILITY.
368 * New "eventually_elim" method as a generalized variant of the
369 eventually_elim* rules. Supports structured proofs.
374 * New "case_product" attribute (see HOL).
379 * Antiquotation @{keyword "name"} produces a parser for outer syntax
380 from a minor keyword introduced via theory header declaration.
382 * Antiquotation @{command_spec "name"} produces the
383 Outer_Syntax.command_spec from a major keyword introduced via theory
384 header declaration; it can be passed to Outer_Syntax.command etc.
386 * Local_Theory.define no longer hard-wires default theorem name
387 "foo_def": definitional packages need to make this explicit, and may
388 choose to omit theorem bindings for definitions by using
389 Binding.empty/Attrib.empty_binding. Potential INCOMPATIBILITY for
390 derived definitional packages.
392 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
393 conformance with similar operations in structure Term and Logic.
395 * Antiquotation @{attributes [...]} embeds attribute source
396 representation into the ML text, which is particularly useful with
397 declarations like Local_Theory.note.
399 * Structure Proof_Context follows standard naming scheme. Old
400 ProofContext has been discontinued. INCOMPATIBILITY.
402 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
403 change of semantics: update is applied to auxiliary local theory
406 * Modernized some old-style infix operations:
408 addeqcongs ~> Simplifier.add_eqcong
409 deleqcongs ~> Simplifier.del_eqcong
410 addcongs ~> Simplifier.add_cong
411 delcongs ~> Simplifier.del_cong
412 setmksimps ~> Simplifier.set_mksimps
413 setmkcong ~> Simplifier.set_mkcong
414 setmksym ~> Simplifier.set_mksym
415 setmkeqTrue ~> Simplifier.set_mkeqTrue
416 settermless ~> Simplifier.set_termless
417 setsubgoaler ~> Simplifier.set_subgoaler
418 addsplits ~> Splitter.add_split
419 delsplits ~> Splitter.del_split
423 New in Isabelle2011-1 (October 2011)
424 ------------------------------------
428 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
429 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
431 - Management of multiple theory files directly from the editor
432 buffer store -- bypassing the file-system (no requirement to save
435 - Markup of formal entities within the text buffer, with semantic
436 highlighting, tooltips and hyperlinks to jump to defining source
439 - Improved text rendering, with sub/superscripts in the source
440 buffer (including support for copy/paste wrt. output panel, HTML
441 theory output and other non-Isabelle text boxes).
443 - Refined scheduling of proof checking and printing of results,
444 based on interactive editor view. (Note: jEdit folding and
445 narrowing allows to restrict buffer perspectives explicitly.)
447 - Reduced CPU performance requirements, usable on machines with few
450 - Reduced memory requirements due to pruning of unused document
451 versions (garbage collection).
453 See also ~~/src/Tools/jEdit/README.html for further information,
454 including some remaining limitations.
456 * Theory loader: source files are exclusively located via the master
457 directory of each theory node (where the .thy file itself resides).
458 The global load path (such as src/HOL/Library) has been discontinued.
459 Note that the path element ~~ may be used to reference theories in the
460 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
463 * Theory loader: source files are identified by content via SHA1
464 digests. Discontinued former path/modtime identification and optional
465 ISABELLE_FILE_IDENT plugin scripts.
467 * Parallelization of nested Isar proofs is subject to
468 Goal.parallel_proofs_threshold (default 100). See also isabelle
471 * Name space: former unsynchronized references are now proper
472 configuration options, with more conventional names:
474 long_names ~> names_long
475 short_names ~> names_short
476 unique_names ~> names_unique
478 Minor INCOMPATIBILITY, need to declare options in context like this:
480 declare [[names_unique = false]]
482 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
483 that the result needs to be unique, which means fact specifications
484 may have to be refined after enriching a proof context.
486 * Attribute "case_names" has been refined: the assumptions in each case
487 can be named now by following the case name with [name1 name2 ...].
489 * Isabelle/Isar reference manual has been updated and extended:
490 - "Synopsis" provides a catalog of main Isar language concepts.
491 - Formal references in syntax diagrams, via @{rail} antiquotation.
492 - Updated material from classic "ref" manual, notably about
493 "Classical Reasoner".
498 * Class bot and top require underlying partial order rather than
499 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
501 * Class complete_lattice: generalized a couple of lemmas from sets;
502 generalized theorems INF_cong and SUP_cong. New type classes for
503 complete boolean algebras and complete linear orders. Lemmas
504 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
505 class complete_linorder.
507 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
508 Sup_fun_def, Inf_apply, Sup_apply.
510 Removed redundant lemmas (the right hand side gives hints how to
511 replace them for (metis ...), or (simp only: ...) proofs):
513 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
514 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
515 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
516 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
517 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
518 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
519 Inter_def ~> INF_def, image_def
520 Union_def ~> SUP_def, image_def
521 INT_eq ~> INF_def, and image_def
522 UN_eq ~> SUP_def, and image_def
523 INF_subset ~> INF_superset_mono [OF _ order_refl]
525 More consistent and comprehensive names:
527 INTER_eq_Inter_image ~> INF_def
528 UNION_eq_Union_image ~> SUP_def
532 INF_leI2 ~> INF_lower2
533 le_INFI ~> INF_greatest
535 le_SUPI2 ~> SUP_upper2
537 INFI_bool_eq ~> INF_bool_eq
538 SUPR_bool_eq ~> SUP_bool_eq
539 INFI_apply ~> INF_apply
540 SUPR_apply ~> SUP_apply
541 INTER_def ~> INTER_eq
542 UNION_def ~> UNION_eq
546 * Renamed theory Complete_Lattice to Complete_Lattices.
549 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
550 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
551 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
552 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
554 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
555 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
556 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
559 * Added syntactic classes "inf" and "sup" for the respective
560 constants. INCOMPATIBILITY: Changes in the argument order of the
561 (mostly internal) locale predicates for some derived classes.
563 * Theorem collections ball_simps and bex_simps do not contain theorems
564 referring to UNION any longer; these have been moved to collection
565 UN_ball_bex_simps. INCOMPATIBILITY.
567 * Theory Archimedean_Field: floor now is defined as parameter of a
568 separate type class floor_ceiling.
570 * Theory Finite_Set: more coherent development of fold_set locales:
572 locale fun_left_comm ~> locale comp_fun_commute
573 locale fun_left_comm_idem ~> locale comp_fun_idem
575 Both use point-free characterization; interpretation proofs may need
576 adjustment. INCOMPATIBILITY.
578 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
579 accordance with standard mathematical terminology. INCOMPATIBILITY.
581 * Theory Complex_Main: The locale interpretations for the
582 bounded_linear and bounded_bilinear locales have been removed, in
583 order to reduce the number of duplicate lemmas. Users must use the
584 original names for distributivity theorems, potential INCOMPATIBILITY.
586 divide.add ~> add_divide_distrib
587 divide.diff ~> diff_divide_distrib
588 divide.setsum ~> setsum_divide_distrib
589 mult.add_right ~> right_distrib
590 mult.diff_right ~> right_diff_distrib
591 mult_right.setsum ~> setsum_right_distrib
592 mult_left.diff ~> left_diff_distrib
594 * Theory Complex_Main: Several redundant theorems have been removed or
595 replaced by more general versions. INCOMPATIBILITY.
597 real_diff_def ~> minus_real_def
598 real_divide_def ~> divide_real_def
599 real_less_def ~> less_le
600 real_abs_def ~> abs_real_def
601 real_sgn_def ~> sgn_real_def
602 real_mult_commute ~> mult_commute
603 real_mult_assoc ~> mult_assoc
604 real_mult_1 ~> mult_1_left
605 real_add_mult_distrib ~> left_distrib
606 real_zero_not_eq_one ~> zero_neq_one
607 real_mult_inverse_left ~> left_inverse
608 INVERSE_ZERO ~> inverse_zero
609 real_le_refl ~> order_refl
610 real_le_antisym ~> order_antisym
611 real_le_trans ~> order_trans
612 real_le_linear ~> linear
613 real_le_eq_diff ~> le_iff_diff_le_0
614 real_add_left_mono ~> add_left_mono
615 real_mult_order ~> mult_pos_pos
616 real_mult_less_mono2 ~> mult_strict_left_mono
617 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
618 real_0_le_divide_iff ~> zero_le_divide_iff
619 realpow_two_disj ~> power2_eq_iff
620 real_squared_diff_one_factored ~> square_diff_one_factored
621 realpow_two_diff ~> square_diff_square_factored
622 reals_complete2 ~> complete_real
623 real_sum_squared_expand ~> power2_sum
624 exp_ln_eq ~> ln_unique
626 expi_zero ~> exp_zero
627 lemma_DERIV_subst ~> DERIV_cong
628 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
629 LIMSEQ_const ~> tendsto_const
630 LIMSEQ_norm ~> tendsto_norm
631 LIMSEQ_add ~> tendsto_add
632 LIMSEQ_minus ~> tendsto_minus
633 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
634 LIMSEQ_diff ~> tendsto_diff
635 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
636 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
637 LIMSEQ_mult ~> tendsto_mult
638 LIMSEQ_inverse ~> tendsto_inverse
639 LIMSEQ_divide ~> tendsto_divide
640 LIMSEQ_pow ~> tendsto_power
641 LIMSEQ_setsum ~> tendsto_setsum
642 LIMSEQ_setprod ~> tendsto_setprod
643 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
644 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
645 LIMSEQ_imp_rabs ~> tendsto_rabs
646 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
647 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
648 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
649 LIMSEQ_Complex ~> tendsto_Complex
650 LIM_ident ~> tendsto_ident_at
651 LIM_const ~> tendsto_const
652 LIM_add ~> tendsto_add
653 LIM_add_zero ~> tendsto_add_zero
654 LIM_minus ~> tendsto_minus
655 LIM_diff ~> tendsto_diff
656 LIM_norm ~> tendsto_norm
657 LIM_norm_zero ~> tendsto_norm_zero
658 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
659 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
660 LIM_rabs ~> tendsto_rabs
661 LIM_rabs_zero ~> tendsto_rabs_zero
662 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
663 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
664 LIM_compose ~> tendsto_compose
665 LIM_mult ~> tendsto_mult
666 LIM_scaleR ~> tendsto_scaleR
667 LIM_of_real ~> tendsto_of_real
668 LIM_power ~> tendsto_power
669 LIM_inverse ~> tendsto_inverse
670 LIM_sgn ~> tendsto_sgn
671 isCont_LIM_compose ~> isCont_tendsto_compose
672 bounded_linear.LIM ~> bounded_linear.tendsto
673 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
674 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
675 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
676 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
677 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
678 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
680 * Theory Complex_Main: The definition of infinite series was
681 generalized. Now it is defined on the type class {topological_space,
682 comm_monoid_add}. Hence it is useable also for extended real numbers.
684 * Theory Complex_Main: The complex exponential function "expi" is now
685 a type-constrained abbreviation for "exp :: complex => complex"; thus
686 several polymorphic lemmas about "exp" are now applicable to "expi".
690 - Theory Library/Code_Char_ord provides native ordering of
691 characters in the target language.
693 - Commands code_module and code_library are legacy, use export_code
696 - Method "evaluation" is legacy, use method "eval" instead.
698 - Legacy evaluator "SML" is deactivated by default. May be
699 reactivated by the following theory command:
701 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
703 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
705 * New proof method "induction" that gives induction hypotheses the
706 name "IH", thus distinguishing them from further hypotheses that come
707 from rule induction. The latter are still called "hyps". Method
708 "induction" is a thin wrapper around "induct" and follows the same
711 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
712 still available as a legacy feature for some time.
715 - Added "need" and "total_consts" options.
716 - Reintroduced "show_skolems" option by popular demand.
717 - Renamed attribute: nitpick_def ~> nitpick_unfold.
721 - Use quasi-sound (and efficient) translations by default.
722 - Added support for the following provers: E-ToFoF, LEO-II,
723 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
724 - Automatically preplay and minimize proofs before showing them if
725 this can be done within reasonable time.
726 - sledgehammer available_provers ~> sledgehammer supported_provers.
728 - Added "preplay_timeout", "slicing", "type_enc", "sound",
729 "max_mono_iters", and "max_new_mono_instances" options.
730 - Removed "explicit_apply" and "full_types" options as well as "Full
731 Types" Proof General menu item. INCOMPATIBILITY.
734 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
735 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
739 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
740 "elim:" options. INCOMPATIBILITY.
741 - Introduced 'try' that not only runs 'try_methods' but also
742 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
745 - Added "eval" option to evaluate terms for the found counterexample
746 (currently only supported by the default (exhaustive) tester).
747 - Added post-processing of terms to obtain readable counterexamples
748 (currently only supported by the default (exhaustive) tester).
749 - New counterexample generator quickcheck[narrowing] enables
750 narrowing-based testing. Requires the Glasgow Haskell compiler
751 with its installation location defined in the Isabelle settings
752 environment as ISABELLE_GHC.
753 - Removed quickcheck tester "SML" based on the SML code generator
754 (formly in HOL/Library).
756 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
757 use 'partial_function' instead.
759 * Theory Library/Extended_Reals replaces now the positive extended
760 reals found in probability theory. This file is extended by
761 Multivariate_Analysis/Extended_Real_Limits.
763 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
764 from where it must be imported explicitly if it is really required.
767 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
768 been moved here. INCOMPATIBILITY.
770 * Theory Library/Saturated provides type of numbers with saturated
773 * Theory Library/Product_Lattice defines a pointwise ordering for the
774 product type 'a * 'b, and provides instance proofs for various order
775 and lattice type classes.
777 * Theory Library/Countable now provides the "countable_datatype" proof
778 method for proving "countable" class instances for datatypes.
780 * Theory Library/Cset_Monad allows do notation for computable sets
781 (cset) via the generic monad ad-hoc overloading facility.
783 * Library: Theories of common data structures are split into theories
784 for implementation, an invariant-ensuring type, and connection to an
785 abstract type. INCOMPATIBILITY.
787 - RBT is split into RBT and RBT_Mapping.
788 - AssocList is split and renamed into AList and AList_Mapping.
789 - DList is split into DList_Impl, DList, and DList_Cset.
790 - Cset is split into Cset and List_Cset.
792 * Theory Library/Nat_Infinity has been renamed to
793 Library/Extended_Nat, with name changes of the following types and
796 type inat ~> type enat
798 Infty ~> infinity (overloaded)
802 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
803 been renamed accordingly. INCOMPATIBILITY.
805 * Session Multivariate_Analysis: The euclidean_space type class now
806 fixes a constant "Basis :: 'a set" consisting of the standard
807 orthonormal basis for the type. Users now have the option of
808 quantifying over this set instead of using the "basis" function, e.g.
809 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
811 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
812 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
813 "Cart_nth" and "Cart_lambda" have been respectively renamed to
814 "vec_nth" and "vec_lambda"; theorems mentioning those names have
815 changed to match. Definition theorems for overloaded constants now use
816 the standard "foo_vec_def" naming scheme. A few other theorems have
817 been renamed as follows (INCOMPATIBILITY):
819 Cart_eq ~> vec_eq_iff
820 dist_nth_le_cart ~> dist_vec_nth_le
821 tendsto_vector ~> vec_tendstoI
822 Cauchy_vector ~> vec_CauchyI
824 * Session Multivariate_Analysis: Several duplicate theorems have been
825 removed, and other theorems have been renamed or replaced with more
826 general versions. INCOMPATIBILITY.
828 finite_choice ~> finite_set_choice
829 eventually_conjI ~> eventually_conj
830 eventually_and ~> eventually_conj_iff
831 eventually_false ~> eventually_False
832 setsum_norm ~> norm_setsum
833 Lim_sequentially ~> LIMSEQ_def
834 Lim_ident_at ~> LIM_ident
835 Lim_const ~> tendsto_const
836 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
837 Lim_neg ~> tendsto_minus
838 Lim_add ~> tendsto_add
839 Lim_sub ~> tendsto_diff
840 Lim_mul ~> tendsto_scaleR
841 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
842 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
843 Lim_linear ~> bounded_linear.tendsto
844 Lim_component ~> tendsto_euclidean_component
845 Lim_component_cart ~> tendsto_vec_nth
846 Lim_inner ~> tendsto_inner [OF tendsto_const]
847 dot_lsum ~> inner_setsum_left
848 dot_rsum ~> inner_setsum_right
849 continuous_cmul ~> continuous_scaleR [OF continuous_const]
850 continuous_neg ~> continuous_minus
851 continuous_sub ~> continuous_diff
852 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
853 continuous_mul ~> continuous_scaleR
854 continuous_inv ~> continuous_inverse
855 continuous_at_within_inv ~> continuous_at_within_inverse
856 continuous_at_inv ~> continuous_at_inverse
857 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
858 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
859 continuous_at_component ~> continuous_component [OF continuous_at_id]
860 continuous_on_neg ~> continuous_on_minus
861 continuous_on_sub ~> continuous_on_diff
862 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
863 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
864 continuous_on_mul ~> continuous_on_scaleR
865 continuous_on_mul_real ~> continuous_on_mult
866 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
867 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
868 continuous_on_inverse ~> continuous_on_inv
869 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
870 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
871 subset_interior ~> interior_mono
872 subset_closure ~> closure_mono
873 closure_univ ~> closure_UNIV
874 real_arch_lt ~> reals_Archimedean2
875 real_arch ~> reals_Archimedean3
876 real_abs_norm ~> abs_norm_cancel
877 real_abs_sub_norm ~> norm_triangle_ineq3
878 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
880 * Session HOL-Probability:
881 - Caratheodory's extension lemma is now proved for ring_of_sets.
882 - Infinite products of probability measures are now available.
883 - Sigma closure is independent, if the generator is independent
884 - Use extended reals instead of positive extended
885 reals. INCOMPATIBILITY.
887 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
889 expand_fun_below ~> fun_below_iff
890 below_fun_ext ~> fun_belowI
891 expand_cfun_eq ~> cfun_eq_iff
893 expand_cfun_below ~> cfun_below_iff
894 below_cfun_ext ~> cfun_belowI
895 monofun_fun_fun ~> fun_belowD
896 monofun_fun_arg ~> monofunE
897 monofun_lub_fun ~> adm_monofun [THEN admD]
898 cont_lub_fun ~> adm_cont [THEN admD]
899 cont2cont_Rep_CFun ~> cont2cont_APP
900 cont_Rep_CFun_app ~> cont_APP_app
901 cont_Rep_CFun_app_app ~> cont_APP_app_app
902 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
903 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
904 contlub_cfun ~> lub_APP [symmetric]
905 contlub_LAM ~> lub_LAM [symmetric]
908 lift_distinct1 ~> lift.distinct(1)
909 lift_distinct2 ~> lift.distinct(2)
910 Def_not_UU ~> lift.distinct(2)
911 Def_inject ~> lift.inject
912 below_UU_iff ~> below_bottom_iff
913 eq_UU_iff ~> eq_bottom_iff
916 *** Document preparation ***
918 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
919 isar-ref manual, both for description and actual application of the
922 * Antiquotation @{value} evaluates the given term and presents its
925 * Antiquotations: term style "isub" provides ad-hoc conversion of
926 variables x1, y23 into subscripted form x\<^isub>1,
929 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
930 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
932 * Localized \isabellestyle switch can be used within blocks or groups
935 \isabellestyle{it} %preferred default
936 {\isabellestylett @{text "typewriter stuff"}}
938 * Discontinued special treatment of hard tabulators. Implicit
939 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
945 * The inner syntax of sort/type/term/prop supports inlined YXML
946 representations within quoted string tokens. By encoding logical
947 entities via Term_XML (in ML or Scala) concrete syntax can be
948 bypassed, which is particularly useful for producing bits of text
949 under external program control.
951 * Antiquotations for ML and document preparation are managed as theory
952 data, which requires explicit setup.
954 * Isabelle_Process.is_active allows tools to check if the official
955 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
956 (better known as Proof General).
958 * Structure Proof_Context follows standard naming scheme. Old
959 ProofContext is still available for some time as legacy alias.
961 * Structure Timing provides various operations for timing; supersedes
962 former start_timing/end_timing etc.
964 * Path.print is the official way to show file-system paths to users
965 (including quotes etc.).
967 * Inner syntax: identifiers in parse trees of generic categories
968 "logic", "aprop", "idt" etc. carry position information (disguised as
969 type constraints). Occasional INCOMPATIBILITY with non-compliant
970 translations that choke on unexpected type constraints. Positions can
971 be stripped in ML translations via Syntax.strip_positions /
972 Syntax.strip_positions_ast, or via the syntax constant
973 "_strip_positions" within parse trees. As last resort, positions can
974 be disabled via the configuration option Syntax.positions, which is
975 called "syntax_positions" in Isar attribute syntax.
977 * Discontinued special status of various ML structures that contribute
978 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
979 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
980 refer directly to Ast.Constant, Lexicon.is_identifier,
981 Syntax_Trans.mk_binder_tr etc.
983 * Typed print translation: discontinued show_sorts argument, which is
984 already available via context of "advanced" translation.
986 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
987 goal states; body tactic needs to address all subgoals uniformly.
989 * Slightly more special eq_list/eq_set, with shortcut involving
990 pointer equality (assumes that eq relation is reflexive).
992 * Classical tactics use proper Proof.context instead of historic types
993 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
994 operate directly on Proof.context. Raw type claset retains its use as
995 snapshot of the classical context, which can be recovered via
996 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
997 INCOMPATIBILITY, classical tactics and derived proof methods require
998 proper Proof.context.
1003 * Discontinued support for Poly/ML 5.2, which was the last version
1004 without proper multithreading and TimeLimit implementation.
1006 * Discontinued old lib/scripts/polyml-platform, which has been
1007 obsolete since Isabelle2009-2.
1009 * Various optional external tools are referenced more robustly and
1010 uniformly by explicit Isabelle settings as follows:
1012 ISABELLE_CSDP (formerly CSDP_EXE)
1013 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1014 ISABELLE_OCAML (formerly EXEC_OCAML)
1015 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1016 ISABELLE_YAP (formerly EXEC_YAP)
1018 Note that automated detection from the file-system or search path has
1019 been discontinued. INCOMPATIBILITY.
1021 * Scala layer provides JVM method invocation service for static
1022 methods of type (String)String, see Invoke_Scala.method in ML. For
1025 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1027 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1028 this allows to pass structured values between ML and Scala.
1030 * The IsabelleText fonts includes some further glyphs to support the
1031 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1032 installed a local copy (which is normally *not* required) need to
1033 delete or update it from ~~/lib/fonts/.
1037 New in Isabelle2011 (January 2011)
1038 ----------------------------------
1042 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1043 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1044 useful tooltips and hyperlinks produced from its static analysis. The
1045 bundled component provides an executable Isabelle tool that can be run
1048 Isabelle2011/bin/isabelle jedit
1050 * Significantly improved Isabelle/Isar implementation manual.
1052 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1053 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1054 while the default heap location within that directory lacks that extra
1055 suffix. This isolates multiple Isabelle installations from each
1056 other, avoiding problems with old settings in new versions.
1057 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1059 * Source files are always encoded as UTF-8, instead of old-fashioned
1060 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1061 the following package declarations:
1063 \usepackage[utf8]{inputenc}
1064 \usepackage{textcomp}
1066 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1067 a Unicode character is treated as a single symbol, not a sequence of
1068 non-ASCII bytes as before. Since Isabelle/ML string literals may
1069 contain symbols without further backslash escapes, Unicode can now be
1070 used here as well. Recall that Symbol.explode in ML provides a
1071 consistent view on symbols, while raw explode (or String.explode)
1072 merely give a byte-oriented representation.
1074 * Theory loader: source files are primarily located via the master
1075 directory of each theory node (where the .thy file itself resides).
1076 The global load path is still partially available as legacy feature.
1077 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1078 explicit paths, relatively to the theory.
1080 * Special treatment of ML file names has been discontinued.
1081 Historically, optional extensions .ML or .sml were added on demand --
1082 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1083 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1085 * Various options that affect pretty printing etc. are now properly
1086 handled within the context via configuration options, instead of
1087 unsynchronized references or print modes. There are both ML Config.T
1088 entities and Isar declaration attributes to access these.
1090 ML (Config.T) Isar (attribute)
1092 eta_contract eta_contract
1093 show_brackets show_brackets
1094 show_sorts show_sorts
1095 show_types show_types
1096 show_question_marks show_question_marks
1097 show_consts show_consts
1098 show_abbrevs show_abbrevs
1100 Syntax.ast_trace syntax_ast_trace
1101 Syntax.ast_stat syntax_ast_stat
1102 Syntax.ambiguity_level syntax_ambiguity_level
1104 Goal_Display.goals_limit goals_limit
1105 Goal_Display.show_main_goal show_main_goal
1107 Method.rule_trace rule_trace
1109 Thy_Output.display thy_output_display
1110 Thy_Output.quotes thy_output_quotes
1111 Thy_Output.indent thy_output_indent
1112 Thy_Output.source thy_output_source
1113 Thy_Output.break thy_output_break
1115 Note that corresponding "..._default" references in ML may only be
1116 changed globally at the ROOT session setup, but *not* within a theory.
1117 The option "show_abbrevs" supersedes the former print mode
1118 "no_abbrevs" with inverted meaning.
1120 * More systematic naming of some configuration options.
1123 trace_simp ~> simp_trace
1124 debug_simp ~> simp_debug
1126 * Support for real valued configuration options, using simplistic
1127 floating-point notation that coincides with the inner syntax for
1130 * Support for real valued preferences (with approximative PGIP type):
1131 front-ends need to accept "pgint" values in float notation.
1134 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1137 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1142 * Command 'type_synonym' (with single argument) replaces somewhat
1143 outdated 'types', which is still available as legacy feature for some
1146 * Command 'nonterminal' (with 'and' separated list of arguments)
1147 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1149 * Command 'notepad' replaces former 'example_proof' for
1150 experimentation in Isar without any result. INCOMPATIBILITY.
1152 * Locale interpretation commands 'interpret' and 'sublocale' accept
1153 lists of equations to map definitions in a locale to appropriate
1154 entities in the context of the interpretation. The 'interpretation'
1155 command already provided this functionality.
1157 * Diagnostic command 'print_dependencies' prints the locale instances
1158 that would be activated if the specified expression was interpreted in
1159 the current context. Variant "print_dependencies!" assumes a context
1160 without interpretations.
1162 * Diagnostic command 'print_interps' prints interpretations in proofs
1163 in addition to interpretations in theories.
1165 * Discontinued obsolete 'global' and 'local' commands to manipulate
1166 the theory name space. Rare INCOMPATIBILITY. The ML functions
1167 Sign.root_path and Sign.local_path may be applied directly where this
1168 feature is still required for historical reasons.
1170 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1171 'definition' instead.
1173 * The "prems" fact, which refers to the accidental collection of
1174 foundational premises in the context, is now explicitly marked as
1175 legacy feature and will be discontinued soon. Consider using "assms"
1176 of the head statement or reference facts by explicit names.
1178 * Document antiquotations @{class} and @{type} print classes and type
1181 * Document antiquotation @{file} checks file/directory entries within
1182 the local file system.
1187 * Coercive subtyping: functions can be declared as coercions and type
1188 inference will add them as necessary upon input of a term. Theory
1189 Complex_Main declares real :: nat => real and real :: int => real as
1190 coercions. A coercion function f is declared like this:
1192 declare [[coercion f]]
1194 To lift coercions through type constructors (e.g. from nat => real to
1195 nat list => real list), map functions can be declared, e.g.
1197 declare [[coercion_map map]]
1199 Currently coercion inference is activated only in theories including
1200 real numbers, i.e. descendants of Complex_Main. This is controlled by
1201 the configuration option "coercion_enabled", e.g. it can be enabled in
1202 other theories like this:
1204 declare [[coercion_enabled]]
1206 * Command 'partial_function' provides basic support for recursive
1207 function definitions over complete partial orders. Concrete instances
1208 are provided for i) the option type, ii) tail recursion on arbitrary
1209 types, and iii) the heap monad of Imperative_HOL. See
1210 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1213 * Function package: f.psimps rules are no longer implicitly declared
1214 as [simp]. INCOMPATIBILITY.
1216 * Datatype package: theorems generated for executable equality (class
1217 "eq") carry proper names and are treated as default code equations.
1219 * Inductive package: now offers command 'inductive_simps' to
1220 automatically derive instantiated and simplified equations for
1221 inductive predicates, similar to 'inductive_cases'.
1223 * Command 'enriched_type' allows to register properties of the
1224 functorial structure of types.
1226 * Improved infrastructure for term evaluation using code generator
1227 techniques, in particular static evaluation conversions.
1229 * Code generator: Scala (2.8 or higher) has been added to the target
1232 * Code generator: globbing constant expressions "*" and "Theory.*"
1233 have been replaced by the more idiomatic "_" and "Theory._".
1236 * Code generator: export_code without explicit file declaration prints
1237 to standard output. INCOMPATIBILITY.
1239 * Code generator: do not print function definitions for case
1240 combinators any longer.
1242 * Code generator: simplification with rules determined with
1243 src/Tools/Code/code_simp.ML and method "code_simp".
1245 * Code generator for records: more idiomatic representation of record
1246 types. Warning: records are not covered by ancient SML code
1247 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1248 rep_datatype declaration helps to succeed then:
1252 rep_datatype foo_ext ...
1254 * Records: logical foundation type for records does not carry a
1255 '_type' suffix any longer (obsolete due to authentic syntax).
1258 * Quickcheck now by default uses exhaustive testing instead of random
1259 testing. Random testing can be invoked by "quickcheck [random]",
1260 exhaustive testing by "quickcheck [exhaustive]".
1262 * Quickcheck instantiates polymorphic types with small finite
1263 datatypes by default. This enables a simple execution mechanism to
1264 handle quantifiers and function equality over the finite datatypes.
1266 * Quickcheck random generator has been renamed from "code" to
1267 "random". INCOMPATIBILITY.
1269 * Quickcheck now has a configurable time limit which is set to 30
1270 seconds by default. This can be changed by adding [timeout = n] to the
1271 quickcheck command. The time limit for Auto Quickcheck is still set
1274 * Quickcheck in locales considers interpretations of that locale for
1275 counter example search.
1278 - Added "smt" and "remote_smt" provers based on the "smt" proof
1279 method. See the Sledgehammer manual for details ("isabelle doc
1282 sledgehammer atp_info ~> sledgehammer running_provers
1283 sledgehammer atp_kill ~> sledgehammer kill_provers
1284 sledgehammer available_atps ~> sledgehammer available_provers
1287 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1288 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1289 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1290 (and "ms" and "min" are no longer supported)
1295 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1296 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1298 - Added support for partial quotient types.
1299 - Added local versions of the "Nitpick.register_xxx" functions.
1300 - Added "whack" option.
1301 - Allow registration of quotient types as codatatypes.
1302 - Improved "merge_type_vars" option to merge more types.
1303 - Removed unsound "fast_descrs" option.
1304 - Added custom symmetry breaking for datatypes, making it possible to reach
1305 higher cardinalities.
1306 - Prevent the expansion of too large definitions.
1308 * Proof methods "metis" and "meson" now have configuration options
1309 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1310 to diagnose these tools. E.g.
1312 using [[metis_trace = true]]
1314 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1315 manually as command 'solve_direct'.
1317 * The default SMT solver Z3 must be enabled explicitly (due to
1318 licensing issues) by setting the environment variable
1319 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1320 commercial applications, the SMT solver CVC3 is provided as fall-back;
1321 changing the SMT solver is done via the configuration option
1324 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1325 i.e. "remote_cvc3" and "remote_z3".
1327 * Added basic SMT support for datatypes, records, and typedefs using
1328 the oracle mode (no proofs). Direct support of pairs has been dropped
1329 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1330 support for a similar behavior). Minor INCOMPATIBILITY.
1332 * Changed SMT configuration options:
1334 z3_proofs ~> smt_oracle (with inverted meaning)
1335 z3_trace_assms ~> smt_trace_used_facts
1348 * Boogie output files (.b2i files) need to be declared in the theory
1351 * Simplification procedure "list_to_set_comprehension" rewrites list
1352 comprehensions applied to List.set to set comprehensions. Occasional
1353 INCOMPATIBILITY, may be deactivated like this:
1355 declare [[simproc del: list_to_set_comprehension]]
1357 * Removed old version of primrec package. INCOMPATIBILITY.
1359 * Removed simplifier congruence rule of "prod_case", as has for long
1360 been the case with "split". INCOMPATIBILITY.
1362 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1364 * Removed [split_format ... and ... and ...] version of
1365 [split_format]. Potential INCOMPATIBILITY.
1367 * Predicate "sorted" now defined inductively, with nice induction
1368 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1370 * Constant "contents" renamed to "the_elem", to free the generic name
1371 contents for other uses. INCOMPATIBILITY.
1373 * Renamed class eq and constant eq (for code generation) to class
1374 equal and constant equal, plus renaming of related facts and various
1375 tuning. INCOMPATIBILITY.
1377 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1379 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1382 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1383 avoid confusion with finite sets. INCOMPATIBILITY.
1385 * Abandoned locales equiv, congruent and congruent2 for equivalence
1386 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1389 * Some previously unqualified names have been qualified:
1396 Trueprop ~> HOL.Trueprop
1401 op --> ~> HOL.implies
1413 Pair ~> Product_Type.Pair
1414 fst ~> Product_Type.fst
1415 snd ~> Product_Type.snd
1416 curry ~> Product_Type.curry
1418 Collect ~> Set.Collect
1422 * More canonical naming convention for some fundamental definitions:
1424 bot_bool_eq ~> bot_bool_def
1425 top_bool_eq ~> top_bool_def
1426 inf_bool_eq ~> inf_bool_def
1427 sup_bool_eq ~> sup_bool_def
1428 bot_fun_eq ~> bot_fun_def
1429 top_fun_eq ~> top_fun_def
1430 inf_fun_eq ~> inf_fun_def
1431 sup_fun_eq ~> sup_fun_def
1435 * More stylized fact names:
1437 expand_fun_eq ~> fun_eq_iff
1438 expand_set_eq ~> set_eq_iff
1440 nat_number ~> eval_nat_numeral
1444 * Refactoring of code-generation specific operations in theory List:
1450 mem_iff ~> member_def
1451 null_empty ~> null_def
1453 INCOMPATIBILITY. Note that these were not supposed to be used
1454 regularly unless for striking reasons; their main purpose was code
1457 Various operations from the Haskell prelude are used for generating
1460 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1461 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1462 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1464 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1465 "*" and "+" respectively. INCOMPATIBILITY.
1467 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1468 "Sum_Type.Plus" instead.
1470 * Constant "split" has been merged with constant "prod_case"; names of
1471 ML functions, facts etc. involving split have been retained so far,
1472 though. INCOMPATIBILITY.
1474 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1475 instead. INCOMPATIBILITY.
1477 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1480 * Former theory Library/Enum is now part of the HOL-Main image.
1481 INCOMPATIBILITY: all constants of the Enum theory now have to be
1482 referred to by its qualified name.
1485 nlists ~> Enum.nlists
1486 product ~> Enum.product
1488 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1489 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1492 * Theory Library/SetsAndFunctions has been split into
1493 Library/Function_Algebras and Library/Set_Algebras; canonical names
1494 for instance definitions for functions; various improvements.
1497 * Theory Library/Multiset provides stable quicksort implementation of
1500 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1503 * Session Multivariate_Analysis: introduced a type class for euclidean
1504 space. Most theorems are now stated in terms of euclidean spaces
1505 instead of finite cartesian products.
1508 real ^ 'n ~> 'a::real_vector
1509 ~> 'a::euclidean_space
1510 ~> 'a::ordered_euclidean_space
1511 (depends on your needs)
1515 \<chi> x. _ ~> \<chi>\<chi> x. _
1518 Also note that the indices are now natural numbers and not from some
1519 finite type. Finite cartesian products of euclidean spaces, products
1520 of euclidean spaces the real and complex numbers are instantiated to
1521 be euclidean_spaces. INCOMPATIBILITY.
1523 * Session Probability: introduced pextreal as positive extended real
1524 numbers. Use pextreal as value for measures. Introduce the
1525 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1526 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1527 the integral in Multivariate Analysis. INCOMPATIBILITY.
1529 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1532 * Session SPARK (with image HOL-SPARK) provides commands to load and
1533 prove verification conditions generated by the SPARK Ada program
1534 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1539 * Theorems for additive ring operations (locale abelian_monoid and
1540 descendants) are generated by interpretation from their multiplicative
1541 counterparts. Names (in particular theorem names) have the mandatory
1542 qualifier 'add'. Previous theorem names are redeclared for
1545 * Structure "int_ring" is now an abbreviation (previously a
1546 definition). This fits more natural with advanced interpretations.
1551 * The domain package now runs in definitional mode by default: The
1552 former command 'new_domain' is now called 'domain'. To use the domain
1553 package in its original axiomatic mode, use 'domain (unsafe)'.
1556 * The new class "domain" is now the default sort. Class "predomain"
1557 is an unpointed version of "domain". Theories can be updated by
1558 replacing sort annotations as shown below. INCOMPATIBILITY.
1560 'a::type ~> 'a::countable
1561 'a::cpo ~> 'a::predomain
1562 'a::pcpo ~> 'a::domain
1564 * The old type class "rep" has been superseded by class "domain".
1565 Accordingly, users of the definitional package must remove any
1566 "default_sort rep" declarations. INCOMPATIBILITY.
1568 * The domain package (definitional mode) now supports unpointed
1569 predomain argument types, as long as they are marked 'lazy'. (Strict
1570 arguments must be in class "domain".) For example, the following
1571 domain definition now works:
1573 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1575 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1576 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1577 'a option, and 'a list. Additionally, it configures fixrec and the
1578 domain package to work with these types. For example:
1580 fixrec isInl :: "('a + 'b) u -> tr"
1581 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1583 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1585 * The "(permissive)" option of fixrec has been replaced with a
1586 per-equation "(unchecked)" option. See
1587 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1589 * The "bifinite" class no longer fixes a constant "approx"; the class
1590 now just asserts that such a function exists. INCOMPATIBILITY.
1592 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1593 defines an embedding of type 'a defl into udom by default; instances
1594 of "bifinite" and "domain" classes are available in
1595 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1597 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1599 * The predicate "directed" has been removed. INCOMPATIBILITY.
1601 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1603 * The function "cprod_map" has been renamed to "prod_map".
1606 * The monadic bind operator on each powerdomain has new binder syntax
1607 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1608 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1610 * The infix syntax for binary union on each powerdomain has changed
1611 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1612 syntax. INCOMPATIBILITY.
1614 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1615 still supported as an input translation.
1617 * Renamed some theorems (the original names are also still available).
1619 expand_fun_below ~> fun_below_iff
1620 below_fun_ext ~> fun_belowI
1621 expand_cfun_eq ~> cfun_eq_iff
1622 ext_cfun ~> cfun_eqI
1623 expand_cfun_below ~> cfun_below_iff
1624 below_cfun_ext ~> cfun_belowI
1625 cont2cont_Rep_CFun ~> cont2cont_APP
1627 * The Abs and Rep functions for various types have changed names.
1628 Related theorem names have also changed to match. INCOMPATIBILITY.
1630 Rep_CFun ~> Rep_cfun
1631 Abs_CFun ~> Abs_cfun
1632 Rep_Sprod ~> Rep_sprod
1633 Abs_Sprod ~> Abs_sprod
1634 Rep_Ssum ~> Rep_ssum
1635 Abs_Ssum ~> Abs_ssum
1637 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1638 been renamed to *_bottom_iff. INCOMPATIBILITY.
1640 * Various changes to bisimulation/coinduction with domain package:
1642 - Definitions of "bisim" constants no longer mention definedness.
1643 - With mutual recursion, "bisim" predicate is now curried.
1644 - With mutual recursion, each type gets a separate coind theorem.
1645 - Variable names in bisim_def and coinduct rules have changed.
1649 * Case combinators generated by the domain package for type "foo" are
1650 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1652 * Several theorems have been renamed to more accurately reflect the
1653 names of constants and types involved. INCOMPATIBILITY.
1655 thelub_const ~> lub_const
1656 lub_const ~> is_lub_const
1658 is_lub_lub ~> is_lubD2
1660 unique_lub ~> is_lub_unique
1661 is_ub_lub ~> is_lub_rangeD1
1662 lub_bin_chain ~> is_lub_bin_chain
1663 lub_fun ~> is_lub_fun
1664 thelub_fun ~> lub_fun
1665 thelub_cfun ~> lub_cfun
1666 thelub_Pair ~> lub_Pair
1667 lub_cprod ~> is_lub_prod
1668 thelub_cprod ~> lub_prod
1669 minimal_cprod ~> minimal_prod
1670 inst_cprod_pcpo ~> inst_prod_pcpo
1672 compact_UU ~> compact_bottom
1673 deflation_UU ~> deflation_bottom
1674 finite_deflation_UU ~> finite_deflation_bottom
1676 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1678 sq_ord_less_eq_trans ~> below_eq_trans
1679 sq_ord_eq_less_trans ~> eq_below_trans
1680 refl_less ~> below_refl
1681 trans_less ~> below_trans
1682 antisym_less ~> below_antisym
1683 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1684 box_less ~> box_below
1685 rev_trans_less ~> rev_below_trans
1686 not_less2not_eq ~> not_below2not_eq
1687 less_UU_iff ~> below_UU_iff
1688 flat_less_iff ~> flat_below_iff
1689 adm_less ~> adm_below
1690 adm_not_less ~> adm_not_below
1691 adm_compact_not_less ~> adm_compact_not_below
1692 less_fun_def ~> below_fun_def
1693 expand_fun_less ~> fun_below_iff
1694 less_fun_ext ~> fun_belowI
1695 less_discr_def ~> below_discr_def
1696 discr_less_eq ~> discr_below_eq
1697 less_unit_def ~> below_unit_def
1698 less_cprod_def ~> below_prod_def
1699 prod_lessI ~> prod_belowI
1700 Pair_less_iff ~> Pair_below_iff
1701 fst_less_iff ~> fst_below_iff
1702 snd_less_iff ~> snd_below_iff
1703 expand_cfun_less ~> cfun_below_iff
1704 less_cfun_ext ~> cfun_belowI
1705 injection_less ~> injection_below
1706 less_up_def ~> below_up_def
1707 not_Iup_less ~> not_Iup_below
1708 Iup_less ~> Iup_below
1710 Def_inject_less_eq ~> Def_below_Def
1711 Def_less_is_eq ~> Def_below_iff
1712 spair_less_iff ~> spair_below_iff
1713 less_sprod ~> below_sprod
1714 spair_less ~> spair_below
1715 sfst_less_iff ~> sfst_below_iff
1716 ssnd_less_iff ~> ssnd_below_iff
1717 fix_least_less ~> fix_least_below
1718 dist_less_one ~> dist_below_one
1719 less_ONE ~> below_ONE
1720 ONE_less_iff ~> ONE_below_iff
1721 less_sinlD ~> below_sinlD
1722 less_sinrD ~> below_sinrD
1727 * All constant names are now qualified internally and use proper
1728 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1732 * Greater support for structured proofs involving induction or case analysis.
1734 * Much greater use of special symbols.
1736 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1740 * Antiquotation @{assert} inlines a function bool -> unit that raises
1741 Fail if the argument is false. Due to inlining the source position of
1742 failed assertions is included in the error output.
1744 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1745 text is in practice always evaluated with a stable theory checkpoint.
1746 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1748 * Antiquotation @{theory A} refers to theory A from the ancestry of
1749 the current context, not any accidental theory loader state as before.
1750 Potential INCOMPATIBILITY, subtle change in semantics.
1752 * Syntax.pretty_priority (default 0) configures the required priority
1753 of pretty-printed output and thus affects insertion of parentheses.
1755 * Syntax.default_root (default "any") configures the inner syntax
1756 category (nonterminal symbol) for parsing of terms.
1758 * Former exception Library.UnequalLengths now coincides with
1759 ListPair.UnequalLengths.
1761 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1762 main functionality is provided by structure Simplifier.
1764 * Renamed raw "explode" function to "raw_explode" to emphasize its
1765 meaning. Note that internally to Isabelle, Symbol.explode is used in
1766 almost all situations.
1768 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1769 See implementation manual for further details on exceptions in
1772 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1775 * Renamed structure PureThy to Pure_Thy and moved most of its
1776 operations to structure Global_Theory, to emphasize that this is
1777 rarely-used global-only stuff.
1779 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1780 instead (or tracing for high-volume output).
1782 * Configuration option show_question_marks only affects regular pretty
1783 printing of types and terms, not raw Term.string_of_vname.
1785 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1786 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1787 @{thms} for most purposes.
1789 * ML structure Unsynchronized is never opened, not even in Isar
1790 interaction mode as before. Old Unsynchronized.set etc. have been
1791 discontinued -- use plain := instead. This should be *rare* anyway,
1792 since modern tools always work via official context data, notably
1793 configuration options.
1795 * Parallel and asynchronous execution requires special care concerning
1796 interrupts. Structure Exn provides some convenience functions that
1797 avoid working directly with raw Interrupt. User code must not absorb
1798 interrupts -- intermediate handling (for cleanup etc.) needs to be
1799 followed by re-raising of the original exception. Another common
1800 source of mistakes are "handle _" patterns, which make the meaning of
1801 the program subject to physical effects of the environment.
1805 New in Isabelle2009-2 (June 2010)
1806 ---------------------------------
1810 * Authentic syntax for *all* logical entities (type classes, type
1811 constructors, term constants): provides simple and robust
1812 correspondence between formal entities and concrete syntax. Within
1813 the parse tree / AST representations, "constants" are decorated by
1814 their category (class, type, const) and spelled out explicitly with
1815 their full internal name.
1817 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1818 and translations (translation rules and translation functions in ML).
1819 Some hints on upgrading:
1821 - Many existing uses of 'syntax' and 'translations' can be replaced
1822 by more modern 'type_notation', 'notation' and 'abbreviation',
1823 which are independent of this issue.
1825 - 'translations' require markup within the AST; the term syntax
1826 provides the following special forms:
1828 CONST c -- produces syntax version of constant c from context
1829 XCONST c -- literally c, checked as constant from context
1830 c -- literally c, if declared by 'syntax'
1832 Plain identifiers are treated as AST variables -- occasionally the
1833 system indicates accidental variables via the error "rhs contains
1836 Type classes and type constructors are marked according to their
1837 concrete syntax. Some old translations rules need to be written
1838 for the "type" category, using type constructor application
1839 instead of pseudo-term application of the default category
1842 - 'parse_translation' etc. in ML may use the following
1845 @{class_syntax c} -- type class c within parse tree / AST
1846 @{term_syntax c} -- type constructor c within parse tree / AST
1847 @{const_syntax c} -- ML version of "CONST c" above
1848 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1850 - Literal types within 'typed_print_translations', i.e. those *not*
1851 represented as pseudo-terms are represented verbatim. Use @{class
1852 c} or @{type_name c} here instead of the above syntax
1855 Note that old non-authentic syntax was based on unqualified base
1856 names, so all of the above "constant" names would coincide. Recall
1857 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1858 diagnose syntax problems.
1860 * Type constructors admit general mixfix syntax, not just infix.
1862 * Concrete syntax may be attached to local entities without a proof
1863 body, too. This works via regular mixfix annotations for 'fix',
1864 'def', 'obtain' etc. or via the explicit 'write' command, which is
1865 similar to the 'notation' command in theory specifications.
1867 * Discontinued unnamed infix syntax (legacy feature for many years) --
1868 need to specify constant name and syntax separately. Internal ML
1869 datatype constructors have been renamed from InfixName to Infix etc.
1870 Minor INCOMPATIBILITY.
1872 * Schematic theorem statements need to be explicitly markup as such,
1873 via commands 'schematic_lemma', 'schematic_theorem',
1874 'schematic_corollary'. Thus the relevance of the proof is made
1875 syntactically clear, which impacts performance in a parallel or
1876 asynchronous interactive environment. Minor INCOMPATIBILITY.
1878 * Use of cumulative prems via "!" in some proof methods has been
1879 discontinued (old legacy feature).
1881 * References 'trace_simp' and 'debug_simp' have been replaced by
1882 configuration options stored in the context. Enabling tracing (the
1883 case of debugging is similar) in proofs works via
1885 using [[trace_simp = true]]
1887 Tracing is then active for all invocations of the simplifier in
1888 subsequent goal refinement steps. Tracing may also still be enabled or
1889 disabled via the ProofGeneral settings menu.
1891 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1892 'hide_fact' replace the former 'hide' KIND command. Minor
1895 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1896 more efficient than combinations with -q1 or -q2.
1901 * Proofterms record type-class reasoning explicitly, using the
1902 "unconstrain" operation internally. This eliminates all sort
1903 constraints from a theorem and proof, introducing explicit
1904 OFCLASS-premises. On the proof term level, this operation is
1905 automatically applied at theorem boundaries, such that closed proofs
1906 are always free of sort constraints. INCOMPATIBILITY for tools that
1907 inspect proof terms.
1909 * Local theory specifications may depend on extra type variables that
1910 are not present in the result type -- arguments TYPE('a) :: 'a itself
1911 are added internally. For example:
1913 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1915 * Predicates of locales introduced by classes carry a mandatory
1916 "class" prefix. INCOMPATIBILITY.
1918 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1920 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1923 * Command 'code_reflect' allows to incorporate generated ML code into
1924 runtime environment; replaces immature code_datatype antiquotation.
1927 * Code generator: simple concept for abstract datatypes obeying
1930 * Code generator: details of internal data cache have no impact on the
1931 user space functionality any longer.
1933 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1934 subgoals. This is more appropriate for interpretations with 'where'.
1937 * Command 'example_proof' opens an empty proof body. This allows to
1938 experiment with Isar, without producing any persistent result.
1940 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1941 within a local theory context, with explicit checking of the
1942 constructors involved (in contrast to the raw 'syntax' versions).
1944 * Commands 'types' and 'typedecl' now work within a local theory
1945 context -- without introducing dependencies on parameters or
1946 assumptions, which is not possible in Isabelle/Pure.
1948 * Command 'defaultsort' has been renamed to 'default_sort', it works
1949 within a local theory context. Minor INCOMPATIBILITY.
1954 * Command 'typedef' now works within a local theory context -- without
1955 introducing dependencies on parameters or assumptions, which is not
1956 possible in Isabelle/Pure/HOL. Note that the logical environment may
1957 contain multiple interpretations of local typedefs (with different
1958 non-emptiness proofs), even in a global theory context.
1960 * New package for quotient types. Commands 'quotient_type' and
1961 'quotient_definition' may be used for defining types and constants by
1962 quotient constructions. An example is the type of integers created by
1963 quotienting pairs of natural numbers:
1966 intrel :: "(nat * nat) => (nat * nat) => bool"
1968 "intrel (x, y) (u, v) = (x + v = u + y)"
1970 quotient_type int = "nat * nat" / intrel
1971 by (auto simp add: equivp_def expand_fun_eq)
1974 "0::int" is "(0::nat, 0::nat)"
1976 The method "lifting" can be used to lift of theorems from the
1977 underlying "raw" type to the quotient type. The example
1978 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1979 construction and provides a reasoning infrastructure for finite sets.
1981 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1982 clash with new theory Quotient in Main HOL.
1984 * Moved the SMT binding into the main HOL session, eliminating
1985 separate HOL-SMT session.
1987 * List membership infix mem operation is only an input abbreviation.
1990 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1991 for future developements; former Library/Word.thy is still present in
1992 the AFP entry RSAPPS.
1994 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1995 longer shadowed. INCOMPATIBILITY.
1997 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2000 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2003 * Dropped normalizing_semiring etc; use the facts in semiring classes
2004 instead. INCOMPATIBILITY.
2006 * Dropped several real-specific versions of lemmas about floor and
2007 ceiling; use the generic lemmas from theory "Archimedean_Field"
2008 instead. INCOMPATIBILITY.
2010 floor_number_of_eq ~> floor_number_of
2011 le_floor_eq_number_of ~> number_of_le_floor
2012 le_floor_eq_zero ~> zero_le_floor
2013 le_floor_eq_one ~> one_le_floor
2014 floor_less_eq_number_of ~> floor_less_number_of
2015 floor_less_eq_zero ~> floor_less_zero
2016 floor_less_eq_one ~> floor_less_one
2017 less_floor_eq_number_of ~> number_of_less_floor
2018 less_floor_eq_zero ~> zero_less_floor
2019 less_floor_eq_one ~> one_less_floor
2020 floor_le_eq_number_of ~> floor_le_number_of
2021 floor_le_eq_zero ~> floor_le_zero
2022 floor_le_eq_one ~> floor_le_one
2023 floor_subtract_number_of ~> floor_diff_number_of
2024 floor_subtract_one ~> floor_diff_one
2025 ceiling_number_of_eq ~> ceiling_number_of
2026 ceiling_le_eq_number_of ~> ceiling_le_number_of
2027 ceiling_le_zero_eq ~> ceiling_le_zero
2028 ceiling_le_eq_one ~> ceiling_le_one
2029 less_ceiling_eq_number_of ~> number_of_less_ceiling
2030 less_ceiling_eq_zero ~> zero_less_ceiling
2031 less_ceiling_eq_one ~> one_less_ceiling
2032 ceiling_less_eq_number_of ~> ceiling_less_number_of
2033 ceiling_less_eq_zero ~> ceiling_less_zero
2034 ceiling_less_eq_one ~> ceiling_less_one
2035 le_ceiling_eq_number_of ~> number_of_le_ceiling
2036 le_ceiling_eq_zero ~> zero_le_ceiling
2037 le_ceiling_eq_one ~> one_le_ceiling
2038 ceiling_subtract_number_of ~> ceiling_diff_number_of
2039 ceiling_subtract_one ~> ceiling_diff_one
2041 * Theory "Finite_Set": various folding_XXX locales facilitate the
2042 application of the various fold combinators on finite sets.
2044 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2045 provides abstract red-black tree type which is backed by "RBT_Impl" as
2046 implementation. INCOMPATIBILTY.
2048 * Theory Library/Coinductive_List has been removed -- superseded by
2049 AFP/thys/Coinductive.
2051 * Theory PReal, including the type "preal" and related operations, has
2052 been removed. INCOMPATIBILITY.
2054 * Real: new development using Cauchy Sequences.
2056 * Split off theory "Big_Operators" containing setsum, setprod,
2057 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2059 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2060 "Int" etc. INCOMPATIBILITY.
2062 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2064 * New set of rules "ac_simps" provides combined assoc / commute
2065 rewrites for all interpretations of the appropriate generic locales.
2067 * Renamed theory "OrderedGroup" to "Groups" and split theory
2068 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2069 appropriate and more consistent names suitable for name prefixes
2070 within the HOL theories. INCOMPATIBILITY.
2072 * Some generic constants have been put to appropriate theories:
2073 - less_eq, less: Orderings
2074 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2075 - inverse, divide: Rings
2078 * More consistent naming of type classes involving orderings (and
2081 lower_semilattice ~> semilattice_inf
2082 upper_semilattice ~> semilattice_sup
2084 dense_linear_order ~> dense_linorder
2086 pordered_ab_group_add ~> ordered_ab_group_add
2087 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2088 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2089 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2090 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2091 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2092 pordered_cancel_semiring ~> ordered_cancel_semiring
2093 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2094 pordered_comm_ring ~> ordered_comm_ring
2095 pordered_comm_semiring ~> ordered_comm_semiring
2096 pordered_ring ~> ordered_ring
2097 pordered_ring_abs ~> ordered_ring_abs
2098 pordered_semiring ~> ordered_semiring
2100 ordered_ab_group_add ~> linordered_ab_group_add
2101 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2102 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2103 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2104 ordered_field ~> linordered_field
2105 ordered_field_no_lb ~> linordered_field_no_lb
2106 ordered_field_no_ub ~> linordered_field_no_ub
2107 ordered_field_dense_linear_order ~> dense_linordered_field
2108 ordered_idom ~> linordered_idom
2109 ordered_ring ~> linordered_ring
2110 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2111 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2112 ordered_ring_strict ~> linordered_ring_strict
2113 ordered_semidom ~> linordered_semidom
2114 ordered_semiring ~> linordered_semiring
2115 ordered_semiring_1 ~> linordered_semiring_1
2116 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2117 ordered_semiring_strict ~> linordered_semiring_strict
2119 The following slightly odd type classes have been moved to a
2120 separate theory Library/Lattice_Algebras:
2122 lordered_ab_group_add ~> lattice_ab_group_add
2123 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2124 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2125 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2126 lordered_ring ~> lattice_ring
2130 * Refined field classes:
2131 - classes division_ring_inverse_zero, field_inverse_zero,
2132 linordered_field_inverse_zero include rule inverse 0 = 0 --
2133 subsumes former division_by_zero class;
2134 - numerous lemmas have been ported from field to division_ring.
2137 * Refined algebra theorem collections:
2138 - dropped theorem group group_simps, use algebra_simps instead;
2139 - dropped theorem group ring_simps, use field_simps instead;
2140 - proper theorem collection field_simps subsumes former theorem
2141 groups field_eq_simps and field_simps;
2142 - dropped lemma eq_minus_self_iff which is a duplicate for
2146 * Theory Finite_Set and List: some lemmas have been generalized from
2149 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2150 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2151 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2152 union_Union_fold_union ~> sup_Sup_fold_sup
2153 Inter_fold_inter ~> Inf_fold_inf
2154 Union_fold_union ~> Sup_fold_sup
2155 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2156 union_UNION_fold_union ~> sup_SUPR_fold_sup
2157 INTER_fold_inter ~> INFI_fold_inf
2158 UNION_fold_union ~> SUPR_fold_sup
2160 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2161 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2162 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2163 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2164 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2165 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2167 * Reorganized theory Multiset: swapped notation of pointwise and
2170 - pointwise ordering is instance of class order with standard syntax
2172 - multiset ordering has syntax <=# and <#; partial order properties
2173 are provided by means of interpretation with prefix
2175 - less duplication, less historical organization of sections,
2176 conversion from associations lists to multisets, rudimentary code
2178 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2183 multiset_eq_conv_count_eq ~> multiset_ext_iff
2184 multi_count_ext ~> multiset_ext
2185 diff_union_inverse2 ~> diff_union_cancelR
2189 * Theory Permutation: replaced local "remove" by List.remove1.
2191 * Code generation: ML and OCaml code is decorated with signatures.
2193 * Theory List: added transpose.
2195 * Library/Nat_Bijection.thy is a collection of bijective functions
2196 between nat and other types, which supersedes the older libraries
2197 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2200 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2201 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2202 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2203 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2204 Countable.pair_encode ~> prod_encode
2205 NatIso.prod2nat ~> prod_encode
2206 NatIso.nat2prod ~> prod_decode
2207 NatIso.sum2nat ~> sum_encode
2208 NatIso.nat2sum ~> sum_decode
2209 NatIso.list2nat ~> list_encode
2210 NatIso.nat2list ~> list_decode
2211 NatIso.set2nat ~> set_encode
2212 NatIso.nat2set ~> set_decode
2215 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2216 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2217 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2218 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2219 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2220 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2221 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2222 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2223 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2224 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2225 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2226 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2227 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2230 - Renamed ATP commands:
2231 atp_info ~> sledgehammer running_atps
2232 atp_kill ~> sledgehammer kill_atps
2233 atp_messages ~> sledgehammer messages
2234 atp_minimize ~> sledgehammer minimize
2235 print_atps ~> sledgehammer available_atps
2237 - Added user's manual ("isabelle doc sledgehammer").
2238 - Added option syntax and "sledgehammer_params" to customize
2239 Sledgehammer's behavior. See the manual for details.
2240 - Modified the Isar proof reconstruction code so that it produces
2241 direct proofs rather than proofs by contradiction. (This feature
2242 is still experimental.)
2243 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2245 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2248 - Added and implemented "binary_ints" and "bits" options.
2249 - Added "std" option and implemented support for nonstandard models.
2250 - Added and implemented "finitize" option to improve the precision
2251 of infinite datatypes based on a monotonicity analysis.
2252 - Added support for quotient types.
2253 - Added support for "specification" and "ax_specification"
2255 - Added support for local definitions (for "function" and
2256 "termination" proofs).
2257 - Added support for term postprocessors.
2258 - Optimized "Multiset.multiset" and "FinFun.finfun".
2259 - Improved efficiency of "destroy_constrs" optimization.
2260 - Fixed soundness bugs related to "destroy_constrs" optimization and
2262 - Fixed soundness bug related to higher-order constructors.
2263 - Fixed soundness bug when "full_descrs" is enabled.
2264 - Improved precision of set constructs.
2265 - Added "atoms" option.
2266 - Added cache to speed up repeated Kodkod invocations on the same
2268 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2269 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2270 "SAT4J_Light". INCOMPATIBILITY.
2271 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2272 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2273 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2275 * Method "induct" now takes instantiations of the form t, where t is not
2276 a variable, as a shorthand for "x == t", where x is a fresh variable.
2277 If this is not intended, t has to be enclosed in parentheses.
2278 By default, the equalities generated by definitional instantiations
2279 are pre-simplified, which may cause parameters of inductive cases
2280 to disappear, or may even delete some of the inductive cases.
2281 Use "induct (no_simp)" instead of "induct" to restore the old
2282 behaviour. The (no_simp) option is also understood by the "cases"
2283 and "nominal_induct" methods, which now perform pre-simplification, too.
2289 * Variable names in lemmas generated by the domain package have
2290 changed; the naming scheme is now consistent with the HOL datatype
2291 package. Some proof scripts may be affected, INCOMPATIBILITY.
2293 * The domain package no longer defines the function "foo_copy" for
2294 recursive domain "foo". The reach lemma is now stated directly in
2295 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2296 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2298 * Most definedness lemmas generated by the domain package (previously
2299 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2300 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2301 Proofs that used definedness lemmas as intro rules may break,
2302 potential INCOMPATIBILITY.
2304 * Induction and casedist rules generated by the domain package now
2305 declare proper case_names (one called "bottom", and one named for each
2306 constructor). INCOMPATIBILITY.
2308 * For mutually-recursive domains, separate "reach" and "take_lemma"
2309 rules are generated for each domain, INCOMPATIBILITY.
2311 foo_bar.reach ~> foo.reach bar.reach
2312 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2314 * Some lemmas generated by the domain package have been renamed for
2315 consistency with the datatype package, INCOMPATIBILITY.
2317 foo.ind ~> foo.induct
2318 foo.finite_ind ~> foo.finite_induct
2319 foo.coind ~> foo.coinduct
2320 foo.casedist ~> foo.exhaust
2321 foo.exhaust ~> foo.nchotomy
2323 * For consistency with other definition packages, the fixrec package
2324 now generates qualified theorem names, INCOMPATIBILITY.
2326 foo_simps ~> foo.simps
2327 foo_unfold ~> foo.unfold
2328 foo_induct ~> foo.induct
2330 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2331 method and internal fixrec proofs now use the default simpset instead.
2334 * The "contlub" predicate has been removed. Proof scripts should use
2335 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2337 * The "admw" predicate has been removed, INCOMPATIBILITY.
2339 * The constants cpair, cfst, and csnd have been removed in favor of
2340 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2345 * Antiquotations for basic formal entities:
2347 @{class NAME} -- type class
2348 @{class_syntax NAME} -- syntax representation of the above
2350 @{type_name NAME} -- logical type
2351 @{type_abbrev NAME} -- type abbreviation
2352 @{nonterminal NAME} -- type of concrete syntactic category
2353 @{type_syntax NAME} -- syntax representation of any of the above
2355 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2356 @{const_abbrev NAME} -- abbreviated constant
2357 @{const_syntax NAME} -- syntax representation of any of the above
2359 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2360 syntax constant (cf. 'syntax' command).
2362 * Antiquotation @{make_string} inlines a function to print arbitrary
2363 values similar to the ML toplevel. The result is compiler dependent
2364 and may fall back on "?" in certain situations.
2366 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2367 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2368 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2369 not work with the asynchronous Isar document model.
2371 * Configuration options now admit dynamic default values, depending on
2372 the context or even global references.
2374 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2375 uses an efficient external library if available (for Poly/ML).
2377 * Renamed some important ML structures, while keeping the old names
2378 for some time as aliases within the structure Legacy:
2380 OuterKeyword ~> Keyword
2383 OuterSyntax ~> Outer_Syntax
2384 PrintMode ~> Print_Mode
2385 SpecParse ~> Parse_Spec
2388 ThyOutput ~> Thy_Output
2389 TypeInfer ~> Type_Infer
2391 Note that "open Legacy" simplifies porting of sources, but forgetting
2392 to remove it again will complicate porting again in the future.
2394 * Most operations that refer to a global context are named
2395 accordingly, e.g. Simplifier.global_context or
2396 ProofContext.init_global. There are some situations where a global
2397 context actually works, but under normal circumstances one needs to
2398 pass the proper local context through the code!
2400 * Discontinued old TheoryDataFun with its copy/init operation -- data
2401 needs to be pure. Functor Theory_Data_PP retains the traditional
2402 Pretty.pp argument to merge, which is absent in the standard
2403 Theory_Data version.
2405 * Sorts.certify_sort and derived "cert" operations for types and terms
2406 no longer minimize sorts. Thus certification at the boundary of the
2407 inference kernel becomes invariant under addition of class relations,
2408 which is an important monotonicity principle. Sorts are now minimized
2409 in the syntax layer only, at the boundary between the end-user and the
2410 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2411 explicitly in rare situations.
2413 * Renamed old-style Drule.standard to Drule.export_without_context, to
2414 emphasize that this is in no way a standard operation.
2417 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2418 usual for resolution. Rare INCOMPATIBILITY.
2420 * Renamed varify/unvarify operations to varify_global/unvarify_global
2421 to emphasize that these only work in a global situation (which is
2424 * Curried take and drop in library.ML; negative length is interpreted
2425 as infinity (as in chop). Subtle INCOMPATIBILITY.
2427 * Proof terms: type substitutions on proof constants now use canonical
2428 order of type variables. INCOMPATIBILITY for tools working with proof
2431 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2432 may no longer carry premises. User-level specifications are
2433 transformed accordingly by Thm.add_axiom/add_def.
2438 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2439 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2440 proof terms are enabled unconditionally in the new HOL-Proofs image.
2442 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2443 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2446 * Old lib/scripts/polyml-platform is superseded by the
2447 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2448 variant, even on a 64 bit machine. The following example setting
2449 prefers 64 bit if available:
2451 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2453 * The preliminary Isabelle/jEdit application demonstrates the emerging
2454 Isabelle/Scala layer for advanced prover interaction and integration.
2455 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2458 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2459 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2460 similar to the default assignment of the document preparation system
2461 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2462 provides some operations for direct access to the font without asking
2463 the user for manual installation.
2467 New in Isabelle2009-1 (December 2009)
2468 -------------------------------------
2472 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2473 one backslash should be used, even in ML sources.
2478 * Locale interpretation propagates mixins along the locale hierarchy.
2479 The currently only available mixins are the equations used to map
2480 local definitions to terms of the target domain of an interpretation.
2482 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2483 loc" to print all interpretations of locale "loc" in the theory.
2484 Interpretations in proofs are not shown.
2486 * Thoroughly revised locales tutorial. New section on conditional
2489 * On instantiation of classes, remaining undefined class parameters
2490 are formally declared. INCOMPATIBILITY.
2493 *** Document preparation ***
2495 * New generalized style concept for printing terms: @{foo (style) ...}
2496 instead of @{foo_style style ...} (old form is still retained for
2497 backward compatibility). Styles can be also applied for
2498 antiquotations prop, term_type and typeof.
2503 * New proof method "smt" for a combination of first-order logic with
2504 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2505 fixed-size bitvectors; there is also basic support for higher-order
2506 features (esp. lambda abstractions). It is an incomplete decision
2507 procedure based on external SMT solvers using the oracle mechanism;
2508 for the SMT solver Z3, this method is proof-producing. Certificates
2509 are provided to avoid calling the external solvers solely for
2510 re-checking proofs. Due to a remote SMT service there is no need for
2511 installing SMT solvers locally. See src/HOL/SMT.
2513 * New commands to load and prove verification conditions generated by
2514 the Boogie program verifier or derived systems (e.g. the Verifying C
2515 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2517 * New counterexample generator tool 'nitpick' based on the Kodkod
2518 relational model finder. See src/HOL/Tools/Nitpick and
2519 src/HOL/Nitpick_Examples.
2521 * New commands 'code_pred' and 'values' to invoke the predicate
2522 compiler and to enumerate values of inductive predicates.
2524 * A tabled implementation of the reflexive transitive closure.
2526 * New implementation of quickcheck uses generic code generator;
2527 default generators are provided for all suitable HOL types, records
2528 and datatypes. Old quickcheck can be re-activated importing theory
2529 Library/SML_Quickcheck.
2531 * New testing tool Mirabelle for automated proof tools. Applies
2532 several tools and tactics like sledgehammer, metis, or quickcheck, to
2533 every proof step in a theory. To be used in batch mode via the
2534 "mirabelle" utility.
2536 * New proof method "sos" (sum of squares) for nonlinear real
2537 arithmetic (originally due to John Harison). It requires theory
2538 Library/Sum_Of_Squares. It is not a complete decision procedure but
2539 works well in practice on quantifier-free real arithmetic with +, -,
2540 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2541 inequalities between polynomials. It makes use of external
2542 semidefinite programming solvers. Method "sos" generates a
2543 certificate that can be pasted into the proof thus avoiding the need
2544 to call an external tool every time the proof is checked. See
2545 src/HOL/Library/Sum_Of_Squares.
2547 * New method "linarith" invokes existing linear arithmetic decision
2550 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2552 * New Sledgehammer option "Full Types" in Proof General settings menu.
2553 Causes full type information to be output to the ATPs. This slows
2554 ATPs down considerably but eliminates a source of unsound "proofs"
2557 * New method "metisFT": A version of metis that uses full type
2558 information in order to avoid failures of proof reconstruction.
2560 * New evaluator "approximate" approximates an real valued term using
2561 the same method as the approximation method.
2563 * Method "approximate" now supports arithmetic expressions as
2564 boundaries of intervals and implements interval splitting and Taylor
2567 * ML antiquotation @{code_datatype} inserts definition of a datatype
2568 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2570 * New theory SupInf of the supremum and infimum operators for sets of
2573 * New theory Probability, which contains a development of measure
2574 theory, eventually leading to Lebesgue integration and probability.
2576 * Extended Multivariate Analysis to include derivation and Brouwer's
2579 * Reorganization of number theory, INCOMPATIBILITY:
2580 - new number theory development for nat and int, in theories Divides
2581 and GCD as well as in new session Number_Theory
2582 - some constants and facts now suffixed with _nat and _int
2584 - former session NumberTheory now named Old_Number_Theory, including
2585 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2586 - moved theory Pocklington from src/HOL/Library to
2587 src/HOL/Old_Number_Theory
2589 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2590 lcm of finite and infinite sets. It is shown that they form a complete
2593 * Class semiring_div requires superclass no_zero_divisors and proof of
2594 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2595 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2596 generalized to class semiring_div, subsuming former theorems
2597 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2598 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2601 * Refinements to lattice classes and sets:
2602 - less default intro/elim rules in locale variant, more default
2603 intro/elim rules in class variant: more uniformity
2604 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2606 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2608 - renamed ACI to inf_sup_aci
2609 - new class "boolean_algebra"
2610 - class "complete_lattice" moved to separate theory
2611 "Complete_Lattice"; corresponding constants (and abbreviations)
2612 renamed and with authentic syntax:
2613 Set.Inf ~> Complete_Lattice.Inf
2614 Set.Sup ~> Complete_Lattice.Sup
2615 Set.INFI ~> Complete_Lattice.INFI
2616 Set.SUPR ~> Complete_Lattice.SUPR
2617 Set.Inter ~> Complete_Lattice.Inter
2618 Set.Union ~> Complete_Lattice.Union
2619 Set.INTER ~> Complete_Lattice.INTER
2620 Set.UNION ~> Complete_Lattice.UNION
2621 - authentic syntax for
2624 - mere abbreviations:
2627 Set.inter (for inf, formerly Set.Int)
2628 Set.union (for sup, formerly Set.Un)
2629 Complete_Lattice.Inter (for Inf)
2630 Complete_Lattice.Union (for Sup)
2631 Complete_Lattice.INTER (for INFI)
2632 Complete_Lattice.UNION (for SUPR)
2633 - object-logic definitions as far as appropriate
2635 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2636 Un_subset_iff are explicitly deleted as default simp rules; then also
2637 their lattice counterparts le_inf_iff and le_sup_iff have to be
2638 deleted to achieve the desired effect.
2640 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2641 rules by default any longer; the same applies to min_max.inf_absorb1
2642 etc. INCOMPATIBILITY.
2644 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2645 pred_set_conv by default. INCOMPATIBILITY.
2647 * Power operations on relations and functions are now one dedicated
2648 constant "compow" with infix syntax "^^". Power operation on
2649 multiplicative monoids retains syntax "^" and is now defined generic
2650 in class power. INCOMPATIBILITY.
2652 * Relation composition "R O S" now has a more standard argument order:
2653 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2654 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2655 break, since the O_assoc rule was not rewritten like this. Fix using
2656 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2658 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2659 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2662 * Most rules produced by inductive and datatype package have mandatory
2663 prefixes. INCOMPATIBILITY.
2665 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2666 the attribute of the same name. Each of the theorems in the list
2667 DERIV_intros assumes composition with an additional function and
2668 matches a variable to the derivative, which has to be solved by the
2669 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2670 of most elementary terms. Former Maclauren.DERIV_tac and
2671 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2674 * Code generator attributes follow the usual underscore convention:
2675 code_unfold replaces code unfold
2676 code_post replaces code post
2681 sizechange -> size_change
2682 induct_scheme -> induction_schema
2685 * Discontinued abbreviation "arbitrary" of constant "undefined".
2686 INCOMPATIBILITY, use "undefined" directly.
2689 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2690 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2691 Suc_plus1 -> Suc_eq_plus1
2692 *anti_sym -> *antisym*
2693 vector_less_eq_def -> vector_le_def
2696 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2699 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2705 * Theory Representable defines a class "rep" of domains that are
2706 representable (via an ep-pair) in the universal domain type "udom".
2707 Instances are provided for all type constructors defined in HOLCF.
2709 * The 'new_domain' command is a purely definitional version of the
2710 domain package, for representable domains. Syntax is identical to the
2711 old domain package. The 'new_domain' package also supports indirect
2712 recursion using previously-defined type constructors. See
2713 src/HOLCF/ex/New_Domain.thy for examples.
2715 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2716 on the left-hand side of an equation, and then performs
2717 simplification. Rewriting is done using rules declared with the
2718 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2719 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2721 * The pattern-match compiler in 'fixrec' can now handle constructors
2722 with HOL function types. Pattern-match combinators for the Pair
2723 constructor are pre-configured.
2725 * The 'fixrec' package now produces better fixed-point induction rules
2726 for mutually-recursive definitions: Induction rules have conclusions
2727 of the form "P foo bar" instead of "P <foo, bar>".
2729 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2730 been renamed to "below". The name "below" now replaces "less" in many
2731 theorem names. (Legacy theorem names using "less" are still supported
2734 * The 'fixrec' package now supports "bottom patterns". Bottom
2735 patterns can be used to generate strictness rules, or to make
2736 functions more strict (much like the bang-patterns supported by the
2737 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2743 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2744 errors and run-time exceptions, including detailed source positions.
2746 * Structure Name_Space (formerly NameSpace) now manages uniquely
2747 identified entries, with some additional information such as source
2748 position, logical grouping etc.
2750 * Theory and context data is now introduced by the simplified and
2751 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2752 to be pure, but the old TheoryDataFun for mutable data (with explicit
2753 copy operation) is still available for some time.
2755 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2756 provides a high-level programming interface to synchronized state
2757 variables with atomic update. This works via pure function
2758 application within a critical section -- its runtime should be as
2759 short as possible; beware of deadlocks if critical code is nested,
2760 either directly or indirectly via other synchronized variables!
2762 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2763 wraps raw ML references, explicitly indicating their non-thread-safe
2764 behaviour. The Isar toplevel keeps this structure open, to
2765 accommodate Proof General as well as quick and dirty interactive
2766 experiments with references.
2768 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2769 parallel tactical reasoning.
2771 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2772 are similar to SUBPROOF, but are slightly more flexible: only the
2773 specified parts of the subgoal are imported into the context, and the
2774 body tactic may introduce new subgoals and schematic variables.
2776 * Old tactical METAHYPS, which does not observe the proof context, has
2777 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2778 or Subgoal.FOCUS etc.
2780 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2781 functors have their own ML name space there is no point to mark them
2782 separately.) Minor INCOMPATIBILITY.
2784 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2786 * Renamed several structures FooBar to Foo_Bar. Occasional,
2789 * Operations of structure Skip_Proof no longer require quick_and_dirty
2790 mode, which avoids critical setmp.
2792 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2793 combinators for "args". INCOMPATIBILITY, need to use simplified
2794 Attrib/Method.setup introduced in Isabelle2009.
2796 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2797 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2798 last resort. INCOMPATIBILITY.
2800 * Display.pretty_thm now requires a proper context (cf. former
2801 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2802 or even Display.pretty_thm_without_context as last resort.
2805 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2806 Syntax.pretty_typ/term directly, preferably with proper context
2807 instead of global theory.
2812 * Further fine tuning of parallel proof checking, scales up to 8 cores
2813 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2816 * Support for additional "Isabelle components" via etc/components, see
2817 also the system manual.
2819 * The isabelle makeall tool now operates on all components with
2820 IsaMakefile, not just hardwired "logics".
2822 * Removed "compress" option from isabelle-process and isabelle usedir;
2823 this is always enabled.
2825 * Discontinued support for Poly/ML 4.x versions.
2827 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2828 on a given logic image. This requires the lighttpd webserver and is
2829 currently supported on Linux only.
2833 New in Isabelle2009 (April 2009)
2834 --------------------------------
2838 * Simplified main Isabelle executables, with less surprises on
2839 case-insensitive file-systems (such as Mac OS).
2841 - The main Isabelle tool wrapper is now called "isabelle" instead of
2844 - The former "isabelle" alias for "isabelle-process" has been
2845 removed (should rarely occur to regular users).
2847 - The former "isabelle-interface" and its alias "Isabelle" have been
2848 removed (interfaces are now regular Isabelle tools).
2850 Within scripts and make files, the Isabelle environment variables
2851 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2852 respectively. (The latter are still available as legacy feature.)
2854 The old isabelle-interface wrapper could react in confusing ways if
2855 the interface was uninstalled or changed otherwise. Individual
2856 interface tool configuration is now more explicit, see also the
2857 Isabelle system manual. In particular, Proof General is now available
2858 via "isabelle emacs".
2860 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2861 purge installed copies of Isabelle executables and re-run "isabelle
2862 install -p ...", or use symlinks.
2864 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2865 old ~/isabelle, which was slightly non-standard and apt to cause
2866 surprises on case-insensitive file-systems (such as Mac OS).
2868 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2869 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2870 care is required when using older releases of Isabelle. Note that
2871 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2872 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2874 * Proofs of fully specified statements are run in parallel on
2875 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2876 a regular 4-core machine, if the initial heap space is made reasonably
2877 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2879 * The main reference manuals ("isar-ref", "implementation", and
2880 "system") have been updated and extended. Formally checked references
2881 as hyperlinks are now available uniformly.
2886 * Complete re-implementation of locales. INCOMPATIBILITY in several
2887 respects. The most important changes are listed below. See the
2888 Tutorial on Locales ("locales" manual) for details.
2890 - In locale expressions, instantiation replaces renaming. Parameters
2891 must be declared in a for clause. To aid compatibility with previous
2892 parameter inheritance, in locale declarations, parameters that are not
2893 'touched' (instantiation position "_" or omitted) are implicitly added
2894 with their syntax at the beginning of the for clause.
2896 - Syntax from abbreviations and definitions in locales is available in
2897 locale expressions and context elements. The latter is particularly
2898 useful in locale declarations.
2900 - More flexible mechanisms to qualify names generated by locale
2901 expressions. Qualifiers (prefixes) may be specified in locale
2902 expressions, and can be marked as mandatory (syntax: "name!:") or
2903 optional (syntax "name?:"). The default depends for plain "name:"
2904 depends on the situation where a locale expression is used: in
2905 commands 'locale' and 'sublocale' prefixes are optional, in
2906 'interpretation' and 'interpret' prefixes are mandatory. The old
2907 implicit qualifiers derived from the parameter names of a locale are
2908 no longer generated.
2910 - Command "sublocale l < e" replaces "interpretation l < e". The
2911 instantiation clause in "interpretation" and "interpret" (square
2912 brackets) is no longer available. Use locale expressions.
2914 - When converting proof scripts, mandatory qualifiers in
2915 'interpretation' and 'interpret' should be retained by default, even
2916 if this is an INCOMPATIBILITY compared to former behavior. In the
2917 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2918 in locale expressions range over a single locale instance only.
2920 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2921 In existing theorem specifications replace the includes element by the
2922 respective context elements of the included locale, omitting those
2923 that are already present in the theorem specification. Multiple
2924 assume elements of a locale should be replaced by a single one
2925 involving the locale predicate. In the proof body, declarations (most
2926 notably theorems) may be regained by interpreting the respective
2927 locales in the proof context as required (command "interpret").
2929 If using "includes" in replacement of a target solely because the
2930 parameter types in the theorem are not as general as in the target,
2931 consider declaring a new locale with additional type constraints on
2932 the parameters (context element "constrains").
2934 - Discontinued "locale (open)". INCOMPATIBILITY.
2936 - Locale interpretation commands no longer attempt to simplify goal.
2937 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2938 methods intro_locales and unfold_locales to clarify.
2940 - Locale interpretation commands no longer accept interpretation
2941 attributes. INCOMPATIBILITY.
2943 * Class declaration: so-called "base sort" must not be given in import
2944 list any longer, but is inferred from the specification. Particularly
2951 class foo = type + ...
2953 * Class target: global versions of theorems stemming do not carry a
2954 parameter prefix any longer. INCOMPATIBILITY.
2956 * Class 'instance' command no longer accepts attached definitions.
2957 INCOMPATIBILITY, use proper 'instantiation' target instead.
2959 * Recovered hiding of consts, which was accidentally broken in
2960 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2961 makes c inaccessible; consider using ``hide (open) const c'' instead.
2963 * Slightly more coherent Pure syntax, with updated documentation in
2964 isar-ref manual. Removed locales meta_term_syntax and
2965 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2966 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2967 directly in regular applications.
2969 * There is a new syntactic category "float_const" for signed decimal
2970 fractions (e.g. 123.45 or -123.45).
2972 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2973 interface with 'setup' command instead.
2975 * Command 'local_setup' is similar to 'setup', but operates on a local
2978 * The 'axiomatization' command now only works within a global theory
2979 context. INCOMPATIBILITY.
2981 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2982 hypotheses. Sorts required in the course of reasoning need to be
2983 covered by the constraints in the initial statement, completed by the
2984 type instance information of the background theory. Non-trivial sort
2985 hypotheses, which rarely occur in practice, may be specified via
2986 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2988 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2990 The result contains an implicit sort hypotheses as before --
2991 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2994 * Generalized Isar history, with support for linear undo, direct state
2997 * Changed defaults for unify configuration options:
2999 unify_trace_bound = 50 (formerly 25)
3000 unify_search_bound = 60 (formerly 30)
3002 * Different bookkeeping for code equations (INCOMPATIBILITY):
3004 a) On theory merge, the last set of code equations for a particular
3005 constant is taken (in accordance with the policy applied by other
3006 parts of the code generator framework).
3008 b) Code equations stemming from explicit declarations (e.g. code
3009 attribute) gain priority over default code equations stemming
3010 from definition, primrec, fun etc.
3012 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3014 * Unified theorem tables for both code generators. Thus [code
3015 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3017 * Command 'find_consts' searches for constants based on type and name
3020 find_consts "_ => bool"
3022 By default, matching is against subtypes, but it may be restricted to
3023 the whole type. Searching by name is possible. Multiple queries are
3024 conjunctive and queries may be negated by prefixing them with a
3027 find_consts strict: "_ => bool" name: "Int" -"int => int"
3029 * New 'find_theorems' criterion "solves" matches theorems that
3030 directly solve the current goal (modulo higher-order unification).
3032 * Auto solve feature for main theorem statements: whenever a new goal
3033 is stated, "find_theorems solves" is called; any theorems that could
3034 solve the lemma directly are listed as part of the goal state.
3035 Cf. associated options in Proof General Isabelle settings menu,
3036 enabled by default, with reasonable timeout for pathological cases of
3037 higher-order unification.
3040 *** Document preparation ***
3042 * Antiquotation @{lemma} now imitates a regular terminal proof,
3043 demanding keyword 'by' and supporting the full method expression
3044 syntax just like the Isar command 'by'.
3049 * Integrated main parts of former image HOL-Complex with HOL. Entry
3050 points Main and Complex_Main remain as before.
3052 * Logic image HOL-Plain provides a minimal HOL with the most important
3053 tools available (inductive, datatype, primrec, ...). This facilitates
3054 experimentation and tool development. Note that user applications
3055 (and library theories) should never refer to anything below theory
3058 * Logic image HOL-Main stops at theory Main, and thus facilitates
3059 experimentation due to shorter build times.
3061 * Logic image HOL-NSA contains theories of nonstandard analysis which
3062 were previously part of former HOL-Complex. Entry point Hyperreal
3063 remains valid, but theories formerly using Complex_Main should now use
3064 new entry point Hypercomplex.
3066 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3067 Posix processes. Avoids potentially expensive forking of the ML
3068 process. New thread-based implementation also works on non-Unix
3069 platforms (Cygwin). Provers are no longer hardwired, but defined
3070 within the theory via plain ML wrapper functions. Basic Sledgehammer
3071 commands are covered in the isar-ref manual.
3073 * Wrapper scripts for remote SystemOnTPTP service allows to use
3074 sledgehammer without local ATP installation (Vampire etc.). Other
3075 provers may be included via suitable ML wrappers, see also
3076 src/HOL/ATP_Linkup.thy.
3078 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3081 * The metis method no longer fails because the theorem is too trivial
3082 (contains the empty clause).
3084 * The metis method now fails in the usual manner, rather than raising
3085 an exception, if it determines that it cannot prove the theorem.
3087 * Method "coherent" implements a prover for coherent logic (see also
3088 src/Tools/coherent.ML).
3090 * Constants "undefined" and "default" replace "arbitrary". Usually
3091 "undefined" is the right choice to replace "arbitrary", though
3092 logically there is no difference. INCOMPATIBILITY.
3094 * Command "value" now integrates different evaluation mechanisms. The
3095 result of the first successful evaluation mechanism is printed. In
3096 square brackets a particular named evaluation mechanisms may be
3097 specified (currently, [SML], [code] or [nbe]). See further
3098 src/HOL/ex/Eval_Examples.thy.
3100 * Normalization by evaluation now allows non-leftlinear equations.
3101 Declare with attribute [code nbe].
3103 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3104 as the structured Isar versions "cases" and "induct", cf. the
3105 corresponding "cases" and "induct" attributes. Mutual induction rules
3106 are now presented as a list of individual projections
3107 (e.g. foo_bar.inducts for types foo and bar); the old format with
3108 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3109 rare situations a different rule is selected --- notably nested tuple
3110 elimination instead of former prod.exhaust: use explicit (case_tac t
3111 rule: prod.exhaust) here.
3113 * Attributes "cases", "induct", "coinduct" support "del" option.
3115 * Removed fact "case_split_thm", which duplicates "case_split".
3117 * The option datatype has been moved to a new theory Option. Renamed
3118 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3120 * New predicate "strict_mono" classifies strict functions on partial
3121 orders. With strict functions on linear orders, reasoning about
3122 (in)equalities is facilitated by theorems "strict_mono_eq",
3123 "strict_mono_less_eq" and "strict_mono_less".
3125 * Some set operations are now proper qualified constants with
3126 authentic syntax. INCOMPATIBILITY:
3137 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3140 * Auxiliary class "itself" has disappeared -- classes without any
3141 parameter are treated as expected by the 'class' command.
3143 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3145 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3146 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3148 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3149 method "approximation". It proves formulas on real values by using
3150 interval arithmetic. In the formulas are also the transcendental
3151 functions sin, cos, tan, atan, ln, exp and the constant pi are
3152 allowed. For examples see
3153 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3155 * Theory "Reflection" now resides in HOL/Library.
3157 * Entry point to Word library now simply named "Word".
3160 * Made source layout more coherent with logical distribution
3163 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3164 src/HOL/Library/Code_Message.thy ~> src/HOL/
3165 src/HOL/Library/GCD.thy ~> src/HOL/
3166 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3167 src/HOL/Library/Parity.thy ~> src/HOL/
3168 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3169 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3170 src/HOL/Real/Lubs.thy ~> src/HOL/
3171 src/HOL/Real/PReal.thy ~> src/HOL/
3172 src/HOL/Real/Rational.thy ~> src/HOL/
3173 src/HOL/Real/RComplete.thy ~> src/HOL/
3174 src/HOL/Real/RealDef.thy ~> src/HOL/
3175 src/HOL/Real/RealPow.thy ~> src/HOL/
3176 src/HOL/Real/Real.thy ~> src/HOL/
3177 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3178 src/HOL/Complex/Complex.thy ~> src/HOL/
3179 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3180 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3181 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3182 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3183 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3184 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3185 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3186 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3187 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3188 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3189 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3190 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3191 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3192 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3193 src/HOL/Real/Float ~> src/HOL/Library/
3194 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3195 src/HOL/Real/RealVector.thy ~> src/HOL/
3197 src/HOL/arith_data.ML ~> src/HOL/Tools
3198 src/HOL/hologic.ML ~> src/HOL/Tools
3199 src/HOL/simpdata.ML ~> src/HOL/Tools
3200 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3201 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3202 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3203 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3204 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3205 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3206 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3208 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3209 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3210 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3211 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3212 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3213 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3215 * If methods "eval" and "evaluation" encounter a structured proof
3216 state with !!/==>, only the conclusion is evaluated to True (if
3217 possible), avoiding strange error messages.
3219 * Method "sizechange" automates termination proofs using (a
3220 modification of) the size-change principle. Requires SAT solver. See
3221 src/HOL/ex/Termination.thy for examples.
3223 * Simplifier: simproc for let expressions now unfolds if bound
3224 variable occurs at most once in let expression body. INCOMPATIBILITY.
3226 * Method "arith": Linear arithmetic now ignores all inequalities when
3227 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3229 * New attribute "arith" for facts that should always be used
3230 automatically by arithmetic. It is intended to be used locally in
3233 assumes [arith]: "x > 0"
3235 Global usage is discouraged because of possible performance impact.
3237 * New classes "top" and "bot" with corresponding operations "top" and
3238 "bot" in theory Orderings; instantiation of class "complete_lattice"
3239 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3241 * Changed definition lemma "less_fun_def" in order to provide an
3242 instance for preorders on functions; use lemma "less_le" instead.
3245 * Theory Orderings: class "wellorder" moved here, with explicit
3246 induction rule "less_induct" as assumption. For instantiation of
3247 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3250 * Theory Orderings: added class "preorder" as superclass of "order".
3251 INCOMPATIBILITY: Instantiation proofs for order, linorder
3252 etc. slightly changed. Some theorems named order_class.* now named
3255 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3258 * Theory Finite_Set: added a new fold combinator of type
3260 ('a => 'b => 'b) => 'b => 'a set => 'b
3262 Occasionally this is more convenient than the old fold combinator
3263 which is now defined in terms of the new one and renamed to
3266 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3267 and "ring_simps" have been replaced by "algebra_simps" (which can be
3268 extended with further lemmas!). At the moment both still exist but
3269 the former will disappear at some point.
3271 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3272 class recpower. Type-specific simp rules for various recpower types
3273 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3275 rat_power_0 -> power_0
3276 rat_power_Suc -> power_Suc
3277 realpow_0 -> power_0
3278 realpow_Suc -> power_Suc
3279 complexpow_0 -> power_0
3280 complexpow_Suc -> power_Suc
3281 power_poly_0 -> power_0
3282 power_poly_Suc -> power_Suc
3284 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3285 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3286 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3287 of lemmas from Divides has been generalized from nat to class
3288 semiring_div. INCOMPATIBILITY. This involves the following theorem
3289 renames resulting from duplicate elimination:
3291 dvd_def_mod ~> dvd_eq_mod_eq_0
3292 zero_dvd_iff ~> dvd_0_left_iff
3293 dvd_0 ~> dvd_0_right
3294 DIVISION_BY_ZERO_DIV ~> div_by_0
3295 DIVISION_BY_ZERO_MOD ~> mod_by_0
3296 mult_div ~> div_mult_self2_is_id
3297 mult_mod ~> mod_mult_self2_is_0
3299 * Theory IntDiv: removed many lemmas that are instances of class-based
3300 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3301 rename old lemmas as follows:
3303 dvd_diff -> nat_dvd_diff
3304 dvd_zminus_iff -> dvd_minus_iff
3305 mod_add1_eq -> mod_add_eq
3306 mod_mult1_eq -> mod_mult_right_eq
3307 mod_mult1_eq' -> mod_mult_left_eq
3308 mod_mult_distrib_mod -> mod_mult_eq
3309 nat_mod_add_left_eq -> mod_add_left_eq
3310 nat_mod_add_right_eq -> mod_add_right_eq
3311 nat_mod_div_trivial -> mod_div_trivial
3312 nat_mod_mod_trivial -> mod_mod_trivial
3313 zdiv_zadd_self1 -> div_add_self1
3314 zdiv_zadd_self2 -> div_add_self2
3315 zdiv_zmult_self1 -> div_mult_self2_is_id
3316 zdiv_zmult_self2 -> div_mult_self1_is_id
3317 zdvd_triv_left -> dvd_triv_left
3318 zdvd_triv_right -> dvd_triv_right
3319 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3320 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3321 zmod_zadd_left_eq -> mod_add_left_eq
3322 zmod_zadd_right_eq -> mod_add_right_eq
3323 zmod_zadd_self1 -> mod_add_self1
3324 zmod_zadd_self2 -> mod_add_self2
3325 zmod_zadd1_eq -> mod_add_eq
3326 zmod_zdiff1_eq -> mod_diff_eq
3327 zmod_zdvd_zmod -> mod_mod_cancel
3328 zmod_zmod_cancel -> mod_mod_cancel
3329 zmod_zmult_self1 -> mod_mult_self2_is_0
3330 zmod_zmult_self2 -> mod_mult_self1_is_0
3333 zdvd_abs1 -> abs_dvd_iff
3334 zdvd_abs2 -> dvd_abs_iff
3335 zdvd_refl -> dvd_refl
3336 zdvd_trans -> dvd_trans
3337 zdvd_zadd -> dvd_add
3338 zdvd_zdiff -> dvd_diff
3339 zdvd_zminus_iff -> dvd_minus_iff
3340 zdvd_zminus2_iff -> minus_dvd_iff
3341 zdvd_zmultD -> dvd_mult_right
3342 zdvd_zmultD2 -> dvd_mult_left
3343 zdvd_zmult_mono -> mult_dvd_mono
3344 zdvd_0_right -> dvd_0_right
3345 zdvd_0_left -> dvd_0_left_iff
3346 zdvd_1_left -> one_dvd
3347 zminus_dvd_iff -> minus_dvd_iff
3349 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3351 * The real numbers offer decimal input syntax: 12.34 is translated
3352 into 1234/10^2. This translation is not reversed upon output.
3354 * Theory Library/Polynomial defines an abstract type 'a poly of
3355 univariate polynomials with coefficients of type 'a. In addition to
3356 the standard ring operations, it also supports div and mod. Code
3357 generation is also supported, using list-style constructors.
3359 * Theory Library/Inner_Product defines a class of real_inner for real
3360 inner product spaces, with an overloaded operation inner :: 'a => 'a
3361 => real. Class real_inner is a subclass of real_normed_vector from
3364 * Theory Library/Product_Vector provides instances for the product
3365 type 'a * 'b of several classes from RealVector and Inner_Product.
3366 Definitions of addition, subtraction, scalar multiplication, norms,
3367 and inner products are included.
3369 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3370 addition to the field operations, numerals and case syntax are also
3373 * Theory Library/Diagonalize provides constructive version of Cantor's
3374 first diagonalization argument.
3376 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3377 zlcm (for int); carried together from various gcd/lcm developements in
3378 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3379 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3380 may recover tupled syntax as follows:
3382 hide (open) const gcd
3383 abbreviation gcd where
3384 "gcd == (%(a, b). GCD.gcd a b)"
3386 GCD.gcd ("gcd '(_, _')")
3388 The same works for lcm, zgcd, zlcm.
3390 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3391 instantiations for algebraic structures. Removed some duplicate
3392 theorems. Changes in simp rules. INCOMPATIBILITY.
3394 * ML antiquotation @{code} takes a constant as argument and generates
3395 corresponding code in background and inserts name of the corresponding
3396 resulting ML value/function/datatype constructor binding in place.
3397 All occurrences of @{code} with a single ML block are generated
3398 simultaneously. Provides a generic and safe interface for
3399 instrumentalizing code generation. See
3400 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3401 In future you ought to refrain from ad-hoc compiling generated SML
3402 code on the ML toplevel. Note that (for technical reasons) @{code}
3403 cannot refer to constants for which user-defined serializations are
3404 set. Refer to the corresponding ML counterpart directly in that
3407 * Command 'rep_datatype': instead of theorem names the command now
3408 takes a list of terms denoting the constructors of the type to be
3409 represented as datatype. The characteristic theorems have to be
3410 proven. INCOMPATIBILITY. Also observe that the following theorems
3411 have disappeared in favour of existing ones:
3413 unit_induct ~> unit.induct
3414 prod_induct ~> prod.induct
3415 sum_induct ~> sum.induct
3416 Suc_Suc_eq ~> nat.inject
3417 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3422 * New locales for orders and lattices where the equivalence relation
3423 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3424 locales use a record structure with field eq for the equivalence.
3426 * New theory of factorial domains.
3428 * Units_l_inv and Units_r_inv are now simp rules by default.
3429 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3430 and/or r_inv will now also require deletion of these lemmas.
3432 * Renamed the following theorems, INCOMPATIBILITY:
3434 UpperD ~> Upper_memD
3435 LowerD ~> Lower_memD
3436 least_carrier ~> least_closed
3437 greatest_carrier ~> greatest_closed
3438 greatest_Lower_above ~> greatest_Lower_below
3439 one_zero ~> carrier_one_zero
3440 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3445 * Nominal datatypes can now contain type-variables.
3447 * Commands 'nominal_inductive' and 'equivariance' work with local
3450 * Nominal primrec can now works with local theory targets and its
3451 specification syntax now conforms to the general format as seen in
3454 * Method "perm_simp" honours the standard simplifier attributes
3455 (no_asm), (no_asm_use) etc.
3457 * The new predicate #* is defined like freshness, except that on the
3458 left hand side can be a set or list of atoms.
3460 * Experimental command 'nominal_inductive2' derives strong induction
3461 principles for inductive definitions. In contrast to
3462 'nominal_inductive', which can only deal with a fixed number of
3463 binders, it can deal with arbitrary expressions standing for sets of
3464 atoms to be avoided. The only inductive definition we have at the
3465 moment that needs this generalisation is the typing rule for Lets in
3468 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3469 -----------------------------------------------------------------
3470 Gamma |- Let x be t1 in t2 : T2
3472 In this rule one wants to avoid all the binders that are introduced by
3473 "close Gamma T1". We are looking for other examples where this
3474 feature might be useful. Please let us know.
3479 * Reimplemented the simplification procedure for proving continuity
3480 subgoals. The new simproc is extensible; users can declare additional
3481 continuity introduction rules with the attribute [cont2cont].
3483 * The continuity simproc now uses a different introduction rule for
3484 solving continuity subgoals on terms with lambda abstractions. In
3485 some rare cases the new simproc may fail to solve subgoals that the
3486 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3487 Potential INCOMPATIBILITY.
3489 * Command 'fixrec': specification syntax now conforms to the general
3490 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3491 examples. INCOMPATIBILITY.
3496 * Proof of Zorn's Lemma for partial orders.
3501 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3502 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3503 depends on multithreading, so timouts will not work before Poly/ML
3506 * High-level support for concurrent ML programming, see
3507 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3508 particularly convenient to organize independent functional
3509 computations. The concept of "synchronized variables" provides a
3510 higher-order interface for components with shared state, avoiding the
3511 delicate details of mutexes and condition variables. (Requires
3512 Poly/ML 5.2.1 or later.)
3514 * ML bindings produced via Isar commands are stored within the Isar
3515 context (theory or proof). Consequently, commands like 'use' and 'ML'
3516 become thread-safe and work with undo as expected (concerning
3517 top-level bindings, not side-effects on global references).
3518 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3519 compiler at runtime; really global bindings need to be given outside a
3520 theory. (Requires Poly/ML 5.2 or later.)
3522 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3523 context. Top-level ML bindings are stored within the proof context in
3524 a purely sequential fashion, disregarding the nested proof structure.
3525 ML bindings introduced by 'ML_prf' are discarded at the end of the
3526 proof. (Requires Poly/ML 5.2 or later.)
3528 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3529 and Method.setup, as well as Isar commands 'attribute_setup' and
3530 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3531 existing code accordingly, or use plain 'setup' together with old
3534 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3535 to 'a -> thm, while results are always tagged with an authentic oracle
3536 name. The Isar command 'oracle' is now polymorphic, no argument type
3537 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3538 accordingly. Note that extra performance may be gained by producing
3539 the cterm carefully, avoiding slow Thm.cterm_of.
3541 * Simplified interface for defining document antiquotations via
3542 ThyOutput.antiquotation, ThyOutput.output, and optionally
3543 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3544 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3547 * More systematic treatment of long names, abstract name bindings, and
3548 name space operations. Basic operations on qualified names have been
3549 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3550 Long_Name.append. Old type bstring has been mostly replaced by
3551 abstract type binding (see structure Binding), which supports precise
3552 qualification by packages and local theory targets, as well as proper
3553 tracking of source positions. INCOMPATIBILITY, need to wrap old
3554 bstring values into Binding.name, or better pass through abstract
3555 bindings everywhere. See further src/Pure/General/long_name.ML,
3556 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3558 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3559 LocalTheory.note etc.) now refer to the *full* internal name, not the
3560 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3562 * Disposed old type and term read functions (Sign.read_def_typ,
3563 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3564 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3565 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3566 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3567 resort for legacy applications.
3569 * Disposed old declarations, tactics, tactic combinators that refer to
3570 the simpset or claset of an implicit theory (such as Addsimps,
3571 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3572 embedded ML text, or local_simpset_of with a proper context passed as
3573 explicit runtime argument.
3575 * Rules and tactics that read instantiations (read_instantiate,
3576 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3577 context, which is required for parsing and type-checking. Moreover,
3578 the variables are specified as plain indexnames, not string encodings
3579 thereof. INCOMPATIBILITY.
3581 * Generic Toplevel.add_hook interface allows to analyze the result of
3582 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3583 for theorem dependency output of transactions resulting in a new
3586 * ML antiquotations: block-structured compilation context indicated by
3587 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3589 @{binding name} - basic name binding
3590 @{let ?pat = term} - term abbreviation (HO matching)
3591 @{note name = fact} - fact abbreviation
3592 @{thm fact} - singleton fact (with attributes)
3593 @{thms fact} - general fact (with attributes)
3594 @{lemma prop by method} - singleton goal
3595 @{lemma prop by meth1 meth2} - singleton goal
3596 @{lemma prop1 ... propN by method} - general goal
3597 @{lemma prop1 ... propN by meth1 meth2} - general goal
3598 @{lemma (open) ...} - open derivation
3603 * The Isabelle "emacs" tool provides a specific interface to invoke
3604 Proof General / Emacs, with more explicit failure if that is not
3605 installed (the old isabelle-interface script silently falls back on
3606 isabelle-process). The PROOFGENERAL_HOME setting determines the
3607 installation location of the Proof General distribution.
3609 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3610 the Isabelle process into a JVM/Scala application. See
3611 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3612 process wrapper has been discontinued.)
3614 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3616 * Various status messages (with exact source position information) are
3617 emitted, if proper markup print mode is enabled. This allows
3618 user-interface components to provide detailed feedback on internal
3623 New in Isabelle2008 (June 2008)
3624 -------------------------------
3628 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3629 and updated, with formally checked references as hyperlinks.
3631 * Theory loader: use_thy (and similar operations) no longer set the
3632 implicit ML context, which was occasionally hard to predict and in
3633 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3634 provides a proper context already.
3636 * Theory loader: old-style ML proof scripts being *attached* to a thy
3637 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3638 'use' within a theory file will do the job.
3640 * Name space merge now observes canonical order, i.e. the second space
3641 is inserted into the first one, while existing entries in the first
3642 space take precedence. INCOMPATIBILITY in rare situations, may try to
3643 swap theory imports.
3645 * Syntax: symbol \<chi> is now considered a letter. Potential
3646 INCOMPATIBILITY in identifier syntax etc.
3648 * Outer syntax: string tokens no longer admit escaped white space,
3649 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3650 white space without escapes.
3652 * Outer syntax: string tokens may contain arbitrary character codes
3653 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3659 * Context-dependent token translations. Default setup reverts locally
3660 fixed variables, and adds hilite markup for undeclared frees.
3662 * Unused theorems can be found using the new command 'unused_thms'.
3663 There are three ways of invoking it:
3666 Only finds unused theorems in the current theory.
3668 (2) unused_thms thy_1 ... thy_n -
3669 Finds unused theorems in the current theory and all of its ancestors,
3670 excluding the theories thy_1 ... thy_n and all of their ancestors.
3672 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3673 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3674 their ancestors, excluding the theories thy_1 ... thy_n and all of
3677 In order to increase the readability of the list produced by
3678 unused_thms, theorems that have been created by a particular instance
3679 of a theory command such as 'inductive' or 'function' are considered
3680 to belong to the same "group", meaning that if at least one theorem in
3681 this group is used, the other theorems in the same group are no longer
3682 reported as unused. Moreover, if all theorems in the group are
3683 unused, only one theorem in the group is displayed.
3685 Note that proof objects have to be switched on in order for
3686 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3687 usually the case when using Proof General with the default settings).
3689 * Authentic naming of facts disallows ad-hoc overwriting of previous
3690 theorems within the same name space. INCOMPATIBILITY, need to remove
3691 duplicate fact bindings, or even accidental fact duplications. Note
3692 that tools may maintain dynamically scoped facts systematically, using
3693 PureThy.add_thms_dynamic.
3695 * Command 'hide' now allows to hide from "fact" name space as well.
3697 * Eliminated destructive theorem database, simpset, claset, and
3698 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3699 update of theories within ML code.
3701 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3702 INCOMPATIBILITY, object-logics depending on former Pure require
3703 additional setup PureThy.old_appl_syntax_setup; object-logics
3704 depending on former CPure need to refer to Pure.
3706 * Commands 'use' and 'ML' are now purely functional, operating on
3707 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3708 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3711 * Command 'setup': discontinued implicit version with ML reference.
3713 * Instantiation target allows for simultaneous specification of class
3714 instance operations together with an instantiation proof.
3715 Type-checking phase allows to refer to class operations uniformly.
3716 See src/HOL/Complex/Complex.thy for an Isar example and
3717 src/HOL/Library/Eval.thy for an ML example.
3719 * Indexing of literal facts: be more serious about including only
3720 facts from the visible specification/proof context, but not the
3721 background context (locale etc.). Affects `prop` notation and method
3722 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3725 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3726 "(open)" option, which used to expose internal bound variables to the
3729 * Isar statements: removed obsolete case "rule_context".
3730 INCOMPATIBILITY, better use explicit fixes/assumes.
3732 * Locale proofs: default proof step now includes 'unfold_locales';
3733 hence 'proof' without argument may be used to unfold locale
3737 *** Document preparation ***
3739 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3740 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3741 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3742 spot); renamed link color from "darkblue" to "linkcolor" (default
3743 value unchanged, can be redefined via \definecolor); no longer sets
3744 "a4paper" option (unnecessary or even intrusive).
3746 * Antiquotation @{lemma A method} proves proposition A by the given
3747 method (either a method name or a method name plus (optional) method
3748 arguments in parentheses) and prints A just like @{prop A}.
3753 * New primrec package. Specification syntax conforms in style to
3754 definition/function/.... No separate induction rule is provided. The
3755 "primrec" command distinguishes old-style and new-style specifications
3756 by syntax. The former primrec package is now named OldPrimrecPackage.
3757 When adjusting theories, beware: constants stemming from new-style
3758 primrec specifications have authentic syntax.
3760 * Metis prover is now an order of magnitude faster, and also works
3761 with multithreading.
3763 * Metis: the maximum number of clauses that can be produced from a
3764 theorem is now given by the attribute max_clauses. Theorems that
3765 exceed this number are ignored, with a warning printed.
3767 * Sledgehammer no longer produces structured proofs by default. To
3768 enable, declare [[sledgehammer_full = true]]. Attributes
3769 reconstruction_modulus, reconstruction_sorts renamed
3770 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3772 * Method "induct_scheme" derives user-specified induction rules
3773 from well-founded induction and completeness of patterns. This factors
3774 out some operations that are done internally by the function package
3775 and makes them available separately. See
3776 src/HOL/ex/Induction_Scheme.thy for examples.
3778 * More flexible generation of measure functions for termination
3779 proofs: Measure functions can be declared by proving a rule of the
3780 form "is_measure f" and giving it the [measure_function] attribute.
3781 The "is_measure" predicate is logically meaningless (always true), and
3782 just guides the heuristic. To find suitable measure functions, the
3783 termination prover sets up the goal "is_measure ?f" of the appropriate
3784 type and generates all solutions by prolog-style backwards proof using
3787 This setup also deals with rules like
3789 "is_measure f ==> is_measure (list_size f)"
3791 which accommodates nested datatypes that recurse through lists.
3792 Similar rules are predeclared for products and option types.
3794 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3798 - Definitions of overloaded constants on sets have to be replaced by
3799 definitions on => and bool.
3801 - Some definitions of overloaded operators on sets can now be proved
3802 using the definitions of the operators on => and bool. Therefore,
3803 the following theorems have been renamed:
3805 subset_def -> subset_eq
3806 psubset_def -> psubset_eq
3807 set_diff_def -> set_diff_eq
3808 Compl_def -> Compl_eq
3809 Sup_set_def -> Sup_set_eq
3810 Inf_set_def -> Inf_set_eq
3811 sup_set_def -> sup_set_eq
3812 inf_set_def -> inf_set_eq
3814 - Due to the incompleteness of the HO unification algorithm, some
3815 rules such as subst may require manual instantiation, if some of
3816 the unknowns in the rule is a set.
3818 - Higher order unification and forward proofs:
3821 have "P (S::'a set)" <...>
3822 then have "EX S. P S" ..
3824 no longer works (due to the incompleteness of the HO unification
3825 algorithm) and must be replaced by the pattern
3832 - Calculational reasoning with subst (or similar rules):
3835 have "P (S::'a set)" <...>
3836 also have "S = T" <...>
3837 finally have "P T" .
3839 no longer works (for similar reasons as the previous example) and
3840 must be replaced by something like
3842 have "P (S::'a set)" <...>
3843 moreover have "S = T" <...>
3844 ultimately have "P T" by simp
3846 - Tactics or packages written in ML code:
3847 Code performing pattern matching on types via
3849 Type ("set", [T]) => ...
3851 must be rewritten. Moreover, functions like strip_type or
3852 binder_types no longer return the right value when applied to a
3855 T1 => ... => Tn => U => bool
3859 T1 => ... => Tn => U set
3861 * Merged theories Wellfounded_Recursion, Accessible_Part and
3862 Wellfounded_Relations to theory Wellfounded.
3864 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3866 * Class finite no longer treats UNIV as class parameter. Use class
3867 enum from theory Library/Enum instead to achieve a similar effect.
3870 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3871 and "Cons". INCOMPATIBILITY.
3873 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3874 Potential INCOMPATIBILITY.
3876 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3877 injective_fst_snd removed, use split_eta and prod_eqI instead.
3878 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3880 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3881 the same name in theory Orderings:
3891 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3892 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3893 and different variable names.
3895 * Library/Option_ord.thy: Canonical order on option type.
3897 * Library/RBT.thy: Red-black trees, an efficient implementation of
3900 * Library/Countable.thy: Type class for countable types.
3902 * Theory Int: The representation of numerals has changed. The infix
3903 operator BIT and the bit datatype with constructors B0 and B1 have
3904 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3905 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3906 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3909 * Theory Nat: definition of <= and < on natural numbers no longer
3910 depend on well-founded relations. INCOMPATIBILITY. Definitions
3911 le_def and less_def have disappeared. Consider lemmas not_less
3912 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3914 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3915 (whose purpose mainly is for various fold_set functionals) have been
3916 abandoned in favor of the existing algebraic classes
3917 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3918 lower_semilattice (resp. upper_semilattice) and linorder.
3921 * Theory Transitive_Closure: induct and cases rules now declare proper
3922 case_names ("base" and "step"). INCOMPATIBILITY.
3924 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3925 lattices. The form set-specific version is available as
3926 Inductive.lfp_ordinal_induct_set.
3928 * Renamed theorems "power.simps" to "power_int.simps".
3931 * Class semiring_div provides basic abstract properties of semirings
3932 with division and modulo operations. Subsumes former class dvd_mod.
3934 * Merged theories IntDef, Numeral and IntArith into unified theory
3935 Int. INCOMPATIBILITY.
3937 * Theory Library/Code_Index: type "index" now represents natural
3938 numbers rather than integers. INCOMPATIBILITY.
3940 * New class "uminus" with operation "uminus" (split of from class
3941 "minus" which now only has operation "minus", binary).
3944 * Constants "card", "internal_split", "option_map" now with authentic
3945 syntax. INCOMPATIBILITY.
3947 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3948 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3949 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3950 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3951 Sup_set_def, le_def, less_def, option_map_def now with object
3952 equality. INCOMPATIBILITY.
3954 * Records. Removed K_record, and replaced it by pure lambda term
3955 %x. c. The simplifier setup is now more robust against eta expansion.
3956 INCOMPATIBILITY: in cases explicitly referring to K_record.
3958 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3960 * Library/ListVector: new theory of arithmetic vector operations.
3962 * Library/Order_Relation: new theory of various orderings as sets of
3963 pairs. Defines preorders, partial orders, linear orders and
3964 well-orders on sets and on types.
3969 * Renamed some theories to allow to loading both ZF and HOL in the
3972 Datatype -> Datatype_ZF
3973 Inductive -> Inductive_ZF
3980 INCOMPATIBILITY: ZF theories that import individual theories below
3981 Main might need to be adapted. Regular theory Main is still
3982 available, as trivial extension of Main_ZF.
3987 * ML within Isar: antiquotation @{const name} or @{const
3988 name(typargs)} produces statically-checked Const term.
3990 * Functor NamedThmsFun: data is available to the user as dynamic fact
3991 (of the same name). Removed obsolete print command.
3993 * Removed obsolete "use_legacy_bindings" function.
3995 * The ``print mode'' is now a thread-local value derived from a global
3996 template (the former print_mode reference), thus access becomes
3997 non-critical. The global print_mode reference is for session
3998 management only; user-code should use print_mode_value,
3999 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4001 * Functions system/system_out provide a robust way to invoke external
4002 shell commands, with propagation of interrupts (requires Poly/ML
4003 5.2.1). Do not use OS.Process.system etc. from the basis library!
4008 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4009 in accordance with Proof General 3.7, which prefers GNU emacs.
4011 * isatool tty runs Isabelle process with plain tty interaction;
4012 optional line editor may be specified via ISABELLE_LINE_EDITOR
4013 setting, the default settings attempt to locate "ledit" and "rlwrap".
4015 * isatool browser now works with Cygwin as well, using general
4016 "javapath" function defined in Isabelle process environment.
4018 * YXML notation provides a simple and efficient alternative to
4019 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4020 isatool yxml as described in the Isabelle system manual.
4022 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4023 provides general wrapper for managing an Isabelle process in a robust
4024 fashion, with ``cooked'' output from stdin/stderr.
4026 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4027 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4029 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4030 way of changing the user's settings is via
4031 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4034 * Multithreading.max_threads := 0 refers to the number of actual CPU
4035 cores of the underlying machine, which is a good starting point for
4036 optimal performance tuning. The corresponding usedir option -M allows
4037 "max" as an alias for "0". WARNING: does not work on certain versions
4038 of Mac OS (with Poly/ML 5.1).
4040 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4041 adverse effect of Isabelle flooding interactive front-ends (notably
4042 ProofGeneral / XEmacs).
4046 New in Isabelle2007 (November 2007)
4047 -----------------------------------
4051 * More uniform information about legacy features, notably a
4052 warning/error of "Legacy feature: ...", depending on the state of the
4053 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4054 legacy features will disappear eventually.
4056 * Theory syntax: the header format ``theory A = B + C:'' has been
4057 discontinued in favour of ``theory A imports B C begin''. Use isatool
4058 fixheaders to convert existing theory files. INCOMPATIBILITY.
4060 * Theory syntax: the old non-Isar theory file format has been
4061 discontinued altogether. Note that ML proof scripts may still be used
4062 with Isar theories; migration is usually quite simple with the ML
4063 function use_legacy_bindings. INCOMPATIBILITY.
4065 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4066 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4069 * Theory loader: be more serious about observing the static theory
4070 header specifications (including optional directories), but not the
4071 accidental file locations of previously successful loads. The strict
4072 update policy of former update_thy is now already performed by
4073 use_thy, so the former has been removed; use_thys updates several
4074 theories simultaneously, just as 'imports' within a theory header
4075 specification, but without merging the results. Potential
4076 INCOMPATIBILITY: may need to refine theory headers and commands
4077 ROOT.ML which depend on load order.
4079 * Theory loader: optional support for content-based file
4080 identification, instead of the traditional scheme of full physical
4081 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4082 (cf. the system manual). The new scheme allows to work with
4083 non-finished theories in persistent session images, such that source
4084 files may be moved later on without requiring reloads.
4086 * Theory loader: old-style ML proof scripts being *attached* to a thy
4087 file (with the same base name as the theory) are considered a legacy
4088 feature, which will disappear eventually. Even now, the theory loader
4089 no longer maintains dependencies on such files.
4091 * Syntax: the scope for resolving ambiguities via type-inference is
4092 now limited to individual terms, instead of whole simultaneous
4093 specifications as before. This greatly reduces the complexity of the
4094 syntax module and improves flexibility by separating parsing and
4095 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4096 'fixes' etc.) are required in rare situations.
4098 * Syntax: constants introduced by new-style packages ('definition',
4099 'abbreviation' etc.) are passed through the syntax module in
4100 ``authentic mode''. This means that associated mixfix annotations
4101 really stick to such constants, independently of potential name space
4102 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4103 trees are represented slightly differently, may need to adapt syntax
4104 translations accordingly. Use CONST marker in 'translations' and
4105 @{const_syntax} antiquotation in 'parse_translation' etc.
4107 * Legacy goal package: reduced interface to the bare minimum required
4108 to keep existing proof scripts running. Most other user-level
4109 functions are now part of the OldGoals structure, which is *not* open
4110 by default (consider isatool expandshort before open OldGoals).
4111 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4112 these tend to cause confusion about the actual goal (!) context being
4113 used here, which is not necessarily the same as the_context().
4115 * Command 'find_theorems': supports "*" wild-card in "name:"
4116 criterion; "with_dups" option. Certain ProofGeneral versions might
4117 support a specific search form (see ProofGeneral/CHANGES).
4119 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4120 by default, which means that "prems" (and also "fixed variables") are
4121 suppressed from proof state output. Note that the ProofGeneral
4122 settings mechanism allows to change and save options persistently, but
4123 older versions of Isabelle will fail to start up if a negative prems
4126 * Local theory targets may be specified by non-nested blocks of
4127 ``context/locale/class ... begin'' followed by ``end''. The body may
4128 contain definitions, theorems etc., including any derived mechanism
4129 that has been implemented on top of these primitives. This concept
4130 generalizes the existing ``theorem (in ...)'' towards more versatility
4133 * Proof General interface: proper undo of final 'end' command;
4134 discontinued Isabelle/classic mode (ML proof scripts).
4137 *** Document preparation ***
4139 * Added antiquotation @{theory name} which prints the given name,
4140 after checking that it refers to a valid ancestor theory in the
4143 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4144 check the given source text as ML type/structure, printing verbatim.
4146 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4147 "c args == rhs" given in the current context. (Any number of
4148 arguments may be given on the LHS.)
4153 * The 'class' package offers a combination of axclass and locale to
4154 achieve Haskell-like type classes in Isabelle. Definitions and
4155 theorems within a class context produce both relative results (with
4156 implicit parameters according to the locale context), and polymorphic
4157 constants with qualified polymorphism (according to the class
4158 context). Within the body context of a 'class' target, a separate
4159 syntax layer ("user space type system") takes care of converting
4160 between global polymorphic consts and internal locale representation.
4161 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4162 "isatool doc classes" provides a tutorial.
4164 * Generic code generator framework allows to generate executable
4165 code for ML and Haskell (including Isabelle classes). A short usage
4168 internal compilation:
4169 export_code <list of constants (term syntax)> in SML
4170 writing SML code to a file:
4171 export_code <list of constants (term syntax)> in SML <filename>
4172 writing OCaml code to a file:
4173 export_code <list of constants (term syntax)> in OCaml <filename>
4174 writing Haskell code to a bunch of files:
4175 export_code <list of constants (term syntax)> in Haskell <filename>
4177 evaluating closed propositions to True/False using code generation:
4180 Reasonable default setup of framework in HOL.
4182 Theorem attributs for selecting and transforming function equations theorems:
4184 [code fun]: select a theorem as function equation for a specific constant
4185 [code fun del]: deselect a theorem as function equation for a specific constant
4186 [code inline]: select an equation theorem for unfolding (inlining) in place
4187 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4189 User-defined serializations (target in {SML, OCaml, Haskell}):
4191 code_const <and-list of constants (term syntax)>
4192 {(target) <and-list of const target syntax>}+
4194 code_type <and-list of type constructors>
4195 {(target) <and-list of type target syntax>}+
4197 code_instance <and-list of instances>
4199 where instance ::= <type constructor> :: <class>
4201 code_class <and_list of classes>
4202 {(target) <and-list of class target syntax>}+
4203 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4205 code_instance and code_class only are effective to target Haskell.
4207 For example usage see src/HOL/ex/Codegenerator.thy and
4208 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4209 generation from Isabelle/HOL theories is available via "isatool doc
4212 * Code generator: consts in 'consts_code' Isar commands are now
4213 referred to by usual term syntax (including optional type
4216 * Command 'no_translations' removes translation rules from theory
4219 * Overloaded definitions are now actually checked for acyclic
4220 dependencies. The overloading scheme is slightly more general than
4221 that of Haskell98, although Isabelle does not demand an exact
4222 correspondence to type class and instance declarations.
4223 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4224 exotic versions of overloading -- at the discretion of the user!
4226 Polymorphic constants are represented via type arguments, i.e. the
4227 instantiation that matches an instance against the most general
4228 declaration given in the signature. For example, with the declaration
4229 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4230 as c(nat). Overloading is essentially simultaneous structural
4231 recursion over such type arguments. Incomplete specification patterns
4232 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4233 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4234 Command 'print_theory' outputs the normalized system of recursive
4235 equations, see section "definitions".
4237 * Configuration options are maintained within the theory or proof
4238 context (with name and type bool/int/string), providing a very simple
4239 interface to a poor-man's version of general context data. Tools may
4240 declare options in ML (e.g. using Attrib.config_int) and then refer to
4241 these values using Config.get etc. Users may change options via an
4242 associated attribute of the same name. This form of context
4243 declaration works particularly well with commands 'declare' or
4244 'using', for example ``declare [[foo = 42]]''. Thus it has become
4245 very easy to avoid global references, which would not observe Isar
4246 toplevel undo/redo and fail to work with multithreading.
4248 Various global ML references of Pure and HOL have been turned into
4249 configuration options:
4251 Unify.search_bound unify_search_bound
4252 Unify.trace_bound unify_trace_bound
4253 Unify.trace_simp unify_trace_simp
4254 Unify.trace_types unify_trace_types
4255 Simplifier.simp_depth_limit simp_depth_limit
4256 Blast.depth_limit blast_depth_limit
4257 DatatypeProp.dtK datatype_distinctness_limit
4258 fast_arith_neq_limit fast_arith_neq_limit
4259 fast_arith_split_limit fast_arith_split_limit
4261 * Named collections of theorems may be easily installed as context
4262 data using the functor NamedThmsFun (see also
4263 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4264 attributes; there is also a toplevel print command. This facility is
4265 just a common case of general context data, which is the preferred way
4266 for anything more complex than just a list of facts in canonical
4269 * Isar: command 'declaration' augments a local theory by generic
4270 declaration functions written in ML. This enables arbitrary content
4271 being added to the context, depending on a morphism that tells the
4272 difference of the original declaration context wrt. the application
4273 context encountered later on.
4275 * Isar: proper interfaces for simplification procedures. Command
4276 'simproc_setup' declares named simprocs (with match patterns, and body
4277 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4278 context. ML antiquotation @{simproc name} retrieves named simprocs.
4280 * Isar: an extra pair of brackets around attribute declarations
4281 abbreviates a theorem reference involving an internal dummy fact,
4282 which will be ignored later --- only the effect of the attribute on
4283 the background context will persist. This form of in-place
4284 declarations is particularly useful with commands like 'declare' and
4285 'using', for example ``have A using [[simproc a]] by simp''.
4287 * Isar: method "assumption" (and implicit closing of subproofs) now
4288 takes simple non-atomic goal assumptions into account: after applying
4289 an assumption as a rule the resulting subgoals are solved by atomic
4290 assumption steps. This is particularly useful to finish 'obtain'
4291 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4292 without referring to the original premise "!!x. P x ==> thesis" in the
4293 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4296 * Isar: implicit use of prems from the Isar proof context is
4297 considered a legacy feature. Common applications like ``have A .''
4298 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4299 referencing facts explicitly here improves readability and
4300 maintainability of proof texts.
4302 * Isar: improper proof element 'guess' is like 'obtain', but derives
4303 the obtained context from the course of reasoning! For example:
4305 assume "EX x y. A x & B y" -- "any previous fact"
4306 then guess x and y by clarify
4308 This technique is potentially adventurous, depending on the facts and
4309 proof tools being involved here.
4311 * Isar: known facts from the proof context may be specified as literal
4312 propositions, using ASCII back-quote syntax. This works wherever
4313 named facts used to be allowed so far, in proof commands, proof
4314 methods, attributes etc. Literal facts are retrieved from the context
4315 according to unification of type and term parameters. For example,
4316 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4317 theorems in the current context, then these are valid literal facts:
4318 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4320 There is also a proof method "fact" which does the same composition
4321 for explicit goal states, e.g. the following proof texts coincide with
4322 certain special cases of literal facts:
4324 have "A" by fact == note `A`
4325 have "A ==> B" by fact == note `A ==> B`
4326 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4327 have "P a ==> Q a" by fact == note `P a ==> Q a`
4329 * Isar: ":" (colon) is no longer a symbolic identifier character in
4330 outer syntax. Thus symbolic identifiers may be used without
4331 additional white space in declarations like this: ``assume *: A''.
4333 * Isar: 'print_facts' prints all local facts of the current context,
4334 both named and unnamed ones.
4336 * Isar: 'def' now admits simultaneous definitions, e.g.:
4338 def x == "t" and y == "u"
4340 * Isar: added command 'unfolding', which is structurally similar to
4341 'using', but affects both the goal state and facts by unfolding given
4342 rewrite rules. Thus many occurrences of the 'unfold' method or
4343 'unfolded' attribute may be replaced by first-class proof text.
4345 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4346 and command 'unfolding' now all support object-level equalities
4347 (potentially conditional). The underlying notion of rewrite rule is
4348 analogous to the 'rule_format' attribute, but *not* that of the
4349 Simplifier (which is usually more generous).
4351 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4352 premises of a theorem by n. Useful in conjunction with drule.
4354 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4355 method expression within a sandbox consisting of the first N
4356 sub-goals, which need to exist. For example, ``simp_all [3]''
4357 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4358 simplifies all new goals that emerge from applying rule foo to the
4359 originally first one.
4361 * Isar: schematic goals are no longer restricted to higher-order
4362 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4365 * Isar: the conclusion of a long theorem statement is now either
4366 'shows' (a simultaneous conjunction, as before), or 'obtains'
4367 (essentially a disjunction of cases with local parameters and
4368 assumptions). The latter allows to express general elimination rules
4369 adequately; in this notation common elimination rules look like this:
4371 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4373 obtains x where "P x"
4375 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4379 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4385 The subsequent classical rules even refer to the formal "thesis"
4388 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4391 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4392 obtains "thesis ==> something"
4394 The actual proof of an 'obtains' statement is analogous to that of the
4395 Isar proof element 'obtain', only that there may be several cases.
4396 Optional case names may be specified in parentheses; these will be
4397 available both in the present proof and as annotations in the
4398 resulting rule, for later use with the 'cases' method (cf. attribute
4401 * Isar: the assumptions of a long theorem statement are available as
4402 "assms" fact in the proof context. This is more appropriate than the
4403 (historical) "prems", which refers to all assumptions of the current
4404 context, including those from the target locale, proof body etc.
4406 * Isar: 'print_statement' prints theorems from the current theory or
4407 proof context in long statement form, according to the syntax of a
4410 * Isar: 'obtain' takes an optional case name for the local context
4411 introduction rule (default "that").
4413 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4414 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4417 * Pure: syntax "CONST name" produces a fully internalized constant
4418 according to the current context. This is particularly useful for
4419 syntax translations that should refer to internal constant
4420 representations independently of name spaces.
4422 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4423 instead of "FOO ". This allows multiple binder declarations to coexist
4424 in the same context. INCOMPATIBILITY.
4426 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4427 primitive that also works in a locale context (both for constants and
4428 fixed variables). Type declaration and internal syntactic representation
4429 of given constants retrieved from the context. Likewise, the
4430 'no_notation' command allows to remove given syntax annotations from the
4433 * Isar/locales: new derived specification elements 'axiomatization',
4434 'definition', 'abbreviation', which support type-inference, admit
4435 object-level specifications (equality, equivalence). See also the
4436 isar-ref manual. Examples:
4439 eq (infix "===" 50) where
4440 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4442 definition "f x y = x + y + 1"
4443 definition g where "g x = f x x"
4446 neq (infix "=!=" 50) where
4447 "x =!= y == ~ (x === y)"
4449 These specifications may be also used in a locale context. Then the
4450 constants being introduced depend on certain fixed parameters, and the
4451 constant name is qualified by the locale base name. An internal
4452 abbreviation takes care for convenient input and output, making the
4453 parameters implicit and using the original short name. See also
4454 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4455 entities from a monomorphic theory.
4457 Presently, abbreviations are only available 'in' a target locale, but
4458 not inherited by general import expressions. Also note that
4459 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4460 'translations' in common applications. The "no_abbrevs" print mode
4461 prevents folding of abbreviations in term output.
4463 Concrete syntax is attached to specified constants in internal form,
4464 independently of name spaces. The parse tree representation is
4465 slightly different -- use 'notation' instead of raw 'syntax', and
4466 'translations' with explicit "CONST" markup to accommodate this.
4468 * Pure/Isar: unified syntax for new-style specification mechanisms
4469 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4470 full type inference and dummy patterns ("_"). For example:
4472 definition "K x _ = x"
4474 inductive conj for A B
4475 where "A ==> B ==> conj A B"
4477 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4478 the current context. Print mode "no_abbrevs" prevents inversion of
4479 abbreviations on output.
4481 * Isar/locales: improved parameter handling: use of locales "var" and
4482 "struct" no longer necessary; - parameter renamings are no longer
4483 required to be injective. For example, this allows to define
4484 endomorphisms as locale endom = homom mult mult h.
4486 * Isar/locales: changed the way locales with predicates are defined.
4487 Instead of accumulating the specification, the imported expression is
4488 now an interpretation. INCOMPATIBILITY: different normal form of
4489 locale expressions. In particular, in interpretations of locales with
4490 predicates, goals repesenting already interpreted fragments are not
4491 removed automatically. Use methods `intro_locales' and
4492 `unfold_locales'; see below.
4494 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4495 provide backward reasoning on locales predicates. The methods are
4496 aware of interpretations and discharge corresponding goals.
4497 `intro_locales' is less aggressive then `unfold_locales' and does not
4498 unfold predicates to assumptions.
4500 * Isar/locales: the order in which locale fragments are accumulated
4501 has changed. This enables to override declarations from fragments due
4502 to interpretations -- for example, unwanted simp rules.
4504 * Isar/locales: interpretation in theories and proof contexts has been
4505 extended. One may now specify (and prove) equations, which are
4506 unfolded in interpreted theorems. This is useful for replacing
4507 defined concepts (constants depending on locale parameters) by
4508 concepts already existing in the target context. Example:
4510 interpretation partial_order ["op <= :: [int, int] => bool"]
4511 where "partial_order.less (op <=) (x::int) y = (x < y)"
4513 Typically, the constant `partial_order.less' is created by a
4514 definition specification element in the context of locale
4517 * Method "induct": improved internal context management to support
4518 local fixes and defines on-the-fly. Thus explicit meta-level
4519 connectives !! and ==> are rarely required anymore in inductive goals
4520 (using object-logic connectives for this purpose has been long
4521 obsolete anyway). Common proof patterns are explained in
4522 src/HOL/Induct/Common_Patterns.thy, see also
4523 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4526 * Method "induct": improved handling of simultaneous goals. Instead of
4527 introducing object-level conjunction, the statement is now split into
4528 several conclusions, while the corresponding symbolic cases are nested
4529 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4530 see src/HOL/Induct/Common_Patterns.thy, for example.
4532 * Method "induct": mutual induction rules are now specified as a list
4533 of rule sharing the same induction cases. HOL packages usually provide
4534 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4535 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4536 mutual induction rules differently, i.e. like this:
4538 (induct rule: foo_bar.inducts)
4539 (induct set: foo bar)
4540 (induct pred: foo bar)
4541 (induct type: foo bar)
4543 The ML function ProjectRule.projections turns old-style rules into the
4546 * Method "coinduct": dual of induction, see
4547 src/HOL/Library/Coinductive_List.thy for various examples.
4549 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4550 considered a legacy feature.
4552 * Attribute "symmetric" produces result with standardized schematic
4553 variables (index 0). Potential INCOMPATIBILITY.
4555 * Simplifier: by default the simplifier trace only shows top level
4556 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4557 default. Thus there is less danger of being flooded by the trace. The
4558 trace indicates where parts have been suppressed.
4560 * Provers/classical: removed obsolete classical version of elim_format
4561 attribute; classical elim/dest rules are now treated uniformly when
4562 manipulating the claset.
4564 * Provers/classical: stricter checks to ensure that supplied intro,
4565 dest and elim rules are well-formed; dest and elim rules must have at
4568 * Provers/classical: attributes dest/elim/intro take an optional
4569 weight argument for the rule (just as the Pure versions). Weights are
4570 ignored by automated tools, but determine the search order of single
4573 * Syntax: input syntax now supports dummy variable binding "%_. b",
4574 where the body does not mention the bound variable. Note that dummy
4575 patterns implicitly depend on their context of bounds, which makes
4576 "{_. _}" match any set comprehension as expected. Potential
4577 INCOMPATIBILITY -- parse translations need to cope with syntactic
4578 constant "_idtdummy" in the binding position.
4580 * Syntax: removed obsolete syntactic constant "_K" and its associated
4581 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4582 for example "A -> B" => "Pi A (%_. B)".
4584 * Pure: 'class_deps' command visualizes the subclass relation, using
4585 the graph browser tool.
4587 * Pure: 'print_theory' now suppresses certain internal declarations by
4588 default; use '!' option for full details.
4593 * Method "metis" proves goals by applying the Metis general-purpose
4594 resolution prover (see also http://gilith.com/software/metis/).
4595 Examples are in the directory MetisExamples. WARNING: the
4596 Isabelle/HOL-Metis integration does not yet work properly with
4599 * Command 'sledgehammer' invokes external automatic theorem provers as
4600 background processes. It generates calls to the "metis" method if
4601 successful. These can be pasted into the proof. Users do not have to
4602 wait for the automatic provers to return. WARNING: does not really
4603 work with multi-threading.
4605 * New "auto_quickcheck" feature tests outermost goal statements for
4606 potential counter-examples. Controlled by ML references
4607 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4608 5000 milliseconds). Fails silently if statements is outside of
4609 executable fragment, or any other codgenerator problem occurs.
4611 * New constant "undefined" with axiom "undefined x = undefined".
4613 * Added class "HOL.eq", allowing for code generation with polymorphic
4616 * Some renaming of class constants due to canonical name prefixing in
4617 the new 'class' package:
4619 HOL.abs ~> HOL.abs_class.abs
4620 HOL.divide ~> HOL.divide_class.divide
4621 0 ~> HOL.zero_class.zero
4622 1 ~> HOL.one_class.one
4623 op + ~> HOL.plus_class.plus
4624 op - ~> HOL.minus_class.minus
4625 uminus ~> HOL.minus_class.uminus
4626 op * ~> HOL.times_class.times
4627 op < ~> HOL.ord_class.less
4628 op <= > HOL.ord_class.less_eq
4629 Nat.power ~> Power.power_class.power
4630 Nat.size ~> Nat.size_class.size
4631 Numeral.number_of ~> Numeral.number_class.number_of
4632 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4633 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4634 Orderings.min ~> Orderings.ord_class.min
4635 Orderings.max ~> Orderings.ord_class.max
4636 Divides.op div ~> Divides.div_class.div
4637 Divides.op mod ~> Divides.div_class.mod
4638 Divides.op dvd ~> Divides.div_class.dvd
4640 INCOMPATIBILITY. Adaptions may be required in the following cases:
4642 a) User-defined constants using any of the names "plus", "minus",
4643 "times", "less" or "less_eq". The standard syntax translations for
4644 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4647 b) Variables named "plus", "minus", "times", "less", "less_eq"
4648 INCOMPATIBILITY: use more specific names.
4650 c) Permutative equations (e.g. "a + b = b + a")
4651 Since the change of names also changes the order of terms, permutative
4652 rewrite rules may get applied in a different order. Experience shows
4653 that this is rarely the case (only two adaptions in the whole Isabelle
4654 distribution). INCOMPATIBILITY: rewrite proofs
4656 d) ML code directly refering to constant names
4657 This in general only affects hand-written proof tactics, simprocs and
4658 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4659 Consider using @{const_name} antiquotation.
4661 * New class "default" with associated constant "default".
4663 * Function "sgn" is now overloaded and available on int, real, complex
4664 (and other numeric types), using class "sgn". Two possible defs of
4665 sgn are given as equational assumptions in the classes sgn_if and
4666 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4669 * Locale "partial_order" now unified with class "order" (cf. theory
4670 Orderings), added parameter "less". INCOMPATIBILITY.
4672 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4673 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4674 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4676 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4677 changed order of proof goals in instance proofs.
4679 * The transitivity reasoner for partial and linear orders is set up
4680 for classes "order" and "linorder". Instances of the reasoner are available
4681 in all contexts importing or interpreting the corresponding locales.
4682 Method "order" invokes the reasoner separately; the reasoner
4683 is also integrated with the Simplifier as a solver. Diagnostic
4684 command 'print_orders' shows the available instances of the reasoner
4685 in the current context.
4687 * Localized monotonicity predicate in theory "Orderings"; integrated
4688 lemmas max_of_mono and min_of_mono with this predicate.
4691 * Formulation of theorem "dense" changed slightly due to integration
4692 with new class dense_linear_order.
4694 * Uniform lattice theory development in HOL.
4696 constants "meet" and "join" now named "inf" and "sup"
4697 constant "Meet" now named "Inf"
4699 classes "meet_semilorder" and "join_semilorder" now named
4700 "lower_semilattice" and "upper_semilattice"
4701 class "lorder" now named "lattice"
4702 class "comp_lat" now named "complete_lattice"
4704 Instantiation of lattice classes allows explicit definitions
4705 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4707 INCOMPATIBILITY. Theorem renames:
4709 meet_left_le ~> inf_le1
4710 meet_right_le ~> inf_le2
4711 join_left_le ~> sup_ge1
4712 join_right_le ~> sup_ge2
4713 meet_join_le ~> inf_sup_ord
4716 le_meet ~> le_inf_iff
4717 le_join ~> ge_sup_conv
4718 meet_idempotent ~> inf_idem
4719 join_idempotent ~> sup_idem
4720 meet_comm ~> inf_commute
4721 join_comm ~> sup_commute
4722 meet_leI1 ~> le_infI1
4723 meet_leI2 ~> le_infI2
4724 le_joinI1 ~> le_supI1
4725 le_joinI2 ~> le_supI2
4726 meet_assoc ~> inf_assoc
4727 join_assoc ~> sup_assoc
4728 meet_left_comm ~> inf_left_commute
4729 meet_left_idempotent ~> inf_left_idem
4730 join_left_comm ~> sup_left_commute
4731 join_left_idempotent ~> sup_left_idem
4734 le_def_meet ~> le_iff_inf
4735 le_def_join ~> le_iff_sup
4736 join_absorp2 ~> sup_absorb2
4737 join_absorp1 ~> sup_absorb1
4738 meet_absorp1 ~> inf_absorb1
4739 meet_absorp2 ~> inf_absorb2
4740 meet_join_absorp ~> inf_sup_absorb
4741 join_meet_absorp ~> sup_inf_absorb
4742 distrib_join_le ~> distrib_sup_le
4743 distrib_meet_le ~> distrib_inf_le
4745 add_meet_distrib_left ~> add_inf_distrib_left
4746 add_join_distrib_left ~> add_sup_distrib_left
4747 is_join_neg_meet ~> is_join_neg_inf
4748 is_meet_neg_join ~> is_meet_neg_sup
4749 add_meet_distrib_right ~> add_inf_distrib_right
4750 add_join_distrib_right ~> add_sup_distrib_right
4751 add_meet_join_distribs ~> add_sup_inf_distribs
4752 join_eq_neg_meet ~> sup_eq_neg_inf
4753 meet_eq_neg_join ~> inf_eq_neg_sup
4754 add_eq_meet_join ~> add_eq_inf_sup
4755 meet_0_imp_0 ~> inf_0_imp_0
4756 join_0_imp_0 ~> sup_0_imp_0
4757 meet_0_eq_0 ~> inf_0_eq_0
4758 join_0_eq_0 ~> sup_0_eq_0
4759 neg_meet_eq_join ~> neg_inf_eq_sup
4760 neg_join_eq_meet ~> neg_sup_eq_inf
4761 join_eq_if ~> sup_eq_if
4763 mono_meet ~> mono_inf
4764 mono_join ~> mono_sup
4765 meet_bool_eq ~> inf_bool_eq
4766 join_bool_eq ~> sup_bool_eq
4767 meet_fun_eq ~> inf_fun_eq
4768 join_fun_eq ~> sup_fun_eq
4769 meet_set_eq ~> inf_set_eq
4770 join_set_eq ~> sup_set_eq
4771 meet1_iff ~> inf1_iff
4772 meet2_iff ~> inf2_iff
4781 join1_iff ~> sup1_iff
4782 join2_iff ~> sup2_iff
4792 is_meet_Meet ~> is_meet_Inf
4793 Meet_bool_def ~> Inf_bool_def
4794 Meet_fun_def ~> Inf_fun_def
4795 Meet_greatest ~> Inf_greatest
4796 Meet_lower ~> Inf_lower
4797 Meet_set_def ~> Inf_set_def
4800 Sup_bool_eq ~> Sup_bool_def
4801 Sup_fun_eq ~> Sup_fun_def
4802 Sup_set_eq ~> Sup_set_def
4804 listsp_meetI ~> listsp_infI
4805 listsp_meet_eq ~> listsp_inf_eq
4810 * Added syntactic class "size"; overloaded constant "size" now has
4811 type "'a::size ==> bool"
4813 * Internal reorganisation of `size' of datatypes: size theorems
4814 "foo.size" are no longer subsumed by "foo.simps" (but are still
4815 simplification rules by default!); theorems "prod.size" now named
4818 * Class "div" now inherits from class "times" rather than "type".
4821 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4822 Linorder etc. have disappeared; operations defined in terms of
4823 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4825 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4827 * HOL-Word: New extensive library and type for generic, fixed size
4828 machine words, with arithmetic, bit-wise, shifting and rotating
4829 operations, reflection into int, nat, and bool lists, automation for
4830 linear arithmetic (by automatic reflection into nat or int), including
4831 lemmas on overflow and monotonicity. Instantiated to all appropriate
4832 arithmetic type classes, supporting automatic simplification of
4833 numerals on all operations.
4835 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4837 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4839 * Code generator library theories:
4840 - Code_Integer represents HOL integers by big integer literals in target
4842 - Code_Char represents HOL characters by character literals in target
4844 - Code_Char_chr like Code_Char, but also offers treatment of character
4845 codes; includes Code_Integer.
4846 - Executable_Set allows to generate code for finite sets using lists.
4847 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4849 - Executable_Real implements a subset of real numbers, namly those
4850 representable by rational numbers.
4851 - Efficient_Nat implements natural numbers by integers, which in general will
4852 result in higher efficency; pattern matching with 0/Suc is eliminated;
4853 includes Code_Integer.
4854 - Code_Index provides an additional datatype index which is mapped to
4855 target-language built-in integers.
4856 - Code_Message provides an additional datatype message_string which is isomorphic to
4857 strings; messages are mapped to target-language strings.
4859 * New package for inductive predicates
4861 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4864 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4865 for z_1 :: U_1 and ... and z_n :: U_m
4867 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4870 with full support for type-inference, rather than
4872 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4874 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4875 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4877 inductive "s z_1 ... z_m"
4879 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4882 For backward compatibility, there is a wrapper allowing inductive
4883 sets to be defined with the new package via
4886 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4887 for z_1 :: U_1 and ... and z_n :: U_m
4889 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4895 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4896 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4897 for z_1 :: U_1 and ... and z_n :: U_m
4899 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4900 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4903 if the additional syntax "p ..." is required.
4905 Numerous examples can be found in the subdirectories src/HOL/Auth,
4906 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4910 - Since declaration and definition of inductive sets or predicates
4911 is no longer separated, abbreviations involving the newly
4912 introduced sets or predicates must be specified together with the
4913 introduction rules after the 'where' keyword (see above), rather
4914 than before the actual inductive definition.
4916 - The variables in induction and elimination rules are now
4917 quantified in the order of their occurrence in the introduction
4918 rules, rather than in alphabetical order. Since this may break
4919 some proofs, these proofs either have to be repaired, e.g. by
4920 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4921 statements of the form
4923 case (rule_i a_i_1 ... a_i_{k_i})
4925 or the old order of quantification has to be restored by explicitly adding
4926 meta-level quantifiers in the introduction rules, i.e.
4928 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4930 - The format of the elimination rules is now
4932 p z_1 ... z_m x_1 ... x_n ==>
4933 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4938 (x_1, ..., x_n) : s z_1 ... z_m ==>
4939 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4942 for sets rather than
4944 x : s z_1 ... z_m ==>
4945 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4948 This may require terms in goals to be expanded to n-tuples
4949 (e.g. using case_tac or simplification with the split_paired_all
4950 rule) before the above elimination rule is applicable.
4952 - The elimination or case analysis rules for (mutually) inductive
4953 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4954 list of rules "p_1_..._p_k.elims" is no longer available.
4956 * New package "function"/"fun" for general recursive functions,
4957 supporting mutual and nested recursion, definitions in local contexts,
4958 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4959 for small examples, and the separate tutorial on the function
4960 package. The old recdef "package" is still available as before, but
4961 users are encouraged to use the new package.
4963 * Method "lexicographic_order" automatically synthesizes termination
4964 relations as lexicographic combinations of size measures.
4966 * Case-expressions allow arbitrary constructor-patterns (including
4967 "_") and take their order into account, like in functional
4968 programming. Internally, this is translated into nested
4969 case-expressions; missing cases are added and mapped to the predefined
4970 constant "undefined". In complicated cases printing may no longer show
4971 the original input but the internal form. Lambda-abstractions allow
4972 the same form of pattern matching: "% pat1 => e1 | ..." is an
4973 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4976 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4977 is an abbreviation for "of_nat :: nat => int". The simplification
4978 rules for "of_nat" have been changed to work like "int" did
4979 previously. Potential INCOMPATIBILITY:
4980 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4981 - of_nat_diff and of_nat_mult are no longer default simp rules
4983 * Method "algebra" solves polynomial equations over (semi)rings using
4984 Groebner bases. The (semi)ring structure is defined by locales and the
4985 tool setup depends on that generic context. Installing the method for
4986 a specific type involves instantiating the locale and possibly adding
4987 declarations for computation on the coefficients. The method is
4988 already instantiated for natural numbers and for the axiomatic class
4989 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4990 CALCULEMUS 2007 for the general principles underlying this
4991 architecture of context-aware proof-tools.
4993 * Method "ferrack" implements quantifier elimination over
4994 special-purpose dense linear orders using locales (analogous to
4995 "algebra"). The method is already installed for class
4996 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4999 * Former constant "List.op @" now named "List.append". Use ML
5000 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5001 circumvent possible incompatibilities when working on ML level.
5003 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5005 * New function listsum :: 'a list => 'a for arbitrary monoids.
5006 Special syntax: "SUM x <- xs. f x" (and latex variants)
5008 * New syntax for Haskell-like list comprehension (input only), eg.
5009 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5011 * The special syntax for function "filter" has changed from [x :
5012 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5013 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5015 * [a..b] is now defined for arbitrary linear orders. It used to be
5016 defined on nat only, as an abbreviation for [a..<Suc b]
5019 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5021 * New functions "sorted" and "sort" in src/HOL/List.thy.
5023 * New lemma collection field_simps (an extension of ring_simps) for
5024 manipulating (in)equations involving division. Multiplies with all
5025 denominators that can be proved to be non-zero (in equations) or
5026 positive/negative (in inequations).
5028 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5029 have been improved and renamed to ring_simps, group_simps and
5030 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5031 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5033 * Theory Library/Commutative_Ring: switched from recdef to function
5034 package; constants add, mul, pow now curried. Infix syntax for
5035 algebraic operations.
5037 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5040 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5043 * HOL/records: generalised field-update to take a function on the
5044 field rather than the new value: r(|A := x|) is translated to A_update
5045 (K x) r The K-combinator that is internally used is called K_record.
5046 INCOMPATIBILITY: Usage of the plain update functions has to be
5049 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5050 * x = 0, which are required for a semiring. Richer structures do not
5051 inherit from semiring_0 anymore, because this property is a theorem
5052 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5053 there is more to prove, but this is mostly trivial.
5055 * Class "recpower" is generalized to arbitrary monoids, not just
5056 commutative semirings. INCOMPATIBILITY: may need to incorporate
5057 commutativity or semiring properties additionally.
5059 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5060 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5061 better use 'abbreviation'.
5063 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5065 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5066 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5067 significant changes for setting up numeral syntax for types:
5068 - New constants Numeral.pred and Numeral.succ instead
5069 of former Numeral.bin_pred and Numeral.bin_succ.
5070 - Use integer operations instead of bin_add, bin_mult and so on.
5071 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5072 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5074 See src/HOL/Integ/IntArith.thy for an example setup.
5076 * Command 'normal_form' computes the normal form of a term that may
5077 contain free variables. For example ``normal_form "rev [a, b, c]"''
5078 produces ``[b, c, a]'' (without proof). This command is suitable for
5079 heavy-duty computations because the functions are compiled to ML
5080 first. Correspondingly, a method "normalization" is provided. See
5081 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5083 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5084 25 like -->); output depends on the "iff" print_mode, the default is
5085 "A = B" (with priority 50).
5087 * Relations less (<) and less_eq (<=) are also available on type bool.
5088 Modified syntax to disallow nesting without explicit parentheses,
5089 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5092 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5094 * Relation composition operator "op O" now has precedence 75 and binds
5095 stronger than union and intersection. INCOMPATIBILITY.
5097 * The old set interval syntax "{m..n(}" (and relatives) has been
5098 removed. Use "{m..<n}" (and relatives) instead.
5100 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5101 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5102 ``declare [[simproc del: neq]]''.
5104 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5107 * Theorem Cons_eq_map_conv no longer declared as "simp".
5109 * Theorem setsum_mult renamed to setsum_right_distrib.
5111 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5114 * Reimplemented methods "sat" and "satx", with several improvements:
5115 goals no longer need to be stated as "<prems> ==> False", equivalences
5116 (i.e. "=" on type bool) are handled, variable names of the form
5117 "lit_<n>" are no longer reserved, significant speedup.
5119 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5120 zChaff is still supported as well.
5122 * 'inductive' and 'datatype': provide projections of mutual rules,
5123 bundled as foo_bar.inducts;
5125 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5128 * Library: moved theory Accessible_Part to main HOL.
5130 * Library: added theory Coinductive_List of potentially infinite lists
5131 as greatest fixed-point.
5133 * Library: added theory AssocList which implements (finite) maps as
5136 * Method "evaluation" solves goals (i.e. a boolean expression)
5137 efficiently by compiling it to ML. The goal is "proved" (via an
5138 oracle) if it evaluates to True.
5140 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5141 also when invoked by the simplifier. This results in the Simplifier
5142 being more powerful on arithmetic goals. INCOMPATIBILITY.
5143 Configuration option fast_arith_split_limit=0 recovers the old
5146 * Support for hex (0x20) and binary (0b1001) numerals.
5148 * New method: reify eqs (t), where eqs are equations for an
5149 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5150 parameter, computes a term s::'b and a list xs::'a list and proves the
5151 theorem I xs s = t. This is also known as reification or quoting. The
5152 resulting theorem is applied to the subgoal to substitute t with I xs
5153 s. If t is omitted, the subgoal itself is reified.
5155 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5156 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5157 where f is supposed to be a computable function (in the sense of code
5158 generattion). The method uses reify to compute s and xs as above then
5159 applies corr_thm and uses normalization by evaluation to "prove" f s =
5160 r and finally gets the theorem t = r, which is again applied to the
5161 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5163 * Reflection: Automatic reification now handels binding, an example is
5164 available in src/HOL/ex/ReflectionEx.thy
5166 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5167 command 'statespace' that is similar to 'record', but introduces an
5168 abstract specification based on the locale infrastructure instead of
5169 HOL types. This leads to extra flexibility in composing state spaces,
5170 in particular multiple inheritance and renaming of components.
5175 * Hyperreal: Functions root and sqrt are now defined on negative real
5176 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5177 Nonnegativity side conditions have been removed from many lemmas, so
5178 that more subgoals may now be solved by simplification; potential
5181 * Real: new type classes formalize real normed vector spaces and
5182 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5183 and norm :: 'a => real.
5185 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5186 reals into other types. The overloaded constant Reals :: 'a set is now
5187 defined as range of_real; potential INCOMPATIBILITY.
5189 * Real: proper support for ML code generation, including 'quickcheck'.
5190 Reals are implemented as arbitrary precision rationals.
5192 * Hyperreal: Several constants that previously worked only for the
5193 reals have been generalized, so they now work over arbitrary vector
5194 spaces. Type annotations may need to be added in some cases; potential
5197 Infinitesimal :: ('a::real_normed_vector) star set
5198 HFinite :: ('a::real_normed_vector) star set
5199 HInfinite :: ('a::real_normed_vector) star set
5200 approx :: ('a::real_normed_vector) star => 'a star => bool
5201 monad :: ('a::real_normed_vector) star => 'a star set
5202 galaxy :: ('a::real_normed_vector) star => 'a star set
5203 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5204 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5205 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5206 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5207 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5208 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5209 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5210 sgn :: 'a::real_normed_vector => 'a
5211 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5213 * Complex: Some complex-specific constants are now abbreviations for
5214 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5215 hnorm. Other constants have been entirely removed in favor of the
5216 polymorphic versions (INCOMPATIBILITY):
5220 HInfinite <-- CInfinite
5221 Infinitesimal <-- CInfinitesimal
5224 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5225 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5226 (ns)deriv <-- (ns)cderiv
5231 * Formalisation of ideals and the quotient construction over rings.
5233 * Order and lattice theory no longer based on records.
5236 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5237 greatest_closed. INCOMPATIBILITY.
5239 * Method algebra is now set up via an attribute. For examples see
5240 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5241 of algebraic structures.
5243 * Renamed theory CRing to Ring.
5248 * Substantial, yet incomplete support for nominal datatypes (binding
5249 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5250 src/HOL/Nominal/Examples. Prospective users should consult
5251 http://isabelle.in.tum.de/nominal/
5256 * ML basics: just one true type int, which coincides with IntInf.int
5259 * ML within Isar: antiquotations allow to embed statically-checked
5260 formal entities in the source, referring to the context available at
5261 compile-time. For example:
5263 ML {* @{sort "{zero,one}"} *}
5264 ML {* @{typ "'a => 'b"} *}
5265 ML {* @{term "%x. x"} *}
5266 ML {* @{prop "x == y"} *}
5267 ML {* @{ctyp "'a => 'b"} *}
5268 ML {* @{cterm "%x. x"} *}
5269 ML {* @{cprop "x == y"} *}
5270 ML {* @{thm asm_rl} *}
5271 ML {* @{thms asm_rl} *}
5272 ML {* @{type_name c} *}
5273 ML {* @{type_syntax c} *}
5274 ML {* @{const_name c} *}
5275 ML {* @{const_syntax c} *}
5278 ML {* @{theory Pure} *}
5279 ML {* @{theory_ref} *}
5280 ML {* @{theory_ref Pure} *}
5283 ML {* @{clasimpset} *}
5285 The same works for sources being ``used'' within an Isar context.
5287 * ML in Isar: improved error reporting; extra verbosity with
5288 ML_Context.trace enabled.
5290 * Pure/General/table.ML: the join operations now works via exceptions
5291 DUP/SAME instead of type option. This is simpler in simple cases, and
5292 admits slightly more efficient complex applications.
5294 * Pure: 'advanced' translation functions (parse_translation etc.) now
5295 use Context.generic instead of just theory.
5297 * Pure: datatype Context.generic joins theory/Proof.context and
5298 provides some facilities for code that works in either kind of
5299 context, notably GenericDataFun for uniform theory and proof data.
5301 * Pure: simplified internal attribute type, which is now always
5302 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5303 local (Proof.context) attributes have been discontinued, while
5304 minimizing code duplication. Thm.rule_attribute and
5305 Thm.declaration_attribute build canonical attributes; see also structure
5306 Context for further operations on Context.generic, notably
5307 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5308 declarations and definitions.
5310 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5311 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5312 init only required for impure data. INCOMPATIBILITY: empty really need
5313 to be empty (no dependencies on theory content!)
5315 * Pure/kernel: consts certification ignores sort constraints given in
5316 signature declarations. (This information is not relevant to the
5317 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5318 potential INCOMPATIBILITY.
5320 * Pure: axiomatic type classes are now purely definitional, with
5321 explicit proofs of class axioms and super class relations performed
5322 internally. See Pure/axclass.ML for the main internal interfaces --
5323 notably AxClass.define_class supercedes AxClass.add_axclass, and
5324 AxClass.axiomatize_class/classrel/arity supersede
5325 Sign.add_classes/classrel/arities.
5327 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5328 global/local versions on theory vs. Proof.context have been
5329 discontinued; Attrib.syntax and Method.syntax have been adapted
5330 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5331 attributes, methods, etc.
5333 * Pure: several functions of signature "... -> theory -> theory * ..."
5334 have been reoriented to "... -> theory -> ... * theory" in order to
5335 allow natural usage in combination with the ||>, ||>>, |-> and
5336 fold_map combinators.
5338 * Pure: official theorem names (closed derivations) and additional
5339 comments (tags) are now strictly separate. Name hints -- which are
5340 maintained as tags -- may be attached any time without affecting the
5343 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5344 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5345 achieve the old behaviour.
5347 * Pure: the "Goal" constant is now called "prop", supporting a
5348 slightly more general idea of ``protecting'' meta-level rule
5351 * Pure: Logic.(un)varify only works in a global context, which is now
5352 enforced instead of silently assumed. INCOMPATIBILITY, may use
5353 Logic.legacy_(un)varify as temporary workaround.
5355 * Pure: structure Name provides scalable operations for generating
5356 internal variable names, notably Name.variants etc. This replaces
5357 some popular functions from term.ML:
5359 Term.variant -> Name.variant
5360 Term.variantlist -> Name.variant_list
5361 Term.invent_names -> Name.invent_list
5363 Note that low-level renaming rarely occurs in new code -- operations
5364 from structure Variable are used instead (see below).
5366 * Pure: structure Variable provides fundamental operations for proper
5367 treatment of fixed/schematic variables in a context. For example,
5368 Variable.import introduces fixes for schematics of given facts and
5369 Variable.export reverses the effect (up to renaming) -- this replaces
5370 various freeze_thaw operations.
5372 * Pure: structure Goal provides simple interfaces for
5373 init/conclude/finish and tactical prove operations (replacing former
5374 Tactic.prove). Goal.prove is the canonical way to prove results
5375 within a given context; Goal.prove_global is a degraded version for
5376 theory level goals, including a global Drule.standard. Note that
5377 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5378 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5379 in a locale context).
5381 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5382 and type checking (Syntax.check_term etc.), with common combinations
5383 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5384 which are considered legacy and await removal.
5386 * Pure/Syntax: generic interfaces for type unchecking
5387 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5388 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5389 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5390 available for convenience, but refer to the very same operations using
5391 a mere theory instead of a full context.
5393 * Isar: simplified treatment of user-level errors, using exception
5394 ERROR of string uniformly. Function error now merely raises ERROR,
5395 without any side effect on output channels. The Isar toplevel takes
5396 care of proper display of ERROR exceptions. ML code may use plain
5397 handle/can/try; cat_error may be used to concatenate errors like this:
5399 ... handle ERROR msg => cat_error msg "..."
5401 Toplevel ML code (run directly or through the Isar toplevel) may be
5402 embedded into the Isar toplevel with exception display/debug like
5405 Isar.toplevel (fn () => ...)
5407 INCOMPATIBILITY, removed special transform_error facilities, removed
5408 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5409 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5410 -- use plain ERROR instead.
5412 * Isar: theory setup now has type (theory -> theory), instead of a
5413 list. INCOMPATIBILITY, may use #> to compose setup functions.
5415 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5416 ProofContext.debug/verbose flags.
5418 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5419 theory before entering a proof state. Transactions now always see a
5420 quasi-functional intermediate checkpoint, both in interactive and
5423 * Isar: simplified interfaces for outer syntax. Renamed
5424 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5425 OuterSyntax.add_parsers -- this functionality is now included in
5426 OuterSyntax.command etc. INCOMPATIBILITY.
5428 * Simplifier: the simpset of a running simplification process now
5429 contains a proof context (cf. Simplifier.the_context), which is the
5430 very context that the initial simpset has been retrieved from (by
5431 simpset_of/local_simpset_of). Consequently, all plug-in components
5432 (solver, looper etc.) may depend on arbitrary proof data.
5434 * Simplifier.inherit_context inherits the proof context (plus the
5435 local bounds) of the current simplification process; any simproc
5436 etc. that calls the Simplifier recursively should do this! Removed
5437 former Simplifier.inherit_bounds, which is already included here --
5438 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5439 specify an explicit context using Simplifier.context/theory_context.
5441 * Simplifier/Classical Reasoner: more abstract interfaces
5442 change_simpset/claset for modifying the simpset/claset reference of a
5443 theory; raw versions simpset/claset_ref etc. have been discontinued --
5446 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5452 * settings: the default heap location within ISABELLE_HOME_USER now
5453 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5454 Isabelle installations.
5456 * isabelle-process: option -S (secure mode) disables some critical
5457 operations, notably runtime compilation and evaluation of ML source
5460 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5462 * Support for parallel execution, using native multicore support of
5463 Poly/ML 5.1. The theory loader exploits parallelism when processing
5464 independent theories, according to the given theory header
5465 specifications. The maximum number of worker threads is specified via
5466 usedir option -M or the "max-threads" setting in Proof General. A
5467 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5468 to 6 on a 8-core machine. User-code needs to observe certain
5469 guidelines for thread-safe programming, see appendix A in the Isar
5470 Implementation manual.
5474 New in Isabelle2005 (October 2005)
5475 ----------------------------------
5479 * Theory headers: the new header syntax for Isar theories is
5482 imports <theory1> ... <theoryN>
5483 uses <file1> ... <fileM>
5486 where the 'uses' part is optional. The previous syntax
5488 theory <name> = <theory1> + ... + <theoryN>:
5490 will disappear in the next release. Use isatool fixheaders to convert
5491 existing theory files. Note that there is no change in ancient
5492 non-Isar theories now, but these will disappear soon.
5494 * Theory loader: parent theories can now also be referred to via
5495 relative and absolute paths.
5497 * Command 'find_theorems' searches for a list of criteria instead of a
5498 list of constants. Known criteria are: intro, elim, dest, name:string,
5499 simp:term, and any term. Criteria can be preceded by '-' to select
5500 theorems that do not match. Intro, elim, dest select theorems that
5501 match the current goal, name:s selects theorems whose fully qualified
5502 name contain s, and simp:term selects all simplification rules whose
5503 lhs match term. Any other term is interpreted as pattern and selects
5504 all theorems matching the pattern. Available in ProofGeneral under
5505 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5507 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5509 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5510 matching the current goal as introduction rule and not having "HOL."
5511 in their name (i.e. not being defined in theory HOL).
5513 * Command 'thms_containing' has been discontinued in favour of
5514 'find_theorems'; INCOMPATIBILITY.
5516 * Communication with Proof General is now 8bit clean, which means that
5517 Unicode text in UTF-8 encoding may be used within theory texts (both
5518 formal and informal parts). Cf. option -U of the Isabelle Proof
5519 General interface. Here are some simple examples (cf. src/HOL/ex):
5521 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5522 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5524 * Improved efficiency of the Simplifier and, to a lesser degree, the
5525 Classical Reasoner. Typical big applications run around 2 times
5529 *** Document preparation ***
5531 * Commands 'display_drafts' and 'print_drafts' perform simple output
5532 of raw sources. Only those symbols that do not require additional
5533 LaTeX packages (depending on comments in isabellesym.sty) are
5534 displayed properly, everything else is left verbatim. isatool display
5535 and isatool print are used as front ends (these are subject to the
5536 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5538 * Command tags control specific markup of certain regions of text,
5539 notably folding and hiding. Predefined tags include "theory" (for
5540 theory begin and end), "proof" for proof commands, and "ML" for
5541 commands involving ML code; the additional tags "visible" and
5542 "invisible" are unused by default. Users may give explicit tag
5543 specifications in the text, e.g. ''by %invisible (auto)''. The
5544 interpretation of tags is determined by the LaTeX job during document
5545 preparation: see option -V of isatool usedir, or options -n and -t of
5546 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5549 Several document versions may be produced at the same time via isatool
5550 usedir (the generated index.html will link all of them). Typical
5551 specifications include ''-V document=theory,proof,ML'' to present
5552 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5553 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5554 these parts without any formal replacement text. The Isabelle site
5555 default settings produce ''document'' and ''outline'' versions as
5558 * Several new antiquotations:
5560 @{term_type term} prints a term with its type annotated;
5562 @{typeof term} prints the type of a term;
5564 @{const const} is the same as @{term const}, but checks that the
5565 argument is a known logical constant;
5567 @{term_style style term} and @{thm_style style thm} print a term or
5568 theorem applying a "style" to it
5572 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5573 definitions, equations, inequations etc., 'concl' printing only the
5574 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5575 to print the specified premise. TermStyle.add_style provides an ML
5576 interface for introducing further styles. See also the "LaTeX Sugar"
5577 document practical applications. The ML antiquotation prints
5578 type-checked ML expressions verbatim.
5580 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5581 and 'text' support optional locale specification '(in loc)', which
5582 specifies the default context for interpreting antiquotations. For
5583 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5585 * Option 'locale=NAME' of antiquotations specifies an alternative
5586 context interpreting the subsequent argument. For example: @{thm
5587 [locale=lattice] inf_assoc}.
5589 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5592 * Proper output of antiquotations for theory commands involving a
5593 proof context (such as 'locale' or 'theorem (in loc) ...').
5595 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5596 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5598 * isatool usedir: new option -C (default true) controls whether option
5599 -D should include a copy of the original document directory; -C false
5600 prevents unwanted effects such as copying of administrative CVS data.
5605 * Considerably improved version of 'constdefs' command. Now performs
5606 automatic type-inference of declared constants; additional support for
5607 local structure declarations (cf. locales and HOL records), see also
5608 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5609 sequential dependencies of definitions within a single 'constdefs'
5610 section; moreover, the declared name needs to be an identifier. If
5611 all fails, consider to fall back on 'consts' and 'defs' separately.
5613 * Improved indexed syntax and implicit structures. First of all,
5614 indexed syntax provides a notational device for subscripted
5615 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5616 expressions. Secondly, in a local context with structure
5617 declarations, number indexes \<^sub>n or the empty index (default
5618 number 1) refer to a certain fixed variable implicitly; option
5619 show_structs controls printing of implicit structures. Typical
5620 applications of these concepts involve record types and locales.
5622 * New command 'no_syntax' removes grammar declarations (and
5623 translations) resulting from the given syntax specification, which is
5624 interpreted in the same manner as for the 'syntax' command.
5626 * 'Advanced' translation functions (parse_translation etc.) may depend
5627 on the signature of the theory context being presently used for
5628 parsing/printing, see also isar-ref manual.
5630 * Improved 'oracle' command provides a type-safe interface to turn an
5631 ML expression of type theory -> T -> term into a primitive rule of
5632 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5633 is already included here); see also FOL/ex/IffExample.thy;
5636 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5637 before); "cI" is no longer bound, use "c.intro" instead.
5638 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5639 axclasses vs. locales.
5641 * Improved internal renaming of symbolic identifiers -- attach primes
5642 instead of base 26 numbers.
5644 * New flag show_question_marks controls printing of leading question
5645 marks in schematic variable names.
5647 * In schematic variable names, *any* symbol following \<^isub> or
5648 \<^isup> is now treated as part of the base name. For example, the
5649 following works without printing of awkward ".0" indexes:
5651 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5654 * Inner syntax includes (*(*nested*) comments*).
5656 * Pretty printer now supports unbreakable blocks, specified in mixfix
5657 annotations as "(00...)".
5659 * Clear separation of logical types and nonterminals, where the latter
5660 may only occur in 'syntax' specifications or type abbreviations.
5661 Before that distinction was only partially implemented via type class
5662 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5663 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5664 exotic syntax specifications may require further adaption
5665 (e.g. Cube/Cube.thy).
5667 * Removed obsolete type class "logic", use the top sort {} instead.
5668 Note that non-logical types should be declared as 'nonterminals'
5669 rather than 'types'. INCOMPATIBILITY for new object-logic
5672 * Attributes 'induct' and 'cases': type or set names may now be
5673 locally fixed variables as well.
5675 * Simplifier: can now control the depth to which conditional rewriting
5676 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5679 * Simplifier: simplification procedures may now take the current
5680 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5681 interface), which is very useful for calling the Simplifier
5682 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5683 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5684 low-level mk_simproc no longer applies Logic.varify internally, to
5685 allow for use in a context of fixed variables.
5687 * thin_tac now works even if the assumption being deleted contains !!
5688 or ==>. More generally, erule now works even if the major premise of
5689 the elimination rule contains !! or ==>.
5691 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5693 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5694 from Pure, which contains all common declarations already. Both
5695 theories are defined via plain Isabelle/Isar .thy files.
5696 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5697 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5698 use isatool fixcpure to adapt your theory and ML sources.
5700 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5701 selections of theorems in named facts via index ranges.
5703 * 'print_theorems': in theory mode, really print the difference
5704 wrt. the last state (works for interactive theory development only),
5705 in proof mode print all local facts (cf. 'print_facts');
5707 * 'hide': option '(open)' hides only base names.
5709 * More efficient treatment of intermediate checkpoints in interactive
5712 * Code generator is now invoked via code_module (incremental code
5713 generation) and code_library (modular code generation, ML structures
5714 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5715 must be quoted when used as identifiers.
5717 * New 'value' command for reading, evaluating and printing terms using
5718 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5719 quoted when used as identifier.
5724 * New commands for the interpretation of locale expressions in
5725 theories (1), locales (2) and proof contexts (3). These generate
5726 proof obligations from the expression specification. After the
5727 obligations have been discharged, theorems of the expression are added
5728 to the theory, target locale or proof context. The synopsis of the
5729 commands is a follows:
5731 (1) interpretation expr inst
5732 (2) interpretation target < expr
5733 (3) interpret expr inst
5735 Interpretation in theories and proof contexts require a parameter
5736 instantiation of terms from the current context. This is applied to
5737 specifications and theorems of the interpreted expression.
5738 Interpretation in locales only permits parameter renaming through the
5739 locale expression. Interpretation is smart in that interpretations
5740 that are active already do not occur in proof obligations, neither are
5741 instantiated theorems stored in duplicate. Use 'print_interps' to
5742 inspect active interpretations of a particular locale. For details,
5743 see the Isar Reference manual. Examples can be found in
5744 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5746 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5747 'interpret' instead.
5749 * New context element 'constrains' for adding type constraints to
5752 * Context expressions: renaming of parameters with syntax
5755 * Locale declaration: 'includes' disallowed.
5757 * Proper static binding of attribute syntax -- i.e. types / terms /
5758 facts mentioned as arguments are always those of the locale definition
5759 context, independently of the context of later invocations. Moreover,
5760 locale operations (renaming and type / term instantiation) are applied
5761 to attribute arguments as expected.
5763 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5764 actual attributes; rare situations may require Attrib.attribute to
5765 embed those attributes into Attrib.src that lack concrete syntax.
5766 Attribute implementations need to cooperate properly with the static
5767 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5768 Attrib.XXX_thm etc. already do the right thing without further
5769 intervention. Only unusual applications -- such as "where" or "of"
5770 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5771 on the context and the facts involved -- may have to assign parsed
5772 values to argument tokens explicitly.
5774 * Changed parameter management in theorem generation for long goal
5775 statements with 'includes'. INCOMPATIBILITY: produces a different
5776 theorem statement in rare situations.
5778 * Locale inspection command 'print_locale' omits notes elements. Use
5779 'print_locale!' to have them included in the output.
5784 * Provers/hypsubst.ML: improved version of the subst method, for
5785 single-step rewriting: it now works in bound variable contexts. New is
5786 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5787 rewrite a different subterm than the original subst method, which is
5788 still available as 'simplesubst'.
5790 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5793 * Provers/trancl.ML: new transitivity reasoner for transitive and
5794 reflexive-transitive closure of relations.
5796 * Provers/blast.ML: new reference depth_limit to make blast's depth
5797 limit (previously hard-coded with a value of 20) user-definable.
5799 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5800 is peformed already. Object-logics merely need to finish their
5801 initial simpset configuration as before. INCOMPATIBILITY.
5806 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5809 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5811 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5812 and x-symbol; use option '-m epsilon' to get it actually printed.
5813 Moreover, the mathematically important symbolic identifier \<epsilon>
5814 becomes available as variable, constant etc. INCOMPATIBILITY,
5816 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5817 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5818 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5819 support corresponding Isar calculations.
5821 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5824 * theory SetInterval: changed the syntax for open intervals:
5833 The old syntax is still supported but will disappear in the next
5834 release. For conversion use the following Emacs search and replace
5835 patterns (these are not perfect but work quite well):
5837 {)\([^\.]*\)\.\. -> {\1<\.\.}
5838 \.\.\([^(}]*\)(} -> \.\.<\1}
5840 * Theory Commutative_Ring (in Library): method comm_ring for proving
5841 equalities in commutative rings; method 'algebra' provides a generic
5844 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5845 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5846 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5849 Some new syntax forms are available:
5851 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5852 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5853 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5854 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5856 The latter form "\<Sum>x < k. e" used to be based on a separate
5857 function "Summation", which has been discontinued.
5859 * theory Finite_Set: in structured induction proofs, the insert case
5860 is now 'case (insert x F)' instead of the old counterintuitive 'case
5863 * The 'refute' command has been extended to support a much larger
5864 fragment of HOL, including axiomatic type classes, constdefs and
5865 typedefs, inductive datatypes and recursion.
5867 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5868 Requires zChaff with proof generation to be installed. See
5869 HOL/ex/SAT_Examples.thy for examples.
5871 * Datatype induction via method 'induct' now preserves the name of the
5872 induction variable. For example, when proving P(xs::'a list) by
5873 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5874 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5875 in unstructured proof scripts.
5877 * Reworked implementation of records. Improved scalability for
5878 records with many fields, avoiding performance problems for type
5879 inference. Records are no longer composed of nested field types, but
5880 of nested extension types. Therefore the record type only grows linear
5881 in the number of extensions and not in the number of fields. The
5882 top-level (users) view on records is preserved. Potential
5883 INCOMPATIBILITY only in strange cases, where the theory depends on the
5884 old record representation. The type generated for a record is called
5885 <record_name>_ext_type.
5887 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5888 proofs triggered by a record definition or a simproc (if
5889 quick_and_dirty is enabled). Definitions of large records can take
5892 New simproc record_upd_simproc for simplification of multiple record
5893 updates enabled by default. Moreover, trivial updates are also
5894 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5895 occasionally, since simplification is more powerful by default.
5897 * typedef: proper support for polymorphic sets, which contain extra
5898 type-variables in the term.
5900 * Simplifier: automatically reasons about transitivity chains
5901 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5902 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5903 old proofs break occasionally as simplification may now solve more
5904 goals than previously.
5906 * Simplifier: converts x <= y into x = y if assumption y <= x is
5907 present. Works for all partial orders (class "order"), in particular
5908 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5911 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5912 bound variable or a constant then the let is unfolded. Otherwise
5913 first a is simplified to b, and then f b is simplified to g. If
5914 possible we abstract b from g arriving at "let x = b in h x",
5915 otherwise we unfold the let and arrive at g. The simproc can be
5916 enabled/disabled by the reference use_let_simproc. Potential
5917 INCOMPATIBILITY since simplification is more powerful by default.
5919 * Classical reasoning: the meson method now accepts theorems as arguments.
5921 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5922 jobs to provide advice on the provability of subgoals.
5924 * Theory OrderedGroup and Ring_and_Field: various additions and
5925 improvements to faciliate calculations involving equalities and
5928 The following theorems have been eliminated or modified
5931 abs_eq now named abs_of_nonneg
5932 abs_of_ge_0 now named abs_of_nonneg
5933 abs_minus_eq now named abs_of_nonpos
5934 imp_abs_id now named abs_of_nonneg
5935 imp_abs_neg_id now named abs_of_nonpos
5936 mult_pos now named mult_pos_pos
5937 mult_pos_le now named mult_nonneg_nonneg
5938 mult_pos_neg_le now named mult_nonneg_nonpos
5939 mult_pos_neg2_le now named mult_nonneg_nonpos2
5940 mult_neg now named mult_neg_neg
5941 mult_neg_le now named mult_nonpos_nonpos
5943 * The following lemmas in Ring_and_Field have been added to the simplifier:
5946 not_square_less_zero
5948 The following lemmas have been deleted from Real/RealPow:
5958 * Theory Parity: added rules for simplifying exponents.
5962 The following theorems have been eliminated or modified
5965 list_all_Nil now named list_all.simps(1)
5966 list_all_Cons now named list_all.simps(2)
5967 list_all_conv now named list_all_iff
5968 set_mem_eq now named mem_iff
5970 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5971 asymptotic "big O" calculations. See the notes in BigO.thy.
5976 * Theory RealDef: better support for embedding natural numbers and
5977 integers in the reals.
5979 The following theorems have been eliminated or modified
5982 exp_ge_add_one_self now requires no hypotheses
5983 real_of_int_add reversed direction of equality (use [symmetric])
5984 real_of_int_minus reversed direction of equality (use [symmetric])
5985 real_of_int_diff reversed direction of equality (use [symmetric])
5986 real_of_int_mult reversed direction of equality (use [symmetric])
5988 * Theory RComplete: expanded support for floor and ceiling functions.
5990 * Theory Ln is new, with properties of the natural logarithm
5992 * Hyperreal: There is a new type constructor "star" for making
5993 nonstandard types. The old type names are now type synonyms:
5997 hcomplex = complex star
5999 * Hyperreal: Many groups of similarly-defined constants have been
6000 replaced by polymorphic versions (INCOMPATIBILITY):
6002 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6004 starset <-- starsetNat, starsetC
6005 *s* <-- *sNat*, *sc*
6006 starset_n <-- starsetNat_n, starsetC_n
6007 *sn* <-- *sNatn*, *scn*
6008 InternalSets <-- InternalNatSets, InternalCSets
6010 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6011 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6012 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6013 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6014 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6016 * Hyperreal: Many type-specific theorems have been removed in favor of
6017 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6019 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6020 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6021 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6022 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6023 right_minus <-- hypreal_add_minus
6024 left_minus <-- {hypreal,hcomplex}_add_minus_left
6025 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6026 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6027 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6028 mult_1_right <-- hcomplex_mult_one_right
6029 mult_zero_left <-- hcomplex_mult_zero_left
6030 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6031 right_distrib <-- hypnat_add_mult_distrib2
6032 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6033 right_inverse <-- hypreal_mult_inverse
6034 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6035 order_refl <-- {hypreal,hypnat}_le_refl
6036 order_trans <-- {hypreal,hypnat}_le_trans
6037 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6038 order_less_le <-- {hypreal,hypnat}_less_le
6039 linorder_linear <-- {hypreal,hypnat}_le_linear
6040 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6041 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6042 add_nonneg_nonneg <-- hypreal_le_add_order
6044 * Hyperreal: Separate theorems having to do with type-specific
6045 versions of constants have been merged into theorems that apply to the
6046 new polymorphic constants (INCOMPATIBILITY):
6048 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6049 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6050 STAR_Un <-- {STAR,NatStar,STARC}_Un
6051 STAR_Int <-- {STAR,NatStar,STARC}_Int
6052 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6053 STAR_subset <-- {STAR,NatStar,STARC}_subset
6054 STAR_mem <-- {STAR,NatStar,STARC}_mem
6055 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6056 STAR_diff <-- {STAR,STARC}_diff
6057 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6058 STARC_hcomplex_of_complex}_image_subset
6059 starset_n_Un <-- starset{Nat,C}_n_Un
6060 starset_n_Int <-- starset{Nat,C}_n_Int
6061 starset_n_Compl <-- starset{Nat,C}_n_Compl
6062 starset_n_diff <-- starset{Nat,C}_n_diff
6063 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6064 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6065 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6066 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6067 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6068 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6069 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6070 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6071 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6072 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6073 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6074 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6075 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6076 starfun_diff <-- starfun{C,RC,CR}_diff
6077 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6078 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6079 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6080 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6081 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6082 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6083 starfun_Id <-- starfunC_Id
6084 starfun_approx <-- starfun{Nat,CR}_approx
6085 starfun_capprox <-- starfun{C,RC}_capprox
6086 starfun_abs <-- starfunNat_rabs
6087 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6088 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6089 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6090 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6091 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6092 starfun_add_approx <-- starfunCR_add_approx
6093 starfun_inverse_inverse <-- starfunC_inverse_inverse
6094 starfun_divide <-- starfun{C,CR,RC}_divide
6095 starfun_n <-- starfun{Nat,C}_n
6096 starfun_n_mult <-- starfun{Nat,C}_n_mult
6097 starfun_n_add <-- starfun{Nat,C}_n_add
6098 starfun_n_add_minus <-- starfunNat_n_add_minus
6099 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6100 starfun_n_minus <-- starfun{Nat,C}_n_minus
6101 starfun_n_eq <-- starfun{Nat,C}_n_eq
6103 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6104 star_n_minus <-- {hypreal,hcomplex}_minus
6105 star_n_diff <-- {hypreal,hcomplex}_diff
6106 star_n_mult <-- {hypreal,hcomplex}_mult
6107 star_n_inverse <-- {hypreal,hcomplex}_inverse
6108 star_n_le <-- {hypreal,hypnat}_le
6109 star_n_less <-- {hypreal,hypnat}_less
6110 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6111 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6112 star_n_abs <-- hypreal_hrabs
6113 star_n_divide <-- hcomplex_divide
6115 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6116 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6117 star_of_diff <-- hypreal_of_real_diff
6118 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6119 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6120 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6121 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6122 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6123 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6124 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6125 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6126 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6127 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6128 star_of_number_of <-- {hypreal,hcomplex}_number_of
6129 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6130 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6131 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6132 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6133 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6134 star_of_power <-- hypreal_of_real_power
6135 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6137 * Hyperreal: new method "transfer" that implements the transfer
6138 principle of nonstandard analysis. With a subgoal that mentions
6139 nonstandard types like "'a star", the command "apply transfer"
6140 replaces it with an equivalent one that mentions only standard types.
6141 To be successful, all free variables must have standard types; non-
6142 standard variables must have explicit universal quantifiers.
6144 * Hyperreal: A theory of Taylor series.
6149 * Discontinued special version of 'constdefs' (which used to support
6150 continuous functions) in favor of the general Pure one with full
6153 * New simplification procedure for solving continuity conditions; it
6154 is much faster on terms with many nested lambda abstractions (cubic
6155 instead of exponential time).
6157 * New syntax for domain package: selector names are now optional.
6158 Parentheses should be omitted unless argument is lazy, for example:
6160 domain 'a stream = cons "'a" (lazy "'a stream")
6162 * New command 'fixrec' for defining recursive functions with pattern
6163 matching; defining multiple functions with mutual recursion is also
6164 supported. Patterns may include the constants cpair, spair, up, sinl,
6165 sinr, or any data constructor defined by the domain package. The given
6166 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6167 syntax and examples.
6169 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6170 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6171 but the proof obligation additionally includes an admissibility
6172 requirement. The packages generate instances of class cpo or pcpo,
6173 with continuity and strictness theorems for Rep and Abs.
6175 * HOLCF: Many theorems have been renamed according to a more standard naming
6176 scheme (INCOMPATIBILITY):
6178 foo_inject: "foo$x = foo$y ==> x = y"
6179 foo_eq: "(foo$x = foo$y) = (x = y)"
6180 foo_less: "(foo$x << foo$y) = (x << y)"
6181 foo_strict: "foo$UU = UU"
6182 foo_defined: "... ==> foo$x ~= UU"
6183 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6188 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6189 including the First Isomorphism Theorem (on quotienting by the kernel
6192 * ZF/Simplifier: install second copy of type solver that actually
6193 makes use of TC rules declared to Isar proof contexts (or locales);
6194 the old version is still required for ML proof scripts.
6199 * Converted to Isar theory format; use locales instead of axiomatic
6205 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6208 * Pure/library.ML no longer defines its own option datatype, but uses
6209 that of the SML basis, which has constructors NONE and SOME instead of
6210 None and Some, as well as exception Option.Option instead of OPTION.
6211 The functions the, if_none, is_some, is_none have been adapted
6212 accordingly, while Option.map replaces apsome.
6214 * Pure/library.ML: the exception LIST has been given up in favour of
6215 the standard exceptions Empty and Subscript, as well as
6216 Library.UnequalLengths. Function like Library.hd and Library.tl are
6217 superceded by the standard hd and tl functions etc.
6219 A number of basic list functions are no longer exported to the ML
6220 toplevel, as they are variants of predefined functions. The following
6221 suggests how one can translate existing code:
6223 rev_append xs ys = List.revAppend (xs, ys)
6224 nth_elem (i, xs) = List.nth (xs, i)
6225 last_elem xs = List.last xs
6226 flat xss = List.concat xss
6227 seq fs = List.app fs
6228 partition P xs = List.partition P xs
6229 mapfilter f xs = List.mapPartial f xs
6231 * Pure/library.ML: several combinators for linear functional
6232 transformations, notably reverse application and composition:
6235 (x, y) |-> f f #-> g
6237 * Pure/library.ML: introduced/changed precedence of infix operators:
6239 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6241 infix 3 o oo ooo oooo;
6242 infix 4 ~~ upto downto;
6244 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6247 * Pure/library.ML: natural list combinators fold, fold_rev, and
6248 fold_map support linear functional transformations and nesting. For
6251 fold f [x1, ..., xN] y =
6252 y |> f x1 |> ... |> f xN
6254 (fold o fold) f [xs1, ..., xsN] y =
6255 y |> fold f xs1 |> ... |> fold f xsN
6257 fold f [x1, ..., xN] =
6260 (fold o fold) f [xs1, ..., xsN] =
6261 fold f xs1 #> ... #> fold f xsN
6263 * Pure/library.ML: the following selectors on type 'a option are
6266 the: 'a option -> 'a (*partial*)
6267 these: 'a option -> 'a where 'a = 'b list
6268 the_default: 'a -> 'a option -> 'a
6269 the_list: 'a option -> 'a list
6271 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6272 basic operations for association lists, following natural argument
6273 order; moreover the explicit equality predicate passed here avoids
6274 potentially expensive polymorphic runtime equality checks.
6275 The old functions may be expressed as follows:
6277 assoc = uncurry (AList.lookup (op =))
6278 assocs = these oo AList.lookup (op =)
6279 overwrite = uncurry (AList.update (op =)) o swap
6281 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6283 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6284 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6286 replacing make_keylist and keyfilter (occassionally used)
6289 make_keylist = AList.make
6290 keyfilter = AList.find (op =)
6292 * eq_fst and eq_snd now take explicit equality parameter, thus
6293 avoiding eqtypes. Naive rewrites:
6295 eq_fst = eq_fst (op =)
6296 eq_snd = eq_snd (op =)
6298 * Removed deprecated apl and apr (rarely used).
6301 apl (n, op) =>>= curry op n
6302 apr (op, m) =>>= fn n => op (n, m)
6304 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6305 provides a reasonably efficient light-weight implementation of sets as
6308 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6309 few new operations; existing lookup and update are now curried to
6310 follow natural argument order (for use with fold etc.);
6311 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6313 * Pure/General: output via the Isabelle channels of
6314 writeln/warning/error etc. is now passed through Output.output, with a
6315 hook for arbitrary transformations depending on the print_mode
6316 (cf. Output.add_mode -- the first active mode that provides a output
6317 function wins). Already formatted output may be embedded into further
6318 text via Output.raw; the result of Pretty.string_of/str_of and derived
6319 functions (string_of_term/cterm/thm etc.) is already marked raw to
6320 accommodate easy composition of diagnostic messages etc. Programmers
6321 rarely need to care about Output.output or Output.raw at all, with
6322 some notable exceptions: Output.output is required when bypassing the
6323 standard channels (writeln etc.), or in token translations to produce
6324 properly formatted results; Output.raw is required when capturing
6325 already output material that will eventually be presented to the user
6326 a second time. For the default print mode, both Output.output and
6327 Output.raw have no effect.
6329 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6330 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6331 cumulative results are displayed at the end of a batch session.
6333 * Pure/General: File.sysify_path and File.quote_sysify path have been
6334 replaced by File.platform_path and File.shell_path (with appropriate
6335 hooks). This provides a clean interface for unusual systems where the
6336 internal and external process view of file names are different.
6338 * Pure: more efficient orders for basic syntactic entities: added
6339 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6340 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6341 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6342 orders now -- potential INCOMPATIBILITY for code that depends on a
6343 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6344 Library.sort_strings on result).
6346 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6347 fold_types traverse types/terms from left to right, observing natural
6348 argument order. Supercedes previous foldl_XXX versions, add_frees,
6349 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6351 * Pure: name spaces have been refined, with significant changes of the
6352 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6353 to extern(_table). The plain name entry path is superceded by a
6354 general 'naming' context, which also includes the 'policy' to produce
6355 a fully qualified name and external accesses of a fully qualified
6356 name; NameSpace.extend is superceded by context dependent
6357 Sign.declare_name. Several theory and proof context operations modify
6358 the naming context. Especially note Theory.restore_naming and
6359 ProofContext.restore_naming to get back to a sane state; note that
6360 Theory.add_path is no longer sufficient to recover from
6361 Theory.absolute_path in particular.
6363 * Pure: new flags short_names (default false) and unique_names
6364 (default true) for controlling output of qualified names. If
6365 short_names is set, names are printed unqualified. If unique_names is
6366 reset, the name prefix is reduced to the minimum required to achieve
6367 the original result when interning again, even if there is an overlap
6368 with earlier declarations.
6370 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6371 now 'extend', and 'merge' gets an additional Pretty.pp argument
6372 (useful for printing error messages). INCOMPATIBILITY.
6374 * Pure: major reorganization of the theory context. Type Sign.sg and
6375 Theory.theory are now identified, referring to the universal
6376 Context.theory (see Pure/context.ML). Actual signature and theory
6377 content is managed as theory data. The old code and interfaces were
6378 spread over many files and structures; the new arrangement introduces
6379 considerable INCOMPATIBILITY to gain more clarity:
6381 Context -- theory management operations (name, identity, inclusion,
6382 parents, ancestors, merge, etc.), plus generic theory data;
6384 Sign -- logical signature and syntax operations (declaring consts,
6385 types, etc.), plus certify/read for common entities;
6387 Theory -- logical theory operations (stating axioms, definitions,
6388 oracles), plus a copy of logical signature operations (consts,
6389 types, etc.); also a few basic management operations (Theory.copy,
6392 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6393 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6394 for convenience -- they merely return the theory.
6396 * Pure: type Type.tsig is superceded by theory in most interfaces.
6398 * Pure: the Isar proof context type is already defined early in Pure
6399 as Context.proof (note that ProofContext.context and Proof.context are
6400 aliases, where the latter is the preferred name). This enables other
6401 Isabelle components to refer to that type even before Isar is present.
6403 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6404 typeK, constK, axiomK, oracleK), but provide explicit operations for
6405 any of these kinds. For example, Sign.intern typeK is now
6406 Sign.intern_type, Theory.hide_space Sign.typeK is now
6407 Theory.hide_types. Also note that former
6408 Theory.hide_classes/types/consts are now
6409 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6410 internalize their arguments! INCOMPATIBILITY.
6412 * Pure: get_thm interface (of PureThy and ProofContext) expects
6413 datatype thmref (with constructors Name and NameSelection) instead of
6414 plain string -- INCOMPATIBILITY;
6416 * Pure: cases produced by proof methods specify options, where NONE
6417 means to remove case bindings -- INCOMPATIBILITY in
6420 * Pure: the following operations retrieve axioms or theorems from a
6421 theory node or theory hierarchy, respectively:
6423 Theory.axioms_of: theory -> (string * term) list
6424 Theory.all_axioms_of: theory -> (string * term) list
6425 PureThy.thms_of: theory -> (string * thm) list
6426 PureThy.all_thms_of: theory -> (string * thm) list
6428 * Pure: print_tac now outputs the goal through the trace channel.
6430 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6431 Reference Toplevel.debug (default false) controls detailed printing
6432 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6433 controls execution profiling -- set to 1 for time and 2 for space
6434 (both increase the runtime).
6436 * Isar session: The initial use of ROOT.ML is now always timed,
6437 i.e. the log will show the actual process times, in contrast to the
6438 elapsed wall-clock time that the outer shell wrapper produces.
6440 * Simplifier: improved handling of bound variables (nameless
6441 representation, avoid allocating new strings). Simprocs that invoke
6442 the Simplifier recursively should use Simplifier.inherit_bounds to
6443 avoid local name clashes. Failure to do so produces warnings
6444 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6445 for further details.
6447 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6448 bindings for all theorems stored within a given theory; this may help
6449 in porting non-Isar theories to Isar ones, while keeping ML proof
6450 scripts for the time being.
6452 * ML operator HTML.with_charset specifies the charset begin used for
6453 generated HTML files. For example:
6455 HTML.with_charset "utf-8" use_thy "Hebrew";
6456 HTML.with_charset "utf-8" use_thy "Chinese";
6461 * Allow symlinks to all proper Isabelle executables (Isabelle,
6462 isabelle, isatool etc.).
6464 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6465 isatool doc, isatool mkdir, display_drafts etc.).
6467 * isatool usedir: option -f allows specification of the ML file to be
6468 used by Isabelle; default is ROOT.ML.
6470 * New isatool version outputs the version identifier of the Isabelle
6471 distribution being used.
6473 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6474 (containing Boolean satisfiability problems) into Isabelle/HOL
6479 New in Isabelle2004 (April 2004)
6480 --------------------------------
6484 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6485 Replaces linorder.ML.
6487 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6488 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6489 (\<a>...\<z>), are now considered normal letters, and can therefore
6490 be used anywhere where an ASCII letter (a...zA...Z) has until
6491 now. COMPATIBILITY: This obviously changes the parsing of some
6492 terms, especially where a symbol has been used as a binder, say
6493 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6494 as an identifier. Fix it by inserting a space around former
6495 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6496 existing theory and ML files.
6498 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6500 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6501 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6502 a normal (but invisible) letter. For multiple letter subscripts repeat
6503 \<^isub> like this: x\<^isub>1\<^isub>2.
6505 * Pure: There are now sub-/superscripts that can span more than one
6506 character. Text between \<^bsub> and \<^esub> is set in subscript in
6507 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6508 superscript. The new control characters are not identifier parts.
6510 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6511 content of "..." to the latex file instead of \isacntrl... . The "..."
6512 may consist of any printable characters excluding the end bracket >.
6514 * Pure: Using new Isar command "finalconsts" (or the ML functions
6515 Theory.add_finals or Theory.add_finals_i) it is now possible to
6516 declare constants "final", which prevents their being given a definition
6517 later. It is useful for constants whose behaviour is fixed axiomatically
6518 rather than definitionally, such as the meta-logic connectives.
6520 * Pure: 'instance' now handles general arities with general sorts
6521 (i.e. intersections of classes),
6523 * Presentation: generated HTML now uses a CSS style sheet to make layout
6524 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6525 It can be changed to alter the colors/layout of generated pages.
6530 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6531 cut_tac, subgoal_tac and thin_tac:
6532 - Now understand static (Isar) contexts. As a consequence, users of Isar
6533 locales are no longer forced to write Isar proof scripts.
6534 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6536 - INCOMPATIBILITY: names of variables to be instantiated may no
6537 longer be enclosed in quotes. Instead, precede variable name with `?'.
6538 This is consistent with the instantiation attribute "where".
6540 * Attributes "where" and "of":
6541 - Now take type variables of instantiated theorem into account when reading
6542 the instantiation string. This fixes a bug that caused instantiated
6543 theorems to have too special types in some circumstances.
6544 - "where" permits explicit instantiations of type variables.
6546 * Calculation commands "moreover" and "also" no longer interfere with
6547 current facts ("this"), admitting arbitrary combinations with "then"
6551 - Goal statements involving the context element "includes" no longer
6552 generate theorems with internal delta predicates (those ending on
6553 "_axioms") in the premise.
6554 Resolve particular premise with <locale>.intro to obtain old form.
6555 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6556 specification and "includes" elements in goal statement.
6557 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6558 [intro?] and [elim?] (respectively) by default.
6559 - Experimental command for instantiation of locales in proof contexts:
6560 instantiate <label>[<attrs>]: <loc>
6561 Instantiates locale <loc> and adds all its theorems to the current context
6562 taking into account their attributes. Label and attrs are optional
6563 modifiers, like in theorem declarations. If present, names of
6564 instantiated theorems are qualified with <label>, and the attributes
6565 <attrs> are applied after any attributes these theorems might have already.
6566 If the locale has assumptions, a chained fact of the form
6567 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6568 are derived. The command does not support old-style locales declared
6569 with "locale (open)".
6570 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6572 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6578 * Proof import: new image HOL4 contains the imported library from
6579 the HOL4 system with about 2500 theorems. It is imported by
6580 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6581 can be used like any other Isabelle image. See
6582 HOL/Import/HOL/README for more information.
6585 - Much improved handling of linear and partial orders.
6586 Reasoners for linear and partial orders are set up for type classes
6587 "linorder" and "order" respectively, and are added to the default simpset
6588 as solvers. This means that the simplifier can build transitivity chains
6589 to solve goals from the assumptions.
6590 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6591 of blast or auto after simplification become unnecessary because the goal
6592 is solved by simplification already.
6594 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6595 all proved in axiomatic type classes for semirings, rings and fields.
6598 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6599 now formalized using the Ring_and_Field theory mentioned above.
6600 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6601 than before, because now they are set up once in a generic manner.
6602 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6603 Look for the general versions in Ring_and_Field (and Power if they concern
6606 * Type "rat" of the rational numbers is now available in HOL-Complex.
6609 - Record types are now by default printed with their type abbreviation
6610 instead of the list of all field types. This can be configured via
6611 the reference "print_record_type_abbr".
6612 - Simproc "record_upd_simproc" for simplification of multiple updates added
6613 (not enabled by default).
6614 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6615 EX x. x = sel r to True (not enabled by default).
6616 - Tactic "record_split_simp_tac" to split and simplify records added.
6618 * 'specification' command added, allowing for definition by
6619 specification. There is also an 'ax_specification' command that
6620 introduces the new constants axiomatically.
6622 * arith(_tac) is now able to generate counterexamples for reals as well.
6624 * HOL-Algebra: new locale "ring" for non-commutative rings.
6626 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6627 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6629 * HOL-Matrix: a first theory for matrices in HOL with an application of
6630 matrix theory to linear programming.
6632 * Unions and Intersections:
6633 The latex output syntax of UN and INT has been changed
6634 from "\Union x \in A. B" to "\Union_{x \in A} B"
6635 i.e. the index formulae has become a subscript.
6636 Similarly for "\Union x. B", and for \Inter instead of \Union.
6638 * Unions and Intersections over Intervals:
6639 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6640 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6641 like in normal math, and corresponding versions for < and for intersection.
6643 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6644 lexicographic dictonary ordering has been added as "lexord".
6646 * ML: the legacy theory structures Int and List have been removed. They had
6647 conflicted with ML Basis Library structures having the same names.
6649 * 'refute' command added to search for (finite) countermodels. Only works
6650 for a fragment of HOL. The installation of an external SAT solver is
6651 highly recommended. See "HOL/Refute.thy" for details.
6653 * 'quickcheck' command: Allows to find counterexamples by evaluating
6654 formulae under an assignment of free variables to random values.
6655 In contrast to 'refute', it can deal with inductive datatypes,
6656 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6662 * Streams now come with concatenation and are part of the HOLCF image
6666 New in Isabelle2003 (May 2003)
6667 ------------------------------
6671 * Provers/simplifier:
6673 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6674 Assumptions are now subject to complete mutual simplification,
6675 not just from left to right. The simplifier now preserves
6676 the order of assumptions.
6678 Potential INCOMPATIBILITY:
6680 -- simp sometimes diverges where the old version did
6681 not, e.g. invoking simp on the goal
6683 [| P (f x); y = x; f x = f y |] ==> Q
6685 now gives rise to the infinite reduction sequence
6687 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6689 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6692 -- Tactics combining classical reasoner and simplification (such as auto)
6693 are also affected by this change, because many of them rely on
6694 simp. They may sometimes diverge as well or yield a different numbers
6695 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6696 in case of problems. Sometimes subsequent calls to the classical
6697 reasoner will fail because a preceeding call to the simplifier too
6698 eagerly simplified the goal, e.g. deleted redundant premises.
6700 - The simplifier trace now shows the names of the applied rewrite rules
6702 - You can limit the number of recursive invocations of the simplifier
6703 during conditional rewriting (where the simplifie tries to solve the
6704 conditions before applying the rewrite rule):
6705 ML "simp_depth_limit := n"
6706 where n is an integer. Thus you can force termination where previously
6707 the simplifier would diverge.
6709 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6711 - No longer aborts on failed congruence proof. Instead, the
6712 congruence is ignored.
6714 * Pure: New generic framework for extracting programs from constructive
6715 proofs. See HOL/Extraction.thy for an example instantiation, as well
6716 as HOL/Extraction for some case studies.
6718 * Pure: The main goal of the proof state is no longer shown by default, only
6719 the subgoals. This behaviour is controlled by a new flag.
6720 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6721 (ML: Proof.show_main_goal).
6723 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6724 rules whose conclusion matches subgoal 1:
6725 PG menu: Isabelle/Isar -> Show me -> matching rules
6726 The rules are ordered by how closely they match the subgoal.
6727 In particular, rules that solve a subgoal outright are displayed first
6728 (or rather last, the way they are printed).
6729 (ML: ProofGeneral.print_intros())
6731 * Pure: New flag trace_unify_fail causes unification to print
6732 diagnostic information (PG: in trace buffer) when it fails. This is
6733 useful for figuring out why single step proofs like rule, erule or
6736 * Pure: Locale specifications now produce predicate definitions
6737 according to the body of text (covering assumptions modulo local
6738 definitions); predicate "loc_axioms" covers newly introduced text,
6739 while "loc" is cumulative wrt. all included locale expressions; the
6740 latter view is presented only on export into the global theory
6741 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6742 on the old view without predicates;
6744 * Pure: predefined locales "var" and "struct" are useful for sharing
6745 parameters (as in CASL, for example); just specify something like
6746 ``var x + var y + struct M'' as import;
6748 * Pure: improved thms_containing: proper indexing of facts instead of
6749 raw theorems; check validity of results wrt. current name space;
6750 include local facts of proof configuration (also covers active
6751 locales), cover fixed variables in index; may use "_" in term
6752 specification; an optional limit for the number of printed facts may
6753 be given (the default is 40);
6755 * Pure: disallow duplicate fact bindings within new-style theory files
6758 * Provers: improved induct method: assumptions introduced by case
6759 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6760 the goal statement); "foo" still refers to all facts collectively;
6762 * Provers: the function blast.overloaded has been removed: all constants
6763 are regarded as potentially overloaded, which improves robustness in exchange
6764 for slight decrease in efficiency;
6766 * Provers/linorder: New generic prover for transitivity reasoning over
6767 linear orders. Note: this prover is not efficient!
6769 * Isar: preview of problems to finish 'show' now produce an error
6770 rather than just a warning (in interactive mode);
6777 - Produces a counter example if it cannot prove a goal.
6778 Note that the counter example may be spurious if the goal is not a formula
6779 of quantifier-free linear arithmetic.
6780 In ProofGeneral the counter example appears in the trace buffer.
6782 - Knows about div k and mod k where k is a numeral of type nat or int.
6784 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6785 linear arithmetic fails. This takes account of quantifiers and divisibility.
6786 Presburger arithmetic can also be called explicitly via presburger(_tac).
6788 * simp's arithmetic capabilities have been enhanced a bit: it now
6789 takes ~= in premises into account (by performing a case split);
6791 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6792 are distributed over a sum of terms;
6794 * New tactic "trans_tac" and method "trans" instantiate
6795 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6798 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6799 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6801 * 'typedef' command has new option "open" to suppress the set
6804 * functions Min and Max on finite sets have been introduced (theory
6807 * attribute [symmetric] now works for relations as well; it turns
6808 (x,y) : R^-1 into (y,x) : R, and vice versa;
6810 * induct over a !!-quantified statement (say !!x1..xn):
6811 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6813 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6814 %x. None. Warning: empty_def now refers to the previously hidden definition
6817 * Algebra: formalization of classical algebra. Intended as base for
6818 any algebraic development in Isabelle. Currently covers group theory
6819 (up to Sylow's theorem) and ring theory (Universal Property of
6820 Univariate Polynomials). Contributions welcome;
6822 * GroupTheory: deleted, since its material has been moved to Algebra;
6824 * Complex: new directory of the complex numbers with numeric constants,
6825 nonstandard complex numbers, and some complex analysis, standard and
6826 nonstandard (Jacques Fleuriot);
6828 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6830 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6833 * Real/HahnBanach: updated and adapted to locales;
6835 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6838 * UNITY: added the Meier-Sanders theory of progress sets;
6840 * MicroJava: bytecode verifier and lightweight bytecode verifier
6841 as abstract algorithms, instantiated to the JVM;
6843 * Bali: Java source language formalization. Type system, operational
6844 semantics, axiomatic semantics. Supported language features:
6845 classes, interfaces, objects,virtual methods, static methods,
6846 static/instance fields, arrays, access modifiers, definite
6847 assignment, exceptions.
6852 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6855 * Main ZF: virtually all theories converted to new-style format;
6860 * Pure: Tactic.prove provides sane interface for internal proofs;
6861 omits the infamous "standard" operation, so this is more appropriate
6862 than prove_goalw_cterm in many situations (e.g. in simprocs);
6864 * Pure: improved error reporting of simprocs;
6866 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6870 *** Document preparation ***
6872 * uses \par instead of \\ for line breaks in theory text. This may
6873 shift some page breaks in large documents. To get the old behaviour
6874 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6876 * minimized dependencies of isabelle.sty and isabellesym.sty on
6879 * \<euro> now needs package babel/greek instead of marvosym (which
6882 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6887 New in Isabelle2002 (March 2002)
6888 --------------------------------
6890 *** Document preparation ***
6892 * greatly simplified document preparation setup, including more
6893 graceful interpretation of isatool usedir -i/-d/-D options, and more
6894 instructive isatool mkdir; users should basically be able to get
6895 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6896 users may run a separate document processing stage manually like this:
6897 "isatool usedir -D output HOL Test && isatool document Test/output";
6899 * theory dependency graph may now be incorporated into documents;
6900 isatool usedir -g true will produce session_graph.eps/.pdf for use
6901 with \includegraphics of LaTeX;
6903 * proper spacing of consecutive markup elements, especially text
6904 blocks after section headings;
6906 * support bold style (for single symbols only), input syntax is like
6907 this: "\<^bold>\<alpha>" or "\<^bold>A";
6909 * \<bullet> is now output as bold \cdot by default, which looks much
6910 better in printed text;
6912 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6913 note that these symbols are currently unavailable in Proof General /
6914 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6916 * isatool latex no longer depends on changed TEXINPUTS, instead
6917 isatool document copies the Isabelle style files to the target
6923 * Pure/Provers: improved proof by cases and induction;
6924 - 'case' command admits impromptu naming of parameters (such as
6926 - 'induct' method divinates rule instantiation from the inductive
6927 claim; no longer requires excessive ?P bindings for proper
6928 instantiation of cases;
6929 - 'induct' method properly enumerates all possibilities of set/type
6930 rules; as a consequence facts may be also passed through *type*
6931 rules without further ado;
6932 - 'induct' method now derives symbolic cases from the *rulified*
6933 rule (before it used to rulify cases stemming from the internal
6934 atomized version); this means that the context of a non-atomic
6935 statement becomes is included in the hypothesis, avoiding the
6936 slightly cumbersome show "PROP ?case" form;
6937 - 'induct' may now use elim-style induction rules without chaining
6938 facts, using ``missing'' premises from the goal state; this allows
6939 rules stemming from inductive sets to be applied in unstructured
6940 scripts, while still benefitting from proper handling of non-atomic
6941 statements; NB: major inductive premises need to be put first, all
6942 the rest of the goal is passed through the induction;
6943 - 'induct' proper support for mutual induction involving non-atomic
6944 rule statements (uses the new concept of simultaneous goals, see
6946 - append all possible rule selections, but only use the first
6947 success (no backtracking);
6948 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6949 - undeclared rule case names default to numbers 1, 2, 3, ...;
6950 - added 'print_induct_rules' (covered by help item in recent Proof
6952 - moved induct/cases attributes to Pure, methods to Provers;
6953 - generic method setup instantiated for FOL and HOL;
6955 * Pure: support multiple simultaneous goal statements, for example
6956 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6957 meta-level mechanism, this acts as if several individual goals had
6958 been stated separately; in particular common proof methods need to be
6959 repeated in order to cover all claims; note that a single elimination
6960 step is *not* sufficient to establish the two conjunctions, so this
6963 assume "A & B" then have A and B .. (*".." fails*)
6965 better use "obtain" in situations as above; alternative refer to
6966 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6968 * Pure: proper integration with ``locales''; unlike the original
6969 version by Florian Kammller, Isar locales package high-level proof
6970 contexts rather than raw logical ones (e.g. we admit to include
6971 attributes everywhere); operations on locales include merge and
6972 rename; support for implicit arguments (``structures''); simultaneous
6973 type-inference over imports and text; see also HOL/ex/Locales.thy for
6976 * Pure: the following commands have been ``localized'', supporting a
6977 target locale specification "(in name)": 'lemma', 'theorem',
6978 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6979 stored both within the locale and at the theory level (exported and
6980 qualified by the locale name);
6982 * Pure: theory goals may now be specified in ``long'' form, with
6983 ad-hoc contexts consisting of arbitrary locale elements. for example
6984 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6985 definitions may be given, too); the result is a meta-level rule with
6986 the context elements being discharged in the obvious way;
6988 * Pure: new proof command 'using' allows to augment currently used
6989 facts after a goal statement ('using' is syntactically analogous to
6990 'apply', but acts on the goal's facts only); this allows chained facts
6991 to be separated into parts given before and after a claim, as in
6992 ``from a and b have C using d and e <proof>'';
6994 * Pure: renamed "antecedent" case to "rule_context";
6996 * Pure: new 'judgment' command records explicit information about the
6997 object-logic embedding (used by several tools internally); no longer
6998 use hard-wired "Trueprop";
7000 * Pure: added 'corollary' command;
7002 * Pure: fixed 'token_translation' command;
7004 * Pure: removed obsolete 'exported' attribute;
7006 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7007 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7008 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7010 * Pure: method 'atomize' presents local goal premises as object-level
7011 statements (atomic meta-level propositions); setup controlled via
7012 rewrite rules declarations of 'atomize' attribute; example
7013 application: 'induct' method with proper rule statements in improper
7016 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7017 now consider the syntactic context of assumptions, giving a better
7018 chance to get type-inference of the arguments right (this is
7019 especially important for locales);
7021 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7024 * Pure/obtain: the formal conclusion "thesis", being marked as
7025 ``internal'', may no longer be reference directly in the text;
7026 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7029 * Pure: generic 'sym' attribute which declares a rule both as pure
7030 'elim?' and for the 'symmetric' operation;
7032 * Pure: marginal comments ``--'' may now occur just anywhere in the
7033 text; the fixed correlation with particular command syntax has been
7036 * Pure: new method 'rules' is particularly well-suited for proof
7037 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7038 but often produces more compact proof terms with less detours;
7040 * Pure/Provers/classical: simplified integration with pure rule
7041 attributes and methods; the classical "intro?/elim?/dest?"
7042 declarations coincide with the pure ones; the "rule" method no longer
7043 includes classically swapped intros; "intro" and "elim" methods no
7044 longer pick rules from the context; also got rid of ML declarations
7045 AddXIs/AddXEs/AddXDs; all of this has some potential for
7048 * Provers/classical: attribute 'swapped' produces classical inversions
7049 of introduction rules;
7051 * Provers/simplifier: 'simplified' attribute may refer to explicit
7052 rules instead of full simplifier context; 'iff' attribute handles
7055 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7057 * HOL: 'recdef' now fails on unfinished automated proofs, use
7058 "(permissive)" option to recover old behavior;
7060 * HOL: 'inductive' no longer features separate (collective) attributes
7061 for 'intros' (was found too confusing);
7063 * HOL: properly declared induction rules less_induct and
7069 * HOL: moved over to sane numeral syntax; the new policy is as
7072 - 0 and 1 are polymorphic constants, which are defined on any
7073 numeric type (nat, int, real etc.);
7075 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7076 binary representation internally;
7078 - type nat has special constructor Suc, and generally prefers Suc 0
7079 over 1::nat and Suc (Suc 0) over 2::nat;
7081 This change may cause significant problems of INCOMPATIBILITY; here
7082 are some hints on converting existing sources:
7084 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7085 entities, so expressions involving "-" (unary or binary minus) need
7086 to be spaced properly;
7088 - existing occurrences of "1" may need to be constraint "1::nat" or
7089 even replaced by Suc 0; similar for old "2";
7091 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7093 - remove all special provisions on numerals in proofs;
7095 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7096 representation (depends on bin_arith_simps in the default context);
7098 * HOL: symbolic syntax for x^2 (numeral 2);
7100 * HOL: the class of all HOL types is now called "type" rather than
7101 "term"; INCOMPATIBILITY, need to adapt references to this type class
7102 in axclass/classes, instance/arities, and (usually rare) occurrences
7103 in typings (of consts etc.); internally the class is called
7104 "HOL.type", ML programs should refer to HOLogic.typeS;
7106 * HOL/record package improvements:
7107 - new derived operations "fields" to build a partial record section,
7108 "extend" to promote a fixed record to a record scheme, and
7109 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7110 declared as simp by default;
7111 - shared operations ("more", "fields", etc.) now need to be always
7112 qualified) --- potential INCOMPATIBILITY;
7113 - removed "make_scheme" operations (use "make" with "extend") --
7115 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7116 - provides cases/induct rules for use with corresponding Isar
7117 methods (for concrete records, record schemes, concrete more
7118 parts, and schematic more parts -- in that order);
7119 - internal definitions directly based on a light-weight abstract
7120 theory of product types over typedef rather than datatype;
7122 * HOL: generic code generator for generating executable ML code from
7123 specifications; specific support for HOL constructs such as inductive
7124 datatypes and sets, as well as recursive functions; can be invoked
7125 via 'generate_code' theory section;
7127 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7129 * HOL: consolidated and renamed several theories. In particular:
7130 Ord.thy has been absorbed into HOL.thy
7131 String.thy has been absorbed into List.thy
7133 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7134 (beware of argument permutation!);
7136 * HOL: linorder_less_split superseded by linorder_cases;
7138 * HOL/List: "nodups" renamed to "distinct";
7140 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7141 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7142 - Ex_def has changed, now need to use some_eq_ex
7144 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7145 in this (rare) case use:
7147 delSWrapper "split_all_tac"
7148 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7150 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7153 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7154 Isabelle's type classes, ^ on functions and relations has too general
7155 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7156 necessary to attach explicit type constraints;
7158 * HOL/Relation: the prefix name of the infix "O" has been changed from
7159 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7160 renamed accordingly (eg "compI" -> "rel_compI").
7162 * HOL: syntax translations now work properly with numerals and records
7165 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7166 of "lam" -- INCOMPATIBILITY;
7168 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7169 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7170 renamed "Product_Type.unit";
7172 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7174 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7175 the "cases" method);
7177 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7180 * HOL/IMP: updated and converted to new-style theory format; several
7181 parts turned into readable document, with proper Isar proof texts and
7182 some explanations (by Gerwin Klein);
7184 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7186 * HOL-Hyperreal is now a logic image;
7191 * Isar: consts/constdefs supports mixfix syntax for continuous
7194 * Isar: domain package adapted to new-style theory format, e.g. see
7197 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7198 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7199 lift.induct_tac, always use UU instead of Undef;
7201 * HOLCF/IMP: updated and converted to new-style theory;
7206 * Isar: proper integration of logic-specific tools and packages,
7207 including theory commands '(co)inductive', '(co)datatype',
7208 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7209 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7211 * theory Main no longer includes AC; for the Axiom of Choice, base
7212 your theory on Main_ZFC;
7214 * the integer library now covers quotients and remainders, with many
7215 laws relating division to addition, multiplication, etc.;
7217 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7218 typeless version of the formalism;
7220 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7223 * ZF/Induct: new directory for examples of inductive definitions,
7224 including theory Multiset for multiset orderings; converted to
7225 new-style theory format;
7227 * ZF: many new theorems about lists, ordinals, etc.;
7232 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7233 variable proof controls level of detail: 0 = no proofs (only oracle
7234 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7235 also ref manual for further ML interfaces;
7237 * Pure/axclass: removed obsolete ML interface
7238 goal_subclass/goal_arity;
7240 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7241 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7242 separate tokens, so expressions involving minus need to be spaced
7245 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7246 rather than "infixl" or "infixr";
7248 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7249 sort constraint specifications in type inference; e.g. "x::_::foo"
7250 ensures that the type of "x" is of sort "foo" (but not necessarily a
7253 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7254 control output of nested => (types); the default behavior is
7257 * Pure/syntax: builtin parse translation for "_constify" turns valued
7258 tokens into AST constants;
7260 * Pure/syntax: prefer later declarations of translations and print
7261 translation functions; potential INCOMPATIBILITY: need to reverse
7262 multiple declarations for same syntax element constant;
7264 * Pure/show_hyps reset by default (in accordance to existing Isar
7267 * Provers/classical: renamed addaltern to addafter, addSaltern to
7270 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7273 * system: tested support for MacOS X; should be able to get Isabelle +
7274 Proof General to work in a plain Terminal after installing Poly/ML
7275 (e.g. from the Isabelle distribution area) and GNU bash alone
7276 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7277 support requires further installations, e.g. from
7278 http://fink.sourceforge.net/);
7280 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7282 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7283 of 40 MB), cf. ML_OPTIONS;
7285 * system: Proof General keywords specification is now part of the
7286 Isabelle distribution (see etc/isar-keywords.el);
7288 * system: support for persistent Proof General sessions (refrain from
7289 outdating all loaded theories on startup); user may create writable
7290 logic images like this: ``isabelle -q HOL Test'';
7292 * system: smart selection of Isabelle process versus Isabelle
7293 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7294 run both "isabelle" and "Isabelle" even if file names are badly
7295 damaged (executable inspects the case of the first letter of its own
7296 name); added separate "isabelle-process" and "isabelle-interface";
7298 * system: refrain from any attempt at filtering input streams; no
7299 longer support ``8bit'' encoding of old isabelle font, instead proper
7300 iso-latin characters may now be used; the related isatools
7301 "symbolinput" and "nonascii" have disappeared as well;
7303 * system: removed old "xterm" interface (the print modes "xterm" and
7304 "xterm_color" are still available for direct use in a suitable
7309 New in Isabelle99-2 (February 2001)
7310 -----------------------------------
7312 *** Overview of INCOMPATIBILITIES ***
7314 * HOL: please note that theories in the Library and elsewhere often use the
7315 new-style (Isar) format; to refer to their theorems in an ML script you must
7316 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7318 * HOL: inductive package no longer splits induction rule aggressively,
7319 but only as far as specified by the introductions given; the old
7320 format may be recovered via ML function complete_split_rule or attribute
7321 'split_rule (complete)';
7323 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7324 gfp_Tarski to gfp_unfold;
7326 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7328 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7329 relation); infix "^^" has been renamed "``"; infix "``" has been
7330 renamed "`"; "univalent" has been renamed "single_valued";
7332 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7335 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7337 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7339 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7340 consequence, it is no longer monotonic wrt. the local goal context
7341 (which is now passed through the inductive cases);
7343 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7344 \<gg> to \<ggreater>;
7347 *** Document preparation ***
7349 * \isabellestyle{NAME} selects version of Isabelle output (currently
7350 available: are "it" for near math-mode best-style output, "sl" for
7351 slanted text style, and "tt" for plain type-writer; if no
7352 \isabellestyle command is given, output is according to slanted
7355 * support sub/super scripts (for single symbols only), input syntax is
7356 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7358 * some more standard symbols; see Appendix A of the system manual for
7359 the complete list of symbols defined in isabellesym.sty;
7361 * improved isabelle style files; more abstract symbol implementation
7362 (should now use \isamath{...} and \isatext{...} in custom symbol
7365 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7366 state; Note that presentation of goal states does not conform to
7367 actual human-readable proof documents. Please do not include goal
7368 states into document output unless you really know what you are doing!
7370 * proper indentation of antiquoted output with proportional LaTeX
7373 * no_document ML operator temporarily disables LaTeX document
7376 * isatool unsymbolize tunes sources for plain ASCII communication;
7381 * Pure: Isar now suffers initial goal statements to contain unbound
7382 schematic variables (this does not conform to actual readable proof
7383 documents, due to unpredictable outcome and non-compositional proof
7384 checking); users who know what they are doing may use schematic goals
7385 for Prolog-style synthesis of proven results;
7387 * Pure: assumption method (an implicit finishing) now handles actual
7390 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7391 initial goal, declare "that" only as Pure intro (only for single
7392 steps); the "that" rule assumption may now be involved in implicit
7393 finishing, thus ".." becomes a feasible for trivial obtains;
7395 * Pure: default proof step now includes 'intro_classes'; thus trivial
7396 instance proofs may be performed by "..";
7398 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7401 * Pure: more robust selection of calculational rules;
7403 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7404 rule (as well as the assumption rule);
7406 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7407 lemmas, using the graph browser tool;
7409 * Pure: predict failure of "show" in interactive mode;
7411 * Pure: 'thms_containing' now takes actual terms as arguments;
7413 * HOL: improved method 'induct' --- now handles non-atomic goals
7414 (potential INCOMPATIBILITY); tuned error handling;
7416 * HOL: cases and induct rules now provide explicit hints about the
7417 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7418 any remaining facts are inserted into the goal verbatim;
7420 * HOL: local contexts (aka cases) may now contain term bindings as
7421 well; the 'cases' and 'induct' methods new provide a ?case binding for
7422 the result to be shown in each case;
7424 * HOL: added 'recdef_tc' command;
7426 * isatool convert assists in eliminating legacy ML scripts;
7431 * HOL/Library: a collection of generic theories to be used together
7432 with main HOL; the theory loader path already includes this directory
7433 by default; the following existing theories have been moved here:
7434 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7435 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7437 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7438 modelling and verification task performed in Isabelle/HOL +
7439 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7441 * HOL/Algebra: special summation operator SUM no longer exists, it has
7442 been replaced by setsum; infix 'assoc' now has priority 50 (like
7443 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7444 'domain', this makes the theory consistent with mathematical
7447 * HOL basics: added overloaded operations "inverse" and "divide"
7448 (infix "/"), syntax for generic "abs" operation, generic summation
7451 * HOL/typedef: simplified package, provide more useful rules (see also
7454 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7455 now expressed as a proper nested rule (old-style tactic scripts may
7456 require atomize_strip_tac to cope with non-atomic premises);
7458 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7459 to "split_conv" (old name still available for compatibility);
7461 * HOL: improved concrete syntax for strings (e.g. allows translation
7462 rules with string literals);
7464 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7465 and Fleuriot's mechanization of analysis, including the transcendental
7466 functions for the reals;
7468 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7473 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7474 "lam" is displayed as TWO lambda-symbols
7476 * CTT: theory Main now available, containing everything (that is, Bool
7482 * Pure: the Simplifier has been implemented properly as a derived rule
7483 outside of the actual kernel (at last!); the overall performance
7484 penalty in practical applications is about 50%, while reliability of
7485 the Isabelle inference kernel has been greatly improved;
7487 * print modes "brackets" and "no_brackets" control output of nested =>
7488 (types) and ==> (props); the default behaviour is "brackets";
7490 * Provers: fast_tac (and friends) now handle actual object-logic rules
7491 as assumptions as well;
7493 * system: support Poly/ML 4.0;
7495 * system: isatool install handles KDE version 1 or 2;
7499 New in Isabelle99-1 (October 2000)
7500 ----------------------------------
7502 *** Overview of INCOMPATIBILITIES ***
7504 * HOL: simplification of natural numbers is much changed; to partly
7505 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7506 issue the following ML commands:
7508 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7509 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7511 * HOL: simplification no longer dives into case-expressions; this is
7512 controlled by "t.weak_case_cong" for each datatype t;
7514 * HOL: nat_less_induct renamed to less_induct;
7516 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7517 fixsome to patch .thy and .ML sources automatically;
7519 select_equality -> some_equality
7520 select_eq_Ex -> some_eq_ex
7521 selectI2EX -> someI2_ex
7524 select1_equality -> some1_equality
7525 Eps_sym_eq -> some_sym_eq_trivial
7526 Eps_eq -> some_eq_trivial
7528 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7530 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7533 * HOL: the recursion equations generated by 'recdef' are now called
7534 f.simps instead of f.rules;
7536 * HOL: qed_spec_mp now also handles bounded ALL as well;
7538 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7539 sometimes be needed;
7541 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7543 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7545 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7546 product is now "<*>" instead of "Times"; the lexicographic product is
7547 now "<*lex*>" instead of "**";
7549 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7550 of main HOL, but was unused); better use HOL's datatype package;
7552 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7553 the old syntax may be recovered as follows:
7556 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7557 (infixl "\\<oplus>" 100)
7559 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7561 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7562 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7565 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7566 changed from A/r to A//r;
7568 * ZF: new treatment of arithmetic (nat & int) may break some old
7571 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7572 rulify -> rule_format, elimify -> elim_format, ...);
7574 * Isar/Provers: intro/elim/dest attributes changed; renamed
7575 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7576 should have to change intro!! to intro? only); replaced "delrule" by
7579 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7581 * Provers: strengthened force_tac by using new first_best_tac;
7583 * LaTeX document preparation: several changes of isabelle.sty (see
7587 *** Document preparation ***
7589 * formal comments (text blocks etc.) in new-style theories may now
7590 contain antiquotations of thm/prop/term/typ/text to be presented
7591 according to latex print mode; concrete syntax is like this:
7592 @{term[show_types] "f(x) = a + x"};
7594 * isatool mkdir provides easy setup of Isabelle session directories,
7595 including proper document sources;
7597 * generated LaTeX sources are now deleted after successful run
7598 (isatool document -c); may retain a copy somewhere else via -D option
7601 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7602 style files, achieving self-contained LaTeX sources and simplifying
7605 * old-style theories now produce (crude) LaTeX output as well;
7607 * browser info session directories are now self-contained (may be put
7608 on WWW server seperately); improved graphs of nested sessions; removed
7609 graph for 'all sessions';
7611 * several improvements in isabelle style files; \isabellestyle{it}
7612 produces fake math mode output; \isamarkupheader is now \section by
7613 default; see lib/texinputs/isabelle.sty etc.;
7618 * Isar/Pure: local results and corresponding term bindings are now
7619 subject to Hindley-Milner polymorphism (similar to ML); this
7620 accommodates incremental type-inference very nicely;
7622 * Isar/Pure: new derived language element 'obtain' supports
7623 generalized existence reasoning;
7625 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7626 support accumulation of results, without applying any rules yet;
7627 useful to collect intermediate results without explicit name
7628 references, and for use with transitivity rules with more than 2
7631 * Isar/Pure: scalable support for case-analysis type proofs: new
7632 'case' language element refers to local contexts symbolically, as
7633 produced by certain proof methods; internally, case names are attached
7634 to theorems as "tags";
7636 * Isar/Pure: theory command 'hide' removes declarations from
7637 class/type/const name spaces;
7639 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7640 indicate potential overloading;
7642 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7644 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7645 "{a,b,c}" instead of {a,b,c};
7647 * Isar/Pure now provides its own version of intro/elim/dest
7648 attributes; useful for building new logics, but beware of confusion
7649 with the version in Provers/classical;
7651 * Isar/Pure: the local context of (non-atomic) goals is provided via
7652 case name 'antecedent';
7654 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7655 to the current context is now done automatically);
7657 * Isar/Pure: theory command 'method_setup' provides a simple interface
7658 for definining proof methods in ML;
7660 * Isar/Provers: intro/elim/dest attributes changed; renamed
7661 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7662 most cases, one should have to change intro!! to intro? only);
7663 replaced "delrule" by "rule del";
7665 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7666 'symmetric' attribute (the latter supercedes [RS sym]);
7668 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7669 method modifier); 'simp' method: 'only:' modifier removes loopers as
7670 well (including splits);
7672 * Isar/Provers: Simplifier and Classical methods now support all kind
7673 of modifiers used in the past, including 'cong', 'iff', etc.
7675 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7676 of Simplifier and Classical reasoner);
7678 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7679 now support named cases; major packages (inductive, datatype, primrec,
7680 recdef) support case names and properly name parameters;
7682 * Isar/HOL: new transitivity rules for substitution in inequalities --
7683 monotonicity conditions are extracted to be proven at end of
7686 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7689 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7690 split_if split_if_asm; datatype package provides theorems foo.splits =
7691 foo.split foo.split_asm for each datatype;
7693 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7694 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7695 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7696 use "(cases (simplified))" method in proper proof texts);
7698 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7700 * Isar: names of theorems etc. may be natural numbers as well;
7702 * Isar: 'pr' command: optional arguments for goals_limit and
7703 ProofContext.prems_limit; no longer prints theory contexts, but only
7706 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7707 additional print modes to be specified; e.g. "pr(latex)" will print
7708 proof state according to the Isabelle LaTeX style;
7710 * Isar: improved support for emulating tactic scripts, including proof
7711 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7712 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7713 (for HOL datatypes);
7715 * Isar: simplified (more robust) goal selection of proof methods: 1st
7716 goal, all goals, or explicit goal specifier (tactic emulation); thus
7717 'proof method scripts' have to be in depth-first order;
7719 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7721 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7722 should instead use individual commands for printing items
7723 (print_commands, print_methods etc.);
7725 * Isar: added 'nothing' --- the empty list of theorems;
7730 * HOL/MicroJava: formalization of a fragment of Java, together with a
7731 corresponding virtual machine and a specification of its bytecode
7732 verifier and a lightweight bytecode verifier, including proofs of
7733 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7734 Cornelia Pusch (see also the homepage of project Bali at
7735 http://isabelle.in.tum.de/Bali/);
7737 * HOL/Algebra: new theory of rings and univariate polynomials, by
7740 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7741 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7744 * HOL/Lattice: fundamental concepts of lattice theory and order
7745 structures, including duals, properties of bounds versus algebraic
7746 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7747 Theorem for complete lattices etc.; may also serve as a demonstration
7748 for abstract algebraic reasoning using axiomatic type classes, and
7749 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7751 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7754 * HOL/IMPP: extension of IMP with local variables and mutually
7755 recursive procedures, by David von Oheimb;
7757 * HOL/Lambda: converted into new-style theory and document;
7759 * HOL/ex/Multiquote: example of multiple nested quotations and
7760 anti-quotations -- basically a generalized version of de-Bruijn
7761 representation; very useful in avoiding lifting of operations;
7763 * HOL/record: added general record equality rule to simpset; fixed
7764 select-update simplification procedure to handle extended records as
7765 well; admit "r" as field name;
7767 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7768 other numeric types and also as the identity of groups, rings, etc.;
7770 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7771 Types nat and int belong to this axclass;
7773 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7774 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7775 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7776 two terms #m*u and #n*u are replaced by #(m+n)*u
7777 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7778 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7779 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7781 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7782 powerful prover for predicate logic but knows nothing of clasets; see
7783 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7785 * HOL: new version of "case_tac" subsumes both boolean case split and
7786 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7787 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7789 * HOL: simplification no longer dives into case-expressions: only the
7790 selector expression is simplified, but not the remaining arms; to
7791 enable full simplification of case-expressions for datatype t, you may
7792 remove t.weak_case_cong from the simpset, either globally (Delcongs
7793 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7795 * HOL/recdef: the recursion equations generated by 'recdef' for
7796 function 'f' are now called f.simps instead of f.rules; if all
7797 termination conditions are proved automatically, these simplification
7798 rules are added to the simpset, as in primrec; rules may be named
7799 individually as well, resulting in a separate list of theorems for
7802 * HOL/While is a new theory that provides a while-combinator. It
7803 permits the definition of tail-recursive functions without the
7804 provision of a termination measure. The latter is necessary once the
7805 invariant proof rule for while is applied.
7807 * HOL: new (overloaded) notation for the set of elements below/above
7808 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7810 * HOL: theorems impI, allI, ballI bound as "strip";
7812 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7813 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7814 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7816 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7818 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7819 main HOL, but was unused);
7821 * HOL: fewer consts declared as global (e.g. have to refer to
7822 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7824 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7825 in case of overlap with user translations (e.g. judgements over
7826 tuples); (note that the underlying logical represenation is still
7832 * ZF: simplification automatically cancels common terms in arithmetic
7833 expressions over nat and int;
7835 * ZF: new treatment of nat to minimize type-checking: all operators
7836 coerce their operands to a natural number using the function natify,
7837 making the algebraic laws unconditional;
7839 * ZF: as above, for int: operators coerce their operands to an integer
7840 using the function intify;
7842 * ZF: the integer library now contains many of the usual laws for the
7843 orderings, including $<=, and monotonicity laws for $+ and $*;
7845 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7848 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7849 to the simplifier and classical reasoner simultaneously;
7854 * Provers: blast_tac now handles actual object-logic rules as
7855 assumptions; note that auto_tac uses blast_tac internally as well;
7857 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7858 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7860 * Provers: delrules now handles destruct rules as well (no longer need
7861 explicit make_elim);
7863 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7864 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7865 use instead the strong form,
7866 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7867 in HOL, FOL and ZF the function cla_make_elim will create such rules
7868 from destruct-rules;
7870 * Provers: Simplifier.easy_setup provides a fast path to basic
7871 Simplifier setup for new object-logics;
7873 * Pure: AST translation rules no longer require constant head on LHS;
7875 * Pure: improved name spaces: ambiguous output is qualified; support
7876 for hiding of names;
7878 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7879 XSYMBOL_HOME; no longer need to do manual configuration in most
7882 * system: compression of ML heaps images may now be controlled via -c
7883 option of isabelle and isatool usedir (currently only observed by
7886 * system: isatool installfonts may handle X-Symbol fonts as well (very
7887 useful for remote X11);
7889 * system: provide TAGS file for Isabelle sources;
7891 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7894 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7895 timing flag supersedes proof_timing and Toplevel.trace;
7897 * ML: new combinators |>> and |>>> for incremental transformations
7898 with secondary results (e.g. certain theory extensions):
7900 * ML: PureThy.add_defs gets additional argument to indicate potential
7901 overloading (usually false);
7903 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7908 New in Isabelle99 (October 1999)
7909 --------------------------------
7911 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7913 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7914 are no longer simplified. (This allows the simplifier to unfold recursive
7915 functional programs.) To restore the old behaviour, declare
7917 Delcongs [if_weak_cong];
7919 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7922 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7924 * HOL/datatype: mutual_induct_tac no longer exists --
7925 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7927 * HOL/typedef: fixed type inference for representing set; type
7928 arguments now have to occur explicitly on the rhs as type constraints;
7930 * ZF: The con_defs part of an inductive definition may no longer refer
7931 to constants declared in the same theory;
7933 * HOL, ZF: the function mk_cases, generated by the inductive
7934 definition package, has lost an argument. To simplify its result, it
7935 uses the default simpset instead of a supplied list of theorems.
7937 * HOL/List: the constructors of type list are now Nil and Cons;
7939 * Simplifier: the type of the infix ML functions
7940 setSSolver addSSolver setSolver addSolver
7941 is now simpset * solver -> simpset where `solver' is a new abstract type
7942 for packaging solvers. A solver is created via
7943 mk_solver: string -> (thm list -> int -> tactic) -> solver
7944 where the string argument is only a comment.
7949 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7950 decision procedure for linear arithmetic. Currently it is used for
7951 types `nat', `int', and `real' in HOL (see below); it can, should and
7952 will be instantiated for other types and logics as well.
7954 * The simplifier now accepts rewrite rules with flexible heads, eg
7955 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7956 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7962 * New Isabelle/Isar subsystem provides an alternative to traditional
7963 tactical theorem proving; together with the ProofGeneral/isar user
7964 interface it offers an interactive environment for developing human
7965 readable proof documents (Isar == Intelligible semi-automated
7966 reasoning); for further information see isatool doc isar-ref,
7967 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7969 * improved and simplified presentation of theories: better HTML markup
7970 (including colors), graph views in several sizes; isatool usedir now
7971 provides a proper interface for user theories (via -P option); actual
7972 document preparation based on (PDF)LaTeX is available as well (for
7973 new-style theories only); see isatool doc system for more information;
7975 * native support for Proof General, both for classic Isabelle and
7978 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7979 using the graph browser tool;
7981 * Isabelle manuals now also available as PDF;
7983 * theory loader rewritten from scratch (may not be fully
7984 bug-compatible); old loadpath variable has been replaced by show_path,
7985 add_path, del_path, reset_path functions; new operations such as
7986 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7989 * improved isatool install: option -k creates KDE application icon,
7990 option -p DIR installs standalone binaries;
7992 * added ML_PLATFORM setting (useful for cross-platform installations);
7993 more robust handling of platform specific ML images for SML/NJ;
7995 * the settings environment is now statically scoped, i.e. it is never
7996 created again in sub-processes invoked from isabelle, isatool, or
7999 * path element specification '~~' refers to '$ISABELLE_HOME';
8001 * in locales, the "assumes" and "defines" parts may be omitted if
8004 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8007 * new print_mode "HTML";
8009 * new flag show_tags controls display of tags of theorems (which are
8010 basically just comments that may be attached by some tools);
8012 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8013 mode and goal output format:
8015 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8017 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8019 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8020 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8022 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8024 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8026 * function bind_thms stores lists of theorems (cf. bind_thm);
8028 * new shorthand tactics ftac, eatac, datac, fatac;
8030 * qed (and friends) now accept "" as result name; in that case the
8031 theorem is not stored, but proper checks and presentation of the
8034 * theorem database now also indexes constants "Trueprop", "all",
8035 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8040 ** HOL arithmetic **
8042 * There are now decision procedures for linear arithmetic over nat and
8045 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8046 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8047 are treated as atomic; subformulae not involving type `nat' or `int'
8048 are ignored; quantified subformulae are ignored unless they are
8049 positive universal or negative existential. The tactic has to be
8050 invoked by hand and can be a little bit slow. In particular, the
8051 running time is exponential in the number of occurrences of `min' and
8052 `max', and `-' on `nat'.
8054 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8055 (negated) (in)equalities among the premises and the conclusion into
8056 account (i.e. no compound formulae) and does not know about `min' and
8057 `max', and `-' on `nat'. It is fast and is used automatically by the
8060 NB: At the moment, these decision procedures do not cope with mixed
8061 nat/int formulae where the two parts interact, such as `m < n ==>
8064 * HOL/Numeral provides a generic theory of numerals (encoded
8065 efficiently as bit strings); setup for types nat/int/real is in place;
8066 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8067 int, existing theories and proof scripts may require a few additional
8070 * integer division and remainder can now be performed on constant
8073 * many properties of integer multiplication, division and remainder
8076 * An interface to the Stanford Validity Checker (SVC) is available through the
8077 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8078 are proved automatically. SVC must be installed separately, and its results
8079 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8080 invocation of the underlying oracle). For SVC see
8081 http://verify.stanford.edu/SVC
8083 * IsaMakefile: the HOL-Real target now builds an actual image;
8088 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8089 (in Isabelle/Isar) -- by Gertrud Bauer;
8091 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8092 analysis for assembly languages with subtypes;
8094 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8095 -- avoids syntactic ambiguities and treats state, transition, and
8096 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8097 changed syntax and (many) tactics;
8099 * HOL/inductive: Now also handles more general introduction rules such
8100 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8101 theorems are now maintained within the theory (maintained via the
8104 * HOL/datatype: Now also handles arbitrarily branching datatypes
8105 (using function types) such as
8107 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8109 * HOL/record: record_simproc (part of the default simpset) takes care
8110 of selectors applied to updated records; record_split_tac is no longer
8111 part of the default claset; update_defs may now be removed from the
8112 simpset in many cases; COMPATIBILITY: old behavior achieved by
8114 claset_ref () := claset() addSWrapper record_split_wrapper;
8115 Delsimprocs [record_simproc]
8117 * HOL/typedef: fixed type inference for representing set; type
8118 arguments now have to occur explicitly on the rhs as type constraints;
8120 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8121 names rather than an ML expression;
8123 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8124 supplied later. Program schemes can be defined, such as
8125 "While B C s = (if B s then While B C (C s) else s)"
8126 where the well-founded relation can be chosen after B and C have been given.
8128 * HOL/List: the constructors of type list are now Nil and Cons;
8129 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8130 course, ML tools referring to List.list.op # etc. have to be adapted;
8132 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8133 disabled by default; run isabelle with option -m HOL to get back to
8134 the original Gordon/HOL-style output;
8136 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8137 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8139 * HOL basic syntax simplified (more orthogonal): all variants of
8140 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8141 Eps operator is provided as well: "SOME x. P[x]";
8143 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8145 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8146 thus available for user theories;
8148 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8149 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8152 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8153 several times and then mp;
8158 * the notation <<...>> is now available as a notation for sequences of
8161 * the simplifier is now installed
8163 * the axiom system has been generalized (thanks to Soren Heilmann)
8165 * the classical reasoner now has a default rule database
8170 * new primrec section allows primitive recursive functions to be given
8171 directly (as in HOL) over datatypes and the natural numbers;
8173 * new tactics induct_tac and exhaust_tac for induction (or case
8174 analysis) over datatypes and the natural numbers;
8176 * the datatype declaration of type T now defines the recursor T_rec;
8178 * simplification automatically does freeness reasoning for datatype
8181 * automatic type-inference, with AddTCs command to insert new
8182 type-checking rules;
8184 * datatype introduction rules are now added as Safe Introduction rules
8187 * the syntax "if P then x else y" is now available in addition to
8191 *** Internal programming interfaces ***
8193 * tuned simplifier trace output; new flag debug_simp;
8195 * structures Vartab / Termtab (instances of TableFun) offer efficient
8196 tables indexed by indexname_ord / term_ord (compatible with aconv);
8198 * AxClass.axclass_tac lost the theory argument;
8200 * tuned current_goals_markers semantics: begin / end goal avoids
8201 printing empty lines;
8203 * removed prs and prs_fn hook, which was broken because it did not
8204 include \n in its semantics, forcing writeln to add one
8205 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8206 string -> unit if you really want to output text without newline;
8208 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8209 plain output, interface builders may have to enable 'isabelle_font'
8210 mode to get Isabelle font glyphs as before;
8212 * refined token_translation interface; INCOMPATIBILITY: output length
8213 now of type real instead of int;
8215 * theory loader actions may be traced via new ThyInfo.add_hook
8216 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8217 your own database of information attached to *whole* theories -- as
8218 opposed to intra-theory data slots offered via TheoryDataFun;
8220 * proper handling of dangling sort hypotheses (at last!);
8221 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8222 extra sort hypotheses that can be witnessed from the type signature;
8223 the force_strip_shyps flag is gone, any remaining shyps are simply
8224 left in the theorem (with a warning issued by strip_shyps_warning);
8228 New in Isabelle98-1 (October 1998)
8229 ----------------------------------
8231 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8233 * several changes of automated proof tools;
8235 * HOL: major changes to the inductive and datatype packages, including
8236 some minor incompatibilities of theory syntax;
8238 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8241 * HOL: removed duplicate thms in Arith:
8242 less_imp_add_less should be replaced by trans_less_add1
8243 le_imp_add_le should be replaced by trans_le_add1
8245 * HOL: unary minus is now overloaded (new type constraints may be
8248 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8249 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8250 now taken as an integer constant.
8252 * Pure: ML function 'theory_of' renamed to 'theory';
8258 1. Asm_full_simp_tac is now more aggressive.
8259 1. It will sometimes reorient premises if that increases their power to
8261 2. It does no longer proceed strictly from left to right but may also
8262 rotate premises to achieve further simplification.
8263 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8264 old Asm_full_simp_tac in that it does not rotate premises.
8265 2. The simplifier now knows a little bit about nat-arithmetic.
8267 * Classical reasoner: wrapper mechanism for the classical reasoner now
8268 allows for selected deletion of wrappers, by introduction of names for
8269 wrapper functionals. This implies that addbefore, addSbefore,
8270 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8271 and that adding two tactics with the same name overwrites the first
8272 one (emitting a warning).
8273 type wrapper = (int -> tactic) -> (int -> tactic)
8274 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8275 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8276 delWrapper, delSWrapper: claset * string -> claset
8277 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8279 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8280 semantics; addbefore now affects only the unsafe part of step_tac
8281 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8282 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8285 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8286 compWrapper; added safe wrapper (and access functions for it);
8288 * HOL/split_all_tac is now much faster and fails if there is nothing
8289 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8290 and the names of the automatically generated variables have changed.
8291 split_all_tac has moved within claset() from unsafe wrappers to safe
8292 wrappers, which means that !!-bound variables are split much more
8293 aggressively, and safe_tac and clarify_tac now split such variables.
8294 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8295 Note: the same holds for record_split_tac, which does the job of
8296 split_all_tac for record fields.
8298 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8299 permanently to the default simpset using Addsplits just like
8300 Addsimps. They can be removed via Delsplits just like
8301 Delsimps. Lower-case versions are also available.
8303 * HOL/Simplifier: The rule split_if is now part of the default
8304 simpset. This means that the simplifier will eliminate all occurrences
8305 of if-then-else in the conclusion of a goal. To prevent this, you can
8306 either remove split_if completely from the default simpset by
8307 `Delsplits [split_if]' or remove it in a specific call of the
8308 simplifier using `... delsplits [split_if]'. You can also add/delete
8309 other case splitting rules to/from the default simpset: every datatype
8310 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8311 t is the name of the datatype).
8313 * Classical reasoner / Simplifier combination: new force_tac (and
8314 derivatives Force_tac, force) combines rewriting and classical
8315 reasoning (and whatever other tools) similarly to auto_tac, but is
8316 aimed to solve the given subgoal completely.
8321 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8322 and `goalw': the theory is no longer needed as an explicit argument -
8323 the current theory context is used; assumptions are no longer returned
8324 at the ML-level unless one of them starts with ==> or !!; it is
8325 recommended to convert to these new commands using isatool fixgoal
8326 (backup your sources first!);
8328 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8329 the current theory context, and 'theory' to lookup stored theories;
8331 * new theory section 'locale' for declaring constants, assumptions and
8332 definitions that have local scope;
8334 * new theory section 'nonterminals' for purely syntactic types;
8336 * new theory section 'setup' for generic ML setup functions
8337 (e.g. package initialization);
8339 * the distribution now includes Isabelle icons: see
8340 lib/logo/isabelle-{small,tiny}.xpm;
8342 * isatool install - install binaries with absolute references to
8345 * isatool logo -- create instances of the Isabelle logo (as EPS);
8347 * print mode 'emacs' reserved for Isamode;
8349 * support multiple print (ast) translations per constant name;
8351 * theorems involving oracles are now printed with a suffixed [!];
8356 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8358 * HOL/inductive package reorganized and improved: now supports mutual
8364 oddI "n : EVEN ==> Suc n : ODD"
8365 evenI "n : ODD ==> Suc n : EVEN"
8367 new theorem list "elims" contains an elimination rule for each of the
8368 recursive sets; inductive definitions now handle disjunctive premises
8369 correctly (also ZF);
8371 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8372 "mutual_induct" no longer exists - the induction rule is always
8373 contained in "induct";
8376 * HOL/datatype package re-implemented and greatly improved: now
8377 supports mutually recursive datatypes such as
8380 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8381 | SUM ('a aexp) ('a aexp)
8382 | DIFF ('a aexp) ('a aexp)
8385 'a bexp = LESS ('a aexp) ('a aexp)
8386 | AND ('a bexp) ('a bexp)
8387 | OR ('a bexp) ('a bexp)
8389 as well as indirectly recursive datatypes such as
8392 ('a, 'b) term = Var 'a
8393 | App 'b ((('a, 'b) term) list)
8395 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8396 induction on mutually / indirectly recursive datatypes.
8398 Primrec equations are now stored in theory and can be accessed via
8399 <function_name>.simps.
8403 - Theories using datatypes must now have theory Datatype as an
8405 - The specific <typename>.induct_tac no longer exists - use the
8406 generic induct_tac instead.
8407 - natE has been renamed to nat.exhaust - use exhaust_tac
8408 instead of res_inst_tac ... natE. Note that the variable
8409 names in nat.exhaust differ from the names in natE, this
8410 may cause some "fragile" proofs to fail.
8411 - The theorems split_<typename>_case and split_<typename>_case_asm
8412 have been renamed to <typename>.split and <typename>.split_asm.
8413 - Since default sorts of type variables are now handled correctly,
8414 some datatype definitions may have to be annotated with explicit
8416 - Primrec definitions no longer require function name and type
8417 of recursive argument.
8419 Consider using isatool fixdatatype to adapt your theories and proof
8420 scripts to the new package (backup your sources first!).
8423 * HOL/record package: considerably improved implementation; now
8424 includes concrete syntax for record types, terms, updates; theorems
8425 for surjective pairing and splitting !!-bound record variables; proof
8426 support is as follows:
8428 1) standard conversions (selectors or updates applied to record
8429 constructor terms) are part of the standard simpset;
8431 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8432 made part of standard simpset and claset via addIffs;
8434 3) a tactic for record field splitting (record_split_tac) is part of
8435 the standard claset (addSWrapper);
8437 To get a better idea about these rules you may retrieve them via
8438 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8439 the name of your record type.
8441 The split tactic 3) conceptually simplifies by the following rule:
8443 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8445 Thus any record variable that is bound by meta-all will automatically
8446 blow up into some record constructor term, consequently the
8447 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8448 solve record problems automatically.
8451 * reorganized the main HOL image: HOL/Integ and String loaded by
8452 default; theory Main includes everything;
8454 * automatic simplification of integer sums and comparisons, using cancellation;
8456 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8458 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8460 * many new identities for unions, intersections, set difference, etc.;
8462 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8463 called split_if, split_split, split_sum_case and split_nat_case (to go
8464 with add/delsplits);
8466 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8467 (?x::unit) = (); this is made part of the default simpset, which COULD
8468 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8469 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8470 unit_abs_eta_conv is added in order to counter the effect of
8471 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8474 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8477 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8478 It and 'sym RS equals0D' are now in the default claset, giving automatic
8479 disjointness reasoning but breaking a few old proofs.
8481 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8482 to 'converse' from 'inverse' (for compatibility with ZF and some
8485 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8486 the well-founded relation;
8488 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8489 Compl A. The "Compl" syntax remains available as input syntax for this
8492 * HOL/Update: new theory of function updates:
8493 f(a:=b) == %x. if x=a then b else f x
8494 may also be iterated as in f(a:=b,c:=d,...);
8496 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8499 - new function list_update written xs[i:=v] that updates the i-th
8500 list position. May also be iterated as in xs[i:=a,j:=b,...].
8501 - new function `upt' written [i..j(] which generates the list
8502 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8503 bound write [i..j], which is a shorthand for [i..j+1(].
8504 - new lexicographic orderings and corresponding wellfoundedness theorems.
8507 - removed 'pred' (predecessor) function;
8508 - generalized some theorems about n-1;
8509 - many new laws about "div" and "mod";
8510 - new laws about greatest common divisors (see theory ex/Primes);
8512 * HOL/Relation: renamed the relational operator r^-1 "converse"
8513 instead of "inverse";
8515 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8516 of the multiset ordering;
8518 * directory HOL/Real: a construction of the reals using Dedekind cuts
8519 (not included by default);
8521 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8523 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8524 programs, i.e. different program variables may have different types.
8526 * calling (stac rew i) now fails if "rew" has no effect on the goal
8527 [previously, this check worked only if the rewrite rule was unconditional]
8528 Now rew can involve either definitions or equalities (either == or =).
8533 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8534 only the theorems proved on ZF.ML;
8536 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8537 It and 'sym RS equals0D' are now in the default claset, giving automatic
8538 disjointness reasoning but breaking a few old proofs.
8540 * ZF/Update: new theory of function updates
8541 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8542 may also be iterated as in f(a:=b,c:=d,...);
8544 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8546 * calling (stac rew i) now fails if "rew" has no effect on the goal
8547 [previously, this check worked only if the rewrite rule was unconditional]
8548 Now rew can involve either definitions or equalities (either == or =).
8550 * case_tac provided for compatibility with HOL
8551 (like the old excluded_middle_tac, but with subgoals swapped)
8554 *** Internal programming interfaces ***
8556 * Pure: several new basic modules made available for general use, see
8557 also src/Pure/README;
8559 * improved the theory data mechanism to support encapsulation (data
8560 kind name replaced by private Object.kind, acting as authorization
8561 key); new type-safe user interface via functor TheoryDataFun; generic
8562 print_data function becomes basically useless;
8564 * removed global_names compatibility flag -- all theory declarations
8565 are qualified by default;
8567 * module Pure/Syntax now offers quote / antiquote translation
8568 functions (useful for Hoare logic etc. with implicit dependencies);
8569 see HOL/ex/Antiquote for an example use;
8571 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8574 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8577 * Display.print_goals function moved to Locale.print_goals;
8579 * standard print function for goals supports current_goals_markers
8580 variable for marking begin of proof, end of proof, start of goal; the
8581 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8582 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8587 New in Isabelle98 (January 1998)
8588 --------------------------------
8590 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8592 * changed lexical syntax of terms / types: dots made part of long
8593 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8595 * simpset (and claset) reference variable replaced by functions
8596 simpset / simpset_ref;
8598 * no longer supports theory aliases (via merge) and non-trivial
8599 implicit merge of thms' signatures;
8601 * most internal names of constants changed due to qualified names;
8603 * changed Pure/Sequence interface (see Pure/seq.ML);
8606 *** General Changes ***
8608 * hierachically structured name spaces (for consts, types, axms, thms
8609 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8610 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8611 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8612 long_names for fully qualified output names; NOTE: ML programs
8613 (special tactics, packages etc.) referring to internal names may have
8614 to be adapted to cope with fully qualified names; in case of severe
8615 backward campatibility problems try setting 'global_names' at compile
8616 time to have enrything declared within a flat name space; one may also
8617 fine tune name declarations in theories via the 'global' and 'local'
8620 * reimplemented the implicit simpset and claset using the new anytype
8621 data filed in signatures; references simpset:simpset ref etc. are
8622 replaced by functions simpset:unit->simpset and
8623 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8624 to patch your ML files accordingly;
8626 * HTML output now includes theory graph data for display with Java
8627 applet or isatool browser; data generated automatically via isatool
8628 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8630 * defs may now be conditional; improved rewrite_goals_tac to handle
8631 conditional equations;
8633 * defs now admits additional type arguments, using TYPE('a) syntax;
8635 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8636 creates a new theory node; implicit merge of thms' signatures is
8637 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8638 transfer:theory->thm->thm in (rare) cases;
8640 * improved handling of draft signatures / theories; draft thms (and
8641 ctyps, cterms) are automatically promoted to real ones;
8643 * slightly changed interfaces for oracles: admit many per theory, named
8644 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8646 * print_goals: optional output of const types (set show_consts and
8649 * improved output of warnings (###) and errors (***);
8651 * subgoal_tac displays a warning if the new subgoal has type variables;
8653 * removed old README and Makefiles;
8655 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8657 * removed obsolete init_pps and init_database;
8659 * deleted the obsolete tactical STATE, which was declared by
8660 fun STATE tacfun st = tacfun st st;
8662 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8663 (which abbreviates $HOME);
8665 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8666 use isatool fixseq to adapt your ML programs (this works for fully
8667 qualified references to the Sequence structure only!);
8669 * use_thy no longer requires writable current directory; it always
8670 reloads .ML *and* .thy file, if either one is out of date;
8673 *** Classical Reasoner ***
8675 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8676 tactics that use classical reasoning to simplify a subgoal without
8677 splitting it into several subgoals;
8679 * Safe_tac: like safe_tac but uses the default claset;
8684 * added simplification meta rules:
8685 (asm_)(full_)simplify: simpset -> thm -> thm;
8687 * simplifier.ML no longer part of Pure -- has to be loaded by object
8690 * added prems argument to simplification procedures;
8692 * HOL, FOL, ZF: added infix function `addsplits':
8693 instead of `<simpset> setloop (split_tac <thms>)'
8694 you can simply write `<simpset> addsplits <thms>'
8699 * TYPE('a) syntax for type reflection terms;
8701 * no longer handles consts with name "" -- declare as 'syntax' instead;
8703 * pretty printer: changed order of mixfix annotation preference (again!);
8705 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8710 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8711 with `addloop' of the simplifier to faciliate case splitting in premises.
8713 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8715 * HOL/Auth: new protocol proofs including some for the Internet
8718 * HOL/Map: new theory of `maps' a la VDM;
8720 * HOL/simplifier: simplification procedures nat_cancel_sums for
8721 cancelling out common nat summands from =, <, <= (in)equalities, or
8722 differences; simplification procedures nat_cancel_factor for
8723 cancelling common factor from =, <, <= (in)equalities over natural
8724 sums; nat_cancel contains both kinds of procedures, it is installed by
8725 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8727 * HOL/simplifier: terms of the form
8728 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8730 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8731 and those of the form
8732 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8734 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8737 Each datatype `t' now comes with a theorem `split_t_case' of the form
8739 P(t_case f1 ... fn x) =
8740 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8742 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8745 and a theorem `split_t_case_asm' of the form
8747 P(t_case f1 ... fn x) =
8748 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8750 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8752 which can be added to a simpset via `addsplits'. The existing theorems
8753 expand_list_case and expand_option_case have been renamed to
8754 split_list_case and split_option_case.
8757 - `pred n' is automatically converted to `n-1'.
8758 Users are strongly encouraged not to use `pred' any longer,
8759 because it will disappear altogether at some point.
8760 - Users are strongly encouraged to write "0 < n" rather than
8761 "n ~= 0". Theorems and proof tools have been modified towards this
8765 the function "set_of_list" has been renamed "set" (and its theorems too);
8766 the function "nth" now takes its arguments in the reverse order and
8767 has acquired the infix notation "!" as in "xs!n".
8769 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8771 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8772 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8774 * HOL/record: extensible records with schematic structural subtyping
8775 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8776 still lacks various theorems and concrete record syntax;
8781 * removed "axioms" and "generated by" sections;
8783 * replaced "ops" section by extended "consts" section, which is capable of
8784 handling the continuous function space "->" directly;
8787 . proves theorems immediately and stores them in the theory,
8788 . creates hierachical name space,
8789 . now uses normal mixfix annotations (instead of cinfix...),
8790 . minor changes to some names and values (for consistency),
8791 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8792 . separator between mutual domain defs: changed "," to "and",
8793 . improved handling of sort constraints; now they have to
8794 appear on the left-hand side of the equations only;
8796 * fixed LAM <x,y,zs>.b syntax;
8798 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8799 adm (%x. P (t x)), where P is chainfinite and t continuous;
8804 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8805 with `addloop' of the simplifier to faciliate case splitting in premises.
8807 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8808 in HOL, they strip ALL and --> from proved theorems;
8812 New in Isabelle94-8 (May 1997)
8813 ------------------------------
8815 *** General Changes ***
8817 * new utilities to build / run / maintain Isabelle etc. (in parts
8818 still somewhat experimental); old Makefiles etc. still functional;
8820 * new 'Isabelle System Manual';
8822 * INSTALL text, together with ./configure and ./build scripts;
8824 * reimplemented type inference for greater efficiency, better error
8825 messages and clean internal interface;
8827 * prlim command for dealing with lots of subgoals (an easier way of
8828 setting goals_limit);
8833 * supports alternative (named) syntax tables (parser and pretty
8834 printer); internal interface is provided by add_modesyntax(_i);
8836 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8837 be used in conjunction with the Isabelle symbol font; uses the
8838 "symbols" syntax table;
8840 * added token_translation interface (may translate name tokens in
8841 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8842 the current print_mode); IMPORTANT: user print translation functions
8843 are responsible for marking newly introduced bounds
8844 (Syntax.mark_boundT);
8846 * token translations for modes "xterm" and "xterm_color" that display
8847 names in bold, underline etc. or colors (which requires a color
8850 * infixes may now be declared with names independent of their syntax;
8852 * added typed_print_translation (like print_translation, but may
8853 access type of constant);
8856 *** Classical Reasoner ***
8858 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8859 some limitations. Blast_tac...
8860 + ignores addss, addbefore, addafter; this restriction is intrinsic
8861 + ignores elimination rules that don't have the correct format
8862 (the conclusion MUST be a formula variable)
8863 + ignores types, which can make HOL proofs fail
8864 + rules must not require higher-order unification, e.g. apply_type in ZF
8865 [message "Function Var's argument not a bound variable" relates to this]
8866 + its proof strategy is more general but can actually be slower
8868 * substitution with equality assumptions no longer permutes other
8871 * minor changes in semantics of addafter (now called addaltern); renamed
8872 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8873 (and access functions for it);
8875 * improved combination of classical reasoner and simplifier:
8876 + functions for handling clasimpsets
8877 + improvement of addss: now the simplifier is called _after_ the
8879 + safe variant of addss called addSss: uses safe simplifications
8880 _during_ the safe steps. It is more complete as it allows multiple
8881 instantiations of unknowns (e.g. with slow_tac).
8885 * added interface for simplification procedures (functions that
8886 produce *proven* rewrite rules on the fly, depending on current
8889 * ordering on terms as parameter (used for ordered rewriting);
8891 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8893 * the solver is now split into a safe and an unsafe part.
8894 This should be invisible for the normal user, except that the
8895 functions setsolver and addsolver have been renamed to setSolver and
8896 addSolver; added safe_asm_full_simp_tac;
8901 * a generic induction tactic `induct_tac' which works for all datatypes and
8902 also for type `nat';
8904 * a generic case distinction tactic `exhaust_tac' which works for all
8905 datatypes and also for type `nat';
8907 * each datatype comes with a function `size';
8909 * patterns in case expressions allow tuple patterns as arguments to
8910 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8912 * primrec now also works with type nat;
8914 * recdef: a new declaration form, allows general recursive functions to be
8915 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8917 * the constant for negation has been renamed from "not" to "Not" to
8918 harmonize with FOL, ZF, LK, etc.;
8920 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8923 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8925 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8926 problems in commutative rings, using axiomatic type classes for + and *;
8928 * more examples in HOL/MiniML and HOL/Auth;
8930 * more default rewrite rules for quantifiers, union/intersection;
8932 * a new constant `arbitrary == @x.False';
8934 * HOLCF/IOA replaces old HOL/IOA;
8936 * HOLCF changes: derived all rules and arities
8937 + axiomatic type classes instead of classes
8938 + typedef instead of faking type definitions
8939 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8940 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8941 + eliminated the types void, one, tr
8942 + use unit lift and bool lift (with translations) instead of one and tr
8943 + eliminated blift from Lift3.thy (use Def instead of blift)
8944 all eliminated rules are derived as theorems --> no visible changes ;
8949 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8950 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8951 as ZF_cs addSIs [equalityI];
8955 New in Isabelle94-7 (November 96)
8956 ---------------------------------
8958 * allowing negative levels (as offsets) in prlev and choplev;
8960 * super-linear speedup for large simplifications;
8962 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8963 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8964 FAIL); can suppress it using the command Delsimps (ex_simps @
8965 all_simps); De Morgan laws are also now included, by default;
8967 * improved printing of ==> : ~:
8969 * new object-logic "Sequents" adds linear logic, while replacing LK
8970 and Modal (thanks to Sara Kalvala);
8972 * HOL/Auth: correctness proofs for authentication protocols;
8974 * HOL: new auto_tac combines rewriting and classical reasoning (many
8975 examples on HOL/Auth);
8977 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8978 the rewriter and classical reasoner simultaneously;
8980 * function uresult no longer returns theorems in "standard" format;
8981 regain previous version by: val uresult = standard o uresult;
8988 * oracles -- these establish an interface between Isabelle and trusted
8989 external reasoners, which may deliver results as theorems;
8991 * proof objects (in particular record all uses of oracles);
8993 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8995 * "constdefs" section in theory files;
8997 * "primrec" section (HOL) no longer requires names;
8999 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9006 * reduced space requirements;
9008 * automatic HTML generation from theories;
9010 * theory files no longer require "..." (quotes) around most types;
9012 * new examples, including two proofs of the Church-Rosser theorem;
9014 * non-curried (1994) version of HOL is no longer distributed;
9021 * greatly reduced space requirements;
9023 * theory files (.thy) no longer require \...\ escapes at line breaks;
9025 * searchable theorem database (see the section "Retrieving theorems" on
9026 page 8 of the Reference Manual);
9028 * new examples, including Grabczewski's monumental case study of the
9031 * The previous version of HOL renamed to Old_HOL;
9033 * The new version of HOL (previously called CHOL) uses a curried syntax
9034 for functions. Application looks like f a b instead of f(a,b);
9036 * Mutually recursive inductive definitions finally work in HOL;
9038 * In ZF, pattern-matching on tuples is now available in all abstractions and
9039 translates to the operator "split";
9046 * new infix operator, addss, allowing the classical reasoner to
9047 perform simplification at each step of its search. Example:
9048 fast_tac (cs addss ss)
9050 * a new logic, CHOL, the same as HOL, but with a curried syntax
9051 for functions. Application looks like f a b instead of f(a,b). Also pairs
9052 look like (a,b) instead of <a,b>;
9054 * PLEASE NOTE: CHOL will eventually replace HOL!
9056 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9057 It translates to the operator "split". A new theory of integers is available;
9059 * In ZF, integer numerals now denote two's-complement binary integers.
9060 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9062 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9063 of the Axiom of Choice;
9070 * Significantly faster resolution;
9072 * the different sections in a .thy file can now be mixed and repeated
9075 * Database of theorems for FOL, HOL and ZF. New
9076 commands including qed, qed_goal and bind_thm store theorems in the database.
9078 * Simple database queries: return a named theorem (get_thm) or all theorems of
9079 a given theory (thms_of), or find out what theory a theorem was proved in
9082 * Bugs fixed in the inductive definition and datatype packages;
9084 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9085 and HOL_dup_cs obsolete;
9087 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9090 * Simpler definition of function space in ZF;
9092 * new results about cardinal and ordinal arithmetic in ZF;
9094 * 'subtype' facility in HOL for introducing new types as subsets of existing
9097 :mode=text:wrap=hard:maxLineLen=72: