1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Command 'ML_file' evaluates ML text from a file directly within the
10 theory, without any predeclaration via 'uses' in the theory header.
12 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
13 is called fastforce / fast_force_tac already since Isabelle2011-1.
15 * Updated and extended "isar-ref" manual, reduced remaining material
21 * Code generation for Haskell: restrict unqualified imports from
22 Haskell Prelude to a small set of fundamental operations.
24 * Command "export_code": relative file names are interpreted
25 relatively to master directory of current theory rather than
26 the rather arbitrary current working directory.
29 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
30 use regular rule composition via "OF" / "THEN", or explicit proof
31 structure instead. Note that Isabelle/ML provides a variety of
32 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
33 with some care where this is really required.
35 * Command 'typ' supports an additional variant with explicit sort
36 constraint, to infer and check the most general type conforming to a
37 given given sort. Example (in HOL):
39 typ "_ * _ * bool * unit" :: finite
44 * HOL/Codatatype: New (co)datatype package with support for mixed,
45 nested recursion and interesting non-free datatypes.
47 * HOL/Ordinals_and_Cardinals: Theories of ordinals and cardinals
48 (supersedes the AFP entry of the same name).
50 * Library/Debug.thy and Library/Parallel.thy: debugging and parallel
51 execution for code generated towards Isabelle/ML.
53 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
58 - added an optimisation for equality premises.
59 It is switched on by default, and can be switched off by setting
60 the configuration quickcheck_optimise_equality to false.
62 * The SMT solver Z3 has now by default a restricted set of directly
63 supported features. For the full set of features (div/mod, nonlinear
64 arithmetic, datatypes/records) with potential proof reconstruction
65 failures, enable the configuration option "z3_with_extensions".
66 Minor INCOMPATIBILITY.
70 - Added MaSh relevance filter based on machine-learning; see the
71 Sledgehammer manual for details.
72 - Rationalized type encodings ("type_enc" option).
74 max_relevant ~> max_facts
75 relevance_thresholds ~> fact_thresholds
78 *** Document preparation ***
80 * Default for \<euro> is now based on eurosym package, instead of
81 slightly exotic babel/greek.
83 * Document variant NAME may use different LaTeX entry point
84 document/root_NAME.tex if that file exists, instead of the common
87 * Simplified custom document/build script, instead of old-style
88 document/IsaMakefile. Minor INCOMPATIBILITY.
93 * Renamed Position.str_of to Position.here to emphasize that this is a
94 formal device to inline positions into message text, but not
95 necessarily printing visible text.
100 * The ML system is configured as regular component, and no longer
101 picked up from some surrounding directory. Potential INCOMPATIBILITY
102 for home-made configurations.
104 * The "isabelle logo" tool allows to specify EPS or PDF format; the
105 latter is preferred now. Minor INCOMPATIBILITY.
107 * Advanced support for Isabelle sessions and build management, see
108 "system" manual for the chapter of that name, especially the "isabelle
109 build" tool and its examples. INCOMPATIBILITY, isabelle usedir /
110 mkdir / make are rendered obsolete.
112 * Discontinued obsolete "isabelle makeall".
114 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
115 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
116 provides some traditional targets that invoke "isabelle build". Note
117 that this is inefficient! Applications of Isabelle/HOL involving
118 "isabelle make" should be upgraded to use "isabelle build" directly.
120 * Discontinued obsolete Isabelle/build script, it is superseded by the
121 regular isabelle build tool. For example:
123 isabelle build -s -b HOLCF
125 * The "isabelle options" tool prints Isabelle system options, as
126 required for "isabelle build", for example.
128 * The "isabelle mkroot" tool prepares session root directories for use
129 with "isabelle build", similar to former "isabelle mkdir" for
132 * The "isabelle components" tool helps to resolve add-on components
133 that are not bundled, or referenced from a bare-bones repository
136 * Discontinued support for Poly/ML 5.2.1, which was the last version
137 without exception positions and advanced ML compiler/toplevel
140 * Discontinued special treatment of Proof General -- no longer guess
141 PROOFGENERAL_HOME based on accidental file-system layout. Minor
142 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
143 settings manually, or use a Proof General version that has been
144 bundled as Isabelle component.
147 New in Isabelle2012 (May 2012)
148 ------------------------------
152 * Prover IDE (PIDE) improvements:
154 - more robust Sledgehammer integration (as before the sledgehammer
155 command-line needs to be typed into the source buffer)
156 - markup for bound variables
157 - markup for types of term variables (displayed as tooltips)
158 - support for user-defined Isar commands within the running session
159 - improved support for Unicode outside original 16bit range
160 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
162 * Forward declaration of outer syntax keywords within the theory
163 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
164 commands to be used in the same theory where defined.
166 * Auxiliary contexts indicate block structure for specifications with
167 additional parameters and assumptions. Such unnamed contexts may be
168 nested within other targets, like 'theory', 'locale', 'class',
169 'instantiation' etc. Results from the local context are generalized
170 accordingly and applied to the enclosing target context. Example:
174 assumes xy: "x = y" and yz: "y = z"
177 lemma my_trans: "x = z" using xy yz by simp
183 The most basic application is to factor-out context elements of
184 several fixes/assumes/shows theorem statements, e.g. see
185 ~~/src/HOL/Isar_Examples/Group_Context.thy
187 Any other local theory specification element works within the "context
188 ... begin ... end" block as well.
190 * Bundled declarations associate attributed fact expressions with a
191 given name in the context. These may be later included in other
192 contexts. This allows to manage context extensions casually, without
193 the logical dependencies of locales and locale interpretation. See
194 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
196 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
197 declaration, and results are standardized before being stored. Thus
198 old-style "standard" after instantiation or composition of facts
199 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
200 indices of schematic variables.
202 * Rule attributes in local theory declarations (e.g. locale or class)
203 are now statically evaluated: the resulting theorem is stored instead
204 of the original expression. INCOMPATIBILITY in rare situations, where
205 the historic accident of dynamic re-evaluation in interpretations
208 * New tutorial "Programming and Proving in Isabelle/HOL"
209 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
210 Structured Isar Proofs" ("isar-overview"), which has been removed. It
211 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
212 Logic" as the recommended beginners tutorial, but does not cover all
213 of the material of that old tutorial.
215 * Updated and extended reference manuals: "isar-ref",
216 "implementation", "system"; reduced remaining material in old "ref"
222 * Command 'definition' no longer exports the foundational "raw_def"
223 into the user context. Minor INCOMPATIBILITY, may use the regular
224 "def" result with attribute "abs_def" to imitate the old version.
226 * Attribute "abs_def" turns an equation of the form "f x y == t" into
227 "f == %x y. t", which ensures that "simp" or "unfold" steps always
228 expand it. This also works for object-logic equality. (Formerly
229 undocumented feature.)
231 * Sort constraints are now propagated in simultaneous statements, just
232 like type constraints. INCOMPATIBILITY in rare situations, where
233 distinct sorts used to be assigned accidentally. For example:
235 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
237 lemma "P (x::'a)" and "Q (y::'a::bar)"
238 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
240 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
241 tolerant against multiple unifiers, as long as the final result is
242 unique. (As before, rules are composed in canonical right-to-left
243 order to accommodate newly introduced premises.)
245 * Renamed some inner syntax categories:
251 Minor INCOMPATIBILITY. Note that in practice "num_const" or
252 "num_position" etc. are mainly used instead (which also include
253 position information via constraints).
255 * Simplified configuration options for syntax ambiguity: see
256 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
257 manual. Minor INCOMPATIBILITY.
259 * Discontinued configuration option "syntax_positions": atomic terms
260 in parse trees are always annotated by position constraints.
262 * Old code generator for SML and its commands 'code_module',
263 'code_library', 'consts_code', 'types_code' have been discontinued.
264 Use commands of the generic code generator instead. INCOMPATIBILITY.
266 * Redundant attribute "code_inline" has been discontinued. Use
267 "code_unfold" instead. INCOMPATIBILITY.
269 * Dropped attribute "code_unfold_post" in favor of the its dual
270 "code_abbrev", which yields a common pattern in definitions like
272 definition [code_abbrev]: "f = t"
276 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
277 instead. INCOMPATIBILITY.
279 * Discontinued old "prems" fact, which used to refer to the accidental
280 collection of foundational premises in the context (already marked as
281 legacy since Isabelle2011).
286 * Type 'a set is now a proper type constructor (just as before
287 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
288 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
289 sets separate, it is often sufficient to rephrase some set S that has
290 been accidentally used as predicates by "%x. x : S", and some
291 predicate P that has been accidentally used as set by "{x. P x}".
292 Corresponding proofs in a first step should be pruned from any
293 tinkering with former theorems mem_def and Collect_def as far as
296 For developments which deliberately mix predicates and sets, a
297 planning step is necessary to determine what should become a predicate
298 and what a set. It can be helpful to carry out that step in
299 Isabelle2011-1 before jumping right into the current release.
301 * Code generation by default implements sets as container type rather
302 than predicates. INCOMPATIBILITY.
304 * New type synonym 'a rel = ('a * 'a) set
306 * The representation of numerals has changed. Datatype "num"
307 represents strictly positive binary numerals, along with functions
308 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
309 positive and negated numeric literals, respectively. See also
310 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
311 user theories may require adaptations as follows:
313 - Theorems with number_ring or number_semiring constraints: These
314 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
316 - Theories defining numeric types: Remove number, number_semiring,
317 and number_ring instances. Defer all theorems about numerals until
318 after classes one and semigroup_add have been instantiated.
320 - Numeral-only simp rules: Replace each rule having a "number_of v"
321 pattern with two copies, one for numeral and one for neg_numeral.
323 - Theorems about subclasses of semiring_1 or ring_1: These classes
324 automatically support numerals now, so more simp rules and
325 simprocs may now apply within the proof.
327 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
328 Redefine using other integer operations.
330 * Transfer: New package intended to generalize the existing
331 "descending" method and related theorem attributes from the Quotient
332 package. (Not all functionality is implemented yet, but future
333 development will focus on Transfer as an eventual replacement for the
334 corresponding parts of the Quotient package.)
336 - transfer_rule attribute: Maintains a collection of transfer rules,
337 which relate constants at two different types. Transfer rules may
338 relate different type instances of the same polymorphic constant,
339 or they may relate an operation on a raw type to a corresponding
340 operation on an abstract type (quotient or subtype). For example:
342 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
343 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
345 - transfer method: Replaces a subgoal on abstract types with an
346 equivalent subgoal on the corresponding raw types. Constants are
347 replaced with corresponding ones according to the transfer rules.
348 Goals are generalized over all free variables by default; this is
349 necessary for variables whose types change, but can be overridden
350 for specific variables with e.g. "transfer fixing: x y z". The
351 variant transfer' method allows replacing a subgoal with one that
352 is logically stronger (rather than equivalent).
354 - relator_eq attribute: Collects identity laws for relators of
355 various type constructors, e.g. "list_all2 (op =) = (op =)". The
356 transfer method uses these lemmas to infer transfer rules for
357 non-polymorphic constants on the fly.
359 - transfer_prover method: Assists with proving a transfer rule for a
360 new constant, provided the constant is defined in terms of other
361 constants that already have transfer rules. It should be applied
362 after unfolding the constant definitions.
364 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
365 from type nat to type int.
367 * Lifting: New package intended to generalize the quotient_definition
368 facility of the Quotient package; designed to work with Transfer.
370 - lift_definition command: Defines operations on an abstract type in
371 terms of a corresponding operation on a representation
372 type. Example syntax:
374 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
377 Users must discharge a respectfulness proof obligation when each
378 constant is defined. (For a type copy, i.e. a typedef with UNIV,
379 the proof is discharged automatically.) The obligation is
380 presented in a user-friendly, readable form; a respectfulness
381 theorem in the standard format and a transfer rule are generated
384 - Integration with code_abstype: For typedefs (e.g. subtypes
385 corresponding to a datatype invariant, such as dlist),
386 lift_definition generates a code certificate theorem and sets up
387 code generation for each constant.
389 - setup_lifting command: Sets up the Lifting package to work with a
390 user-defined type. The user must provide either a quotient theorem
391 or a type_definition theorem. The package configures transfer
392 rules for equality and quantifiers on the type, and sets up the
393 lift_definition command to work with the type.
395 - Usage examples: See Quotient_Examples/Lift_DList.thy,
396 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
397 Word/Word.thy and Library/Float.thy.
401 - The 'quotient_type' command now supports a 'morphisms' option with
402 rep and abs functions, similar to typedef.
404 - 'quotient_type' sets up new types to work with the Lifting and
405 Transfer packages, as with 'setup_lifting'.
407 - The 'quotient_definition' command now requires the user to prove a
408 respectfulness property at the point where the constant is
409 defined, similar to lift_definition; INCOMPATIBILITY.
411 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
412 accordingly, INCOMPATIBILITY.
414 * New diagnostic command 'find_unused_assms' to find potentially
415 superfluous assumptions in theorems using Quickcheck.
419 - Quickcheck returns variable assignments as counterexamples, which
420 allows to reveal the underspecification of functions under test.
421 For example, refuting "hd xs = x", it presents the variable
422 assignment xs = [] and x = a1 as a counterexample, assuming that
423 any property is false whenever "hd []" occurs in it.
425 These counterexample are marked as potentially spurious, as
426 Quickcheck also returns "xs = []" as a counterexample to the
427 obvious theorem "hd xs = hd xs".
429 After finding a potentially spurious counterexample, Quickcheck
430 continues searching for genuine ones.
432 By default, Quickcheck shows potentially spurious and genuine
433 counterexamples. The option "genuine_only" sets quickcheck to only
434 show genuine counterexamples.
436 - The command 'quickcheck_generator' creates random and exhaustive
437 value generators for a given type and operations.
439 It generates values by using the operations as if they were
440 constructors of that type.
442 - Support for multisets.
444 - Added "use_subtype" options.
446 - Added "quickcheck_locale" configuration to specify how to process
447 conjectures in a locale context.
449 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
450 and affecting 'rat' and 'real'.
453 - Integrated more tightly with SPASS, as described in the ITP 2012
454 paper "More SPASS with Isabelle".
455 - Made it try "smt" as a fallback if "metis" fails or times out.
456 - Added support for the following provers: Alt-Ergo (via Why3 and
457 TFF1), iProver, iProver-Eq.
458 - Sped up the minimizer.
459 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
460 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
461 - Renamed "sound" option to "strict".
463 * Metis: Added possibility to specify lambda translations scheme as a
464 parenthesized argument (e.g., "by (metis (lifting) ...)").
466 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
468 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
470 * New "case_product" attribute to generate a case rule doing multiple
471 case distinctions at the same time. E.g.
473 list.exhaust [case_product nat.exhaust]
475 produces a rule which can be used to perform case distinction on both
478 * New "eventually_elim" method as a generalized variant of the
479 eventually_elim* rules. Supports structured proofs.
481 * Typedef with implicit set definition is considered legacy. Use
482 "typedef (open)" form instead, which will eventually become the
485 * Record: code generation can be switched off manually with
487 declare [[record_coden = false]] -- "default true"
489 * Datatype: type parameters allow explicit sort constraints.
491 * Concrete syntax for case expressions includes constraints for source
492 positions, and thus produces Prover IDE markup for its bindings.
493 INCOMPATIBILITY for old-style syntax translations that augment the
494 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
497 * Clarified attribute "mono_set": pure declaration without modifying
498 the result of the fact expression.
500 * More default pred/set conversions on a couple of relation operations
501 and predicates. Added powers of predicate relations. Consolidation
502 of some relation theorems:
504 converse_def ~> converse_unfold
505 rel_comp_def ~> relcomp_unfold
506 symp_def ~> (modified, use symp_def and sym_def instead)
507 transp_def ~> transp_trans
508 Domain_def ~> Domain_unfold
509 Range_def ~> Domain_converse [symmetric]
511 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
513 See theory "Relation" for examples for making use of pred/set
514 conversions by means of attributes "to_set" and "to_pred".
518 * Renamed facts about the power operation on relations, i.e., relpow
519 to match the constant's name:
521 rel_pow_1 ~> relpow_1
522 rel_pow_0_I ~> relpow_0_I
523 rel_pow_Suc_I ~> relpow_Suc_I
524 rel_pow_Suc_I2 ~> relpow_Suc_I2
525 rel_pow_0_E ~> relpow_0_E
526 rel_pow_Suc_E ~> relpow_Suc_E
527 rel_pow_E ~> relpow_E
528 rel_pow_Suc_D2 ~> relpow_Suc_D2
529 rel_pow_Suc_E2 ~> relpow_Suc_E2
530 rel_pow_Suc_D2' ~> relpow_Suc_D2'
531 rel_pow_E2 ~> relpow_E2
532 rel_pow_add ~> relpow_add
533 rel_pow_commute ~> relpow
534 rel_pow_empty ~> relpow_empty:
535 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
536 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
537 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
538 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
539 rel_pow_fun_conv ~> relpow_fun_conv
540 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
541 rel_pow_finite_bounded ~> relpow_finite_bounded
542 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
543 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
544 single_valued_rel_pow ~> single_valued_relpow
548 * Theory Relation: Consolidated constant name for relation composition
549 and corresponding theorem names:
551 - Renamed constant rel_comp to relcomp.
553 - Dropped abbreviation pred_comp. Use relcompp instead.
557 rel_compI ~> relcompI
558 rel_compEpair ~> relcompEpair
559 rel_compE ~> relcompE
560 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
561 rel_comp_empty1 ~> relcomp_empty1
562 rel_comp_mono ~> relcomp_mono
563 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
564 rel_comp_distrib ~> relcomp_distrib
565 rel_comp_distrib2 ~> relcomp_distrib2
566 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
567 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
568 single_valued_rel_comp ~> single_valued_relcomp
569 rel_comp_def ~> relcomp_unfold
570 converse_rel_comp ~> converse_relcomp
571 pred_compI ~> relcomppI
572 pred_compE ~> relcomppE
573 pred_comp_bot1 ~> relcompp_bot1
574 pred_comp_bot2 ~> relcompp_bot2
575 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
576 pred_comp_mono ~> relcompp_mono
577 pred_comp_distrib ~> relcompp_distrib
578 pred_comp_distrib2 ~> relcompp_distrib2
579 converse_pred_comp ~> converse_relcompp
581 finite_rel_comp ~> finite_relcomp
583 set_rel_comp ~> set_relcomp
587 * Theory Divides: Discontinued redundant theorems about div and mod.
588 INCOMPATIBILITY, use the corresponding generic theorems instead.
590 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
591 zdiv_self ~> div_self
592 zmod_self ~> mod_self
595 zdiv_zmod_equality ~> div_mod_equality2
596 zdiv_zmod_equality2 ~> div_mod_equality
597 zmod_zdiv_trivial ~> mod_div_trivial
598 zdiv_zminus_zminus ~> div_minus_minus
599 zmod_zminus_zminus ~> mod_minus_minus
600 zdiv_zminus2 ~> div_minus_right
601 zmod_zminus2 ~> mod_minus_right
602 zdiv_minus1_right ~> div_minus1_right
603 zmod_minus1_right ~> mod_minus1_right
604 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
605 zmod_zmult1_eq ~> mod_mult_right_eq
606 zpower_zmod ~> power_mod
608 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
609 mod_mult_distrib ~> mult_mod_left
610 mod_mult_distrib2 ~> mult_mod_right
612 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
613 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
615 * Finite_Set.fold now qualified. INCOMPATIBILITY.
617 * Consolidated theorem names concerning fold combinators:
619 inf_INFI_fold_inf ~> inf_INF_fold_inf
620 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
621 INFI_fold_inf ~> INF_fold_inf
622 SUPR_fold_sup ~> SUP_fold_sup
623 union_set ~> union_set_fold
624 minus_set ~> minus_set_fold
625 INFI_set_fold ~> INF_set_fold
626 SUPR_set_fold ~> SUP_set_fold
627 INF_code ~> INF_set_foldr
628 SUP_code ~> SUP_set_foldr
629 foldr.simps ~> foldr.simps (in point-free formulation)
630 foldr_fold_rev ~> foldr_conv_fold
631 foldl_fold ~> foldl_conv_fold
632 foldr_foldr ~> foldr_conv_foldl
633 foldl_foldr ~> foldl_conv_foldr
634 fold_set_remdups ~> fold_set_fold_remdups
635 fold_set ~> fold_set_fold
636 fold1_set ~> fold1_set_fold
640 * Dropped rarely useful theorems concerning fold combinators:
641 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
642 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
643 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
644 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
645 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
646 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
647 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
648 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
649 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
650 unfolding "foldr_conv_fold" and "foldl_conv_fold".
652 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
653 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
654 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
655 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
656 lemmas over fold rather than foldr, or make use of lemmas
657 fold_conv_foldr and fold_rev.
659 * Congruence rules Option.map_cong and Option.bind_cong for recursion
660 through option types.
662 * "Transitive_Closure.ntrancl": bounded transitive closure on
665 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
667 * Theory Int: Discontinued many legacy theorems specific to type int.
668 INCOMPATIBILITY, use the corresponding generic theorems instead.
670 zminus_zminus ~> minus_minus
671 zminus_0 ~> minus_zero
672 zminus_zadd_distrib ~> minus_add_distrib
673 zadd_commute ~> add_commute
674 zadd_assoc ~> add_assoc
675 zadd_left_commute ~> add_left_commute
679 zadd_0_right ~> add_0_right
680 zadd_zminus_inverse2 ~> left_minus
681 zmult_zminus ~> mult_minus_left
682 zmult_commute ~> mult_commute
683 zmult_assoc ~> mult_assoc
684 zadd_zmult_distrib ~> left_distrib
685 zadd_zmult_distrib2 ~> right_distrib
686 zdiff_zmult_distrib ~> left_diff_distrib
687 zdiff_zmult_distrib2 ~> right_diff_distrib
688 zmult_1 ~> mult_1_left
689 zmult_1_right ~> mult_1_right
690 zle_refl ~> order_refl
691 zle_trans ~> order_trans
692 zle_antisym ~> order_antisym
693 zle_linear ~> linorder_linear
694 zless_linear ~> linorder_less_linear
695 zadd_left_mono ~> add_left_mono
696 zadd_strict_right_mono ~> add_strict_right_mono
697 zadd_zless_mono ~> add_less_le_mono
698 int_0_less_1 ~> zero_less_one
699 int_0_neq_1 ~> zero_neq_one
701 zpower_zadd_distrib ~> power_add
702 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
703 zero_le_zpower_abs ~> zero_le_power_abs
705 * Theory Deriv: Renamed
707 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
709 * Theory Library/Multiset: Improved code generation of multisets.
711 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
712 are expressed via type classes again. The special syntax
713 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
714 setsum_set, which is now subsumed by Big_Operators.setsum.
717 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
718 use theory HOL/Library/Nat_Bijection instead.
720 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
721 trees is now inside a type class context. Names of affected
722 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
723 theories working directly with raw red-black trees, adapt the names as
727 bulkload -> rbt_bulkload
728 del_from_left -> rbt_del_from_left
729 del_from_right -> rbt_del_from_right
734 insertw -> rbt_insert_with
735 insert_with_key -> rbt_insert_with_key
736 map_entry -> rbt_map_entry
739 tree_greater -> rbt_greater
740 tree_less -> rbt_less
741 tree_less_symbol -> rbt_less_symbol
743 union_with -> rbt_union_with
744 union_with_key -> rbt_union_with_key
747 balance_left_sorted -> balance_left_rbt_sorted
748 balance_left_tree_greater -> balance_left_rbt_greater
749 balance_left_tree_less -> balance_left_rbt_less
750 balance_right_sorted -> balance_right_rbt_sorted
751 balance_right_tree_greater -> balance_right_rbt_greater
752 balance_right_tree_less -> balance_right_rbt_less
753 balance_sorted -> balance_rbt_sorted
754 balance_tree_greater -> balance_rbt_greater
755 balance_tree_less -> balance_rbt_less
756 bulkload_is_rbt -> rbt_bulkload_is_rbt
757 combine_sorted -> combine_rbt_sorted
758 combine_tree_greater -> combine_rbt_greater
759 combine_tree_less -> combine_rbt_less
760 delete_in_tree -> rbt_delete_in_tree
761 delete_is_rbt -> rbt_delete_is_rbt
762 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
763 del_from_left_tree_less -> rbt_del_from_left_rbt_less
764 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
765 del_from_right_tree_less -> rbt_del_from_right_rbt_less
766 del_in_tree -> rbt_del_in_tree
767 del_inv1_inv2 -> rbt_del_inv1_inv2
768 del_sorted -> rbt_del_rbt_sorted
769 del_tree_greater -> rbt_del_rbt_greater
770 del_tree_less -> rbt_del_rbt_less
771 dom_lookup_Branch -> dom_rbt_lookup_Branch
772 entries_lookup -> entries_rbt_lookup
773 finite_dom_lookup -> finite_dom_rbt_lookup
774 insert_sorted -> rbt_insert_rbt_sorted
775 insertw_is_rbt -> rbt_insertw_is_rbt
776 insertwk_is_rbt -> rbt_insertwk_is_rbt
777 insertwk_sorted -> rbt_insertwk_rbt_sorted
778 insertw_sorted -> rbt_insertw_rbt_sorted
779 ins_sorted -> ins_rbt_sorted
780 ins_tree_greater -> ins_rbt_greater
781 ins_tree_less -> ins_rbt_less
782 is_rbt_sorted -> is_rbt_rbt_sorted
783 lookup_balance -> rbt_lookup_balance
784 lookup_bulkload -> rbt_lookup_rbt_bulkload
785 lookup_delete -> rbt_lookup_rbt_delete
786 lookup_Empty -> rbt_lookup_Empty
787 lookup_from_in_tree -> rbt_lookup_from_in_tree
788 lookup_in_tree -> rbt_lookup_in_tree
789 lookup_ins -> rbt_lookup_ins
790 lookup_insert -> rbt_lookup_rbt_insert
791 lookup_insertw -> rbt_lookup_rbt_insertw
792 lookup_insertwk -> rbt_lookup_rbt_insertwk
793 lookup_keys -> rbt_lookup_keys
794 lookup_map -> rbt_lookup_map
795 lookup_map_entry -> rbt_lookup_rbt_map_entry
796 lookup_tree_greater -> rbt_lookup_rbt_greater
797 lookup_tree_less -> rbt_lookup_rbt_less
798 lookup_union -> rbt_lookup_rbt_union
799 map_entry_color_of -> rbt_map_entry_color_of
800 map_entry_inv1 -> rbt_map_entry_inv1
801 map_entry_inv2 -> rbt_map_entry_inv2
802 map_entry_is_rbt -> rbt_map_entry_is_rbt
803 map_entry_sorted -> rbt_map_entry_rbt_sorted
804 map_entry_tree_greater -> rbt_map_entry_rbt_greater
805 map_entry_tree_less -> rbt_map_entry_rbt_less
806 map_tree_greater -> map_rbt_greater
807 map_tree_less -> map_rbt_less
808 map_sorted -> map_rbt_sorted
809 paint_sorted -> paint_rbt_sorted
810 paint_lookup -> paint_rbt_lookup
811 paint_tree_greater -> paint_rbt_greater
812 paint_tree_less -> paint_rbt_less
813 sorted_entries -> rbt_sorted_entries
814 tree_greater_eq_trans -> rbt_greater_eq_trans
815 tree_greater_nit -> rbt_greater_nit
816 tree_greater_prop -> rbt_greater_prop
817 tree_greater_simps -> rbt_greater_simps
818 tree_greater_trans -> rbt_greater_trans
819 tree_less_eq_trans -> rbt_less_eq_trans
820 tree_less_nit -> rbt_less_nit
821 tree_less_prop -> rbt_less_prop
822 tree_less_simps -> rbt_less_simps
823 tree_less_trans -> rbt_less_trans
824 tree_ord_props -> rbt_ord_props
825 union_Branch -> rbt_union_Branch
826 union_is_rbt -> rbt_union_is_rbt
827 unionw_is_rbt -> rbt_unionw_is_rbt
828 unionwk_is_rbt -> rbt_unionwk_is_rbt
829 unionwk_sorted -> rbt_unionwk_rbt_sorted
831 * Theory HOL/Library/Float: Floating point numbers are now defined as
832 a subset of the real numbers. All operations are defined using the
833 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
840 round_down -> float_round_down
841 round_up -> float_round_up
845 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
848 abs_float_def -> Float.compute_float_abs
849 bitlen_ge0 -> bitlen_nonneg
850 bitlen.simps -> Float.compute_bitlen
851 float_components -> Float_mantissa_exponent
852 float_divl.simps -> Float.compute_float_divl
853 float_divr.simps -> Float.compute_float_divr
854 float_eq_odd -> mult_powr_eq_mult_powr_iff
855 float_power -> real_of_float_power
856 lapprox_posrat_def -> Float.compute_lapprox_posrat
857 lapprox_rat.simps -> Float.compute_lapprox_rat
858 le_float_def' -> Float.compute_float_le
859 le_float_def -> less_eq_float.rep_eq
860 less_float_def' -> Float.compute_float_less
861 less_float_def -> less_float.rep_eq
862 normfloat_def -> Float.compute_normfloat
863 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
864 normfloat -> normfloat_def
865 normfloat_unique -> use normfloat_def
866 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
867 one_float_def -> Float.compute_float_one
868 plus_float_def -> Float.compute_float_plus
869 rapprox_posrat_def -> Float.compute_rapprox_posrat
870 rapprox_rat.simps -> Float.compute_rapprox_rat
871 real_of_float_0 -> zero_float.rep_eq
872 real_of_float_1 -> one_float.rep_eq
873 real_of_float_abs -> abs_float.rep_eq
874 real_of_float_add -> plus_float.rep_eq
875 real_of_float_minus -> uminus_float.rep_eq
876 real_of_float_mult -> times_float.rep_eq
877 real_of_float_simp -> Float.rep_eq
878 real_of_float_sub -> minus_float.rep_eq
879 round_down.simps -> Float.compute_float_round_down
880 round_up.simps -> Float.compute_float_round_up
881 times_float_def -> Float.compute_float_times
882 uminus_float_def -> Float.compute_float_uminus
883 zero_float_def -> Float.compute_float_zero
885 Lemmas not necessary anymore, use the transfer method:
886 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
887 float_divr, float_le_simp, float_less1_mantissa_bound,
888 float_less_simp, float_less_zero, float_le_zero,
889 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
890 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
891 lapprox_rat_bottom, normalized_float, rapprox_posrat,
892 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
893 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
894 round_up, zero_le_float, zero_less_float
896 * New theory HOL/Library/DAList provides an abstract type for
897 association lists with distinct keys.
899 * Session HOL/IMP: Added new theory of abstract interpretation of
902 * Session HOL-Import: Re-implementation from scratch is faster,
903 simpler, and more scalable. Requires a proof bundle, which is
904 available as an external component. Discontinued old (and mostly
905 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
907 * Session HOL-Word: Discontinued many redundant theorems specific to
908 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
911 word_sub_alt ~> word_sub_wi
912 word_add_alt ~> word_add_def
913 word_mult_alt ~> word_mult_def
914 word_minus_alt ~> word_minus_def
915 word_0_alt ~> word_0_wi
916 word_1_alt ~> word_1_wi
917 word_add_0 ~> add_0_left
918 word_add_0_right ~> add_0_right
919 word_mult_1 ~> mult_1_left
920 word_mult_1_right ~> mult_1_right
921 word_add_commute ~> add_commute
922 word_add_assoc ~> add_assoc
923 word_add_left_commute ~> add_left_commute
924 word_mult_commute ~> mult_commute
925 word_mult_assoc ~> mult_assoc
926 word_mult_left_commute ~> mult_left_commute
927 word_left_distrib ~> left_distrib
928 word_right_distrib ~> right_distrib
929 word_left_minus ~> left_minus
930 word_diff_0_right ~> diff_0_right
931 word_diff_self ~> diff_self
932 word_sub_def ~> diff_minus
933 word_diff_minus ~> diff_minus
934 word_add_ac ~> add_ac
935 word_mult_ac ~> mult_ac
936 word_plus_ac0 ~> add_0_left add_0_right add_ac
937 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
938 word_order_trans ~> order_trans
939 word_order_refl ~> order_refl
940 word_order_antisym ~> order_antisym
941 word_order_linear ~> linorder_linear
942 lenw1_zero_neq_one ~> zero_neq_one
943 word_number_of_eq ~> number_of_eq
944 word_of_int_add_hom ~> wi_hom_add
945 word_of_int_sub_hom ~> wi_hom_sub
946 word_of_int_mult_hom ~> wi_hom_mult
947 word_of_int_minus_hom ~> wi_hom_neg
948 word_of_int_succ_hom ~> wi_hom_succ
949 word_of_int_pred_hom ~> wi_hom_pred
950 word_of_int_0_hom ~> word_0_wi
951 word_of_int_1_hom ~> word_1_wi
953 * Session HOL-Word: New proof method "word_bitwise" for splitting
954 machine word equalities and inequalities into logical circuits,
955 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
956 multiplication, shifting by constants, bitwise operators and numeric
957 constants. Requires fixed-length word types, not 'a word. Solves
958 many standard word identities outright and converts more into first
959 order problems amenable to blast or similar. See also examples in
960 HOL/Word/Examples/WordExamples.thy.
962 * Session HOL-Probability: Introduced the type "'a measure" to
963 represent measures, this replaces the records 'a algebra and 'a
964 measure_space. The locales based on subset_class now have two
965 locale-parameters the space \<Omega> and the set of measurable sets M.
966 The product of probability spaces uses now the same constant as the
967 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
968 measure". Most constants are defined now outside of locales and gain
969 an additional parameter, like null_sets, almost_eventually or \<mu>'.
970 Measure space constructions for distributions and densities now got
971 their own constants distr and density. Instead of using locales to
972 describe measure spaces with a finite space, the measure count_space
973 and point_measure is introduced. INCOMPATIBILITY.
977 finite_measure.\<mu>' -> measure
978 product_algebra_generator -> prod_algebra
979 product_prob_space.emb -> prod_emb
980 product_prob_space.infprod_algebra -> PiM
983 completeable_measure_space
986 finite_product_finite_prob_space
987 finite_product_sigma_algebra
990 pair_finite_prob_space
991 pair_finite_sigma_algebra
994 product_sigma_algebra
998 distribution -> use distr measure, or distributed predicate
1000 joint_distribution -> use distr measure, or distributed predicate
1001 pair_measure_generator
1002 product_prob_space.infprod_algebra -> use PiM
1005 Replacement theorems:
1006 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1007 finite_measure.empty_measure -> measure_empty
1008 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1009 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1010 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1011 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1012 finite_measure.finite_measure -> finite_measure.emeasure_finite
1013 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1014 finite_measure.positive_measure' -> measure_nonneg
1015 finite_measure.real_measure -> finite_measure.emeasure_real
1016 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1017 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1018 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1019 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1020 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1021 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1022 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1023 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1024 information_space.entropy_commute -> information_space.entropy_commute_simple
1025 information_space.entropy_eq -> information_space.entropy_simple_distributed
1026 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1027 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1028 information_space.entropy_uniform_max -> information_space.entropy_uniform
1029 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1030 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1031 information_space.KL_ge_0 -> information_space.KL_nonneg
1032 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1033 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1034 Int_stable_cuboids -> Int_stable_atLeastAtMost
1035 Int_stable_product_algebra_generator -> positive_integral
1036 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1037 measure_space.additive -> emeasure_additive
1038 measure_space.AE_iff_null_set -> AE_iff_null
1039 measure_space.almost_everywhere_def -> eventually_ae_filter
1040 measure_space.almost_everywhere_vimage -> AE_distrD
1041 measure_space.continuity_from_above -> INF_emeasure_decseq
1042 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1043 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1044 measure_space.continuity_from_below -> SUP_emeasure_incseq
1045 measure_space_density -> emeasure_density
1046 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1047 measure_space.integrable_vimage -> integrable_distr
1048 measure_space.integral_translated_density -> integral_density
1049 measure_space.integral_vimage -> integral_distr
1050 measure_space.measure_additive -> plus_emeasure
1051 measure_space.measure_compl -> emeasure_compl
1052 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1053 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1054 measure_space.measure_decseq -> decseq_emeasure
1055 measure_space.measure_Diff -> emeasure_Diff
1056 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1057 measure_space.measure_eq_0 -> emeasure_eq_0
1058 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1059 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1060 measure_space.measure_incseq -> incseq_emeasure
1061 measure_space.measure_insert -> emeasure_insert
1062 measure_space.measure_mono -> emeasure_mono
1063 measure_space.measure_not_negative -> emeasure_not_MInf
1064 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1065 measure_space.measure_setsum -> setsum_emeasure
1066 measure_space.measure_setsum_split -> setsum_emeasure_cover
1067 measure_space.measure_space_vimage -> emeasure_distr
1068 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1069 measure_space.measure_subadditive -> subadditive
1070 measure_space.measure_top -> emeasure_space
1071 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1072 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1073 measure_space.positive_integral_translated_density -> positive_integral_density
1074 measure_space.positive_integral_vimage -> positive_integral_distr
1075 measure_space.real_continuity_from_above -> Lim_measure_decseq
1076 measure_space.real_continuity_from_below -> Lim_measure_incseq
1077 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1078 measure_space.real_measure_Diff -> measure_Diff
1079 measure_space.real_measure_finite_Union -> measure_finite_Union
1080 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1081 measure_space.real_measure_subadditive -> measure_subadditive
1082 measure_space.real_measure_Union -> measure_Union
1083 measure_space.real_measure_UNION -> measure_UNION
1084 measure_space.simple_function_vimage -> simple_function_comp
1085 measure_space.simple_integral_vimage -> simple_integral_distr
1086 measure_space.simple_integral_vimage -> simple_integral_distr
1087 measure_unique_Int_stable -> measure_eqI_generator_eq
1088 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1089 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1090 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1091 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1092 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1093 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1094 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1095 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1096 pair_sigma_algebra.sets_swap -> sets_pair_swap
1097 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1098 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1099 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1100 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1101 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1102 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1103 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1104 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1105 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1106 prob_space.prob_space_vimage -> prob_space_distr
1107 prob_space.random_variable_restrict -> measurable_restrict
1108 prob_space_unique_Int_stable -> measure_eqI_prob_space
1109 product_algebraE -> prod_algebraE_all
1110 product_algebra_generator_der -> prod_algebra_eq_finite
1111 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1112 product_algebraI -> sets_PiM_I_finite
1113 product_measure_exists -> product_sigma_finite.sigma_finite
1114 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1115 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1116 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1117 product_prob_space.measurable_component -> measurable_component_singleton
1118 product_prob_space.measurable_emb -> measurable_prod_emb
1119 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1120 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1121 product_prob_space.measure_emb -> emeasure_prod_emb
1122 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1123 product_sigma_algebra.product_algebra_into_space -> space_closed
1124 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1125 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1126 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1127 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1128 sets_product_algebra -> sets_PiM
1129 sigma_algebra.measurable_sigma -> measurable_measure_of
1130 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1131 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1132 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1133 space_product_algebra -> space_PiM
1135 * Session HOL-TPTP: support to parse and import TPTP problems (all
1136 languages) into Isabelle/HOL.
1141 * New "case_product" attribute (see HOL).
1146 * Greater support for structured proofs involving induction or case
1149 * Much greater use of mathematical symbols.
1151 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1156 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1157 from a minor keyword introduced via theory header declaration.
1159 * Antiquotation @{command_spec "name"} produces the
1160 Outer_Syntax.command_spec from a major keyword introduced via theory
1161 header declaration; it can be passed to Outer_Syntax.command etc.
1163 * Local_Theory.define no longer hard-wires default theorem name
1164 "foo_def", but retains the binding as given. If that is Binding.empty
1165 / Attrib.empty_binding, the result is not registered as user-level
1166 fact. The Local_Theory.define_internal variant allows to specify a
1167 non-empty name (used for the foundation in the background theory),
1168 while omitting the fact binding in the user-context. Potential
1169 INCOMPATIBILITY for derived definitional packages: need to specify
1170 naming policy for primitive definitions more explicitly.
1172 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1173 conformance with similar operations in structure Term and Logic.
1175 * Antiquotation @{attributes [...]} embeds attribute source
1176 representation into the ML text, which is particularly useful with
1177 declarations like Local_Theory.note.
1179 * Structure Proof_Context follows standard naming scheme. Old
1180 ProofContext has been discontinued. INCOMPATIBILITY.
1182 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1183 change of semantics: update is applied to auxiliary local theory
1186 * Modernized some old-style infix operations:
1188 addeqcongs ~> Simplifier.add_eqcong
1189 deleqcongs ~> Simplifier.del_eqcong
1190 addcongs ~> Simplifier.add_cong
1191 delcongs ~> Simplifier.del_cong
1192 setmksimps ~> Simplifier.set_mksimps
1193 setmkcong ~> Simplifier.set_mkcong
1194 setmksym ~> Simplifier.set_mksym
1195 setmkeqTrue ~> Simplifier.set_mkeqTrue
1196 settermless ~> Simplifier.set_termless
1197 setsubgoaler ~> Simplifier.set_subgoaler
1198 addsplits ~> Splitter.add_split
1199 delsplits ~> Splitter.del_split
1204 * USER_HOME settings variable points to cross-platform user home
1205 directory, which coincides with HOME on POSIX systems only. Likewise,
1206 the Isabelle path specification "~" now expands to $USER_HOME, instead
1207 of former $HOME. A different default for USER_HOME may be set
1208 explicitly in shell environment, before Isabelle settings are
1209 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1210 the generic user home was intended.
1212 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1213 notation, which is useful for the jEdit file browser, for example.
1215 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1220 New in Isabelle2011-1 (October 2011)
1221 ------------------------------------
1225 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1226 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1228 - Management of multiple theory files directly from the editor
1229 buffer store -- bypassing the file-system (no requirement to save
1230 files for checking).
1232 - Markup of formal entities within the text buffer, with semantic
1233 highlighting, tooltips and hyperlinks to jump to defining source
1236 - Improved text rendering, with sub/superscripts in the source
1237 buffer (including support for copy/paste wrt. output panel, HTML
1238 theory output and other non-Isabelle text boxes).
1240 - Refined scheduling of proof checking and printing of results,
1241 based on interactive editor view. (Note: jEdit folding and
1242 narrowing allows to restrict buffer perspectives explicitly.)
1244 - Reduced CPU performance requirements, usable on machines with few
1247 - Reduced memory requirements due to pruning of unused document
1248 versions (garbage collection).
1250 See also ~~/src/Tools/jEdit/README.html for further information,
1251 including some remaining limitations.
1253 * Theory loader: source files are exclusively located via the master
1254 directory of each theory node (where the .thy file itself resides).
1255 The global load path (such as src/HOL/Library) has been discontinued.
1256 Note that the path element ~~ may be used to reference theories in the
1257 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1260 * Theory loader: source files are identified by content via SHA1
1261 digests. Discontinued former path/modtime identification and optional
1262 ISABELLE_FILE_IDENT plugin scripts.
1264 * Parallelization of nested Isar proofs is subject to
1265 Goal.parallel_proofs_threshold (default 100). See also isabelle
1268 * Name space: former unsynchronized references are now proper
1269 configuration options, with more conventional names:
1271 long_names ~> names_long
1272 short_names ~> names_short
1273 unique_names ~> names_unique
1275 Minor INCOMPATIBILITY, need to declare options in context like this:
1277 declare [[names_unique = false]]
1279 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1280 that the result needs to be unique, which means fact specifications
1281 may have to be refined after enriching a proof context.
1283 * Attribute "case_names" has been refined: the assumptions in each case
1284 can be named now by following the case name with [name1 name2 ...].
1286 * Isabelle/Isar reference manual has been updated and extended:
1287 - "Synopsis" provides a catalog of main Isar language concepts.
1288 - Formal references in syntax diagrams, via @{rail} antiquotation.
1289 - Updated material from classic "ref" manual, notably about
1290 "Classical Reasoner".
1295 * Class bot and top require underlying partial order rather than
1296 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1298 * Class complete_lattice: generalized a couple of lemmas from sets;
1299 generalized theorems INF_cong and SUP_cong. New type classes for
1300 complete boolean algebras and complete linear orders. Lemmas
1301 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1302 class complete_linorder.
1304 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1305 Sup_fun_def, Inf_apply, Sup_apply.
1307 Removed redundant lemmas (the right hand side gives hints how to
1308 replace them for (metis ...), or (simp only: ...) proofs):
1310 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1311 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1312 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1313 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1314 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1315 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1316 Inter_def ~> INF_def, image_def
1317 Union_def ~> SUP_def, image_def
1318 INT_eq ~> INF_def, and image_def
1319 UN_eq ~> SUP_def, and image_def
1320 INF_subset ~> INF_superset_mono [OF _ order_refl]
1322 More consistent and comprehensive names:
1324 INTER_eq_Inter_image ~> INF_def
1325 UNION_eq_Union_image ~> SUP_def
1328 INF_leI ~> INF_lower
1329 INF_leI2 ~> INF_lower2
1330 le_INFI ~> INF_greatest
1331 le_SUPI ~> SUP_upper
1332 le_SUPI2 ~> SUP_upper2
1333 SUP_leI ~> SUP_least
1334 INFI_bool_eq ~> INF_bool_eq
1335 SUPR_bool_eq ~> SUP_bool_eq
1336 INFI_apply ~> INF_apply
1337 SUPR_apply ~> SUP_apply
1338 INTER_def ~> INTER_eq
1339 UNION_def ~> UNION_eq
1343 * Renamed theory Complete_Lattice to Complete_Lattices.
1346 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1347 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1348 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1349 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1351 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1352 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1353 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1356 * Added syntactic classes "inf" and "sup" for the respective
1357 constants. INCOMPATIBILITY: Changes in the argument order of the
1358 (mostly internal) locale predicates for some derived classes.
1360 * Theorem collections ball_simps and bex_simps do not contain theorems
1361 referring to UNION any longer; these have been moved to collection
1362 UN_ball_bex_simps. INCOMPATIBILITY.
1364 * Theory Archimedean_Field: floor now is defined as parameter of a
1365 separate type class floor_ceiling.
1367 * Theory Finite_Set: more coherent development of fold_set locales:
1369 locale fun_left_comm ~> locale comp_fun_commute
1370 locale fun_left_comm_idem ~> locale comp_fun_idem
1372 Both use point-free characterization; interpretation proofs may need
1373 adjustment. INCOMPATIBILITY.
1375 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1376 accordance with standard mathematical terminology. INCOMPATIBILITY.
1378 * Theory Complex_Main: The locale interpretations for the
1379 bounded_linear and bounded_bilinear locales have been removed, in
1380 order to reduce the number of duplicate lemmas. Users must use the
1381 original names for distributivity theorems, potential INCOMPATIBILITY.
1383 divide.add ~> add_divide_distrib
1384 divide.diff ~> diff_divide_distrib
1385 divide.setsum ~> setsum_divide_distrib
1386 mult.add_right ~> right_distrib
1387 mult.diff_right ~> right_diff_distrib
1388 mult_right.setsum ~> setsum_right_distrib
1389 mult_left.diff ~> left_diff_distrib
1391 * Theory Complex_Main: Several redundant theorems have been removed or
1392 replaced by more general versions. INCOMPATIBILITY.
1394 real_diff_def ~> minus_real_def
1395 real_divide_def ~> divide_real_def
1396 real_less_def ~> less_le
1397 real_abs_def ~> abs_real_def
1398 real_sgn_def ~> sgn_real_def
1399 real_mult_commute ~> mult_commute
1400 real_mult_assoc ~> mult_assoc
1401 real_mult_1 ~> mult_1_left
1402 real_add_mult_distrib ~> left_distrib
1403 real_zero_not_eq_one ~> zero_neq_one
1404 real_mult_inverse_left ~> left_inverse
1405 INVERSE_ZERO ~> inverse_zero
1406 real_le_refl ~> order_refl
1407 real_le_antisym ~> order_antisym
1408 real_le_trans ~> order_trans
1409 real_le_linear ~> linear
1410 real_le_eq_diff ~> le_iff_diff_le_0
1411 real_add_left_mono ~> add_left_mono
1412 real_mult_order ~> mult_pos_pos
1413 real_mult_less_mono2 ~> mult_strict_left_mono
1414 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1415 real_0_le_divide_iff ~> zero_le_divide_iff
1416 realpow_two_disj ~> power2_eq_iff
1417 real_squared_diff_one_factored ~> square_diff_one_factored
1418 realpow_two_diff ~> square_diff_square_factored
1419 reals_complete2 ~> complete_real
1420 real_sum_squared_expand ~> power2_sum
1421 exp_ln_eq ~> ln_unique
1423 expi_zero ~> exp_zero
1424 lemma_DERIV_subst ~> DERIV_cong
1425 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1426 LIMSEQ_const ~> tendsto_const
1427 LIMSEQ_norm ~> tendsto_norm
1428 LIMSEQ_add ~> tendsto_add
1429 LIMSEQ_minus ~> tendsto_minus
1430 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1431 LIMSEQ_diff ~> tendsto_diff
1432 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1433 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1434 LIMSEQ_mult ~> tendsto_mult
1435 LIMSEQ_inverse ~> tendsto_inverse
1436 LIMSEQ_divide ~> tendsto_divide
1437 LIMSEQ_pow ~> tendsto_power
1438 LIMSEQ_setsum ~> tendsto_setsum
1439 LIMSEQ_setprod ~> tendsto_setprod
1440 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1441 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1442 LIMSEQ_imp_rabs ~> tendsto_rabs
1443 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1444 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1445 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1446 LIMSEQ_Complex ~> tendsto_Complex
1447 LIM_ident ~> tendsto_ident_at
1448 LIM_const ~> tendsto_const
1449 LIM_add ~> tendsto_add
1450 LIM_add_zero ~> tendsto_add_zero
1451 LIM_minus ~> tendsto_minus
1452 LIM_diff ~> tendsto_diff
1453 LIM_norm ~> tendsto_norm
1454 LIM_norm_zero ~> tendsto_norm_zero
1455 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1456 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1457 LIM_rabs ~> tendsto_rabs
1458 LIM_rabs_zero ~> tendsto_rabs_zero
1459 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1460 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1461 LIM_compose ~> tendsto_compose
1462 LIM_mult ~> tendsto_mult
1463 LIM_scaleR ~> tendsto_scaleR
1464 LIM_of_real ~> tendsto_of_real
1465 LIM_power ~> tendsto_power
1466 LIM_inverse ~> tendsto_inverse
1467 LIM_sgn ~> tendsto_sgn
1468 isCont_LIM_compose ~> isCont_tendsto_compose
1469 bounded_linear.LIM ~> bounded_linear.tendsto
1470 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1471 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1472 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1473 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1474 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1475 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1477 * Theory Complex_Main: The definition of infinite series was
1478 generalized. Now it is defined on the type class {topological_space,
1479 comm_monoid_add}. Hence it is useable also for extended real numbers.
1481 * Theory Complex_Main: The complex exponential function "expi" is now
1482 a type-constrained abbreviation for "exp :: complex => complex"; thus
1483 several polymorphic lemmas about "exp" are now applicable to "expi".
1487 - Theory Library/Code_Char_ord provides native ordering of
1488 characters in the target language.
1490 - Commands code_module and code_library are legacy, use export_code
1493 - Method "evaluation" is legacy, use method "eval" instead.
1495 - Legacy evaluator "SML" is deactivated by default. May be
1496 reactivated by the following theory command:
1498 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1500 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1502 * New proof method "induction" that gives induction hypotheses the
1503 name "IH", thus distinguishing them from further hypotheses that come
1504 from rule induction. The latter are still called "hyps". Method
1505 "induction" is a thin wrapper around "induct" and follows the same
1508 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1509 still available as a legacy feature for some time.
1512 - Added "need" and "total_consts" options.
1513 - Reintroduced "show_skolems" option by popular demand.
1514 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1518 - Use quasi-sound (and efficient) translations by default.
1519 - Added support for the following provers: E-ToFoF, LEO-II,
1520 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1521 - Automatically preplay and minimize proofs before showing them if
1522 this can be done within reasonable time.
1523 - sledgehammer available_provers ~> sledgehammer supported_provers.
1525 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1526 "max_mono_iters", and "max_new_mono_instances" options.
1527 - Removed "explicit_apply" and "full_types" options as well as "Full
1528 Types" Proof General menu item. INCOMPATIBILITY.
1531 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1532 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1536 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1537 "elim:" options. INCOMPATIBILITY.
1538 - Introduced 'try' that not only runs 'try_methods' but also
1539 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1542 - Added "eval" option to evaluate terms for the found counterexample
1543 (currently only supported by the default (exhaustive) tester).
1544 - Added post-processing of terms to obtain readable counterexamples
1545 (currently only supported by the default (exhaustive) tester).
1546 - New counterexample generator quickcheck[narrowing] enables
1547 narrowing-based testing. Requires the Glasgow Haskell compiler
1548 with its installation location defined in the Isabelle settings
1549 environment as ISABELLE_GHC.
1550 - Removed quickcheck tester "SML" based on the SML code generator
1551 (formly in HOL/Library).
1553 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1554 use 'partial_function' instead.
1556 * Theory Library/Extended_Reals replaces now the positive extended
1557 reals found in probability theory. This file is extended by
1558 Multivariate_Analysis/Extended_Real_Limits.
1560 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1561 from where it must be imported explicitly if it is really required.
1564 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1565 been moved here. INCOMPATIBILITY.
1567 * Theory Library/Saturated provides type of numbers with saturated
1570 * Theory Library/Product_Lattice defines a pointwise ordering for the
1571 product type 'a * 'b, and provides instance proofs for various order
1572 and lattice type classes.
1574 * Theory Library/Countable now provides the "countable_datatype" proof
1575 method for proving "countable" class instances for datatypes.
1577 * Theory Library/Cset_Monad allows do notation for computable sets
1578 (cset) via the generic monad ad-hoc overloading facility.
1580 * Library: Theories of common data structures are split into theories
1581 for implementation, an invariant-ensuring type, and connection to an
1582 abstract type. INCOMPATIBILITY.
1584 - RBT is split into RBT and RBT_Mapping.
1585 - AssocList is split and renamed into AList and AList_Mapping.
1586 - DList is split into DList_Impl, DList, and DList_Cset.
1587 - Cset is split into Cset and List_Cset.
1589 * Theory Library/Nat_Infinity has been renamed to
1590 Library/Extended_Nat, with name changes of the following types and
1593 type inat ~> type enat
1595 Infty ~> infinity (overloaded)
1599 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1600 been renamed accordingly. INCOMPATIBILITY.
1602 * Session Multivariate_Analysis: The euclidean_space type class now
1603 fixes a constant "Basis :: 'a set" consisting of the standard
1604 orthonormal basis for the type. Users now have the option of
1605 quantifying over this set instead of using the "basis" function, e.g.
1606 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1608 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1609 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1610 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1611 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1612 changed to match. Definition theorems for overloaded constants now use
1613 the standard "foo_vec_def" naming scheme. A few other theorems have
1614 been renamed as follows (INCOMPATIBILITY):
1616 Cart_eq ~> vec_eq_iff
1617 dist_nth_le_cart ~> dist_vec_nth_le
1618 tendsto_vector ~> vec_tendstoI
1619 Cauchy_vector ~> vec_CauchyI
1621 * Session Multivariate_Analysis: Several duplicate theorems have been
1622 removed, and other theorems have been renamed or replaced with more
1623 general versions. INCOMPATIBILITY.
1625 finite_choice ~> finite_set_choice
1626 eventually_conjI ~> eventually_conj
1627 eventually_and ~> eventually_conj_iff
1628 eventually_false ~> eventually_False
1629 setsum_norm ~> norm_setsum
1630 Lim_sequentially ~> LIMSEQ_def
1631 Lim_ident_at ~> LIM_ident
1632 Lim_const ~> tendsto_const
1633 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1634 Lim_neg ~> tendsto_minus
1635 Lim_add ~> tendsto_add
1636 Lim_sub ~> tendsto_diff
1637 Lim_mul ~> tendsto_scaleR
1638 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1639 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1640 Lim_linear ~> bounded_linear.tendsto
1641 Lim_component ~> tendsto_euclidean_component
1642 Lim_component_cart ~> tendsto_vec_nth
1643 Lim_inner ~> tendsto_inner [OF tendsto_const]
1644 dot_lsum ~> inner_setsum_left
1645 dot_rsum ~> inner_setsum_right
1646 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1647 continuous_neg ~> continuous_minus
1648 continuous_sub ~> continuous_diff
1649 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1650 continuous_mul ~> continuous_scaleR
1651 continuous_inv ~> continuous_inverse
1652 continuous_at_within_inv ~> continuous_at_within_inverse
1653 continuous_at_inv ~> continuous_at_inverse
1654 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1655 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1656 continuous_at_component ~> continuous_component [OF continuous_at_id]
1657 continuous_on_neg ~> continuous_on_minus
1658 continuous_on_sub ~> continuous_on_diff
1659 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1660 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1661 continuous_on_mul ~> continuous_on_scaleR
1662 continuous_on_mul_real ~> continuous_on_mult
1663 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1664 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1665 continuous_on_inverse ~> continuous_on_inv
1666 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1667 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1668 subset_interior ~> interior_mono
1669 subset_closure ~> closure_mono
1670 closure_univ ~> closure_UNIV
1671 real_arch_lt ~> reals_Archimedean2
1672 real_arch ~> reals_Archimedean3
1673 real_abs_norm ~> abs_norm_cancel
1674 real_abs_sub_norm ~> norm_triangle_ineq3
1675 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1677 * Session HOL-Probability:
1678 - Caratheodory's extension lemma is now proved for ring_of_sets.
1679 - Infinite products of probability measures are now available.
1680 - Sigma closure is independent, if the generator is independent
1681 - Use extended reals instead of positive extended
1682 reals. INCOMPATIBILITY.
1684 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1686 expand_fun_below ~> fun_below_iff
1687 below_fun_ext ~> fun_belowI
1688 expand_cfun_eq ~> cfun_eq_iff
1689 ext_cfun ~> cfun_eqI
1690 expand_cfun_below ~> cfun_below_iff
1691 below_cfun_ext ~> cfun_belowI
1692 monofun_fun_fun ~> fun_belowD
1693 monofun_fun_arg ~> monofunE
1694 monofun_lub_fun ~> adm_monofun [THEN admD]
1695 cont_lub_fun ~> adm_cont [THEN admD]
1696 cont2cont_Rep_CFun ~> cont2cont_APP
1697 cont_Rep_CFun_app ~> cont_APP_app
1698 cont_Rep_CFun_app_app ~> cont_APP_app_app
1699 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
1700 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
1701 contlub_cfun ~> lub_APP [symmetric]
1702 contlub_LAM ~> lub_LAM [symmetric]
1705 lift_distinct1 ~> lift.distinct(1)
1706 lift_distinct2 ~> lift.distinct(2)
1707 Def_not_UU ~> lift.distinct(2)
1708 Def_inject ~> lift.inject
1709 below_UU_iff ~> below_bottom_iff
1710 eq_UU_iff ~> eq_bottom_iff
1713 *** Document preparation ***
1715 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
1716 isar-ref manual, both for description and actual application of the
1719 * Antiquotation @{value} evaluates the given term and presents its
1722 * Antiquotations: term style "isub" provides ad-hoc conversion of
1723 variables x1, y23 into subscripted form x\<^isub>1,
1724 y\<^isub>2\<^isub>3.
1726 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
1727 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
1729 * Localized \isabellestyle switch can be used within blocks or groups
1732 \isabellestyle{it} %preferred default
1733 {\isabellestylett @{text "typewriter stuff"}}
1735 * Discontinued special treatment of hard tabulators. Implicit
1736 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
1742 * The inner syntax of sort/type/term/prop supports inlined YXML
1743 representations within quoted string tokens. By encoding logical
1744 entities via Term_XML (in ML or Scala) concrete syntax can be
1745 bypassed, which is particularly useful for producing bits of text
1746 under external program control.
1748 * Antiquotations for ML and document preparation are managed as theory
1749 data, which requires explicit setup.
1751 * Isabelle_Process.is_active allows tools to check if the official
1752 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
1753 (better known as Proof General).
1755 * Structure Proof_Context follows standard naming scheme. Old
1756 ProofContext is still available for some time as legacy alias.
1758 * Structure Timing provides various operations for timing; supersedes
1759 former start_timing/end_timing etc.
1761 * Path.print is the official way to show file-system paths to users
1762 (including quotes etc.).
1764 * Inner syntax: identifiers in parse trees of generic categories
1765 "logic", "aprop", "idt" etc. carry position information (disguised as
1766 type constraints). Occasional INCOMPATIBILITY with non-compliant
1767 translations that choke on unexpected type constraints. Positions can
1768 be stripped in ML translations via Syntax.strip_positions /
1769 Syntax.strip_positions_ast, or via the syntax constant
1770 "_strip_positions" within parse trees. As last resort, positions can
1771 be disabled via the configuration option Syntax.positions, which is
1772 called "syntax_positions" in Isar attribute syntax.
1774 * Discontinued special status of various ML structures that contribute
1775 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
1776 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
1777 refer directly to Ast.Constant, Lexicon.is_identifier,
1778 Syntax_Trans.mk_binder_tr etc.
1780 * Typed print translation: discontinued show_sorts argument, which is
1781 already available via context of "advanced" translation.
1783 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
1784 goal states; body tactic needs to address all subgoals uniformly.
1786 * Slightly more special eq_list/eq_set, with shortcut involving
1787 pointer equality (assumes that eq relation is reflexive).
1789 * Classical tactics use proper Proof.context instead of historic types
1790 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
1791 operate directly on Proof.context. Raw type claset retains its use as
1792 snapshot of the classical context, which can be recovered via
1793 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
1794 INCOMPATIBILITY, classical tactics and derived proof methods require
1795 proper Proof.context.
1800 * Discontinued support for Poly/ML 5.2, which was the last version
1801 without proper multithreading and TimeLimit implementation.
1803 * Discontinued old lib/scripts/polyml-platform, which has been
1804 obsolete since Isabelle2009-2.
1806 * Various optional external tools are referenced more robustly and
1807 uniformly by explicit Isabelle settings as follows:
1809 ISABELLE_CSDP (formerly CSDP_EXE)
1810 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
1811 ISABELLE_OCAML (formerly EXEC_OCAML)
1812 ISABELLE_SWIPL (formerly EXEC_SWIPL)
1813 ISABELLE_YAP (formerly EXEC_YAP)
1815 Note that automated detection from the file-system or search path has
1816 been discontinued. INCOMPATIBILITY.
1818 * Scala layer provides JVM method invocation service for static
1819 methods of type (String)String, see Invoke_Scala.method in ML. For
1822 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
1824 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
1825 this allows to pass structured values between ML and Scala.
1827 * The IsabelleText fonts includes some further glyphs to support the
1828 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
1829 installed a local copy (which is normally *not* required) need to
1830 delete or update it from ~~/lib/fonts/.
1834 New in Isabelle2011 (January 2011)
1835 ----------------------------------
1839 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
1840 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
1841 useful tooltips and hyperlinks produced from its static analysis. The
1842 bundled component provides an executable Isabelle tool that can be run
1845 Isabelle2011/bin/isabelle jedit
1847 * Significantly improved Isabelle/Isar implementation manual.
1849 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
1850 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
1851 while the default heap location within that directory lacks that extra
1852 suffix. This isolates multiple Isabelle installations from each
1853 other, avoiding problems with old settings in new versions.
1854 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
1856 * Source files are always encoded as UTF-8, instead of old-fashioned
1857 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
1858 the following package declarations:
1860 \usepackage[utf8]{inputenc}
1861 \usepackage{textcomp}
1863 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
1864 a Unicode character is treated as a single symbol, not a sequence of
1865 non-ASCII bytes as before. Since Isabelle/ML string literals may
1866 contain symbols without further backslash escapes, Unicode can now be
1867 used here as well. Recall that Symbol.explode in ML provides a
1868 consistent view on symbols, while raw explode (or String.explode)
1869 merely give a byte-oriented representation.
1871 * Theory loader: source files are primarily located via the master
1872 directory of each theory node (where the .thy file itself resides).
1873 The global load path is still partially available as legacy feature.
1874 Minor INCOMPATIBILITY due to subtle change in file lookup: use
1875 explicit paths, relatively to the theory.
1877 * Special treatment of ML file names has been discontinued.
1878 Historically, optional extensions .ML or .sml were added on demand --
1879 at the cost of clarity of file dependencies. Recall that Isabelle/ML
1880 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
1882 * Various options that affect pretty printing etc. are now properly
1883 handled within the context via configuration options, instead of
1884 unsynchronized references or print modes. There are both ML Config.T
1885 entities and Isar declaration attributes to access these.
1887 ML (Config.T) Isar (attribute)
1889 eta_contract eta_contract
1890 show_brackets show_brackets
1891 show_sorts show_sorts
1892 show_types show_types
1893 show_question_marks show_question_marks
1894 show_consts show_consts
1895 show_abbrevs show_abbrevs
1897 Syntax.ast_trace syntax_ast_trace
1898 Syntax.ast_stat syntax_ast_stat
1899 Syntax.ambiguity_level syntax_ambiguity_level
1901 Goal_Display.goals_limit goals_limit
1902 Goal_Display.show_main_goal show_main_goal
1904 Method.rule_trace rule_trace
1906 Thy_Output.display thy_output_display
1907 Thy_Output.quotes thy_output_quotes
1908 Thy_Output.indent thy_output_indent
1909 Thy_Output.source thy_output_source
1910 Thy_Output.break thy_output_break
1912 Note that corresponding "..._default" references in ML may only be
1913 changed globally at the ROOT session setup, but *not* within a theory.
1914 The option "show_abbrevs" supersedes the former print mode
1915 "no_abbrevs" with inverted meaning.
1917 * More systematic naming of some configuration options.
1920 trace_simp ~> simp_trace
1921 debug_simp ~> simp_debug
1923 * Support for real valued configuration options, using simplistic
1924 floating-point notation that coincides with the inner syntax for
1927 * Support for real valued preferences (with approximative PGIP type):
1928 front-ends need to accept "pgint" values in float notation.
1931 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
1934 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
1939 * Command 'type_synonym' (with single argument) replaces somewhat
1940 outdated 'types', which is still available as legacy feature for some
1943 * Command 'nonterminal' (with 'and' separated list of arguments)
1944 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
1946 * Command 'notepad' replaces former 'example_proof' for
1947 experimentation in Isar without any result. INCOMPATIBILITY.
1949 * Locale interpretation commands 'interpret' and 'sublocale' accept
1950 lists of equations to map definitions in a locale to appropriate
1951 entities in the context of the interpretation. The 'interpretation'
1952 command already provided this functionality.
1954 * Diagnostic command 'print_dependencies' prints the locale instances
1955 that would be activated if the specified expression was interpreted in
1956 the current context. Variant "print_dependencies!" assumes a context
1957 without interpretations.
1959 * Diagnostic command 'print_interps' prints interpretations in proofs
1960 in addition to interpretations in theories.
1962 * Discontinued obsolete 'global' and 'local' commands to manipulate
1963 the theory name space. Rare INCOMPATIBILITY. The ML functions
1964 Sign.root_path and Sign.local_path may be applied directly where this
1965 feature is still required for historical reasons.
1967 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
1968 'definition' instead.
1970 * The "prems" fact, which refers to the accidental collection of
1971 foundational premises in the context, is now explicitly marked as
1972 legacy feature and will be discontinued soon. Consider using "assms"
1973 of the head statement or reference facts by explicit names.
1975 * Document antiquotations @{class} and @{type} print classes and type
1978 * Document antiquotation @{file} checks file/directory entries within
1979 the local file system.
1984 * Coercive subtyping: functions can be declared as coercions and type
1985 inference will add them as necessary upon input of a term. Theory
1986 Complex_Main declares real :: nat => real and real :: int => real as
1987 coercions. A coercion function f is declared like this:
1989 declare [[coercion f]]
1991 To lift coercions through type constructors (e.g. from nat => real to
1992 nat list => real list), map functions can be declared, e.g.
1994 declare [[coercion_map map]]
1996 Currently coercion inference is activated only in theories including
1997 real numbers, i.e. descendants of Complex_Main. This is controlled by
1998 the configuration option "coercion_enabled", e.g. it can be enabled in
1999 other theories like this:
2001 declare [[coercion_enabled]]
2003 * Command 'partial_function' provides basic support for recursive
2004 function definitions over complete partial orders. Concrete instances
2005 are provided for i) the option type, ii) tail recursion on arbitrary
2006 types, and iii) the heap monad of Imperative_HOL. See
2007 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2010 * Function package: f.psimps rules are no longer implicitly declared
2011 as [simp]. INCOMPATIBILITY.
2013 * Datatype package: theorems generated for executable equality (class
2014 "eq") carry proper names and are treated as default code equations.
2016 * Inductive package: now offers command 'inductive_simps' to
2017 automatically derive instantiated and simplified equations for
2018 inductive predicates, similar to 'inductive_cases'.
2020 * Command 'enriched_type' allows to register properties of the
2021 functorial structure of types.
2023 * Improved infrastructure for term evaluation using code generator
2024 techniques, in particular static evaluation conversions.
2026 * Code generator: Scala (2.8 or higher) has been added to the target
2029 * Code generator: globbing constant expressions "*" and "Theory.*"
2030 have been replaced by the more idiomatic "_" and "Theory._".
2033 * Code generator: export_code without explicit file declaration prints
2034 to standard output. INCOMPATIBILITY.
2036 * Code generator: do not print function definitions for case
2037 combinators any longer.
2039 * Code generator: simplification with rules determined with
2040 src/Tools/Code/code_simp.ML and method "code_simp".
2042 * Code generator for records: more idiomatic representation of record
2043 types. Warning: records are not covered by ancient SML code
2044 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2045 rep_datatype declaration helps to succeed then:
2049 rep_datatype foo_ext ...
2051 * Records: logical foundation type for records does not carry a
2052 '_type' suffix any longer (obsolete due to authentic syntax).
2055 * Quickcheck now by default uses exhaustive testing instead of random
2056 testing. Random testing can be invoked by "quickcheck [random]",
2057 exhaustive testing by "quickcheck [exhaustive]".
2059 * Quickcheck instantiates polymorphic types with small finite
2060 datatypes by default. This enables a simple execution mechanism to
2061 handle quantifiers and function equality over the finite datatypes.
2063 * Quickcheck random generator has been renamed from "code" to
2064 "random". INCOMPATIBILITY.
2066 * Quickcheck now has a configurable time limit which is set to 30
2067 seconds by default. This can be changed by adding [timeout = n] to the
2068 quickcheck command. The time limit for Auto Quickcheck is still set
2071 * Quickcheck in locales considers interpretations of that locale for
2072 counter example search.
2075 - Added "smt" and "remote_smt" provers based on the "smt" proof
2076 method. See the Sledgehammer manual for details ("isabelle doc
2079 sledgehammer atp_info ~> sledgehammer running_provers
2080 sledgehammer atp_kill ~> sledgehammer kill_provers
2081 sledgehammer available_atps ~> sledgehammer available_provers
2084 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2085 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2086 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2087 (and "ms" and "min" are no longer supported)
2092 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2093 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2095 - Added support for partial quotient types.
2096 - Added local versions of the "Nitpick.register_xxx" functions.
2097 - Added "whack" option.
2098 - Allow registration of quotient types as codatatypes.
2099 - Improved "merge_type_vars" option to merge more types.
2100 - Removed unsound "fast_descrs" option.
2101 - Added custom symmetry breaking for datatypes, making it possible to reach
2102 higher cardinalities.
2103 - Prevent the expansion of too large definitions.
2105 * Proof methods "metis" and "meson" now have configuration options
2106 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2107 to diagnose these tools. E.g.
2109 using [[metis_trace = true]]
2111 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2112 manually as command 'solve_direct'.
2114 * The default SMT solver Z3 must be enabled explicitly (due to
2115 licensing issues) by setting the environment variable
2116 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2117 commercial applications, the SMT solver CVC3 is provided as fall-back;
2118 changing the SMT solver is done via the configuration option
2121 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2122 i.e. "remote_cvc3" and "remote_z3".
2124 * Added basic SMT support for datatypes, records, and typedefs using
2125 the oracle mode (no proofs). Direct support of pairs has been dropped
2126 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2127 support for a similar behavior). Minor INCOMPATIBILITY.
2129 * Changed SMT configuration options:
2131 z3_proofs ~> smt_oracle (with inverted meaning)
2132 z3_trace_assms ~> smt_trace_used_facts
2145 * Boogie output files (.b2i files) need to be declared in the theory
2148 * Simplification procedure "list_to_set_comprehension" rewrites list
2149 comprehensions applied to List.set to set comprehensions. Occasional
2150 INCOMPATIBILITY, may be deactivated like this:
2152 declare [[simproc del: list_to_set_comprehension]]
2154 * Removed old version of primrec package. INCOMPATIBILITY.
2156 * Removed simplifier congruence rule of "prod_case", as has for long
2157 been the case with "split". INCOMPATIBILITY.
2159 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2161 * Removed [split_format ... and ... and ...] version of
2162 [split_format]. Potential INCOMPATIBILITY.
2164 * Predicate "sorted" now defined inductively, with nice induction
2165 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2167 * Constant "contents" renamed to "the_elem", to free the generic name
2168 contents for other uses. INCOMPATIBILITY.
2170 * Renamed class eq and constant eq (for code generation) to class
2171 equal and constant equal, plus renaming of related facts and various
2172 tuning. INCOMPATIBILITY.
2174 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2176 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2179 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2180 avoid confusion with finite sets. INCOMPATIBILITY.
2182 * Abandoned locales equiv, congruent and congruent2 for equivalence
2183 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2186 * Some previously unqualified names have been qualified:
2193 Trueprop ~> HOL.Trueprop
2198 op --> ~> HOL.implies
2210 Pair ~> Product_Type.Pair
2211 fst ~> Product_Type.fst
2212 snd ~> Product_Type.snd
2213 curry ~> Product_Type.curry
2215 Collect ~> Set.Collect
2219 * More canonical naming convention for some fundamental definitions:
2221 bot_bool_eq ~> bot_bool_def
2222 top_bool_eq ~> top_bool_def
2223 inf_bool_eq ~> inf_bool_def
2224 sup_bool_eq ~> sup_bool_def
2225 bot_fun_eq ~> bot_fun_def
2226 top_fun_eq ~> top_fun_def
2227 inf_fun_eq ~> inf_fun_def
2228 sup_fun_eq ~> sup_fun_def
2232 * More stylized fact names:
2234 expand_fun_eq ~> fun_eq_iff
2235 expand_set_eq ~> set_eq_iff
2237 nat_number ~> eval_nat_numeral
2241 * Refactoring of code-generation specific operations in theory List:
2247 mem_iff ~> member_def
2248 null_empty ~> null_def
2250 INCOMPATIBILITY. Note that these were not supposed to be used
2251 regularly unless for striking reasons; their main purpose was code
2254 Various operations from the Haskell prelude are used for generating
2257 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2258 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2259 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2261 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2262 "*" and "+" respectively. INCOMPATIBILITY.
2264 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2265 "Sum_Type.Plus" instead.
2267 * Constant "split" has been merged with constant "prod_case"; names of
2268 ML functions, facts etc. involving split have been retained so far,
2269 though. INCOMPATIBILITY.
2271 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2272 instead. INCOMPATIBILITY.
2274 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2277 * Former theory Library/Enum is now part of the HOL-Main image.
2278 INCOMPATIBILITY: all constants of the Enum theory now have to be
2279 referred to by its qualified name.
2282 nlists ~> Enum.nlists
2283 product ~> Enum.product
2285 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2286 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2289 * Theory Library/SetsAndFunctions has been split into
2290 Library/Function_Algebras and Library/Set_Algebras; canonical names
2291 for instance definitions for functions; various improvements.
2294 * Theory Library/Multiset provides stable quicksort implementation of
2297 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2300 * Session Multivariate_Analysis: introduced a type class for euclidean
2301 space. Most theorems are now stated in terms of euclidean spaces
2302 instead of finite cartesian products.
2305 real ^ 'n ~> 'a::real_vector
2306 ~> 'a::euclidean_space
2307 ~> 'a::ordered_euclidean_space
2308 (depends on your needs)
2312 \<chi> x. _ ~> \<chi>\<chi> x. _
2315 Also note that the indices are now natural numbers and not from some
2316 finite type. Finite cartesian products of euclidean spaces, products
2317 of euclidean spaces the real and complex numbers are instantiated to
2318 be euclidean_spaces. INCOMPATIBILITY.
2320 * Session Probability: introduced pextreal as positive extended real
2321 numbers. Use pextreal as value for measures. Introduce the
2322 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2323 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2324 the integral in Multivariate Analysis. INCOMPATIBILITY.
2326 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2329 * Session SPARK (with image HOL-SPARK) provides commands to load and
2330 prove verification conditions generated by the SPARK Ada program
2331 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2336 * Theorems for additive ring operations (locale abelian_monoid and
2337 descendants) are generated by interpretation from their multiplicative
2338 counterparts. Names (in particular theorem names) have the mandatory
2339 qualifier 'add'. Previous theorem names are redeclared for
2342 * Structure "int_ring" is now an abbreviation (previously a
2343 definition). This fits more natural with advanced interpretations.
2348 * The domain package now runs in definitional mode by default: The
2349 former command 'new_domain' is now called 'domain'. To use the domain
2350 package in its original axiomatic mode, use 'domain (unsafe)'.
2353 * The new class "domain" is now the default sort. Class "predomain"
2354 is an unpointed version of "domain". Theories can be updated by
2355 replacing sort annotations as shown below. INCOMPATIBILITY.
2357 'a::type ~> 'a::countable
2358 'a::cpo ~> 'a::predomain
2359 'a::pcpo ~> 'a::domain
2361 * The old type class "rep" has been superseded by class "domain".
2362 Accordingly, users of the definitional package must remove any
2363 "default_sort rep" declarations. INCOMPATIBILITY.
2365 * The domain package (definitional mode) now supports unpointed
2366 predomain argument types, as long as they are marked 'lazy'. (Strict
2367 arguments must be in class "domain".) For example, the following
2368 domain definition now works:
2370 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2372 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2373 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2374 'a option, and 'a list. Additionally, it configures fixrec and the
2375 domain package to work with these types. For example:
2377 fixrec isInl :: "('a + 'b) u -> tr"
2378 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2380 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2382 * The "(permissive)" option of fixrec has been replaced with a
2383 per-equation "(unchecked)" option. See
2384 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2386 * The "bifinite" class no longer fixes a constant "approx"; the class
2387 now just asserts that such a function exists. INCOMPATIBILITY.
2389 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2390 defines an embedding of type 'a defl into udom by default; instances
2391 of "bifinite" and "domain" classes are available in
2392 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2394 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2396 * The predicate "directed" has been removed. INCOMPATIBILITY.
2398 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2400 * The function "cprod_map" has been renamed to "prod_map".
2403 * The monadic bind operator on each powerdomain has new binder syntax
2404 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2405 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2407 * The infix syntax for binary union on each powerdomain has changed
2408 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2409 syntax. INCOMPATIBILITY.
2411 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2412 still supported as an input translation.
2414 * Renamed some theorems (the original names are also still available).
2416 expand_fun_below ~> fun_below_iff
2417 below_fun_ext ~> fun_belowI
2418 expand_cfun_eq ~> cfun_eq_iff
2419 ext_cfun ~> cfun_eqI
2420 expand_cfun_below ~> cfun_below_iff
2421 below_cfun_ext ~> cfun_belowI
2422 cont2cont_Rep_CFun ~> cont2cont_APP
2424 * The Abs and Rep functions for various types have changed names.
2425 Related theorem names have also changed to match. INCOMPATIBILITY.
2427 Rep_CFun ~> Rep_cfun
2428 Abs_CFun ~> Abs_cfun
2429 Rep_Sprod ~> Rep_sprod
2430 Abs_Sprod ~> Abs_sprod
2431 Rep_Ssum ~> Rep_ssum
2432 Abs_Ssum ~> Abs_ssum
2434 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2435 been renamed to *_bottom_iff. INCOMPATIBILITY.
2437 * Various changes to bisimulation/coinduction with domain package:
2439 - Definitions of "bisim" constants no longer mention definedness.
2440 - With mutual recursion, "bisim" predicate is now curried.
2441 - With mutual recursion, each type gets a separate coind theorem.
2442 - Variable names in bisim_def and coinduct rules have changed.
2446 * Case combinators generated by the domain package for type "foo" are
2447 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2449 * Several theorems have been renamed to more accurately reflect the
2450 names of constants and types involved. INCOMPATIBILITY.
2452 thelub_const ~> lub_const
2453 lub_const ~> is_lub_const
2455 is_lub_lub ~> is_lubD2
2457 unique_lub ~> is_lub_unique
2458 is_ub_lub ~> is_lub_rangeD1
2459 lub_bin_chain ~> is_lub_bin_chain
2460 lub_fun ~> is_lub_fun
2461 thelub_fun ~> lub_fun
2462 thelub_cfun ~> lub_cfun
2463 thelub_Pair ~> lub_Pair
2464 lub_cprod ~> is_lub_prod
2465 thelub_cprod ~> lub_prod
2466 minimal_cprod ~> minimal_prod
2467 inst_cprod_pcpo ~> inst_prod_pcpo
2469 compact_UU ~> compact_bottom
2470 deflation_UU ~> deflation_bottom
2471 finite_deflation_UU ~> finite_deflation_bottom
2473 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2475 sq_ord_less_eq_trans ~> below_eq_trans
2476 sq_ord_eq_less_trans ~> eq_below_trans
2477 refl_less ~> below_refl
2478 trans_less ~> below_trans
2479 antisym_less ~> below_antisym
2480 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2481 box_less ~> box_below
2482 rev_trans_less ~> rev_below_trans
2483 not_less2not_eq ~> not_below2not_eq
2484 less_UU_iff ~> below_UU_iff
2485 flat_less_iff ~> flat_below_iff
2486 adm_less ~> adm_below
2487 adm_not_less ~> adm_not_below
2488 adm_compact_not_less ~> adm_compact_not_below
2489 less_fun_def ~> below_fun_def
2490 expand_fun_less ~> fun_below_iff
2491 less_fun_ext ~> fun_belowI
2492 less_discr_def ~> below_discr_def
2493 discr_less_eq ~> discr_below_eq
2494 less_unit_def ~> below_unit_def
2495 less_cprod_def ~> below_prod_def
2496 prod_lessI ~> prod_belowI
2497 Pair_less_iff ~> Pair_below_iff
2498 fst_less_iff ~> fst_below_iff
2499 snd_less_iff ~> snd_below_iff
2500 expand_cfun_less ~> cfun_below_iff
2501 less_cfun_ext ~> cfun_belowI
2502 injection_less ~> injection_below
2503 less_up_def ~> below_up_def
2504 not_Iup_less ~> not_Iup_below
2505 Iup_less ~> Iup_below
2507 Def_inject_less_eq ~> Def_below_Def
2508 Def_less_is_eq ~> Def_below_iff
2509 spair_less_iff ~> spair_below_iff
2510 less_sprod ~> below_sprod
2511 spair_less ~> spair_below
2512 sfst_less_iff ~> sfst_below_iff
2513 ssnd_less_iff ~> ssnd_below_iff
2514 fix_least_less ~> fix_least_below
2515 dist_less_one ~> dist_below_one
2516 less_ONE ~> below_ONE
2517 ONE_less_iff ~> ONE_below_iff
2518 less_sinlD ~> below_sinlD
2519 less_sinrD ~> below_sinrD
2524 * All constant names are now qualified internally and use proper
2525 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2530 * Antiquotation @{assert} inlines a function bool -> unit that raises
2531 Fail if the argument is false. Due to inlining the source position of
2532 failed assertions is included in the error output.
2534 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2535 text is in practice always evaluated with a stable theory checkpoint.
2536 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2538 * Antiquotation @{theory A} refers to theory A from the ancestry of
2539 the current context, not any accidental theory loader state as before.
2540 Potential INCOMPATIBILITY, subtle change in semantics.
2542 * Syntax.pretty_priority (default 0) configures the required priority
2543 of pretty-printed output and thus affects insertion of parentheses.
2545 * Syntax.default_root (default "any") configures the inner syntax
2546 category (nonterminal symbol) for parsing of terms.
2548 * Former exception Library.UnequalLengths now coincides with
2549 ListPair.UnequalLengths.
2551 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2552 main functionality is provided by structure Simplifier.
2554 * Renamed raw "explode" function to "raw_explode" to emphasize its
2555 meaning. Note that internally to Isabelle, Symbol.explode is used in
2556 almost all situations.
2558 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2559 See implementation manual for further details on exceptions in
2562 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2565 * Renamed structure PureThy to Pure_Thy and moved most of its
2566 operations to structure Global_Theory, to emphasize that this is
2567 rarely-used global-only stuff.
2569 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2570 instead (or tracing for high-volume output).
2572 * Configuration option show_question_marks only affects regular pretty
2573 printing of types and terms, not raw Term.string_of_vname.
2575 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2576 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2577 @{thms} for most purposes.
2579 * ML structure Unsynchronized is never opened, not even in Isar
2580 interaction mode as before. Old Unsynchronized.set etc. have been
2581 discontinued -- use plain := instead. This should be *rare* anyway,
2582 since modern tools always work via official context data, notably
2583 configuration options.
2585 * Parallel and asynchronous execution requires special care concerning
2586 interrupts. Structure Exn provides some convenience functions that
2587 avoid working directly with raw Interrupt. User code must not absorb
2588 interrupts -- intermediate handling (for cleanup etc.) needs to be
2589 followed by re-raising of the original exception. Another common
2590 source of mistakes are "handle _" patterns, which make the meaning of
2591 the program subject to physical effects of the environment.
2595 New in Isabelle2009-2 (June 2010)
2596 ---------------------------------
2600 * Authentic syntax for *all* logical entities (type classes, type
2601 constructors, term constants): provides simple and robust
2602 correspondence between formal entities and concrete syntax. Within
2603 the parse tree / AST representations, "constants" are decorated by
2604 their category (class, type, const) and spelled out explicitly with
2605 their full internal name.
2607 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2608 and translations (translation rules and translation functions in ML).
2609 Some hints on upgrading:
2611 - Many existing uses of 'syntax' and 'translations' can be replaced
2612 by more modern 'type_notation', 'notation' and 'abbreviation',
2613 which are independent of this issue.
2615 - 'translations' require markup within the AST; the term syntax
2616 provides the following special forms:
2618 CONST c -- produces syntax version of constant c from context
2619 XCONST c -- literally c, checked as constant from context
2620 c -- literally c, if declared by 'syntax'
2622 Plain identifiers are treated as AST variables -- occasionally the
2623 system indicates accidental variables via the error "rhs contains
2626 Type classes and type constructors are marked according to their
2627 concrete syntax. Some old translations rules need to be written
2628 for the "type" category, using type constructor application
2629 instead of pseudo-term application of the default category
2632 - 'parse_translation' etc. in ML may use the following
2635 @{class_syntax c} -- type class c within parse tree / AST
2636 @{term_syntax c} -- type constructor c within parse tree / AST
2637 @{const_syntax c} -- ML version of "CONST c" above
2638 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2640 - Literal types within 'typed_print_translations', i.e. those *not*
2641 represented as pseudo-terms are represented verbatim. Use @{class
2642 c} or @{type_name c} here instead of the above syntax
2645 Note that old non-authentic syntax was based on unqualified base
2646 names, so all of the above "constant" names would coincide. Recall
2647 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2648 diagnose syntax problems.
2650 * Type constructors admit general mixfix syntax, not just infix.
2652 * Concrete syntax may be attached to local entities without a proof
2653 body, too. This works via regular mixfix annotations for 'fix',
2654 'def', 'obtain' etc. or via the explicit 'write' command, which is
2655 similar to the 'notation' command in theory specifications.
2657 * Discontinued unnamed infix syntax (legacy feature for many years) --
2658 need to specify constant name and syntax separately. Internal ML
2659 datatype constructors have been renamed from InfixName to Infix etc.
2660 Minor INCOMPATIBILITY.
2662 * Schematic theorem statements need to be explicitly markup as such,
2663 via commands 'schematic_lemma', 'schematic_theorem',
2664 'schematic_corollary'. Thus the relevance of the proof is made
2665 syntactically clear, which impacts performance in a parallel or
2666 asynchronous interactive environment. Minor INCOMPATIBILITY.
2668 * Use of cumulative prems via "!" in some proof methods has been
2669 discontinued (old legacy feature).
2671 * References 'trace_simp' and 'debug_simp' have been replaced by
2672 configuration options stored in the context. Enabling tracing (the
2673 case of debugging is similar) in proofs works via
2675 using [[trace_simp = true]]
2677 Tracing is then active for all invocations of the simplifier in
2678 subsequent goal refinement steps. Tracing may also still be enabled or
2679 disabled via the ProofGeneral settings menu.
2681 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2682 'hide_fact' replace the former 'hide' KIND command. Minor
2685 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2686 more efficient than combinations with -q1 or -q2.
2691 * Proofterms record type-class reasoning explicitly, using the
2692 "unconstrain" operation internally. This eliminates all sort
2693 constraints from a theorem and proof, introducing explicit
2694 OFCLASS-premises. On the proof term level, this operation is
2695 automatically applied at theorem boundaries, such that closed proofs
2696 are always free of sort constraints. INCOMPATIBILITY for tools that
2697 inspect proof terms.
2699 * Local theory specifications may depend on extra type variables that
2700 are not present in the result type -- arguments TYPE('a) :: 'a itself
2701 are added internally. For example:
2703 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
2705 * Predicates of locales introduced by classes carry a mandatory
2706 "class" prefix. INCOMPATIBILITY.
2708 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
2710 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
2713 * Command 'code_reflect' allows to incorporate generated ML code into
2714 runtime environment; replaces immature code_datatype antiquotation.
2717 * Code generator: simple concept for abstract datatypes obeying
2720 * Code generator: details of internal data cache have no impact on the
2721 user space functionality any longer.
2723 * Methods "unfold_locales" and "intro_locales" ignore non-locale
2724 subgoals. This is more appropriate for interpretations with 'where'.
2727 * Command 'example_proof' opens an empty proof body. This allows to
2728 experiment with Isar, without producing any persistent result.
2730 * Commands 'type_notation' and 'no_type_notation' declare type syntax
2731 within a local theory context, with explicit checking of the
2732 constructors involved (in contrast to the raw 'syntax' versions).
2734 * Commands 'types' and 'typedecl' now work within a local theory
2735 context -- without introducing dependencies on parameters or
2736 assumptions, which is not possible in Isabelle/Pure.
2738 * Command 'defaultsort' has been renamed to 'default_sort', it works
2739 within a local theory context. Minor INCOMPATIBILITY.
2744 * Command 'typedef' now works within a local theory context -- without
2745 introducing dependencies on parameters or assumptions, which is not
2746 possible in Isabelle/Pure/HOL. Note that the logical environment may
2747 contain multiple interpretations of local typedefs (with different
2748 non-emptiness proofs), even in a global theory context.
2750 * New package for quotient types. Commands 'quotient_type' and
2751 'quotient_definition' may be used for defining types and constants by
2752 quotient constructions. An example is the type of integers created by
2753 quotienting pairs of natural numbers:
2756 intrel :: "(nat * nat) => (nat * nat) => bool"
2758 "intrel (x, y) (u, v) = (x + v = u + y)"
2760 quotient_type int = "nat * nat" / intrel
2761 by (auto simp add: equivp_def expand_fun_eq)
2764 "0::int" is "(0::nat, 0::nat)"
2766 The method "lifting" can be used to lift of theorems from the
2767 underlying "raw" type to the quotient type. The example
2768 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
2769 construction and provides a reasoning infrastructure for finite sets.
2771 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
2772 clash with new theory Quotient in Main HOL.
2774 * Moved the SMT binding into the main HOL session, eliminating
2775 separate HOL-SMT session.
2777 * List membership infix mem operation is only an input abbreviation.
2780 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
2781 for future developements; former Library/Word.thy is still present in
2782 the AFP entry RSAPPS.
2784 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
2785 longer shadowed. INCOMPATIBILITY.
2787 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
2790 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
2793 * Dropped normalizing_semiring etc; use the facts in semiring classes
2794 instead. INCOMPATIBILITY.
2796 * Dropped several real-specific versions of lemmas about floor and
2797 ceiling; use the generic lemmas from theory "Archimedean_Field"
2798 instead. INCOMPATIBILITY.
2800 floor_number_of_eq ~> floor_number_of
2801 le_floor_eq_number_of ~> number_of_le_floor
2802 le_floor_eq_zero ~> zero_le_floor
2803 le_floor_eq_one ~> one_le_floor
2804 floor_less_eq_number_of ~> floor_less_number_of
2805 floor_less_eq_zero ~> floor_less_zero
2806 floor_less_eq_one ~> floor_less_one
2807 less_floor_eq_number_of ~> number_of_less_floor
2808 less_floor_eq_zero ~> zero_less_floor
2809 less_floor_eq_one ~> one_less_floor
2810 floor_le_eq_number_of ~> floor_le_number_of
2811 floor_le_eq_zero ~> floor_le_zero
2812 floor_le_eq_one ~> floor_le_one
2813 floor_subtract_number_of ~> floor_diff_number_of
2814 floor_subtract_one ~> floor_diff_one
2815 ceiling_number_of_eq ~> ceiling_number_of
2816 ceiling_le_eq_number_of ~> ceiling_le_number_of
2817 ceiling_le_zero_eq ~> ceiling_le_zero
2818 ceiling_le_eq_one ~> ceiling_le_one
2819 less_ceiling_eq_number_of ~> number_of_less_ceiling
2820 less_ceiling_eq_zero ~> zero_less_ceiling
2821 less_ceiling_eq_one ~> one_less_ceiling
2822 ceiling_less_eq_number_of ~> ceiling_less_number_of
2823 ceiling_less_eq_zero ~> ceiling_less_zero
2824 ceiling_less_eq_one ~> ceiling_less_one
2825 le_ceiling_eq_number_of ~> number_of_le_ceiling
2826 le_ceiling_eq_zero ~> zero_le_ceiling
2827 le_ceiling_eq_one ~> one_le_ceiling
2828 ceiling_subtract_number_of ~> ceiling_diff_number_of
2829 ceiling_subtract_one ~> ceiling_diff_one
2831 * Theory "Finite_Set": various folding_XXX locales facilitate the
2832 application of the various fold combinators on finite sets.
2834 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
2835 provides abstract red-black tree type which is backed by "RBT_Impl" as
2836 implementation. INCOMPATIBILTY.
2838 * Theory Library/Coinductive_List has been removed -- superseded by
2839 AFP/thys/Coinductive.
2841 * Theory PReal, including the type "preal" and related operations, has
2842 been removed. INCOMPATIBILITY.
2844 * Real: new development using Cauchy Sequences.
2846 * Split off theory "Big_Operators" containing setsum, setprod,
2847 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
2849 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
2850 "Int" etc. INCOMPATIBILITY.
2852 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
2854 * New set of rules "ac_simps" provides combined assoc / commute
2855 rewrites for all interpretations of the appropriate generic locales.
2857 * Renamed theory "OrderedGroup" to "Groups" and split theory
2858 "Ring_and_Field" into theories "Rings" and "Fields"; for more
2859 appropriate and more consistent names suitable for name prefixes
2860 within the HOL theories. INCOMPATIBILITY.
2862 * Some generic constants have been put to appropriate theories:
2863 - less_eq, less: Orderings
2864 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
2865 - inverse, divide: Rings
2868 * More consistent naming of type classes involving orderings (and
2871 lower_semilattice ~> semilattice_inf
2872 upper_semilattice ~> semilattice_sup
2874 dense_linear_order ~> dense_linorder
2876 pordered_ab_group_add ~> ordered_ab_group_add
2877 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
2878 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
2879 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
2880 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
2881 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
2882 pordered_cancel_semiring ~> ordered_cancel_semiring
2883 pordered_comm_monoid_add ~> ordered_comm_monoid_add
2884 pordered_comm_ring ~> ordered_comm_ring
2885 pordered_comm_semiring ~> ordered_comm_semiring
2886 pordered_ring ~> ordered_ring
2887 pordered_ring_abs ~> ordered_ring_abs
2888 pordered_semiring ~> ordered_semiring
2890 ordered_ab_group_add ~> linordered_ab_group_add
2891 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
2892 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
2893 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
2894 ordered_field ~> linordered_field
2895 ordered_field_no_lb ~> linordered_field_no_lb
2896 ordered_field_no_ub ~> linordered_field_no_ub
2897 ordered_field_dense_linear_order ~> dense_linordered_field
2898 ordered_idom ~> linordered_idom
2899 ordered_ring ~> linordered_ring
2900 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
2901 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
2902 ordered_ring_strict ~> linordered_ring_strict
2903 ordered_semidom ~> linordered_semidom
2904 ordered_semiring ~> linordered_semiring
2905 ordered_semiring_1 ~> linordered_semiring_1
2906 ordered_semiring_1_strict ~> linordered_semiring_1_strict
2907 ordered_semiring_strict ~> linordered_semiring_strict
2909 The following slightly odd type classes have been moved to a
2910 separate theory Library/Lattice_Algebras:
2912 lordered_ab_group_add ~> lattice_ab_group_add
2913 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
2914 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
2915 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
2916 lordered_ring ~> lattice_ring
2920 * Refined field classes:
2921 - classes division_ring_inverse_zero, field_inverse_zero,
2922 linordered_field_inverse_zero include rule inverse 0 = 0 --
2923 subsumes former division_by_zero class;
2924 - numerous lemmas have been ported from field to division_ring.
2927 * Refined algebra theorem collections:
2928 - dropped theorem group group_simps, use algebra_simps instead;
2929 - dropped theorem group ring_simps, use field_simps instead;
2930 - proper theorem collection field_simps subsumes former theorem
2931 groups field_eq_simps and field_simps;
2932 - dropped lemma eq_minus_self_iff which is a duplicate for
2936 * Theory Finite_Set and List: some lemmas have been generalized from
2939 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
2940 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
2941 inter_Inter_fold_inter ~> inf_Inf_fold_inf
2942 union_Union_fold_union ~> sup_Sup_fold_sup
2943 Inter_fold_inter ~> Inf_fold_inf
2944 Union_fold_union ~> Sup_fold_sup
2945 inter_INTER_fold_inter ~> inf_INFI_fold_inf
2946 union_UNION_fold_union ~> sup_SUPR_fold_sup
2947 INTER_fold_inter ~> INFI_fold_inf
2948 UNION_fold_union ~> SUPR_fold_sup
2950 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
2951 replaced by the more convenient lemmas Inf_empty and Sup_empty.
2952 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
2953 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
2954 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
2955 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
2957 * Reorganized theory Multiset: swapped notation of pointwise and
2960 - pointwise ordering is instance of class order with standard syntax
2962 - multiset ordering has syntax <=# and <#; partial order properties
2963 are provided by means of interpretation with prefix
2965 - less duplication, less historical organization of sections,
2966 conversion from associations lists to multisets, rudimentary code
2968 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
2973 multiset_eq_conv_count_eq ~> multiset_ext_iff
2974 multi_count_ext ~> multiset_ext
2975 diff_union_inverse2 ~> diff_union_cancelR
2979 * Theory Permutation: replaced local "remove" by List.remove1.
2981 * Code generation: ML and OCaml code is decorated with signatures.
2983 * Theory List: added transpose.
2985 * Library/Nat_Bijection.thy is a collection of bijective functions
2986 between nat and other types, which supersedes the older libraries
2987 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
2990 Nat_Int_Bij.nat2_to_nat ~> prod_encode
2991 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
2992 Nat_Int_Bij.int_to_nat_bij ~> int_encode
2993 Nat_Int_Bij.nat_to_int_bij ~> int_decode
2994 Countable.pair_encode ~> prod_encode
2995 NatIso.prod2nat ~> prod_encode
2996 NatIso.nat2prod ~> prod_decode
2997 NatIso.sum2nat ~> sum_encode
2998 NatIso.nat2sum ~> sum_decode
2999 NatIso.list2nat ~> list_encode
3000 NatIso.nat2list ~> list_decode
3001 NatIso.set2nat ~> set_encode
3002 NatIso.nat2set ~> set_decode
3005 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3006 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3007 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3008 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3009 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3010 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3011 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3012 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3013 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3014 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3015 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3016 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3017 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3020 - Renamed ATP commands:
3021 atp_info ~> sledgehammer running_atps
3022 atp_kill ~> sledgehammer kill_atps
3023 atp_messages ~> sledgehammer messages
3024 atp_minimize ~> sledgehammer minimize
3025 print_atps ~> sledgehammer available_atps
3027 - Added user's manual ("isabelle doc sledgehammer").
3028 - Added option syntax and "sledgehammer_params" to customize
3029 Sledgehammer's behavior. See the manual for details.
3030 - Modified the Isar proof reconstruction code so that it produces
3031 direct proofs rather than proofs by contradiction. (This feature
3032 is still experimental.)
3033 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3035 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3038 - Added and implemented "binary_ints" and "bits" options.
3039 - Added "std" option and implemented support for nonstandard models.
3040 - Added and implemented "finitize" option to improve the precision
3041 of infinite datatypes based on a monotonicity analysis.
3042 - Added support for quotient types.
3043 - Added support for "specification" and "ax_specification"
3045 - Added support for local definitions (for "function" and
3046 "termination" proofs).
3047 - Added support for term postprocessors.
3048 - Optimized "Multiset.multiset" and "FinFun.finfun".
3049 - Improved efficiency of "destroy_constrs" optimization.
3050 - Fixed soundness bugs related to "destroy_constrs" optimization and
3052 - Fixed soundness bug related to higher-order constructors.
3053 - Fixed soundness bug when "full_descrs" is enabled.
3054 - Improved precision of set constructs.
3055 - Added "atoms" option.
3056 - Added cache to speed up repeated Kodkod invocations on the same
3058 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3059 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3060 "SAT4J_Light". INCOMPATIBILITY.
3061 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3062 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3063 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3065 * Method "induct" now takes instantiations of the form t, where t is not
3066 a variable, as a shorthand for "x == t", where x is a fresh variable.
3067 If this is not intended, t has to be enclosed in parentheses.
3068 By default, the equalities generated by definitional instantiations
3069 are pre-simplified, which may cause parameters of inductive cases
3070 to disappear, or may even delete some of the inductive cases.
3071 Use "induct (no_simp)" instead of "induct" to restore the old
3072 behaviour. The (no_simp) option is also understood by the "cases"
3073 and "nominal_induct" methods, which now perform pre-simplification, too.
3079 * Variable names in lemmas generated by the domain package have
3080 changed; the naming scheme is now consistent with the HOL datatype
3081 package. Some proof scripts may be affected, INCOMPATIBILITY.
3083 * The domain package no longer defines the function "foo_copy" for
3084 recursive domain "foo". The reach lemma is now stated directly in
3085 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3086 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3088 * Most definedness lemmas generated by the domain package (previously
3089 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3090 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3091 Proofs that used definedness lemmas as intro rules may break,
3092 potential INCOMPATIBILITY.
3094 * Induction and casedist rules generated by the domain package now
3095 declare proper case_names (one called "bottom", and one named for each
3096 constructor). INCOMPATIBILITY.
3098 * For mutually-recursive domains, separate "reach" and "take_lemma"
3099 rules are generated for each domain, INCOMPATIBILITY.
3101 foo_bar.reach ~> foo.reach bar.reach
3102 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3104 * Some lemmas generated by the domain package have been renamed for
3105 consistency with the datatype package, INCOMPATIBILITY.
3107 foo.ind ~> foo.induct
3108 foo.finite_ind ~> foo.finite_induct
3109 foo.coind ~> foo.coinduct
3110 foo.casedist ~> foo.exhaust
3111 foo.exhaust ~> foo.nchotomy
3113 * For consistency with other definition packages, the fixrec package
3114 now generates qualified theorem names, INCOMPATIBILITY.
3116 foo_simps ~> foo.simps
3117 foo_unfold ~> foo.unfold
3118 foo_induct ~> foo.induct
3120 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3121 method and internal fixrec proofs now use the default simpset instead.
3124 * The "contlub" predicate has been removed. Proof scripts should use
3125 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3127 * The "admw" predicate has been removed, INCOMPATIBILITY.
3129 * The constants cpair, cfst, and csnd have been removed in favor of
3130 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3135 * Antiquotations for basic formal entities:
3137 @{class NAME} -- type class
3138 @{class_syntax NAME} -- syntax representation of the above
3140 @{type_name NAME} -- logical type
3141 @{type_abbrev NAME} -- type abbreviation
3142 @{nonterminal NAME} -- type of concrete syntactic category
3143 @{type_syntax NAME} -- syntax representation of any of the above
3145 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3146 @{const_abbrev NAME} -- abbreviated constant
3147 @{const_syntax NAME} -- syntax representation of any of the above
3149 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3150 syntax constant (cf. 'syntax' command).
3152 * Antiquotation @{make_string} inlines a function to print arbitrary
3153 values similar to the ML toplevel. The result is compiler dependent
3154 and may fall back on "?" in certain situations.
3156 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3157 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3158 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3159 not work with the asynchronous Isar document model.
3161 * Configuration options now admit dynamic default values, depending on
3162 the context or even global references.
3164 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3165 uses an efficient external library if available (for Poly/ML).
3167 * Renamed some important ML structures, while keeping the old names
3168 for some time as aliases within the structure Legacy:
3170 OuterKeyword ~> Keyword
3173 OuterSyntax ~> Outer_Syntax
3174 PrintMode ~> Print_Mode
3175 SpecParse ~> Parse_Spec
3178 ThyOutput ~> Thy_Output
3179 TypeInfer ~> Type_Infer
3181 Note that "open Legacy" simplifies porting of sources, but forgetting
3182 to remove it again will complicate porting again in the future.
3184 * Most operations that refer to a global context are named
3185 accordingly, e.g. Simplifier.global_context or
3186 ProofContext.init_global. There are some situations where a global
3187 context actually works, but under normal circumstances one needs to
3188 pass the proper local context through the code!
3190 * Discontinued old TheoryDataFun with its copy/init operation -- data
3191 needs to be pure. Functor Theory_Data_PP retains the traditional
3192 Pretty.pp argument to merge, which is absent in the standard
3193 Theory_Data version.
3195 * Sorts.certify_sort and derived "cert" operations for types and terms
3196 no longer minimize sorts. Thus certification at the boundary of the
3197 inference kernel becomes invariant under addition of class relations,
3198 which is an important monotonicity principle. Sorts are now minimized
3199 in the syntax layer only, at the boundary between the end-user and the
3200 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3201 explicitly in rare situations.
3203 * Renamed old-style Drule.standard to Drule.export_without_context, to
3204 emphasize that this is in no way a standard operation.
3207 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3208 usual for resolution. Rare INCOMPATIBILITY.
3210 * Renamed varify/unvarify operations to varify_global/unvarify_global
3211 to emphasize that these only work in a global situation (which is
3214 * Curried take and drop in library.ML; negative length is interpreted
3215 as infinity (as in chop). Subtle INCOMPATIBILITY.
3217 * Proof terms: type substitutions on proof constants now use canonical
3218 order of type variables. INCOMPATIBILITY for tools working with proof
3221 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3222 may no longer carry premises. User-level specifications are
3223 transformed accordingly by Thm.add_axiom/add_def.
3228 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3229 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3230 proof terms are enabled unconditionally in the new HOL-Proofs image.
3232 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3233 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3236 * Old lib/scripts/polyml-platform is superseded by the
3237 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3238 variant, even on a 64 bit machine. The following example setting
3239 prefers 64 bit if available:
3241 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3243 * The preliminary Isabelle/jEdit application demonstrates the emerging
3244 Isabelle/Scala layer for advanced prover interaction and integration.
3245 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3248 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3249 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3250 similar to the default assignment of the document preparation system
3251 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3252 provides some operations for direct access to the font without asking
3253 the user for manual installation.
3257 New in Isabelle2009-1 (December 2009)
3258 -------------------------------------
3262 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3263 one backslash should be used, even in ML sources.
3268 * Locale interpretation propagates mixins along the locale hierarchy.
3269 The currently only available mixins are the equations used to map
3270 local definitions to terms of the target domain of an interpretation.
3272 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3273 loc" to print all interpretations of locale "loc" in the theory.
3274 Interpretations in proofs are not shown.
3276 * Thoroughly revised locales tutorial. New section on conditional
3279 * On instantiation of classes, remaining undefined class parameters
3280 are formally declared. INCOMPATIBILITY.
3283 *** Document preparation ***
3285 * New generalized style concept for printing terms: @{foo (style) ...}
3286 instead of @{foo_style style ...} (old form is still retained for
3287 backward compatibility). Styles can be also applied for
3288 antiquotations prop, term_type and typeof.
3293 * New proof method "smt" for a combination of first-order logic with
3294 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3295 fixed-size bitvectors; there is also basic support for higher-order
3296 features (esp. lambda abstractions). It is an incomplete decision
3297 procedure based on external SMT solvers using the oracle mechanism;
3298 for the SMT solver Z3, this method is proof-producing. Certificates
3299 are provided to avoid calling the external solvers solely for
3300 re-checking proofs. Due to a remote SMT service there is no need for
3301 installing SMT solvers locally. See src/HOL/SMT.
3303 * New commands to load and prove verification conditions generated by
3304 the Boogie program verifier or derived systems (e.g. the Verifying C
3305 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3307 * New counterexample generator tool 'nitpick' based on the Kodkod
3308 relational model finder. See src/HOL/Tools/Nitpick and
3309 src/HOL/Nitpick_Examples.
3311 * New commands 'code_pred' and 'values' to invoke the predicate
3312 compiler and to enumerate values of inductive predicates.
3314 * A tabled implementation of the reflexive transitive closure.
3316 * New implementation of quickcheck uses generic code generator;
3317 default generators are provided for all suitable HOL types, records
3318 and datatypes. Old quickcheck can be re-activated importing theory
3319 Library/SML_Quickcheck.
3321 * New testing tool Mirabelle for automated proof tools. Applies
3322 several tools and tactics like sledgehammer, metis, or quickcheck, to
3323 every proof step in a theory. To be used in batch mode via the
3324 "mirabelle" utility.
3326 * New proof method "sos" (sum of squares) for nonlinear real
3327 arithmetic (originally due to John Harison). It requires theory
3328 Library/Sum_Of_Squares. It is not a complete decision procedure but
3329 works well in practice on quantifier-free real arithmetic with +, -,
3330 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3331 inequalities between polynomials. It makes use of external
3332 semidefinite programming solvers. Method "sos" generates a
3333 certificate that can be pasted into the proof thus avoiding the need
3334 to call an external tool every time the proof is checked. See
3335 src/HOL/Library/Sum_Of_Squares.
3337 * New method "linarith" invokes existing linear arithmetic decision
3340 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3342 * New Sledgehammer option "Full Types" in Proof General settings menu.
3343 Causes full type information to be output to the ATPs. This slows
3344 ATPs down considerably but eliminates a source of unsound "proofs"
3347 * New method "metisFT": A version of metis that uses full type
3348 information in order to avoid failures of proof reconstruction.
3350 * New evaluator "approximate" approximates an real valued term using
3351 the same method as the approximation method.
3353 * Method "approximate" now supports arithmetic expressions as
3354 boundaries of intervals and implements interval splitting and Taylor
3357 * ML antiquotation @{code_datatype} inserts definition of a datatype
3358 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3360 * New theory SupInf of the supremum and infimum operators for sets of
3363 * New theory Probability, which contains a development of measure
3364 theory, eventually leading to Lebesgue integration and probability.
3366 * Extended Multivariate Analysis to include derivation and Brouwer's
3369 * Reorganization of number theory, INCOMPATIBILITY:
3370 - new number theory development for nat and int, in theories Divides
3371 and GCD as well as in new session Number_Theory
3372 - some constants and facts now suffixed with _nat and _int
3374 - former session NumberTheory now named Old_Number_Theory, including
3375 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3376 - moved theory Pocklington from src/HOL/Library to
3377 src/HOL/Old_Number_Theory
3379 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3380 lcm of finite and infinite sets. It is shown that they form a complete
3383 * Class semiring_div requires superclass no_zero_divisors and proof of
3384 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3385 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3386 generalized to class semiring_div, subsuming former theorems
3387 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3388 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3391 * Refinements to lattice classes and sets:
3392 - less default intro/elim rules in locale variant, more default
3393 intro/elim rules in class variant: more uniformity
3394 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3396 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3398 - renamed ACI to inf_sup_aci
3399 - new class "boolean_algebra"
3400 - class "complete_lattice" moved to separate theory
3401 "Complete_Lattice"; corresponding constants (and abbreviations)
3402 renamed and with authentic syntax:
3403 Set.Inf ~> Complete_Lattice.Inf
3404 Set.Sup ~> Complete_Lattice.Sup
3405 Set.INFI ~> Complete_Lattice.INFI
3406 Set.SUPR ~> Complete_Lattice.SUPR
3407 Set.Inter ~> Complete_Lattice.Inter
3408 Set.Union ~> Complete_Lattice.Union
3409 Set.INTER ~> Complete_Lattice.INTER
3410 Set.UNION ~> Complete_Lattice.UNION
3411 - authentic syntax for
3414 - mere abbreviations:
3417 Set.inter (for inf, formerly Set.Int)
3418 Set.union (for sup, formerly Set.Un)
3419 Complete_Lattice.Inter (for Inf)
3420 Complete_Lattice.Union (for Sup)
3421 Complete_Lattice.INTER (for INFI)
3422 Complete_Lattice.UNION (for SUPR)
3423 - object-logic definitions as far as appropriate
3425 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3426 Un_subset_iff are explicitly deleted as default simp rules; then also
3427 their lattice counterparts le_inf_iff and le_sup_iff have to be
3428 deleted to achieve the desired effect.
3430 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3431 rules by default any longer; the same applies to min_max.inf_absorb1
3432 etc. INCOMPATIBILITY.
3434 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3435 pred_set_conv by default. INCOMPATIBILITY.
3437 * Power operations on relations and functions are now one dedicated
3438 constant "compow" with infix syntax "^^". Power operation on
3439 multiplicative monoids retains syntax "^" and is now defined generic
3440 in class power. INCOMPATIBILITY.
3442 * Relation composition "R O S" now has a more standard argument order:
3443 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3444 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3445 break, since the O_assoc rule was not rewritten like this. Fix using
3446 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3448 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3449 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3452 * Most rules produced by inductive and datatype package have mandatory
3453 prefixes. INCOMPATIBILITY.
3455 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3456 the attribute of the same name. Each of the theorems in the list
3457 DERIV_intros assumes composition with an additional function and
3458 matches a variable to the derivative, which has to be solved by the
3459 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3460 of most elementary terms. Former Maclauren.DERIV_tac and
3461 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3464 * Code generator attributes follow the usual underscore convention:
3465 code_unfold replaces code unfold
3466 code_post replaces code post
3471 sizechange -> size_change
3472 induct_scheme -> induction_schema
3475 * Discontinued abbreviation "arbitrary" of constant "undefined".
3476 INCOMPATIBILITY, use "undefined" directly.
3479 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3480 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3481 Suc_plus1 -> Suc_eq_plus1
3482 *anti_sym -> *antisym*
3483 vector_less_eq_def -> vector_le_def
3486 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3489 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3495 * Theory Representable defines a class "rep" of domains that are
3496 representable (via an ep-pair) in the universal domain type "udom".
3497 Instances are provided for all type constructors defined in HOLCF.
3499 * The 'new_domain' command is a purely definitional version of the
3500 domain package, for representable domains. Syntax is identical to the
3501 old domain package. The 'new_domain' package also supports indirect
3502 recursion using previously-defined type constructors. See
3503 src/HOLCF/ex/New_Domain.thy for examples.
3505 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3506 on the left-hand side of an equation, and then performs
3507 simplification. Rewriting is done using rules declared with the
3508 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3509 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3511 * The pattern-match compiler in 'fixrec' can now handle constructors
3512 with HOL function types. Pattern-match combinators for the Pair
3513 constructor are pre-configured.
3515 * The 'fixrec' package now produces better fixed-point induction rules
3516 for mutually-recursive definitions: Induction rules have conclusions
3517 of the form "P foo bar" instead of "P <foo, bar>".
3519 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3520 been renamed to "below". The name "below" now replaces "less" in many
3521 theorem names. (Legacy theorem names using "less" are still supported
3524 * The 'fixrec' package now supports "bottom patterns". Bottom
3525 patterns can be used to generate strictness rules, or to make
3526 functions more strict (much like the bang-patterns supported by the
3527 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3533 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3534 errors and run-time exceptions, including detailed source positions.
3536 * Structure Name_Space (formerly NameSpace) now manages uniquely
3537 identified entries, with some additional information such as source
3538 position, logical grouping etc.
3540 * Theory and context data is now introduced by the simplified and
3541 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3542 to be pure, but the old TheoryDataFun for mutable data (with explicit
3543 copy operation) is still available for some time.
3545 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3546 provides a high-level programming interface to synchronized state
3547 variables with atomic update. This works via pure function
3548 application within a critical section -- its runtime should be as
3549 short as possible; beware of deadlocks if critical code is nested,
3550 either directly or indirectly via other synchronized variables!
3552 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3553 wraps raw ML references, explicitly indicating their non-thread-safe
3554 behaviour. The Isar toplevel keeps this structure open, to
3555 accommodate Proof General as well as quick and dirty interactive
3556 experiments with references.
3558 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3559 parallel tactical reasoning.
3561 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3562 are similar to SUBPROOF, but are slightly more flexible: only the
3563 specified parts of the subgoal are imported into the context, and the
3564 body tactic may introduce new subgoals and schematic variables.
3566 * Old tactical METAHYPS, which does not observe the proof context, has
3567 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3568 or Subgoal.FOCUS etc.
3570 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3571 functors have their own ML name space there is no point to mark them
3572 separately.) Minor INCOMPATIBILITY.
3574 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3576 * Renamed several structures FooBar to Foo_Bar. Occasional,
3579 * Operations of structure Skip_Proof no longer require quick_and_dirty
3580 mode, which avoids critical setmp.
3582 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3583 combinators for "args". INCOMPATIBILITY, need to use simplified
3584 Attrib/Method.setup introduced in Isabelle2009.
3586 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3587 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3588 last resort. INCOMPATIBILITY.
3590 * Display.pretty_thm now requires a proper context (cf. former
3591 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3592 or even Display.pretty_thm_without_context as last resort.
3595 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3596 Syntax.pretty_typ/term directly, preferably with proper context
3597 instead of global theory.
3602 * Further fine tuning of parallel proof checking, scales up to 8 cores
3603 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3606 * Support for additional "Isabelle components" via etc/components, see
3607 also the system manual.
3609 * The isabelle makeall tool now operates on all components with
3610 IsaMakefile, not just hardwired "logics".
3612 * Removed "compress" option from isabelle-process and isabelle usedir;
3613 this is always enabled.
3615 * Discontinued support for Poly/ML 4.x versions.
3617 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3618 on a given logic image. This requires the lighttpd webserver and is
3619 currently supported on Linux only.
3623 New in Isabelle2009 (April 2009)
3624 --------------------------------
3628 * Simplified main Isabelle executables, with less surprises on
3629 case-insensitive file-systems (such as Mac OS).
3631 - The main Isabelle tool wrapper is now called "isabelle" instead of
3634 - The former "isabelle" alias for "isabelle-process" has been
3635 removed (should rarely occur to regular users).
3637 - The former "isabelle-interface" and its alias "Isabelle" have been
3638 removed (interfaces are now regular Isabelle tools).
3640 Within scripts and make files, the Isabelle environment variables
3641 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3642 respectively. (The latter are still available as legacy feature.)
3644 The old isabelle-interface wrapper could react in confusing ways if
3645 the interface was uninstalled or changed otherwise. Individual
3646 interface tool configuration is now more explicit, see also the
3647 Isabelle system manual. In particular, Proof General is now available
3648 via "isabelle emacs".
3650 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3651 purge installed copies of Isabelle executables and re-run "isabelle
3652 install -p ...", or use symlinks.
3654 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3655 old ~/isabelle, which was slightly non-standard and apt to cause
3656 surprises on case-insensitive file-systems (such as Mac OS).
3658 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3659 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3660 care is required when using older releases of Isabelle. Note that
3661 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3662 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3664 * Proofs of fully specified statements are run in parallel on
3665 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3666 a regular 4-core machine, if the initial heap space is made reasonably
3667 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3669 * The main reference manuals ("isar-ref", "implementation", and
3670 "system") have been updated and extended. Formally checked references
3671 as hyperlinks are now available uniformly.
3676 * Complete re-implementation of locales. INCOMPATIBILITY in several
3677 respects. The most important changes are listed below. See the
3678 Tutorial on Locales ("locales" manual) for details.
3680 - In locale expressions, instantiation replaces renaming. Parameters
3681 must be declared in a for clause. To aid compatibility with previous
3682 parameter inheritance, in locale declarations, parameters that are not
3683 'touched' (instantiation position "_" or omitted) are implicitly added
3684 with their syntax at the beginning of the for clause.
3686 - Syntax from abbreviations and definitions in locales is available in
3687 locale expressions and context elements. The latter is particularly
3688 useful in locale declarations.
3690 - More flexible mechanisms to qualify names generated by locale
3691 expressions. Qualifiers (prefixes) may be specified in locale
3692 expressions, and can be marked as mandatory (syntax: "name!:") or
3693 optional (syntax "name?:"). The default depends for plain "name:"
3694 depends on the situation where a locale expression is used: in
3695 commands 'locale' and 'sublocale' prefixes are optional, in
3696 'interpretation' and 'interpret' prefixes are mandatory. The old
3697 implicit qualifiers derived from the parameter names of a locale are
3698 no longer generated.
3700 - Command "sublocale l < e" replaces "interpretation l < e". The
3701 instantiation clause in "interpretation" and "interpret" (square
3702 brackets) is no longer available. Use locale expressions.
3704 - When converting proof scripts, mandatory qualifiers in
3705 'interpretation' and 'interpret' should be retained by default, even
3706 if this is an INCOMPATIBILITY compared to former behavior. In the
3707 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
3708 in locale expressions range over a single locale instance only.
3710 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
3711 In existing theorem specifications replace the includes element by the
3712 respective context elements of the included locale, omitting those
3713 that are already present in the theorem specification. Multiple
3714 assume elements of a locale should be replaced by a single one
3715 involving the locale predicate. In the proof body, declarations (most
3716 notably theorems) may be regained by interpreting the respective
3717 locales in the proof context as required (command "interpret").
3719 If using "includes" in replacement of a target solely because the
3720 parameter types in the theorem are not as general as in the target,
3721 consider declaring a new locale with additional type constraints on
3722 the parameters (context element "constrains").
3724 - Discontinued "locale (open)". INCOMPATIBILITY.
3726 - Locale interpretation commands no longer attempt to simplify goal.
3727 INCOMPATIBILITY: in rare situations the generated goal differs. Use
3728 methods intro_locales and unfold_locales to clarify.
3730 - Locale interpretation commands no longer accept interpretation
3731 attributes. INCOMPATIBILITY.
3733 * Class declaration: so-called "base sort" must not be given in import
3734 list any longer, but is inferred from the specification. Particularly
3741 class foo = type + ...
3743 * Class target: global versions of theorems stemming do not carry a
3744 parameter prefix any longer. INCOMPATIBILITY.
3746 * Class 'instance' command no longer accepts attached definitions.
3747 INCOMPATIBILITY, use proper 'instantiation' target instead.
3749 * Recovered hiding of consts, which was accidentally broken in
3750 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
3751 makes c inaccessible; consider using ``hide (open) const c'' instead.
3753 * Slightly more coherent Pure syntax, with updated documentation in
3754 isar-ref manual. Removed locales meta_term_syntax and
3755 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
3756 INCOMPATIBILITY in rare situations. Note that &&& should not be used
3757 directly in regular applications.
3759 * There is a new syntactic category "float_const" for signed decimal
3760 fractions (e.g. 123.45 or -123.45).
3762 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
3763 interface with 'setup' command instead.
3765 * Command 'local_setup' is similar to 'setup', but operates on a local
3768 * The 'axiomatization' command now only works within a global theory
3769 context. INCOMPATIBILITY.
3771 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
3772 hypotheses. Sorts required in the course of reasoning need to be
3773 covered by the constraints in the initial statement, completed by the
3774 type instance information of the background theory. Non-trivial sort
3775 hypotheses, which rarely occur in practice, may be specified via
3776 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
3778 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
3780 The result contains an implicit sort hypotheses as before --
3781 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
3784 * Generalized Isar history, with support for linear undo, direct state
3787 * Changed defaults for unify configuration options:
3789 unify_trace_bound = 50 (formerly 25)
3790 unify_search_bound = 60 (formerly 30)
3792 * Different bookkeeping for code equations (INCOMPATIBILITY):
3794 a) On theory merge, the last set of code equations for a particular
3795 constant is taken (in accordance with the policy applied by other
3796 parts of the code generator framework).
3798 b) Code equations stemming from explicit declarations (e.g. code
3799 attribute) gain priority over default code equations stemming
3800 from definition, primrec, fun etc.
3802 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
3804 * Unified theorem tables for both code generators. Thus [code
3805 func] has disappeared and only [code] remains. INCOMPATIBILITY.
3807 * Command 'find_consts' searches for constants based on type and name
3810 find_consts "_ => bool"
3812 By default, matching is against subtypes, but it may be restricted to
3813 the whole type. Searching by name is possible. Multiple queries are
3814 conjunctive and queries may be negated by prefixing them with a
3817 find_consts strict: "_ => bool" name: "Int" -"int => int"
3819 * New 'find_theorems' criterion "solves" matches theorems that
3820 directly solve the current goal (modulo higher-order unification).
3822 * Auto solve feature for main theorem statements: whenever a new goal
3823 is stated, "find_theorems solves" is called; any theorems that could
3824 solve the lemma directly are listed as part of the goal state.
3825 Cf. associated options in Proof General Isabelle settings menu,
3826 enabled by default, with reasonable timeout for pathological cases of
3827 higher-order unification.
3830 *** Document preparation ***
3832 * Antiquotation @{lemma} now imitates a regular terminal proof,
3833 demanding keyword 'by' and supporting the full method expression
3834 syntax just like the Isar command 'by'.
3839 * Integrated main parts of former image HOL-Complex with HOL. Entry
3840 points Main and Complex_Main remain as before.
3842 * Logic image HOL-Plain provides a minimal HOL with the most important
3843 tools available (inductive, datatype, primrec, ...). This facilitates
3844 experimentation and tool development. Note that user applications
3845 (and library theories) should never refer to anything below theory
3848 * Logic image HOL-Main stops at theory Main, and thus facilitates
3849 experimentation due to shorter build times.
3851 * Logic image HOL-NSA contains theories of nonstandard analysis which
3852 were previously part of former HOL-Complex. Entry point Hyperreal
3853 remains valid, but theories formerly using Complex_Main should now use
3854 new entry point Hypercomplex.
3856 * Generic ATP manager for Sledgehammer, based on ML threads instead of
3857 Posix processes. Avoids potentially expensive forking of the ML
3858 process. New thread-based implementation also works on non-Unix
3859 platforms (Cygwin). Provers are no longer hardwired, but defined
3860 within the theory via plain ML wrapper functions. Basic Sledgehammer
3861 commands are covered in the isar-ref manual.
3863 * Wrapper scripts for remote SystemOnTPTP service allows to use
3864 sledgehammer without local ATP installation (Vampire etc.). Other
3865 provers may be included via suitable ML wrappers, see also
3866 src/HOL/ATP_Linkup.thy.
3868 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
3871 * The metis method no longer fails because the theorem is too trivial
3872 (contains the empty clause).
3874 * The metis method now fails in the usual manner, rather than raising
3875 an exception, if it determines that it cannot prove the theorem.
3877 * Method "coherent" implements a prover for coherent logic (see also
3878 src/Tools/coherent.ML).
3880 * Constants "undefined" and "default" replace "arbitrary". Usually
3881 "undefined" is the right choice to replace "arbitrary", though
3882 logically there is no difference. INCOMPATIBILITY.
3884 * Command "value" now integrates different evaluation mechanisms. The
3885 result of the first successful evaluation mechanism is printed. In
3886 square brackets a particular named evaluation mechanisms may be
3887 specified (currently, [SML], [code] or [nbe]). See further
3888 src/HOL/ex/Eval_Examples.thy.
3890 * Normalization by evaluation now allows non-leftlinear equations.
3891 Declare with attribute [code nbe].
3893 * Methods "case_tac" and "induct_tac" now refer to the very same rules
3894 as the structured Isar versions "cases" and "induct", cf. the
3895 corresponding "cases" and "induct" attributes. Mutual induction rules
3896 are now presented as a list of individual projections
3897 (e.g. foo_bar.inducts for types foo and bar); the old format with
3898 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
3899 rare situations a different rule is selected --- notably nested tuple
3900 elimination instead of former prod.exhaust: use explicit (case_tac t
3901 rule: prod.exhaust) here.
3903 * Attributes "cases", "induct", "coinduct" support "del" option.
3905 * Removed fact "case_split_thm", which duplicates "case_split".
3907 * The option datatype has been moved to a new theory Option. Renamed
3908 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
3910 * New predicate "strict_mono" classifies strict functions on partial
3911 orders. With strict functions on linear orders, reasoning about
3912 (in)equalities is facilitated by theorems "strict_mono_eq",
3913 "strict_mono_less_eq" and "strict_mono_less".
3915 * Some set operations are now proper qualified constants with
3916 authentic syntax. INCOMPATIBILITY:
3927 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
3930 * Auxiliary class "itself" has disappeared -- classes without any
3931 parameter are treated as expected by the 'class' command.
3933 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
3935 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
3936 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
3938 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
3939 method "approximation". It proves formulas on real values by using
3940 interval arithmetic. In the formulas are also the transcendental
3941 functions sin, cos, tan, atan, ln, exp and the constant pi are
3942 allowed. For examples see
3943 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
3945 * Theory "Reflection" now resides in HOL/Library.
3947 * Entry point to Word library now simply named "Word".
3950 * Made source layout more coherent with logical distribution
3953 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
3954 src/HOL/Library/Code_Message.thy ~> src/HOL/
3955 src/HOL/Library/GCD.thy ~> src/HOL/
3956 src/HOL/Library/Order_Relation.thy ~> src/HOL/
3957 src/HOL/Library/Parity.thy ~> src/HOL/
3958 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
3959 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
3960 src/HOL/Real/Lubs.thy ~> src/HOL/
3961 src/HOL/Real/PReal.thy ~> src/HOL/
3962 src/HOL/Real/Rational.thy ~> src/HOL/
3963 src/HOL/Real/RComplete.thy ~> src/HOL/
3964 src/HOL/Real/RealDef.thy ~> src/HOL/
3965 src/HOL/Real/RealPow.thy ~> src/HOL/
3966 src/HOL/Real/Real.thy ~> src/HOL/
3967 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
3968 src/HOL/Complex/Complex.thy ~> src/HOL/
3969 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
3970 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
3971 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
3972 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
3973 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
3974 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
3975 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
3976 src/HOL/Hyperreal/Log.thy ~> src/HOL/
3977 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
3978 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
3979 src/HOL/Hyperreal/Series.thy ~> src/HOL/
3980 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
3981 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
3982 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
3983 src/HOL/Real/Float ~> src/HOL/Library/
3984 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
3985 src/HOL/Real/RealVector.thy ~> src/HOL/
3987 src/HOL/arith_data.ML ~> src/HOL/Tools
3988 src/HOL/hologic.ML ~> src/HOL/Tools
3989 src/HOL/simpdata.ML ~> src/HOL/Tools
3990 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
3991 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
3992 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
3993 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
3994 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
3995 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
3996 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
3998 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
3999 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4000 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4001 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4002 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4003 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4005 * If methods "eval" and "evaluation" encounter a structured proof
4006 state with !!/==>, only the conclusion is evaluated to True (if
4007 possible), avoiding strange error messages.
4009 * Method "sizechange" automates termination proofs using (a
4010 modification of) the size-change principle. Requires SAT solver. See
4011 src/HOL/ex/Termination.thy for examples.
4013 * Simplifier: simproc for let expressions now unfolds if bound
4014 variable occurs at most once in let expression body. INCOMPATIBILITY.
4016 * Method "arith": Linear arithmetic now ignores all inequalities when
4017 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4019 * New attribute "arith" for facts that should always be used
4020 automatically by arithmetic. It is intended to be used locally in
4023 assumes [arith]: "x > 0"
4025 Global usage is discouraged because of possible performance impact.
4027 * New classes "top" and "bot" with corresponding operations "top" and
4028 "bot" in theory Orderings; instantiation of class "complete_lattice"
4029 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4031 * Changed definition lemma "less_fun_def" in order to provide an
4032 instance for preorders on functions; use lemma "less_le" instead.
4035 * Theory Orderings: class "wellorder" moved here, with explicit
4036 induction rule "less_induct" as assumption. For instantiation of
4037 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4040 * Theory Orderings: added class "preorder" as superclass of "order".
4041 INCOMPATIBILITY: Instantiation proofs for order, linorder
4042 etc. slightly changed. Some theorems named order_class.* now named
4045 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4048 * Theory Finite_Set: added a new fold combinator of type
4050 ('a => 'b => 'b) => 'b => 'a set => 'b
4052 Occasionally this is more convenient than the old fold combinator
4053 which is now defined in terms of the new one and renamed to
4056 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4057 and "ring_simps" have been replaced by "algebra_simps" (which can be
4058 extended with further lemmas!). At the moment both still exist but
4059 the former will disappear at some point.
4061 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4062 class recpower. Type-specific simp rules for various recpower types
4063 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4065 rat_power_0 -> power_0
4066 rat_power_Suc -> power_Suc
4067 realpow_0 -> power_0
4068 realpow_Suc -> power_Suc
4069 complexpow_0 -> power_0
4070 complexpow_Suc -> power_Suc
4071 power_poly_0 -> power_0
4072 power_poly_Suc -> power_Suc
4074 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4075 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4076 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4077 of lemmas from Divides has been generalized from nat to class
4078 semiring_div. INCOMPATIBILITY. This involves the following theorem
4079 renames resulting from duplicate elimination:
4081 dvd_def_mod ~> dvd_eq_mod_eq_0
4082 zero_dvd_iff ~> dvd_0_left_iff
4083 dvd_0 ~> dvd_0_right
4084 DIVISION_BY_ZERO_DIV ~> div_by_0
4085 DIVISION_BY_ZERO_MOD ~> mod_by_0
4086 mult_div ~> div_mult_self2_is_id
4087 mult_mod ~> mod_mult_self2_is_0
4089 * Theory IntDiv: removed many lemmas that are instances of class-based
4090 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4091 rename old lemmas as follows:
4093 dvd_diff -> nat_dvd_diff
4094 dvd_zminus_iff -> dvd_minus_iff
4095 mod_add1_eq -> mod_add_eq
4096 mod_mult1_eq -> mod_mult_right_eq
4097 mod_mult1_eq' -> mod_mult_left_eq
4098 mod_mult_distrib_mod -> mod_mult_eq
4099 nat_mod_add_left_eq -> mod_add_left_eq
4100 nat_mod_add_right_eq -> mod_add_right_eq
4101 nat_mod_div_trivial -> mod_div_trivial
4102 nat_mod_mod_trivial -> mod_mod_trivial
4103 zdiv_zadd_self1 -> div_add_self1
4104 zdiv_zadd_self2 -> div_add_self2
4105 zdiv_zmult_self1 -> div_mult_self2_is_id
4106 zdiv_zmult_self2 -> div_mult_self1_is_id
4107 zdvd_triv_left -> dvd_triv_left
4108 zdvd_triv_right -> dvd_triv_right
4109 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4110 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4111 zmod_zadd_left_eq -> mod_add_left_eq
4112 zmod_zadd_right_eq -> mod_add_right_eq
4113 zmod_zadd_self1 -> mod_add_self1
4114 zmod_zadd_self2 -> mod_add_self2
4115 zmod_zadd1_eq -> mod_add_eq
4116 zmod_zdiff1_eq -> mod_diff_eq
4117 zmod_zdvd_zmod -> mod_mod_cancel
4118 zmod_zmod_cancel -> mod_mod_cancel
4119 zmod_zmult_self1 -> mod_mult_self2_is_0
4120 zmod_zmult_self2 -> mod_mult_self1_is_0
4123 zdvd_abs1 -> abs_dvd_iff
4124 zdvd_abs2 -> dvd_abs_iff
4125 zdvd_refl -> dvd_refl
4126 zdvd_trans -> dvd_trans
4127 zdvd_zadd -> dvd_add
4128 zdvd_zdiff -> dvd_diff
4129 zdvd_zminus_iff -> dvd_minus_iff
4130 zdvd_zminus2_iff -> minus_dvd_iff
4131 zdvd_zmultD -> dvd_mult_right
4132 zdvd_zmultD2 -> dvd_mult_left
4133 zdvd_zmult_mono -> mult_dvd_mono
4134 zdvd_0_right -> dvd_0_right
4135 zdvd_0_left -> dvd_0_left_iff
4136 zdvd_1_left -> one_dvd
4137 zminus_dvd_iff -> minus_dvd_iff
4139 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4141 * The real numbers offer decimal input syntax: 12.34 is translated
4142 into 1234/10^2. This translation is not reversed upon output.
4144 * Theory Library/Polynomial defines an abstract type 'a poly of
4145 univariate polynomials with coefficients of type 'a. In addition to
4146 the standard ring operations, it also supports div and mod. Code
4147 generation is also supported, using list-style constructors.
4149 * Theory Library/Inner_Product defines a class of real_inner for real
4150 inner product spaces, with an overloaded operation inner :: 'a => 'a
4151 => real. Class real_inner is a subclass of real_normed_vector from
4154 * Theory Library/Product_Vector provides instances for the product
4155 type 'a * 'b of several classes from RealVector and Inner_Product.
4156 Definitions of addition, subtraction, scalar multiplication, norms,
4157 and inner products are included.
4159 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4160 addition to the field operations, numerals and case syntax are also
4163 * Theory Library/Diagonalize provides constructive version of Cantor's
4164 first diagonalization argument.
4166 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4167 zlcm (for int); carried together from various gcd/lcm developements in
4168 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4169 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4170 may recover tupled syntax as follows:
4172 hide (open) const gcd
4173 abbreviation gcd where
4174 "gcd == (%(a, b). GCD.gcd a b)"
4176 GCD.gcd ("gcd '(_, _')")
4178 The same works for lcm, zgcd, zlcm.
4180 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4181 instantiations for algebraic structures. Removed some duplicate
4182 theorems. Changes in simp rules. INCOMPATIBILITY.
4184 * ML antiquotation @{code} takes a constant as argument and generates
4185 corresponding code in background and inserts name of the corresponding
4186 resulting ML value/function/datatype constructor binding in place.
4187 All occurrences of @{code} with a single ML block are generated
4188 simultaneously. Provides a generic and safe interface for
4189 instrumentalizing code generation. See
4190 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4191 In future you ought to refrain from ad-hoc compiling generated SML
4192 code on the ML toplevel. Note that (for technical reasons) @{code}
4193 cannot refer to constants for which user-defined serializations are
4194 set. Refer to the corresponding ML counterpart directly in that
4197 * Command 'rep_datatype': instead of theorem names the command now
4198 takes a list of terms denoting the constructors of the type to be
4199 represented as datatype. The characteristic theorems have to be
4200 proven. INCOMPATIBILITY. Also observe that the following theorems
4201 have disappeared in favour of existing ones:
4203 unit_induct ~> unit.induct
4204 prod_induct ~> prod.induct
4205 sum_induct ~> sum.induct
4206 Suc_Suc_eq ~> nat.inject
4207 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4212 * New locales for orders and lattices where the equivalence relation
4213 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4214 locales use a record structure with field eq for the equivalence.
4216 * New theory of factorial domains.
4218 * Units_l_inv and Units_r_inv are now simp rules by default.
4219 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4220 and/or r_inv will now also require deletion of these lemmas.
4222 * Renamed the following theorems, INCOMPATIBILITY:
4224 UpperD ~> Upper_memD
4225 LowerD ~> Lower_memD
4226 least_carrier ~> least_closed
4227 greatest_carrier ~> greatest_closed
4228 greatest_Lower_above ~> greatest_Lower_below
4229 one_zero ~> carrier_one_zero
4230 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4235 * Nominal datatypes can now contain type-variables.
4237 * Commands 'nominal_inductive' and 'equivariance' work with local
4240 * Nominal primrec can now works with local theory targets and its
4241 specification syntax now conforms to the general format as seen in
4244 * Method "perm_simp" honours the standard simplifier attributes
4245 (no_asm), (no_asm_use) etc.
4247 * The new predicate #* is defined like freshness, except that on the
4248 left hand side can be a set or list of atoms.
4250 * Experimental command 'nominal_inductive2' derives strong induction
4251 principles for inductive definitions. In contrast to
4252 'nominal_inductive', which can only deal with a fixed number of
4253 binders, it can deal with arbitrary expressions standing for sets of
4254 atoms to be avoided. The only inductive definition we have at the
4255 moment that needs this generalisation is the typing rule for Lets in
4258 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4259 -----------------------------------------------------------------
4260 Gamma |- Let x be t1 in t2 : T2
4262 In this rule one wants to avoid all the binders that are introduced by
4263 "close Gamma T1". We are looking for other examples where this
4264 feature might be useful. Please let us know.
4269 * Reimplemented the simplification procedure for proving continuity
4270 subgoals. The new simproc is extensible; users can declare additional
4271 continuity introduction rules with the attribute [cont2cont].
4273 * The continuity simproc now uses a different introduction rule for
4274 solving continuity subgoals on terms with lambda abstractions. In
4275 some rare cases the new simproc may fail to solve subgoals that the
4276 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4277 Potential INCOMPATIBILITY.
4279 * Command 'fixrec': specification syntax now conforms to the general
4280 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4281 examples. INCOMPATIBILITY.
4286 * Proof of Zorn's Lemma for partial orders.
4291 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4292 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4293 depends on multithreading, so timouts will not work before Poly/ML
4296 * High-level support for concurrent ML programming, see
4297 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4298 particularly convenient to organize independent functional
4299 computations. The concept of "synchronized variables" provides a
4300 higher-order interface for components with shared state, avoiding the
4301 delicate details of mutexes and condition variables. (Requires
4302 Poly/ML 5.2.1 or later.)
4304 * ML bindings produced via Isar commands are stored within the Isar
4305 context (theory or proof). Consequently, commands like 'use' and 'ML'
4306 become thread-safe and work with undo as expected (concerning
4307 top-level bindings, not side-effects on global references).
4308 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4309 compiler at runtime; really global bindings need to be given outside a
4310 theory. (Requires Poly/ML 5.2 or later.)
4312 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4313 context. Top-level ML bindings are stored within the proof context in
4314 a purely sequential fashion, disregarding the nested proof structure.
4315 ML bindings introduced by 'ML_prf' are discarded at the end of the
4316 proof. (Requires Poly/ML 5.2 or later.)
4318 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4319 and Method.setup, as well as Isar commands 'attribute_setup' and
4320 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4321 existing code accordingly, or use plain 'setup' together with old
4324 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4325 to 'a -> thm, while results are always tagged with an authentic oracle
4326 name. The Isar command 'oracle' is now polymorphic, no argument type
4327 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4328 accordingly. Note that extra performance may be gained by producing
4329 the cterm carefully, avoiding slow Thm.cterm_of.
4331 * Simplified interface for defining document antiquotations via
4332 ThyOutput.antiquotation, ThyOutput.output, and optionally
4333 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4334 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4337 * More systematic treatment of long names, abstract name bindings, and
4338 name space operations. Basic operations on qualified names have been
4339 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4340 Long_Name.append. Old type bstring has been mostly replaced by
4341 abstract type binding (see structure Binding), which supports precise
4342 qualification by packages and local theory targets, as well as proper
4343 tracking of source positions. INCOMPATIBILITY, need to wrap old
4344 bstring values into Binding.name, or better pass through abstract
4345 bindings everywhere. See further src/Pure/General/long_name.ML,
4346 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4348 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4349 LocalTheory.note etc.) now refer to the *full* internal name, not the
4350 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4352 * Disposed old type and term read functions (Sign.read_def_typ,
4353 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4354 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4355 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4356 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4357 resort for legacy applications.
4359 * Disposed old declarations, tactics, tactic combinators that refer to
4360 the simpset or claset of an implicit theory (such as Addsimps,
4361 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4362 embedded ML text, or local_simpset_of with a proper context passed as
4363 explicit runtime argument.
4365 * Rules and tactics that read instantiations (read_instantiate,
4366 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4367 context, which is required for parsing and type-checking. Moreover,
4368 the variables are specified as plain indexnames, not string encodings
4369 thereof. INCOMPATIBILITY.
4371 * Generic Toplevel.add_hook interface allows to analyze the result of
4372 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4373 for theorem dependency output of transactions resulting in a new
4376 * ML antiquotations: block-structured compilation context indicated by
4377 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4379 @{binding name} - basic name binding
4380 @{let ?pat = term} - term abbreviation (HO matching)
4381 @{note name = fact} - fact abbreviation
4382 @{thm fact} - singleton fact (with attributes)
4383 @{thms fact} - general fact (with attributes)
4384 @{lemma prop by method} - singleton goal
4385 @{lemma prop by meth1 meth2} - singleton goal
4386 @{lemma prop1 ... propN by method} - general goal
4387 @{lemma prop1 ... propN by meth1 meth2} - general goal
4388 @{lemma (open) ...} - open derivation
4393 * The Isabelle "emacs" tool provides a specific interface to invoke
4394 Proof General / Emacs, with more explicit failure if that is not
4395 installed (the old isabelle-interface script silently falls back on
4396 isabelle-process). The PROOFGENERAL_HOME setting determines the
4397 installation location of the Proof General distribution.
4399 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4400 the Isabelle process into a JVM/Scala application. See
4401 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4402 process wrapper has been discontinued.)
4404 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4406 * Various status messages (with exact source position information) are
4407 emitted, if proper markup print mode is enabled. This allows
4408 user-interface components to provide detailed feedback on internal
4413 New in Isabelle2008 (June 2008)
4414 -------------------------------
4418 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4419 and updated, with formally checked references as hyperlinks.
4421 * Theory loader: use_thy (and similar operations) no longer set the
4422 implicit ML context, which was occasionally hard to predict and in
4423 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4424 provides a proper context already.
4426 * Theory loader: old-style ML proof scripts being *attached* to a thy
4427 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4428 'use' within a theory file will do the job.
4430 * Name space merge now observes canonical order, i.e. the second space
4431 is inserted into the first one, while existing entries in the first
4432 space take precedence. INCOMPATIBILITY in rare situations, may try to
4433 swap theory imports.
4435 * Syntax: symbol \<chi> is now considered a letter. Potential
4436 INCOMPATIBILITY in identifier syntax etc.
4438 * Outer syntax: string tokens no longer admit escaped white space,
4439 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4440 white space without escapes.
4442 * Outer syntax: string tokens may contain arbitrary character codes
4443 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4449 * Context-dependent token translations. Default setup reverts locally
4450 fixed variables, and adds hilite markup for undeclared frees.
4452 * Unused theorems can be found using the new command 'unused_thms'.
4453 There are three ways of invoking it:
4456 Only finds unused theorems in the current theory.
4458 (2) unused_thms thy_1 ... thy_n -
4459 Finds unused theorems in the current theory and all of its ancestors,
4460 excluding the theories thy_1 ... thy_n and all of their ancestors.
4462 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4463 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4464 their ancestors, excluding the theories thy_1 ... thy_n and all of
4467 In order to increase the readability of the list produced by
4468 unused_thms, theorems that have been created by a particular instance
4469 of a theory command such as 'inductive' or 'function' are considered
4470 to belong to the same "group", meaning that if at least one theorem in
4471 this group is used, the other theorems in the same group are no longer
4472 reported as unused. Moreover, if all theorems in the group are
4473 unused, only one theorem in the group is displayed.
4475 Note that proof objects have to be switched on in order for
4476 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4477 usually the case when using Proof General with the default settings).
4479 * Authentic naming of facts disallows ad-hoc overwriting of previous
4480 theorems within the same name space. INCOMPATIBILITY, need to remove
4481 duplicate fact bindings, or even accidental fact duplications. Note
4482 that tools may maintain dynamically scoped facts systematically, using
4483 PureThy.add_thms_dynamic.
4485 * Command 'hide' now allows to hide from "fact" name space as well.
4487 * Eliminated destructive theorem database, simpset, claset, and
4488 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4489 update of theories within ML code.
4491 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4492 INCOMPATIBILITY, object-logics depending on former Pure require
4493 additional setup PureThy.old_appl_syntax_setup; object-logics
4494 depending on former CPure need to refer to Pure.
4496 * Commands 'use' and 'ML' are now purely functional, operating on
4497 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4498 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4501 * Command 'setup': discontinued implicit version with ML reference.
4503 * Instantiation target allows for simultaneous specification of class
4504 instance operations together with an instantiation proof.
4505 Type-checking phase allows to refer to class operations uniformly.
4506 See src/HOL/Complex/Complex.thy for an Isar example and
4507 src/HOL/Library/Eval.thy for an ML example.
4509 * Indexing of literal facts: be more serious about including only
4510 facts from the visible specification/proof context, but not the
4511 background context (locale etc.). Affects `prop` notation and method
4512 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4515 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4516 "(open)" option, which used to expose internal bound variables to the
4519 * Isar statements: removed obsolete case "rule_context".
4520 INCOMPATIBILITY, better use explicit fixes/assumes.
4522 * Locale proofs: default proof step now includes 'unfold_locales';
4523 hence 'proof' without argument may be used to unfold locale
4527 *** Document preparation ***
4529 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4530 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4531 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4532 spot); renamed link color from "darkblue" to "linkcolor" (default
4533 value unchanged, can be redefined via \definecolor); no longer sets
4534 "a4paper" option (unnecessary or even intrusive).
4536 * Antiquotation @{lemma A method} proves proposition A by the given
4537 method (either a method name or a method name plus (optional) method
4538 arguments in parentheses) and prints A just like @{prop A}.
4543 * New primrec package. Specification syntax conforms in style to
4544 definition/function/.... No separate induction rule is provided. The
4545 "primrec" command distinguishes old-style and new-style specifications
4546 by syntax. The former primrec package is now named OldPrimrecPackage.
4547 When adjusting theories, beware: constants stemming from new-style
4548 primrec specifications have authentic syntax.
4550 * Metis prover is now an order of magnitude faster, and also works
4551 with multithreading.
4553 * Metis: the maximum number of clauses that can be produced from a
4554 theorem is now given by the attribute max_clauses. Theorems that
4555 exceed this number are ignored, with a warning printed.
4557 * Sledgehammer no longer produces structured proofs by default. To
4558 enable, declare [[sledgehammer_full = true]]. Attributes
4559 reconstruction_modulus, reconstruction_sorts renamed
4560 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4562 * Method "induct_scheme" derives user-specified induction rules
4563 from well-founded induction and completeness of patterns. This factors
4564 out some operations that are done internally by the function package
4565 and makes them available separately. See
4566 src/HOL/ex/Induction_Scheme.thy for examples.
4568 * More flexible generation of measure functions for termination
4569 proofs: Measure functions can be declared by proving a rule of the
4570 form "is_measure f" and giving it the [measure_function] attribute.
4571 The "is_measure" predicate is logically meaningless (always true), and
4572 just guides the heuristic. To find suitable measure functions, the
4573 termination prover sets up the goal "is_measure ?f" of the appropriate
4574 type and generates all solutions by prolog-style backwards proof using
4577 This setup also deals with rules like
4579 "is_measure f ==> is_measure (list_size f)"
4581 which accommodates nested datatypes that recurse through lists.
4582 Similar rules are predeclared for products and option types.
4584 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4588 - Definitions of overloaded constants on sets have to be replaced by
4589 definitions on => and bool.
4591 - Some definitions of overloaded operators on sets can now be proved
4592 using the definitions of the operators on => and bool. Therefore,
4593 the following theorems have been renamed:
4595 subset_def -> subset_eq
4596 psubset_def -> psubset_eq
4597 set_diff_def -> set_diff_eq
4598 Compl_def -> Compl_eq
4599 Sup_set_def -> Sup_set_eq
4600 Inf_set_def -> Inf_set_eq
4601 sup_set_def -> sup_set_eq
4602 inf_set_def -> inf_set_eq
4604 - Due to the incompleteness of the HO unification algorithm, some
4605 rules such as subst may require manual instantiation, if some of
4606 the unknowns in the rule is a set.
4608 - Higher order unification and forward proofs:
4611 have "P (S::'a set)" <...>
4612 then have "EX S. P S" ..
4614 no longer works (due to the incompleteness of the HO unification
4615 algorithm) and must be replaced by the pattern
4622 - Calculational reasoning with subst (or similar rules):
4625 have "P (S::'a set)" <...>
4626 also have "S = T" <...>
4627 finally have "P T" .
4629 no longer works (for similar reasons as the previous example) and
4630 must be replaced by something like
4632 have "P (S::'a set)" <...>
4633 moreover have "S = T" <...>
4634 ultimately have "P T" by simp
4636 - Tactics or packages written in ML code:
4637 Code performing pattern matching on types via
4639 Type ("set", [T]) => ...
4641 must be rewritten. Moreover, functions like strip_type or
4642 binder_types no longer return the right value when applied to a
4645 T1 => ... => Tn => U => bool
4649 T1 => ... => Tn => U set
4651 * Merged theories Wellfounded_Recursion, Accessible_Part and
4652 Wellfounded_Relations to theory Wellfounded.
4654 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4656 * Class finite no longer treats UNIV as class parameter. Use class
4657 enum from theory Library/Enum instead to achieve a similar effect.
4660 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4661 and "Cons". INCOMPATIBILITY.
4663 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4664 Potential INCOMPATIBILITY.
4666 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4667 injective_fst_snd removed, use split_eta and prod_eqI instead.
4668 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4670 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4671 the same name in theory Orderings:
4681 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4682 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4683 and different variable names.
4685 * Library/Option_ord.thy: Canonical order on option type.
4687 * Library/RBT.thy: Red-black trees, an efficient implementation of
4690 * Library/Countable.thy: Type class for countable types.
4692 * Theory Int: The representation of numerals has changed. The infix
4693 operator BIT and the bit datatype with constructors B0 and B1 have
4694 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
4695 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
4696 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
4699 * Theory Nat: definition of <= and < on natural numbers no longer
4700 depend on well-founded relations. INCOMPATIBILITY. Definitions
4701 le_def and less_def have disappeared. Consider lemmas not_less
4702 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
4704 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
4705 (whose purpose mainly is for various fold_set functionals) have been
4706 abandoned in favor of the existing algebraic classes
4707 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
4708 lower_semilattice (resp. upper_semilattice) and linorder.
4711 * Theory Transitive_Closure: induct and cases rules now declare proper
4712 case_names ("base" and "step"). INCOMPATIBILITY.
4714 * Theorem Inductive.lfp_ordinal_induct generalized to complete
4715 lattices. The form set-specific version is available as
4716 Inductive.lfp_ordinal_induct_set.
4718 * Renamed theorems "power.simps" to "power_int.simps".
4721 * Class semiring_div provides basic abstract properties of semirings
4722 with division and modulo operations. Subsumes former class dvd_mod.
4724 * Merged theories IntDef, Numeral and IntArith into unified theory
4725 Int. INCOMPATIBILITY.
4727 * Theory Library/Code_Index: type "index" now represents natural
4728 numbers rather than integers. INCOMPATIBILITY.
4730 * New class "uminus" with operation "uminus" (split of from class
4731 "minus" which now only has operation "minus", binary).
4734 * Constants "card", "internal_split", "option_map" now with authentic
4735 syntax. INCOMPATIBILITY.
4737 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
4738 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
4739 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
4740 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
4741 Sup_set_def, le_def, less_def, option_map_def now with object
4742 equality. INCOMPATIBILITY.
4744 * Records. Removed K_record, and replaced it by pure lambda term
4745 %x. c. The simplifier setup is now more robust against eta expansion.
4746 INCOMPATIBILITY: in cases explicitly referring to K_record.
4748 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
4750 * Library/ListVector: new theory of arithmetic vector operations.
4752 * Library/Order_Relation: new theory of various orderings as sets of
4753 pairs. Defines preorders, partial orders, linear orders and
4754 well-orders on sets and on types.
4759 * Renamed some theories to allow to loading both ZF and HOL in the
4762 Datatype -> Datatype_ZF
4763 Inductive -> Inductive_ZF
4770 INCOMPATIBILITY: ZF theories that import individual theories below
4771 Main might need to be adapted. Regular theory Main is still
4772 available, as trivial extension of Main_ZF.
4777 * ML within Isar: antiquotation @{const name} or @{const
4778 name(typargs)} produces statically-checked Const term.
4780 * Functor NamedThmsFun: data is available to the user as dynamic fact
4781 (of the same name). Removed obsolete print command.
4783 * Removed obsolete "use_legacy_bindings" function.
4785 * The ``print mode'' is now a thread-local value derived from a global
4786 template (the former print_mode reference), thus access becomes
4787 non-critical. The global print_mode reference is for session
4788 management only; user-code should use print_mode_value,
4789 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
4791 * Functions system/system_out provide a robust way to invoke external
4792 shell commands, with propagation of interrupts (requires Poly/ML
4793 5.2.1). Do not use OS.Process.system etc. from the basis library!
4798 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
4799 in accordance with Proof General 3.7, which prefers GNU emacs.
4801 * isatool tty runs Isabelle process with plain tty interaction;
4802 optional line editor may be specified via ISABELLE_LINE_EDITOR
4803 setting, the default settings attempt to locate "ledit" and "rlwrap".
4805 * isatool browser now works with Cygwin as well, using general
4806 "javapath" function defined in Isabelle process environment.
4808 * YXML notation provides a simple and efficient alternative to
4809 standard XML transfer syntax. See src/Pure/General/yxml.ML and
4810 isatool yxml as described in the Isabelle system manual.
4812 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
4813 provides general wrapper for managing an Isabelle process in a robust
4814 fashion, with ``cooked'' output from stdin/stderr.
4816 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
4817 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
4819 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
4820 way of changing the user's settings is via
4821 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
4824 * Multithreading.max_threads := 0 refers to the number of actual CPU
4825 cores of the underlying machine, which is a good starting point for
4826 optimal performance tuning. The corresponding usedir option -M allows
4827 "max" as an alias for "0". WARNING: does not work on certain versions
4828 of Mac OS (with Poly/ML 5.1).
4830 * isabelle-process: non-ML sessions are run with "nice", to reduce the
4831 adverse effect of Isabelle flooding interactive front-ends (notably
4832 ProofGeneral / XEmacs).
4836 New in Isabelle2007 (November 2007)
4837 -----------------------------------
4841 * More uniform information about legacy features, notably a
4842 warning/error of "Legacy feature: ...", depending on the state of the
4843 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
4844 legacy features will disappear eventually.
4846 * Theory syntax: the header format ``theory A = B + C:'' has been
4847 discontinued in favour of ``theory A imports B C begin''. Use isatool
4848 fixheaders to convert existing theory files. INCOMPATIBILITY.
4850 * Theory syntax: the old non-Isar theory file format has been
4851 discontinued altogether. Note that ML proof scripts may still be used
4852 with Isar theories; migration is usually quite simple with the ML
4853 function use_legacy_bindings. INCOMPATIBILITY.
4855 * Theory syntax: some popular names (e.g. 'class', 'declaration',
4856 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
4859 * Theory loader: be more serious about observing the static theory
4860 header specifications (including optional directories), but not the
4861 accidental file locations of previously successful loads. The strict
4862 update policy of former update_thy is now already performed by
4863 use_thy, so the former has been removed; use_thys updates several
4864 theories simultaneously, just as 'imports' within a theory header
4865 specification, but without merging the results. Potential
4866 INCOMPATIBILITY: may need to refine theory headers and commands
4867 ROOT.ML which depend on load order.
4869 * Theory loader: optional support for content-based file
4870 identification, instead of the traditional scheme of full physical
4871 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
4872 (cf. the system manual). The new scheme allows to work with
4873 non-finished theories in persistent session images, such that source
4874 files may be moved later on without requiring reloads.
4876 * Theory loader: old-style ML proof scripts being *attached* to a thy
4877 file (with the same base name as the theory) are considered a legacy
4878 feature, which will disappear eventually. Even now, the theory loader
4879 no longer maintains dependencies on such files.
4881 * Syntax: the scope for resolving ambiguities via type-inference is
4882 now limited to individual terms, instead of whole simultaneous
4883 specifications as before. This greatly reduces the complexity of the
4884 syntax module and improves flexibility by separating parsing and
4885 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
4886 'fixes' etc.) are required in rare situations.
4888 * Syntax: constants introduced by new-style packages ('definition',
4889 'abbreviation' etc.) are passed through the syntax module in
4890 ``authentic mode''. This means that associated mixfix annotations
4891 really stick to such constants, independently of potential name space
4892 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
4893 trees are represented slightly differently, may need to adapt syntax
4894 translations accordingly. Use CONST marker in 'translations' and
4895 @{const_syntax} antiquotation in 'parse_translation' etc.
4897 * Legacy goal package: reduced interface to the bare minimum required
4898 to keep existing proof scripts running. Most other user-level
4899 functions are now part of the OldGoals structure, which is *not* open
4900 by default (consider isatool expandshort before open OldGoals).
4901 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
4902 these tend to cause confusion about the actual goal (!) context being
4903 used here, which is not necessarily the same as the_context().
4905 * Command 'find_theorems': supports "*" wild-card in "name:"
4906 criterion; "with_dups" option. Certain ProofGeneral versions might
4907 support a specific search form (see ProofGeneral/CHANGES).
4909 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
4910 by default, which means that "prems" (and also "fixed variables") are
4911 suppressed from proof state output. Note that the ProofGeneral
4912 settings mechanism allows to change and save options persistently, but
4913 older versions of Isabelle will fail to start up if a negative prems
4916 * Local theory targets may be specified by non-nested blocks of
4917 ``context/locale/class ... begin'' followed by ``end''. The body may
4918 contain definitions, theorems etc., including any derived mechanism
4919 that has been implemented on top of these primitives. This concept
4920 generalizes the existing ``theorem (in ...)'' towards more versatility
4923 * Proof General interface: proper undo of final 'end' command;
4924 discontinued Isabelle/classic mode (ML proof scripts).
4927 *** Document preparation ***
4929 * Added antiquotation @{theory name} which prints the given name,
4930 after checking that it refers to a valid ancestor theory in the
4933 * Added antiquotations @{ML_type text} and @{ML_struct text} which
4934 check the given source text as ML type/structure, printing verbatim.
4936 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
4937 "c args == rhs" given in the current context. (Any number of
4938 arguments may be given on the LHS.)
4943 * The 'class' package offers a combination of axclass and locale to
4944 achieve Haskell-like type classes in Isabelle. Definitions and
4945 theorems within a class context produce both relative results (with
4946 implicit parameters according to the locale context), and polymorphic
4947 constants with qualified polymorphism (according to the class
4948 context). Within the body context of a 'class' target, a separate
4949 syntax layer ("user space type system") takes care of converting
4950 between global polymorphic consts and internal locale representation.
4951 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
4952 "isatool doc classes" provides a tutorial.
4954 * Generic code generator framework allows to generate executable
4955 code for ML and Haskell (including Isabelle classes). A short usage
4958 internal compilation:
4959 export_code <list of constants (term syntax)> in SML
4960 writing SML code to a file:
4961 export_code <list of constants (term syntax)> in SML <filename>
4962 writing OCaml code to a file:
4963 export_code <list of constants (term syntax)> in OCaml <filename>
4964 writing Haskell code to a bunch of files:
4965 export_code <list of constants (term syntax)> in Haskell <filename>
4967 evaluating closed propositions to True/False using code generation:
4970 Reasonable default setup of framework in HOL.
4972 Theorem attributs for selecting and transforming function equations theorems:
4974 [code fun]: select a theorem as function equation for a specific constant
4975 [code fun del]: deselect a theorem as function equation for a specific constant
4976 [code inline]: select an equation theorem for unfolding (inlining) in place
4977 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
4979 User-defined serializations (target in {SML, OCaml, Haskell}):
4981 code_const <and-list of constants (term syntax)>
4982 {(target) <and-list of const target syntax>}+
4984 code_type <and-list of type constructors>
4985 {(target) <and-list of type target syntax>}+
4987 code_instance <and-list of instances>
4989 where instance ::= <type constructor> :: <class>
4991 code_class <and_list of classes>
4992 {(target) <and-list of class target syntax>}+
4993 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
4995 code_instance and code_class only are effective to target Haskell.
4997 For example usage see src/HOL/ex/Codegenerator.thy and
4998 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
4999 generation from Isabelle/HOL theories is available via "isatool doc
5002 * Code generator: consts in 'consts_code' Isar commands are now
5003 referred to by usual term syntax (including optional type
5006 * Command 'no_translations' removes translation rules from theory
5009 * Overloaded definitions are now actually checked for acyclic
5010 dependencies. The overloading scheme is slightly more general than
5011 that of Haskell98, although Isabelle does not demand an exact
5012 correspondence to type class and instance declarations.
5013 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5014 exotic versions of overloading -- at the discretion of the user!
5016 Polymorphic constants are represented via type arguments, i.e. the
5017 instantiation that matches an instance against the most general
5018 declaration given in the signature. For example, with the declaration
5019 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5020 as c(nat). Overloading is essentially simultaneous structural
5021 recursion over such type arguments. Incomplete specification patterns
5022 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5023 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5024 Command 'print_theory' outputs the normalized system of recursive
5025 equations, see section "definitions".
5027 * Configuration options are maintained within the theory or proof
5028 context (with name and type bool/int/string), providing a very simple
5029 interface to a poor-man's version of general context data. Tools may
5030 declare options in ML (e.g. using Attrib.config_int) and then refer to
5031 these values using Config.get etc. Users may change options via an
5032 associated attribute of the same name. This form of context
5033 declaration works particularly well with commands 'declare' or
5034 'using', for example ``declare [[foo = 42]]''. Thus it has become
5035 very easy to avoid global references, which would not observe Isar
5036 toplevel undo/redo and fail to work with multithreading.
5038 Various global ML references of Pure and HOL have been turned into
5039 configuration options:
5041 Unify.search_bound unify_search_bound
5042 Unify.trace_bound unify_trace_bound
5043 Unify.trace_simp unify_trace_simp
5044 Unify.trace_types unify_trace_types
5045 Simplifier.simp_depth_limit simp_depth_limit
5046 Blast.depth_limit blast_depth_limit
5047 DatatypeProp.dtK datatype_distinctness_limit
5048 fast_arith_neq_limit fast_arith_neq_limit
5049 fast_arith_split_limit fast_arith_split_limit
5051 * Named collections of theorems may be easily installed as context
5052 data using the functor NamedThmsFun (see also
5053 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5054 attributes; there is also a toplevel print command. This facility is
5055 just a common case of general context data, which is the preferred way
5056 for anything more complex than just a list of facts in canonical
5059 * Isar: command 'declaration' augments a local theory by generic
5060 declaration functions written in ML. This enables arbitrary content
5061 being added to the context, depending on a morphism that tells the
5062 difference of the original declaration context wrt. the application
5063 context encountered later on.
5065 * Isar: proper interfaces for simplification procedures. Command
5066 'simproc_setup' declares named simprocs (with match patterns, and body
5067 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5068 context. ML antiquotation @{simproc name} retrieves named simprocs.
5070 * Isar: an extra pair of brackets around attribute declarations
5071 abbreviates a theorem reference involving an internal dummy fact,
5072 which will be ignored later --- only the effect of the attribute on
5073 the background context will persist. This form of in-place
5074 declarations is particularly useful with commands like 'declare' and
5075 'using', for example ``have A using [[simproc a]] by simp''.
5077 * Isar: method "assumption" (and implicit closing of subproofs) now
5078 takes simple non-atomic goal assumptions into account: after applying
5079 an assumption as a rule the resulting subgoals are solved by atomic
5080 assumption steps. This is particularly useful to finish 'obtain'
5081 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5082 without referring to the original premise "!!x. P x ==> thesis" in the
5083 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5086 * Isar: implicit use of prems from the Isar proof context is
5087 considered a legacy feature. Common applications like ``have A .''
5088 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5089 referencing facts explicitly here improves readability and
5090 maintainability of proof texts.
5092 * Isar: improper proof element 'guess' is like 'obtain', but derives
5093 the obtained context from the course of reasoning! For example:
5095 assume "EX x y. A x & B y" -- "any previous fact"
5096 then guess x and y by clarify
5098 This technique is potentially adventurous, depending on the facts and
5099 proof tools being involved here.
5101 * Isar: known facts from the proof context may be specified as literal
5102 propositions, using ASCII back-quote syntax. This works wherever
5103 named facts used to be allowed so far, in proof commands, proof
5104 methods, attributes etc. Literal facts are retrieved from the context
5105 according to unification of type and term parameters. For example,
5106 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5107 theorems in the current context, then these are valid literal facts:
5108 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5110 There is also a proof method "fact" which does the same composition
5111 for explicit goal states, e.g. the following proof texts coincide with
5112 certain special cases of literal facts:
5114 have "A" by fact == note `A`
5115 have "A ==> B" by fact == note `A ==> B`
5116 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5117 have "P a ==> Q a" by fact == note `P a ==> Q a`
5119 * Isar: ":" (colon) is no longer a symbolic identifier character in
5120 outer syntax. Thus symbolic identifiers may be used without
5121 additional white space in declarations like this: ``assume *: A''.
5123 * Isar: 'print_facts' prints all local facts of the current context,
5124 both named and unnamed ones.
5126 * Isar: 'def' now admits simultaneous definitions, e.g.:
5128 def x == "t" and y == "u"
5130 * Isar: added command 'unfolding', which is structurally similar to
5131 'using', but affects both the goal state and facts by unfolding given
5132 rewrite rules. Thus many occurrences of the 'unfold' method or
5133 'unfolded' attribute may be replaced by first-class proof text.
5135 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5136 and command 'unfolding' now all support object-level equalities
5137 (potentially conditional). The underlying notion of rewrite rule is
5138 analogous to the 'rule_format' attribute, but *not* that of the
5139 Simplifier (which is usually more generous).
5141 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5142 premises of a theorem by n. Useful in conjunction with drule.
5144 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5145 method expression within a sandbox consisting of the first N
5146 sub-goals, which need to exist. For example, ``simp_all [3]''
5147 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5148 simplifies all new goals that emerge from applying rule foo to the
5149 originally first one.
5151 * Isar: schematic goals are no longer restricted to higher-order
5152 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5155 * Isar: the conclusion of a long theorem statement is now either
5156 'shows' (a simultaneous conjunction, as before), or 'obtains'
5157 (essentially a disjunction of cases with local parameters and
5158 assumptions). The latter allows to express general elimination rules
5159 adequately; in this notation common elimination rules look like this:
5161 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5163 obtains x where "P x"
5165 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5169 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5175 The subsequent classical rules even refer to the formal "thesis"
5178 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5181 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5182 obtains "thesis ==> something"
5184 The actual proof of an 'obtains' statement is analogous to that of the
5185 Isar proof element 'obtain', only that there may be several cases.
5186 Optional case names may be specified in parentheses; these will be
5187 available both in the present proof and as annotations in the
5188 resulting rule, for later use with the 'cases' method (cf. attribute
5191 * Isar: the assumptions of a long theorem statement are available as
5192 "assms" fact in the proof context. This is more appropriate than the
5193 (historical) "prems", which refers to all assumptions of the current
5194 context, including those from the target locale, proof body etc.
5196 * Isar: 'print_statement' prints theorems from the current theory or
5197 proof context in long statement form, according to the syntax of a
5200 * Isar: 'obtain' takes an optional case name for the local context
5201 introduction rule (default "that").
5203 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5204 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5207 * Pure: syntax "CONST name" produces a fully internalized constant
5208 according to the current context. This is particularly useful for
5209 syntax translations that should refer to internal constant
5210 representations independently of name spaces.
5212 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5213 instead of "FOO ". This allows multiple binder declarations to coexist
5214 in the same context. INCOMPATIBILITY.
5216 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5217 primitive that also works in a locale context (both for constants and
5218 fixed variables). Type declaration and internal syntactic representation
5219 of given constants retrieved from the context. Likewise, the
5220 'no_notation' command allows to remove given syntax annotations from the
5223 * Isar/locales: new derived specification elements 'axiomatization',
5224 'definition', 'abbreviation', which support type-inference, admit
5225 object-level specifications (equality, equivalence). See also the
5226 isar-ref manual. Examples:
5229 eq (infix "===" 50) where
5230 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5232 definition "f x y = x + y + 1"
5233 definition g where "g x = f x x"
5236 neq (infix "=!=" 50) where
5237 "x =!= y == ~ (x === y)"
5239 These specifications may be also used in a locale context. Then the
5240 constants being introduced depend on certain fixed parameters, and the
5241 constant name is qualified by the locale base name. An internal
5242 abbreviation takes care for convenient input and output, making the
5243 parameters implicit and using the original short name. See also
5244 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5245 entities from a monomorphic theory.
5247 Presently, abbreviations are only available 'in' a target locale, but
5248 not inherited by general import expressions. Also note that
5249 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5250 'translations' in common applications. The "no_abbrevs" print mode
5251 prevents folding of abbreviations in term output.
5253 Concrete syntax is attached to specified constants in internal form,
5254 independently of name spaces. The parse tree representation is
5255 slightly different -- use 'notation' instead of raw 'syntax', and
5256 'translations' with explicit "CONST" markup to accommodate this.
5258 * Pure/Isar: unified syntax for new-style specification mechanisms
5259 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5260 full type inference and dummy patterns ("_"). For example:
5262 definition "K x _ = x"
5264 inductive conj for A B
5265 where "A ==> B ==> conj A B"
5267 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5268 the current context. Print mode "no_abbrevs" prevents inversion of
5269 abbreviations on output.
5271 * Isar/locales: improved parameter handling: use of locales "var" and
5272 "struct" no longer necessary; - parameter renamings are no longer
5273 required to be injective. For example, this allows to define
5274 endomorphisms as locale endom = homom mult mult h.
5276 * Isar/locales: changed the way locales with predicates are defined.
5277 Instead of accumulating the specification, the imported expression is
5278 now an interpretation. INCOMPATIBILITY: different normal form of
5279 locale expressions. In particular, in interpretations of locales with
5280 predicates, goals repesenting already interpreted fragments are not
5281 removed automatically. Use methods `intro_locales' and
5282 `unfold_locales'; see below.
5284 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5285 provide backward reasoning on locales predicates. The methods are
5286 aware of interpretations and discharge corresponding goals.
5287 `intro_locales' is less aggressive then `unfold_locales' and does not
5288 unfold predicates to assumptions.
5290 * Isar/locales: the order in which locale fragments are accumulated
5291 has changed. This enables to override declarations from fragments due
5292 to interpretations -- for example, unwanted simp rules.
5294 * Isar/locales: interpretation in theories and proof contexts has been
5295 extended. One may now specify (and prove) equations, which are
5296 unfolded in interpreted theorems. This is useful for replacing
5297 defined concepts (constants depending on locale parameters) by
5298 concepts already existing in the target context. Example:
5300 interpretation partial_order ["op <= :: [int, int] => bool"]
5301 where "partial_order.less (op <=) (x::int) y = (x < y)"
5303 Typically, the constant `partial_order.less' is created by a
5304 definition specification element in the context of locale
5307 * Method "induct": improved internal context management to support
5308 local fixes and defines on-the-fly. Thus explicit meta-level
5309 connectives !! and ==> are rarely required anymore in inductive goals
5310 (using object-logic connectives for this purpose has been long
5311 obsolete anyway). Common proof patterns are explained in
5312 src/HOL/Induct/Common_Patterns.thy, see also
5313 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5316 * Method "induct": improved handling of simultaneous goals. Instead of
5317 introducing object-level conjunction, the statement is now split into
5318 several conclusions, while the corresponding symbolic cases are nested
5319 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5320 see src/HOL/Induct/Common_Patterns.thy, for example.
5322 * Method "induct": mutual induction rules are now specified as a list
5323 of rule sharing the same induction cases. HOL packages usually provide
5324 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5325 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5326 mutual induction rules differently, i.e. like this:
5328 (induct rule: foo_bar.inducts)
5329 (induct set: foo bar)
5330 (induct pred: foo bar)
5331 (induct type: foo bar)
5333 The ML function ProjectRule.projections turns old-style rules into the
5336 * Method "coinduct": dual of induction, see
5337 src/HOL/Library/Coinductive_List.thy for various examples.
5339 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5340 considered a legacy feature.
5342 * Attribute "symmetric" produces result with standardized schematic
5343 variables (index 0). Potential INCOMPATIBILITY.
5345 * Simplifier: by default the simplifier trace only shows top level
5346 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5347 default. Thus there is less danger of being flooded by the trace. The
5348 trace indicates where parts have been suppressed.
5350 * Provers/classical: removed obsolete classical version of elim_format
5351 attribute; classical elim/dest rules are now treated uniformly when
5352 manipulating the claset.
5354 * Provers/classical: stricter checks to ensure that supplied intro,
5355 dest and elim rules are well-formed; dest and elim rules must have at
5358 * Provers/classical: attributes dest/elim/intro take an optional
5359 weight argument for the rule (just as the Pure versions). Weights are
5360 ignored by automated tools, but determine the search order of single
5363 * Syntax: input syntax now supports dummy variable binding "%_. b",
5364 where the body does not mention the bound variable. Note that dummy
5365 patterns implicitly depend on their context of bounds, which makes
5366 "{_. _}" match any set comprehension as expected. Potential
5367 INCOMPATIBILITY -- parse translations need to cope with syntactic
5368 constant "_idtdummy" in the binding position.
5370 * Syntax: removed obsolete syntactic constant "_K" and its associated
5371 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5372 for example "A -> B" => "Pi A (%_. B)".
5374 * Pure: 'class_deps' command visualizes the subclass relation, using
5375 the graph browser tool.
5377 * Pure: 'print_theory' now suppresses certain internal declarations by
5378 default; use '!' option for full details.
5383 * Method "metis" proves goals by applying the Metis general-purpose
5384 resolution prover (see also http://gilith.com/software/metis/).
5385 Examples are in the directory MetisExamples. WARNING: the
5386 Isabelle/HOL-Metis integration does not yet work properly with
5389 * Command 'sledgehammer' invokes external automatic theorem provers as
5390 background processes. It generates calls to the "metis" method if
5391 successful. These can be pasted into the proof. Users do not have to
5392 wait for the automatic provers to return. WARNING: does not really
5393 work with multi-threading.
5395 * New "auto_quickcheck" feature tests outermost goal statements for
5396 potential counter-examples. Controlled by ML references
5397 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5398 5000 milliseconds). Fails silently if statements is outside of
5399 executable fragment, or any other codgenerator problem occurs.
5401 * New constant "undefined" with axiom "undefined x = undefined".
5403 * Added class "HOL.eq", allowing for code generation with polymorphic
5406 * Some renaming of class constants due to canonical name prefixing in
5407 the new 'class' package:
5409 HOL.abs ~> HOL.abs_class.abs
5410 HOL.divide ~> HOL.divide_class.divide
5411 0 ~> HOL.zero_class.zero
5412 1 ~> HOL.one_class.one
5413 op + ~> HOL.plus_class.plus
5414 op - ~> HOL.minus_class.minus
5415 uminus ~> HOL.minus_class.uminus
5416 op * ~> HOL.times_class.times
5417 op < ~> HOL.ord_class.less
5418 op <= > HOL.ord_class.less_eq
5419 Nat.power ~> Power.power_class.power
5420 Nat.size ~> Nat.size_class.size
5421 Numeral.number_of ~> Numeral.number_class.number_of
5422 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5423 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5424 Orderings.min ~> Orderings.ord_class.min
5425 Orderings.max ~> Orderings.ord_class.max
5426 Divides.op div ~> Divides.div_class.div
5427 Divides.op mod ~> Divides.div_class.mod
5428 Divides.op dvd ~> Divides.div_class.dvd
5430 INCOMPATIBILITY. Adaptions may be required in the following cases:
5432 a) User-defined constants using any of the names "plus", "minus",
5433 "times", "less" or "less_eq". The standard syntax translations for
5434 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5437 b) Variables named "plus", "minus", "times", "less", "less_eq"
5438 INCOMPATIBILITY: use more specific names.
5440 c) Permutative equations (e.g. "a + b = b + a")
5441 Since the change of names also changes the order of terms, permutative
5442 rewrite rules may get applied in a different order. Experience shows
5443 that this is rarely the case (only two adaptions in the whole Isabelle
5444 distribution). INCOMPATIBILITY: rewrite proofs
5446 d) ML code directly refering to constant names
5447 This in general only affects hand-written proof tactics, simprocs and
5448 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5449 Consider using @{const_name} antiquotation.
5451 * New class "default" with associated constant "default".
5453 * Function "sgn" is now overloaded and available on int, real, complex
5454 (and other numeric types), using class "sgn". Two possible defs of
5455 sgn are given as equational assumptions in the classes sgn_if and
5456 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5459 * Locale "partial_order" now unified with class "order" (cf. theory
5460 Orderings), added parameter "less". INCOMPATIBILITY.
5462 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5463 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5464 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5466 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5467 changed order of proof goals in instance proofs.
5469 * The transitivity reasoner for partial and linear orders is set up
5470 for classes "order" and "linorder". Instances of the reasoner are available
5471 in all contexts importing or interpreting the corresponding locales.
5472 Method "order" invokes the reasoner separately; the reasoner
5473 is also integrated with the Simplifier as a solver. Diagnostic
5474 command 'print_orders' shows the available instances of the reasoner
5475 in the current context.
5477 * Localized monotonicity predicate in theory "Orderings"; integrated
5478 lemmas max_of_mono and min_of_mono with this predicate.
5481 * Formulation of theorem "dense" changed slightly due to integration
5482 with new class dense_linear_order.
5484 * Uniform lattice theory development in HOL.
5486 constants "meet" and "join" now named "inf" and "sup"
5487 constant "Meet" now named "Inf"
5489 classes "meet_semilorder" and "join_semilorder" now named
5490 "lower_semilattice" and "upper_semilattice"
5491 class "lorder" now named "lattice"
5492 class "comp_lat" now named "complete_lattice"
5494 Instantiation of lattice classes allows explicit definitions
5495 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5497 INCOMPATIBILITY. Theorem renames:
5499 meet_left_le ~> inf_le1
5500 meet_right_le ~> inf_le2
5501 join_left_le ~> sup_ge1
5502 join_right_le ~> sup_ge2
5503 meet_join_le ~> inf_sup_ord
5506 le_meet ~> le_inf_iff
5507 le_join ~> ge_sup_conv
5508 meet_idempotent ~> inf_idem
5509 join_idempotent ~> sup_idem
5510 meet_comm ~> inf_commute
5511 join_comm ~> sup_commute
5512 meet_leI1 ~> le_infI1
5513 meet_leI2 ~> le_infI2
5514 le_joinI1 ~> le_supI1
5515 le_joinI2 ~> le_supI2
5516 meet_assoc ~> inf_assoc
5517 join_assoc ~> sup_assoc
5518 meet_left_comm ~> inf_left_commute
5519 meet_left_idempotent ~> inf_left_idem
5520 join_left_comm ~> sup_left_commute
5521 join_left_idempotent ~> sup_left_idem
5524 le_def_meet ~> le_iff_inf
5525 le_def_join ~> le_iff_sup
5526 join_absorp2 ~> sup_absorb2
5527 join_absorp1 ~> sup_absorb1
5528 meet_absorp1 ~> inf_absorb1
5529 meet_absorp2 ~> inf_absorb2
5530 meet_join_absorp ~> inf_sup_absorb
5531 join_meet_absorp ~> sup_inf_absorb
5532 distrib_join_le ~> distrib_sup_le
5533 distrib_meet_le ~> distrib_inf_le
5535 add_meet_distrib_left ~> add_inf_distrib_left
5536 add_join_distrib_left ~> add_sup_distrib_left
5537 is_join_neg_meet ~> is_join_neg_inf
5538 is_meet_neg_join ~> is_meet_neg_sup
5539 add_meet_distrib_right ~> add_inf_distrib_right
5540 add_join_distrib_right ~> add_sup_distrib_right
5541 add_meet_join_distribs ~> add_sup_inf_distribs
5542 join_eq_neg_meet ~> sup_eq_neg_inf
5543 meet_eq_neg_join ~> inf_eq_neg_sup
5544 add_eq_meet_join ~> add_eq_inf_sup
5545 meet_0_imp_0 ~> inf_0_imp_0
5546 join_0_imp_0 ~> sup_0_imp_0
5547 meet_0_eq_0 ~> inf_0_eq_0
5548 join_0_eq_0 ~> sup_0_eq_0
5549 neg_meet_eq_join ~> neg_inf_eq_sup
5550 neg_join_eq_meet ~> neg_sup_eq_inf
5551 join_eq_if ~> sup_eq_if
5553 mono_meet ~> mono_inf
5554 mono_join ~> mono_sup
5555 meet_bool_eq ~> inf_bool_eq
5556 join_bool_eq ~> sup_bool_eq
5557 meet_fun_eq ~> inf_fun_eq
5558 join_fun_eq ~> sup_fun_eq
5559 meet_set_eq ~> inf_set_eq
5560 join_set_eq ~> sup_set_eq
5561 meet1_iff ~> inf1_iff
5562 meet2_iff ~> inf2_iff
5571 join1_iff ~> sup1_iff
5572 join2_iff ~> sup2_iff
5582 is_meet_Meet ~> is_meet_Inf
5583 Meet_bool_def ~> Inf_bool_def
5584 Meet_fun_def ~> Inf_fun_def
5585 Meet_greatest ~> Inf_greatest
5586 Meet_lower ~> Inf_lower
5587 Meet_set_def ~> Inf_set_def
5590 Sup_bool_eq ~> Sup_bool_def
5591 Sup_fun_eq ~> Sup_fun_def
5592 Sup_set_eq ~> Sup_set_def
5594 listsp_meetI ~> listsp_infI
5595 listsp_meet_eq ~> listsp_inf_eq
5600 * Added syntactic class "size"; overloaded constant "size" now has
5601 type "'a::size ==> bool"
5603 * Internal reorganisation of `size' of datatypes: size theorems
5604 "foo.size" are no longer subsumed by "foo.simps" (but are still
5605 simplification rules by default!); theorems "prod.size" now named
5608 * Class "div" now inherits from class "times" rather than "type".
5611 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5612 Linorder etc. have disappeared; operations defined in terms of
5613 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5615 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5617 * HOL-Word: New extensive library and type for generic, fixed size
5618 machine words, with arithmetic, bit-wise, shifting and rotating
5619 operations, reflection into int, nat, and bool lists, automation for
5620 linear arithmetic (by automatic reflection into nat or int), including
5621 lemmas on overflow and monotonicity. Instantiated to all appropriate
5622 arithmetic type classes, supporting automatic simplification of
5623 numerals on all operations.
5625 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5627 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5629 * Code generator library theories:
5630 - Code_Integer represents HOL integers by big integer literals in target
5632 - Code_Char represents HOL characters by character literals in target
5634 - Code_Char_chr like Code_Char, but also offers treatment of character
5635 codes; includes Code_Integer.
5636 - Executable_Set allows to generate code for finite sets using lists.
5637 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5639 - Executable_Real implements a subset of real numbers, namly those
5640 representable by rational numbers.
5641 - Efficient_Nat implements natural numbers by integers, which in general will
5642 result in higher efficency; pattern matching with 0/Suc is eliminated;
5643 includes Code_Integer.
5644 - Code_Index provides an additional datatype index which is mapped to
5645 target-language built-in integers.
5646 - Code_Message provides an additional datatype message_string which is isomorphic to
5647 strings; messages are mapped to target-language strings.
5649 * New package for inductive predicates
5651 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5654 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5655 for z_1 :: U_1 and ... and z_n :: U_m
5657 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5660 with full support for type-inference, rather than
5662 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5664 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5665 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5667 inductive "s z_1 ... z_m"
5669 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5672 For backward compatibility, there is a wrapper allowing inductive
5673 sets to be defined with the new package via
5676 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5677 for z_1 :: U_1 and ... and z_n :: U_m
5679 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5685 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5686 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5687 for z_1 :: U_1 and ... and z_n :: U_m
5689 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5690 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5693 if the additional syntax "p ..." is required.
5695 Numerous examples can be found in the subdirectories src/HOL/Auth,
5696 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
5700 - Since declaration and definition of inductive sets or predicates
5701 is no longer separated, abbreviations involving the newly
5702 introduced sets or predicates must be specified together with the
5703 introduction rules after the 'where' keyword (see above), rather
5704 than before the actual inductive definition.
5706 - The variables in induction and elimination rules are now
5707 quantified in the order of their occurrence in the introduction
5708 rules, rather than in alphabetical order. Since this may break
5709 some proofs, these proofs either have to be repaired, e.g. by
5710 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
5711 statements of the form
5713 case (rule_i a_i_1 ... a_i_{k_i})
5715 or the old order of quantification has to be restored by explicitly adding
5716 meta-level quantifiers in the introduction rules, i.e.
5718 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
5720 - The format of the elimination rules is now
5722 p z_1 ... z_m x_1 ... x_n ==>
5723 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5728 (x_1, ..., x_n) : s z_1 ... z_m ==>
5729 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
5732 for sets rather than
5734 x : s z_1 ... z_m ==>
5735 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
5738 This may require terms in goals to be expanded to n-tuples
5739 (e.g. using case_tac or simplification with the split_paired_all
5740 rule) before the above elimination rule is applicable.
5742 - The elimination or case analysis rules for (mutually) inductive
5743 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
5744 list of rules "p_1_..._p_k.elims" is no longer available.
5746 * New package "function"/"fun" for general recursive functions,
5747 supporting mutual and nested recursion, definitions in local contexts,
5748 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
5749 for small examples, and the separate tutorial on the function
5750 package. The old recdef "package" is still available as before, but
5751 users are encouraged to use the new package.
5753 * Method "lexicographic_order" automatically synthesizes termination
5754 relations as lexicographic combinations of size measures.
5756 * Case-expressions allow arbitrary constructor-patterns (including
5757 "_") and take their order into account, like in functional
5758 programming. Internally, this is translated into nested
5759 case-expressions; missing cases are added and mapped to the predefined
5760 constant "undefined". In complicated cases printing may no longer show
5761 the original input but the internal form. Lambda-abstractions allow
5762 the same form of pattern matching: "% pat1 => e1 | ..." is an
5763 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
5766 * IntDef: The constant "int :: nat => int" has been removed; now "int"
5767 is an abbreviation for "of_nat :: nat => int". The simplification
5768 rules for "of_nat" have been changed to work like "int" did
5769 previously. Potential INCOMPATIBILITY:
5770 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
5771 - of_nat_diff and of_nat_mult are no longer default simp rules
5773 * Method "algebra" solves polynomial equations over (semi)rings using
5774 Groebner bases. The (semi)ring structure is defined by locales and the
5775 tool setup depends on that generic context. Installing the method for
5776 a specific type involves instantiating the locale and possibly adding
5777 declarations for computation on the coefficients. The method is
5778 already instantiated for natural numbers and for the axiomatic class
5779 of idoms with numerals. See also the paper by Chaieb and Wenzel at
5780 CALCULEMUS 2007 for the general principles underlying this
5781 architecture of context-aware proof-tools.
5783 * Method "ferrack" implements quantifier elimination over
5784 special-purpose dense linear orders using locales (analogous to
5785 "algebra"). The method is already installed for class
5786 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
5789 * Former constant "List.op @" now named "List.append". Use ML
5790 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
5791 circumvent possible incompatibilities when working on ML level.
5793 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
5795 * New function listsum :: 'a list => 'a for arbitrary monoids.
5796 Special syntax: "SUM x <- xs. f x" (and latex variants)
5798 * New syntax for Haskell-like list comprehension (input only), eg.
5799 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
5801 * The special syntax for function "filter" has changed from [x :
5802 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
5803 comprehension syntax, and for uniformity. INCOMPATIBILITY.
5805 * [a..b] is now defined for arbitrary linear orders. It used to be
5806 defined on nat only, as an abbreviation for [a..<Suc b]
5809 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
5811 * New functions "sorted" and "sort" in src/HOL/List.thy.
5813 * New lemma collection field_simps (an extension of ring_simps) for
5814 manipulating (in)equations involving division. Multiplies with all
5815 denominators that can be proved to be non-zero (in equations) or
5816 positive/negative (in inequations).
5818 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
5819 have been improved and renamed to ring_simps, group_simps and
5820 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
5821 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
5823 * Theory Library/Commutative_Ring: switched from recdef to function
5824 package; constants add, mul, pow now curried. Infix syntax for
5825 algebraic operations.
5827 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
5830 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
5833 * HOL/records: generalised field-update to take a function on the
5834 field rather than the new value: r(|A := x|) is translated to A_update
5835 (K x) r The K-combinator that is internally used is called K_record.
5836 INCOMPATIBILITY: Usage of the plain update functions has to be
5839 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
5840 * x = 0, which are required for a semiring. Richer structures do not
5841 inherit from semiring_0 anymore, because this property is a theorem
5842 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
5843 there is more to prove, but this is mostly trivial.
5845 * Class "recpower" is generalized to arbitrary monoids, not just
5846 commutative semirings. INCOMPATIBILITY: may need to incorporate
5847 commutativity or semiring properties additionally.
5849 * Constant "List.list_all2" in List.thy now uses authentic syntax.
5850 INCOMPATIBILITY: translations containing list_all2 may go wrong,
5851 better use 'abbreviation'.
5853 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
5855 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
5856 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
5857 significant changes for setting up numeral syntax for types:
5858 - New constants Numeral.pred and Numeral.succ instead
5859 of former Numeral.bin_pred and Numeral.bin_succ.
5860 - Use integer operations instead of bin_add, bin_mult and so on.
5861 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
5862 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
5864 See src/HOL/Integ/IntArith.thy for an example setup.
5866 * Command 'normal_form' computes the normal form of a term that may
5867 contain free variables. For example ``normal_form "rev [a, b, c]"''
5868 produces ``[b, c, a]'' (without proof). This command is suitable for
5869 heavy-duty computations because the functions are compiled to ML
5870 first. Correspondingly, a method "normalization" is provided. See
5871 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
5873 * Alternative iff syntax "A <-> B" for equality on bool (with priority
5874 25 like -->); output depends on the "iff" print_mode, the default is
5875 "A = B" (with priority 50).
5877 * Relations less (<) and less_eq (<=) are also available on type bool.
5878 Modified syntax to disallow nesting without explicit parentheses,
5879 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
5882 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
5884 * Relation composition operator "op O" now has precedence 75 and binds
5885 stronger than union and intersection. INCOMPATIBILITY.
5887 * The old set interval syntax "{m..n(}" (and relatives) has been
5888 removed. Use "{m..<n}" (and relatives) instead.
5890 * In the context of the assumption "~(s = t)" the Simplifier rewrites
5891 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
5892 ``declare [[simproc del: neq]]''.
5894 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
5897 * Theorem Cons_eq_map_conv no longer declared as "simp".
5899 * Theorem setsum_mult renamed to setsum_right_distrib.
5901 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
5904 * Reimplemented methods "sat" and "satx", with several improvements:
5905 goals no longer need to be stated as "<prems> ==> False", equivalences
5906 (i.e. "=" on type bool) are handled, variable names of the form
5907 "lit_<n>" are no longer reserved, significant speedup.
5909 * Methods "sat" and "satx" can now replay MiniSat proof traces.
5910 zChaff is still supported as well.
5912 * 'inductive' and 'datatype': provide projections of mutual rules,
5913 bundled as foo_bar.inducts;
5915 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
5918 * Library: moved theory Accessible_Part to main HOL.
5920 * Library: added theory Coinductive_List of potentially infinite lists
5921 as greatest fixed-point.
5923 * Library: added theory AssocList which implements (finite) maps as
5926 * Method "evaluation" solves goals (i.e. a boolean expression)
5927 efficiently by compiling it to ML. The goal is "proved" (via an
5928 oracle) if it evaluates to True.
5930 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
5931 also when invoked by the simplifier. This results in the Simplifier
5932 being more powerful on arithmetic goals. INCOMPATIBILITY.
5933 Configuration option fast_arith_split_limit=0 recovers the old
5936 * Support for hex (0x20) and binary (0b1001) numerals.
5938 * New method: reify eqs (t), where eqs are equations for an
5939 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
5940 parameter, computes a term s::'b and a list xs::'a list and proves the
5941 theorem I xs s = t. This is also known as reification or quoting. The
5942 resulting theorem is applied to the subgoal to substitute t with I xs
5943 s. If t is omitted, the subgoal itself is reified.
5945 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
5946 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
5947 where f is supposed to be a computable function (in the sense of code
5948 generattion). The method uses reify to compute s and xs as above then
5949 applies corr_thm and uses normalization by evaluation to "prove" f s =
5950 r and finally gets the theorem t = r, which is again applied to the
5951 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
5953 * Reflection: Automatic reification now handels binding, an example is
5954 available in src/HOL/ex/ReflectionEx.thy
5956 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
5957 command 'statespace' that is similar to 'record', but introduces an
5958 abstract specification based on the locale infrastructure instead of
5959 HOL types. This leads to extra flexibility in composing state spaces,
5960 in particular multiple inheritance and renaming of components.
5965 * Hyperreal: Functions root and sqrt are now defined on negative real
5966 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
5967 Nonnegativity side conditions have been removed from many lemmas, so
5968 that more subgoals may now be solved by simplification; potential
5971 * Real: new type classes formalize real normed vector spaces and
5972 algebras, using new overloaded constants scaleR :: real => 'a => 'a
5973 and norm :: 'a => real.
5975 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
5976 reals into other types. The overloaded constant Reals :: 'a set is now
5977 defined as range of_real; potential INCOMPATIBILITY.
5979 * Real: proper support for ML code generation, including 'quickcheck'.
5980 Reals are implemented as arbitrary precision rationals.
5982 * Hyperreal: Several constants that previously worked only for the
5983 reals have been generalized, so they now work over arbitrary vector
5984 spaces. Type annotations may need to be added in some cases; potential
5987 Infinitesimal :: ('a::real_normed_vector) star set
5988 HFinite :: ('a::real_normed_vector) star set
5989 HInfinite :: ('a::real_normed_vector) star set
5990 approx :: ('a::real_normed_vector) star => 'a star => bool
5991 monad :: ('a::real_normed_vector) star => 'a star set
5992 galaxy :: ('a::real_normed_vector) star => 'a star set
5993 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
5994 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
5995 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
5996 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
5997 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
5998 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
5999 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6000 sgn :: 'a::real_normed_vector => 'a
6001 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6003 * Complex: Some complex-specific constants are now abbreviations for
6004 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6005 hnorm. Other constants have been entirely removed in favor of the
6006 polymorphic versions (INCOMPATIBILITY):
6010 HInfinite <-- CInfinite
6011 Infinitesimal <-- CInfinitesimal
6014 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6015 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6016 (ns)deriv <-- (ns)cderiv
6021 * Formalisation of ideals and the quotient construction over rings.
6023 * Order and lattice theory no longer based on records.
6026 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6027 greatest_closed. INCOMPATIBILITY.
6029 * Method algebra is now set up via an attribute. For examples see
6030 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6031 of algebraic structures.
6033 * Renamed theory CRing to Ring.
6038 * Substantial, yet incomplete support for nominal datatypes (binding
6039 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6040 src/HOL/Nominal/Examples. Prospective users should consult
6041 http://isabelle.in.tum.de/nominal/
6046 * ML basics: just one true type int, which coincides with IntInf.int
6049 * ML within Isar: antiquotations allow to embed statically-checked
6050 formal entities in the source, referring to the context available at
6051 compile-time. For example:
6053 ML {* @{sort "{zero,one}"} *}
6054 ML {* @{typ "'a => 'b"} *}
6055 ML {* @{term "%x. x"} *}
6056 ML {* @{prop "x == y"} *}
6057 ML {* @{ctyp "'a => 'b"} *}
6058 ML {* @{cterm "%x. x"} *}
6059 ML {* @{cprop "x == y"} *}
6060 ML {* @{thm asm_rl} *}
6061 ML {* @{thms asm_rl} *}
6062 ML {* @{type_name c} *}
6063 ML {* @{type_syntax c} *}
6064 ML {* @{const_name c} *}
6065 ML {* @{const_syntax c} *}
6068 ML {* @{theory Pure} *}
6069 ML {* @{theory_ref} *}
6070 ML {* @{theory_ref Pure} *}
6073 ML {* @{clasimpset} *}
6075 The same works for sources being ``used'' within an Isar context.
6077 * ML in Isar: improved error reporting; extra verbosity with
6078 ML_Context.trace enabled.
6080 * Pure/General/table.ML: the join operations now works via exceptions
6081 DUP/SAME instead of type option. This is simpler in simple cases, and
6082 admits slightly more efficient complex applications.
6084 * Pure: 'advanced' translation functions (parse_translation etc.) now
6085 use Context.generic instead of just theory.
6087 * Pure: datatype Context.generic joins theory/Proof.context and
6088 provides some facilities for code that works in either kind of
6089 context, notably GenericDataFun for uniform theory and proof data.
6091 * Pure: simplified internal attribute type, which is now always
6092 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6093 local (Proof.context) attributes have been discontinued, while
6094 minimizing code duplication. Thm.rule_attribute and
6095 Thm.declaration_attribute build canonical attributes; see also structure
6096 Context for further operations on Context.generic, notably
6097 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6098 declarations and definitions.
6100 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6101 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6102 init only required for impure data. INCOMPATIBILITY: empty really need
6103 to be empty (no dependencies on theory content!)
6105 * Pure/kernel: consts certification ignores sort constraints given in
6106 signature declarations. (This information is not relevant to the
6107 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6108 potential INCOMPATIBILITY.
6110 * Pure: axiomatic type classes are now purely definitional, with
6111 explicit proofs of class axioms and super class relations performed
6112 internally. See Pure/axclass.ML for the main internal interfaces --
6113 notably AxClass.define_class supercedes AxClass.add_axclass, and
6114 AxClass.axiomatize_class/classrel/arity supersede
6115 Sign.add_classes/classrel/arities.
6117 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6118 global/local versions on theory vs. Proof.context have been
6119 discontinued; Attrib.syntax and Method.syntax have been adapted
6120 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6121 attributes, methods, etc.
6123 * Pure: several functions of signature "... -> theory -> theory * ..."
6124 have been reoriented to "... -> theory -> ... * theory" in order to
6125 allow natural usage in combination with the ||>, ||>>, |-> and
6126 fold_map combinators.
6128 * Pure: official theorem names (closed derivations) and additional
6129 comments (tags) are now strictly separate. Name hints -- which are
6130 maintained as tags -- may be attached any time without affecting the
6133 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6134 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6135 achieve the old behaviour.
6137 * Pure: the "Goal" constant is now called "prop", supporting a
6138 slightly more general idea of ``protecting'' meta-level rule
6141 * Pure: Logic.(un)varify only works in a global context, which is now
6142 enforced instead of silently assumed. INCOMPATIBILITY, may use
6143 Logic.legacy_(un)varify as temporary workaround.
6145 * Pure: structure Name provides scalable operations for generating
6146 internal variable names, notably Name.variants etc. This replaces
6147 some popular functions from term.ML:
6149 Term.variant -> Name.variant
6150 Term.variantlist -> Name.variant_list
6151 Term.invent_names -> Name.invent_list
6153 Note that low-level renaming rarely occurs in new code -- operations
6154 from structure Variable are used instead (see below).
6156 * Pure: structure Variable provides fundamental operations for proper
6157 treatment of fixed/schematic variables in a context. For example,
6158 Variable.import introduces fixes for schematics of given facts and
6159 Variable.export reverses the effect (up to renaming) -- this replaces
6160 various freeze_thaw operations.
6162 * Pure: structure Goal provides simple interfaces for
6163 init/conclude/finish and tactical prove operations (replacing former
6164 Tactic.prove). Goal.prove is the canonical way to prove results
6165 within a given context; Goal.prove_global is a degraded version for
6166 theory level goals, including a global Drule.standard. Note that
6167 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6168 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6169 in a locale context).
6171 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6172 and type checking (Syntax.check_term etc.), with common combinations
6173 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6174 which are considered legacy and await removal.
6176 * Pure/Syntax: generic interfaces for type unchecking
6177 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6178 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6179 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6180 available for convenience, but refer to the very same operations using
6181 a mere theory instead of a full context.
6183 * Isar: simplified treatment of user-level errors, using exception
6184 ERROR of string uniformly. Function error now merely raises ERROR,
6185 without any side effect on output channels. The Isar toplevel takes
6186 care of proper display of ERROR exceptions. ML code may use plain
6187 handle/can/try; cat_error may be used to concatenate errors like this:
6189 ... handle ERROR msg => cat_error msg "..."
6191 Toplevel ML code (run directly or through the Isar toplevel) may be
6192 embedded into the Isar toplevel with exception display/debug like
6195 Isar.toplevel (fn () => ...)
6197 INCOMPATIBILITY, removed special transform_error facilities, removed
6198 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6199 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6200 -- use plain ERROR instead.
6202 * Isar: theory setup now has type (theory -> theory), instead of a
6203 list. INCOMPATIBILITY, may use #> to compose setup functions.
6205 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6206 ProofContext.debug/verbose flags.
6208 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6209 theory before entering a proof state. Transactions now always see a
6210 quasi-functional intermediate checkpoint, both in interactive and
6213 * Isar: simplified interfaces for outer syntax. Renamed
6214 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6215 OuterSyntax.add_parsers -- this functionality is now included in
6216 OuterSyntax.command etc. INCOMPATIBILITY.
6218 * Simplifier: the simpset of a running simplification process now
6219 contains a proof context (cf. Simplifier.the_context), which is the
6220 very context that the initial simpset has been retrieved from (by
6221 simpset_of/local_simpset_of). Consequently, all plug-in components
6222 (solver, looper etc.) may depend on arbitrary proof data.
6224 * Simplifier.inherit_context inherits the proof context (plus the
6225 local bounds) of the current simplification process; any simproc
6226 etc. that calls the Simplifier recursively should do this! Removed
6227 former Simplifier.inherit_bounds, which is already included here --
6228 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6229 specify an explicit context using Simplifier.context/theory_context.
6231 * Simplifier/Classical Reasoner: more abstract interfaces
6232 change_simpset/claset for modifying the simpset/claset reference of a
6233 theory; raw versions simpset/claset_ref etc. have been discontinued --
6236 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6242 * settings: the default heap location within ISABELLE_HOME_USER now
6243 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6244 Isabelle installations.
6246 * isabelle-process: option -S (secure mode) disables some critical
6247 operations, notably runtime compilation and evaluation of ML source
6250 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6252 * Support for parallel execution, using native multicore support of
6253 Poly/ML 5.1. The theory loader exploits parallelism when processing
6254 independent theories, according to the given theory header
6255 specifications. The maximum number of worker threads is specified via
6256 usedir option -M or the "max-threads" setting in Proof General. A
6257 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6258 to 6 on a 8-core machine. User-code needs to observe certain
6259 guidelines for thread-safe programming, see appendix A in the Isar
6260 Implementation manual.
6264 New in Isabelle2005 (October 2005)
6265 ----------------------------------
6269 * Theory headers: the new header syntax for Isar theories is
6272 imports <theory1> ... <theoryN>
6273 uses <file1> ... <fileM>
6276 where the 'uses' part is optional. The previous syntax
6278 theory <name> = <theory1> + ... + <theoryN>:
6280 will disappear in the next release. Use isatool fixheaders to convert
6281 existing theory files. Note that there is no change in ancient
6282 non-Isar theories now, but these will disappear soon.
6284 * Theory loader: parent theories can now also be referred to via
6285 relative and absolute paths.
6287 * Command 'find_theorems' searches for a list of criteria instead of a
6288 list of constants. Known criteria are: intro, elim, dest, name:string,
6289 simp:term, and any term. Criteria can be preceded by '-' to select
6290 theorems that do not match. Intro, elim, dest select theorems that
6291 match the current goal, name:s selects theorems whose fully qualified
6292 name contain s, and simp:term selects all simplification rules whose
6293 lhs match term. Any other term is interpreted as pattern and selects
6294 all theorems matching the pattern. Available in ProofGeneral under
6295 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6297 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6299 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6300 matching the current goal as introduction rule and not having "HOL."
6301 in their name (i.e. not being defined in theory HOL).
6303 * Command 'thms_containing' has been discontinued in favour of
6304 'find_theorems'; INCOMPATIBILITY.
6306 * Communication with Proof General is now 8bit clean, which means that
6307 Unicode text in UTF-8 encoding may be used within theory texts (both
6308 formal and informal parts). Cf. option -U of the Isabelle Proof
6309 General interface. Here are some simple examples (cf. src/HOL/ex):
6311 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6312 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6314 * Improved efficiency of the Simplifier and, to a lesser degree, the
6315 Classical Reasoner. Typical big applications run around 2 times
6319 *** Document preparation ***
6321 * Commands 'display_drafts' and 'print_drafts' perform simple output
6322 of raw sources. Only those symbols that do not require additional
6323 LaTeX packages (depending on comments in isabellesym.sty) are
6324 displayed properly, everything else is left verbatim. isatool display
6325 and isatool print are used as front ends (these are subject to the
6326 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6328 * Command tags control specific markup of certain regions of text,
6329 notably folding and hiding. Predefined tags include "theory" (for
6330 theory begin and end), "proof" for proof commands, and "ML" for
6331 commands involving ML code; the additional tags "visible" and
6332 "invisible" are unused by default. Users may give explicit tag
6333 specifications in the text, e.g. ''by %invisible (auto)''. The
6334 interpretation of tags is determined by the LaTeX job during document
6335 preparation: see option -V of isatool usedir, or options -n and -t of
6336 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6339 Several document versions may be produced at the same time via isatool
6340 usedir (the generated index.html will link all of them). Typical
6341 specifications include ''-V document=theory,proof,ML'' to present
6342 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6343 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6344 these parts without any formal replacement text. The Isabelle site
6345 default settings produce ''document'' and ''outline'' versions as
6348 * Several new antiquotations:
6350 @{term_type term} prints a term with its type annotated;
6352 @{typeof term} prints the type of a term;
6354 @{const const} is the same as @{term const}, but checks that the
6355 argument is a known logical constant;
6357 @{term_style style term} and @{thm_style style thm} print a term or
6358 theorem applying a "style" to it
6362 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6363 definitions, equations, inequations etc., 'concl' printing only the
6364 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6365 to print the specified premise. TermStyle.add_style provides an ML
6366 interface for introducing further styles. See also the "LaTeX Sugar"
6367 document practical applications. The ML antiquotation prints
6368 type-checked ML expressions verbatim.
6370 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6371 and 'text' support optional locale specification '(in loc)', which
6372 specifies the default context for interpreting antiquotations. For
6373 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6375 * Option 'locale=NAME' of antiquotations specifies an alternative
6376 context interpreting the subsequent argument. For example: @{thm
6377 [locale=lattice] inf_assoc}.
6379 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6382 * Proper output of antiquotations for theory commands involving a
6383 proof context (such as 'locale' or 'theorem (in loc) ...').
6385 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6386 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6388 * isatool usedir: new option -C (default true) controls whether option
6389 -D should include a copy of the original document directory; -C false
6390 prevents unwanted effects such as copying of administrative CVS data.
6395 * Considerably improved version of 'constdefs' command. Now performs
6396 automatic type-inference of declared constants; additional support for
6397 local structure declarations (cf. locales and HOL records), see also
6398 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6399 sequential dependencies of definitions within a single 'constdefs'
6400 section; moreover, the declared name needs to be an identifier. If
6401 all fails, consider to fall back on 'consts' and 'defs' separately.
6403 * Improved indexed syntax and implicit structures. First of all,
6404 indexed syntax provides a notational device for subscripted
6405 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6406 expressions. Secondly, in a local context with structure
6407 declarations, number indexes \<^sub>n or the empty index (default
6408 number 1) refer to a certain fixed variable implicitly; option
6409 show_structs controls printing of implicit structures. Typical
6410 applications of these concepts involve record types and locales.
6412 * New command 'no_syntax' removes grammar declarations (and
6413 translations) resulting from the given syntax specification, which is
6414 interpreted in the same manner as for the 'syntax' command.
6416 * 'Advanced' translation functions (parse_translation etc.) may depend
6417 on the signature of the theory context being presently used for
6418 parsing/printing, see also isar-ref manual.
6420 * Improved 'oracle' command provides a type-safe interface to turn an
6421 ML expression of type theory -> T -> term into a primitive rule of
6422 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6423 is already included here); see also FOL/ex/IffExample.thy;
6426 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6427 before); "cI" is no longer bound, use "c.intro" instead.
6428 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6429 axclasses vs. locales.
6431 * Improved internal renaming of symbolic identifiers -- attach primes
6432 instead of base 26 numbers.
6434 * New flag show_question_marks controls printing of leading question
6435 marks in schematic variable names.
6437 * In schematic variable names, *any* symbol following \<^isub> or
6438 \<^isup> is now treated as part of the base name. For example, the
6439 following works without printing of awkward ".0" indexes:
6441 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6444 * Inner syntax includes (*(*nested*) comments*).
6446 * Pretty printer now supports unbreakable blocks, specified in mixfix
6447 annotations as "(00...)".
6449 * Clear separation of logical types and nonterminals, where the latter
6450 may only occur in 'syntax' specifications or type abbreviations.
6451 Before that distinction was only partially implemented via type class
6452 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6453 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6454 exotic syntax specifications may require further adaption
6455 (e.g. Cube/Cube.thy).
6457 * Removed obsolete type class "logic", use the top sort {} instead.
6458 Note that non-logical types should be declared as 'nonterminals'
6459 rather than 'types'. INCOMPATIBILITY for new object-logic
6462 * Attributes 'induct' and 'cases': type or set names may now be
6463 locally fixed variables as well.
6465 * Simplifier: can now control the depth to which conditional rewriting
6466 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6469 * Simplifier: simplification procedures may now take the current
6470 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6471 interface), which is very useful for calling the Simplifier
6472 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6473 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6474 low-level mk_simproc no longer applies Logic.varify internally, to
6475 allow for use in a context of fixed variables.
6477 * thin_tac now works even if the assumption being deleted contains !!
6478 or ==>. More generally, erule now works even if the major premise of
6479 the elimination rule contains !! or ==>.
6481 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6483 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6484 from Pure, which contains all common declarations already. Both
6485 theories are defined via plain Isabelle/Isar .thy files.
6486 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6487 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6488 use isatool fixcpure to adapt your theory and ML sources.
6490 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6491 selections of theorems in named facts via index ranges.
6493 * 'print_theorems': in theory mode, really print the difference
6494 wrt. the last state (works for interactive theory development only),
6495 in proof mode print all local facts (cf. 'print_facts');
6497 * 'hide': option '(open)' hides only base names.
6499 * More efficient treatment of intermediate checkpoints in interactive
6502 * Code generator is now invoked via code_module (incremental code
6503 generation) and code_library (modular code generation, ML structures
6504 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6505 must be quoted when used as identifiers.
6507 * New 'value' command for reading, evaluating and printing terms using
6508 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6509 quoted when used as identifier.
6514 * New commands for the interpretation of locale expressions in
6515 theories (1), locales (2) and proof contexts (3). These generate
6516 proof obligations from the expression specification. After the
6517 obligations have been discharged, theorems of the expression are added
6518 to the theory, target locale or proof context. The synopsis of the
6519 commands is a follows:
6521 (1) interpretation expr inst
6522 (2) interpretation target < expr
6523 (3) interpret expr inst
6525 Interpretation in theories and proof contexts require a parameter
6526 instantiation of terms from the current context. This is applied to
6527 specifications and theorems of the interpreted expression.
6528 Interpretation in locales only permits parameter renaming through the
6529 locale expression. Interpretation is smart in that interpretations
6530 that are active already do not occur in proof obligations, neither are
6531 instantiated theorems stored in duplicate. Use 'print_interps' to
6532 inspect active interpretations of a particular locale. For details,
6533 see the Isar Reference manual. Examples can be found in
6534 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6536 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6537 'interpret' instead.
6539 * New context element 'constrains' for adding type constraints to
6542 * Context expressions: renaming of parameters with syntax
6545 * Locale declaration: 'includes' disallowed.
6547 * Proper static binding of attribute syntax -- i.e. types / terms /
6548 facts mentioned as arguments are always those of the locale definition
6549 context, independently of the context of later invocations. Moreover,
6550 locale operations (renaming and type / term instantiation) are applied
6551 to attribute arguments as expected.
6553 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6554 actual attributes; rare situations may require Attrib.attribute to
6555 embed those attributes into Attrib.src that lack concrete syntax.
6556 Attribute implementations need to cooperate properly with the static
6557 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6558 Attrib.XXX_thm etc. already do the right thing without further
6559 intervention. Only unusual applications -- such as "where" or "of"
6560 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6561 on the context and the facts involved -- may have to assign parsed
6562 values to argument tokens explicitly.
6564 * Changed parameter management in theorem generation for long goal
6565 statements with 'includes'. INCOMPATIBILITY: produces a different
6566 theorem statement in rare situations.
6568 * Locale inspection command 'print_locale' omits notes elements. Use
6569 'print_locale!' to have them included in the output.
6574 * Provers/hypsubst.ML: improved version of the subst method, for
6575 single-step rewriting: it now works in bound variable contexts. New is
6576 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6577 rewrite a different subterm than the original subst method, which is
6578 still available as 'simplesubst'.
6580 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6583 * Provers/trancl.ML: new transitivity reasoner for transitive and
6584 reflexive-transitive closure of relations.
6586 * Provers/blast.ML: new reference depth_limit to make blast's depth
6587 limit (previously hard-coded with a value of 20) user-definable.
6589 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6590 is peformed already. Object-logics merely need to finish their
6591 initial simpset configuration as before. INCOMPATIBILITY.
6596 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6599 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6601 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6602 and x-symbol; use option '-m epsilon' to get it actually printed.
6603 Moreover, the mathematically important symbolic identifier \<epsilon>
6604 becomes available as variable, constant etc. INCOMPATIBILITY,
6606 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6607 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6608 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6609 support corresponding Isar calculations.
6611 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6614 * theory SetInterval: changed the syntax for open intervals:
6623 The old syntax is still supported but will disappear in the next
6624 release. For conversion use the following Emacs search and replace
6625 patterns (these are not perfect but work quite well):
6627 {)\([^\.]*\)\.\. -> {\1<\.\.}
6628 \.\.\([^(}]*\)(} -> \.\.<\1}
6630 * Theory Commutative_Ring (in Library): method comm_ring for proving
6631 equalities in commutative rings; method 'algebra' provides a generic
6634 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6635 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6636 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6639 Some new syntax forms are available:
6641 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6642 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6643 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6644 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6646 The latter form "\<Sum>x < k. e" used to be based on a separate
6647 function "Summation", which has been discontinued.
6649 * theory Finite_Set: in structured induction proofs, the insert case
6650 is now 'case (insert x F)' instead of the old counterintuitive 'case
6653 * The 'refute' command has been extended to support a much larger
6654 fragment of HOL, including axiomatic type classes, constdefs and
6655 typedefs, inductive datatypes and recursion.
6657 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6658 Requires zChaff with proof generation to be installed. See
6659 HOL/ex/SAT_Examples.thy for examples.
6661 * Datatype induction via method 'induct' now preserves the name of the
6662 induction variable. For example, when proving P(xs::'a list) by
6663 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6664 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6665 in unstructured proof scripts.
6667 * Reworked implementation of records. Improved scalability for
6668 records with many fields, avoiding performance problems for type
6669 inference. Records are no longer composed of nested field types, but
6670 of nested extension types. Therefore the record type only grows linear
6671 in the number of extensions and not in the number of fields. The
6672 top-level (users) view on records is preserved. Potential
6673 INCOMPATIBILITY only in strange cases, where the theory depends on the
6674 old record representation. The type generated for a record is called
6675 <record_name>_ext_type.
6677 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6678 proofs triggered by a record definition or a simproc (if
6679 quick_and_dirty is enabled). Definitions of large records can take
6682 New simproc record_upd_simproc for simplification of multiple record
6683 updates enabled by default. Moreover, trivial updates are also
6684 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6685 occasionally, since simplification is more powerful by default.
6687 * typedef: proper support for polymorphic sets, which contain extra
6688 type-variables in the term.
6690 * Simplifier: automatically reasons about transitivity chains
6691 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
6692 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
6693 old proofs break occasionally as simplification may now solve more
6694 goals than previously.
6696 * Simplifier: converts x <= y into x = y if assumption y <= x is
6697 present. Works for all partial orders (class "order"), in particular
6698 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
6701 * Simplifier: new simproc for "let x = a in f x". If a is a free or
6702 bound variable or a constant then the let is unfolded. Otherwise
6703 first a is simplified to b, and then f b is simplified to g. If
6704 possible we abstract b from g arriving at "let x = b in h x",
6705 otherwise we unfold the let and arrive at g. The simproc can be
6706 enabled/disabled by the reference use_let_simproc. Potential
6707 INCOMPATIBILITY since simplification is more powerful by default.
6709 * Classical reasoning: the meson method now accepts theorems as arguments.
6711 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
6712 jobs to provide advice on the provability of subgoals.
6714 * Theory OrderedGroup and Ring_and_Field: various additions and
6715 improvements to faciliate calculations involving equalities and
6718 The following theorems have been eliminated or modified
6721 abs_eq now named abs_of_nonneg
6722 abs_of_ge_0 now named abs_of_nonneg
6723 abs_minus_eq now named abs_of_nonpos
6724 imp_abs_id now named abs_of_nonneg
6725 imp_abs_neg_id now named abs_of_nonpos
6726 mult_pos now named mult_pos_pos
6727 mult_pos_le now named mult_nonneg_nonneg
6728 mult_pos_neg_le now named mult_nonneg_nonpos
6729 mult_pos_neg2_le now named mult_nonneg_nonpos2
6730 mult_neg now named mult_neg_neg
6731 mult_neg_le now named mult_nonpos_nonpos
6733 * The following lemmas in Ring_and_Field have been added to the simplifier:
6736 not_square_less_zero
6738 The following lemmas have been deleted from Real/RealPow:
6748 * Theory Parity: added rules for simplifying exponents.
6752 The following theorems have been eliminated or modified
6755 list_all_Nil now named list_all.simps(1)
6756 list_all_Cons now named list_all.simps(2)
6757 list_all_conv now named list_all_iff
6758 set_mem_eq now named mem_iff
6760 * Theories SetsAndFunctions and BigO (see HOL/Library) support
6761 asymptotic "big O" calculations. See the notes in BigO.thy.
6766 * Theory RealDef: better support for embedding natural numbers and
6767 integers in the reals.
6769 The following theorems have been eliminated or modified
6772 exp_ge_add_one_self now requires no hypotheses
6773 real_of_int_add reversed direction of equality (use [symmetric])
6774 real_of_int_minus reversed direction of equality (use [symmetric])
6775 real_of_int_diff reversed direction of equality (use [symmetric])
6776 real_of_int_mult reversed direction of equality (use [symmetric])
6778 * Theory RComplete: expanded support for floor and ceiling functions.
6780 * Theory Ln is new, with properties of the natural logarithm
6782 * Hyperreal: There is a new type constructor "star" for making
6783 nonstandard types. The old type names are now type synonyms:
6787 hcomplex = complex star
6789 * Hyperreal: Many groups of similarly-defined constants have been
6790 replaced by polymorphic versions (INCOMPATIBILITY):
6792 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
6794 starset <-- starsetNat, starsetC
6795 *s* <-- *sNat*, *sc*
6796 starset_n <-- starsetNat_n, starsetC_n
6797 *sn* <-- *sNatn*, *scn*
6798 InternalSets <-- InternalNatSets, InternalCSets
6800 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6801 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
6802 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
6803 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
6804 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
6806 * Hyperreal: Many type-specific theorems have been removed in favor of
6807 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
6809 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
6810 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
6811 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
6812 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
6813 right_minus <-- hypreal_add_minus
6814 left_minus <-- {hypreal,hcomplex}_add_minus_left
6815 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
6816 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
6817 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
6818 mult_1_right <-- hcomplex_mult_one_right
6819 mult_zero_left <-- hcomplex_mult_zero_left
6820 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
6821 right_distrib <-- hypnat_add_mult_distrib2
6822 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
6823 right_inverse <-- hypreal_mult_inverse
6824 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
6825 order_refl <-- {hypreal,hypnat}_le_refl
6826 order_trans <-- {hypreal,hypnat}_le_trans
6827 order_antisym <-- {hypreal,hypnat}_le_anti_sym
6828 order_less_le <-- {hypreal,hypnat}_less_le
6829 linorder_linear <-- {hypreal,hypnat}_le_linear
6830 add_left_mono <-- {hypreal,hypnat}_add_left_mono
6831 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
6832 add_nonneg_nonneg <-- hypreal_le_add_order
6834 * Hyperreal: Separate theorems having to do with type-specific
6835 versions of constants have been merged into theorems that apply to the
6836 new polymorphic constants (INCOMPATIBILITY):
6838 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
6839 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
6840 STAR_Un <-- {STAR,NatStar,STARC}_Un
6841 STAR_Int <-- {STAR,NatStar,STARC}_Int
6842 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
6843 STAR_subset <-- {STAR,NatStar,STARC}_subset
6844 STAR_mem <-- {STAR,NatStar,STARC}_mem
6845 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
6846 STAR_diff <-- {STAR,STARC}_diff
6847 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
6848 STARC_hcomplex_of_complex}_image_subset
6849 starset_n_Un <-- starset{Nat,C}_n_Un
6850 starset_n_Int <-- starset{Nat,C}_n_Int
6851 starset_n_Compl <-- starset{Nat,C}_n_Compl
6852 starset_n_diff <-- starset{Nat,C}_n_diff
6853 InternalSets_Un <-- Internal{Nat,C}Sets_Un
6854 InternalSets_Int <-- Internal{Nat,C}Sets_Int
6855 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
6856 InternalSets_diff <-- Internal{Nat,C}Sets_diff
6857 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
6858 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
6859 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
6860 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
6861 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
6862 starfun <-- starfun{Nat,Nat2,C,RC,CR}
6863 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
6864 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
6865 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
6866 starfun_diff <-- starfun{C,RC,CR}_diff
6867 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
6868 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
6869 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
6870 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
6871 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
6872 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
6873 starfun_Id <-- starfunC_Id
6874 starfun_approx <-- starfun{Nat,CR}_approx
6875 starfun_capprox <-- starfun{C,RC}_capprox
6876 starfun_abs <-- starfunNat_rabs
6877 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
6878 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
6879 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
6880 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
6881 starfun_add_capprox <-- starfun{C,RC}_add_capprox
6882 starfun_add_approx <-- starfunCR_add_approx
6883 starfun_inverse_inverse <-- starfunC_inverse_inverse
6884 starfun_divide <-- starfun{C,CR,RC}_divide
6885 starfun_n <-- starfun{Nat,C}_n
6886 starfun_n_mult <-- starfun{Nat,C}_n_mult
6887 starfun_n_add <-- starfun{Nat,C}_n_add
6888 starfun_n_add_minus <-- starfunNat_n_add_minus
6889 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
6890 starfun_n_minus <-- starfun{Nat,C}_n_minus
6891 starfun_n_eq <-- starfun{Nat,C}_n_eq
6893 star_n_add <-- {hypreal,hypnat,hcomplex}_add
6894 star_n_minus <-- {hypreal,hcomplex}_minus
6895 star_n_diff <-- {hypreal,hcomplex}_diff
6896 star_n_mult <-- {hypreal,hcomplex}_mult
6897 star_n_inverse <-- {hypreal,hcomplex}_inverse
6898 star_n_le <-- {hypreal,hypnat}_le
6899 star_n_less <-- {hypreal,hypnat}_less
6900 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
6901 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
6902 star_n_abs <-- hypreal_hrabs
6903 star_n_divide <-- hcomplex_divide
6905 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
6906 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
6907 star_of_diff <-- hypreal_of_real_diff
6908 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
6909 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
6910 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
6911 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
6912 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
6913 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
6914 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
6915 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
6916 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
6917 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
6918 star_of_number_of <-- {hypreal,hcomplex}_number_of
6919 star_of_number_less <-- number_of_less_hypreal_of_real_iff
6920 star_of_number_le <-- number_of_le_hypreal_of_real_iff
6921 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
6922 star_of_less_number <-- hypreal_of_real_less_number_of_iff
6923 star_of_le_number <-- hypreal_of_real_le_number_of_iff
6924 star_of_power <-- hypreal_of_real_power
6925 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
6927 * Hyperreal: new method "transfer" that implements the transfer
6928 principle of nonstandard analysis. With a subgoal that mentions
6929 nonstandard types like "'a star", the command "apply transfer"
6930 replaces it with an equivalent one that mentions only standard types.
6931 To be successful, all free variables must have standard types; non-
6932 standard variables must have explicit universal quantifiers.
6934 * Hyperreal: A theory of Taylor series.
6939 * Discontinued special version of 'constdefs' (which used to support
6940 continuous functions) in favor of the general Pure one with full
6943 * New simplification procedure for solving continuity conditions; it
6944 is much faster on terms with many nested lambda abstractions (cubic
6945 instead of exponential time).
6947 * New syntax for domain package: selector names are now optional.
6948 Parentheses should be omitted unless argument is lazy, for example:
6950 domain 'a stream = cons "'a" (lazy "'a stream")
6952 * New command 'fixrec' for defining recursive functions with pattern
6953 matching; defining multiple functions with mutual recursion is also
6954 supported. Patterns may include the constants cpair, spair, up, sinl,
6955 sinr, or any data constructor defined by the domain package. The given
6956 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
6957 syntax and examples.
6959 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
6960 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
6961 but the proof obligation additionally includes an admissibility
6962 requirement. The packages generate instances of class cpo or pcpo,
6963 with continuity and strictness theorems for Rep and Abs.
6965 * HOLCF: Many theorems have been renamed according to a more standard naming
6966 scheme (INCOMPATIBILITY):
6968 foo_inject: "foo$x = foo$y ==> x = y"
6969 foo_eq: "(foo$x = foo$y) = (x = y)"
6970 foo_less: "(foo$x << foo$y) = (x << y)"
6971 foo_strict: "foo$UU = UU"
6972 foo_defined: "... ==> foo$x ~= UU"
6973 foo_defined_iff: "(foo$x = UU) = (x = UU)"
6978 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
6979 including the First Isomorphism Theorem (on quotienting by the kernel
6982 * ZF/Simplifier: install second copy of type solver that actually
6983 makes use of TC rules declared to Isar proof contexts (or locales);
6984 the old version is still required for ML proof scripts.
6989 * Converted to Isar theory format; use locales instead of axiomatic
6995 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
6998 * Pure/library.ML no longer defines its own option datatype, but uses
6999 that of the SML basis, which has constructors NONE and SOME instead of
7000 None and Some, as well as exception Option.Option instead of OPTION.
7001 The functions the, if_none, is_some, is_none have been adapted
7002 accordingly, while Option.map replaces apsome.
7004 * Pure/library.ML: the exception LIST has been given up in favour of
7005 the standard exceptions Empty and Subscript, as well as
7006 Library.UnequalLengths. Function like Library.hd and Library.tl are
7007 superceded by the standard hd and tl functions etc.
7009 A number of basic list functions are no longer exported to the ML
7010 toplevel, as they are variants of predefined functions. The following
7011 suggests how one can translate existing code:
7013 rev_append xs ys = List.revAppend (xs, ys)
7014 nth_elem (i, xs) = List.nth (xs, i)
7015 last_elem xs = List.last xs
7016 flat xss = List.concat xss
7017 seq fs = List.app fs
7018 partition P xs = List.partition P xs
7019 mapfilter f xs = List.mapPartial f xs
7021 * Pure/library.ML: several combinators for linear functional
7022 transformations, notably reverse application and composition:
7025 (x, y) |-> f f #-> g
7027 * Pure/library.ML: introduced/changed precedence of infix operators:
7029 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7031 infix 3 o oo ooo oooo;
7032 infix 4 ~~ upto downto;
7034 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7037 * Pure/library.ML: natural list combinators fold, fold_rev, and
7038 fold_map support linear functional transformations and nesting. For
7041 fold f [x1, ..., xN] y =
7042 y |> f x1 |> ... |> f xN
7044 (fold o fold) f [xs1, ..., xsN] y =
7045 y |> fold f xs1 |> ... |> fold f xsN
7047 fold f [x1, ..., xN] =
7050 (fold o fold) f [xs1, ..., xsN] =
7051 fold f xs1 #> ... #> fold f xsN
7053 * Pure/library.ML: the following selectors on type 'a option are
7056 the: 'a option -> 'a (*partial*)
7057 these: 'a option -> 'a where 'a = 'b list
7058 the_default: 'a -> 'a option -> 'a
7059 the_list: 'a option -> 'a list
7061 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7062 basic operations for association lists, following natural argument
7063 order; moreover the explicit equality predicate passed here avoids
7064 potentially expensive polymorphic runtime equality checks.
7065 The old functions may be expressed as follows:
7067 assoc = uncurry (AList.lookup (op =))
7068 assocs = these oo AList.lookup (op =)
7069 overwrite = uncurry (AList.update (op =)) o swap
7071 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7073 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7074 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7076 replacing make_keylist and keyfilter (occassionally used)
7079 make_keylist = AList.make
7080 keyfilter = AList.find (op =)
7082 * eq_fst and eq_snd now take explicit equality parameter, thus
7083 avoiding eqtypes. Naive rewrites:
7085 eq_fst = eq_fst (op =)
7086 eq_snd = eq_snd (op =)
7088 * Removed deprecated apl and apr (rarely used).
7091 apl (n, op) =>>= curry op n
7092 apr (op, m) =>>= fn n => op (n, m)
7094 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7095 provides a reasonably efficient light-weight implementation of sets as
7098 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7099 few new operations; existing lookup and update are now curried to
7100 follow natural argument order (for use with fold etc.);
7101 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7103 * Pure/General: output via the Isabelle channels of
7104 writeln/warning/error etc. is now passed through Output.output, with a
7105 hook for arbitrary transformations depending on the print_mode
7106 (cf. Output.add_mode -- the first active mode that provides a output
7107 function wins). Already formatted output may be embedded into further
7108 text via Output.raw; the result of Pretty.string_of/str_of and derived
7109 functions (string_of_term/cterm/thm etc.) is already marked raw to
7110 accommodate easy composition of diagnostic messages etc. Programmers
7111 rarely need to care about Output.output or Output.raw at all, with
7112 some notable exceptions: Output.output is required when bypassing the
7113 standard channels (writeln etc.), or in token translations to produce
7114 properly formatted results; Output.raw is required when capturing
7115 already output material that will eventually be presented to the user
7116 a second time. For the default print mode, both Output.output and
7117 Output.raw have no effect.
7119 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7120 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7121 cumulative results are displayed at the end of a batch session.
7123 * Pure/General: File.sysify_path and File.quote_sysify path have been
7124 replaced by File.platform_path and File.shell_path (with appropriate
7125 hooks). This provides a clean interface for unusual systems where the
7126 internal and external process view of file names are different.
7128 * Pure: more efficient orders for basic syntactic entities: added
7129 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7130 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7131 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7132 orders now -- potential INCOMPATIBILITY for code that depends on a
7133 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7134 Library.sort_strings on result).
7136 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7137 fold_types traverse types/terms from left to right, observing natural
7138 argument order. Supercedes previous foldl_XXX versions, add_frees,
7139 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7141 * Pure: name spaces have been refined, with significant changes of the
7142 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7143 to extern(_table). The plain name entry path is superceded by a
7144 general 'naming' context, which also includes the 'policy' to produce
7145 a fully qualified name and external accesses of a fully qualified
7146 name; NameSpace.extend is superceded by context dependent
7147 Sign.declare_name. Several theory and proof context operations modify
7148 the naming context. Especially note Theory.restore_naming and
7149 ProofContext.restore_naming to get back to a sane state; note that
7150 Theory.add_path is no longer sufficient to recover from
7151 Theory.absolute_path in particular.
7153 * Pure: new flags short_names (default false) and unique_names
7154 (default true) for controlling output of qualified names. If
7155 short_names is set, names are printed unqualified. If unique_names is
7156 reset, the name prefix is reduced to the minimum required to achieve
7157 the original result when interning again, even if there is an overlap
7158 with earlier declarations.
7160 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7161 now 'extend', and 'merge' gets an additional Pretty.pp argument
7162 (useful for printing error messages). INCOMPATIBILITY.
7164 * Pure: major reorganization of the theory context. Type Sign.sg and
7165 Theory.theory are now identified, referring to the universal
7166 Context.theory (see Pure/context.ML). Actual signature and theory
7167 content is managed as theory data. The old code and interfaces were
7168 spread over many files and structures; the new arrangement introduces
7169 considerable INCOMPATIBILITY to gain more clarity:
7171 Context -- theory management operations (name, identity, inclusion,
7172 parents, ancestors, merge, etc.), plus generic theory data;
7174 Sign -- logical signature and syntax operations (declaring consts,
7175 types, etc.), plus certify/read for common entities;
7177 Theory -- logical theory operations (stating axioms, definitions,
7178 oracles), plus a copy of logical signature operations (consts,
7179 types, etc.); also a few basic management operations (Theory.copy,
7182 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7183 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7184 for convenience -- they merely return the theory.
7186 * Pure: type Type.tsig is superceded by theory in most interfaces.
7188 * Pure: the Isar proof context type is already defined early in Pure
7189 as Context.proof (note that ProofContext.context and Proof.context are
7190 aliases, where the latter is the preferred name). This enables other
7191 Isabelle components to refer to that type even before Isar is present.
7193 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7194 typeK, constK, axiomK, oracleK), but provide explicit operations for
7195 any of these kinds. For example, Sign.intern typeK is now
7196 Sign.intern_type, Theory.hide_space Sign.typeK is now
7197 Theory.hide_types. Also note that former
7198 Theory.hide_classes/types/consts are now
7199 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7200 internalize their arguments! INCOMPATIBILITY.
7202 * Pure: get_thm interface (of PureThy and ProofContext) expects
7203 datatype thmref (with constructors Name and NameSelection) instead of
7204 plain string -- INCOMPATIBILITY;
7206 * Pure: cases produced by proof methods specify options, where NONE
7207 means to remove case bindings -- INCOMPATIBILITY in
7210 * Pure: the following operations retrieve axioms or theorems from a
7211 theory node or theory hierarchy, respectively:
7213 Theory.axioms_of: theory -> (string * term) list
7214 Theory.all_axioms_of: theory -> (string * term) list
7215 PureThy.thms_of: theory -> (string * thm) list
7216 PureThy.all_thms_of: theory -> (string * thm) list
7218 * Pure: print_tac now outputs the goal through the trace channel.
7220 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7221 Reference Toplevel.debug (default false) controls detailed printing
7222 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7223 controls execution profiling -- set to 1 for time and 2 for space
7224 (both increase the runtime).
7226 * Isar session: The initial use of ROOT.ML is now always timed,
7227 i.e. the log will show the actual process times, in contrast to the
7228 elapsed wall-clock time that the outer shell wrapper produces.
7230 * Simplifier: improved handling of bound variables (nameless
7231 representation, avoid allocating new strings). Simprocs that invoke
7232 the Simplifier recursively should use Simplifier.inherit_bounds to
7233 avoid local name clashes. Failure to do so produces warnings
7234 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7235 for further details.
7237 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7238 bindings for all theorems stored within a given theory; this may help
7239 in porting non-Isar theories to Isar ones, while keeping ML proof
7240 scripts for the time being.
7242 * ML operator HTML.with_charset specifies the charset begin used for
7243 generated HTML files. For example:
7245 HTML.with_charset "utf-8" use_thy "Hebrew";
7246 HTML.with_charset "utf-8" use_thy "Chinese";
7251 * Allow symlinks to all proper Isabelle executables (Isabelle,
7252 isabelle, isatool etc.).
7254 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7255 isatool doc, isatool mkdir, display_drafts etc.).
7257 * isatool usedir: option -f allows specification of the ML file to be
7258 used by Isabelle; default is ROOT.ML.
7260 * New isatool version outputs the version identifier of the Isabelle
7261 distribution being used.
7263 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7264 (containing Boolean satisfiability problems) into Isabelle/HOL
7269 New in Isabelle2004 (April 2004)
7270 --------------------------------
7274 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7275 Replaces linorder.ML.
7277 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7278 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7279 (\<a>...\<z>), are now considered normal letters, and can therefore
7280 be used anywhere where an ASCII letter (a...zA...Z) has until
7281 now. COMPATIBILITY: This obviously changes the parsing of some
7282 terms, especially where a symbol has been used as a binder, say
7283 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7284 as an identifier. Fix it by inserting a space around former
7285 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7286 existing theory and ML files.
7288 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7290 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7291 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7292 a normal (but invisible) letter. For multiple letter subscripts repeat
7293 \<^isub> like this: x\<^isub>1\<^isub>2.
7295 * Pure: There are now sub-/superscripts that can span more than one
7296 character. Text between \<^bsub> and \<^esub> is set in subscript in
7297 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7298 superscript. The new control characters are not identifier parts.
7300 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7301 content of "..." to the latex file instead of \isacntrl... . The "..."
7302 may consist of any printable characters excluding the end bracket >.
7304 * Pure: Using new Isar command "finalconsts" (or the ML functions
7305 Theory.add_finals or Theory.add_finals_i) it is now possible to
7306 declare constants "final", which prevents their being given a definition
7307 later. It is useful for constants whose behaviour is fixed axiomatically
7308 rather than definitionally, such as the meta-logic connectives.
7310 * Pure: 'instance' now handles general arities with general sorts
7311 (i.e. intersections of classes),
7313 * Presentation: generated HTML now uses a CSS style sheet to make layout
7314 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7315 It can be changed to alter the colors/layout of generated pages.
7320 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7321 cut_tac, subgoal_tac and thin_tac:
7322 - Now understand static (Isar) contexts. As a consequence, users of Isar
7323 locales are no longer forced to write Isar proof scripts.
7324 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7326 - INCOMPATIBILITY: names of variables to be instantiated may no
7327 longer be enclosed in quotes. Instead, precede variable name with `?'.
7328 This is consistent with the instantiation attribute "where".
7330 * Attributes "where" and "of":
7331 - Now take type variables of instantiated theorem into account when reading
7332 the instantiation string. This fixes a bug that caused instantiated
7333 theorems to have too special types in some circumstances.
7334 - "where" permits explicit instantiations of type variables.
7336 * Calculation commands "moreover" and "also" no longer interfere with
7337 current facts ("this"), admitting arbitrary combinations with "then"
7341 - Goal statements involving the context element "includes" no longer
7342 generate theorems with internal delta predicates (those ending on
7343 "_axioms") in the premise.
7344 Resolve particular premise with <locale>.intro to obtain old form.
7345 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7346 specification and "includes" elements in goal statement.
7347 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7348 [intro?] and [elim?] (respectively) by default.
7349 - Experimental command for instantiation of locales in proof contexts:
7350 instantiate <label>[<attrs>]: <loc>
7351 Instantiates locale <loc> and adds all its theorems to the current context
7352 taking into account their attributes. Label and attrs are optional
7353 modifiers, like in theorem declarations. If present, names of
7354 instantiated theorems are qualified with <label>, and the attributes
7355 <attrs> are applied after any attributes these theorems might have already.
7356 If the locale has assumptions, a chained fact of the form
7357 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7358 are derived. The command does not support old-style locales declared
7359 with "locale (open)".
7360 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7362 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7368 * Proof import: new image HOL4 contains the imported library from
7369 the HOL4 system with about 2500 theorems. It is imported by
7370 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7371 can be used like any other Isabelle image. See
7372 HOL/Import/HOL/README for more information.
7375 - Much improved handling of linear and partial orders.
7376 Reasoners for linear and partial orders are set up for type classes
7377 "linorder" and "order" respectively, and are added to the default simpset
7378 as solvers. This means that the simplifier can build transitivity chains
7379 to solve goals from the assumptions.
7380 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7381 of blast or auto after simplification become unnecessary because the goal
7382 is solved by simplification already.
7384 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7385 all proved in axiomatic type classes for semirings, rings and fields.
7388 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7389 now formalized using the Ring_and_Field theory mentioned above.
7390 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7391 than before, because now they are set up once in a generic manner.
7392 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7393 Look for the general versions in Ring_and_Field (and Power if they concern
7396 * Type "rat" of the rational numbers is now available in HOL-Complex.
7399 - Record types are now by default printed with their type abbreviation
7400 instead of the list of all field types. This can be configured via
7401 the reference "print_record_type_abbr".
7402 - Simproc "record_upd_simproc" for simplification of multiple updates added
7403 (not enabled by default).
7404 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7405 EX x. x = sel r to True (not enabled by default).
7406 - Tactic "record_split_simp_tac" to split and simplify records added.
7408 * 'specification' command added, allowing for definition by
7409 specification. There is also an 'ax_specification' command that
7410 introduces the new constants axiomatically.
7412 * arith(_tac) is now able to generate counterexamples for reals as well.
7414 * HOL-Algebra: new locale "ring" for non-commutative rings.
7416 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7417 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7419 * HOL-Matrix: a first theory for matrices in HOL with an application of
7420 matrix theory to linear programming.
7422 * Unions and Intersections:
7423 The latex output syntax of UN and INT has been changed
7424 from "\Union x \in A. B" to "\Union_{x \in A} B"
7425 i.e. the index formulae has become a subscript.
7426 Similarly for "\Union x. B", and for \Inter instead of \Union.
7428 * Unions and Intersections over Intervals:
7429 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7430 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7431 like in normal math, and corresponding versions for < and for intersection.
7433 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7434 lexicographic dictonary ordering has been added as "lexord".
7436 * ML: the legacy theory structures Int and List have been removed. They had
7437 conflicted with ML Basis Library structures having the same names.
7439 * 'refute' command added to search for (finite) countermodels. Only works
7440 for a fragment of HOL. The installation of an external SAT solver is
7441 highly recommended. See "HOL/Refute.thy" for details.
7443 * 'quickcheck' command: Allows to find counterexamples by evaluating
7444 formulae under an assignment of free variables to random values.
7445 In contrast to 'refute', it can deal with inductive datatypes,
7446 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7452 * Streams now come with concatenation and are part of the HOLCF image
7456 New in Isabelle2003 (May 2003)
7457 ------------------------------
7461 * Provers/simplifier:
7463 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7464 Assumptions are now subject to complete mutual simplification,
7465 not just from left to right. The simplifier now preserves
7466 the order of assumptions.
7468 Potential INCOMPATIBILITY:
7470 -- simp sometimes diverges where the old version did
7471 not, e.g. invoking simp on the goal
7473 [| P (f x); y = x; f x = f y |] ==> Q
7475 now gives rise to the infinite reduction sequence
7477 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7479 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7482 -- Tactics combining classical reasoner and simplification (such as auto)
7483 are also affected by this change, because many of them rely on
7484 simp. They may sometimes diverge as well or yield a different numbers
7485 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7486 in case of problems. Sometimes subsequent calls to the classical
7487 reasoner will fail because a preceeding call to the simplifier too
7488 eagerly simplified the goal, e.g. deleted redundant premises.
7490 - The simplifier trace now shows the names of the applied rewrite rules
7492 - You can limit the number of recursive invocations of the simplifier
7493 during conditional rewriting (where the simplifie tries to solve the
7494 conditions before applying the rewrite rule):
7495 ML "simp_depth_limit := n"
7496 where n is an integer. Thus you can force termination where previously
7497 the simplifier would diverge.
7499 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7501 - No longer aborts on failed congruence proof. Instead, the
7502 congruence is ignored.
7504 * Pure: New generic framework for extracting programs from constructive
7505 proofs. See HOL/Extraction.thy for an example instantiation, as well
7506 as HOL/Extraction for some case studies.
7508 * Pure: The main goal of the proof state is no longer shown by default, only
7509 the subgoals. This behaviour is controlled by a new flag.
7510 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7511 (ML: Proof.show_main_goal).
7513 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7514 rules whose conclusion matches subgoal 1:
7515 PG menu: Isabelle/Isar -> Show me -> matching rules
7516 The rules are ordered by how closely they match the subgoal.
7517 In particular, rules that solve a subgoal outright are displayed first
7518 (or rather last, the way they are printed).
7519 (ML: ProofGeneral.print_intros())
7521 * Pure: New flag trace_unify_fail causes unification to print
7522 diagnostic information (PG: in trace buffer) when it fails. This is
7523 useful for figuring out why single step proofs like rule, erule or
7526 * Pure: Locale specifications now produce predicate definitions
7527 according to the body of text (covering assumptions modulo local
7528 definitions); predicate "loc_axioms" covers newly introduced text,
7529 while "loc" is cumulative wrt. all included locale expressions; the
7530 latter view is presented only on export into the global theory
7531 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7532 on the old view without predicates;
7534 * Pure: predefined locales "var" and "struct" are useful for sharing
7535 parameters (as in CASL, for example); just specify something like
7536 ``var x + var y + struct M'' as import;
7538 * Pure: improved thms_containing: proper indexing of facts instead of
7539 raw theorems; check validity of results wrt. current name space;
7540 include local facts of proof configuration (also covers active
7541 locales), cover fixed variables in index; may use "_" in term
7542 specification; an optional limit for the number of printed facts may
7543 be given (the default is 40);
7545 * Pure: disallow duplicate fact bindings within new-style theory files
7548 * Provers: improved induct method: assumptions introduced by case
7549 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7550 the goal statement); "foo" still refers to all facts collectively;
7552 * Provers: the function blast.overloaded has been removed: all constants
7553 are regarded as potentially overloaded, which improves robustness in exchange
7554 for slight decrease in efficiency;
7556 * Provers/linorder: New generic prover for transitivity reasoning over
7557 linear orders. Note: this prover is not efficient!
7559 * Isar: preview of problems to finish 'show' now produce an error
7560 rather than just a warning (in interactive mode);
7567 - Produces a counter example if it cannot prove a goal.
7568 Note that the counter example may be spurious if the goal is not a formula
7569 of quantifier-free linear arithmetic.
7570 In ProofGeneral the counter example appears in the trace buffer.
7572 - Knows about div k and mod k where k is a numeral of type nat or int.
7574 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7575 linear arithmetic fails. This takes account of quantifiers and divisibility.
7576 Presburger arithmetic can also be called explicitly via presburger(_tac).
7578 * simp's arithmetic capabilities have been enhanced a bit: it now
7579 takes ~= in premises into account (by performing a case split);
7581 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7582 are distributed over a sum of terms;
7584 * New tactic "trans_tac" and method "trans" instantiate
7585 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7588 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7589 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7591 * 'typedef' command has new option "open" to suppress the set
7594 * functions Min and Max on finite sets have been introduced (theory
7597 * attribute [symmetric] now works for relations as well; it turns
7598 (x,y) : R^-1 into (y,x) : R, and vice versa;
7600 * induct over a !!-quantified statement (say !!x1..xn):
7601 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7603 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7604 %x. None. Warning: empty_def now refers to the previously hidden definition
7607 * Algebra: formalization of classical algebra. Intended as base for
7608 any algebraic development in Isabelle. Currently covers group theory
7609 (up to Sylow's theorem) and ring theory (Universal Property of
7610 Univariate Polynomials). Contributions welcome;
7612 * GroupTheory: deleted, since its material has been moved to Algebra;
7614 * Complex: new directory of the complex numbers with numeric constants,
7615 nonstandard complex numbers, and some complex analysis, standard and
7616 nonstandard (Jacques Fleuriot);
7618 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7620 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7623 * Real/HahnBanach: updated and adapted to locales;
7625 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7628 * UNITY: added the Meier-Sanders theory of progress sets;
7630 * MicroJava: bytecode verifier and lightweight bytecode verifier
7631 as abstract algorithms, instantiated to the JVM;
7633 * Bali: Java source language formalization. Type system, operational
7634 semantics, axiomatic semantics. Supported language features:
7635 classes, interfaces, objects,virtual methods, static methods,
7636 static/instance fields, arrays, access modifiers, definite
7637 assignment, exceptions.
7642 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7645 * Main ZF: virtually all theories converted to new-style format;
7650 * Pure: Tactic.prove provides sane interface for internal proofs;
7651 omits the infamous "standard" operation, so this is more appropriate
7652 than prove_goalw_cterm in many situations (e.g. in simprocs);
7654 * Pure: improved error reporting of simprocs;
7656 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7660 *** Document preparation ***
7662 * uses \par instead of \\ for line breaks in theory text. This may
7663 shift some page breaks in large documents. To get the old behaviour
7664 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7666 * minimized dependencies of isabelle.sty and isabellesym.sty on
7669 * \<euro> now needs package babel/greek instead of marvosym (which
7672 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7677 New in Isabelle2002 (March 2002)
7678 --------------------------------
7680 *** Document preparation ***
7682 * greatly simplified document preparation setup, including more
7683 graceful interpretation of isatool usedir -i/-d/-D options, and more
7684 instructive isatool mkdir; users should basically be able to get
7685 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7686 users may run a separate document processing stage manually like this:
7687 "isatool usedir -D output HOL Test && isatool document Test/output";
7689 * theory dependency graph may now be incorporated into documents;
7690 isatool usedir -g true will produce session_graph.eps/.pdf for use
7691 with \includegraphics of LaTeX;
7693 * proper spacing of consecutive markup elements, especially text
7694 blocks after section headings;
7696 * support bold style (for single symbols only), input syntax is like
7697 this: "\<^bold>\<alpha>" or "\<^bold>A";
7699 * \<bullet> is now output as bold \cdot by default, which looks much
7700 better in printed text;
7702 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
7703 note that these symbols are currently unavailable in Proof General /
7704 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
7706 * isatool latex no longer depends on changed TEXINPUTS, instead
7707 isatool document copies the Isabelle style files to the target
7713 * Pure/Provers: improved proof by cases and induction;
7714 - 'case' command admits impromptu naming of parameters (such as
7716 - 'induct' method divinates rule instantiation from the inductive
7717 claim; no longer requires excessive ?P bindings for proper
7718 instantiation of cases;
7719 - 'induct' method properly enumerates all possibilities of set/type
7720 rules; as a consequence facts may be also passed through *type*
7721 rules without further ado;
7722 - 'induct' method now derives symbolic cases from the *rulified*
7723 rule (before it used to rulify cases stemming from the internal
7724 atomized version); this means that the context of a non-atomic
7725 statement becomes is included in the hypothesis, avoiding the
7726 slightly cumbersome show "PROP ?case" form;
7727 - 'induct' may now use elim-style induction rules without chaining
7728 facts, using ``missing'' premises from the goal state; this allows
7729 rules stemming from inductive sets to be applied in unstructured
7730 scripts, while still benefitting from proper handling of non-atomic
7731 statements; NB: major inductive premises need to be put first, all
7732 the rest of the goal is passed through the induction;
7733 - 'induct' proper support for mutual induction involving non-atomic
7734 rule statements (uses the new concept of simultaneous goals, see
7736 - append all possible rule selections, but only use the first
7737 success (no backtracking);
7738 - removed obsolete "(simplified)" and "(stripped)" options of methods;
7739 - undeclared rule case names default to numbers 1, 2, 3, ...;
7740 - added 'print_induct_rules' (covered by help item in recent Proof
7742 - moved induct/cases attributes to Pure, methods to Provers;
7743 - generic method setup instantiated for FOL and HOL;
7745 * Pure: support multiple simultaneous goal statements, for example
7746 "have a: A and b: B" (same for 'theorem' etc.); being a pure
7747 meta-level mechanism, this acts as if several individual goals had
7748 been stated separately; in particular common proof methods need to be
7749 repeated in order to cover all claims; note that a single elimination
7750 step is *not* sufficient to establish the two conjunctions, so this
7753 assume "A & B" then have A and B .. (*".." fails*)
7755 better use "obtain" in situations as above; alternative refer to
7756 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
7758 * Pure: proper integration with ``locales''; unlike the original
7759 version by Florian Kammller, Isar locales package high-level proof
7760 contexts rather than raw logical ones (e.g. we admit to include
7761 attributes everywhere); operations on locales include merge and
7762 rename; support for implicit arguments (``structures''); simultaneous
7763 type-inference over imports and text; see also HOL/ex/Locales.thy for
7766 * Pure: the following commands have been ``localized'', supporting a
7767 target locale specification "(in name)": 'lemma', 'theorem',
7768 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
7769 stored both within the locale and at the theory level (exported and
7770 qualified by the locale name);
7772 * Pure: theory goals may now be specified in ``long'' form, with
7773 ad-hoc contexts consisting of arbitrary locale elements. for example
7774 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
7775 definitions may be given, too); the result is a meta-level rule with
7776 the context elements being discharged in the obvious way;
7778 * Pure: new proof command 'using' allows to augment currently used
7779 facts after a goal statement ('using' is syntactically analogous to
7780 'apply', but acts on the goal's facts only); this allows chained facts
7781 to be separated into parts given before and after a claim, as in
7782 ``from a and b have C using d and e <proof>'';
7784 * Pure: renamed "antecedent" case to "rule_context";
7786 * Pure: new 'judgment' command records explicit information about the
7787 object-logic embedding (used by several tools internally); no longer
7788 use hard-wired "Trueprop";
7790 * Pure: added 'corollary' command;
7792 * Pure: fixed 'token_translation' command;
7794 * Pure: removed obsolete 'exported' attribute;
7796 * Pure: dummy pattern "_" in is/let is now automatically lifted over
7797 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
7798 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
7800 * Pure: method 'atomize' presents local goal premises as object-level
7801 statements (atomic meta-level propositions); setup controlled via
7802 rewrite rules declarations of 'atomize' attribute; example
7803 application: 'induct' method with proper rule statements in improper
7806 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
7807 now consider the syntactic context of assumptions, giving a better
7808 chance to get type-inference of the arguments right (this is
7809 especially important for locales);
7811 * Pure: "sorry" no longer requires quick_and_dirty in interactive
7814 * Pure/obtain: the formal conclusion "thesis", being marked as
7815 ``internal'', may no longer be reference directly in the text;
7816 potential INCOMPATIBILITY, may need to use "?thesis" in rare
7819 * Pure: generic 'sym' attribute which declares a rule both as pure
7820 'elim?' and for the 'symmetric' operation;
7822 * Pure: marginal comments ``--'' may now occur just anywhere in the
7823 text; the fixed correlation with particular command syntax has been
7826 * Pure: new method 'rules' is particularly well-suited for proof
7827 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
7828 but often produces more compact proof terms with less detours;
7830 * Pure/Provers/classical: simplified integration with pure rule
7831 attributes and methods; the classical "intro?/elim?/dest?"
7832 declarations coincide with the pure ones; the "rule" method no longer
7833 includes classically swapped intros; "intro" and "elim" methods no
7834 longer pick rules from the context; also got rid of ML declarations
7835 AddXIs/AddXEs/AddXDs; all of this has some potential for
7838 * Provers/classical: attribute 'swapped' produces classical inversions
7839 of introduction rules;
7841 * Provers/simplifier: 'simplified' attribute may refer to explicit
7842 rules instead of full simplifier context; 'iff' attribute handles
7845 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
7847 * HOL: 'recdef' now fails on unfinished automated proofs, use
7848 "(permissive)" option to recover old behavior;
7850 * HOL: 'inductive' no longer features separate (collective) attributes
7851 for 'intros' (was found too confusing);
7853 * HOL: properly declared induction rules less_induct and
7859 * HOL: moved over to sane numeral syntax; the new policy is as
7862 - 0 and 1 are polymorphic constants, which are defined on any
7863 numeric type (nat, int, real etc.);
7865 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
7866 binary representation internally;
7868 - type nat has special constructor Suc, and generally prefers Suc 0
7869 over 1::nat and Suc (Suc 0) over 2::nat;
7871 This change may cause significant problems of INCOMPATIBILITY; here
7872 are some hints on converting existing sources:
7874 - due to the new "num" token, "-0" and "-1" etc. are now atomic
7875 entities, so expressions involving "-" (unary or binary minus) need
7876 to be spaced properly;
7878 - existing occurrences of "1" may need to be constraint "1::nat" or
7879 even replaced by Suc 0; similar for old "2";
7881 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
7883 - remove all special provisions on numerals in proofs;
7885 * HOL: simp rules nat_number expand numerals on nat to Suc/0
7886 representation (depends on bin_arith_simps in the default context);
7888 * HOL: symbolic syntax for x^2 (numeral 2);
7890 * HOL: the class of all HOL types is now called "type" rather than
7891 "term"; INCOMPATIBILITY, need to adapt references to this type class
7892 in axclass/classes, instance/arities, and (usually rare) occurrences
7893 in typings (of consts etc.); internally the class is called
7894 "HOL.type", ML programs should refer to HOLogic.typeS;
7896 * HOL/record package improvements:
7897 - new derived operations "fields" to build a partial record section,
7898 "extend" to promote a fixed record to a record scheme, and
7899 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
7900 declared as simp by default;
7901 - shared operations ("more", "fields", etc.) now need to be always
7902 qualified) --- potential INCOMPATIBILITY;
7903 - removed "make_scheme" operations (use "make" with "extend") --
7905 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
7906 - provides cases/induct rules for use with corresponding Isar
7907 methods (for concrete records, record schemes, concrete more
7908 parts, and schematic more parts -- in that order);
7909 - internal definitions directly based on a light-weight abstract
7910 theory of product types over typedef rather than datatype;
7912 * HOL: generic code generator for generating executable ML code from
7913 specifications; specific support for HOL constructs such as inductive
7914 datatypes and sets, as well as recursive functions; can be invoked
7915 via 'generate_code' theory section;
7917 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
7919 * HOL: consolidated and renamed several theories. In particular:
7920 Ord.thy has been absorbed into HOL.thy
7921 String.thy has been absorbed into List.thy
7923 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
7924 (beware of argument permutation!);
7926 * HOL: linorder_less_split superseded by linorder_cases;
7928 * HOL/List: "nodups" renamed to "distinct";
7930 * HOL: added "The" definite description operator; move Hilbert's "Eps"
7931 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
7932 - Ex_def has changed, now need to use some_eq_ex
7934 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
7935 in this (rare) case use:
7937 delSWrapper "split_all_tac"
7938 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
7940 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
7943 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
7944 Isabelle's type classes, ^ on functions and relations has too general
7945 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
7946 necessary to attach explicit type constraints;
7948 * HOL/Relation: the prefix name of the infix "O" has been changed from
7949 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
7950 renamed accordingly (eg "compI" -> "rel_compI").
7952 * HOL: syntax translations now work properly with numerals and records
7955 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
7956 of "lam" -- INCOMPATIBILITY;
7958 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
7959 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
7960 renamed "Product_Type.unit";
7962 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
7964 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
7965 the "cases" method);
7967 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
7970 * HOL/IMP: updated and converted to new-style theory format; several
7971 parts turned into readable document, with proper Isar proof texts and
7972 some explanations (by Gerwin Klein);
7974 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
7976 * HOL-Hyperreal is now a logic image;
7981 * Isar: consts/constdefs supports mixfix syntax for continuous
7984 * Isar: domain package adapted to new-style theory format, e.g. see
7987 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
7988 potential INCOMPATIBILITY; now use plain induct_tac instead of former
7989 lift.induct_tac, always use UU instead of Undef;
7991 * HOLCF/IMP: updated and converted to new-style theory;
7996 * Isar: proper integration of logic-specific tools and packages,
7997 including theory commands '(co)inductive', '(co)datatype',
7998 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
7999 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8001 * theory Main no longer includes AC; for the Axiom of Choice, base
8002 your theory on Main_ZFC;
8004 * the integer library now covers quotients and remainders, with many
8005 laws relating division to addition, multiplication, etc.;
8007 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8008 typeless version of the formalism;
8010 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8013 * ZF/Induct: new directory for examples of inductive definitions,
8014 including theory Multiset for multiset orderings; converted to
8015 new-style theory format;
8017 * ZF: many new theorems about lists, ordinals, etc.;
8022 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8023 variable proof controls level of detail: 0 = no proofs (only oracle
8024 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8025 also ref manual for further ML interfaces;
8027 * Pure/axclass: removed obsolete ML interface
8028 goal_subclass/goal_arity;
8030 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8031 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8032 separate tokens, so expressions involving minus need to be spaced
8035 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8036 rather than "infixl" or "infixr";
8038 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8039 sort constraint specifications in type inference; e.g. "x::_::foo"
8040 ensures that the type of "x" is of sort "foo" (but not necessarily a
8043 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8044 control output of nested => (types); the default behavior is
8047 * Pure/syntax: builtin parse translation for "_constify" turns valued
8048 tokens into AST constants;
8050 * Pure/syntax: prefer later declarations of translations and print
8051 translation functions; potential INCOMPATIBILITY: need to reverse
8052 multiple declarations for same syntax element constant;
8054 * Pure/show_hyps reset by default (in accordance to existing Isar
8057 * Provers/classical: renamed addaltern to addafter, addSaltern to
8060 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8063 * system: tested support for MacOS X; should be able to get Isabelle +
8064 Proof General to work in a plain Terminal after installing Poly/ML
8065 (e.g. from the Isabelle distribution area) and GNU bash alone
8066 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8067 support requires further installations, e.g. from
8068 http://fink.sourceforge.net/);
8070 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8072 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8073 of 40 MB), cf. ML_OPTIONS;
8075 * system: Proof General keywords specification is now part of the
8076 Isabelle distribution (see etc/isar-keywords.el);
8078 * system: support for persistent Proof General sessions (refrain from
8079 outdating all loaded theories on startup); user may create writable
8080 logic images like this: ``isabelle -q HOL Test'';
8082 * system: smart selection of Isabelle process versus Isabelle
8083 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8084 run both "isabelle" and "Isabelle" even if file names are badly
8085 damaged (executable inspects the case of the first letter of its own
8086 name); added separate "isabelle-process" and "isabelle-interface";
8088 * system: refrain from any attempt at filtering input streams; no
8089 longer support ``8bit'' encoding of old isabelle font, instead proper
8090 iso-latin characters may now be used; the related isatools
8091 "symbolinput" and "nonascii" have disappeared as well;
8093 * system: removed old "xterm" interface (the print modes "xterm" and
8094 "xterm_color" are still available for direct use in a suitable
8099 New in Isabelle99-2 (February 2001)
8100 -----------------------------------
8102 *** Overview of INCOMPATIBILITIES ***
8104 * HOL: please note that theories in the Library and elsewhere often use the
8105 new-style (Isar) format; to refer to their theorems in an ML script you must
8106 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8108 * HOL: inductive package no longer splits induction rule aggressively,
8109 but only as far as specified by the introductions given; the old
8110 format may be recovered via ML function complete_split_rule or attribute
8111 'split_rule (complete)';
8113 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8114 gfp_Tarski to gfp_unfold;
8116 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8118 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8119 relation); infix "^^" has been renamed "``"; infix "``" has been
8120 renamed "`"; "univalent" has been renamed "single_valued";
8122 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8125 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8127 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8129 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8130 consequence, it is no longer monotonic wrt. the local goal context
8131 (which is now passed through the inductive cases);
8133 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8134 \<gg> to \<ggreater>;
8137 *** Document preparation ***
8139 * \isabellestyle{NAME} selects version of Isabelle output (currently
8140 available: are "it" for near math-mode best-style output, "sl" for
8141 slanted text style, and "tt" for plain type-writer; if no
8142 \isabellestyle command is given, output is according to slanted
8145 * support sub/super scripts (for single symbols only), input syntax is
8146 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8148 * some more standard symbols; see Appendix A of the system manual for
8149 the complete list of symbols defined in isabellesym.sty;
8151 * improved isabelle style files; more abstract symbol implementation
8152 (should now use \isamath{...} and \isatext{...} in custom symbol
8155 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8156 state; Note that presentation of goal states does not conform to
8157 actual human-readable proof documents. Please do not include goal
8158 states into document output unless you really know what you are doing!
8160 * proper indentation of antiquoted output with proportional LaTeX
8163 * no_document ML operator temporarily disables LaTeX document
8166 * isatool unsymbolize tunes sources for plain ASCII communication;
8171 * Pure: Isar now suffers initial goal statements to contain unbound
8172 schematic variables (this does not conform to actual readable proof
8173 documents, due to unpredictable outcome and non-compositional proof
8174 checking); users who know what they are doing may use schematic goals
8175 for Prolog-style synthesis of proven results;
8177 * Pure: assumption method (an implicit finishing) now handles actual
8180 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8181 initial goal, declare "that" only as Pure intro (only for single
8182 steps); the "that" rule assumption may now be involved in implicit
8183 finishing, thus ".." becomes a feasible for trivial obtains;
8185 * Pure: default proof step now includes 'intro_classes'; thus trivial
8186 instance proofs may be performed by "..";
8188 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8191 * Pure: more robust selection of calculational rules;
8193 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8194 rule (as well as the assumption rule);
8196 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8197 lemmas, using the graph browser tool;
8199 * Pure: predict failure of "show" in interactive mode;
8201 * Pure: 'thms_containing' now takes actual terms as arguments;
8203 * HOL: improved method 'induct' --- now handles non-atomic goals
8204 (potential INCOMPATIBILITY); tuned error handling;
8206 * HOL: cases and induct rules now provide explicit hints about the
8207 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8208 any remaining facts are inserted into the goal verbatim;
8210 * HOL: local contexts (aka cases) may now contain term bindings as
8211 well; the 'cases' and 'induct' methods new provide a ?case binding for
8212 the result to be shown in each case;
8214 * HOL: added 'recdef_tc' command;
8216 * isatool convert assists in eliminating legacy ML scripts;
8221 * HOL/Library: a collection of generic theories to be used together
8222 with main HOL; the theory loader path already includes this directory
8223 by default; the following existing theories have been moved here:
8224 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8225 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8227 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8228 modelling and verification task performed in Isabelle/HOL +
8229 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8231 * HOL/Algebra: special summation operator SUM no longer exists, it has
8232 been replaced by setsum; infix 'assoc' now has priority 50 (like
8233 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8234 'domain', this makes the theory consistent with mathematical
8237 * HOL basics: added overloaded operations "inverse" and "divide"
8238 (infix "/"), syntax for generic "abs" operation, generic summation
8241 * HOL/typedef: simplified package, provide more useful rules (see also
8244 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8245 now expressed as a proper nested rule (old-style tactic scripts may
8246 require atomize_strip_tac to cope with non-atomic premises);
8248 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8249 to "split_conv" (old name still available for compatibility);
8251 * HOL: improved concrete syntax for strings (e.g. allows translation
8252 rules with string literals);
8254 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8255 and Fleuriot's mechanization of analysis, including the transcendental
8256 functions for the reals;
8258 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8263 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8264 "lam" is displayed as TWO lambda-symbols
8266 * CTT: theory Main now available, containing everything (that is, Bool
8272 * Pure: the Simplifier has been implemented properly as a derived rule
8273 outside of the actual kernel (at last!); the overall performance
8274 penalty in practical applications is about 50%, while reliability of
8275 the Isabelle inference kernel has been greatly improved;
8277 * print modes "brackets" and "no_brackets" control output of nested =>
8278 (types) and ==> (props); the default behaviour is "brackets";
8280 * Provers: fast_tac (and friends) now handle actual object-logic rules
8281 as assumptions as well;
8283 * system: support Poly/ML 4.0;
8285 * system: isatool install handles KDE version 1 or 2;
8289 New in Isabelle99-1 (October 2000)
8290 ----------------------------------
8292 *** Overview of INCOMPATIBILITIES ***
8294 * HOL: simplification of natural numbers is much changed; to partly
8295 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8296 issue the following ML commands:
8298 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8299 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8301 * HOL: simplification no longer dives into case-expressions; this is
8302 controlled by "t.weak_case_cong" for each datatype t;
8304 * HOL: nat_less_induct renamed to less_induct;
8306 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8307 fixsome to patch .thy and .ML sources automatically;
8309 select_equality -> some_equality
8310 select_eq_Ex -> some_eq_ex
8311 selectI2EX -> someI2_ex
8314 select1_equality -> some1_equality
8315 Eps_sym_eq -> some_sym_eq_trivial
8316 Eps_eq -> some_eq_trivial
8318 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8320 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8323 * HOL: the recursion equations generated by 'recdef' are now called
8324 f.simps instead of f.rules;
8326 * HOL: qed_spec_mp now also handles bounded ALL as well;
8328 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8329 sometimes be needed;
8331 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8333 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8335 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8336 product is now "<*>" instead of "Times"; the lexicographic product is
8337 now "<*lex*>" instead of "**";
8339 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8340 of main HOL, but was unused); better use HOL's datatype package;
8342 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8343 the old syntax may be recovered as follows:
8346 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8347 (infixl "\\<oplus>" 100)
8349 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8351 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8352 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8355 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8356 changed from A/r to A//r;
8358 * ZF: new treatment of arithmetic (nat & int) may break some old
8361 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8362 rulify -> rule_format, elimify -> elim_format, ...);
8364 * Isar/Provers: intro/elim/dest attributes changed; renamed
8365 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8366 should have to change intro!! to intro? only); replaced "delrule" by
8369 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8371 * Provers: strengthened force_tac by using new first_best_tac;
8373 * LaTeX document preparation: several changes of isabelle.sty (see
8377 *** Document preparation ***
8379 * formal comments (text blocks etc.) in new-style theories may now
8380 contain antiquotations of thm/prop/term/typ/text to be presented
8381 according to latex print mode; concrete syntax is like this:
8382 @{term[show_types] "f(x) = a + x"};
8384 * isatool mkdir provides easy setup of Isabelle session directories,
8385 including proper document sources;
8387 * generated LaTeX sources are now deleted after successful run
8388 (isatool document -c); may retain a copy somewhere else via -D option
8391 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8392 style files, achieving self-contained LaTeX sources and simplifying
8395 * old-style theories now produce (crude) LaTeX output as well;
8397 * browser info session directories are now self-contained (may be put
8398 on WWW server seperately); improved graphs of nested sessions; removed
8399 graph for 'all sessions';
8401 * several improvements in isabelle style files; \isabellestyle{it}
8402 produces fake math mode output; \isamarkupheader is now \section by
8403 default; see lib/texinputs/isabelle.sty etc.;
8408 * Isar/Pure: local results and corresponding term bindings are now
8409 subject to Hindley-Milner polymorphism (similar to ML); this
8410 accommodates incremental type-inference very nicely;
8412 * Isar/Pure: new derived language element 'obtain' supports
8413 generalized existence reasoning;
8415 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8416 support accumulation of results, without applying any rules yet;
8417 useful to collect intermediate results without explicit name
8418 references, and for use with transitivity rules with more than 2
8421 * Isar/Pure: scalable support for case-analysis type proofs: new
8422 'case' language element refers to local contexts symbolically, as
8423 produced by certain proof methods; internally, case names are attached
8424 to theorems as "tags";
8426 * Isar/Pure: theory command 'hide' removes declarations from
8427 class/type/const name spaces;
8429 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8430 indicate potential overloading;
8432 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8434 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8435 "{a,b,c}" instead of {a,b,c};
8437 * Isar/Pure now provides its own version of intro/elim/dest
8438 attributes; useful for building new logics, but beware of confusion
8439 with the version in Provers/classical;
8441 * Isar/Pure: the local context of (non-atomic) goals is provided via
8442 case name 'antecedent';
8444 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8445 to the current context is now done automatically);
8447 * Isar/Pure: theory command 'method_setup' provides a simple interface
8448 for definining proof methods in ML;
8450 * Isar/Provers: intro/elim/dest attributes changed; renamed
8451 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8452 most cases, one should have to change intro!! to intro? only);
8453 replaced "delrule" by "rule del";
8455 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8456 'symmetric' attribute (the latter supercedes [RS sym]);
8458 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8459 method modifier); 'simp' method: 'only:' modifier removes loopers as
8460 well (including splits);
8462 * Isar/Provers: Simplifier and Classical methods now support all kind
8463 of modifiers used in the past, including 'cong', 'iff', etc.
8465 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8466 of Simplifier and Classical reasoner);
8468 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8469 now support named cases; major packages (inductive, datatype, primrec,
8470 recdef) support case names and properly name parameters;
8472 * Isar/HOL: new transitivity rules for substitution in inequalities --
8473 monotonicity conditions are extracted to be proven at end of
8476 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8479 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8480 split_if split_if_asm; datatype package provides theorems foo.splits =
8481 foo.split foo.split_asm for each datatype;
8483 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8484 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8485 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8486 use "(cases (simplified))" method in proper proof texts);
8488 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8490 * Isar: names of theorems etc. may be natural numbers as well;
8492 * Isar: 'pr' command: optional arguments for goals_limit and
8493 ProofContext.prems_limit; no longer prints theory contexts, but only
8496 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8497 additional print modes to be specified; e.g. "pr(latex)" will print
8498 proof state according to the Isabelle LaTeX style;
8500 * Isar: improved support for emulating tactic scripts, including proof
8501 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8502 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8503 (for HOL datatypes);
8505 * Isar: simplified (more robust) goal selection of proof methods: 1st
8506 goal, all goals, or explicit goal specifier (tactic emulation); thus
8507 'proof method scripts' have to be in depth-first order;
8509 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8511 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8512 should instead use individual commands for printing items
8513 (print_commands, print_methods etc.);
8515 * Isar: added 'nothing' --- the empty list of theorems;
8520 * HOL/MicroJava: formalization of a fragment of Java, together with a
8521 corresponding virtual machine and a specification of its bytecode
8522 verifier and a lightweight bytecode verifier, including proofs of
8523 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8524 Cornelia Pusch (see also the homepage of project Bali at
8525 http://isabelle.in.tum.de/Bali/);
8527 * HOL/Algebra: new theory of rings and univariate polynomials, by
8530 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8531 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8534 * HOL/Lattice: fundamental concepts of lattice theory and order
8535 structures, including duals, properties of bounds versus algebraic
8536 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8537 Theorem for complete lattices etc.; may also serve as a demonstration
8538 for abstract algebraic reasoning using axiomatic type classes, and
8539 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8541 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8544 * HOL/IMPP: extension of IMP with local variables and mutually
8545 recursive procedures, by David von Oheimb;
8547 * HOL/Lambda: converted into new-style theory and document;
8549 * HOL/ex/Multiquote: example of multiple nested quotations and
8550 anti-quotations -- basically a generalized version of de-Bruijn
8551 representation; very useful in avoiding lifting of operations;
8553 * HOL/record: added general record equality rule to simpset; fixed
8554 select-update simplification procedure to handle extended records as
8555 well; admit "r" as field name;
8557 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8558 other numeric types and also as the identity of groups, rings, etc.;
8560 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8561 Types nat and int belong to this axclass;
8563 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8564 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8565 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8566 two terms #m*u and #n*u are replaced by #(m+n)*u
8567 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8568 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8569 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8571 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8572 powerful prover for predicate logic but knows nothing of clasets; see
8573 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8575 * HOL: new version of "case_tac" subsumes both boolean case split and
8576 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8577 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8579 * HOL: simplification no longer dives into case-expressions: only the
8580 selector expression is simplified, but not the remaining arms; to
8581 enable full simplification of case-expressions for datatype t, you may
8582 remove t.weak_case_cong from the simpset, either globally (Delcongs
8583 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8585 * HOL/recdef: the recursion equations generated by 'recdef' for
8586 function 'f' are now called f.simps instead of f.rules; if all
8587 termination conditions are proved automatically, these simplification
8588 rules are added to the simpset, as in primrec; rules may be named
8589 individually as well, resulting in a separate list of theorems for
8592 * HOL/While is a new theory that provides a while-combinator. It
8593 permits the definition of tail-recursive functions without the
8594 provision of a termination measure. The latter is necessary once the
8595 invariant proof rule for while is applied.
8597 * HOL: new (overloaded) notation for the set of elements below/above
8598 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8600 * HOL: theorems impI, allI, ballI bound as "strip";
8602 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8603 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8604 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8606 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8608 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8609 main HOL, but was unused);
8611 * HOL: fewer consts declared as global (e.g. have to refer to
8612 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8614 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8615 in case of overlap with user translations (e.g. judgements over
8616 tuples); (note that the underlying logical represenation is still
8622 * ZF: simplification automatically cancels common terms in arithmetic
8623 expressions over nat and int;
8625 * ZF: new treatment of nat to minimize type-checking: all operators
8626 coerce their operands to a natural number using the function natify,
8627 making the algebraic laws unconditional;
8629 * ZF: as above, for int: operators coerce their operands to an integer
8630 using the function intify;
8632 * ZF: the integer library now contains many of the usual laws for the
8633 orderings, including $<=, and monotonicity laws for $+ and $*;
8635 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8638 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8639 to the simplifier and classical reasoner simultaneously;
8644 * Provers: blast_tac now handles actual object-logic rules as
8645 assumptions; note that auto_tac uses blast_tac internally as well;
8647 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8648 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8650 * Provers: delrules now handles destruct rules as well (no longer need
8651 explicit make_elim);
8653 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8654 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8655 use instead the strong form,
8656 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8657 in HOL, FOL and ZF the function cla_make_elim will create such rules
8658 from destruct-rules;
8660 * Provers: Simplifier.easy_setup provides a fast path to basic
8661 Simplifier setup for new object-logics;
8663 * Pure: AST translation rules no longer require constant head on LHS;
8665 * Pure: improved name spaces: ambiguous output is qualified; support
8666 for hiding of names;
8668 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8669 XSYMBOL_HOME; no longer need to do manual configuration in most
8672 * system: compression of ML heaps images may now be controlled via -c
8673 option of isabelle and isatool usedir (currently only observed by
8676 * system: isatool installfonts may handle X-Symbol fonts as well (very
8677 useful for remote X11);
8679 * system: provide TAGS file for Isabelle sources;
8681 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8684 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8685 timing flag supersedes proof_timing and Toplevel.trace;
8687 * ML: new combinators |>> and |>>> for incremental transformations
8688 with secondary results (e.g. certain theory extensions):
8690 * ML: PureThy.add_defs gets additional argument to indicate potential
8691 overloading (usually false);
8693 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
8698 New in Isabelle99 (October 1999)
8699 --------------------------------
8701 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8703 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
8704 are no longer simplified. (This allows the simplifier to unfold recursive
8705 functional programs.) To restore the old behaviour, declare
8707 Delcongs [if_weak_cong];
8709 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
8712 * HOL: the predicate "inj" is now defined by translation to "inj_on";
8714 * HOL/datatype: mutual_induct_tac no longer exists --
8715 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
8717 * HOL/typedef: fixed type inference for representing set; type
8718 arguments now have to occur explicitly on the rhs as type constraints;
8720 * ZF: The con_defs part of an inductive definition may no longer refer
8721 to constants declared in the same theory;
8723 * HOL, ZF: the function mk_cases, generated by the inductive
8724 definition package, has lost an argument. To simplify its result, it
8725 uses the default simpset instead of a supplied list of theorems.
8727 * HOL/List: the constructors of type list are now Nil and Cons;
8729 * Simplifier: the type of the infix ML functions
8730 setSSolver addSSolver setSolver addSolver
8731 is now simpset * solver -> simpset where `solver' is a new abstract type
8732 for packaging solvers. A solver is created via
8733 mk_solver: string -> (thm list -> int -> tactic) -> solver
8734 where the string argument is only a comment.
8739 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
8740 decision procedure for linear arithmetic. Currently it is used for
8741 types `nat', `int', and `real' in HOL (see below); it can, should and
8742 will be instantiated for other types and logics as well.
8744 * The simplifier now accepts rewrite rules with flexible heads, eg
8745 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
8746 They are applied like any rule with a non-pattern lhs, i.e. by first-order
8752 * New Isabelle/Isar subsystem provides an alternative to traditional
8753 tactical theorem proving; together with the ProofGeneral/isar user
8754 interface it offers an interactive environment for developing human
8755 readable proof documents (Isar == Intelligible semi-automated
8756 reasoning); for further information see isatool doc isar-ref,
8757 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
8759 * improved and simplified presentation of theories: better HTML markup
8760 (including colors), graph views in several sizes; isatool usedir now
8761 provides a proper interface for user theories (via -P option); actual
8762 document preparation based on (PDF)LaTeX is available as well (for
8763 new-style theories only); see isatool doc system for more information;
8765 * native support for Proof General, both for classic Isabelle and
8768 * ML function thm_deps visualizes dependencies of theorems and lemmas,
8769 using the graph browser tool;
8771 * Isabelle manuals now also available as PDF;
8773 * theory loader rewritten from scratch (may not be fully
8774 bug-compatible); old loadpath variable has been replaced by show_path,
8775 add_path, del_path, reset_path functions; new operations such as
8776 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
8779 * improved isatool install: option -k creates KDE application icon,
8780 option -p DIR installs standalone binaries;
8782 * added ML_PLATFORM setting (useful for cross-platform installations);
8783 more robust handling of platform specific ML images for SML/NJ;
8785 * the settings environment is now statically scoped, i.e. it is never
8786 created again in sub-processes invoked from isabelle, isatool, or
8789 * path element specification '~~' refers to '$ISABELLE_HOME';
8791 * in locales, the "assumes" and "defines" parts may be omitted if
8794 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
8797 * new print_mode "HTML";
8799 * new flag show_tags controls display of tags of theorems (which are
8800 basically just comments that may be attached by some tools);
8802 * Isamode 2.6 requires patch to accomodate change of Isabelle font
8803 mode and goal output format:
8805 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
8807 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
8809 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
8810 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
8812 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
8814 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
8816 * function bind_thms stores lists of theorems (cf. bind_thm);
8818 * new shorthand tactics ftac, eatac, datac, fatac;
8820 * qed (and friends) now accept "" as result name; in that case the
8821 theorem is not stored, but proper checks and presentation of the
8824 * theorem database now also indexes constants "Trueprop", "all",
8825 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
8830 ** HOL arithmetic **
8832 * There are now decision procedures for linear arithmetic over nat and
8835 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
8836 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
8837 are treated as atomic; subformulae not involving type `nat' or `int'
8838 are ignored; quantified subformulae are ignored unless they are
8839 positive universal or negative existential. The tactic has to be
8840 invoked by hand and can be a little bit slow. In particular, the
8841 running time is exponential in the number of occurrences of `min' and
8842 `max', and `-' on `nat'.
8844 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
8845 (negated) (in)equalities among the premises and the conclusion into
8846 account (i.e. no compound formulae) and does not know about `min' and
8847 `max', and `-' on `nat'. It is fast and is used automatically by the
8850 NB: At the moment, these decision procedures do not cope with mixed
8851 nat/int formulae where the two parts interact, such as `m < n ==>
8854 * HOL/Numeral provides a generic theory of numerals (encoded
8855 efficiently as bit strings); setup for types nat/int/real is in place;
8856 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
8857 int, existing theories and proof scripts may require a few additional
8860 * integer division and remainder can now be performed on constant
8863 * many properties of integer multiplication, division and remainder
8866 * An interface to the Stanford Validity Checker (SVC) is available through the
8867 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
8868 are proved automatically. SVC must be installed separately, and its results
8869 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
8870 invocation of the underlying oracle). For SVC see
8871 http://verify.stanford.edu/SVC
8873 * IsaMakefile: the HOL-Real target now builds an actual image;
8878 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
8879 (in Isabelle/Isar) -- by Gertrud Bauer;
8881 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
8882 analysis for assembly languages with subtypes;
8884 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
8885 -- avoids syntactic ambiguities and treats state, transition, and
8886 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
8887 changed syntax and (many) tactics;
8889 * HOL/inductive: Now also handles more general introduction rules such
8890 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
8891 theorems are now maintained within the theory (maintained via the
8894 * HOL/datatype: Now also handles arbitrarily branching datatypes
8895 (using function types) such as
8897 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
8899 * HOL/record: record_simproc (part of the default simpset) takes care
8900 of selectors applied to updated records; record_split_tac is no longer
8901 part of the default claset; update_defs may now be removed from the
8902 simpset in many cases; COMPATIBILITY: old behavior achieved by
8904 claset_ref () := claset() addSWrapper record_split_wrapper;
8905 Delsimprocs [record_simproc]
8907 * HOL/typedef: fixed type inference for representing set; type
8908 arguments now have to occur explicitly on the rhs as type constraints;
8910 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
8911 names rather than an ML expression;
8913 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
8914 supplied later. Program schemes can be defined, such as
8915 "While B C s = (if B s then While B C (C s) else s)"
8916 where the well-founded relation can be chosen after B and C have been given.
8918 * HOL/List: the constructors of type list are now Nil and Cons;
8919 INCOMPATIBILITY: while [] and infix # syntax is still there, of
8920 course, ML tools referring to List.list.op # etc. have to be adapted;
8922 * HOL_quantifiers flag superseded by "HOL" print mode, which is
8923 disabled by default; run isabelle with option -m HOL to get back to
8924 the original Gordon/HOL-style output;
8926 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
8927 ALL x<=y. P, EX x<y. P, EX x<=y. P;
8929 * HOL basic syntax simplified (more orthogonal): all variants of
8930 All/Ex now support plain / symbolic / HOL notation; plain syntax for
8931 Eps operator is provided as well: "SOME x. P[x]";
8933 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
8935 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
8936 thus available for user theories;
8938 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
8939 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
8942 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
8943 several times and then mp;
8948 * the notation <<...>> is now available as a notation for sequences of
8951 * the simplifier is now installed
8953 * the axiom system has been generalized (thanks to Soren Heilmann)
8955 * the classical reasoner now has a default rule database
8960 * new primrec section allows primitive recursive functions to be given
8961 directly (as in HOL) over datatypes and the natural numbers;
8963 * new tactics induct_tac and exhaust_tac for induction (or case
8964 analysis) over datatypes and the natural numbers;
8966 * the datatype declaration of type T now defines the recursor T_rec;
8968 * simplification automatically does freeness reasoning for datatype
8971 * automatic type-inference, with AddTCs command to insert new
8972 type-checking rules;
8974 * datatype introduction rules are now added as Safe Introduction rules
8977 * the syntax "if P then x else y" is now available in addition to
8981 *** Internal programming interfaces ***
8983 * tuned simplifier trace output; new flag debug_simp;
8985 * structures Vartab / Termtab (instances of TableFun) offer efficient
8986 tables indexed by indexname_ord / term_ord (compatible with aconv);
8988 * AxClass.axclass_tac lost the theory argument;
8990 * tuned current_goals_markers semantics: begin / end goal avoids
8991 printing empty lines;
8993 * removed prs and prs_fn hook, which was broken because it did not
8994 include \n in its semantics, forcing writeln to add one
8995 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
8996 string -> unit if you really want to output text without newline;
8998 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
8999 plain output, interface builders may have to enable 'isabelle_font'
9000 mode to get Isabelle font glyphs as before;
9002 * refined token_translation interface; INCOMPATIBILITY: output length
9003 now of type real instead of int;
9005 * theory loader actions may be traced via new ThyInfo.add_hook
9006 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9007 your own database of information attached to *whole* theories -- as
9008 opposed to intra-theory data slots offered via TheoryDataFun;
9010 * proper handling of dangling sort hypotheses (at last!);
9011 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9012 extra sort hypotheses that can be witnessed from the type signature;
9013 the force_strip_shyps flag is gone, any remaining shyps are simply
9014 left in the theorem (with a warning issued by strip_shyps_warning);
9018 New in Isabelle98-1 (October 1998)
9019 ----------------------------------
9021 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9023 * several changes of automated proof tools;
9025 * HOL: major changes to the inductive and datatype packages, including
9026 some minor incompatibilities of theory syntax;
9028 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9031 * HOL: removed duplicate thms in Arith:
9032 less_imp_add_less should be replaced by trans_less_add1
9033 le_imp_add_le should be replaced by trans_le_add1
9035 * HOL: unary minus is now overloaded (new type constraints may be
9038 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9039 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9040 now taken as an integer constant.
9042 * Pure: ML function 'theory_of' renamed to 'theory';
9048 1. Asm_full_simp_tac is now more aggressive.
9049 1. It will sometimes reorient premises if that increases their power to
9051 2. It does no longer proceed strictly from left to right but may also
9052 rotate premises to achieve further simplification.
9053 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9054 old Asm_full_simp_tac in that it does not rotate premises.
9055 2. The simplifier now knows a little bit about nat-arithmetic.
9057 * Classical reasoner: wrapper mechanism for the classical reasoner now
9058 allows for selected deletion of wrappers, by introduction of names for
9059 wrapper functionals. This implies that addbefore, addSbefore,
9060 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9061 and that adding two tactics with the same name overwrites the first
9062 one (emitting a warning).
9063 type wrapper = (int -> tactic) -> (int -> tactic)
9064 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9065 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9066 delWrapper, delSWrapper: claset * string -> claset
9067 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9069 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9070 semantics; addbefore now affects only the unsafe part of step_tac
9071 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9072 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9075 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9076 compWrapper; added safe wrapper (and access functions for it);
9078 * HOL/split_all_tac is now much faster and fails if there is nothing
9079 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9080 and the names of the automatically generated variables have changed.
9081 split_all_tac has moved within claset() from unsafe wrappers to safe
9082 wrappers, which means that !!-bound variables are split much more
9083 aggressively, and safe_tac and clarify_tac now split such variables.
9084 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9085 Note: the same holds for record_split_tac, which does the job of
9086 split_all_tac for record fields.
9088 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9089 permanently to the default simpset using Addsplits just like
9090 Addsimps. They can be removed via Delsplits just like
9091 Delsimps. Lower-case versions are also available.
9093 * HOL/Simplifier: The rule split_if is now part of the default
9094 simpset. This means that the simplifier will eliminate all occurrences
9095 of if-then-else in the conclusion of a goal. To prevent this, you can
9096 either remove split_if completely from the default simpset by
9097 `Delsplits [split_if]' or remove it in a specific call of the
9098 simplifier using `... delsplits [split_if]'. You can also add/delete
9099 other case splitting rules to/from the default simpset: every datatype
9100 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9101 t is the name of the datatype).
9103 * Classical reasoner / Simplifier combination: new force_tac (and
9104 derivatives Force_tac, force) combines rewriting and classical
9105 reasoning (and whatever other tools) similarly to auto_tac, but is
9106 aimed to solve the given subgoal completely.
9111 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9112 and `goalw': the theory is no longer needed as an explicit argument -
9113 the current theory context is used; assumptions are no longer returned
9114 at the ML-level unless one of them starts with ==> or !!; it is
9115 recommended to convert to these new commands using isatool fixgoal
9116 (backup your sources first!);
9118 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9119 the current theory context, and 'theory' to lookup stored theories;
9121 * new theory section 'locale' for declaring constants, assumptions and
9122 definitions that have local scope;
9124 * new theory section 'nonterminals' for purely syntactic types;
9126 * new theory section 'setup' for generic ML setup functions
9127 (e.g. package initialization);
9129 * the distribution now includes Isabelle icons: see
9130 lib/logo/isabelle-{small,tiny}.xpm;
9132 * isatool install - install binaries with absolute references to
9135 * isatool logo -- create instances of the Isabelle logo (as EPS);
9137 * print mode 'emacs' reserved for Isamode;
9139 * support multiple print (ast) translations per constant name;
9141 * theorems involving oracles are now printed with a suffixed [!];
9146 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9148 * HOL/inductive package reorganized and improved: now supports mutual
9154 oddI "n : EVEN ==> Suc n : ODD"
9155 evenI "n : ODD ==> Suc n : EVEN"
9157 new theorem list "elims" contains an elimination rule for each of the
9158 recursive sets; inductive definitions now handle disjunctive premises
9159 correctly (also ZF);
9161 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9162 "mutual_induct" no longer exists - the induction rule is always
9163 contained in "induct";
9166 * HOL/datatype package re-implemented and greatly improved: now
9167 supports mutually recursive datatypes such as
9170 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9171 | SUM ('a aexp) ('a aexp)
9172 | DIFF ('a aexp) ('a aexp)
9175 'a bexp = LESS ('a aexp) ('a aexp)
9176 | AND ('a bexp) ('a bexp)
9177 | OR ('a bexp) ('a bexp)
9179 as well as indirectly recursive datatypes such as
9182 ('a, 'b) term = Var 'a
9183 | App 'b ((('a, 'b) term) list)
9185 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9186 induction on mutually / indirectly recursive datatypes.
9188 Primrec equations are now stored in theory and can be accessed via
9189 <function_name>.simps.
9193 - Theories using datatypes must now have theory Datatype as an
9195 - The specific <typename>.induct_tac no longer exists - use the
9196 generic induct_tac instead.
9197 - natE has been renamed to nat.exhaust - use exhaust_tac
9198 instead of res_inst_tac ... natE. Note that the variable
9199 names in nat.exhaust differ from the names in natE, this
9200 may cause some "fragile" proofs to fail.
9201 - The theorems split_<typename>_case and split_<typename>_case_asm
9202 have been renamed to <typename>.split and <typename>.split_asm.
9203 - Since default sorts of type variables are now handled correctly,
9204 some datatype definitions may have to be annotated with explicit
9206 - Primrec definitions no longer require function name and type
9207 of recursive argument.
9209 Consider using isatool fixdatatype to adapt your theories and proof
9210 scripts to the new package (backup your sources first!).
9213 * HOL/record package: considerably improved implementation; now
9214 includes concrete syntax for record types, terms, updates; theorems
9215 for surjective pairing and splitting !!-bound record variables; proof
9216 support is as follows:
9218 1) standard conversions (selectors or updates applied to record
9219 constructor terms) are part of the standard simpset;
9221 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9222 made part of standard simpset and claset via addIffs;
9224 3) a tactic for record field splitting (record_split_tac) is part of
9225 the standard claset (addSWrapper);
9227 To get a better idea about these rules you may retrieve them via
9228 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9229 the name of your record type.
9231 The split tactic 3) conceptually simplifies by the following rule:
9233 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9235 Thus any record variable that is bound by meta-all will automatically
9236 blow up into some record constructor term, consequently the
9237 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9238 solve record problems automatically.
9241 * reorganized the main HOL image: HOL/Integ and String loaded by
9242 default; theory Main includes everything;
9244 * automatic simplification of integer sums and comparisons, using cancellation;
9246 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9248 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9250 * many new identities for unions, intersections, set difference, etc.;
9252 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9253 called split_if, split_split, split_sum_case and split_nat_case (to go
9254 with add/delsplits);
9256 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9257 (?x::unit) = (); this is made part of the default simpset, which COULD
9258 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9259 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9260 unit_abs_eta_conv is added in order to counter the effect of
9261 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9264 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9267 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9268 It and 'sym RS equals0D' are now in the default claset, giving automatic
9269 disjointness reasoning but breaking a few old proofs.
9271 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9272 to 'converse' from 'inverse' (for compatibility with ZF and some
9275 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9276 the well-founded relation;
9278 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9279 Compl A. The "Compl" syntax remains available as input syntax for this
9282 * HOL/Update: new theory of function updates:
9283 f(a:=b) == %x. if x=a then b else f x
9284 may also be iterated as in f(a:=b,c:=d,...);
9286 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9289 - new function list_update written xs[i:=v] that updates the i-th
9290 list position. May also be iterated as in xs[i:=a,j:=b,...].
9291 - new function `upt' written [i..j(] which generates the list
9292 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9293 bound write [i..j], which is a shorthand for [i..j+1(].
9294 - new lexicographic orderings and corresponding wellfoundedness theorems.
9297 - removed 'pred' (predecessor) function;
9298 - generalized some theorems about n-1;
9299 - many new laws about "div" and "mod";
9300 - new laws about greatest common divisors (see theory ex/Primes);
9302 * HOL/Relation: renamed the relational operator r^-1 "converse"
9303 instead of "inverse";
9305 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9306 of the multiset ordering;
9308 * directory HOL/Real: a construction of the reals using Dedekind cuts
9309 (not included by default);
9311 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9313 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9314 programs, i.e. different program variables may have different types.
9316 * calling (stac rew i) now fails if "rew" has no effect on the goal
9317 [previously, this check worked only if the rewrite rule was unconditional]
9318 Now rew can involve either definitions or equalities (either == or =).
9323 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9324 only the theorems proved on ZF.ML;
9326 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9327 It and 'sym RS equals0D' are now in the default claset, giving automatic
9328 disjointness reasoning but breaking a few old proofs.
9330 * ZF/Update: new theory of function updates
9331 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9332 may also be iterated as in f(a:=b,c:=d,...);
9334 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9336 * calling (stac rew i) now fails if "rew" has no effect on the goal
9337 [previously, this check worked only if the rewrite rule was unconditional]
9338 Now rew can involve either definitions or equalities (either == or =).
9340 * case_tac provided for compatibility with HOL
9341 (like the old excluded_middle_tac, but with subgoals swapped)
9344 *** Internal programming interfaces ***
9346 * Pure: several new basic modules made available for general use, see
9347 also src/Pure/README;
9349 * improved the theory data mechanism to support encapsulation (data
9350 kind name replaced by private Object.kind, acting as authorization
9351 key); new type-safe user interface via functor TheoryDataFun; generic
9352 print_data function becomes basically useless;
9354 * removed global_names compatibility flag -- all theory declarations
9355 are qualified by default;
9357 * module Pure/Syntax now offers quote / antiquote translation
9358 functions (useful for Hoare logic etc. with implicit dependencies);
9359 see HOL/ex/Antiquote for an example use;
9361 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9364 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9367 * Display.print_goals function moved to Locale.print_goals;
9369 * standard print function for goals supports current_goals_markers
9370 variable for marking begin of proof, end of proof, start of goal; the
9371 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9372 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9377 New in Isabelle98 (January 1998)
9378 --------------------------------
9380 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9382 * changed lexical syntax of terms / types: dots made part of long
9383 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9385 * simpset (and claset) reference variable replaced by functions
9386 simpset / simpset_ref;
9388 * no longer supports theory aliases (via merge) and non-trivial
9389 implicit merge of thms' signatures;
9391 * most internal names of constants changed due to qualified names;
9393 * changed Pure/Sequence interface (see Pure/seq.ML);
9396 *** General Changes ***
9398 * hierachically structured name spaces (for consts, types, axms, thms
9399 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9400 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9401 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9402 long_names for fully qualified output names; NOTE: ML programs
9403 (special tactics, packages etc.) referring to internal names may have
9404 to be adapted to cope with fully qualified names; in case of severe
9405 backward campatibility problems try setting 'global_names' at compile
9406 time to have enrything declared within a flat name space; one may also
9407 fine tune name declarations in theories via the 'global' and 'local'
9410 * reimplemented the implicit simpset and claset using the new anytype
9411 data filed in signatures; references simpset:simpset ref etc. are
9412 replaced by functions simpset:unit->simpset and
9413 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9414 to patch your ML files accordingly;
9416 * HTML output now includes theory graph data for display with Java
9417 applet or isatool browser; data generated automatically via isatool
9418 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9420 * defs may now be conditional; improved rewrite_goals_tac to handle
9421 conditional equations;
9423 * defs now admits additional type arguments, using TYPE('a) syntax;
9425 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9426 creates a new theory node; implicit merge of thms' signatures is
9427 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9428 transfer:theory->thm->thm in (rare) cases;
9430 * improved handling of draft signatures / theories; draft thms (and
9431 ctyps, cterms) are automatically promoted to real ones;
9433 * slightly changed interfaces for oracles: admit many per theory, named
9434 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9436 * print_goals: optional output of const types (set show_consts and
9439 * improved output of warnings (###) and errors (***);
9441 * subgoal_tac displays a warning if the new subgoal has type variables;
9443 * removed old README and Makefiles;
9445 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9447 * removed obsolete init_pps and init_database;
9449 * deleted the obsolete tactical STATE, which was declared by
9450 fun STATE tacfun st = tacfun st st;
9452 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9453 (which abbreviates $HOME);
9455 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9456 use isatool fixseq to adapt your ML programs (this works for fully
9457 qualified references to the Sequence structure only!);
9459 * use_thy no longer requires writable current directory; it always
9460 reloads .ML *and* .thy file, if either one is out of date;
9463 *** Classical Reasoner ***
9465 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9466 tactics that use classical reasoning to simplify a subgoal without
9467 splitting it into several subgoals;
9469 * Safe_tac: like safe_tac but uses the default claset;
9474 * added simplification meta rules:
9475 (asm_)(full_)simplify: simpset -> thm -> thm;
9477 * simplifier.ML no longer part of Pure -- has to be loaded by object
9480 * added prems argument to simplification procedures;
9482 * HOL, FOL, ZF: added infix function `addsplits':
9483 instead of `<simpset> setloop (split_tac <thms>)'
9484 you can simply write `<simpset> addsplits <thms>'
9489 * TYPE('a) syntax for type reflection terms;
9491 * no longer handles consts with name "" -- declare as 'syntax' instead;
9493 * pretty printer: changed order of mixfix annotation preference (again!);
9495 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9500 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9501 with `addloop' of the simplifier to faciliate case splitting in premises.
9503 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9505 * HOL/Auth: new protocol proofs including some for the Internet
9508 * HOL/Map: new theory of `maps' a la VDM;
9510 * HOL/simplifier: simplification procedures nat_cancel_sums for
9511 cancelling out common nat summands from =, <, <= (in)equalities, or
9512 differences; simplification procedures nat_cancel_factor for
9513 cancelling common factor from =, <, <= (in)equalities over natural
9514 sums; nat_cancel contains both kinds of procedures, it is installed by
9515 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9517 * HOL/simplifier: terms of the form
9518 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9520 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9521 and those of the form
9522 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9524 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9527 Each datatype `t' now comes with a theorem `split_t_case' of the form
9529 P(t_case f1 ... fn x) =
9530 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9532 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9535 and a theorem `split_t_case_asm' of the form
9537 P(t_case f1 ... fn x) =
9538 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9540 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9542 which can be added to a simpset via `addsplits'. The existing theorems
9543 expand_list_case and expand_option_case have been renamed to
9544 split_list_case and split_option_case.
9547 - `pred n' is automatically converted to `n-1'.
9548 Users are strongly encouraged not to use `pred' any longer,
9549 because it will disappear altogether at some point.
9550 - Users are strongly encouraged to write "0 < n" rather than
9551 "n ~= 0". Theorems and proof tools have been modified towards this
9555 the function "set_of_list" has been renamed "set" (and its theorems too);
9556 the function "nth" now takes its arguments in the reverse order and
9557 has acquired the infix notation "!" as in "xs!n".
9559 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9561 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9562 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9564 * HOL/record: extensible records with schematic structural subtyping
9565 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9566 still lacks various theorems and concrete record syntax;
9571 * removed "axioms" and "generated by" sections;
9573 * replaced "ops" section by extended "consts" section, which is capable of
9574 handling the continuous function space "->" directly;
9577 . proves theorems immediately and stores them in the theory,
9578 . creates hierachical name space,
9579 . now uses normal mixfix annotations (instead of cinfix...),
9580 . minor changes to some names and values (for consistency),
9581 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9582 . separator between mutual domain defs: changed "," to "and",
9583 . improved handling of sort constraints; now they have to
9584 appear on the left-hand side of the equations only;
9586 * fixed LAM <x,y,zs>.b syntax;
9588 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9589 adm (%x. P (t x)), where P is chainfinite and t continuous;
9594 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9595 with `addloop' of the simplifier to faciliate case splitting in premises.
9597 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9598 in HOL, they strip ALL and --> from proved theorems;
9602 New in Isabelle94-8 (May 1997)
9603 ------------------------------
9605 *** General Changes ***
9607 * new utilities to build / run / maintain Isabelle etc. (in parts
9608 still somewhat experimental); old Makefiles etc. still functional;
9610 * new 'Isabelle System Manual';
9612 * INSTALL text, together with ./configure and ./build scripts;
9614 * reimplemented type inference for greater efficiency, better error
9615 messages and clean internal interface;
9617 * prlim command for dealing with lots of subgoals (an easier way of
9618 setting goals_limit);
9623 * supports alternative (named) syntax tables (parser and pretty
9624 printer); internal interface is provided by add_modesyntax(_i);
9626 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9627 be used in conjunction with the Isabelle symbol font; uses the
9628 "symbols" syntax table;
9630 * added token_translation interface (may translate name tokens in
9631 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9632 the current print_mode); IMPORTANT: user print translation functions
9633 are responsible for marking newly introduced bounds
9634 (Syntax.mark_boundT);
9636 * token translations for modes "xterm" and "xterm_color" that display
9637 names in bold, underline etc. or colors (which requires a color
9640 * infixes may now be declared with names independent of their syntax;
9642 * added typed_print_translation (like print_translation, but may
9643 access type of constant);
9646 *** Classical Reasoner ***
9648 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9649 some limitations. Blast_tac...
9650 + ignores addss, addbefore, addafter; this restriction is intrinsic
9651 + ignores elimination rules that don't have the correct format
9652 (the conclusion MUST be a formula variable)
9653 + ignores types, which can make HOL proofs fail
9654 + rules must not require higher-order unification, e.g. apply_type in ZF
9655 [message "Function Var's argument not a bound variable" relates to this]
9656 + its proof strategy is more general but can actually be slower
9658 * substitution with equality assumptions no longer permutes other
9661 * minor changes in semantics of addafter (now called addaltern); renamed
9662 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9663 (and access functions for it);
9665 * improved combination of classical reasoner and simplifier:
9666 + functions for handling clasimpsets
9667 + improvement of addss: now the simplifier is called _after_ the
9669 + safe variant of addss called addSss: uses safe simplifications
9670 _during_ the safe steps. It is more complete as it allows multiple
9671 instantiations of unknowns (e.g. with slow_tac).
9675 * added interface for simplification procedures (functions that
9676 produce *proven* rewrite rules on the fly, depending on current
9679 * ordering on terms as parameter (used for ordered rewriting);
9681 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9683 * the solver is now split into a safe and an unsafe part.
9684 This should be invisible for the normal user, except that the
9685 functions setsolver and addsolver have been renamed to setSolver and
9686 addSolver; added safe_asm_full_simp_tac;
9691 * a generic induction tactic `induct_tac' which works for all datatypes and
9692 also for type `nat';
9694 * a generic case distinction tactic `exhaust_tac' which works for all
9695 datatypes and also for type `nat';
9697 * each datatype comes with a function `size';
9699 * patterns in case expressions allow tuple patterns as arguments to
9700 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
9702 * primrec now also works with type nat;
9704 * recdef: a new declaration form, allows general recursive functions to be
9705 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
9707 * the constant for negation has been renamed from "not" to "Not" to
9708 harmonize with FOL, ZF, LK, etc.;
9710 * HOL/ex/LFilter theory of a corecursive "filter" functional for
9713 * HOL/Modelcheck demonstrates invocation of model checker oracle;
9715 * HOL/ex/Ring.thy declares cring_simp, which solves equational
9716 problems in commutative rings, using axiomatic type classes for + and *;
9718 * more examples in HOL/MiniML and HOL/Auth;
9720 * more default rewrite rules for quantifiers, union/intersection;
9722 * a new constant `arbitrary == @x.False';
9724 * HOLCF/IOA replaces old HOL/IOA;
9726 * HOLCF changes: derived all rules and arities
9727 + axiomatic type classes instead of classes
9728 + typedef instead of faking type definitions
9729 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
9730 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
9731 + eliminated the types void, one, tr
9732 + use unit lift and bool lift (with translations) instead of one and tr
9733 + eliminated blift from Lift3.thy (use Def instead of blift)
9734 all eliminated rules are derived as theorems --> no visible changes ;
9739 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
9740 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
9741 as ZF_cs addSIs [equalityI];
9745 New in Isabelle94-7 (November 96)
9746 ---------------------------------
9748 * allowing negative levels (as offsets) in prlev and choplev;
9750 * super-linear speedup for large simplifications;
9752 * FOL, ZF and HOL now use miniscoping: rewriting pushes
9753 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
9754 FAIL); can suppress it using the command Delsimps (ex_simps @
9755 all_simps); De Morgan laws are also now included, by default;
9757 * improved printing of ==> : ~:
9759 * new object-logic "Sequents" adds linear logic, while replacing LK
9760 and Modal (thanks to Sara Kalvala);
9762 * HOL/Auth: correctness proofs for authentication protocols;
9764 * HOL: new auto_tac combines rewriting and classical reasoning (many
9765 examples on HOL/Auth);
9767 * HOL: new command AddIffs for declaring theorems of the form P=Q to
9768 the rewriter and classical reasoner simultaneously;
9770 * function uresult no longer returns theorems in "standard" format;
9771 regain previous version by: val uresult = standard o uresult;
9778 * oracles -- these establish an interface between Isabelle and trusted
9779 external reasoners, which may deliver results as theorems;
9781 * proof objects (in particular record all uses of oracles);
9783 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
9785 * "constdefs" section in theory files;
9787 * "primrec" section (HOL) no longer requires names;
9789 * internal type "tactic" now simply "thm -> thm Sequence.seq";
9796 * reduced space requirements;
9798 * automatic HTML generation from theories;
9800 * theory files no longer require "..." (quotes) around most types;
9802 * new examples, including two proofs of the Church-Rosser theorem;
9804 * non-curried (1994) version of HOL is no longer distributed;
9811 * greatly reduced space requirements;
9813 * theory files (.thy) no longer require \...\ escapes at line breaks;
9815 * searchable theorem database (see the section "Retrieving theorems" on
9816 page 8 of the Reference Manual);
9818 * new examples, including Grabczewski's monumental case study of the
9821 * The previous version of HOL renamed to Old_HOL;
9823 * The new version of HOL (previously called CHOL) uses a curried syntax
9824 for functions. Application looks like f a b instead of f(a,b);
9826 * Mutually recursive inductive definitions finally work in HOL;
9828 * In ZF, pattern-matching on tuples is now available in all abstractions and
9829 translates to the operator "split";
9836 * new infix operator, addss, allowing the classical reasoner to
9837 perform simplification at each step of its search. Example:
9838 fast_tac (cs addss ss)
9840 * a new logic, CHOL, the same as HOL, but with a curried syntax
9841 for functions. Application looks like f a b instead of f(a,b). Also pairs
9842 look like (a,b) instead of <a,b>;
9844 * PLEASE NOTE: CHOL will eventually replace HOL!
9846 * In CHOL, pattern-matching on tuples is now available in all abstractions.
9847 It translates to the operator "split". A new theory of integers is available;
9849 * In ZF, integer numerals now denote two's-complement binary integers.
9850 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
9852 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
9853 of the Axiom of Choice;
9860 * Significantly faster resolution;
9862 * the different sections in a .thy file can now be mixed and repeated
9865 * Database of theorems for FOL, HOL and ZF. New
9866 commands including qed, qed_goal and bind_thm store theorems in the database.
9868 * Simple database queries: return a named theorem (get_thm) or all theorems of
9869 a given theory (thms_of), or find out what theory a theorem was proved in
9872 * Bugs fixed in the inductive definition and datatype packages;
9874 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
9875 and HOL_dup_cs obsolete;
9877 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
9880 * Simpler definition of function space in ZF;
9882 * new results about cardinal and ordinal arithmetic in ZF;
9884 * 'subtype' facility in HOL for introducing new types as subsets of existing
9887 :mode=text:wrap=hard:maxLineLen=72: