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 * Command 'definition' no longer exports the foundational "raw_def"
52 into the user context. Minor INCOMPATIBILITY, may use the regular
53 "def" result with attribute "abs_def" to imitate the old version.
55 * Attribute "abs_def" turns an equation of the form "f x y == t" into
56 "f == %x y. t", which ensures that "simp" or "unfold" steps always
57 expand it. This also works for object-logic equality. (Formerly
58 undocumented feature.)
60 * Discontinued old "prems" fact, which used to refer to the accidental
61 collection of foundational premises in the context (marked as legacy
64 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
65 instead. INCOMPATIBILITY.
67 * Ancient code generator for SML and its commands 'code_module',
68 'code_library', 'consts_code', 'types_code' have been discontinued.
69 Use commands of the generic code generator instead. INCOMPATIBILITY.
71 * Redundant attribute 'code_inline' has been discontinued. Use
72 'code_unfold' instead. INCOMPATIBILITY.
74 * Dropped attribute 'code_unfold_post' in favor of the its dual
75 'code_abbrev', which yields a common pattern in definitions like
77 definition [code_abbrev]: "f = t"
81 * Sort constraints are now propagated in simultaneous statements, just
82 like type constraints. INCOMPATIBILITY in rare situations, where
83 distinct sorts used to be assigned accidentally. For example:
85 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
87 lemma "P (x::'a)" and "Q (y::'a::bar)"
88 -- "now uniform 'a::bar instead of default sort for first occurence (!)"
93 * Type 'a set is now a proper type constructor (just as before
94 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
95 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
96 sets separate, it is often sufficient to rephrase sets S accidentally
97 used as predicates by "%x. x : S" and predicates P accidentally used
98 as sets by "{x. P x}". Corresponding proofs in a first step should be
99 pruned from any tinkering with former theorems mem_def and
100 Collect_def as far as possible.
101 For developments which deliberately mixed predicates and
102 sets, a planning step is necessary to determine what should become a
103 predicate and what a set. It can be helpful to carry out that step in
104 Isabelle2011-1 before jumping right into the current release.
106 * Code generation by default implements sets as container type rather
107 than predicates. INCOMPATIBILITY.
109 * New type synonym 'a rel = ('a * 'a) set
111 * More default pred/set conversions on a couple of relation operations
112 and predicates. Consolidation of some relation theorems:
114 converse_def ~> converse_unfold
115 rel_comp_def ~> rel_comp_unfold
116 symp_def ~> (dropped, use symp_def and sym_def instead)
117 transp_def ~> transp_trans
118 Domain_def ~> Domain_unfold
119 Range_def ~> Domain_converse [symmetric]
123 * Consolidated various theorem names relating to Finite_Set.fold
126 inf_INFI_fold_inf ~> inf_INF_fold_inf
127 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
128 INFI_fold_inf ~> INF_fold_inf
129 SUPR_fold_sup ~> SUP_fold_sup
130 union_set ~> union_set_fold
131 minus_set ~> minus_set_fold
135 * Consolidated theorem names concerning fold combinators:
137 INFI_set_fold ~> INF_set_fold
138 SUPR_set_fold ~> SUP_set_fold
139 INF_code ~> INF_set_foldr
140 SUP_code ~> SUP_set_foldr
141 foldr.simps ~> foldr_Nil foldr_Cons (in point-free formulation)
142 foldl.simps ~> foldl_Nil foldl_Cons
143 foldr_fold_rev ~> foldr_def
144 foldl_fold ~> foldl_def
148 * Dropped rarely useful theorems concerning fold combinators:
149 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
150 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
151 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
152 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
153 listsum_conv_fold, listsum_foldl, sort_foldl_insort. INCOMPATIBILITY.
154 Prefer "List.fold" with canonical argument order, or boil down
155 "List.foldr" and "List.foldl" to "List.fold" by unfolding "foldr_def"
156 and "foldl_def". For the common phrases "%xs. List.foldr plus xs 0"
157 and "List.foldl plus 0", prefer "List.listsum".
159 * Congruence rules Option.map_cong and Option.bind_cong for recursion
160 through option types.
162 * Concrete syntax for case expressions includes constraints for source
163 positions, and thus produces Prover IDE markup for its bindings.
164 INCOMPATIBILITY for old-style syntax translations that augment the
165 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
168 * Discontinued configuration option "syntax_positions": atomic terms
169 in parse trees are always annotated by position constraints.
171 * Finite_Set.fold now qualified. INCOMPATIBILITY.
173 * Renamed some facts on canonical fold on lists, in order to avoid
174 problems with interpretation involving corresponding facts on foldl
175 with the same base names:
177 fold_set_remdups ~> fold_set_fold_remdups
178 fold_set ~> fold_set_fold
179 fold1_set ~> fold1_set_fold
183 * Renamed facts about the power operation on relations, i.e., relpow
184 to match the constant's name:
186 rel_pow_1 ~> relpow_1
187 rel_pow_0_I ~> relpow_0_I
188 rel_pow_Suc_I ~> relpow_Suc_I
189 rel_pow_Suc_I2 ~> relpow_Suc_I2
190 rel_pow_0_E ~> relpow_0_E
191 rel_pow_Suc_E ~> relpow_Suc_E
192 rel_pow_E ~> relpow_E
193 rel_pow_Suc_D2 ~> relpow_Suc_D2
194 rel_pow_Suc_E2 ~> relpow_Suc_E2
195 rel_pow_Suc_D2' ~> relpow_Suc_D2'
196 rel_pow_E2 ~> relpow_E2
197 rel_pow_add ~> relpow_add
198 rel_pow_commute ~> relpow
199 rel_pow_empty ~> relpow_empty:
200 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
201 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
202 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
203 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
204 rel_pow_fun_conv ~> relpow_fun_conv
205 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
206 rel_pow_finite_bounded ~> relpow_finite_bounded
207 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
208 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
209 single_valued_rel_pow ~> single_valued_relpow
213 * New theory HOL/Library/DAList provides an abstract type for association
214 lists with distinct keys.
216 * 'datatype' specifications allow explicit sort constraints.
218 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
219 use theory HOL/Library/Nat_Bijection instead.
221 * Session HOL-Word: Discontinued many redundant theorems specific to
222 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
225 word_sub_alt ~> word_sub_wi
226 word_add_alt ~> word_add_def
227 word_mult_alt ~> word_mult_def
228 word_minus_alt ~> word_minus_def
229 word_0_alt ~> word_0_wi
230 word_1_alt ~> word_1_wi
231 word_add_0 ~> add_0_left
232 word_add_0_right ~> add_0_right
233 word_mult_1 ~> mult_1_left
234 word_mult_1_right ~> mult_1_right
235 word_add_commute ~> add_commute
236 word_add_assoc ~> add_assoc
237 word_add_left_commute ~> add_left_commute
238 word_mult_commute ~> mult_commute
239 word_mult_assoc ~> mult_assoc
240 word_mult_left_commute ~> mult_left_commute
241 word_left_distrib ~> left_distrib
242 word_right_distrib ~> right_distrib
243 word_left_minus ~> left_minus
244 word_diff_0_right ~> diff_0_right
245 word_diff_self ~> diff_self
246 word_sub_def ~> diff_minus
247 word_diff_minus ~> diff_minus
248 word_add_ac ~> add_ac
249 word_mult_ac ~> mult_ac
250 word_plus_ac0 ~> add_0_left add_0_right add_ac
251 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
252 word_order_trans ~> order_trans
253 word_order_refl ~> order_refl
254 word_order_antisym ~> order_antisym
255 word_order_linear ~> linorder_linear
256 lenw1_zero_neq_one ~> zero_neq_one
257 word_number_of_eq ~> number_of_eq
258 word_of_int_add_hom ~> wi_hom_add
259 word_of_int_sub_hom ~> wi_hom_sub
260 word_of_int_mult_hom ~> wi_hom_mult
261 word_of_int_minus_hom ~> wi_hom_neg
262 word_of_int_succ_hom ~> wi_hom_succ
263 word_of_int_pred_hom ~> wi_hom_pred
264 word_of_int_0_hom ~> word_0_wi
265 word_of_int_1_hom ~> word_1_wi
267 * Clarified attribute "mono_set": pure declaration without modifying
268 the result of the fact expression.
270 * "Transitive_Closure.ntrancl": bounded transitive closure on
273 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
275 * "sublists" moved to theory More_List. INCOMPATIBILITY.
277 * Theory Int: Discontinued many legacy theorems specific to type int.
278 INCOMPATIBILITY, use the corresponding generic theorems instead.
280 zminus_zminus ~> minus_minus
281 zminus_0 ~> minus_zero
282 zminus_zadd_distrib ~> minus_add_distrib
283 zadd_commute ~> add_commute
284 zadd_assoc ~> add_assoc
285 zadd_left_commute ~> add_left_commute
289 zadd_0_right ~> add_0_right
290 zadd_zminus_inverse2 ~> left_minus
291 zmult_zminus ~> mult_minus_left
292 zmult_commute ~> mult_commute
293 zmult_assoc ~> mult_assoc
294 zadd_zmult_distrib ~> left_distrib
295 zadd_zmult_distrib2 ~> right_distrib
296 zdiff_zmult_distrib ~> left_diff_distrib
297 zdiff_zmult_distrib2 ~> right_diff_distrib
298 zmult_1 ~> mult_1_left
299 zmult_1_right ~> mult_1_right
300 zle_refl ~> order_refl
301 zle_trans ~> order_trans
302 zle_antisym ~> order_antisym
303 zle_linear ~> linorder_linear
304 zless_linear ~> linorder_less_linear
305 zadd_left_mono ~> add_left_mono
306 zadd_strict_right_mono ~> add_strict_right_mono
307 zadd_zless_mono ~> add_less_le_mono
308 int_0_less_1 ~> zero_less_one
309 int_0_neq_1 ~> zero_neq_one
311 zpower_zadd_distrib ~> power_add
312 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
313 zero_le_zpower_abs ~> zero_le_power_abs
315 * Theory Deriv: Renamed
317 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
319 * New "case_product" attribute to generate a case rule doing multiple
320 case distinctions at the same time. E.g.
322 list.exhaust [case_product nat.exhaust]
324 produces a rule which can be used to perform case distinction on both
327 * Improved code generation of multisets.
329 * New diagnostic command find_unused_assms to find potentially superfluous
330 assumptions in theorems using Quickcheck.
333 - Quickcheck returns variable assignments as counterexamples, which
334 allows to reveal the underspecification of functions under test.
335 For example, refuting "hd xs = x", it presents the variable
336 assignment xs = [] and x = a1 as a counterexample, assuming that
337 any property is false whenever "hd []" occurs in it.
338 These counterexample are marked as potentially spurious, as
339 Quickcheck also returns "xs = []" as a counterexample to the
340 obvious theorem "hd xs = hd xs".
341 After finding a potentially spurious counterexample, Quickcheck
342 continues searching for genuine ones.
343 By default, Quickcheck shows potentially spurious and genuine
344 counterexamples. The option "genuine_only" sets quickcheck to
345 only show genuine counterexamples.
347 - The command 'quickcheck_generator' creates random and exhaustive
348 value generators for a given type and operations.
349 It generates values by using the operations as if they were
350 constructors of that type.
352 - Support for multisets.
354 - Added "use_subtype" options.
357 - Fixed infinite loop caused by the 'peephole_optim' option and
358 affecting 'rat' and 'real'.
361 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
362 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
363 - Renamed "sound" option to "strict".
366 - Added possibility to specify lambda translations scheme as a
367 parenthesized argument (e.g., "by (metis (lifting) ...)").
370 - Renamed from 'try_methods'. INCOMPATIBILITY.
372 * New "eventually_elim" method as a generalized variant of the
373 eventually_elim* rules. Supports structured proofs.
378 * New "case_product" attribute (see HOL).
383 * Antiquotation @{keyword "name"} produces a parser for outer syntax
384 from a minor keyword introduced via theory header declaration.
386 * Antiquotation @{command_spec "name"} produces the
387 Outer_Syntax.command_spec from a major keyword introduced via theory
388 header declaration; it can be passed to Outer_Syntax.command etc.
390 * Local_Theory.define no longer hard-wires default theorem name
391 "foo_def": definitional packages need to make this explicit, and may
392 choose to omit theorem bindings for definitions by using
393 Binding.empty/Attrib.empty_binding. Potential INCOMPATIBILITY for
394 derived definitional packages.
396 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
397 conformance with similar operations in structure Term and Logic.
399 * Antiquotation @{attributes [...]} embeds attribute source
400 representation into the ML text, which is particularly useful with
401 declarations like Local_Theory.note.
403 * Structure Proof_Context follows standard naming scheme. Old
404 ProofContext has been discontinued. INCOMPATIBILITY.
406 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
407 change of semantics: update is applied to auxiliary local theory
410 * Modernized some old-style infix operations:
412 addeqcongs ~> Simplifier.add_eqcong
413 deleqcongs ~> Simplifier.del_eqcong
414 addcongs ~> Simplifier.add_cong
415 delcongs ~> Simplifier.del_cong
416 setmksimps ~> Simplifier.set_mksimps
417 setmkcong ~> Simplifier.set_mkcong
418 setmksym ~> Simplifier.set_mksym
419 setmkeqTrue ~> Simplifier.set_mkeqTrue
420 settermless ~> Simplifier.set_termless
421 setsubgoaler ~> Simplifier.set_subgoaler
422 addsplits ~> Splitter.add_split
423 delsplits ~> Splitter.del_split
427 New in Isabelle2011-1 (October 2011)
428 ------------------------------------
432 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
433 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
435 - Management of multiple theory files directly from the editor
436 buffer store -- bypassing the file-system (no requirement to save
439 - Markup of formal entities within the text buffer, with semantic
440 highlighting, tooltips and hyperlinks to jump to defining source
443 - Improved text rendering, with sub/superscripts in the source
444 buffer (including support for copy/paste wrt. output panel, HTML
445 theory output and other non-Isabelle text boxes).
447 - Refined scheduling of proof checking and printing of results,
448 based on interactive editor view. (Note: jEdit folding and
449 narrowing allows to restrict buffer perspectives explicitly.)
451 - Reduced CPU performance requirements, usable on machines with few
454 - Reduced memory requirements due to pruning of unused document
455 versions (garbage collection).
457 See also ~~/src/Tools/jEdit/README.html for further information,
458 including some remaining limitations.
460 * Theory loader: source files are exclusively located via the master
461 directory of each theory node (where the .thy file itself resides).
462 The global load path (such as src/HOL/Library) has been discontinued.
463 Note that the path element ~~ may be used to reference theories in the
464 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
467 * Theory loader: source files are identified by content via SHA1
468 digests. Discontinued former path/modtime identification and optional
469 ISABELLE_FILE_IDENT plugin scripts.
471 * Parallelization of nested Isar proofs is subject to
472 Goal.parallel_proofs_threshold (default 100). See also isabelle
475 * Name space: former unsynchronized references are now proper
476 configuration options, with more conventional names:
478 long_names ~> names_long
479 short_names ~> names_short
480 unique_names ~> names_unique
482 Minor INCOMPATIBILITY, need to declare options in context like this:
484 declare [[names_unique = false]]
486 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
487 that the result needs to be unique, which means fact specifications
488 may have to be refined after enriching a proof context.
490 * Attribute "case_names" has been refined: the assumptions in each case
491 can be named now by following the case name with [name1 name2 ...].
493 * Isabelle/Isar reference manual has been updated and extended:
494 - "Synopsis" provides a catalog of main Isar language concepts.
495 - Formal references in syntax diagrams, via @{rail} antiquotation.
496 - Updated material from classic "ref" manual, notably about
497 "Classical Reasoner".
502 * Class bot and top require underlying partial order rather than
503 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
505 * Class complete_lattice: generalized a couple of lemmas from sets;
506 generalized theorems INF_cong and SUP_cong. New type classes for
507 complete boolean algebras and complete linear orders. Lemmas
508 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
509 class complete_linorder.
511 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
512 Sup_fun_def, Inf_apply, Sup_apply.
514 Removed redundant lemmas (the right hand side gives hints how to
515 replace them for (metis ...), or (simp only: ...) proofs):
517 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
518 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
519 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
520 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
521 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
522 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
523 Inter_def ~> INF_def, image_def
524 Union_def ~> SUP_def, image_def
525 INT_eq ~> INF_def, and image_def
526 UN_eq ~> SUP_def, and image_def
527 INF_subset ~> INF_superset_mono [OF _ order_refl]
529 More consistent and comprehensive names:
531 INTER_eq_Inter_image ~> INF_def
532 UNION_eq_Union_image ~> SUP_def
536 INF_leI2 ~> INF_lower2
537 le_INFI ~> INF_greatest
539 le_SUPI2 ~> SUP_upper2
541 INFI_bool_eq ~> INF_bool_eq
542 SUPR_bool_eq ~> SUP_bool_eq
543 INFI_apply ~> INF_apply
544 SUPR_apply ~> SUP_apply
545 INTER_def ~> INTER_eq
546 UNION_def ~> UNION_eq
550 * Renamed theory Complete_Lattice to Complete_Lattices.
553 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
554 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
555 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
556 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
558 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
559 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
560 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
563 * Added syntactic classes "inf" and "sup" for the respective
564 constants. INCOMPATIBILITY: Changes in the argument order of the
565 (mostly internal) locale predicates for some derived classes.
567 * Theorem collections ball_simps and bex_simps do not contain theorems
568 referring to UNION any longer; these have been moved to collection
569 UN_ball_bex_simps. INCOMPATIBILITY.
571 * Theory Archimedean_Field: floor now is defined as parameter of a
572 separate type class floor_ceiling.
574 * Theory Finite_Set: more coherent development of fold_set locales:
576 locale fun_left_comm ~> locale comp_fun_commute
577 locale fun_left_comm_idem ~> locale comp_fun_idem
579 Both use point-free characterization; interpretation proofs may need
580 adjustment. INCOMPATIBILITY.
582 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
583 accordance with standard mathematical terminology. INCOMPATIBILITY.
585 * Theory Complex_Main: The locale interpretations for the
586 bounded_linear and bounded_bilinear locales have been removed, in
587 order to reduce the number of duplicate lemmas. Users must use the
588 original names for distributivity theorems, potential INCOMPATIBILITY.
590 divide.add ~> add_divide_distrib
591 divide.diff ~> diff_divide_distrib
592 divide.setsum ~> setsum_divide_distrib
593 mult.add_right ~> right_distrib
594 mult.diff_right ~> right_diff_distrib
595 mult_right.setsum ~> setsum_right_distrib
596 mult_left.diff ~> left_diff_distrib
598 * Theory Complex_Main: Several redundant theorems have been removed or
599 replaced by more general versions. INCOMPATIBILITY.
601 real_diff_def ~> minus_real_def
602 real_divide_def ~> divide_real_def
603 real_less_def ~> less_le
604 real_abs_def ~> abs_real_def
605 real_sgn_def ~> sgn_real_def
606 real_mult_commute ~> mult_commute
607 real_mult_assoc ~> mult_assoc
608 real_mult_1 ~> mult_1_left
609 real_add_mult_distrib ~> left_distrib
610 real_zero_not_eq_one ~> zero_neq_one
611 real_mult_inverse_left ~> left_inverse
612 INVERSE_ZERO ~> inverse_zero
613 real_le_refl ~> order_refl
614 real_le_antisym ~> order_antisym
615 real_le_trans ~> order_trans
616 real_le_linear ~> linear
617 real_le_eq_diff ~> le_iff_diff_le_0
618 real_add_left_mono ~> add_left_mono
619 real_mult_order ~> mult_pos_pos
620 real_mult_less_mono2 ~> mult_strict_left_mono
621 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
622 real_0_le_divide_iff ~> zero_le_divide_iff
623 realpow_two_disj ~> power2_eq_iff
624 real_squared_diff_one_factored ~> square_diff_one_factored
625 realpow_two_diff ~> square_diff_square_factored
626 reals_complete2 ~> complete_real
627 real_sum_squared_expand ~> power2_sum
628 exp_ln_eq ~> ln_unique
630 expi_zero ~> exp_zero
631 lemma_DERIV_subst ~> DERIV_cong
632 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
633 LIMSEQ_const ~> tendsto_const
634 LIMSEQ_norm ~> tendsto_norm
635 LIMSEQ_add ~> tendsto_add
636 LIMSEQ_minus ~> tendsto_minus
637 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
638 LIMSEQ_diff ~> tendsto_diff
639 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
640 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
641 LIMSEQ_mult ~> tendsto_mult
642 LIMSEQ_inverse ~> tendsto_inverse
643 LIMSEQ_divide ~> tendsto_divide
644 LIMSEQ_pow ~> tendsto_power
645 LIMSEQ_setsum ~> tendsto_setsum
646 LIMSEQ_setprod ~> tendsto_setprod
647 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
648 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
649 LIMSEQ_imp_rabs ~> tendsto_rabs
650 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
651 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
652 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
653 LIMSEQ_Complex ~> tendsto_Complex
654 LIM_ident ~> tendsto_ident_at
655 LIM_const ~> tendsto_const
656 LIM_add ~> tendsto_add
657 LIM_add_zero ~> tendsto_add_zero
658 LIM_minus ~> tendsto_minus
659 LIM_diff ~> tendsto_diff
660 LIM_norm ~> tendsto_norm
661 LIM_norm_zero ~> tendsto_norm_zero
662 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
663 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
664 LIM_rabs ~> tendsto_rabs
665 LIM_rabs_zero ~> tendsto_rabs_zero
666 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
667 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
668 LIM_compose ~> tendsto_compose
669 LIM_mult ~> tendsto_mult
670 LIM_scaleR ~> tendsto_scaleR
671 LIM_of_real ~> tendsto_of_real
672 LIM_power ~> tendsto_power
673 LIM_inverse ~> tendsto_inverse
674 LIM_sgn ~> tendsto_sgn
675 isCont_LIM_compose ~> isCont_tendsto_compose
676 bounded_linear.LIM ~> bounded_linear.tendsto
677 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
678 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
679 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
680 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
681 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
682 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
684 * Theory Complex_Main: The definition of infinite series was
685 generalized. Now it is defined on the type class {topological_space,
686 comm_monoid_add}. Hence it is useable also for extended real numbers.
688 * Theory Complex_Main: The complex exponential function "expi" is now
689 a type-constrained abbreviation for "exp :: complex => complex"; thus
690 several polymorphic lemmas about "exp" are now applicable to "expi".
694 - Theory Library/Code_Char_ord provides native ordering of
695 characters in the target language.
697 - Commands code_module and code_library are legacy, use export_code
700 - Method "evaluation" is legacy, use method "eval" instead.
702 - Legacy evaluator "SML" is deactivated by default. May be
703 reactivated by the following theory command:
705 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
707 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
709 * New proof method "induction" that gives induction hypotheses the
710 name "IH", thus distinguishing them from further hypotheses that come
711 from rule induction. The latter are still called "hyps". Method
712 "induction" is a thin wrapper around "induct" and follows the same
715 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
716 still available as a legacy feature for some time.
719 - Added "need" and "total_consts" options.
720 - Reintroduced "show_skolems" option by popular demand.
721 - Renamed attribute: nitpick_def ~> nitpick_unfold.
725 - Use quasi-sound (and efficient) translations by default.
726 - Added support for the following provers: E-ToFoF, LEO-II,
727 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
728 - Automatically preplay and minimize proofs before showing them if
729 this can be done within reasonable time.
730 - sledgehammer available_provers ~> sledgehammer supported_provers.
732 - Added "preplay_timeout", "slicing", "type_enc", "sound",
733 "max_mono_iters", and "max_new_mono_instances" options.
734 - Removed "explicit_apply" and "full_types" options as well as "Full
735 Types" Proof General menu item. INCOMPATIBILITY.
738 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
739 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
743 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
744 "elim:" options. INCOMPATIBILITY.
745 - Introduced 'try' that not only runs 'try_methods' but also
746 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
749 - Added "eval" option to evaluate terms for the found counterexample
750 (currently only supported by the default (exhaustive) tester).
751 - Added post-processing of terms to obtain readable counterexamples
752 (currently only supported by the default (exhaustive) tester).
753 - New counterexample generator quickcheck[narrowing] enables
754 narrowing-based testing. Requires the Glasgow Haskell compiler
755 with its installation location defined in the Isabelle settings
756 environment as ISABELLE_GHC.
757 - Removed quickcheck tester "SML" based on the SML code generator
758 (formly in HOL/Library).
760 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
761 use 'partial_function' instead.
763 * Theory Library/Extended_Reals replaces now the positive extended
764 reals found in probability theory. This file is extended by
765 Multivariate_Analysis/Extended_Real_Limits.
767 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
768 from where it must be imported explicitly if it is really required.
771 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
772 been moved here. INCOMPATIBILITY.
774 * Theory Library/Saturated provides type of numbers with saturated
777 * Theory Library/Product_Lattice defines a pointwise ordering for the
778 product type 'a * 'b, and provides instance proofs for various order
779 and lattice type classes.
781 * Theory Library/Countable now provides the "countable_datatype" proof
782 method for proving "countable" class instances for datatypes.
784 * Theory Library/Cset_Monad allows do notation for computable sets
785 (cset) via the generic monad ad-hoc overloading facility.
787 * Library: Theories of common data structures are split into theories
788 for implementation, an invariant-ensuring type, and connection to an
789 abstract type. INCOMPATIBILITY.
791 - RBT is split into RBT and RBT_Mapping.
792 - AssocList is split and renamed into AList and AList_Mapping.
793 - DList is split into DList_Impl, DList, and DList_Cset.
794 - Cset is split into Cset and List_Cset.
796 * Theory Library/Nat_Infinity has been renamed to
797 Library/Extended_Nat, with name changes of the following types and
800 type inat ~> type enat
802 Infty ~> infinity (overloaded)
806 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
807 been renamed accordingly. INCOMPATIBILITY.
809 * Session Multivariate_Analysis: The euclidean_space type class now
810 fixes a constant "Basis :: 'a set" consisting of the standard
811 orthonormal basis for the type. Users now have the option of
812 quantifying over this set instead of using the "basis" function, e.g.
813 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
815 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
816 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
817 "Cart_nth" and "Cart_lambda" have been respectively renamed to
818 "vec_nth" and "vec_lambda"; theorems mentioning those names have
819 changed to match. Definition theorems for overloaded constants now use
820 the standard "foo_vec_def" naming scheme. A few other theorems have
821 been renamed as follows (INCOMPATIBILITY):
823 Cart_eq ~> vec_eq_iff
824 dist_nth_le_cart ~> dist_vec_nth_le
825 tendsto_vector ~> vec_tendstoI
826 Cauchy_vector ~> vec_CauchyI
828 * Session Multivariate_Analysis: Several duplicate theorems have been
829 removed, and other theorems have been renamed or replaced with more
830 general versions. INCOMPATIBILITY.
832 finite_choice ~> finite_set_choice
833 eventually_conjI ~> eventually_conj
834 eventually_and ~> eventually_conj_iff
835 eventually_false ~> eventually_False
836 setsum_norm ~> norm_setsum
837 Lim_sequentially ~> LIMSEQ_def
838 Lim_ident_at ~> LIM_ident
839 Lim_const ~> tendsto_const
840 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
841 Lim_neg ~> tendsto_minus
842 Lim_add ~> tendsto_add
843 Lim_sub ~> tendsto_diff
844 Lim_mul ~> tendsto_scaleR
845 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
846 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
847 Lim_linear ~> bounded_linear.tendsto
848 Lim_component ~> tendsto_euclidean_component
849 Lim_component_cart ~> tendsto_vec_nth
850 Lim_inner ~> tendsto_inner [OF tendsto_const]
851 dot_lsum ~> inner_setsum_left
852 dot_rsum ~> inner_setsum_right
853 continuous_cmul ~> continuous_scaleR [OF continuous_const]
854 continuous_neg ~> continuous_minus
855 continuous_sub ~> continuous_diff
856 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
857 continuous_mul ~> continuous_scaleR
858 continuous_inv ~> continuous_inverse
859 continuous_at_within_inv ~> continuous_at_within_inverse
860 continuous_at_inv ~> continuous_at_inverse
861 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
862 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
863 continuous_at_component ~> continuous_component [OF continuous_at_id]
864 continuous_on_neg ~> continuous_on_minus
865 continuous_on_sub ~> continuous_on_diff
866 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
867 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
868 continuous_on_mul ~> continuous_on_scaleR
869 continuous_on_mul_real ~> continuous_on_mult
870 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
871 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
872 continuous_on_inverse ~> continuous_on_inv
873 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
874 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
875 subset_interior ~> interior_mono
876 subset_closure ~> closure_mono
877 closure_univ ~> closure_UNIV
878 real_arch_lt ~> reals_Archimedean2
879 real_arch ~> reals_Archimedean3
880 real_abs_norm ~> abs_norm_cancel
881 real_abs_sub_norm ~> norm_triangle_ineq3
882 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
884 * Session HOL-Probability:
885 - Caratheodory's extension lemma is now proved for ring_of_sets.
886 - Infinite products of probability measures are now available.
887 - Sigma closure is independent, if the generator is independent
888 - Use extended reals instead of positive extended
889 reals. INCOMPATIBILITY.
891 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
893 expand_fun_below ~> fun_below_iff
894 below_fun_ext ~> fun_belowI
895 expand_cfun_eq ~> cfun_eq_iff
897 expand_cfun_below ~> cfun_below_iff
898 below_cfun_ext ~> cfun_belowI
899 monofun_fun_fun ~> fun_belowD
900 monofun_fun_arg ~> monofunE
901 monofun_lub_fun ~> adm_monofun [THEN admD]
902 cont_lub_fun ~> adm_cont [THEN admD]
903 cont2cont_Rep_CFun ~> cont2cont_APP
904 cont_Rep_CFun_app ~> cont_APP_app
905 cont_Rep_CFun_app_app ~> cont_APP_app_app
906 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
907 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
908 contlub_cfun ~> lub_APP [symmetric]
909 contlub_LAM ~> lub_LAM [symmetric]
912 lift_distinct1 ~> lift.distinct(1)
913 lift_distinct2 ~> lift.distinct(2)
914 Def_not_UU ~> lift.distinct(2)
915 Def_inject ~> lift.inject
916 below_UU_iff ~> below_bottom_iff
917 eq_UU_iff ~> eq_bottom_iff
920 *** Document preparation ***
922 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
923 isar-ref manual, both for description and actual application of the
926 * Antiquotation @{value} evaluates the given term and presents its
929 * Antiquotations: term style "isub" provides ad-hoc conversion of
930 variables x1, y23 into subscripted form x\<^isub>1,
933 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
934 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
936 * Localized \isabellestyle switch can be used within blocks or groups
939 \isabellestyle{it} %preferred default
940 {\isabellestylett @{text "typewriter stuff"}}
942 * Discontinued special treatment of hard tabulators. Implicit
943 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
949 * The inner syntax of sort/type/term/prop supports inlined YXML
950 representations within quoted string tokens. By encoding logical
951 entities via Term_XML (in ML or Scala) concrete syntax can be
952 bypassed, which is particularly useful for producing bits of text
953 under external program control.
955 * Antiquotations for ML and document preparation are managed as theory
956 data, which requires explicit setup.
958 * Isabelle_Process.is_active allows tools to check if the official
959 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
960 (better known as Proof General).
962 * Structure Proof_Context follows standard naming scheme. Old
963 ProofContext is still available for some time as legacy alias.
965 * Structure Timing provides various operations for timing; supersedes
966 former start_timing/end_timing etc.
968 * Path.print is the official way to show file-system paths to users
969 (including quotes etc.).
971 * Inner syntax: identifiers in parse trees of generic categories
972 "logic", "aprop", "idt" etc. carry position information (disguised as
973 type constraints). Occasional INCOMPATIBILITY with non-compliant
974 translations that choke on unexpected type constraints. Positions can
975 be stripped in ML translations via Syntax.strip_positions /
976 Syntax.strip_positions_ast, or via the syntax constant
977 "_strip_positions" within parse trees. As last resort, positions can
978 be disabled via the configuration option Syntax.positions, which is
979 called "syntax_positions" in Isar attribute syntax.
981 * Discontinued special status of various ML structures that contribute
982 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
983 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
984 refer directly to Ast.Constant, Lexicon.is_identifier,
985 Syntax_Trans.mk_binder_tr etc.
987 * Typed print translation: discontinued show_sorts argument, which is
988 already available via context of "advanced" translation.
990 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
991 goal states; body tactic needs to address all subgoals uniformly.
993 * Slightly more special eq_list/eq_set, with shortcut involving
994 pointer equality (assumes that eq relation is reflexive).
996 * Classical tactics use proper Proof.context instead of historic types
997 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
998 operate directly on Proof.context. Raw type claset retains its use as
999 snapshot of the classical context, which can be recovered via
1000 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1001 INCOMPATIBILITY, classical tactics and derived proof methods require
1002 proper Proof.context.
1007 * Discontinued support for Poly/ML 5.2, which was the last version
1008 without proper multithreading and TimeLimit implementation.
1010 * Discontinued old lib/scripts/polyml-platform, which has been
1011 obsolete since Isabelle2009-2.
1013 * Various optional external tools are referenced more robustly and
1014 uniformly by explicit Isabelle settings as follows:
1016 ISABELLE_CSDP (formerly CSDP_EXE)
1017 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1018 ISABELLE_OCAML (formerly EXEC_OCAML)
1019 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1020 ISABELLE_YAP (formerly EXEC_YAP)
1022 Note that automated detection from the file-system or search path has
1023 been discontinued. INCOMPATIBILITY.
1025 * Scala layer provides JVM method invocation service for static
1026 methods of type (String)String, see Invoke_Scala.method in ML. For
1029 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1031 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1032 this allows to pass structured values between ML and Scala.
1034 * The IsabelleText fonts includes some further glyphs to support the
1035 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1036 installed a local copy (which is normally *not* required) need to
1037 delete or update it from ~~/lib/fonts/.
1041 New in Isabelle2011 (January 2011)
1042 ----------------------------------
1046 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1047 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1048 useful tooltips and hyperlinks produced from its static analysis. The
1049 bundled component provides an executable Isabelle tool that can be run
1052 Isabelle2011/bin/isabelle jedit
1054 * Significantly improved Isabelle/Isar implementation manual.
1056 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1057 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1058 while the default heap location within that directory lacks that extra
1059 suffix. This isolates multiple Isabelle installations from each
1060 other, avoiding problems with old settings in new versions.
1061 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1063 * Source files are always encoded as UTF-8, instead of old-fashioned
1064 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1065 the following package declarations:
1067 \usepackage[utf8]{inputenc}
1068 \usepackage{textcomp}
1070 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1071 a Unicode character is treated as a single symbol, not a sequence of
1072 non-ASCII bytes as before. Since Isabelle/ML string literals may
1073 contain symbols without further backslash escapes, Unicode can now be
1074 used here as well. Recall that Symbol.explode in ML provides a
1075 consistent view on symbols, while raw explode (or String.explode)
1076 merely give a byte-oriented representation.
1078 * Theory loader: source files are primarily located via the master
1079 directory of each theory node (where the .thy file itself resides).
1080 The global load path is still partially available as legacy feature.
1081 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1082 explicit paths, relatively to the theory.
1084 * Special treatment of ML file names has been discontinued.
1085 Historically, optional extensions .ML or .sml were added on demand --
1086 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1087 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1089 * Various options that affect pretty printing etc. are now properly
1090 handled within the context via configuration options, instead of
1091 unsynchronized references or print modes. There are both ML Config.T
1092 entities and Isar declaration attributes to access these.
1094 ML (Config.T) Isar (attribute)
1096 eta_contract eta_contract
1097 show_brackets show_brackets
1098 show_sorts show_sorts
1099 show_types show_types
1100 show_question_marks show_question_marks
1101 show_consts show_consts
1102 show_abbrevs show_abbrevs
1104 Syntax.ast_trace syntax_ast_trace
1105 Syntax.ast_stat syntax_ast_stat
1106 Syntax.ambiguity_level syntax_ambiguity_level
1108 Goal_Display.goals_limit goals_limit
1109 Goal_Display.show_main_goal show_main_goal
1111 Method.rule_trace rule_trace
1113 Thy_Output.display thy_output_display
1114 Thy_Output.quotes thy_output_quotes
1115 Thy_Output.indent thy_output_indent
1116 Thy_Output.source thy_output_source
1117 Thy_Output.break thy_output_break
1119 Note that corresponding "..._default" references in ML may only be
1120 changed globally at the ROOT session setup, but *not* within a theory.
1121 The option "show_abbrevs" supersedes the former print mode
1122 "no_abbrevs" with inverted meaning.
1124 * More systematic naming of some configuration options.
1127 trace_simp ~> simp_trace
1128 debug_simp ~> simp_debug
1130 * Support for real valued configuration options, using simplistic
1131 floating-point notation that coincides with the inner syntax for
1134 * Support for real valued preferences (with approximative PGIP type):
1135 front-ends need to accept "pgint" values in float notation.
1138 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1141 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1146 * Command 'type_synonym' (with single argument) replaces somewhat
1147 outdated 'types', which is still available as legacy feature for some
1150 * Command 'nonterminal' (with 'and' separated list of arguments)
1151 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1153 * Command 'notepad' replaces former 'example_proof' for
1154 experimentation in Isar without any result. INCOMPATIBILITY.
1156 * Locale interpretation commands 'interpret' and 'sublocale' accept
1157 lists of equations to map definitions in a locale to appropriate
1158 entities in the context of the interpretation. The 'interpretation'
1159 command already provided this functionality.
1161 * Diagnostic command 'print_dependencies' prints the locale instances
1162 that would be activated if the specified expression was interpreted in
1163 the current context. Variant "print_dependencies!" assumes a context
1164 without interpretations.
1166 * Diagnostic command 'print_interps' prints interpretations in proofs
1167 in addition to interpretations in theories.
1169 * Discontinued obsolete 'global' and 'local' commands to manipulate
1170 the theory name space. Rare INCOMPATIBILITY. The ML functions
1171 Sign.root_path and Sign.local_path may be applied directly where this
1172 feature is still required for historical reasons.
1174 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1175 'definition' instead.
1177 * The "prems" fact, which refers to the accidental collection of
1178 foundational premises in the context, is now explicitly marked as
1179 legacy feature and will be discontinued soon. Consider using "assms"
1180 of the head statement or reference facts by explicit names.
1182 * Document antiquotations @{class} and @{type} print classes and type
1185 * Document antiquotation @{file} checks file/directory entries within
1186 the local file system.
1191 * Coercive subtyping: functions can be declared as coercions and type
1192 inference will add them as necessary upon input of a term. Theory
1193 Complex_Main declares real :: nat => real and real :: int => real as
1194 coercions. A coercion function f is declared like this:
1196 declare [[coercion f]]
1198 To lift coercions through type constructors (e.g. from nat => real to
1199 nat list => real list), map functions can be declared, e.g.
1201 declare [[coercion_map map]]
1203 Currently coercion inference is activated only in theories including
1204 real numbers, i.e. descendants of Complex_Main. This is controlled by
1205 the configuration option "coercion_enabled", e.g. it can be enabled in
1206 other theories like this:
1208 declare [[coercion_enabled]]
1210 * Command 'partial_function' provides basic support for recursive
1211 function definitions over complete partial orders. Concrete instances
1212 are provided for i) the option type, ii) tail recursion on arbitrary
1213 types, and iii) the heap monad of Imperative_HOL. See
1214 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1217 * Function package: f.psimps rules are no longer implicitly declared
1218 as [simp]. INCOMPATIBILITY.
1220 * Datatype package: theorems generated for executable equality (class
1221 "eq") carry proper names and are treated as default code equations.
1223 * Inductive package: now offers command 'inductive_simps' to
1224 automatically derive instantiated and simplified equations for
1225 inductive predicates, similar to 'inductive_cases'.
1227 * Command 'enriched_type' allows to register properties of the
1228 functorial structure of types.
1230 * Improved infrastructure for term evaluation using code generator
1231 techniques, in particular static evaluation conversions.
1233 * Code generator: Scala (2.8 or higher) has been added to the target
1236 * Code generator: globbing constant expressions "*" and "Theory.*"
1237 have been replaced by the more idiomatic "_" and "Theory._".
1240 * Code generator: export_code without explicit file declaration prints
1241 to standard output. INCOMPATIBILITY.
1243 * Code generator: do not print function definitions for case
1244 combinators any longer.
1246 * Code generator: simplification with rules determined with
1247 src/Tools/Code/code_simp.ML and method "code_simp".
1249 * Code generator for records: more idiomatic representation of record
1250 types. Warning: records are not covered by ancient SML code
1251 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1252 rep_datatype declaration helps to succeed then:
1256 rep_datatype foo_ext ...
1258 * Records: logical foundation type for records does not carry a
1259 '_type' suffix any longer (obsolete due to authentic syntax).
1262 * Quickcheck now by default uses exhaustive testing instead of random
1263 testing. Random testing can be invoked by "quickcheck [random]",
1264 exhaustive testing by "quickcheck [exhaustive]".
1266 * Quickcheck instantiates polymorphic types with small finite
1267 datatypes by default. This enables a simple execution mechanism to
1268 handle quantifiers and function equality over the finite datatypes.
1270 * Quickcheck random generator has been renamed from "code" to
1271 "random". INCOMPATIBILITY.
1273 * Quickcheck now has a configurable time limit which is set to 30
1274 seconds by default. This can be changed by adding [timeout = n] to the
1275 quickcheck command. The time limit for Auto Quickcheck is still set
1278 * Quickcheck in locales considers interpretations of that locale for
1279 counter example search.
1282 - Added "smt" and "remote_smt" provers based on the "smt" proof
1283 method. See the Sledgehammer manual for details ("isabelle doc
1286 sledgehammer atp_info ~> sledgehammer running_provers
1287 sledgehammer atp_kill ~> sledgehammer kill_provers
1288 sledgehammer available_atps ~> sledgehammer available_provers
1291 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1292 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1293 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1294 (and "ms" and "min" are no longer supported)
1299 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1300 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1302 - Added support for partial quotient types.
1303 - Added local versions of the "Nitpick.register_xxx" functions.
1304 - Added "whack" option.
1305 - Allow registration of quotient types as codatatypes.
1306 - Improved "merge_type_vars" option to merge more types.
1307 - Removed unsound "fast_descrs" option.
1308 - Added custom symmetry breaking for datatypes, making it possible to reach
1309 higher cardinalities.
1310 - Prevent the expansion of too large definitions.
1312 * Proof methods "metis" and "meson" now have configuration options
1313 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1314 to diagnose these tools. E.g.
1316 using [[metis_trace = true]]
1318 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1319 manually as command 'solve_direct'.
1321 * The default SMT solver Z3 must be enabled explicitly (due to
1322 licensing issues) by setting the environment variable
1323 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1324 commercial applications, the SMT solver CVC3 is provided as fall-back;
1325 changing the SMT solver is done via the configuration option
1328 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1329 i.e. "remote_cvc3" and "remote_z3".
1331 * Added basic SMT support for datatypes, records, and typedefs using
1332 the oracle mode (no proofs). Direct support of pairs has been dropped
1333 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1334 support for a similar behavior). Minor INCOMPATIBILITY.
1336 * Changed SMT configuration options:
1338 z3_proofs ~> smt_oracle (with inverted meaning)
1339 z3_trace_assms ~> smt_trace_used_facts
1352 * Boogie output files (.b2i files) need to be declared in the theory
1355 * Simplification procedure "list_to_set_comprehension" rewrites list
1356 comprehensions applied to List.set to set comprehensions. Occasional
1357 INCOMPATIBILITY, may be deactivated like this:
1359 declare [[simproc del: list_to_set_comprehension]]
1361 * Removed old version of primrec package. INCOMPATIBILITY.
1363 * Removed simplifier congruence rule of "prod_case", as has for long
1364 been the case with "split". INCOMPATIBILITY.
1366 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
1368 * Removed [split_format ... and ... and ...] version of
1369 [split_format]. Potential INCOMPATIBILITY.
1371 * Predicate "sorted" now defined inductively, with nice induction
1372 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
1374 * Constant "contents" renamed to "the_elem", to free the generic name
1375 contents for other uses. INCOMPATIBILITY.
1377 * Renamed class eq and constant eq (for code generation) to class
1378 equal and constant equal, plus renaming of related facts and various
1379 tuning. INCOMPATIBILITY.
1381 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
1383 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
1386 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
1387 avoid confusion with finite sets. INCOMPATIBILITY.
1389 * Abandoned locales equiv, congruent and congruent2 for equivalence
1390 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
1393 * Some previously unqualified names have been qualified:
1400 Trueprop ~> HOL.Trueprop
1405 op --> ~> HOL.implies
1417 Pair ~> Product_Type.Pair
1418 fst ~> Product_Type.fst
1419 snd ~> Product_Type.snd
1420 curry ~> Product_Type.curry
1422 Collect ~> Set.Collect
1426 * More canonical naming convention for some fundamental definitions:
1428 bot_bool_eq ~> bot_bool_def
1429 top_bool_eq ~> top_bool_def
1430 inf_bool_eq ~> inf_bool_def
1431 sup_bool_eq ~> sup_bool_def
1432 bot_fun_eq ~> bot_fun_def
1433 top_fun_eq ~> top_fun_def
1434 inf_fun_eq ~> inf_fun_def
1435 sup_fun_eq ~> sup_fun_def
1439 * More stylized fact names:
1441 expand_fun_eq ~> fun_eq_iff
1442 expand_set_eq ~> set_eq_iff
1444 nat_number ~> eval_nat_numeral
1448 * Refactoring of code-generation specific operations in theory List:
1454 mem_iff ~> member_def
1455 null_empty ~> null_def
1457 INCOMPATIBILITY. Note that these were not supposed to be used
1458 regularly unless for striking reasons; their main purpose was code
1461 Various operations from the Haskell prelude are used for generating
1464 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
1465 "surj f" is now an abbreviation of "range f = UNIV". The theorems
1466 bij_def and surj_def are unchanged. INCOMPATIBILITY.
1468 * Abolished some non-alphabetic type names: "prod" and "sum" replace
1469 "*" and "+" respectively. INCOMPATIBILITY.
1471 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
1472 "Sum_Type.Plus" instead.
1474 * Constant "split" has been merged with constant "prod_case"; names of
1475 ML functions, facts etc. involving split have been retained so far,
1476 though. INCOMPATIBILITY.
1478 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
1479 instead. INCOMPATIBILITY.
1481 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
1484 * Former theory Library/Enum is now part of the HOL-Main image.
1485 INCOMPATIBILITY: all constants of the Enum theory now have to be
1486 referred to by its qualified name.
1489 nlists ~> Enum.nlists
1490 product ~> Enum.product
1492 * Theory Library/Monad_Syntax provides do-syntax for monad types.
1493 Syntax in Library/State_Monad has been changed to avoid ambiguities.
1496 * Theory Library/SetsAndFunctions has been split into
1497 Library/Function_Algebras and Library/Set_Algebras; canonical names
1498 for instance definitions for functions; various improvements.
1501 * Theory Library/Multiset provides stable quicksort implementation of
1504 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1507 * Session Multivariate_Analysis: introduced a type class for euclidean
1508 space. Most theorems are now stated in terms of euclidean spaces
1509 instead of finite cartesian products.
1512 real ^ 'n ~> 'a::real_vector
1513 ~> 'a::euclidean_space
1514 ~> 'a::ordered_euclidean_space
1515 (depends on your needs)
1519 \<chi> x. _ ~> \<chi>\<chi> x. _
1522 Also note that the indices are now natural numbers and not from some
1523 finite type. Finite cartesian products of euclidean spaces, products
1524 of euclidean spaces the real and complex numbers are instantiated to
1525 be euclidean_spaces. INCOMPATIBILITY.
1527 * Session Probability: introduced pextreal as positive extended real
1528 numbers. Use pextreal as value for measures. Introduce the
1529 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1530 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1531 the integral in Multivariate Analysis. INCOMPATIBILITY.
1533 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1536 * Session SPARK (with image HOL-SPARK) provides commands to load and
1537 prove verification conditions generated by the SPARK Ada program
1538 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1543 * Theorems for additive ring operations (locale abelian_monoid and
1544 descendants) are generated by interpretation from their multiplicative
1545 counterparts. Names (in particular theorem names) have the mandatory
1546 qualifier 'add'. Previous theorem names are redeclared for
1549 * Structure "int_ring" is now an abbreviation (previously a
1550 definition). This fits more natural with advanced interpretations.
1555 * The domain package now runs in definitional mode by default: The
1556 former command 'new_domain' is now called 'domain'. To use the domain
1557 package in its original axiomatic mode, use 'domain (unsafe)'.
1560 * The new class "domain" is now the default sort. Class "predomain"
1561 is an unpointed version of "domain". Theories can be updated by
1562 replacing sort annotations as shown below. INCOMPATIBILITY.
1564 'a::type ~> 'a::countable
1565 'a::cpo ~> 'a::predomain
1566 'a::pcpo ~> 'a::domain
1568 * The old type class "rep" has been superseded by class "domain".
1569 Accordingly, users of the definitional package must remove any
1570 "default_sort rep" declarations. INCOMPATIBILITY.
1572 * The domain package (definitional mode) now supports unpointed
1573 predomain argument types, as long as they are marked 'lazy'. (Strict
1574 arguments must be in class "domain".) For example, the following
1575 domain definition now works:
1577 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1579 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1580 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1581 'a option, and 'a list. Additionally, it configures fixrec and the
1582 domain package to work with these types. For example:
1584 fixrec isInl :: "('a + 'b) u -> tr"
1585 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1587 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1589 * The "(permissive)" option of fixrec has been replaced with a
1590 per-equation "(unchecked)" option. See
1591 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1593 * The "bifinite" class no longer fixes a constant "approx"; the class
1594 now just asserts that such a function exists. INCOMPATIBILITY.
1596 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1597 defines an embedding of type 'a defl into udom by default; instances
1598 of "bifinite" and "domain" classes are available in
1599 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1601 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1603 * The predicate "directed" has been removed. INCOMPATIBILITY.
1605 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1607 * The function "cprod_map" has been renamed to "prod_map".
1610 * The monadic bind operator on each powerdomain has new binder syntax
1611 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1612 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1614 * The infix syntax for binary union on each powerdomain has changed
1615 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1616 syntax. INCOMPATIBILITY.
1618 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1619 still supported as an input translation.
1621 * Renamed some theorems (the original names are also still available).
1623 expand_fun_below ~> fun_below_iff
1624 below_fun_ext ~> fun_belowI
1625 expand_cfun_eq ~> cfun_eq_iff
1626 ext_cfun ~> cfun_eqI
1627 expand_cfun_below ~> cfun_below_iff
1628 below_cfun_ext ~> cfun_belowI
1629 cont2cont_Rep_CFun ~> cont2cont_APP
1631 * The Abs and Rep functions for various types have changed names.
1632 Related theorem names have also changed to match. INCOMPATIBILITY.
1634 Rep_CFun ~> Rep_cfun
1635 Abs_CFun ~> Abs_cfun
1636 Rep_Sprod ~> Rep_sprod
1637 Abs_Sprod ~> Abs_sprod
1638 Rep_Ssum ~> Rep_ssum
1639 Abs_Ssum ~> Abs_ssum
1641 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1642 been renamed to *_bottom_iff. INCOMPATIBILITY.
1644 * Various changes to bisimulation/coinduction with domain package:
1646 - Definitions of "bisim" constants no longer mention definedness.
1647 - With mutual recursion, "bisim" predicate is now curried.
1648 - With mutual recursion, each type gets a separate coind theorem.
1649 - Variable names in bisim_def and coinduct rules have changed.
1653 * Case combinators generated by the domain package for type "foo" are
1654 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1656 * Several theorems have been renamed to more accurately reflect the
1657 names of constants and types involved. INCOMPATIBILITY.
1659 thelub_const ~> lub_const
1660 lub_const ~> is_lub_const
1662 is_lub_lub ~> is_lubD2
1664 unique_lub ~> is_lub_unique
1665 is_ub_lub ~> is_lub_rangeD1
1666 lub_bin_chain ~> is_lub_bin_chain
1667 lub_fun ~> is_lub_fun
1668 thelub_fun ~> lub_fun
1669 thelub_cfun ~> lub_cfun
1670 thelub_Pair ~> lub_Pair
1671 lub_cprod ~> is_lub_prod
1672 thelub_cprod ~> lub_prod
1673 minimal_cprod ~> minimal_prod
1674 inst_cprod_pcpo ~> inst_prod_pcpo
1676 compact_UU ~> compact_bottom
1677 deflation_UU ~> deflation_bottom
1678 finite_deflation_UU ~> finite_deflation_bottom
1680 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1682 sq_ord_less_eq_trans ~> below_eq_trans
1683 sq_ord_eq_less_trans ~> eq_below_trans
1684 refl_less ~> below_refl
1685 trans_less ~> below_trans
1686 antisym_less ~> below_antisym
1687 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1688 box_less ~> box_below
1689 rev_trans_less ~> rev_below_trans
1690 not_less2not_eq ~> not_below2not_eq
1691 less_UU_iff ~> below_UU_iff
1692 flat_less_iff ~> flat_below_iff
1693 adm_less ~> adm_below
1694 adm_not_less ~> adm_not_below
1695 adm_compact_not_less ~> adm_compact_not_below
1696 less_fun_def ~> below_fun_def
1697 expand_fun_less ~> fun_below_iff
1698 less_fun_ext ~> fun_belowI
1699 less_discr_def ~> below_discr_def
1700 discr_less_eq ~> discr_below_eq
1701 less_unit_def ~> below_unit_def
1702 less_cprod_def ~> below_prod_def
1703 prod_lessI ~> prod_belowI
1704 Pair_less_iff ~> Pair_below_iff
1705 fst_less_iff ~> fst_below_iff
1706 snd_less_iff ~> snd_below_iff
1707 expand_cfun_less ~> cfun_below_iff
1708 less_cfun_ext ~> cfun_belowI
1709 injection_less ~> injection_below
1710 less_up_def ~> below_up_def
1711 not_Iup_less ~> not_Iup_below
1712 Iup_less ~> Iup_below
1714 Def_inject_less_eq ~> Def_below_Def
1715 Def_less_is_eq ~> Def_below_iff
1716 spair_less_iff ~> spair_below_iff
1717 less_sprod ~> below_sprod
1718 spair_less ~> spair_below
1719 sfst_less_iff ~> sfst_below_iff
1720 ssnd_less_iff ~> ssnd_below_iff
1721 fix_least_less ~> fix_least_below
1722 dist_less_one ~> dist_below_one
1723 less_ONE ~> below_ONE
1724 ONE_less_iff ~> ONE_below_iff
1725 less_sinlD ~> below_sinlD
1726 less_sinrD ~> below_sinrD
1731 * All constant names are now qualified internally and use proper
1732 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1736 * Greater support for structured proofs involving induction or case analysis.
1738 * Much greater use of special symbols.
1740 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1744 * Antiquotation @{assert} inlines a function bool -> unit that raises
1745 Fail if the argument is false. Due to inlining the source position of
1746 failed assertions is included in the error output.
1748 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1749 text is in practice always evaluated with a stable theory checkpoint.
1750 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1752 * Antiquotation @{theory A} refers to theory A from the ancestry of
1753 the current context, not any accidental theory loader state as before.
1754 Potential INCOMPATIBILITY, subtle change in semantics.
1756 * Syntax.pretty_priority (default 0) configures the required priority
1757 of pretty-printed output and thus affects insertion of parentheses.
1759 * Syntax.default_root (default "any") configures the inner syntax
1760 category (nonterminal symbol) for parsing of terms.
1762 * Former exception Library.UnequalLengths now coincides with
1763 ListPair.UnequalLengths.
1765 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1766 main functionality is provided by structure Simplifier.
1768 * Renamed raw "explode" function to "raw_explode" to emphasize its
1769 meaning. Note that internally to Isabelle, Symbol.explode is used in
1770 almost all situations.
1772 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1773 See implementation manual for further details on exceptions in
1776 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1779 * Renamed structure PureThy to Pure_Thy and moved most of its
1780 operations to structure Global_Theory, to emphasize that this is
1781 rarely-used global-only stuff.
1783 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1784 instead (or tracing for high-volume output).
1786 * Configuration option show_question_marks only affects regular pretty
1787 printing of types and terms, not raw Term.string_of_vname.
1789 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1790 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1791 @{thms} for most purposes.
1793 * ML structure Unsynchronized is never opened, not even in Isar
1794 interaction mode as before. Old Unsynchronized.set etc. have been
1795 discontinued -- use plain := instead. This should be *rare* anyway,
1796 since modern tools always work via official context data, notably
1797 configuration options.
1799 * Parallel and asynchronous execution requires special care concerning
1800 interrupts. Structure Exn provides some convenience functions that
1801 avoid working directly with raw Interrupt. User code must not absorb
1802 interrupts -- intermediate handling (for cleanup etc.) needs to be
1803 followed by re-raising of the original exception. Another common
1804 source of mistakes are "handle _" patterns, which make the meaning of
1805 the program subject to physical effects of the environment.
1809 New in Isabelle2009-2 (June 2010)
1810 ---------------------------------
1814 * Authentic syntax for *all* logical entities (type classes, type
1815 constructors, term constants): provides simple and robust
1816 correspondence between formal entities and concrete syntax. Within
1817 the parse tree / AST representations, "constants" are decorated by
1818 their category (class, type, const) and spelled out explicitly with
1819 their full internal name.
1821 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1822 and translations (translation rules and translation functions in ML).
1823 Some hints on upgrading:
1825 - Many existing uses of 'syntax' and 'translations' can be replaced
1826 by more modern 'type_notation', 'notation' and 'abbreviation',
1827 which are independent of this issue.
1829 - 'translations' require markup within the AST; the term syntax
1830 provides the following special forms:
1832 CONST c -- produces syntax version of constant c from context
1833 XCONST c -- literally c, checked as constant from context
1834 c -- literally c, if declared by 'syntax'
1836 Plain identifiers are treated as AST variables -- occasionally the
1837 system indicates accidental variables via the error "rhs contains
1840 Type classes and type constructors are marked according to their
1841 concrete syntax. Some old translations rules need to be written
1842 for the "type" category, using type constructor application
1843 instead of pseudo-term application of the default category
1846 - 'parse_translation' etc. in ML may use the following
1849 @{class_syntax c} -- type class c within parse tree / AST
1850 @{term_syntax c} -- type constructor c within parse tree / AST
1851 @{const_syntax c} -- ML version of "CONST c" above
1852 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1854 - Literal types within 'typed_print_translations', i.e. those *not*
1855 represented as pseudo-terms are represented verbatim. Use @{class
1856 c} or @{type_name c} here instead of the above syntax
1859 Note that old non-authentic syntax was based on unqualified base
1860 names, so all of the above "constant" names would coincide. Recall
1861 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1862 diagnose syntax problems.
1864 * Type constructors admit general mixfix syntax, not just infix.
1866 * Concrete syntax may be attached to local entities without a proof
1867 body, too. This works via regular mixfix annotations for 'fix',
1868 'def', 'obtain' etc. or via the explicit 'write' command, which is
1869 similar to the 'notation' command in theory specifications.
1871 * Discontinued unnamed infix syntax (legacy feature for many years) --
1872 need to specify constant name and syntax separately. Internal ML
1873 datatype constructors have been renamed from InfixName to Infix etc.
1874 Minor INCOMPATIBILITY.
1876 * Schematic theorem statements need to be explicitly markup as such,
1877 via commands 'schematic_lemma', 'schematic_theorem',
1878 'schematic_corollary'. Thus the relevance of the proof is made
1879 syntactically clear, which impacts performance in a parallel or
1880 asynchronous interactive environment. Minor INCOMPATIBILITY.
1882 * Use of cumulative prems via "!" in some proof methods has been
1883 discontinued (old legacy feature).
1885 * References 'trace_simp' and 'debug_simp' have been replaced by
1886 configuration options stored in the context. Enabling tracing (the
1887 case of debugging is similar) in proofs works via
1889 using [[trace_simp = true]]
1891 Tracing is then active for all invocations of the simplifier in
1892 subsequent goal refinement steps. Tracing may also still be enabled or
1893 disabled via the ProofGeneral settings menu.
1895 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1896 'hide_fact' replace the former 'hide' KIND command. Minor
1899 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1900 more efficient than combinations with -q1 or -q2.
1905 * Proofterms record type-class reasoning explicitly, using the
1906 "unconstrain" operation internally. This eliminates all sort
1907 constraints from a theorem and proof, introducing explicit
1908 OFCLASS-premises. On the proof term level, this operation is
1909 automatically applied at theorem boundaries, such that closed proofs
1910 are always free of sort constraints. INCOMPATIBILITY for tools that
1911 inspect proof terms.
1913 * Local theory specifications may depend on extra type variables that
1914 are not present in the result type -- arguments TYPE('a) :: 'a itself
1915 are added internally. For example:
1917 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1919 * Predicates of locales introduced by classes carry a mandatory
1920 "class" prefix. INCOMPATIBILITY.
1922 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1924 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1927 * Command 'code_reflect' allows to incorporate generated ML code into
1928 runtime environment; replaces immature code_datatype antiquotation.
1931 * Code generator: simple concept for abstract datatypes obeying
1934 * Code generator: details of internal data cache have no impact on the
1935 user space functionality any longer.
1937 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1938 subgoals. This is more appropriate for interpretations with 'where'.
1941 * Command 'example_proof' opens an empty proof body. This allows to
1942 experiment with Isar, without producing any persistent result.
1944 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1945 within a local theory context, with explicit checking of the
1946 constructors involved (in contrast to the raw 'syntax' versions).
1948 * Commands 'types' and 'typedecl' now work within a local theory
1949 context -- without introducing dependencies on parameters or
1950 assumptions, which is not possible in Isabelle/Pure.
1952 * Command 'defaultsort' has been renamed to 'default_sort', it works
1953 within a local theory context. Minor INCOMPATIBILITY.
1958 * Command 'typedef' now works within a local theory context -- without
1959 introducing dependencies on parameters or assumptions, which is not
1960 possible in Isabelle/Pure/HOL. Note that the logical environment may
1961 contain multiple interpretations of local typedefs (with different
1962 non-emptiness proofs), even in a global theory context.
1964 * New package for quotient types. Commands 'quotient_type' and
1965 'quotient_definition' may be used for defining types and constants by
1966 quotient constructions. An example is the type of integers created by
1967 quotienting pairs of natural numbers:
1970 intrel :: "(nat * nat) => (nat * nat) => bool"
1972 "intrel (x, y) (u, v) = (x + v = u + y)"
1974 quotient_type int = "nat * nat" / intrel
1975 by (auto simp add: equivp_def expand_fun_eq)
1978 "0::int" is "(0::nat, 0::nat)"
1980 The method "lifting" can be used to lift of theorems from the
1981 underlying "raw" type to the quotient type. The example
1982 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1983 construction and provides a reasoning infrastructure for finite sets.
1985 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1986 clash with new theory Quotient in Main HOL.
1988 * Moved the SMT binding into the main HOL session, eliminating
1989 separate HOL-SMT session.
1991 * List membership infix mem operation is only an input abbreviation.
1994 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1995 for future developements; former Library/Word.thy is still present in
1996 the AFP entry RSAPPS.
1998 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1999 longer shadowed. INCOMPATIBILITY.
2001 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2004 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2007 * Dropped normalizing_semiring etc; use the facts in semiring classes
2008 instead. INCOMPATIBILITY.
2010 * Dropped several real-specific versions of lemmas about floor and
2011 ceiling; use the generic lemmas from theory "Archimedean_Field"
2012 instead. INCOMPATIBILITY.
2014 floor_number_of_eq ~> floor_number_of
2015 le_floor_eq_number_of ~> number_of_le_floor
2016 le_floor_eq_zero ~> zero_le_floor
2017 le_floor_eq_one ~> one_le_floor
2018 floor_less_eq_number_of ~> floor_less_number_of
2019 floor_less_eq_zero ~> floor_less_zero
2020 floor_less_eq_one ~> floor_less_one
2021 less_floor_eq_number_of ~> number_of_less_floor
2022 less_floor_eq_zero ~> zero_less_floor
2023 less_floor_eq_one ~> one_less_floor
2024 floor_le_eq_number_of ~> floor_le_number_of
2025 floor_le_eq_zero ~> floor_le_zero
2026 floor_le_eq_one ~> floor_le_one
2027 floor_subtract_number_of ~> floor_diff_number_of
2028 floor_subtract_one ~> floor_diff_one
2029 ceiling_number_of_eq ~> ceiling_number_of
2030 ceiling_le_eq_number_of ~> ceiling_le_number_of
2031 ceiling_le_zero_eq ~> ceiling_le_zero
2032 ceiling_le_eq_one ~> ceiling_le_one
2033 less_ceiling_eq_number_of ~> number_of_less_ceiling
2034 less_ceiling_eq_zero ~> zero_less_ceiling
2035 less_ceiling_eq_one ~> one_less_ceiling
2036 ceiling_less_eq_number_of ~> ceiling_less_number_of
2037 ceiling_less_eq_zero ~> ceiling_less_zero
2038 ceiling_less_eq_one ~> ceiling_less_one
2039 le_ceiling_eq_number_of ~> number_of_le_ceiling
2040 le_ceiling_eq_zero ~> zero_le_ceiling
2041 le_ceiling_eq_one ~> one_le_ceiling
2042 ceiling_subtract_number_of ~> ceiling_diff_number_of
2043 ceiling_subtract_one ~> ceiling_diff_one
2045 * Theory "Finite_Set": various folding_XXX locales facilitate the
2046 application of the various fold combinators on finite sets.
2048 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2049 provides abstract red-black tree type which is backed by "RBT_Impl" as
2050 implementation. INCOMPATIBILTY.
2052 * Theory Library/Coinductive_List has been removed -- superseded by
2053 AFP/thys/Coinductive.
2055 * Theory PReal, including the type "preal" and related operations, has
2056 been removed. INCOMPATIBILITY.
2058 * Real: new development using Cauchy Sequences.
2060 * Split off theory "Big_Operators" containing setsum, setprod,
2061 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2063 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2064 "Int" etc. INCOMPATIBILITY.
2066 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2068 * New set of rules "ac_simps" provides combined assoc / commute
2069 rewrites for all interpretations of the appropriate generic locales.
2071 * Renamed theory "OrderedGroup" to "Groups" and split theory
2072 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2073 appropriate and more consistent names suitable for name prefixes
2074 within the HOL theories. INCOMPATIBILITY.
2076 * Some generic constants have been put to appropriate theories:
2077 - less_eq, less: Orderings
2078 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2079 - inverse, divide: Rings
2082 * More consistent naming of type classes involving orderings (and
2085 lower_semilattice ~> semilattice_inf
2086 upper_semilattice ~> semilattice_sup
2088 dense_linear_order ~> dense_linorder
2090 pordered_ab_group_add ~> ordered_ab_group_add
2091 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2092 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2093 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2094 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2095 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2096 pordered_cancel_semiring ~> ordered_cancel_semiring
2097 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2098 pordered_comm_ring ~> ordered_comm_ring
2099 pordered_comm_semiring ~> ordered_comm_semiring
2100 pordered_ring ~> ordered_ring
2101 pordered_ring_abs ~> ordered_ring_abs
2102 pordered_semiring ~> ordered_semiring
2104 ordered_ab_group_add ~> linordered_ab_group_add
2105 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2106 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2107 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2108 ordered_field ~> linordered_field
2109 ordered_field_no_lb ~> linordered_field_no_lb
2110 ordered_field_no_ub ~> linordered_field_no_ub
2111 ordered_field_dense_linear_order ~> dense_linordered_field
2112 ordered_idom ~> linordered_idom
2113 ordered_ring ~> linordered_ring
2114 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2115 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2116 ordered_ring_strict ~> linordered_ring_strict
2117 ordered_semidom ~> linordered_semidom
2118 ordered_semiring ~> linordered_semiring
2119 ordered_semiring_1 ~> linordered_semiring_1
2120 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2121 ordered_semiring_strict ~> linordered_semiring_strict
2123 The following slightly odd type classes have been moved to a
2124 separate theory Library/Lattice_Algebras:
2126 lordered_ab_group_add ~> lattice_ab_group_add
2127 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2128 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2129 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2130 lordered_ring ~> lattice_ring
2134 * Refined field classes:
2135 - classes division_ring_inverse_zero, field_inverse_zero,
2136 linordered_field_inverse_zero include rule inverse 0 = 0 --
2137 subsumes former division_by_zero class;
2138 - numerous lemmas have been ported from field to division_ring.
2141 * Refined algebra theorem collections:
2142 - dropped theorem group group_simps, use algebra_simps instead;
2143 - dropped theorem group ring_simps, use field_simps instead;
2144 - proper theorem collection field_simps subsumes former theorem
2145 groups field_eq_simps and field_simps;
2146 - dropped lemma eq_minus_self_iff which is a duplicate for
2150 * Theory Finite_Set and List: some lemmas have been generalized from
2153 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2154 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2155 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2156 union_Union_fold_union ~> sup_Sup_fold_sup
2157 Inter_fold_inter ~> Inf_fold_inf
2158 Union_fold_union ~> Sup_fold_sup
2159 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2160 union_UNION_fold_union ~> sup_SUPR_fold_sup
2161 INTER_fold_inter ~> INFI_fold_inf
2162 UNION_fold_union ~> SUPR_fold_sup
2164 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2165 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2166 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2167 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2168 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2169 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2171 * Reorganized theory Multiset: swapped notation of pointwise and
2174 - pointwise ordering is instance of class order with standard syntax
2176 - multiset ordering has syntax <=# and <#; partial order properties
2177 are provided by means of interpretation with prefix
2179 - less duplication, less historical organization of sections,
2180 conversion from associations lists to multisets, rudimentary code
2182 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2187 multiset_eq_conv_count_eq ~> multiset_ext_iff
2188 multi_count_ext ~> multiset_ext
2189 diff_union_inverse2 ~> diff_union_cancelR
2193 * Theory Permutation: replaced local "remove" by List.remove1.
2195 * Code generation: ML and OCaml code is decorated with signatures.
2197 * Theory List: added transpose.
2199 * Library/Nat_Bijection.thy is a collection of bijective functions
2200 between nat and other types, which supersedes the older libraries
2201 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2204 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2205 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2206 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2207 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2208 Countable.pair_encode ~> prod_encode
2209 NatIso.prod2nat ~> prod_encode
2210 NatIso.nat2prod ~> prod_decode
2211 NatIso.sum2nat ~> sum_encode
2212 NatIso.nat2sum ~> sum_decode
2213 NatIso.list2nat ~> list_encode
2214 NatIso.nat2list ~> list_decode
2215 NatIso.set2nat ~> set_encode
2216 NatIso.nat2set ~> set_decode
2219 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2220 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2221 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2222 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2223 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2224 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2225 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2226 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2227 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2228 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2229 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2230 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2231 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2234 - Renamed ATP commands:
2235 atp_info ~> sledgehammer running_atps
2236 atp_kill ~> sledgehammer kill_atps
2237 atp_messages ~> sledgehammer messages
2238 atp_minimize ~> sledgehammer minimize
2239 print_atps ~> sledgehammer available_atps
2241 - Added user's manual ("isabelle doc sledgehammer").
2242 - Added option syntax and "sledgehammer_params" to customize
2243 Sledgehammer's behavior. See the manual for details.
2244 - Modified the Isar proof reconstruction code so that it produces
2245 direct proofs rather than proofs by contradiction. (This feature
2246 is still experimental.)
2247 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2249 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2252 - Added and implemented "binary_ints" and "bits" options.
2253 - Added "std" option and implemented support for nonstandard models.
2254 - Added and implemented "finitize" option to improve the precision
2255 of infinite datatypes based on a monotonicity analysis.
2256 - Added support for quotient types.
2257 - Added support for "specification" and "ax_specification"
2259 - Added support for local definitions (for "function" and
2260 "termination" proofs).
2261 - Added support for term postprocessors.
2262 - Optimized "Multiset.multiset" and "FinFun.finfun".
2263 - Improved efficiency of "destroy_constrs" optimization.
2264 - Fixed soundness bugs related to "destroy_constrs" optimization and
2266 - Fixed soundness bug related to higher-order constructors.
2267 - Fixed soundness bug when "full_descrs" is enabled.
2268 - Improved precision of set constructs.
2269 - Added "atoms" option.
2270 - Added cache to speed up repeated Kodkod invocations on the same
2272 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2273 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2274 "SAT4J_Light". INCOMPATIBILITY.
2275 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2276 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2277 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2279 * Method "induct" now takes instantiations of the form t, where t is not
2280 a variable, as a shorthand for "x == t", where x is a fresh variable.
2281 If this is not intended, t has to be enclosed in parentheses.
2282 By default, the equalities generated by definitional instantiations
2283 are pre-simplified, which may cause parameters of inductive cases
2284 to disappear, or may even delete some of the inductive cases.
2285 Use "induct (no_simp)" instead of "induct" to restore the old
2286 behaviour. The (no_simp) option is also understood by the "cases"
2287 and "nominal_induct" methods, which now perform pre-simplification, too.
2293 * Variable names in lemmas generated by the domain package have
2294 changed; the naming scheme is now consistent with the HOL datatype
2295 package. Some proof scripts may be affected, INCOMPATIBILITY.
2297 * The domain package no longer defines the function "foo_copy" for
2298 recursive domain "foo". The reach lemma is now stated directly in
2299 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2300 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2302 * Most definedness lemmas generated by the domain package (previously
2303 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2304 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2305 Proofs that used definedness lemmas as intro rules may break,
2306 potential INCOMPATIBILITY.
2308 * Induction and casedist rules generated by the domain package now
2309 declare proper case_names (one called "bottom", and one named for each
2310 constructor). INCOMPATIBILITY.
2312 * For mutually-recursive domains, separate "reach" and "take_lemma"
2313 rules are generated for each domain, INCOMPATIBILITY.
2315 foo_bar.reach ~> foo.reach bar.reach
2316 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2318 * Some lemmas generated by the domain package have been renamed for
2319 consistency with the datatype package, INCOMPATIBILITY.
2321 foo.ind ~> foo.induct
2322 foo.finite_ind ~> foo.finite_induct
2323 foo.coind ~> foo.coinduct
2324 foo.casedist ~> foo.exhaust
2325 foo.exhaust ~> foo.nchotomy
2327 * For consistency with other definition packages, the fixrec package
2328 now generates qualified theorem names, INCOMPATIBILITY.
2330 foo_simps ~> foo.simps
2331 foo_unfold ~> foo.unfold
2332 foo_induct ~> foo.induct
2334 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2335 method and internal fixrec proofs now use the default simpset instead.
2338 * The "contlub" predicate has been removed. Proof scripts should use
2339 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2341 * The "admw" predicate has been removed, INCOMPATIBILITY.
2343 * The constants cpair, cfst, and csnd have been removed in favor of
2344 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2349 * Antiquotations for basic formal entities:
2351 @{class NAME} -- type class
2352 @{class_syntax NAME} -- syntax representation of the above
2354 @{type_name NAME} -- logical type
2355 @{type_abbrev NAME} -- type abbreviation
2356 @{nonterminal NAME} -- type of concrete syntactic category
2357 @{type_syntax NAME} -- syntax representation of any of the above
2359 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
2360 @{const_abbrev NAME} -- abbreviated constant
2361 @{const_syntax NAME} -- syntax representation of any of the above
2363 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
2364 syntax constant (cf. 'syntax' command).
2366 * Antiquotation @{make_string} inlines a function to print arbitrary
2367 values similar to the ML toplevel. The result is compiler dependent
2368 and may fall back on "?" in certain situations.
2370 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
2371 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
2372 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
2373 not work with the asynchronous Isar document model.
2375 * Configuration options now admit dynamic default values, depending on
2376 the context or even global references.
2378 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
2379 uses an efficient external library if available (for Poly/ML).
2381 * Renamed some important ML structures, while keeping the old names
2382 for some time as aliases within the structure Legacy:
2384 OuterKeyword ~> Keyword
2387 OuterSyntax ~> Outer_Syntax
2388 PrintMode ~> Print_Mode
2389 SpecParse ~> Parse_Spec
2392 ThyOutput ~> Thy_Output
2393 TypeInfer ~> Type_Infer
2395 Note that "open Legacy" simplifies porting of sources, but forgetting
2396 to remove it again will complicate porting again in the future.
2398 * Most operations that refer to a global context are named
2399 accordingly, e.g. Simplifier.global_context or
2400 ProofContext.init_global. There are some situations where a global
2401 context actually works, but under normal circumstances one needs to
2402 pass the proper local context through the code!
2404 * Discontinued old TheoryDataFun with its copy/init operation -- data
2405 needs to be pure. Functor Theory_Data_PP retains the traditional
2406 Pretty.pp argument to merge, which is absent in the standard
2407 Theory_Data version.
2409 * Sorts.certify_sort and derived "cert" operations for types and terms
2410 no longer minimize sorts. Thus certification at the boundary of the
2411 inference kernel becomes invariant under addition of class relations,
2412 which is an important monotonicity principle. Sorts are now minimized
2413 in the syntax layer only, at the boundary between the end-user and the
2414 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
2415 explicitly in rare situations.
2417 * Renamed old-style Drule.standard to Drule.export_without_context, to
2418 emphasize that this is in no way a standard operation.
2421 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
2422 usual for resolution. Rare INCOMPATIBILITY.
2424 * Renamed varify/unvarify operations to varify_global/unvarify_global
2425 to emphasize that these only work in a global situation (which is
2428 * Curried take and drop in library.ML; negative length is interpreted
2429 as infinity (as in chop). Subtle INCOMPATIBILITY.
2431 * Proof terms: type substitutions on proof constants now use canonical
2432 order of type variables. INCOMPATIBILITY for tools working with proof
2435 * Raw axioms/defs may no longer carry sort constraints, and raw defs
2436 may no longer carry premises. User-level specifications are
2437 transformed accordingly by Thm.add_axiom/add_def.
2442 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
2443 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
2444 proof terms are enabled unconditionally in the new HOL-Proofs image.
2446 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
2447 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
2450 * Old lib/scripts/polyml-platform is superseded by the
2451 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
2452 variant, even on a 64 bit machine. The following example setting
2453 prefers 64 bit if available:
2455 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
2457 * The preliminary Isabelle/jEdit application demonstrates the emerging
2458 Isabelle/Scala layer for advanced prover interaction and integration.
2459 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
2462 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
2463 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
2464 similar to the default assignment of the document preparation system
2465 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
2466 provides some operations for direct access to the font without asking
2467 the user for manual installation.
2471 New in Isabelle2009-1 (December 2009)
2472 -------------------------------------
2476 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
2477 one backslash should be used, even in ML sources.
2482 * Locale interpretation propagates mixins along the locale hierarchy.
2483 The currently only available mixins are the equations used to map
2484 local definitions to terms of the target domain of an interpretation.
2486 * Reactivated diagnostic command 'print_interps'. Use "print_interps
2487 loc" to print all interpretations of locale "loc" in the theory.
2488 Interpretations in proofs are not shown.
2490 * Thoroughly revised locales tutorial. New section on conditional
2493 * On instantiation of classes, remaining undefined class parameters
2494 are formally declared. INCOMPATIBILITY.
2497 *** Document preparation ***
2499 * New generalized style concept for printing terms: @{foo (style) ...}
2500 instead of @{foo_style style ...} (old form is still retained for
2501 backward compatibility). Styles can be also applied for
2502 antiquotations prop, term_type and typeof.
2507 * New proof method "smt" for a combination of first-order logic with
2508 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2509 fixed-size bitvectors; there is also basic support for higher-order
2510 features (esp. lambda abstractions). It is an incomplete decision
2511 procedure based on external SMT solvers using the oracle mechanism;
2512 for the SMT solver Z3, this method is proof-producing. Certificates
2513 are provided to avoid calling the external solvers solely for
2514 re-checking proofs. Due to a remote SMT service there is no need for
2515 installing SMT solvers locally. See src/HOL/SMT.
2517 * New commands to load and prove verification conditions generated by
2518 the Boogie program verifier or derived systems (e.g. the Verifying C
2519 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2521 * New counterexample generator tool 'nitpick' based on the Kodkod
2522 relational model finder. See src/HOL/Tools/Nitpick and
2523 src/HOL/Nitpick_Examples.
2525 * New commands 'code_pred' and 'values' to invoke the predicate
2526 compiler and to enumerate values of inductive predicates.
2528 * A tabled implementation of the reflexive transitive closure.
2530 * New implementation of quickcheck uses generic code generator;
2531 default generators are provided for all suitable HOL types, records
2532 and datatypes. Old quickcheck can be re-activated importing theory
2533 Library/SML_Quickcheck.
2535 * New testing tool Mirabelle for automated proof tools. Applies
2536 several tools and tactics like sledgehammer, metis, or quickcheck, to
2537 every proof step in a theory. To be used in batch mode via the
2538 "mirabelle" utility.
2540 * New proof method "sos" (sum of squares) for nonlinear real
2541 arithmetic (originally due to John Harison). It requires theory
2542 Library/Sum_Of_Squares. It is not a complete decision procedure but
2543 works well in practice on quantifier-free real arithmetic with +, -,
2544 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2545 inequalities between polynomials. It makes use of external
2546 semidefinite programming solvers. Method "sos" generates a
2547 certificate that can be pasted into the proof thus avoiding the need
2548 to call an external tool every time the proof is checked. See
2549 src/HOL/Library/Sum_Of_Squares.
2551 * New method "linarith" invokes existing linear arithmetic decision
2554 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2556 * New Sledgehammer option "Full Types" in Proof General settings menu.
2557 Causes full type information to be output to the ATPs. This slows
2558 ATPs down considerably but eliminates a source of unsound "proofs"
2561 * New method "metisFT": A version of metis that uses full type
2562 information in order to avoid failures of proof reconstruction.
2564 * New evaluator "approximate" approximates an real valued term using
2565 the same method as the approximation method.
2567 * Method "approximate" now supports arithmetic expressions as
2568 boundaries of intervals and implements interval splitting and Taylor
2571 * ML antiquotation @{code_datatype} inserts definition of a datatype
2572 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2574 * New theory SupInf of the supremum and infimum operators for sets of
2577 * New theory Probability, which contains a development of measure
2578 theory, eventually leading to Lebesgue integration and probability.
2580 * Extended Multivariate Analysis to include derivation and Brouwer's
2583 * Reorganization of number theory, INCOMPATIBILITY:
2584 - new number theory development for nat and int, in theories Divides
2585 and GCD as well as in new session Number_Theory
2586 - some constants and facts now suffixed with _nat and _int
2588 - former session NumberTheory now named Old_Number_Theory, including
2589 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2590 - moved theory Pocklington from src/HOL/Library to
2591 src/HOL/Old_Number_Theory
2593 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2594 lcm of finite and infinite sets. It is shown that they form a complete
2597 * Class semiring_div requires superclass no_zero_divisors and proof of
2598 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2599 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2600 generalized to class semiring_div, subsuming former theorems
2601 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2602 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2605 * Refinements to lattice classes and sets:
2606 - less default intro/elim rules in locale variant, more default
2607 intro/elim rules in class variant: more uniformity
2608 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2610 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2612 - renamed ACI to inf_sup_aci
2613 - new class "boolean_algebra"
2614 - class "complete_lattice" moved to separate theory
2615 "Complete_Lattice"; corresponding constants (and abbreviations)
2616 renamed and with authentic syntax:
2617 Set.Inf ~> Complete_Lattice.Inf
2618 Set.Sup ~> Complete_Lattice.Sup
2619 Set.INFI ~> Complete_Lattice.INFI
2620 Set.SUPR ~> Complete_Lattice.SUPR
2621 Set.Inter ~> Complete_Lattice.Inter
2622 Set.Union ~> Complete_Lattice.Union
2623 Set.INTER ~> Complete_Lattice.INTER
2624 Set.UNION ~> Complete_Lattice.UNION
2625 - authentic syntax for
2628 - mere abbreviations:
2631 Set.inter (for inf, formerly Set.Int)
2632 Set.union (for sup, formerly Set.Un)
2633 Complete_Lattice.Inter (for Inf)
2634 Complete_Lattice.Union (for Sup)
2635 Complete_Lattice.INTER (for INFI)
2636 Complete_Lattice.UNION (for SUPR)
2637 - object-logic definitions as far as appropriate
2639 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2640 Un_subset_iff are explicitly deleted as default simp rules; then also
2641 their lattice counterparts le_inf_iff and le_sup_iff have to be
2642 deleted to achieve the desired effect.
2644 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2645 rules by default any longer; the same applies to min_max.inf_absorb1
2646 etc. INCOMPATIBILITY.
2648 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2649 pred_set_conv by default. INCOMPATIBILITY.
2651 * Power operations on relations and functions are now one dedicated
2652 constant "compow" with infix syntax "^^". Power operation on
2653 multiplicative monoids retains syntax "^" and is now defined generic
2654 in class power. INCOMPATIBILITY.
2656 * Relation composition "R O S" now has a more standard argument order:
2657 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2658 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2659 break, since the O_assoc rule was not rewritten like this. Fix using
2660 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2662 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2663 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2666 * Most rules produced by inductive and datatype package have mandatory
2667 prefixes. INCOMPATIBILITY.
2669 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2670 the attribute of the same name. Each of the theorems in the list
2671 DERIV_intros assumes composition with an additional function and
2672 matches a variable to the derivative, which has to be solved by the
2673 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2674 of most elementary terms. Former Maclauren.DERIV_tac and
2675 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2678 * Code generator attributes follow the usual underscore convention:
2679 code_unfold replaces code unfold
2680 code_post replaces code post
2685 sizechange -> size_change
2686 induct_scheme -> induction_schema
2689 * Discontinued abbreviation "arbitrary" of constant "undefined".
2690 INCOMPATIBILITY, use "undefined" directly.
2693 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2694 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2695 Suc_plus1 -> Suc_eq_plus1
2696 *anti_sym -> *antisym*
2697 vector_less_eq_def -> vector_le_def
2700 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2703 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2709 * Theory Representable defines a class "rep" of domains that are
2710 representable (via an ep-pair) in the universal domain type "udom".
2711 Instances are provided for all type constructors defined in HOLCF.
2713 * The 'new_domain' command is a purely definitional version of the
2714 domain package, for representable domains. Syntax is identical to the
2715 old domain package. The 'new_domain' package also supports indirect
2716 recursion using previously-defined type constructors. See
2717 src/HOLCF/ex/New_Domain.thy for examples.
2719 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2720 on the left-hand side of an equation, and then performs
2721 simplification. Rewriting is done using rules declared with the
2722 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2723 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2725 * The pattern-match compiler in 'fixrec' can now handle constructors
2726 with HOL function types. Pattern-match combinators for the Pair
2727 constructor are pre-configured.
2729 * The 'fixrec' package now produces better fixed-point induction rules
2730 for mutually-recursive definitions: Induction rules have conclusions
2731 of the form "P foo bar" instead of "P <foo, bar>".
2733 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2734 been renamed to "below". The name "below" now replaces "less" in many
2735 theorem names. (Legacy theorem names using "less" are still supported
2738 * The 'fixrec' package now supports "bottom patterns". Bottom
2739 patterns can be used to generate strictness rules, or to make
2740 functions more strict (much like the bang-patterns supported by the
2741 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2747 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2748 errors and run-time exceptions, including detailed source positions.
2750 * Structure Name_Space (formerly NameSpace) now manages uniquely
2751 identified entries, with some additional information such as source
2752 position, logical grouping etc.
2754 * Theory and context data is now introduced by the simplified and
2755 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2756 to be pure, but the old TheoryDataFun for mutable data (with explicit
2757 copy operation) is still available for some time.
2759 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2760 provides a high-level programming interface to synchronized state
2761 variables with atomic update. This works via pure function
2762 application within a critical section -- its runtime should be as
2763 short as possible; beware of deadlocks if critical code is nested,
2764 either directly or indirectly via other synchronized variables!
2766 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2767 wraps raw ML references, explicitly indicating their non-thread-safe
2768 behaviour. The Isar toplevel keeps this structure open, to
2769 accommodate Proof General as well as quick and dirty interactive
2770 experiments with references.
2772 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2773 parallel tactical reasoning.
2775 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2776 are similar to SUBPROOF, but are slightly more flexible: only the
2777 specified parts of the subgoal are imported into the context, and the
2778 body tactic may introduce new subgoals and schematic variables.
2780 * Old tactical METAHYPS, which does not observe the proof context, has
2781 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2782 or Subgoal.FOCUS etc.
2784 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2785 functors have their own ML name space there is no point to mark them
2786 separately.) Minor INCOMPATIBILITY.
2788 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2790 * Renamed several structures FooBar to Foo_Bar. Occasional,
2793 * Operations of structure Skip_Proof no longer require quick_and_dirty
2794 mode, which avoids critical setmp.
2796 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2797 combinators for "args". INCOMPATIBILITY, need to use simplified
2798 Attrib/Method.setup introduced in Isabelle2009.
2800 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2801 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2802 last resort. INCOMPATIBILITY.
2804 * Display.pretty_thm now requires a proper context (cf. former
2805 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2806 or even Display.pretty_thm_without_context as last resort.
2809 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2810 Syntax.pretty_typ/term directly, preferably with proper context
2811 instead of global theory.
2816 * Further fine tuning of parallel proof checking, scales up to 8 cores
2817 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2820 * Support for additional "Isabelle components" via etc/components, see
2821 also the system manual.
2823 * The isabelle makeall tool now operates on all components with
2824 IsaMakefile, not just hardwired "logics".
2826 * Removed "compress" option from isabelle-process and isabelle usedir;
2827 this is always enabled.
2829 * Discontinued support for Poly/ML 4.x versions.
2831 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2832 on a given logic image. This requires the lighttpd webserver and is
2833 currently supported on Linux only.
2837 New in Isabelle2009 (April 2009)
2838 --------------------------------
2842 * Simplified main Isabelle executables, with less surprises on
2843 case-insensitive file-systems (such as Mac OS).
2845 - The main Isabelle tool wrapper is now called "isabelle" instead of
2848 - The former "isabelle" alias for "isabelle-process" has been
2849 removed (should rarely occur to regular users).
2851 - The former "isabelle-interface" and its alias "Isabelle" have been
2852 removed (interfaces are now regular Isabelle tools).
2854 Within scripts and make files, the Isabelle environment variables
2855 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2856 respectively. (The latter are still available as legacy feature.)
2858 The old isabelle-interface wrapper could react in confusing ways if
2859 the interface was uninstalled or changed otherwise. Individual
2860 interface tool configuration is now more explicit, see also the
2861 Isabelle system manual. In particular, Proof General is now available
2862 via "isabelle emacs".
2864 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2865 purge installed copies of Isabelle executables and re-run "isabelle
2866 install -p ...", or use symlinks.
2868 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2869 old ~/isabelle, which was slightly non-standard and apt to cause
2870 surprises on case-insensitive file-systems (such as Mac OS).
2872 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2873 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2874 care is required when using older releases of Isabelle. Note that
2875 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2876 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2878 * Proofs of fully specified statements are run in parallel on
2879 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2880 a regular 4-core machine, if the initial heap space is made reasonably
2881 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2883 * The main reference manuals ("isar-ref", "implementation", and
2884 "system") have been updated and extended. Formally checked references
2885 as hyperlinks are now available uniformly.
2890 * Complete re-implementation of locales. INCOMPATIBILITY in several
2891 respects. The most important changes are listed below. See the
2892 Tutorial on Locales ("locales" manual) for details.
2894 - In locale expressions, instantiation replaces renaming. Parameters
2895 must be declared in a for clause. To aid compatibility with previous
2896 parameter inheritance, in locale declarations, parameters that are not
2897 'touched' (instantiation position "_" or omitted) are implicitly added
2898 with their syntax at the beginning of the for clause.
2900 - Syntax from abbreviations and definitions in locales is available in
2901 locale expressions and context elements. The latter is particularly
2902 useful in locale declarations.
2904 - More flexible mechanisms to qualify names generated by locale
2905 expressions. Qualifiers (prefixes) may be specified in locale
2906 expressions, and can be marked as mandatory (syntax: "name!:") or
2907 optional (syntax "name?:"). The default depends for plain "name:"
2908 depends on the situation where a locale expression is used: in
2909 commands 'locale' and 'sublocale' prefixes are optional, in
2910 'interpretation' and 'interpret' prefixes are mandatory. The old
2911 implicit qualifiers derived from the parameter names of a locale are
2912 no longer generated.
2914 - Command "sublocale l < e" replaces "interpretation l < e". The
2915 instantiation clause in "interpretation" and "interpret" (square
2916 brackets) is no longer available. Use locale expressions.
2918 - When converting proof scripts, mandatory qualifiers in
2919 'interpretation' and 'interpret' should be retained by default, even
2920 if this is an INCOMPATIBILITY compared to former behavior. In the
2921 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2922 in locale expressions range over a single locale instance only.
2924 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2925 In existing theorem specifications replace the includes element by the
2926 respective context elements of the included locale, omitting those
2927 that are already present in the theorem specification. Multiple
2928 assume elements of a locale should be replaced by a single one
2929 involving the locale predicate. In the proof body, declarations (most
2930 notably theorems) may be regained by interpreting the respective
2931 locales in the proof context as required (command "interpret").
2933 If using "includes" in replacement of a target solely because the
2934 parameter types in the theorem are not as general as in the target,
2935 consider declaring a new locale with additional type constraints on
2936 the parameters (context element "constrains").
2938 - Discontinued "locale (open)". INCOMPATIBILITY.
2940 - Locale interpretation commands no longer attempt to simplify goal.
2941 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2942 methods intro_locales and unfold_locales to clarify.
2944 - Locale interpretation commands no longer accept interpretation
2945 attributes. INCOMPATIBILITY.
2947 * Class declaration: so-called "base sort" must not be given in import
2948 list any longer, but is inferred from the specification. Particularly
2955 class foo = type + ...
2957 * Class target: global versions of theorems stemming do not carry a
2958 parameter prefix any longer. INCOMPATIBILITY.
2960 * Class 'instance' command no longer accepts attached definitions.
2961 INCOMPATIBILITY, use proper 'instantiation' target instead.
2963 * Recovered hiding of consts, which was accidentally broken in
2964 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2965 makes c inaccessible; consider using ``hide (open) const c'' instead.
2967 * Slightly more coherent Pure syntax, with updated documentation in
2968 isar-ref manual. Removed locales meta_term_syntax and
2969 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2970 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2971 directly in regular applications.
2973 * There is a new syntactic category "float_const" for signed decimal
2974 fractions (e.g. 123.45 or -123.45).
2976 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2977 interface with 'setup' command instead.
2979 * Command 'local_setup' is similar to 'setup', but operates on a local
2982 * The 'axiomatization' command now only works within a global theory
2983 context. INCOMPATIBILITY.
2985 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2986 hypotheses. Sorts required in the course of reasoning need to be
2987 covered by the constraints in the initial statement, completed by the
2988 type instance information of the background theory. Non-trivial sort
2989 hypotheses, which rarely occur in practice, may be specified via
2990 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2992 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2994 The result contains an implicit sort hypotheses as before --
2995 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2998 * Generalized Isar history, with support for linear undo, direct state
3001 * Changed defaults for unify configuration options:
3003 unify_trace_bound = 50 (formerly 25)
3004 unify_search_bound = 60 (formerly 30)
3006 * Different bookkeeping for code equations (INCOMPATIBILITY):
3008 a) On theory merge, the last set of code equations for a particular
3009 constant is taken (in accordance with the policy applied by other
3010 parts of the code generator framework).
3012 b) Code equations stemming from explicit declarations (e.g. code
3013 attribute) gain priority over default code equations stemming
3014 from definition, primrec, fun etc.
3016 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3018 * Unified theorem tables for both code generators. Thus [code
3019 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3021 * Command 'find_consts' searches for constants based on type and name
3024 find_consts "_ => bool"
3026 By default, matching is against subtypes, but it may be restricted to
3027 the whole type. Searching by name is possible. Multiple queries are
3028 conjunctive and queries may be negated by prefixing them with a
3031 find_consts strict: "_ => bool" name: "Int" -"int => int"
3033 * New 'find_theorems' criterion "solves" matches theorems that
3034 directly solve the current goal (modulo higher-order unification).
3036 * Auto solve feature for main theorem statements: whenever a new goal
3037 is stated, "find_theorems solves" is called; any theorems that could
3038 solve the lemma directly are listed as part of the goal state.
3039 Cf. associated options in Proof General Isabelle settings menu,
3040 enabled by default, with reasonable timeout for pathological cases of
3041 higher-order unification.
3044 *** Document preparation ***
3046 * Antiquotation @{lemma} now imitates a regular terminal proof,
3047 demanding keyword 'by' and supporting the full method expression
3048 syntax just like the Isar command 'by'.
3053 * Integrated main parts of former image HOL-Complex with HOL. Entry
3054 points Main and Complex_Main remain as before.
3056 * Logic image HOL-Plain provides a minimal HOL with the most important
3057 tools available (inductive, datatype, primrec, ...). This facilitates
3058 experimentation and tool development. Note that user applications
3059 (and library theories) should never refer to anything below theory
3062 * Logic image HOL-Main stops at theory Main, and thus facilitates
3063 experimentation due to shorter build times.
3065 * Logic image HOL-NSA contains theories of nonstandard analysis which
3066 were previously part of former HOL-Complex. Entry point Hyperreal
3067 remains valid, but theories formerly using Complex_Main should now use
3068 new entry point Hypercomplex.
3070 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3071 Posix processes. Avoids potentially expensive forking of the ML
3072 process. New thread-based implementation also works on non-Unix
3073 platforms (Cygwin). Provers are no longer hardwired, but defined
3074 within the theory via plain ML wrapper functions. Basic Sledgehammer
3075 commands are covered in the isar-ref manual.
3077 * Wrapper scripts for remote SystemOnTPTP service allows to use
3078 sledgehammer without local ATP installation (Vampire etc.). Other
3079 provers may be included via suitable ML wrappers, see also
3080 src/HOL/ATP_Linkup.thy.
3082 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3085 * The metis method no longer fails because the theorem is too trivial
3086 (contains the empty clause).
3088 * The metis method now fails in the usual manner, rather than raising
3089 an exception, if it determines that it cannot prove the theorem.
3091 * Method "coherent" implements a prover for coherent logic (see also
3092 src/Tools/coherent.ML).
3094 * Constants "undefined" and "default" replace "arbitrary". Usually
3095 "undefined" is the right choice to replace "arbitrary", though
3096 logically there is no difference. INCOMPATIBILITY.
3098 * Command "value" now integrates different evaluation mechanisms. The
3099 result of the first successful evaluation mechanism is printed. In
3100 square brackets a particular named evaluation mechanisms may be
3101 specified (currently, [SML], [code] or [nbe]). See further
3102 src/HOL/ex/Eval_Examples.thy.
3104 * Normalization by evaluation now allows non-leftlinear equations.
3105 Declare with attribute [code nbe].
3107 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3108 as the structured Isar versions "cases" and "induct", cf. the
3109 corresponding "cases" and "induct" attributes. Mutual induction rules
3110 are now presented as a list of individual projections
3111 (e.g. foo_bar.inducts for types foo and bar); the old format with
3112 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3113 rare situations a different rule is selected --- notably nested tuple
3114 elimination instead of former prod.exhaust: use explicit (case_tac t
3115 rule: prod.exhaust) here.
3117 * Attributes "cases", "induct", "coinduct" support "del" option.
3119 * Removed fact "case_split_thm", which duplicates "case_split".
3121 * The option datatype has been moved to a new theory Option. Renamed
3122 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3124 * New predicate "strict_mono" classifies strict functions on partial
3125 orders. With strict functions on linear orders, reasoning about
3126 (in)equalities is facilitated by theorems "strict_mono_eq",
3127 "strict_mono_less_eq" and "strict_mono_less".
3129 * Some set operations are now proper qualified constants with
3130 authentic syntax. INCOMPATIBILITY:
3141 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3144 * Auxiliary class "itself" has disappeared -- classes without any
3145 parameter are treated as expected by the 'class' command.
3147 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3149 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3150 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3152 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3153 method "approximation". It proves formulas on real values by using
3154 interval arithmetic. In the formulas are also the transcendental
3155 functions sin, cos, tan, atan, ln, exp and the constant pi are
3156 allowed. For examples see
3157 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3159 * Theory "Reflection" now resides in HOL/Library.
3161 * Entry point to Word library now simply named "Word".
3164 * Made source layout more coherent with logical distribution
3167 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3168 src/HOL/Library/Code_Message.thy ~> src/HOL/
3169 src/HOL/Library/GCD.thy ~> src/HOL/
3170 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3171 src/HOL/Library/Parity.thy ~> src/HOL/
3172 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3173 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3174 src/HOL/Real/Lubs.thy ~> src/HOL/
3175 src/HOL/Real/PReal.thy ~> src/HOL/
3176 src/HOL/Real/Rational.thy ~> src/HOL/
3177 src/HOL/Real/RComplete.thy ~> src/HOL/
3178 src/HOL/Real/RealDef.thy ~> src/HOL/
3179 src/HOL/Real/RealPow.thy ~> src/HOL/
3180 src/HOL/Real/Real.thy ~> src/HOL/
3181 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3182 src/HOL/Complex/Complex.thy ~> src/HOL/
3183 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3184 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3185 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3186 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3187 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3188 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3189 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3190 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3191 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3192 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3193 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3194 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3195 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3196 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3197 src/HOL/Real/Float ~> src/HOL/Library/
3198 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3199 src/HOL/Real/RealVector.thy ~> src/HOL/
3201 src/HOL/arith_data.ML ~> src/HOL/Tools
3202 src/HOL/hologic.ML ~> src/HOL/Tools
3203 src/HOL/simpdata.ML ~> src/HOL/Tools
3204 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3205 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3206 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3207 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3208 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3209 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3210 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3212 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3213 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3214 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3215 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3216 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3217 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3219 * If methods "eval" and "evaluation" encounter a structured proof
3220 state with !!/==>, only the conclusion is evaluated to True (if
3221 possible), avoiding strange error messages.
3223 * Method "sizechange" automates termination proofs using (a
3224 modification of) the size-change principle. Requires SAT solver. See
3225 src/HOL/ex/Termination.thy for examples.
3227 * Simplifier: simproc for let expressions now unfolds if bound
3228 variable occurs at most once in let expression body. INCOMPATIBILITY.
3230 * Method "arith": Linear arithmetic now ignores all inequalities when
3231 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3233 * New attribute "arith" for facts that should always be used
3234 automatically by arithmetic. It is intended to be used locally in
3237 assumes [arith]: "x > 0"
3239 Global usage is discouraged because of possible performance impact.
3241 * New classes "top" and "bot" with corresponding operations "top" and
3242 "bot" in theory Orderings; instantiation of class "complete_lattice"
3243 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3245 * Changed definition lemma "less_fun_def" in order to provide an
3246 instance for preorders on functions; use lemma "less_le" instead.
3249 * Theory Orderings: class "wellorder" moved here, with explicit
3250 induction rule "less_induct" as assumption. For instantiation of
3251 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3254 * Theory Orderings: added class "preorder" as superclass of "order".
3255 INCOMPATIBILITY: Instantiation proofs for order, linorder
3256 etc. slightly changed. Some theorems named order_class.* now named
3259 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3262 * Theory Finite_Set: added a new fold combinator of type
3264 ('a => 'b => 'b) => 'b => 'a set => 'b
3266 Occasionally this is more convenient than the old fold combinator
3267 which is now defined in terms of the new one and renamed to
3270 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3271 and "ring_simps" have been replaced by "algebra_simps" (which can be
3272 extended with further lemmas!). At the moment both still exist but
3273 the former will disappear at some point.
3275 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3276 class recpower. Type-specific simp rules for various recpower types
3277 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3279 rat_power_0 -> power_0
3280 rat_power_Suc -> power_Suc
3281 realpow_0 -> power_0
3282 realpow_Suc -> power_Suc
3283 complexpow_0 -> power_0
3284 complexpow_Suc -> power_Suc
3285 power_poly_0 -> power_0
3286 power_poly_Suc -> power_Suc
3288 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3289 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3290 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3291 of lemmas from Divides has been generalized from nat to class
3292 semiring_div. INCOMPATIBILITY. This involves the following theorem
3293 renames resulting from duplicate elimination:
3295 dvd_def_mod ~> dvd_eq_mod_eq_0
3296 zero_dvd_iff ~> dvd_0_left_iff
3297 dvd_0 ~> dvd_0_right
3298 DIVISION_BY_ZERO_DIV ~> div_by_0
3299 DIVISION_BY_ZERO_MOD ~> mod_by_0
3300 mult_div ~> div_mult_self2_is_id
3301 mult_mod ~> mod_mult_self2_is_0
3303 * Theory IntDiv: removed many lemmas that are instances of class-based
3304 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3305 rename old lemmas as follows:
3307 dvd_diff -> nat_dvd_diff
3308 dvd_zminus_iff -> dvd_minus_iff
3309 mod_add1_eq -> mod_add_eq
3310 mod_mult1_eq -> mod_mult_right_eq
3311 mod_mult1_eq' -> mod_mult_left_eq
3312 mod_mult_distrib_mod -> mod_mult_eq
3313 nat_mod_add_left_eq -> mod_add_left_eq
3314 nat_mod_add_right_eq -> mod_add_right_eq
3315 nat_mod_div_trivial -> mod_div_trivial
3316 nat_mod_mod_trivial -> mod_mod_trivial
3317 zdiv_zadd_self1 -> div_add_self1
3318 zdiv_zadd_self2 -> div_add_self2
3319 zdiv_zmult_self1 -> div_mult_self2_is_id
3320 zdiv_zmult_self2 -> div_mult_self1_is_id
3321 zdvd_triv_left -> dvd_triv_left
3322 zdvd_triv_right -> dvd_triv_right
3323 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3324 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3325 zmod_zadd_left_eq -> mod_add_left_eq
3326 zmod_zadd_right_eq -> mod_add_right_eq
3327 zmod_zadd_self1 -> mod_add_self1
3328 zmod_zadd_self2 -> mod_add_self2
3329 zmod_zadd1_eq -> mod_add_eq
3330 zmod_zdiff1_eq -> mod_diff_eq
3331 zmod_zdvd_zmod -> mod_mod_cancel
3332 zmod_zmod_cancel -> mod_mod_cancel
3333 zmod_zmult_self1 -> mod_mult_self2_is_0
3334 zmod_zmult_self2 -> mod_mult_self1_is_0
3337 zdvd_abs1 -> abs_dvd_iff
3338 zdvd_abs2 -> dvd_abs_iff
3339 zdvd_refl -> dvd_refl
3340 zdvd_trans -> dvd_trans
3341 zdvd_zadd -> dvd_add
3342 zdvd_zdiff -> dvd_diff
3343 zdvd_zminus_iff -> dvd_minus_iff
3344 zdvd_zminus2_iff -> minus_dvd_iff
3345 zdvd_zmultD -> dvd_mult_right
3346 zdvd_zmultD2 -> dvd_mult_left
3347 zdvd_zmult_mono -> mult_dvd_mono
3348 zdvd_0_right -> dvd_0_right
3349 zdvd_0_left -> dvd_0_left_iff
3350 zdvd_1_left -> one_dvd
3351 zminus_dvd_iff -> minus_dvd_iff
3353 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3355 * The real numbers offer decimal input syntax: 12.34 is translated
3356 into 1234/10^2. This translation is not reversed upon output.
3358 * Theory Library/Polynomial defines an abstract type 'a poly of
3359 univariate polynomials with coefficients of type 'a. In addition to
3360 the standard ring operations, it also supports div and mod. Code
3361 generation is also supported, using list-style constructors.
3363 * Theory Library/Inner_Product defines a class of real_inner for real
3364 inner product spaces, with an overloaded operation inner :: 'a => 'a
3365 => real. Class real_inner is a subclass of real_normed_vector from
3368 * Theory Library/Product_Vector provides instances for the product
3369 type 'a * 'b of several classes from RealVector and Inner_Product.
3370 Definitions of addition, subtraction, scalar multiplication, norms,
3371 and inner products are included.
3373 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
3374 addition to the field operations, numerals and case syntax are also
3377 * Theory Library/Diagonalize provides constructive version of Cantor's
3378 first diagonalization argument.
3380 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
3381 zlcm (for int); carried together from various gcd/lcm developements in
3382 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
3383 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
3384 may recover tupled syntax as follows:
3386 hide (open) const gcd
3387 abbreviation gcd where
3388 "gcd == (%(a, b). GCD.gcd a b)"
3390 GCD.gcd ("gcd '(_, _')")
3392 The same works for lcm, zgcd, zlcm.
3394 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
3395 instantiations for algebraic structures. Removed some duplicate
3396 theorems. Changes in simp rules. INCOMPATIBILITY.
3398 * ML antiquotation @{code} takes a constant as argument and generates
3399 corresponding code in background and inserts name of the corresponding
3400 resulting ML value/function/datatype constructor binding in place.
3401 All occurrences of @{code} with a single ML block are generated
3402 simultaneously. Provides a generic and safe interface for
3403 instrumentalizing code generation. See
3404 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
3405 In future you ought to refrain from ad-hoc compiling generated SML
3406 code on the ML toplevel. Note that (for technical reasons) @{code}
3407 cannot refer to constants for which user-defined serializations are
3408 set. Refer to the corresponding ML counterpart directly in that
3411 * Command 'rep_datatype': instead of theorem names the command now
3412 takes a list of terms denoting the constructors of the type to be
3413 represented as datatype. The characteristic theorems have to be
3414 proven. INCOMPATIBILITY. Also observe that the following theorems
3415 have disappeared in favour of existing ones:
3417 unit_induct ~> unit.induct
3418 prod_induct ~> prod.induct
3419 sum_induct ~> sum.induct
3420 Suc_Suc_eq ~> nat.inject
3421 Suc_not_Zero Zero_not_Suc ~> nat.distinct
3426 * New locales for orders and lattices where the equivalence relation
3427 is not restricted to equality. INCOMPATIBILITY: all order and lattice
3428 locales use a record structure with field eq for the equivalence.
3430 * New theory of factorial domains.
3432 * Units_l_inv and Units_r_inv are now simp rules by default.
3433 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
3434 and/or r_inv will now also require deletion of these lemmas.
3436 * Renamed the following theorems, INCOMPATIBILITY:
3438 UpperD ~> Upper_memD
3439 LowerD ~> Lower_memD
3440 least_carrier ~> least_closed
3441 greatest_carrier ~> greatest_closed
3442 greatest_Lower_above ~> greatest_Lower_below
3443 one_zero ~> carrier_one_zero
3444 one_not_zero ~> carrier_one_not_zero (collision with assumption)
3449 * Nominal datatypes can now contain type-variables.
3451 * Commands 'nominal_inductive' and 'equivariance' work with local
3454 * Nominal primrec can now works with local theory targets and its
3455 specification syntax now conforms to the general format as seen in
3458 * Method "perm_simp" honours the standard simplifier attributes
3459 (no_asm), (no_asm_use) etc.
3461 * The new predicate #* is defined like freshness, except that on the
3462 left hand side can be a set or list of atoms.
3464 * Experimental command 'nominal_inductive2' derives strong induction
3465 principles for inductive definitions. In contrast to
3466 'nominal_inductive', which can only deal with a fixed number of
3467 binders, it can deal with arbitrary expressions standing for sets of
3468 atoms to be avoided. The only inductive definition we have at the
3469 moment that needs this generalisation is the typing rule for Lets in
3472 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
3473 -----------------------------------------------------------------
3474 Gamma |- Let x be t1 in t2 : T2
3476 In this rule one wants to avoid all the binders that are introduced by
3477 "close Gamma T1". We are looking for other examples where this
3478 feature might be useful. Please let us know.
3483 * Reimplemented the simplification procedure for proving continuity
3484 subgoals. The new simproc is extensible; users can declare additional
3485 continuity introduction rules with the attribute [cont2cont].
3487 * The continuity simproc now uses a different introduction rule for
3488 solving continuity subgoals on terms with lambda abstractions. In
3489 some rare cases the new simproc may fail to solve subgoals that the
3490 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
3491 Potential INCOMPATIBILITY.
3493 * Command 'fixrec': specification syntax now conforms to the general
3494 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
3495 examples. INCOMPATIBILITY.
3500 * Proof of Zorn's Lemma for partial orders.
3505 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3506 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3507 depends on multithreading, so timouts will not work before Poly/ML
3510 * High-level support for concurrent ML programming, see
3511 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3512 particularly convenient to organize independent functional
3513 computations. The concept of "synchronized variables" provides a
3514 higher-order interface for components with shared state, avoiding the
3515 delicate details of mutexes and condition variables. (Requires
3516 Poly/ML 5.2.1 or later.)
3518 * ML bindings produced via Isar commands are stored within the Isar
3519 context (theory or proof). Consequently, commands like 'use' and 'ML'
3520 become thread-safe and work with undo as expected (concerning
3521 top-level bindings, not side-effects on global references).
3522 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3523 compiler at runtime; really global bindings need to be given outside a
3524 theory. (Requires Poly/ML 5.2 or later.)
3526 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3527 context. Top-level ML bindings are stored within the proof context in
3528 a purely sequential fashion, disregarding the nested proof structure.
3529 ML bindings introduced by 'ML_prf' are discarded at the end of the
3530 proof. (Requires Poly/ML 5.2 or later.)
3532 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3533 and Method.setup, as well as Isar commands 'attribute_setup' and
3534 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3535 existing code accordingly, or use plain 'setup' together with old
3538 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3539 to 'a -> thm, while results are always tagged with an authentic oracle
3540 name. The Isar command 'oracle' is now polymorphic, no argument type
3541 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3542 accordingly. Note that extra performance may be gained by producing
3543 the cterm carefully, avoiding slow Thm.cterm_of.
3545 * Simplified interface for defining document antiquotations via
3546 ThyOutput.antiquotation, ThyOutput.output, and optionally
3547 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3548 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3551 * More systematic treatment of long names, abstract name bindings, and
3552 name space operations. Basic operations on qualified names have been
3553 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3554 Long_Name.append. Old type bstring has been mostly replaced by
3555 abstract type binding (see structure Binding), which supports precise
3556 qualification by packages and local theory targets, as well as proper
3557 tracking of source positions. INCOMPATIBILITY, need to wrap old
3558 bstring values into Binding.name, or better pass through abstract
3559 bindings everywhere. See further src/Pure/General/long_name.ML,
3560 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3562 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3563 LocalTheory.note etc.) now refer to the *full* internal name, not the
3564 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3566 * Disposed old type and term read functions (Sign.read_def_typ,
3567 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3568 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3569 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3570 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3571 resort for legacy applications.
3573 * Disposed old declarations, tactics, tactic combinators that refer to
3574 the simpset or claset of an implicit theory (such as Addsimps,
3575 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3576 embedded ML text, or local_simpset_of with a proper context passed as
3577 explicit runtime argument.
3579 * Rules and tactics that read instantiations (read_instantiate,
3580 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3581 context, which is required for parsing and type-checking. Moreover,
3582 the variables are specified as plain indexnames, not string encodings
3583 thereof. INCOMPATIBILITY.
3585 * Generic Toplevel.add_hook interface allows to analyze the result of
3586 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3587 for theorem dependency output of transactions resulting in a new
3590 * ML antiquotations: block-structured compilation context indicated by
3591 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3593 @{binding name} - basic name binding
3594 @{let ?pat = term} - term abbreviation (HO matching)
3595 @{note name = fact} - fact abbreviation
3596 @{thm fact} - singleton fact (with attributes)
3597 @{thms fact} - general fact (with attributes)
3598 @{lemma prop by method} - singleton goal
3599 @{lemma prop by meth1 meth2} - singleton goal
3600 @{lemma prop1 ... propN by method} - general goal
3601 @{lemma prop1 ... propN by meth1 meth2} - general goal
3602 @{lemma (open) ...} - open derivation
3607 * The Isabelle "emacs" tool provides a specific interface to invoke
3608 Proof General / Emacs, with more explicit failure if that is not
3609 installed (the old isabelle-interface script silently falls back on
3610 isabelle-process). The PROOFGENERAL_HOME setting determines the
3611 installation location of the Proof General distribution.
3613 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3614 the Isabelle process into a JVM/Scala application. See
3615 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3616 process wrapper has been discontinued.)
3618 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3620 * Various status messages (with exact source position information) are
3621 emitted, if proper markup print mode is enabled. This allows
3622 user-interface components to provide detailed feedback on internal
3627 New in Isabelle2008 (June 2008)
3628 -------------------------------
3632 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3633 and updated, with formally checked references as hyperlinks.
3635 * Theory loader: use_thy (and similar operations) no longer set the
3636 implicit ML context, which was occasionally hard to predict and in
3637 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3638 provides a proper context already.
3640 * Theory loader: old-style ML proof scripts being *attached* to a thy
3641 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3642 'use' within a theory file will do the job.
3644 * Name space merge now observes canonical order, i.e. the second space
3645 is inserted into the first one, while existing entries in the first
3646 space take precedence. INCOMPATIBILITY in rare situations, may try to
3647 swap theory imports.
3649 * Syntax: symbol \<chi> is now considered a letter. Potential
3650 INCOMPATIBILITY in identifier syntax etc.
3652 * Outer syntax: string tokens no longer admit escaped white space,
3653 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3654 white space without escapes.
3656 * Outer syntax: string tokens may contain arbitrary character codes
3657 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3663 * Context-dependent token translations. Default setup reverts locally
3664 fixed variables, and adds hilite markup for undeclared frees.
3666 * Unused theorems can be found using the new command 'unused_thms'.
3667 There are three ways of invoking it:
3670 Only finds unused theorems in the current theory.
3672 (2) unused_thms thy_1 ... thy_n -
3673 Finds unused theorems in the current theory and all of its ancestors,
3674 excluding the theories thy_1 ... thy_n and all of their ancestors.
3676 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3677 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3678 their ancestors, excluding the theories thy_1 ... thy_n and all of
3681 In order to increase the readability of the list produced by
3682 unused_thms, theorems that have been created by a particular instance
3683 of a theory command such as 'inductive' or 'function' are considered
3684 to belong to the same "group", meaning that if at least one theorem in
3685 this group is used, the other theorems in the same group are no longer
3686 reported as unused. Moreover, if all theorems in the group are
3687 unused, only one theorem in the group is displayed.
3689 Note that proof objects have to be switched on in order for
3690 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3691 usually the case when using Proof General with the default settings).
3693 * Authentic naming of facts disallows ad-hoc overwriting of previous
3694 theorems within the same name space. INCOMPATIBILITY, need to remove
3695 duplicate fact bindings, or even accidental fact duplications. Note
3696 that tools may maintain dynamically scoped facts systematically, using
3697 PureThy.add_thms_dynamic.
3699 * Command 'hide' now allows to hide from "fact" name space as well.
3701 * Eliminated destructive theorem database, simpset, claset, and
3702 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3703 update of theories within ML code.
3705 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3706 INCOMPATIBILITY, object-logics depending on former Pure require
3707 additional setup PureThy.old_appl_syntax_setup; object-logics
3708 depending on former CPure need to refer to Pure.
3710 * Commands 'use' and 'ML' are now purely functional, operating on
3711 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3712 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3715 * Command 'setup': discontinued implicit version with ML reference.
3717 * Instantiation target allows for simultaneous specification of class
3718 instance operations together with an instantiation proof.
3719 Type-checking phase allows to refer to class operations uniformly.
3720 See src/HOL/Complex/Complex.thy for an Isar example and
3721 src/HOL/Library/Eval.thy for an ML example.
3723 * Indexing of literal facts: be more serious about including only
3724 facts from the visible specification/proof context, but not the
3725 background context (locale etc.). Affects `prop` notation and method
3726 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3729 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3730 "(open)" option, which used to expose internal bound variables to the
3733 * Isar statements: removed obsolete case "rule_context".
3734 INCOMPATIBILITY, better use explicit fixes/assumes.
3736 * Locale proofs: default proof step now includes 'unfold_locales';
3737 hence 'proof' without argument may be used to unfold locale
3741 *** Document preparation ***
3743 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3744 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3745 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3746 spot); renamed link color from "darkblue" to "linkcolor" (default
3747 value unchanged, can be redefined via \definecolor); no longer sets
3748 "a4paper" option (unnecessary or even intrusive).
3750 * Antiquotation @{lemma A method} proves proposition A by the given
3751 method (either a method name or a method name plus (optional) method
3752 arguments in parentheses) and prints A just like @{prop A}.
3757 * New primrec package. Specification syntax conforms in style to
3758 definition/function/.... No separate induction rule is provided. The
3759 "primrec" command distinguishes old-style and new-style specifications
3760 by syntax. The former primrec package is now named OldPrimrecPackage.
3761 When adjusting theories, beware: constants stemming from new-style
3762 primrec specifications have authentic syntax.
3764 * Metis prover is now an order of magnitude faster, and also works
3765 with multithreading.
3767 * Metis: the maximum number of clauses that can be produced from a
3768 theorem is now given by the attribute max_clauses. Theorems that
3769 exceed this number are ignored, with a warning printed.
3771 * Sledgehammer no longer produces structured proofs by default. To
3772 enable, declare [[sledgehammer_full = true]]. Attributes
3773 reconstruction_modulus, reconstruction_sorts renamed
3774 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3776 * Method "induct_scheme" derives user-specified induction rules
3777 from well-founded induction and completeness of patterns. This factors
3778 out some operations that are done internally by the function package
3779 and makes them available separately. See
3780 src/HOL/ex/Induction_Scheme.thy for examples.
3782 * More flexible generation of measure functions for termination
3783 proofs: Measure functions can be declared by proving a rule of the
3784 form "is_measure f" and giving it the [measure_function] attribute.
3785 The "is_measure" predicate is logically meaningless (always true), and
3786 just guides the heuristic. To find suitable measure functions, the
3787 termination prover sets up the goal "is_measure ?f" of the appropriate
3788 type and generates all solutions by prolog-style backwards proof using
3791 This setup also deals with rules like
3793 "is_measure f ==> is_measure (list_size f)"
3795 which accommodates nested datatypes that recurse through lists.
3796 Similar rules are predeclared for products and option types.
3798 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3802 - Definitions of overloaded constants on sets have to be replaced by
3803 definitions on => and bool.
3805 - Some definitions of overloaded operators on sets can now be proved
3806 using the definitions of the operators on => and bool. Therefore,
3807 the following theorems have been renamed:
3809 subset_def -> subset_eq
3810 psubset_def -> psubset_eq
3811 set_diff_def -> set_diff_eq
3812 Compl_def -> Compl_eq
3813 Sup_set_def -> Sup_set_eq
3814 Inf_set_def -> Inf_set_eq
3815 sup_set_def -> sup_set_eq
3816 inf_set_def -> inf_set_eq
3818 - Due to the incompleteness of the HO unification algorithm, some
3819 rules such as subst may require manual instantiation, if some of
3820 the unknowns in the rule is a set.
3822 - Higher order unification and forward proofs:
3825 have "P (S::'a set)" <...>
3826 then have "EX S. P S" ..
3828 no longer works (due to the incompleteness of the HO unification
3829 algorithm) and must be replaced by the pattern
3836 - Calculational reasoning with subst (or similar rules):
3839 have "P (S::'a set)" <...>
3840 also have "S = T" <...>
3841 finally have "P T" .
3843 no longer works (for similar reasons as the previous example) and
3844 must be replaced by something like
3846 have "P (S::'a set)" <...>
3847 moreover have "S = T" <...>
3848 ultimately have "P T" by simp
3850 - Tactics or packages written in ML code:
3851 Code performing pattern matching on types via
3853 Type ("set", [T]) => ...
3855 must be rewritten. Moreover, functions like strip_type or
3856 binder_types no longer return the right value when applied to a
3859 T1 => ... => Tn => U => bool
3863 T1 => ... => Tn => U set
3865 * Merged theories Wellfounded_Recursion, Accessible_Part and
3866 Wellfounded_Relations to theory Wellfounded.
3868 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3870 * Class finite no longer treats UNIV as class parameter. Use class
3871 enum from theory Library/Enum instead to achieve a similar effect.
3874 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3875 and "Cons". INCOMPATIBILITY.
3877 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3878 Potential INCOMPATIBILITY.
3880 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3881 injective_fst_snd removed, use split_eta and prod_eqI instead.
3882 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3884 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3885 the same name in theory Orderings:
3895 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3896 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3897 and different variable names.
3899 * Library/Option_ord.thy: Canonical order on option type.
3901 * Library/RBT.thy: Red-black trees, an efficient implementation of
3904 * Library/Countable.thy: Type class for countable types.
3906 * Theory Int: The representation of numerals has changed. The infix
3907 operator BIT and the bit datatype with constructors B0 and B1 have
3908 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3909 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3910 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3913 * Theory Nat: definition of <= and < on natural numbers no longer
3914 depend on well-founded relations. INCOMPATIBILITY. Definitions
3915 le_def and less_def have disappeared. Consider lemmas not_less
3916 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3918 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3919 (whose purpose mainly is for various fold_set functionals) have been
3920 abandoned in favor of the existing algebraic classes
3921 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3922 lower_semilattice (resp. upper_semilattice) and linorder.
3925 * Theory Transitive_Closure: induct and cases rules now declare proper
3926 case_names ("base" and "step"). INCOMPATIBILITY.
3928 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3929 lattices. The form set-specific version is available as
3930 Inductive.lfp_ordinal_induct_set.
3932 * Renamed theorems "power.simps" to "power_int.simps".
3935 * Class semiring_div provides basic abstract properties of semirings
3936 with division and modulo operations. Subsumes former class dvd_mod.
3938 * Merged theories IntDef, Numeral and IntArith into unified theory
3939 Int. INCOMPATIBILITY.
3941 * Theory Library/Code_Index: type "index" now represents natural
3942 numbers rather than integers. INCOMPATIBILITY.
3944 * New class "uminus" with operation "uminus" (split of from class
3945 "minus" which now only has operation "minus", binary).
3948 * Constants "card", "internal_split", "option_map" now with authentic
3949 syntax. INCOMPATIBILITY.
3951 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3952 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3953 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3954 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3955 Sup_set_def, le_def, less_def, option_map_def now with object
3956 equality. INCOMPATIBILITY.
3958 * Records. Removed K_record, and replaced it by pure lambda term
3959 %x. c. The simplifier setup is now more robust against eta expansion.
3960 INCOMPATIBILITY: in cases explicitly referring to K_record.
3962 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3964 * Library/ListVector: new theory of arithmetic vector operations.
3966 * Library/Order_Relation: new theory of various orderings as sets of
3967 pairs. Defines preorders, partial orders, linear orders and
3968 well-orders on sets and on types.
3973 * Renamed some theories to allow to loading both ZF and HOL in the
3976 Datatype -> Datatype_ZF
3977 Inductive -> Inductive_ZF
3984 INCOMPATIBILITY: ZF theories that import individual theories below
3985 Main might need to be adapted. Regular theory Main is still
3986 available, as trivial extension of Main_ZF.
3991 * ML within Isar: antiquotation @{const name} or @{const
3992 name(typargs)} produces statically-checked Const term.
3994 * Functor NamedThmsFun: data is available to the user as dynamic fact
3995 (of the same name). Removed obsolete print command.
3997 * Removed obsolete "use_legacy_bindings" function.
3999 * The ``print mode'' is now a thread-local value derived from a global
4000 template (the former print_mode reference), thus access becomes
4001 non-critical. The global print_mode reference is for session
4002 management only; user-code should use print_mode_value,
4003 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4005 * Functions system/system_out provide a robust way to invoke external
4006 shell commands, with propagation of interrupts (requires Poly/ML
4007 5.2.1). Do not use OS.Process.system etc. from the basis library!
4012 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4013 in accordance with Proof General 3.7, which prefers GNU emacs.
4015 * isatool tty runs Isabelle process with plain tty interaction;
4016 optional line editor may be specified via ISABELLE_LINE_EDITOR
4017 setting, the default settings attempt to locate "ledit" and "rlwrap".
4019 * isatool browser now works with Cygwin as well, using general
4020 "javapath" function defined in Isabelle process environment.
4022 * YXML notation provides a simple and efficient alternative to
4023 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4024 isatool yxml as described in the Isabelle system manual.
4026 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4027 provides general wrapper for managing an Isabelle process in a robust
4028 fashion, with ``cooked'' output from stdin/stderr.
4030 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4031 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4033 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4034 way of changing the user's settings is via
4035 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4038 * Multithreading.max_threads := 0 refers to the number of actual CPU
4039 cores of the underlying machine, which is a good starting point for
4040 optimal performance tuning. The corresponding usedir option -M allows
4041 "max" as an alias for "0". WARNING: does not work on certain versions
4042 of Mac OS (with Poly/ML 5.1).
4044 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4045 adverse effect of Isabelle flooding interactive front-ends (notably
4046 ProofGeneral / XEmacs).
4050 New in Isabelle2007 (November 2007)
4051 -----------------------------------
4055 * More uniform information about legacy features, notably a
4056 warning/error of "Legacy feature: ...", depending on the state of the
4057 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4058 legacy features will disappear eventually.
4060 * Theory syntax: the header format ``theory A = B + C:'' has been
4061 discontinued in favour of ``theory A imports B C begin''. Use isatool
4062 fixheaders to convert existing theory files. INCOMPATIBILITY.
4064 * Theory syntax: the old non-Isar theory file format has been
4065 discontinued altogether. Note that ML proof scripts may still be used
4066 with Isar theories; migration is usually quite simple with the ML
4067 function use_legacy_bindings. INCOMPATIBILITY.
4069 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4070 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4073 * Theory loader: be more serious about observing the static theory
4074 header specifications (including optional directories), but not the
4075 accidental file locations of previously successful loads. The strict
4076 update policy of former update_thy is now already performed by
4077 use_thy, so the former has been removed; use_thys updates several
4078 theories simultaneously, just as 'imports' within a theory header
4079 specification, but without merging the results. Potential
4080 INCOMPATIBILITY: may need to refine theory headers and commands
4081 ROOT.ML which depend on load order.
4083 * Theory loader: optional support for content-based file
4084 identification, instead of the traditional scheme of full physical
4085 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4086 (cf. the system manual). The new scheme allows to work with
4087 non-finished theories in persistent session images, such that source
4088 files may be moved later on without requiring reloads.
4090 * Theory loader: old-style ML proof scripts being *attached* to a thy
4091 file (with the same base name as the theory) are considered a legacy
4092 feature, which will disappear eventually. Even now, the theory loader
4093 no longer maintains dependencies on such files.
4095 * Syntax: the scope for resolving ambiguities via type-inference is
4096 now limited to individual terms, instead of whole simultaneous
4097 specifications as before. This greatly reduces the complexity of the
4098 syntax module and improves flexibility by separating parsing and
4099 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4100 'fixes' etc.) are required in rare situations.
4102 * Syntax: constants introduced by new-style packages ('definition',
4103 'abbreviation' etc.) are passed through the syntax module in
4104 ``authentic mode''. This means that associated mixfix annotations
4105 really stick to such constants, independently of potential name space
4106 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4107 trees are represented slightly differently, may need to adapt syntax
4108 translations accordingly. Use CONST marker in 'translations' and
4109 @{const_syntax} antiquotation in 'parse_translation' etc.
4111 * Legacy goal package: reduced interface to the bare minimum required
4112 to keep existing proof scripts running. Most other user-level
4113 functions are now part of the OldGoals structure, which is *not* open
4114 by default (consider isatool expandshort before open OldGoals).
4115 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4116 these tend to cause confusion about the actual goal (!) context being
4117 used here, which is not necessarily the same as the_context().
4119 * Command 'find_theorems': supports "*" wild-card in "name:"
4120 criterion; "with_dups" option. Certain ProofGeneral versions might
4121 support a specific search form (see ProofGeneral/CHANGES).
4123 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4124 by default, which means that "prems" (and also "fixed variables") are
4125 suppressed from proof state output. Note that the ProofGeneral
4126 settings mechanism allows to change and save options persistently, but
4127 older versions of Isabelle will fail to start up if a negative prems
4130 * Local theory targets may be specified by non-nested blocks of
4131 ``context/locale/class ... begin'' followed by ``end''. The body may
4132 contain definitions, theorems etc., including any derived mechanism
4133 that has been implemented on top of these primitives. This concept
4134 generalizes the existing ``theorem (in ...)'' towards more versatility
4137 * Proof General interface: proper undo of final 'end' command;
4138 discontinued Isabelle/classic mode (ML proof scripts).
4141 *** Document preparation ***
4143 * Added antiquotation @{theory name} which prints the given name,
4144 after checking that it refers to a valid ancestor theory in the
4147 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4148 check the given source text as ML type/structure, printing verbatim.
4150 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4151 "c args == rhs" given in the current context. (Any number of
4152 arguments may be given on the LHS.)
4157 * The 'class' package offers a combination of axclass and locale to
4158 achieve Haskell-like type classes in Isabelle. Definitions and
4159 theorems within a class context produce both relative results (with
4160 implicit parameters according to the locale context), and polymorphic
4161 constants with qualified polymorphism (according to the class
4162 context). Within the body context of a 'class' target, a separate
4163 syntax layer ("user space type system") takes care of converting
4164 between global polymorphic consts and internal locale representation.
4165 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4166 "isatool doc classes" provides a tutorial.
4168 * Generic code generator framework allows to generate executable
4169 code for ML and Haskell (including Isabelle classes). A short usage
4172 internal compilation:
4173 export_code <list of constants (term syntax)> in SML
4174 writing SML code to a file:
4175 export_code <list of constants (term syntax)> in SML <filename>
4176 writing OCaml code to a file:
4177 export_code <list of constants (term syntax)> in OCaml <filename>
4178 writing Haskell code to a bunch of files:
4179 export_code <list of constants (term syntax)> in Haskell <filename>
4181 evaluating closed propositions to True/False using code generation:
4184 Reasonable default setup of framework in HOL.
4186 Theorem attributs for selecting and transforming function equations theorems:
4188 [code fun]: select a theorem as function equation for a specific constant
4189 [code fun del]: deselect a theorem as function equation for a specific constant
4190 [code inline]: select an equation theorem for unfolding (inlining) in place
4191 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4193 User-defined serializations (target in {SML, OCaml, Haskell}):
4195 code_const <and-list of constants (term syntax)>
4196 {(target) <and-list of const target syntax>}+
4198 code_type <and-list of type constructors>
4199 {(target) <and-list of type target syntax>}+
4201 code_instance <and-list of instances>
4203 where instance ::= <type constructor> :: <class>
4205 code_class <and_list of classes>
4206 {(target) <and-list of class target syntax>}+
4207 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4209 code_instance and code_class only are effective to target Haskell.
4211 For example usage see src/HOL/ex/Codegenerator.thy and
4212 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4213 generation from Isabelle/HOL theories is available via "isatool doc
4216 * Code generator: consts in 'consts_code' Isar commands are now
4217 referred to by usual term syntax (including optional type
4220 * Command 'no_translations' removes translation rules from theory
4223 * Overloaded definitions are now actually checked for acyclic
4224 dependencies. The overloading scheme is slightly more general than
4225 that of Haskell98, although Isabelle does not demand an exact
4226 correspondence to type class and instance declarations.
4227 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4228 exotic versions of overloading -- at the discretion of the user!
4230 Polymorphic constants are represented via type arguments, i.e. the
4231 instantiation that matches an instance against the most general
4232 declaration given in the signature. For example, with the declaration
4233 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4234 as c(nat). Overloading is essentially simultaneous structural
4235 recursion over such type arguments. Incomplete specification patterns
4236 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4237 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4238 Command 'print_theory' outputs the normalized system of recursive
4239 equations, see section "definitions".
4241 * Configuration options are maintained within the theory or proof
4242 context (with name and type bool/int/string), providing a very simple
4243 interface to a poor-man's version of general context data. Tools may
4244 declare options in ML (e.g. using Attrib.config_int) and then refer to
4245 these values using Config.get etc. Users may change options via an
4246 associated attribute of the same name. This form of context
4247 declaration works particularly well with commands 'declare' or
4248 'using', for example ``declare [[foo = 42]]''. Thus it has become
4249 very easy to avoid global references, which would not observe Isar
4250 toplevel undo/redo and fail to work with multithreading.
4252 Various global ML references of Pure and HOL have been turned into
4253 configuration options:
4255 Unify.search_bound unify_search_bound
4256 Unify.trace_bound unify_trace_bound
4257 Unify.trace_simp unify_trace_simp
4258 Unify.trace_types unify_trace_types
4259 Simplifier.simp_depth_limit simp_depth_limit
4260 Blast.depth_limit blast_depth_limit
4261 DatatypeProp.dtK datatype_distinctness_limit
4262 fast_arith_neq_limit fast_arith_neq_limit
4263 fast_arith_split_limit fast_arith_split_limit
4265 * Named collections of theorems may be easily installed as context
4266 data using the functor NamedThmsFun (see also
4267 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4268 attributes; there is also a toplevel print command. This facility is
4269 just a common case of general context data, which is the preferred way
4270 for anything more complex than just a list of facts in canonical
4273 * Isar: command 'declaration' augments a local theory by generic
4274 declaration functions written in ML. This enables arbitrary content
4275 being added to the context, depending on a morphism that tells the
4276 difference of the original declaration context wrt. the application
4277 context encountered later on.
4279 * Isar: proper interfaces for simplification procedures. Command
4280 'simproc_setup' declares named simprocs (with match patterns, and body
4281 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4282 context. ML antiquotation @{simproc name} retrieves named simprocs.
4284 * Isar: an extra pair of brackets around attribute declarations
4285 abbreviates a theorem reference involving an internal dummy fact,
4286 which will be ignored later --- only the effect of the attribute on
4287 the background context will persist. This form of in-place
4288 declarations is particularly useful with commands like 'declare' and
4289 'using', for example ``have A using [[simproc a]] by simp''.
4291 * Isar: method "assumption" (and implicit closing of subproofs) now
4292 takes simple non-atomic goal assumptions into account: after applying
4293 an assumption as a rule the resulting subgoals are solved by atomic
4294 assumption steps. This is particularly useful to finish 'obtain'
4295 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4296 without referring to the original premise "!!x. P x ==> thesis" in the
4297 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4300 * Isar: implicit use of prems from the Isar proof context is
4301 considered a legacy feature. Common applications like ``have A .''
4302 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4303 referencing facts explicitly here improves readability and
4304 maintainability of proof texts.
4306 * Isar: improper proof element 'guess' is like 'obtain', but derives
4307 the obtained context from the course of reasoning! For example:
4309 assume "EX x y. A x & B y" -- "any previous fact"
4310 then guess x and y by clarify
4312 This technique is potentially adventurous, depending on the facts and
4313 proof tools being involved here.
4315 * Isar: known facts from the proof context may be specified as literal
4316 propositions, using ASCII back-quote syntax. This works wherever
4317 named facts used to be allowed so far, in proof commands, proof
4318 methods, attributes etc. Literal facts are retrieved from the context
4319 according to unification of type and term parameters. For example,
4320 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4321 theorems in the current context, then these are valid literal facts:
4322 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4324 There is also a proof method "fact" which does the same composition
4325 for explicit goal states, e.g. the following proof texts coincide with
4326 certain special cases of literal facts:
4328 have "A" by fact == note `A`
4329 have "A ==> B" by fact == note `A ==> B`
4330 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4331 have "P a ==> Q a" by fact == note `P a ==> Q a`
4333 * Isar: ":" (colon) is no longer a symbolic identifier character in
4334 outer syntax. Thus symbolic identifiers may be used without
4335 additional white space in declarations like this: ``assume *: A''.
4337 * Isar: 'print_facts' prints all local facts of the current context,
4338 both named and unnamed ones.
4340 * Isar: 'def' now admits simultaneous definitions, e.g.:
4342 def x == "t" and y == "u"
4344 * Isar: added command 'unfolding', which is structurally similar to
4345 'using', but affects both the goal state and facts by unfolding given
4346 rewrite rules. Thus many occurrences of the 'unfold' method or
4347 'unfolded' attribute may be replaced by first-class proof text.
4349 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4350 and command 'unfolding' now all support object-level equalities
4351 (potentially conditional). The underlying notion of rewrite rule is
4352 analogous to the 'rule_format' attribute, but *not* that of the
4353 Simplifier (which is usually more generous).
4355 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4356 premises of a theorem by n. Useful in conjunction with drule.
4358 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4359 method expression within a sandbox consisting of the first N
4360 sub-goals, which need to exist. For example, ``simp_all [3]''
4361 simplifies the first three sub-goals, while (rule foo, simp_all)[]
4362 simplifies all new goals that emerge from applying rule foo to the
4363 originally first one.
4365 * Isar: schematic goals are no longer restricted to higher-order
4366 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
4369 * Isar: the conclusion of a long theorem statement is now either
4370 'shows' (a simultaneous conjunction, as before), or 'obtains'
4371 (essentially a disjunction of cases with local parameters and
4372 assumptions). The latter allows to express general elimination rules
4373 adequately; in this notation common elimination rules look like this:
4375 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
4377 obtains x where "P x"
4379 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
4383 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
4389 The subsequent classical rules even refer to the formal "thesis"
4392 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
4395 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
4396 obtains "thesis ==> something"
4398 The actual proof of an 'obtains' statement is analogous to that of the
4399 Isar proof element 'obtain', only that there may be several cases.
4400 Optional case names may be specified in parentheses; these will be
4401 available both in the present proof and as annotations in the
4402 resulting rule, for later use with the 'cases' method (cf. attribute
4405 * Isar: the assumptions of a long theorem statement are available as
4406 "assms" fact in the proof context. This is more appropriate than the
4407 (historical) "prems", which refers to all assumptions of the current
4408 context, including those from the target locale, proof body etc.
4410 * Isar: 'print_statement' prints theorems from the current theory or
4411 proof context in long statement form, according to the syntax of a
4414 * Isar: 'obtain' takes an optional case name for the local context
4415 introduction rule (default "that").
4417 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
4418 explicit (is "_ ==> ?foo") in the rare cases where this still happens
4421 * Pure: syntax "CONST name" produces a fully internalized constant
4422 according to the current context. This is particularly useful for
4423 syntax translations that should refer to internal constant
4424 representations independently of name spaces.
4426 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
4427 instead of "FOO ". This allows multiple binder declarations to coexist
4428 in the same context. INCOMPATIBILITY.
4430 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
4431 primitive that also works in a locale context (both for constants and
4432 fixed variables). Type declaration and internal syntactic representation
4433 of given constants retrieved from the context. Likewise, the
4434 'no_notation' command allows to remove given syntax annotations from the
4437 * Isar/locales: new derived specification elements 'axiomatization',
4438 'definition', 'abbreviation', which support type-inference, admit
4439 object-level specifications (equality, equivalence). See also the
4440 isar-ref manual. Examples:
4443 eq (infix "===" 50) where
4444 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
4446 definition "f x y = x + y + 1"
4447 definition g where "g x = f x x"
4450 neq (infix "=!=" 50) where
4451 "x =!= y == ~ (x === y)"
4453 These specifications may be also used in a locale context. Then the
4454 constants being introduced depend on certain fixed parameters, and the
4455 constant name is qualified by the locale base name. An internal
4456 abbreviation takes care for convenient input and output, making the
4457 parameters implicit and using the original short name. See also
4458 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
4459 entities from a monomorphic theory.
4461 Presently, abbreviations are only available 'in' a target locale, but
4462 not inherited by general import expressions. Also note that
4463 'abbreviation' may be used as a type-safe replacement for 'syntax' +
4464 'translations' in common applications. The "no_abbrevs" print mode
4465 prevents folding of abbreviations in term output.
4467 Concrete syntax is attached to specified constants in internal form,
4468 independently of name spaces. The parse tree representation is
4469 slightly different -- use 'notation' instead of raw 'syntax', and
4470 'translations' with explicit "CONST" markup to accommodate this.
4472 * Pure/Isar: unified syntax for new-style specification mechanisms
4473 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
4474 full type inference and dummy patterns ("_"). For example:
4476 definition "K x _ = x"
4478 inductive conj for A B
4479 where "A ==> B ==> conj A B"
4481 * Pure: command 'print_abbrevs' prints all constant abbreviations of
4482 the current context. Print mode "no_abbrevs" prevents inversion of
4483 abbreviations on output.
4485 * Isar/locales: improved parameter handling: use of locales "var" and
4486 "struct" no longer necessary; - parameter renamings are no longer
4487 required to be injective. For example, this allows to define
4488 endomorphisms as locale endom = homom mult mult h.
4490 * Isar/locales: changed the way locales with predicates are defined.
4491 Instead of accumulating the specification, the imported expression is
4492 now an interpretation. INCOMPATIBILITY: different normal form of
4493 locale expressions. In particular, in interpretations of locales with
4494 predicates, goals repesenting already interpreted fragments are not
4495 removed automatically. Use methods `intro_locales' and
4496 `unfold_locales'; see below.
4498 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4499 provide backward reasoning on locales predicates. The methods are
4500 aware of interpretations and discharge corresponding goals.
4501 `intro_locales' is less aggressive then `unfold_locales' and does not
4502 unfold predicates to assumptions.
4504 * Isar/locales: the order in which locale fragments are accumulated
4505 has changed. This enables to override declarations from fragments due
4506 to interpretations -- for example, unwanted simp rules.
4508 * Isar/locales: interpretation in theories and proof contexts has been
4509 extended. One may now specify (and prove) equations, which are
4510 unfolded in interpreted theorems. This is useful for replacing
4511 defined concepts (constants depending on locale parameters) by
4512 concepts already existing in the target context. Example:
4514 interpretation partial_order ["op <= :: [int, int] => bool"]
4515 where "partial_order.less (op <=) (x::int) y = (x < y)"
4517 Typically, the constant `partial_order.less' is created by a
4518 definition specification element in the context of locale
4521 * Method "induct": improved internal context management to support
4522 local fixes and defines on-the-fly. Thus explicit meta-level
4523 connectives !! and ==> are rarely required anymore in inductive goals
4524 (using object-logic connectives for this purpose has been long
4525 obsolete anyway). Common proof patterns are explained in
4526 src/HOL/Induct/Common_Patterns.thy, see also
4527 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4530 * Method "induct": improved handling of simultaneous goals. Instead of
4531 introducing object-level conjunction, the statement is now split into
4532 several conclusions, while the corresponding symbolic cases are nested
4533 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4534 see src/HOL/Induct/Common_Patterns.thy, for example.
4536 * Method "induct": mutual induction rules are now specified as a list
4537 of rule sharing the same induction cases. HOL packages usually provide
4538 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4539 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4540 mutual induction rules differently, i.e. like this:
4542 (induct rule: foo_bar.inducts)
4543 (induct set: foo bar)
4544 (induct pred: foo bar)
4545 (induct type: foo bar)
4547 The ML function ProjectRule.projections turns old-style rules into the
4550 * Method "coinduct": dual of induction, see
4551 src/HOL/Library/Coinductive_List.thy for various examples.
4553 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4554 considered a legacy feature.
4556 * Attribute "symmetric" produces result with standardized schematic
4557 variables (index 0). Potential INCOMPATIBILITY.
4559 * Simplifier: by default the simplifier trace only shows top level
4560 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4561 default. Thus there is less danger of being flooded by the trace. The
4562 trace indicates where parts have been suppressed.
4564 * Provers/classical: removed obsolete classical version of elim_format
4565 attribute; classical elim/dest rules are now treated uniformly when
4566 manipulating the claset.
4568 * Provers/classical: stricter checks to ensure that supplied intro,
4569 dest and elim rules are well-formed; dest and elim rules must have at
4572 * Provers/classical: attributes dest/elim/intro take an optional
4573 weight argument for the rule (just as the Pure versions). Weights are
4574 ignored by automated tools, but determine the search order of single
4577 * Syntax: input syntax now supports dummy variable binding "%_. b",
4578 where the body does not mention the bound variable. Note that dummy
4579 patterns implicitly depend on their context of bounds, which makes
4580 "{_. _}" match any set comprehension as expected. Potential
4581 INCOMPATIBILITY -- parse translations need to cope with syntactic
4582 constant "_idtdummy" in the binding position.
4584 * Syntax: removed obsolete syntactic constant "_K" and its associated
4585 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4586 for example "A -> B" => "Pi A (%_. B)".
4588 * Pure: 'class_deps' command visualizes the subclass relation, using
4589 the graph browser tool.
4591 * Pure: 'print_theory' now suppresses certain internal declarations by
4592 default; use '!' option for full details.
4597 * Method "metis" proves goals by applying the Metis general-purpose
4598 resolution prover (see also http://gilith.com/software/metis/).
4599 Examples are in the directory MetisExamples. WARNING: the
4600 Isabelle/HOL-Metis integration does not yet work properly with
4603 * Command 'sledgehammer' invokes external automatic theorem provers as
4604 background processes. It generates calls to the "metis" method if
4605 successful. These can be pasted into the proof. Users do not have to
4606 wait for the automatic provers to return. WARNING: does not really
4607 work with multi-threading.
4609 * New "auto_quickcheck" feature tests outermost goal statements for
4610 potential counter-examples. Controlled by ML references
4611 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4612 5000 milliseconds). Fails silently if statements is outside of
4613 executable fragment, or any other codgenerator problem occurs.
4615 * New constant "undefined" with axiom "undefined x = undefined".
4617 * Added class "HOL.eq", allowing for code generation with polymorphic
4620 * Some renaming of class constants due to canonical name prefixing in
4621 the new 'class' package:
4623 HOL.abs ~> HOL.abs_class.abs
4624 HOL.divide ~> HOL.divide_class.divide
4625 0 ~> HOL.zero_class.zero
4626 1 ~> HOL.one_class.one
4627 op + ~> HOL.plus_class.plus
4628 op - ~> HOL.minus_class.minus
4629 uminus ~> HOL.minus_class.uminus
4630 op * ~> HOL.times_class.times
4631 op < ~> HOL.ord_class.less
4632 op <= > HOL.ord_class.less_eq
4633 Nat.power ~> Power.power_class.power
4634 Nat.size ~> Nat.size_class.size
4635 Numeral.number_of ~> Numeral.number_class.number_of
4636 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4637 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4638 Orderings.min ~> Orderings.ord_class.min
4639 Orderings.max ~> Orderings.ord_class.max
4640 Divides.op div ~> Divides.div_class.div
4641 Divides.op mod ~> Divides.div_class.mod
4642 Divides.op dvd ~> Divides.div_class.dvd
4644 INCOMPATIBILITY. Adaptions may be required in the following cases:
4646 a) User-defined constants using any of the names "plus", "minus",
4647 "times", "less" or "less_eq". The standard syntax translations for
4648 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4651 b) Variables named "plus", "minus", "times", "less", "less_eq"
4652 INCOMPATIBILITY: use more specific names.
4654 c) Permutative equations (e.g. "a + b = b + a")
4655 Since the change of names also changes the order of terms, permutative
4656 rewrite rules may get applied in a different order. Experience shows
4657 that this is rarely the case (only two adaptions in the whole Isabelle
4658 distribution). INCOMPATIBILITY: rewrite proofs
4660 d) ML code directly refering to constant names
4661 This in general only affects hand-written proof tactics, simprocs and
4662 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4663 Consider using @{const_name} antiquotation.
4665 * New class "default" with associated constant "default".
4667 * Function "sgn" is now overloaded and available on int, real, complex
4668 (and other numeric types), using class "sgn". Two possible defs of
4669 sgn are given as equational assumptions in the classes sgn_if and
4670 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4673 * Locale "partial_order" now unified with class "order" (cf. theory
4674 Orderings), added parameter "less". INCOMPATIBILITY.
4676 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4677 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4678 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4680 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4681 changed order of proof goals in instance proofs.
4683 * The transitivity reasoner for partial and linear orders is set up
4684 for classes "order" and "linorder". Instances of the reasoner are available
4685 in all contexts importing or interpreting the corresponding locales.
4686 Method "order" invokes the reasoner separately; the reasoner
4687 is also integrated with the Simplifier as a solver. Diagnostic
4688 command 'print_orders' shows the available instances of the reasoner
4689 in the current context.
4691 * Localized monotonicity predicate in theory "Orderings"; integrated
4692 lemmas max_of_mono and min_of_mono with this predicate.
4695 * Formulation of theorem "dense" changed slightly due to integration
4696 with new class dense_linear_order.
4698 * Uniform lattice theory development in HOL.
4700 constants "meet" and "join" now named "inf" and "sup"
4701 constant "Meet" now named "Inf"
4703 classes "meet_semilorder" and "join_semilorder" now named
4704 "lower_semilattice" and "upper_semilattice"
4705 class "lorder" now named "lattice"
4706 class "comp_lat" now named "complete_lattice"
4708 Instantiation of lattice classes allows explicit definitions
4709 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4711 INCOMPATIBILITY. Theorem renames:
4713 meet_left_le ~> inf_le1
4714 meet_right_le ~> inf_le2
4715 join_left_le ~> sup_ge1
4716 join_right_le ~> sup_ge2
4717 meet_join_le ~> inf_sup_ord
4720 le_meet ~> le_inf_iff
4721 le_join ~> ge_sup_conv
4722 meet_idempotent ~> inf_idem
4723 join_idempotent ~> sup_idem
4724 meet_comm ~> inf_commute
4725 join_comm ~> sup_commute
4726 meet_leI1 ~> le_infI1
4727 meet_leI2 ~> le_infI2
4728 le_joinI1 ~> le_supI1
4729 le_joinI2 ~> le_supI2
4730 meet_assoc ~> inf_assoc
4731 join_assoc ~> sup_assoc
4732 meet_left_comm ~> inf_left_commute
4733 meet_left_idempotent ~> inf_left_idem
4734 join_left_comm ~> sup_left_commute
4735 join_left_idempotent ~> sup_left_idem
4738 le_def_meet ~> le_iff_inf
4739 le_def_join ~> le_iff_sup
4740 join_absorp2 ~> sup_absorb2
4741 join_absorp1 ~> sup_absorb1
4742 meet_absorp1 ~> inf_absorb1
4743 meet_absorp2 ~> inf_absorb2
4744 meet_join_absorp ~> inf_sup_absorb
4745 join_meet_absorp ~> sup_inf_absorb
4746 distrib_join_le ~> distrib_sup_le
4747 distrib_meet_le ~> distrib_inf_le
4749 add_meet_distrib_left ~> add_inf_distrib_left
4750 add_join_distrib_left ~> add_sup_distrib_left
4751 is_join_neg_meet ~> is_join_neg_inf
4752 is_meet_neg_join ~> is_meet_neg_sup
4753 add_meet_distrib_right ~> add_inf_distrib_right
4754 add_join_distrib_right ~> add_sup_distrib_right
4755 add_meet_join_distribs ~> add_sup_inf_distribs
4756 join_eq_neg_meet ~> sup_eq_neg_inf
4757 meet_eq_neg_join ~> inf_eq_neg_sup
4758 add_eq_meet_join ~> add_eq_inf_sup
4759 meet_0_imp_0 ~> inf_0_imp_0
4760 join_0_imp_0 ~> sup_0_imp_0
4761 meet_0_eq_0 ~> inf_0_eq_0
4762 join_0_eq_0 ~> sup_0_eq_0
4763 neg_meet_eq_join ~> neg_inf_eq_sup
4764 neg_join_eq_meet ~> neg_sup_eq_inf
4765 join_eq_if ~> sup_eq_if
4767 mono_meet ~> mono_inf
4768 mono_join ~> mono_sup
4769 meet_bool_eq ~> inf_bool_eq
4770 join_bool_eq ~> sup_bool_eq
4771 meet_fun_eq ~> inf_fun_eq
4772 join_fun_eq ~> sup_fun_eq
4773 meet_set_eq ~> inf_set_eq
4774 join_set_eq ~> sup_set_eq
4775 meet1_iff ~> inf1_iff
4776 meet2_iff ~> inf2_iff
4785 join1_iff ~> sup1_iff
4786 join2_iff ~> sup2_iff
4796 is_meet_Meet ~> is_meet_Inf
4797 Meet_bool_def ~> Inf_bool_def
4798 Meet_fun_def ~> Inf_fun_def
4799 Meet_greatest ~> Inf_greatest
4800 Meet_lower ~> Inf_lower
4801 Meet_set_def ~> Inf_set_def
4804 Sup_bool_eq ~> Sup_bool_def
4805 Sup_fun_eq ~> Sup_fun_def
4806 Sup_set_eq ~> Sup_set_def
4808 listsp_meetI ~> listsp_infI
4809 listsp_meet_eq ~> listsp_inf_eq
4814 * Added syntactic class "size"; overloaded constant "size" now has
4815 type "'a::size ==> bool"
4817 * Internal reorganisation of `size' of datatypes: size theorems
4818 "foo.size" are no longer subsumed by "foo.simps" (but are still
4819 simplification rules by default!); theorems "prod.size" now named
4822 * Class "div" now inherits from class "times" rather than "type".
4825 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4826 Linorder etc. have disappeared; operations defined in terms of
4827 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4829 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4831 * HOL-Word: New extensive library and type for generic, fixed size
4832 machine words, with arithmetic, bit-wise, shifting and rotating
4833 operations, reflection into int, nat, and bool lists, automation for
4834 linear arithmetic (by automatic reflection into nat or int), including
4835 lemmas on overflow and monotonicity. Instantiated to all appropriate
4836 arithmetic type classes, supporting automatic simplification of
4837 numerals on all operations.
4839 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4841 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4843 * Code generator library theories:
4844 - Code_Integer represents HOL integers by big integer literals in target
4846 - Code_Char represents HOL characters by character literals in target
4848 - Code_Char_chr like Code_Char, but also offers treatment of character
4849 codes; includes Code_Integer.
4850 - Executable_Set allows to generate code for finite sets using lists.
4851 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4853 - Executable_Real implements a subset of real numbers, namly those
4854 representable by rational numbers.
4855 - Efficient_Nat implements natural numbers by integers, which in general will
4856 result in higher efficency; pattern matching with 0/Suc is eliminated;
4857 includes Code_Integer.
4858 - Code_Index provides an additional datatype index which is mapped to
4859 target-language built-in integers.
4860 - Code_Message provides an additional datatype message_string which is isomorphic to
4861 strings; messages are mapped to target-language strings.
4863 * New package for inductive predicates
4865 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4868 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4869 for z_1 :: U_1 and ... and z_n :: U_m
4871 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4874 with full support for type-inference, rather than
4876 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4878 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4879 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4881 inductive "s z_1 ... z_m"
4883 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4886 For backward compatibility, there is a wrapper allowing inductive
4887 sets to be defined with the new package via
4890 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4891 for z_1 :: U_1 and ... and z_n :: U_m
4893 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4899 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4900 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4901 for z_1 :: U_1 and ... and z_n :: U_m
4903 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4904 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4907 if the additional syntax "p ..." is required.
4909 Numerous examples can be found in the subdirectories src/HOL/Auth,
4910 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4914 - Since declaration and definition of inductive sets or predicates
4915 is no longer separated, abbreviations involving the newly
4916 introduced sets or predicates must be specified together with the
4917 introduction rules after the 'where' keyword (see above), rather
4918 than before the actual inductive definition.
4920 - The variables in induction and elimination rules are now
4921 quantified in the order of their occurrence in the introduction
4922 rules, rather than in alphabetical order. Since this may break
4923 some proofs, these proofs either have to be repaired, e.g. by
4924 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4925 statements of the form
4927 case (rule_i a_i_1 ... a_i_{k_i})
4929 or the old order of quantification has to be restored by explicitly adding
4930 meta-level quantifiers in the introduction rules, i.e.
4932 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4934 - The format of the elimination rules is now
4936 p z_1 ... z_m x_1 ... x_n ==>
4937 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4942 (x_1, ..., x_n) : s z_1 ... z_m ==>
4943 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4946 for sets rather than
4948 x : s z_1 ... z_m ==>
4949 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4952 This may require terms in goals to be expanded to n-tuples
4953 (e.g. using case_tac or simplification with the split_paired_all
4954 rule) before the above elimination rule is applicable.
4956 - The elimination or case analysis rules for (mutually) inductive
4957 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4958 list of rules "p_1_..._p_k.elims" is no longer available.
4960 * New package "function"/"fun" for general recursive functions,
4961 supporting mutual and nested recursion, definitions in local contexts,
4962 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4963 for small examples, and the separate tutorial on the function
4964 package. The old recdef "package" is still available as before, but
4965 users are encouraged to use the new package.
4967 * Method "lexicographic_order" automatically synthesizes termination
4968 relations as lexicographic combinations of size measures.
4970 * Case-expressions allow arbitrary constructor-patterns (including
4971 "_") and take their order into account, like in functional
4972 programming. Internally, this is translated into nested
4973 case-expressions; missing cases are added and mapped to the predefined
4974 constant "undefined". In complicated cases printing may no longer show
4975 the original input but the internal form. Lambda-abstractions allow
4976 the same form of pattern matching: "% pat1 => e1 | ..." is an
4977 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4980 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4981 is an abbreviation for "of_nat :: nat => int". The simplification
4982 rules for "of_nat" have been changed to work like "int" did
4983 previously. Potential INCOMPATIBILITY:
4984 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4985 - of_nat_diff and of_nat_mult are no longer default simp rules
4987 * Method "algebra" solves polynomial equations over (semi)rings using
4988 Groebner bases. The (semi)ring structure is defined by locales and the
4989 tool setup depends on that generic context. Installing the method for
4990 a specific type involves instantiating the locale and possibly adding
4991 declarations for computation on the coefficients. The method is
4992 already instantiated for natural numbers and for the axiomatic class
4993 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4994 CALCULEMUS 2007 for the general principles underlying this
4995 architecture of context-aware proof-tools.
4997 * Method "ferrack" implements quantifier elimination over
4998 special-purpose dense linear orders using locales (analogous to
4999 "algebra"). The method is already installed for class
5000 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5003 * Former constant "List.op @" now named "List.append". Use ML
5004 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5005 circumvent possible incompatibilities when working on ML level.
5007 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5009 * New function listsum :: 'a list => 'a for arbitrary monoids.
5010 Special syntax: "SUM x <- xs. f x" (and latex variants)
5012 * New syntax for Haskell-like list comprehension (input only), eg.
5013 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5015 * The special syntax for function "filter" has changed from [x :
5016 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5017 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5019 * [a..b] is now defined for arbitrary linear orders. It used to be
5020 defined on nat only, as an abbreviation for [a..<Suc b]
5023 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5025 * New functions "sorted" and "sort" in src/HOL/List.thy.
5027 * New lemma collection field_simps (an extension of ring_simps) for
5028 manipulating (in)equations involving division. Multiplies with all
5029 denominators that can be proved to be non-zero (in equations) or
5030 positive/negative (in inequations).
5032 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5033 have been improved and renamed to ring_simps, group_simps and
5034 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5035 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5037 * Theory Library/Commutative_Ring: switched from recdef to function
5038 package; constants add, mul, pow now curried. Infix syntax for
5039 algebraic operations.
5041 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5044 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5047 * HOL/records: generalised field-update to take a function on the
5048 field rather than the new value: r(|A := x|) is translated to A_update
5049 (K x) r The K-combinator that is internally used is called K_record.
5050 INCOMPATIBILITY: Usage of the plain update functions has to be
5053 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5054 * x = 0, which are required for a semiring. Richer structures do not
5055 inherit from semiring_0 anymore, because this property is a theorem
5056 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5057 there is more to prove, but this is mostly trivial.
5059 * Class "recpower" is generalized to arbitrary monoids, not just
5060 commutative semirings. INCOMPATIBILITY: may need to incorporate
5061 commutativity or semiring properties additionally.
5063 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5064 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5065 better use 'abbreviation'.
5067 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5069 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5070 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5071 significant changes for setting up numeral syntax for types:
5072 - New constants Numeral.pred and Numeral.succ instead
5073 of former Numeral.bin_pred and Numeral.bin_succ.
5074 - Use integer operations instead of bin_add, bin_mult and so on.
5075 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5076 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5078 See src/HOL/Integ/IntArith.thy for an example setup.
5080 * Command 'normal_form' computes the normal form of a term that may
5081 contain free variables. For example ``normal_form "rev [a, b, c]"''
5082 produces ``[b, c, a]'' (without proof). This command is suitable for
5083 heavy-duty computations because the functions are compiled to ML
5084 first. Correspondingly, a method "normalization" is provided. See
5085 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5087 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5088 25 like -->); output depends on the "iff" print_mode, the default is
5089 "A = B" (with priority 50).
5091 * Relations less (<) and less_eq (<=) are also available on type bool.
5092 Modified syntax to disallow nesting without explicit parentheses,
5093 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5096 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5098 * Relation composition operator "op O" now has precedence 75 and binds
5099 stronger than union and intersection. INCOMPATIBILITY.
5101 * The old set interval syntax "{m..n(}" (and relatives) has been
5102 removed. Use "{m..<n}" (and relatives) instead.
5104 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5105 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5106 ``declare [[simproc del: neq]]''.
5108 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5111 * Theorem Cons_eq_map_conv no longer declared as "simp".
5113 * Theorem setsum_mult renamed to setsum_right_distrib.
5115 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5118 * Reimplemented methods "sat" and "satx", with several improvements:
5119 goals no longer need to be stated as "<prems> ==> False", equivalences
5120 (i.e. "=" on type bool) are handled, variable names of the form
5121 "lit_<n>" are no longer reserved, significant speedup.
5123 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5124 zChaff is still supported as well.
5126 * 'inductive' and 'datatype': provide projections of mutual rules,
5127 bundled as foo_bar.inducts;
5129 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5132 * Library: moved theory Accessible_Part to main HOL.
5134 * Library: added theory Coinductive_List of potentially infinite lists
5135 as greatest fixed-point.
5137 * Library: added theory AssocList which implements (finite) maps as
5140 * Method "evaluation" solves goals (i.e. a boolean expression)
5141 efficiently by compiling it to ML. The goal is "proved" (via an
5142 oracle) if it evaluates to True.
5144 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5145 also when invoked by the simplifier. This results in the Simplifier
5146 being more powerful on arithmetic goals. INCOMPATIBILITY.
5147 Configuration option fast_arith_split_limit=0 recovers the old
5150 * Support for hex (0x20) and binary (0b1001) numerals.
5152 * New method: reify eqs (t), where eqs are equations for an
5153 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5154 parameter, computes a term s::'b and a list xs::'a list and proves the
5155 theorem I xs s = t. This is also known as reification or quoting. The
5156 resulting theorem is applied to the subgoal to substitute t with I xs
5157 s. If t is omitted, the subgoal itself is reified.
5159 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5160 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5161 where f is supposed to be a computable function (in the sense of code
5162 generattion). The method uses reify to compute s and xs as above then
5163 applies corr_thm and uses normalization by evaluation to "prove" f s =
5164 r and finally gets the theorem t = r, which is again applied to the
5165 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5167 * Reflection: Automatic reification now handels binding, an example is
5168 available in src/HOL/ex/ReflectionEx.thy
5170 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5171 command 'statespace' that is similar to 'record', but introduces an
5172 abstract specification based on the locale infrastructure instead of
5173 HOL types. This leads to extra flexibility in composing state spaces,
5174 in particular multiple inheritance and renaming of components.
5179 * Hyperreal: Functions root and sqrt are now defined on negative real
5180 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5181 Nonnegativity side conditions have been removed from many lemmas, so
5182 that more subgoals may now be solved by simplification; potential
5185 * Real: new type classes formalize real normed vector spaces and
5186 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5187 and norm :: 'a => real.
5189 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5190 reals into other types. The overloaded constant Reals :: 'a set is now
5191 defined as range of_real; potential INCOMPATIBILITY.
5193 * Real: proper support for ML code generation, including 'quickcheck'.
5194 Reals are implemented as arbitrary precision rationals.
5196 * Hyperreal: Several constants that previously worked only for the
5197 reals have been generalized, so they now work over arbitrary vector
5198 spaces. Type annotations may need to be added in some cases; potential
5201 Infinitesimal :: ('a::real_normed_vector) star set
5202 HFinite :: ('a::real_normed_vector) star set
5203 HInfinite :: ('a::real_normed_vector) star set
5204 approx :: ('a::real_normed_vector) star => 'a star => bool
5205 monad :: ('a::real_normed_vector) star => 'a star set
5206 galaxy :: ('a::real_normed_vector) star => 'a star set
5207 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5208 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5209 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5210 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5211 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5212 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5213 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5214 sgn :: 'a::real_normed_vector => 'a
5215 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5217 * Complex: Some complex-specific constants are now abbreviations for
5218 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5219 hnorm. Other constants have been entirely removed in favor of the
5220 polymorphic versions (INCOMPATIBILITY):
5224 HInfinite <-- CInfinite
5225 Infinitesimal <-- CInfinitesimal
5228 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5229 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5230 (ns)deriv <-- (ns)cderiv
5235 * Formalisation of ideals and the quotient construction over rings.
5237 * Order and lattice theory no longer based on records.
5240 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5241 greatest_closed. INCOMPATIBILITY.
5243 * Method algebra is now set up via an attribute. For examples see
5244 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5245 of algebraic structures.
5247 * Renamed theory CRing to Ring.
5252 * Substantial, yet incomplete support for nominal datatypes (binding
5253 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5254 src/HOL/Nominal/Examples. Prospective users should consult
5255 http://isabelle.in.tum.de/nominal/
5260 * ML basics: just one true type int, which coincides with IntInf.int
5263 * ML within Isar: antiquotations allow to embed statically-checked
5264 formal entities in the source, referring to the context available at
5265 compile-time. For example:
5267 ML {* @{sort "{zero,one}"} *}
5268 ML {* @{typ "'a => 'b"} *}
5269 ML {* @{term "%x. x"} *}
5270 ML {* @{prop "x == y"} *}
5271 ML {* @{ctyp "'a => 'b"} *}
5272 ML {* @{cterm "%x. x"} *}
5273 ML {* @{cprop "x == y"} *}
5274 ML {* @{thm asm_rl} *}
5275 ML {* @{thms asm_rl} *}
5276 ML {* @{type_name c} *}
5277 ML {* @{type_syntax c} *}
5278 ML {* @{const_name c} *}
5279 ML {* @{const_syntax c} *}
5282 ML {* @{theory Pure} *}
5283 ML {* @{theory_ref} *}
5284 ML {* @{theory_ref Pure} *}
5287 ML {* @{clasimpset} *}
5289 The same works for sources being ``used'' within an Isar context.
5291 * ML in Isar: improved error reporting; extra verbosity with
5292 ML_Context.trace enabled.
5294 * Pure/General/table.ML: the join operations now works via exceptions
5295 DUP/SAME instead of type option. This is simpler in simple cases, and
5296 admits slightly more efficient complex applications.
5298 * Pure: 'advanced' translation functions (parse_translation etc.) now
5299 use Context.generic instead of just theory.
5301 * Pure: datatype Context.generic joins theory/Proof.context and
5302 provides some facilities for code that works in either kind of
5303 context, notably GenericDataFun for uniform theory and proof data.
5305 * Pure: simplified internal attribute type, which is now always
5306 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5307 local (Proof.context) attributes have been discontinued, while
5308 minimizing code duplication. Thm.rule_attribute and
5309 Thm.declaration_attribute build canonical attributes; see also structure
5310 Context for further operations on Context.generic, notably
5311 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5312 declarations and definitions.
5314 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5315 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5316 init only required for impure data. INCOMPATIBILITY: empty really need
5317 to be empty (no dependencies on theory content!)
5319 * Pure/kernel: consts certification ignores sort constraints given in
5320 signature declarations. (This information is not relevant to the
5321 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5322 potential INCOMPATIBILITY.
5324 * Pure: axiomatic type classes are now purely definitional, with
5325 explicit proofs of class axioms and super class relations performed
5326 internally. See Pure/axclass.ML for the main internal interfaces --
5327 notably AxClass.define_class supercedes AxClass.add_axclass, and
5328 AxClass.axiomatize_class/classrel/arity supersede
5329 Sign.add_classes/classrel/arities.
5331 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5332 global/local versions on theory vs. Proof.context have been
5333 discontinued; Attrib.syntax and Method.syntax have been adapted
5334 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5335 attributes, methods, etc.
5337 * Pure: several functions of signature "... -> theory -> theory * ..."
5338 have been reoriented to "... -> theory -> ... * theory" in order to
5339 allow natural usage in combination with the ||>, ||>>, |-> and
5340 fold_map combinators.
5342 * Pure: official theorem names (closed derivations) and additional
5343 comments (tags) are now strictly separate. Name hints -- which are
5344 maintained as tags -- may be attached any time without affecting the
5347 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5348 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5349 achieve the old behaviour.
5351 * Pure: the "Goal" constant is now called "prop", supporting a
5352 slightly more general idea of ``protecting'' meta-level rule
5355 * Pure: Logic.(un)varify only works in a global context, which is now
5356 enforced instead of silently assumed. INCOMPATIBILITY, may use
5357 Logic.legacy_(un)varify as temporary workaround.
5359 * Pure: structure Name provides scalable operations for generating
5360 internal variable names, notably Name.variants etc. This replaces
5361 some popular functions from term.ML:
5363 Term.variant -> Name.variant
5364 Term.variantlist -> Name.variant_list
5365 Term.invent_names -> Name.invent_list
5367 Note that low-level renaming rarely occurs in new code -- operations
5368 from structure Variable are used instead (see below).
5370 * Pure: structure Variable provides fundamental operations for proper
5371 treatment of fixed/schematic variables in a context. For example,
5372 Variable.import introduces fixes for schematics of given facts and
5373 Variable.export reverses the effect (up to renaming) -- this replaces
5374 various freeze_thaw operations.
5376 * Pure: structure Goal provides simple interfaces for
5377 init/conclude/finish and tactical prove operations (replacing former
5378 Tactic.prove). Goal.prove is the canonical way to prove results
5379 within a given context; Goal.prove_global is a degraded version for
5380 theory level goals, including a global Drule.standard. Note that
5381 OldGoals.prove_goalw_cterm has long been obsolete, since it is
5382 ill-behaved in a local proof context (e.g. with local fixes/assumes or
5383 in a locale context).
5385 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
5386 and type checking (Syntax.check_term etc.), with common combinations
5387 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
5388 which are considered legacy and await removal.
5390 * Pure/Syntax: generic interfaces for type unchecking
5391 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
5392 with common combinations (Syntax.pretty_term, Syntax.string_of_term
5393 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
5394 available for convenience, but refer to the very same operations using
5395 a mere theory instead of a full context.
5397 * Isar: simplified treatment of user-level errors, using exception
5398 ERROR of string uniformly. Function error now merely raises ERROR,
5399 without any side effect on output channels. The Isar toplevel takes
5400 care of proper display of ERROR exceptions. ML code may use plain
5401 handle/can/try; cat_error may be used to concatenate errors like this:
5403 ... handle ERROR msg => cat_error msg "..."
5405 Toplevel ML code (run directly or through the Isar toplevel) may be
5406 embedded into the Isar toplevel with exception display/debug like
5409 Isar.toplevel (fn () => ...)
5411 INCOMPATIBILITY, removed special transform_error facilities, removed
5412 obsolete variants of user-level exceptions (ERROR_MESSAGE,
5413 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
5414 -- use plain ERROR instead.
5416 * Isar: theory setup now has type (theory -> theory), instead of a
5417 list. INCOMPATIBILITY, may use #> to compose setup functions.
5419 * Isar: ML toplevel pretty printer for type Proof.context, subject to
5420 ProofContext.debug/verbose flags.
5422 * Isar: Toplevel.theory_to_proof admits transactions that modify the
5423 theory before entering a proof state. Transactions now always see a
5424 quasi-functional intermediate checkpoint, both in interactive and
5427 * Isar: simplified interfaces for outer syntax. Renamed
5428 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
5429 OuterSyntax.add_parsers -- this functionality is now included in
5430 OuterSyntax.command etc. INCOMPATIBILITY.
5432 * Simplifier: the simpset of a running simplification process now
5433 contains a proof context (cf. Simplifier.the_context), which is the
5434 very context that the initial simpset has been retrieved from (by
5435 simpset_of/local_simpset_of). Consequently, all plug-in components
5436 (solver, looper etc.) may depend on arbitrary proof data.
5438 * Simplifier.inherit_context inherits the proof context (plus the
5439 local bounds) of the current simplification process; any simproc
5440 etc. that calls the Simplifier recursively should do this! Removed
5441 former Simplifier.inherit_bounds, which is already included here --
5442 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
5443 specify an explicit context using Simplifier.context/theory_context.
5445 * Simplifier/Classical Reasoner: more abstract interfaces
5446 change_simpset/claset for modifying the simpset/claset reference of a
5447 theory; raw versions simpset/claset_ref etc. have been discontinued --
5450 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
5456 * settings: the default heap location within ISABELLE_HOME_USER now
5457 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
5458 Isabelle installations.
5460 * isabelle-process: option -S (secure mode) disables some critical
5461 operations, notably runtime compilation and evaluation of ML source
5464 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
5466 * Support for parallel execution, using native multicore support of
5467 Poly/ML 5.1. The theory loader exploits parallelism when processing
5468 independent theories, according to the given theory header
5469 specifications. The maximum number of worker threads is specified via
5470 usedir option -M or the "max-threads" setting in Proof General. A
5471 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
5472 to 6 on a 8-core machine. User-code needs to observe certain
5473 guidelines for thread-safe programming, see appendix A in the Isar
5474 Implementation manual.
5478 New in Isabelle2005 (October 2005)
5479 ----------------------------------
5483 * Theory headers: the new header syntax for Isar theories is
5486 imports <theory1> ... <theoryN>
5487 uses <file1> ... <fileM>
5490 where the 'uses' part is optional. The previous syntax
5492 theory <name> = <theory1> + ... + <theoryN>:
5494 will disappear in the next release. Use isatool fixheaders to convert
5495 existing theory files. Note that there is no change in ancient
5496 non-Isar theories now, but these will disappear soon.
5498 * Theory loader: parent theories can now also be referred to via
5499 relative and absolute paths.
5501 * Command 'find_theorems' searches for a list of criteria instead of a
5502 list of constants. Known criteria are: intro, elim, dest, name:string,
5503 simp:term, and any term. Criteria can be preceded by '-' to select
5504 theorems that do not match. Intro, elim, dest select theorems that
5505 match the current goal, name:s selects theorems whose fully qualified
5506 name contain s, and simp:term selects all simplification rules whose
5507 lhs match term. Any other term is interpreted as pattern and selects
5508 all theorems matching the pattern. Available in ProofGeneral under
5509 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5511 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5513 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5514 matching the current goal as introduction rule and not having "HOL."
5515 in their name (i.e. not being defined in theory HOL).
5517 * Command 'thms_containing' has been discontinued in favour of
5518 'find_theorems'; INCOMPATIBILITY.
5520 * Communication with Proof General is now 8bit clean, which means that
5521 Unicode text in UTF-8 encoding may be used within theory texts (both
5522 formal and informal parts). Cf. option -U of the Isabelle Proof
5523 General interface. Here are some simple examples (cf. src/HOL/ex):
5525 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5526 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5528 * Improved efficiency of the Simplifier and, to a lesser degree, the
5529 Classical Reasoner. Typical big applications run around 2 times
5533 *** Document preparation ***
5535 * Commands 'display_drafts' and 'print_drafts' perform simple output
5536 of raw sources. Only those symbols that do not require additional
5537 LaTeX packages (depending on comments in isabellesym.sty) are
5538 displayed properly, everything else is left verbatim. isatool display
5539 and isatool print are used as front ends (these are subject to the
5540 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5542 * Command tags control specific markup of certain regions of text,
5543 notably folding and hiding. Predefined tags include "theory" (for
5544 theory begin and end), "proof" for proof commands, and "ML" for
5545 commands involving ML code; the additional tags "visible" and
5546 "invisible" are unused by default. Users may give explicit tag
5547 specifications in the text, e.g. ''by %invisible (auto)''. The
5548 interpretation of tags is determined by the LaTeX job during document
5549 preparation: see option -V of isatool usedir, or options -n and -t of
5550 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5553 Several document versions may be produced at the same time via isatool
5554 usedir (the generated index.html will link all of them). Typical
5555 specifications include ''-V document=theory,proof,ML'' to present
5556 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5557 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5558 these parts without any formal replacement text. The Isabelle site
5559 default settings produce ''document'' and ''outline'' versions as
5562 * Several new antiquotations:
5564 @{term_type term} prints a term with its type annotated;
5566 @{typeof term} prints the type of a term;
5568 @{const const} is the same as @{term const}, but checks that the
5569 argument is a known logical constant;
5571 @{term_style style term} and @{thm_style style thm} print a term or
5572 theorem applying a "style" to it
5576 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5577 definitions, equations, inequations etc., 'concl' printing only the
5578 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5579 to print the specified premise. TermStyle.add_style provides an ML
5580 interface for introducing further styles. See also the "LaTeX Sugar"
5581 document practical applications. The ML antiquotation prints
5582 type-checked ML expressions verbatim.
5584 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5585 and 'text' support optional locale specification '(in loc)', which
5586 specifies the default context for interpreting antiquotations. For
5587 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5589 * Option 'locale=NAME' of antiquotations specifies an alternative
5590 context interpreting the subsequent argument. For example: @{thm
5591 [locale=lattice] inf_assoc}.
5593 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5596 * Proper output of antiquotations for theory commands involving a
5597 proof context (such as 'locale' or 'theorem (in loc) ...').
5599 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5600 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5602 * isatool usedir: new option -C (default true) controls whether option
5603 -D should include a copy of the original document directory; -C false
5604 prevents unwanted effects such as copying of administrative CVS data.
5609 * Considerably improved version of 'constdefs' command. Now performs
5610 automatic type-inference of declared constants; additional support for
5611 local structure declarations (cf. locales and HOL records), see also
5612 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5613 sequential dependencies of definitions within a single 'constdefs'
5614 section; moreover, the declared name needs to be an identifier. If
5615 all fails, consider to fall back on 'consts' and 'defs' separately.
5617 * Improved indexed syntax and implicit structures. First of all,
5618 indexed syntax provides a notational device for subscripted
5619 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5620 expressions. Secondly, in a local context with structure
5621 declarations, number indexes \<^sub>n or the empty index (default
5622 number 1) refer to a certain fixed variable implicitly; option
5623 show_structs controls printing of implicit structures. Typical
5624 applications of these concepts involve record types and locales.
5626 * New command 'no_syntax' removes grammar declarations (and
5627 translations) resulting from the given syntax specification, which is
5628 interpreted in the same manner as for the 'syntax' command.
5630 * 'Advanced' translation functions (parse_translation etc.) may depend
5631 on the signature of the theory context being presently used for
5632 parsing/printing, see also isar-ref manual.
5634 * Improved 'oracle' command provides a type-safe interface to turn an
5635 ML expression of type theory -> T -> term into a primitive rule of
5636 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5637 is already included here); see also FOL/ex/IffExample.thy;
5640 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5641 before); "cI" is no longer bound, use "c.intro" instead.
5642 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5643 axclasses vs. locales.
5645 * Improved internal renaming of symbolic identifiers -- attach primes
5646 instead of base 26 numbers.
5648 * New flag show_question_marks controls printing of leading question
5649 marks in schematic variable names.
5651 * In schematic variable names, *any* symbol following \<^isub> or
5652 \<^isup> is now treated as part of the base name. For example, the
5653 following works without printing of awkward ".0" indexes:
5655 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5658 * Inner syntax includes (*(*nested*) comments*).
5660 * Pretty printer now supports unbreakable blocks, specified in mixfix
5661 annotations as "(00...)".
5663 * Clear separation of logical types and nonterminals, where the latter
5664 may only occur in 'syntax' specifications or type abbreviations.
5665 Before that distinction was only partially implemented via type class
5666 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5667 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5668 exotic syntax specifications may require further adaption
5669 (e.g. Cube/Cube.thy).
5671 * Removed obsolete type class "logic", use the top sort {} instead.
5672 Note that non-logical types should be declared as 'nonterminals'
5673 rather than 'types'. INCOMPATIBILITY for new object-logic
5676 * Attributes 'induct' and 'cases': type or set names may now be
5677 locally fixed variables as well.
5679 * Simplifier: can now control the depth to which conditional rewriting
5680 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5683 * Simplifier: simplification procedures may now take the current
5684 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5685 interface), which is very useful for calling the Simplifier
5686 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5687 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5688 low-level mk_simproc no longer applies Logic.varify internally, to
5689 allow for use in a context of fixed variables.
5691 * thin_tac now works even if the assumption being deleted contains !!
5692 or ==>. More generally, erule now works even if the major premise of
5693 the elimination rule contains !! or ==>.
5695 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5697 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5698 from Pure, which contains all common declarations already. Both
5699 theories are defined via plain Isabelle/Isar .thy files.
5700 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5701 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5702 use isatool fixcpure to adapt your theory and ML sources.
5704 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5705 selections of theorems in named facts via index ranges.
5707 * 'print_theorems': in theory mode, really print the difference
5708 wrt. the last state (works for interactive theory development only),
5709 in proof mode print all local facts (cf. 'print_facts');
5711 * 'hide': option '(open)' hides only base names.
5713 * More efficient treatment of intermediate checkpoints in interactive
5716 * Code generator is now invoked via code_module (incremental code
5717 generation) and code_library (modular code generation, ML structures
5718 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5719 must be quoted when used as identifiers.
5721 * New 'value' command for reading, evaluating and printing terms using
5722 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5723 quoted when used as identifier.
5728 * New commands for the interpretation of locale expressions in
5729 theories (1), locales (2) and proof contexts (3). These generate
5730 proof obligations from the expression specification. After the
5731 obligations have been discharged, theorems of the expression are added
5732 to the theory, target locale or proof context. The synopsis of the
5733 commands is a follows:
5735 (1) interpretation expr inst
5736 (2) interpretation target < expr
5737 (3) interpret expr inst
5739 Interpretation in theories and proof contexts require a parameter
5740 instantiation of terms from the current context. This is applied to
5741 specifications and theorems of the interpreted expression.
5742 Interpretation in locales only permits parameter renaming through the
5743 locale expression. Interpretation is smart in that interpretations
5744 that are active already do not occur in proof obligations, neither are
5745 instantiated theorems stored in duplicate. Use 'print_interps' to
5746 inspect active interpretations of a particular locale. For details,
5747 see the Isar Reference manual. Examples can be found in
5748 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5750 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5751 'interpret' instead.
5753 * New context element 'constrains' for adding type constraints to
5756 * Context expressions: renaming of parameters with syntax
5759 * Locale declaration: 'includes' disallowed.
5761 * Proper static binding of attribute syntax -- i.e. types / terms /
5762 facts mentioned as arguments are always those of the locale definition
5763 context, independently of the context of later invocations. Moreover,
5764 locale operations (renaming and type / term instantiation) are applied
5765 to attribute arguments as expected.
5767 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5768 actual attributes; rare situations may require Attrib.attribute to
5769 embed those attributes into Attrib.src that lack concrete syntax.
5770 Attribute implementations need to cooperate properly with the static
5771 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5772 Attrib.XXX_thm etc. already do the right thing without further
5773 intervention. Only unusual applications -- such as "where" or "of"
5774 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5775 on the context and the facts involved -- may have to assign parsed
5776 values to argument tokens explicitly.
5778 * Changed parameter management in theorem generation for long goal
5779 statements with 'includes'. INCOMPATIBILITY: produces a different
5780 theorem statement in rare situations.
5782 * Locale inspection command 'print_locale' omits notes elements. Use
5783 'print_locale!' to have them included in the output.
5788 * Provers/hypsubst.ML: improved version of the subst method, for
5789 single-step rewriting: it now works in bound variable contexts. New is
5790 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5791 rewrite a different subterm than the original subst method, which is
5792 still available as 'simplesubst'.
5794 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5797 * Provers/trancl.ML: new transitivity reasoner for transitive and
5798 reflexive-transitive closure of relations.
5800 * Provers/blast.ML: new reference depth_limit to make blast's depth
5801 limit (previously hard-coded with a value of 20) user-definable.
5803 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5804 is peformed already. Object-logics merely need to finish their
5805 initial simpset configuration as before. INCOMPATIBILITY.
5810 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5813 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5815 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5816 and x-symbol; use option '-m epsilon' to get it actually printed.
5817 Moreover, the mathematically important symbolic identifier \<epsilon>
5818 becomes available as variable, constant etc. INCOMPATIBILITY,
5820 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5821 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5822 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5823 support corresponding Isar calculations.
5825 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5828 * theory SetInterval: changed the syntax for open intervals:
5837 The old syntax is still supported but will disappear in the next
5838 release. For conversion use the following Emacs search and replace
5839 patterns (these are not perfect but work quite well):
5841 {)\([^\.]*\)\.\. -> {\1<\.\.}
5842 \.\.\([^(}]*\)(} -> \.\.<\1}
5844 * Theory Commutative_Ring (in Library): method comm_ring for proving
5845 equalities in commutative rings; method 'algebra' provides a generic
5848 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5849 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5850 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5853 Some new syntax forms are available:
5855 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5856 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5857 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5858 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5860 The latter form "\<Sum>x < k. e" used to be based on a separate
5861 function "Summation", which has been discontinued.
5863 * theory Finite_Set: in structured induction proofs, the insert case
5864 is now 'case (insert x F)' instead of the old counterintuitive 'case
5867 * The 'refute' command has been extended to support a much larger
5868 fragment of HOL, including axiomatic type classes, constdefs and
5869 typedefs, inductive datatypes and recursion.
5871 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5872 Requires zChaff with proof generation to be installed. See
5873 HOL/ex/SAT_Examples.thy for examples.
5875 * Datatype induction via method 'induct' now preserves the name of the
5876 induction variable. For example, when proving P(xs::'a list) by
5877 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5878 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5879 in unstructured proof scripts.
5881 * Reworked implementation of records. Improved scalability for
5882 records with many fields, avoiding performance problems for type
5883 inference. Records are no longer composed of nested field types, but
5884 of nested extension types. Therefore the record type only grows linear
5885 in the number of extensions and not in the number of fields. The
5886 top-level (users) view on records is preserved. Potential
5887 INCOMPATIBILITY only in strange cases, where the theory depends on the
5888 old record representation. The type generated for a record is called
5889 <record_name>_ext_type.
5891 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5892 proofs triggered by a record definition or a simproc (if
5893 quick_and_dirty is enabled). Definitions of large records can take
5896 New simproc record_upd_simproc for simplification of multiple record
5897 updates enabled by default. Moreover, trivial updates are also
5898 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5899 occasionally, since simplification is more powerful by default.
5901 * typedef: proper support for polymorphic sets, which contain extra
5902 type-variables in the term.
5904 * Simplifier: automatically reasons about transitivity chains
5905 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5906 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5907 old proofs break occasionally as simplification may now solve more
5908 goals than previously.
5910 * Simplifier: converts x <= y into x = y if assumption y <= x is
5911 present. Works for all partial orders (class "order"), in particular
5912 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5915 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5916 bound variable or a constant then the let is unfolded. Otherwise
5917 first a is simplified to b, and then f b is simplified to g. If
5918 possible we abstract b from g arriving at "let x = b in h x",
5919 otherwise we unfold the let and arrive at g. The simproc can be
5920 enabled/disabled by the reference use_let_simproc. Potential
5921 INCOMPATIBILITY since simplification is more powerful by default.
5923 * Classical reasoning: the meson method now accepts theorems as arguments.
5925 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5926 jobs to provide advice on the provability of subgoals.
5928 * Theory OrderedGroup and Ring_and_Field: various additions and
5929 improvements to faciliate calculations involving equalities and
5932 The following theorems have been eliminated or modified
5935 abs_eq now named abs_of_nonneg
5936 abs_of_ge_0 now named abs_of_nonneg
5937 abs_minus_eq now named abs_of_nonpos
5938 imp_abs_id now named abs_of_nonneg
5939 imp_abs_neg_id now named abs_of_nonpos
5940 mult_pos now named mult_pos_pos
5941 mult_pos_le now named mult_nonneg_nonneg
5942 mult_pos_neg_le now named mult_nonneg_nonpos
5943 mult_pos_neg2_le now named mult_nonneg_nonpos2
5944 mult_neg now named mult_neg_neg
5945 mult_neg_le now named mult_nonpos_nonpos
5947 * The following lemmas in Ring_and_Field have been added to the simplifier:
5950 not_square_less_zero
5952 The following lemmas have been deleted from Real/RealPow:
5962 * Theory Parity: added rules for simplifying exponents.
5966 The following theorems have been eliminated or modified
5969 list_all_Nil now named list_all.simps(1)
5970 list_all_Cons now named list_all.simps(2)
5971 list_all_conv now named list_all_iff
5972 set_mem_eq now named mem_iff
5974 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5975 asymptotic "big O" calculations. See the notes in BigO.thy.
5980 * Theory RealDef: better support for embedding natural numbers and
5981 integers in the reals.
5983 The following theorems have been eliminated or modified
5986 exp_ge_add_one_self now requires no hypotheses
5987 real_of_int_add reversed direction of equality (use [symmetric])
5988 real_of_int_minus reversed direction of equality (use [symmetric])
5989 real_of_int_diff reversed direction of equality (use [symmetric])
5990 real_of_int_mult reversed direction of equality (use [symmetric])
5992 * Theory RComplete: expanded support for floor and ceiling functions.
5994 * Theory Ln is new, with properties of the natural logarithm
5996 * Hyperreal: There is a new type constructor "star" for making
5997 nonstandard types. The old type names are now type synonyms:
6001 hcomplex = complex star
6003 * Hyperreal: Many groups of similarly-defined constants have been
6004 replaced by polymorphic versions (INCOMPATIBILITY):
6006 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6008 starset <-- starsetNat, starsetC
6009 *s* <-- *sNat*, *sc*
6010 starset_n <-- starsetNat_n, starsetC_n
6011 *sn* <-- *sNatn*, *scn*
6012 InternalSets <-- InternalNatSets, InternalCSets
6014 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6015 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6016 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6017 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6018 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6020 * Hyperreal: Many type-specific theorems have been removed in favor of
6021 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6023 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6024 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6025 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6026 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6027 right_minus <-- hypreal_add_minus
6028 left_minus <-- {hypreal,hcomplex}_add_minus_left
6029 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6030 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6031 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6032 mult_1_right <-- hcomplex_mult_one_right
6033 mult_zero_left <-- hcomplex_mult_zero_left
6034 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6035 right_distrib <-- hypnat_add_mult_distrib2
6036 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6037 right_inverse <-- hypreal_mult_inverse
6038 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6039 order_refl <-- {hypreal,hypnat}_le_refl
6040 order_trans <-- {hypreal,hypnat}_le_trans
6041 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6042 order_less_le <-- {hypreal,hypnat}_less_le
6043 linorder_linear <-- {hypreal,hypnat}_le_linear
6044 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6045 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6046 add_nonneg_nonneg <-- hypreal_le_add_order
6048 * Hyperreal: Separate theorems having to do with type-specific
6049 versions of constants have been merged into theorems that apply to the
6050 new polymorphic constants (INCOMPATIBILITY):
6052 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6053 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6054 STAR_Un <-- {STAR,NatStar,STARC}_Un
6055 STAR_Int <-- {STAR,NatStar,STARC}_Int
6056 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6057 STAR_subset <-- {STAR,NatStar,STARC}_subset
6058 STAR_mem <-- {STAR,NatStar,STARC}_mem
6059 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6060 STAR_diff <-- {STAR,STARC}_diff
6061 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6062 STARC_hcomplex_of_complex}_image_subset
6063 starset_n_Un <-- starset{Nat,C}_n_Un
6064 starset_n_Int <-- starset{Nat,C}_n_Int
6065 starset_n_Compl <-- starset{Nat,C}_n_Compl
6066 starset_n_diff <-- starset{Nat,C}_n_diff
6067 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6068 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6069 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6070 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6071 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6072 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6073 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6074 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6075 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6076 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6077 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6078 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6079 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6080 starfun_diff <-- starfun{C,RC,CR}_diff
6081 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6082 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6083 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6084 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6085 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6086 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6087 starfun_Id <-- starfunC_Id
6088 starfun_approx <-- starfun{Nat,CR}_approx
6089 starfun_capprox <-- starfun{C,RC}_capprox
6090 starfun_abs <-- starfunNat_rabs
6091 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6092 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6093 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6094 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6095 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6096 starfun_add_approx <-- starfunCR_add_approx
6097 starfun_inverse_inverse <-- starfunC_inverse_inverse
6098 starfun_divide <-- starfun{C,CR,RC}_divide
6099 starfun_n <-- starfun{Nat,C}_n
6100 starfun_n_mult <-- starfun{Nat,C}_n_mult
6101 starfun_n_add <-- starfun{Nat,C}_n_add
6102 starfun_n_add_minus <-- starfunNat_n_add_minus
6103 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6104 starfun_n_minus <-- starfun{Nat,C}_n_minus
6105 starfun_n_eq <-- starfun{Nat,C}_n_eq
6107 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6108 star_n_minus <-- {hypreal,hcomplex}_minus
6109 star_n_diff <-- {hypreal,hcomplex}_diff
6110 star_n_mult <-- {hypreal,hcomplex}_mult
6111 star_n_inverse <-- {hypreal,hcomplex}_inverse
6112 star_n_le <-- {hypreal,hypnat}_le
6113 star_n_less <-- {hypreal,hypnat}_less
6114 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6115 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6116 star_n_abs <-- hypreal_hrabs
6117 star_n_divide <-- hcomplex_divide
6119 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6120 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6121 star_of_diff <-- hypreal_of_real_diff
6122 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6123 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6124 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6125 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6126 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6127 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6128 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6129 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6130 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6131 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6132 star_of_number_of <-- {hypreal,hcomplex}_number_of
6133 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6134 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6135 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6136 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6137 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6138 star_of_power <-- hypreal_of_real_power
6139 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6141 * Hyperreal: new method "transfer" that implements the transfer
6142 principle of nonstandard analysis. With a subgoal that mentions
6143 nonstandard types like "'a star", the command "apply transfer"
6144 replaces it with an equivalent one that mentions only standard types.
6145 To be successful, all free variables must have standard types; non-
6146 standard variables must have explicit universal quantifiers.
6148 * Hyperreal: A theory of Taylor series.
6153 * Discontinued special version of 'constdefs' (which used to support
6154 continuous functions) in favor of the general Pure one with full
6157 * New simplification procedure for solving continuity conditions; it
6158 is much faster on terms with many nested lambda abstractions (cubic
6159 instead of exponential time).
6161 * New syntax for domain package: selector names are now optional.
6162 Parentheses should be omitted unless argument is lazy, for example:
6164 domain 'a stream = cons "'a" (lazy "'a stream")
6166 * New command 'fixrec' for defining recursive functions with pattern
6167 matching; defining multiple functions with mutual recursion is also
6168 supported. Patterns may include the constants cpair, spair, up, sinl,
6169 sinr, or any data constructor defined by the domain package. The given
6170 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6171 syntax and examples.
6173 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6174 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6175 but the proof obligation additionally includes an admissibility
6176 requirement. The packages generate instances of class cpo or pcpo,
6177 with continuity and strictness theorems for Rep and Abs.
6179 * HOLCF: Many theorems have been renamed according to a more standard naming
6180 scheme (INCOMPATIBILITY):
6182 foo_inject: "foo$x = foo$y ==> x = y"
6183 foo_eq: "(foo$x = foo$y) = (x = y)"
6184 foo_less: "(foo$x << foo$y) = (x << y)"
6185 foo_strict: "foo$UU = UU"
6186 foo_defined: "... ==> foo$x ~= UU"
6187 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6192 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6193 including the First Isomorphism Theorem (on quotienting by the kernel
6196 * ZF/Simplifier: install second copy of type solver that actually
6197 makes use of TC rules declared to Isar proof contexts (or locales);
6198 the old version is still required for ML proof scripts.
6203 * Converted to Isar theory format; use locales instead of axiomatic
6209 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6212 * Pure/library.ML no longer defines its own option datatype, but uses
6213 that of the SML basis, which has constructors NONE and SOME instead of
6214 None and Some, as well as exception Option.Option instead of OPTION.
6215 The functions the, if_none, is_some, is_none have been adapted
6216 accordingly, while Option.map replaces apsome.
6218 * Pure/library.ML: the exception LIST has been given up in favour of
6219 the standard exceptions Empty and Subscript, as well as
6220 Library.UnequalLengths. Function like Library.hd and Library.tl are
6221 superceded by the standard hd and tl functions etc.
6223 A number of basic list functions are no longer exported to the ML
6224 toplevel, as they are variants of predefined functions. The following
6225 suggests how one can translate existing code:
6227 rev_append xs ys = List.revAppend (xs, ys)
6228 nth_elem (i, xs) = List.nth (xs, i)
6229 last_elem xs = List.last xs
6230 flat xss = List.concat xss
6231 seq fs = List.app fs
6232 partition P xs = List.partition P xs
6233 mapfilter f xs = List.mapPartial f xs
6235 * Pure/library.ML: several combinators for linear functional
6236 transformations, notably reverse application and composition:
6239 (x, y) |-> f f #-> g
6241 * Pure/library.ML: introduced/changed precedence of infix operators:
6243 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6245 infix 3 o oo ooo oooo;
6246 infix 4 ~~ upto downto;
6248 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6251 * Pure/library.ML: natural list combinators fold, fold_rev, and
6252 fold_map support linear functional transformations and nesting. For
6255 fold f [x1, ..., xN] y =
6256 y |> f x1 |> ... |> f xN
6258 (fold o fold) f [xs1, ..., xsN] y =
6259 y |> fold f xs1 |> ... |> fold f xsN
6261 fold f [x1, ..., xN] =
6264 (fold o fold) f [xs1, ..., xsN] =
6265 fold f xs1 #> ... #> fold f xsN
6267 * Pure/library.ML: the following selectors on type 'a option are
6270 the: 'a option -> 'a (*partial*)
6271 these: 'a option -> 'a where 'a = 'b list
6272 the_default: 'a -> 'a option -> 'a
6273 the_list: 'a option -> 'a list
6275 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6276 basic operations for association lists, following natural argument
6277 order; moreover the explicit equality predicate passed here avoids
6278 potentially expensive polymorphic runtime equality checks.
6279 The old functions may be expressed as follows:
6281 assoc = uncurry (AList.lookup (op =))
6282 assocs = these oo AList.lookup (op =)
6283 overwrite = uncurry (AList.update (op =)) o swap
6285 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6287 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6288 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6290 replacing make_keylist and keyfilter (occassionally used)
6293 make_keylist = AList.make
6294 keyfilter = AList.find (op =)
6296 * eq_fst and eq_snd now take explicit equality parameter, thus
6297 avoiding eqtypes. Naive rewrites:
6299 eq_fst = eq_fst (op =)
6300 eq_snd = eq_snd (op =)
6302 * Removed deprecated apl and apr (rarely used).
6305 apl (n, op) =>>= curry op n
6306 apr (op, m) =>>= fn n => op (n, m)
6308 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6309 provides a reasonably efficient light-weight implementation of sets as
6312 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6313 few new operations; existing lookup and update are now curried to
6314 follow natural argument order (for use with fold etc.);
6315 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6317 * Pure/General: output via the Isabelle channels of
6318 writeln/warning/error etc. is now passed through Output.output, with a
6319 hook for arbitrary transformations depending on the print_mode
6320 (cf. Output.add_mode -- the first active mode that provides a output
6321 function wins). Already formatted output may be embedded into further
6322 text via Output.raw; the result of Pretty.string_of/str_of and derived
6323 functions (string_of_term/cterm/thm etc.) is already marked raw to
6324 accommodate easy composition of diagnostic messages etc. Programmers
6325 rarely need to care about Output.output or Output.raw at all, with
6326 some notable exceptions: Output.output is required when bypassing the
6327 standard channels (writeln etc.), or in token translations to produce
6328 properly formatted results; Output.raw is required when capturing
6329 already output material that will eventually be presented to the user
6330 a second time. For the default print mode, both Output.output and
6331 Output.raw have no effect.
6333 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6334 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6335 cumulative results are displayed at the end of a batch session.
6337 * Pure/General: File.sysify_path and File.quote_sysify path have been
6338 replaced by File.platform_path and File.shell_path (with appropriate
6339 hooks). This provides a clean interface for unusual systems where the
6340 internal and external process view of file names are different.
6342 * Pure: more efficient orders for basic syntactic entities: added
6343 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6344 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6345 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6346 orders now -- potential INCOMPATIBILITY for code that depends on a
6347 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6348 Library.sort_strings on result).
6350 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6351 fold_types traverse types/terms from left to right, observing natural
6352 argument order. Supercedes previous foldl_XXX versions, add_frees,
6353 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6355 * Pure: name spaces have been refined, with significant changes of the
6356 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6357 to extern(_table). The plain name entry path is superceded by a
6358 general 'naming' context, which also includes the 'policy' to produce
6359 a fully qualified name and external accesses of a fully qualified
6360 name; NameSpace.extend is superceded by context dependent
6361 Sign.declare_name. Several theory and proof context operations modify
6362 the naming context. Especially note Theory.restore_naming and
6363 ProofContext.restore_naming to get back to a sane state; note that
6364 Theory.add_path is no longer sufficient to recover from
6365 Theory.absolute_path in particular.
6367 * Pure: new flags short_names (default false) and unique_names
6368 (default true) for controlling output of qualified names. If
6369 short_names is set, names are printed unqualified. If unique_names is
6370 reset, the name prefix is reduced to the minimum required to achieve
6371 the original result when interning again, even if there is an overlap
6372 with earlier declarations.
6374 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
6375 now 'extend', and 'merge' gets an additional Pretty.pp argument
6376 (useful for printing error messages). INCOMPATIBILITY.
6378 * Pure: major reorganization of the theory context. Type Sign.sg and
6379 Theory.theory are now identified, referring to the universal
6380 Context.theory (see Pure/context.ML). Actual signature and theory
6381 content is managed as theory data. The old code and interfaces were
6382 spread over many files and structures; the new arrangement introduces
6383 considerable INCOMPATIBILITY to gain more clarity:
6385 Context -- theory management operations (name, identity, inclusion,
6386 parents, ancestors, merge, etc.), plus generic theory data;
6388 Sign -- logical signature and syntax operations (declaring consts,
6389 types, etc.), plus certify/read for common entities;
6391 Theory -- logical theory operations (stating axioms, definitions,
6392 oracles), plus a copy of logical signature operations (consts,
6393 types, etc.); also a few basic management operations (Theory.copy,
6396 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
6397 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
6398 for convenience -- they merely return the theory.
6400 * Pure: type Type.tsig is superceded by theory in most interfaces.
6402 * Pure: the Isar proof context type is already defined early in Pure
6403 as Context.proof (note that ProofContext.context and Proof.context are
6404 aliases, where the latter is the preferred name). This enables other
6405 Isabelle components to refer to that type even before Isar is present.
6407 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
6408 typeK, constK, axiomK, oracleK), but provide explicit operations for
6409 any of these kinds. For example, Sign.intern typeK is now
6410 Sign.intern_type, Theory.hide_space Sign.typeK is now
6411 Theory.hide_types. Also note that former
6412 Theory.hide_classes/types/consts are now
6413 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
6414 internalize their arguments! INCOMPATIBILITY.
6416 * Pure: get_thm interface (of PureThy and ProofContext) expects
6417 datatype thmref (with constructors Name and NameSelection) instead of
6418 plain string -- INCOMPATIBILITY;
6420 * Pure: cases produced by proof methods specify options, where NONE
6421 means to remove case bindings -- INCOMPATIBILITY in
6424 * Pure: the following operations retrieve axioms or theorems from a
6425 theory node or theory hierarchy, respectively:
6427 Theory.axioms_of: theory -> (string * term) list
6428 Theory.all_axioms_of: theory -> (string * term) list
6429 PureThy.thms_of: theory -> (string * thm) list
6430 PureThy.all_thms_of: theory -> (string * thm) list
6432 * Pure: print_tac now outputs the goal through the trace channel.
6434 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
6435 Reference Toplevel.debug (default false) controls detailed printing
6436 and tracing of low-level exceptions; Toplevel.profiling (default 0)
6437 controls execution profiling -- set to 1 for time and 2 for space
6438 (both increase the runtime).
6440 * Isar session: The initial use of ROOT.ML is now always timed,
6441 i.e. the log will show the actual process times, in contrast to the
6442 elapsed wall-clock time that the outer shell wrapper produces.
6444 * Simplifier: improved handling of bound variables (nameless
6445 representation, avoid allocating new strings). Simprocs that invoke
6446 the Simplifier recursively should use Simplifier.inherit_bounds to
6447 avoid local name clashes. Failure to do so produces warnings
6448 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
6449 for further details.
6451 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
6452 bindings for all theorems stored within a given theory; this may help
6453 in porting non-Isar theories to Isar ones, while keeping ML proof
6454 scripts for the time being.
6456 * ML operator HTML.with_charset specifies the charset begin used for
6457 generated HTML files. For example:
6459 HTML.with_charset "utf-8" use_thy "Hebrew";
6460 HTML.with_charset "utf-8" use_thy "Chinese";
6465 * Allow symlinks to all proper Isabelle executables (Isabelle,
6466 isabelle, isatool etc.).
6468 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
6469 isatool doc, isatool mkdir, display_drafts etc.).
6471 * isatool usedir: option -f allows specification of the ML file to be
6472 used by Isabelle; default is ROOT.ML.
6474 * New isatool version outputs the version identifier of the Isabelle
6475 distribution being used.
6477 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
6478 (containing Boolean satisfiability problems) into Isabelle/HOL
6483 New in Isabelle2004 (April 2004)
6484 --------------------------------
6488 * Provers/order.ML: new efficient reasoner for partial and linear orders.
6489 Replaces linorder.ML.
6491 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
6492 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
6493 (\<a>...\<z>), are now considered normal letters, and can therefore
6494 be used anywhere where an ASCII letter (a...zA...Z) has until
6495 now. COMPATIBILITY: This obviously changes the parsing of some
6496 terms, especially where a symbol has been used as a binder, say
6497 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6498 as an identifier. Fix it by inserting a space around former
6499 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6500 existing theory and ML files.
6502 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6504 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6505 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6506 a normal (but invisible) letter. For multiple letter subscripts repeat
6507 \<^isub> like this: x\<^isub>1\<^isub>2.
6509 * Pure: There are now sub-/superscripts that can span more than one
6510 character. Text between \<^bsub> and \<^esub> is set in subscript in
6511 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6512 superscript. The new control characters are not identifier parts.
6514 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6515 content of "..." to the latex file instead of \isacntrl... . The "..."
6516 may consist of any printable characters excluding the end bracket >.
6518 * Pure: Using new Isar command "finalconsts" (or the ML functions
6519 Theory.add_finals or Theory.add_finals_i) it is now possible to
6520 declare constants "final", which prevents their being given a definition
6521 later. It is useful for constants whose behaviour is fixed axiomatically
6522 rather than definitionally, such as the meta-logic connectives.
6524 * Pure: 'instance' now handles general arities with general sorts
6525 (i.e. intersections of classes),
6527 * Presentation: generated HTML now uses a CSS style sheet to make layout
6528 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6529 It can be changed to alter the colors/layout of generated pages.
6534 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6535 cut_tac, subgoal_tac and thin_tac:
6536 - Now understand static (Isar) contexts. As a consequence, users of Isar
6537 locales are no longer forced to write Isar proof scripts.
6538 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6540 - INCOMPATIBILITY: names of variables to be instantiated may no
6541 longer be enclosed in quotes. Instead, precede variable name with `?'.
6542 This is consistent with the instantiation attribute "where".
6544 * Attributes "where" and "of":
6545 - Now take type variables of instantiated theorem into account when reading
6546 the instantiation string. This fixes a bug that caused instantiated
6547 theorems to have too special types in some circumstances.
6548 - "where" permits explicit instantiations of type variables.
6550 * Calculation commands "moreover" and "also" no longer interfere with
6551 current facts ("this"), admitting arbitrary combinations with "then"
6555 - Goal statements involving the context element "includes" no longer
6556 generate theorems with internal delta predicates (those ending on
6557 "_axioms") in the premise.
6558 Resolve particular premise with <locale>.intro to obtain old form.
6559 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6560 specification and "includes" elements in goal statement.
6561 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6562 [intro?] and [elim?] (respectively) by default.
6563 - Experimental command for instantiation of locales in proof contexts:
6564 instantiate <label>[<attrs>]: <loc>
6565 Instantiates locale <loc> and adds all its theorems to the current context
6566 taking into account their attributes. Label and attrs are optional
6567 modifiers, like in theorem declarations. If present, names of
6568 instantiated theorems are qualified with <label>, and the attributes
6569 <attrs> are applied after any attributes these theorems might have already.
6570 If the locale has assumptions, a chained fact of the form
6571 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6572 are derived. The command does not support old-style locales declared
6573 with "locale (open)".
6574 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6576 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6582 * Proof import: new image HOL4 contains the imported library from
6583 the HOL4 system with about 2500 theorems. It is imported by
6584 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6585 can be used like any other Isabelle image. See
6586 HOL/Import/HOL/README for more information.
6589 - Much improved handling of linear and partial orders.
6590 Reasoners for linear and partial orders are set up for type classes
6591 "linorder" and "order" respectively, and are added to the default simpset
6592 as solvers. This means that the simplifier can build transitivity chains
6593 to solve goals from the assumptions.
6594 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6595 of blast or auto after simplification become unnecessary because the goal
6596 is solved by simplification already.
6598 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6599 all proved in axiomatic type classes for semirings, rings and fields.
6602 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6603 now formalized using the Ring_and_Field theory mentioned above.
6604 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6605 than before, because now they are set up once in a generic manner.
6606 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6607 Look for the general versions in Ring_and_Field (and Power if they concern
6610 * Type "rat" of the rational numbers is now available in HOL-Complex.
6613 - Record types are now by default printed with their type abbreviation
6614 instead of the list of all field types. This can be configured via
6615 the reference "print_record_type_abbr".
6616 - Simproc "record_upd_simproc" for simplification of multiple updates added
6617 (not enabled by default).
6618 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6619 EX x. x = sel r to True (not enabled by default).
6620 - Tactic "record_split_simp_tac" to split and simplify records added.
6622 * 'specification' command added, allowing for definition by
6623 specification. There is also an 'ax_specification' command that
6624 introduces the new constants axiomatically.
6626 * arith(_tac) is now able to generate counterexamples for reals as well.
6628 * HOL-Algebra: new locale "ring" for non-commutative rings.
6630 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6631 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6633 * HOL-Matrix: a first theory for matrices in HOL with an application of
6634 matrix theory to linear programming.
6636 * Unions and Intersections:
6637 The latex output syntax of UN and INT has been changed
6638 from "\Union x \in A. B" to "\Union_{x \in A} B"
6639 i.e. the index formulae has become a subscript.
6640 Similarly for "\Union x. B", and for \Inter instead of \Union.
6642 * Unions and Intersections over Intervals:
6643 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6644 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6645 like in normal math, and corresponding versions for < and for intersection.
6647 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6648 lexicographic dictonary ordering has been added as "lexord".
6650 * ML: the legacy theory structures Int and List have been removed. They had
6651 conflicted with ML Basis Library structures having the same names.
6653 * 'refute' command added to search for (finite) countermodels. Only works
6654 for a fragment of HOL. The installation of an external SAT solver is
6655 highly recommended. See "HOL/Refute.thy" for details.
6657 * 'quickcheck' command: Allows to find counterexamples by evaluating
6658 formulae under an assignment of free variables to random values.
6659 In contrast to 'refute', it can deal with inductive datatypes,
6660 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6666 * Streams now come with concatenation and are part of the HOLCF image
6670 New in Isabelle2003 (May 2003)
6671 ------------------------------
6675 * Provers/simplifier:
6677 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6678 Assumptions are now subject to complete mutual simplification,
6679 not just from left to right. The simplifier now preserves
6680 the order of assumptions.
6682 Potential INCOMPATIBILITY:
6684 -- simp sometimes diverges where the old version did
6685 not, e.g. invoking simp on the goal
6687 [| P (f x); y = x; f x = f y |] ==> Q
6689 now gives rise to the infinite reduction sequence
6691 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6693 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6696 -- Tactics combining classical reasoner and simplification (such as auto)
6697 are also affected by this change, because many of them rely on
6698 simp. They may sometimes diverge as well or yield a different numbers
6699 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6700 in case of problems. Sometimes subsequent calls to the classical
6701 reasoner will fail because a preceeding call to the simplifier too
6702 eagerly simplified the goal, e.g. deleted redundant premises.
6704 - The simplifier trace now shows the names of the applied rewrite rules
6706 - You can limit the number of recursive invocations of the simplifier
6707 during conditional rewriting (where the simplifie tries to solve the
6708 conditions before applying the rewrite rule):
6709 ML "simp_depth_limit := n"
6710 where n is an integer. Thus you can force termination where previously
6711 the simplifier would diverge.
6713 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6715 - No longer aborts on failed congruence proof. Instead, the
6716 congruence is ignored.
6718 * Pure: New generic framework for extracting programs from constructive
6719 proofs. See HOL/Extraction.thy for an example instantiation, as well
6720 as HOL/Extraction for some case studies.
6722 * Pure: The main goal of the proof state is no longer shown by default, only
6723 the subgoals. This behaviour is controlled by a new flag.
6724 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6725 (ML: Proof.show_main_goal).
6727 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6728 rules whose conclusion matches subgoal 1:
6729 PG menu: Isabelle/Isar -> Show me -> matching rules
6730 The rules are ordered by how closely they match the subgoal.
6731 In particular, rules that solve a subgoal outright are displayed first
6732 (or rather last, the way they are printed).
6733 (ML: ProofGeneral.print_intros())
6735 * Pure: New flag trace_unify_fail causes unification to print
6736 diagnostic information (PG: in trace buffer) when it fails. This is
6737 useful for figuring out why single step proofs like rule, erule or
6740 * Pure: Locale specifications now produce predicate definitions
6741 according to the body of text (covering assumptions modulo local
6742 definitions); predicate "loc_axioms" covers newly introduced text,
6743 while "loc" is cumulative wrt. all included locale expressions; the
6744 latter view is presented only on export into the global theory
6745 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6746 on the old view without predicates;
6748 * Pure: predefined locales "var" and "struct" are useful for sharing
6749 parameters (as in CASL, for example); just specify something like
6750 ``var x + var y + struct M'' as import;
6752 * Pure: improved thms_containing: proper indexing of facts instead of
6753 raw theorems; check validity of results wrt. current name space;
6754 include local facts of proof configuration (also covers active
6755 locales), cover fixed variables in index; may use "_" in term
6756 specification; an optional limit for the number of printed facts may
6757 be given (the default is 40);
6759 * Pure: disallow duplicate fact bindings within new-style theory files
6762 * Provers: improved induct method: assumptions introduced by case
6763 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6764 the goal statement); "foo" still refers to all facts collectively;
6766 * Provers: the function blast.overloaded has been removed: all constants
6767 are regarded as potentially overloaded, which improves robustness in exchange
6768 for slight decrease in efficiency;
6770 * Provers/linorder: New generic prover for transitivity reasoning over
6771 linear orders. Note: this prover is not efficient!
6773 * Isar: preview of problems to finish 'show' now produce an error
6774 rather than just a warning (in interactive mode);
6781 - Produces a counter example if it cannot prove a goal.
6782 Note that the counter example may be spurious if the goal is not a formula
6783 of quantifier-free linear arithmetic.
6784 In ProofGeneral the counter example appears in the trace buffer.
6786 - Knows about div k and mod k where k is a numeral of type nat or int.
6788 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6789 linear arithmetic fails. This takes account of quantifiers and divisibility.
6790 Presburger arithmetic can also be called explicitly via presburger(_tac).
6792 * simp's arithmetic capabilities have been enhanced a bit: it now
6793 takes ~= in premises into account (by performing a case split);
6795 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6796 are distributed over a sum of terms;
6798 * New tactic "trans_tac" and method "trans" instantiate
6799 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6802 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6803 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6805 * 'typedef' command has new option "open" to suppress the set
6808 * functions Min and Max on finite sets have been introduced (theory
6811 * attribute [symmetric] now works for relations as well; it turns
6812 (x,y) : R^-1 into (y,x) : R, and vice versa;
6814 * induct over a !!-quantified statement (say !!x1..xn):
6815 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6817 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6818 %x. None. Warning: empty_def now refers to the previously hidden definition
6821 * Algebra: formalization of classical algebra. Intended as base for
6822 any algebraic development in Isabelle. Currently covers group theory
6823 (up to Sylow's theorem) and ring theory (Universal Property of
6824 Univariate Polynomials). Contributions welcome;
6826 * GroupTheory: deleted, since its material has been moved to Algebra;
6828 * Complex: new directory of the complex numbers with numeric constants,
6829 nonstandard complex numbers, and some complex analysis, standard and
6830 nonstandard (Jacques Fleuriot);
6832 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6834 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6837 * Real/HahnBanach: updated and adapted to locales;
6839 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6842 * UNITY: added the Meier-Sanders theory of progress sets;
6844 * MicroJava: bytecode verifier and lightweight bytecode verifier
6845 as abstract algorithms, instantiated to the JVM;
6847 * Bali: Java source language formalization. Type system, operational
6848 semantics, axiomatic semantics. Supported language features:
6849 classes, interfaces, objects,virtual methods, static methods,
6850 static/instance fields, arrays, access modifiers, definite
6851 assignment, exceptions.
6856 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6859 * Main ZF: virtually all theories converted to new-style format;
6864 * Pure: Tactic.prove provides sane interface for internal proofs;
6865 omits the infamous "standard" operation, so this is more appropriate
6866 than prove_goalw_cterm in many situations (e.g. in simprocs);
6868 * Pure: improved error reporting of simprocs;
6870 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6874 *** Document preparation ***
6876 * uses \par instead of \\ for line breaks in theory text. This may
6877 shift some page breaks in large documents. To get the old behaviour
6878 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6880 * minimized dependencies of isabelle.sty and isabellesym.sty on
6883 * \<euro> now needs package babel/greek instead of marvosym (which
6886 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6891 New in Isabelle2002 (March 2002)
6892 --------------------------------
6894 *** Document preparation ***
6896 * greatly simplified document preparation setup, including more
6897 graceful interpretation of isatool usedir -i/-d/-D options, and more
6898 instructive isatool mkdir; users should basically be able to get
6899 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6900 users may run a separate document processing stage manually like this:
6901 "isatool usedir -D output HOL Test && isatool document Test/output";
6903 * theory dependency graph may now be incorporated into documents;
6904 isatool usedir -g true will produce session_graph.eps/.pdf for use
6905 with \includegraphics of LaTeX;
6907 * proper spacing of consecutive markup elements, especially text
6908 blocks after section headings;
6910 * support bold style (for single symbols only), input syntax is like
6911 this: "\<^bold>\<alpha>" or "\<^bold>A";
6913 * \<bullet> is now output as bold \cdot by default, which looks much
6914 better in printed text;
6916 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6917 note that these symbols are currently unavailable in Proof General /
6918 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6920 * isatool latex no longer depends on changed TEXINPUTS, instead
6921 isatool document copies the Isabelle style files to the target
6927 * Pure/Provers: improved proof by cases and induction;
6928 - 'case' command admits impromptu naming of parameters (such as
6930 - 'induct' method divinates rule instantiation from the inductive
6931 claim; no longer requires excessive ?P bindings for proper
6932 instantiation of cases;
6933 - 'induct' method properly enumerates all possibilities of set/type
6934 rules; as a consequence facts may be also passed through *type*
6935 rules without further ado;
6936 - 'induct' method now derives symbolic cases from the *rulified*
6937 rule (before it used to rulify cases stemming from the internal
6938 atomized version); this means that the context of a non-atomic
6939 statement becomes is included in the hypothesis, avoiding the
6940 slightly cumbersome show "PROP ?case" form;
6941 - 'induct' may now use elim-style induction rules without chaining
6942 facts, using ``missing'' premises from the goal state; this allows
6943 rules stemming from inductive sets to be applied in unstructured
6944 scripts, while still benefitting from proper handling of non-atomic
6945 statements; NB: major inductive premises need to be put first, all
6946 the rest of the goal is passed through the induction;
6947 - 'induct' proper support for mutual induction involving non-atomic
6948 rule statements (uses the new concept of simultaneous goals, see
6950 - append all possible rule selections, but only use the first
6951 success (no backtracking);
6952 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6953 - undeclared rule case names default to numbers 1, 2, 3, ...;
6954 - added 'print_induct_rules' (covered by help item in recent Proof
6956 - moved induct/cases attributes to Pure, methods to Provers;
6957 - generic method setup instantiated for FOL and HOL;
6959 * Pure: support multiple simultaneous goal statements, for example
6960 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6961 meta-level mechanism, this acts as if several individual goals had
6962 been stated separately; in particular common proof methods need to be
6963 repeated in order to cover all claims; note that a single elimination
6964 step is *not* sufficient to establish the two conjunctions, so this
6967 assume "A & B" then have A and B .. (*".." fails*)
6969 better use "obtain" in situations as above; alternative refer to
6970 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6972 * Pure: proper integration with ``locales''; unlike the original
6973 version by Florian Kammller, Isar locales package high-level proof
6974 contexts rather than raw logical ones (e.g. we admit to include
6975 attributes everywhere); operations on locales include merge and
6976 rename; support for implicit arguments (``structures''); simultaneous
6977 type-inference over imports and text; see also HOL/ex/Locales.thy for
6980 * Pure: the following commands have been ``localized'', supporting a
6981 target locale specification "(in name)": 'lemma', 'theorem',
6982 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6983 stored both within the locale and at the theory level (exported and
6984 qualified by the locale name);
6986 * Pure: theory goals may now be specified in ``long'' form, with
6987 ad-hoc contexts consisting of arbitrary locale elements. for example
6988 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6989 definitions may be given, too); the result is a meta-level rule with
6990 the context elements being discharged in the obvious way;
6992 * Pure: new proof command 'using' allows to augment currently used
6993 facts after a goal statement ('using' is syntactically analogous to
6994 'apply', but acts on the goal's facts only); this allows chained facts
6995 to be separated into parts given before and after a claim, as in
6996 ``from a and b have C using d and e <proof>'';
6998 * Pure: renamed "antecedent" case to "rule_context";
7000 * Pure: new 'judgment' command records explicit information about the
7001 object-logic embedding (used by several tools internally); no longer
7002 use hard-wired "Trueprop";
7004 * Pure: added 'corollary' command;
7006 * Pure: fixed 'token_translation' command;
7008 * Pure: removed obsolete 'exported' attribute;
7010 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7011 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7012 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7014 * Pure: method 'atomize' presents local goal premises as object-level
7015 statements (atomic meta-level propositions); setup controlled via
7016 rewrite rules declarations of 'atomize' attribute; example
7017 application: 'induct' method with proper rule statements in improper
7020 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7021 now consider the syntactic context of assumptions, giving a better
7022 chance to get type-inference of the arguments right (this is
7023 especially important for locales);
7025 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7028 * Pure/obtain: the formal conclusion "thesis", being marked as
7029 ``internal'', may no longer be reference directly in the text;
7030 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7033 * Pure: generic 'sym' attribute which declares a rule both as pure
7034 'elim?' and for the 'symmetric' operation;
7036 * Pure: marginal comments ``--'' may now occur just anywhere in the
7037 text; the fixed correlation with particular command syntax has been
7040 * Pure: new method 'rules' is particularly well-suited for proof
7041 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7042 but often produces more compact proof terms with less detours;
7044 * Pure/Provers/classical: simplified integration with pure rule
7045 attributes and methods; the classical "intro?/elim?/dest?"
7046 declarations coincide with the pure ones; the "rule" method no longer
7047 includes classically swapped intros; "intro" and "elim" methods no
7048 longer pick rules from the context; also got rid of ML declarations
7049 AddXIs/AddXEs/AddXDs; all of this has some potential for
7052 * Provers/classical: attribute 'swapped' produces classical inversions
7053 of introduction rules;
7055 * Provers/simplifier: 'simplified' attribute may refer to explicit
7056 rules instead of full simplifier context; 'iff' attribute handles
7059 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7061 * HOL: 'recdef' now fails on unfinished automated proofs, use
7062 "(permissive)" option to recover old behavior;
7064 * HOL: 'inductive' no longer features separate (collective) attributes
7065 for 'intros' (was found too confusing);
7067 * HOL: properly declared induction rules less_induct and
7073 * HOL: moved over to sane numeral syntax; the new policy is as
7076 - 0 and 1 are polymorphic constants, which are defined on any
7077 numeric type (nat, int, real etc.);
7079 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7080 binary representation internally;
7082 - type nat has special constructor Suc, and generally prefers Suc 0
7083 over 1::nat and Suc (Suc 0) over 2::nat;
7085 This change may cause significant problems of INCOMPATIBILITY; here
7086 are some hints on converting existing sources:
7088 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7089 entities, so expressions involving "-" (unary or binary minus) need
7090 to be spaced properly;
7092 - existing occurrences of "1" may need to be constraint "1::nat" or
7093 even replaced by Suc 0; similar for old "2";
7095 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7097 - remove all special provisions on numerals in proofs;
7099 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7100 representation (depends on bin_arith_simps in the default context);
7102 * HOL: symbolic syntax for x^2 (numeral 2);
7104 * HOL: the class of all HOL types is now called "type" rather than
7105 "term"; INCOMPATIBILITY, need to adapt references to this type class
7106 in axclass/classes, instance/arities, and (usually rare) occurrences
7107 in typings (of consts etc.); internally the class is called
7108 "HOL.type", ML programs should refer to HOLogic.typeS;
7110 * HOL/record package improvements:
7111 - new derived operations "fields" to build a partial record section,
7112 "extend" to promote a fixed record to a record scheme, and
7113 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7114 declared as simp by default;
7115 - shared operations ("more", "fields", etc.) now need to be always
7116 qualified) --- potential INCOMPATIBILITY;
7117 - removed "make_scheme" operations (use "make" with "extend") --
7119 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7120 - provides cases/induct rules for use with corresponding Isar
7121 methods (for concrete records, record schemes, concrete more
7122 parts, and schematic more parts -- in that order);
7123 - internal definitions directly based on a light-weight abstract
7124 theory of product types over typedef rather than datatype;
7126 * HOL: generic code generator for generating executable ML code from
7127 specifications; specific support for HOL constructs such as inductive
7128 datatypes and sets, as well as recursive functions; can be invoked
7129 via 'generate_code' theory section;
7131 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7133 * HOL: consolidated and renamed several theories. In particular:
7134 Ord.thy has been absorbed into HOL.thy
7135 String.thy has been absorbed into List.thy
7137 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7138 (beware of argument permutation!);
7140 * HOL: linorder_less_split superseded by linorder_cases;
7142 * HOL/List: "nodups" renamed to "distinct";
7144 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7145 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7146 - Ex_def has changed, now need to use some_eq_ex
7148 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7149 in this (rare) case use:
7151 delSWrapper "split_all_tac"
7152 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7154 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7157 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7158 Isabelle's type classes, ^ on functions and relations has too general
7159 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7160 necessary to attach explicit type constraints;
7162 * HOL/Relation: the prefix name of the infix "O" has been changed from
7163 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7164 renamed accordingly (eg "compI" -> "rel_compI").
7166 * HOL: syntax translations now work properly with numerals and records
7169 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7170 of "lam" -- INCOMPATIBILITY;
7172 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7173 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7174 renamed "Product_Type.unit";
7176 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7178 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7179 the "cases" method);
7181 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7184 * HOL/IMP: updated and converted to new-style theory format; several
7185 parts turned into readable document, with proper Isar proof texts and
7186 some explanations (by Gerwin Klein);
7188 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7190 * HOL-Hyperreal is now a logic image;
7195 * Isar: consts/constdefs supports mixfix syntax for continuous
7198 * Isar: domain package adapted to new-style theory format, e.g. see
7201 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7202 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7203 lift.induct_tac, always use UU instead of Undef;
7205 * HOLCF/IMP: updated and converted to new-style theory;
7210 * Isar: proper integration of logic-specific tools and packages,
7211 including theory commands '(co)inductive', '(co)datatype',
7212 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7213 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7215 * theory Main no longer includes AC; for the Axiom of Choice, base
7216 your theory on Main_ZFC;
7218 * the integer library now covers quotients and remainders, with many
7219 laws relating division to addition, multiplication, etc.;
7221 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7222 typeless version of the formalism;
7224 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7227 * ZF/Induct: new directory for examples of inductive definitions,
7228 including theory Multiset for multiset orderings; converted to
7229 new-style theory format;
7231 * ZF: many new theorems about lists, ordinals, etc.;
7236 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7237 variable proof controls level of detail: 0 = no proofs (only oracle
7238 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7239 also ref manual for further ML interfaces;
7241 * Pure/axclass: removed obsolete ML interface
7242 goal_subclass/goal_arity;
7244 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7245 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7246 separate tokens, so expressions involving minus need to be spaced
7249 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7250 rather than "infixl" or "infixr";
7252 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7253 sort constraint specifications in type inference; e.g. "x::_::foo"
7254 ensures that the type of "x" is of sort "foo" (but not necessarily a
7257 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7258 control output of nested => (types); the default behavior is
7261 * Pure/syntax: builtin parse translation for "_constify" turns valued
7262 tokens into AST constants;
7264 * Pure/syntax: prefer later declarations of translations and print
7265 translation functions; potential INCOMPATIBILITY: need to reverse
7266 multiple declarations for same syntax element constant;
7268 * Pure/show_hyps reset by default (in accordance to existing Isar
7271 * Provers/classical: renamed addaltern to addafter, addSaltern to
7274 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7277 * system: tested support for MacOS X; should be able to get Isabelle +
7278 Proof General to work in a plain Terminal after installing Poly/ML
7279 (e.g. from the Isabelle distribution area) and GNU bash alone
7280 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7281 support requires further installations, e.g. from
7282 http://fink.sourceforge.net/);
7284 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7286 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7287 of 40 MB), cf. ML_OPTIONS;
7289 * system: Proof General keywords specification is now part of the
7290 Isabelle distribution (see etc/isar-keywords.el);
7292 * system: support for persistent Proof General sessions (refrain from
7293 outdating all loaded theories on startup); user may create writable
7294 logic images like this: ``isabelle -q HOL Test'';
7296 * system: smart selection of Isabelle process versus Isabelle
7297 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7298 run both "isabelle" and "Isabelle" even if file names are badly
7299 damaged (executable inspects the case of the first letter of its own
7300 name); added separate "isabelle-process" and "isabelle-interface";
7302 * system: refrain from any attempt at filtering input streams; no
7303 longer support ``8bit'' encoding of old isabelle font, instead proper
7304 iso-latin characters may now be used; the related isatools
7305 "symbolinput" and "nonascii" have disappeared as well;
7307 * system: removed old "xterm" interface (the print modes "xterm" and
7308 "xterm_color" are still available for direct use in a suitable
7313 New in Isabelle99-2 (February 2001)
7314 -----------------------------------
7316 *** Overview of INCOMPATIBILITIES ***
7318 * HOL: please note that theories in the Library and elsewhere often use the
7319 new-style (Isar) format; to refer to their theorems in an ML script you must
7320 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7322 * HOL: inductive package no longer splits induction rule aggressively,
7323 but only as far as specified by the introductions given; the old
7324 format may be recovered via ML function complete_split_rule or attribute
7325 'split_rule (complete)';
7327 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7328 gfp_Tarski to gfp_unfold;
7330 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7332 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7333 relation); infix "^^" has been renamed "``"; infix "``" has been
7334 renamed "`"; "univalent" has been renamed "single_valued";
7336 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7339 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7341 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7343 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7344 consequence, it is no longer monotonic wrt. the local goal context
7345 (which is now passed through the inductive cases);
7347 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7348 \<gg> to \<ggreater>;
7351 *** Document preparation ***
7353 * \isabellestyle{NAME} selects version of Isabelle output (currently
7354 available: are "it" for near math-mode best-style output, "sl" for
7355 slanted text style, and "tt" for plain type-writer; if no
7356 \isabellestyle command is given, output is according to slanted
7359 * support sub/super scripts (for single symbols only), input syntax is
7360 like this: "A\<^sup>*" or "A\<^sup>\<star>";
7362 * some more standard symbols; see Appendix A of the system manual for
7363 the complete list of symbols defined in isabellesym.sty;
7365 * improved isabelle style files; more abstract symbol implementation
7366 (should now use \isamath{...} and \isatext{...} in custom symbol
7369 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
7370 state; Note that presentation of goal states does not conform to
7371 actual human-readable proof documents. Please do not include goal
7372 states into document output unless you really know what you are doing!
7374 * proper indentation of antiquoted output with proportional LaTeX
7377 * no_document ML operator temporarily disables LaTeX document
7380 * isatool unsymbolize tunes sources for plain ASCII communication;
7385 * Pure: Isar now suffers initial goal statements to contain unbound
7386 schematic variables (this does not conform to actual readable proof
7387 documents, due to unpredictable outcome and non-compositional proof
7388 checking); users who know what they are doing may use schematic goals
7389 for Prolog-style synthesis of proven results;
7391 * Pure: assumption method (an implicit finishing) now handles actual
7394 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
7395 initial goal, declare "that" only as Pure intro (only for single
7396 steps); the "that" rule assumption may now be involved in implicit
7397 finishing, thus ".." becomes a feasible for trivial obtains;
7399 * Pure: default proof step now includes 'intro_classes'; thus trivial
7400 instance proofs may be performed by "..";
7402 * Pure: ?thesis / ?this / "..." now work for pure meta-level
7405 * Pure: more robust selection of calculational rules;
7407 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
7408 rule (as well as the assumption rule);
7410 * Pure: 'thm_deps' command visualizes dependencies of theorems and
7411 lemmas, using the graph browser tool;
7413 * Pure: predict failure of "show" in interactive mode;
7415 * Pure: 'thms_containing' now takes actual terms as arguments;
7417 * HOL: improved method 'induct' --- now handles non-atomic goals
7418 (potential INCOMPATIBILITY); tuned error handling;
7420 * HOL: cases and induct rules now provide explicit hints about the
7421 number of facts to be consumed (0 for "type" and 1 for "set" rules);
7422 any remaining facts are inserted into the goal verbatim;
7424 * HOL: local contexts (aka cases) may now contain term bindings as
7425 well; the 'cases' and 'induct' methods new provide a ?case binding for
7426 the result to be shown in each case;
7428 * HOL: added 'recdef_tc' command;
7430 * isatool convert assists in eliminating legacy ML scripts;
7435 * HOL/Library: a collection of generic theories to be used together
7436 with main HOL; the theory loader path already includes this directory
7437 by default; the following existing theories have been moved here:
7438 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
7439 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
7441 * HOL/Unix: "Some aspects of Unix file-system security", a typical
7442 modelling and verification task performed in Isabelle/HOL +
7443 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
7445 * HOL/Algebra: special summation operator SUM no longer exists, it has
7446 been replaced by setsum; infix 'assoc' now has priority 50 (like
7447 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
7448 'domain', this makes the theory consistent with mathematical
7451 * HOL basics: added overloaded operations "inverse" and "divide"
7452 (infix "/"), syntax for generic "abs" operation, generic summation
7455 * HOL/typedef: simplified package, provide more useful rules (see also
7458 * HOL/datatype: induction rule for arbitrarily branching datatypes is
7459 now expressed as a proper nested rule (old-style tactic scripts may
7460 require atomize_strip_tac to cope with non-atomic premises);
7462 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
7463 to "split_conv" (old name still available for compatibility);
7465 * HOL: improved concrete syntax for strings (e.g. allows translation
7466 rules with string literals);
7468 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
7469 and Fleuriot's mechanization of analysis, including the transcendental
7470 functions for the reals;
7472 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
7477 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
7478 "lam" is displayed as TWO lambda-symbols
7480 * CTT: theory Main now available, containing everything (that is, Bool
7486 * Pure: the Simplifier has been implemented properly as a derived rule
7487 outside of the actual kernel (at last!); the overall performance
7488 penalty in practical applications is about 50%, while reliability of
7489 the Isabelle inference kernel has been greatly improved;
7491 * print modes "brackets" and "no_brackets" control output of nested =>
7492 (types) and ==> (props); the default behaviour is "brackets";
7494 * Provers: fast_tac (and friends) now handle actual object-logic rules
7495 as assumptions as well;
7497 * system: support Poly/ML 4.0;
7499 * system: isatool install handles KDE version 1 or 2;
7503 New in Isabelle99-1 (October 2000)
7504 ----------------------------------
7506 *** Overview of INCOMPATIBILITIES ***
7508 * HOL: simplification of natural numbers is much changed; to partly
7509 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7510 issue the following ML commands:
7512 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7513 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7515 * HOL: simplification no longer dives into case-expressions; this is
7516 controlled by "t.weak_case_cong" for each datatype t;
7518 * HOL: nat_less_induct renamed to less_induct;
7520 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7521 fixsome to patch .thy and .ML sources automatically;
7523 select_equality -> some_equality
7524 select_eq_Ex -> some_eq_ex
7525 selectI2EX -> someI2_ex
7528 select1_equality -> some1_equality
7529 Eps_sym_eq -> some_sym_eq_trivial
7530 Eps_eq -> some_eq_trivial
7532 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7534 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7537 * HOL: the recursion equations generated by 'recdef' are now called
7538 f.simps instead of f.rules;
7540 * HOL: qed_spec_mp now also handles bounded ALL as well;
7542 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7543 sometimes be needed;
7545 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7547 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7549 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7550 product is now "<*>" instead of "Times"; the lexicographic product is
7551 now "<*lex*>" instead of "**";
7553 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7554 of main HOL, but was unused); better use HOL's datatype package;
7556 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7557 the old syntax may be recovered as follows:
7560 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7561 (infixl "\\<oplus>" 100)
7563 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7565 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7566 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7569 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7570 changed from A/r to A//r;
7572 * ZF: new treatment of arithmetic (nat & int) may break some old
7575 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7576 rulify -> rule_format, elimify -> elim_format, ...);
7578 * Isar/Provers: intro/elim/dest attributes changed; renamed
7579 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7580 should have to change intro!! to intro? only); replaced "delrule" by
7583 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7585 * Provers: strengthened force_tac by using new first_best_tac;
7587 * LaTeX document preparation: several changes of isabelle.sty (see
7591 *** Document preparation ***
7593 * formal comments (text blocks etc.) in new-style theories may now
7594 contain antiquotations of thm/prop/term/typ/text to be presented
7595 according to latex print mode; concrete syntax is like this:
7596 @{term[show_types] "f(x) = a + x"};
7598 * isatool mkdir provides easy setup of Isabelle session directories,
7599 including proper document sources;
7601 * generated LaTeX sources are now deleted after successful run
7602 (isatool document -c); may retain a copy somewhere else via -D option
7605 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7606 style files, achieving self-contained LaTeX sources and simplifying
7609 * old-style theories now produce (crude) LaTeX output as well;
7611 * browser info session directories are now self-contained (may be put
7612 on WWW server seperately); improved graphs of nested sessions; removed
7613 graph for 'all sessions';
7615 * several improvements in isabelle style files; \isabellestyle{it}
7616 produces fake math mode output; \isamarkupheader is now \section by
7617 default; see lib/texinputs/isabelle.sty etc.;
7622 * Isar/Pure: local results and corresponding term bindings are now
7623 subject to Hindley-Milner polymorphism (similar to ML); this
7624 accommodates incremental type-inference very nicely;
7626 * Isar/Pure: new derived language element 'obtain' supports
7627 generalized existence reasoning;
7629 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7630 support accumulation of results, without applying any rules yet;
7631 useful to collect intermediate results without explicit name
7632 references, and for use with transitivity rules with more than 2
7635 * Isar/Pure: scalable support for case-analysis type proofs: new
7636 'case' language element refers to local contexts symbolically, as
7637 produced by certain proof methods; internally, case names are attached
7638 to theorems as "tags";
7640 * Isar/Pure: theory command 'hide' removes declarations from
7641 class/type/const name spaces;
7643 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7644 indicate potential overloading;
7646 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7648 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7649 "{a,b,c}" instead of {a,b,c};
7651 * Isar/Pure now provides its own version of intro/elim/dest
7652 attributes; useful for building new logics, but beware of confusion
7653 with the version in Provers/classical;
7655 * Isar/Pure: the local context of (non-atomic) goals is provided via
7656 case name 'antecedent';
7658 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7659 to the current context is now done automatically);
7661 * Isar/Pure: theory command 'method_setup' provides a simple interface
7662 for definining proof methods in ML;
7664 * Isar/Provers: intro/elim/dest attributes changed; renamed
7665 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7666 most cases, one should have to change intro!! to intro? only);
7667 replaced "delrule" by "rule del";
7669 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7670 'symmetric' attribute (the latter supercedes [RS sym]);
7672 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7673 method modifier); 'simp' method: 'only:' modifier removes loopers as
7674 well (including splits);
7676 * Isar/Provers: Simplifier and Classical methods now support all kind
7677 of modifiers used in the past, including 'cong', 'iff', etc.
7679 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7680 of Simplifier and Classical reasoner);
7682 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7683 now support named cases; major packages (inductive, datatype, primrec,
7684 recdef) support case names and properly name parameters;
7686 * Isar/HOL: new transitivity rules for substitution in inequalities --
7687 monotonicity conditions are extracted to be proven at end of
7690 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7693 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7694 split_if split_if_asm; datatype package provides theorems foo.splits =
7695 foo.split foo.split_asm for each datatype;
7697 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7698 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7699 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7700 use "(cases (simplified))" method in proper proof texts);
7702 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7704 * Isar: names of theorems etc. may be natural numbers as well;
7706 * Isar: 'pr' command: optional arguments for goals_limit and
7707 ProofContext.prems_limit; no longer prints theory contexts, but only
7710 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7711 additional print modes to be specified; e.g. "pr(latex)" will print
7712 proof state according to the Isabelle LaTeX style;
7714 * Isar: improved support for emulating tactic scripts, including proof
7715 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7716 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7717 (for HOL datatypes);
7719 * Isar: simplified (more robust) goal selection of proof methods: 1st
7720 goal, all goals, or explicit goal specifier (tactic emulation); thus
7721 'proof method scripts' have to be in depth-first order;
7723 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7725 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7726 should instead use individual commands for printing items
7727 (print_commands, print_methods etc.);
7729 * Isar: added 'nothing' --- the empty list of theorems;
7734 * HOL/MicroJava: formalization of a fragment of Java, together with a
7735 corresponding virtual machine and a specification of its bytecode
7736 verifier and a lightweight bytecode verifier, including proofs of
7737 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7738 Cornelia Pusch (see also the homepage of project Bali at
7739 http://isabelle.in.tum.de/Bali/);
7741 * HOL/Algebra: new theory of rings and univariate polynomials, by
7744 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7745 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7748 * HOL/Lattice: fundamental concepts of lattice theory and order
7749 structures, including duals, properties of bounds versus algebraic
7750 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7751 Theorem for complete lattices etc.; may also serve as a demonstration
7752 for abstract algebraic reasoning using axiomatic type classes, and
7753 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7755 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7758 * HOL/IMPP: extension of IMP with local variables and mutually
7759 recursive procedures, by David von Oheimb;
7761 * HOL/Lambda: converted into new-style theory and document;
7763 * HOL/ex/Multiquote: example of multiple nested quotations and
7764 anti-quotations -- basically a generalized version of de-Bruijn
7765 representation; very useful in avoiding lifting of operations;
7767 * HOL/record: added general record equality rule to simpset; fixed
7768 select-update simplification procedure to handle extended records as
7769 well; admit "r" as field name;
7771 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7772 other numeric types and also as the identity of groups, rings, etc.;
7774 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7775 Types nat and int belong to this axclass;
7777 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7778 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7779 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7780 two terms #m*u and #n*u are replaced by #(m+n)*u
7781 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7782 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7783 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7785 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7786 powerful prover for predicate logic but knows nothing of clasets; see
7787 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7789 * HOL: new version of "case_tac" subsumes both boolean case split and
7790 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7791 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7793 * HOL: simplification no longer dives into case-expressions: only the
7794 selector expression is simplified, but not the remaining arms; to
7795 enable full simplification of case-expressions for datatype t, you may
7796 remove t.weak_case_cong from the simpset, either globally (Delcongs
7797 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7799 * HOL/recdef: the recursion equations generated by 'recdef' for
7800 function 'f' are now called f.simps instead of f.rules; if all
7801 termination conditions are proved automatically, these simplification
7802 rules are added to the simpset, as in primrec; rules may be named
7803 individually as well, resulting in a separate list of theorems for
7806 * HOL/While is a new theory that provides a while-combinator. It
7807 permits the definition of tail-recursive functions without the
7808 provision of a termination measure. The latter is necessary once the
7809 invariant proof rule for while is applied.
7811 * HOL: new (overloaded) notation for the set of elements below/above
7812 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7814 * HOL: theorems impI, allI, ballI bound as "strip";
7816 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7817 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7818 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7820 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7822 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7823 main HOL, but was unused);
7825 * HOL: fewer consts declared as global (e.g. have to refer to
7826 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7828 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7829 in case of overlap with user translations (e.g. judgements over
7830 tuples); (note that the underlying logical represenation is still
7836 * ZF: simplification automatically cancels common terms in arithmetic
7837 expressions over nat and int;
7839 * ZF: new treatment of nat to minimize type-checking: all operators
7840 coerce their operands to a natural number using the function natify,
7841 making the algebraic laws unconditional;
7843 * ZF: as above, for int: operators coerce their operands to an integer
7844 using the function intify;
7846 * ZF: the integer library now contains many of the usual laws for the
7847 orderings, including $<=, and monotonicity laws for $+ and $*;
7849 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7852 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7853 to the simplifier and classical reasoner simultaneously;
7858 * Provers: blast_tac now handles actual object-logic rules as
7859 assumptions; note that auto_tac uses blast_tac internally as well;
7861 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7862 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7864 * Provers: delrules now handles destruct rules as well (no longer need
7865 explicit make_elim);
7867 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7868 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7869 use instead the strong form,
7870 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7871 in HOL, FOL and ZF the function cla_make_elim will create such rules
7872 from destruct-rules;
7874 * Provers: Simplifier.easy_setup provides a fast path to basic
7875 Simplifier setup for new object-logics;
7877 * Pure: AST translation rules no longer require constant head on LHS;
7879 * Pure: improved name spaces: ambiguous output is qualified; support
7880 for hiding of names;
7882 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7883 XSYMBOL_HOME; no longer need to do manual configuration in most
7886 * system: compression of ML heaps images may now be controlled via -c
7887 option of isabelle and isatool usedir (currently only observed by
7890 * system: isatool installfonts may handle X-Symbol fonts as well (very
7891 useful for remote X11);
7893 * system: provide TAGS file for Isabelle sources;
7895 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7898 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7899 timing flag supersedes proof_timing and Toplevel.trace;
7901 * ML: new combinators |>> and |>>> for incremental transformations
7902 with secondary results (e.g. certain theory extensions):
7904 * ML: PureThy.add_defs gets additional argument to indicate potential
7905 overloading (usually false);
7907 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7912 New in Isabelle99 (October 1999)
7913 --------------------------------
7915 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7917 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7918 are no longer simplified. (This allows the simplifier to unfold recursive
7919 functional programs.) To restore the old behaviour, declare
7921 Delcongs [if_weak_cong];
7923 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7926 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7928 * HOL/datatype: mutual_induct_tac no longer exists --
7929 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7931 * HOL/typedef: fixed type inference for representing set; type
7932 arguments now have to occur explicitly on the rhs as type constraints;
7934 * ZF: The con_defs part of an inductive definition may no longer refer
7935 to constants declared in the same theory;
7937 * HOL, ZF: the function mk_cases, generated by the inductive
7938 definition package, has lost an argument. To simplify its result, it
7939 uses the default simpset instead of a supplied list of theorems.
7941 * HOL/List: the constructors of type list are now Nil and Cons;
7943 * Simplifier: the type of the infix ML functions
7944 setSSolver addSSolver setSolver addSolver
7945 is now simpset * solver -> simpset where `solver' is a new abstract type
7946 for packaging solvers. A solver is created via
7947 mk_solver: string -> (thm list -> int -> tactic) -> solver
7948 where the string argument is only a comment.
7953 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7954 decision procedure for linear arithmetic. Currently it is used for
7955 types `nat', `int', and `real' in HOL (see below); it can, should and
7956 will be instantiated for other types and logics as well.
7958 * The simplifier now accepts rewrite rules with flexible heads, eg
7959 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7960 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7966 * New Isabelle/Isar subsystem provides an alternative to traditional
7967 tactical theorem proving; together with the ProofGeneral/isar user
7968 interface it offers an interactive environment for developing human
7969 readable proof documents (Isar == Intelligible semi-automated
7970 reasoning); for further information see isatool doc isar-ref,
7971 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7973 * improved and simplified presentation of theories: better HTML markup
7974 (including colors), graph views in several sizes; isatool usedir now
7975 provides a proper interface for user theories (via -P option); actual
7976 document preparation based on (PDF)LaTeX is available as well (for
7977 new-style theories only); see isatool doc system for more information;
7979 * native support for Proof General, both for classic Isabelle and
7982 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7983 using the graph browser tool;
7985 * Isabelle manuals now also available as PDF;
7987 * theory loader rewritten from scratch (may not be fully
7988 bug-compatible); old loadpath variable has been replaced by show_path,
7989 add_path, del_path, reset_path functions; new operations such as
7990 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7993 * improved isatool install: option -k creates KDE application icon,
7994 option -p DIR installs standalone binaries;
7996 * added ML_PLATFORM setting (useful for cross-platform installations);
7997 more robust handling of platform specific ML images for SML/NJ;
7999 * the settings environment is now statically scoped, i.e. it is never
8000 created again in sub-processes invoked from isabelle, isatool, or
8003 * path element specification '~~' refers to '$ISABELLE_HOME';
8005 * in locales, the "assumes" and "defines" parts may be omitted if
8008 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8011 * new print_mode "HTML";
8013 * new flag show_tags controls display of tags of theorems (which are
8014 basically just comments that may be attached by some tools);
8016 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8017 mode and goal output format:
8019 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8021 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8023 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8024 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8026 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8028 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8030 * function bind_thms stores lists of theorems (cf. bind_thm);
8032 * new shorthand tactics ftac, eatac, datac, fatac;
8034 * qed (and friends) now accept "" as result name; in that case the
8035 theorem is not stored, but proper checks and presentation of the
8038 * theorem database now also indexes constants "Trueprop", "all",
8039 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8044 ** HOL arithmetic **
8046 * There are now decision procedures for linear arithmetic over nat and
8049 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8050 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8051 are treated as atomic; subformulae not involving type `nat' or `int'
8052 are ignored; quantified subformulae are ignored unless they are
8053 positive universal or negative existential. The tactic has to be
8054 invoked by hand and can be a little bit slow. In particular, the
8055 running time is exponential in the number of occurrences of `min' and
8056 `max', and `-' on `nat'.
8058 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8059 (negated) (in)equalities among the premises and the conclusion into
8060 account (i.e. no compound formulae) and does not know about `min' and
8061 `max', and `-' on `nat'. It is fast and is used automatically by the
8064 NB: At the moment, these decision procedures do not cope with mixed
8065 nat/int formulae where the two parts interact, such as `m < n ==>
8068 * HOL/Numeral provides a generic theory of numerals (encoded
8069 efficiently as bit strings); setup for types nat/int/real is in place;
8070 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8071 int, existing theories and proof scripts may require a few additional
8074 * integer division and remainder can now be performed on constant
8077 * many properties of integer multiplication, division and remainder
8080 * An interface to the Stanford Validity Checker (SVC) is available through the
8081 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8082 are proved automatically. SVC must be installed separately, and its results
8083 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8084 invocation of the underlying oracle). For SVC see
8085 http://verify.stanford.edu/SVC
8087 * IsaMakefile: the HOL-Real target now builds an actual image;
8092 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8093 (in Isabelle/Isar) -- by Gertrud Bauer;
8095 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8096 analysis for assembly languages with subtypes;
8098 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8099 -- avoids syntactic ambiguities and treats state, transition, and
8100 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8101 changed syntax and (many) tactics;
8103 * HOL/inductive: Now also handles more general introduction rules such
8104 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8105 theorems are now maintained within the theory (maintained via the
8108 * HOL/datatype: Now also handles arbitrarily branching datatypes
8109 (using function types) such as
8111 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8113 * HOL/record: record_simproc (part of the default simpset) takes care
8114 of selectors applied to updated records; record_split_tac is no longer
8115 part of the default claset; update_defs may now be removed from the
8116 simpset in many cases; COMPATIBILITY: old behavior achieved by
8118 claset_ref () := claset() addSWrapper record_split_wrapper;
8119 Delsimprocs [record_simproc]
8121 * HOL/typedef: fixed type inference for representing set; type
8122 arguments now have to occur explicitly on the rhs as type constraints;
8124 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8125 names rather than an ML expression;
8127 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8128 supplied later. Program schemes can be defined, such as
8129 "While B C s = (if B s then While B C (C s) else s)"
8130 where the well-founded relation can be chosen after B and C have been given.
8132 * HOL/List: the constructors of type list are now Nil and Cons;
8133 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8134 course, ML tools referring to List.list.op # etc. have to be adapted;
8136 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8137 disabled by default; run isabelle with option -m HOL to get back to
8138 the original Gordon/HOL-style output;
8140 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8141 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8143 * HOL basic syntax simplified (more orthogonal): all variants of
8144 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8145 Eps operator is provided as well: "SOME x. P[x]";
8147 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8149 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8150 thus available for user theories;
8152 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8153 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8156 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8157 several times and then mp;
8162 * the notation <<...>> is now available as a notation for sequences of
8165 * the simplifier is now installed
8167 * the axiom system has been generalized (thanks to Soren Heilmann)
8169 * the classical reasoner now has a default rule database
8174 * new primrec section allows primitive recursive functions to be given
8175 directly (as in HOL) over datatypes and the natural numbers;
8177 * new tactics induct_tac and exhaust_tac for induction (or case
8178 analysis) over datatypes and the natural numbers;
8180 * the datatype declaration of type T now defines the recursor T_rec;
8182 * simplification automatically does freeness reasoning for datatype
8185 * automatic type-inference, with AddTCs command to insert new
8186 type-checking rules;
8188 * datatype introduction rules are now added as Safe Introduction rules
8191 * the syntax "if P then x else y" is now available in addition to
8195 *** Internal programming interfaces ***
8197 * tuned simplifier trace output; new flag debug_simp;
8199 * structures Vartab / Termtab (instances of TableFun) offer efficient
8200 tables indexed by indexname_ord / term_ord (compatible with aconv);
8202 * AxClass.axclass_tac lost the theory argument;
8204 * tuned current_goals_markers semantics: begin / end goal avoids
8205 printing empty lines;
8207 * removed prs and prs_fn hook, which was broken because it did not
8208 include \n in its semantics, forcing writeln to add one
8209 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8210 string -> unit if you really want to output text without newline;
8212 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8213 plain output, interface builders may have to enable 'isabelle_font'
8214 mode to get Isabelle font glyphs as before;
8216 * refined token_translation interface; INCOMPATIBILITY: output length
8217 now of type real instead of int;
8219 * theory loader actions may be traced via new ThyInfo.add_hook
8220 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8221 your own database of information attached to *whole* theories -- as
8222 opposed to intra-theory data slots offered via TheoryDataFun;
8224 * proper handling of dangling sort hypotheses (at last!);
8225 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8226 extra sort hypotheses that can be witnessed from the type signature;
8227 the force_strip_shyps flag is gone, any remaining shyps are simply
8228 left in the theorem (with a warning issued by strip_shyps_warning);
8232 New in Isabelle98-1 (October 1998)
8233 ----------------------------------
8235 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8237 * several changes of automated proof tools;
8239 * HOL: major changes to the inductive and datatype packages, including
8240 some minor incompatibilities of theory syntax;
8242 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8245 * HOL: removed duplicate thms in Arith:
8246 less_imp_add_less should be replaced by trans_less_add1
8247 le_imp_add_le should be replaced by trans_le_add1
8249 * HOL: unary minus is now overloaded (new type constraints may be
8252 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8253 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8254 now taken as an integer constant.
8256 * Pure: ML function 'theory_of' renamed to 'theory';
8262 1. Asm_full_simp_tac is now more aggressive.
8263 1. It will sometimes reorient premises if that increases their power to
8265 2. It does no longer proceed strictly from left to right but may also
8266 rotate premises to achieve further simplification.
8267 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8268 old Asm_full_simp_tac in that it does not rotate premises.
8269 2. The simplifier now knows a little bit about nat-arithmetic.
8271 * Classical reasoner: wrapper mechanism for the classical reasoner now
8272 allows for selected deletion of wrappers, by introduction of names for
8273 wrapper functionals. This implies that addbefore, addSbefore,
8274 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8275 and that adding two tactics with the same name overwrites the first
8276 one (emitting a warning).
8277 type wrapper = (int -> tactic) -> (int -> tactic)
8278 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8279 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8280 delWrapper, delSWrapper: claset * string -> claset
8281 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8283 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8284 semantics; addbefore now affects only the unsafe part of step_tac
8285 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8286 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8289 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8290 compWrapper; added safe wrapper (and access functions for it);
8292 * HOL/split_all_tac is now much faster and fails if there is nothing
8293 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8294 and the names of the automatically generated variables have changed.
8295 split_all_tac has moved within claset() from unsafe wrappers to safe
8296 wrappers, which means that !!-bound variables are split much more
8297 aggressively, and safe_tac and clarify_tac now split such variables.
8298 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8299 Note: the same holds for record_split_tac, which does the job of
8300 split_all_tac for record fields.
8302 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8303 permanently to the default simpset using Addsplits just like
8304 Addsimps. They can be removed via Delsplits just like
8305 Delsimps. Lower-case versions are also available.
8307 * HOL/Simplifier: The rule split_if is now part of the default
8308 simpset. This means that the simplifier will eliminate all occurrences
8309 of if-then-else in the conclusion of a goal. To prevent this, you can
8310 either remove split_if completely from the default simpset by
8311 `Delsplits [split_if]' or remove it in a specific call of the
8312 simplifier using `... delsplits [split_if]'. You can also add/delete
8313 other case splitting rules to/from the default simpset: every datatype
8314 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8315 t is the name of the datatype).
8317 * Classical reasoner / Simplifier combination: new force_tac (and
8318 derivatives Force_tac, force) combines rewriting and classical
8319 reasoning (and whatever other tools) similarly to auto_tac, but is
8320 aimed to solve the given subgoal completely.
8325 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8326 and `goalw': the theory is no longer needed as an explicit argument -
8327 the current theory context is used; assumptions are no longer returned
8328 at the ML-level unless one of them starts with ==> or !!; it is
8329 recommended to convert to these new commands using isatool fixgoal
8330 (backup your sources first!);
8332 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8333 the current theory context, and 'theory' to lookup stored theories;
8335 * new theory section 'locale' for declaring constants, assumptions and
8336 definitions that have local scope;
8338 * new theory section 'nonterminals' for purely syntactic types;
8340 * new theory section 'setup' for generic ML setup functions
8341 (e.g. package initialization);
8343 * the distribution now includes Isabelle icons: see
8344 lib/logo/isabelle-{small,tiny}.xpm;
8346 * isatool install - install binaries with absolute references to
8349 * isatool logo -- create instances of the Isabelle logo (as EPS);
8351 * print mode 'emacs' reserved for Isamode;
8353 * support multiple print (ast) translations per constant name;
8355 * theorems involving oracles are now printed with a suffixed [!];
8360 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
8362 * HOL/inductive package reorganized and improved: now supports mutual
8368 oddI "n : EVEN ==> Suc n : ODD"
8369 evenI "n : ODD ==> Suc n : EVEN"
8371 new theorem list "elims" contains an elimination rule for each of the
8372 recursive sets; inductive definitions now handle disjunctive premises
8373 correctly (also ZF);
8375 INCOMPATIBILITIES: requires Inductive as an ancestor; component
8376 "mutual_induct" no longer exists - the induction rule is always
8377 contained in "induct";
8380 * HOL/datatype package re-implemented and greatly improved: now
8381 supports mutually recursive datatypes such as
8384 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
8385 | SUM ('a aexp) ('a aexp)
8386 | DIFF ('a aexp) ('a aexp)
8389 'a bexp = LESS ('a aexp) ('a aexp)
8390 | AND ('a bexp) ('a bexp)
8391 | OR ('a bexp) ('a bexp)
8393 as well as indirectly recursive datatypes such as
8396 ('a, 'b) term = Var 'a
8397 | App 'b ((('a, 'b) term) list)
8399 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
8400 induction on mutually / indirectly recursive datatypes.
8402 Primrec equations are now stored in theory and can be accessed via
8403 <function_name>.simps.
8407 - Theories using datatypes must now have theory Datatype as an
8409 - The specific <typename>.induct_tac no longer exists - use the
8410 generic induct_tac instead.
8411 - natE has been renamed to nat.exhaust - use exhaust_tac
8412 instead of res_inst_tac ... natE. Note that the variable
8413 names in nat.exhaust differ from the names in natE, this
8414 may cause some "fragile" proofs to fail.
8415 - The theorems split_<typename>_case and split_<typename>_case_asm
8416 have been renamed to <typename>.split and <typename>.split_asm.
8417 - Since default sorts of type variables are now handled correctly,
8418 some datatype definitions may have to be annotated with explicit
8420 - Primrec definitions no longer require function name and type
8421 of recursive argument.
8423 Consider using isatool fixdatatype to adapt your theories and proof
8424 scripts to the new package (backup your sources first!).
8427 * HOL/record package: considerably improved implementation; now
8428 includes concrete syntax for record types, terms, updates; theorems
8429 for surjective pairing and splitting !!-bound record variables; proof
8430 support is as follows:
8432 1) standard conversions (selectors or updates applied to record
8433 constructor terms) are part of the standard simpset;
8435 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
8436 made part of standard simpset and claset via addIffs;
8438 3) a tactic for record field splitting (record_split_tac) is part of
8439 the standard claset (addSWrapper);
8441 To get a better idea about these rules you may retrieve them via
8442 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
8443 the name of your record type.
8445 The split tactic 3) conceptually simplifies by the following rule:
8447 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
8449 Thus any record variable that is bound by meta-all will automatically
8450 blow up into some record constructor term, consequently the
8451 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
8452 solve record problems automatically.
8455 * reorganized the main HOL image: HOL/Integ and String loaded by
8456 default; theory Main includes everything;
8458 * automatic simplification of integer sums and comparisons, using cancellation;
8460 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
8462 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
8464 * many new identities for unions, intersections, set difference, etc.;
8466 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
8467 called split_if, split_split, split_sum_case and split_nat_case (to go
8468 with add/delsplits);
8470 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
8471 (?x::unit) = (); this is made part of the default simpset, which COULD
8472 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
8473 'Delsimprocs [unit_eq_proc];' as last resort); also note that
8474 unit_abs_eta_conv is added in order to counter the effect of
8475 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
8478 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
8481 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8482 It and 'sym RS equals0D' are now in the default claset, giving automatic
8483 disjointness reasoning but breaking a few old proofs.
8485 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
8486 to 'converse' from 'inverse' (for compatibility with ZF and some
8489 * HOL/recdef can now declare non-recursive functions, with {} supplied as
8490 the well-founded relation;
8492 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
8493 Compl A. The "Compl" syntax remains available as input syntax for this
8496 * HOL/Update: new theory of function updates:
8497 f(a:=b) == %x. if x=a then b else f x
8498 may also be iterated as in f(a:=b,c:=d,...);
8500 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8503 - new function list_update written xs[i:=v] that updates the i-th
8504 list position. May also be iterated as in xs[i:=a,j:=b,...].
8505 - new function `upt' written [i..j(] which generates the list
8506 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8507 bound write [i..j], which is a shorthand for [i..j+1(].
8508 - new lexicographic orderings and corresponding wellfoundedness theorems.
8511 - removed 'pred' (predecessor) function;
8512 - generalized some theorems about n-1;
8513 - many new laws about "div" and "mod";
8514 - new laws about greatest common divisors (see theory ex/Primes);
8516 * HOL/Relation: renamed the relational operator r^-1 "converse"
8517 instead of "inverse";
8519 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8520 of the multiset ordering;
8522 * directory HOL/Real: a construction of the reals using Dedekind cuts
8523 (not included by default);
8525 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8527 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8528 programs, i.e. different program variables may have different types.
8530 * calling (stac rew i) now fails if "rew" has no effect on the goal
8531 [previously, this check worked only if the rewrite rule was unconditional]
8532 Now rew can involve either definitions or equalities (either == or =).
8537 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8538 only the theorems proved on ZF.ML;
8540 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8541 It and 'sym RS equals0D' are now in the default claset, giving automatic
8542 disjointness reasoning but breaking a few old proofs.
8544 * ZF/Update: new theory of function updates
8545 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8546 may also be iterated as in f(a:=b,c:=d,...);
8548 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8550 * calling (stac rew i) now fails if "rew" has no effect on the goal
8551 [previously, this check worked only if the rewrite rule was unconditional]
8552 Now rew can involve either definitions or equalities (either == or =).
8554 * case_tac provided for compatibility with HOL
8555 (like the old excluded_middle_tac, but with subgoals swapped)
8558 *** Internal programming interfaces ***
8560 * Pure: several new basic modules made available for general use, see
8561 also src/Pure/README;
8563 * improved the theory data mechanism to support encapsulation (data
8564 kind name replaced by private Object.kind, acting as authorization
8565 key); new type-safe user interface via functor TheoryDataFun; generic
8566 print_data function becomes basically useless;
8568 * removed global_names compatibility flag -- all theory declarations
8569 are qualified by default;
8571 * module Pure/Syntax now offers quote / antiquote translation
8572 functions (useful for Hoare logic etc. with implicit dependencies);
8573 see HOL/ex/Antiquote for an example use;
8575 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8578 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8581 * Display.print_goals function moved to Locale.print_goals;
8583 * standard print function for goals supports current_goals_markers
8584 variable for marking begin of proof, end of proof, start of goal; the
8585 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8586 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8591 New in Isabelle98 (January 1998)
8592 --------------------------------
8594 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8596 * changed lexical syntax of terms / types: dots made part of long
8597 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8599 * simpset (and claset) reference variable replaced by functions
8600 simpset / simpset_ref;
8602 * no longer supports theory aliases (via merge) and non-trivial
8603 implicit merge of thms' signatures;
8605 * most internal names of constants changed due to qualified names;
8607 * changed Pure/Sequence interface (see Pure/seq.ML);
8610 *** General Changes ***
8612 * hierachically structured name spaces (for consts, types, axms, thms
8613 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8614 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8615 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8616 long_names for fully qualified output names; NOTE: ML programs
8617 (special tactics, packages etc.) referring to internal names may have
8618 to be adapted to cope with fully qualified names; in case of severe
8619 backward campatibility problems try setting 'global_names' at compile
8620 time to have enrything declared within a flat name space; one may also
8621 fine tune name declarations in theories via the 'global' and 'local'
8624 * reimplemented the implicit simpset and claset using the new anytype
8625 data filed in signatures; references simpset:simpset ref etc. are
8626 replaced by functions simpset:unit->simpset and
8627 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8628 to patch your ML files accordingly;
8630 * HTML output now includes theory graph data for display with Java
8631 applet or isatool browser; data generated automatically via isatool
8632 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8634 * defs may now be conditional; improved rewrite_goals_tac to handle
8635 conditional equations;
8637 * defs now admits additional type arguments, using TYPE('a) syntax;
8639 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8640 creates a new theory node; implicit merge of thms' signatures is
8641 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8642 transfer:theory->thm->thm in (rare) cases;
8644 * improved handling of draft signatures / theories; draft thms (and
8645 ctyps, cterms) are automatically promoted to real ones;
8647 * slightly changed interfaces for oracles: admit many per theory, named
8648 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8650 * print_goals: optional output of const types (set show_consts and
8653 * improved output of warnings (###) and errors (***);
8655 * subgoal_tac displays a warning if the new subgoal has type variables;
8657 * removed old README and Makefiles;
8659 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8661 * removed obsolete init_pps and init_database;
8663 * deleted the obsolete tactical STATE, which was declared by
8664 fun STATE tacfun st = tacfun st st;
8666 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8667 (which abbreviates $HOME);
8669 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8670 use isatool fixseq to adapt your ML programs (this works for fully
8671 qualified references to the Sequence structure only!);
8673 * use_thy no longer requires writable current directory; it always
8674 reloads .ML *and* .thy file, if either one is out of date;
8677 *** Classical Reasoner ***
8679 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8680 tactics that use classical reasoning to simplify a subgoal without
8681 splitting it into several subgoals;
8683 * Safe_tac: like safe_tac but uses the default claset;
8688 * added simplification meta rules:
8689 (asm_)(full_)simplify: simpset -> thm -> thm;
8691 * simplifier.ML no longer part of Pure -- has to be loaded by object
8694 * added prems argument to simplification procedures;
8696 * HOL, FOL, ZF: added infix function `addsplits':
8697 instead of `<simpset> setloop (split_tac <thms>)'
8698 you can simply write `<simpset> addsplits <thms>'
8703 * TYPE('a) syntax for type reflection terms;
8705 * no longer handles consts with name "" -- declare as 'syntax' instead;
8707 * pretty printer: changed order of mixfix annotation preference (again!);
8709 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8714 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8715 with `addloop' of the simplifier to faciliate case splitting in premises.
8717 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8719 * HOL/Auth: new protocol proofs including some for the Internet
8722 * HOL/Map: new theory of `maps' a la VDM;
8724 * HOL/simplifier: simplification procedures nat_cancel_sums for
8725 cancelling out common nat summands from =, <, <= (in)equalities, or
8726 differences; simplification procedures nat_cancel_factor for
8727 cancelling common factor from =, <, <= (in)equalities over natural
8728 sums; nat_cancel contains both kinds of procedures, it is installed by
8729 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8731 * HOL/simplifier: terms of the form
8732 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8734 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8735 and those of the form
8736 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8738 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8741 Each datatype `t' now comes with a theorem `split_t_case' of the form
8743 P(t_case f1 ... fn x) =
8744 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8746 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8749 and a theorem `split_t_case_asm' of the form
8751 P(t_case f1 ... fn x) =
8752 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8754 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8756 which can be added to a simpset via `addsplits'. The existing theorems
8757 expand_list_case and expand_option_case have been renamed to
8758 split_list_case and split_option_case.
8761 - `pred n' is automatically converted to `n-1'.
8762 Users are strongly encouraged not to use `pred' any longer,
8763 because it will disappear altogether at some point.
8764 - Users are strongly encouraged to write "0 < n" rather than
8765 "n ~= 0". Theorems and proof tools have been modified towards this
8769 the function "set_of_list" has been renamed "set" (and its theorems too);
8770 the function "nth" now takes its arguments in the reverse order and
8771 has acquired the infix notation "!" as in "xs!n".
8773 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8775 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8776 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8778 * HOL/record: extensible records with schematic structural subtyping
8779 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8780 still lacks various theorems and concrete record syntax;
8785 * removed "axioms" and "generated by" sections;
8787 * replaced "ops" section by extended "consts" section, which is capable of
8788 handling the continuous function space "->" directly;
8791 . proves theorems immediately and stores them in the theory,
8792 . creates hierachical name space,
8793 . now uses normal mixfix annotations (instead of cinfix...),
8794 . minor changes to some names and values (for consistency),
8795 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8796 . separator between mutual domain defs: changed "," to "and",
8797 . improved handling of sort constraints; now they have to
8798 appear on the left-hand side of the equations only;
8800 * fixed LAM <x,y,zs>.b syntax;
8802 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8803 adm (%x. P (t x)), where P is chainfinite and t continuous;
8808 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8809 with `addloop' of the simplifier to faciliate case splitting in premises.
8811 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8812 in HOL, they strip ALL and --> from proved theorems;
8816 New in Isabelle94-8 (May 1997)
8817 ------------------------------
8819 *** General Changes ***
8821 * new utilities to build / run / maintain Isabelle etc. (in parts
8822 still somewhat experimental); old Makefiles etc. still functional;
8824 * new 'Isabelle System Manual';
8826 * INSTALL text, together with ./configure and ./build scripts;
8828 * reimplemented type inference for greater efficiency, better error
8829 messages and clean internal interface;
8831 * prlim command for dealing with lots of subgoals (an easier way of
8832 setting goals_limit);
8837 * supports alternative (named) syntax tables (parser and pretty
8838 printer); internal interface is provided by add_modesyntax(_i);
8840 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8841 be used in conjunction with the Isabelle symbol font; uses the
8842 "symbols" syntax table;
8844 * added token_translation interface (may translate name tokens in
8845 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8846 the current print_mode); IMPORTANT: user print translation functions
8847 are responsible for marking newly introduced bounds
8848 (Syntax.mark_boundT);
8850 * token translations for modes "xterm" and "xterm_color" that display
8851 names in bold, underline etc. or colors (which requires a color
8854 * infixes may now be declared with names independent of their syntax;
8856 * added typed_print_translation (like print_translation, but may
8857 access type of constant);
8860 *** Classical Reasoner ***
8862 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8863 some limitations. Blast_tac...
8864 + ignores addss, addbefore, addafter; this restriction is intrinsic
8865 + ignores elimination rules that don't have the correct format
8866 (the conclusion MUST be a formula variable)
8867 + ignores types, which can make HOL proofs fail
8868 + rules must not require higher-order unification, e.g. apply_type in ZF
8869 [message "Function Var's argument not a bound variable" relates to this]
8870 + its proof strategy is more general but can actually be slower
8872 * substitution with equality assumptions no longer permutes other
8875 * minor changes in semantics of addafter (now called addaltern); renamed
8876 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8877 (and access functions for it);
8879 * improved combination of classical reasoner and simplifier:
8880 + functions for handling clasimpsets
8881 + improvement of addss: now the simplifier is called _after_ the
8883 + safe variant of addss called addSss: uses safe simplifications
8884 _during_ the safe steps. It is more complete as it allows multiple
8885 instantiations of unknowns (e.g. with slow_tac).
8889 * added interface for simplification procedures (functions that
8890 produce *proven* rewrite rules on the fly, depending on current
8893 * ordering on terms as parameter (used for ordered rewriting);
8895 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8897 * the solver is now split into a safe and an unsafe part.
8898 This should be invisible for the normal user, except that the
8899 functions setsolver and addsolver have been renamed to setSolver and
8900 addSolver; added safe_asm_full_simp_tac;
8905 * a generic induction tactic `induct_tac' which works for all datatypes and
8906 also for type `nat';
8908 * a generic case distinction tactic `exhaust_tac' which works for all
8909 datatypes and also for type `nat';
8911 * each datatype comes with a function `size';
8913 * patterns in case expressions allow tuple patterns as arguments to
8914 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8916 * primrec now also works with type nat;
8918 * recdef: a new declaration form, allows general recursive functions to be
8919 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8921 * the constant for negation has been renamed from "not" to "Not" to
8922 harmonize with FOL, ZF, LK, etc.;
8924 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8927 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8929 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8930 problems in commutative rings, using axiomatic type classes for + and *;
8932 * more examples in HOL/MiniML and HOL/Auth;
8934 * more default rewrite rules for quantifiers, union/intersection;
8936 * a new constant `arbitrary == @x.False';
8938 * HOLCF/IOA replaces old HOL/IOA;
8940 * HOLCF changes: derived all rules and arities
8941 + axiomatic type classes instead of classes
8942 + typedef instead of faking type definitions
8943 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8944 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8945 + eliminated the types void, one, tr
8946 + use unit lift and bool lift (with translations) instead of one and tr
8947 + eliminated blift from Lift3.thy (use Def instead of blift)
8948 all eliminated rules are derived as theorems --> no visible changes ;
8953 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8954 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8955 as ZF_cs addSIs [equalityI];
8959 New in Isabelle94-7 (November 96)
8960 ---------------------------------
8962 * allowing negative levels (as offsets) in prlev and choplev;
8964 * super-linear speedup for large simplifications;
8966 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8967 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8968 FAIL); can suppress it using the command Delsimps (ex_simps @
8969 all_simps); De Morgan laws are also now included, by default;
8971 * improved printing of ==> : ~:
8973 * new object-logic "Sequents" adds linear logic, while replacing LK
8974 and Modal (thanks to Sara Kalvala);
8976 * HOL/Auth: correctness proofs for authentication protocols;
8978 * HOL: new auto_tac combines rewriting and classical reasoning (many
8979 examples on HOL/Auth);
8981 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8982 the rewriter and classical reasoner simultaneously;
8984 * function uresult no longer returns theorems in "standard" format;
8985 regain previous version by: val uresult = standard o uresult;
8992 * oracles -- these establish an interface between Isabelle and trusted
8993 external reasoners, which may deliver results as theorems;
8995 * proof objects (in particular record all uses of oracles);
8997 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8999 * "constdefs" section in theory files;
9001 * "primrec" section (HOL) no longer requires names;
9003 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9010 * reduced space requirements;
9012 * automatic HTML generation from theories;
9014 * theory files no longer require "..." (quotes) around most types;
9016 * new examples, including two proofs of the Church-Rosser theorem;
9018 * non-curried (1994) version of HOL is no longer distributed;
9025 * greatly reduced space requirements;
9027 * theory files (.thy) no longer require \...\ escapes at line breaks;
9029 * searchable theorem database (see the section "Retrieving theorems" on
9030 page 8 of the Reference Manual);
9032 * new examples, including Grabczewski's monumental case study of the
9035 * The previous version of HOL renamed to Old_HOL;
9037 * The new version of HOL (previously called CHOL) uses a curried syntax
9038 for functions. Application looks like f a b instead of f(a,b);
9040 * Mutually recursive inductive definitions finally work in HOL;
9042 * In ZF, pattern-matching on tuples is now available in all abstractions and
9043 translates to the operator "split";
9050 * new infix operator, addss, allowing the classical reasoner to
9051 perform simplification at each step of its search. Example:
9052 fast_tac (cs addss ss)
9054 * a new logic, CHOL, the same as HOL, but with a curried syntax
9055 for functions. Application looks like f a b instead of f(a,b). Also pairs
9056 look like (a,b) instead of <a,b>;
9058 * PLEASE NOTE: CHOL will eventually replace HOL!
9060 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9061 It translates to the operator "split". A new theory of integers is available;
9063 * In ZF, integer numerals now denote two's-complement binary integers.
9064 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9066 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9067 of the Axiom of Choice;
9074 * Significantly faster resolution;
9076 * the different sections in a .thy file can now be mixed and repeated
9079 * Database of theorems for FOL, HOL and ZF. New
9080 commands including qed, qed_goal and bind_thm store theorems in the database.
9082 * Simple database queries: return a named theorem (get_thm) or all theorems of
9083 a given theory (thms_of), or find out what theory a theorem was proved in
9086 * Bugs fixed in the inductive definition and datatype packages;
9088 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9089 and HOL_dup_cs obsolete;
9091 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9094 * Simpler definition of function space in ZF;
9096 * new results about cardinal and ordinal arithmetic in ZF;
9098 * 'subtype' facility in HOL for introducing new types as subsets of existing
9101 :mode=text:wrap=hard:maxLineLen=72: