1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2012 (May 2012)
5 ------------------------------
9 * Prover IDE (PIDE) improvements:
11 - more robust Sledgehammer integration (as before the sledgehammer
12 command-line needs to be typed into the source buffer)
13 - markup for bound variables
14 - markup for types of term variables (displayed as tooltips)
15 - support for user-defined Isar commands within the running session
16 - improved support for Unicode outside original 16bit range
17 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
19 * Forward declaration of outer syntax keywords within the theory
20 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
21 commands to be used in the same theory where defined.
23 * Auxiliary contexts indicate block structure for specifications with
24 additional parameters and assumptions. Such unnamed contexts may be
25 nested within other targets, like 'theory', 'locale', 'class',
26 'instantiation' etc. Results from the local context are generalized
27 accordingly and applied to the enclosing target context. Example:
31 assumes xy: "x = y" and yz: "y = z"
34 lemma my_trans: "x = z" using xy yz by simp
40 The most basic application is to factor-out context elements of
41 several fixes/assumes/shows theorem statements, e.g. see
42 ~~/src/HOL/Isar_Examples/Group_Context.thy
44 Any other local theory specification element works within the "context
45 ... begin ... end" block as well.
47 * Bundled declarations associate attributed fact expressions with a
48 given name in the context. These may be later included in other
49 contexts. This allows to manage context extensions casually, without
50 the logical dependencies of locales and locale interpretation.
52 See commands 'bundle', 'include', 'including' etc. in the isar-ref
55 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
56 declaration, and results are standardized before being stored. Thus
57 old-style "standard" after instantiation or composition of facts
58 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
59 indices of schematic variables.
61 * Rule attributes in local theory declarations (e.g. locale or class)
62 are now statically evaluated: the resulting theorem is stored instead
63 of the original expression. INCOMPATIBILITY in rare situations, where
64 the historic accident of dynamic re-evaluation in interpretations
67 * New tutorial "Programming and Proving in Isabelle/HOL"
68 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
69 Structured Isar Proofs" ("isar-overview"), which has been removed. It
70 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
71 Logic" as the recommended beginners tutorial, but does not cover all
72 of the material of that old tutorial.
74 * Updated and extended reference manuals: "isar-ref",
75 "implementation", "system"; reduced remaining material in old "ref"
81 * Discontinued old "prems" fact, which used to refer to the accidental
82 collection of foundational premises in the context (already marked as
83 legacy since Isabelle2011).
85 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
86 tolerant against multiple unifiers, as long as the final result is
87 unique. (As before, rules are composed in canonical right-to-left
88 order to accommodate newly introduced premises.)
90 * Command 'definition' no longer exports the foundational "raw_def"
91 into the user context. Minor INCOMPATIBILITY, may use the regular
92 "def" result with attribute "abs_def" to imitate the old version.
94 * Renamed some inner syntax categories:
100 Minor INCOMPATIBILITY. Note that in practice "num_const" or
101 "num_position" etc. are mainly used instead (which also include
102 position information via constraints).
104 * Simplified configuration options for syntax ambiguity: see
105 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
106 manual. Minor INCOMPATIBILITY.
108 * Attribute "abs_def" turns an equation of the form "f x y == t" into
109 "f == %x y. t", which ensures that "simp" or "unfold" steps always
110 expand it. This also works for object-logic equality. (Formerly
111 undocumented feature.)
113 * Obsolete command 'types' has been discontinued. Use 'type_synonym'
114 instead. INCOMPATIBILITY.
116 * Old code generator for SML and its commands 'code_module',
117 'code_library', 'consts_code', 'types_code' have been discontinued.
118 Use commands of the generic code generator instead. INCOMPATIBILITY.
120 * Redundant attribute "code_inline" has been discontinued. Use
121 "code_unfold" instead. INCOMPATIBILITY.
123 * Dropped attribute "code_unfold_post" in favor of the its dual
124 "code_abbrev", which yields a common pattern in definitions like
126 definition [code_abbrev]: "f = t"
130 * Sort constraints are now propagated in simultaneous statements, just
131 like type constraints. INCOMPATIBILITY in rare situations, where
132 distinct sorts used to be assigned accidentally. For example:
134 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
136 lemma "P (x::'a)" and "Q (y::'a::bar)"
137 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
142 * Type 'a set is now a proper type constructor (just as before
143 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
144 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
145 sets separate, it is often sufficient to rephrase sets S accidentally
146 used as predicates by "%x. x : S" and predicates P accidentally used
147 as sets by "{x. P x}". Corresponding proofs in a first step should be
148 pruned from any tinkering with former theorems mem_def and Collect_def
151 For developments which deliberately mixed predicates and sets, a
152 planning step is necessary to determine what should become a predicate
153 and what a set. It can be helpful to carry out that step in
154 Isabelle2011-1 before jumping right into the current release.
156 * The representation of numerals has changed. Datatype "num"
157 represents strictly positive binary numerals, along with functions
158 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
159 positive and negated numeric literals, respectively. (See definitions
160 in ~~/src/HOL/Num.thy.) Potential INCOMPATIBILITY, some user theories
161 may require adaptations as follows:
163 - Theorems with number_ring or number_semiring constraints: These
164 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
166 - Theories defining numeric types: Remove number, number_semiring,
167 and number_ring instances. Defer all theorems about numerals until
168 after classes one and semigroup_add have been instantiated.
170 - Numeral-only simp rules: Replace each rule having a "number_of v"
171 pattern with two copies, one for numeral and one for neg_numeral.
173 - Theorems about subclasses of semiring_1 or ring_1: These classes
174 automatically support numerals now, so more simp rules and
175 simprocs may now apply within the proof.
177 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
178 Redefine using other integer operations.
180 * Code generation by default implements sets as container type rather
181 than predicates. INCOMPATIBILITY.
183 * Records: code generation can be switched off manually with
184 declare [[record_coden = false]]. Default remains true.
186 * HOL-Import: Re-implementation from scratch is faster, simpler, and
187 more scalable. Requires a proof bundle, which is available as an
188 external component. Discontinued old (and mostly dead) Importer for
189 HOL4 and HOL Light. INCOMPATIBILITY.
191 * New type synonym 'a rel = ('a * 'a) set
193 * New "case_product" attribute to generate a case rule doing multiple
194 case distinctions at the same time. E.g.
196 list.exhaust [case_product nat.exhaust]
198 produces a rule which can be used to perform case distinction on both
201 * New Transfer package:
203 - transfer_rule attribute: Maintains a collection of transfer rules,
204 which relate constants at two different types. Transfer rules may
205 relate different type instances of the same polymorphic constant,
206 or they may relate an operation on a raw type to a corresponding
207 operation on an abstract type (quotient or subtype). For example:
209 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
210 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
212 - transfer method: Replaces a subgoal on abstract types with an
213 equivalent subgoal on the corresponding raw types. Constants are
214 replaced with corresponding ones according to the transfer rules.
215 Goals are generalized over all free variables by default; this is
216 necessary for variables whose types changes, but can be overridden
217 for specific variables with e.g. 'transfer fixing: x y z'. The
218 variant transfer' method allows replacing a subgoal with one that
219 is logically stronger (rather than equivalent).
221 - relator_eq attribute: Collects identity laws for relators of
222 various type constructors, e.g. "list_all2 (op =) = (op =)". The
223 transfer method uses these lemmas to infer transfer rules for
224 non-polymorphic constants on the fly.
226 - transfer_prover method: Assists with proving a transfer rule for a
227 new constant, provided the constant is defined in terms of other
228 constants that already have transfer rules. It should be applied
229 after unfolding the constant definitions.
231 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
232 from type nat to type int.
234 * New Lifting package:
236 - lift_definition command: Defines operations on an abstract type in
237 terms of a corresponding operation on a representation
238 type. Example syntax:
240 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
243 Users must discharge a respectfulness proof obligation when each
244 constant is defined. (For a type copy, i.e. a typedef with UNIV,
245 the proof is discharged automatically.) The obligation is
246 presented in a user-friendly, readable form; a respectfulness
247 theorem in the standard format and a transfer rule are generated
250 - Integration with code_abstype: For typedefs (e.g. subtypes
251 corresponding to a datatype invariant, such as dlist),
252 lift_definition generates a code certificate theorem and sets up
253 code generation for each constant.
255 - setup_lifting command: Sets up the Lifting package to work with a
256 user-defined type. The user must provide either a quotient theorem
257 or a type_definition theorem. The package configures transfer
258 rules for equality and quantifiers on the type, and sets up the
259 lift_definition command to work with the type.
261 - Usage examples: See Quotient_Examples/Lift_DList.thy,
262 Quotient_Examples/Lift_RBT.thy, Word/Word.thy and
267 - The 'quotient_type' command now supports a 'morphisms' option with
268 rep and abs functions, similar to typedef.
270 - 'quotient_type' sets up new types to work with the Lifting and
271 Transfer packages, as with 'setup_lifting'.
273 - The 'quotient_definition' command now requires the user to prove a
274 respectfulness property at the point where the constant is
275 defined, similar to lift_definition; INCOMPATIBILITY.
277 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
278 accordingly, INCOMPATIBILITY.
280 * New diagnostic command 'find_unused_assms' to find potentially
281 superfluous assumptions in theorems using Quickcheck.
285 - Quickcheck returns variable assignments as counterexamples, which
286 allows to reveal the underspecification of functions under test.
287 For example, refuting "hd xs = x", it presents the variable
288 assignment xs = [] and x = a1 as a counterexample, assuming that
289 any property is false whenever "hd []" occurs in it.
291 These counterexample are marked as potentially spurious, as
292 Quickcheck also returns "xs = []" as a counterexample to the
293 obvious theorem "hd xs = hd xs".
295 After finding a potentially spurious counterexample, Quickcheck
296 continues searching for genuine ones.
298 By default, Quickcheck shows potentially spurious and genuine
299 counterexamples. The option "genuine_only" sets quickcheck to only
300 show genuine counterexamples.
302 - The command 'quickcheck_generator' creates random and exhaustive
303 value generators for a given type and operations.
305 It generates values by using the operations as if they were
306 constructors of that type.
308 - Support for multisets.
310 - Added "use_subtype" options.
312 - Added "quickcheck_locale" configuration to specify how to process
313 conjectures in a locale context.
316 - Fixed infinite loop caused by the 'peephole_optim' option and
317 affecting 'rat' and 'real'.
320 - Integrated more tightly with SPASS, as described in the ITP 2012
321 paper "More SPASS with Isabelle".
322 - Made it try "smt" as a fallback if "metis" fails or times out.
323 - Added support for the following provers: Alt-Ergo (via Why3 and
324 TFF1), iProver, iProver-Eq.
325 - Replaced remote E-SInE with remote Satallax in the default setup.
326 - Sped up the minimizer.
327 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
328 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
329 - Renamed "sound" option to "strict".
332 - Added possibility to specify lambda translations scheme as a
333 parenthesized argument (e.g., "by (metis (lifting) ...)").
336 - Renamed "smt_fixed" option to "smt_read_only_certificates".
339 - Renamed from 'try_methods'. INCOMPATIBILITY.
341 * New "eventually_elim" method as a generalized variant of the
342 eventually_elim* rules. Supports structured proofs.
344 * Typedef with implicit set definition is considered legacy. Use
345 "typedef (open)" form instead, which will eventually become the
348 * More default pred/set conversions on a couple of relation operations
349 and predicates. Added powers of predicate relations. Consolidation
350 of some relation theorems:
352 converse_def ~> converse_unfold
353 rel_comp_def ~> relcomp_unfold
354 symp_def ~> (modified, use symp_def and sym_def instead)
355 transp_def ~> transp_trans
356 Domain_def ~> Domain_unfold
357 Range_def ~> Domain_converse [symmetric]
359 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
361 See theory "Relation" for examples for making use of pred/set
362 conversions by means of attributes "to_set" and "to_pred".
366 * Renamed facts about the power operation on relations, i.e., relpow
367 to match the constant's name:
369 rel_pow_1 ~> relpow_1
370 rel_pow_0_I ~> relpow_0_I
371 rel_pow_Suc_I ~> relpow_Suc_I
372 rel_pow_Suc_I2 ~> relpow_Suc_I2
373 rel_pow_0_E ~> relpow_0_E
374 rel_pow_Suc_E ~> relpow_Suc_E
375 rel_pow_E ~> relpow_E
376 rel_pow_Suc_D2 ~> relpow_Suc_D2
377 rel_pow_Suc_E2 ~> relpow_Suc_E2
378 rel_pow_Suc_D2' ~> relpow_Suc_D2'
379 rel_pow_E2 ~> relpow_E2
380 rel_pow_add ~> relpow_add
381 rel_pow_commute ~> relpow
382 rel_pow_empty ~> relpow_empty:
383 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
384 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
385 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
386 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
387 rel_pow_fun_conv ~> relpow_fun_conv
388 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
389 rel_pow_finite_bounded ~> relpow_finite_bounded
390 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
391 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
392 single_valued_rel_pow ~> single_valued_relpow
396 * Theory Relation: Consolidated constant name for relation composition
397 and corresponding theorem names:
399 - Renamed constant rel_comp to relcomp.
401 - Dropped abbreviation pred_comp. Use relcompp instead.
405 rel_compI ~> relcompI
406 rel_compEpair ~> relcompEpair
407 rel_compE ~> relcompE
408 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
409 rel_comp_empty1 ~> relcomp_empty1
410 rel_comp_mono ~> relcomp_mono
411 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
412 rel_comp_distrib ~> relcomp_distrib
413 rel_comp_distrib2 ~> relcomp_distrib2
414 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
415 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
416 single_valued_rel_comp ~> single_valued_relcomp
417 rel_comp_def ~> relcomp_unfold
418 converse_rel_comp ~> converse_relcomp
419 pred_compI ~> relcomppI
420 pred_compE ~> relcomppE
421 pred_comp_bot1 ~> relcompp_bot1
422 pred_comp_bot2 ~> relcompp_bot2
423 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
424 pred_comp_mono ~> relcompp_mono
425 pred_comp_distrib ~> relcompp_distrib
426 pred_comp_distrib2 ~> relcompp_distrib2
427 converse_pred_comp ~> converse_relcompp
429 finite_rel_comp ~> finite_relcomp
431 set_rel_comp ~> set_relcomp
435 * Theory Divides: Discontinued redundant theorems about div and mod.
436 INCOMPATIBILITY, use the corresponding generic theorems instead.
438 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
439 zdiv_self ~> div_self
440 zmod_self ~> mod_self
443 zdiv_zmod_equality ~> div_mod_equality2
444 zdiv_zmod_equality2 ~> div_mod_equality
445 zmod_zdiv_trivial ~> mod_div_trivial
446 zdiv_zminus_zminus ~> div_minus_minus
447 zmod_zminus_zminus ~> mod_minus_minus
448 zdiv_zminus2 ~> div_minus_right
449 zmod_zminus2 ~> mod_minus_right
450 zdiv_minus1_right ~> div_minus1_right
451 zmod_minus1_right ~> mod_minus1_right
452 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
453 zmod_zmult1_eq ~> mod_mult_right_eq
454 zpower_zmod ~> power_mod
456 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
457 mod_mult_distrib ~> mult_mod_left
458 mod_mult_distrib2 ~> mult_mod_right
460 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
461 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
463 * Finite_Set.fold now qualified. INCOMPATIBILITY.
465 * Consolidated theorem names concerning fold combinators:
467 inf_INFI_fold_inf ~> inf_INF_fold_inf
468 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
469 INFI_fold_inf ~> INF_fold_inf
470 SUPR_fold_sup ~> SUP_fold_sup
471 union_set ~> union_set_fold
472 minus_set ~> minus_set_fold
473 INFI_set_fold ~> INF_set_fold
474 SUPR_set_fold ~> SUP_set_fold
475 INF_code ~> INF_set_foldr
476 SUP_code ~> SUP_set_foldr
477 foldr.simps ~> foldr.simps (in point-free formulation)
478 foldr_fold_rev ~> foldr_conv_fold
479 foldl_fold ~> foldl_conv_fold
480 foldr_foldr ~> foldr_conv_foldl
481 foldl_foldr ~> foldl_conv_foldr
482 fold_set_remdups ~> fold_set_fold_remdups
483 fold_set ~> fold_set_fold
484 fold1_set ~> fold1_set_fold
488 * Dropped rarely useful theorems concerning fold combinators:
489 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
490 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
491 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
492 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
493 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
494 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
495 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
496 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
497 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
498 unfolding "foldr_conv_fold" and "foldl_conv_fold".
500 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
501 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
502 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
503 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
504 lemmas over fold rather than foldr, or make use of lemmas
505 fold_conv_foldr and fold_rev.
507 * Congruence rules Option.map_cong and Option.bind_cong for recursion
508 through option types.
510 * Concrete syntax for case expressions includes constraints for source
511 positions, and thus produces Prover IDE markup for its bindings.
512 INCOMPATIBILITY for old-style syntax translations that augment the
513 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
516 * Discontinued configuration option "syntax_positions": atomic terms
517 in parse trees are always annotated by position constraints.
519 * HOL/Library/Set_Algebras.thy: Addition and multiplication on sets
520 are expressed via type classes again. The special syntax
521 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
522 setsum_set, which is now subsumed by Big_Operators.setsum.
525 * New theory HOL/Library/DAList provides an abstract type for
526 association lists with distinct keys.
528 * 'datatype' specifications allow explicit sort constraints.
530 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
531 use theory HOL/Library/Nat_Bijection instead.
533 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
534 trees is now inside a type class context. Names of affected
535 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
536 theories working directly with raw red-black trees, adapt the names as
540 bulkload -> rbt_bulkload
541 del_from_left -> rbt_del_from_left
542 del_from_right -> rbt_del_from_right
547 insertw -> rbt_insert_with
548 insert_with_key -> rbt_insert_with_key
549 map_entry -> rbt_map_entry
552 tree_greater -> rbt_greater
553 tree_less -> rbt_less
554 tree_less_symbol -> rbt_less_symbol
556 union_with -> rbt_union_with
557 union_with_key -> rbt_union_with_key
560 balance_left_sorted -> balance_left_rbt_sorted
561 balance_left_tree_greater -> balance_left_rbt_greater
562 balance_left_tree_less -> balance_left_rbt_less
563 balance_right_sorted -> balance_right_rbt_sorted
564 balance_right_tree_greater -> balance_right_rbt_greater
565 balance_right_tree_less -> balance_right_rbt_less
566 balance_sorted -> balance_rbt_sorted
567 balance_tree_greater -> balance_rbt_greater
568 balance_tree_less -> balance_rbt_less
569 bulkload_is_rbt -> rbt_bulkload_is_rbt
570 combine_sorted -> combine_rbt_sorted
571 combine_tree_greater -> combine_rbt_greater
572 combine_tree_less -> combine_rbt_less
573 delete_in_tree -> rbt_delete_in_tree
574 delete_is_rbt -> rbt_delete_is_rbt
575 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
576 del_from_left_tree_less -> rbt_del_from_left_rbt_less
577 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
578 del_from_right_tree_less -> rbt_del_from_right_rbt_less
579 del_in_tree -> rbt_del_in_tree
580 del_inv1_inv2 -> rbt_del_inv1_inv2
581 del_sorted -> rbt_del_rbt_sorted
582 del_tree_greater -> rbt_del_rbt_greater
583 del_tree_less -> rbt_del_rbt_less
584 dom_lookup_Branch -> dom_rbt_lookup_Branch
585 entries_lookup -> entries_rbt_lookup
586 finite_dom_lookup -> finite_dom_rbt_lookup
587 insert_sorted -> rbt_insert_rbt_sorted
588 insertw_is_rbt -> rbt_insertw_is_rbt
589 insertwk_is_rbt -> rbt_insertwk_is_rbt
590 insertwk_sorted -> rbt_insertwk_rbt_sorted
591 insertw_sorted -> rbt_insertw_rbt_sorted
592 ins_sorted -> ins_rbt_sorted
593 ins_tree_greater -> ins_rbt_greater
594 ins_tree_less -> ins_rbt_less
595 is_rbt_sorted -> is_rbt_rbt_sorted
596 lookup_balance -> rbt_lookup_balance
597 lookup_bulkload -> rbt_lookup_rbt_bulkload
598 lookup_delete -> rbt_lookup_rbt_delete
599 lookup_Empty -> rbt_lookup_Empty
600 lookup_from_in_tree -> rbt_lookup_from_in_tree
601 lookup_in_tree -> rbt_lookup_in_tree
602 lookup_ins -> rbt_lookup_ins
603 lookup_insert -> rbt_lookup_rbt_insert
604 lookup_insertw -> rbt_lookup_rbt_insertw
605 lookup_insertwk -> rbt_lookup_rbt_insertwk
606 lookup_keys -> rbt_lookup_keys
607 lookup_map -> rbt_lookup_map
608 lookup_map_entry -> rbt_lookup_rbt_map_entry
609 lookup_tree_greater -> rbt_lookup_rbt_greater
610 lookup_tree_less -> rbt_lookup_rbt_less
611 lookup_union -> rbt_lookup_rbt_union
612 map_entry_color_of -> rbt_map_entry_color_of
613 map_entry_inv1 -> rbt_map_entry_inv1
614 map_entry_inv2 -> rbt_map_entry_inv2
615 map_entry_is_rbt -> rbt_map_entry_is_rbt
616 map_entry_sorted -> rbt_map_entry_rbt_sorted
617 map_entry_tree_greater -> rbt_map_entry_rbt_greater
618 map_entry_tree_less -> rbt_map_entry_rbt_less
619 map_tree_greater -> map_rbt_greater
620 map_tree_less -> map_rbt_less
621 map_sorted -> map_rbt_sorted
622 paint_sorted -> paint_rbt_sorted
623 paint_lookup -> paint_rbt_lookup
624 paint_tree_greater -> paint_rbt_greater
625 paint_tree_less -> paint_rbt_less
626 sorted_entries -> rbt_sorted_entries
627 tree_greater_eq_trans -> rbt_greater_eq_trans
628 tree_greater_nit -> rbt_greater_nit
629 tree_greater_prop -> rbt_greater_prop
630 tree_greater_simps -> rbt_greater_simps
631 tree_greater_trans -> rbt_greater_trans
632 tree_less_eq_trans -> rbt_less_eq_trans
633 tree_less_nit -> rbt_less_nit
634 tree_less_prop -> rbt_less_prop
635 tree_less_simps -> rbt_less_simps
636 tree_less_trans -> rbt_less_trans
637 tree_ord_props -> rbt_ord_props
638 union_Branch -> rbt_union_Branch
639 union_is_rbt -> rbt_union_is_rbt
640 unionw_is_rbt -> rbt_unionw_is_rbt
641 unionwk_is_rbt -> rbt_unionwk_is_rbt
642 unionwk_sorted -> rbt_unionwk_rbt_sorted
644 * Theory HOL/Library/Float: Floating point numbers are now defined as
645 a subset of the real numbers. All operations are defined using the
646 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
653 round_down -> float_round_down
654 round_up -> float_round_up
658 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
661 abs_float_def -> Float.compute_float_abs
662 bitlen_ge0 -> bitlen_nonneg
663 bitlen.simps -> Float.compute_bitlen
664 float_components -> Float_mantissa_exponent
665 float_divl.simps -> Float.compute_float_divl
666 float_divr.simps -> Float.compute_float_divr
667 float_eq_odd -> mult_powr_eq_mult_powr_iff
668 float_power -> real_of_float_power
669 lapprox_posrat_def -> Float.compute_lapprox_posrat
670 lapprox_rat.simps -> Float.compute_lapprox_rat
671 le_float_def' -> Float.compute_float_le
672 le_float_def -> less_eq_float.rep_eq
673 less_float_def' -> Float.compute_float_less
674 less_float_def -> less_float.rep_eq
675 normfloat_def -> Float.compute_normfloat
676 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
677 normfloat -> normfloat_def
678 normfloat_unique -> use normfloat_def
679 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
680 one_float_def -> Float.compute_float_one
681 plus_float_def -> Float.compute_float_plus
682 rapprox_posrat_def -> Float.compute_rapprox_posrat
683 rapprox_rat.simps -> Float.compute_rapprox_rat
684 real_of_float_0 -> zero_float.rep_eq
685 real_of_float_1 -> one_float.rep_eq
686 real_of_float_abs -> abs_float.rep_eq
687 real_of_float_add -> plus_float.rep_eq
688 real_of_float_minus -> uminus_float.rep_eq
689 real_of_float_mult -> times_float.rep_eq
690 real_of_float_simp -> Float.rep_eq
691 real_of_float_sub -> minus_float.rep_eq
692 round_down.simps -> Float.compute_float_round_down
693 round_up.simps -> Float.compute_float_round_up
694 times_float_def -> Float.compute_float_times
695 uminus_float_def -> Float.compute_float_uminus
696 zero_float_def -> Float.compute_float_zero
698 Lemmas not necessary anymore, use the transfer method:
699 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
700 float_divr, float_le_simp, float_less1_mantissa_bound,
701 float_less_simp, float_less_zero, float_le_zero,
702 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
703 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
704 lapprox_rat_bottom, normalized_float, rapprox_posrat,
705 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
706 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
707 round_up, zero_le_float, zero_less_float
709 * Session HOL-Word: Discontinued many redundant theorems specific to
710 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
713 word_sub_alt ~> word_sub_wi
714 word_add_alt ~> word_add_def
715 word_mult_alt ~> word_mult_def
716 word_minus_alt ~> word_minus_def
717 word_0_alt ~> word_0_wi
718 word_1_alt ~> word_1_wi
719 word_add_0 ~> add_0_left
720 word_add_0_right ~> add_0_right
721 word_mult_1 ~> mult_1_left
722 word_mult_1_right ~> mult_1_right
723 word_add_commute ~> add_commute
724 word_add_assoc ~> add_assoc
725 word_add_left_commute ~> add_left_commute
726 word_mult_commute ~> mult_commute
727 word_mult_assoc ~> mult_assoc
728 word_mult_left_commute ~> mult_left_commute
729 word_left_distrib ~> left_distrib
730 word_right_distrib ~> right_distrib
731 word_left_minus ~> left_minus
732 word_diff_0_right ~> diff_0_right
733 word_diff_self ~> diff_self
734 word_sub_def ~> diff_minus
735 word_diff_minus ~> diff_minus
736 word_add_ac ~> add_ac
737 word_mult_ac ~> mult_ac
738 word_plus_ac0 ~> add_0_left add_0_right add_ac
739 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
740 word_order_trans ~> order_trans
741 word_order_refl ~> order_refl
742 word_order_antisym ~> order_antisym
743 word_order_linear ~> linorder_linear
744 lenw1_zero_neq_one ~> zero_neq_one
745 word_number_of_eq ~> number_of_eq
746 word_of_int_add_hom ~> wi_hom_add
747 word_of_int_sub_hom ~> wi_hom_sub
748 word_of_int_mult_hom ~> wi_hom_mult
749 word_of_int_minus_hom ~> wi_hom_neg
750 word_of_int_succ_hom ~> wi_hom_succ
751 word_of_int_pred_hom ~> wi_hom_pred
752 word_of_int_0_hom ~> word_0_wi
753 word_of_int_1_hom ~> word_1_wi
755 * Clarified attribute "mono_set": pure declaration without modifying
756 the result of the fact expression.
758 * "Transitive_Closure.ntrancl": bounded transitive closure on
761 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
763 * Theory Int: Discontinued many legacy theorems specific to type int.
764 INCOMPATIBILITY, use the corresponding generic theorems instead.
766 zminus_zminus ~> minus_minus
767 zminus_0 ~> minus_zero
768 zminus_zadd_distrib ~> minus_add_distrib
769 zadd_commute ~> add_commute
770 zadd_assoc ~> add_assoc
771 zadd_left_commute ~> add_left_commute
775 zadd_0_right ~> add_0_right
776 zadd_zminus_inverse2 ~> left_minus
777 zmult_zminus ~> mult_minus_left
778 zmult_commute ~> mult_commute
779 zmult_assoc ~> mult_assoc
780 zadd_zmult_distrib ~> left_distrib
781 zadd_zmult_distrib2 ~> right_distrib
782 zdiff_zmult_distrib ~> left_diff_distrib
783 zdiff_zmult_distrib2 ~> right_diff_distrib
784 zmult_1 ~> mult_1_left
785 zmult_1_right ~> mult_1_right
786 zle_refl ~> order_refl
787 zle_trans ~> order_trans
788 zle_antisym ~> order_antisym
789 zle_linear ~> linorder_linear
790 zless_linear ~> linorder_less_linear
791 zadd_left_mono ~> add_left_mono
792 zadd_strict_right_mono ~> add_strict_right_mono
793 zadd_zless_mono ~> add_less_le_mono
794 int_0_less_1 ~> zero_less_one
795 int_0_neq_1 ~> zero_neq_one
797 zpower_zadd_distrib ~> power_add
798 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
799 zero_le_zpower_abs ~> zero_le_power_abs
801 * Theory Deriv: Renamed
803 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
805 * Theory Library/Multiset: Improved code generation of multisets.
807 * Session HOL-Word: New proof method "word_bitwise" for splitting
808 machine word equalities and inequalities into logical circuits,
809 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
810 multiplication, shifting by constants, bitwise operators and numeric
811 constants. Requires fixed-length word types, not 'a word. Solves
812 many standard word identies outright and converts more into first
813 order problems amenable to blast or similar. See also examples in
814 HOL/Word/Examples/WordExamples.thy.
816 * Session HOL-Probability: Introduced the type "'a measure" to
817 represent measures, this replaces the records 'a algebra and 'a
818 measure_space. The locales based on subset_class now have two
819 locale-parameters the space \<Omega> and the set of measurables sets
820 M. The product of probability spaces uses now the same constant as
821 the finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
822 measure". Most constants are defined now outside of locales and gain
823 an additional parameter, like null_sets, almost_eventually or \<mu>'.
824 Measure space constructions for distributions and densities now got
825 their own constants distr and density. Instead of using locales to
826 describe measure spaces with a finite space, the measure count_space
827 and point_measure is introduced. INCOMPATIBILITY.
831 finite_measure.\<mu>' -> measure
832 product_algebra_generator -> prod_algebra
833 product_prob_space.emb -> prod_emb
834 product_prob_space.infprod_algebra -> PiM
837 completeable_measure_space
840 finite_product_finite_prob_space
841 finite_product_sigma_algebra
844 pair_finite_prob_space
845 pair_finite_sigma_algebra
848 product_sigma_algebra
852 distribution -> use distr measure, or distributed predicate
854 joint_distribution -> use distr measure, or distributed predicate
855 pair_measure_generator
856 product_prob_space.infprod_algebra -> use PiM
859 Replacement theorems:
860 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
861 finite_measure.empty_measure -> measure_empty
862 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
863 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
864 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
865 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
866 finite_measure.finite_measure -> finite_measure.emeasure_finite
867 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
868 finite_measure.positive_measure' -> measure_nonneg
869 finite_measure.real_measure -> finite_measure.emeasure_real
870 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
871 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
872 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
873 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
874 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
875 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
876 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
877 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
878 information_space.entropy_commute -> information_space.entropy_commute_simple
879 information_space.entropy_eq -> information_space.entropy_simple_distributed
880 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
881 information_space.entropy_positive -> information_space.entropy_nonneg_simple
882 information_space.entropy_uniform_max -> information_space.entropy_uniform
883 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
884 information_space.KL_eq_0 -> information_space.KL_same_eq_0
885 information_space.KL_ge_0 -> information_space.KL_nonneg
886 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
887 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
888 Int_stable_cuboids -> Int_stable_atLeastAtMost
889 Int_stable_product_algebra_generator -> positive_integral
890 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
891 measure_space.additive -> emeasure_additive
892 measure_space.AE_iff_null_set -> AE_iff_null
893 measure_space.almost_everywhere_def -> eventually_ae_filter
894 measure_space.almost_everywhere_vimage -> AE_distrD
895 measure_space.continuity_from_above -> INF_emeasure_decseq
896 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
897 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
898 measure_space.continuity_from_below -> SUP_emeasure_incseq
899 measure_space_density -> emeasure_density
900 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
901 measure_space.integrable_vimage -> integrable_distr
902 measure_space.integral_translated_density -> integral_density
903 measure_space.integral_vimage -> integral_distr
904 measure_space.measure_additive -> plus_emeasure
905 measure_space.measure_compl -> emeasure_compl
906 measure_space.measure_countable_increasing -> emeasure_countable_increasing
907 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
908 measure_space.measure_decseq -> decseq_emeasure
909 measure_space.measure_Diff -> emeasure_Diff
910 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
911 measure_space.measure_eq_0 -> emeasure_eq_0
912 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
913 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
914 measure_space.measure_incseq -> incseq_emeasure
915 measure_space.measure_insert -> emeasure_insert
916 measure_space.measure_mono -> emeasure_mono
917 measure_space.measure_not_negative -> emeasure_not_MInf
918 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
919 measure_space.measure_setsum -> setsum_emeasure
920 measure_space.measure_setsum_split -> setsum_emeasure_cover
921 measure_space.measure_space_vimage -> emeasure_distr
922 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
923 measure_space.measure_subadditive -> subadditive
924 measure_space.measure_top -> emeasure_space
925 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
926 measure_space.measure_Un_null_set -> emeasure_Un_null_set
927 measure_space.positive_integral_translated_density -> positive_integral_density
928 measure_space.positive_integral_vimage -> positive_integral_distr
929 measure_space.real_continuity_from_above -> Lim_measure_decseq
930 measure_space.real_continuity_from_below -> Lim_measure_incseq
931 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
932 measure_space.real_measure_Diff -> measure_Diff
933 measure_space.real_measure_finite_Union -> measure_finite_Union
934 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
935 measure_space.real_measure_subadditive -> measure_subadditive
936 measure_space.real_measure_Union -> measure_Union
937 measure_space.real_measure_UNION -> measure_UNION
938 measure_space.simple_function_vimage -> simple_function_comp
939 measure_space.simple_integral_vimage -> simple_integral_distr
940 measure_space.simple_integral_vimage -> simple_integral_distr
941 measure_unique_Int_stable -> measure_eqI_generator_eq
942 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
943 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
944 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
945 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
946 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
947 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
948 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
949 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
950 pair_sigma_algebra.sets_swap -> sets_pair_swap
951 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
952 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
953 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
954 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
955 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
956 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
957 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
958 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
959 prob_space.measure_space_1 -> prob_space.emeasure_space_1
960 prob_space.prob_space_vimage -> prob_space_distr
961 prob_space.random_variable_restrict -> measurable_restrict
962 prob_space_unique_Int_stable -> measure_eqI_prob_space
963 product_algebraE -> prod_algebraE_all
964 product_algebra_generator_der -> prod_algebra_eq_finite
965 product_algebra_generator_into_space -> prod_algebra_sets_into_space
966 product_algebraI -> sets_PiM_I_finite
967 product_measure_exists -> product_sigma_finite.sigma_finite
968 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
969 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
970 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
971 product_prob_space.measurable_component -> measurable_component_singleton
972 product_prob_space.measurable_emb -> measurable_prod_emb
973 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
974 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
975 product_prob_space.measure_emb -> emeasure_prod_emb
976 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
977 product_sigma_algebra.product_algebra_into_space -> space_closed
978 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
979 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
980 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
981 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
982 sets_product_algebra -> sets_PiM
983 sigma_algebra.measurable_sigma -> measurable_measure_of
984 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
985 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
986 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
987 space_product_algebra -> space_PiM
989 * HOL/TPTP: support to parse and import TPTP problems (all languages)
995 * New "case_product" attribute (see HOL).
1000 * Greater support for structured proofs involving induction or case
1003 * Much greater use of mathematical symbols.
1005 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1010 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1011 from a minor keyword introduced via theory header declaration.
1013 * Antiquotation @{command_spec "name"} produces the
1014 Outer_Syntax.command_spec from a major keyword introduced via theory
1015 header declaration; it can be passed to Outer_Syntax.command etc.
1017 * Local_Theory.define no longer hard-wires default theorem name
1018 "foo_def", but retains the binding as given. If that is Binding.empty
1019 / Attrib.empty_binding, the result is not registered as user-level
1020 fact. The Local_Theory.define_internal variant allows to specify a
1021 non-empty name (used for the foundation in the background theory),
1022 while omitting the fact binding in the user-context. Potential
1023 INCOMPATIBILITY for derived definitional packages: need to specify
1024 naming policy for primitive definitions more explicitly.
1026 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1027 conformance with similar operations in structure Term and Logic.
1029 * Antiquotation @{attributes [...]} embeds attribute source
1030 representation into the ML text, which is particularly useful with
1031 declarations like Local_Theory.note.
1033 * Structure Proof_Context follows standard naming scheme. Old
1034 ProofContext has been discontinued. INCOMPATIBILITY.
1036 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1037 change of semantics: update is applied to auxiliary local theory
1040 * Modernized some old-style infix operations:
1042 addeqcongs ~> Simplifier.add_eqcong
1043 deleqcongs ~> Simplifier.del_eqcong
1044 addcongs ~> Simplifier.add_cong
1045 delcongs ~> Simplifier.del_cong
1046 setmksimps ~> Simplifier.set_mksimps
1047 setmkcong ~> Simplifier.set_mkcong
1048 setmksym ~> Simplifier.set_mksym
1049 setmkeqTrue ~> Simplifier.set_mkeqTrue
1050 settermless ~> Simplifier.set_termless
1051 setsubgoaler ~> Simplifier.set_subgoaler
1052 addsplits ~> Splitter.add_split
1053 delsplits ~> Splitter.del_split
1058 * USER_HOME settings variable points to cross-platform user home
1059 directory, which coincides with HOME on POSIX systems only. Likewise,
1060 the Isabelle path specification "~" now expands to $USER_HOME, instead
1061 of former $HOME. A different default for USER_HOME may be set
1062 explicitly in shell environment, before Isabelle settings are
1063 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1064 the generic user home was intended.
1066 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1067 notation, which is useful for the jEdit file browser, for example.
1069 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1074 New in Isabelle2011-1 (October 2011)
1075 ------------------------------------
1079 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1080 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1082 - Management of multiple theory files directly from the editor
1083 buffer store -- bypassing the file-system (no requirement to save
1084 files for checking).
1086 - Markup of formal entities within the text buffer, with semantic
1087 highlighting, tooltips and hyperlinks to jump to defining source
1090 - Improved text rendering, with sub/superscripts in the source
1091 buffer (including support for copy/paste wrt. output panel, HTML
1092 theory output and other non-Isabelle text boxes).
1094 - Refined scheduling of proof checking and printing of results,
1095 based on interactive editor view. (Note: jEdit folding and
1096 narrowing allows to restrict buffer perspectives explicitly.)
1098 - Reduced CPU performance requirements, usable on machines with few
1101 - Reduced memory requirements due to pruning of unused document
1102 versions (garbage collection).
1104 See also ~~/src/Tools/jEdit/README.html for further information,
1105 including some remaining limitations.
1107 * Theory loader: source files are exclusively located via the master
1108 directory of each theory node (where the .thy file itself resides).
1109 The global load path (such as src/HOL/Library) has been discontinued.
1110 Note that the path element ~~ may be used to reference theories in the
1111 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1114 * Theory loader: source files are identified by content via SHA1
1115 digests. Discontinued former path/modtime identification and optional
1116 ISABELLE_FILE_IDENT plugin scripts.
1118 * Parallelization of nested Isar proofs is subject to
1119 Goal.parallel_proofs_threshold (default 100). See also isabelle
1122 * Name space: former unsynchronized references are now proper
1123 configuration options, with more conventional names:
1125 long_names ~> names_long
1126 short_names ~> names_short
1127 unique_names ~> names_unique
1129 Minor INCOMPATIBILITY, need to declare options in context like this:
1131 declare [[names_unique = false]]
1133 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1134 that the result needs to be unique, which means fact specifications
1135 may have to be refined after enriching a proof context.
1137 * Attribute "case_names" has been refined: the assumptions in each case
1138 can be named now by following the case name with [name1 name2 ...].
1140 * Isabelle/Isar reference manual has been updated and extended:
1141 - "Synopsis" provides a catalog of main Isar language concepts.
1142 - Formal references in syntax diagrams, via @{rail} antiquotation.
1143 - Updated material from classic "ref" manual, notably about
1144 "Classical Reasoner".
1149 * Class bot and top require underlying partial order rather than
1150 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1152 * Class complete_lattice: generalized a couple of lemmas from sets;
1153 generalized theorems INF_cong and SUP_cong. New type classes for
1154 complete boolean algebras and complete linear orders. Lemmas
1155 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1156 class complete_linorder.
1158 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1159 Sup_fun_def, Inf_apply, Sup_apply.
1161 Removed redundant lemmas (the right hand side gives hints how to
1162 replace them for (metis ...), or (simp only: ...) proofs):
1164 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1165 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1166 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1167 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1168 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1169 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1170 Inter_def ~> INF_def, image_def
1171 Union_def ~> SUP_def, image_def
1172 INT_eq ~> INF_def, and image_def
1173 UN_eq ~> SUP_def, and image_def
1174 INF_subset ~> INF_superset_mono [OF _ order_refl]
1176 More consistent and comprehensive names:
1178 INTER_eq_Inter_image ~> INF_def
1179 UNION_eq_Union_image ~> SUP_def
1182 INF_leI ~> INF_lower
1183 INF_leI2 ~> INF_lower2
1184 le_INFI ~> INF_greatest
1185 le_SUPI ~> SUP_upper
1186 le_SUPI2 ~> SUP_upper2
1187 SUP_leI ~> SUP_least
1188 INFI_bool_eq ~> INF_bool_eq
1189 SUPR_bool_eq ~> SUP_bool_eq
1190 INFI_apply ~> INF_apply
1191 SUPR_apply ~> SUP_apply
1192 INTER_def ~> INTER_eq
1193 UNION_def ~> UNION_eq
1197 * Renamed theory Complete_Lattice to Complete_Lattices.
1200 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1201 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1202 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1203 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1205 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1206 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1207 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1210 * Added syntactic classes "inf" and "sup" for the respective
1211 constants. INCOMPATIBILITY: Changes in the argument order of the
1212 (mostly internal) locale predicates for some derived classes.
1214 * Theorem collections ball_simps and bex_simps do not contain theorems
1215 referring to UNION any longer; these have been moved to collection
1216 UN_ball_bex_simps. INCOMPATIBILITY.
1218 * Theory Archimedean_Field: floor now is defined as parameter of a
1219 separate type class floor_ceiling.
1221 * Theory Finite_Set: more coherent development of fold_set locales:
1223 locale fun_left_comm ~> locale comp_fun_commute
1224 locale fun_left_comm_idem ~> locale comp_fun_idem
1226 Both use point-free characterization; interpretation proofs may need
1227 adjustment. INCOMPATIBILITY.
1229 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1230 accordance with standard mathematical terminology. INCOMPATIBILITY.
1232 * Theory Complex_Main: The locale interpretations for the
1233 bounded_linear and bounded_bilinear locales have been removed, in
1234 order to reduce the number of duplicate lemmas. Users must use the
1235 original names for distributivity theorems, potential INCOMPATIBILITY.
1237 divide.add ~> add_divide_distrib
1238 divide.diff ~> diff_divide_distrib
1239 divide.setsum ~> setsum_divide_distrib
1240 mult.add_right ~> right_distrib
1241 mult.diff_right ~> right_diff_distrib
1242 mult_right.setsum ~> setsum_right_distrib
1243 mult_left.diff ~> left_diff_distrib
1245 * Theory Complex_Main: Several redundant theorems have been removed or
1246 replaced by more general versions. INCOMPATIBILITY.
1248 real_diff_def ~> minus_real_def
1249 real_divide_def ~> divide_real_def
1250 real_less_def ~> less_le
1251 real_abs_def ~> abs_real_def
1252 real_sgn_def ~> sgn_real_def
1253 real_mult_commute ~> mult_commute
1254 real_mult_assoc ~> mult_assoc
1255 real_mult_1 ~> mult_1_left
1256 real_add_mult_distrib ~> left_distrib
1257 real_zero_not_eq_one ~> zero_neq_one
1258 real_mult_inverse_left ~> left_inverse
1259 INVERSE_ZERO ~> inverse_zero
1260 real_le_refl ~> order_refl
1261 real_le_antisym ~> order_antisym
1262 real_le_trans ~> order_trans
1263 real_le_linear ~> linear
1264 real_le_eq_diff ~> le_iff_diff_le_0
1265 real_add_left_mono ~> add_left_mono
1266 real_mult_order ~> mult_pos_pos
1267 real_mult_less_mono2 ~> mult_strict_left_mono
1268 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1269 real_0_le_divide_iff ~> zero_le_divide_iff
1270 realpow_two_disj ~> power2_eq_iff
1271 real_squared_diff_one_factored ~> square_diff_one_factored
1272 realpow_two_diff ~> square_diff_square_factored
1273 reals_complete2 ~> complete_real
1274 real_sum_squared_expand ~> power2_sum
1275 exp_ln_eq ~> ln_unique
1277 expi_zero ~> exp_zero
1278 lemma_DERIV_subst ~> DERIV_cong
1279 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1280 LIMSEQ_const ~> tendsto_const
1281 LIMSEQ_norm ~> tendsto_norm
1282 LIMSEQ_add ~> tendsto_add
1283 LIMSEQ_minus ~> tendsto_minus
1284 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1285 LIMSEQ_diff ~> tendsto_diff
1286 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1287 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1288 LIMSEQ_mult ~> tendsto_mult
1289 LIMSEQ_inverse ~> tendsto_inverse
1290 LIMSEQ_divide ~> tendsto_divide
1291 LIMSEQ_pow ~> tendsto_power
1292 LIMSEQ_setsum ~> tendsto_setsum
1293 LIMSEQ_setprod ~> tendsto_setprod
1294 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1295 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1296 LIMSEQ_imp_rabs ~> tendsto_rabs
1297 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1298 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1299 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1300 LIMSEQ_Complex ~> tendsto_Complex
1301 LIM_ident ~> tendsto_ident_at
1302 LIM_const ~> tendsto_const
1303 LIM_add ~> tendsto_add
1304 LIM_add_zero ~> tendsto_add_zero
1305 LIM_minus ~> tendsto_minus
1306 LIM_diff ~> tendsto_diff
1307 LIM_norm ~> tendsto_norm
1308 LIM_norm_zero ~> tendsto_norm_zero
1309 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1310 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1311 LIM_rabs ~> tendsto_rabs
1312 LIM_rabs_zero ~> tendsto_rabs_zero
1313 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1314 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1315 LIM_compose ~> tendsto_compose
1316 LIM_mult ~> tendsto_mult
1317 LIM_scaleR ~> tendsto_scaleR
1318 LIM_of_real ~> tendsto_of_real
1319 LIM_power ~> tendsto_power
1320 LIM_inverse ~> tendsto_inverse
1321 LIM_sgn ~> tendsto_sgn
1322 isCont_LIM_compose ~> isCont_tendsto_compose
1323 bounded_linear.LIM ~> bounded_linear.tendsto
1324 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1325 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1326 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1327 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1328 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1329 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1331 * Theory Complex_Main: The definition of infinite series was
1332 generalized. Now it is defined on the type class {topological_space,
1333 comm_monoid_add}. Hence it is useable also for extended real numbers.
1335 * Theory Complex_Main: The complex exponential function "expi" is now
1336 a type-constrained abbreviation for "exp :: complex => complex"; thus
1337 several polymorphic lemmas about "exp" are now applicable to "expi".
1341 - Theory Library/Code_Char_ord provides native ordering of
1342 characters in the target language.
1344 - Commands code_module and code_library are legacy, use export_code
1347 - Method "evaluation" is legacy, use method "eval" instead.
1349 - Legacy evaluator "SML" is deactivated by default. May be
1350 reactivated by the following theory command:
1352 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1354 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1356 * New proof method "induction" that gives induction hypotheses the
1357 name "IH", thus distinguishing them from further hypotheses that come
1358 from rule induction. The latter are still called "hyps". Method
1359 "induction" is a thin wrapper around "induct" and follows the same
1362 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1363 still available as a legacy feature for some time.
1366 - Added "need" and "total_consts" options.
1367 - Reintroduced "show_skolems" option by popular demand.
1368 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1372 - Use quasi-sound (and efficient) translations by default.
1373 - Added support for the following provers: E-ToFoF, LEO-II,
1374 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1375 - Automatically preplay and minimize proofs before showing them if
1376 this can be done within reasonable time.
1377 - sledgehammer available_provers ~> sledgehammer supported_provers.
1379 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1380 "max_mono_iters", and "max_new_mono_instances" options.
1381 - Removed "explicit_apply" and "full_types" options as well as "Full
1382 Types" Proof General menu item. INCOMPATIBILITY.
1385 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1386 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1390 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1391 "elim:" options. INCOMPATIBILITY.
1392 - Introduced 'try' that not only runs 'try_methods' but also
1393 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1396 - Added "eval" option to evaluate terms for the found counterexample
1397 (currently only supported by the default (exhaustive) tester).
1398 - Added post-processing of terms to obtain readable counterexamples
1399 (currently only supported by the default (exhaustive) tester).
1400 - New counterexample generator quickcheck[narrowing] enables
1401 narrowing-based testing. Requires the Glasgow Haskell compiler
1402 with its installation location defined in the Isabelle settings
1403 environment as ISABELLE_GHC.
1404 - Removed quickcheck tester "SML" based on the SML code generator
1405 (formly in HOL/Library).
1407 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1408 use 'partial_function' instead.
1410 * Theory Library/Extended_Reals replaces now the positive extended
1411 reals found in probability theory. This file is extended by
1412 Multivariate_Analysis/Extended_Real_Limits.
1414 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1415 from where it must be imported explicitly if it is really required.
1418 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1419 been moved here. INCOMPATIBILITY.
1421 * Theory Library/Saturated provides type of numbers with saturated
1424 * Theory Library/Product_Lattice defines a pointwise ordering for the
1425 product type 'a * 'b, and provides instance proofs for various order
1426 and lattice type classes.
1428 * Theory Library/Countable now provides the "countable_datatype" proof
1429 method for proving "countable" class instances for datatypes.
1431 * Theory Library/Cset_Monad allows do notation for computable sets
1432 (cset) via the generic monad ad-hoc overloading facility.
1434 * Library: Theories of common data structures are split into theories
1435 for implementation, an invariant-ensuring type, and connection to an
1436 abstract type. INCOMPATIBILITY.
1438 - RBT is split into RBT and RBT_Mapping.
1439 - AssocList is split and renamed into AList and AList_Mapping.
1440 - DList is split into DList_Impl, DList, and DList_Cset.
1441 - Cset is split into Cset and List_Cset.
1443 * Theory Library/Nat_Infinity has been renamed to
1444 Library/Extended_Nat, with name changes of the following types and
1447 type inat ~> type enat
1449 Infty ~> infinity (overloaded)
1453 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1454 been renamed accordingly. INCOMPATIBILITY.
1456 * Session Multivariate_Analysis: The euclidean_space type class now
1457 fixes a constant "Basis :: 'a set" consisting of the standard
1458 orthonormal basis for the type. Users now have the option of
1459 quantifying over this set instead of using the "basis" function, e.g.
1460 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1462 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1463 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1464 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1465 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1466 changed to match. Definition theorems for overloaded constants now use
1467 the standard "foo_vec_def" naming scheme. A few other theorems have
1468 been renamed as follows (INCOMPATIBILITY):
1470 Cart_eq ~> vec_eq_iff
1471 dist_nth_le_cart ~> dist_vec_nth_le
1472 tendsto_vector ~> vec_tendstoI
1473 Cauchy_vector ~> vec_CauchyI
1475 * Session Multivariate_Analysis: Several duplicate theorems have been
1476 removed, and other theorems have been renamed or replaced with more
1477 general versions. INCOMPATIBILITY.
1479 finite_choice ~> finite_set_choice
1480 eventually_conjI ~> eventually_conj
1481 eventually_and ~> eventually_conj_iff
1482 eventually_false ~> eventually_False
1483 setsum_norm ~> norm_setsum
1484 Lim_sequentially ~> LIMSEQ_def
1485 Lim_ident_at ~> LIM_ident
1486 Lim_const ~> tendsto_const
1487 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1488 Lim_neg ~> tendsto_minus
1489 Lim_add ~> tendsto_add
1490 Lim_sub ~> tendsto_diff
1491 Lim_mul ~> tendsto_scaleR
1492 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1493 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1494 Lim_linear ~> bounded_linear.tendsto
1495 Lim_component ~> tendsto_euclidean_component
1496 Lim_component_cart ~> tendsto_vec_nth
1497 Lim_inner ~> tendsto_inner [OF tendsto_const]
1498 dot_lsum ~> inner_setsum_left
1499 dot_rsum ~> inner_setsum_right
1500 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1501 continuous_neg ~> continuous_minus
1502 continuous_sub ~> continuous_diff
1503 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1504 continuous_mul ~> continuous_scaleR
1505 continuous_inv ~> continuous_inverse
1506 continuous_at_within_inv ~> continuous_at_within_inverse
1507 continuous_at_inv ~> continuous_at_inverse
1508 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1509 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1510 continuous_at_component ~> continuous_component [OF continuous_at_id]
1511 continuous_on_neg ~> continuous_on_minus
1512 continuous_on_sub ~> continuous_on_diff
1513 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1514 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1515 continuous_on_mul ~> continuous_on_scaleR
1516 continuous_on_mul_real ~> continuous_on_mult
1517 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1518 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1519 continuous_on_inverse ~> continuous_on_inv
1520 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1521 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1522 subset_interior ~> interior_mono
1523 subset_closure ~> closure_mono
1524 closure_univ ~> closure_UNIV
1525 real_arch_lt ~> reals_Archimedean2
1526 real_arch ~> reals_Archimedean3
1527 real_abs_norm ~> abs_norm_cancel
1528 real_abs_sub_norm ~> norm_triangle_ineq3
1529 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1531 * Session HOL-Probability:
1532 - Caratheodory's extension lemma is now proved for ring_of_sets.
1533 - Infinite products of probability measures are now available.
1534 - Sigma closure is independent, if the generator is independent
1535 - Use extended reals instead of positive extended
1536 reals. INCOMPATIBILITY.
1538 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1540 expand_fun_below ~> fun_below_iff
1541 below_fun_ext ~> fun_belowI
1542 expand_cfun_eq ~> cfun_eq_iff
1543 ext_cfun ~> cfun_eqI
1544 expand_cfun_below ~> cfun_below_iff
1545 below_cfun_ext ~> cfun_belowI
1546 monofun_fun_fun ~> fun_belowD
1547 monofun_fun_arg ~> monofunE
1548 monofun_lub_fun ~> adm_monofun [THEN admD]
1549 cont_lub_fun ~> adm_cont [THEN admD]
1550 cont2cont_Rep_CFun ~> cont2cont_APP
1551 cont_Rep_CFun_app ~> cont_APP_app
1552 cont_Rep_CFun_app_app ~> cont_APP_app_app
1553 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1554 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1555 contlub_cfun ~> lub_APP [symmetric]
1556 contlub_LAM ~> lub_LAM [symmetric]
1559 lift_distinct1 ~> lift.distinct(1)
1560 lift_distinct2 ~> lift.distinct(2)
1561 Def_not_UU ~> lift.distinct(2)
1562 Def_inject ~> lift.inject
1563 below_UU_iff ~> below_bottom_iff
1564 eq_UU_iff ~> eq_bottom_iff
1567 *** Document preparation ***
1569 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1570 isar-ref manual, both for description and actual application of the
1573 * Antiquotation @{value} evaluates the given term and presents its
1576 * Antiquotations: term style "isub" provides ad-hoc conversion of
1577 variables x1, y23 into subscripted form x\<^isub>1,
1578 y\<^isub>2\<^isub>3.
1580 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1581 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1583 * Localized \isabellestyle switch can be used within blocks or groups
1586 \isabellestyle{it} %preferred default
1587 {\isabellestylett @{text "typewriter stuff"}}
1589 * Discontinued special treatment of hard tabulators. Implicit
1590 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1596 * The inner syntax of sort/type/term/prop supports inlined YXML
1597 representations within quoted string tokens. By encoding logical
1598 entities via Term_XML (in ML or Scala) concrete syntax can be
1599 bypassed, which is particularly useful for producing bits of text
1600 under external program control.
1602 * Antiquotations for ML and document preparation are managed as theory
1603 data, which requires explicit setup.
1605 * Isabelle_Process.is_active allows tools to check if the official
1606 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1607 (better known as Proof General).
1609 * Structure Proof_Context follows standard naming scheme. Old
1610 ProofContext is still available for some time as legacy alias.
1612 * Structure Timing provides various operations for timing; supersedes
1613 former start_timing/end_timing etc.
1615 * Path.print is the official way to show file-system paths to users
1616 (including quotes etc.).
1618 * Inner syntax: identifiers in parse trees of generic categories
1619 "logic", "aprop", "idt" etc. carry position information (disguised as
1620 type constraints). Occasional INCOMPATIBILITY with non-compliant
1621 translations that choke on unexpected type constraints. Positions can
1622 be stripped in ML translations via Syntax.strip_positions /
1623 Syntax.strip_positions_ast, or via the syntax constant
1624 "_strip_positions" within parse trees. As last resort, positions can
1625 be disabled via the configuration option Syntax.positions, which is
1626 called "syntax_positions" in Isar attribute syntax.
1628 * Discontinued special status of various ML structures that contribute
1629 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1630 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1631 refer directly to Ast.Constant, Lexicon.is_identifier,
1632 Syntax_Trans.mk_binder_tr etc.
1634 * Typed print translation: discontinued show_sorts argument, which is
1635 already available via context of "advanced" translation.
1637 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1638 goal states; body tactic needs to address all subgoals uniformly.
1640 * Slightly more special eq_list/eq_set, with shortcut involving
1641 pointer equality (assumes that eq relation is reflexive).
1643 * Classical tactics use proper Proof.context instead of historic types
1644 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1645 operate directly on Proof.context. Raw type claset retains its use as
1646 snapshot of the classical context, which can be recovered via
1647 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1648 INCOMPATIBILITY, classical tactics and derived proof methods require
1649 proper Proof.context.
1654 * Discontinued support for Poly/ML 5.2, which was the last version
1655 without proper multithreading and TimeLimit implementation.
1657 * Discontinued old lib/scripts/polyml-platform, which has been
1658 obsolete since Isabelle2009-2.
1660 * Various optional external tools are referenced more robustly and
1661 uniformly by explicit Isabelle settings as follows:
1663 ISABELLE_CSDP (formerly CSDP_EXE)
1664 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1665 ISABELLE_OCAML (formerly EXEC_OCAML)
1666 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1667 ISABELLE_YAP (formerly EXEC_YAP)
1669 Note that automated detection from the file-system or search path has
1670 been discontinued. INCOMPATIBILITY.
1672 * Scala layer provides JVM method invocation service for static
1673 methods of type (String)String, see Invoke_Scala.method in ML. For
1676 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1678 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1679 this allows to pass structured values between ML and Scala.
1681 * The IsabelleText fonts includes some further glyphs to support the
1682 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1683 installed a local copy (which is normally *not* required) need to
1684 delete or update it from ~~/lib/fonts/.
1688 New in Isabelle2011 (January 2011)
1689 ----------------------------------
1693 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1694 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1695 useful tooltips and hyperlinks produced from its static analysis. The
1696 bundled component provides an executable Isabelle tool that can be run
1699 Isabelle2011/bin/isabelle jedit
1701 * Significantly improved Isabelle/Isar implementation manual.
1703 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1704 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1705 while the default heap location within that directory lacks that extra
1706 suffix. This isolates multiple Isabelle installations from each
1707 other, avoiding problems with old settings in new versions.
1708 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1710 * Source files are always encoded as UTF-8, instead of old-fashioned
1711 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1712 the following package declarations:
1714 \usepackage[utf8]{inputenc}
1715 \usepackage{textcomp}
1717 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1718 a Unicode character is treated as a single symbol, not a sequence of
1719 non-ASCII bytes as before. Since Isabelle/ML string literals may
1720 contain symbols without further backslash escapes, Unicode can now be
1721 used here as well. Recall that Symbol.explode in ML provides a
1722 consistent view on symbols, while raw explode (or String.explode)
1723 merely give a byte-oriented representation.
1725 * Theory loader: source files are primarily located via the master
1726 directory of each theory node (where the .thy file itself resides).
1727 The global load path is still partially available as legacy feature.
1728 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1729 explicit paths, relatively to the theory.
1731 * Special treatment of ML file names has been discontinued.
1732 Historically, optional extensions .ML or .sml were added on demand --
1733 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1734 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1736 * Various options that affect pretty printing etc. are now properly
1737 handled within the context via configuration options, instead of
1738 unsynchronized references or print modes. There are both ML Config.T
1739 entities and Isar declaration attributes to access these.
1741 ML (Config.T) Isar (attribute)
1743 eta_contract eta_contract
1744 show_brackets show_brackets
1745 show_sorts show_sorts
1746 show_types show_types
1747 show_question_marks show_question_marks
1748 show_consts show_consts
1749 show_abbrevs show_abbrevs
1751 Syntax.ast_trace syntax_ast_trace
1752 Syntax.ast_stat syntax_ast_stat
1753 Syntax.ambiguity_level syntax_ambiguity_level
1755 Goal_Display.goals_limit goals_limit
1756 Goal_Display.show_main_goal show_main_goal
1758 Method.rule_trace rule_trace
1760 Thy_Output.display thy_output_display
1761 Thy_Output.quotes thy_output_quotes
1762 Thy_Output.indent thy_output_indent
1763 Thy_Output.source thy_output_source
1764 Thy_Output.break thy_output_break
1766 Note that corresponding "..._default" references in ML may only be
1767 changed globally at the ROOT session setup, but *not* within a theory.
1768 The option "show_abbrevs" supersedes the former print mode
1769 "no_abbrevs" with inverted meaning.
1771 * More systematic naming of some configuration options.
1774 trace_simp ~> simp_trace
1775 debug_simp ~> simp_debug
1777 * Support for real valued configuration options, using simplistic
1778 floating-point notation that coincides with the inner syntax for
1781 * Support for real valued preferences (with approximative PGIP type):
1782 front-ends need to accept "pgint" values in float notation.
1785 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1788 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1793 * Command 'type_synonym' (with single argument) replaces somewhat
1794 outdated 'types', which is still available as legacy feature for some
1797 * Command 'nonterminal' (with 'and' separated list of arguments)
1798 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1800 * Command 'notepad' replaces former 'example_proof' for
1801 experimentation in Isar without any result. INCOMPATIBILITY.
1803 * Locale interpretation commands 'interpret' and 'sublocale' accept
1804 lists of equations to map definitions in a locale to appropriate
1805 entities in the context of the interpretation. The 'interpretation'
1806 command already provided this functionality.
1808 * Diagnostic command 'print_dependencies' prints the locale instances
1809 that would be activated if the specified expression was interpreted in
1810 the current context. Variant "print_dependencies!" assumes a context
1811 without interpretations.
1813 * Diagnostic command 'print_interps' prints interpretations in proofs
1814 in addition to interpretations in theories.
1816 * Discontinued obsolete 'global' and 'local' commands to manipulate
1817 the theory name space. Rare INCOMPATIBILITY. The ML functions
1818 Sign.root_path and Sign.local_path may be applied directly where this
1819 feature is still required for historical reasons.
1821 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1822 'definition' instead.
1824 * The "prems" fact, which refers to the accidental collection of
1825 foundational premises in the context, is now explicitly marked as
1826 legacy feature and will be discontinued soon. Consider using "assms"
1827 of the head statement or reference facts by explicit names.
1829 * Document antiquotations @{class} and @{type} print classes and type
1832 * Document antiquotation @{file} checks file/directory entries within
1833 the local file system.
1838 * Coercive subtyping: functions can be declared as coercions and type
1839 inference will add them as necessary upon input of a term. Theory
1840 Complex_Main declares real :: nat => real and real :: int => real as
1841 coercions. A coercion function f is declared like this:
1843 declare [[coercion f]]
1845 To lift coercions through type constructors (e.g. from nat => real to
1846 nat list => real list), map functions can be declared, e.g.
1848 declare [[coercion_map map]]
1850 Currently coercion inference is activated only in theories including
1851 real numbers, i.e. descendants of Complex_Main. This is controlled by
1852 the configuration option "coercion_enabled", e.g. it can be enabled in
1853 other theories like this:
1855 declare [[coercion_enabled]]
1857 * Command 'partial_function' provides basic support for recursive
1858 function definitions over complete partial orders. Concrete instances
1859 are provided for i) the option type, ii) tail recursion on arbitrary
1860 types, and iii) the heap monad of Imperative_HOL. See
1861 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
1864 * Function package: f.psimps rules are no longer implicitly declared
1865 as [simp]. INCOMPATIBILITY.
1867 * Datatype package: theorems generated for executable equality (class
1868 "eq") carry proper names and are treated as default code equations.
1870 * Inductive package: now offers command 'inductive_simps' to
1871 automatically derive instantiated and simplified equations for
1872 inductive predicates, similar to 'inductive_cases'.
1874 * Command 'enriched_type' allows to register properties of the
1875 functorial structure of types.
1877 * Improved infrastructure for term evaluation using code generator
1878 techniques, in particular static evaluation conversions.
1880 * Code generator: Scala (2.8 or higher) has been added to the target
1883 * Code generator: globbing constant expressions "*" and "Theory.*"
1884 have been replaced by the more idiomatic "_" and "Theory._".
1887 * Code generator: export_code without explicit file declaration prints
1888 to standard output. INCOMPATIBILITY.
1890 * Code generator: do not print function definitions for case
1891 combinators any longer.
1893 * Code generator: simplification with rules determined with
1894 src/Tools/Code/code_simp.ML and method "code_simp".
1896 * Code generator for records: more idiomatic representation of record
1897 types. Warning: records are not covered by ancient SML code
1898 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
1899 rep_datatype declaration helps to succeed then:
1903 rep_datatype foo_ext ...
1905 * Records: logical foundation type for records does not carry a
1906 '_type' suffix any longer (obsolete due to authentic syntax).
1909 * Quickcheck now by default uses exhaustive testing instead of random
1910 testing. Random testing can be invoked by "quickcheck [random]",
1911 exhaustive testing by "quickcheck [exhaustive]".
1913 * Quickcheck instantiates polymorphic types with small finite
1914 datatypes by default. This enables a simple execution mechanism to
1915 handle quantifiers and function equality over the finite datatypes.
1917 * Quickcheck random generator has been renamed from "code" to
1918 "random". INCOMPATIBILITY.
1920 * Quickcheck now has a configurable time limit which is set to 30
1921 seconds by default. This can be changed by adding [timeout = n] to the
1922 quickcheck command. The time limit for Auto Quickcheck is still set
1925 * Quickcheck in locales considers interpretations of that locale for
1926 counter example search.
1929 - Added "smt" and "remote_smt" provers based on the "smt" proof
1930 method. See the Sledgehammer manual for details ("isabelle doc
1933 sledgehammer atp_info ~> sledgehammer running_provers
1934 sledgehammer atp_kill ~> sledgehammer kill_provers
1935 sledgehammer available_atps ~> sledgehammer available_provers
1938 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
1939 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
1940 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
1941 (and "ms" and "min" are no longer supported)
1946 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
1947 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
1949 - Added support for partial quotient types.
1950 - Added local versions of the "Nitpick.register_xxx" functions.
1951 - Added "whack" option.
1952 - Allow registration of quotient types as codatatypes.
1953 - Improved "merge_type_vars" option to merge more types.
1954 - Removed unsound "fast_descrs" option.
1955 - Added custom symmetry breaking for datatypes, making it possible to reach
1956 higher cardinalities.
1957 - Prevent the expansion of too large definitions.
1959 * Proof methods "metis" and "meson" now have configuration options
1960 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
1961 to diagnose these tools. E.g.
1963 using [[metis_trace = true]]
1965 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
1966 manually as command 'solve_direct'.
1968 * The default SMT solver Z3 must be enabled explicitly (due to
1969 licensing issues) by setting the environment variable
1970 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
1971 commercial applications, the SMT solver CVC3 is provided as fall-back;
1972 changing the SMT solver is done via the configuration option
1975 * Remote SMT solvers need to be referred to by the "remote_" prefix,
1976 i.e. "remote_cvc3" and "remote_z3".
1978 * Added basic SMT support for datatypes, records, and typedefs using
1979 the oracle mode (no proofs). Direct support of pairs has been dropped
1980 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
1981 support for a similar behavior). Minor INCOMPATIBILITY.
1983 * Changed SMT configuration options:
1985 z3_proofs ~> smt_oracle (with inverted meaning)
1986 z3_trace_assms ~> smt_trace_used_facts
1999 * Boogie output files (.b2i files) need to be declared in the theory
2002 * Simplification procedure "list_to_set_comprehension" rewrites list
2003 comprehensions applied to List.set to set comprehensions. Occasional
2004 INCOMPATIBILITY, may be deactivated like this:
2006 declare [[simproc del: list_to_set_comprehension]]
2008 * Removed old version of primrec package. INCOMPATIBILITY.
2010 * Removed simplifier congruence rule of "prod_case", as has for long
2011 been the case with "split". INCOMPATIBILITY.
2013 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2015 * Removed [split_format ... and ... and ...] version of
2016 [split_format]. Potential INCOMPATIBILITY.
2018 * Predicate "sorted" now defined inductively, with nice induction
2019 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2021 * Constant "contents" renamed to "the_elem", to free the generic name
2022 contents for other uses. INCOMPATIBILITY.
2024 * Renamed class eq and constant eq (for code generation) to class
2025 equal and constant equal, plus renaming of related facts and various
2026 tuning. INCOMPATIBILITY.
2028 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2030 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2033 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2034 avoid confusion with finite sets. INCOMPATIBILITY.
2036 * Abandoned locales equiv, congruent and congruent2 for equivalence
2037 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2040 * Some previously unqualified names have been qualified:
2047 Trueprop ~> HOL.Trueprop
2052 op --> ~> HOL.implies
2064 Pair ~> Product_Type.Pair
2065 fst ~> Product_Type.fst
2066 snd ~> Product_Type.snd
2067 curry ~> Product_Type.curry
2069 Collect ~> Set.Collect
2073 * More canonical naming convention for some fundamental definitions:
2075 bot_bool_eq ~> bot_bool_def
2076 top_bool_eq ~> top_bool_def
2077 inf_bool_eq ~> inf_bool_def
2078 sup_bool_eq ~> sup_bool_def
2079 bot_fun_eq ~> bot_fun_def
2080 top_fun_eq ~> top_fun_def
2081 inf_fun_eq ~> inf_fun_def
2082 sup_fun_eq ~> sup_fun_def
2086 * More stylized fact names:
2088 expand_fun_eq ~> fun_eq_iff
2089 expand_set_eq ~> set_eq_iff
2091 nat_number ~> eval_nat_numeral
2095 * Refactoring of code-generation specific operations in theory List:
2101 mem_iff ~> member_def
2102 null_empty ~> null_def
2104 INCOMPATIBILITY. Note that these were not supposed to be used
2105 regularly unless for striking reasons; their main purpose was code
2108 Various operations from the Haskell prelude are used for generating
2111 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2112 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2113 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2115 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2116 "*" and "+" respectively. INCOMPATIBILITY.
2118 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2119 "Sum_Type.Plus" instead.
2121 * Constant "split" has been merged with constant "prod_case"; names of
2122 ML functions, facts etc. involving split have been retained so far,
2123 though. INCOMPATIBILITY.
2125 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2126 instead. INCOMPATIBILITY.
2128 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2131 * Former theory Library/Enum is now part of the HOL-Main image.
2132 INCOMPATIBILITY: all constants of the Enum theory now have to be
2133 referred to by its qualified name.
2136 nlists ~> Enum.nlists
2137 product ~> Enum.product
2139 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2140 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2143 * Theory Library/SetsAndFunctions has been split into
2144 Library/Function_Algebras and Library/Set_Algebras; canonical names
2145 for instance definitions for functions; various improvements.
2148 * Theory Library/Multiset provides stable quicksort implementation of
2151 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2154 * Session Multivariate_Analysis: introduced a type class for euclidean
2155 space. Most theorems are now stated in terms of euclidean spaces
2156 instead of finite cartesian products.
2159 real ^ 'n ~> 'a::real_vector
2160 ~> 'a::euclidean_space
2161 ~> 'a::ordered_euclidean_space
2162 (depends on your needs)
2166 \<chi> x. _ ~> \<chi>\<chi> x. _
2169 Also note that the indices are now natural numbers and not from some
2170 finite type. Finite cartesian products of euclidean spaces, products
2171 of euclidean spaces the real and complex numbers are instantiated to
2172 be euclidean_spaces. INCOMPATIBILITY.
2174 * Session Probability: introduced pextreal as positive extended real
2175 numbers. Use pextreal as value for measures. Introduce the
2176 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2177 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2178 the integral in Multivariate Analysis. INCOMPATIBILITY.
2180 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2183 * Session SPARK (with image HOL-SPARK) provides commands to load and
2184 prove verification conditions generated by the SPARK Ada program
2185 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2190 * Theorems for additive ring operations (locale abelian_monoid and
2191 descendants) are generated by interpretation from their multiplicative
2192 counterparts. Names (in particular theorem names) have the mandatory
2193 qualifier 'add'. Previous theorem names are redeclared for
2196 * Structure "int_ring" is now an abbreviation (previously a
2197 definition). This fits more natural with advanced interpretations.
2202 * The domain package now runs in definitional mode by default: The
2203 former command 'new_domain' is now called 'domain'. To use the domain
2204 package in its original axiomatic mode, use 'domain (unsafe)'.
2207 * The new class "domain" is now the default sort. Class "predomain"
2208 is an unpointed version of "domain". Theories can be updated by
2209 replacing sort annotations as shown below. INCOMPATIBILITY.
2211 'a::type ~> 'a::countable
2212 'a::cpo ~> 'a::predomain
2213 'a::pcpo ~> 'a::domain
2215 * The old type class "rep" has been superseded by class "domain".
2216 Accordingly, users of the definitional package must remove any
2217 "default_sort rep" declarations. INCOMPATIBILITY.
2219 * The domain package (definitional mode) now supports unpointed
2220 predomain argument types, as long as they are marked 'lazy'. (Strict
2221 arguments must be in class "domain".) For example, the following
2222 domain definition now works:
2224 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2226 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2227 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2228 'a option, and 'a list. Additionally, it configures fixrec and the
2229 domain package to work with these types. For example:
2231 fixrec isInl :: "('a + 'b) u -> tr"
2232 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2234 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2236 * The "(permissive)" option of fixrec has been replaced with a
2237 per-equation "(unchecked)" option. See
2238 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2240 * The "bifinite" class no longer fixes a constant "approx"; the class
2241 now just asserts that such a function exists. INCOMPATIBILITY.
2243 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2244 defines an embedding of type 'a defl into udom by default; instances
2245 of "bifinite" and "domain" classes are available in
2246 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2248 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2250 * The predicate "directed" has been removed. INCOMPATIBILITY.
2252 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2254 * The function "cprod_map" has been renamed to "prod_map".
2257 * The monadic bind operator on each powerdomain has new binder syntax
2258 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2259 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2261 * The infix syntax for binary union on each powerdomain has changed
2262 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2263 syntax. INCOMPATIBILITY.
2265 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2266 still supported as an input translation.
2268 * Renamed some theorems (the original names are also still available).
2270 expand_fun_below ~> fun_below_iff
2271 below_fun_ext ~> fun_belowI
2272 expand_cfun_eq ~> cfun_eq_iff
2273 ext_cfun ~> cfun_eqI
2274 expand_cfun_below ~> cfun_below_iff
2275 below_cfun_ext ~> cfun_belowI
2276 cont2cont_Rep_CFun ~> cont2cont_APP
2278 * The Abs and Rep functions for various types have changed names.
2279 Related theorem names have also changed to match. INCOMPATIBILITY.
2281 Rep_CFun ~> Rep_cfun
2282 Abs_CFun ~> Abs_cfun
2283 Rep_Sprod ~> Rep_sprod
2284 Abs_Sprod ~> Abs_sprod
2285 Rep_Ssum ~> Rep_ssum
2286 Abs_Ssum ~> Abs_ssum
2288 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2289 been renamed to *_bottom_iff. INCOMPATIBILITY.
2291 * Various changes to bisimulation/coinduction with domain package:
2293 - Definitions of "bisim" constants no longer mention definedness.
2294 - With mutual recursion, "bisim" predicate is now curried.
2295 - With mutual recursion, each type gets a separate coind theorem.
2296 - Variable names in bisim_def and coinduct rules have changed.
2300 * Case combinators generated by the domain package for type "foo" are
2301 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2303 * Several theorems have been renamed to more accurately reflect the
2304 names of constants and types involved. INCOMPATIBILITY.
2306 thelub_const ~> lub_const
2307 lub_const ~> is_lub_const
2309 is_lub_lub ~> is_lubD2
2311 unique_lub ~> is_lub_unique
2312 is_ub_lub ~> is_lub_rangeD1
2313 lub_bin_chain ~> is_lub_bin_chain
2314 lub_fun ~> is_lub_fun
2315 thelub_fun ~> lub_fun
2316 thelub_cfun ~> lub_cfun
2317 thelub_Pair ~> lub_Pair
2318 lub_cprod ~> is_lub_prod
2319 thelub_cprod ~> lub_prod
2320 minimal_cprod ~> minimal_prod
2321 inst_cprod_pcpo ~> inst_prod_pcpo
2323 compact_UU ~> compact_bottom
2324 deflation_UU ~> deflation_bottom
2325 finite_deflation_UU ~> finite_deflation_bottom
2327 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2329 sq_ord_less_eq_trans ~> below_eq_trans
2330 sq_ord_eq_less_trans ~> eq_below_trans
2331 refl_less ~> below_refl
2332 trans_less ~> below_trans
2333 antisym_less ~> below_antisym
2334 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2335 box_less ~> box_below
2336 rev_trans_less ~> rev_below_trans
2337 not_less2not_eq ~> not_below2not_eq
2338 less_UU_iff ~> below_UU_iff
2339 flat_less_iff ~> flat_below_iff
2340 adm_less ~> adm_below
2341 adm_not_less ~> adm_not_below
2342 adm_compact_not_less ~> adm_compact_not_below
2343 less_fun_def ~> below_fun_def
2344 expand_fun_less ~> fun_below_iff
2345 less_fun_ext ~> fun_belowI
2346 less_discr_def ~> below_discr_def
2347 discr_less_eq ~> discr_below_eq
2348 less_unit_def ~> below_unit_def
2349 less_cprod_def ~> below_prod_def
2350 prod_lessI ~> prod_belowI
2351 Pair_less_iff ~> Pair_below_iff
2352 fst_less_iff ~> fst_below_iff
2353 snd_less_iff ~> snd_below_iff
2354 expand_cfun_less ~> cfun_below_iff
2355 less_cfun_ext ~> cfun_belowI
2356 injection_less ~> injection_below
2357 less_up_def ~> below_up_def
2358 not_Iup_less ~> not_Iup_below
2359 Iup_less ~> Iup_below
2361 Def_inject_less_eq ~> Def_below_Def
2362 Def_less_is_eq ~> Def_below_iff
2363 spair_less_iff ~> spair_below_iff
2364 less_sprod ~> below_sprod
2365 spair_less ~> spair_below
2366 sfst_less_iff ~> sfst_below_iff
2367 ssnd_less_iff ~> ssnd_below_iff
2368 fix_least_less ~> fix_least_below
2369 dist_less_one ~> dist_below_one
2370 less_ONE ~> below_ONE
2371 ONE_less_iff ~> ONE_below_iff
2372 less_sinlD ~> below_sinlD
2373 less_sinrD ~> below_sinrD
2378 * All constant names are now qualified internally and use proper
2379 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2384 * Antiquotation @{assert} inlines a function bool -> unit that raises
2385 Fail if the argument is false. Due to inlining the source position of
2386 failed assertions is included in the error output.
2388 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2389 text is in practice always evaluated with a stable theory checkpoint.
2390 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2392 * Antiquotation @{theory A} refers to theory A from the ancestry of
2393 the current context, not any accidental theory loader state as before.
2394 Potential INCOMPATIBILITY, subtle change in semantics.
2396 * Syntax.pretty_priority (default 0) configures the required priority
2397 of pretty-printed output and thus affects insertion of parentheses.
2399 * Syntax.default_root (default "any") configures the inner syntax
2400 category (nonterminal symbol) for parsing of terms.
2402 * Former exception Library.UnequalLengths now coincides with
2403 ListPair.UnequalLengths.
2405 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2406 main functionality is provided by structure Simplifier.
2408 * Renamed raw "explode" function to "raw_explode" to emphasize its
2409 meaning. Note that internally to Isabelle, Symbol.explode is used in
2410 almost all situations.
2412 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2413 See implementation manual for further details on exceptions in
2416 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2419 * Renamed structure PureThy to Pure_Thy and moved most of its
2420 operations to structure Global_Theory, to emphasize that this is
2421 rarely-used global-only stuff.
2423 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2424 instead (or tracing for high-volume output).
2426 * Configuration option show_question_marks only affects regular pretty
2427 printing of types and terms, not raw Term.string_of_vname.
2429 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2430 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2431 @{thms} for most purposes.
2433 * ML structure Unsynchronized is never opened, not even in Isar
2434 interaction mode as before. Old Unsynchronized.set etc. have been
2435 discontinued -- use plain := instead. This should be *rare* anyway,
2436 since modern tools always work via official context data, notably
2437 configuration options.
2439 * Parallel and asynchronous execution requires special care concerning
2440 interrupts. Structure Exn provides some convenience functions that
2441 avoid working directly with raw Interrupt. User code must not absorb
2442 interrupts -- intermediate handling (for cleanup etc.) needs to be
2443 followed by re-raising of the original exception. Another common
2444 source of mistakes are "handle _" patterns, which make the meaning of
2445 the program subject to physical effects of the environment.
2449 New in Isabelle2009-2 (June 2010)
2450 ---------------------------------
2454 * Authentic syntax for *all* logical entities (type classes, type
2455 constructors, term constants): provides simple and robust
2456 correspondence between formal entities and concrete syntax. Within
2457 the parse tree / AST representations, "constants" are decorated by
2458 their category (class, type, const) and spelled out explicitly with
2459 their full internal name.
2461 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2462 and translations (translation rules and translation functions in ML).
2463 Some hints on upgrading:
2465 - Many existing uses of 'syntax' and 'translations' can be replaced
2466 by more modern 'type_notation', 'notation' and 'abbreviation',
2467 which are independent of this issue.
2469 - 'translations' require markup within the AST; the term syntax
2470 provides the following special forms:
2472 CONST c -- produces syntax version of constant c from context
2473 XCONST c -- literally c, checked as constant from context
2474 c -- literally c, if declared by 'syntax'
2476 Plain identifiers are treated as AST variables -- occasionally the
2477 system indicates accidental variables via the error "rhs contains
2480 Type classes and type constructors are marked according to their
2481 concrete syntax. Some old translations rules need to be written
2482 for the "type" category, using type constructor application
2483 instead of pseudo-term application of the default category
2486 - 'parse_translation' etc. in ML may use the following
2489 @{class_syntax c} -- type class c within parse tree / AST
2490 @{term_syntax c} -- type constructor c within parse tree / AST
2491 @{const_syntax c} -- ML version of "CONST c" above
2492 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2494 - Literal types within 'typed_print_translations', i.e. those *not*
2495 represented as pseudo-terms are represented verbatim. Use @{class
2496 c} or @{type_name c} here instead of the above syntax
2499 Note that old non-authentic syntax was based on unqualified base
2500 names, so all of the above "constant" names would coincide. Recall
2501 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2502 diagnose syntax problems.
2504 * Type constructors admit general mixfix syntax, not just infix.
2506 * Concrete syntax may be attached to local entities without a proof
2507 body, too. This works via regular mixfix annotations for 'fix',
2508 'def', 'obtain' etc. or via the explicit 'write' command, which is
2509 similar to the 'notation' command in theory specifications.
2511 * Discontinued unnamed infix syntax (legacy feature for many years) --
2512 need to specify constant name and syntax separately. Internal ML
2513 datatype constructors have been renamed from InfixName to Infix etc.
2514 Minor INCOMPATIBILITY.
2516 * Schematic theorem statements need to be explicitly markup as such,
2517 via commands 'schematic_lemma', 'schematic_theorem',
2518 'schematic_corollary'. Thus the relevance of the proof is made
2519 syntactically clear, which impacts performance in a parallel or
2520 asynchronous interactive environment. Minor INCOMPATIBILITY.
2522 * Use of cumulative prems via "!" in some proof methods has been
2523 discontinued (old legacy feature).
2525 * References 'trace_simp' and 'debug_simp' have been replaced by
2526 configuration options stored in the context. Enabling tracing (the
2527 case of debugging is similar) in proofs works via
2529 using [[trace_simp = true]]
2531 Tracing is then active for all invocations of the simplifier in
2532 subsequent goal refinement steps. Tracing may also still be enabled or
2533 disabled via the ProofGeneral settings menu.
2535 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2536 'hide_fact' replace the former 'hide' KIND command. Minor
2539 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2540 more efficient than combinations with -q1 or -q2.
2545 * Proofterms record type-class reasoning explicitly, using the
2546 "unconstrain" operation internally. This eliminates all sort
2547 constraints from a theorem and proof, introducing explicit
2548 OFCLASS-premises. On the proof term level, this operation is
2549 automatically applied at theorem boundaries, such that closed proofs
2550 are always free of sort constraints. INCOMPATIBILITY for tools that
2551 inspect proof terms.
2553 * Local theory specifications may depend on extra type variables that
2554 are not present in the result type -- arguments TYPE('a) :: 'a itself
2555 are added internally. For example:
2557 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2559 * Predicates of locales introduced by classes carry a mandatory
2560 "class" prefix. INCOMPATIBILITY.
2562 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2564 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2567 * Command 'code_reflect' allows to incorporate generated ML code into
2568 runtime environment; replaces immature code_datatype antiquotation.
2571 * Code generator: simple concept for abstract datatypes obeying
2574 * Code generator: details of internal data cache have no impact on the
2575 user space functionality any longer.
2577 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2578 subgoals. This is more appropriate for interpretations with 'where'.
2581 * Command 'example_proof' opens an empty proof body. This allows to
2582 experiment with Isar, without producing any persistent result.
2584 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2585 within a local theory context, with explicit checking of the
2586 constructors involved (in contrast to the raw 'syntax' versions).
2588 * Commands 'types' and 'typedecl' now work within a local theory
2589 context -- without introducing dependencies on parameters or
2590 assumptions, which is not possible in Isabelle/Pure.
2592 * Command 'defaultsort' has been renamed to 'default_sort', it works
2593 within a local theory context. Minor INCOMPATIBILITY.
2598 * Command 'typedef' now works within a local theory context -- without
2599 introducing dependencies on parameters or assumptions, which is not
2600 possible in Isabelle/Pure/HOL. Note that the logical environment may
2601 contain multiple interpretations of local typedefs (with different
2602 non-emptiness proofs), even in a global theory context.
2604 * New package for quotient types. Commands 'quotient_type' and
2605 'quotient_definition' may be used for defining types and constants by
2606 quotient constructions. An example is the type of integers created by
2607 quotienting pairs of natural numbers:
2610 intrel :: "(nat * nat) => (nat * nat) => bool"
2612 "intrel (x, y) (u, v) = (x + v = u + y)"
2614 quotient_type int = "nat * nat" / intrel
2615 by (auto simp add: equivp_def expand_fun_eq)
2618 "0::int" is "(0::nat, 0::nat)"
2620 The method "lifting" can be used to lift of theorems from the
2621 underlying "raw" type to the quotient type. The example
2622 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2623 construction and provides a reasoning infrastructure for finite sets.
2625 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2626 clash with new theory Quotient in Main HOL.
2628 * Moved the SMT binding into the main HOL session, eliminating
2629 separate HOL-SMT session.
2631 * List membership infix mem operation is only an input abbreviation.
2634 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2635 for future developements; former Library/Word.thy is still present in
2636 the AFP entry RSAPPS.
2638 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2639 longer shadowed. INCOMPATIBILITY.
2641 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2644 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2647 * Dropped normalizing_semiring etc; use the facts in semiring classes
2648 instead. INCOMPATIBILITY.
2650 * Dropped several real-specific versions of lemmas about floor and
2651 ceiling; use the generic lemmas from theory "Archimedean_Field"
2652 instead. INCOMPATIBILITY.
2654 floor_number_of_eq ~> floor_number_of
2655 le_floor_eq_number_of ~> number_of_le_floor
2656 le_floor_eq_zero ~> zero_le_floor
2657 le_floor_eq_one ~> one_le_floor
2658 floor_less_eq_number_of ~> floor_less_number_of
2659 floor_less_eq_zero ~> floor_less_zero
2660 floor_less_eq_one ~> floor_less_one
2661 less_floor_eq_number_of ~> number_of_less_floor
2662 less_floor_eq_zero ~> zero_less_floor
2663 less_floor_eq_one ~> one_less_floor
2664 floor_le_eq_number_of ~> floor_le_number_of
2665 floor_le_eq_zero ~> floor_le_zero
2666 floor_le_eq_one ~> floor_le_one
2667 floor_subtract_number_of ~> floor_diff_number_of
2668 floor_subtract_one ~> floor_diff_one
2669 ceiling_number_of_eq ~> ceiling_number_of
2670 ceiling_le_eq_number_of ~> ceiling_le_number_of
2671 ceiling_le_zero_eq ~> ceiling_le_zero
2672 ceiling_le_eq_one ~> ceiling_le_one
2673 less_ceiling_eq_number_of ~> number_of_less_ceiling
2674 less_ceiling_eq_zero ~> zero_less_ceiling
2675 less_ceiling_eq_one ~> one_less_ceiling
2676 ceiling_less_eq_number_of ~> ceiling_less_number_of
2677 ceiling_less_eq_zero ~> ceiling_less_zero
2678 ceiling_less_eq_one ~> ceiling_less_one
2679 le_ceiling_eq_number_of ~> number_of_le_ceiling
2680 le_ceiling_eq_zero ~> zero_le_ceiling
2681 le_ceiling_eq_one ~> one_le_ceiling
2682 ceiling_subtract_number_of ~> ceiling_diff_number_of
2683 ceiling_subtract_one ~> ceiling_diff_one
2685 * Theory "Finite_Set": various folding_XXX locales facilitate the
2686 application of the various fold combinators on finite sets.
2688 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2689 provides abstract red-black tree type which is backed by "RBT_Impl" as
2690 implementation. INCOMPATIBILTY.
2692 * Theory Library/Coinductive_List has been removed -- superseded by
2693 AFP/thys/Coinductive.
2695 * Theory PReal, including the type "preal" and related operations, has
2696 been removed. INCOMPATIBILITY.
2698 * Real: new development using Cauchy Sequences.
2700 * Split off theory "Big_Operators" containing setsum, setprod,
2701 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2703 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2704 "Int" etc. INCOMPATIBILITY.
2706 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2708 * New set of rules "ac_simps" provides combined assoc / commute
2709 rewrites for all interpretations of the appropriate generic locales.
2711 * Renamed theory "OrderedGroup" to "Groups" and split theory
2712 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2713 appropriate and more consistent names suitable for name prefixes
2714 within the HOL theories. INCOMPATIBILITY.
2716 * Some generic constants have been put to appropriate theories:
2717 - less_eq, less: Orderings
2718 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2719 - inverse, divide: Rings
2722 * More consistent naming of type classes involving orderings (and
2725 lower_semilattice ~> semilattice_inf
2726 upper_semilattice ~> semilattice_sup
2728 dense_linear_order ~> dense_linorder
2730 pordered_ab_group_add ~> ordered_ab_group_add
2731 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2732 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2733 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2734 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2735 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2736 pordered_cancel_semiring ~> ordered_cancel_semiring
2737 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2738 pordered_comm_ring ~> ordered_comm_ring
2739 pordered_comm_semiring ~> ordered_comm_semiring
2740 pordered_ring ~> ordered_ring
2741 pordered_ring_abs ~> ordered_ring_abs
2742 pordered_semiring ~> ordered_semiring
2744 ordered_ab_group_add ~> linordered_ab_group_add
2745 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2746 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2747 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2748 ordered_field ~> linordered_field
2749 ordered_field_no_lb ~> linordered_field_no_lb
2750 ordered_field_no_ub ~> linordered_field_no_ub
2751 ordered_field_dense_linear_order ~> dense_linordered_field
2752 ordered_idom ~> linordered_idom
2753 ordered_ring ~> linordered_ring
2754 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2755 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2756 ordered_ring_strict ~> linordered_ring_strict
2757 ordered_semidom ~> linordered_semidom
2758 ordered_semiring ~> linordered_semiring
2759 ordered_semiring_1 ~> linordered_semiring_1
2760 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2761 ordered_semiring_strict ~> linordered_semiring_strict
2763 The following slightly odd type classes have been moved to a
2764 separate theory Library/Lattice_Algebras:
2766 lordered_ab_group_add ~> lattice_ab_group_add
2767 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2768 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2769 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2770 lordered_ring ~> lattice_ring
2774 * Refined field classes:
2775 - classes division_ring_inverse_zero, field_inverse_zero,
2776 linordered_field_inverse_zero include rule inverse 0 = 0 --
2777 subsumes former division_by_zero class;
2778 - numerous lemmas have been ported from field to division_ring.
2781 * Refined algebra theorem collections:
2782 - dropped theorem group group_simps, use algebra_simps instead;
2783 - dropped theorem group ring_simps, use field_simps instead;
2784 - proper theorem collection field_simps subsumes former theorem
2785 groups field_eq_simps and field_simps;
2786 - dropped lemma eq_minus_self_iff which is a duplicate for
2790 * Theory Finite_Set and List: some lemmas have been generalized from
2793 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2794 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2795 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2796 union_Union_fold_union ~> sup_Sup_fold_sup
2797 Inter_fold_inter ~> Inf_fold_inf
2798 Union_fold_union ~> Sup_fold_sup
2799 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2800 union_UNION_fold_union ~> sup_SUPR_fold_sup
2801 INTER_fold_inter ~> INFI_fold_inf
2802 UNION_fold_union ~> SUPR_fold_sup
2804 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2805 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2806 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2807 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2808 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2809 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2811 * Reorganized theory Multiset: swapped notation of pointwise and
2814 - pointwise ordering is instance of class order with standard syntax
2816 - multiset ordering has syntax <=# and <#; partial order properties
2817 are provided by means of interpretation with prefix
2819 - less duplication, less historical organization of sections,
2820 conversion from associations lists to multisets, rudimentary code
2822 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2827 multiset_eq_conv_count_eq ~> multiset_ext_iff
2828 multi_count_ext ~> multiset_ext
2829 diff_union_inverse2 ~> diff_union_cancelR
2833 * Theory Permutation: replaced local "remove" by List.remove1.
2835 * Code generation: ML and OCaml code is decorated with signatures.
2837 * Theory List: added transpose.
2839 * Library/Nat_Bijection.thy is a collection of bijective functions
2840 between nat and other types, which supersedes the older libraries
2841 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2844 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2845 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2846 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2847 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2848 Countable.pair_encode ~> prod_encode
2849 NatIso.prod2nat ~> prod_encode
2850 NatIso.nat2prod ~> prod_decode
2851 NatIso.sum2nat ~> sum_encode
2852 NatIso.nat2sum ~> sum_decode
2853 NatIso.list2nat ~> list_encode
2854 NatIso.nat2list ~> list_decode
2855 NatIso.set2nat ~> set_encode
2856 NatIso.nat2set ~> set_decode
2859 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
2860 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
2861 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
2862 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
2863 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
2864 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
2865 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
2866 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
2867 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
2868 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
2869 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
2870 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
2871 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
2874 - Renamed ATP commands:
2875 atp_info ~> sledgehammer running_atps
2876 atp_kill ~> sledgehammer kill_atps
2877 atp_messages ~> sledgehammer messages
2878 atp_minimize ~> sledgehammer minimize
2879 print_atps ~> sledgehammer available_atps
2881 - Added user's manual ("isabelle doc sledgehammer").
2882 - Added option syntax and "sledgehammer_params" to customize
2883 Sledgehammer's behavior. See the manual for details.
2884 - Modified the Isar proof reconstruction code so that it produces
2885 direct proofs rather than proofs by contradiction. (This feature
2886 is still experimental.)
2887 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
2889 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
2892 - Added and implemented "binary_ints" and "bits" options.
2893 - Added "std" option and implemented support for nonstandard models.
2894 - Added and implemented "finitize" option to improve the precision
2895 of infinite datatypes based on a monotonicity analysis.
2896 - Added support for quotient types.
2897 - Added support for "specification" and "ax_specification"
2899 - Added support for local definitions (for "function" and
2900 "termination" proofs).
2901 - Added support for term postprocessors.
2902 - Optimized "Multiset.multiset" and "FinFun.finfun".
2903 - Improved efficiency of "destroy_constrs" optimization.
2904 - Fixed soundness bugs related to "destroy_constrs" optimization and
2906 - Fixed soundness bug related to higher-order constructors.
2907 - Fixed soundness bug when "full_descrs" is enabled.
2908 - Improved precision of set constructs.
2909 - Added "atoms" option.
2910 - Added cache to speed up repeated Kodkod invocations on the same
2912 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
2913 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
2914 "SAT4J_Light". INCOMPATIBILITY.
2915 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
2916 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
2917 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
2919 * Method "induct" now takes instantiations of the form t, where t is not
2920 a variable, as a shorthand for "x == t", where x is a fresh variable.
2921 If this is not intended, t has to be enclosed in parentheses.
2922 By default, the equalities generated by definitional instantiations
2923 are pre-simplified, which may cause parameters of inductive cases
2924 to disappear, or may even delete some of the inductive cases.
2925 Use "induct (no_simp)" instead of "induct" to restore the old
2926 behaviour. The (no_simp) option is also understood by the "cases"
2927 and "nominal_induct" methods, which now perform pre-simplification, too.
2933 * Variable names in lemmas generated by the domain package have
2934 changed; the naming scheme is now consistent with the HOL datatype
2935 package. Some proof scripts may be affected, INCOMPATIBILITY.
2937 * The domain package no longer defines the function "foo_copy" for
2938 recursive domain "foo". The reach lemma is now stated directly in
2939 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
2940 be reformulated in terms of "foo_take", INCOMPATIBILITY.
2942 * Most definedness lemmas generated by the domain package (previously
2943 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
2944 like "foo$x = UU <-> x = UU", which works better as a simp rule.
2945 Proofs that used definedness lemmas as intro rules may break,
2946 potential INCOMPATIBILITY.
2948 * Induction and casedist rules generated by the domain package now
2949 declare proper case_names (one called "bottom", and one named for each
2950 constructor). INCOMPATIBILITY.
2952 * For mutually-recursive domains, separate "reach" and "take_lemma"
2953 rules are generated for each domain, INCOMPATIBILITY.
2955 foo_bar.reach ~> foo.reach bar.reach
2956 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
2958 * Some lemmas generated by the domain package have been renamed for
2959 consistency with the datatype package, INCOMPATIBILITY.
2961 foo.ind ~> foo.induct
2962 foo.finite_ind ~> foo.finite_induct
2963 foo.coind ~> foo.coinduct
2964 foo.casedist ~> foo.exhaust
2965 foo.exhaust ~> foo.nchotomy
2967 * For consistency with other definition packages, the fixrec package
2968 now generates qualified theorem names, INCOMPATIBILITY.
2970 foo_simps ~> foo.simps
2971 foo_unfold ~> foo.unfold
2972 foo_induct ~> foo.induct
2974 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
2975 method and internal fixrec proofs now use the default simpset instead.
2978 * The "contlub" predicate has been removed. Proof scripts should use
2979 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
2981 * The "admw" predicate has been removed, INCOMPATIBILITY.
2983 * The constants cpair, cfst, and csnd have been removed in favor of
2984 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
2989 * Antiquotations for basic formal entities:
2991 @{class NAME} -- type class
2992 @{class_syntax NAME} -- syntax representation of the above
2994 @{type_name NAME} -- logical type
2995 @{type_abbrev NAME} -- type abbreviation
2996 @{nonterminal NAME} -- type of concrete syntactic category
2997 @{type_syntax NAME} -- syntax representation of any of the above
2999 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3000 @{const_abbrev NAME} -- abbreviated constant
3001 @{const_syntax NAME} -- syntax representation of any of the above
3003 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3004 syntax constant (cf. 'syntax' command).
3006 * Antiquotation @{make_string} inlines a function to print arbitrary
3007 values similar to the ML toplevel. The result is compiler dependent
3008 and may fall back on "?" in certain situations.
3010 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3011 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3012 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3013 not work with the asynchronous Isar document model.
3015 * Configuration options now admit dynamic default values, depending on
3016 the context or even global references.
3018 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3019 uses an efficient external library if available (for Poly/ML).
3021 * Renamed some important ML structures, while keeping the old names
3022 for some time as aliases within the structure Legacy:
3024 OuterKeyword ~> Keyword
3027 OuterSyntax ~> Outer_Syntax
3028 PrintMode ~> Print_Mode
3029 SpecParse ~> Parse_Spec
3032 ThyOutput ~> Thy_Output
3033 TypeInfer ~> Type_Infer
3035 Note that "open Legacy" simplifies porting of sources, but forgetting
3036 to remove it again will complicate porting again in the future.
3038 * Most operations that refer to a global context are named
3039 accordingly, e.g. Simplifier.global_context or
3040 ProofContext.init_global. There are some situations where a global
3041 context actually works, but under normal circumstances one needs to
3042 pass the proper local context through the code!
3044 * Discontinued old TheoryDataFun with its copy/init operation -- data
3045 needs to be pure. Functor Theory_Data_PP retains the traditional
3046 Pretty.pp argument to merge, which is absent in the standard
3047 Theory_Data version.
3049 * Sorts.certify_sort and derived "cert" operations for types and terms
3050 no longer minimize sorts. Thus certification at the boundary of the
3051 inference kernel becomes invariant under addition of class relations,
3052 which is an important monotonicity principle. Sorts are now minimized
3053 in the syntax layer only, at the boundary between the end-user and the
3054 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3055 explicitly in rare situations.
3057 * Renamed old-style Drule.standard to Drule.export_without_context, to
3058 emphasize that this is in no way a standard operation.
3061 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3062 usual for resolution. Rare INCOMPATIBILITY.
3064 * Renamed varify/unvarify operations to varify_global/unvarify_global
3065 to emphasize that these only work in a global situation (which is
3068 * Curried take and drop in library.ML; negative length is interpreted
3069 as infinity (as in chop). Subtle INCOMPATIBILITY.
3071 * Proof terms: type substitutions on proof constants now use canonical
3072 order of type variables. INCOMPATIBILITY for tools working with proof
3075 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3076 may no longer carry premises. User-level specifications are
3077 transformed accordingly by Thm.add_axiom/add_def.
3082 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3083 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3084 proof terms are enabled unconditionally in the new HOL-Proofs image.
3086 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3087 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3090 * Old lib/scripts/polyml-platform is superseded by the
3091 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3092 variant, even on a 64 bit machine. The following example setting
3093 prefers 64 bit if available:
3095 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3097 * The preliminary Isabelle/jEdit application demonstrates the emerging
3098 Isabelle/Scala layer for advanced prover interaction and integration.
3099 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3102 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3103 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3104 similar to the default assignment of the document preparation system
3105 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3106 provides some operations for direct access to the font without asking
3107 the user for manual installation.
3111 New in Isabelle2009-1 (December 2009)
3112 -------------------------------------
3116 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3117 one backslash should be used, even in ML sources.
3122 * Locale interpretation propagates mixins along the locale hierarchy.
3123 The currently only available mixins are the equations used to map
3124 local definitions to terms of the target domain of an interpretation.
3126 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3127 loc" to print all interpretations of locale "loc" in the theory.
3128 Interpretations in proofs are not shown.
3130 * Thoroughly revised locales tutorial. New section on conditional
3133 * On instantiation of classes, remaining undefined class parameters
3134 are formally declared. INCOMPATIBILITY.
3137 *** Document preparation ***
3139 * New generalized style concept for printing terms: @{foo (style) ...}
3140 instead of @{foo_style style ...} (old form is still retained for
3141 backward compatibility). Styles can be also applied for
3142 antiquotations prop, term_type and typeof.
3147 * New proof method "smt" for a combination of first-order logic with
3148 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3149 fixed-size bitvectors; there is also basic support for higher-order
3150 features (esp. lambda abstractions). It is an incomplete decision
3151 procedure based on external SMT solvers using the oracle mechanism;
3152 for the SMT solver Z3, this method is proof-producing. Certificates
3153 are provided to avoid calling the external solvers solely for
3154 re-checking proofs. Due to a remote SMT service there is no need for
3155 installing SMT solvers locally. See src/HOL/SMT.
3157 * New commands to load and prove verification conditions generated by
3158 the Boogie program verifier or derived systems (e.g. the Verifying C
3159 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3161 * New counterexample generator tool 'nitpick' based on the Kodkod
3162 relational model finder. See src/HOL/Tools/Nitpick and
3163 src/HOL/Nitpick_Examples.
3165 * New commands 'code_pred' and 'values' to invoke the predicate
3166 compiler and to enumerate values of inductive predicates.
3168 * A tabled implementation of the reflexive transitive closure.
3170 * New implementation of quickcheck uses generic code generator;
3171 default generators are provided for all suitable HOL types, records
3172 and datatypes. Old quickcheck can be re-activated importing theory
3173 Library/SML_Quickcheck.
3175 * New testing tool Mirabelle for automated proof tools. Applies
3176 several tools and tactics like sledgehammer, metis, or quickcheck, to
3177 every proof step in a theory. To be used in batch mode via the
3178 "mirabelle" utility.
3180 * New proof method "sos" (sum of squares) for nonlinear real
3181 arithmetic (originally due to John Harison). It requires theory
3182 Library/Sum_Of_Squares. It is not a complete decision procedure but
3183 works well in practice on quantifier-free real arithmetic with +, -,
3184 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3185 inequalities between polynomials. It makes use of external
3186 semidefinite programming solvers. Method "sos" generates a
3187 certificate that can be pasted into the proof thus avoiding the need
3188 to call an external tool every time the proof is checked. See
3189 src/HOL/Library/Sum_Of_Squares.
3191 * New method "linarith" invokes existing linear arithmetic decision
3194 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3196 * New Sledgehammer option "Full Types" in Proof General settings menu.
3197 Causes full type information to be output to the ATPs. This slows
3198 ATPs down considerably but eliminates a source of unsound "proofs"
3201 * New method "metisFT": A version of metis that uses full type
3202 information in order to avoid failures of proof reconstruction.
3204 * New evaluator "approximate" approximates an real valued term using
3205 the same method as the approximation method.
3207 * Method "approximate" now supports arithmetic expressions as
3208 boundaries of intervals and implements interval splitting and Taylor
3211 * ML antiquotation @{code_datatype} inserts definition of a datatype
3212 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3214 * New theory SupInf of the supremum and infimum operators for sets of
3217 * New theory Probability, which contains a development of measure
3218 theory, eventually leading to Lebesgue integration and probability.
3220 * Extended Multivariate Analysis to include derivation and Brouwer's
3223 * Reorganization of number theory, INCOMPATIBILITY:
3224 - new number theory development for nat and int, in theories Divides
3225 and GCD as well as in new session Number_Theory
3226 - some constants and facts now suffixed with _nat and _int
3228 - former session NumberTheory now named Old_Number_Theory, including
3229 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3230 - moved theory Pocklington from src/HOL/Library to
3231 src/HOL/Old_Number_Theory
3233 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3234 lcm of finite and infinite sets. It is shown that they form a complete
3237 * Class semiring_div requires superclass no_zero_divisors and proof of
3238 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3239 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3240 generalized to class semiring_div, subsuming former theorems
3241 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3242 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3245 * Refinements to lattice classes and sets:
3246 - less default intro/elim rules in locale variant, more default
3247 intro/elim rules in class variant: more uniformity
3248 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3250 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3252 - renamed ACI to inf_sup_aci
3253 - new class "boolean_algebra"
3254 - class "complete_lattice" moved to separate theory
3255 "Complete_Lattice"; corresponding constants (and abbreviations)
3256 renamed and with authentic syntax:
3257 Set.Inf ~> Complete_Lattice.Inf
3258 Set.Sup ~> Complete_Lattice.Sup
3259 Set.INFI ~> Complete_Lattice.INFI
3260 Set.SUPR ~> Complete_Lattice.SUPR
3261 Set.Inter ~> Complete_Lattice.Inter
3262 Set.Union ~> Complete_Lattice.Union
3263 Set.INTER ~> Complete_Lattice.INTER
3264 Set.UNION ~> Complete_Lattice.UNION
3265 - authentic syntax for
3268 - mere abbreviations:
3271 Set.inter (for inf, formerly Set.Int)
3272 Set.union (for sup, formerly Set.Un)
3273 Complete_Lattice.Inter (for Inf)
3274 Complete_Lattice.Union (for Sup)
3275 Complete_Lattice.INTER (for INFI)
3276 Complete_Lattice.UNION (for SUPR)
3277 - object-logic definitions as far as appropriate
3279 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3280 Un_subset_iff are explicitly deleted as default simp rules; then also
3281 their lattice counterparts le_inf_iff and le_sup_iff have to be
3282 deleted to achieve the desired effect.
3284 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3285 rules by default any longer; the same applies to min_max.inf_absorb1
3286 etc. INCOMPATIBILITY.
3288 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3289 pred_set_conv by default. INCOMPATIBILITY.
3291 * Power operations on relations and functions are now one dedicated
3292 constant "compow" with infix syntax "^^". Power operation on
3293 multiplicative monoids retains syntax "^" and is now defined generic
3294 in class power. INCOMPATIBILITY.
3296 * Relation composition "R O S" now has a more standard argument order:
3297 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3298 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3299 break, since the O_assoc rule was not rewritten like this. Fix using
3300 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3302 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3303 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3306 * Most rules produced by inductive and datatype package have mandatory
3307 prefixes. INCOMPATIBILITY.
3309 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3310 the attribute of the same name. Each of the theorems in the list
3311 DERIV_intros assumes composition with an additional function and
3312 matches a variable to the derivative, which has to be solved by the
3313 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3314 of most elementary terms. Former Maclauren.DERIV_tac and
3315 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3318 * Code generator attributes follow the usual underscore convention:
3319 code_unfold replaces code unfold
3320 code_post replaces code post
3325 sizechange -> size_change
3326 induct_scheme -> induction_schema
3329 * Discontinued abbreviation "arbitrary" of constant "undefined".
3330 INCOMPATIBILITY, use "undefined" directly.
3333 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3334 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3335 Suc_plus1 -> Suc_eq_plus1
3336 *anti_sym -> *antisym*
3337 vector_less_eq_def -> vector_le_def
3340 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3343 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3349 * Theory Representable defines a class "rep" of domains that are
3350 representable (via an ep-pair) in the universal domain type "udom".
3351 Instances are provided for all type constructors defined in HOLCF.
3353 * The 'new_domain' command is a purely definitional version of the
3354 domain package, for representable domains. Syntax is identical to the
3355 old domain package. The 'new_domain' package also supports indirect
3356 recursion using previously-defined type constructors. See
3357 src/HOLCF/ex/New_Domain.thy for examples.
3359 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3360 on the left-hand side of an equation, and then performs
3361 simplification. Rewriting is done using rules declared with the
3362 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3363 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3365 * The pattern-match compiler in 'fixrec' can now handle constructors
3366 with HOL function types. Pattern-match combinators for the Pair
3367 constructor are pre-configured.
3369 * The 'fixrec' package now produces better fixed-point induction rules
3370 for mutually-recursive definitions: Induction rules have conclusions
3371 of the form "P foo bar" instead of "P <foo, bar>".
3373 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3374 been renamed to "below". The name "below" now replaces "less" in many
3375 theorem names. (Legacy theorem names using "less" are still supported
3378 * The 'fixrec' package now supports "bottom patterns". Bottom
3379 patterns can be used to generate strictness rules, or to make
3380 functions more strict (much like the bang-patterns supported by the
3381 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3387 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3388 errors and run-time exceptions, including detailed source positions.
3390 * Structure Name_Space (formerly NameSpace) now manages uniquely
3391 identified entries, with some additional information such as source
3392 position, logical grouping etc.
3394 * Theory and context data is now introduced by the simplified and
3395 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3396 to be pure, but the old TheoryDataFun for mutable data (with explicit
3397 copy operation) is still available for some time.
3399 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3400 provides a high-level programming interface to synchronized state
3401 variables with atomic update. This works via pure function
3402 application within a critical section -- its runtime should be as
3403 short as possible; beware of deadlocks if critical code is nested,
3404 either directly or indirectly via other synchronized variables!
3406 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3407 wraps raw ML references, explicitly indicating their non-thread-safe
3408 behaviour. The Isar toplevel keeps this structure open, to
3409 accommodate Proof General as well as quick and dirty interactive
3410 experiments with references.
3412 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3413 parallel tactical reasoning.
3415 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3416 are similar to SUBPROOF, but are slightly more flexible: only the
3417 specified parts of the subgoal are imported into the context, and the
3418 body tactic may introduce new subgoals and schematic variables.
3420 * Old tactical METAHYPS, which does not observe the proof context, has
3421 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3422 or Subgoal.FOCUS etc.
3424 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3425 functors have their own ML name space there is no point to mark them
3426 separately.) Minor INCOMPATIBILITY.
3428 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3430 * Renamed several structures FooBar to Foo_Bar. Occasional,
3433 * Operations of structure Skip_Proof no longer require quick_and_dirty
3434 mode, which avoids critical setmp.
3436 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3437 combinators for "args". INCOMPATIBILITY, need to use simplified
3438 Attrib/Method.setup introduced in Isabelle2009.
3440 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3441 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3442 last resort. INCOMPATIBILITY.
3444 * Display.pretty_thm now requires a proper context (cf. former
3445 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3446 or even Display.pretty_thm_without_context as last resort.
3449 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3450 Syntax.pretty_typ/term directly, preferably with proper context
3451 instead of global theory.
3456 * Further fine tuning of parallel proof checking, scales up to 8 cores
3457 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3460 * Support for additional "Isabelle components" via etc/components, see
3461 also the system manual.
3463 * The isabelle makeall tool now operates on all components with
3464 IsaMakefile, not just hardwired "logics".
3466 * Removed "compress" option from isabelle-process and isabelle usedir;
3467 this is always enabled.
3469 * Discontinued support for Poly/ML 4.x versions.
3471 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3472 on a given logic image. This requires the lighttpd webserver and is
3473 currently supported on Linux only.
3477 New in Isabelle2009 (April 2009)
3478 --------------------------------
3482 * Simplified main Isabelle executables, with less surprises on
3483 case-insensitive file-systems (such as Mac OS).
3485 - The main Isabelle tool wrapper is now called "isabelle" instead of
3488 - The former "isabelle" alias for "isabelle-process" has been
3489 removed (should rarely occur to regular users).
3491 - The former "isabelle-interface" and its alias "Isabelle" have been
3492 removed (interfaces are now regular Isabelle tools).
3494 Within scripts and make files, the Isabelle environment variables
3495 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3496 respectively. (The latter are still available as legacy feature.)
3498 The old isabelle-interface wrapper could react in confusing ways if
3499 the interface was uninstalled or changed otherwise. Individual
3500 interface tool configuration is now more explicit, see also the
3501 Isabelle system manual. In particular, Proof General is now available
3502 via "isabelle emacs".
3504 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3505 purge installed copies of Isabelle executables and re-run "isabelle
3506 install -p ...", or use symlinks.
3508 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3509 old ~/isabelle, which was slightly non-standard and apt to cause
3510 surprises on case-insensitive file-systems (such as Mac OS).
3512 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3513 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3514 care is required when using older releases of Isabelle. Note that
3515 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3516 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3518 * Proofs of fully specified statements are run in parallel on
3519 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3520 a regular 4-core machine, if the initial heap space is made reasonably
3521 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3523 * The main reference manuals ("isar-ref", "implementation", and
3524 "system") have been updated and extended. Formally checked references
3525 as hyperlinks are now available uniformly.
3530 * Complete re-implementation of locales. INCOMPATIBILITY in several
3531 respects. The most important changes are listed below. See the
3532 Tutorial on Locales ("locales" manual) for details.
3534 - In locale expressions, instantiation replaces renaming. Parameters
3535 must be declared in a for clause. To aid compatibility with previous
3536 parameter inheritance, in locale declarations, parameters that are not
3537 'touched' (instantiation position "_" or omitted) are implicitly added
3538 with their syntax at the beginning of the for clause.
3540 - Syntax from abbreviations and definitions in locales is available in
3541 locale expressions and context elements. The latter is particularly
3542 useful in locale declarations.
3544 - More flexible mechanisms to qualify names generated by locale
3545 expressions. Qualifiers (prefixes) may be specified in locale
3546 expressions, and can be marked as mandatory (syntax: "name!:") or
3547 optional (syntax "name?:"). The default depends for plain "name:"
3548 depends on the situation where a locale expression is used: in
3549 commands 'locale' and 'sublocale' prefixes are optional, in
3550 'interpretation' and 'interpret' prefixes are mandatory. The old
3551 implicit qualifiers derived from the parameter names of a locale are
3552 no longer generated.
3554 - Command "sublocale l < e" replaces "interpretation l < e". The
3555 instantiation clause in "interpretation" and "interpret" (square
3556 brackets) is no longer available. Use locale expressions.
3558 - When converting proof scripts, mandatory qualifiers in
3559 'interpretation' and 'interpret' should be retained by default, even
3560 if this is an INCOMPATIBILITY compared to former behavior. In the
3561 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3562 in locale expressions range over a single locale instance only.
3564 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3565 In existing theorem specifications replace the includes element by the
3566 respective context elements of the included locale, omitting those
3567 that are already present in the theorem specification. Multiple
3568 assume elements of a locale should be replaced by a single one
3569 involving the locale predicate. In the proof body, declarations (most
3570 notably theorems) may be regained by interpreting the respective
3571 locales in the proof context as required (command "interpret").
3573 If using "includes" in replacement of a target solely because the
3574 parameter types in the theorem are not as general as in the target,
3575 consider declaring a new locale with additional type constraints on
3576 the parameters (context element "constrains").
3578 - Discontinued "locale (open)". INCOMPATIBILITY.
3580 - Locale interpretation commands no longer attempt to simplify goal.
3581 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3582 methods intro_locales and unfold_locales to clarify.
3584 - Locale interpretation commands no longer accept interpretation
3585 attributes. INCOMPATIBILITY.
3587 * Class declaration: so-called "base sort" must not be given in import
3588 list any longer, but is inferred from the specification. Particularly
3595 class foo = type + ...
3597 * Class target: global versions of theorems stemming do not carry a
3598 parameter prefix any longer. INCOMPATIBILITY.
3600 * Class 'instance' command no longer accepts attached definitions.
3601 INCOMPATIBILITY, use proper 'instantiation' target instead.
3603 * Recovered hiding of consts, which was accidentally broken in
3604 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3605 makes c inaccessible; consider using ``hide (open) const c'' instead.
3607 * Slightly more coherent Pure syntax, with updated documentation in
3608 isar-ref manual. Removed locales meta_term_syntax and
3609 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3610 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3611 directly in regular applications.
3613 * There is a new syntactic category "float_const" for signed decimal
3614 fractions (e.g. 123.45 or -123.45).
3616 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3617 interface with 'setup' command instead.
3619 * Command 'local_setup' is similar to 'setup', but operates on a local
3622 * The 'axiomatization' command now only works within a global theory
3623 context. INCOMPATIBILITY.
3625 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3626 hypotheses. Sorts required in the course of reasoning need to be
3627 covered by the constraints in the initial statement, completed by the
3628 type instance information of the background theory. Non-trivial sort
3629 hypotheses, which rarely occur in practice, may be specified via
3630 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3632 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3634 The result contains an implicit sort hypotheses as before --
3635 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3638 * Generalized Isar history, with support for linear undo, direct state
3641 * Changed defaults for unify configuration options:
3643 unify_trace_bound = 50 (formerly 25)
3644 unify_search_bound = 60 (formerly 30)
3646 * Different bookkeeping for code equations (INCOMPATIBILITY):
3648 a) On theory merge, the last set of code equations for a particular
3649 constant is taken (in accordance with the policy applied by other
3650 parts of the code generator framework).
3652 b) Code equations stemming from explicit declarations (e.g. code
3653 attribute) gain priority over default code equations stemming
3654 from definition, primrec, fun etc.
3656 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3658 * Unified theorem tables for both code generators. Thus [code
3659 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3661 * Command 'find_consts' searches for constants based on type and name
3664 find_consts "_ => bool"
3666 By default, matching is against subtypes, but it may be restricted to
3667 the whole type. Searching by name is possible. Multiple queries are
3668 conjunctive and queries may be negated by prefixing them with a
3671 find_consts strict: "_ => bool" name: "Int" -"int => int"
3673 * New 'find_theorems' criterion "solves" matches theorems that
3674 directly solve the current goal (modulo higher-order unification).
3676 * Auto solve feature for main theorem statements: whenever a new goal
3677 is stated, "find_theorems solves" is called; any theorems that could
3678 solve the lemma directly are listed as part of the goal state.
3679 Cf. associated options in Proof General Isabelle settings menu,
3680 enabled by default, with reasonable timeout for pathological cases of
3681 higher-order unification.
3684 *** Document preparation ***
3686 * Antiquotation @{lemma} now imitates a regular terminal proof,
3687 demanding keyword 'by' and supporting the full method expression
3688 syntax just like the Isar command 'by'.
3693 * Integrated main parts of former image HOL-Complex with HOL. Entry
3694 points Main and Complex_Main remain as before.
3696 * Logic image HOL-Plain provides a minimal HOL with the most important
3697 tools available (inductive, datatype, primrec, ...). This facilitates
3698 experimentation and tool development. Note that user applications
3699 (and library theories) should never refer to anything below theory
3702 * Logic image HOL-Main stops at theory Main, and thus facilitates
3703 experimentation due to shorter build times.
3705 * Logic image HOL-NSA contains theories of nonstandard analysis which
3706 were previously part of former HOL-Complex. Entry point Hyperreal
3707 remains valid, but theories formerly using Complex_Main should now use
3708 new entry point Hypercomplex.
3710 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3711 Posix processes. Avoids potentially expensive forking of the ML
3712 process. New thread-based implementation also works on non-Unix
3713 platforms (Cygwin). Provers are no longer hardwired, but defined
3714 within the theory via plain ML wrapper functions. Basic Sledgehammer
3715 commands are covered in the isar-ref manual.
3717 * Wrapper scripts for remote SystemOnTPTP service allows to use
3718 sledgehammer without local ATP installation (Vampire etc.). Other
3719 provers may be included via suitable ML wrappers, see also
3720 src/HOL/ATP_Linkup.thy.
3722 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3725 * The metis method no longer fails because the theorem is too trivial
3726 (contains the empty clause).
3728 * The metis method now fails in the usual manner, rather than raising
3729 an exception, if it determines that it cannot prove the theorem.
3731 * Method "coherent" implements a prover for coherent logic (see also
3732 src/Tools/coherent.ML).
3734 * Constants "undefined" and "default" replace "arbitrary". Usually
3735 "undefined" is the right choice to replace "arbitrary", though
3736 logically there is no difference. INCOMPATIBILITY.
3738 * Command "value" now integrates different evaluation mechanisms. The
3739 result of the first successful evaluation mechanism is printed. In
3740 square brackets a particular named evaluation mechanisms may be
3741 specified (currently, [SML], [code] or [nbe]). See further
3742 src/HOL/ex/Eval_Examples.thy.
3744 * Normalization by evaluation now allows non-leftlinear equations.
3745 Declare with attribute [code nbe].
3747 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3748 as the structured Isar versions "cases" and "induct", cf. the
3749 corresponding "cases" and "induct" attributes. Mutual induction rules
3750 are now presented as a list of individual projections
3751 (e.g. foo_bar.inducts for types foo and bar); the old format with
3752 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3753 rare situations a different rule is selected --- notably nested tuple
3754 elimination instead of former prod.exhaust: use explicit (case_tac t
3755 rule: prod.exhaust) here.
3757 * Attributes "cases", "induct", "coinduct" support "del" option.
3759 * Removed fact "case_split_thm", which duplicates "case_split".
3761 * The option datatype has been moved to a new theory Option. Renamed
3762 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3764 * New predicate "strict_mono" classifies strict functions on partial
3765 orders. With strict functions on linear orders, reasoning about
3766 (in)equalities is facilitated by theorems "strict_mono_eq",
3767 "strict_mono_less_eq" and "strict_mono_less".
3769 * Some set operations are now proper qualified constants with
3770 authentic syntax. INCOMPATIBILITY:
3781 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3784 * Auxiliary class "itself" has disappeared -- classes without any
3785 parameter are treated as expected by the 'class' command.
3787 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3789 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3790 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3792 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3793 method "approximation". It proves formulas on real values by using
3794 interval arithmetic. In the formulas are also the transcendental
3795 functions sin, cos, tan, atan, ln, exp and the constant pi are
3796 allowed. For examples see
3797 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3799 * Theory "Reflection" now resides in HOL/Library.
3801 * Entry point to Word library now simply named "Word".
3804 * Made source layout more coherent with logical distribution
3807 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3808 src/HOL/Library/Code_Message.thy ~> src/HOL/
3809 src/HOL/Library/GCD.thy ~> src/HOL/
3810 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3811 src/HOL/Library/Parity.thy ~> src/HOL/
3812 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3813 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3814 src/HOL/Real/Lubs.thy ~> src/HOL/
3815 src/HOL/Real/PReal.thy ~> src/HOL/
3816 src/HOL/Real/Rational.thy ~> src/HOL/
3817 src/HOL/Real/RComplete.thy ~> src/HOL/
3818 src/HOL/Real/RealDef.thy ~> src/HOL/
3819 src/HOL/Real/RealPow.thy ~> src/HOL/
3820 src/HOL/Real/Real.thy ~> src/HOL/
3821 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3822 src/HOL/Complex/Complex.thy ~> src/HOL/
3823 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3824 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3825 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3826 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3827 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3828 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3829 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3830 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3831 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3832 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3833 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3834 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3835 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3836 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3837 src/HOL/Real/Float ~> src/HOL/Library/
3838 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3839 src/HOL/Real/RealVector.thy ~> src/HOL/
3841 src/HOL/arith_data.ML ~> src/HOL/Tools
3842 src/HOL/hologic.ML ~> src/HOL/Tools
3843 src/HOL/simpdata.ML ~> src/HOL/Tools
3844 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3845 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3846 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3847 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3848 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3849 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3850 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3852 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3853 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
3854 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
3855 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
3856 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
3857 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
3859 * If methods "eval" and "evaluation" encounter a structured proof
3860 state with !!/==>, only the conclusion is evaluated to True (if
3861 possible), avoiding strange error messages.
3863 * Method "sizechange" automates termination proofs using (a
3864 modification of) the size-change principle. Requires SAT solver. See
3865 src/HOL/ex/Termination.thy for examples.
3867 * Simplifier: simproc for let expressions now unfolds if bound
3868 variable occurs at most once in let expression body. INCOMPATIBILITY.
3870 * Method "arith": Linear arithmetic now ignores all inequalities when
3871 fast_arith_neq_limit is exceeded, instead of giving up entirely.
3873 * New attribute "arith" for facts that should always be used
3874 automatically by arithmetic. It is intended to be used locally in
3877 assumes [arith]: "x > 0"
3879 Global usage is discouraged because of possible performance impact.
3881 * New classes "top" and "bot" with corresponding operations "top" and
3882 "bot" in theory Orderings; instantiation of class "complete_lattice"
3883 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
3885 * Changed definition lemma "less_fun_def" in order to provide an
3886 instance for preorders on functions; use lemma "less_le" instead.
3889 * Theory Orderings: class "wellorder" moved here, with explicit
3890 induction rule "less_induct" as assumption. For instantiation of
3891 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
3894 * Theory Orderings: added class "preorder" as superclass of "order".
3895 INCOMPATIBILITY: Instantiation proofs for order, linorder
3896 etc. slightly changed. Some theorems named order_class.* now named
3899 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
3902 * Theory Finite_Set: added a new fold combinator of type
3904 ('a => 'b => 'b) => 'b => 'a set => 'b
3906 Occasionally this is more convenient than the old fold combinator
3907 which is now defined in terms of the new one and renamed to
3910 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
3911 and "ring_simps" have been replaced by "algebra_simps" (which can be
3912 extended with further lemmas!). At the moment both still exist but
3913 the former will disappear at some point.
3915 * Theory Power: Lemma power_Suc is now declared as a simp rule in
3916 class recpower. Type-specific simp rules for various recpower types
3917 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
3919 rat_power_0 -> power_0
3920 rat_power_Suc -> power_Suc
3921 realpow_0 -> power_0
3922 realpow_Suc -> power_Suc
3923 complexpow_0 -> power_0
3924 complexpow_Suc -> power_Suc
3925 power_poly_0 -> power_0
3926 power_poly_Suc -> power_Suc
3928 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
3929 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
3930 dvd has been generalized to class comm_semiring_1. Likewise a bunch
3931 of lemmas from Divides has been generalized from nat to class
3932 semiring_div. INCOMPATIBILITY. This involves the following theorem
3933 renames resulting from duplicate elimination:
3935 dvd_def_mod ~> dvd_eq_mod_eq_0
3936 zero_dvd_iff ~> dvd_0_left_iff
3937 dvd_0 ~> dvd_0_right
3938 DIVISION_BY_ZERO_DIV ~> div_by_0
3939 DIVISION_BY_ZERO_MOD ~> mod_by_0
3940 mult_div ~> div_mult_self2_is_id
3941 mult_mod ~> mod_mult_self2_is_0
3943 * Theory IntDiv: removed many lemmas that are instances of class-based
3944 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
3945 rename old lemmas as follows:
3947 dvd_diff -> nat_dvd_diff
3948 dvd_zminus_iff -> dvd_minus_iff
3949 mod_add1_eq -> mod_add_eq
3950 mod_mult1_eq -> mod_mult_right_eq
3951 mod_mult1_eq' -> mod_mult_left_eq
3952 mod_mult_distrib_mod -> mod_mult_eq
3953 nat_mod_add_left_eq -> mod_add_left_eq
3954 nat_mod_add_right_eq -> mod_add_right_eq
3955 nat_mod_div_trivial -> mod_div_trivial
3956 nat_mod_mod_trivial -> mod_mod_trivial
3957 zdiv_zadd_self1 -> div_add_self1
3958 zdiv_zadd_self2 -> div_add_self2
3959 zdiv_zmult_self1 -> div_mult_self2_is_id
3960 zdiv_zmult_self2 -> div_mult_self1_is_id
3961 zdvd_triv_left -> dvd_triv_left
3962 zdvd_triv_right -> dvd_triv_right
3963 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
3964 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
3965 zmod_zadd_left_eq -> mod_add_left_eq
3966 zmod_zadd_right_eq -> mod_add_right_eq
3967 zmod_zadd_self1 -> mod_add_self1
3968 zmod_zadd_self2 -> mod_add_self2
3969 zmod_zadd1_eq -> mod_add_eq
3970 zmod_zdiff1_eq -> mod_diff_eq
3971 zmod_zdvd_zmod -> mod_mod_cancel
3972 zmod_zmod_cancel -> mod_mod_cancel
3973 zmod_zmult_self1 -> mod_mult_self2_is_0
3974 zmod_zmult_self2 -> mod_mult_self1_is_0
3977 zdvd_abs1 -> abs_dvd_iff
3978 zdvd_abs2 -> dvd_abs_iff
3979 zdvd_refl -> dvd_refl
3980 zdvd_trans -> dvd_trans
3981 zdvd_zadd -> dvd_add
3982 zdvd_zdiff -> dvd_diff
3983 zdvd_zminus_iff -> dvd_minus_iff
3984 zdvd_zminus2_iff -> minus_dvd_iff
3985 zdvd_zmultD -> dvd_mult_right
3986 zdvd_zmultD2 -> dvd_mult_left
3987 zdvd_zmult_mono -> mult_dvd_mono
3988 zdvd_0_right -> dvd_0_right
3989 zdvd_0_left -> dvd_0_left_iff
3990 zdvd_1_left -> one_dvd
3991 zminus_dvd_iff -> minus_dvd_iff
3993 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
3995 * The real numbers offer decimal input syntax: 12.34 is translated
3996 into 1234/10^2. This translation is not reversed upon output.
3998 * Theory Library/Polynomial defines an abstract type 'a poly of
3999 univariate polynomials with coefficients of type 'a. In addition to
4000 the standard ring operations, it also supports div and mod. Code
4001 generation is also supported, using list-style constructors.
4003 * Theory Library/Inner_Product defines a class of real_inner for real
4004 inner product spaces, with an overloaded operation inner :: 'a => 'a
4005 => real. Class real_inner is a subclass of real_normed_vector from
4008 * Theory Library/Product_Vector provides instances for the product
4009 type 'a * 'b of several classes from RealVector and Inner_Product.
4010 Definitions of addition, subtraction, scalar multiplication, norms,
4011 and inner products are included.
4013 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4014 addition to the field operations, numerals and case syntax are also
4017 * Theory Library/Diagonalize provides constructive version of Cantor's
4018 first diagonalization argument.
4020 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4021 zlcm (for int); carried together from various gcd/lcm developements in
4022 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4023 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4024 may recover tupled syntax as follows:
4026 hide (open) const gcd
4027 abbreviation gcd where
4028 "gcd == (%(a, b). GCD.gcd a b)"
4030 GCD.gcd ("gcd '(_, _')")
4032 The same works for lcm, zgcd, zlcm.
4034 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4035 instantiations for algebraic structures. Removed some duplicate
4036 theorems. Changes in simp rules. INCOMPATIBILITY.
4038 * ML antiquotation @{code} takes a constant as argument and generates
4039 corresponding code in background and inserts name of the corresponding
4040 resulting ML value/function/datatype constructor binding in place.
4041 All occurrences of @{code} with a single ML block are generated
4042 simultaneously. Provides a generic and safe interface for
4043 instrumentalizing code generation. See
4044 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4045 In future you ought to refrain from ad-hoc compiling generated SML
4046 code on the ML toplevel. Note that (for technical reasons) @{code}
4047 cannot refer to constants for which user-defined serializations are
4048 set. Refer to the corresponding ML counterpart directly in that
4051 * Command 'rep_datatype': instead of theorem names the command now
4052 takes a list of terms denoting the constructors of the type to be
4053 represented as datatype. The characteristic theorems have to be
4054 proven. INCOMPATIBILITY. Also observe that the following theorems
4055 have disappeared in favour of existing ones:
4057 unit_induct ~> unit.induct
4058 prod_induct ~> prod.induct
4059 sum_induct ~> sum.induct
4060 Suc_Suc_eq ~> nat.inject
4061 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4066 * New locales for orders and lattices where the equivalence relation
4067 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4068 locales use a record structure with field eq for the equivalence.
4070 * New theory of factorial domains.
4072 * Units_l_inv and Units_r_inv are now simp rules by default.
4073 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4074 and/or r_inv will now also require deletion of these lemmas.
4076 * Renamed the following theorems, INCOMPATIBILITY:
4078 UpperD ~> Upper_memD
4079 LowerD ~> Lower_memD
4080 least_carrier ~> least_closed
4081 greatest_carrier ~> greatest_closed
4082 greatest_Lower_above ~> greatest_Lower_below
4083 one_zero ~> carrier_one_zero
4084 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4089 * Nominal datatypes can now contain type-variables.
4091 * Commands 'nominal_inductive' and 'equivariance' work with local
4094 * Nominal primrec can now works with local theory targets and its
4095 specification syntax now conforms to the general format as seen in
4098 * Method "perm_simp" honours the standard simplifier attributes
4099 (no_asm), (no_asm_use) etc.
4101 * The new predicate #* is defined like freshness, except that on the
4102 left hand side can be a set or list of atoms.
4104 * Experimental command 'nominal_inductive2' derives strong induction
4105 principles for inductive definitions. In contrast to
4106 'nominal_inductive', which can only deal with a fixed number of
4107 binders, it can deal with arbitrary expressions standing for sets of
4108 atoms to be avoided. The only inductive definition we have at the
4109 moment that needs this generalisation is the typing rule for Lets in
4112 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4113 -----------------------------------------------------------------
4114 Gamma |- Let x be t1 in t2 : T2
4116 In this rule one wants to avoid all the binders that are introduced by
4117 "close Gamma T1". We are looking for other examples where this
4118 feature might be useful. Please let us know.
4123 * Reimplemented the simplification procedure for proving continuity
4124 subgoals. The new simproc is extensible; users can declare additional
4125 continuity introduction rules with the attribute [cont2cont].
4127 * The continuity simproc now uses a different introduction rule for
4128 solving continuity subgoals on terms with lambda abstractions. In
4129 some rare cases the new simproc may fail to solve subgoals that the
4130 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4131 Potential INCOMPATIBILITY.
4133 * Command 'fixrec': specification syntax now conforms to the general
4134 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4135 examples. INCOMPATIBILITY.
4140 * Proof of Zorn's Lemma for partial orders.
4145 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4146 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4147 depends on multithreading, so timouts will not work before Poly/ML
4150 * High-level support for concurrent ML programming, see
4151 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4152 particularly convenient to organize independent functional
4153 computations. The concept of "synchronized variables" provides a
4154 higher-order interface for components with shared state, avoiding the
4155 delicate details of mutexes and condition variables. (Requires
4156 Poly/ML 5.2.1 or later.)
4158 * ML bindings produced via Isar commands are stored within the Isar
4159 context (theory or proof). Consequently, commands like 'use' and 'ML'
4160 become thread-safe and work with undo as expected (concerning
4161 top-level bindings, not side-effects on global references).
4162 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4163 compiler at runtime; really global bindings need to be given outside a
4164 theory. (Requires Poly/ML 5.2 or later.)
4166 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4167 context. Top-level ML bindings are stored within the proof context in
4168 a purely sequential fashion, disregarding the nested proof structure.
4169 ML bindings introduced by 'ML_prf' are discarded at the end of the
4170 proof. (Requires Poly/ML 5.2 or later.)
4172 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4173 and Method.setup, as well as Isar commands 'attribute_setup' and
4174 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4175 existing code accordingly, or use plain 'setup' together with old
4178 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4179 to 'a -> thm, while results are always tagged with an authentic oracle
4180 name. The Isar command 'oracle' is now polymorphic, no argument type
4181 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4182 accordingly. Note that extra performance may be gained by producing
4183 the cterm carefully, avoiding slow Thm.cterm_of.
4185 * Simplified interface for defining document antiquotations via
4186 ThyOutput.antiquotation, ThyOutput.output, and optionally
4187 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4188 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4191 * More systematic treatment of long names, abstract name bindings, and
4192 name space operations. Basic operations on qualified names have been
4193 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4194 Long_Name.append. Old type bstring has been mostly replaced by
4195 abstract type binding (see structure Binding), which supports precise
4196 qualification by packages and local theory targets, as well as proper
4197 tracking of source positions. INCOMPATIBILITY, need to wrap old
4198 bstring values into Binding.name, or better pass through abstract
4199 bindings everywhere. See further src/Pure/General/long_name.ML,
4200 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4202 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4203 LocalTheory.note etc.) now refer to the *full* internal name, not the
4204 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4206 * Disposed old type and term read functions (Sign.read_def_typ,
4207 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4208 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4209 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4210 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4211 resort for legacy applications.
4213 * Disposed old declarations, tactics, tactic combinators that refer to
4214 the simpset or claset of an implicit theory (such as Addsimps,
4215 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4216 embedded ML text, or local_simpset_of with a proper context passed as
4217 explicit runtime argument.
4219 * Rules and tactics that read instantiations (read_instantiate,
4220 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4221 context, which is required for parsing and type-checking. Moreover,
4222 the variables are specified as plain indexnames, not string encodings
4223 thereof. INCOMPATIBILITY.
4225 * Generic Toplevel.add_hook interface allows to analyze the result of
4226 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4227 for theorem dependency output of transactions resulting in a new
4230 * ML antiquotations: block-structured compilation context indicated by
4231 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4233 @{binding name} - basic name binding
4234 @{let ?pat = term} - term abbreviation (HO matching)
4235 @{note name = fact} - fact abbreviation
4236 @{thm fact} - singleton fact (with attributes)
4237 @{thms fact} - general fact (with attributes)
4238 @{lemma prop by method} - singleton goal
4239 @{lemma prop by meth1 meth2} - singleton goal
4240 @{lemma prop1 ... propN by method} - general goal
4241 @{lemma prop1 ... propN by meth1 meth2} - general goal
4242 @{lemma (open) ...} - open derivation
4247 * The Isabelle "emacs" tool provides a specific interface to invoke
4248 Proof General / Emacs, with more explicit failure if that is not
4249 installed (the old isabelle-interface script silently falls back on
4250 isabelle-process). The PROOFGENERAL_HOME setting determines the
4251 installation location of the Proof General distribution.
4253 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4254 the Isabelle process into a JVM/Scala application. See
4255 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4256 process wrapper has been discontinued.)
4258 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4260 * Various status messages (with exact source position information) are
4261 emitted, if proper markup print mode is enabled. This allows
4262 user-interface components to provide detailed feedback on internal
4267 New in Isabelle2008 (June 2008)
4268 -------------------------------
4272 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4273 and updated, with formally checked references as hyperlinks.
4275 * Theory loader: use_thy (and similar operations) no longer set the
4276 implicit ML context, which was occasionally hard to predict and in
4277 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4278 provides a proper context already.
4280 * Theory loader: old-style ML proof scripts being *attached* to a thy
4281 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4282 'use' within a theory file will do the job.
4284 * Name space merge now observes canonical order, i.e. the second space
4285 is inserted into the first one, while existing entries in the first
4286 space take precedence. INCOMPATIBILITY in rare situations, may try to
4287 swap theory imports.
4289 * Syntax: symbol \<chi> is now considered a letter. Potential
4290 INCOMPATIBILITY in identifier syntax etc.
4292 * Outer syntax: string tokens no longer admit escaped white space,
4293 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4294 white space without escapes.
4296 * Outer syntax: string tokens may contain arbitrary character codes
4297 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4303 * Context-dependent token translations. Default setup reverts locally
4304 fixed variables, and adds hilite markup for undeclared frees.
4306 * Unused theorems can be found using the new command 'unused_thms'.
4307 There are three ways of invoking it:
4310 Only finds unused theorems in the current theory.
4312 (2) unused_thms thy_1 ... thy_n -
4313 Finds unused theorems in the current theory and all of its ancestors,
4314 excluding the theories thy_1 ... thy_n and all of their ancestors.
4316 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4317 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4318 their ancestors, excluding the theories thy_1 ... thy_n and all of
4321 In order to increase the readability of the list produced by
4322 unused_thms, theorems that have been created by a particular instance
4323 of a theory command such as 'inductive' or 'function' are considered
4324 to belong to the same "group", meaning that if at least one theorem in
4325 this group is used, the other theorems in the same group are no longer
4326 reported as unused. Moreover, if all theorems in the group are
4327 unused, only one theorem in the group is displayed.
4329 Note that proof objects have to be switched on in order for
4330 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4331 usually the case when using Proof General with the default settings).
4333 * Authentic naming of facts disallows ad-hoc overwriting of previous
4334 theorems within the same name space. INCOMPATIBILITY, need to remove
4335 duplicate fact bindings, or even accidental fact duplications. Note
4336 that tools may maintain dynamically scoped facts systematically, using
4337 PureThy.add_thms_dynamic.
4339 * Command 'hide' now allows to hide from "fact" name space as well.
4341 * Eliminated destructive theorem database, simpset, claset, and
4342 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4343 update of theories within ML code.
4345 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4346 INCOMPATIBILITY, object-logics depending on former Pure require
4347 additional setup PureThy.old_appl_syntax_setup; object-logics
4348 depending on former CPure need to refer to Pure.
4350 * Commands 'use' and 'ML' are now purely functional, operating on
4351 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4352 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4355 * Command 'setup': discontinued implicit version with ML reference.
4357 * Instantiation target allows for simultaneous specification of class
4358 instance operations together with an instantiation proof.
4359 Type-checking phase allows to refer to class operations uniformly.
4360 See src/HOL/Complex/Complex.thy for an Isar example and
4361 src/HOL/Library/Eval.thy for an ML example.
4363 * Indexing of literal facts: be more serious about including only
4364 facts from the visible specification/proof context, but not the
4365 background context (locale etc.). Affects `prop` notation and method
4366 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4369 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4370 "(open)" option, which used to expose internal bound variables to the
4373 * Isar statements: removed obsolete case "rule_context".
4374 INCOMPATIBILITY, better use explicit fixes/assumes.
4376 * Locale proofs: default proof step now includes 'unfold_locales';
4377 hence 'proof' without argument may be used to unfold locale
4381 *** Document preparation ***
4383 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4384 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4385 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4386 spot); renamed link color from "darkblue" to "linkcolor" (default
4387 value unchanged, can be redefined via \definecolor); no longer sets
4388 "a4paper" option (unnecessary or even intrusive).
4390 * Antiquotation @{lemma A method} proves proposition A by the given
4391 method (either a method name or a method name plus (optional) method
4392 arguments in parentheses) and prints A just like @{prop A}.
4397 * New primrec package. Specification syntax conforms in style to
4398 definition/function/.... No separate induction rule is provided. The
4399 "primrec" command distinguishes old-style and new-style specifications
4400 by syntax. The former primrec package is now named OldPrimrecPackage.
4401 When adjusting theories, beware: constants stemming from new-style
4402 primrec specifications have authentic syntax.
4404 * Metis prover is now an order of magnitude faster, and also works
4405 with multithreading.
4407 * Metis: the maximum number of clauses that can be produced from a
4408 theorem is now given by the attribute max_clauses. Theorems that
4409 exceed this number are ignored, with a warning printed.
4411 * Sledgehammer no longer produces structured proofs by default. To
4412 enable, declare [[sledgehammer_full = true]]. Attributes
4413 reconstruction_modulus, reconstruction_sorts renamed
4414 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4416 * Method "induct_scheme" derives user-specified induction rules
4417 from well-founded induction and completeness of patterns. This factors
4418 out some operations that are done internally by the function package
4419 and makes them available separately. See
4420 src/HOL/ex/Induction_Scheme.thy for examples.
4422 * More flexible generation of measure functions for termination
4423 proofs: Measure functions can be declared by proving a rule of the
4424 form "is_measure f" and giving it the [measure_function] attribute.
4425 The "is_measure" predicate is logically meaningless (always true), and
4426 just guides the heuristic. To find suitable measure functions, the
4427 termination prover sets up the goal "is_measure ?f" of the appropriate
4428 type and generates all solutions by prolog-style backwards proof using
4431 This setup also deals with rules like
4433 "is_measure f ==> is_measure (list_size f)"
4435 which accommodates nested datatypes that recurse through lists.
4436 Similar rules are predeclared for products and option types.
4438 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4442 - Definitions of overloaded constants on sets have to be replaced by
4443 definitions on => and bool.
4445 - Some definitions of overloaded operators on sets can now be proved
4446 using the definitions of the operators on => and bool. Therefore,
4447 the following theorems have been renamed:
4449 subset_def -> subset_eq
4450 psubset_def -> psubset_eq
4451 set_diff_def -> set_diff_eq
4452 Compl_def -> Compl_eq
4453 Sup_set_def -> Sup_set_eq
4454 Inf_set_def -> Inf_set_eq
4455 sup_set_def -> sup_set_eq
4456 inf_set_def -> inf_set_eq
4458 - Due to the incompleteness of the HO unification algorithm, some
4459 rules such as subst may require manual instantiation, if some of
4460 the unknowns in the rule is a set.
4462 - Higher order unification and forward proofs:
4465 have "P (S::'a set)" <...>
4466 then have "EX S. P S" ..
4468 no longer works (due to the incompleteness of the HO unification
4469 algorithm) and must be replaced by the pattern
4476 - Calculational reasoning with subst (or similar rules):
4479 have "P (S::'a set)" <...>
4480 also have "S = T" <...>
4481 finally have "P T" .
4483 no longer works (for similar reasons as the previous example) and
4484 must be replaced by something like
4486 have "P (S::'a set)" <...>
4487 moreover have "S = T" <...>
4488 ultimately have "P T" by simp
4490 - Tactics or packages written in ML code:
4491 Code performing pattern matching on types via
4493 Type ("set", [T]) => ...
4495 must be rewritten. Moreover, functions like strip_type or
4496 binder_types no longer return the right value when applied to a
4499 T1 => ... => Tn => U => bool
4503 T1 => ... => Tn => U set
4505 * Merged theories Wellfounded_Recursion, Accessible_Part and
4506 Wellfounded_Relations to theory Wellfounded.
4508 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4510 * Class finite no longer treats UNIV as class parameter. Use class
4511 enum from theory Library/Enum instead to achieve a similar effect.
4514 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4515 and "Cons". INCOMPATIBILITY.
4517 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4518 Potential INCOMPATIBILITY.
4520 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4521 injective_fst_snd removed, use split_eta and prod_eqI instead.
4522 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4524 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4525 the same name in theory Orderings:
4535 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4536 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4537 and different variable names.
4539 * Library/Option_ord.thy: Canonical order on option type.
4541 * Library/RBT.thy: Red-black trees, an efficient implementation of
4544 * Library/Countable.thy: Type class for countable types.
4546 * Theory Int: The representation of numerals has changed. The infix
4547 operator BIT and the bit datatype with constructors B0 and B1 have
4548 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4549 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4550 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4553 * Theory Nat: definition of <= and < on natural numbers no longer
4554 depend on well-founded relations. INCOMPATIBILITY. Definitions
4555 le_def and less_def have disappeared. Consider lemmas not_less
4556 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4558 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4559 (whose purpose mainly is for various fold_set functionals) have been
4560 abandoned in favor of the existing algebraic classes
4561 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4562 lower_semilattice (resp. upper_semilattice) and linorder.
4565 * Theory Transitive_Closure: induct and cases rules now declare proper
4566 case_names ("base" and "step"). INCOMPATIBILITY.
4568 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4569 lattices. The form set-specific version is available as
4570 Inductive.lfp_ordinal_induct_set.
4572 * Renamed theorems "power.simps" to "power_int.simps".
4575 * Class semiring_div provides basic abstract properties of semirings
4576 with division and modulo operations. Subsumes former class dvd_mod.
4578 * Merged theories IntDef, Numeral and IntArith into unified theory
4579 Int. INCOMPATIBILITY.
4581 * Theory Library/Code_Index: type "index" now represents natural
4582 numbers rather than integers. INCOMPATIBILITY.
4584 * New class "uminus" with operation "uminus" (split of from class
4585 "minus" which now only has operation "minus", binary).
4588 * Constants "card", "internal_split", "option_map" now with authentic
4589 syntax. INCOMPATIBILITY.
4591 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4592 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4593 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4594 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4595 Sup_set_def, le_def, less_def, option_map_def now with object
4596 equality. INCOMPATIBILITY.
4598 * Records. Removed K_record, and replaced it by pure lambda term
4599 %x. c. The simplifier setup is now more robust against eta expansion.
4600 INCOMPATIBILITY: in cases explicitly referring to K_record.
4602 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4604 * Library/ListVector: new theory of arithmetic vector operations.
4606 * Library/Order_Relation: new theory of various orderings as sets of
4607 pairs. Defines preorders, partial orders, linear orders and
4608 well-orders on sets and on types.
4613 * Renamed some theories to allow to loading both ZF and HOL in the
4616 Datatype -> Datatype_ZF
4617 Inductive -> Inductive_ZF
4624 INCOMPATIBILITY: ZF theories that import individual theories below
4625 Main might need to be adapted. Regular theory Main is still
4626 available, as trivial extension of Main_ZF.
4631 * ML within Isar: antiquotation @{const name} or @{const
4632 name(typargs)} produces statically-checked Const term.
4634 * Functor NamedThmsFun: data is available to the user as dynamic fact
4635 (of the same name). Removed obsolete print command.
4637 * Removed obsolete "use_legacy_bindings" function.
4639 * The ``print mode'' is now a thread-local value derived from a global
4640 template (the former print_mode reference), thus access becomes
4641 non-critical. The global print_mode reference is for session
4642 management only; user-code should use print_mode_value,
4643 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4645 * Functions system/system_out provide a robust way to invoke external
4646 shell commands, with propagation of interrupts (requires Poly/ML
4647 5.2.1). Do not use OS.Process.system etc. from the basis library!
4652 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4653 in accordance with Proof General 3.7, which prefers GNU emacs.
4655 * isatool tty runs Isabelle process with plain tty interaction;
4656 optional line editor may be specified via ISABELLE_LINE_EDITOR
4657 setting, the default settings attempt to locate "ledit" and "rlwrap".
4659 * isatool browser now works with Cygwin as well, using general
4660 "javapath" function defined in Isabelle process environment.
4662 * YXML notation provides a simple and efficient alternative to
4663 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4664 isatool yxml as described in the Isabelle system manual.
4666 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4667 provides general wrapper for managing an Isabelle process in a robust
4668 fashion, with ``cooked'' output from stdin/stderr.
4670 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4671 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4673 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4674 way of changing the user's settings is via
4675 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4678 * Multithreading.max_threads := 0 refers to the number of actual CPU
4679 cores of the underlying machine, which is a good starting point for
4680 optimal performance tuning. The corresponding usedir option -M allows
4681 "max" as an alias for "0". WARNING: does not work on certain versions
4682 of Mac OS (with Poly/ML 5.1).
4684 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4685 adverse effect of Isabelle flooding interactive front-ends (notably
4686 ProofGeneral / XEmacs).
4690 New in Isabelle2007 (November 2007)
4691 -----------------------------------
4695 * More uniform information about legacy features, notably a
4696 warning/error of "Legacy feature: ...", depending on the state of the
4697 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4698 legacy features will disappear eventually.
4700 * Theory syntax: the header format ``theory A = B + C:'' has been
4701 discontinued in favour of ``theory A imports B C begin''. Use isatool
4702 fixheaders to convert existing theory files. INCOMPATIBILITY.
4704 * Theory syntax: the old non-Isar theory file format has been
4705 discontinued altogether. Note that ML proof scripts may still be used
4706 with Isar theories; migration is usually quite simple with the ML
4707 function use_legacy_bindings. INCOMPATIBILITY.
4709 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4710 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4713 * Theory loader: be more serious about observing the static theory
4714 header specifications (including optional directories), but not the
4715 accidental file locations of previously successful loads. The strict
4716 update policy of former update_thy is now already performed by
4717 use_thy, so the former has been removed; use_thys updates several
4718 theories simultaneously, just as 'imports' within a theory header
4719 specification, but without merging the results. Potential
4720 INCOMPATIBILITY: may need to refine theory headers and commands
4721 ROOT.ML which depend on load order.
4723 * Theory loader: optional support for content-based file
4724 identification, instead of the traditional scheme of full physical
4725 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4726 (cf. the system manual). The new scheme allows to work with
4727 non-finished theories in persistent session images, such that source
4728 files may be moved later on without requiring reloads.
4730 * Theory loader: old-style ML proof scripts being *attached* to a thy
4731 file (with the same base name as the theory) are considered a legacy
4732 feature, which will disappear eventually. Even now, the theory loader
4733 no longer maintains dependencies on such files.
4735 * Syntax: the scope for resolving ambiguities via type-inference is
4736 now limited to individual terms, instead of whole simultaneous
4737 specifications as before. This greatly reduces the complexity of the
4738 syntax module and improves flexibility by separating parsing and
4739 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4740 'fixes' etc.) are required in rare situations.
4742 * Syntax: constants introduced by new-style packages ('definition',
4743 'abbreviation' etc.) are passed through the syntax module in
4744 ``authentic mode''. This means that associated mixfix annotations
4745 really stick to such constants, independently of potential name space
4746 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4747 trees are represented slightly differently, may need to adapt syntax
4748 translations accordingly. Use CONST marker in 'translations' and
4749 @{const_syntax} antiquotation in 'parse_translation' etc.
4751 * Legacy goal package: reduced interface to the bare minimum required
4752 to keep existing proof scripts running. Most other user-level
4753 functions are now part of the OldGoals structure, which is *not* open
4754 by default (consider isatool expandshort before open OldGoals).
4755 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4756 these tend to cause confusion about the actual goal (!) context being
4757 used here, which is not necessarily the same as the_context().
4759 * Command 'find_theorems': supports "*" wild-card in "name:"
4760 criterion; "with_dups" option. Certain ProofGeneral versions might
4761 support a specific search form (see ProofGeneral/CHANGES).
4763 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4764 by default, which means that "prems" (and also "fixed variables") are
4765 suppressed from proof state output. Note that the ProofGeneral
4766 settings mechanism allows to change and save options persistently, but
4767 older versions of Isabelle will fail to start up if a negative prems
4770 * Local theory targets may be specified by non-nested blocks of
4771 ``context/locale/class ... begin'' followed by ``end''. The body may
4772 contain definitions, theorems etc., including any derived mechanism
4773 that has been implemented on top of these primitives. This concept
4774 generalizes the existing ``theorem (in ...)'' towards more versatility
4777 * Proof General interface: proper undo of final 'end' command;
4778 discontinued Isabelle/classic mode (ML proof scripts).
4781 *** Document preparation ***
4783 * Added antiquotation @{theory name} which prints the given name,
4784 after checking that it refers to a valid ancestor theory in the
4787 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4788 check the given source text as ML type/structure, printing verbatim.
4790 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4791 "c args == rhs" given in the current context. (Any number of
4792 arguments may be given on the LHS.)
4797 * The 'class' package offers a combination of axclass and locale to
4798 achieve Haskell-like type classes in Isabelle. Definitions and
4799 theorems within a class context produce both relative results (with
4800 implicit parameters according to the locale context), and polymorphic
4801 constants with qualified polymorphism (according to the class
4802 context). Within the body context of a 'class' target, a separate
4803 syntax layer ("user space type system") takes care of converting
4804 between global polymorphic consts and internal locale representation.
4805 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4806 "isatool doc classes" provides a tutorial.
4808 * Generic code generator framework allows to generate executable
4809 code for ML and Haskell (including Isabelle classes). A short usage
4812 internal compilation:
4813 export_code <list of constants (term syntax)> in SML
4814 writing SML code to a file:
4815 export_code <list of constants (term syntax)> in SML <filename>
4816 writing OCaml code to a file:
4817 export_code <list of constants (term syntax)> in OCaml <filename>
4818 writing Haskell code to a bunch of files:
4819 export_code <list of constants (term syntax)> in Haskell <filename>
4821 evaluating closed propositions to True/False using code generation:
4824 Reasonable default setup of framework in HOL.
4826 Theorem attributs for selecting and transforming function equations theorems:
4828 [code fun]: select a theorem as function equation for a specific constant
4829 [code fun del]: deselect a theorem as function equation for a specific constant
4830 [code inline]: select an equation theorem for unfolding (inlining) in place
4831 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4833 User-defined serializations (target in {SML, OCaml, Haskell}):
4835 code_const <and-list of constants (term syntax)>
4836 {(target) <and-list of const target syntax>}+
4838 code_type <and-list of type constructors>
4839 {(target) <and-list of type target syntax>}+
4841 code_instance <and-list of instances>
4843 where instance ::= <type constructor> :: <class>
4845 code_class <and_list of classes>
4846 {(target) <and-list of class target syntax>}+
4847 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4849 code_instance and code_class only are effective to target Haskell.
4851 For example usage see src/HOL/ex/Codegenerator.thy and
4852 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4853 generation from Isabelle/HOL theories is available via "isatool doc
4856 * Code generator: consts in 'consts_code' Isar commands are now
4857 referred to by usual term syntax (including optional type
4860 * Command 'no_translations' removes translation rules from theory
4863 * Overloaded definitions are now actually checked for acyclic
4864 dependencies. The overloading scheme is slightly more general than
4865 that of Haskell98, although Isabelle does not demand an exact
4866 correspondence to type class and instance declarations.
4867 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
4868 exotic versions of overloading -- at the discretion of the user!
4870 Polymorphic constants are represented via type arguments, i.e. the
4871 instantiation that matches an instance against the most general
4872 declaration given in the signature. For example, with the declaration
4873 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
4874 as c(nat). Overloading is essentially simultaneous structural
4875 recursion over such type arguments. Incomplete specification patterns
4876 impose global constraints on all occurrences, e.g. c('a * 'a) on the
4877 LHS means that more general c('a * 'b) will be disallowed on any RHS.
4878 Command 'print_theory' outputs the normalized system of recursive
4879 equations, see section "definitions".
4881 * Configuration options are maintained within the theory or proof
4882 context (with name and type bool/int/string), providing a very simple
4883 interface to a poor-man's version of general context data. Tools may
4884 declare options in ML (e.g. using Attrib.config_int) and then refer to
4885 these values using Config.get etc. Users may change options via an
4886 associated attribute of the same name. This form of context
4887 declaration works particularly well with commands 'declare' or
4888 'using', for example ``declare [[foo = 42]]''. Thus it has become
4889 very easy to avoid global references, which would not observe Isar
4890 toplevel undo/redo and fail to work with multithreading.
4892 Various global ML references of Pure and HOL have been turned into
4893 configuration options:
4895 Unify.search_bound unify_search_bound
4896 Unify.trace_bound unify_trace_bound
4897 Unify.trace_simp unify_trace_simp
4898 Unify.trace_types unify_trace_types
4899 Simplifier.simp_depth_limit simp_depth_limit
4900 Blast.depth_limit blast_depth_limit
4901 DatatypeProp.dtK datatype_distinctness_limit
4902 fast_arith_neq_limit fast_arith_neq_limit
4903 fast_arith_split_limit fast_arith_split_limit
4905 * Named collections of theorems may be easily installed as context
4906 data using the functor NamedThmsFun (see also
4907 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
4908 attributes; there is also a toplevel print command. This facility is
4909 just a common case of general context data, which is the preferred way
4910 for anything more complex than just a list of facts in canonical
4913 * Isar: command 'declaration' augments a local theory by generic
4914 declaration functions written in ML. This enables arbitrary content
4915 being added to the context, depending on a morphism that tells the
4916 difference of the original declaration context wrt. the application
4917 context encountered later on.
4919 * Isar: proper interfaces for simplification procedures. Command
4920 'simproc_setup' declares named simprocs (with match patterns, and body
4921 text in ML). Attribute "simproc" adds/deletes simprocs in the current
4922 context. ML antiquotation @{simproc name} retrieves named simprocs.
4924 * Isar: an extra pair of brackets around attribute declarations
4925 abbreviates a theorem reference involving an internal dummy fact,
4926 which will be ignored later --- only the effect of the attribute on
4927 the background context will persist. This form of in-place
4928 declarations is particularly useful with commands like 'declare' and
4929 'using', for example ``have A using [[simproc a]] by simp''.
4931 * Isar: method "assumption" (and implicit closing of subproofs) now
4932 takes simple non-atomic goal assumptions into account: after applying
4933 an assumption as a rule the resulting subgoals are solved by atomic
4934 assumption steps. This is particularly useful to finish 'obtain'
4935 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
4936 without referring to the original premise "!!x. P x ==> thesis" in the
4937 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
4940 * Isar: implicit use of prems from the Isar proof context is
4941 considered a legacy feature. Common applications like ``have A .''
4942 may be replaced by ``have A by fact'' or ``note `A`''. In general,
4943 referencing facts explicitly here improves readability and
4944 maintainability of proof texts.
4946 * Isar: improper proof element 'guess' is like 'obtain', but derives
4947 the obtained context from the course of reasoning! For example:
4949 assume "EX x y. A x & B y" -- "any previous fact"
4950 then guess x and y by clarify
4952 This technique is potentially adventurous, depending on the facts and
4953 proof tools being involved here.
4955 * Isar: known facts from the proof context may be specified as literal
4956 propositions, using ASCII back-quote syntax. This works wherever
4957 named facts used to be allowed so far, in proof commands, proof
4958 methods, attributes etc. Literal facts are retrieved from the context
4959 according to unification of type and term parameters. For example,
4960 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
4961 theorems in the current context, then these are valid literal facts:
4962 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
4964 There is also a proof method "fact" which does the same composition
4965 for explicit goal states, e.g. the following proof texts coincide with
4966 certain special cases of literal facts:
4968 have "A" by fact == note `A`
4969 have "A ==> B" by fact == note `A ==> B`
4970 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
4971 have "P a ==> Q a" by fact == note `P a ==> Q a`
4973 * Isar: ":" (colon) is no longer a symbolic identifier character in
4974 outer syntax. Thus symbolic identifiers may be used without
4975 additional white space in declarations like this: ``assume *: A''.
4977 * Isar: 'print_facts' prints all local facts of the current context,
4978 both named and unnamed ones.
4980 * Isar: 'def' now admits simultaneous definitions, e.g.:
4982 def x == "t" and y == "u"
4984 * Isar: added command 'unfolding', which is structurally similar to
4985 'using', but affects both the goal state and facts by unfolding given
4986 rewrite rules. Thus many occurrences of the 'unfold' method or
4987 'unfolded' attribute may be replaced by first-class proof text.
4989 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
4990 and command 'unfolding' now all support object-level equalities
4991 (potentially conditional). The underlying notion of rewrite rule is
4992 analogous to the 'rule_format' attribute, but *not* that of the
4993 Simplifier (which is usually more generous).
4995 * Isar: the new attribute [rotated n] (default n = 1) rotates the
4996 premises of a theorem by n. Useful in conjunction with drule.
4998 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
4999 method expression within a sandbox consisting of the first N
5000 sub-goals, which need to exist. For example, ``simp_all [3]''
5001 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5002 simplifies all new goals that emerge from applying rule foo to the
5003 originally first one.
5005 * Isar: schematic goals are no longer restricted to higher-order
5006 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5009 * Isar: the conclusion of a long theorem statement is now either
5010 'shows' (a simultaneous conjunction, as before), or 'obtains'
5011 (essentially a disjunction of cases with local parameters and
5012 assumptions). The latter allows to express general elimination rules
5013 adequately; in this notation common elimination rules look like this:
5015 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5017 obtains x where "P x"
5019 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5023 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5029 The subsequent classical rules even refer to the formal "thesis"
5032 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5035 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5036 obtains "thesis ==> something"
5038 The actual proof of an 'obtains' statement is analogous to that of the
5039 Isar proof element 'obtain', only that there may be several cases.
5040 Optional case names may be specified in parentheses; these will be
5041 available both in the present proof and as annotations in the
5042 resulting rule, for later use with the 'cases' method (cf. attribute
5045 * Isar: the assumptions of a long theorem statement are available as
5046 "assms" fact in the proof context. This is more appropriate than the
5047 (historical) "prems", which refers to all assumptions of the current
5048 context, including those from the target locale, proof body etc.
5050 * Isar: 'print_statement' prints theorems from the current theory or
5051 proof context in long statement form, according to the syntax of a
5054 * Isar: 'obtain' takes an optional case name for the local context
5055 introduction rule (default "that").
5057 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5058 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5061 * Pure: syntax "CONST name" produces a fully internalized constant
5062 according to the current context. This is particularly useful for
5063 syntax translations that should refer to internal constant
5064 representations independently of name spaces.
5066 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5067 instead of "FOO ". This allows multiple binder declarations to coexist
5068 in the same context. INCOMPATIBILITY.
5070 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5071 primitive that also works in a locale context (both for constants and
5072 fixed variables). Type declaration and internal syntactic representation
5073 of given constants retrieved from the context. Likewise, the
5074 'no_notation' command allows to remove given syntax annotations from the
5077 * Isar/locales: new derived specification elements 'axiomatization',
5078 'definition', 'abbreviation', which support type-inference, admit
5079 object-level specifications (equality, equivalence). See also the
5080 isar-ref manual. Examples:
5083 eq (infix "===" 50) where
5084 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5086 definition "f x y = x + y + 1"
5087 definition g where "g x = f x x"
5090 neq (infix "=!=" 50) where
5091 "x =!= y == ~ (x === y)"
5093 These specifications may be also used in a locale context. Then the
5094 constants being introduced depend on certain fixed parameters, and the
5095 constant name is qualified by the locale base name. An internal
5096 abbreviation takes care for convenient input and output, making the
5097 parameters implicit and using the original short name. See also
5098 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5099 entities from a monomorphic theory.
5101 Presently, abbreviations are only available 'in' a target locale, but
5102 not inherited by general import expressions. Also note that
5103 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5104 'translations' in common applications. The "no_abbrevs" print mode
5105 prevents folding of abbreviations in term output.
5107 Concrete syntax is attached to specified constants in internal form,
5108 independently of name spaces. The parse tree representation is
5109 slightly different -- use 'notation' instead of raw 'syntax', and
5110 'translations' with explicit "CONST" markup to accommodate this.
5112 * Pure/Isar: unified syntax for new-style specification mechanisms
5113 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5114 full type inference and dummy patterns ("_"). For example:
5116 definition "K x _ = x"
5118 inductive conj for A B
5119 where "A ==> B ==> conj A B"
5121 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5122 the current context. Print mode "no_abbrevs" prevents inversion of
5123 abbreviations on output.
5125 * Isar/locales: improved parameter handling: use of locales "var" and
5126 "struct" no longer necessary; - parameter renamings are no longer
5127 required to be injective. For example, this allows to define
5128 endomorphisms as locale endom = homom mult mult h.
5130 * Isar/locales: changed the way locales with predicates are defined.
5131 Instead of accumulating the specification, the imported expression is
5132 now an interpretation. INCOMPATIBILITY: different normal form of
5133 locale expressions. In particular, in interpretations of locales with
5134 predicates, goals repesenting already interpreted fragments are not
5135 removed automatically. Use methods `intro_locales' and
5136 `unfold_locales'; see below.
5138 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5139 provide backward reasoning on locales predicates. The methods are
5140 aware of interpretations and discharge corresponding goals.
5141 `intro_locales' is less aggressive then `unfold_locales' and does not
5142 unfold predicates to assumptions.
5144 * Isar/locales: the order in which locale fragments are accumulated
5145 has changed. This enables to override declarations from fragments due
5146 to interpretations -- for example, unwanted simp rules.
5148 * Isar/locales: interpretation in theories and proof contexts has been
5149 extended. One may now specify (and prove) equations, which are
5150 unfolded in interpreted theorems. This is useful for replacing
5151 defined concepts (constants depending on locale parameters) by
5152 concepts already existing in the target context. Example:
5154 interpretation partial_order ["op <= :: [int, int] => bool"]
5155 where "partial_order.less (op <=) (x::int) y = (x < y)"
5157 Typically, the constant `partial_order.less' is created by a
5158 definition specification element in the context of locale
5161 * Method "induct": improved internal context management to support
5162 local fixes and defines on-the-fly. Thus explicit meta-level
5163 connectives !! and ==> are rarely required anymore in inductive goals
5164 (using object-logic connectives for this purpose has been long
5165 obsolete anyway). Common proof patterns are explained in
5166 src/HOL/Induct/Common_Patterns.thy, see also
5167 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5170 * Method "induct": improved handling of simultaneous goals. Instead of
5171 introducing object-level conjunction, the statement is now split into
5172 several conclusions, while the corresponding symbolic cases are nested
5173 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5174 see src/HOL/Induct/Common_Patterns.thy, for example.
5176 * Method "induct": mutual induction rules are now specified as a list
5177 of rule sharing the same induction cases. HOL packages usually provide
5178 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5179 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5180 mutual induction rules differently, i.e. like this:
5182 (induct rule: foo_bar.inducts)
5183 (induct set: foo bar)
5184 (induct pred: foo bar)
5185 (induct type: foo bar)
5187 The ML function ProjectRule.projections turns old-style rules into the
5190 * Method "coinduct": dual of induction, see
5191 src/HOL/Library/Coinductive_List.thy for various examples.
5193 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5194 considered a legacy feature.
5196 * Attribute "symmetric" produces result with standardized schematic
5197 variables (index 0). Potential INCOMPATIBILITY.
5199 * Simplifier: by default the simplifier trace only shows top level
5200 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5201 default. Thus there is less danger of being flooded by the trace. The
5202 trace indicates where parts have been suppressed.
5204 * Provers/classical: removed obsolete classical version of elim_format
5205 attribute; classical elim/dest rules are now treated uniformly when
5206 manipulating the claset.
5208 * Provers/classical: stricter checks to ensure that supplied intro,
5209 dest and elim rules are well-formed; dest and elim rules must have at
5212 * Provers/classical: attributes dest/elim/intro take an optional
5213 weight argument for the rule (just as the Pure versions). Weights are
5214 ignored by automated tools, but determine the search order of single
5217 * Syntax: input syntax now supports dummy variable binding "%_. b",
5218 where the body does not mention the bound variable. Note that dummy
5219 patterns implicitly depend on their context of bounds, which makes
5220 "{_. _}" match any set comprehension as expected. Potential
5221 INCOMPATIBILITY -- parse translations need to cope with syntactic
5222 constant "_idtdummy" in the binding position.
5224 * Syntax: removed obsolete syntactic constant "_K" and its associated
5225 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5226 for example "A -> B" => "Pi A (%_. B)".
5228 * Pure: 'class_deps' command visualizes the subclass relation, using
5229 the graph browser tool.
5231 * Pure: 'print_theory' now suppresses certain internal declarations by
5232 default; use '!' option for full details.
5237 * Method "metis" proves goals by applying the Metis general-purpose
5238 resolution prover (see also http://gilith.com/software/metis/).
5239 Examples are in the directory MetisExamples. WARNING: the
5240 Isabelle/HOL-Metis integration does not yet work properly with
5243 * Command 'sledgehammer' invokes external automatic theorem provers as
5244 background processes. It generates calls to the "metis" method if
5245 successful. These can be pasted into the proof. Users do not have to
5246 wait for the automatic provers to return. WARNING: does not really
5247 work with multi-threading.
5249 * New "auto_quickcheck" feature tests outermost goal statements for
5250 potential counter-examples. Controlled by ML references
5251 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5252 5000 milliseconds). Fails silently if statements is outside of
5253 executable fragment, or any other codgenerator problem occurs.
5255 * New constant "undefined" with axiom "undefined x = undefined".
5257 * Added class "HOL.eq", allowing for code generation with polymorphic
5260 * Some renaming of class constants due to canonical name prefixing in
5261 the new 'class' package:
5263 HOL.abs ~> HOL.abs_class.abs
5264 HOL.divide ~> HOL.divide_class.divide
5265 0 ~> HOL.zero_class.zero
5266 1 ~> HOL.one_class.one
5267 op + ~> HOL.plus_class.plus
5268 op - ~> HOL.minus_class.minus
5269 uminus ~> HOL.minus_class.uminus
5270 op * ~> HOL.times_class.times
5271 op < ~> HOL.ord_class.less
5272 op <= > HOL.ord_class.less_eq
5273 Nat.power ~> Power.power_class.power
5274 Nat.size ~> Nat.size_class.size
5275 Numeral.number_of ~> Numeral.number_class.number_of
5276 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5277 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5278 Orderings.min ~> Orderings.ord_class.min
5279 Orderings.max ~> Orderings.ord_class.max
5280 Divides.op div ~> Divides.div_class.div
5281 Divides.op mod ~> Divides.div_class.mod
5282 Divides.op dvd ~> Divides.div_class.dvd
5284 INCOMPATIBILITY. Adaptions may be required in the following cases:
5286 a) User-defined constants using any of the names "plus", "minus",
5287 "times", "less" or "less_eq". The standard syntax translations for
5288 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5291 b) Variables named "plus", "minus", "times", "less", "less_eq"
5292 INCOMPATIBILITY: use more specific names.
5294 c) Permutative equations (e.g. "a + b = b + a")
5295 Since the change of names also changes the order of terms, permutative
5296 rewrite rules may get applied in a different order. Experience shows
5297 that this is rarely the case (only two adaptions in the whole Isabelle
5298 distribution). INCOMPATIBILITY: rewrite proofs
5300 d) ML code directly refering to constant names
5301 This in general only affects hand-written proof tactics, simprocs and
5302 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5303 Consider using @{const_name} antiquotation.
5305 * New class "default" with associated constant "default".
5307 * Function "sgn" is now overloaded and available on int, real, complex
5308 (and other numeric types), using class "sgn". Two possible defs of
5309 sgn are given as equational assumptions in the classes sgn_if and
5310 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5313 * Locale "partial_order" now unified with class "order" (cf. theory
5314 Orderings), added parameter "less". INCOMPATIBILITY.
5316 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5317 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5318 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5320 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5321 changed order of proof goals in instance proofs.
5323 * The transitivity reasoner for partial and linear orders is set up
5324 for classes "order" and "linorder". Instances of the reasoner are available
5325 in all contexts importing or interpreting the corresponding locales.
5326 Method "order" invokes the reasoner separately; the reasoner
5327 is also integrated with the Simplifier as a solver. Diagnostic
5328 command 'print_orders' shows the available instances of the reasoner
5329 in the current context.
5331 * Localized monotonicity predicate in theory "Orderings"; integrated
5332 lemmas max_of_mono and min_of_mono with this predicate.
5335 * Formulation of theorem "dense" changed slightly due to integration
5336 with new class dense_linear_order.
5338 * Uniform lattice theory development in HOL.
5340 constants "meet" and "join" now named "inf" and "sup"
5341 constant "Meet" now named "Inf"
5343 classes "meet_semilorder" and "join_semilorder" now named
5344 "lower_semilattice" and "upper_semilattice"
5345 class "lorder" now named "lattice"
5346 class "comp_lat" now named "complete_lattice"
5348 Instantiation of lattice classes allows explicit definitions
5349 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5351 INCOMPATIBILITY. Theorem renames:
5353 meet_left_le ~> inf_le1
5354 meet_right_le ~> inf_le2
5355 join_left_le ~> sup_ge1
5356 join_right_le ~> sup_ge2
5357 meet_join_le ~> inf_sup_ord
5360 le_meet ~> le_inf_iff
5361 le_join ~> ge_sup_conv
5362 meet_idempotent ~> inf_idem
5363 join_idempotent ~> sup_idem
5364 meet_comm ~> inf_commute
5365 join_comm ~> sup_commute
5366 meet_leI1 ~> le_infI1
5367 meet_leI2 ~> le_infI2
5368 le_joinI1 ~> le_supI1
5369 le_joinI2 ~> le_supI2
5370 meet_assoc ~> inf_assoc
5371 join_assoc ~> sup_assoc
5372 meet_left_comm ~> inf_left_commute
5373 meet_left_idempotent ~> inf_left_idem
5374 join_left_comm ~> sup_left_commute
5375 join_left_idempotent ~> sup_left_idem
5378 le_def_meet ~> le_iff_inf
5379 le_def_join ~> le_iff_sup
5380 join_absorp2 ~> sup_absorb2
5381 join_absorp1 ~> sup_absorb1
5382 meet_absorp1 ~> inf_absorb1
5383 meet_absorp2 ~> inf_absorb2
5384 meet_join_absorp ~> inf_sup_absorb
5385 join_meet_absorp ~> sup_inf_absorb
5386 distrib_join_le ~> distrib_sup_le
5387 distrib_meet_le ~> distrib_inf_le
5389 add_meet_distrib_left ~> add_inf_distrib_left
5390 add_join_distrib_left ~> add_sup_distrib_left
5391 is_join_neg_meet ~> is_join_neg_inf
5392 is_meet_neg_join ~> is_meet_neg_sup
5393 add_meet_distrib_right ~> add_inf_distrib_right
5394 add_join_distrib_right ~> add_sup_distrib_right
5395 add_meet_join_distribs ~> add_sup_inf_distribs
5396 join_eq_neg_meet ~> sup_eq_neg_inf
5397 meet_eq_neg_join ~> inf_eq_neg_sup
5398 add_eq_meet_join ~> add_eq_inf_sup
5399 meet_0_imp_0 ~> inf_0_imp_0
5400 join_0_imp_0 ~> sup_0_imp_0
5401 meet_0_eq_0 ~> inf_0_eq_0
5402 join_0_eq_0 ~> sup_0_eq_0
5403 neg_meet_eq_join ~> neg_inf_eq_sup
5404 neg_join_eq_meet ~> neg_sup_eq_inf
5405 join_eq_if ~> sup_eq_if
5407 mono_meet ~> mono_inf
5408 mono_join ~> mono_sup
5409 meet_bool_eq ~> inf_bool_eq
5410 join_bool_eq ~> sup_bool_eq
5411 meet_fun_eq ~> inf_fun_eq
5412 join_fun_eq ~> sup_fun_eq
5413 meet_set_eq ~> inf_set_eq
5414 join_set_eq ~> sup_set_eq
5415 meet1_iff ~> inf1_iff
5416 meet2_iff ~> inf2_iff
5425 join1_iff ~> sup1_iff
5426 join2_iff ~> sup2_iff
5436 is_meet_Meet ~> is_meet_Inf
5437 Meet_bool_def ~> Inf_bool_def
5438 Meet_fun_def ~> Inf_fun_def
5439 Meet_greatest ~> Inf_greatest
5440 Meet_lower ~> Inf_lower
5441 Meet_set_def ~> Inf_set_def
5444 Sup_bool_eq ~> Sup_bool_def
5445 Sup_fun_eq ~> Sup_fun_def
5446 Sup_set_eq ~> Sup_set_def
5448 listsp_meetI ~> listsp_infI
5449 listsp_meet_eq ~> listsp_inf_eq
5454 * Added syntactic class "size"; overloaded constant "size" now has
5455 type "'a::size ==> bool"
5457 * Internal reorganisation of `size' of datatypes: size theorems
5458 "foo.size" are no longer subsumed by "foo.simps" (but are still
5459 simplification rules by default!); theorems "prod.size" now named
5462 * Class "div" now inherits from class "times" rather than "type".
5465 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5466 Linorder etc. have disappeared; operations defined in terms of
5467 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5469 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5471 * HOL-Word: New extensive library and type for generic, fixed size
5472 machine words, with arithmetic, bit-wise, shifting and rotating
5473 operations, reflection into int, nat, and bool lists, automation for
5474 linear arithmetic (by automatic reflection into nat or int), including
5475 lemmas on overflow and monotonicity. Instantiated to all appropriate
5476 arithmetic type classes, supporting automatic simplification of
5477 numerals on all operations.
5479 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5481 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5483 * Code generator library theories:
5484 - Code_Integer represents HOL integers by big integer literals in target
5486 - Code_Char represents HOL characters by character literals in target
5488 - Code_Char_chr like Code_Char, but also offers treatment of character
5489 codes; includes Code_Integer.
5490 - Executable_Set allows to generate code for finite sets using lists.
5491 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5493 - Executable_Real implements a subset of real numbers, namly those
5494 representable by rational numbers.
5495 - Efficient_Nat implements natural numbers by integers, which in general will
5496 result in higher efficency; pattern matching with 0/Suc is eliminated;
5497 includes Code_Integer.
5498 - Code_Index provides an additional datatype index which is mapped to
5499 target-language built-in integers.
5500 - Code_Message provides an additional datatype message_string which is isomorphic to
5501 strings; messages are mapped to target-language strings.
5503 * New package for inductive predicates
5505 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5508 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5509 for z_1 :: U_1 and ... and z_n :: U_m
5511 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5514 with full support for type-inference, rather than
5516 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5518 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5519 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5521 inductive "s z_1 ... z_m"
5523 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5526 For backward compatibility, there is a wrapper allowing inductive
5527 sets to be defined with the new package via
5530 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5531 for z_1 :: U_1 and ... and z_n :: U_m
5533 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5539 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5540 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5541 for z_1 :: U_1 and ... and z_n :: U_m
5543 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5544 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5547 if the additional syntax "p ..." is required.
5549 Numerous examples can be found in the subdirectories src/HOL/Auth,
5550 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5554 - Since declaration and definition of inductive sets or predicates
5555 is no longer separated, abbreviations involving the newly
5556 introduced sets or predicates must be specified together with the
5557 introduction rules after the 'where' keyword (see above), rather
5558 than before the actual inductive definition.
5560 - The variables in induction and elimination rules are now
5561 quantified in the order of their occurrence in the introduction
5562 rules, rather than in alphabetical order. Since this may break
5563 some proofs, these proofs either have to be repaired, e.g. by
5564 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5565 statements of the form
5567 case (rule_i a_i_1 ... a_i_{k_i})
5569 or the old order of quantification has to be restored by explicitly adding
5570 meta-level quantifiers in the introduction rules, i.e.
5572 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5574 - The format of the elimination rules is now
5576 p z_1 ... z_m x_1 ... x_n ==>
5577 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5582 (x_1, ..., x_n) : s z_1 ... z_m ==>
5583 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5586 for sets rather than
5588 x : s z_1 ... z_m ==>
5589 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5592 This may require terms in goals to be expanded to n-tuples
5593 (e.g. using case_tac or simplification with the split_paired_all
5594 rule) before the above elimination rule is applicable.
5596 - The elimination or case analysis rules for (mutually) inductive
5597 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5598 list of rules "p_1_..._p_k.elims" is no longer available.
5600 * New package "function"/"fun" for general recursive functions,
5601 supporting mutual and nested recursion, definitions in local contexts,
5602 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5603 for small examples, and the separate tutorial on the function
5604 package. The old recdef "package" is still available as before, but
5605 users are encouraged to use the new package.
5607 * Method "lexicographic_order" automatically synthesizes termination
5608 relations as lexicographic combinations of size measures.
5610 * Case-expressions allow arbitrary constructor-patterns (including
5611 "_") and take their order into account, like in functional
5612 programming. Internally, this is translated into nested
5613 case-expressions; missing cases are added and mapped to the predefined
5614 constant "undefined". In complicated cases printing may no longer show
5615 the original input but the internal form. Lambda-abstractions allow
5616 the same form of pattern matching: "% pat1 => e1 | ..." is an
5617 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5620 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5621 is an abbreviation for "of_nat :: nat => int". The simplification
5622 rules for "of_nat" have been changed to work like "int" did
5623 previously. Potential INCOMPATIBILITY:
5624 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5625 - of_nat_diff and of_nat_mult are no longer default simp rules
5627 * Method "algebra" solves polynomial equations over (semi)rings using
5628 Groebner bases. The (semi)ring structure is defined by locales and the
5629 tool setup depends on that generic context. Installing the method for
5630 a specific type involves instantiating the locale and possibly adding
5631 declarations for computation on the coefficients. The method is
5632 already instantiated for natural numbers and for the axiomatic class
5633 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5634 CALCULEMUS 2007 for the general principles underlying this
5635 architecture of context-aware proof-tools.
5637 * Method "ferrack" implements quantifier elimination over
5638 special-purpose dense linear orders using locales (analogous to
5639 "algebra"). The method is already installed for class
5640 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5643 * Former constant "List.op @" now named "List.append". Use ML
5644 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5645 circumvent possible incompatibilities when working on ML level.
5647 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5649 * New function listsum :: 'a list => 'a for arbitrary monoids.
5650 Special syntax: "SUM x <- xs. f x" (and latex variants)
5652 * New syntax for Haskell-like list comprehension (input only), eg.
5653 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5655 * The special syntax for function "filter" has changed from [x :
5656 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5657 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5659 * [a..b] is now defined for arbitrary linear orders. It used to be
5660 defined on nat only, as an abbreviation for [a..<Suc b]
5663 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5665 * New functions "sorted" and "sort" in src/HOL/List.thy.
5667 * New lemma collection field_simps (an extension of ring_simps) for
5668 manipulating (in)equations involving division. Multiplies with all
5669 denominators that can be proved to be non-zero (in equations) or
5670 positive/negative (in inequations).
5672 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5673 have been improved and renamed to ring_simps, group_simps and
5674 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5675 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5677 * Theory Library/Commutative_Ring: switched from recdef to function
5678 package; constants add, mul, pow now curried. Infix syntax for
5679 algebraic operations.
5681 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5684 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5687 * HOL/records: generalised field-update to take a function on the
5688 field rather than the new value: r(|A := x|) is translated to A_update
5689 (K x) r The K-combinator that is internally used is called K_record.
5690 INCOMPATIBILITY: Usage of the plain update functions has to be
5693 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5694 * x = 0, which are required for a semiring. Richer structures do not
5695 inherit from semiring_0 anymore, because this property is a theorem
5696 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5697 there is more to prove, but this is mostly trivial.
5699 * Class "recpower" is generalized to arbitrary monoids, not just
5700 commutative semirings. INCOMPATIBILITY: may need to incorporate
5701 commutativity or semiring properties additionally.
5703 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5704 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5705 better use 'abbreviation'.
5707 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5709 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5710 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5711 significant changes for setting up numeral syntax for types:
5712 - New constants Numeral.pred and Numeral.succ instead
5713 of former Numeral.bin_pred and Numeral.bin_succ.
5714 - Use integer operations instead of bin_add, bin_mult and so on.
5715 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5716 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5718 See src/HOL/Integ/IntArith.thy for an example setup.
5720 * Command 'normal_form' computes the normal form of a term that may
5721 contain free variables. For example ``normal_form "rev [a, b, c]"''
5722 produces ``[b, c, a]'' (without proof). This command is suitable for
5723 heavy-duty computations because the functions are compiled to ML
5724 first. Correspondingly, a method "normalization" is provided. See
5725 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5727 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5728 25 like -->); output depends on the "iff" print_mode, the default is
5729 "A = B" (with priority 50).
5731 * Relations less (<) and less_eq (<=) are also available on type bool.
5732 Modified syntax to disallow nesting without explicit parentheses,
5733 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5736 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5738 * Relation composition operator "op O" now has precedence 75 and binds
5739 stronger than union and intersection. INCOMPATIBILITY.
5741 * The old set interval syntax "{m..n(}" (and relatives) has been
5742 removed. Use "{m..<n}" (and relatives) instead.
5744 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5745 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5746 ``declare [[simproc del: neq]]''.
5748 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5751 * Theorem Cons_eq_map_conv no longer declared as "simp".
5753 * Theorem setsum_mult renamed to setsum_right_distrib.
5755 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5758 * Reimplemented methods "sat" and "satx", with several improvements:
5759 goals no longer need to be stated as "<prems> ==> False", equivalences
5760 (i.e. "=" on type bool) are handled, variable names of the form
5761 "lit_<n>" are no longer reserved, significant speedup.
5763 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5764 zChaff is still supported as well.
5766 * 'inductive' and 'datatype': provide projections of mutual rules,
5767 bundled as foo_bar.inducts;
5769 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5772 * Library: moved theory Accessible_Part to main HOL.
5774 * Library: added theory Coinductive_List of potentially infinite lists
5775 as greatest fixed-point.
5777 * Library: added theory AssocList which implements (finite) maps as
5780 * Method "evaluation" solves goals (i.e. a boolean expression)
5781 efficiently by compiling it to ML. The goal is "proved" (via an
5782 oracle) if it evaluates to True.
5784 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5785 also when invoked by the simplifier. This results in the Simplifier
5786 being more powerful on arithmetic goals. INCOMPATIBILITY.
5787 Configuration option fast_arith_split_limit=0 recovers the old
5790 * Support for hex (0x20) and binary (0b1001) numerals.
5792 * New method: reify eqs (t), where eqs are equations for an
5793 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5794 parameter, computes a term s::'b and a list xs::'a list and proves the
5795 theorem I xs s = t. This is also known as reification or quoting. The
5796 resulting theorem is applied to the subgoal to substitute t with I xs
5797 s. If t is omitted, the subgoal itself is reified.
5799 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5800 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5801 where f is supposed to be a computable function (in the sense of code
5802 generattion). The method uses reify to compute s and xs as above then
5803 applies corr_thm and uses normalization by evaluation to "prove" f s =
5804 r and finally gets the theorem t = r, which is again applied to the
5805 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5807 * Reflection: Automatic reification now handels binding, an example is
5808 available in src/HOL/ex/ReflectionEx.thy
5810 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5811 command 'statespace' that is similar to 'record', but introduces an
5812 abstract specification based on the locale infrastructure instead of
5813 HOL types. This leads to extra flexibility in composing state spaces,
5814 in particular multiple inheritance and renaming of components.
5819 * Hyperreal: Functions root and sqrt are now defined on negative real
5820 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5821 Nonnegativity side conditions have been removed from many lemmas, so
5822 that more subgoals may now be solved by simplification; potential
5825 * Real: new type classes formalize real normed vector spaces and
5826 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5827 and norm :: 'a => real.
5829 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5830 reals into other types. The overloaded constant Reals :: 'a set is now
5831 defined as range of_real; potential INCOMPATIBILITY.
5833 * Real: proper support for ML code generation, including 'quickcheck'.
5834 Reals are implemented as arbitrary precision rationals.
5836 * Hyperreal: Several constants that previously worked only for the
5837 reals have been generalized, so they now work over arbitrary vector
5838 spaces. Type annotations may need to be added in some cases; potential
5841 Infinitesimal :: ('a::real_normed_vector) star set
5842 HFinite :: ('a::real_normed_vector) star set
5843 HInfinite :: ('a::real_normed_vector) star set
5844 approx :: ('a::real_normed_vector) star => 'a star => bool
5845 monad :: ('a::real_normed_vector) star => 'a star set
5846 galaxy :: ('a::real_normed_vector) star => 'a star set
5847 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5848 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5849 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5850 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5851 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5852 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5853 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
5854 sgn :: 'a::real_normed_vector => 'a
5855 exp :: 'a::{recpower,real_normed_field,banach} => 'a
5857 * Complex: Some complex-specific constants are now abbreviations for
5858 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
5859 hnorm. Other constants have been entirely removed in favor of the
5860 polymorphic versions (INCOMPATIBILITY):
5864 HInfinite <-- CInfinite
5865 Infinitesimal <-- CInfinitesimal
5868 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
5869 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
5870 (ns)deriv <-- (ns)cderiv
5875 * Formalisation of ideals and the quotient construction over rings.
5877 * Order and lattice theory no longer based on records.
5880 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
5881 greatest_closed. INCOMPATIBILITY.
5883 * Method algebra is now set up via an attribute. For examples see
5884 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
5885 of algebraic structures.
5887 * Renamed theory CRing to Ring.
5892 * Substantial, yet incomplete support for nominal datatypes (binding
5893 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
5894 src/HOL/Nominal/Examples. Prospective users should consult
5895 http://isabelle.in.tum.de/nominal/
5900 * ML basics: just one true type int, which coincides with IntInf.int
5903 * ML within Isar: antiquotations allow to embed statically-checked
5904 formal entities in the source, referring to the context available at
5905 compile-time. For example:
5907 ML {* @{sort "{zero,one}"} *}
5908 ML {* @{typ "'a => 'b"} *}
5909 ML {* @{term "%x. x"} *}
5910 ML {* @{prop "x == y"} *}
5911 ML {* @{ctyp "'a => 'b"} *}
5912 ML {* @{cterm "%x. x"} *}
5913 ML {* @{cprop "x == y"} *}
5914 ML {* @{thm asm_rl} *}
5915 ML {* @{thms asm_rl} *}
5916 ML {* @{type_name c} *}
5917 ML {* @{type_syntax c} *}
5918 ML {* @{const_name c} *}
5919 ML {* @{const_syntax c} *}
5922 ML {* @{theory Pure} *}
5923 ML {* @{theory_ref} *}
5924 ML {* @{theory_ref Pure} *}
5927 ML {* @{clasimpset} *}
5929 The same works for sources being ``used'' within an Isar context.
5931 * ML in Isar: improved error reporting; extra verbosity with
5932 ML_Context.trace enabled.
5934 * Pure/General/table.ML: the join operations now works via exceptions
5935 DUP/SAME instead of type option. This is simpler in simple cases, and
5936 admits slightly more efficient complex applications.
5938 * Pure: 'advanced' translation functions (parse_translation etc.) now
5939 use Context.generic instead of just theory.
5941 * Pure: datatype Context.generic joins theory/Proof.context and
5942 provides some facilities for code that works in either kind of
5943 context, notably GenericDataFun for uniform theory and proof data.
5945 * Pure: simplified internal attribute type, which is now always
5946 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
5947 local (Proof.context) attributes have been discontinued, while
5948 minimizing code duplication. Thm.rule_attribute and
5949 Thm.declaration_attribute build canonical attributes; see also structure
5950 Context for further operations on Context.generic, notably
5951 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
5952 declarations and definitions.
5954 * Context data interfaces (Theory/Proof/GenericDataFun): removed
5955 name/print, uninitialized data defaults to ad-hoc copy of empty value,
5956 init only required for impure data. INCOMPATIBILITY: empty really need
5957 to be empty (no dependencies on theory content!)
5959 * Pure/kernel: consts certification ignores sort constraints given in
5960 signature declarations. (This information is not relevant to the
5961 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
5962 potential INCOMPATIBILITY.
5964 * Pure: axiomatic type classes are now purely definitional, with
5965 explicit proofs of class axioms and super class relations performed
5966 internally. See Pure/axclass.ML for the main internal interfaces --
5967 notably AxClass.define_class supercedes AxClass.add_axclass, and
5968 AxClass.axiomatize_class/classrel/arity supersede
5969 Sign.add_classes/classrel/arities.
5971 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
5972 global/local versions on theory vs. Proof.context have been
5973 discontinued; Attrib.syntax and Method.syntax have been adapted
5974 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
5975 attributes, methods, etc.
5977 * Pure: several functions of signature "... -> theory -> theory * ..."
5978 have been reoriented to "... -> theory -> ... * theory" in order to
5979 allow natural usage in combination with the ||>, ||>>, |-> and
5980 fold_map combinators.
5982 * Pure: official theorem names (closed derivations) and additional
5983 comments (tags) are now strictly separate. Name hints -- which are
5984 maintained as tags -- may be attached any time without affecting the
5987 * Pure: primitive rule lift_rule now takes goal cterm instead of an
5988 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
5989 achieve the old behaviour.
5991 * Pure: the "Goal" constant is now called "prop", supporting a
5992 slightly more general idea of ``protecting'' meta-level rule
5995 * Pure: Logic.(un)varify only works in a global context, which is now
5996 enforced instead of silently assumed. INCOMPATIBILITY, may use
5997 Logic.legacy_(un)varify as temporary workaround.
5999 * Pure: structure Name provides scalable operations for generating
6000 internal variable names, notably Name.variants etc. This replaces
6001 some popular functions from term.ML:
6003 Term.variant -> Name.variant
6004 Term.variantlist -> Name.variant_list
6005 Term.invent_names -> Name.invent_list
6007 Note that low-level renaming rarely occurs in new code -- operations
6008 from structure Variable are used instead (see below).
6010 * Pure: structure Variable provides fundamental operations for proper
6011 treatment of fixed/schematic variables in a context. For example,
6012 Variable.import introduces fixes for schematics of given facts and
6013 Variable.export reverses the effect (up to renaming) -- this replaces
6014 various freeze_thaw operations.
6016 * Pure: structure Goal provides simple interfaces for
6017 init/conclude/finish and tactical prove operations (replacing former
6018 Tactic.prove). Goal.prove is the canonical way to prove results
6019 within a given context; Goal.prove_global is a degraded version for
6020 theory level goals, including a global Drule.standard. Note that
6021 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6022 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6023 in a locale context).
6025 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6026 and type checking (Syntax.check_term etc.), with common combinations
6027 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6028 which are considered legacy and await removal.
6030 * Pure/Syntax: generic interfaces for type unchecking
6031 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6032 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6033 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6034 available for convenience, but refer to the very same operations using
6035 a mere theory instead of a full context.
6037 * Isar: simplified treatment of user-level errors, using exception
6038 ERROR of string uniformly. Function error now merely raises ERROR,
6039 without any side effect on output channels. The Isar toplevel takes
6040 care of proper display of ERROR exceptions. ML code may use plain
6041 handle/can/try; cat_error may be used to concatenate errors like this:
6043 ... handle ERROR msg => cat_error msg "..."
6045 Toplevel ML code (run directly or through the Isar toplevel) may be
6046 embedded into the Isar toplevel with exception display/debug like
6049 Isar.toplevel (fn () => ...)
6051 INCOMPATIBILITY, removed special transform_error facilities, removed
6052 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6053 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6054 -- use plain ERROR instead.
6056 * Isar: theory setup now has type (theory -> theory), instead of a
6057 list. INCOMPATIBILITY, may use #> to compose setup functions.
6059 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6060 ProofContext.debug/verbose flags.
6062 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6063 theory before entering a proof state. Transactions now always see a
6064 quasi-functional intermediate checkpoint, both in interactive and
6067 * Isar: simplified interfaces for outer syntax. Renamed
6068 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6069 OuterSyntax.add_parsers -- this functionality is now included in
6070 OuterSyntax.command etc. INCOMPATIBILITY.
6072 * Simplifier: the simpset of a running simplification process now
6073 contains a proof context (cf. Simplifier.the_context), which is the
6074 very context that the initial simpset has been retrieved from (by
6075 simpset_of/local_simpset_of). Consequently, all plug-in components
6076 (solver, looper etc.) may depend on arbitrary proof data.
6078 * Simplifier.inherit_context inherits the proof context (plus the
6079 local bounds) of the current simplification process; any simproc
6080 etc. that calls the Simplifier recursively should do this! Removed
6081 former Simplifier.inherit_bounds, which is already included here --
6082 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6083 specify an explicit context using Simplifier.context/theory_context.
6085 * Simplifier/Classical Reasoner: more abstract interfaces
6086 change_simpset/claset for modifying the simpset/claset reference of a
6087 theory; raw versions simpset/claset_ref etc. have been discontinued --
6090 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6096 * settings: the default heap location within ISABELLE_HOME_USER now
6097 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6098 Isabelle installations.
6100 * isabelle-process: option -S (secure mode) disables some critical
6101 operations, notably runtime compilation and evaluation of ML source
6104 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6106 * Support for parallel execution, using native multicore support of
6107 Poly/ML 5.1. The theory loader exploits parallelism when processing
6108 independent theories, according to the given theory header
6109 specifications. The maximum number of worker threads is specified via
6110 usedir option -M or the "max-threads" setting in Proof General. A
6111 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6112 to 6 on a 8-core machine. User-code needs to observe certain
6113 guidelines for thread-safe programming, see appendix A in the Isar
6114 Implementation manual.
6118 New in Isabelle2005 (October 2005)
6119 ----------------------------------
6123 * Theory headers: the new header syntax for Isar theories is
6126 imports <theory1> ... <theoryN>
6127 uses <file1> ... <fileM>
6130 where the 'uses' part is optional. The previous syntax
6132 theory <name> = <theory1> + ... + <theoryN>:
6134 will disappear in the next release. Use isatool fixheaders to convert
6135 existing theory files. Note that there is no change in ancient
6136 non-Isar theories now, but these will disappear soon.
6138 * Theory loader: parent theories can now also be referred to via
6139 relative and absolute paths.
6141 * Command 'find_theorems' searches for a list of criteria instead of a
6142 list of constants. Known criteria are: intro, elim, dest, name:string,
6143 simp:term, and any term. Criteria can be preceded by '-' to select
6144 theorems that do not match. Intro, elim, dest select theorems that
6145 match the current goal, name:s selects theorems whose fully qualified
6146 name contain s, and simp:term selects all simplification rules whose
6147 lhs match term. Any other term is interpreted as pattern and selects
6148 all theorems matching the pattern. Available in ProofGeneral under
6149 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6151 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6153 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6154 matching the current goal as introduction rule and not having "HOL."
6155 in their name (i.e. not being defined in theory HOL).
6157 * Command 'thms_containing' has been discontinued in favour of
6158 'find_theorems'; INCOMPATIBILITY.
6160 * Communication with Proof General is now 8bit clean, which means that
6161 Unicode text in UTF-8 encoding may be used within theory texts (both
6162 formal and informal parts). Cf. option -U of the Isabelle Proof
6163 General interface. Here are some simple examples (cf. src/HOL/ex):
6165 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6166 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6168 * Improved efficiency of the Simplifier and, to a lesser degree, the
6169 Classical Reasoner. Typical big applications run around 2 times
6173 *** Document preparation ***
6175 * Commands 'display_drafts' and 'print_drafts' perform simple output
6176 of raw sources. Only those symbols that do not require additional
6177 LaTeX packages (depending on comments in isabellesym.sty) are
6178 displayed properly, everything else is left verbatim. isatool display
6179 and isatool print are used as front ends (these are subject to the
6180 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6182 * Command tags control specific markup of certain regions of text,
6183 notably folding and hiding. Predefined tags include "theory" (for
6184 theory begin and end), "proof" for proof commands, and "ML" for
6185 commands involving ML code; the additional tags "visible" and
6186 "invisible" are unused by default. Users may give explicit tag
6187 specifications in the text, e.g. ''by %invisible (auto)''. The
6188 interpretation of tags is determined by the LaTeX job during document
6189 preparation: see option -V of isatool usedir, or options -n and -t of
6190 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6193 Several document versions may be produced at the same time via isatool
6194 usedir (the generated index.html will link all of them). Typical
6195 specifications include ''-V document=theory,proof,ML'' to present
6196 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6197 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6198 these parts without any formal replacement text. The Isabelle site
6199 default settings produce ''document'' and ''outline'' versions as
6202 * Several new antiquotations:
6204 @{term_type term} prints a term with its type annotated;
6206 @{typeof term} prints the type of a term;
6208 @{const const} is the same as @{term const}, but checks that the
6209 argument is a known logical constant;
6211 @{term_style style term} and @{thm_style style thm} print a term or
6212 theorem applying a "style" to it
6216 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6217 definitions, equations, inequations etc., 'concl' printing only the
6218 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6219 to print the specified premise. TermStyle.add_style provides an ML
6220 interface for introducing further styles. See also the "LaTeX Sugar"
6221 document practical applications. The ML antiquotation prints
6222 type-checked ML expressions verbatim.
6224 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6225 and 'text' support optional locale specification '(in loc)', which
6226 specifies the default context for interpreting antiquotations. For
6227 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6229 * Option 'locale=NAME' of antiquotations specifies an alternative
6230 context interpreting the subsequent argument. For example: @{thm
6231 [locale=lattice] inf_assoc}.
6233 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6236 * Proper output of antiquotations for theory commands involving a
6237 proof context (such as 'locale' or 'theorem (in loc) ...').
6239 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6240 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6242 * isatool usedir: new option -C (default true) controls whether option
6243 -D should include a copy of the original document directory; -C false
6244 prevents unwanted effects such as copying of administrative CVS data.
6249 * Considerably improved version of 'constdefs' command. Now performs
6250 automatic type-inference of declared constants; additional support for
6251 local structure declarations (cf. locales and HOL records), see also
6252 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6253 sequential dependencies of definitions within a single 'constdefs'
6254 section; moreover, the declared name needs to be an identifier. If
6255 all fails, consider to fall back on 'consts' and 'defs' separately.
6257 * Improved indexed syntax and implicit structures. First of all,
6258 indexed syntax provides a notational device for subscripted
6259 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6260 expressions. Secondly, in a local context with structure
6261 declarations, number indexes \<^sub>n or the empty index (default
6262 number 1) refer to a certain fixed variable implicitly; option
6263 show_structs controls printing of implicit structures. Typical
6264 applications of these concepts involve record types and locales.
6266 * New command 'no_syntax' removes grammar declarations (and
6267 translations) resulting from the given syntax specification, which is
6268 interpreted in the same manner as for the 'syntax' command.
6270 * 'Advanced' translation functions (parse_translation etc.) may depend
6271 on the signature of the theory context being presently used for
6272 parsing/printing, see also isar-ref manual.
6274 * Improved 'oracle' command provides a type-safe interface to turn an
6275 ML expression of type theory -> T -> term into a primitive rule of
6276 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6277 is already included here); see also FOL/ex/IffExample.thy;
6280 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6281 before); "cI" is no longer bound, use "c.intro" instead.
6282 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6283 axclasses vs. locales.
6285 * Improved internal renaming of symbolic identifiers -- attach primes
6286 instead of base 26 numbers.
6288 * New flag show_question_marks controls printing of leading question
6289 marks in schematic variable names.
6291 * In schematic variable names, *any* symbol following \<^isub> or
6292 \<^isup> is now treated as part of the base name. For example, the
6293 following works without printing of awkward ".0" indexes:
6295 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6298 * Inner syntax includes (*(*nested*) comments*).
6300 * Pretty printer now supports unbreakable blocks, specified in mixfix
6301 annotations as "(00...)".
6303 * Clear separation of logical types and nonterminals, where the latter
6304 may only occur in 'syntax' specifications or type abbreviations.
6305 Before that distinction was only partially implemented via type class
6306 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6307 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6308 exotic syntax specifications may require further adaption
6309 (e.g. Cube/Cube.thy).
6311 * Removed obsolete type class "logic", use the top sort {} instead.
6312 Note that non-logical types should be declared as 'nonterminals'
6313 rather than 'types'. INCOMPATIBILITY for new object-logic
6316 * Attributes 'induct' and 'cases': type or set names may now be
6317 locally fixed variables as well.
6319 * Simplifier: can now control the depth to which conditional rewriting
6320 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6323 * Simplifier: simplification procedures may now take the current
6324 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6325 interface), which is very useful for calling the Simplifier
6326 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6327 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6328 low-level mk_simproc no longer applies Logic.varify internally, to
6329 allow for use in a context of fixed variables.
6331 * thin_tac now works even if the assumption being deleted contains !!
6332 or ==>. More generally, erule now works even if the major premise of
6333 the elimination rule contains !! or ==>.
6335 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6337 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6338 from Pure, which contains all common declarations already. Both
6339 theories are defined via plain Isabelle/Isar .thy files.
6340 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6341 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6342 use isatool fixcpure to adapt your theory and ML sources.
6344 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6345 selections of theorems in named facts via index ranges.
6347 * 'print_theorems': in theory mode, really print the difference
6348 wrt. the last state (works for interactive theory development only),
6349 in proof mode print all local facts (cf. 'print_facts');
6351 * 'hide': option '(open)' hides only base names.
6353 * More efficient treatment of intermediate checkpoints in interactive
6356 * Code generator is now invoked via code_module (incremental code
6357 generation) and code_library (modular code generation, ML structures
6358 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6359 must be quoted when used as identifiers.
6361 * New 'value' command for reading, evaluating and printing terms using
6362 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6363 quoted when used as identifier.
6368 * New commands for the interpretation of locale expressions in
6369 theories (1), locales (2) and proof contexts (3). These generate
6370 proof obligations from the expression specification. After the
6371 obligations have been discharged, theorems of the expression are added
6372 to the theory, target locale or proof context. The synopsis of the
6373 commands is a follows:
6375 (1) interpretation expr inst
6376 (2) interpretation target < expr
6377 (3) interpret expr inst
6379 Interpretation in theories and proof contexts require a parameter
6380 instantiation of terms from the current context. This is applied to
6381 specifications and theorems of the interpreted expression.
6382 Interpretation in locales only permits parameter renaming through the
6383 locale expression. Interpretation is smart in that interpretations
6384 that are active already do not occur in proof obligations, neither are
6385 instantiated theorems stored in duplicate. Use 'print_interps' to
6386 inspect active interpretations of a particular locale. For details,
6387 see the Isar Reference manual. Examples can be found in
6388 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6390 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6391 'interpret' instead.
6393 * New context element 'constrains' for adding type constraints to
6396 * Context expressions: renaming of parameters with syntax
6399 * Locale declaration: 'includes' disallowed.
6401 * Proper static binding of attribute syntax -- i.e. types / terms /
6402 facts mentioned as arguments are always those of the locale definition
6403 context, independently of the context of later invocations. Moreover,
6404 locale operations (renaming and type / term instantiation) are applied
6405 to attribute arguments as expected.
6407 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6408 actual attributes; rare situations may require Attrib.attribute to
6409 embed those attributes into Attrib.src that lack concrete syntax.
6410 Attribute implementations need to cooperate properly with the static
6411 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6412 Attrib.XXX_thm etc. already do the right thing without further
6413 intervention. Only unusual applications -- such as "where" or "of"
6414 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6415 on the context and the facts involved -- may have to assign parsed
6416 values to argument tokens explicitly.
6418 * Changed parameter management in theorem generation for long goal
6419 statements with 'includes'. INCOMPATIBILITY: produces a different
6420 theorem statement in rare situations.
6422 * Locale inspection command 'print_locale' omits notes elements. Use
6423 'print_locale!' to have them included in the output.
6428 * Provers/hypsubst.ML: improved version of the subst method, for
6429 single-step rewriting: it now works in bound variable contexts. New is
6430 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6431 rewrite a different subterm than the original subst method, which is
6432 still available as 'simplesubst'.
6434 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6437 * Provers/trancl.ML: new transitivity reasoner for transitive and
6438 reflexive-transitive closure of relations.
6440 * Provers/blast.ML: new reference depth_limit to make blast's depth
6441 limit (previously hard-coded with a value of 20) user-definable.
6443 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6444 is peformed already. Object-logics merely need to finish their
6445 initial simpset configuration as before. INCOMPATIBILITY.
6450 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6453 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6455 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6456 and x-symbol; use option '-m epsilon' to get it actually printed.
6457 Moreover, the mathematically important symbolic identifier \<epsilon>
6458 becomes available as variable, constant etc. INCOMPATIBILITY,
6460 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6461 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6462 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6463 support corresponding Isar calculations.
6465 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6468 * theory SetInterval: changed the syntax for open intervals:
6477 The old syntax is still supported but will disappear in the next
6478 release. For conversion use the following Emacs search and replace
6479 patterns (these are not perfect but work quite well):
6481 {)\([^\.]*\)\.\. -> {\1<\.\.}
6482 \.\.\([^(}]*\)(} -> \.\.<\1}
6484 * Theory Commutative_Ring (in Library): method comm_ring for proving
6485 equalities in commutative rings; method 'algebra' provides a generic
6488 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6489 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6490 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6493 Some new syntax forms are available:
6495 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6496 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6497 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6498 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6500 The latter form "\<Sum>x < k. e" used to be based on a separate
6501 function "Summation", which has been discontinued.
6503 * theory Finite_Set: in structured induction proofs, the insert case
6504 is now 'case (insert x F)' instead of the old counterintuitive 'case
6507 * The 'refute' command has been extended to support a much larger
6508 fragment of HOL, including axiomatic type classes, constdefs and
6509 typedefs, inductive datatypes and recursion.
6511 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6512 Requires zChaff with proof generation to be installed. See
6513 HOL/ex/SAT_Examples.thy for examples.
6515 * Datatype induction via method 'induct' now preserves the name of the
6516 induction variable. For example, when proving P(xs::'a list) by
6517 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6518 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6519 in unstructured proof scripts.
6521 * Reworked implementation of records. Improved scalability for
6522 records with many fields, avoiding performance problems for type
6523 inference. Records are no longer composed of nested field types, but
6524 of nested extension types. Therefore the record type only grows linear
6525 in the number of extensions and not in the number of fields. The
6526 top-level (users) view on records is preserved. Potential
6527 INCOMPATIBILITY only in strange cases, where the theory depends on the
6528 old record representation. The type generated for a record is called
6529 <record_name>_ext_type.
6531 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6532 proofs triggered by a record definition or a simproc (if
6533 quick_and_dirty is enabled). Definitions of large records can take
6536 New simproc record_upd_simproc for simplification of multiple record
6537 updates enabled by default. Moreover, trivial updates are also
6538 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6539 occasionally, since simplification is more powerful by default.
6541 * typedef: proper support for polymorphic sets, which contain extra
6542 type-variables in the term.
6544 * Simplifier: automatically reasons about transitivity chains
6545 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6546 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6547 old proofs break occasionally as simplification may now solve more
6548 goals than previously.
6550 * Simplifier: converts x <= y into x = y if assumption y <= x is
6551 present. Works for all partial orders (class "order"), in particular
6552 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6555 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6556 bound variable or a constant then the let is unfolded. Otherwise
6557 first a is simplified to b, and then f b is simplified to g. If
6558 possible we abstract b from g arriving at "let x = b in h x",
6559 otherwise we unfold the let and arrive at g. The simproc can be
6560 enabled/disabled by the reference use_let_simproc. Potential
6561 INCOMPATIBILITY since simplification is more powerful by default.
6563 * Classical reasoning: the meson method now accepts theorems as arguments.
6565 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6566 jobs to provide advice on the provability of subgoals.
6568 * Theory OrderedGroup and Ring_and_Field: various additions and
6569 improvements to faciliate calculations involving equalities and
6572 The following theorems have been eliminated or modified
6575 abs_eq now named abs_of_nonneg
6576 abs_of_ge_0 now named abs_of_nonneg
6577 abs_minus_eq now named abs_of_nonpos
6578 imp_abs_id now named abs_of_nonneg
6579 imp_abs_neg_id now named abs_of_nonpos
6580 mult_pos now named mult_pos_pos
6581 mult_pos_le now named mult_nonneg_nonneg
6582 mult_pos_neg_le now named mult_nonneg_nonpos
6583 mult_pos_neg2_le now named mult_nonneg_nonpos2
6584 mult_neg now named mult_neg_neg
6585 mult_neg_le now named mult_nonpos_nonpos
6587 * The following lemmas in Ring_and_Field have been added to the simplifier:
6590 not_square_less_zero
6592 The following lemmas have been deleted from Real/RealPow:
6602 * Theory Parity: added rules for simplifying exponents.
6606 The following theorems have been eliminated or modified
6609 list_all_Nil now named list_all.simps(1)
6610 list_all_Cons now named list_all.simps(2)
6611 list_all_conv now named list_all_iff
6612 set_mem_eq now named mem_iff
6614 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6615 asymptotic "big O" calculations. See the notes in BigO.thy.
6620 * Theory RealDef: better support for embedding natural numbers and
6621 integers in the reals.
6623 The following theorems have been eliminated or modified
6626 exp_ge_add_one_self now requires no hypotheses
6627 real_of_int_add reversed direction of equality (use [symmetric])
6628 real_of_int_minus reversed direction of equality (use [symmetric])
6629 real_of_int_diff reversed direction of equality (use [symmetric])
6630 real_of_int_mult reversed direction of equality (use [symmetric])
6632 * Theory RComplete: expanded support for floor and ceiling functions.
6634 * Theory Ln is new, with properties of the natural logarithm
6636 * Hyperreal: There is a new type constructor "star" for making
6637 nonstandard types. The old type names are now type synonyms:
6641 hcomplex = complex star
6643 * Hyperreal: Many groups of similarly-defined constants have been
6644 replaced by polymorphic versions (INCOMPATIBILITY):
6646 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6648 starset <-- starsetNat, starsetC
6649 *s* <-- *sNat*, *sc*
6650 starset_n <-- starsetNat_n, starsetC_n
6651 *sn* <-- *sNatn*, *scn*
6652 InternalSets <-- InternalNatSets, InternalCSets
6654 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6655 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6656 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6657 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6658 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6660 * Hyperreal: Many type-specific theorems have been removed in favor of
6661 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6663 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6664 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6665 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6666 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6667 right_minus <-- hypreal_add_minus
6668 left_minus <-- {hypreal,hcomplex}_add_minus_left
6669 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6670 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6671 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6672 mult_1_right <-- hcomplex_mult_one_right
6673 mult_zero_left <-- hcomplex_mult_zero_left
6674 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6675 right_distrib <-- hypnat_add_mult_distrib2
6676 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6677 right_inverse <-- hypreal_mult_inverse
6678 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6679 order_refl <-- {hypreal,hypnat}_le_refl
6680 order_trans <-- {hypreal,hypnat}_le_trans
6681 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6682 order_less_le <-- {hypreal,hypnat}_less_le
6683 linorder_linear <-- {hypreal,hypnat}_le_linear
6684 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6685 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6686 add_nonneg_nonneg <-- hypreal_le_add_order
6688 * Hyperreal: Separate theorems having to do with type-specific
6689 versions of constants have been merged into theorems that apply to the
6690 new polymorphic constants (INCOMPATIBILITY):
6692 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6693 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6694 STAR_Un <-- {STAR,NatStar,STARC}_Un
6695 STAR_Int <-- {STAR,NatStar,STARC}_Int
6696 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6697 STAR_subset <-- {STAR,NatStar,STARC}_subset
6698 STAR_mem <-- {STAR,NatStar,STARC}_mem
6699 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6700 STAR_diff <-- {STAR,STARC}_diff
6701 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6702 STARC_hcomplex_of_complex}_image_subset
6703 starset_n_Un <-- starset{Nat,C}_n_Un
6704 starset_n_Int <-- starset{Nat,C}_n_Int
6705 starset_n_Compl <-- starset{Nat,C}_n_Compl
6706 starset_n_diff <-- starset{Nat,C}_n_diff
6707 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6708 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6709 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6710 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6711 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6712 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6713 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6714 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6715 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6716 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6717 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6718 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6719 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6720 starfun_diff <-- starfun{C,RC,CR}_diff
6721 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6722 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6723 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6724 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6725 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6726 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6727 starfun_Id <-- starfunC_Id
6728 starfun_approx <-- starfun{Nat,CR}_approx
6729 starfun_capprox <-- starfun{C,RC}_capprox
6730 starfun_abs <-- starfunNat_rabs
6731 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6732 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6733 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6734 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6735 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6736 starfun_add_approx <-- starfunCR_add_approx
6737 starfun_inverse_inverse <-- starfunC_inverse_inverse
6738 starfun_divide <-- starfun{C,CR,RC}_divide
6739 starfun_n <-- starfun{Nat,C}_n
6740 starfun_n_mult <-- starfun{Nat,C}_n_mult
6741 starfun_n_add <-- starfun{Nat,C}_n_add
6742 starfun_n_add_minus <-- starfunNat_n_add_minus
6743 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6744 starfun_n_minus <-- starfun{Nat,C}_n_minus
6745 starfun_n_eq <-- starfun{Nat,C}_n_eq
6747 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6748 star_n_minus <-- {hypreal,hcomplex}_minus
6749 star_n_diff <-- {hypreal,hcomplex}_diff
6750 star_n_mult <-- {hypreal,hcomplex}_mult
6751 star_n_inverse <-- {hypreal,hcomplex}_inverse
6752 star_n_le <-- {hypreal,hypnat}_le
6753 star_n_less <-- {hypreal,hypnat}_less
6754 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6755 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6756 star_n_abs <-- hypreal_hrabs
6757 star_n_divide <-- hcomplex_divide
6759 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6760 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6761 star_of_diff <-- hypreal_of_real_diff
6762 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6763 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6764 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6765 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6766 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6767 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6768 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6769 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6770 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6771 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6772 star_of_number_of <-- {hypreal,hcomplex}_number_of
6773 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6774 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6775 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6776 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6777 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6778 star_of_power <-- hypreal_of_real_power
6779 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6781 * Hyperreal: new method "transfer" that implements the transfer
6782 principle of nonstandard analysis. With a subgoal that mentions
6783 nonstandard types like "'a star", the command "apply transfer"
6784 replaces it with an equivalent one that mentions only standard types.
6785 To be successful, all free variables must have standard types; non-
6786 standard variables must have explicit universal quantifiers.
6788 * Hyperreal: A theory of Taylor series.
6793 * Discontinued special version of 'constdefs' (which used to support
6794 continuous functions) in favor of the general Pure one with full
6797 * New simplification procedure for solving continuity conditions; it
6798 is much faster on terms with many nested lambda abstractions (cubic
6799 instead of exponential time).
6801 * New syntax for domain package: selector names are now optional.
6802 Parentheses should be omitted unless argument is lazy, for example:
6804 domain 'a stream = cons "'a" (lazy "'a stream")
6806 * New command 'fixrec' for defining recursive functions with pattern
6807 matching; defining multiple functions with mutual recursion is also
6808 supported. Patterns may include the constants cpair, spair, up, sinl,
6809 sinr, or any data constructor defined by the domain package. The given
6810 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6811 syntax and examples.
6813 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6814 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6815 but the proof obligation additionally includes an admissibility
6816 requirement. The packages generate instances of class cpo or pcpo,
6817 with continuity and strictness theorems for Rep and Abs.
6819 * HOLCF: Many theorems have been renamed according to a more standard naming
6820 scheme (INCOMPATIBILITY):
6822 foo_inject: "foo$x = foo$y ==> x = y"
6823 foo_eq: "(foo$x = foo$y) = (x = y)"
6824 foo_less: "(foo$x << foo$y) = (x << y)"
6825 foo_strict: "foo$UU = UU"
6826 foo_defined: "... ==> foo$x ~= UU"
6827 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6832 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6833 including the First Isomorphism Theorem (on quotienting by the kernel
6836 * ZF/Simplifier: install second copy of type solver that actually
6837 makes use of TC rules declared to Isar proof contexts (or locales);
6838 the old version is still required for ML proof scripts.
6843 * Converted to Isar theory format; use locales instead of axiomatic
6849 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6852 * Pure/library.ML no longer defines its own option datatype, but uses
6853 that of the SML basis, which has constructors NONE and SOME instead of
6854 None and Some, as well as exception Option.Option instead of OPTION.
6855 The functions the, if_none, is_some, is_none have been adapted
6856 accordingly, while Option.map replaces apsome.
6858 * Pure/library.ML: the exception LIST has been given up in favour of
6859 the standard exceptions Empty and Subscript, as well as
6860 Library.UnequalLengths. Function like Library.hd and Library.tl are
6861 superceded by the standard hd and tl functions etc.
6863 A number of basic list functions are no longer exported to the ML
6864 toplevel, as they are variants of predefined functions. The following
6865 suggests how one can translate existing code:
6867 rev_append xs ys = List.revAppend (xs, ys)
6868 nth_elem (i, xs) = List.nth (xs, i)
6869 last_elem xs = List.last xs
6870 flat xss = List.concat xss
6871 seq fs = List.app fs
6872 partition P xs = List.partition P xs
6873 mapfilter f xs = List.mapPartial f xs
6875 * Pure/library.ML: several combinators for linear functional
6876 transformations, notably reverse application and composition:
6879 (x, y) |-> f f #-> g
6881 * Pure/library.ML: introduced/changed precedence of infix operators:
6883 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
6885 infix 3 o oo ooo oooo;
6886 infix 4 ~~ upto downto;
6888 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
6891 * Pure/library.ML: natural list combinators fold, fold_rev, and
6892 fold_map support linear functional transformations and nesting. For
6895 fold f [x1, ..., xN] y =
6896 y |> f x1 |> ... |> f xN
6898 (fold o fold) f [xs1, ..., xsN] y =
6899 y |> fold f xs1 |> ... |> fold f xsN
6901 fold f [x1, ..., xN] =
6904 (fold o fold) f [xs1, ..., xsN] =
6905 fold f xs1 #> ... #> fold f xsN
6907 * Pure/library.ML: the following selectors on type 'a option are
6910 the: 'a option -> 'a (*partial*)
6911 these: 'a option -> 'a where 'a = 'b list
6912 the_default: 'a -> 'a option -> 'a
6913 the_list: 'a option -> 'a list
6915 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6916 basic operations for association lists, following natural argument
6917 order; moreover the explicit equality predicate passed here avoids
6918 potentially expensive polymorphic runtime equality checks.
6919 The old functions may be expressed as follows:
6921 assoc = uncurry (AList.lookup (op =))
6922 assocs = these oo AList.lookup (op =)
6923 overwrite = uncurry (AList.update (op =)) o swap
6925 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
6927 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
6928 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
6930 replacing make_keylist and keyfilter (occassionally used)
6933 make_keylist = AList.make
6934 keyfilter = AList.find (op =)
6936 * eq_fst and eq_snd now take explicit equality parameter, thus
6937 avoiding eqtypes. Naive rewrites:
6939 eq_fst = eq_fst (op =)
6940 eq_snd = eq_snd (op =)
6942 * Removed deprecated apl and apr (rarely used).
6945 apl (n, op) =>>= curry op n
6946 apr (op, m) =>>= fn n => op (n, m)
6948 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
6949 provides a reasonably efficient light-weight implementation of sets as
6952 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
6953 few new operations; existing lookup and update are now curried to
6954 follow natural argument order (for use with fold etc.);
6955 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
6957 * Pure/General: output via the Isabelle channels of
6958 writeln/warning/error etc. is now passed through Output.output, with a
6959 hook for arbitrary transformations depending on the print_mode
6960 (cf. Output.add_mode -- the first active mode that provides a output
6961 function wins). Already formatted output may be embedded into further
6962 text via Output.raw; the result of Pretty.string_of/str_of and derived
6963 functions (string_of_term/cterm/thm etc.) is already marked raw to
6964 accommodate easy composition of diagnostic messages etc. Programmers
6965 rarely need to care about Output.output or Output.raw at all, with
6966 some notable exceptions: Output.output is required when bypassing the
6967 standard channels (writeln etc.), or in token translations to produce
6968 properly formatted results; Output.raw is required when capturing
6969 already output material that will eventually be presented to the user
6970 a second time. For the default print mode, both Output.output and
6971 Output.raw have no effect.
6973 * Pure/General: Output.time_accumulator NAME creates an operator ('a
6974 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
6975 cumulative results are displayed at the end of a batch session.
6977 * Pure/General: File.sysify_path and File.quote_sysify path have been
6978 replaced by File.platform_path and File.shell_path (with appropriate
6979 hooks). This provides a clean interface for unusual systems where the
6980 internal and external process view of file names are different.
6982 * Pure: more efficient orders for basic syntactic entities: added
6983 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
6984 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
6985 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
6986 orders now -- potential INCOMPATIBILITY for code that depends on a
6987 particular order for Symtab.keys, Symtab.dest, etc. (consider using
6988 Library.sort_strings on result).
6990 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
6991 fold_types traverse types/terms from left to right, observing natural
6992 argument order. Supercedes previous foldl_XXX versions, add_frees,
6993 add_vars etc. have been adapted as well: INCOMPATIBILITY.
6995 * Pure: name spaces have been refined, with significant changes of the
6996 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
6997 to extern(_table). The plain name entry path is superceded by a
6998 general 'naming' context, which also includes the 'policy' to produce
6999 a fully qualified name and external accesses of a fully qualified
7000 name; NameSpace.extend is superceded by context dependent
7001 Sign.declare_name. Several theory and proof context operations modify
7002 the naming context. Especially note Theory.restore_naming and
7003 ProofContext.restore_naming to get back to a sane state; note that
7004 Theory.add_path is no longer sufficient to recover from
7005 Theory.absolute_path in particular.
7007 * Pure: new flags short_names (default false) and unique_names
7008 (default true) for controlling output of qualified names. If
7009 short_names is set, names are printed unqualified. If unique_names is
7010 reset, the name prefix is reduced to the minimum required to achieve
7011 the original result when interning again, even if there is an overlap
7012 with earlier declarations.
7014 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7015 now 'extend', and 'merge' gets an additional Pretty.pp argument
7016 (useful for printing error messages). INCOMPATIBILITY.
7018 * Pure: major reorganization of the theory context. Type Sign.sg and
7019 Theory.theory are now identified, referring to the universal
7020 Context.theory (see Pure/context.ML). Actual signature and theory
7021 content is managed as theory data. The old code and interfaces were
7022 spread over many files and structures; the new arrangement introduces
7023 considerable INCOMPATIBILITY to gain more clarity:
7025 Context -- theory management operations (name, identity, inclusion,
7026 parents, ancestors, merge, etc.), plus generic theory data;
7028 Sign -- logical signature and syntax operations (declaring consts,
7029 types, etc.), plus certify/read for common entities;
7031 Theory -- logical theory operations (stating axioms, definitions,
7032 oracles), plus a copy of logical signature operations (consts,
7033 types, etc.); also a few basic management operations (Theory.copy,
7036 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7037 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7038 for convenience -- they merely return the theory.
7040 * Pure: type Type.tsig is superceded by theory in most interfaces.
7042 * Pure: the Isar proof context type is already defined early in Pure
7043 as Context.proof (note that ProofContext.context and Proof.context are
7044 aliases, where the latter is the preferred name). This enables other
7045 Isabelle components to refer to that type even before Isar is present.
7047 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7048 typeK, constK, axiomK, oracleK), but provide explicit operations for
7049 any of these kinds. For example, Sign.intern typeK is now
7050 Sign.intern_type, Theory.hide_space Sign.typeK is now
7051 Theory.hide_types. Also note that former
7052 Theory.hide_classes/types/consts are now
7053 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7054 internalize their arguments! INCOMPATIBILITY.
7056 * Pure: get_thm interface (of PureThy and ProofContext) expects
7057 datatype thmref (with constructors Name and NameSelection) instead of
7058 plain string -- INCOMPATIBILITY;
7060 * Pure: cases produced by proof methods specify options, where NONE
7061 means to remove case bindings -- INCOMPATIBILITY in
7064 * Pure: the following operations retrieve axioms or theorems from a
7065 theory node or theory hierarchy, respectively:
7067 Theory.axioms_of: theory -> (string * term) list
7068 Theory.all_axioms_of: theory -> (string * term) list
7069 PureThy.thms_of: theory -> (string * thm) list
7070 PureThy.all_thms_of: theory -> (string * thm) list
7072 * Pure: print_tac now outputs the goal through the trace channel.
7074 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7075 Reference Toplevel.debug (default false) controls detailed printing
7076 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7077 controls execution profiling -- set to 1 for time and 2 for space
7078 (both increase the runtime).
7080 * Isar session: The initial use of ROOT.ML is now always timed,
7081 i.e. the log will show the actual process times, in contrast to the
7082 elapsed wall-clock time that the outer shell wrapper produces.
7084 * Simplifier: improved handling of bound variables (nameless
7085 representation, avoid allocating new strings). Simprocs that invoke
7086 the Simplifier recursively should use Simplifier.inherit_bounds to
7087 avoid local name clashes. Failure to do so produces warnings
7088 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7089 for further details.
7091 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7092 bindings for all theorems stored within a given theory; this may help
7093 in porting non-Isar theories to Isar ones, while keeping ML proof
7094 scripts for the time being.
7096 * ML operator HTML.with_charset specifies the charset begin used for
7097 generated HTML files. For example:
7099 HTML.with_charset "utf-8" use_thy "Hebrew";
7100 HTML.with_charset "utf-8" use_thy "Chinese";
7105 * Allow symlinks to all proper Isabelle executables (Isabelle,
7106 isabelle, isatool etc.).
7108 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7109 isatool doc, isatool mkdir, display_drafts etc.).
7111 * isatool usedir: option -f allows specification of the ML file to be
7112 used by Isabelle; default is ROOT.ML.
7114 * New isatool version outputs the version identifier of the Isabelle
7115 distribution being used.
7117 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7118 (containing Boolean satisfiability problems) into Isabelle/HOL
7123 New in Isabelle2004 (April 2004)
7124 --------------------------------
7128 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7129 Replaces linorder.ML.
7131 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7132 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7133 (\<a>...\<z>), are now considered normal letters, and can therefore
7134 be used anywhere where an ASCII letter (a...zA...Z) has until
7135 now. COMPATIBILITY: This obviously changes the parsing of some
7136 terms, especially where a symbol has been used as a binder, say
7137 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7138 as an identifier. Fix it by inserting a space around former
7139 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7140 existing theory and ML files.
7142 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7144 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7145 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7146 a normal (but invisible) letter. For multiple letter subscripts repeat
7147 \<^isub> like this: x\<^isub>1\<^isub>2.
7149 * Pure: There are now sub-/superscripts that can span more than one
7150 character. Text between \<^bsub> and \<^esub> is set in subscript in
7151 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7152 superscript. The new control characters are not identifier parts.
7154 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7155 content of "..." to the latex file instead of \isacntrl... . The "..."
7156 may consist of any printable characters excluding the end bracket >.
7158 * Pure: Using new Isar command "finalconsts" (or the ML functions
7159 Theory.add_finals or Theory.add_finals_i) it is now possible to
7160 declare constants "final", which prevents their being given a definition
7161 later. It is useful for constants whose behaviour is fixed axiomatically
7162 rather than definitionally, such as the meta-logic connectives.
7164 * Pure: 'instance' now handles general arities with general sorts
7165 (i.e. intersections of classes),
7167 * Presentation: generated HTML now uses a CSS style sheet to make layout
7168 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7169 It can be changed to alter the colors/layout of generated pages.
7174 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7175 cut_tac, subgoal_tac and thin_tac:
7176 - Now understand static (Isar) contexts. As a consequence, users of Isar
7177 locales are no longer forced to write Isar proof scripts.
7178 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7180 - INCOMPATIBILITY: names of variables to be instantiated may no
7181 longer be enclosed in quotes. Instead, precede variable name with `?'.
7182 This is consistent with the instantiation attribute "where".
7184 * Attributes "where" and "of":
7185 - Now take type variables of instantiated theorem into account when reading
7186 the instantiation string. This fixes a bug that caused instantiated
7187 theorems to have too special types in some circumstances.
7188 - "where" permits explicit instantiations of type variables.
7190 * Calculation commands "moreover" and "also" no longer interfere with
7191 current facts ("this"), admitting arbitrary combinations with "then"
7195 - Goal statements involving the context element "includes" no longer
7196 generate theorems with internal delta predicates (those ending on
7197 "_axioms") in the premise.
7198 Resolve particular premise with <locale>.intro to obtain old form.
7199 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7200 specification and "includes" elements in goal statement.
7201 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7202 [intro?] and [elim?] (respectively) by default.
7203 - Experimental command for instantiation of locales in proof contexts:
7204 instantiate <label>[<attrs>]: <loc>
7205 Instantiates locale <loc> and adds all its theorems to the current context
7206 taking into account their attributes. Label and attrs are optional
7207 modifiers, like in theorem declarations. If present, names of
7208 instantiated theorems are qualified with <label>, and the attributes
7209 <attrs> are applied after any attributes these theorems might have already.
7210 If the locale has assumptions, a chained fact of the form
7211 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7212 are derived. The command does not support old-style locales declared
7213 with "locale (open)".
7214 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7216 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7222 * Proof import: new image HOL4 contains the imported library from
7223 the HOL4 system with about 2500 theorems. It is imported by
7224 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7225 can be used like any other Isabelle image. See
7226 HOL/Import/HOL/README for more information.
7229 - Much improved handling of linear and partial orders.
7230 Reasoners for linear and partial orders are set up for type classes
7231 "linorder" and "order" respectively, and are added to the default simpset
7232 as solvers. This means that the simplifier can build transitivity chains
7233 to solve goals from the assumptions.
7234 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7235 of blast or auto after simplification become unnecessary because the goal
7236 is solved by simplification already.
7238 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7239 all proved in axiomatic type classes for semirings, rings and fields.
7242 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7243 now formalized using the Ring_and_Field theory mentioned above.
7244 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7245 than before, because now they are set up once in a generic manner.
7246 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7247 Look for the general versions in Ring_and_Field (and Power if they concern
7250 * Type "rat" of the rational numbers is now available in HOL-Complex.
7253 - Record types are now by default printed with their type abbreviation
7254 instead of the list of all field types. This can be configured via
7255 the reference "print_record_type_abbr".
7256 - Simproc "record_upd_simproc" for simplification of multiple updates added
7257 (not enabled by default).
7258 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7259 EX x. x = sel r to True (not enabled by default).
7260 - Tactic "record_split_simp_tac" to split and simplify records added.
7262 * 'specification' command added, allowing for definition by
7263 specification. There is also an 'ax_specification' command that
7264 introduces the new constants axiomatically.
7266 * arith(_tac) is now able to generate counterexamples for reals as well.
7268 * HOL-Algebra: new locale "ring" for non-commutative rings.
7270 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7271 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7273 * HOL-Matrix: a first theory for matrices in HOL with an application of
7274 matrix theory to linear programming.
7276 * Unions and Intersections:
7277 The latex output syntax of UN and INT has been changed
7278 from "\Union x \in A. B" to "\Union_{x \in A} B"
7279 i.e. the index formulae has become a subscript.
7280 Similarly for "\Union x. B", and for \Inter instead of \Union.
7282 * Unions and Intersections over Intervals:
7283 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7284 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7285 like in normal math, and corresponding versions for < and for intersection.
7287 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7288 lexicographic dictonary ordering has been added as "lexord".
7290 * ML: the legacy theory structures Int and List have been removed. They had
7291 conflicted with ML Basis Library structures having the same names.
7293 * 'refute' command added to search for (finite) countermodels. Only works
7294 for a fragment of HOL. The installation of an external SAT solver is
7295 highly recommended. See "HOL/Refute.thy" for details.
7297 * 'quickcheck' command: Allows to find counterexamples by evaluating
7298 formulae under an assignment of free variables to random values.
7299 In contrast to 'refute', it can deal with inductive datatypes,
7300 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7306 * Streams now come with concatenation and are part of the HOLCF image
7310 New in Isabelle2003 (May 2003)
7311 ------------------------------
7315 * Provers/simplifier:
7317 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7318 Assumptions are now subject to complete mutual simplification,
7319 not just from left to right. The simplifier now preserves
7320 the order of assumptions.
7322 Potential INCOMPATIBILITY:
7324 -- simp sometimes diverges where the old version did
7325 not, e.g. invoking simp on the goal
7327 [| P (f x); y = x; f x = f y |] ==> Q
7329 now gives rise to the infinite reduction sequence
7331 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7333 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7336 -- Tactics combining classical reasoner and simplification (such as auto)
7337 are also affected by this change, because many of them rely on
7338 simp. They may sometimes diverge as well or yield a different numbers
7339 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7340 in case of problems. Sometimes subsequent calls to the classical
7341 reasoner will fail because a preceeding call to the simplifier too
7342 eagerly simplified the goal, e.g. deleted redundant premises.
7344 - The simplifier trace now shows the names of the applied rewrite rules
7346 - You can limit the number of recursive invocations of the simplifier
7347 during conditional rewriting (where the simplifie tries to solve the
7348 conditions before applying the rewrite rule):
7349 ML "simp_depth_limit := n"
7350 where n is an integer. Thus you can force termination where previously
7351 the simplifier would diverge.
7353 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7355 - No longer aborts on failed congruence proof. Instead, the
7356 congruence is ignored.
7358 * Pure: New generic framework for extracting programs from constructive
7359 proofs. See HOL/Extraction.thy for an example instantiation, as well
7360 as HOL/Extraction for some case studies.
7362 * Pure: The main goal of the proof state is no longer shown by default, only
7363 the subgoals. This behaviour is controlled by a new flag.
7364 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7365 (ML: Proof.show_main_goal).
7367 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7368 rules whose conclusion matches subgoal 1:
7369 PG menu: Isabelle/Isar -> Show me -> matching rules
7370 The rules are ordered by how closely they match the subgoal.
7371 In particular, rules that solve a subgoal outright are displayed first
7372 (or rather last, the way they are printed).
7373 (ML: ProofGeneral.print_intros())
7375 * Pure: New flag trace_unify_fail causes unification to print
7376 diagnostic information (PG: in trace buffer) when it fails. This is
7377 useful for figuring out why single step proofs like rule, erule or
7380 * Pure: Locale specifications now produce predicate definitions
7381 according to the body of text (covering assumptions modulo local
7382 definitions); predicate "loc_axioms" covers newly introduced text,
7383 while "loc" is cumulative wrt. all included locale expressions; the
7384 latter view is presented only on export into the global theory
7385 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7386 on the old view without predicates;
7388 * Pure: predefined locales "var" and "struct" are useful for sharing
7389 parameters (as in CASL, for example); just specify something like
7390 ``var x + var y + struct M'' as import;
7392 * Pure: improved thms_containing: proper indexing of facts instead of
7393 raw theorems; check validity of results wrt. current name space;
7394 include local facts of proof configuration (also covers active
7395 locales), cover fixed variables in index; may use "_" in term
7396 specification; an optional limit for the number of printed facts may
7397 be given (the default is 40);
7399 * Pure: disallow duplicate fact bindings within new-style theory files
7402 * Provers: improved induct method: assumptions introduced by case
7403 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7404 the goal statement); "foo" still refers to all facts collectively;
7406 * Provers: the function blast.overloaded has been removed: all constants
7407 are regarded as potentially overloaded, which improves robustness in exchange
7408 for slight decrease in efficiency;
7410 * Provers/linorder: New generic prover for transitivity reasoning over
7411 linear orders. Note: this prover is not efficient!
7413 * Isar: preview of problems to finish 'show' now produce an error
7414 rather than just a warning (in interactive mode);
7421 - Produces a counter example if it cannot prove a goal.
7422 Note that the counter example may be spurious if the goal is not a formula
7423 of quantifier-free linear arithmetic.
7424 In ProofGeneral the counter example appears in the trace buffer.
7426 - Knows about div k and mod k where k is a numeral of type nat or int.
7428 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7429 linear arithmetic fails. This takes account of quantifiers and divisibility.
7430 Presburger arithmetic can also be called explicitly via presburger(_tac).
7432 * simp's arithmetic capabilities have been enhanced a bit: it now
7433 takes ~= in premises into account (by performing a case split);
7435 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7436 are distributed over a sum of terms;
7438 * New tactic "trans_tac" and method "trans" instantiate
7439 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7442 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7443 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7445 * 'typedef' command has new option "open" to suppress the set
7448 * functions Min and Max on finite sets have been introduced (theory
7451 * attribute [symmetric] now works for relations as well; it turns
7452 (x,y) : R^-1 into (y,x) : R, and vice versa;
7454 * induct over a !!-quantified statement (say !!x1..xn):
7455 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7457 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7458 %x. None. Warning: empty_def now refers to the previously hidden definition
7461 * Algebra: formalization of classical algebra. Intended as base for
7462 any algebraic development in Isabelle. Currently covers group theory
7463 (up to Sylow's theorem) and ring theory (Universal Property of
7464 Univariate Polynomials). Contributions welcome;
7466 * GroupTheory: deleted, since its material has been moved to Algebra;
7468 * Complex: new directory of the complex numbers with numeric constants,
7469 nonstandard complex numbers, and some complex analysis, standard and
7470 nonstandard (Jacques Fleuriot);
7472 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7474 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7477 * Real/HahnBanach: updated and adapted to locales;
7479 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7482 * UNITY: added the Meier-Sanders theory of progress sets;
7484 * MicroJava: bytecode verifier and lightweight bytecode verifier
7485 as abstract algorithms, instantiated to the JVM;
7487 * Bali: Java source language formalization. Type system, operational
7488 semantics, axiomatic semantics. Supported language features:
7489 classes, interfaces, objects,virtual methods, static methods,
7490 static/instance fields, arrays, access modifiers, definite
7491 assignment, exceptions.
7496 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7499 * Main ZF: virtually all theories converted to new-style format;
7504 * Pure: Tactic.prove provides sane interface for internal proofs;
7505 omits the infamous "standard" operation, so this is more appropriate
7506 than prove_goalw_cterm in many situations (e.g. in simprocs);
7508 * Pure: improved error reporting of simprocs;
7510 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7514 *** Document preparation ***
7516 * uses \par instead of \\ for line breaks in theory text. This may
7517 shift some page breaks in large documents. To get the old behaviour
7518 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7520 * minimized dependencies of isabelle.sty and isabellesym.sty on
7523 * \<euro> now needs package babel/greek instead of marvosym (which
7526 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7531 New in Isabelle2002 (March 2002)
7532 --------------------------------
7534 *** Document preparation ***
7536 * greatly simplified document preparation setup, including more
7537 graceful interpretation of isatool usedir -i/-d/-D options, and more
7538 instructive isatool mkdir; users should basically be able to get
7539 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7540 users may run a separate document processing stage manually like this:
7541 "isatool usedir -D output HOL Test && isatool document Test/output";
7543 * theory dependency graph may now be incorporated into documents;
7544 isatool usedir -g true will produce session_graph.eps/.pdf for use
7545 with \includegraphics of LaTeX;
7547 * proper spacing of consecutive markup elements, especially text
7548 blocks after section headings;
7550 * support bold style (for single symbols only), input syntax is like
7551 this: "\<^bold>\<alpha>" or "\<^bold>A";
7553 * \<bullet> is now output as bold \cdot by default, which looks much
7554 better in printed text;
7556 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7557 note that these symbols are currently unavailable in Proof General /
7558 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7560 * isatool latex no longer depends on changed TEXINPUTS, instead
7561 isatool document copies the Isabelle style files to the target
7567 * Pure/Provers: improved proof by cases and induction;
7568 - 'case' command admits impromptu naming of parameters (such as
7570 - 'induct' method divinates rule instantiation from the inductive
7571 claim; no longer requires excessive ?P bindings for proper
7572 instantiation of cases;
7573 - 'induct' method properly enumerates all possibilities of set/type
7574 rules; as a consequence facts may be also passed through *type*
7575 rules without further ado;
7576 - 'induct' method now derives symbolic cases from the *rulified*
7577 rule (before it used to rulify cases stemming from the internal
7578 atomized version); this means that the context of a non-atomic
7579 statement becomes is included in the hypothesis, avoiding the
7580 slightly cumbersome show "PROP ?case" form;
7581 - 'induct' may now use elim-style induction rules without chaining
7582 facts, using ``missing'' premises from the goal state; this allows
7583 rules stemming from inductive sets to be applied in unstructured
7584 scripts, while still benefitting from proper handling of non-atomic
7585 statements; NB: major inductive premises need to be put first, all
7586 the rest of the goal is passed through the induction;
7587 - 'induct' proper support for mutual induction involving non-atomic
7588 rule statements (uses the new concept of simultaneous goals, see
7590 - append all possible rule selections, but only use the first
7591 success (no backtracking);
7592 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7593 - undeclared rule case names default to numbers 1, 2, 3, ...;
7594 - added 'print_induct_rules' (covered by help item in recent Proof
7596 - moved induct/cases attributes to Pure, methods to Provers;
7597 - generic method setup instantiated for FOL and HOL;
7599 * Pure: support multiple simultaneous goal statements, for example
7600 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7601 meta-level mechanism, this acts as if several individual goals had
7602 been stated separately; in particular common proof methods need to be
7603 repeated in order to cover all claims; note that a single elimination
7604 step is *not* sufficient to establish the two conjunctions, so this
7607 assume "A & B" then have A and B .. (*".." fails*)
7609 better use "obtain" in situations as above; alternative refer to
7610 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7612 * Pure: proper integration with ``locales''; unlike the original
7613 version by Florian Kammller, Isar locales package high-level proof
7614 contexts rather than raw logical ones (e.g. we admit to include
7615 attributes everywhere); operations on locales include merge and
7616 rename; support for implicit arguments (``structures''); simultaneous
7617 type-inference over imports and text; see also HOL/ex/Locales.thy for
7620 * Pure: the following commands have been ``localized'', supporting a
7621 target locale specification "(in name)": 'lemma', 'theorem',
7622 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7623 stored both within the locale and at the theory level (exported and
7624 qualified by the locale name);
7626 * Pure: theory goals may now be specified in ``long'' form, with
7627 ad-hoc contexts consisting of arbitrary locale elements. for example
7628 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7629 definitions may be given, too); the result is a meta-level rule with
7630 the context elements being discharged in the obvious way;
7632 * Pure: new proof command 'using' allows to augment currently used
7633 facts after a goal statement ('using' is syntactically analogous to
7634 'apply', but acts on the goal's facts only); this allows chained facts
7635 to be separated into parts given before and after a claim, as in
7636 ``from a and b have C using d and e <proof>'';
7638 * Pure: renamed "antecedent" case to "rule_context";
7640 * Pure: new 'judgment' command records explicit information about the
7641 object-logic embedding (used by several tools internally); no longer
7642 use hard-wired "Trueprop";
7644 * Pure: added 'corollary' command;
7646 * Pure: fixed 'token_translation' command;
7648 * Pure: removed obsolete 'exported' attribute;
7650 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7651 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7652 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7654 * Pure: method 'atomize' presents local goal premises as object-level
7655 statements (atomic meta-level propositions); setup controlled via
7656 rewrite rules declarations of 'atomize' attribute; example
7657 application: 'induct' method with proper rule statements in improper
7660 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7661 now consider the syntactic context of assumptions, giving a better
7662 chance to get type-inference of the arguments right (this is
7663 especially important for locales);
7665 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7668 * Pure/obtain: the formal conclusion "thesis", being marked as
7669 ``internal'', may no longer be reference directly in the text;
7670 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7673 * Pure: generic 'sym' attribute which declares a rule both as pure
7674 'elim?' and for the 'symmetric' operation;
7676 * Pure: marginal comments ``--'' may now occur just anywhere in the
7677 text; the fixed correlation with particular command syntax has been
7680 * Pure: new method 'rules' is particularly well-suited for proof
7681 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7682 but often produces more compact proof terms with less detours;
7684 * Pure/Provers/classical: simplified integration with pure rule
7685 attributes and methods; the classical "intro?/elim?/dest?"
7686 declarations coincide with the pure ones; the "rule" method no longer
7687 includes classically swapped intros; "intro" and "elim" methods no
7688 longer pick rules from the context; also got rid of ML declarations
7689 AddXIs/AddXEs/AddXDs; all of this has some potential for
7692 * Provers/classical: attribute 'swapped' produces classical inversions
7693 of introduction rules;
7695 * Provers/simplifier: 'simplified' attribute may refer to explicit
7696 rules instead of full simplifier context; 'iff' attribute handles
7699 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7701 * HOL: 'recdef' now fails on unfinished automated proofs, use
7702 "(permissive)" option to recover old behavior;
7704 * HOL: 'inductive' no longer features separate (collective) attributes
7705 for 'intros' (was found too confusing);
7707 * HOL: properly declared induction rules less_induct and
7713 * HOL: moved over to sane numeral syntax; the new policy is as
7716 - 0 and 1 are polymorphic constants, which are defined on any
7717 numeric type (nat, int, real etc.);
7719 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7720 binary representation internally;
7722 - type nat has special constructor Suc, and generally prefers Suc 0
7723 over 1::nat and Suc (Suc 0) over 2::nat;
7725 This change may cause significant problems of INCOMPATIBILITY; here
7726 are some hints on converting existing sources:
7728 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7729 entities, so expressions involving "-" (unary or binary minus) need
7730 to be spaced properly;
7732 - existing occurrences of "1" may need to be constraint "1::nat" or
7733 even replaced by Suc 0; similar for old "2";
7735 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7737 - remove all special provisions on numerals in proofs;
7739 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7740 representation (depends on bin_arith_simps in the default context);
7742 * HOL: symbolic syntax for x^2 (numeral 2);
7744 * HOL: the class of all HOL types is now called "type" rather than
7745 "term"; INCOMPATIBILITY, need to adapt references to this type class
7746 in axclass/classes, instance/arities, and (usually rare) occurrences
7747 in typings (of consts etc.); internally the class is called
7748 "HOL.type", ML programs should refer to HOLogic.typeS;
7750 * HOL/record package improvements:
7751 - new derived operations "fields" to build a partial record section,
7752 "extend" to promote a fixed record to a record scheme, and
7753 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7754 declared as simp by default;
7755 - shared operations ("more", "fields", etc.) now need to be always
7756 qualified) --- potential INCOMPATIBILITY;
7757 - removed "make_scheme" operations (use "make" with "extend") --
7759 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7760 - provides cases/induct rules for use with corresponding Isar
7761 methods (for concrete records, record schemes, concrete more
7762 parts, and schematic more parts -- in that order);
7763 - internal definitions directly based on a light-weight abstract
7764 theory of product types over typedef rather than datatype;
7766 * HOL: generic code generator for generating executable ML code from
7767 specifications; specific support for HOL constructs such as inductive
7768 datatypes and sets, as well as recursive functions; can be invoked
7769 via 'generate_code' theory section;
7771 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7773 * HOL: consolidated and renamed several theories. In particular:
7774 Ord.thy has been absorbed into HOL.thy
7775 String.thy has been absorbed into List.thy
7777 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7778 (beware of argument permutation!);
7780 * HOL: linorder_less_split superseded by linorder_cases;
7782 * HOL/List: "nodups" renamed to "distinct";
7784 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7785 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7786 - Ex_def has changed, now need to use some_eq_ex
7788 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7789 in this (rare) case use:
7791 delSWrapper "split_all_tac"
7792 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7794 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7797 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7798 Isabelle's type classes, ^ on functions and relations has too general
7799 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7800 necessary to attach explicit type constraints;
7802 * HOL/Relation: the prefix name of the infix "O" has been changed from
7803 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7804 renamed accordingly (eg "compI" -> "rel_compI").
7806 * HOL: syntax translations now work properly with numerals and records
7809 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7810 of "lam" -- INCOMPATIBILITY;
7812 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7813 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7814 renamed "Product_Type.unit";
7816 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7818 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7819 the "cases" method);
7821 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7824 * HOL/IMP: updated and converted to new-style theory format; several
7825 parts turned into readable document, with proper Isar proof texts and
7826 some explanations (by Gerwin Klein);
7828 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7830 * HOL-Hyperreal is now a logic image;
7835 * Isar: consts/constdefs supports mixfix syntax for continuous
7838 * Isar: domain package adapted to new-style theory format, e.g. see
7841 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7842 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7843 lift.induct_tac, always use UU instead of Undef;
7845 * HOLCF/IMP: updated and converted to new-style theory;
7850 * Isar: proper integration of logic-specific tools and packages,
7851 including theory commands '(co)inductive', '(co)datatype',
7852 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7853 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
7855 * theory Main no longer includes AC; for the Axiom of Choice, base
7856 your theory on Main_ZFC;
7858 * the integer library now covers quotients and remainders, with many
7859 laws relating division to addition, multiplication, etc.;
7861 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
7862 typeless version of the formalism;
7864 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
7867 * ZF/Induct: new directory for examples of inductive definitions,
7868 including theory Multiset for multiset orderings; converted to
7869 new-style theory format;
7871 * ZF: many new theorems about lists, ordinals, etc.;
7876 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
7877 variable proof controls level of detail: 0 = no proofs (only oracle
7878 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
7879 also ref manual for further ML interfaces;
7881 * Pure/axclass: removed obsolete ML interface
7882 goal_subclass/goal_arity;
7884 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
7885 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
7886 separate tokens, so expressions involving minus need to be spaced
7889 * Pure/syntax: support non-oriented infixes, using keyword "infix"
7890 rather than "infixl" or "infixr";
7892 * Pure/syntax: concrete syntax for dummy type variables admits genuine
7893 sort constraint specifications in type inference; e.g. "x::_::foo"
7894 ensures that the type of "x" is of sort "foo" (but not necessarily a
7897 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
7898 control output of nested => (types); the default behavior is
7901 * Pure/syntax: builtin parse translation for "_constify" turns valued
7902 tokens into AST constants;
7904 * Pure/syntax: prefer later declarations of translations and print
7905 translation functions; potential INCOMPATIBILITY: need to reverse
7906 multiple declarations for same syntax element constant;
7908 * Pure/show_hyps reset by default (in accordance to existing Isar
7911 * Provers/classical: renamed addaltern to addafter, addSaltern to
7914 * Provers/clasimp: ``iff'' declarations now handle conditional rules
7917 * system: tested support for MacOS X; should be able to get Isabelle +
7918 Proof General to work in a plain Terminal after installing Poly/ML
7919 (e.g. from the Isabelle distribution area) and GNU bash alone
7920 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
7921 support requires further installations, e.g. from
7922 http://fink.sourceforge.net/);
7924 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
7926 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
7927 of 40 MB), cf. ML_OPTIONS;
7929 * system: Proof General keywords specification is now part of the
7930 Isabelle distribution (see etc/isar-keywords.el);
7932 * system: support for persistent Proof General sessions (refrain from
7933 outdating all loaded theories on startup); user may create writable
7934 logic images like this: ``isabelle -q HOL Test'';
7936 * system: smart selection of Isabelle process versus Isabelle
7937 interface, accommodates case-insensitive file systems (e.g. HFS+); may
7938 run both "isabelle" and "Isabelle" even if file names are badly
7939 damaged (executable inspects the case of the first letter of its own
7940 name); added separate "isabelle-process" and "isabelle-interface";
7942 * system: refrain from any attempt at filtering input streams; no
7943 longer support ``8bit'' encoding of old isabelle font, instead proper
7944 iso-latin characters may now be used; the related isatools
7945 "symbolinput" and "nonascii" have disappeared as well;
7947 * system: removed old "xterm" interface (the print modes "xterm" and
7948 "xterm_color" are still available for direct use in a suitable
7953 New in Isabelle99-2 (February 2001)
7954 -----------------------------------
7956 *** Overview of INCOMPATIBILITIES ***
7958 * HOL: please note that theories in the Library and elsewhere often use the
7959 new-style (Isar) format; to refer to their theorems in an ML script you must
7960 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
7962 * HOL: inductive package no longer splits induction rule aggressively,
7963 but only as far as specified by the introductions given; the old
7964 format may be recovered via ML function complete_split_rule or attribute
7965 'split_rule (complete)';
7967 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
7968 gfp_Tarski to gfp_unfold;
7970 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
7972 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
7973 relation); infix "^^" has been renamed "``"; infix "``" has been
7974 renamed "`"; "univalent" has been renamed "single_valued";
7976 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
7979 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
7981 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
7983 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
7984 consequence, it is no longer monotonic wrt. the local goal context
7985 (which is now passed through the inductive cases);
7987 * Document preparation: renamed standard symbols \<ll> to \<lless> and
7988 \<gg> to \<ggreater>;
7991 *** Document preparation ***
7993 * \isabellestyle{NAME} selects version of Isabelle output (currently
7994 available: are "it" for near math-mode best-style output, "sl" for
7995 slanted text style, and "tt" for plain type-writer; if no
7996 \isabellestyle command is given, output is according to slanted
7999 * support sub/super scripts (for single symbols only), input syntax is
8000 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8002 * some more standard symbols; see Appendix A of the system manual for
8003 the complete list of symbols defined in isabellesym.sty;
8005 * improved isabelle style files; more abstract symbol implementation
8006 (should now use \isamath{...} and \isatext{...} in custom symbol
8009 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8010 state; Note that presentation of goal states does not conform to
8011 actual human-readable proof documents. Please do not include goal
8012 states into document output unless you really know what you are doing!
8014 * proper indentation of antiquoted output with proportional LaTeX
8017 * no_document ML operator temporarily disables LaTeX document
8020 * isatool unsymbolize tunes sources for plain ASCII communication;
8025 * Pure: Isar now suffers initial goal statements to contain unbound
8026 schematic variables (this does not conform to actual readable proof
8027 documents, due to unpredictable outcome and non-compositional proof
8028 checking); users who know what they are doing may use schematic goals
8029 for Prolog-style synthesis of proven results;
8031 * Pure: assumption method (an implicit finishing) now handles actual
8034 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8035 initial goal, declare "that" only as Pure intro (only for single
8036 steps); the "that" rule assumption may now be involved in implicit
8037 finishing, thus ".." becomes a feasible for trivial obtains;
8039 * Pure: default proof step now includes 'intro_classes'; thus trivial
8040 instance proofs may be performed by "..";
8042 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8045 * Pure: more robust selection of calculational rules;
8047 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8048 rule (as well as the assumption rule);
8050 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8051 lemmas, using the graph browser tool;
8053 * Pure: predict failure of "show" in interactive mode;
8055 * Pure: 'thms_containing' now takes actual terms as arguments;
8057 * HOL: improved method 'induct' --- now handles non-atomic goals
8058 (potential INCOMPATIBILITY); tuned error handling;
8060 * HOL: cases and induct rules now provide explicit hints about the
8061 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8062 any remaining facts are inserted into the goal verbatim;
8064 * HOL: local contexts (aka cases) may now contain term bindings as
8065 well; the 'cases' and 'induct' methods new provide a ?case binding for
8066 the result to be shown in each case;
8068 * HOL: added 'recdef_tc' command;
8070 * isatool convert assists in eliminating legacy ML scripts;
8075 * HOL/Library: a collection of generic theories to be used together
8076 with main HOL; the theory loader path already includes this directory
8077 by default; the following existing theories have been moved here:
8078 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8079 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8081 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8082 modelling and verification task performed in Isabelle/HOL +
8083 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8085 * HOL/Algebra: special summation operator SUM no longer exists, it has
8086 been replaced by setsum; infix 'assoc' now has priority 50 (like
8087 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8088 'domain', this makes the theory consistent with mathematical
8091 * HOL basics: added overloaded operations "inverse" and "divide"
8092 (infix "/"), syntax for generic "abs" operation, generic summation
8095 * HOL/typedef: simplified package, provide more useful rules (see also
8098 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8099 now expressed as a proper nested rule (old-style tactic scripts may
8100 require atomize_strip_tac to cope with non-atomic premises);
8102 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8103 to "split_conv" (old name still available for compatibility);
8105 * HOL: improved concrete syntax for strings (e.g. allows translation
8106 rules with string literals);
8108 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8109 and Fleuriot's mechanization of analysis, including the transcendental
8110 functions for the reals;
8112 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8117 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8118 "lam" is displayed as TWO lambda-symbols
8120 * CTT: theory Main now available, containing everything (that is, Bool
8126 * Pure: the Simplifier has been implemented properly as a derived rule
8127 outside of the actual kernel (at last!); the overall performance
8128 penalty in practical applications is about 50%, while reliability of
8129 the Isabelle inference kernel has been greatly improved;
8131 * print modes "brackets" and "no_brackets" control output of nested =>
8132 (types) and ==> (props); the default behaviour is "brackets";
8134 * Provers: fast_tac (and friends) now handle actual object-logic rules
8135 as assumptions as well;
8137 * system: support Poly/ML 4.0;
8139 * system: isatool install handles KDE version 1 or 2;
8143 New in Isabelle99-1 (October 2000)
8144 ----------------------------------
8146 *** Overview of INCOMPATIBILITIES ***
8148 * HOL: simplification of natural numbers is much changed; to partly
8149 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8150 issue the following ML commands:
8152 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8153 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8155 * HOL: simplification no longer dives into case-expressions; this is
8156 controlled by "t.weak_case_cong" for each datatype t;
8158 * HOL: nat_less_induct renamed to less_induct;
8160 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8161 fixsome to patch .thy and .ML sources automatically;
8163 select_equality -> some_equality
8164 select_eq_Ex -> some_eq_ex
8165 selectI2EX -> someI2_ex
8168 select1_equality -> some1_equality
8169 Eps_sym_eq -> some_sym_eq_trivial
8170 Eps_eq -> some_eq_trivial
8172 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8174 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8177 * HOL: the recursion equations generated by 'recdef' are now called
8178 f.simps instead of f.rules;
8180 * HOL: qed_spec_mp now also handles bounded ALL as well;
8182 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8183 sometimes be needed;
8185 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8187 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8189 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8190 product is now "<*>" instead of "Times"; the lexicographic product is
8191 now "<*lex*>" instead of "**";
8193 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8194 of main HOL, but was unused); better use HOL's datatype package;
8196 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8197 the old syntax may be recovered as follows:
8200 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8201 (infixl "\\<oplus>" 100)
8203 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8205 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8206 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8209 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8210 changed from A/r to A//r;
8212 * ZF: new treatment of arithmetic (nat & int) may break some old
8215 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8216 rulify -> rule_format, elimify -> elim_format, ...);
8218 * Isar/Provers: intro/elim/dest attributes changed; renamed
8219 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8220 should have to change intro!! to intro? only); replaced "delrule" by
8223 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8225 * Provers: strengthened force_tac by using new first_best_tac;
8227 * LaTeX document preparation: several changes of isabelle.sty (see
8231 *** Document preparation ***
8233 * formal comments (text blocks etc.) in new-style theories may now
8234 contain antiquotations of thm/prop/term/typ/text to be presented
8235 according to latex print mode; concrete syntax is like this:
8236 @{term[show_types] "f(x) = a + x"};
8238 * isatool mkdir provides easy setup of Isabelle session directories,
8239 including proper document sources;
8241 * generated LaTeX sources are now deleted after successful run
8242 (isatool document -c); may retain a copy somewhere else via -D option
8245 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8246 style files, achieving self-contained LaTeX sources and simplifying
8249 * old-style theories now produce (crude) LaTeX output as well;
8251 * browser info session directories are now self-contained (may be put
8252 on WWW server seperately); improved graphs of nested sessions; removed
8253 graph for 'all sessions';
8255 * several improvements in isabelle style files; \isabellestyle{it}
8256 produces fake math mode output; \isamarkupheader is now \section by
8257 default; see lib/texinputs/isabelle.sty etc.;
8262 * Isar/Pure: local results and corresponding term bindings are now
8263 subject to Hindley-Milner polymorphism (similar to ML); this
8264 accommodates incremental type-inference very nicely;
8266 * Isar/Pure: new derived language element 'obtain' supports
8267 generalized existence reasoning;
8269 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8270 support accumulation of results, without applying any rules yet;
8271 useful to collect intermediate results without explicit name
8272 references, and for use with transitivity rules with more than 2
8275 * Isar/Pure: scalable support for case-analysis type proofs: new
8276 'case' language element refers to local contexts symbolically, as
8277 produced by certain proof methods; internally, case names are attached
8278 to theorems as "tags";
8280 * Isar/Pure: theory command 'hide' removes declarations from
8281 class/type/const name spaces;
8283 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8284 indicate potential overloading;
8286 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8288 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8289 "{a,b,c}" instead of {a,b,c};
8291 * Isar/Pure now provides its own version of intro/elim/dest
8292 attributes; useful for building new logics, but beware of confusion
8293 with the version in Provers/classical;
8295 * Isar/Pure: the local context of (non-atomic) goals is provided via
8296 case name 'antecedent';
8298 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8299 to the current context is now done automatically);
8301 * Isar/Pure: theory command 'method_setup' provides a simple interface
8302 for definining proof methods in ML;
8304 * Isar/Provers: intro/elim/dest attributes changed; renamed
8305 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8306 most cases, one should have to change intro!! to intro? only);
8307 replaced "delrule" by "rule del";
8309 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8310 'symmetric' attribute (the latter supercedes [RS sym]);
8312 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8313 method modifier); 'simp' method: 'only:' modifier removes loopers as
8314 well (including splits);
8316 * Isar/Provers: Simplifier and Classical methods now support all kind
8317 of modifiers used in the past, including 'cong', 'iff', etc.
8319 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8320 of Simplifier and Classical reasoner);
8322 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8323 now support named cases; major packages (inductive, datatype, primrec,
8324 recdef) support case names and properly name parameters;
8326 * Isar/HOL: new transitivity rules for substitution in inequalities --
8327 monotonicity conditions are extracted to be proven at end of
8330 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8333 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8334 split_if split_if_asm; datatype package provides theorems foo.splits =
8335 foo.split foo.split_asm for each datatype;
8337 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8338 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8339 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8340 use "(cases (simplified))" method in proper proof texts);
8342 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8344 * Isar: names of theorems etc. may be natural numbers as well;
8346 * Isar: 'pr' command: optional arguments for goals_limit and
8347 ProofContext.prems_limit; no longer prints theory contexts, but only
8350 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8351 additional print modes to be specified; e.g. "pr(latex)" will print
8352 proof state according to the Isabelle LaTeX style;
8354 * Isar: improved support for emulating tactic scripts, including proof
8355 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8356 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8357 (for HOL datatypes);
8359 * Isar: simplified (more robust) goal selection of proof methods: 1st
8360 goal, all goals, or explicit goal specifier (tactic emulation); thus
8361 'proof method scripts' have to be in depth-first order;
8363 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8365 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8366 should instead use individual commands for printing items
8367 (print_commands, print_methods etc.);
8369 * Isar: added 'nothing' --- the empty list of theorems;
8374 * HOL/MicroJava: formalization of a fragment of Java, together with a
8375 corresponding virtual machine and a specification of its bytecode
8376 verifier and a lightweight bytecode verifier, including proofs of
8377 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8378 Cornelia Pusch (see also the homepage of project Bali at
8379 http://isabelle.in.tum.de/Bali/);
8381 * HOL/Algebra: new theory of rings and univariate polynomials, by
8384 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8385 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8388 * HOL/Lattice: fundamental concepts of lattice theory and order
8389 structures, including duals, properties of bounds versus algebraic
8390 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8391 Theorem for complete lattices etc.; may also serve as a demonstration
8392 for abstract algebraic reasoning using axiomatic type classes, and
8393 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8395 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8398 * HOL/IMPP: extension of IMP with local variables and mutually
8399 recursive procedures, by David von Oheimb;
8401 * HOL/Lambda: converted into new-style theory and document;
8403 * HOL/ex/Multiquote: example of multiple nested quotations and
8404 anti-quotations -- basically a generalized version of de-Bruijn
8405 representation; very useful in avoiding lifting of operations;
8407 * HOL/record: added general record equality rule to simpset; fixed
8408 select-update simplification procedure to handle extended records as
8409 well; admit "r" as field name;
8411 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8412 other numeric types and also as the identity of groups, rings, etc.;
8414 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8415 Types nat and int belong to this axclass;
8417 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8418 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8419 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8420 two terms #m*u and #n*u are replaced by #(m+n)*u
8421 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8422 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8423 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8425 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8426 powerful prover for predicate logic but knows nothing of clasets; see
8427 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8429 * HOL: new version of "case_tac" subsumes both boolean case split and
8430 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8431 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8433 * HOL: simplification no longer dives into case-expressions: only the
8434 selector expression is simplified, but not the remaining arms; to
8435 enable full simplification of case-expressions for datatype t, you may
8436 remove t.weak_case_cong from the simpset, either globally (Delcongs
8437 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8439 * HOL/recdef: the recursion equations generated by 'recdef' for
8440 function 'f' are now called f.simps instead of f.rules; if all
8441 termination conditions are proved automatically, these simplification
8442 rules are added to the simpset, as in primrec; rules may be named
8443 individually as well, resulting in a separate list of theorems for
8446 * HOL/While is a new theory that provides a while-combinator. It
8447 permits the definition of tail-recursive functions without the
8448 provision of a termination measure. The latter is necessary once the
8449 invariant proof rule for while is applied.
8451 * HOL: new (overloaded) notation for the set of elements below/above
8452 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8454 * HOL: theorems impI, allI, ballI bound as "strip";
8456 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8457 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8458 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8460 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8462 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8463 main HOL, but was unused);
8465 * HOL: fewer consts declared as global (e.g. have to refer to
8466 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8468 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8469 in case of overlap with user translations (e.g. judgements over
8470 tuples); (note that the underlying logical represenation is still
8476 * ZF: simplification automatically cancels common terms in arithmetic
8477 expressions over nat and int;
8479 * ZF: new treatment of nat to minimize type-checking: all operators
8480 coerce their operands to a natural number using the function natify,
8481 making the algebraic laws unconditional;
8483 * ZF: as above, for int: operators coerce their operands to an integer
8484 using the function intify;
8486 * ZF: the integer library now contains many of the usual laws for the
8487 orderings, including $<=, and monotonicity laws for $+ and $*;
8489 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8492 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8493 to the simplifier and classical reasoner simultaneously;
8498 * Provers: blast_tac now handles actual object-logic rules as
8499 assumptions; note that auto_tac uses blast_tac internally as well;
8501 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8502 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8504 * Provers: delrules now handles destruct rules as well (no longer need
8505 explicit make_elim);
8507 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8508 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8509 use instead the strong form,
8510 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8511 in HOL, FOL and ZF the function cla_make_elim will create such rules
8512 from destruct-rules;
8514 * Provers: Simplifier.easy_setup provides a fast path to basic
8515 Simplifier setup for new object-logics;
8517 * Pure: AST translation rules no longer require constant head on LHS;
8519 * Pure: improved name spaces: ambiguous output is qualified; support
8520 for hiding of names;
8522 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8523 XSYMBOL_HOME; no longer need to do manual configuration in most
8526 * system: compression of ML heaps images may now be controlled via -c
8527 option of isabelle and isatool usedir (currently only observed by
8530 * system: isatool installfonts may handle X-Symbol fonts as well (very
8531 useful for remote X11);
8533 * system: provide TAGS file for Isabelle sources;
8535 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8538 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8539 timing flag supersedes proof_timing and Toplevel.trace;
8541 * ML: new combinators |>> and |>>> for incremental transformations
8542 with secondary results (e.g. certain theory extensions):
8544 * ML: PureThy.add_defs gets additional argument to indicate potential
8545 overloading (usually false);
8547 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8552 New in Isabelle99 (October 1999)
8553 --------------------------------
8555 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8557 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8558 are no longer simplified. (This allows the simplifier to unfold recursive
8559 functional programs.) To restore the old behaviour, declare
8561 Delcongs [if_weak_cong];
8563 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8566 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8568 * HOL/datatype: mutual_induct_tac no longer exists --
8569 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8571 * HOL/typedef: fixed type inference for representing set; type
8572 arguments now have to occur explicitly on the rhs as type constraints;
8574 * ZF: The con_defs part of an inductive definition may no longer refer
8575 to constants declared in the same theory;
8577 * HOL, ZF: the function mk_cases, generated by the inductive
8578 definition package, has lost an argument. To simplify its result, it
8579 uses the default simpset instead of a supplied list of theorems.
8581 * HOL/List: the constructors of type list are now Nil and Cons;
8583 * Simplifier: the type of the infix ML functions
8584 setSSolver addSSolver setSolver addSolver
8585 is now simpset * solver -> simpset where `solver' is a new abstract type
8586 for packaging solvers. A solver is created via
8587 mk_solver: string -> (thm list -> int -> tactic) -> solver
8588 where the string argument is only a comment.
8593 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8594 decision procedure for linear arithmetic. Currently it is used for
8595 types `nat', `int', and `real' in HOL (see below); it can, should and
8596 will be instantiated for other types and logics as well.
8598 * The simplifier now accepts rewrite rules with flexible heads, eg
8599 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8600 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8606 * New Isabelle/Isar subsystem provides an alternative to traditional
8607 tactical theorem proving; together with the ProofGeneral/isar user
8608 interface it offers an interactive environment for developing human
8609 readable proof documents (Isar == Intelligible semi-automated
8610 reasoning); for further information see isatool doc isar-ref,
8611 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8613 * improved and simplified presentation of theories: better HTML markup
8614 (including colors), graph views in several sizes; isatool usedir now
8615 provides a proper interface for user theories (via -P option); actual
8616 document preparation based on (PDF)LaTeX is available as well (for
8617 new-style theories only); see isatool doc system for more information;
8619 * native support for Proof General, both for classic Isabelle and
8622 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8623 using the graph browser tool;
8625 * Isabelle manuals now also available as PDF;
8627 * theory loader rewritten from scratch (may not be fully
8628 bug-compatible); old loadpath variable has been replaced by show_path,
8629 add_path, del_path, reset_path functions; new operations such as
8630 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8633 * improved isatool install: option -k creates KDE application icon,
8634 option -p DIR installs standalone binaries;
8636 * added ML_PLATFORM setting (useful for cross-platform installations);
8637 more robust handling of platform specific ML images for SML/NJ;
8639 * the settings environment is now statically scoped, i.e. it is never
8640 created again in sub-processes invoked from isabelle, isatool, or
8643 * path element specification '~~' refers to '$ISABELLE_HOME';
8645 * in locales, the "assumes" and "defines" parts may be omitted if
8648 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8651 * new print_mode "HTML";
8653 * new flag show_tags controls display of tags of theorems (which are
8654 basically just comments that may be attached by some tools);
8656 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8657 mode and goal output format:
8659 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8661 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8663 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8664 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8666 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8668 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8670 * function bind_thms stores lists of theorems (cf. bind_thm);
8672 * new shorthand tactics ftac, eatac, datac, fatac;
8674 * qed (and friends) now accept "" as result name; in that case the
8675 theorem is not stored, but proper checks and presentation of the
8678 * theorem database now also indexes constants "Trueprop", "all",
8679 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8684 ** HOL arithmetic **
8686 * There are now decision procedures for linear arithmetic over nat and
8689 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8690 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8691 are treated as atomic; subformulae not involving type `nat' or `int'
8692 are ignored; quantified subformulae are ignored unless they are
8693 positive universal or negative existential. The tactic has to be
8694 invoked by hand and can be a little bit slow. In particular, the
8695 running time is exponential in the number of occurrences of `min' and
8696 `max', and `-' on `nat'.
8698 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8699 (negated) (in)equalities among the premises and the conclusion into
8700 account (i.e. no compound formulae) and does not know about `min' and
8701 `max', and `-' on `nat'. It is fast and is used automatically by the
8704 NB: At the moment, these decision procedures do not cope with mixed
8705 nat/int formulae where the two parts interact, such as `m < n ==>
8708 * HOL/Numeral provides a generic theory of numerals (encoded
8709 efficiently as bit strings); setup for types nat/int/real is in place;
8710 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8711 int, existing theories and proof scripts may require a few additional
8714 * integer division and remainder can now be performed on constant
8717 * many properties of integer multiplication, division and remainder
8720 * An interface to the Stanford Validity Checker (SVC) is available through the
8721 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8722 are proved automatically. SVC must be installed separately, and its results
8723 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8724 invocation of the underlying oracle). For SVC see
8725 http://verify.stanford.edu/SVC
8727 * IsaMakefile: the HOL-Real target now builds an actual image;
8732 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8733 (in Isabelle/Isar) -- by Gertrud Bauer;
8735 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8736 analysis for assembly languages with subtypes;
8738 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8739 -- avoids syntactic ambiguities and treats state, transition, and
8740 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8741 changed syntax and (many) tactics;
8743 * HOL/inductive: Now also handles more general introduction rules such
8744 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8745 theorems are now maintained within the theory (maintained via the
8748 * HOL/datatype: Now also handles arbitrarily branching datatypes
8749 (using function types) such as
8751 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8753 * HOL/record: record_simproc (part of the default simpset) takes care
8754 of selectors applied to updated records; record_split_tac is no longer
8755 part of the default claset; update_defs may now be removed from the
8756 simpset in many cases; COMPATIBILITY: old behavior achieved by
8758 claset_ref () := claset() addSWrapper record_split_wrapper;
8759 Delsimprocs [record_simproc]
8761 * HOL/typedef: fixed type inference for representing set; type
8762 arguments now have to occur explicitly on the rhs as type constraints;
8764 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8765 names rather than an ML expression;
8767 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8768 supplied later. Program schemes can be defined, such as
8769 "While B C s = (if B s then While B C (C s) else s)"
8770 where the well-founded relation can be chosen after B and C have been given.
8772 * HOL/List: the constructors of type list are now Nil and Cons;
8773 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8774 course, ML tools referring to List.list.op # etc. have to be adapted;
8776 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8777 disabled by default; run isabelle with option -m HOL to get back to
8778 the original Gordon/HOL-style output;
8780 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8781 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8783 * HOL basic syntax simplified (more orthogonal): all variants of
8784 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8785 Eps operator is provided as well: "SOME x. P[x]";
8787 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8789 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8790 thus available for user theories;
8792 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8793 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8796 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8797 several times and then mp;
8802 * the notation <<...>> is now available as a notation for sequences of
8805 * the simplifier is now installed
8807 * the axiom system has been generalized (thanks to Soren Heilmann)
8809 * the classical reasoner now has a default rule database
8814 * new primrec section allows primitive recursive functions to be given
8815 directly (as in HOL) over datatypes and the natural numbers;
8817 * new tactics induct_tac and exhaust_tac for induction (or case
8818 analysis) over datatypes and the natural numbers;
8820 * the datatype declaration of type T now defines the recursor T_rec;
8822 * simplification automatically does freeness reasoning for datatype
8825 * automatic type-inference, with AddTCs command to insert new
8826 type-checking rules;
8828 * datatype introduction rules are now added as Safe Introduction rules
8831 * the syntax "if P then x else y" is now available in addition to
8835 *** Internal programming interfaces ***
8837 * tuned simplifier trace output; new flag debug_simp;
8839 * structures Vartab / Termtab (instances of TableFun) offer efficient
8840 tables indexed by indexname_ord / term_ord (compatible with aconv);
8842 * AxClass.axclass_tac lost the theory argument;
8844 * tuned current_goals_markers semantics: begin / end goal avoids
8845 printing empty lines;
8847 * removed prs and prs_fn hook, which was broken because it did not
8848 include \n in its semantics, forcing writeln to add one
8849 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8850 string -> unit if you really want to output text without newline;
8852 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8853 plain output, interface builders may have to enable 'isabelle_font'
8854 mode to get Isabelle font glyphs as before;
8856 * refined token_translation interface; INCOMPATIBILITY: output length
8857 now of type real instead of int;
8859 * theory loader actions may be traced via new ThyInfo.add_hook
8860 interface (see src/Pure/Thy/thy_info.ML); example application: keep
8861 your own database of information attached to *whole* theories -- as
8862 opposed to intra-theory data slots offered via TheoryDataFun;
8864 * proper handling of dangling sort hypotheses (at last!);
8865 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
8866 extra sort hypotheses that can be witnessed from the type signature;
8867 the force_strip_shyps flag is gone, any remaining shyps are simply
8868 left in the theorem (with a warning issued by strip_shyps_warning);
8872 New in Isabelle98-1 (October 1998)
8873 ----------------------------------
8875 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8877 * several changes of automated proof tools;
8879 * HOL: major changes to the inductive and datatype packages, including
8880 some minor incompatibilities of theory syntax;
8882 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
8885 * HOL: removed duplicate thms in Arith:
8886 less_imp_add_less should be replaced by trans_less_add1
8887 le_imp_add_le should be replaced by trans_le_add1
8889 * HOL: unary minus is now overloaded (new type constraints may be
8892 * HOL and ZF: unary minus for integers is now #- instead of #~. In
8893 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
8894 now taken as an integer constant.
8896 * Pure: ML function 'theory_of' renamed to 'theory';
8902 1. Asm_full_simp_tac is now more aggressive.
8903 1. It will sometimes reorient premises if that increases their power to
8905 2. It does no longer proceed strictly from left to right but may also
8906 rotate premises to achieve further simplification.
8907 For compatibility reasons there is now Asm_lr_simp_tac which is like the
8908 old Asm_full_simp_tac in that it does not rotate premises.
8909 2. The simplifier now knows a little bit about nat-arithmetic.
8911 * Classical reasoner: wrapper mechanism for the classical reasoner now
8912 allows for selected deletion of wrappers, by introduction of names for
8913 wrapper functionals. This implies that addbefore, addSbefore,
8914 addaltern, and addSaltern now take a pair (name, tactic) as argument,
8915 and that adding two tactics with the same name overwrites the first
8916 one (emitting a warning).
8917 type wrapper = (int -> tactic) -> (int -> tactic)
8918 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
8919 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
8920 delWrapper, delSWrapper: claset * string -> claset
8921 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
8923 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
8924 semantics; addbefore now affects only the unsafe part of step_tac
8925 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
8926 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
8929 * Classical reasoner: setwrapper to setWrapper and compwrapper to
8930 compWrapper; added safe wrapper (and access functions for it);
8932 * HOL/split_all_tac is now much faster and fails if there is nothing
8933 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
8934 and the names of the automatically generated variables have changed.
8935 split_all_tac has moved within claset() from unsafe wrappers to safe
8936 wrappers, which means that !!-bound variables are split much more
8937 aggressively, and safe_tac and clarify_tac now split such variables.
8938 If this splitting is not appropriate, use delSWrapper "split_all_tac".
8939 Note: the same holds for record_split_tac, which does the job of
8940 split_all_tac for record fields.
8942 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
8943 permanently to the default simpset using Addsplits just like
8944 Addsimps. They can be removed via Delsplits just like
8945 Delsimps. Lower-case versions are also available.
8947 * HOL/Simplifier: The rule split_if is now part of the default
8948 simpset. This means that the simplifier will eliminate all occurrences
8949 of if-then-else in the conclusion of a goal. To prevent this, you can
8950 either remove split_if completely from the default simpset by
8951 `Delsplits [split_if]' or remove it in a specific call of the
8952 simplifier using `... delsplits [split_if]'. You can also add/delete
8953 other case splitting rules to/from the default simpset: every datatype
8954 generates suitable rules `split_t_case' and `split_t_case_asm' (where
8955 t is the name of the datatype).
8957 * Classical reasoner / Simplifier combination: new force_tac (and
8958 derivatives Force_tac, force) combines rewriting and classical
8959 reasoning (and whatever other tools) similarly to auto_tac, but is
8960 aimed to solve the given subgoal completely.
8965 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
8966 and `goalw': the theory is no longer needed as an explicit argument -
8967 the current theory context is used; assumptions are no longer returned
8968 at the ML-level unless one of them starts with ==> or !!; it is
8969 recommended to convert to these new commands using isatool fixgoal
8970 (backup your sources first!);
8972 * new top-level commands 'thm' and 'thms' for retrieving theorems from
8973 the current theory context, and 'theory' to lookup stored theories;
8975 * new theory section 'locale' for declaring constants, assumptions and
8976 definitions that have local scope;
8978 * new theory section 'nonterminals' for purely syntactic types;
8980 * new theory section 'setup' for generic ML setup functions
8981 (e.g. package initialization);
8983 * the distribution now includes Isabelle icons: see
8984 lib/logo/isabelle-{small,tiny}.xpm;
8986 * isatool install - install binaries with absolute references to
8989 * isatool logo -- create instances of the Isabelle logo (as EPS);
8991 * print mode 'emacs' reserved for Isamode;
8993 * support multiple print (ast) translations per constant name;
8995 * theorems involving oracles are now printed with a suffixed [!];
9000 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9002 * HOL/inductive package reorganized and improved: now supports mutual
9008 oddI "n : EVEN ==> Suc n : ODD"
9009 evenI "n : ODD ==> Suc n : EVEN"
9011 new theorem list "elims" contains an elimination rule for each of the
9012 recursive sets; inductive definitions now handle disjunctive premises
9013 correctly (also ZF);
9015 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9016 "mutual_induct" no longer exists - the induction rule is always
9017 contained in "induct";
9020 * HOL/datatype package re-implemented and greatly improved: now
9021 supports mutually recursive datatypes such as
9024 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9025 | SUM ('a aexp) ('a aexp)
9026 | DIFF ('a aexp) ('a aexp)
9029 'a bexp = LESS ('a aexp) ('a aexp)
9030 | AND ('a bexp) ('a bexp)
9031 | OR ('a bexp) ('a bexp)
9033 as well as indirectly recursive datatypes such as
9036 ('a, 'b) term = Var 'a
9037 | App 'b ((('a, 'b) term) list)
9039 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9040 induction on mutually / indirectly recursive datatypes.
9042 Primrec equations are now stored in theory and can be accessed via
9043 <function_name>.simps.
9047 - Theories using datatypes must now have theory Datatype as an
9049 - The specific <typename>.induct_tac no longer exists - use the
9050 generic induct_tac instead.
9051 - natE has been renamed to nat.exhaust - use exhaust_tac
9052 instead of res_inst_tac ... natE. Note that the variable
9053 names in nat.exhaust differ from the names in natE, this
9054 may cause some "fragile" proofs to fail.
9055 - The theorems split_<typename>_case and split_<typename>_case_asm
9056 have been renamed to <typename>.split and <typename>.split_asm.
9057 - Since default sorts of type variables are now handled correctly,
9058 some datatype definitions may have to be annotated with explicit
9060 - Primrec definitions no longer require function name and type
9061 of recursive argument.
9063 Consider using isatool fixdatatype to adapt your theories and proof
9064 scripts to the new package (backup your sources first!).
9067 * HOL/record package: considerably improved implementation; now
9068 includes concrete syntax for record types, terms, updates; theorems
9069 for surjective pairing and splitting !!-bound record variables; proof
9070 support is as follows:
9072 1) standard conversions (selectors or updates applied to record
9073 constructor terms) are part of the standard simpset;
9075 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9076 made part of standard simpset and claset via addIffs;
9078 3) a tactic for record field splitting (record_split_tac) is part of
9079 the standard claset (addSWrapper);
9081 To get a better idea about these rules you may retrieve them via
9082 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9083 the name of your record type.
9085 The split tactic 3) conceptually simplifies by the following rule:
9087 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9089 Thus any record variable that is bound by meta-all will automatically
9090 blow up into some record constructor term, consequently the
9091 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9092 solve record problems automatically.
9095 * reorganized the main HOL image: HOL/Integ and String loaded by
9096 default; theory Main includes everything;
9098 * automatic simplification of integer sums and comparisons, using cancellation;
9100 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9102 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9104 * many new identities for unions, intersections, set difference, etc.;
9106 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9107 called split_if, split_split, split_sum_case and split_nat_case (to go
9108 with add/delsplits);
9110 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9111 (?x::unit) = (); this is made part of the default simpset, which COULD
9112 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9113 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9114 unit_abs_eta_conv is added in order to counter the effect of
9115 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9118 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9121 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9122 It and 'sym RS equals0D' are now in the default claset, giving automatic
9123 disjointness reasoning but breaking a few old proofs.
9125 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9126 to 'converse' from 'inverse' (for compatibility with ZF and some
9129 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9130 the well-founded relation;
9132 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9133 Compl A. The "Compl" syntax remains available as input syntax for this
9136 * HOL/Update: new theory of function updates:
9137 f(a:=b) == %x. if x=a then b else f x
9138 may also be iterated as in f(a:=b,c:=d,...);
9140 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9143 - new function list_update written xs[i:=v] that updates the i-th
9144 list position. May also be iterated as in xs[i:=a,j:=b,...].
9145 - new function `upt' written [i..j(] which generates the list
9146 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9147 bound write [i..j], which is a shorthand for [i..j+1(].
9148 - new lexicographic orderings and corresponding wellfoundedness theorems.
9151 - removed 'pred' (predecessor) function;
9152 - generalized some theorems about n-1;
9153 - many new laws about "div" and "mod";
9154 - new laws about greatest common divisors (see theory ex/Primes);
9156 * HOL/Relation: renamed the relational operator r^-1 "converse"
9157 instead of "inverse";
9159 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9160 of the multiset ordering;
9162 * directory HOL/Real: a construction of the reals using Dedekind cuts
9163 (not included by default);
9165 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9167 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9168 programs, i.e. different program variables may have different types.
9170 * calling (stac rew i) now fails if "rew" has no effect on the goal
9171 [previously, this check worked only if the rewrite rule was unconditional]
9172 Now rew can involve either definitions or equalities (either == or =).
9177 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9178 only the theorems proved on ZF.ML;
9180 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9181 It and 'sym RS equals0D' are now in the default claset, giving automatic
9182 disjointness reasoning but breaking a few old proofs.
9184 * ZF/Update: new theory of function updates
9185 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9186 may also be iterated as in f(a:=b,c:=d,...);
9188 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9190 * calling (stac rew i) now fails if "rew" has no effect on the goal
9191 [previously, this check worked only if the rewrite rule was unconditional]
9192 Now rew can involve either definitions or equalities (either == or =).
9194 * case_tac provided for compatibility with HOL
9195 (like the old excluded_middle_tac, but with subgoals swapped)
9198 *** Internal programming interfaces ***
9200 * Pure: several new basic modules made available for general use, see
9201 also src/Pure/README;
9203 * improved the theory data mechanism to support encapsulation (data
9204 kind name replaced by private Object.kind, acting as authorization
9205 key); new type-safe user interface via functor TheoryDataFun; generic
9206 print_data function becomes basically useless;
9208 * removed global_names compatibility flag -- all theory declarations
9209 are qualified by default;
9211 * module Pure/Syntax now offers quote / antiquote translation
9212 functions (useful for Hoare logic etc. with implicit dependencies);
9213 see HOL/ex/Antiquote for an example use;
9215 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9218 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9221 * Display.print_goals function moved to Locale.print_goals;
9223 * standard print function for goals supports current_goals_markers
9224 variable for marking begin of proof, end of proof, start of goal; the
9225 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9226 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9231 New in Isabelle98 (January 1998)
9232 --------------------------------
9234 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9236 * changed lexical syntax of terms / types: dots made part of long
9237 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9239 * simpset (and claset) reference variable replaced by functions
9240 simpset / simpset_ref;
9242 * no longer supports theory aliases (via merge) and non-trivial
9243 implicit merge of thms' signatures;
9245 * most internal names of constants changed due to qualified names;
9247 * changed Pure/Sequence interface (see Pure/seq.ML);
9250 *** General Changes ***
9252 * hierachically structured name spaces (for consts, types, axms, thms
9253 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9254 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9255 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9256 long_names for fully qualified output names; NOTE: ML programs
9257 (special tactics, packages etc.) referring to internal names may have
9258 to be adapted to cope with fully qualified names; in case of severe
9259 backward campatibility problems try setting 'global_names' at compile
9260 time to have enrything declared within a flat name space; one may also
9261 fine tune name declarations in theories via the 'global' and 'local'
9264 * reimplemented the implicit simpset and claset using the new anytype
9265 data filed in signatures; references simpset:simpset ref etc. are
9266 replaced by functions simpset:unit->simpset and
9267 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9268 to patch your ML files accordingly;
9270 * HTML output now includes theory graph data for display with Java
9271 applet or isatool browser; data generated automatically via isatool
9272 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9274 * defs may now be conditional; improved rewrite_goals_tac to handle
9275 conditional equations;
9277 * defs now admits additional type arguments, using TYPE('a) syntax;
9279 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9280 creates a new theory node; implicit merge of thms' signatures is
9281 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9282 transfer:theory->thm->thm in (rare) cases;
9284 * improved handling of draft signatures / theories; draft thms (and
9285 ctyps, cterms) are automatically promoted to real ones;
9287 * slightly changed interfaces for oracles: admit many per theory, named
9288 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9290 * print_goals: optional output of const types (set show_consts and
9293 * improved output of warnings (###) and errors (***);
9295 * subgoal_tac displays a warning if the new subgoal has type variables;
9297 * removed old README and Makefiles;
9299 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9301 * removed obsolete init_pps and init_database;
9303 * deleted the obsolete tactical STATE, which was declared by
9304 fun STATE tacfun st = tacfun st st;
9306 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9307 (which abbreviates $HOME);
9309 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9310 use isatool fixseq to adapt your ML programs (this works for fully
9311 qualified references to the Sequence structure only!);
9313 * use_thy no longer requires writable current directory; it always
9314 reloads .ML *and* .thy file, if either one is out of date;
9317 *** Classical Reasoner ***
9319 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9320 tactics that use classical reasoning to simplify a subgoal without
9321 splitting it into several subgoals;
9323 * Safe_tac: like safe_tac but uses the default claset;
9328 * added simplification meta rules:
9329 (asm_)(full_)simplify: simpset -> thm -> thm;
9331 * simplifier.ML no longer part of Pure -- has to be loaded by object
9334 * added prems argument to simplification procedures;
9336 * HOL, FOL, ZF: added infix function `addsplits':
9337 instead of `<simpset> setloop (split_tac <thms>)'
9338 you can simply write `<simpset> addsplits <thms>'
9343 * TYPE('a) syntax for type reflection terms;
9345 * no longer handles consts with name "" -- declare as 'syntax' instead;
9347 * pretty printer: changed order of mixfix annotation preference (again!);
9349 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9354 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9355 with `addloop' of the simplifier to faciliate case splitting in premises.
9357 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9359 * HOL/Auth: new protocol proofs including some for the Internet
9362 * HOL/Map: new theory of `maps' a la VDM;
9364 * HOL/simplifier: simplification procedures nat_cancel_sums for
9365 cancelling out common nat summands from =, <, <= (in)equalities, or
9366 differences; simplification procedures nat_cancel_factor for
9367 cancelling common factor from =, <, <= (in)equalities over natural
9368 sums; nat_cancel contains both kinds of procedures, it is installed by
9369 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9371 * HOL/simplifier: terms of the form
9372 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9374 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9375 and those of the form
9376 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9378 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9381 Each datatype `t' now comes with a theorem `split_t_case' of the form
9383 P(t_case f1 ... fn x) =
9384 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9386 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9389 and a theorem `split_t_case_asm' of the form
9391 P(t_case f1 ... fn x) =
9392 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9394 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9396 which can be added to a simpset via `addsplits'. The existing theorems
9397 expand_list_case and expand_option_case have been renamed to
9398 split_list_case and split_option_case.
9401 - `pred n' is automatically converted to `n-1'.
9402 Users are strongly encouraged not to use `pred' any longer,
9403 because it will disappear altogether at some point.
9404 - Users are strongly encouraged to write "0 < n" rather than
9405 "n ~= 0". Theorems and proof tools have been modified towards this
9409 the function "set_of_list" has been renamed "set" (and its theorems too);
9410 the function "nth" now takes its arguments in the reverse order and
9411 has acquired the infix notation "!" as in "xs!n".
9413 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9415 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9416 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9418 * HOL/record: extensible records with schematic structural subtyping
9419 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9420 still lacks various theorems and concrete record syntax;
9425 * removed "axioms" and "generated by" sections;
9427 * replaced "ops" section by extended "consts" section, which is capable of
9428 handling the continuous function space "->" directly;
9431 . proves theorems immediately and stores them in the theory,
9432 . creates hierachical name space,
9433 . now uses normal mixfix annotations (instead of cinfix...),
9434 . minor changes to some names and values (for consistency),
9435 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9436 . separator between mutual domain defs: changed "," to "and",
9437 . improved handling of sort constraints; now they have to
9438 appear on the left-hand side of the equations only;
9440 * fixed LAM <x,y,zs>.b syntax;
9442 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9443 adm (%x. P (t x)), where P is chainfinite and t continuous;
9448 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9449 with `addloop' of the simplifier to faciliate case splitting in premises.
9451 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9452 in HOL, they strip ALL and --> from proved theorems;
9456 New in Isabelle94-8 (May 1997)
9457 ------------------------------
9459 *** General Changes ***
9461 * new utilities to build / run / maintain Isabelle etc. (in parts
9462 still somewhat experimental); old Makefiles etc. still functional;
9464 * new 'Isabelle System Manual';
9466 * INSTALL text, together with ./configure and ./build scripts;
9468 * reimplemented type inference for greater efficiency, better error
9469 messages and clean internal interface;
9471 * prlim command for dealing with lots of subgoals (an easier way of
9472 setting goals_limit);
9477 * supports alternative (named) syntax tables (parser and pretty
9478 printer); internal interface is provided by add_modesyntax(_i);
9480 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9481 be used in conjunction with the Isabelle symbol font; uses the
9482 "symbols" syntax table;
9484 * added token_translation interface (may translate name tokens in
9485 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9486 the current print_mode); IMPORTANT: user print translation functions
9487 are responsible for marking newly introduced bounds
9488 (Syntax.mark_boundT);
9490 * token translations for modes "xterm" and "xterm_color" that display
9491 names in bold, underline etc. or colors (which requires a color
9494 * infixes may now be declared with names independent of their syntax;
9496 * added typed_print_translation (like print_translation, but may
9497 access type of constant);
9500 *** Classical Reasoner ***
9502 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9503 some limitations. Blast_tac...
9504 + ignores addss, addbefore, addafter; this restriction is intrinsic
9505 + ignores elimination rules that don't have the correct format
9506 (the conclusion MUST be a formula variable)
9507 + ignores types, which can make HOL proofs fail
9508 + rules must not require higher-order unification, e.g. apply_type in ZF
9509 [message "Function Var's argument not a bound variable" relates to this]
9510 + its proof strategy is more general but can actually be slower
9512 * substitution with equality assumptions no longer permutes other
9515 * minor changes in semantics of addafter (now called addaltern); renamed
9516 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9517 (and access functions for it);
9519 * improved combination of classical reasoner and simplifier:
9520 + functions for handling clasimpsets
9521 + improvement of addss: now the simplifier is called _after_ the
9523 + safe variant of addss called addSss: uses safe simplifications
9524 _during_ the safe steps. It is more complete as it allows multiple
9525 instantiations of unknowns (e.g. with slow_tac).
9529 * added interface for simplification procedures (functions that
9530 produce *proven* rewrite rules on the fly, depending on current
9533 * ordering on terms as parameter (used for ordered rewriting);
9535 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9537 * the solver is now split into a safe and an unsafe part.
9538 This should be invisible for the normal user, except that the
9539 functions setsolver and addsolver have been renamed to setSolver and
9540 addSolver; added safe_asm_full_simp_tac;
9545 * a generic induction tactic `induct_tac' which works for all datatypes and
9546 also for type `nat';
9548 * a generic case distinction tactic `exhaust_tac' which works for all
9549 datatypes and also for type `nat';
9551 * each datatype comes with a function `size';
9553 * patterns in case expressions allow tuple patterns as arguments to
9554 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9556 * primrec now also works with type nat;
9558 * recdef: a new declaration form, allows general recursive functions to be
9559 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9561 * the constant for negation has been renamed from "not" to "Not" to
9562 harmonize with FOL, ZF, LK, etc.;
9564 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9567 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9569 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9570 problems in commutative rings, using axiomatic type classes for + and *;
9572 * more examples in HOL/MiniML and HOL/Auth;
9574 * more default rewrite rules for quantifiers, union/intersection;
9576 * a new constant `arbitrary == @x.False';
9578 * HOLCF/IOA replaces old HOL/IOA;
9580 * HOLCF changes: derived all rules and arities
9581 + axiomatic type classes instead of classes
9582 + typedef instead of faking type definitions
9583 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9584 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9585 + eliminated the types void, one, tr
9586 + use unit lift and bool lift (with translations) instead of one and tr
9587 + eliminated blift from Lift3.thy (use Def instead of blift)
9588 all eliminated rules are derived as theorems --> no visible changes ;
9593 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9594 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9595 as ZF_cs addSIs [equalityI];
9599 New in Isabelle94-7 (November 96)
9600 ---------------------------------
9602 * allowing negative levels (as offsets) in prlev and choplev;
9604 * super-linear speedup for large simplifications;
9606 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9607 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9608 FAIL); can suppress it using the command Delsimps (ex_simps @
9609 all_simps); De Morgan laws are also now included, by default;
9611 * improved printing of ==> : ~:
9613 * new object-logic "Sequents" adds linear logic, while replacing LK
9614 and Modal (thanks to Sara Kalvala);
9616 * HOL/Auth: correctness proofs for authentication protocols;
9618 * HOL: new auto_tac combines rewriting and classical reasoning (many
9619 examples on HOL/Auth);
9621 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9622 the rewriter and classical reasoner simultaneously;
9624 * function uresult no longer returns theorems in "standard" format;
9625 regain previous version by: val uresult = standard o uresult;
9632 * oracles -- these establish an interface between Isabelle and trusted
9633 external reasoners, which may deliver results as theorems;
9635 * proof objects (in particular record all uses of oracles);
9637 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9639 * "constdefs" section in theory files;
9641 * "primrec" section (HOL) no longer requires names;
9643 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9650 * reduced space requirements;
9652 * automatic HTML generation from theories;
9654 * theory files no longer require "..." (quotes) around most types;
9656 * new examples, including two proofs of the Church-Rosser theorem;
9658 * non-curried (1994) version of HOL is no longer distributed;
9665 * greatly reduced space requirements;
9667 * theory files (.thy) no longer require \...\ escapes at line breaks;
9669 * searchable theorem database (see the section "Retrieving theorems" on
9670 page 8 of the Reference Manual);
9672 * new examples, including Grabczewski's monumental case study of the
9675 * The previous version of HOL renamed to Old_HOL;
9677 * The new version of HOL (previously called CHOL) uses a curried syntax
9678 for functions. Application looks like f a b instead of f(a,b);
9680 * Mutually recursive inductive definitions finally work in HOL;
9682 * In ZF, pattern-matching on tuples is now available in all abstractions and
9683 translates to the operator "split";
9690 * new infix operator, addss, allowing the classical reasoner to
9691 perform simplification at each step of its search. Example:
9692 fast_tac (cs addss ss)
9694 * a new logic, CHOL, the same as HOL, but with a curried syntax
9695 for functions. Application looks like f a b instead of f(a,b). Also pairs
9696 look like (a,b) instead of <a,b>;
9698 * PLEASE NOTE: CHOL will eventually replace HOL!
9700 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9701 It translates to the operator "split". A new theory of integers is available;
9703 * In ZF, integer numerals now denote two's-complement binary integers.
9704 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9706 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9707 of the Axiom of Choice;
9714 * Significantly faster resolution;
9716 * the different sections in a .thy file can now be mixed and repeated
9719 * Database of theorems for FOL, HOL and ZF. New
9720 commands including qed, qed_goal and bind_thm store theorems in the database.
9722 * Simple database queries: return a named theorem (get_thm) or all theorems of
9723 a given theory (thms_of), or find out what theory a theorem was proved in
9726 * Bugs fixed in the inductive definition and datatype packages;
9728 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9729 and HOL_dup_cs obsolete;
9731 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9734 * Simpler definition of function space in ZF;
9736 * new results about cardinal and ordinal arithmetic in ZF;
9738 * 'subtype' facility in HOL for introducing new types as subsets of existing
9741 :mode=text:wrap=hard:maxLineLen=72: