highest priority for proofs with unknown / very short timing -- recover original scheduling with parallel_proofs_reuse_timing = false;
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Numeric types mapped by default to target language numerals:
10 natural (replaces former code_numeral) and integer (replaces
11 former code_int). Conversions are available as integer_of_natural /
12 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
13 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in ML).
16 * Discontinued theories Code_Integer and Efficient_Nat by a more
17 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
18 Code_Target_Nat and Code_Target_Numeral. See the tutorial on
19 code generation for details. INCOMPATIBILITY.
21 * Theory "RealVector" and "Limits": Introduce type class
22 (lin)order_topology. Allows to generalize theorems about limits and
23 order. Instances are reals and extended reals.
25 * Consolidation of library theories on product orders:
27 Product_Lattice ~> Product_Order -- pointwise order on products
28 Product_ord ~> Product_Lexorder -- lexicographic order on products
35 isar_shrink ~> isar_compress
38 New in Isabelle2013 (February 2013)
39 -----------------------------------
43 * Theorem status about oracles and unfinished/failed future proofs is
44 no longer printed by default, since it is incompatible with
45 incremental / parallel checking of the persistent document model. ML
46 function Thm.peek_status may be used to inspect a snapshot of the
47 ongoing evaluation process. Note that in batch mode --- notably
48 isabelle build --- the system ensures that future proofs of all
49 accessible theorems in the theory context are finished (as before).
51 * Configuration option show_markup controls direct inlining of markup
52 into the printed representation of formal entities --- notably type
53 and sort constraints. This enables Prover IDE users to retrieve that
54 information via tooltips in the output window, for example.
56 * Command 'ML_file' evaluates ML text from a file directly within the
57 theory, without any predeclaration via 'uses' in the theory header.
59 * Old command 'use' command and corresponding keyword 'uses' in the
60 theory header are legacy features and will be discontinued soon.
61 Tools that load their additional source files may imitate the
62 'ML_file' implementation, such that the system can take care of
63 dependencies properly.
65 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
66 is called fastforce / fast_force_tac already since Isabelle2011-1.
68 * Updated and extended "isar-ref" and "implementation" manual, reduced
69 remaining material in old "ref" manual.
71 * Improved support for auxiliary contexts that indicate block structure
72 for specifications. Nesting of "context fixes ... context assumes ..."
73 and "class ... context ...".
75 * Attribute "consumes" allows a negative value as well, which is
76 interpreted relatively to the total number of premises of the rule in
77 the target context. This form of declaration is stable when exported
78 from a nested 'context' with additional assumptions. It is the
79 preferred form for definitional packages, notably cases/rules produced
80 in HOL/inductive and HOL/function.
82 * More informative error messages for Isar proof commands involving
83 lazy enumerations (method applications etc.).
85 * Refined 'help' command to retrieve outer syntax commands according
86 to name patterns (with clickable results).
89 *** Prover IDE -- Isabelle/Scala/jEdit ***
91 * Parallel terminal proofs ('by') are enabled by default, likewise
92 proofs that are built into packages like 'datatype', 'function'. This
93 allows to "run ahead" checking the theory specifications on the
94 surface, while the prover is still crunching on internal
95 justifications. Unfinished / cancelled proofs are restarted as
96 required to complete full proof checking eventually.
98 * Improved output panel with tooltips, hyperlinks etc. based on the
99 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
100 tooltips leads to some window that supports the same recursively,
101 which can lead to stacks of tooltips as the semantic document content
102 is explored. ESCAPE closes the whole stack, individual windows may be
103 closed separately, or detached to become independent jEdit dockables.
105 * Improved support for commands that produce graph output: the text
106 message contains a clickable area to open a new instance of the graph
109 * More robust incremental parsing of outer syntax (partial comments,
110 malformed symbols). Changing the balance of open/close quotes and
111 comment delimiters works more conveniently with unfinished situations
112 that frequently occur in user interaction.
114 * More efficient painting and improved reactivity when editing large
115 files. More scalable management of formal document content.
117 * Smarter handling of tracing messages: prover process pauses after
118 certain number of messages per command transaction, with some user
119 dialog to stop or continue. This avoids swamping the front-end with
120 potentially infinite message streams.
122 * More plugin options and preferences, based on Isabelle/Scala. The
123 jEdit plugin option panel provides access to some Isabelle/Scala
124 options, including tuning parameters for editor reactivity and color
127 * Dockable window "Symbols" provides some editing support for Isabelle
130 * Dockable window "Monitor" shows ML runtime statistics. Note that
131 continuous display of the chart slows down the system.
133 * Improved editing support for control styles: subscript, superscript,
134 bold, reset of style -- operating on single symbols or text
135 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
137 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
138 adjust the main text area font size, and its derivatives for output,
139 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
140 need to be adapted to local keyboard layouts.
142 * More reactive completion popup by default: use \t (TAB) instead of
143 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
144 also "Plugin Options / SideKick / General / Code Completion Options".
146 * Implicit check and build dialog of the specified logic session
147 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
148 demand, without bundling big platform-dependent heap images in the
149 Isabelle distribution.
151 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
152 from Oracle provide better multi-platform experience. This version is
153 now bundled exclusively with Isabelle.
158 * Code generation for Haskell: restrict unqualified imports from
159 Haskell Prelude to a small set of fundamental operations.
161 * Command 'export_code': relative file names are interpreted
162 relatively to master directory of current theory rather than the
163 rather arbitrary current working directory. INCOMPATIBILITY.
165 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
166 use regular rule composition via "OF" / "THEN", or explicit proof
167 structure instead. Note that Isabelle/ML provides a variety of
168 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
169 with some care where this is really required.
171 * Command 'typ' supports an additional variant with explicit sort
172 constraint, to infer and check the most general type conforming to a
173 given sort. Example (in HOL):
175 typ "_ * _ * bool * unit" :: finite
177 * Command 'locale_deps' visualizes all locales and their relations as
185 - Added MaSh relevance filter based on machine-learning; see the
186 Sledgehammer manual for details.
187 - Polished Isar proofs generated with "isar_proofs" option.
188 - Rationalized type encodings ("type_enc" option).
189 - Renamed "kill_provers" subcommand to "kill_all".
191 isar_proof ~> isar_proofs
192 isar_shrink_factor ~> isar_shrink
193 max_relevant ~> max_facts
194 relevance_thresholds ~> fact_thresholds
196 * Quickcheck: added an optimisation for equality premises. It is
197 switched on by default, and can be switched off by setting the
198 configuration quickcheck_optimise_equality to false.
200 * Quotient: only one quotient can be defined by quotient_type
204 - generation of an abstraction function equation in lift_definition
206 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
208 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
211 * Preprocessing of the code generator rewrites set comprehensions into
212 pointfree expressions.
214 * The SMT solver Z3 has now by default a restricted set of directly
215 supported features. For the full set of features (div/mod, nonlinear
216 arithmetic, datatypes/records) with potential proof reconstruction
217 failures, enable the configuration option "z3_with_extensions". Minor
220 * Simplified 'typedef' specifications: historical options for implicit
221 set definition and alternative name have been discontinued. The
222 former behavior of "typedef (open) t = A" is now the default, but
223 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
226 * Removed constant "chars"; prefer "Enum.enum" on type "char"
227 directly. INCOMPATIBILITY.
229 * Moved operation product, sublists and n_lists from theory Enum to
230 List. INCOMPATIBILITY.
232 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
234 * Class "comm_monoid_diff" formalises properties of bounded
235 subtraction, with natural numbers and multisets as typical instances.
237 * Added combinator "Option.these" with type "'a option set => 'a set".
239 * Theory "Transitive_Closure": renamed lemmas
241 reflcl_tranclp -> reflclp_tranclp
242 rtranclp_reflcl -> rtranclp_reflclp
246 * Theory "Rings": renamed lemmas (in class semiring)
248 left_distrib ~> distrib_right
249 right_distrib ~> distrib_left
253 * Generalized the definition of limits:
255 - Introduced the predicate filterlim (LIM x F. f x :> G) which
256 expresses that when the input values x converge to F then the
257 output f x converges to G.
259 - Added filters for convergence to positive (at_top) and negative
262 - Moved infinity in the norm (at_infinity) from
263 Multivariate_Analysis to Complex_Main.
265 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
270 * Theory "Library/Option_ord" provides instantiation of option type to
271 lattice type classes.
273 * Theory "Library/Multiset": renamed
275 constant fold_mset ~> Multiset.fold
276 fact fold_mset_commute ~> fold_mset_comm
280 * Renamed theory Library/List_Prefix to Library/Sublist, with related
283 - Renamed constants (and related lemmas)
286 strict_prefix ~> prefix
288 - Replaced constant "postfix" by "suffixeq" with swapped argument
289 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
290 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
291 Renamed lemmas accordingly.
293 - Added constant "list_hembeq" for homeomorphic embedding on
294 lists. Added abbreviation "sublisteq" for special case
295 "list_hembeq (op =)".
297 - Theory Library/Sublist no longer provides "order" and "bot" type
298 class instances for the prefix order (merely corresponding locale
299 interpretations). The type class instances are now in theory
300 Library/Prefix_Order.
302 - The sublist relation of theory Library/Sublist_Order is now based
303 on "Sublist.sublisteq". Renamed lemmas accordingly:
305 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
306 le_list_append_mono ~> Sublist.list_hembeq_append_mono
307 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
308 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
309 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
310 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
311 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
312 le_list_drop_many ~> Sublist.sublisteq_drop_many
313 le_list_filter_left ~> Sublist.sublisteq_filter_left
314 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
315 le_list_rev_take_iff ~> Sublist.sublisteq_append
316 le_list_same_length ~> Sublist.sublisteq_same_length
317 le_list_take_many_iff ~> Sublist.sublisteq_append'
318 less_eq_list.drop ~> less_eq_list_drop
319 less_eq_list.induct ~> less_eq_list_induct
320 not_le_list_length ~> Sublist.not_sublisteq_length
324 * New theory Library/Countable_Set.
326 * Theory Library/Debug and Library/Parallel provide debugging and
327 parallel execution for code generated towards Isabelle/ML.
329 * Theory Library/FuncSet: Extended support for Pi and extensional and
330 introduce the extensional dependent function space "PiE". Replaced
331 extensional_funcset by an abbreviation, and renamed lemmas from
332 extensional_funcset to PiE as follows:
334 extensional_empty ~> PiE_empty
335 extensional_funcset_empty_domain ~> PiE_empty_domain
336 extensional_funcset_empty_range ~> PiE_empty_range
337 extensional_funcset_arb ~> PiE_arb
338 extensional_funcset_mem ~> PiE_mem
339 extensional_funcset_extend_domainI ~> PiE_fun_upd
340 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
341 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
342 card_extensional_funcset ~> card_PiE
343 finite_extensional_funcset ~> finite_PiE
347 * Theory Library/FinFun: theory of almost everywhere constant
348 functions (supersedes the AFP entry "Code Generation for Functions as
351 * Theory Library/Phantom: generic phantom type to make a type
352 parameter appear in a constant's type. This alternative to adding
353 TYPE('a) as another parameter avoids unnecessary closures in generated
356 * Theory Library/RBT_Impl: efficient construction of red-black trees
357 from sorted associative lists. Merging two trees with rbt_union may
358 return a structurally different tree than before. Potential
361 * Theory Library/IArray: immutable arrays with code generation.
363 * Theory Library/Finite_Lattice: theory of finite lattices.
365 * HOL/Multivariate_Analysis: replaced
367 "basis :: 'a::euclidean_space => nat => real"
368 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
370 on euclidean spaces by using the inner product "_ \<bullet> _" with
371 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
372 "SUM i : Basis. f i * r i".
374 With this change the following constants are also changed or removed:
376 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
377 a $$ i ~> inner a i (where i : Basis)
379 \<pi>, \<pi>' removed
381 Theorems about these constants where removed.
385 component_le_norm ~> Basis_le_norm
386 euclidean_eq ~> euclidean_eq_iff
387 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
388 euclidean_simps ~> inner_simps
389 independent_basis ~> independent_Basis
390 span_basis ~> span_Basis
391 in_span_basis ~> in_span_Basis
392 norm_bound_component_le ~> norm_boound_Basis_le
393 norm_bound_component_lt ~> norm_boound_Basis_lt
394 component_le_infnorm ~> Basis_le_infnorm
400 - Added simproc "measurable" to automatically prove measurability.
402 - Added induction rules for sigma sets with disjoint union
403 (sigma_sets_induct_disjoint) and for Borel-measurable functions
404 (borel_measurable_induct).
406 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
409 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
410 AFP entry "Ordinals_and_Cardinals").
412 * HOL/BNF: New (co)datatype package based on bounded natural functors
413 with support for mixed, nested recursion and interesting non-free
416 * HOL/Finite_Set and Relation: added new set and relation operations
417 expressed by Finite_Set.fold.
419 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
420 trees for the code generator.
422 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
424 possible INCOMPATIBILITY.
426 * HOL/Set: renamed Set.project -> Set.filter
430 *** Document preparation ***
432 * Dropped legacy antiquotations "term_style" and "thm_style", since
433 styles may be given as arguments to "term" and "thm" already.
434 Discontinued legacy styles "prem1" .. "prem19".
436 * Default LaTeX rendering for \<euro> is now based on eurosym package,
437 instead of slightly exotic babel/greek.
439 * Document variant NAME may use different LaTeX entry point
440 document/root_NAME.tex if that file exists, instead of the common
443 * Simplified custom document/build script, instead of old-style
444 document/IsaMakefile. Minor INCOMPATIBILITY.
449 * The default limit for maximum number of worker threads is now 8,
450 instead of 4, in correspondence to capabilities of contemporary
451 hardware and Poly/ML runtime system.
453 * Type Seq.results and related operations support embedded error
454 messages within lazy enumerations, and thus allow to provide
455 informative errors in the absence of any usable results.
457 * Renamed Position.str_of to Position.here to emphasize that this is a
458 formal device to inline positions into message text, but not
459 necessarily printing visible text.
464 * Advanced support for Isabelle sessions and build management, see
465 "system" manual for the chapter of that name, especially the "isabelle
466 build" tool and its examples. The "isabelle mkroot" tool prepares
467 session root directories for use with "isabelle build", similar to
468 former "isabelle mkdir" for "isabelle usedir". Note that this affects
469 document preparation as well. INCOMPATIBILITY, isabelle usedir /
470 mkdir / make are rendered obsolete.
472 * Discontinued obsolete Isabelle/build script, it is superseded by the
473 regular isabelle build tool. For example:
475 isabelle build -s -b HOL
477 * Discontinued obsolete "isabelle makeall".
479 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
480 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
481 provides some traditional targets that invoke "isabelle build". Note
482 that this is inefficient! Applications of Isabelle/HOL involving
483 "isabelle make" should be upgraded to use "isabelle build" directly.
485 * The "isabelle options" tool prints Isabelle system options, as
486 required for "isabelle build", for example.
488 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
489 Minor INCOMPATIBILITY in command-line options.
491 * The "isabelle install" tool has now a simpler command-line. Minor
494 * The "isabelle components" tool helps to resolve add-on components
495 that are not bundled, or referenced from a bare-bones repository
498 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
499 platform family: "linux", "macos", "windows".
501 * The ML system is configured as regular component, and no longer
502 picked up from some surrounding directory. Potential INCOMPATIBILITY
503 for home-made settings.
505 * Improved ML runtime statistics (heap, threads, future tasks etc.).
507 * Discontinued support for Poly/ML 5.2.1, which was the last version
508 without exception positions and advanced ML compiler/toplevel
511 * Discontinued special treatment of Proof General -- no longer guess
512 PROOFGENERAL_HOME based on accidental file-system layout. Minor
513 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
514 settings manually, or use a Proof General version that has been
515 bundled as Isabelle component.
519 New in Isabelle2012 (May 2012)
520 ------------------------------
524 * Prover IDE (PIDE) improvements:
526 - more robust Sledgehammer integration (as before the sledgehammer
527 command-line needs to be typed into the source buffer)
528 - markup for bound variables
529 - markup for types of term variables (displayed as tooltips)
530 - support for user-defined Isar commands within the running session
531 - improved support for Unicode outside original 16bit range
532 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
534 * Forward declaration of outer syntax keywords within the theory
535 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
536 commands to be used in the same theory where defined.
538 * Auxiliary contexts indicate block structure for specifications with
539 additional parameters and assumptions. Such unnamed contexts may be
540 nested within other targets, like 'theory', 'locale', 'class',
541 'instantiation' etc. Results from the local context are generalized
542 accordingly and applied to the enclosing target context. Example:
546 assumes xy: "x = y" and yz: "y = z"
549 lemma my_trans: "x = z" using xy yz by simp
555 The most basic application is to factor-out context elements of
556 several fixes/assumes/shows theorem statements, e.g. see
557 ~~/src/HOL/Isar_Examples/Group_Context.thy
559 Any other local theory specification element works within the "context
560 ... begin ... end" block as well.
562 * Bundled declarations associate attributed fact expressions with a
563 given name in the context. These may be later included in other
564 contexts. This allows to manage context extensions casually, without
565 the logical dependencies of locales and locale interpretation. See
566 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
568 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
569 declaration, and results are standardized before being stored. Thus
570 old-style "standard" after instantiation or composition of facts
571 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
572 indices of schematic variables.
574 * Rule attributes in local theory declarations (e.g. locale or class)
575 are now statically evaluated: the resulting theorem is stored instead
576 of the original expression. INCOMPATIBILITY in rare situations, where
577 the historic accident of dynamic re-evaluation in interpretations
580 * New tutorial "Programming and Proving in Isabelle/HOL"
581 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
582 Structured Isar Proofs" ("isar-overview"), which has been removed. It
583 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
584 Logic" as the recommended beginners tutorial, but does not cover all
585 of the material of that old tutorial.
587 * Updated and extended reference manuals: "isar-ref",
588 "implementation", "system"; reduced remaining material in old "ref"
594 * Command 'definition' no longer exports the foundational "raw_def"
595 into the user context. Minor INCOMPATIBILITY, may use the regular
596 "def" result with attribute "abs_def" to imitate the old version.
598 * Attribute "abs_def" turns an equation of the form "f x y == t" into
599 "f == %x y. t", which ensures that "simp" or "unfold" steps always
600 expand it. This also works for object-logic equality. (Formerly
601 undocumented feature.)
603 * Sort constraints are now propagated in simultaneous statements, just
604 like type constraints. INCOMPATIBILITY in rare situations, where
605 distinct sorts used to be assigned accidentally. For example:
607 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
609 lemma "P (x::'a)" and "Q (y::'a::bar)"
610 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
612 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
613 tolerant against multiple unifiers, as long as the final result is
614 unique. (As before, rules are composed in canonical right-to-left
615 order to accommodate newly introduced premises.)
617 * Renamed some inner syntax categories:
623 Minor INCOMPATIBILITY. Note that in practice "num_const" or
624 "num_position" etc. are mainly used instead (which also include
625 position information via constraints).
627 * Simplified configuration options for syntax ambiguity: see
628 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
629 manual. Minor INCOMPATIBILITY.
631 * Discontinued configuration option "syntax_positions": atomic terms
632 in parse trees are always annotated by position constraints.
634 * Old code generator for SML and its commands 'code_module',
635 'code_library', 'consts_code', 'types_code' have been discontinued.
636 Use commands of the generic code generator instead. INCOMPATIBILITY.
638 * Redundant attribute "code_inline" has been discontinued. Use
639 "code_unfold" instead. INCOMPATIBILITY.
641 * Dropped attribute "code_unfold_post" in favor of the its dual
642 "code_abbrev", which yields a common pattern in definitions like
644 definition [code_abbrev]: "f = t"
648 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
649 instead. INCOMPATIBILITY.
651 * Discontinued old "prems" fact, which used to refer to the accidental
652 collection of foundational premises in the context (already marked as
653 legacy since Isabelle2011).
658 * Type 'a set is now a proper type constructor (just as before
659 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
660 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
661 sets separate, it is often sufficient to rephrase some set S that has
662 been accidentally used as predicates by "%x. x : S", and some
663 predicate P that has been accidentally used as set by "{x. P x}".
664 Corresponding proofs in a first step should be pruned from any
665 tinkering with former theorems mem_def and Collect_def as far as
668 For developments which deliberately mix predicates and sets, a
669 planning step is necessary to determine what should become a predicate
670 and what a set. It can be helpful to carry out that step in
671 Isabelle2011-1 before jumping right into the current release.
673 * Code generation by default implements sets as container type rather
674 than predicates. INCOMPATIBILITY.
676 * New type synonym 'a rel = ('a * 'a) set
678 * The representation of numerals has changed. Datatype "num"
679 represents strictly positive binary numerals, along with functions
680 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
681 positive and negated numeric literals, respectively. See also
682 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
683 user theories may require adaptations as follows:
685 - Theorems with number_ring or number_semiring constraints: These
686 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
688 - Theories defining numeric types: Remove number, number_semiring,
689 and number_ring instances. Defer all theorems about numerals until
690 after classes one and semigroup_add have been instantiated.
692 - Numeral-only simp rules: Replace each rule having a "number_of v"
693 pattern with two copies, one for numeral and one for neg_numeral.
695 - Theorems about subclasses of semiring_1 or ring_1: These classes
696 automatically support numerals now, so more simp rules and
697 simprocs may now apply within the proof.
699 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
700 Redefine using other integer operations.
702 * Transfer: New package intended to generalize the existing
703 "descending" method and related theorem attributes from the Quotient
704 package. (Not all functionality is implemented yet, but future
705 development will focus on Transfer as an eventual replacement for the
706 corresponding parts of the Quotient package.)
708 - transfer_rule attribute: Maintains a collection of transfer rules,
709 which relate constants at two different types. Transfer rules may
710 relate different type instances of the same polymorphic constant,
711 or they may relate an operation on a raw type to a corresponding
712 operation on an abstract type (quotient or subtype). For example:
714 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
715 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
717 - transfer method: Replaces a subgoal on abstract types with an
718 equivalent subgoal on the corresponding raw types. Constants are
719 replaced with corresponding ones according to the transfer rules.
720 Goals are generalized over all free variables by default; this is
721 necessary for variables whose types change, but can be overridden
722 for specific variables with e.g. "transfer fixing: x y z". The
723 variant transfer' method allows replacing a subgoal with one that
724 is logically stronger (rather than equivalent).
726 - relator_eq attribute: Collects identity laws for relators of
727 various type constructors, e.g. "list_all2 (op =) = (op =)". The
728 transfer method uses these lemmas to infer transfer rules for
729 non-polymorphic constants on the fly.
731 - transfer_prover method: Assists with proving a transfer rule for a
732 new constant, provided the constant is defined in terms of other
733 constants that already have transfer rules. It should be applied
734 after unfolding the constant definitions.
736 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
737 from type nat to type int.
739 * Lifting: New package intended to generalize the quotient_definition
740 facility of the Quotient package; designed to work with Transfer.
742 - lift_definition command: Defines operations on an abstract type in
743 terms of a corresponding operation on a representation
744 type. Example syntax:
746 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
749 Users must discharge a respectfulness proof obligation when each
750 constant is defined. (For a type copy, i.e. a typedef with UNIV,
751 the proof is discharged automatically.) The obligation is
752 presented in a user-friendly, readable form; a respectfulness
753 theorem in the standard format and a transfer rule are generated
756 - Integration with code_abstype: For typedefs (e.g. subtypes
757 corresponding to a datatype invariant, such as dlist),
758 lift_definition generates a code certificate theorem and sets up
759 code generation for each constant.
761 - setup_lifting command: Sets up the Lifting package to work with a
762 user-defined type. The user must provide either a quotient theorem
763 or a type_definition theorem. The package configures transfer
764 rules for equality and quantifiers on the type, and sets up the
765 lift_definition command to work with the type.
767 - Usage examples: See Quotient_Examples/Lift_DList.thy,
768 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
769 Word/Word.thy and Library/Float.thy.
773 - The 'quotient_type' command now supports a 'morphisms' option with
774 rep and abs functions, similar to typedef.
776 - 'quotient_type' sets up new types to work with the Lifting and
777 Transfer packages, as with 'setup_lifting'.
779 - The 'quotient_definition' command now requires the user to prove a
780 respectfulness property at the point where the constant is
781 defined, similar to lift_definition; INCOMPATIBILITY.
783 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
784 accordingly, INCOMPATIBILITY.
786 * New diagnostic command 'find_unused_assms' to find potentially
787 superfluous assumptions in theorems using Quickcheck.
791 - Quickcheck returns variable assignments as counterexamples, which
792 allows to reveal the underspecification of functions under test.
793 For example, refuting "hd xs = x", it presents the variable
794 assignment xs = [] and x = a1 as a counterexample, assuming that
795 any property is false whenever "hd []" occurs in it.
797 These counterexample are marked as potentially spurious, as
798 Quickcheck also returns "xs = []" as a counterexample to the
799 obvious theorem "hd xs = hd xs".
801 After finding a potentially spurious counterexample, Quickcheck
802 continues searching for genuine ones.
804 By default, Quickcheck shows potentially spurious and genuine
805 counterexamples. The option "genuine_only" sets quickcheck to only
806 show genuine counterexamples.
808 - The command 'quickcheck_generator' creates random and exhaustive
809 value generators for a given type and operations.
811 It generates values by using the operations as if they were
812 constructors of that type.
814 - Support for multisets.
816 - Added "use_subtype" options.
818 - Added "quickcheck_locale" configuration to specify how to process
819 conjectures in a locale context.
821 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
822 and affecting 'rat' and 'real'.
825 - Integrated more tightly with SPASS, as described in the ITP 2012
826 paper "More SPASS with Isabelle".
827 - Made it try "smt" as a fallback if "metis" fails or times out.
828 - Added support for the following provers: Alt-Ergo (via Why3 and
829 TFF1), iProver, iProver-Eq.
830 - Sped up the minimizer.
831 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
832 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
833 - Renamed "sound" option to "strict".
835 * Metis: Added possibility to specify lambda translations scheme as a
836 parenthesized argument (e.g., "by (metis (lifting) ...)").
838 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
840 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
842 * New "case_product" attribute to generate a case rule doing multiple
843 case distinctions at the same time. E.g.
845 list.exhaust [case_product nat.exhaust]
847 produces a rule which can be used to perform case distinction on both
850 * New "eventually_elim" method as a generalized variant of the
851 eventually_elim* rules. Supports structured proofs.
853 * Typedef with implicit set definition is considered legacy. Use
854 "typedef (open)" form instead, which will eventually become the
857 * Record: code generation can be switched off manually with
859 declare [[record_coden = false]] -- "default true"
861 * Datatype: type parameters allow explicit sort constraints.
863 * Concrete syntax for case expressions includes constraints for source
864 positions, and thus produces Prover IDE markup for its bindings.
865 INCOMPATIBILITY for old-style syntax translations that augment the
866 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
869 * Clarified attribute "mono_set": pure declaration without modifying
870 the result of the fact expression.
872 * More default pred/set conversions on a couple of relation operations
873 and predicates. Added powers of predicate relations. Consolidation
874 of some relation theorems:
876 converse_def ~> converse_unfold
877 rel_comp_def ~> relcomp_unfold
878 symp_def ~> (modified, use symp_def and sym_def instead)
879 transp_def ~> transp_trans
880 Domain_def ~> Domain_unfold
881 Range_def ~> Domain_converse [symmetric]
883 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
885 See theory "Relation" for examples for making use of pred/set
886 conversions by means of attributes "to_set" and "to_pred".
890 * Renamed facts about the power operation on relations, i.e., relpow
891 to match the constant's name:
893 rel_pow_1 ~> relpow_1
894 rel_pow_0_I ~> relpow_0_I
895 rel_pow_Suc_I ~> relpow_Suc_I
896 rel_pow_Suc_I2 ~> relpow_Suc_I2
897 rel_pow_0_E ~> relpow_0_E
898 rel_pow_Suc_E ~> relpow_Suc_E
899 rel_pow_E ~> relpow_E
900 rel_pow_Suc_D2 ~> relpow_Suc_D2
901 rel_pow_Suc_E2 ~> relpow_Suc_E2
902 rel_pow_Suc_D2' ~> relpow_Suc_D2'
903 rel_pow_E2 ~> relpow_E2
904 rel_pow_add ~> relpow_add
905 rel_pow_commute ~> relpow
906 rel_pow_empty ~> relpow_empty:
907 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
908 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
909 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
910 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
911 rel_pow_fun_conv ~> relpow_fun_conv
912 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
913 rel_pow_finite_bounded ~> relpow_finite_bounded
914 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
915 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
916 single_valued_rel_pow ~> single_valued_relpow
920 * Theory Relation: Consolidated constant name for relation composition
921 and corresponding theorem names:
923 - Renamed constant rel_comp to relcomp.
925 - Dropped abbreviation pred_comp. Use relcompp instead.
929 rel_compI ~> relcompI
930 rel_compEpair ~> relcompEpair
931 rel_compE ~> relcompE
932 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
933 rel_comp_empty1 ~> relcomp_empty1
934 rel_comp_mono ~> relcomp_mono
935 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
936 rel_comp_distrib ~> relcomp_distrib
937 rel_comp_distrib2 ~> relcomp_distrib2
938 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
939 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
940 single_valued_rel_comp ~> single_valued_relcomp
941 rel_comp_def ~> relcomp_unfold
942 converse_rel_comp ~> converse_relcomp
943 pred_compI ~> relcomppI
944 pred_compE ~> relcomppE
945 pred_comp_bot1 ~> relcompp_bot1
946 pred_comp_bot2 ~> relcompp_bot2
947 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
948 pred_comp_mono ~> relcompp_mono
949 pred_comp_distrib ~> relcompp_distrib
950 pred_comp_distrib2 ~> relcompp_distrib2
951 converse_pred_comp ~> converse_relcompp
953 finite_rel_comp ~> finite_relcomp
955 set_rel_comp ~> set_relcomp
959 * Theory Divides: Discontinued redundant theorems about div and mod.
960 INCOMPATIBILITY, use the corresponding generic theorems instead.
962 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
963 zdiv_self ~> div_self
964 zmod_self ~> mod_self
967 zdiv_zmod_equality ~> div_mod_equality2
968 zdiv_zmod_equality2 ~> div_mod_equality
969 zmod_zdiv_trivial ~> mod_div_trivial
970 zdiv_zminus_zminus ~> div_minus_minus
971 zmod_zminus_zminus ~> mod_minus_minus
972 zdiv_zminus2 ~> div_minus_right
973 zmod_zminus2 ~> mod_minus_right
974 zdiv_minus1_right ~> div_minus1_right
975 zmod_minus1_right ~> mod_minus1_right
976 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
977 zmod_zmult1_eq ~> mod_mult_right_eq
978 zpower_zmod ~> power_mod
980 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
981 mod_mult_distrib ~> mult_mod_left
982 mod_mult_distrib2 ~> mult_mod_right
984 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
985 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
987 * Finite_Set.fold now qualified. INCOMPATIBILITY.
989 * Consolidated theorem names concerning fold combinators:
991 inf_INFI_fold_inf ~> inf_INF_fold_inf
992 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
993 INFI_fold_inf ~> INF_fold_inf
994 SUPR_fold_sup ~> SUP_fold_sup
995 union_set ~> union_set_fold
996 minus_set ~> minus_set_fold
997 INFI_set_fold ~> INF_set_fold
998 SUPR_set_fold ~> SUP_set_fold
999 INF_code ~> INF_set_foldr
1000 SUP_code ~> SUP_set_foldr
1001 foldr.simps ~> foldr.simps (in point-free formulation)
1002 foldr_fold_rev ~> foldr_conv_fold
1003 foldl_fold ~> foldl_conv_fold
1004 foldr_foldr ~> foldr_conv_foldl
1005 foldl_foldr ~> foldl_conv_foldr
1006 fold_set_remdups ~> fold_set_fold_remdups
1007 fold_set ~> fold_set_fold
1008 fold1_set ~> fold1_set_fold
1012 * Dropped rarely useful theorems concerning fold combinators:
1013 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1014 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1015 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1016 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1017 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1018 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1019 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1020 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1021 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1022 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1024 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1025 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1026 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1027 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1028 lemmas over fold rather than foldr, or make use of lemmas
1029 fold_conv_foldr and fold_rev.
1031 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1032 through option types.
1034 * "Transitive_Closure.ntrancl": bounded transitive closure on
1037 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1039 * Theory Int: Discontinued many legacy theorems specific to type int.
1040 INCOMPATIBILITY, use the corresponding generic theorems instead.
1042 zminus_zminus ~> minus_minus
1043 zminus_0 ~> minus_zero
1044 zminus_zadd_distrib ~> minus_add_distrib
1045 zadd_commute ~> add_commute
1046 zadd_assoc ~> add_assoc
1047 zadd_left_commute ~> add_left_commute
1050 zadd_0 ~> add_0_left
1051 zadd_0_right ~> add_0_right
1052 zadd_zminus_inverse2 ~> left_minus
1053 zmult_zminus ~> mult_minus_left
1054 zmult_commute ~> mult_commute
1055 zmult_assoc ~> mult_assoc
1056 zadd_zmult_distrib ~> left_distrib
1057 zadd_zmult_distrib2 ~> right_distrib
1058 zdiff_zmult_distrib ~> left_diff_distrib
1059 zdiff_zmult_distrib2 ~> right_diff_distrib
1060 zmult_1 ~> mult_1_left
1061 zmult_1_right ~> mult_1_right
1062 zle_refl ~> order_refl
1063 zle_trans ~> order_trans
1064 zle_antisym ~> order_antisym
1065 zle_linear ~> linorder_linear
1066 zless_linear ~> linorder_less_linear
1067 zadd_left_mono ~> add_left_mono
1068 zadd_strict_right_mono ~> add_strict_right_mono
1069 zadd_zless_mono ~> add_less_le_mono
1070 int_0_less_1 ~> zero_less_one
1071 int_0_neq_1 ~> zero_neq_one
1073 zpower_zadd_distrib ~> power_add
1074 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1075 zero_le_zpower_abs ~> zero_le_power_abs
1077 * Theory Deriv: Renamed
1079 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1081 * Theory Library/Multiset: Improved code generation of multisets.
1083 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1084 are expressed via type classes again. The special syntax
1085 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1086 setsum_set, which is now subsumed by Big_Operators.setsum.
1089 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1090 use theory HOL/Library/Nat_Bijection instead.
1092 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1093 trees is now inside a type class context. Names of affected
1094 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1095 theories working directly with raw red-black trees, adapt the names as
1099 bulkload -> rbt_bulkload
1100 del_from_left -> rbt_del_from_left
1101 del_from_right -> rbt_del_from_right
1103 delete -> rbt_delete
1105 insert -> rbt_insert
1106 insertw -> rbt_insert_with
1107 insert_with_key -> rbt_insert_with_key
1108 map_entry -> rbt_map_entry
1109 lookup -> rbt_lookup
1110 sorted -> rbt_sorted
1111 tree_greater -> rbt_greater
1112 tree_less -> rbt_less
1113 tree_less_symbol -> rbt_less_symbol
1115 union_with -> rbt_union_with
1116 union_with_key -> rbt_union_with_key
1119 balance_left_sorted -> balance_left_rbt_sorted
1120 balance_left_tree_greater -> balance_left_rbt_greater
1121 balance_left_tree_less -> balance_left_rbt_less
1122 balance_right_sorted -> balance_right_rbt_sorted
1123 balance_right_tree_greater -> balance_right_rbt_greater
1124 balance_right_tree_less -> balance_right_rbt_less
1125 balance_sorted -> balance_rbt_sorted
1126 balance_tree_greater -> balance_rbt_greater
1127 balance_tree_less -> balance_rbt_less
1128 bulkload_is_rbt -> rbt_bulkload_is_rbt
1129 combine_sorted -> combine_rbt_sorted
1130 combine_tree_greater -> combine_rbt_greater
1131 combine_tree_less -> combine_rbt_less
1132 delete_in_tree -> rbt_delete_in_tree
1133 delete_is_rbt -> rbt_delete_is_rbt
1134 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1135 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1136 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1137 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1138 del_in_tree -> rbt_del_in_tree
1139 del_inv1_inv2 -> rbt_del_inv1_inv2
1140 del_sorted -> rbt_del_rbt_sorted
1141 del_tree_greater -> rbt_del_rbt_greater
1142 del_tree_less -> rbt_del_rbt_less
1143 dom_lookup_Branch -> dom_rbt_lookup_Branch
1144 entries_lookup -> entries_rbt_lookup
1145 finite_dom_lookup -> finite_dom_rbt_lookup
1146 insert_sorted -> rbt_insert_rbt_sorted
1147 insertw_is_rbt -> rbt_insertw_is_rbt
1148 insertwk_is_rbt -> rbt_insertwk_is_rbt
1149 insertwk_sorted -> rbt_insertwk_rbt_sorted
1150 insertw_sorted -> rbt_insertw_rbt_sorted
1151 ins_sorted -> ins_rbt_sorted
1152 ins_tree_greater -> ins_rbt_greater
1153 ins_tree_less -> ins_rbt_less
1154 is_rbt_sorted -> is_rbt_rbt_sorted
1155 lookup_balance -> rbt_lookup_balance
1156 lookup_bulkload -> rbt_lookup_rbt_bulkload
1157 lookup_delete -> rbt_lookup_rbt_delete
1158 lookup_Empty -> rbt_lookup_Empty
1159 lookup_from_in_tree -> rbt_lookup_from_in_tree
1160 lookup_in_tree -> rbt_lookup_in_tree
1161 lookup_ins -> rbt_lookup_ins
1162 lookup_insert -> rbt_lookup_rbt_insert
1163 lookup_insertw -> rbt_lookup_rbt_insertw
1164 lookup_insertwk -> rbt_lookup_rbt_insertwk
1165 lookup_keys -> rbt_lookup_keys
1166 lookup_map -> rbt_lookup_map
1167 lookup_map_entry -> rbt_lookup_rbt_map_entry
1168 lookup_tree_greater -> rbt_lookup_rbt_greater
1169 lookup_tree_less -> rbt_lookup_rbt_less
1170 lookup_union -> rbt_lookup_rbt_union
1171 map_entry_color_of -> rbt_map_entry_color_of
1172 map_entry_inv1 -> rbt_map_entry_inv1
1173 map_entry_inv2 -> rbt_map_entry_inv2
1174 map_entry_is_rbt -> rbt_map_entry_is_rbt
1175 map_entry_sorted -> rbt_map_entry_rbt_sorted
1176 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1177 map_entry_tree_less -> rbt_map_entry_rbt_less
1178 map_tree_greater -> map_rbt_greater
1179 map_tree_less -> map_rbt_less
1180 map_sorted -> map_rbt_sorted
1181 paint_sorted -> paint_rbt_sorted
1182 paint_lookup -> paint_rbt_lookup
1183 paint_tree_greater -> paint_rbt_greater
1184 paint_tree_less -> paint_rbt_less
1185 sorted_entries -> rbt_sorted_entries
1186 tree_greater_eq_trans -> rbt_greater_eq_trans
1187 tree_greater_nit -> rbt_greater_nit
1188 tree_greater_prop -> rbt_greater_prop
1189 tree_greater_simps -> rbt_greater_simps
1190 tree_greater_trans -> rbt_greater_trans
1191 tree_less_eq_trans -> rbt_less_eq_trans
1192 tree_less_nit -> rbt_less_nit
1193 tree_less_prop -> rbt_less_prop
1194 tree_less_simps -> rbt_less_simps
1195 tree_less_trans -> rbt_less_trans
1196 tree_ord_props -> rbt_ord_props
1197 union_Branch -> rbt_union_Branch
1198 union_is_rbt -> rbt_union_is_rbt
1199 unionw_is_rbt -> rbt_unionw_is_rbt
1200 unionwk_is_rbt -> rbt_unionwk_is_rbt
1201 unionwk_sorted -> rbt_unionwk_rbt_sorted
1203 * Theory HOL/Library/Float: Floating point numbers are now defined as
1204 a subset of the real numbers. All operations are defined using the
1205 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1212 round_down -> float_round_down
1213 round_up -> float_round_up
1217 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1220 abs_float_def -> Float.compute_float_abs
1221 bitlen_ge0 -> bitlen_nonneg
1222 bitlen.simps -> Float.compute_bitlen
1223 float_components -> Float_mantissa_exponent
1224 float_divl.simps -> Float.compute_float_divl
1225 float_divr.simps -> Float.compute_float_divr
1226 float_eq_odd -> mult_powr_eq_mult_powr_iff
1227 float_power -> real_of_float_power
1228 lapprox_posrat_def -> Float.compute_lapprox_posrat
1229 lapprox_rat.simps -> Float.compute_lapprox_rat
1230 le_float_def' -> Float.compute_float_le
1231 le_float_def -> less_eq_float.rep_eq
1232 less_float_def' -> Float.compute_float_less
1233 less_float_def -> less_float.rep_eq
1234 normfloat_def -> Float.compute_normfloat
1235 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1236 normfloat -> normfloat_def
1237 normfloat_unique -> use normfloat_def
1238 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1239 one_float_def -> Float.compute_float_one
1240 plus_float_def -> Float.compute_float_plus
1241 rapprox_posrat_def -> Float.compute_rapprox_posrat
1242 rapprox_rat.simps -> Float.compute_rapprox_rat
1243 real_of_float_0 -> zero_float.rep_eq
1244 real_of_float_1 -> one_float.rep_eq
1245 real_of_float_abs -> abs_float.rep_eq
1246 real_of_float_add -> plus_float.rep_eq
1247 real_of_float_minus -> uminus_float.rep_eq
1248 real_of_float_mult -> times_float.rep_eq
1249 real_of_float_simp -> Float.rep_eq
1250 real_of_float_sub -> minus_float.rep_eq
1251 round_down.simps -> Float.compute_float_round_down
1252 round_up.simps -> Float.compute_float_round_up
1253 times_float_def -> Float.compute_float_times
1254 uminus_float_def -> Float.compute_float_uminus
1255 zero_float_def -> Float.compute_float_zero
1257 Lemmas not necessary anymore, use the transfer method:
1258 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1259 float_divr, float_le_simp, float_less1_mantissa_bound,
1260 float_less_simp, float_less_zero, float_le_zero,
1261 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1262 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1263 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1264 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1265 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1266 round_up, zero_le_float, zero_less_float
1268 * New theory HOL/Library/DAList provides an abstract type for
1269 association lists with distinct keys.
1271 * Session HOL/IMP: Added new theory of abstract interpretation of
1274 * Session HOL-Import: Re-implementation from scratch is faster,
1275 simpler, and more scalable. Requires a proof bundle, which is
1276 available as an external component. Discontinued old (and mostly
1277 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1279 * Session HOL-Word: Discontinued many redundant theorems specific to
1280 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1283 word_sub_alt ~> word_sub_wi
1284 word_add_alt ~> word_add_def
1285 word_mult_alt ~> word_mult_def
1286 word_minus_alt ~> word_minus_def
1287 word_0_alt ~> word_0_wi
1288 word_1_alt ~> word_1_wi
1289 word_add_0 ~> add_0_left
1290 word_add_0_right ~> add_0_right
1291 word_mult_1 ~> mult_1_left
1292 word_mult_1_right ~> mult_1_right
1293 word_add_commute ~> add_commute
1294 word_add_assoc ~> add_assoc
1295 word_add_left_commute ~> add_left_commute
1296 word_mult_commute ~> mult_commute
1297 word_mult_assoc ~> mult_assoc
1298 word_mult_left_commute ~> mult_left_commute
1299 word_left_distrib ~> left_distrib
1300 word_right_distrib ~> right_distrib
1301 word_left_minus ~> left_minus
1302 word_diff_0_right ~> diff_0_right
1303 word_diff_self ~> diff_self
1304 word_sub_def ~> diff_minus
1305 word_diff_minus ~> diff_minus
1306 word_add_ac ~> add_ac
1307 word_mult_ac ~> mult_ac
1308 word_plus_ac0 ~> add_0_left add_0_right add_ac
1309 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1310 word_order_trans ~> order_trans
1311 word_order_refl ~> order_refl
1312 word_order_antisym ~> order_antisym
1313 word_order_linear ~> linorder_linear
1314 lenw1_zero_neq_one ~> zero_neq_one
1315 word_number_of_eq ~> number_of_eq
1316 word_of_int_add_hom ~> wi_hom_add
1317 word_of_int_sub_hom ~> wi_hom_sub
1318 word_of_int_mult_hom ~> wi_hom_mult
1319 word_of_int_minus_hom ~> wi_hom_neg
1320 word_of_int_succ_hom ~> wi_hom_succ
1321 word_of_int_pred_hom ~> wi_hom_pred
1322 word_of_int_0_hom ~> word_0_wi
1323 word_of_int_1_hom ~> word_1_wi
1325 * Session HOL-Word: New proof method "word_bitwise" for splitting
1326 machine word equalities and inequalities into logical circuits,
1327 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1328 multiplication, shifting by constants, bitwise operators and numeric
1329 constants. Requires fixed-length word types, not 'a word. Solves
1330 many standard word identities outright and converts more into first
1331 order problems amenable to blast or similar. See also examples in
1332 HOL/Word/Examples/WordExamples.thy.
1334 * Session HOL-Probability: Introduced the type "'a measure" to
1335 represent measures, this replaces the records 'a algebra and 'a
1336 measure_space. The locales based on subset_class now have two
1337 locale-parameters the space \<Omega> and the set of measurable sets M.
1338 The product of probability spaces uses now the same constant as the
1339 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1340 measure". Most constants are defined now outside of locales and gain
1341 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1342 Measure space constructions for distributions and densities now got
1343 their own constants distr and density. Instead of using locales to
1344 describe measure spaces with a finite space, the measure count_space
1345 and point_measure is introduced. INCOMPATIBILITY.
1349 finite_measure.\<mu>' -> measure
1350 product_algebra_generator -> prod_algebra
1351 product_prob_space.emb -> prod_emb
1352 product_prob_space.infprod_algebra -> PiM
1355 completeable_measure_space
1356 finite_measure_space
1358 finite_product_finite_prob_space
1359 finite_product_sigma_algebra
1360 finite_sigma_algebra
1362 pair_finite_prob_space
1363 pair_finite_sigma_algebra
1366 product_sigma_algebra
1370 distribution -> use distr measure, or distributed predicate
1372 joint_distribution -> use distr measure, or distributed predicate
1373 pair_measure_generator
1374 product_prob_space.infprod_algebra -> use PiM
1377 Replacement theorems:
1378 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1379 finite_measure.empty_measure -> measure_empty
1380 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1381 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1382 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1383 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1384 finite_measure.finite_measure -> finite_measure.emeasure_finite
1385 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1386 finite_measure.positive_measure' -> measure_nonneg
1387 finite_measure.real_measure -> finite_measure.emeasure_real
1388 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1389 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1390 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1391 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1392 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1393 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1394 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1395 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1396 information_space.entropy_commute -> information_space.entropy_commute_simple
1397 information_space.entropy_eq -> information_space.entropy_simple_distributed
1398 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1399 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1400 information_space.entropy_uniform_max -> information_space.entropy_uniform
1401 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1402 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1403 information_space.KL_ge_0 -> information_space.KL_nonneg
1404 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1405 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1406 Int_stable_cuboids -> Int_stable_atLeastAtMost
1407 Int_stable_product_algebra_generator -> positive_integral
1408 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1409 measure_space.additive -> emeasure_additive
1410 measure_space.AE_iff_null_set -> AE_iff_null
1411 measure_space.almost_everywhere_def -> eventually_ae_filter
1412 measure_space.almost_everywhere_vimage -> AE_distrD
1413 measure_space.continuity_from_above -> INF_emeasure_decseq
1414 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1415 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1416 measure_space.continuity_from_below -> SUP_emeasure_incseq
1417 measure_space_density -> emeasure_density
1418 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1419 measure_space.integrable_vimage -> integrable_distr
1420 measure_space.integral_translated_density -> integral_density
1421 measure_space.integral_vimage -> integral_distr
1422 measure_space.measure_additive -> plus_emeasure
1423 measure_space.measure_compl -> emeasure_compl
1424 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1425 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1426 measure_space.measure_decseq -> decseq_emeasure
1427 measure_space.measure_Diff -> emeasure_Diff
1428 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1429 measure_space.measure_eq_0 -> emeasure_eq_0
1430 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1431 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1432 measure_space.measure_incseq -> incseq_emeasure
1433 measure_space.measure_insert -> emeasure_insert
1434 measure_space.measure_mono -> emeasure_mono
1435 measure_space.measure_not_negative -> emeasure_not_MInf
1436 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1437 measure_space.measure_setsum -> setsum_emeasure
1438 measure_space.measure_setsum_split -> setsum_emeasure_cover
1439 measure_space.measure_space_vimage -> emeasure_distr
1440 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1441 measure_space.measure_subadditive -> subadditive
1442 measure_space.measure_top -> emeasure_space
1443 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1444 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1445 measure_space.positive_integral_translated_density -> positive_integral_density
1446 measure_space.positive_integral_vimage -> positive_integral_distr
1447 measure_space.real_continuity_from_above -> Lim_measure_decseq
1448 measure_space.real_continuity_from_below -> Lim_measure_incseq
1449 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1450 measure_space.real_measure_Diff -> measure_Diff
1451 measure_space.real_measure_finite_Union -> measure_finite_Union
1452 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1453 measure_space.real_measure_subadditive -> measure_subadditive
1454 measure_space.real_measure_Union -> measure_Union
1455 measure_space.real_measure_UNION -> measure_UNION
1456 measure_space.simple_function_vimage -> simple_function_comp
1457 measure_space.simple_integral_vimage -> simple_integral_distr
1458 measure_space.simple_integral_vimage -> simple_integral_distr
1459 measure_unique_Int_stable -> measure_eqI_generator_eq
1460 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1461 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1462 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1463 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1464 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1465 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1466 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1467 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1468 pair_sigma_algebra.sets_swap -> sets_pair_swap
1469 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1470 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1471 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1472 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1473 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1474 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1475 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1476 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1477 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1478 prob_space.prob_space_vimage -> prob_space_distr
1479 prob_space.random_variable_restrict -> measurable_restrict
1480 prob_space_unique_Int_stable -> measure_eqI_prob_space
1481 product_algebraE -> prod_algebraE_all
1482 product_algebra_generator_der -> prod_algebra_eq_finite
1483 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1484 product_algebraI -> sets_PiM_I_finite
1485 product_measure_exists -> product_sigma_finite.sigma_finite
1486 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1487 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1488 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1489 product_prob_space.measurable_component -> measurable_component_singleton
1490 product_prob_space.measurable_emb -> measurable_prod_emb
1491 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1492 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1493 product_prob_space.measure_emb -> emeasure_prod_emb
1494 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1495 product_sigma_algebra.product_algebra_into_space -> space_closed
1496 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1497 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1498 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1499 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1500 sets_product_algebra -> sets_PiM
1501 sigma_algebra.measurable_sigma -> measurable_measure_of
1502 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1503 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1504 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1505 space_product_algebra -> space_PiM
1507 * Session HOL-TPTP: support to parse and import TPTP problems (all
1508 languages) into Isabelle/HOL.
1513 * New "case_product" attribute (see HOL).
1518 * Greater support for structured proofs involving induction or case
1521 * Much greater use of mathematical symbols.
1523 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1528 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1529 from a minor keyword introduced via theory header declaration.
1531 * Antiquotation @{command_spec "name"} produces the
1532 Outer_Syntax.command_spec from a major keyword introduced via theory
1533 header declaration; it can be passed to Outer_Syntax.command etc.
1535 * Local_Theory.define no longer hard-wires default theorem name
1536 "foo_def", but retains the binding as given. If that is Binding.empty
1537 / Attrib.empty_binding, the result is not registered as user-level
1538 fact. The Local_Theory.define_internal variant allows to specify a
1539 non-empty name (used for the foundation in the background theory),
1540 while omitting the fact binding in the user-context. Potential
1541 INCOMPATIBILITY for derived definitional packages: need to specify
1542 naming policy for primitive definitions more explicitly.
1544 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1545 conformance with similar operations in structure Term and Logic.
1547 * Antiquotation @{attributes [...]} embeds attribute source
1548 representation into the ML text, which is particularly useful with
1549 declarations like Local_Theory.note.
1551 * Structure Proof_Context follows standard naming scheme. Old
1552 ProofContext has been discontinued. INCOMPATIBILITY.
1554 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1555 change of semantics: update is applied to auxiliary local theory
1558 * Modernized some old-style infix operations:
1560 addeqcongs ~> Simplifier.add_eqcong
1561 deleqcongs ~> Simplifier.del_eqcong
1562 addcongs ~> Simplifier.add_cong
1563 delcongs ~> Simplifier.del_cong
1564 setmksimps ~> Simplifier.set_mksimps
1565 setmkcong ~> Simplifier.set_mkcong
1566 setmksym ~> Simplifier.set_mksym
1567 setmkeqTrue ~> Simplifier.set_mkeqTrue
1568 settermless ~> Simplifier.set_termless
1569 setsubgoaler ~> Simplifier.set_subgoaler
1570 addsplits ~> Splitter.add_split
1571 delsplits ~> Splitter.del_split
1576 * USER_HOME settings variable points to cross-platform user home
1577 directory, which coincides with HOME on POSIX systems only. Likewise,
1578 the Isabelle path specification "~" now expands to $USER_HOME, instead
1579 of former $HOME. A different default for USER_HOME may be set
1580 explicitly in shell environment, before Isabelle settings are
1581 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1582 the generic user home was intended.
1584 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1585 notation, which is useful for the jEdit file browser, for example.
1587 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1592 New in Isabelle2011-1 (October 2011)
1593 ------------------------------------
1597 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1598 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1600 - Management of multiple theory files directly from the editor
1601 buffer store -- bypassing the file-system (no requirement to save
1602 files for checking).
1604 - Markup of formal entities within the text buffer, with semantic
1605 highlighting, tooltips and hyperlinks to jump to defining source
1608 - Improved text rendering, with sub/superscripts in the source
1609 buffer (including support for copy/paste wrt. output panel, HTML
1610 theory output and other non-Isabelle text boxes).
1612 - Refined scheduling of proof checking and printing of results,
1613 based on interactive editor view. (Note: jEdit folding and
1614 narrowing allows to restrict buffer perspectives explicitly.)
1616 - Reduced CPU performance requirements, usable on machines with few
1619 - Reduced memory requirements due to pruning of unused document
1620 versions (garbage collection).
1622 See also ~~/src/Tools/jEdit/README.html for further information,
1623 including some remaining limitations.
1625 * Theory loader: source files are exclusively located via the master
1626 directory of each theory node (where the .thy file itself resides).
1627 The global load path (such as src/HOL/Library) has been discontinued.
1628 Note that the path element ~~ may be used to reference theories in the
1629 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1632 * Theory loader: source files are identified by content via SHA1
1633 digests. Discontinued former path/modtime identification and optional
1634 ISABELLE_FILE_IDENT plugin scripts.
1636 * Parallelization of nested Isar proofs is subject to
1637 Goal.parallel_proofs_threshold (default 100). See also isabelle
1640 * Name space: former unsynchronized references are now proper
1641 configuration options, with more conventional names:
1643 long_names ~> names_long
1644 short_names ~> names_short
1645 unique_names ~> names_unique
1647 Minor INCOMPATIBILITY, need to declare options in context like this:
1649 declare [[names_unique = false]]
1651 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1652 that the result needs to be unique, which means fact specifications
1653 may have to be refined after enriching a proof context.
1655 * Attribute "case_names" has been refined: the assumptions in each case
1656 can be named now by following the case name with [name1 name2 ...].
1658 * Isabelle/Isar reference manual has been updated and extended:
1659 - "Synopsis" provides a catalog of main Isar language concepts.
1660 - Formal references in syntax diagrams, via @{rail} antiquotation.
1661 - Updated material from classic "ref" manual, notably about
1662 "Classical Reasoner".
1667 * Class bot and top require underlying partial order rather than
1668 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1670 * Class complete_lattice: generalized a couple of lemmas from sets;
1671 generalized theorems INF_cong and SUP_cong. New type classes for
1672 complete boolean algebras and complete linear orders. Lemmas
1673 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1674 class complete_linorder.
1676 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1677 Sup_fun_def, Inf_apply, Sup_apply.
1679 Removed redundant lemmas (the right hand side gives hints how to
1680 replace them for (metis ...), or (simp only: ...) proofs):
1682 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1683 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1684 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1685 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1686 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1687 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1688 Inter_def ~> INF_def, image_def
1689 Union_def ~> SUP_def, image_def
1690 INT_eq ~> INF_def, and image_def
1691 UN_eq ~> SUP_def, and image_def
1692 INF_subset ~> INF_superset_mono [OF _ order_refl]
1694 More consistent and comprehensive names:
1696 INTER_eq_Inter_image ~> INF_def
1697 UNION_eq_Union_image ~> SUP_def
1700 INF_leI ~> INF_lower
1701 INF_leI2 ~> INF_lower2
1702 le_INFI ~> INF_greatest
1703 le_SUPI ~> SUP_upper
1704 le_SUPI2 ~> SUP_upper2
1705 SUP_leI ~> SUP_least
1706 INFI_bool_eq ~> INF_bool_eq
1707 SUPR_bool_eq ~> SUP_bool_eq
1708 INFI_apply ~> INF_apply
1709 SUPR_apply ~> SUP_apply
1710 INTER_def ~> INTER_eq
1711 UNION_def ~> UNION_eq
1715 * Renamed theory Complete_Lattice to Complete_Lattices.
1718 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1719 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1720 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1721 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1723 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1724 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1725 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1728 * Added syntactic classes "inf" and "sup" for the respective
1729 constants. INCOMPATIBILITY: Changes in the argument order of the
1730 (mostly internal) locale predicates for some derived classes.
1732 * Theorem collections ball_simps and bex_simps do not contain theorems
1733 referring to UNION any longer; these have been moved to collection
1734 UN_ball_bex_simps. INCOMPATIBILITY.
1736 * Theory Archimedean_Field: floor now is defined as parameter of a
1737 separate type class floor_ceiling.
1739 * Theory Finite_Set: more coherent development of fold_set locales:
1741 locale fun_left_comm ~> locale comp_fun_commute
1742 locale fun_left_comm_idem ~> locale comp_fun_idem
1744 Both use point-free characterization; interpretation proofs may need
1745 adjustment. INCOMPATIBILITY.
1747 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1748 accordance with standard mathematical terminology. INCOMPATIBILITY.
1750 * Theory Complex_Main: The locale interpretations for the
1751 bounded_linear and bounded_bilinear locales have been removed, in
1752 order to reduce the number of duplicate lemmas. Users must use the
1753 original names for distributivity theorems, potential INCOMPATIBILITY.
1755 divide.add ~> add_divide_distrib
1756 divide.diff ~> diff_divide_distrib
1757 divide.setsum ~> setsum_divide_distrib
1758 mult.add_right ~> right_distrib
1759 mult.diff_right ~> right_diff_distrib
1760 mult_right.setsum ~> setsum_right_distrib
1761 mult_left.diff ~> left_diff_distrib
1763 * Theory Complex_Main: Several redundant theorems have been removed or
1764 replaced by more general versions. INCOMPATIBILITY.
1766 real_diff_def ~> minus_real_def
1767 real_divide_def ~> divide_real_def
1768 real_less_def ~> less_le
1769 real_abs_def ~> abs_real_def
1770 real_sgn_def ~> sgn_real_def
1771 real_mult_commute ~> mult_commute
1772 real_mult_assoc ~> mult_assoc
1773 real_mult_1 ~> mult_1_left
1774 real_add_mult_distrib ~> left_distrib
1775 real_zero_not_eq_one ~> zero_neq_one
1776 real_mult_inverse_left ~> left_inverse
1777 INVERSE_ZERO ~> inverse_zero
1778 real_le_refl ~> order_refl
1779 real_le_antisym ~> order_antisym
1780 real_le_trans ~> order_trans
1781 real_le_linear ~> linear
1782 real_le_eq_diff ~> le_iff_diff_le_0
1783 real_add_left_mono ~> add_left_mono
1784 real_mult_order ~> mult_pos_pos
1785 real_mult_less_mono2 ~> mult_strict_left_mono
1786 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1787 real_0_le_divide_iff ~> zero_le_divide_iff
1788 realpow_two_disj ~> power2_eq_iff
1789 real_squared_diff_one_factored ~> square_diff_one_factored
1790 realpow_two_diff ~> square_diff_square_factored
1791 reals_complete2 ~> complete_real
1792 real_sum_squared_expand ~> power2_sum
1793 exp_ln_eq ~> ln_unique
1795 expi_zero ~> exp_zero
1796 lemma_DERIV_subst ~> DERIV_cong
1797 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1798 LIMSEQ_const ~> tendsto_const
1799 LIMSEQ_norm ~> tendsto_norm
1800 LIMSEQ_add ~> tendsto_add
1801 LIMSEQ_minus ~> tendsto_minus
1802 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1803 LIMSEQ_diff ~> tendsto_diff
1804 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1805 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1806 LIMSEQ_mult ~> tendsto_mult
1807 LIMSEQ_inverse ~> tendsto_inverse
1808 LIMSEQ_divide ~> tendsto_divide
1809 LIMSEQ_pow ~> tendsto_power
1810 LIMSEQ_setsum ~> tendsto_setsum
1811 LIMSEQ_setprod ~> tendsto_setprod
1812 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1813 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1814 LIMSEQ_imp_rabs ~> tendsto_rabs
1815 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1816 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1817 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1818 LIMSEQ_Complex ~> tendsto_Complex
1819 LIM_ident ~> tendsto_ident_at
1820 LIM_const ~> tendsto_const
1821 LIM_add ~> tendsto_add
1822 LIM_add_zero ~> tendsto_add_zero
1823 LIM_minus ~> tendsto_minus
1824 LIM_diff ~> tendsto_diff
1825 LIM_norm ~> tendsto_norm
1826 LIM_norm_zero ~> tendsto_norm_zero
1827 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1828 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1829 LIM_rabs ~> tendsto_rabs
1830 LIM_rabs_zero ~> tendsto_rabs_zero
1831 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1832 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1833 LIM_compose ~> tendsto_compose
1834 LIM_mult ~> tendsto_mult
1835 LIM_scaleR ~> tendsto_scaleR
1836 LIM_of_real ~> tendsto_of_real
1837 LIM_power ~> tendsto_power
1838 LIM_inverse ~> tendsto_inverse
1839 LIM_sgn ~> tendsto_sgn
1840 isCont_LIM_compose ~> isCont_tendsto_compose
1841 bounded_linear.LIM ~> bounded_linear.tendsto
1842 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1843 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1844 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1845 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1846 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1847 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1849 * Theory Complex_Main: The definition of infinite series was
1850 generalized. Now it is defined on the type class {topological_space,
1851 comm_monoid_add}. Hence it is useable also for extended real numbers.
1853 * Theory Complex_Main: The complex exponential function "expi" is now
1854 a type-constrained abbreviation for "exp :: complex => complex"; thus
1855 several polymorphic lemmas about "exp" are now applicable to "expi".
1859 - Theory Library/Code_Char_ord provides native ordering of
1860 characters in the target language.
1862 - Commands code_module and code_library are legacy, use export_code
1865 - Method "evaluation" is legacy, use method "eval" instead.
1867 - Legacy evaluator "SML" is deactivated by default. May be
1868 reactivated by the following theory command:
1870 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1872 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1874 * New proof method "induction" that gives induction hypotheses the
1875 name "IH", thus distinguishing them from further hypotheses that come
1876 from rule induction. The latter are still called "hyps". Method
1877 "induction" is a thin wrapper around "induct" and follows the same
1880 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1881 still available as a legacy feature for some time.
1884 - Added "need" and "total_consts" options.
1885 - Reintroduced "show_skolems" option by popular demand.
1886 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1890 - Use quasi-sound (and efficient) translations by default.
1891 - Added support for the following provers: E-ToFoF, LEO-II,
1892 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1893 - Automatically preplay and minimize proofs before showing them if
1894 this can be done within reasonable time.
1895 - sledgehammer available_provers ~> sledgehammer supported_provers.
1897 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1898 "max_mono_iters", and "max_new_mono_instances" options.
1899 - Removed "explicit_apply" and "full_types" options as well as "Full
1900 Types" Proof General menu item. INCOMPATIBILITY.
1903 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1904 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1908 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1909 "elim:" options. INCOMPATIBILITY.
1910 - Introduced 'try' that not only runs 'try_methods' but also
1911 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1914 - Added "eval" option to evaluate terms for the found counterexample
1915 (currently only supported by the default (exhaustive) tester).
1916 - Added post-processing of terms to obtain readable counterexamples
1917 (currently only supported by the default (exhaustive) tester).
1918 - New counterexample generator quickcheck[narrowing] enables
1919 narrowing-based testing. Requires the Glasgow Haskell compiler
1920 with its installation location defined in the Isabelle settings
1921 environment as ISABELLE_GHC.
1922 - Removed quickcheck tester "SML" based on the SML code generator
1923 (formly in HOL/Library).
1925 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1926 use 'partial_function' instead.
1928 * Theory Library/Extended_Reals replaces now the positive extended
1929 reals found in probability theory. This file is extended by
1930 Multivariate_Analysis/Extended_Real_Limits.
1932 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1933 from where it must be imported explicitly if it is really required.
1936 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1937 been moved here. INCOMPATIBILITY.
1939 * Theory Library/Saturated provides type of numbers with saturated
1942 * Theory Library/Product_Lattice defines a pointwise ordering for the
1943 product type 'a * 'b, and provides instance proofs for various order
1944 and lattice type classes.
1946 * Theory Library/Countable now provides the "countable_datatype" proof
1947 method for proving "countable" class instances for datatypes.
1949 * Theory Library/Cset_Monad allows do notation for computable sets
1950 (cset) via the generic monad ad-hoc overloading facility.
1952 * Library: Theories of common data structures are split into theories
1953 for implementation, an invariant-ensuring type, and connection to an
1954 abstract type. INCOMPATIBILITY.
1956 - RBT is split into RBT and RBT_Mapping.
1957 - AssocList is split and renamed into AList and AList_Mapping.
1958 - DList is split into DList_Impl, DList, and DList_Cset.
1959 - Cset is split into Cset and List_Cset.
1961 * Theory Library/Nat_Infinity has been renamed to
1962 Library/Extended_Nat, with name changes of the following types and
1965 type inat ~> type enat
1967 Infty ~> infinity (overloaded)
1971 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1972 been renamed accordingly. INCOMPATIBILITY.
1974 * Session Multivariate_Analysis: The euclidean_space type class now
1975 fixes a constant "Basis :: 'a set" consisting of the standard
1976 orthonormal basis for the type. Users now have the option of
1977 quantifying over this set instead of using the "basis" function, e.g.
1978 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1980 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1981 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1982 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1983 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1984 changed to match. Definition theorems for overloaded constants now use
1985 the standard "foo_vec_def" naming scheme. A few other theorems have
1986 been renamed as follows (INCOMPATIBILITY):
1988 Cart_eq ~> vec_eq_iff
1989 dist_nth_le_cart ~> dist_vec_nth_le
1990 tendsto_vector ~> vec_tendstoI
1991 Cauchy_vector ~> vec_CauchyI
1993 * Session Multivariate_Analysis: Several duplicate theorems have been
1994 removed, and other theorems have been renamed or replaced with more
1995 general versions. INCOMPATIBILITY.
1997 finite_choice ~> finite_set_choice
1998 eventually_conjI ~> eventually_conj
1999 eventually_and ~> eventually_conj_iff
2000 eventually_false ~> eventually_False
2001 setsum_norm ~> norm_setsum
2002 Lim_sequentially ~> LIMSEQ_def
2003 Lim_ident_at ~> LIM_ident
2004 Lim_const ~> tendsto_const
2005 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2006 Lim_neg ~> tendsto_minus
2007 Lim_add ~> tendsto_add
2008 Lim_sub ~> tendsto_diff
2009 Lim_mul ~> tendsto_scaleR
2010 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2011 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2012 Lim_linear ~> bounded_linear.tendsto
2013 Lim_component ~> tendsto_euclidean_component
2014 Lim_component_cart ~> tendsto_vec_nth
2015 Lim_inner ~> tendsto_inner [OF tendsto_const]
2016 dot_lsum ~> inner_setsum_left
2017 dot_rsum ~> inner_setsum_right
2018 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2019 continuous_neg ~> continuous_minus
2020 continuous_sub ~> continuous_diff
2021 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2022 continuous_mul ~> continuous_scaleR
2023 continuous_inv ~> continuous_inverse
2024 continuous_at_within_inv ~> continuous_at_within_inverse
2025 continuous_at_inv ~> continuous_at_inverse
2026 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2027 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2028 continuous_at_component ~> continuous_component [OF continuous_at_id]
2029 continuous_on_neg ~> continuous_on_minus
2030 continuous_on_sub ~> continuous_on_diff
2031 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2032 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2033 continuous_on_mul ~> continuous_on_scaleR
2034 continuous_on_mul_real ~> continuous_on_mult
2035 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2036 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2037 continuous_on_inverse ~> continuous_on_inv
2038 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2039 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2040 subset_interior ~> interior_mono
2041 subset_closure ~> closure_mono
2042 closure_univ ~> closure_UNIV
2043 real_arch_lt ~> reals_Archimedean2
2044 real_arch ~> reals_Archimedean3
2045 real_abs_norm ~> abs_norm_cancel
2046 real_abs_sub_norm ~> norm_triangle_ineq3
2047 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2049 * Session HOL-Probability:
2050 - Caratheodory's extension lemma is now proved for ring_of_sets.
2051 - Infinite products of probability measures are now available.
2052 - Sigma closure is independent, if the generator is independent
2053 - Use extended reals instead of positive extended
2054 reals. INCOMPATIBILITY.
2056 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2058 expand_fun_below ~> fun_below_iff
2059 below_fun_ext ~> fun_belowI
2060 expand_cfun_eq ~> cfun_eq_iff
2061 ext_cfun ~> cfun_eqI
2062 expand_cfun_below ~> cfun_below_iff
2063 below_cfun_ext ~> cfun_belowI
2064 monofun_fun_fun ~> fun_belowD
2065 monofun_fun_arg ~> monofunE
2066 monofun_lub_fun ~> adm_monofun [THEN admD]
2067 cont_lub_fun ~> adm_cont [THEN admD]
2068 cont2cont_Rep_CFun ~> cont2cont_APP
2069 cont_Rep_CFun_app ~> cont_APP_app
2070 cont_Rep_CFun_app_app ~> cont_APP_app_app
2071 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2072 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2073 contlub_cfun ~> lub_APP [symmetric]
2074 contlub_LAM ~> lub_LAM [symmetric]
2077 lift_distinct1 ~> lift.distinct(1)
2078 lift_distinct2 ~> lift.distinct(2)
2079 Def_not_UU ~> lift.distinct(2)
2080 Def_inject ~> lift.inject
2081 below_UU_iff ~> below_bottom_iff
2082 eq_UU_iff ~> eq_bottom_iff
2085 *** Document preparation ***
2087 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2088 isar-ref manual, both for description and actual application of the
2091 * Antiquotation @{value} evaluates the given term and presents its
2094 * Antiquotations: term style "isub" provides ad-hoc conversion of
2095 variables x1, y23 into subscripted form x\<^isub>1,
2096 y\<^isub>2\<^isub>3.
2098 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2099 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2101 * Localized \isabellestyle switch can be used within blocks or groups
2104 \isabellestyle{it} %preferred default
2105 {\isabellestylett @{text "typewriter stuff"}}
2107 * Discontinued special treatment of hard tabulators. Implicit
2108 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2114 * The inner syntax of sort/type/term/prop supports inlined YXML
2115 representations within quoted string tokens. By encoding logical
2116 entities via Term_XML (in ML or Scala) concrete syntax can be
2117 bypassed, which is particularly useful for producing bits of text
2118 under external program control.
2120 * Antiquotations for ML and document preparation are managed as theory
2121 data, which requires explicit setup.
2123 * Isabelle_Process.is_active allows tools to check if the official
2124 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2125 (better known as Proof General).
2127 * Structure Proof_Context follows standard naming scheme. Old
2128 ProofContext is still available for some time as legacy alias.
2130 * Structure Timing provides various operations for timing; supersedes
2131 former start_timing/end_timing etc.
2133 * Path.print is the official way to show file-system paths to users
2134 (including quotes etc.).
2136 * Inner syntax: identifiers in parse trees of generic categories
2137 "logic", "aprop", "idt" etc. carry position information (disguised as
2138 type constraints). Occasional INCOMPATIBILITY with non-compliant
2139 translations that choke on unexpected type constraints. Positions can
2140 be stripped in ML translations via Syntax.strip_positions /
2141 Syntax.strip_positions_ast, or via the syntax constant
2142 "_strip_positions" within parse trees. As last resort, positions can
2143 be disabled via the configuration option Syntax.positions, which is
2144 called "syntax_positions" in Isar attribute syntax.
2146 * Discontinued special status of various ML structures that contribute
2147 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2148 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2149 refer directly to Ast.Constant, Lexicon.is_identifier,
2150 Syntax_Trans.mk_binder_tr etc.
2152 * Typed print translation: discontinued show_sorts argument, which is
2153 already available via context of "advanced" translation.
2155 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2156 goal states; body tactic needs to address all subgoals uniformly.
2158 * Slightly more special eq_list/eq_set, with shortcut involving
2159 pointer equality (assumes that eq relation is reflexive).
2161 * Classical tactics use proper Proof.context instead of historic types
2162 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2163 operate directly on Proof.context. Raw type claset retains its use as
2164 snapshot of the classical context, which can be recovered via
2165 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2166 INCOMPATIBILITY, classical tactics and derived proof methods require
2167 proper Proof.context.
2172 * Discontinued support for Poly/ML 5.2, which was the last version
2173 without proper multithreading and TimeLimit implementation.
2175 * Discontinued old lib/scripts/polyml-platform, which has been
2176 obsolete since Isabelle2009-2.
2178 * Various optional external tools are referenced more robustly and
2179 uniformly by explicit Isabelle settings as follows:
2181 ISABELLE_CSDP (formerly CSDP_EXE)
2182 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2183 ISABELLE_OCAML (formerly EXEC_OCAML)
2184 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2185 ISABELLE_YAP (formerly EXEC_YAP)
2187 Note that automated detection from the file-system or search path has
2188 been discontinued. INCOMPATIBILITY.
2190 * Scala layer provides JVM method invocation service for static
2191 methods of type (String)String, see Invoke_Scala.method in ML. For
2194 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2196 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2197 this allows to pass structured values between ML and Scala.
2199 * The IsabelleText fonts includes some further glyphs to support the
2200 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2201 installed a local copy (which is normally *not* required) need to
2202 delete or update it from ~~/lib/fonts/.
2206 New in Isabelle2011 (January 2011)
2207 ----------------------------------
2211 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2212 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2213 useful tooltips and hyperlinks produced from its static analysis. The
2214 bundled component provides an executable Isabelle tool that can be run
2217 Isabelle2011/bin/isabelle jedit
2219 * Significantly improved Isabelle/Isar implementation manual.
2221 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2222 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2223 while the default heap location within that directory lacks that extra
2224 suffix. This isolates multiple Isabelle installations from each
2225 other, avoiding problems with old settings in new versions.
2226 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2228 * Source files are always encoded as UTF-8, instead of old-fashioned
2229 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2230 the following package declarations:
2232 \usepackage[utf8]{inputenc}
2233 \usepackage{textcomp}
2235 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2236 a Unicode character is treated as a single symbol, not a sequence of
2237 non-ASCII bytes as before. Since Isabelle/ML string literals may
2238 contain symbols without further backslash escapes, Unicode can now be
2239 used here as well. Recall that Symbol.explode in ML provides a
2240 consistent view on symbols, while raw explode (or String.explode)
2241 merely give a byte-oriented representation.
2243 * Theory loader: source files are primarily located via the master
2244 directory of each theory node (where the .thy file itself resides).
2245 The global load path is still partially available as legacy feature.
2246 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2247 explicit paths, relatively to the theory.
2249 * Special treatment of ML file names has been discontinued.
2250 Historically, optional extensions .ML or .sml were added on demand --
2251 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2252 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2254 * Various options that affect pretty printing etc. are now properly
2255 handled within the context via configuration options, instead of
2256 unsynchronized references or print modes. There are both ML Config.T
2257 entities and Isar declaration attributes to access these.
2259 ML (Config.T) Isar (attribute)
2261 eta_contract eta_contract
2262 show_brackets show_brackets
2263 show_sorts show_sorts
2264 show_types show_types
2265 show_question_marks show_question_marks
2266 show_consts show_consts
2267 show_abbrevs show_abbrevs
2269 Syntax.ast_trace syntax_ast_trace
2270 Syntax.ast_stat syntax_ast_stat
2271 Syntax.ambiguity_level syntax_ambiguity_level
2273 Goal_Display.goals_limit goals_limit
2274 Goal_Display.show_main_goal show_main_goal
2276 Method.rule_trace rule_trace
2278 Thy_Output.display thy_output_display
2279 Thy_Output.quotes thy_output_quotes
2280 Thy_Output.indent thy_output_indent
2281 Thy_Output.source thy_output_source
2282 Thy_Output.break thy_output_break
2284 Note that corresponding "..._default" references in ML may only be
2285 changed globally at the ROOT session setup, but *not* within a theory.
2286 The option "show_abbrevs" supersedes the former print mode
2287 "no_abbrevs" with inverted meaning.
2289 * More systematic naming of some configuration options.
2292 trace_simp ~> simp_trace
2293 debug_simp ~> simp_debug
2295 * Support for real valued configuration options, using simplistic
2296 floating-point notation that coincides with the inner syntax for
2299 * Support for real valued preferences (with approximative PGIP type):
2300 front-ends need to accept "pgint" values in float notation.
2303 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2306 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2311 * Command 'type_synonym' (with single argument) replaces somewhat
2312 outdated 'types', which is still available as legacy feature for some
2315 * Command 'nonterminal' (with 'and' separated list of arguments)
2316 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2318 * Command 'notepad' replaces former 'example_proof' for
2319 experimentation in Isar without any result. INCOMPATIBILITY.
2321 * Locale interpretation commands 'interpret' and 'sublocale' accept
2322 lists of equations to map definitions in a locale to appropriate
2323 entities in the context of the interpretation. The 'interpretation'
2324 command already provided this functionality.
2326 * Diagnostic command 'print_dependencies' prints the locale instances
2327 that would be activated if the specified expression was interpreted in
2328 the current context. Variant "print_dependencies!" assumes a context
2329 without interpretations.
2331 * Diagnostic command 'print_interps' prints interpretations in proofs
2332 in addition to interpretations in theories.
2334 * Discontinued obsolete 'global' and 'local' commands to manipulate
2335 the theory name space. Rare INCOMPATIBILITY. The ML functions
2336 Sign.root_path and Sign.local_path may be applied directly where this
2337 feature is still required for historical reasons.
2339 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2340 'definition' instead.
2342 * The "prems" fact, which refers to the accidental collection of
2343 foundational premises in the context, is now explicitly marked as
2344 legacy feature and will be discontinued soon. Consider using "assms"
2345 of the head statement or reference facts by explicit names.
2347 * Document antiquotations @{class} and @{type} print classes and type
2350 * Document antiquotation @{file} checks file/directory entries within
2351 the local file system.
2356 * Coercive subtyping: functions can be declared as coercions and type
2357 inference will add them as necessary upon input of a term. Theory
2358 Complex_Main declares real :: nat => real and real :: int => real as
2359 coercions. A coercion function f is declared like this:
2361 declare [[coercion f]]
2363 To lift coercions through type constructors (e.g. from nat => real to
2364 nat list => real list), map functions can be declared, e.g.
2366 declare [[coercion_map map]]
2368 Currently coercion inference is activated only in theories including
2369 real numbers, i.e. descendants of Complex_Main. This is controlled by
2370 the configuration option "coercion_enabled", e.g. it can be enabled in
2371 other theories like this:
2373 declare [[coercion_enabled]]
2375 * Command 'partial_function' provides basic support for recursive
2376 function definitions over complete partial orders. Concrete instances
2377 are provided for i) the option type, ii) tail recursion on arbitrary
2378 types, and iii) the heap monad of Imperative_HOL. See
2379 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2382 * Function package: f.psimps rules are no longer implicitly declared
2383 as [simp]. INCOMPATIBILITY.
2385 * Datatype package: theorems generated for executable equality (class
2386 "eq") carry proper names and are treated as default code equations.
2388 * Inductive package: now offers command 'inductive_simps' to
2389 automatically derive instantiated and simplified equations for
2390 inductive predicates, similar to 'inductive_cases'.
2392 * Command 'enriched_type' allows to register properties of the
2393 functorial structure of types.
2395 * Improved infrastructure for term evaluation using code generator
2396 techniques, in particular static evaluation conversions.
2398 * Code generator: Scala (2.8 or higher) has been added to the target
2401 * Code generator: globbing constant expressions "*" and "Theory.*"
2402 have been replaced by the more idiomatic "_" and "Theory._".
2405 * Code generator: export_code without explicit file declaration prints
2406 to standard output. INCOMPATIBILITY.
2408 * Code generator: do not print function definitions for case
2409 combinators any longer.
2411 * Code generator: simplification with rules determined with
2412 src/Tools/Code/code_simp.ML and method "code_simp".
2414 * Code generator for records: more idiomatic representation of record
2415 types. Warning: records are not covered by ancient SML code
2416 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2417 rep_datatype declaration helps to succeed then:
2421 rep_datatype foo_ext ...
2423 * Records: logical foundation type for records does not carry a
2424 '_type' suffix any longer (obsolete due to authentic syntax).
2427 * Quickcheck now by default uses exhaustive testing instead of random
2428 testing. Random testing can be invoked by "quickcheck [random]",
2429 exhaustive testing by "quickcheck [exhaustive]".
2431 * Quickcheck instantiates polymorphic types with small finite
2432 datatypes by default. This enables a simple execution mechanism to
2433 handle quantifiers and function equality over the finite datatypes.
2435 * Quickcheck random generator has been renamed from "code" to
2436 "random". INCOMPATIBILITY.
2438 * Quickcheck now has a configurable time limit which is set to 30
2439 seconds by default. This can be changed by adding [timeout = n] to the
2440 quickcheck command. The time limit for Auto Quickcheck is still set
2443 * Quickcheck in locales considers interpretations of that locale for
2444 counter example search.
2447 - Added "smt" and "remote_smt" provers based on the "smt" proof
2448 method. See the Sledgehammer manual for details ("isabelle doc
2451 sledgehammer atp_info ~> sledgehammer running_provers
2452 sledgehammer atp_kill ~> sledgehammer kill_provers
2453 sledgehammer available_atps ~> sledgehammer available_provers
2456 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2457 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2458 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2459 (and "ms" and "min" are no longer supported)
2464 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2465 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2467 - Added support for partial quotient types.
2468 - Added local versions of the "Nitpick.register_xxx" functions.
2469 - Added "whack" option.
2470 - Allow registration of quotient types as codatatypes.
2471 - Improved "merge_type_vars" option to merge more types.
2472 - Removed unsound "fast_descrs" option.
2473 - Added custom symmetry breaking for datatypes, making it possible to reach
2474 higher cardinalities.
2475 - Prevent the expansion of too large definitions.
2477 * Proof methods "metis" and "meson" now have configuration options
2478 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2479 to diagnose these tools. E.g.
2481 using [[metis_trace = true]]
2483 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2484 manually as command 'solve_direct'.
2486 * The default SMT solver Z3 must be enabled explicitly (due to
2487 licensing issues) by setting the environment variable
2488 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2489 commercial applications, the SMT solver CVC3 is provided as fall-back;
2490 changing the SMT solver is done via the configuration option
2493 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2494 i.e. "remote_cvc3" and "remote_z3".
2496 * Added basic SMT support for datatypes, records, and typedefs using
2497 the oracle mode (no proofs). Direct support of pairs has been dropped
2498 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2499 support for a similar behavior). Minor INCOMPATIBILITY.
2501 * Changed SMT configuration options:
2503 z3_proofs ~> smt_oracle (with inverted meaning)
2504 z3_trace_assms ~> smt_trace_used_facts
2517 * Boogie output files (.b2i files) need to be declared in the theory
2520 * Simplification procedure "list_to_set_comprehension" rewrites list
2521 comprehensions applied to List.set to set comprehensions. Occasional
2522 INCOMPATIBILITY, may be deactivated like this:
2524 declare [[simproc del: list_to_set_comprehension]]
2526 * Removed old version of primrec package. INCOMPATIBILITY.
2528 * Removed simplifier congruence rule of "prod_case", as has for long
2529 been the case with "split". INCOMPATIBILITY.
2531 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2533 * Removed [split_format ... and ... and ...] version of
2534 [split_format]. Potential INCOMPATIBILITY.
2536 * Predicate "sorted" now defined inductively, with nice induction
2537 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2539 * Constant "contents" renamed to "the_elem", to free the generic name
2540 contents for other uses. INCOMPATIBILITY.
2542 * Renamed class eq and constant eq (for code generation) to class
2543 equal and constant equal, plus renaming of related facts and various
2544 tuning. INCOMPATIBILITY.
2546 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2548 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2551 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2552 avoid confusion with finite sets. INCOMPATIBILITY.
2554 * Abandoned locales equiv, congruent and congruent2 for equivalence
2555 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2558 * Some previously unqualified names have been qualified:
2565 Trueprop ~> HOL.Trueprop
2570 op --> ~> HOL.implies
2582 Pair ~> Product_Type.Pair
2583 fst ~> Product_Type.fst
2584 snd ~> Product_Type.snd
2585 curry ~> Product_Type.curry
2587 Collect ~> Set.Collect
2591 * More canonical naming convention for some fundamental definitions:
2593 bot_bool_eq ~> bot_bool_def
2594 top_bool_eq ~> top_bool_def
2595 inf_bool_eq ~> inf_bool_def
2596 sup_bool_eq ~> sup_bool_def
2597 bot_fun_eq ~> bot_fun_def
2598 top_fun_eq ~> top_fun_def
2599 inf_fun_eq ~> inf_fun_def
2600 sup_fun_eq ~> sup_fun_def
2604 * More stylized fact names:
2606 expand_fun_eq ~> fun_eq_iff
2607 expand_set_eq ~> set_eq_iff
2609 nat_number ~> eval_nat_numeral
2613 * Refactoring of code-generation specific operations in theory List:
2619 mem_iff ~> member_def
2620 null_empty ~> null_def
2622 INCOMPATIBILITY. Note that these were not supposed to be used
2623 regularly unless for striking reasons; their main purpose was code
2626 Various operations from the Haskell prelude are used for generating
2629 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2630 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2631 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2633 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2634 "*" and "+" respectively. INCOMPATIBILITY.
2636 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2637 "Sum_Type.Plus" instead.
2639 * Constant "split" has been merged with constant "prod_case"; names of
2640 ML functions, facts etc. involving split have been retained so far,
2641 though. INCOMPATIBILITY.
2643 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2644 instead. INCOMPATIBILITY.
2646 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2649 * Former theory Library/Enum is now part of the HOL-Main image.
2650 INCOMPATIBILITY: all constants of the Enum theory now have to be
2651 referred to by its qualified name.
2654 nlists ~> Enum.nlists
2655 product ~> Enum.product
2657 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2658 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2661 * Theory Library/SetsAndFunctions has been split into
2662 Library/Function_Algebras and Library/Set_Algebras; canonical names
2663 for instance definitions for functions; various improvements.
2666 * Theory Library/Multiset provides stable quicksort implementation of
2669 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2672 * Session Multivariate_Analysis: introduced a type class for euclidean
2673 space. Most theorems are now stated in terms of euclidean spaces
2674 instead of finite cartesian products.
2677 real ^ 'n ~> 'a::real_vector
2678 ~> 'a::euclidean_space
2679 ~> 'a::ordered_euclidean_space
2680 (depends on your needs)
2684 \<chi> x. _ ~> \<chi>\<chi> x. _
2687 Also note that the indices are now natural numbers and not from some
2688 finite type. Finite cartesian products of euclidean spaces, products
2689 of euclidean spaces the real and complex numbers are instantiated to
2690 be euclidean_spaces. INCOMPATIBILITY.
2692 * Session Probability: introduced pextreal as positive extended real
2693 numbers. Use pextreal as value for measures. Introduce the
2694 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2695 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2696 the integral in Multivariate Analysis. INCOMPATIBILITY.
2698 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2701 * Session SPARK (with image HOL-SPARK) provides commands to load and
2702 prove verification conditions generated by the SPARK Ada program
2703 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2708 * Theorems for additive ring operations (locale abelian_monoid and
2709 descendants) are generated by interpretation from their multiplicative
2710 counterparts. Names (in particular theorem names) have the mandatory
2711 qualifier 'add'. Previous theorem names are redeclared for
2714 * Structure "int_ring" is now an abbreviation (previously a
2715 definition). This fits more natural with advanced interpretations.
2720 * The domain package now runs in definitional mode by default: The
2721 former command 'new_domain' is now called 'domain'. To use the domain
2722 package in its original axiomatic mode, use 'domain (unsafe)'.
2725 * The new class "domain" is now the default sort. Class "predomain"
2726 is an unpointed version of "domain". Theories can be updated by
2727 replacing sort annotations as shown below. INCOMPATIBILITY.
2729 'a::type ~> 'a::countable
2730 'a::cpo ~> 'a::predomain
2731 'a::pcpo ~> 'a::domain
2733 * The old type class "rep" has been superseded by class "domain".
2734 Accordingly, users of the definitional package must remove any
2735 "default_sort rep" declarations. INCOMPATIBILITY.
2737 * The domain package (definitional mode) now supports unpointed
2738 predomain argument types, as long as they are marked 'lazy'. (Strict
2739 arguments must be in class "domain".) For example, the following
2740 domain definition now works:
2742 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2744 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2745 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2746 'a option, and 'a list. Additionally, it configures fixrec and the
2747 domain package to work with these types. For example:
2749 fixrec isInl :: "('a + 'b) u -> tr"
2750 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2752 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2754 * The "(permissive)" option of fixrec has been replaced with a
2755 per-equation "(unchecked)" option. See
2756 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2758 * The "bifinite" class no longer fixes a constant "approx"; the class
2759 now just asserts that such a function exists. INCOMPATIBILITY.
2761 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2762 defines an embedding of type 'a defl into udom by default; instances
2763 of "bifinite" and "domain" classes are available in
2764 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2766 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2768 * The predicate "directed" has been removed. INCOMPATIBILITY.
2770 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2772 * The function "cprod_map" has been renamed to "prod_map".
2775 * The monadic bind operator on each powerdomain has new binder syntax
2776 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2777 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2779 * The infix syntax for binary union on each powerdomain has changed
2780 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2781 syntax. INCOMPATIBILITY.
2783 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2784 still supported as an input translation.
2786 * Renamed some theorems (the original names are also still available).
2788 expand_fun_below ~> fun_below_iff
2789 below_fun_ext ~> fun_belowI
2790 expand_cfun_eq ~> cfun_eq_iff
2791 ext_cfun ~> cfun_eqI
2792 expand_cfun_below ~> cfun_below_iff
2793 below_cfun_ext ~> cfun_belowI
2794 cont2cont_Rep_CFun ~> cont2cont_APP
2796 * The Abs and Rep functions for various types have changed names.
2797 Related theorem names have also changed to match. INCOMPATIBILITY.
2799 Rep_CFun ~> Rep_cfun
2800 Abs_CFun ~> Abs_cfun
2801 Rep_Sprod ~> Rep_sprod
2802 Abs_Sprod ~> Abs_sprod
2803 Rep_Ssum ~> Rep_ssum
2804 Abs_Ssum ~> Abs_ssum
2806 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2807 been renamed to *_bottom_iff. INCOMPATIBILITY.
2809 * Various changes to bisimulation/coinduction with domain package:
2811 - Definitions of "bisim" constants no longer mention definedness.
2812 - With mutual recursion, "bisim" predicate is now curried.
2813 - With mutual recursion, each type gets a separate coind theorem.
2814 - Variable names in bisim_def and coinduct rules have changed.
2818 * Case combinators generated by the domain package for type "foo" are
2819 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2821 * Several theorems have been renamed to more accurately reflect the
2822 names of constants and types involved. INCOMPATIBILITY.
2824 thelub_const ~> lub_const
2825 lub_const ~> is_lub_const
2827 is_lub_lub ~> is_lubD2
2829 unique_lub ~> is_lub_unique
2830 is_ub_lub ~> is_lub_rangeD1
2831 lub_bin_chain ~> is_lub_bin_chain
2832 lub_fun ~> is_lub_fun
2833 thelub_fun ~> lub_fun
2834 thelub_cfun ~> lub_cfun
2835 thelub_Pair ~> lub_Pair
2836 lub_cprod ~> is_lub_prod
2837 thelub_cprod ~> lub_prod
2838 minimal_cprod ~> minimal_prod
2839 inst_cprod_pcpo ~> inst_prod_pcpo
2841 compact_UU ~> compact_bottom
2842 deflation_UU ~> deflation_bottom
2843 finite_deflation_UU ~> finite_deflation_bottom
2845 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2847 sq_ord_less_eq_trans ~> below_eq_trans
2848 sq_ord_eq_less_trans ~> eq_below_trans
2849 refl_less ~> below_refl
2850 trans_less ~> below_trans
2851 antisym_less ~> below_antisym
2852 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2853 box_less ~> box_below
2854 rev_trans_less ~> rev_below_trans
2855 not_less2not_eq ~> not_below2not_eq
2856 less_UU_iff ~> below_UU_iff
2857 flat_less_iff ~> flat_below_iff
2858 adm_less ~> adm_below
2859 adm_not_less ~> adm_not_below
2860 adm_compact_not_less ~> adm_compact_not_below
2861 less_fun_def ~> below_fun_def
2862 expand_fun_less ~> fun_below_iff
2863 less_fun_ext ~> fun_belowI
2864 less_discr_def ~> below_discr_def
2865 discr_less_eq ~> discr_below_eq
2866 less_unit_def ~> below_unit_def
2867 less_cprod_def ~> below_prod_def
2868 prod_lessI ~> prod_belowI
2869 Pair_less_iff ~> Pair_below_iff
2870 fst_less_iff ~> fst_below_iff
2871 snd_less_iff ~> snd_below_iff
2872 expand_cfun_less ~> cfun_below_iff
2873 less_cfun_ext ~> cfun_belowI
2874 injection_less ~> injection_below
2875 less_up_def ~> below_up_def
2876 not_Iup_less ~> not_Iup_below
2877 Iup_less ~> Iup_below
2879 Def_inject_less_eq ~> Def_below_Def
2880 Def_less_is_eq ~> Def_below_iff
2881 spair_less_iff ~> spair_below_iff
2882 less_sprod ~> below_sprod
2883 spair_less ~> spair_below
2884 sfst_less_iff ~> sfst_below_iff
2885 ssnd_less_iff ~> ssnd_below_iff
2886 fix_least_less ~> fix_least_below
2887 dist_less_one ~> dist_below_one
2888 less_ONE ~> below_ONE
2889 ONE_less_iff ~> ONE_below_iff
2890 less_sinlD ~> below_sinlD
2891 less_sinrD ~> below_sinrD
2896 * All constant names are now qualified internally and use proper
2897 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2902 * Antiquotation @{assert} inlines a function bool -> unit that raises
2903 Fail if the argument is false. Due to inlining the source position of
2904 failed assertions is included in the error output.
2906 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2907 text is in practice always evaluated with a stable theory checkpoint.
2908 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2910 * Antiquotation @{theory A} refers to theory A from the ancestry of
2911 the current context, not any accidental theory loader state as before.
2912 Potential INCOMPATIBILITY, subtle change in semantics.
2914 * Syntax.pretty_priority (default 0) configures the required priority
2915 of pretty-printed output and thus affects insertion of parentheses.
2917 * Syntax.default_root (default "any") configures the inner syntax
2918 category (nonterminal symbol) for parsing of terms.
2920 * Former exception Library.UnequalLengths now coincides with
2921 ListPair.UnequalLengths.
2923 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2924 main functionality is provided by structure Simplifier.
2926 * Renamed raw "explode" function to "raw_explode" to emphasize its
2927 meaning. Note that internally to Isabelle, Symbol.explode is used in
2928 almost all situations.
2930 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2931 See implementation manual for further details on exceptions in
2934 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2937 * Renamed structure PureThy to Pure_Thy and moved most of its
2938 operations to structure Global_Theory, to emphasize that this is
2939 rarely-used global-only stuff.
2941 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2942 instead (or tracing for high-volume output).
2944 * Configuration option show_question_marks only affects regular pretty
2945 printing of types and terms, not raw Term.string_of_vname.
2947 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2948 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2949 @{thms} for most purposes.
2951 * ML structure Unsynchronized is never opened, not even in Isar
2952 interaction mode as before. Old Unsynchronized.set etc. have been
2953 discontinued -- use plain := instead. This should be *rare* anyway,
2954 since modern tools always work via official context data, notably
2955 configuration options.
2957 * Parallel and asynchronous execution requires special care concerning
2958 interrupts. Structure Exn provides some convenience functions that
2959 avoid working directly with raw Interrupt. User code must not absorb
2960 interrupts -- intermediate handling (for cleanup etc.) needs to be
2961 followed by re-raising of the original exception. Another common
2962 source of mistakes are "handle _" patterns, which make the meaning of
2963 the program subject to physical effects of the environment.
2967 New in Isabelle2009-2 (June 2010)
2968 ---------------------------------
2972 * Authentic syntax for *all* logical entities (type classes, type
2973 constructors, term constants): provides simple and robust
2974 correspondence between formal entities and concrete syntax. Within
2975 the parse tree / AST representations, "constants" are decorated by
2976 their category (class, type, const) and spelled out explicitly with
2977 their full internal name.
2979 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2980 and translations (translation rules and translation functions in ML).
2981 Some hints on upgrading:
2983 - Many existing uses of 'syntax' and 'translations' can be replaced
2984 by more modern 'type_notation', 'notation' and 'abbreviation',
2985 which are independent of this issue.
2987 - 'translations' require markup within the AST; the term syntax
2988 provides the following special forms:
2990 CONST c -- produces syntax version of constant c from context
2991 XCONST c -- literally c, checked as constant from context
2992 c -- literally c, if declared by 'syntax'
2994 Plain identifiers are treated as AST variables -- occasionally the
2995 system indicates accidental variables via the error "rhs contains
2998 Type classes and type constructors are marked according to their
2999 concrete syntax. Some old translations rules need to be written
3000 for the "type" category, using type constructor application
3001 instead of pseudo-term application of the default category
3004 - 'parse_translation' etc. in ML may use the following
3007 @{class_syntax c} -- type class c within parse tree / AST
3008 @{term_syntax c} -- type constructor c within parse tree / AST
3009 @{const_syntax c} -- ML version of "CONST c" above
3010 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3012 - Literal types within 'typed_print_translations', i.e. those *not*
3013 represented as pseudo-terms are represented verbatim. Use @{class
3014 c} or @{type_name c} here instead of the above syntax
3017 Note that old non-authentic syntax was based on unqualified base
3018 names, so all of the above "constant" names would coincide. Recall
3019 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3020 diagnose syntax problems.
3022 * Type constructors admit general mixfix syntax, not just infix.
3024 * Concrete syntax may be attached to local entities without a proof
3025 body, too. This works via regular mixfix annotations for 'fix',
3026 'def', 'obtain' etc. or via the explicit 'write' command, which is
3027 similar to the 'notation' command in theory specifications.
3029 * Discontinued unnamed infix syntax (legacy feature for many years) --
3030 need to specify constant name and syntax separately. Internal ML
3031 datatype constructors have been renamed from InfixName to Infix etc.
3032 Minor INCOMPATIBILITY.
3034 * Schematic theorem statements need to be explicitly markup as such,
3035 via commands 'schematic_lemma', 'schematic_theorem',
3036 'schematic_corollary'. Thus the relevance of the proof is made
3037 syntactically clear, which impacts performance in a parallel or
3038 asynchronous interactive environment. Minor INCOMPATIBILITY.
3040 * Use of cumulative prems via "!" in some proof methods has been
3041 discontinued (old legacy feature).
3043 * References 'trace_simp' and 'debug_simp' have been replaced by
3044 configuration options stored in the context. Enabling tracing (the
3045 case of debugging is similar) in proofs works via
3047 using [[trace_simp = true]]
3049 Tracing is then active for all invocations of the simplifier in
3050 subsequent goal refinement steps. Tracing may also still be enabled or
3051 disabled via the ProofGeneral settings menu.
3053 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3054 'hide_fact' replace the former 'hide' KIND command. Minor
3057 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3058 more efficient than combinations with -q1 or -q2.
3063 * Proofterms record type-class reasoning explicitly, using the
3064 "unconstrain" operation internally. This eliminates all sort
3065 constraints from a theorem and proof, introducing explicit
3066 OFCLASS-premises. On the proof term level, this operation is
3067 automatically applied at theorem boundaries, such that closed proofs
3068 are always free of sort constraints. INCOMPATIBILITY for tools that
3069 inspect proof terms.
3071 * Local theory specifications may depend on extra type variables that
3072 are not present in the result type -- arguments TYPE('a) :: 'a itself
3073 are added internally. For example:
3075 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3077 * Predicates of locales introduced by classes carry a mandatory
3078 "class" prefix. INCOMPATIBILITY.
3080 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3082 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3085 * Command 'code_reflect' allows to incorporate generated ML code into
3086 runtime environment; replaces immature code_datatype antiquotation.
3089 * Code generator: simple concept for abstract datatypes obeying
3092 * Code generator: details of internal data cache have no impact on the
3093 user space functionality any longer.
3095 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3096 subgoals. This is more appropriate for interpretations with 'where'.
3099 * Command 'example_proof' opens an empty proof body. This allows to
3100 experiment with Isar, without producing any persistent result.
3102 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3103 within a local theory context, with explicit checking of the
3104 constructors involved (in contrast to the raw 'syntax' versions).
3106 * Commands 'types' and 'typedecl' now work within a local theory
3107 context -- without introducing dependencies on parameters or
3108 assumptions, which is not possible in Isabelle/Pure.
3110 * Command 'defaultsort' has been renamed to 'default_sort', it works
3111 within a local theory context. Minor INCOMPATIBILITY.
3116 * Command 'typedef' now works within a local theory context -- without
3117 introducing dependencies on parameters or assumptions, which is not
3118 possible in Isabelle/Pure/HOL. Note that the logical environment may
3119 contain multiple interpretations of local typedefs (with different
3120 non-emptiness proofs), even in a global theory context.
3122 * New package for quotient types. Commands 'quotient_type' and
3123 'quotient_definition' may be used for defining types and constants by
3124 quotient constructions. An example is the type of integers created by
3125 quotienting pairs of natural numbers:
3128 intrel :: "(nat * nat) => (nat * nat) => bool"
3130 "intrel (x, y) (u, v) = (x + v = u + y)"
3132 quotient_type int = "nat * nat" / intrel
3133 by (auto simp add: equivp_def expand_fun_eq)
3136 "0::int" is "(0::nat, 0::nat)"
3138 The method "lifting" can be used to lift of theorems from the
3139 underlying "raw" type to the quotient type. The example
3140 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3141 construction and provides a reasoning infrastructure for finite sets.
3143 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3144 clash with new theory Quotient in Main HOL.
3146 * Moved the SMT binding into the main HOL session, eliminating
3147 separate HOL-SMT session.
3149 * List membership infix mem operation is only an input abbreviation.
3152 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3153 for future developements; former Library/Word.thy is still present in
3154 the AFP entry RSAPPS.
3156 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3157 longer shadowed. INCOMPATIBILITY.
3159 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3162 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3165 * Dropped normalizing_semiring etc; use the facts in semiring classes
3166 instead. INCOMPATIBILITY.
3168 * Dropped several real-specific versions of lemmas about floor and
3169 ceiling; use the generic lemmas from theory "Archimedean_Field"
3170 instead. INCOMPATIBILITY.
3172 floor_number_of_eq ~> floor_number_of
3173 le_floor_eq_number_of ~> number_of_le_floor
3174 le_floor_eq_zero ~> zero_le_floor
3175 le_floor_eq_one ~> one_le_floor
3176 floor_less_eq_number_of ~> floor_less_number_of
3177 floor_less_eq_zero ~> floor_less_zero
3178 floor_less_eq_one ~> floor_less_one
3179 less_floor_eq_number_of ~> number_of_less_floor
3180 less_floor_eq_zero ~> zero_less_floor
3181 less_floor_eq_one ~> one_less_floor
3182 floor_le_eq_number_of ~> floor_le_number_of
3183 floor_le_eq_zero ~> floor_le_zero
3184 floor_le_eq_one ~> floor_le_one
3185 floor_subtract_number_of ~> floor_diff_number_of
3186 floor_subtract_one ~> floor_diff_one
3187 ceiling_number_of_eq ~> ceiling_number_of
3188 ceiling_le_eq_number_of ~> ceiling_le_number_of
3189 ceiling_le_zero_eq ~> ceiling_le_zero
3190 ceiling_le_eq_one ~> ceiling_le_one
3191 less_ceiling_eq_number_of ~> number_of_less_ceiling
3192 less_ceiling_eq_zero ~> zero_less_ceiling
3193 less_ceiling_eq_one ~> one_less_ceiling
3194 ceiling_less_eq_number_of ~> ceiling_less_number_of
3195 ceiling_less_eq_zero ~> ceiling_less_zero
3196 ceiling_less_eq_one ~> ceiling_less_one
3197 le_ceiling_eq_number_of ~> number_of_le_ceiling
3198 le_ceiling_eq_zero ~> zero_le_ceiling
3199 le_ceiling_eq_one ~> one_le_ceiling
3200 ceiling_subtract_number_of ~> ceiling_diff_number_of
3201 ceiling_subtract_one ~> ceiling_diff_one
3203 * Theory "Finite_Set": various folding_XXX locales facilitate the
3204 application of the various fold combinators on finite sets.
3206 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3207 provides abstract red-black tree type which is backed by "RBT_Impl" as
3208 implementation. INCOMPATIBILTY.
3210 * Theory Library/Coinductive_List has been removed -- superseded by
3211 AFP/thys/Coinductive.
3213 * Theory PReal, including the type "preal" and related operations, has
3214 been removed. INCOMPATIBILITY.
3216 * Real: new development using Cauchy Sequences.
3218 * Split off theory "Big_Operators" containing setsum, setprod,
3219 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3221 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3222 "Int" etc. INCOMPATIBILITY.
3224 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3226 * New set of rules "ac_simps" provides combined assoc / commute
3227 rewrites for all interpretations of the appropriate generic locales.
3229 * Renamed theory "OrderedGroup" to "Groups" and split theory
3230 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3231 appropriate and more consistent names suitable for name prefixes
3232 within the HOL theories. INCOMPATIBILITY.
3234 * Some generic constants have been put to appropriate theories:
3235 - less_eq, less: Orderings
3236 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3237 - inverse, divide: Rings
3240 * More consistent naming of type classes involving orderings (and
3243 lower_semilattice ~> semilattice_inf
3244 upper_semilattice ~> semilattice_sup
3246 dense_linear_order ~> dense_linorder
3248 pordered_ab_group_add ~> ordered_ab_group_add
3249 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3250 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3251 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3252 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3253 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3254 pordered_cancel_semiring ~> ordered_cancel_semiring
3255 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3256 pordered_comm_ring ~> ordered_comm_ring
3257 pordered_comm_semiring ~> ordered_comm_semiring
3258 pordered_ring ~> ordered_ring
3259 pordered_ring_abs ~> ordered_ring_abs
3260 pordered_semiring ~> ordered_semiring
3262 ordered_ab_group_add ~> linordered_ab_group_add
3263 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3264 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3265 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3266 ordered_field ~> linordered_field
3267 ordered_field_no_lb ~> linordered_field_no_lb
3268 ordered_field_no_ub ~> linordered_field_no_ub
3269 ordered_field_dense_linear_order ~> dense_linordered_field
3270 ordered_idom ~> linordered_idom
3271 ordered_ring ~> linordered_ring
3272 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3273 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3274 ordered_ring_strict ~> linordered_ring_strict
3275 ordered_semidom ~> linordered_semidom
3276 ordered_semiring ~> linordered_semiring
3277 ordered_semiring_1 ~> linordered_semiring_1
3278 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3279 ordered_semiring_strict ~> linordered_semiring_strict
3281 The following slightly odd type classes have been moved to a
3282 separate theory Library/Lattice_Algebras:
3284 lordered_ab_group_add ~> lattice_ab_group_add
3285 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3286 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3287 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3288 lordered_ring ~> lattice_ring
3292 * Refined field classes:
3293 - classes division_ring_inverse_zero, field_inverse_zero,
3294 linordered_field_inverse_zero include rule inverse 0 = 0 --
3295 subsumes former division_by_zero class;
3296 - numerous lemmas have been ported from field to division_ring.
3299 * Refined algebra theorem collections:
3300 - dropped theorem group group_simps, use algebra_simps instead;
3301 - dropped theorem group ring_simps, use field_simps instead;
3302 - proper theorem collection field_simps subsumes former theorem
3303 groups field_eq_simps and field_simps;
3304 - dropped lemma eq_minus_self_iff which is a duplicate for
3308 * Theory Finite_Set and List: some lemmas have been generalized from
3311 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3312 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3313 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3314 union_Union_fold_union ~> sup_Sup_fold_sup
3315 Inter_fold_inter ~> Inf_fold_inf
3316 Union_fold_union ~> Sup_fold_sup
3317 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3318 union_UNION_fold_union ~> sup_SUPR_fold_sup
3319 INTER_fold_inter ~> INFI_fold_inf
3320 UNION_fold_union ~> SUPR_fold_sup
3322 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3323 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3324 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3325 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3326 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3327 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3329 * Reorganized theory Multiset: swapped notation of pointwise and
3332 - pointwise ordering is instance of class order with standard syntax
3334 - multiset ordering has syntax <=# and <#; partial order properties
3335 are provided by means of interpretation with prefix
3337 - less duplication, less historical organization of sections,
3338 conversion from associations lists to multisets, rudimentary code
3340 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3345 multiset_eq_conv_count_eq ~> multiset_ext_iff
3346 multi_count_ext ~> multiset_ext
3347 diff_union_inverse2 ~> diff_union_cancelR
3351 * Theory Permutation: replaced local "remove" by List.remove1.
3353 * Code generation: ML and OCaml code is decorated with signatures.
3355 * Theory List: added transpose.
3357 * Library/Nat_Bijection.thy is a collection of bijective functions
3358 between nat and other types, which supersedes the older libraries
3359 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3362 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3363 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3364 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3365 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3366 Countable.pair_encode ~> prod_encode
3367 NatIso.prod2nat ~> prod_encode
3368 NatIso.nat2prod ~> prod_decode
3369 NatIso.sum2nat ~> sum_encode
3370 NatIso.nat2sum ~> sum_decode
3371 NatIso.list2nat ~> list_encode
3372 NatIso.nat2list ~> list_decode
3373 NatIso.set2nat ~> set_encode
3374 NatIso.nat2set ~> set_decode
3377 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3378 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3379 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3380 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3381 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3382 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3383 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3384 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3385 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3386 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3387 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3388 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3389 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3392 - Renamed ATP commands:
3393 atp_info ~> sledgehammer running_atps
3394 atp_kill ~> sledgehammer kill_atps
3395 atp_messages ~> sledgehammer messages
3396 atp_minimize ~> sledgehammer minimize
3397 print_atps ~> sledgehammer available_atps
3399 - Added user's manual ("isabelle doc sledgehammer").
3400 - Added option syntax and "sledgehammer_params" to customize
3401 Sledgehammer's behavior. See the manual for details.
3402 - Modified the Isar proof reconstruction code so that it produces
3403 direct proofs rather than proofs by contradiction. (This feature
3404 is still experimental.)
3405 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3407 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3410 - Added and implemented "binary_ints" and "bits" options.
3411 - Added "std" option and implemented support for nonstandard models.
3412 - Added and implemented "finitize" option to improve the precision
3413 of infinite datatypes based on a monotonicity analysis.
3414 - Added support for quotient types.
3415 - Added support for "specification" and "ax_specification"
3417 - Added support for local definitions (for "function" and
3418 "termination" proofs).
3419 - Added support for term postprocessors.
3420 - Optimized "Multiset.multiset" and "FinFun.finfun".
3421 - Improved efficiency of "destroy_constrs" optimization.
3422 - Fixed soundness bugs related to "destroy_constrs" optimization and
3424 - Fixed soundness bug related to higher-order constructors.
3425 - Fixed soundness bug when "full_descrs" is enabled.
3426 - Improved precision of set constructs.
3427 - Added "atoms" option.
3428 - Added cache to speed up repeated Kodkod invocations on the same
3430 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3431 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3432 "SAT4J_Light". INCOMPATIBILITY.
3433 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3434 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3435 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3437 * Method "induct" now takes instantiations of the form t, where t is not
3438 a variable, as a shorthand for "x == t", where x is a fresh variable.
3439 If this is not intended, t has to be enclosed in parentheses.
3440 By default, the equalities generated by definitional instantiations
3441 are pre-simplified, which may cause parameters of inductive cases
3442 to disappear, or may even delete some of the inductive cases.
3443 Use "induct (no_simp)" instead of "induct" to restore the old
3444 behaviour. The (no_simp) option is also understood by the "cases"
3445 and "nominal_induct" methods, which now perform pre-simplification, too.
3451 * Variable names in lemmas generated by the domain package have
3452 changed; the naming scheme is now consistent with the HOL datatype
3453 package. Some proof scripts may be affected, INCOMPATIBILITY.
3455 * The domain package no longer defines the function "foo_copy" for
3456 recursive domain "foo". The reach lemma is now stated directly in
3457 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3458 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3460 * Most definedness lemmas generated by the domain package (previously
3461 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3462 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3463 Proofs that used definedness lemmas as intro rules may break,
3464 potential INCOMPATIBILITY.
3466 * Induction and casedist rules generated by the domain package now
3467 declare proper case_names (one called "bottom", and one named for each
3468 constructor). INCOMPATIBILITY.
3470 * For mutually-recursive domains, separate "reach" and "take_lemma"
3471 rules are generated for each domain, INCOMPATIBILITY.
3473 foo_bar.reach ~> foo.reach bar.reach
3474 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3476 * Some lemmas generated by the domain package have been renamed for
3477 consistency with the datatype package, INCOMPATIBILITY.
3479 foo.ind ~> foo.induct
3480 foo.finite_ind ~> foo.finite_induct
3481 foo.coind ~> foo.coinduct
3482 foo.casedist ~> foo.exhaust
3483 foo.exhaust ~> foo.nchotomy
3485 * For consistency with other definition packages, the fixrec package
3486 now generates qualified theorem names, INCOMPATIBILITY.
3488 foo_simps ~> foo.simps
3489 foo_unfold ~> foo.unfold
3490 foo_induct ~> foo.induct
3492 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3493 method and internal fixrec proofs now use the default simpset instead.
3496 * The "contlub" predicate has been removed. Proof scripts should use
3497 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3499 * The "admw" predicate has been removed, INCOMPATIBILITY.
3501 * The constants cpair, cfst, and csnd have been removed in favor of
3502 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3507 * Antiquotations for basic formal entities:
3509 @{class NAME} -- type class
3510 @{class_syntax NAME} -- syntax representation of the above
3512 @{type_name NAME} -- logical type
3513 @{type_abbrev NAME} -- type abbreviation
3514 @{nonterminal NAME} -- type of concrete syntactic category
3515 @{type_syntax NAME} -- syntax representation of any of the above
3517 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3518 @{const_abbrev NAME} -- abbreviated constant
3519 @{const_syntax NAME} -- syntax representation of any of the above
3521 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3522 syntax constant (cf. 'syntax' command).
3524 * Antiquotation @{make_string} inlines a function to print arbitrary
3525 values similar to the ML toplevel. The result is compiler dependent
3526 and may fall back on "?" in certain situations.
3528 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3529 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3530 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3531 not work with the asynchronous Isar document model.
3533 * Configuration options now admit dynamic default values, depending on
3534 the context or even global references.
3536 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3537 uses an efficient external library if available (for Poly/ML).
3539 * Renamed some important ML structures, while keeping the old names
3540 for some time as aliases within the structure Legacy:
3542 OuterKeyword ~> Keyword
3545 OuterSyntax ~> Outer_Syntax
3546 PrintMode ~> Print_Mode
3547 SpecParse ~> Parse_Spec
3550 ThyOutput ~> Thy_Output
3551 TypeInfer ~> Type_Infer
3553 Note that "open Legacy" simplifies porting of sources, but forgetting
3554 to remove it again will complicate porting again in the future.
3556 * Most operations that refer to a global context are named
3557 accordingly, e.g. Simplifier.global_context or
3558 ProofContext.init_global. There are some situations where a global
3559 context actually works, but under normal circumstances one needs to
3560 pass the proper local context through the code!
3562 * Discontinued old TheoryDataFun with its copy/init operation -- data
3563 needs to be pure. Functor Theory_Data_PP retains the traditional
3564 Pretty.pp argument to merge, which is absent in the standard
3565 Theory_Data version.
3567 * Sorts.certify_sort and derived "cert" operations for types and terms
3568 no longer minimize sorts. Thus certification at the boundary of the
3569 inference kernel becomes invariant under addition of class relations,
3570 which is an important monotonicity principle. Sorts are now minimized
3571 in the syntax layer only, at the boundary between the end-user and the
3572 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3573 explicitly in rare situations.
3575 * Renamed old-style Drule.standard to Drule.export_without_context, to
3576 emphasize that this is in no way a standard operation.
3579 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3580 usual for resolution. Rare INCOMPATIBILITY.
3582 * Renamed varify/unvarify operations to varify_global/unvarify_global
3583 to emphasize that these only work in a global situation (which is
3586 * Curried take and drop in library.ML; negative length is interpreted
3587 as infinity (as in chop). Subtle INCOMPATIBILITY.
3589 * Proof terms: type substitutions on proof constants now use canonical
3590 order of type variables. INCOMPATIBILITY for tools working with proof
3593 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3594 may no longer carry premises. User-level specifications are
3595 transformed accordingly by Thm.add_axiom/add_def.
3600 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3601 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3602 proof terms are enabled unconditionally in the new HOL-Proofs image.
3604 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3605 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3608 * Old lib/scripts/polyml-platform is superseded by the
3609 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3610 variant, even on a 64 bit machine. The following example setting
3611 prefers 64 bit if available:
3613 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3615 * The preliminary Isabelle/jEdit application demonstrates the emerging
3616 Isabelle/Scala layer for advanced prover interaction and integration.
3617 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3620 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3621 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3622 similar to the default assignment of the document preparation system
3623 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3624 provides some operations for direct access to the font without asking
3625 the user for manual installation.
3629 New in Isabelle2009-1 (December 2009)
3630 -------------------------------------
3634 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3635 one backslash should be used, even in ML sources.
3640 * Locale interpretation propagates mixins along the locale hierarchy.
3641 The currently only available mixins are the equations used to map
3642 local definitions to terms of the target domain of an interpretation.
3644 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3645 loc" to print all interpretations of locale "loc" in the theory.
3646 Interpretations in proofs are not shown.
3648 * Thoroughly revised locales tutorial. New section on conditional
3651 * On instantiation of classes, remaining undefined class parameters
3652 are formally declared. INCOMPATIBILITY.
3655 *** Document preparation ***
3657 * New generalized style concept for printing terms: @{foo (style) ...}
3658 instead of @{foo_style style ...} (old form is still retained for
3659 backward compatibility). Styles can be also applied for
3660 antiquotations prop, term_type and typeof.
3665 * New proof method "smt" for a combination of first-order logic with
3666 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3667 fixed-size bitvectors; there is also basic support for higher-order
3668 features (esp. lambda abstractions). It is an incomplete decision
3669 procedure based on external SMT solvers using the oracle mechanism;
3670 for the SMT solver Z3, this method is proof-producing. Certificates
3671 are provided to avoid calling the external solvers solely for
3672 re-checking proofs. Due to a remote SMT service there is no need for
3673 installing SMT solvers locally. See src/HOL/SMT.
3675 * New commands to load and prove verification conditions generated by
3676 the Boogie program verifier or derived systems (e.g. the Verifying C
3677 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3679 * New counterexample generator tool 'nitpick' based on the Kodkod
3680 relational model finder. See src/HOL/Tools/Nitpick and
3681 src/HOL/Nitpick_Examples.
3683 * New commands 'code_pred' and 'values' to invoke the predicate
3684 compiler and to enumerate values of inductive predicates.
3686 * A tabled implementation of the reflexive transitive closure.
3688 * New implementation of quickcheck uses generic code generator;
3689 default generators are provided for all suitable HOL types, records
3690 and datatypes. Old quickcheck can be re-activated importing theory
3691 Library/SML_Quickcheck.
3693 * New testing tool Mirabelle for automated proof tools. Applies
3694 several tools and tactics like sledgehammer, metis, or quickcheck, to
3695 every proof step in a theory. To be used in batch mode via the
3696 "mirabelle" utility.
3698 * New proof method "sos" (sum of squares) for nonlinear real
3699 arithmetic (originally due to John Harison). It requires theory
3700 Library/Sum_Of_Squares. It is not a complete decision procedure but
3701 works well in practice on quantifier-free real arithmetic with +, -,
3702 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3703 inequalities between polynomials. It makes use of external
3704 semidefinite programming solvers. Method "sos" generates a
3705 certificate that can be pasted into the proof thus avoiding the need
3706 to call an external tool every time the proof is checked. See
3707 src/HOL/Library/Sum_Of_Squares.
3709 * New method "linarith" invokes existing linear arithmetic decision
3712 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3714 * New Sledgehammer option "Full Types" in Proof General settings menu.
3715 Causes full type information to be output to the ATPs. This slows
3716 ATPs down considerably but eliminates a source of unsound "proofs"
3719 * New method "metisFT": A version of metis that uses full type
3720 information in order to avoid failures of proof reconstruction.
3722 * New evaluator "approximate" approximates an real valued term using
3723 the same method as the approximation method.
3725 * Method "approximate" now supports arithmetic expressions as
3726 boundaries of intervals and implements interval splitting and Taylor
3729 * ML antiquotation @{code_datatype} inserts definition of a datatype
3730 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3732 * New theory SupInf of the supremum and infimum operators for sets of
3735 * New theory Probability, which contains a development of measure
3736 theory, eventually leading to Lebesgue integration and probability.
3738 * Extended Multivariate Analysis to include derivation and Brouwer's
3741 * Reorganization of number theory, INCOMPATIBILITY:
3742 - new number theory development for nat and int, in theories Divides
3743 and GCD as well as in new session Number_Theory
3744 - some constants and facts now suffixed with _nat and _int
3746 - former session NumberTheory now named Old_Number_Theory, including
3747 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3748 - moved theory Pocklington from src/HOL/Library to
3749 src/HOL/Old_Number_Theory
3751 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3752 lcm of finite and infinite sets. It is shown that they form a complete
3755 * Class semiring_div requires superclass no_zero_divisors and proof of
3756 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3757 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3758 generalized to class semiring_div, subsuming former theorems
3759 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3760 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3763 * Refinements to lattice classes and sets:
3764 - less default intro/elim rules in locale variant, more default
3765 intro/elim rules in class variant: more uniformity
3766 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3768 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3770 - renamed ACI to inf_sup_aci
3771 - new class "boolean_algebra"
3772 - class "complete_lattice" moved to separate theory
3773 "Complete_Lattice"; corresponding constants (and abbreviations)
3774 renamed and with authentic syntax:
3775 Set.Inf ~> Complete_Lattice.Inf
3776 Set.Sup ~> Complete_Lattice.Sup
3777 Set.INFI ~> Complete_Lattice.INFI
3778 Set.SUPR ~> Complete_Lattice.SUPR
3779 Set.Inter ~> Complete_Lattice.Inter
3780 Set.Union ~> Complete_Lattice.Union
3781 Set.INTER ~> Complete_Lattice.INTER
3782 Set.UNION ~> Complete_Lattice.UNION
3783 - authentic syntax for
3786 - mere abbreviations:
3789 Set.inter (for inf, formerly Set.Int)
3790 Set.union (for sup, formerly Set.Un)
3791 Complete_Lattice.Inter (for Inf)
3792 Complete_Lattice.Union (for Sup)
3793 Complete_Lattice.INTER (for INFI)
3794 Complete_Lattice.UNION (for SUPR)
3795 - object-logic definitions as far as appropriate
3797 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3798 Un_subset_iff are explicitly deleted as default simp rules; then also
3799 their lattice counterparts le_inf_iff and le_sup_iff have to be
3800 deleted to achieve the desired effect.
3802 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3803 rules by default any longer; the same applies to min_max.inf_absorb1
3804 etc. INCOMPATIBILITY.
3806 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3807 pred_set_conv by default. INCOMPATIBILITY.
3809 * Power operations on relations and functions are now one dedicated
3810 constant "compow" with infix syntax "^^". Power operation on
3811 multiplicative monoids retains syntax "^" and is now defined generic
3812 in class power. INCOMPATIBILITY.
3814 * Relation composition "R O S" now has a more standard argument order:
3815 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3816 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3817 break, since the O_assoc rule was not rewritten like this. Fix using
3818 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3820 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3821 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3824 * Most rules produced by inductive and datatype package have mandatory
3825 prefixes. INCOMPATIBILITY.
3827 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3828 the attribute of the same name. Each of the theorems in the list
3829 DERIV_intros assumes composition with an additional function and
3830 matches a variable to the derivative, which has to be solved by the
3831 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3832 of most elementary terms. Former Maclauren.DERIV_tac and
3833 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3836 * Code generator attributes follow the usual underscore convention:
3837 code_unfold replaces code unfold
3838 code_post replaces code post
3843 sizechange -> size_change
3844 induct_scheme -> induction_schema
3847 * Discontinued abbreviation "arbitrary" of constant "undefined".
3848 INCOMPATIBILITY, use "undefined" directly.
3851 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3852 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3853 Suc_plus1 -> Suc_eq_plus1
3854 *anti_sym -> *antisym*
3855 vector_less_eq_def -> vector_le_def
3858 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3861 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3867 * Theory Representable defines a class "rep" of domains that are
3868 representable (via an ep-pair) in the universal domain type "udom".
3869 Instances are provided for all type constructors defined in HOLCF.
3871 * The 'new_domain' command is a purely definitional version of the
3872 domain package, for representable domains. Syntax is identical to the
3873 old domain package. The 'new_domain' package also supports indirect
3874 recursion using previously-defined type constructors. See
3875 src/HOLCF/ex/New_Domain.thy for examples.
3877 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3878 on the left-hand side of an equation, and then performs
3879 simplification. Rewriting is done using rules declared with the
3880 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3881 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3883 * The pattern-match compiler in 'fixrec' can now handle constructors
3884 with HOL function types. Pattern-match combinators for the Pair
3885 constructor are pre-configured.
3887 * The 'fixrec' package now produces better fixed-point induction rules
3888 for mutually-recursive definitions: Induction rules have conclusions
3889 of the form "P foo bar" instead of "P <foo, bar>".
3891 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3892 been renamed to "below". The name "below" now replaces "less" in many
3893 theorem names. (Legacy theorem names using "less" are still supported
3896 * The 'fixrec' package now supports "bottom patterns". Bottom
3897 patterns can be used to generate strictness rules, or to make
3898 functions more strict (much like the bang-patterns supported by the
3899 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3905 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3906 errors and run-time exceptions, including detailed source positions.
3908 * Structure Name_Space (formerly NameSpace) now manages uniquely
3909 identified entries, with some additional information such as source
3910 position, logical grouping etc.
3912 * Theory and context data is now introduced by the simplified and
3913 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3914 to be pure, but the old TheoryDataFun for mutable data (with explicit
3915 copy operation) is still available for some time.
3917 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3918 provides a high-level programming interface to synchronized state
3919 variables with atomic update. This works via pure function
3920 application within a critical section -- its runtime should be as
3921 short as possible; beware of deadlocks if critical code is nested,
3922 either directly or indirectly via other synchronized variables!
3924 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3925 wraps raw ML references, explicitly indicating their non-thread-safe
3926 behaviour. The Isar toplevel keeps this structure open, to
3927 accommodate Proof General as well as quick and dirty interactive
3928 experiments with references.
3930 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3931 parallel tactical reasoning.
3933 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3934 are similar to SUBPROOF, but are slightly more flexible: only the
3935 specified parts of the subgoal are imported into the context, and the
3936 body tactic may introduce new subgoals and schematic variables.
3938 * Old tactical METAHYPS, which does not observe the proof context, has
3939 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3940 or Subgoal.FOCUS etc.
3942 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3943 functors have their own ML name space there is no point to mark them
3944 separately.) Minor INCOMPATIBILITY.
3946 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3948 * Renamed several structures FooBar to Foo_Bar. Occasional,
3951 * Operations of structure Skip_Proof no longer require quick_and_dirty
3952 mode, which avoids critical setmp.
3954 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3955 combinators for "args". INCOMPATIBILITY, need to use simplified
3956 Attrib/Method.setup introduced in Isabelle2009.
3958 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3959 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3960 last resort. INCOMPATIBILITY.
3962 * Display.pretty_thm now requires a proper context (cf. former
3963 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3964 or even Display.pretty_thm_without_context as last resort.
3967 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3968 Syntax.pretty_typ/term directly, preferably with proper context
3969 instead of global theory.
3974 * Further fine tuning of parallel proof checking, scales up to 8 cores
3975 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3978 * Support for additional "Isabelle components" via etc/components, see
3979 also the system manual.
3981 * The isabelle makeall tool now operates on all components with
3982 IsaMakefile, not just hardwired "logics".
3984 * Removed "compress" option from isabelle-process and isabelle usedir;
3985 this is always enabled.
3987 * Discontinued support for Poly/ML 4.x versions.
3989 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3990 on a given logic image. This requires the lighttpd webserver and is
3991 currently supported on Linux only.
3995 New in Isabelle2009 (April 2009)
3996 --------------------------------
4000 * Simplified main Isabelle executables, with less surprises on
4001 case-insensitive file-systems (such as Mac OS).
4003 - The main Isabelle tool wrapper is now called "isabelle" instead of
4006 - The former "isabelle" alias for "isabelle-process" has been
4007 removed (should rarely occur to regular users).
4009 - The former "isabelle-interface" and its alias "Isabelle" have been
4010 removed (interfaces are now regular Isabelle tools).
4012 Within scripts and make files, the Isabelle environment variables
4013 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4014 respectively. (The latter are still available as legacy feature.)
4016 The old isabelle-interface wrapper could react in confusing ways if
4017 the interface was uninstalled or changed otherwise. Individual
4018 interface tool configuration is now more explicit, see also the
4019 Isabelle system manual. In particular, Proof General is now available
4020 via "isabelle emacs".
4022 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4023 purge installed copies of Isabelle executables and re-run "isabelle
4024 install -p ...", or use symlinks.
4026 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4027 old ~/isabelle, which was slightly non-standard and apt to cause
4028 surprises on case-insensitive file-systems (such as Mac OS).
4030 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4031 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4032 care is required when using older releases of Isabelle. Note that
4033 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4034 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4036 * Proofs of fully specified statements are run in parallel on
4037 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4038 a regular 4-core machine, if the initial heap space is made reasonably
4039 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4041 * The main reference manuals ("isar-ref", "implementation", and
4042 "system") have been updated and extended. Formally checked references
4043 as hyperlinks are now available uniformly.
4048 * Complete re-implementation of locales. INCOMPATIBILITY in several
4049 respects. The most important changes are listed below. See the
4050 Tutorial on Locales ("locales" manual) for details.
4052 - In locale expressions, instantiation replaces renaming. Parameters
4053 must be declared in a for clause. To aid compatibility with previous
4054 parameter inheritance, in locale declarations, parameters that are not
4055 'touched' (instantiation position "_" or omitted) are implicitly added
4056 with their syntax at the beginning of the for clause.
4058 - Syntax from abbreviations and definitions in locales is available in
4059 locale expressions and context elements. The latter is particularly
4060 useful in locale declarations.
4062 - More flexible mechanisms to qualify names generated by locale
4063 expressions. Qualifiers (prefixes) may be specified in locale
4064 expressions, and can be marked as mandatory (syntax: "name!:") or
4065 optional (syntax "name?:"). The default depends for plain "name:"
4066 depends on the situation where a locale expression is used: in
4067 commands 'locale' and 'sublocale' prefixes are optional, in
4068 'interpretation' and 'interpret' prefixes are mandatory. The old
4069 implicit qualifiers derived from the parameter names of a locale are
4070 no longer generated.
4072 - Command "sublocale l < e" replaces "interpretation l < e". The
4073 instantiation clause in "interpretation" and "interpret" (square
4074 brackets) is no longer available. Use locale expressions.
4076 - When converting proof scripts, mandatory qualifiers in
4077 'interpretation' and 'interpret' should be retained by default, even
4078 if this is an INCOMPATIBILITY compared to former behavior. In the
4079 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4080 in locale expressions range over a single locale instance only.
4082 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4083 In existing theorem specifications replace the includes element by the
4084 respective context elements of the included locale, omitting those
4085 that are already present in the theorem specification. Multiple
4086 assume elements of a locale should be replaced by a single one
4087 involving the locale predicate. In the proof body, declarations (most
4088 notably theorems) may be regained by interpreting the respective
4089 locales in the proof context as required (command "interpret").
4091 If using "includes" in replacement of a target solely because the
4092 parameter types in the theorem are not as general as in the target,
4093 consider declaring a new locale with additional type constraints on
4094 the parameters (context element "constrains").
4096 - Discontinued "locale (open)". INCOMPATIBILITY.
4098 - Locale interpretation commands no longer attempt to simplify goal.
4099 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4100 methods intro_locales and unfold_locales to clarify.
4102 - Locale interpretation commands no longer accept interpretation
4103 attributes. INCOMPATIBILITY.
4105 * Class declaration: so-called "base sort" must not be given in import
4106 list any longer, but is inferred from the specification. Particularly
4113 class foo = type + ...
4115 * Class target: global versions of theorems stemming do not carry a
4116 parameter prefix any longer. INCOMPATIBILITY.
4118 * Class 'instance' command no longer accepts attached definitions.
4119 INCOMPATIBILITY, use proper 'instantiation' target instead.
4121 * Recovered hiding of consts, which was accidentally broken in
4122 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4123 makes c inaccessible; consider using ``hide (open) const c'' instead.
4125 * Slightly more coherent Pure syntax, with updated documentation in
4126 isar-ref manual. Removed locales meta_term_syntax and
4127 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4128 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4129 directly in regular applications.
4131 * There is a new syntactic category "float_const" for signed decimal
4132 fractions (e.g. 123.45 or -123.45).
4134 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4135 interface with 'setup' command instead.
4137 * Command 'local_setup' is similar to 'setup', but operates on a local
4140 * The 'axiomatization' command now only works within a global theory
4141 context. INCOMPATIBILITY.
4143 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4144 hypotheses. Sorts required in the course of reasoning need to be
4145 covered by the constraints in the initial statement, completed by the
4146 type instance information of the background theory. Non-trivial sort
4147 hypotheses, which rarely occur in practice, may be specified via
4148 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4150 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4152 The result contains an implicit sort hypotheses as before --
4153 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4156 * Generalized Isar history, with support for linear undo, direct state
4159 * Changed defaults for unify configuration options:
4161 unify_trace_bound = 50 (formerly 25)
4162 unify_search_bound = 60 (formerly 30)
4164 * Different bookkeeping for code equations (INCOMPATIBILITY):
4166 a) On theory merge, the last set of code equations for a particular
4167 constant is taken (in accordance with the policy applied by other
4168 parts of the code generator framework).
4170 b) Code equations stemming from explicit declarations (e.g. code
4171 attribute) gain priority over default code equations stemming
4172 from definition, primrec, fun etc.
4174 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4176 * Unified theorem tables for both code generators. Thus [code
4177 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4179 * Command 'find_consts' searches for constants based on type and name
4182 find_consts "_ => bool"
4184 By default, matching is against subtypes, but it may be restricted to
4185 the whole type. Searching by name is possible. Multiple queries are
4186 conjunctive and queries may be negated by prefixing them with a
4189 find_consts strict: "_ => bool" name: "Int" -"int => int"
4191 * New 'find_theorems' criterion "solves" matches theorems that
4192 directly solve the current goal (modulo higher-order unification).
4194 * Auto solve feature for main theorem statements: whenever a new goal
4195 is stated, "find_theorems solves" is called; any theorems that could
4196 solve the lemma directly are listed as part of the goal state.
4197 Cf. associated options in Proof General Isabelle settings menu,
4198 enabled by default, with reasonable timeout for pathological cases of
4199 higher-order unification.
4202 *** Document preparation ***
4204 * Antiquotation @{lemma} now imitates a regular terminal proof,
4205 demanding keyword 'by' and supporting the full method expression
4206 syntax just like the Isar command 'by'.
4211 * Integrated main parts of former image HOL-Complex with HOL. Entry
4212 points Main and Complex_Main remain as before.
4214 * Logic image HOL-Plain provides a minimal HOL with the most important
4215 tools available (inductive, datatype, primrec, ...). This facilitates
4216 experimentation and tool development. Note that user applications
4217 (and library theories) should never refer to anything below theory
4220 * Logic image HOL-Main stops at theory Main, and thus facilitates
4221 experimentation due to shorter build times.
4223 * Logic image HOL-NSA contains theories of nonstandard analysis which
4224 were previously part of former HOL-Complex. Entry point Hyperreal
4225 remains valid, but theories formerly using Complex_Main should now use
4226 new entry point Hypercomplex.
4228 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4229 Posix processes. Avoids potentially expensive forking of the ML
4230 process. New thread-based implementation also works on non-Unix
4231 platforms (Cygwin). Provers are no longer hardwired, but defined
4232 within the theory via plain ML wrapper functions. Basic Sledgehammer
4233 commands are covered in the isar-ref manual.
4235 * Wrapper scripts for remote SystemOnTPTP service allows to use
4236 sledgehammer without local ATP installation (Vampire etc.). Other
4237 provers may be included via suitable ML wrappers, see also
4238 src/HOL/ATP_Linkup.thy.
4240 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4243 * The metis method no longer fails because the theorem is too trivial
4244 (contains the empty clause).
4246 * The metis method now fails in the usual manner, rather than raising
4247 an exception, if it determines that it cannot prove the theorem.
4249 * Method "coherent" implements a prover for coherent logic (see also
4250 src/Tools/coherent.ML).
4252 * Constants "undefined" and "default" replace "arbitrary". Usually
4253 "undefined" is the right choice to replace "arbitrary", though
4254 logically there is no difference. INCOMPATIBILITY.
4256 * Command "value" now integrates different evaluation mechanisms. The
4257 result of the first successful evaluation mechanism is printed. In
4258 square brackets a particular named evaluation mechanisms may be
4259 specified (currently, [SML], [code] or [nbe]). See further
4260 src/HOL/ex/Eval_Examples.thy.
4262 * Normalization by evaluation now allows non-leftlinear equations.
4263 Declare with attribute [code nbe].
4265 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4266 as the structured Isar versions "cases" and "induct", cf. the
4267 corresponding "cases" and "induct" attributes. Mutual induction rules
4268 are now presented as a list of individual projections
4269 (e.g. foo_bar.inducts for types foo and bar); the old format with
4270 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4271 rare situations a different rule is selected --- notably nested tuple
4272 elimination instead of former prod.exhaust: use explicit (case_tac t
4273 rule: prod.exhaust) here.
4275 * Attributes "cases", "induct", "coinduct" support "del" option.
4277 * Removed fact "case_split_thm", which duplicates "case_split".
4279 * The option datatype has been moved to a new theory Option. Renamed
4280 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4282 * New predicate "strict_mono" classifies strict functions on partial
4283 orders. With strict functions on linear orders, reasoning about
4284 (in)equalities is facilitated by theorems "strict_mono_eq",
4285 "strict_mono_less_eq" and "strict_mono_less".
4287 * Some set operations are now proper qualified constants with
4288 authentic syntax. INCOMPATIBILITY:
4299 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4302 * Auxiliary class "itself" has disappeared -- classes without any
4303 parameter are treated as expected by the 'class' command.
4305 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4307 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4308 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4310 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4311 method "approximation". It proves formulas on real values by using
4312 interval arithmetic. In the formulas are also the transcendental
4313 functions sin, cos, tan, atan, ln, exp and the constant pi are
4314 allowed. For examples see
4315 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4317 * Theory "Reflection" now resides in HOL/Library.
4319 * Entry point to Word library now simply named "Word".
4322 * Made source layout more coherent with logical distribution
4325 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4326 src/HOL/Library/Code_Message.thy ~> src/HOL/
4327 src/HOL/Library/GCD.thy ~> src/HOL/
4328 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4329 src/HOL/Library/Parity.thy ~> src/HOL/
4330 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4331 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4332 src/HOL/Real/Lubs.thy ~> src/HOL/
4333 src/HOL/Real/PReal.thy ~> src/HOL/
4334 src/HOL/Real/Rational.thy ~> src/HOL/
4335 src/HOL/Real/RComplete.thy ~> src/HOL/
4336 src/HOL/Real/RealDef.thy ~> src/HOL/
4337 src/HOL/Real/RealPow.thy ~> src/HOL/
4338 src/HOL/Real/Real.thy ~> src/HOL/
4339 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4340 src/HOL/Complex/Complex.thy ~> src/HOL/
4341 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4342 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4343 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4344 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4345 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4346 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4347 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4348 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4349 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4350 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4351 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4352 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4353 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4354 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4355 src/HOL/Real/Float ~> src/HOL/Library/
4356 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4357 src/HOL/Real/RealVector.thy ~> src/HOL/
4359 src/HOL/arith_data.ML ~> src/HOL/Tools
4360 src/HOL/hologic.ML ~> src/HOL/Tools
4361 src/HOL/simpdata.ML ~> src/HOL/Tools
4362 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4363 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4364 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4365 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4366 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4367 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4368 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4370 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4371 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4372 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4373 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4374 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4375 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4377 * If methods "eval" and "evaluation" encounter a structured proof
4378 state with !!/==>, only the conclusion is evaluated to True (if
4379 possible), avoiding strange error messages.
4381 * Method "sizechange" automates termination proofs using (a
4382 modification of) the size-change principle. Requires SAT solver. See
4383 src/HOL/ex/Termination.thy for examples.
4385 * Simplifier: simproc for let expressions now unfolds if bound
4386 variable occurs at most once in let expression body. INCOMPATIBILITY.
4388 * Method "arith": Linear arithmetic now ignores all inequalities when
4389 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4391 * New attribute "arith" for facts that should always be used
4392 automatically by arithmetic. It is intended to be used locally in
4395 assumes [arith]: "x > 0"
4397 Global usage is discouraged because of possible performance impact.
4399 * New classes "top" and "bot" with corresponding operations "top" and
4400 "bot" in theory Orderings; instantiation of class "complete_lattice"
4401 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4403 * Changed definition lemma "less_fun_def" in order to provide an
4404 instance for preorders on functions; use lemma "less_le" instead.
4407 * Theory Orderings: class "wellorder" moved here, with explicit
4408 induction rule "less_induct" as assumption. For instantiation of
4409 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4412 * Theory Orderings: added class "preorder" as superclass of "order".
4413 INCOMPATIBILITY: Instantiation proofs for order, linorder
4414 etc. slightly changed. Some theorems named order_class.* now named
4417 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4420 * Theory Finite_Set: added a new fold combinator of type
4422 ('a => 'b => 'b) => 'b => 'a set => 'b
4424 Occasionally this is more convenient than the old fold combinator
4425 which is now defined in terms of the new one and renamed to
4428 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4429 and "ring_simps" have been replaced by "algebra_simps" (which can be
4430 extended with further lemmas!). At the moment both still exist but
4431 the former will disappear at some point.
4433 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4434 class recpower. Type-specific simp rules for various recpower types
4435 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4437 rat_power_0 -> power_0
4438 rat_power_Suc -> power_Suc
4439 realpow_0 -> power_0
4440 realpow_Suc -> power_Suc
4441 complexpow_0 -> power_0
4442 complexpow_Suc -> power_Suc
4443 power_poly_0 -> power_0
4444 power_poly_Suc -> power_Suc
4446 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4447 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4448 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4449 of lemmas from Divides has been generalized from nat to class
4450 semiring_div. INCOMPATIBILITY. This involves the following theorem
4451 renames resulting from duplicate elimination:
4453 dvd_def_mod ~> dvd_eq_mod_eq_0
4454 zero_dvd_iff ~> dvd_0_left_iff
4455 dvd_0 ~> dvd_0_right
4456 DIVISION_BY_ZERO_DIV ~> div_by_0
4457 DIVISION_BY_ZERO_MOD ~> mod_by_0
4458 mult_div ~> div_mult_self2_is_id
4459 mult_mod ~> mod_mult_self2_is_0
4461 * Theory IntDiv: removed many lemmas that are instances of class-based
4462 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4463 rename old lemmas as follows:
4465 dvd_diff -> nat_dvd_diff
4466 dvd_zminus_iff -> dvd_minus_iff
4467 mod_add1_eq -> mod_add_eq
4468 mod_mult1_eq -> mod_mult_right_eq
4469 mod_mult1_eq' -> mod_mult_left_eq
4470 mod_mult_distrib_mod -> mod_mult_eq
4471 nat_mod_add_left_eq -> mod_add_left_eq
4472 nat_mod_add_right_eq -> mod_add_right_eq
4473 nat_mod_div_trivial -> mod_div_trivial
4474 nat_mod_mod_trivial -> mod_mod_trivial
4475 zdiv_zadd_self1 -> div_add_self1
4476 zdiv_zadd_self2 -> div_add_self2
4477 zdiv_zmult_self1 -> div_mult_self2_is_id
4478 zdiv_zmult_self2 -> div_mult_self1_is_id
4479 zdvd_triv_left -> dvd_triv_left
4480 zdvd_triv_right -> dvd_triv_right
4481 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4482 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4483 zmod_zadd_left_eq -> mod_add_left_eq
4484 zmod_zadd_right_eq -> mod_add_right_eq
4485 zmod_zadd_self1 -> mod_add_self1
4486 zmod_zadd_self2 -> mod_add_self2
4487 zmod_zadd1_eq -> mod_add_eq
4488 zmod_zdiff1_eq -> mod_diff_eq
4489 zmod_zdvd_zmod -> mod_mod_cancel
4490 zmod_zmod_cancel -> mod_mod_cancel
4491 zmod_zmult_self1 -> mod_mult_self2_is_0
4492 zmod_zmult_self2 -> mod_mult_self1_is_0
4495 zdvd_abs1 -> abs_dvd_iff
4496 zdvd_abs2 -> dvd_abs_iff
4497 zdvd_refl -> dvd_refl
4498 zdvd_trans -> dvd_trans
4499 zdvd_zadd -> dvd_add
4500 zdvd_zdiff -> dvd_diff
4501 zdvd_zminus_iff -> dvd_minus_iff
4502 zdvd_zminus2_iff -> minus_dvd_iff
4503 zdvd_zmultD -> dvd_mult_right
4504 zdvd_zmultD2 -> dvd_mult_left
4505 zdvd_zmult_mono -> mult_dvd_mono
4506 zdvd_0_right -> dvd_0_right
4507 zdvd_0_left -> dvd_0_left_iff
4508 zdvd_1_left -> one_dvd
4509 zminus_dvd_iff -> minus_dvd_iff
4511 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4513 * The real numbers offer decimal input syntax: 12.34 is translated
4514 into 1234/10^2. This translation is not reversed upon output.
4516 * Theory Library/Polynomial defines an abstract type 'a poly of
4517 univariate polynomials with coefficients of type 'a. In addition to
4518 the standard ring operations, it also supports div and mod. Code
4519 generation is also supported, using list-style constructors.
4521 * Theory Library/Inner_Product defines a class of real_inner for real
4522 inner product spaces, with an overloaded operation inner :: 'a => 'a
4523 => real. Class real_inner is a subclass of real_normed_vector from
4526 * Theory Library/Product_Vector provides instances for the product
4527 type 'a * 'b of several classes from RealVector and Inner_Product.
4528 Definitions of addition, subtraction, scalar multiplication, norms,
4529 and inner products are included.
4531 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4532 addition to the field operations, numerals and case syntax are also
4535 * Theory Library/Diagonalize provides constructive version of Cantor's
4536 first diagonalization argument.
4538 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4539 zlcm (for int); carried together from various gcd/lcm developements in
4540 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4541 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4542 may recover tupled syntax as follows:
4544 hide (open) const gcd
4545 abbreviation gcd where
4546 "gcd == (%(a, b). GCD.gcd a b)"
4548 GCD.gcd ("gcd '(_, _')")
4550 The same works for lcm, zgcd, zlcm.
4552 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4553 instantiations for algebraic structures. Removed some duplicate
4554 theorems. Changes in simp rules. INCOMPATIBILITY.
4556 * ML antiquotation @{code} takes a constant as argument and generates
4557 corresponding code in background and inserts name of the corresponding
4558 resulting ML value/function/datatype constructor binding in place.
4559 All occurrences of @{code} with a single ML block are generated
4560 simultaneously. Provides a generic and safe interface for
4561 instrumentalizing code generation. See
4562 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4563 In future you ought to refrain from ad-hoc compiling generated SML
4564 code on the ML toplevel. Note that (for technical reasons) @{code}
4565 cannot refer to constants for which user-defined serializations are
4566 set. Refer to the corresponding ML counterpart directly in that
4569 * Command 'rep_datatype': instead of theorem names the command now
4570 takes a list of terms denoting the constructors of the type to be
4571 represented as datatype. The characteristic theorems have to be
4572 proven. INCOMPATIBILITY. Also observe that the following theorems
4573 have disappeared in favour of existing ones:
4575 unit_induct ~> unit.induct
4576 prod_induct ~> prod.induct
4577 sum_induct ~> sum.induct
4578 Suc_Suc_eq ~> nat.inject
4579 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4584 * New locales for orders and lattices where the equivalence relation
4585 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4586 locales use a record structure with field eq for the equivalence.
4588 * New theory of factorial domains.
4590 * Units_l_inv and Units_r_inv are now simp rules by default.
4591 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4592 and/or r_inv will now also require deletion of these lemmas.
4594 * Renamed the following theorems, INCOMPATIBILITY:
4596 UpperD ~> Upper_memD
4597 LowerD ~> Lower_memD
4598 least_carrier ~> least_closed
4599 greatest_carrier ~> greatest_closed
4600 greatest_Lower_above ~> greatest_Lower_below
4601 one_zero ~> carrier_one_zero
4602 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4607 * Nominal datatypes can now contain type-variables.
4609 * Commands 'nominal_inductive' and 'equivariance' work with local
4612 * Nominal primrec can now works with local theory targets and its
4613 specification syntax now conforms to the general format as seen in
4616 * Method "perm_simp" honours the standard simplifier attributes
4617 (no_asm), (no_asm_use) etc.
4619 * The new predicate #* is defined like freshness, except that on the
4620 left hand side can be a set or list of atoms.
4622 * Experimental command 'nominal_inductive2' derives strong induction
4623 principles for inductive definitions. In contrast to
4624 'nominal_inductive', which can only deal with a fixed number of
4625 binders, it can deal with arbitrary expressions standing for sets of
4626 atoms to be avoided. The only inductive definition we have at the
4627 moment that needs this generalisation is the typing rule for Lets in
4630 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4631 -----------------------------------------------------------------
4632 Gamma |- Let x be t1 in t2 : T2
4634 In this rule one wants to avoid all the binders that are introduced by
4635 "close Gamma T1". We are looking for other examples where this
4636 feature might be useful. Please let us know.
4641 * Reimplemented the simplification procedure for proving continuity
4642 subgoals. The new simproc is extensible; users can declare additional
4643 continuity introduction rules with the attribute [cont2cont].
4645 * The continuity simproc now uses a different introduction rule for
4646 solving continuity subgoals on terms with lambda abstractions. In
4647 some rare cases the new simproc may fail to solve subgoals that the
4648 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4649 Potential INCOMPATIBILITY.
4651 * Command 'fixrec': specification syntax now conforms to the general
4652 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4653 examples. INCOMPATIBILITY.
4658 * Proof of Zorn's Lemma for partial orders.
4663 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4664 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4665 depends on multithreading, so timouts will not work before Poly/ML
4668 * High-level support for concurrent ML programming, see
4669 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4670 particularly convenient to organize independent functional
4671 computations. The concept of "synchronized variables" provides a
4672 higher-order interface for components with shared state, avoiding the
4673 delicate details of mutexes and condition variables. (Requires
4674 Poly/ML 5.2.1 or later.)
4676 * ML bindings produced via Isar commands are stored within the Isar
4677 context (theory or proof). Consequently, commands like 'use' and 'ML'
4678 become thread-safe and work with undo as expected (concerning
4679 top-level bindings, not side-effects on global references).
4680 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4681 compiler at runtime; really global bindings need to be given outside a
4682 theory. (Requires Poly/ML 5.2 or later.)
4684 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4685 context. Top-level ML bindings are stored within the proof context in
4686 a purely sequential fashion, disregarding the nested proof structure.
4687 ML bindings introduced by 'ML_prf' are discarded at the end of the
4688 proof. (Requires Poly/ML 5.2 or later.)
4690 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4691 and Method.setup, as well as Isar commands 'attribute_setup' and
4692 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4693 existing code accordingly, or use plain 'setup' together with old
4696 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4697 to 'a -> thm, while results are always tagged with an authentic oracle
4698 name. The Isar command 'oracle' is now polymorphic, no argument type
4699 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4700 accordingly. Note that extra performance may be gained by producing
4701 the cterm carefully, avoiding slow Thm.cterm_of.
4703 * Simplified interface for defining document antiquotations via
4704 ThyOutput.antiquotation, ThyOutput.output, and optionally
4705 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4706 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4709 * More systematic treatment of long names, abstract name bindings, and
4710 name space operations. Basic operations on qualified names have been
4711 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4712 Long_Name.append. Old type bstring has been mostly replaced by
4713 abstract type binding (see structure Binding), which supports precise
4714 qualification by packages and local theory targets, as well as proper
4715 tracking of source positions. INCOMPATIBILITY, need to wrap old
4716 bstring values into Binding.name, or better pass through abstract
4717 bindings everywhere. See further src/Pure/General/long_name.ML,
4718 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4720 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4721 LocalTheory.note etc.) now refer to the *full* internal name, not the
4722 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4724 * Disposed old type and term read functions (Sign.read_def_typ,
4725 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4726 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4727 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4728 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4729 resort for legacy applications.
4731 * Disposed old declarations, tactics, tactic combinators that refer to
4732 the simpset or claset of an implicit theory (such as Addsimps,
4733 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4734 embedded ML text, or local_simpset_of with a proper context passed as
4735 explicit runtime argument.
4737 * Rules and tactics that read instantiations (read_instantiate,
4738 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4739 context, which is required for parsing and type-checking. Moreover,
4740 the variables are specified as plain indexnames, not string encodings
4741 thereof. INCOMPATIBILITY.
4743 * Generic Toplevel.add_hook interface allows to analyze the result of
4744 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4745 for theorem dependency output of transactions resulting in a new
4748 * ML antiquotations: block-structured compilation context indicated by
4749 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4751 @{binding name} - basic name binding
4752 @{let ?pat = term} - term abbreviation (HO matching)
4753 @{note name = fact} - fact abbreviation
4754 @{thm fact} - singleton fact (with attributes)
4755 @{thms fact} - general fact (with attributes)
4756 @{lemma prop by method} - singleton goal
4757 @{lemma prop by meth1 meth2} - singleton goal
4758 @{lemma prop1 ... propN by method} - general goal
4759 @{lemma prop1 ... propN by meth1 meth2} - general goal
4760 @{lemma (open) ...} - open derivation
4765 * The Isabelle "emacs" tool provides a specific interface to invoke
4766 Proof General / Emacs, with more explicit failure if that is not
4767 installed (the old isabelle-interface script silently falls back on
4768 isabelle-process). The PROOFGENERAL_HOME setting determines the
4769 installation location of the Proof General distribution.
4771 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4772 the Isabelle process into a JVM/Scala application. See
4773 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4774 process wrapper has been discontinued.)
4776 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4778 * Various status messages (with exact source position information) are
4779 emitted, if proper markup print mode is enabled. This allows
4780 user-interface components to provide detailed feedback on internal
4785 New in Isabelle2008 (June 2008)
4786 -------------------------------
4790 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4791 and updated, with formally checked references as hyperlinks.
4793 * Theory loader: use_thy (and similar operations) no longer set the
4794 implicit ML context, which was occasionally hard to predict and in
4795 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4796 provides a proper context already.
4798 * Theory loader: old-style ML proof scripts being *attached* to a thy
4799 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4800 'use' within a theory file will do the job.
4802 * Name space merge now observes canonical order, i.e. the second space
4803 is inserted into the first one, while existing entries in the first
4804 space take precedence. INCOMPATIBILITY in rare situations, may try to
4805 swap theory imports.
4807 * Syntax: symbol \<chi> is now considered a letter. Potential
4808 INCOMPATIBILITY in identifier syntax etc.
4810 * Outer syntax: string tokens no longer admit escaped white space,
4811 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4812 white space without escapes.
4814 * Outer syntax: string tokens may contain arbitrary character codes
4815 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4821 * Context-dependent token translations. Default setup reverts locally
4822 fixed variables, and adds hilite markup for undeclared frees.
4824 * Unused theorems can be found using the new command 'unused_thms'.
4825 There are three ways of invoking it:
4828 Only finds unused theorems in the current theory.
4830 (2) unused_thms thy_1 ... thy_n -
4831 Finds unused theorems in the current theory and all of its ancestors,
4832 excluding the theories thy_1 ... thy_n and all of their ancestors.
4834 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4835 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4836 their ancestors, excluding the theories thy_1 ... thy_n and all of
4839 In order to increase the readability of the list produced by
4840 unused_thms, theorems that have been created by a particular instance
4841 of a theory command such as 'inductive' or 'function' are considered
4842 to belong to the same "group", meaning that if at least one theorem in
4843 this group is used, the other theorems in the same group are no longer
4844 reported as unused. Moreover, if all theorems in the group are
4845 unused, only one theorem in the group is displayed.
4847 Note that proof objects have to be switched on in order for
4848 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4849 usually the case when using Proof General with the default settings).
4851 * Authentic naming of facts disallows ad-hoc overwriting of previous
4852 theorems within the same name space. INCOMPATIBILITY, need to remove
4853 duplicate fact bindings, or even accidental fact duplications. Note
4854 that tools may maintain dynamically scoped facts systematically, using
4855 PureThy.add_thms_dynamic.
4857 * Command 'hide' now allows to hide from "fact" name space as well.
4859 * Eliminated destructive theorem database, simpset, claset, and
4860 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4861 update of theories within ML code.
4863 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4864 INCOMPATIBILITY, object-logics depending on former Pure require
4865 additional setup PureThy.old_appl_syntax_setup; object-logics
4866 depending on former CPure need to refer to Pure.
4868 * Commands 'use' and 'ML' are now purely functional, operating on
4869 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4870 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4873 * Command 'setup': discontinued implicit version with ML reference.
4875 * Instantiation target allows for simultaneous specification of class
4876 instance operations together with an instantiation proof.
4877 Type-checking phase allows to refer to class operations uniformly.
4878 See src/HOL/Complex/Complex.thy for an Isar example and
4879 src/HOL/Library/Eval.thy for an ML example.
4881 * Indexing of literal facts: be more serious about including only
4882 facts from the visible specification/proof context, but not the
4883 background context (locale etc.). Affects `prop` notation and method
4884 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4887 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4888 "(open)" option, which used to expose internal bound variables to the
4891 * Isar statements: removed obsolete case "rule_context".
4892 INCOMPATIBILITY, better use explicit fixes/assumes.
4894 * Locale proofs: default proof step now includes 'unfold_locales';
4895 hence 'proof' without argument may be used to unfold locale
4899 *** Document preparation ***
4901 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4902 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4903 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4904 spot); renamed link color from "darkblue" to "linkcolor" (default
4905 value unchanged, can be redefined via \definecolor); no longer sets
4906 "a4paper" option (unnecessary or even intrusive).
4908 * Antiquotation @{lemma A method} proves proposition A by the given
4909 method (either a method name or a method name plus (optional) method
4910 arguments in parentheses) and prints A just like @{prop A}.
4915 * New primrec package. Specification syntax conforms in style to
4916 definition/function/.... No separate induction rule is provided. The
4917 "primrec" command distinguishes old-style and new-style specifications
4918 by syntax. The former primrec package is now named OldPrimrecPackage.
4919 When adjusting theories, beware: constants stemming from new-style
4920 primrec specifications have authentic syntax.
4922 * Metis prover is now an order of magnitude faster, and also works
4923 with multithreading.
4925 * Metis: the maximum number of clauses that can be produced from a
4926 theorem is now given by the attribute max_clauses. Theorems that
4927 exceed this number are ignored, with a warning printed.
4929 * Sledgehammer no longer produces structured proofs by default. To
4930 enable, declare [[sledgehammer_full = true]]. Attributes
4931 reconstruction_modulus, reconstruction_sorts renamed
4932 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4934 * Method "induct_scheme" derives user-specified induction rules
4935 from well-founded induction and completeness of patterns. This factors
4936 out some operations that are done internally by the function package
4937 and makes them available separately. See
4938 src/HOL/ex/Induction_Scheme.thy for examples.
4940 * More flexible generation of measure functions for termination
4941 proofs: Measure functions can be declared by proving a rule of the
4942 form "is_measure f" and giving it the [measure_function] attribute.
4943 The "is_measure" predicate is logically meaningless (always true), and
4944 just guides the heuristic. To find suitable measure functions, the
4945 termination prover sets up the goal "is_measure ?f" of the appropriate
4946 type and generates all solutions by prolog-style backwards proof using
4949 This setup also deals with rules like
4951 "is_measure f ==> is_measure (list_size f)"
4953 which accommodates nested datatypes that recurse through lists.
4954 Similar rules are predeclared for products and option types.
4956 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4960 - Definitions of overloaded constants on sets have to be replaced by
4961 definitions on => and bool.
4963 - Some definitions of overloaded operators on sets can now be proved
4964 using the definitions of the operators on => and bool. Therefore,
4965 the following theorems have been renamed:
4967 subset_def -> subset_eq
4968 psubset_def -> psubset_eq
4969 set_diff_def -> set_diff_eq
4970 Compl_def -> Compl_eq
4971 Sup_set_def -> Sup_set_eq
4972 Inf_set_def -> Inf_set_eq
4973 sup_set_def -> sup_set_eq
4974 inf_set_def -> inf_set_eq
4976 - Due to the incompleteness of the HO unification algorithm, some
4977 rules such as subst may require manual instantiation, if some of
4978 the unknowns in the rule is a set.
4980 - Higher order unification and forward proofs:
4983 have "P (S::'a set)" <...>
4984 then have "EX S. P S" ..
4986 no longer works (due to the incompleteness of the HO unification
4987 algorithm) and must be replaced by the pattern
4994 - Calculational reasoning with subst (or similar rules):
4997 have "P (S::'a set)" <...>
4998 also have "S = T" <...>
4999 finally have "P T" .
5001 no longer works (for similar reasons as the previous example) and
5002 must be replaced by something like
5004 have "P (S::'a set)" <...>
5005 moreover have "S = T" <...>
5006 ultimately have "P T" by simp
5008 - Tactics or packages written in ML code:
5009 Code performing pattern matching on types via
5011 Type ("set", [T]) => ...
5013 must be rewritten. Moreover, functions like strip_type or
5014 binder_types no longer return the right value when applied to a
5017 T1 => ... => Tn => U => bool
5021 T1 => ... => Tn => U set
5023 * Merged theories Wellfounded_Recursion, Accessible_Part and
5024 Wellfounded_Relations to theory Wellfounded.
5026 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5028 * Class finite no longer treats UNIV as class parameter. Use class
5029 enum from theory Library/Enum instead to achieve a similar effect.
5032 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5033 and "Cons". INCOMPATIBILITY.
5035 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5036 Potential INCOMPATIBILITY.
5038 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5039 injective_fst_snd removed, use split_eta and prod_eqI instead.
5040 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5042 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5043 the same name in theory Orderings:
5053 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5054 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5055 and different variable names.
5057 * Library/Option_ord.thy: Canonical order on option type.
5059 * Library/RBT.thy: Red-black trees, an efficient implementation of
5062 * Library/Countable.thy: Type class for countable types.
5064 * Theory Int: The representation of numerals has changed. The infix
5065 operator BIT and the bit datatype with constructors B0 and B1 have
5066 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5067 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5068 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5071 * Theory Nat: definition of <= and < on natural numbers no longer
5072 depend on well-founded relations. INCOMPATIBILITY. Definitions
5073 le_def and less_def have disappeared. Consider lemmas not_less
5074 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5076 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5077 (whose purpose mainly is for various fold_set functionals) have been
5078 abandoned in favor of the existing algebraic classes
5079 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5080 lower_semilattice (resp. upper_semilattice) and linorder.
5083 * Theory Transitive_Closure: induct and cases rules now declare proper
5084 case_names ("base" and "step"). INCOMPATIBILITY.
5086 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5087 lattices. The form set-specific version is available as
5088 Inductive.lfp_ordinal_induct_set.
5090 * Renamed theorems "power.simps" to "power_int.simps".
5093 * Class semiring_div provides basic abstract properties of semirings
5094 with division and modulo operations. Subsumes former class dvd_mod.
5096 * Merged theories IntDef, Numeral and IntArith into unified theory
5097 Int. INCOMPATIBILITY.
5099 * Theory Library/Code_Index: type "index" now represents natural
5100 numbers rather than integers. INCOMPATIBILITY.
5102 * New class "uminus" with operation "uminus" (split of from class
5103 "minus" which now only has operation "minus", binary).
5106 * Constants "card", "internal_split", "option_map" now with authentic
5107 syntax. INCOMPATIBILITY.
5109 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5110 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5111 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5112 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5113 Sup_set_def, le_def, less_def, option_map_def now with object
5114 equality. INCOMPATIBILITY.
5116 * Records. Removed K_record, and replaced it by pure lambda term
5117 %x. c. The simplifier setup is now more robust against eta expansion.
5118 INCOMPATIBILITY: in cases explicitly referring to K_record.
5120 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5122 * Library/ListVector: new theory of arithmetic vector operations.
5124 * Library/Order_Relation: new theory of various orderings as sets of
5125 pairs. Defines preorders, partial orders, linear orders and
5126 well-orders on sets and on types.
5131 * Renamed some theories to allow to loading both ZF and HOL in the
5134 Datatype -> Datatype_ZF
5135 Inductive -> Inductive_ZF
5142 INCOMPATIBILITY: ZF theories that import individual theories below
5143 Main might need to be adapted. Regular theory Main is still
5144 available, as trivial extension of Main_ZF.
5149 * ML within Isar: antiquotation @{const name} or @{const
5150 name(typargs)} produces statically-checked Const term.
5152 * Functor NamedThmsFun: data is available to the user as dynamic fact
5153 (of the same name). Removed obsolete print command.
5155 * Removed obsolete "use_legacy_bindings" function.
5157 * The ``print mode'' is now a thread-local value derived from a global
5158 template (the former print_mode reference), thus access becomes
5159 non-critical. The global print_mode reference is for session
5160 management only; user-code should use print_mode_value,
5161 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5163 * Functions system/system_out provide a robust way to invoke external
5164 shell commands, with propagation of interrupts (requires Poly/ML
5165 5.2.1). Do not use OS.Process.system etc. from the basis library!
5170 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5171 in accordance with Proof General 3.7, which prefers GNU emacs.
5173 * isatool tty runs Isabelle process with plain tty interaction;
5174 optional line editor may be specified via ISABELLE_LINE_EDITOR
5175 setting, the default settings attempt to locate "ledit" and "rlwrap".
5177 * isatool browser now works with Cygwin as well, using general
5178 "javapath" function defined in Isabelle process environment.
5180 * YXML notation provides a simple and efficient alternative to
5181 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5182 isatool yxml as described in the Isabelle system manual.
5184 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5185 provides general wrapper for managing an Isabelle process in a robust
5186 fashion, with ``cooked'' output from stdin/stderr.
5188 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5189 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5191 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5192 way of changing the user's settings is via
5193 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5196 * Multithreading.max_threads := 0 refers to the number of actual CPU
5197 cores of the underlying machine, which is a good starting point for
5198 optimal performance tuning. The corresponding usedir option -M allows
5199 "max" as an alias for "0". WARNING: does not work on certain versions
5200 of Mac OS (with Poly/ML 5.1).
5202 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5203 adverse effect of Isabelle flooding interactive front-ends (notably
5204 ProofGeneral / XEmacs).
5208 New in Isabelle2007 (November 2007)
5209 -----------------------------------
5213 * More uniform information about legacy features, notably a
5214 warning/error of "Legacy feature: ...", depending on the state of the
5215 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5216 legacy features will disappear eventually.
5218 * Theory syntax: the header format ``theory A = B + C:'' has been
5219 discontinued in favour of ``theory A imports B C begin''. Use isatool
5220 fixheaders to convert existing theory files. INCOMPATIBILITY.
5222 * Theory syntax: the old non-Isar theory file format has been
5223 discontinued altogether. Note that ML proof scripts may still be used
5224 with Isar theories; migration is usually quite simple with the ML
5225 function use_legacy_bindings. INCOMPATIBILITY.
5227 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5228 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5231 * Theory loader: be more serious about observing the static theory
5232 header specifications (including optional directories), but not the
5233 accidental file locations of previously successful loads. The strict
5234 update policy of former update_thy is now already performed by
5235 use_thy, so the former has been removed; use_thys updates several
5236 theories simultaneously, just as 'imports' within a theory header
5237 specification, but without merging the results. Potential
5238 INCOMPATIBILITY: may need to refine theory headers and commands
5239 ROOT.ML which depend on load order.
5241 * Theory loader: optional support for content-based file
5242 identification, instead of the traditional scheme of full physical
5243 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5244 (cf. the system manual). The new scheme allows to work with
5245 non-finished theories in persistent session images, such that source
5246 files may be moved later on without requiring reloads.
5248 * Theory loader: old-style ML proof scripts being *attached* to a thy
5249 file (with the same base name as the theory) are considered a legacy
5250 feature, which will disappear eventually. Even now, the theory loader
5251 no longer maintains dependencies on such files.
5253 * Syntax: the scope for resolving ambiguities via type-inference is
5254 now limited to individual terms, instead of whole simultaneous
5255 specifications as before. This greatly reduces the complexity of the
5256 syntax module and improves flexibility by separating parsing and
5257 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5258 'fixes' etc.) are required in rare situations.
5260 * Syntax: constants introduced by new-style packages ('definition',
5261 'abbreviation' etc.) are passed through the syntax module in
5262 ``authentic mode''. This means that associated mixfix annotations
5263 really stick to such constants, independently of potential name space
5264 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5265 trees are represented slightly differently, may need to adapt syntax
5266 translations accordingly. Use CONST marker in 'translations' and
5267 @{const_syntax} antiquotation in 'parse_translation' etc.
5269 * Legacy goal package: reduced interface to the bare minimum required
5270 to keep existing proof scripts running. Most other user-level
5271 functions are now part of the OldGoals structure, which is *not* open
5272 by default (consider isatool expandshort before open OldGoals).
5273 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5274 these tend to cause confusion about the actual goal (!) context being
5275 used here, which is not necessarily the same as the_context().
5277 * Command 'find_theorems': supports "*" wild-card in "name:"
5278 criterion; "with_dups" option. Certain ProofGeneral versions might
5279 support a specific search form (see ProofGeneral/CHANGES).
5281 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5282 by default, which means that "prems" (and also "fixed variables") are
5283 suppressed from proof state output. Note that the ProofGeneral
5284 settings mechanism allows to change and save options persistently, but
5285 older versions of Isabelle will fail to start up if a negative prems
5288 * Local theory targets may be specified by non-nested blocks of
5289 ``context/locale/class ... begin'' followed by ``end''. The body may
5290 contain definitions, theorems etc., including any derived mechanism
5291 that has been implemented on top of these primitives. This concept
5292 generalizes the existing ``theorem (in ...)'' towards more versatility
5295 * Proof General interface: proper undo of final 'end' command;
5296 discontinued Isabelle/classic mode (ML proof scripts).
5299 *** Document preparation ***
5301 * Added antiquotation @{theory name} which prints the given name,
5302 after checking that it refers to a valid ancestor theory in the
5305 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5306 check the given source text as ML type/structure, printing verbatim.
5308 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5309 "c args == rhs" given in the current context. (Any number of
5310 arguments may be given on the LHS.)
5315 * The 'class' package offers a combination of axclass and locale to
5316 achieve Haskell-like type classes in Isabelle. Definitions and
5317 theorems within a class context produce both relative results (with
5318 implicit parameters according to the locale context), and polymorphic
5319 constants with qualified polymorphism (according to the class
5320 context). Within the body context of a 'class' target, a separate
5321 syntax layer ("user space type system") takes care of converting
5322 between global polymorphic consts and internal locale representation.
5323 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5324 "isatool doc classes" provides a tutorial.
5326 * Generic code generator framework allows to generate executable
5327 code for ML and Haskell (including Isabelle classes). A short usage
5330 internal compilation:
5331 export_code <list of constants (term syntax)> in SML
5332 writing SML code to a file:
5333 export_code <list of constants (term syntax)> in SML <filename>
5334 writing OCaml code to a file:
5335 export_code <list of constants (term syntax)> in OCaml <filename>
5336 writing Haskell code to a bunch of files:
5337 export_code <list of constants (term syntax)> in Haskell <filename>
5339 evaluating closed propositions to True/False using code generation:
5342 Reasonable default setup of framework in HOL.
5344 Theorem attributs for selecting and transforming function equations theorems:
5346 [code fun]: select a theorem as function equation for a specific constant
5347 [code fun del]: deselect a theorem as function equation for a specific constant
5348 [code inline]: select an equation theorem for unfolding (inlining) in place
5349 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5351 User-defined serializations (target in {SML, OCaml, Haskell}):
5353 code_const <and-list of constants (term syntax)>
5354 {(target) <and-list of const target syntax>}+
5356 code_type <and-list of type constructors>
5357 {(target) <and-list of type target syntax>}+
5359 code_instance <and-list of instances>
5361 where instance ::= <type constructor> :: <class>
5363 code_class <and_list of classes>
5364 {(target) <and-list of class target syntax>}+
5365 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5367 code_instance and code_class only are effective to target Haskell.
5369 For example usage see src/HOL/ex/Codegenerator.thy and
5370 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5371 generation from Isabelle/HOL theories is available via "isatool doc
5374 * Code generator: consts in 'consts_code' Isar commands are now
5375 referred to by usual term syntax (including optional type
5378 * Command 'no_translations' removes translation rules from theory
5381 * Overloaded definitions are now actually checked for acyclic
5382 dependencies. The overloading scheme is slightly more general than
5383 that of Haskell98, although Isabelle does not demand an exact
5384 correspondence to type class and instance declarations.
5385 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5386 exotic versions of overloading -- at the discretion of the user!
5388 Polymorphic constants are represented via type arguments, i.e. the
5389 instantiation that matches an instance against the most general
5390 declaration given in the signature. For example, with the declaration
5391 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5392 as c(nat). Overloading is essentially simultaneous structural
5393 recursion over such type arguments. Incomplete specification patterns
5394 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5395 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5396 Command 'print_theory' outputs the normalized system of recursive
5397 equations, see section "definitions".
5399 * Configuration options are maintained within the theory or proof
5400 context (with name and type bool/int/string), providing a very simple
5401 interface to a poor-man's version of general context data. Tools may
5402 declare options in ML (e.g. using Attrib.config_int) and then refer to
5403 these values using Config.get etc. Users may change options via an
5404 associated attribute of the same name. This form of context
5405 declaration works particularly well with commands 'declare' or
5406 'using', for example ``declare [[foo = 42]]''. Thus it has become
5407 very easy to avoid global references, which would not observe Isar
5408 toplevel undo/redo and fail to work with multithreading.
5410 Various global ML references of Pure and HOL have been turned into
5411 configuration options:
5413 Unify.search_bound unify_search_bound
5414 Unify.trace_bound unify_trace_bound
5415 Unify.trace_simp unify_trace_simp
5416 Unify.trace_types unify_trace_types
5417 Simplifier.simp_depth_limit simp_depth_limit
5418 Blast.depth_limit blast_depth_limit
5419 DatatypeProp.dtK datatype_distinctness_limit
5420 fast_arith_neq_limit fast_arith_neq_limit
5421 fast_arith_split_limit fast_arith_split_limit
5423 * Named collections of theorems may be easily installed as context
5424 data using the functor NamedThmsFun (see also
5425 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5426 attributes; there is also a toplevel print command. This facility is
5427 just a common case of general context data, which is the preferred way
5428 for anything more complex than just a list of facts in canonical
5431 * Isar: command 'declaration' augments a local theory by generic
5432 declaration functions written in ML. This enables arbitrary content
5433 being added to the context, depending on a morphism that tells the
5434 difference of the original declaration context wrt. the application
5435 context encountered later on.
5437 * Isar: proper interfaces for simplification procedures. Command
5438 'simproc_setup' declares named simprocs (with match patterns, and body
5439 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5440 context. ML antiquotation @{simproc name} retrieves named simprocs.
5442 * Isar: an extra pair of brackets around attribute declarations
5443 abbreviates a theorem reference involving an internal dummy fact,
5444 which will be ignored later --- only the effect of the attribute on
5445 the background context will persist. This form of in-place
5446 declarations is particularly useful with commands like 'declare' and
5447 'using', for example ``have A using [[simproc a]] by simp''.
5449 * Isar: method "assumption" (and implicit closing of subproofs) now
5450 takes simple non-atomic goal assumptions into account: after applying
5451 an assumption as a rule the resulting subgoals are solved by atomic
5452 assumption steps. This is particularly useful to finish 'obtain'
5453 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5454 without referring to the original premise "!!x. P x ==> thesis" in the
5455 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5458 * Isar: implicit use of prems from the Isar proof context is
5459 considered a legacy feature. Common applications like ``have A .''
5460 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5461 referencing facts explicitly here improves readability and
5462 maintainability of proof texts.
5464 * Isar: improper proof element 'guess' is like 'obtain', but derives
5465 the obtained context from the course of reasoning! For example:
5467 assume "EX x y. A x & B y" -- "any previous fact"
5468 then guess x and y by clarify
5470 This technique is potentially adventurous, depending on the facts and
5471 proof tools being involved here.
5473 * Isar: known facts from the proof context may be specified as literal
5474 propositions, using ASCII back-quote syntax. This works wherever
5475 named facts used to be allowed so far, in proof commands, proof
5476 methods, attributes etc. Literal facts are retrieved from the context
5477 according to unification of type and term parameters. For example,
5478 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5479 theorems in the current context, then these are valid literal facts:
5480 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5482 There is also a proof method "fact" which does the same composition
5483 for explicit goal states, e.g. the following proof texts coincide with
5484 certain special cases of literal facts:
5486 have "A" by fact == note `A`
5487 have "A ==> B" by fact == note `A ==> B`
5488 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5489 have "P a ==> Q a" by fact == note `P a ==> Q a`
5491 * Isar: ":" (colon) is no longer a symbolic identifier character in
5492 outer syntax. Thus symbolic identifiers may be used without
5493 additional white space in declarations like this: ``assume *: A''.
5495 * Isar: 'print_facts' prints all local facts of the current context,
5496 both named and unnamed ones.
5498 * Isar: 'def' now admits simultaneous definitions, e.g.:
5500 def x == "t" and y == "u"
5502 * Isar: added command 'unfolding', which is structurally similar to
5503 'using', but affects both the goal state and facts by unfolding given
5504 rewrite rules. Thus many occurrences of the 'unfold' method or
5505 'unfolded' attribute may be replaced by first-class proof text.
5507 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5508 and command 'unfolding' now all support object-level equalities
5509 (potentially conditional). The underlying notion of rewrite rule is
5510 analogous to the 'rule_format' attribute, but *not* that of the
5511 Simplifier (which is usually more generous).
5513 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5514 premises of a theorem by n. Useful in conjunction with drule.
5516 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5517 method expression within a sandbox consisting of the first N
5518 sub-goals, which need to exist. For example, ``simp_all [3]''
5519 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5520 simplifies all new goals that emerge from applying rule foo to the
5521 originally first one.
5523 * Isar: schematic goals are no longer restricted to higher-order
5524 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5527 * Isar: the conclusion of a long theorem statement is now either
5528 'shows' (a simultaneous conjunction, as before), or 'obtains'
5529 (essentially a disjunction of cases with local parameters and
5530 assumptions). The latter allows to express general elimination rules
5531 adequately; in this notation common elimination rules look like this:
5533 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5535 obtains x where "P x"
5537 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5541 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5547 The subsequent classical rules even refer to the formal "thesis"
5550 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5553 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5554 obtains "thesis ==> something"
5556 The actual proof of an 'obtains' statement is analogous to that of the
5557 Isar proof element 'obtain', only that there may be several cases.
5558 Optional case names may be specified in parentheses; these will be
5559 available both in the present proof and as annotations in the
5560 resulting rule, for later use with the 'cases' method (cf. attribute
5563 * Isar: the assumptions of a long theorem statement are available as
5564 "assms" fact in the proof context. This is more appropriate than the
5565 (historical) "prems", which refers to all assumptions of the current
5566 context, including those from the target locale, proof body etc.
5568 * Isar: 'print_statement' prints theorems from the current theory or
5569 proof context in long statement form, according to the syntax of a
5572 * Isar: 'obtain' takes an optional case name for the local context
5573 introduction rule (default "that").
5575 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5576 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5579 * Pure: syntax "CONST name" produces a fully internalized constant
5580 according to the current context. This is particularly useful for
5581 syntax translations that should refer to internal constant
5582 representations independently of name spaces.
5584 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5585 instead of "FOO ". This allows multiple binder declarations to coexist
5586 in the same context. INCOMPATIBILITY.
5588 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5589 primitive that also works in a locale context (both for constants and
5590 fixed variables). Type declaration and internal syntactic representation
5591 of given constants retrieved from the context. Likewise, the
5592 'no_notation' command allows to remove given syntax annotations from the
5595 * Isar/locales: new derived specification elements 'axiomatization',
5596 'definition', 'abbreviation', which support type-inference, admit
5597 object-level specifications (equality, equivalence). See also the
5598 isar-ref manual. Examples:
5601 eq (infix "===" 50) where
5602 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5604 definition "f x y = x + y + 1"
5605 definition g where "g x = f x x"
5608 neq (infix "=!=" 50) where
5609 "x =!= y == ~ (x === y)"
5611 These specifications may be also used in a locale context. Then the
5612 constants being introduced depend on certain fixed parameters, and the
5613 constant name is qualified by the locale base name. An internal
5614 abbreviation takes care for convenient input and output, making the
5615 parameters implicit and using the original short name. See also
5616 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5617 entities from a monomorphic theory.
5619 Presently, abbreviations are only available 'in' a target locale, but
5620 not inherited by general import expressions. Also note that
5621 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5622 'translations' in common applications. The "no_abbrevs" print mode
5623 prevents folding of abbreviations in term output.
5625 Concrete syntax is attached to specified constants in internal form,
5626 independently of name spaces. The parse tree representation is
5627 slightly different -- use 'notation' instead of raw 'syntax', and
5628 'translations' with explicit "CONST" markup to accommodate this.
5630 * Pure/Isar: unified syntax for new-style specification mechanisms
5631 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5632 full type inference and dummy patterns ("_"). For example:
5634 definition "K x _ = x"
5636 inductive conj for A B
5637 where "A ==> B ==> conj A B"
5639 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5640 the current context. Print mode "no_abbrevs" prevents inversion of
5641 abbreviations on output.
5643 * Isar/locales: improved parameter handling: use of locales "var" and
5644 "struct" no longer necessary; - parameter renamings are no longer
5645 required to be injective. For example, this allows to define
5646 endomorphisms as locale endom = homom mult mult h.
5648 * Isar/locales: changed the way locales with predicates are defined.
5649 Instead of accumulating the specification, the imported expression is
5650 now an interpretation. INCOMPATIBILITY: different normal form of
5651 locale expressions. In particular, in interpretations of locales with
5652 predicates, goals repesenting already interpreted fragments are not
5653 removed automatically. Use methods `intro_locales' and
5654 `unfold_locales'; see below.
5656 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5657 provide backward reasoning on locales predicates. The methods are
5658 aware of interpretations and discharge corresponding goals.
5659 `intro_locales' is less aggressive then `unfold_locales' and does not
5660 unfold predicates to assumptions.
5662 * Isar/locales: the order in which locale fragments are accumulated
5663 has changed. This enables to override declarations from fragments due
5664 to interpretations -- for example, unwanted simp rules.
5666 * Isar/locales: interpretation in theories and proof contexts has been
5667 extended. One may now specify (and prove) equations, which are
5668 unfolded in interpreted theorems. This is useful for replacing
5669 defined concepts (constants depending on locale parameters) by
5670 concepts already existing in the target context. Example:
5672 interpretation partial_order ["op <= :: [int, int] => bool"]
5673 where "partial_order.less (op <=) (x::int) y = (x < y)"
5675 Typically, the constant `partial_order.less' is created by a
5676 definition specification element in the context of locale
5679 * Method "induct": improved internal context management to support
5680 local fixes and defines on-the-fly. Thus explicit meta-level
5681 connectives !! and ==> are rarely required anymore in inductive goals
5682 (using object-logic connectives for this purpose has been long
5683 obsolete anyway). Common proof patterns are explained in
5684 src/HOL/Induct/Common_Patterns.thy, see also
5685 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5688 * Method "induct": improved handling of simultaneous goals. Instead of
5689 introducing object-level conjunction, the statement is now split into
5690 several conclusions, while the corresponding symbolic cases are nested
5691 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5692 see src/HOL/Induct/Common_Patterns.thy, for example.
5694 * Method "induct": mutual induction rules are now specified as a list
5695 of rule sharing the same induction cases. HOL packages usually provide
5696 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5697 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5698 mutual induction rules differently, i.e. like this:
5700 (induct rule: foo_bar.inducts)
5701 (induct set: foo bar)
5702 (induct pred: foo bar)
5703 (induct type: foo bar)
5705 The ML function ProjectRule.projections turns old-style rules into the
5708 * Method "coinduct": dual of induction, see
5709 src/HOL/Library/Coinductive_List.thy for various examples.
5711 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5712 considered a legacy feature.
5714 * Attribute "symmetric" produces result with standardized schematic
5715 variables (index 0). Potential INCOMPATIBILITY.
5717 * Simplifier: by default the simplifier trace only shows top level
5718 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5719 default. Thus there is less danger of being flooded by the trace. The
5720 trace indicates where parts have been suppressed.
5722 * Provers/classical: removed obsolete classical version of elim_format
5723 attribute; classical elim/dest rules are now treated uniformly when
5724 manipulating the claset.
5726 * Provers/classical: stricter checks to ensure that supplied intro,
5727 dest and elim rules are well-formed; dest and elim rules must have at
5730 * Provers/classical: attributes dest/elim/intro take an optional
5731 weight argument for the rule (just as the Pure versions). Weights are
5732 ignored by automated tools, but determine the search order of single
5735 * Syntax: input syntax now supports dummy variable binding "%_. b",
5736 where the body does not mention the bound variable. Note that dummy
5737 patterns implicitly depend on their context of bounds, which makes
5738 "{_. _}" match any set comprehension as expected. Potential
5739 INCOMPATIBILITY -- parse translations need to cope with syntactic
5740 constant "_idtdummy" in the binding position.
5742 * Syntax: removed obsolete syntactic constant "_K" and its associated
5743 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5744 for example "A -> B" => "Pi A (%_. B)".
5746 * Pure: 'class_deps' command visualizes the subclass relation, using
5747 the graph browser tool.
5749 * Pure: 'print_theory' now suppresses certain internal declarations by
5750 default; use '!' option for full details.
5755 * Method "metis" proves goals by applying the Metis general-purpose
5756 resolution prover (see also http://gilith.com/software/metis/).
5757 Examples are in the directory MetisExamples. WARNING: the
5758 Isabelle/HOL-Metis integration does not yet work properly with
5761 * Command 'sledgehammer' invokes external automatic theorem provers as
5762 background processes. It generates calls to the "metis" method if
5763 successful. These can be pasted into the proof. Users do not have to
5764 wait for the automatic provers to return. WARNING: does not really
5765 work with multi-threading.
5767 * New "auto_quickcheck" feature tests outermost goal statements for
5768 potential counter-examples. Controlled by ML references
5769 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5770 5000 milliseconds). Fails silently if statements is outside of
5771 executable fragment, or any other codgenerator problem occurs.
5773 * New constant "undefined" with axiom "undefined x = undefined".
5775 * Added class "HOL.eq", allowing for code generation with polymorphic
5778 * Some renaming of class constants due to canonical name prefixing in
5779 the new 'class' package:
5781 HOL.abs ~> HOL.abs_class.abs
5782 HOL.divide ~> HOL.divide_class.divide
5783 0 ~> HOL.zero_class.zero
5784 1 ~> HOL.one_class.one
5785 op + ~> HOL.plus_class.plus
5786 op - ~> HOL.minus_class.minus
5787 uminus ~> HOL.minus_class.uminus
5788 op * ~> HOL.times_class.times
5789 op < ~> HOL.ord_class.less
5790 op <= > HOL.ord_class.less_eq
5791 Nat.power ~> Power.power_class.power
5792 Nat.size ~> Nat.size_class.size
5793 Numeral.number_of ~> Numeral.number_class.number_of
5794 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5795 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5796 Orderings.min ~> Orderings.ord_class.min
5797 Orderings.max ~> Orderings.ord_class.max
5798 Divides.op div ~> Divides.div_class.div
5799 Divides.op mod ~> Divides.div_class.mod
5800 Divides.op dvd ~> Divides.div_class.dvd
5802 INCOMPATIBILITY. Adaptions may be required in the following cases:
5804 a) User-defined constants using any of the names "plus", "minus",
5805 "times", "less" or "less_eq". The standard syntax translations for
5806 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5809 b) Variables named "plus", "minus", "times", "less", "less_eq"
5810 INCOMPATIBILITY: use more specific names.
5812 c) Permutative equations (e.g. "a + b = b + a")
5813 Since the change of names also changes the order of terms, permutative
5814 rewrite rules may get applied in a different order. Experience shows
5815 that this is rarely the case (only two adaptions in the whole Isabelle
5816 distribution). INCOMPATIBILITY: rewrite proofs
5818 d) ML code directly refering to constant names
5819 This in general only affects hand-written proof tactics, simprocs and
5820 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5821 Consider using @{const_name} antiquotation.
5823 * New class "default" with associated constant "default".
5825 * Function "sgn" is now overloaded and available on int, real, complex
5826 (and other numeric types), using class "sgn". Two possible defs of
5827 sgn are given as equational assumptions in the classes sgn_if and
5828 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5831 * Locale "partial_order" now unified with class "order" (cf. theory
5832 Orderings), added parameter "less". INCOMPATIBILITY.
5834 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5835 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5836 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5838 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5839 changed order of proof goals in instance proofs.
5841 * The transitivity reasoner for partial and linear orders is set up
5842 for classes "order" and "linorder". Instances of the reasoner are available
5843 in all contexts importing or interpreting the corresponding locales.
5844 Method "order" invokes the reasoner separately; the reasoner
5845 is also integrated with the Simplifier as a solver. Diagnostic
5846 command 'print_orders' shows the available instances of the reasoner
5847 in the current context.
5849 * Localized monotonicity predicate in theory "Orderings"; integrated
5850 lemmas max_of_mono and min_of_mono with this predicate.
5853 * Formulation of theorem "dense" changed slightly due to integration
5854 with new class dense_linear_order.
5856 * Uniform lattice theory development in HOL.
5858 constants "meet" and "join" now named "inf" and "sup"
5859 constant "Meet" now named "Inf"
5861 classes "meet_semilorder" and "join_semilorder" now named
5862 "lower_semilattice" and "upper_semilattice"
5863 class "lorder" now named "lattice"
5864 class "comp_lat" now named "complete_lattice"
5866 Instantiation of lattice classes allows explicit definitions
5867 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5869 INCOMPATIBILITY. Theorem renames:
5871 meet_left_le ~> inf_le1
5872 meet_right_le ~> inf_le2
5873 join_left_le ~> sup_ge1
5874 join_right_le ~> sup_ge2
5875 meet_join_le ~> inf_sup_ord
5878 le_meet ~> le_inf_iff
5879 le_join ~> ge_sup_conv
5880 meet_idempotent ~> inf_idem
5881 join_idempotent ~> sup_idem
5882 meet_comm ~> inf_commute
5883 join_comm ~> sup_commute
5884 meet_leI1 ~> le_infI1
5885 meet_leI2 ~> le_infI2
5886 le_joinI1 ~> le_supI1
5887 le_joinI2 ~> le_supI2
5888 meet_assoc ~> inf_assoc
5889 join_assoc ~> sup_assoc
5890 meet_left_comm ~> inf_left_commute
5891 meet_left_idempotent ~> inf_left_idem
5892 join_left_comm ~> sup_left_commute
5893 join_left_idempotent ~> sup_left_idem
5896 le_def_meet ~> le_iff_inf
5897 le_def_join ~> le_iff_sup
5898 join_absorp2 ~> sup_absorb2
5899 join_absorp1 ~> sup_absorb1
5900 meet_absorp1 ~> inf_absorb1
5901 meet_absorp2 ~> inf_absorb2
5902 meet_join_absorp ~> inf_sup_absorb
5903 join_meet_absorp ~> sup_inf_absorb
5904 distrib_join_le ~> distrib_sup_le
5905 distrib_meet_le ~> distrib_inf_le
5907 add_meet_distrib_left ~> add_inf_distrib_left
5908 add_join_distrib_left ~> add_sup_distrib_left
5909 is_join_neg_meet ~> is_join_neg_inf
5910 is_meet_neg_join ~> is_meet_neg_sup
5911 add_meet_distrib_right ~> add_inf_distrib_right
5912 add_join_distrib_right ~> add_sup_distrib_right
5913 add_meet_join_distribs ~> add_sup_inf_distribs
5914 join_eq_neg_meet ~> sup_eq_neg_inf
5915 meet_eq_neg_join ~> inf_eq_neg_sup
5916 add_eq_meet_join ~> add_eq_inf_sup
5917 meet_0_imp_0 ~> inf_0_imp_0
5918 join_0_imp_0 ~> sup_0_imp_0
5919 meet_0_eq_0 ~> inf_0_eq_0
5920 join_0_eq_0 ~> sup_0_eq_0
5921 neg_meet_eq_join ~> neg_inf_eq_sup
5922 neg_join_eq_meet ~> neg_sup_eq_inf
5923 join_eq_if ~> sup_eq_if
5925 mono_meet ~> mono_inf
5926 mono_join ~> mono_sup
5927 meet_bool_eq ~> inf_bool_eq
5928 join_bool_eq ~> sup_bool_eq
5929 meet_fun_eq ~> inf_fun_eq
5930 join_fun_eq ~> sup_fun_eq
5931 meet_set_eq ~> inf_set_eq
5932 join_set_eq ~> sup_set_eq
5933 meet1_iff ~> inf1_iff
5934 meet2_iff ~> inf2_iff
5943 join1_iff ~> sup1_iff
5944 join2_iff ~> sup2_iff
5954 is_meet_Meet ~> is_meet_Inf
5955 Meet_bool_def ~> Inf_bool_def
5956 Meet_fun_def ~> Inf_fun_def
5957 Meet_greatest ~> Inf_greatest
5958 Meet_lower ~> Inf_lower
5959 Meet_set_def ~> Inf_set_def
5962 Sup_bool_eq ~> Sup_bool_def
5963 Sup_fun_eq ~> Sup_fun_def
5964 Sup_set_eq ~> Sup_set_def
5966 listsp_meetI ~> listsp_infI
5967 listsp_meet_eq ~> listsp_inf_eq
5972 * Added syntactic class "size"; overloaded constant "size" now has
5973 type "'a::size ==> bool"
5975 * Internal reorganisation of `size' of datatypes: size theorems
5976 "foo.size" are no longer subsumed by "foo.simps" (but are still
5977 simplification rules by default!); theorems "prod.size" now named
5980 * Class "div" now inherits from class "times" rather than "type".
5983 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5984 Linorder etc. have disappeared; operations defined in terms of
5985 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5987 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5989 * HOL-Word: New extensive library and type for generic, fixed size
5990 machine words, with arithmetic, bit-wise, shifting and rotating
5991 operations, reflection into int, nat, and bool lists, automation for
5992 linear arithmetic (by automatic reflection into nat or int), including
5993 lemmas on overflow and monotonicity. Instantiated to all appropriate
5994 arithmetic type classes, supporting automatic simplification of
5995 numerals on all operations.
5997 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5999 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6001 * Code generator library theories:
6002 - Code_Integer represents HOL integers by big integer literals in target
6004 - Code_Char represents HOL characters by character literals in target
6006 - Code_Char_chr like Code_Char, but also offers treatment of character
6007 codes; includes Code_Integer.
6008 - Executable_Set allows to generate code for finite sets using lists.
6009 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6011 - Executable_Real implements a subset of real numbers, namly those
6012 representable by rational numbers.
6013 - Efficient_Nat implements natural numbers by integers, which in general will
6014 result in higher efficency; pattern matching with 0/Suc is eliminated;
6015 includes Code_Integer.
6016 - Code_Index provides an additional datatype index which is mapped to
6017 target-language built-in integers.
6018 - Code_Message provides an additional datatype message_string which is isomorphic to
6019 strings; messages are mapped to target-language strings.
6021 * New package for inductive predicates
6023 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6026 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6027 for z_1 :: U_1 and ... and z_n :: U_m
6029 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6032 with full support for type-inference, rather than
6034 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6036 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6037 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6039 inductive "s z_1 ... z_m"
6041 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6044 For backward compatibility, there is a wrapper allowing inductive
6045 sets to be defined with the new package via
6048 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6049 for z_1 :: U_1 and ... and z_n :: U_m
6051 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6057 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6058 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6059 for z_1 :: U_1 and ... and z_n :: U_m
6061 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6062 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6065 if the additional syntax "p ..." is required.
6067 Numerous examples can be found in the subdirectories src/HOL/Auth,
6068 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6072 - Since declaration and definition of inductive sets or predicates
6073 is no longer separated, abbreviations involving the newly
6074 introduced sets or predicates must be specified together with the
6075 introduction rules after the 'where' keyword (see above), rather
6076 than before the actual inductive definition.
6078 - The variables in induction and elimination rules are now
6079 quantified in the order of their occurrence in the introduction
6080 rules, rather than in alphabetical order. Since this may break
6081 some proofs, these proofs either have to be repaired, e.g. by
6082 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6083 statements of the form
6085 case (rule_i a_i_1 ... a_i_{k_i})
6087 or the old order of quantification has to be restored by explicitly adding
6088 meta-level quantifiers in the introduction rules, i.e.
6090 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6092 - The format of the elimination rules is now
6094 p z_1 ... z_m x_1 ... x_n ==>
6095 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6100 (x_1, ..., x_n) : s z_1 ... z_m ==>
6101 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6104 for sets rather than
6106 x : s z_1 ... z_m ==>
6107 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6110 This may require terms in goals to be expanded to n-tuples
6111 (e.g. using case_tac or simplification with the split_paired_all
6112 rule) before the above elimination rule is applicable.
6114 - The elimination or case analysis rules for (mutually) inductive
6115 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6116 list of rules "p_1_..._p_k.elims" is no longer available.
6118 * New package "function"/"fun" for general recursive functions,
6119 supporting mutual and nested recursion, definitions in local contexts,
6120 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6121 for small examples, and the separate tutorial on the function
6122 package. The old recdef "package" is still available as before, but
6123 users are encouraged to use the new package.
6125 * Method "lexicographic_order" automatically synthesizes termination
6126 relations as lexicographic combinations of size measures.
6128 * Case-expressions allow arbitrary constructor-patterns (including
6129 "_") and take their order into account, like in functional
6130 programming. Internally, this is translated into nested
6131 case-expressions; missing cases are added and mapped to the predefined
6132 constant "undefined". In complicated cases printing may no longer show
6133 the original input but the internal form. Lambda-abstractions allow
6134 the same form of pattern matching: "% pat1 => e1 | ..." is an
6135 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6138 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6139 is an abbreviation for "of_nat :: nat => int". The simplification
6140 rules for "of_nat" have been changed to work like "int" did
6141 previously. Potential INCOMPATIBILITY:
6142 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6143 - of_nat_diff and of_nat_mult are no longer default simp rules
6145 * Method "algebra" solves polynomial equations over (semi)rings using
6146 Groebner bases. The (semi)ring structure is defined by locales and the
6147 tool setup depends on that generic context. Installing the method for
6148 a specific type involves instantiating the locale and possibly adding
6149 declarations for computation on the coefficients. The method is
6150 already instantiated for natural numbers and for the axiomatic class
6151 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6152 CALCULEMUS 2007 for the general principles underlying this
6153 architecture of context-aware proof-tools.
6155 * Method "ferrack" implements quantifier elimination over
6156 special-purpose dense linear orders using locales (analogous to
6157 "algebra"). The method is already installed for class
6158 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6161 * Former constant "List.op @" now named "List.append". Use ML
6162 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6163 circumvent possible incompatibilities when working on ML level.
6165 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6167 * New function listsum :: 'a list => 'a for arbitrary monoids.
6168 Special syntax: "SUM x <- xs. f x" (and latex variants)
6170 * New syntax for Haskell-like list comprehension (input only), eg.
6171 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6173 * The special syntax for function "filter" has changed from [x :
6174 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6175 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6177 * [a..b] is now defined for arbitrary linear orders. It used to be
6178 defined on nat only, as an abbreviation for [a..<Suc b]
6181 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6183 * New functions "sorted" and "sort" in src/HOL/List.thy.
6185 * New lemma collection field_simps (an extension of ring_simps) for
6186 manipulating (in)equations involving division. Multiplies with all
6187 denominators that can be proved to be non-zero (in equations) or
6188 positive/negative (in inequations).
6190 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6191 have been improved and renamed to ring_simps, group_simps and
6192 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6193 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6195 * Theory Library/Commutative_Ring: switched from recdef to function
6196 package; constants add, mul, pow now curried. Infix syntax for
6197 algebraic operations.
6199 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6202 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6205 * HOL/records: generalised field-update to take a function on the
6206 field rather than the new value: r(|A := x|) is translated to A_update
6207 (K x) r The K-combinator that is internally used is called K_record.
6208 INCOMPATIBILITY: Usage of the plain update functions has to be
6211 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6212 * x = 0, which are required for a semiring. Richer structures do not
6213 inherit from semiring_0 anymore, because this property is a theorem
6214 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6215 there is more to prove, but this is mostly trivial.
6217 * Class "recpower" is generalized to arbitrary monoids, not just
6218 commutative semirings. INCOMPATIBILITY: may need to incorporate
6219 commutativity or semiring properties additionally.
6221 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6222 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6223 better use 'abbreviation'.
6225 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6227 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6228 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6229 significant changes for setting up numeral syntax for types:
6230 - New constants Numeral.pred and Numeral.succ instead
6231 of former Numeral.bin_pred and Numeral.bin_succ.
6232 - Use integer operations instead of bin_add, bin_mult and so on.
6233 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6234 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6236 See src/HOL/Integ/IntArith.thy for an example setup.
6238 * Command 'normal_form' computes the normal form of a term that may
6239 contain free variables. For example ``normal_form "rev [a, b, c]"''
6240 produces ``[b, c, a]'' (without proof). This command is suitable for
6241 heavy-duty computations because the functions are compiled to ML
6242 first. Correspondingly, a method "normalization" is provided. See
6243 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6245 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6246 25 like -->); output depends on the "iff" print_mode, the default is
6247 "A = B" (with priority 50).
6249 * Relations less (<) and less_eq (<=) are also available on type bool.
6250 Modified syntax to disallow nesting without explicit parentheses,
6251 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6254 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6256 * Relation composition operator "op O" now has precedence 75 and binds
6257 stronger than union and intersection. INCOMPATIBILITY.
6259 * The old set interval syntax "{m..n(}" (and relatives) has been
6260 removed. Use "{m..<n}" (and relatives) instead.
6262 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6263 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6264 ``declare [[simproc del: neq]]''.
6266 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6269 * Theorem Cons_eq_map_conv no longer declared as "simp".
6271 * Theorem setsum_mult renamed to setsum_right_distrib.
6273 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6276 * Reimplemented methods "sat" and "satx", with several improvements:
6277 goals no longer need to be stated as "<prems> ==> False", equivalences
6278 (i.e. "=" on type bool) are handled, variable names of the form
6279 "lit_<n>" are no longer reserved, significant speedup.
6281 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6282 zChaff is still supported as well.
6284 * 'inductive' and 'datatype': provide projections of mutual rules,
6285 bundled as foo_bar.inducts;
6287 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6290 * Library: moved theory Accessible_Part to main HOL.
6292 * Library: added theory Coinductive_List of potentially infinite lists
6293 as greatest fixed-point.
6295 * Library: added theory AssocList which implements (finite) maps as
6298 * Method "evaluation" solves goals (i.e. a boolean expression)
6299 efficiently by compiling it to ML. The goal is "proved" (via an
6300 oracle) if it evaluates to True.
6302 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6303 also when invoked by the simplifier. This results in the Simplifier
6304 being more powerful on arithmetic goals. INCOMPATIBILITY.
6305 Configuration option fast_arith_split_limit=0 recovers the old
6308 * Support for hex (0x20) and binary (0b1001) numerals.
6310 * New method: reify eqs (t), where eqs are equations for an
6311 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6312 parameter, computes a term s::'b and a list xs::'a list and proves the
6313 theorem I xs s = t. This is also known as reification or quoting. The
6314 resulting theorem is applied to the subgoal to substitute t with I xs
6315 s. If t is omitted, the subgoal itself is reified.
6317 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6318 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6319 where f is supposed to be a computable function (in the sense of code
6320 generattion). The method uses reify to compute s and xs as above then
6321 applies corr_thm and uses normalization by evaluation to "prove" f s =
6322 r and finally gets the theorem t = r, which is again applied to the
6323 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6325 * Reflection: Automatic reification now handels binding, an example is
6326 available in src/HOL/ex/ReflectionEx.thy
6328 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6329 command 'statespace' that is similar to 'record', but introduces an
6330 abstract specification based on the locale infrastructure instead of
6331 HOL types. This leads to extra flexibility in composing state spaces,
6332 in particular multiple inheritance and renaming of components.
6337 * Hyperreal: Functions root and sqrt are now defined on negative real
6338 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6339 Nonnegativity side conditions have been removed from many lemmas, so
6340 that more subgoals may now be solved by simplification; potential
6343 * Real: new type classes formalize real normed vector spaces and
6344 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6345 and norm :: 'a => real.
6347 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6348 reals into other types. The overloaded constant Reals :: 'a set is now
6349 defined as range of_real; potential INCOMPATIBILITY.
6351 * Real: proper support for ML code generation, including 'quickcheck'.
6352 Reals are implemented as arbitrary precision rationals.
6354 * Hyperreal: Several constants that previously worked only for the
6355 reals have been generalized, so they now work over arbitrary vector
6356 spaces. Type annotations may need to be added in some cases; potential
6359 Infinitesimal :: ('a::real_normed_vector) star set
6360 HFinite :: ('a::real_normed_vector) star set
6361 HInfinite :: ('a::real_normed_vector) star set
6362 approx :: ('a::real_normed_vector) star => 'a star => bool
6363 monad :: ('a::real_normed_vector) star => 'a star set
6364 galaxy :: ('a::real_normed_vector) star => 'a star set
6365 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6366 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6367 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6368 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6369 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6370 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6371 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6372 sgn :: 'a::real_normed_vector => 'a
6373 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6375 * Complex: Some complex-specific constants are now abbreviations for
6376 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6377 hnorm. Other constants have been entirely removed in favor of the
6378 polymorphic versions (INCOMPATIBILITY):
6382 HInfinite <-- CInfinite
6383 Infinitesimal <-- CInfinitesimal
6386 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6387 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6388 (ns)deriv <-- (ns)cderiv
6393 * Formalisation of ideals and the quotient construction over rings.
6395 * Order and lattice theory no longer based on records.
6398 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6399 greatest_closed. INCOMPATIBILITY.
6401 * Method algebra is now set up via an attribute. For examples see
6402 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6403 of algebraic structures.
6405 * Renamed theory CRing to Ring.
6410 * Substantial, yet incomplete support for nominal datatypes (binding
6411 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6412 src/HOL/Nominal/Examples. Prospective users should consult
6413 http://isabelle.in.tum.de/nominal/
6418 * ML basics: just one true type int, which coincides with IntInf.int
6421 * ML within Isar: antiquotations allow to embed statically-checked
6422 formal entities in the source, referring to the context available at
6423 compile-time. For example:
6425 ML {* @{sort "{zero,one}"} *}
6426 ML {* @{typ "'a => 'b"} *}
6427 ML {* @{term "%x. x"} *}
6428 ML {* @{prop "x == y"} *}
6429 ML {* @{ctyp "'a => 'b"} *}
6430 ML {* @{cterm "%x. x"} *}
6431 ML {* @{cprop "x == y"} *}
6432 ML {* @{thm asm_rl} *}
6433 ML {* @{thms asm_rl} *}
6434 ML {* @{type_name c} *}
6435 ML {* @{type_syntax c} *}
6436 ML {* @{const_name c} *}
6437 ML {* @{const_syntax c} *}
6440 ML {* @{theory Pure} *}
6441 ML {* @{theory_ref} *}
6442 ML {* @{theory_ref Pure} *}
6445 ML {* @{clasimpset} *}
6447 The same works for sources being ``used'' within an Isar context.
6449 * ML in Isar: improved error reporting; extra verbosity with
6450 ML_Context.trace enabled.
6452 * Pure/General/table.ML: the join operations now works via exceptions
6453 DUP/SAME instead of type option. This is simpler in simple cases, and
6454 admits slightly more efficient complex applications.
6456 * Pure: 'advanced' translation functions (parse_translation etc.) now
6457 use Context.generic instead of just theory.
6459 * Pure: datatype Context.generic joins theory/Proof.context and
6460 provides some facilities for code that works in either kind of
6461 context, notably GenericDataFun for uniform theory and proof data.
6463 * Pure: simplified internal attribute type, which is now always
6464 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6465 local (Proof.context) attributes have been discontinued, while
6466 minimizing code duplication. Thm.rule_attribute and
6467 Thm.declaration_attribute build canonical attributes; see also structure
6468 Context for further operations on Context.generic, notably
6469 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6470 declarations and definitions.
6472 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6473 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6474 init only required for impure data. INCOMPATIBILITY: empty really need
6475 to be empty (no dependencies on theory content!)
6477 * Pure/kernel: consts certification ignores sort constraints given in
6478 signature declarations. (This information is not relevant to the
6479 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6480 potential INCOMPATIBILITY.
6482 * Pure: axiomatic type classes are now purely definitional, with
6483 explicit proofs of class axioms and super class relations performed
6484 internally. See Pure/axclass.ML for the main internal interfaces --
6485 notably AxClass.define_class supercedes AxClass.add_axclass, and
6486 AxClass.axiomatize_class/classrel/arity supersede
6487 Sign.add_classes/classrel/arities.
6489 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6490 global/local versions on theory vs. Proof.context have been
6491 discontinued; Attrib.syntax and Method.syntax have been adapted
6492 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6493 attributes, methods, etc.
6495 * Pure: several functions of signature "... -> theory -> theory * ..."
6496 have been reoriented to "... -> theory -> ... * theory" in order to
6497 allow natural usage in combination with the ||>, ||>>, |-> and
6498 fold_map combinators.
6500 * Pure: official theorem names (closed derivations) and additional
6501 comments (tags) are now strictly separate. Name hints -- which are
6502 maintained as tags -- may be attached any time without affecting the
6505 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6506 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6507 achieve the old behaviour.
6509 * Pure: the "Goal" constant is now called "prop", supporting a
6510 slightly more general idea of ``protecting'' meta-level rule
6513 * Pure: Logic.(un)varify only works in a global context, which is now
6514 enforced instead of silently assumed. INCOMPATIBILITY, may use
6515 Logic.legacy_(un)varify as temporary workaround.
6517 * Pure: structure Name provides scalable operations for generating
6518 internal variable names, notably Name.variants etc. This replaces
6519 some popular functions from term.ML:
6521 Term.variant -> Name.variant
6522 Term.variantlist -> Name.variant_list
6523 Term.invent_names -> Name.invent_list
6525 Note that low-level renaming rarely occurs in new code -- operations
6526 from structure Variable are used instead (see below).
6528 * Pure: structure Variable provides fundamental operations for proper
6529 treatment of fixed/schematic variables in a context. For example,
6530 Variable.import introduces fixes for schematics of given facts and
6531 Variable.export reverses the effect (up to renaming) -- this replaces
6532 various freeze_thaw operations.
6534 * Pure: structure Goal provides simple interfaces for
6535 init/conclude/finish and tactical prove operations (replacing former
6536 Tactic.prove). Goal.prove is the canonical way to prove results
6537 within a given context; Goal.prove_global is a degraded version for
6538 theory level goals, including a global Drule.standard. Note that
6539 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6540 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6541 in a locale context).
6543 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6544 and type checking (Syntax.check_term etc.), with common combinations
6545 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6546 which are considered legacy and await removal.
6548 * Pure/Syntax: generic interfaces for type unchecking
6549 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6550 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6551 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6552 available for convenience, but refer to the very same operations using
6553 a mere theory instead of a full context.
6555 * Isar: simplified treatment of user-level errors, using exception
6556 ERROR of string uniformly. Function error now merely raises ERROR,
6557 without any side effect on output channels. The Isar toplevel takes
6558 care of proper display of ERROR exceptions. ML code may use plain
6559 handle/can/try; cat_error may be used to concatenate errors like this:
6561 ... handle ERROR msg => cat_error msg "..."
6563 Toplevel ML code (run directly or through the Isar toplevel) may be
6564 embedded into the Isar toplevel with exception display/debug like
6567 Isar.toplevel (fn () => ...)
6569 INCOMPATIBILITY, removed special transform_error facilities, removed
6570 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6571 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6572 -- use plain ERROR instead.
6574 * Isar: theory setup now has type (theory -> theory), instead of a
6575 list. INCOMPATIBILITY, may use #> to compose setup functions.
6577 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6578 ProofContext.debug/verbose flags.
6580 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6581 theory before entering a proof state. Transactions now always see a
6582 quasi-functional intermediate checkpoint, both in interactive and
6585 * Isar: simplified interfaces for outer syntax. Renamed
6586 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6587 OuterSyntax.add_parsers -- this functionality is now included in
6588 OuterSyntax.command etc. INCOMPATIBILITY.
6590 * Simplifier: the simpset of a running simplification process now
6591 contains a proof context (cf. Simplifier.the_context), which is the
6592 very context that the initial simpset has been retrieved from (by
6593 simpset_of/local_simpset_of). Consequently, all plug-in components
6594 (solver, looper etc.) may depend on arbitrary proof data.
6596 * Simplifier.inherit_context inherits the proof context (plus the
6597 local bounds) of the current simplification process; any simproc
6598 etc. that calls the Simplifier recursively should do this! Removed
6599 former Simplifier.inherit_bounds, which is already included here --
6600 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6601 specify an explicit context using Simplifier.context/theory_context.
6603 * Simplifier/Classical Reasoner: more abstract interfaces
6604 change_simpset/claset for modifying the simpset/claset reference of a
6605 theory; raw versions simpset/claset_ref etc. have been discontinued --
6608 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6614 * settings: the default heap location within ISABELLE_HOME_USER now
6615 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6616 Isabelle installations.
6618 * isabelle-process: option -S (secure mode) disables some critical
6619 operations, notably runtime compilation and evaluation of ML source
6622 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6624 * Support for parallel execution, using native multicore support of
6625 Poly/ML 5.1. The theory loader exploits parallelism when processing
6626 independent theories, according to the given theory header
6627 specifications. The maximum number of worker threads is specified via
6628 usedir option -M or the "max-threads" setting in Proof General. A
6629 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6630 to 6 on a 8-core machine. User-code needs to observe certain
6631 guidelines for thread-safe programming, see appendix A in the Isar
6632 Implementation manual.
6636 New in Isabelle2005 (October 2005)
6637 ----------------------------------
6641 * Theory headers: the new header syntax for Isar theories is
6644 imports <theory1> ... <theoryN>
6645 uses <file1> ... <fileM>
6648 where the 'uses' part is optional. The previous syntax
6650 theory <name> = <theory1> + ... + <theoryN>:
6652 will disappear in the next release. Use isatool fixheaders to convert
6653 existing theory files. Note that there is no change in ancient
6654 non-Isar theories now, but these will disappear soon.
6656 * Theory loader: parent theories can now also be referred to via
6657 relative and absolute paths.
6659 * Command 'find_theorems' searches for a list of criteria instead of a
6660 list of constants. Known criteria are: intro, elim, dest, name:string,
6661 simp:term, and any term. Criteria can be preceded by '-' to select
6662 theorems that do not match. Intro, elim, dest select theorems that
6663 match the current goal, name:s selects theorems whose fully qualified
6664 name contain s, and simp:term selects all simplification rules whose
6665 lhs match term. Any other term is interpreted as pattern and selects
6666 all theorems matching the pattern. Available in ProofGeneral under
6667 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6669 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6671 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6672 matching the current goal as introduction rule and not having "HOL."
6673 in their name (i.e. not being defined in theory HOL).
6675 * Command 'thms_containing' has been discontinued in favour of
6676 'find_theorems'; INCOMPATIBILITY.
6678 * Communication with Proof General is now 8bit clean, which means that
6679 Unicode text in UTF-8 encoding may be used within theory texts (both
6680 formal and informal parts). Cf. option -U of the Isabelle Proof
6681 General interface. Here are some simple examples (cf. src/HOL/ex):
6683 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6684 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6686 * Improved efficiency of the Simplifier and, to a lesser degree, the
6687 Classical Reasoner. Typical big applications run around 2 times
6691 *** Document preparation ***
6693 * Commands 'display_drafts' and 'print_drafts' perform simple output
6694 of raw sources. Only those symbols that do not require additional
6695 LaTeX packages (depending on comments in isabellesym.sty) are
6696 displayed properly, everything else is left verbatim. isatool display
6697 and isatool print are used as front ends (these are subject to the
6698 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6700 * Command tags control specific markup of certain regions of text,
6701 notably folding and hiding. Predefined tags include "theory" (for
6702 theory begin and end), "proof" for proof commands, and "ML" for
6703 commands involving ML code; the additional tags "visible" and
6704 "invisible" are unused by default. Users may give explicit tag
6705 specifications in the text, e.g. ''by %invisible (auto)''. The
6706 interpretation of tags is determined by the LaTeX job during document
6707 preparation: see option -V of isatool usedir, or options -n and -t of
6708 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6711 Several document versions may be produced at the same time via isatool
6712 usedir (the generated index.html will link all of them). Typical
6713 specifications include ''-V document=theory,proof,ML'' to present
6714 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6715 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6716 these parts without any formal replacement text. The Isabelle site
6717 default settings produce ''document'' and ''outline'' versions as
6720 * Several new antiquotations:
6722 @{term_type term} prints a term with its type annotated;
6724 @{typeof term} prints the type of a term;
6726 @{const const} is the same as @{term const}, but checks that the
6727 argument is a known logical constant;
6729 @{term_style style term} and @{thm_style style thm} print a term or
6730 theorem applying a "style" to it
6734 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6735 definitions, equations, inequations etc., 'concl' printing only the
6736 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6737 to print the specified premise. TermStyle.add_style provides an ML
6738 interface for introducing further styles. See also the "LaTeX Sugar"
6739 document practical applications. The ML antiquotation prints
6740 type-checked ML expressions verbatim.
6742 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6743 and 'text' support optional locale specification '(in loc)', which
6744 specifies the default context for interpreting antiquotations. For
6745 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6747 * Option 'locale=NAME' of antiquotations specifies an alternative
6748 context interpreting the subsequent argument. For example: @{thm
6749 [locale=lattice] inf_assoc}.
6751 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6754 * Proper output of antiquotations for theory commands involving a
6755 proof context (such as 'locale' or 'theorem (in loc) ...').
6757 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6758 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6760 * isatool usedir: new option -C (default true) controls whether option
6761 -D should include a copy of the original document directory; -C false
6762 prevents unwanted effects such as copying of administrative CVS data.
6767 * Considerably improved version of 'constdefs' command. Now performs
6768 automatic type-inference of declared constants; additional support for
6769 local structure declarations (cf. locales and HOL records), see also
6770 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6771 sequential dependencies of definitions within a single 'constdefs'
6772 section; moreover, the declared name needs to be an identifier. If
6773 all fails, consider to fall back on 'consts' and 'defs' separately.
6775 * Improved indexed syntax and implicit structures. First of all,
6776 indexed syntax provides a notational device for subscripted
6777 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6778 expressions. Secondly, in a local context with structure
6779 declarations, number indexes \<^sub>n or the empty index (default
6780 number 1) refer to a certain fixed variable implicitly; option
6781 show_structs controls printing of implicit structures. Typical
6782 applications of these concepts involve record types and locales.
6784 * New command 'no_syntax' removes grammar declarations (and
6785 translations) resulting from the given syntax specification, which is
6786 interpreted in the same manner as for the 'syntax' command.
6788 * 'Advanced' translation functions (parse_translation etc.) may depend
6789 on the signature of the theory context being presently used for
6790 parsing/printing, see also isar-ref manual.
6792 * Improved 'oracle' command provides a type-safe interface to turn an
6793 ML expression of type theory -> T -> term into a primitive rule of
6794 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6795 is already included here); see also FOL/ex/IffExample.thy;
6798 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6799 before); "cI" is no longer bound, use "c.intro" instead.
6800 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6801 axclasses vs. locales.
6803 * Improved internal renaming of symbolic identifiers -- attach primes
6804 instead of base 26 numbers.
6806 * New flag show_question_marks controls printing of leading question
6807 marks in schematic variable names.
6809 * In schematic variable names, *any* symbol following \<^isub> or
6810 \<^isup> is now treated as part of the base name. For example, the
6811 following works without printing of awkward ".0" indexes:
6813 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6816 * Inner syntax includes (*(*nested*) comments*).
6818 * Pretty printer now supports unbreakable blocks, specified in mixfix
6819 annotations as "(00...)".
6821 * Clear separation of logical types and nonterminals, where the latter
6822 may only occur in 'syntax' specifications or type abbreviations.
6823 Before that distinction was only partially implemented via type class
6824 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6825 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6826 exotic syntax specifications may require further adaption
6827 (e.g. Cube/Cube.thy).
6829 * Removed obsolete type class "logic", use the top sort {} instead.
6830 Note that non-logical types should be declared as 'nonterminals'
6831 rather than 'types'. INCOMPATIBILITY for new object-logic
6834 * Attributes 'induct' and 'cases': type or set names may now be
6835 locally fixed variables as well.
6837 * Simplifier: can now control the depth to which conditional rewriting
6838 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6841 * Simplifier: simplification procedures may now take the current
6842 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6843 interface), which is very useful for calling the Simplifier
6844 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6845 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6846 low-level mk_simproc no longer applies Logic.varify internally, to
6847 allow for use in a context of fixed variables.
6849 * thin_tac now works even if the assumption being deleted contains !!
6850 or ==>. More generally, erule now works even if the major premise of
6851 the elimination rule contains !! or ==>.
6853 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6855 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6856 from Pure, which contains all common declarations already. Both
6857 theories are defined via plain Isabelle/Isar .thy files.
6858 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6859 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6860 use isatool fixcpure to adapt your theory and ML sources.
6862 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6863 selections of theorems in named facts via index ranges.
6865 * 'print_theorems': in theory mode, really print the difference
6866 wrt. the last state (works for interactive theory development only),
6867 in proof mode print all local facts (cf. 'print_facts');
6869 * 'hide': option '(open)' hides only base names.
6871 * More efficient treatment of intermediate checkpoints in interactive
6874 * Code generator is now invoked via code_module (incremental code
6875 generation) and code_library (modular code generation, ML structures
6876 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6877 must be quoted when used as identifiers.
6879 * New 'value' command for reading, evaluating and printing terms using
6880 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6881 quoted when used as identifier.
6886 * New commands for the interpretation of locale expressions in
6887 theories (1), locales (2) and proof contexts (3). These generate
6888 proof obligations from the expression specification. After the
6889 obligations have been discharged, theorems of the expression are added
6890 to the theory, target locale or proof context. The synopsis of the
6891 commands is a follows:
6893 (1) interpretation expr inst
6894 (2) interpretation target < expr
6895 (3) interpret expr inst
6897 Interpretation in theories and proof contexts require a parameter
6898 instantiation of terms from the current context. This is applied to
6899 specifications and theorems of the interpreted expression.
6900 Interpretation in locales only permits parameter renaming through the
6901 locale expression. Interpretation is smart in that interpretations
6902 that are active already do not occur in proof obligations, neither are
6903 instantiated theorems stored in duplicate. Use 'print_interps' to
6904 inspect active interpretations of a particular locale. For details,
6905 see the Isar Reference manual. Examples can be found in
6906 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6908 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6909 'interpret' instead.
6911 * New context element 'constrains' for adding type constraints to
6914 * Context expressions: renaming of parameters with syntax
6917 * Locale declaration: 'includes' disallowed.
6919 * Proper static binding of attribute syntax -- i.e. types / terms /
6920 facts mentioned as arguments are always those of the locale definition
6921 context, independently of the context of later invocations. Moreover,
6922 locale operations (renaming and type / term instantiation) are applied
6923 to attribute arguments as expected.
6925 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6926 actual attributes; rare situations may require Attrib.attribute to
6927 embed those attributes into Attrib.src that lack concrete syntax.
6928 Attribute implementations need to cooperate properly with the static
6929 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6930 Attrib.XXX_thm etc. already do the right thing without further
6931 intervention. Only unusual applications -- such as "where" or "of"
6932 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6933 on the context and the facts involved -- may have to assign parsed
6934 values to argument tokens explicitly.
6936 * Changed parameter management in theorem generation for long goal
6937 statements with 'includes'. INCOMPATIBILITY: produces a different
6938 theorem statement in rare situations.
6940 * Locale inspection command 'print_locale' omits notes elements. Use
6941 'print_locale!' to have them included in the output.
6946 * Provers/hypsubst.ML: improved version of the subst method, for
6947 single-step rewriting: it now works in bound variable contexts. New is
6948 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6949 rewrite a different subterm than the original subst method, which is
6950 still available as 'simplesubst'.
6952 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6955 * Provers/trancl.ML: new transitivity reasoner for transitive and
6956 reflexive-transitive closure of relations.
6958 * Provers/blast.ML: new reference depth_limit to make blast's depth
6959 limit (previously hard-coded with a value of 20) user-definable.
6961 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6962 is peformed already. Object-logics merely need to finish their
6963 initial simpset configuration as before. INCOMPATIBILITY.
6968 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6971 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6973 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6974 and x-symbol; use option '-m epsilon' to get it actually printed.
6975 Moreover, the mathematically important symbolic identifier \<epsilon>
6976 becomes available as variable, constant etc. INCOMPATIBILITY,
6978 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6979 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6980 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6981 support corresponding Isar calculations.
6983 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6986 * theory SetInterval: changed the syntax for open intervals:
6995 The old syntax is still supported but will disappear in the next
6996 release. For conversion use the following Emacs search and replace
6997 patterns (these are not perfect but work quite well):
6999 {)\([^\.]*\)\.\. -> {\1<\.\.}
7000 \.\.\([^(}]*\)(} -> \.\.<\1}
7002 * Theory Commutative_Ring (in Library): method comm_ring for proving
7003 equalities in commutative rings; method 'algebra' provides a generic
7006 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7007 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7008 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7011 Some new syntax forms are available:
7013 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7014 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7015 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7016 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7018 The latter form "\<Sum>x < k. e" used to be based on a separate
7019 function "Summation", which has been discontinued.
7021 * theory Finite_Set: in structured induction proofs, the insert case
7022 is now 'case (insert x F)' instead of the old counterintuitive 'case
7025 * The 'refute' command has been extended to support a much larger
7026 fragment of HOL, including axiomatic type classes, constdefs and
7027 typedefs, inductive datatypes and recursion.
7029 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7030 Requires zChaff with proof generation to be installed. See
7031 HOL/ex/SAT_Examples.thy for examples.
7033 * Datatype induction via method 'induct' now preserves the name of the
7034 induction variable. For example, when proving P(xs::'a list) by
7035 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7036 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7037 in unstructured proof scripts.
7039 * Reworked implementation of records. Improved scalability for
7040 records with many fields, avoiding performance problems for type
7041 inference. Records are no longer composed of nested field types, but
7042 of nested extension types. Therefore the record type only grows linear
7043 in the number of extensions and not in the number of fields. The
7044 top-level (users) view on records is preserved. Potential
7045 INCOMPATIBILITY only in strange cases, where the theory depends on the
7046 old record representation. The type generated for a record is called
7047 <record_name>_ext_type.
7049 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7050 proofs triggered by a record definition or a simproc (if
7051 quick_and_dirty is enabled). Definitions of large records can take
7054 New simproc record_upd_simproc for simplification of multiple record
7055 updates enabled by default. Moreover, trivial updates are also
7056 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7057 occasionally, since simplification is more powerful by default.
7059 * typedef: proper support for polymorphic sets, which contain extra
7060 type-variables in the term.
7062 * Simplifier: automatically reasons about transitivity chains
7063 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7064 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7065 old proofs break occasionally as simplification may now solve more
7066 goals than previously.
7068 * Simplifier: converts x <= y into x = y if assumption y <= x is
7069 present. Works for all partial orders (class "order"), in particular
7070 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7073 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7074 bound variable or a constant then the let is unfolded. Otherwise
7075 first a is simplified to b, and then f b is simplified to g. If
7076 possible we abstract b from g arriving at "let x = b in h x",
7077 otherwise we unfold the let and arrive at g. The simproc can be
7078 enabled/disabled by the reference use_let_simproc. Potential
7079 INCOMPATIBILITY since simplification is more powerful by default.
7081 * Classical reasoning: the meson method now accepts theorems as arguments.
7083 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7084 jobs to provide advice on the provability of subgoals.
7086 * Theory OrderedGroup and Ring_and_Field: various additions and
7087 improvements to faciliate calculations involving equalities and
7090 The following theorems have been eliminated or modified
7093 abs_eq now named abs_of_nonneg
7094 abs_of_ge_0 now named abs_of_nonneg
7095 abs_minus_eq now named abs_of_nonpos
7096 imp_abs_id now named abs_of_nonneg
7097 imp_abs_neg_id now named abs_of_nonpos
7098 mult_pos now named mult_pos_pos
7099 mult_pos_le now named mult_nonneg_nonneg
7100 mult_pos_neg_le now named mult_nonneg_nonpos
7101 mult_pos_neg2_le now named mult_nonneg_nonpos2
7102 mult_neg now named mult_neg_neg
7103 mult_neg_le now named mult_nonpos_nonpos
7105 * The following lemmas in Ring_and_Field have been added to the simplifier:
7108 not_square_less_zero
7110 The following lemmas have been deleted from Real/RealPow:
7120 * Theory Parity: added rules for simplifying exponents.
7124 The following theorems have been eliminated or modified
7127 list_all_Nil now named list_all.simps(1)
7128 list_all_Cons now named list_all.simps(2)
7129 list_all_conv now named list_all_iff
7130 set_mem_eq now named mem_iff
7132 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7133 asymptotic "big O" calculations. See the notes in BigO.thy.
7138 * Theory RealDef: better support for embedding natural numbers and
7139 integers in the reals.
7141 The following theorems have been eliminated or modified
7144 exp_ge_add_one_self now requires no hypotheses
7145 real_of_int_add reversed direction of equality (use [symmetric])
7146 real_of_int_minus reversed direction of equality (use [symmetric])
7147 real_of_int_diff reversed direction of equality (use [symmetric])
7148 real_of_int_mult reversed direction of equality (use [symmetric])
7150 * Theory RComplete: expanded support for floor and ceiling functions.
7152 * Theory Ln is new, with properties of the natural logarithm
7154 * Hyperreal: There is a new type constructor "star" for making
7155 nonstandard types. The old type names are now type synonyms:
7159 hcomplex = complex star
7161 * Hyperreal: Many groups of similarly-defined constants have been
7162 replaced by polymorphic versions (INCOMPATIBILITY):
7164 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7166 starset <-- starsetNat, starsetC
7167 *s* <-- *sNat*, *sc*
7168 starset_n <-- starsetNat_n, starsetC_n
7169 *sn* <-- *sNatn*, *scn*
7170 InternalSets <-- InternalNatSets, InternalCSets
7172 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7173 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7174 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7175 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7176 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7178 * Hyperreal: Many type-specific theorems have been removed in favor of
7179 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7181 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7182 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7183 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7184 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7185 right_minus <-- hypreal_add_minus
7186 left_minus <-- {hypreal,hcomplex}_add_minus_left
7187 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7188 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7189 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7190 mult_1_right <-- hcomplex_mult_one_right
7191 mult_zero_left <-- hcomplex_mult_zero_left
7192 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7193 right_distrib <-- hypnat_add_mult_distrib2
7194 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7195 right_inverse <-- hypreal_mult_inverse
7196 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7197 order_refl <-- {hypreal,hypnat}_le_refl
7198 order_trans <-- {hypreal,hypnat}_le_trans
7199 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7200 order_less_le <-- {hypreal,hypnat}_less_le
7201 linorder_linear <-- {hypreal,hypnat}_le_linear
7202 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7203 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7204 add_nonneg_nonneg <-- hypreal_le_add_order
7206 * Hyperreal: Separate theorems having to do with type-specific
7207 versions of constants have been merged into theorems that apply to the
7208 new polymorphic constants (INCOMPATIBILITY):
7210 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7211 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7212 STAR_Un <-- {STAR,NatStar,STARC}_Un
7213 STAR_Int <-- {STAR,NatStar,STARC}_Int
7214 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7215 STAR_subset <-- {STAR,NatStar,STARC}_subset
7216 STAR_mem <-- {STAR,NatStar,STARC}_mem
7217 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7218 STAR_diff <-- {STAR,STARC}_diff
7219 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7220 STARC_hcomplex_of_complex}_image_subset
7221 starset_n_Un <-- starset{Nat,C}_n_Un
7222 starset_n_Int <-- starset{Nat,C}_n_Int
7223 starset_n_Compl <-- starset{Nat,C}_n_Compl
7224 starset_n_diff <-- starset{Nat,C}_n_diff
7225 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7226 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7227 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7228 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7229 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7230 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7231 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7232 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7233 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7234 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7235 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7236 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7237 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7238 starfun_diff <-- starfun{C,RC,CR}_diff
7239 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7240 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7241 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7242 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7243 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7244 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7245 starfun_Id <-- starfunC_Id
7246 starfun_approx <-- starfun{Nat,CR}_approx
7247 starfun_capprox <-- starfun{C,RC}_capprox
7248 starfun_abs <-- starfunNat_rabs
7249 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7250 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7251 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7252 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7253 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7254 starfun_add_approx <-- starfunCR_add_approx
7255 starfun_inverse_inverse <-- starfunC_inverse_inverse
7256 starfun_divide <-- starfun{C,CR,RC}_divide
7257 starfun_n <-- starfun{Nat,C}_n
7258 starfun_n_mult <-- starfun{Nat,C}_n_mult
7259 starfun_n_add <-- starfun{Nat,C}_n_add
7260 starfun_n_add_minus <-- starfunNat_n_add_minus
7261 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7262 starfun_n_minus <-- starfun{Nat,C}_n_minus
7263 starfun_n_eq <-- starfun{Nat,C}_n_eq
7265 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7266 star_n_minus <-- {hypreal,hcomplex}_minus
7267 star_n_diff <-- {hypreal,hcomplex}_diff
7268 star_n_mult <-- {hypreal,hcomplex}_mult
7269 star_n_inverse <-- {hypreal,hcomplex}_inverse
7270 star_n_le <-- {hypreal,hypnat}_le
7271 star_n_less <-- {hypreal,hypnat}_less
7272 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7273 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7274 star_n_abs <-- hypreal_hrabs
7275 star_n_divide <-- hcomplex_divide
7277 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7278 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7279 star_of_diff <-- hypreal_of_real_diff
7280 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7281 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7282 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7283 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7284 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7285 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7286 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7287 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7288 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7289 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7290 star_of_number_of <-- {hypreal,hcomplex}_number_of
7291 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7292 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7293 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7294 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7295 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7296 star_of_power <-- hypreal_of_real_power
7297 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7299 * Hyperreal: new method "transfer" that implements the transfer
7300 principle of nonstandard analysis. With a subgoal that mentions
7301 nonstandard types like "'a star", the command "apply transfer"
7302 replaces it with an equivalent one that mentions only standard types.
7303 To be successful, all free variables must have standard types; non-
7304 standard variables must have explicit universal quantifiers.
7306 * Hyperreal: A theory of Taylor series.
7311 * Discontinued special version of 'constdefs' (which used to support
7312 continuous functions) in favor of the general Pure one with full
7315 * New simplification procedure for solving continuity conditions; it
7316 is much faster on terms with many nested lambda abstractions (cubic
7317 instead of exponential time).
7319 * New syntax for domain package: selector names are now optional.
7320 Parentheses should be omitted unless argument is lazy, for example:
7322 domain 'a stream = cons "'a" (lazy "'a stream")
7324 * New command 'fixrec' for defining recursive functions with pattern
7325 matching; defining multiple functions with mutual recursion is also
7326 supported. Patterns may include the constants cpair, spair, up, sinl,
7327 sinr, or any data constructor defined by the domain package. The given
7328 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7329 syntax and examples.
7331 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7332 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7333 but the proof obligation additionally includes an admissibility
7334 requirement. The packages generate instances of class cpo or pcpo,
7335 with continuity and strictness theorems for Rep and Abs.
7337 * HOLCF: Many theorems have been renamed according to a more standard naming
7338 scheme (INCOMPATIBILITY):
7340 foo_inject: "foo$x = foo$y ==> x = y"
7341 foo_eq: "(foo$x = foo$y) = (x = y)"
7342 foo_less: "(foo$x << foo$y) = (x << y)"
7343 foo_strict: "foo$UU = UU"
7344 foo_defined: "... ==> foo$x ~= UU"
7345 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7350 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7351 including the First Isomorphism Theorem (on quotienting by the kernel
7354 * ZF/Simplifier: install second copy of type solver that actually
7355 makes use of TC rules declared to Isar proof contexts (or locales);
7356 the old version is still required for ML proof scripts.
7361 * Converted to Isar theory format; use locales instead of axiomatic
7367 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7370 * Pure/library.ML no longer defines its own option datatype, but uses
7371 that of the SML basis, which has constructors NONE and SOME instead of
7372 None and Some, as well as exception Option.Option instead of OPTION.
7373 The functions the, if_none, is_some, is_none have been adapted
7374 accordingly, while Option.map replaces apsome.
7376 * Pure/library.ML: the exception LIST has been given up in favour of
7377 the standard exceptions Empty and Subscript, as well as
7378 Library.UnequalLengths. Function like Library.hd and Library.tl are
7379 superceded by the standard hd and tl functions etc.
7381 A number of basic list functions are no longer exported to the ML
7382 toplevel, as they are variants of predefined functions. The following
7383 suggests how one can translate existing code:
7385 rev_append xs ys = List.revAppend (xs, ys)
7386 nth_elem (i, xs) = List.nth (xs, i)
7387 last_elem xs = List.last xs
7388 flat xss = List.concat xss
7389 seq fs = List.app fs
7390 partition P xs = List.partition P xs
7391 mapfilter f xs = List.mapPartial f xs
7393 * Pure/library.ML: several combinators for linear functional
7394 transformations, notably reverse application and composition:
7397 (x, y) |-> f f #-> g
7399 * Pure/library.ML: introduced/changed precedence of infix operators:
7401 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7403 infix 3 o oo ooo oooo;
7404 infix 4 ~~ upto downto;
7406 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7409 * Pure/library.ML: natural list combinators fold, fold_rev, and
7410 fold_map support linear functional transformations and nesting. For
7413 fold f [x1, ..., xN] y =
7414 y |> f x1 |> ... |> f xN
7416 (fold o fold) f [xs1, ..., xsN] y =
7417 y |> fold f xs1 |> ... |> fold f xsN
7419 fold f [x1, ..., xN] =
7422 (fold o fold) f [xs1, ..., xsN] =
7423 fold f xs1 #> ... #> fold f xsN
7425 * Pure/library.ML: the following selectors on type 'a option are
7428 the: 'a option -> 'a (*partial*)
7429 these: 'a option -> 'a where 'a = 'b list
7430 the_default: 'a -> 'a option -> 'a
7431 the_list: 'a option -> 'a list
7433 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7434 basic operations for association lists, following natural argument
7435 order; moreover the explicit equality predicate passed here avoids
7436 potentially expensive polymorphic runtime equality checks.
7437 The old functions may be expressed as follows:
7439 assoc = uncurry (AList.lookup (op =))
7440 assocs = these oo AList.lookup (op =)
7441 overwrite = uncurry (AList.update (op =)) o swap
7443 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7445 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7446 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7448 replacing make_keylist and keyfilter (occassionally used)
7451 make_keylist = AList.make
7452 keyfilter = AList.find (op =)
7454 * eq_fst and eq_snd now take explicit equality parameter, thus
7455 avoiding eqtypes. Naive rewrites:
7457 eq_fst = eq_fst (op =)
7458 eq_snd = eq_snd (op =)
7460 * Removed deprecated apl and apr (rarely used).
7463 apl (n, op) =>>= curry op n
7464 apr (op, m) =>>= fn n => op (n, m)
7466 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7467 provides a reasonably efficient light-weight implementation of sets as
7470 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7471 few new operations; existing lookup and update are now curried to
7472 follow natural argument order (for use with fold etc.);
7473 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7475 * Pure/General: output via the Isabelle channels of
7476 writeln/warning/error etc. is now passed through Output.output, with a
7477 hook for arbitrary transformations depending on the print_mode
7478 (cf. Output.add_mode -- the first active mode that provides a output
7479 function wins). Already formatted output may be embedded into further
7480 text via Output.raw; the result of Pretty.string_of/str_of and derived
7481 functions (string_of_term/cterm/thm etc.) is already marked raw to
7482 accommodate easy composition of diagnostic messages etc. Programmers
7483 rarely need to care about Output.output or Output.raw at all, with
7484 some notable exceptions: Output.output is required when bypassing the
7485 standard channels (writeln etc.), or in token translations to produce
7486 properly formatted results; Output.raw is required when capturing
7487 already output material that will eventually be presented to the user
7488 a second time. For the default print mode, both Output.output and
7489 Output.raw have no effect.
7491 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7492 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7493 cumulative results are displayed at the end of a batch session.
7495 * Pure/General: File.sysify_path and File.quote_sysify path have been
7496 replaced by File.platform_path and File.shell_path (with appropriate
7497 hooks). This provides a clean interface for unusual systems where the
7498 internal and external process view of file names are different.
7500 * Pure: more efficient orders for basic syntactic entities: added
7501 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7502 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7503 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7504 orders now -- potential INCOMPATIBILITY for code that depends on a
7505 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7506 Library.sort_strings on result).
7508 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7509 fold_types traverse types/terms from left to right, observing natural
7510 argument order. Supercedes previous foldl_XXX versions, add_frees,
7511 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7513 * Pure: name spaces have been refined, with significant changes of the
7514 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7515 to extern(_table). The plain name entry path is superceded by a
7516 general 'naming' context, which also includes the 'policy' to produce
7517 a fully qualified name and external accesses of a fully qualified
7518 name; NameSpace.extend is superceded by context dependent
7519 Sign.declare_name. Several theory and proof context operations modify
7520 the naming context. Especially note Theory.restore_naming and
7521 ProofContext.restore_naming to get back to a sane state; note that
7522 Theory.add_path is no longer sufficient to recover from
7523 Theory.absolute_path in particular.
7525 * Pure: new flags short_names (default false) and unique_names
7526 (default true) for controlling output of qualified names. If
7527 short_names is set, names are printed unqualified. If unique_names is
7528 reset, the name prefix is reduced to the minimum required to achieve
7529 the original result when interning again, even if there is an overlap
7530 with earlier declarations.
7532 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7533 now 'extend', and 'merge' gets an additional Pretty.pp argument
7534 (useful for printing error messages). INCOMPATIBILITY.
7536 * Pure: major reorganization of the theory context. Type Sign.sg and
7537 Theory.theory are now identified, referring to the universal
7538 Context.theory (see Pure/context.ML). Actual signature and theory
7539 content is managed as theory data. The old code and interfaces were
7540 spread over many files and structures; the new arrangement introduces
7541 considerable INCOMPATIBILITY to gain more clarity:
7543 Context -- theory management operations (name, identity, inclusion,
7544 parents, ancestors, merge, etc.), plus generic theory data;
7546 Sign -- logical signature and syntax operations (declaring consts,
7547 types, etc.), plus certify/read for common entities;
7549 Theory -- logical theory operations (stating axioms, definitions,
7550 oracles), plus a copy of logical signature operations (consts,
7551 types, etc.); also a few basic management operations (Theory.copy,
7554 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7555 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7556 for convenience -- they merely return the theory.
7558 * Pure: type Type.tsig is superceded by theory in most interfaces.
7560 * Pure: the Isar proof context type is already defined early in Pure
7561 as Context.proof (note that ProofContext.context and Proof.context are
7562 aliases, where the latter is the preferred name). This enables other
7563 Isabelle components to refer to that type even before Isar is present.
7565 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7566 typeK, constK, axiomK, oracleK), but provide explicit operations for
7567 any of these kinds. For example, Sign.intern typeK is now
7568 Sign.intern_type, Theory.hide_space Sign.typeK is now
7569 Theory.hide_types. Also note that former
7570 Theory.hide_classes/types/consts are now
7571 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7572 internalize their arguments! INCOMPATIBILITY.
7574 * Pure: get_thm interface (of PureThy and ProofContext) expects
7575 datatype thmref (with constructors Name and NameSelection) instead of
7576 plain string -- INCOMPATIBILITY;
7578 * Pure: cases produced by proof methods specify options, where NONE
7579 means to remove case bindings -- INCOMPATIBILITY in
7582 * Pure: the following operations retrieve axioms or theorems from a
7583 theory node or theory hierarchy, respectively:
7585 Theory.axioms_of: theory -> (string * term) list
7586 Theory.all_axioms_of: theory -> (string * term) list
7587 PureThy.thms_of: theory -> (string * thm) list
7588 PureThy.all_thms_of: theory -> (string * thm) list
7590 * Pure: print_tac now outputs the goal through the trace channel.
7592 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7593 Reference Toplevel.debug (default false) controls detailed printing
7594 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7595 controls execution profiling -- set to 1 for time and 2 for space
7596 (both increase the runtime).
7598 * Isar session: The initial use of ROOT.ML is now always timed,
7599 i.e. the log will show the actual process times, in contrast to the
7600 elapsed wall-clock time that the outer shell wrapper produces.
7602 * Simplifier: improved handling of bound variables (nameless
7603 representation, avoid allocating new strings). Simprocs that invoke
7604 the Simplifier recursively should use Simplifier.inherit_bounds to
7605 avoid local name clashes. Failure to do so produces warnings
7606 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7607 for further details.
7609 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7610 bindings for all theorems stored within a given theory; this may help
7611 in porting non-Isar theories to Isar ones, while keeping ML proof
7612 scripts for the time being.
7614 * ML operator HTML.with_charset specifies the charset begin used for
7615 generated HTML files. For example:
7617 HTML.with_charset "utf-8" use_thy "Hebrew";
7618 HTML.with_charset "utf-8" use_thy "Chinese";
7623 * Allow symlinks to all proper Isabelle executables (Isabelle,
7624 isabelle, isatool etc.).
7626 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7627 isatool doc, isatool mkdir, display_drafts etc.).
7629 * isatool usedir: option -f allows specification of the ML file to be
7630 used by Isabelle; default is ROOT.ML.
7632 * New isatool version outputs the version identifier of the Isabelle
7633 distribution being used.
7635 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7636 (containing Boolean satisfiability problems) into Isabelle/HOL
7641 New in Isabelle2004 (April 2004)
7642 --------------------------------
7646 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7647 Replaces linorder.ML.
7649 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7650 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7651 (\<a>...\<z>), are now considered normal letters, and can therefore
7652 be used anywhere where an ASCII letter (a...zA...Z) has until
7653 now. COMPATIBILITY: This obviously changes the parsing of some
7654 terms, especially where a symbol has been used as a binder, say
7655 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7656 as an identifier. Fix it by inserting a space around former
7657 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7658 existing theory and ML files.
7660 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7662 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7663 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7664 a normal (but invisible) letter. For multiple letter subscripts repeat
7665 \<^isub> like this: x\<^isub>1\<^isub>2.
7667 * Pure: There are now sub-/superscripts that can span more than one
7668 character. Text between \<^bsub> and \<^esub> is set in subscript in
7669 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7670 superscript. The new control characters are not identifier parts.
7672 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7673 content of "..." to the latex file instead of \isacntrl... . The "..."
7674 may consist of any printable characters excluding the end bracket >.
7676 * Pure: Using new Isar command "finalconsts" (or the ML functions
7677 Theory.add_finals or Theory.add_finals_i) it is now possible to
7678 declare constants "final", which prevents their being given a definition
7679 later. It is useful for constants whose behaviour is fixed axiomatically
7680 rather than definitionally, such as the meta-logic connectives.
7682 * Pure: 'instance' now handles general arities with general sorts
7683 (i.e. intersections of classes),
7685 * Presentation: generated HTML now uses a CSS style sheet to make layout
7686 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7687 It can be changed to alter the colors/layout of generated pages.
7692 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7693 cut_tac, subgoal_tac and thin_tac:
7694 - Now understand static (Isar) contexts. As a consequence, users of Isar
7695 locales are no longer forced to write Isar proof scripts.
7696 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7698 - INCOMPATIBILITY: names of variables to be instantiated may no
7699 longer be enclosed in quotes. Instead, precede variable name with `?'.
7700 This is consistent with the instantiation attribute "where".
7702 * Attributes "where" and "of":
7703 - Now take type variables of instantiated theorem into account when reading
7704 the instantiation string. This fixes a bug that caused instantiated
7705 theorems to have too special types in some circumstances.
7706 - "where" permits explicit instantiations of type variables.
7708 * Calculation commands "moreover" and "also" no longer interfere with
7709 current facts ("this"), admitting arbitrary combinations with "then"
7713 - Goal statements involving the context element "includes" no longer
7714 generate theorems with internal delta predicates (those ending on
7715 "_axioms") in the premise.
7716 Resolve particular premise with <locale>.intro to obtain old form.
7717 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7718 specification and "includes" elements in goal statement.
7719 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7720 [intro?] and [elim?] (respectively) by default.
7721 - Experimental command for instantiation of locales in proof contexts:
7722 instantiate <label>[<attrs>]: <loc>
7723 Instantiates locale <loc> and adds all its theorems to the current context
7724 taking into account their attributes. Label and attrs are optional
7725 modifiers, like in theorem declarations. If present, names of
7726 instantiated theorems are qualified with <label>, and the attributes
7727 <attrs> are applied after any attributes these theorems might have already.
7728 If the locale has assumptions, a chained fact of the form
7729 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7730 are derived. The command does not support old-style locales declared
7731 with "locale (open)".
7732 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7734 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7740 * Proof import: new image HOL4 contains the imported library from
7741 the HOL4 system with about 2500 theorems. It is imported by
7742 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7743 can be used like any other Isabelle image. See
7744 HOL/Import/HOL/README for more information.
7747 - Much improved handling of linear and partial orders.
7748 Reasoners for linear and partial orders are set up for type classes
7749 "linorder" and "order" respectively, and are added to the default simpset
7750 as solvers. This means that the simplifier can build transitivity chains
7751 to solve goals from the assumptions.
7752 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7753 of blast or auto after simplification become unnecessary because the goal
7754 is solved by simplification already.
7756 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7757 all proved in axiomatic type classes for semirings, rings and fields.
7760 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7761 now formalized using the Ring_and_Field theory mentioned above.
7762 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7763 than before, because now they are set up once in a generic manner.
7764 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7765 Look for the general versions in Ring_and_Field (and Power if they concern
7768 * Type "rat" of the rational numbers is now available in HOL-Complex.
7771 - Record types are now by default printed with their type abbreviation
7772 instead of the list of all field types. This can be configured via
7773 the reference "print_record_type_abbr".
7774 - Simproc "record_upd_simproc" for simplification of multiple updates added
7775 (not enabled by default).
7776 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7777 EX x. x = sel r to True (not enabled by default).
7778 - Tactic "record_split_simp_tac" to split and simplify records added.
7780 * 'specification' command added, allowing for definition by
7781 specification. There is also an 'ax_specification' command that
7782 introduces the new constants axiomatically.
7784 * arith(_tac) is now able to generate counterexamples for reals as well.
7786 * HOL-Algebra: new locale "ring" for non-commutative rings.
7788 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7789 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7791 * HOL-Matrix: a first theory for matrices in HOL with an application of
7792 matrix theory to linear programming.
7794 * Unions and Intersections:
7795 The latex output syntax of UN and INT has been changed
7796 from "\Union x \in A. B" to "\Union_{x \in A} B"
7797 i.e. the index formulae has become a subscript.
7798 Similarly for "\Union x. B", and for \Inter instead of \Union.
7800 * Unions and Intersections over Intervals:
7801 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7802 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7803 like in normal math, and corresponding versions for < and for intersection.
7805 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7806 lexicographic dictonary ordering has been added as "lexord".
7808 * ML: the legacy theory structures Int and List have been removed. They had
7809 conflicted with ML Basis Library structures having the same names.
7811 * 'refute' command added to search for (finite) countermodels. Only works
7812 for a fragment of HOL. The installation of an external SAT solver is
7813 highly recommended. See "HOL/Refute.thy" for details.
7815 * 'quickcheck' command: Allows to find counterexamples by evaluating
7816 formulae under an assignment of free variables to random values.
7817 In contrast to 'refute', it can deal with inductive datatypes,
7818 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7824 * Streams now come with concatenation and are part of the HOLCF image
7828 New in Isabelle2003 (May 2003)
7829 ------------------------------
7833 * Provers/simplifier:
7835 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7836 Assumptions are now subject to complete mutual simplification,
7837 not just from left to right. The simplifier now preserves
7838 the order of assumptions.
7840 Potential INCOMPATIBILITY:
7842 -- simp sometimes diverges where the old version did
7843 not, e.g. invoking simp on the goal
7845 [| P (f x); y = x; f x = f y |] ==> Q
7847 now gives rise to the infinite reduction sequence
7849 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7851 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7854 -- Tactics combining classical reasoner and simplification (such as auto)
7855 are also affected by this change, because many of them rely on
7856 simp. They may sometimes diverge as well or yield a different numbers
7857 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7858 in case of problems. Sometimes subsequent calls to the classical
7859 reasoner will fail because a preceeding call to the simplifier too
7860 eagerly simplified the goal, e.g. deleted redundant premises.
7862 - The simplifier trace now shows the names of the applied rewrite rules
7864 - You can limit the number of recursive invocations of the simplifier
7865 during conditional rewriting (where the simplifie tries to solve the
7866 conditions before applying the rewrite rule):
7867 ML "simp_depth_limit := n"
7868 where n is an integer. Thus you can force termination where previously
7869 the simplifier would diverge.
7871 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7873 - No longer aborts on failed congruence proof. Instead, the
7874 congruence is ignored.
7876 * Pure: New generic framework for extracting programs from constructive
7877 proofs. See HOL/Extraction.thy for an example instantiation, as well
7878 as HOL/Extraction for some case studies.
7880 * Pure: The main goal of the proof state is no longer shown by default, only
7881 the subgoals. This behaviour is controlled by a new flag.
7882 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7883 (ML: Proof.show_main_goal).
7885 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7886 rules whose conclusion matches subgoal 1:
7887 PG menu: Isabelle/Isar -> Show me -> matching rules
7888 The rules are ordered by how closely they match the subgoal.
7889 In particular, rules that solve a subgoal outright are displayed first
7890 (or rather last, the way they are printed).
7891 (ML: ProofGeneral.print_intros())
7893 * Pure: New flag trace_unify_fail causes unification to print
7894 diagnostic information (PG: in trace buffer) when it fails. This is
7895 useful for figuring out why single step proofs like rule, erule or
7898 * Pure: Locale specifications now produce predicate definitions
7899 according to the body of text (covering assumptions modulo local
7900 definitions); predicate "loc_axioms" covers newly introduced text,
7901 while "loc" is cumulative wrt. all included locale expressions; the
7902 latter view is presented only on export into the global theory
7903 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7904 on the old view without predicates;
7906 * Pure: predefined locales "var" and "struct" are useful for sharing
7907 parameters (as in CASL, for example); just specify something like
7908 ``var x + var y + struct M'' as import;
7910 * Pure: improved thms_containing: proper indexing of facts instead of
7911 raw theorems; check validity of results wrt. current name space;
7912 include local facts of proof configuration (also covers active
7913 locales), cover fixed variables in index; may use "_" in term
7914 specification; an optional limit for the number of printed facts may
7915 be given (the default is 40);
7917 * Pure: disallow duplicate fact bindings within new-style theory files
7920 * Provers: improved induct method: assumptions introduced by case
7921 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7922 the goal statement); "foo" still refers to all facts collectively;
7924 * Provers: the function blast.overloaded has been removed: all constants
7925 are regarded as potentially overloaded, which improves robustness in exchange
7926 for slight decrease in efficiency;
7928 * Provers/linorder: New generic prover for transitivity reasoning over
7929 linear orders. Note: this prover is not efficient!
7931 * Isar: preview of problems to finish 'show' now produce an error
7932 rather than just a warning (in interactive mode);
7939 - Produces a counter example if it cannot prove a goal.
7940 Note that the counter example may be spurious if the goal is not a formula
7941 of quantifier-free linear arithmetic.
7942 In ProofGeneral the counter example appears in the trace buffer.
7944 - Knows about div k and mod k where k is a numeral of type nat or int.
7946 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7947 linear arithmetic fails. This takes account of quantifiers and divisibility.
7948 Presburger arithmetic can also be called explicitly via presburger(_tac).
7950 * simp's arithmetic capabilities have been enhanced a bit: it now
7951 takes ~= in premises into account (by performing a case split);
7953 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7954 are distributed over a sum of terms;
7956 * New tactic "trans_tac" and method "trans" instantiate
7957 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7960 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7961 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7963 * 'typedef' command has new option "open" to suppress the set
7966 * functions Min and Max on finite sets have been introduced (theory
7969 * attribute [symmetric] now works for relations as well; it turns
7970 (x,y) : R^-1 into (y,x) : R, and vice versa;
7972 * induct over a !!-quantified statement (say !!x1..xn):
7973 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7975 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7976 %x. None. Warning: empty_def now refers to the previously hidden definition
7979 * Algebra: formalization of classical algebra. Intended as base for
7980 any algebraic development in Isabelle. Currently covers group theory
7981 (up to Sylow's theorem) and ring theory (Universal Property of
7982 Univariate Polynomials). Contributions welcome;
7984 * GroupTheory: deleted, since its material has been moved to Algebra;
7986 * Complex: new directory of the complex numbers with numeric constants,
7987 nonstandard complex numbers, and some complex analysis, standard and
7988 nonstandard (Jacques Fleuriot);
7990 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7992 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7995 * Real/HahnBanach: updated and adapted to locales;
7997 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8000 * UNITY: added the Meier-Sanders theory of progress sets;
8002 * MicroJava: bytecode verifier and lightweight bytecode verifier
8003 as abstract algorithms, instantiated to the JVM;
8005 * Bali: Java source language formalization. Type system, operational
8006 semantics, axiomatic semantics. Supported language features:
8007 classes, interfaces, objects,virtual methods, static methods,
8008 static/instance fields, arrays, access modifiers, definite
8009 assignment, exceptions.
8014 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8017 * Main ZF: virtually all theories converted to new-style format;
8022 * Pure: Tactic.prove provides sane interface for internal proofs;
8023 omits the infamous "standard" operation, so this is more appropriate
8024 than prove_goalw_cterm in many situations (e.g. in simprocs);
8026 * Pure: improved error reporting of simprocs;
8028 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8032 *** Document preparation ***
8034 * uses \par instead of \\ for line breaks in theory text. This may
8035 shift some page breaks in large documents. To get the old behaviour
8036 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8038 * minimized dependencies of isabelle.sty and isabellesym.sty on
8041 * \<euro> now needs package babel/greek instead of marvosym (which
8044 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8049 New in Isabelle2002 (March 2002)
8050 --------------------------------
8052 *** Document preparation ***
8054 * greatly simplified document preparation setup, including more
8055 graceful interpretation of isatool usedir -i/-d/-D options, and more
8056 instructive isatool mkdir; users should basically be able to get
8057 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8058 users may run a separate document processing stage manually like this:
8059 "isatool usedir -D output HOL Test && isatool document Test/output";
8061 * theory dependency graph may now be incorporated into documents;
8062 isatool usedir -g true will produce session_graph.eps/.pdf for use
8063 with \includegraphics of LaTeX;
8065 * proper spacing of consecutive markup elements, especially text
8066 blocks after section headings;
8068 * support bold style (for single symbols only), input syntax is like
8069 this: "\<^bold>\<alpha>" or "\<^bold>A";
8071 * \<bullet> is now output as bold \cdot by default, which looks much
8072 better in printed text;
8074 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8075 note that these symbols are currently unavailable in Proof General /
8076 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8078 * isatool latex no longer depends on changed TEXINPUTS, instead
8079 isatool document copies the Isabelle style files to the target
8085 * Pure/Provers: improved proof by cases and induction;
8086 - 'case' command admits impromptu naming of parameters (such as
8088 - 'induct' method divinates rule instantiation from the inductive
8089 claim; no longer requires excessive ?P bindings for proper
8090 instantiation of cases;
8091 - 'induct' method properly enumerates all possibilities of set/type
8092 rules; as a consequence facts may be also passed through *type*
8093 rules without further ado;
8094 - 'induct' method now derives symbolic cases from the *rulified*
8095 rule (before it used to rulify cases stemming from the internal
8096 atomized version); this means that the context of a non-atomic
8097 statement becomes is included in the hypothesis, avoiding the
8098 slightly cumbersome show "PROP ?case" form;
8099 - 'induct' may now use elim-style induction rules without chaining
8100 facts, using ``missing'' premises from the goal state; this allows
8101 rules stemming from inductive sets to be applied in unstructured
8102 scripts, while still benefitting from proper handling of non-atomic
8103 statements; NB: major inductive premises need to be put first, all
8104 the rest of the goal is passed through the induction;
8105 - 'induct' proper support for mutual induction involving non-atomic
8106 rule statements (uses the new concept of simultaneous goals, see
8108 - append all possible rule selections, but only use the first
8109 success (no backtracking);
8110 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8111 - undeclared rule case names default to numbers 1, 2, 3, ...;
8112 - added 'print_induct_rules' (covered by help item in recent Proof
8114 - moved induct/cases attributes to Pure, methods to Provers;
8115 - generic method setup instantiated for FOL and HOL;
8117 * Pure: support multiple simultaneous goal statements, for example
8118 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8119 meta-level mechanism, this acts as if several individual goals had
8120 been stated separately; in particular common proof methods need to be
8121 repeated in order to cover all claims; note that a single elimination
8122 step is *not* sufficient to establish the two conjunctions, so this
8125 assume "A & B" then have A and B .. (*".." fails*)
8127 better use "obtain" in situations as above; alternative refer to
8128 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8130 * Pure: proper integration with ``locales''; unlike the original
8131 version by Florian Kammller, Isar locales package high-level proof
8132 contexts rather than raw logical ones (e.g. we admit to include
8133 attributes everywhere); operations on locales include merge and
8134 rename; support for implicit arguments (``structures''); simultaneous
8135 type-inference over imports and text; see also HOL/ex/Locales.thy for
8138 * Pure: the following commands have been ``localized'', supporting a
8139 target locale specification "(in name)": 'lemma', 'theorem',
8140 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8141 stored both within the locale and at the theory level (exported and
8142 qualified by the locale name);
8144 * Pure: theory goals may now be specified in ``long'' form, with
8145 ad-hoc contexts consisting of arbitrary locale elements. for example
8146 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8147 definitions may be given, too); the result is a meta-level rule with
8148 the context elements being discharged in the obvious way;
8150 * Pure: new proof command 'using' allows to augment currently used
8151 facts after a goal statement ('using' is syntactically analogous to
8152 'apply', but acts on the goal's facts only); this allows chained facts
8153 to be separated into parts given before and after a claim, as in
8154 ``from a and b have C using d and e <proof>'';
8156 * Pure: renamed "antecedent" case to "rule_context";
8158 * Pure: new 'judgment' command records explicit information about the
8159 object-logic embedding (used by several tools internally); no longer
8160 use hard-wired "Trueprop";
8162 * Pure: added 'corollary' command;
8164 * Pure: fixed 'token_translation' command;
8166 * Pure: removed obsolete 'exported' attribute;
8168 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8169 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8170 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8172 * Pure: method 'atomize' presents local goal premises as object-level
8173 statements (atomic meta-level propositions); setup controlled via
8174 rewrite rules declarations of 'atomize' attribute; example
8175 application: 'induct' method with proper rule statements in improper
8178 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8179 now consider the syntactic context of assumptions, giving a better
8180 chance to get type-inference of the arguments right (this is
8181 especially important for locales);
8183 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8186 * Pure/obtain: the formal conclusion "thesis", being marked as
8187 ``internal'', may no longer be reference directly in the text;
8188 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8191 * Pure: generic 'sym' attribute which declares a rule both as pure
8192 'elim?' and for the 'symmetric' operation;
8194 * Pure: marginal comments ``--'' may now occur just anywhere in the
8195 text; the fixed correlation with particular command syntax has been
8198 * Pure: new method 'rules' is particularly well-suited for proof
8199 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8200 but often produces more compact proof terms with less detours;
8202 * Pure/Provers/classical: simplified integration with pure rule
8203 attributes and methods; the classical "intro?/elim?/dest?"
8204 declarations coincide with the pure ones; the "rule" method no longer
8205 includes classically swapped intros; "intro" and "elim" methods no
8206 longer pick rules from the context; also got rid of ML declarations
8207 AddXIs/AddXEs/AddXDs; all of this has some potential for
8210 * Provers/classical: attribute 'swapped' produces classical inversions
8211 of introduction rules;
8213 * Provers/simplifier: 'simplified' attribute may refer to explicit
8214 rules instead of full simplifier context; 'iff' attribute handles
8217 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8219 * HOL: 'recdef' now fails on unfinished automated proofs, use
8220 "(permissive)" option to recover old behavior;
8222 * HOL: 'inductive' no longer features separate (collective) attributes
8223 for 'intros' (was found too confusing);
8225 * HOL: properly declared induction rules less_induct and
8231 * HOL: moved over to sane numeral syntax; the new policy is as
8234 - 0 and 1 are polymorphic constants, which are defined on any
8235 numeric type (nat, int, real etc.);
8237 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8238 binary representation internally;
8240 - type nat has special constructor Suc, and generally prefers Suc 0
8241 over 1::nat and Suc (Suc 0) over 2::nat;
8243 This change may cause significant problems of INCOMPATIBILITY; here
8244 are some hints on converting existing sources:
8246 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8247 entities, so expressions involving "-" (unary or binary minus) need
8248 to be spaced properly;
8250 - existing occurrences of "1" may need to be constraint "1::nat" or
8251 even replaced by Suc 0; similar for old "2";
8253 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8255 - remove all special provisions on numerals in proofs;
8257 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8258 representation (depends on bin_arith_simps in the default context);
8260 * HOL: symbolic syntax for x^2 (numeral 2);
8262 * HOL: the class of all HOL types is now called "type" rather than
8263 "term"; INCOMPATIBILITY, need to adapt references to this type class
8264 in axclass/classes, instance/arities, and (usually rare) occurrences
8265 in typings (of consts etc.); internally the class is called
8266 "HOL.type", ML programs should refer to HOLogic.typeS;
8268 * HOL/record package improvements:
8269 - new derived operations "fields" to build a partial record section,
8270 "extend" to promote a fixed record to a record scheme, and
8271 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8272 declared as simp by default;
8273 - shared operations ("more", "fields", etc.) now need to be always
8274 qualified) --- potential INCOMPATIBILITY;
8275 - removed "make_scheme" operations (use "make" with "extend") --
8277 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8278 - provides cases/induct rules for use with corresponding Isar
8279 methods (for concrete records, record schemes, concrete more
8280 parts, and schematic more parts -- in that order);
8281 - internal definitions directly based on a light-weight abstract
8282 theory of product types over typedef rather than datatype;
8284 * HOL: generic code generator for generating executable ML code from
8285 specifications; specific support for HOL constructs such as inductive
8286 datatypes and sets, as well as recursive functions; can be invoked
8287 via 'generate_code' theory section;
8289 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8291 * HOL: consolidated and renamed several theories. In particular:
8292 Ord.thy has been absorbed into HOL.thy
8293 String.thy has been absorbed into List.thy
8295 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8296 (beware of argument permutation!);
8298 * HOL: linorder_less_split superseded by linorder_cases;
8300 * HOL/List: "nodups" renamed to "distinct";
8302 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8303 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8304 - Ex_def has changed, now need to use some_eq_ex
8306 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8307 in this (rare) case use:
8309 delSWrapper "split_all_tac"
8310 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8312 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8315 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8316 Isabelle's type classes, ^ on functions and relations has too general
8317 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8318 necessary to attach explicit type constraints;
8320 * HOL/Relation: the prefix name of the infix "O" has been changed from
8321 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8322 renamed accordingly (eg "compI" -> "rel_compI").
8324 * HOL: syntax translations now work properly with numerals and records
8327 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8328 of "lam" -- INCOMPATIBILITY;
8330 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8331 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8332 renamed "Product_Type.unit";
8334 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8336 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8337 the "cases" method);
8339 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8342 * HOL/IMP: updated and converted to new-style theory format; several
8343 parts turned into readable document, with proper Isar proof texts and
8344 some explanations (by Gerwin Klein);
8346 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8348 * HOL-Hyperreal is now a logic image;
8353 * Isar: consts/constdefs supports mixfix syntax for continuous
8356 * Isar: domain package adapted to new-style theory format, e.g. see
8359 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8360 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8361 lift.induct_tac, always use UU instead of Undef;
8363 * HOLCF/IMP: updated and converted to new-style theory;
8368 * Isar: proper integration of logic-specific tools and packages,
8369 including theory commands '(co)inductive', '(co)datatype',
8370 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8371 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8373 * theory Main no longer includes AC; for the Axiom of Choice, base
8374 your theory on Main_ZFC;
8376 * the integer library now covers quotients and remainders, with many
8377 laws relating division to addition, multiplication, etc.;
8379 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8380 typeless version of the formalism;
8382 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8385 * ZF/Induct: new directory for examples of inductive definitions,
8386 including theory Multiset for multiset orderings; converted to
8387 new-style theory format;
8389 * ZF: many new theorems about lists, ordinals, etc.;
8394 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8395 variable proof controls level of detail: 0 = no proofs (only oracle
8396 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8397 also ref manual for further ML interfaces;
8399 * Pure/axclass: removed obsolete ML interface
8400 goal_subclass/goal_arity;
8402 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8403 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8404 separate tokens, so expressions involving minus need to be spaced
8407 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8408 rather than "infixl" or "infixr";
8410 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8411 sort constraint specifications in type inference; e.g. "x::_::foo"
8412 ensures that the type of "x" is of sort "foo" (but not necessarily a
8415 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8416 control output of nested => (types); the default behavior is
8419 * Pure/syntax: builtin parse translation for "_constify" turns valued
8420 tokens into AST constants;
8422 * Pure/syntax: prefer later declarations of translations and print
8423 translation functions; potential INCOMPATIBILITY: need to reverse
8424 multiple declarations for same syntax element constant;
8426 * Pure/show_hyps reset by default (in accordance to existing Isar
8429 * Provers/classical: renamed addaltern to addafter, addSaltern to
8432 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8435 * system: tested support for MacOS X; should be able to get Isabelle +
8436 Proof General to work in a plain Terminal after installing Poly/ML
8437 (e.g. from the Isabelle distribution area) and GNU bash alone
8438 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8439 support requires further installations, e.g. from
8440 http://fink.sourceforge.net/);
8442 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8444 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8445 of 40 MB), cf. ML_OPTIONS;
8447 * system: Proof General keywords specification is now part of the
8448 Isabelle distribution (see etc/isar-keywords.el);
8450 * system: support for persistent Proof General sessions (refrain from
8451 outdating all loaded theories on startup); user may create writable
8452 logic images like this: ``isabelle -q HOL Test'';
8454 * system: smart selection of Isabelle process versus Isabelle
8455 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8456 run both "isabelle" and "Isabelle" even if file names are badly
8457 damaged (executable inspects the case of the first letter of its own
8458 name); added separate "isabelle-process" and "isabelle-interface";
8460 * system: refrain from any attempt at filtering input streams; no
8461 longer support ``8bit'' encoding of old isabelle font, instead proper
8462 iso-latin characters may now be used; the related isatools
8463 "symbolinput" and "nonascii" have disappeared as well;
8465 * system: removed old "xterm" interface (the print modes "xterm" and
8466 "xterm_color" are still available for direct use in a suitable
8471 New in Isabelle99-2 (February 2001)
8472 -----------------------------------
8474 *** Overview of INCOMPATIBILITIES ***
8476 * HOL: please note that theories in the Library and elsewhere often use the
8477 new-style (Isar) format; to refer to their theorems in an ML script you must
8478 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8480 * HOL: inductive package no longer splits induction rule aggressively,
8481 but only as far as specified by the introductions given; the old
8482 format may be recovered via ML function complete_split_rule or attribute
8483 'split_rule (complete)';
8485 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8486 gfp_Tarski to gfp_unfold;
8488 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8490 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8491 relation); infix "^^" has been renamed "``"; infix "``" has been
8492 renamed "`"; "univalent" has been renamed "single_valued";
8494 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8497 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8499 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8501 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8502 consequence, it is no longer monotonic wrt. the local goal context
8503 (which is now passed through the inductive cases);
8505 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8506 \<gg> to \<ggreater>;
8509 *** Document preparation ***
8511 * \isabellestyle{NAME} selects version of Isabelle output (currently
8512 available: are "it" for near math-mode best-style output, "sl" for
8513 slanted text style, and "tt" for plain type-writer; if no
8514 \isabellestyle command is given, output is according to slanted
8517 * support sub/super scripts (for single symbols only), input syntax is
8518 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8520 * some more standard symbols; see Appendix A of the system manual for
8521 the complete list of symbols defined in isabellesym.sty;
8523 * improved isabelle style files; more abstract symbol implementation
8524 (should now use \isamath{...} and \isatext{...} in custom symbol
8527 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8528 state; Note that presentation of goal states does not conform to
8529 actual human-readable proof documents. Please do not include goal
8530 states into document output unless you really know what you are doing!
8532 * proper indentation of antiquoted output with proportional LaTeX
8535 * no_document ML operator temporarily disables LaTeX document
8538 * isatool unsymbolize tunes sources for plain ASCII communication;
8543 * Pure: Isar now suffers initial goal statements to contain unbound
8544 schematic variables (this does not conform to actual readable proof
8545 documents, due to unpredictable outcome and non-compositional proof
8546 checking); users who know what they are doing may use schematic goals
8547 for Prolog-style synthesis of proven results;
8549 * Pure: assumption method (an implicit finishing) now handles actual
8552 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8553 initial goal, declare "that" only as Pure intro (only for single
8554 steps); the "that" rule assumption may now be involved in implicit
8555 finishing, thus ".." becomes a feasible for trivial obtains;
8557 * Pure: default proof step now includes 'intro_classes'; thus trivial
8558 instance proofs may be performed by "..";
8560 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8563 * Pure: more robust selection of calculational rules;
8565 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8566 rule (as well as the assumption rule);
8568 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8569 lemmas, using the graph browser tool;
8571 * Pure: predict failure of "show" in interactive mode;
8573 * Pure: 'thms_containing' now takes actual terms as arguments;
8575 * HOL: improved method 'induct' --- now handles non-atomic goals
8576 (potential INCOMPATIBILITY); tuned error handling;
8578 * HOL: cases and induct rules now provide explicit hints about the
8579 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8580 any remaining facts are inserted into the goal verbatim;
8582 * HOL: local contexts (aka cases) may now contain term bindings as
8583 well; the 'cases' and 'induct' methods new provide a ?case binding for
8584 the result to be shown in each case;
8586 * HOL: added 'recdef_tc' command;
8588 * isatool convert assists in eliminating legacy ML scripts;
8593 * HOL/Library: a collection of generic theories to be used together
8594 with main HOL; the theory loader path already includes this directory
8595 by default; the following existing theories have been moved here:
8596 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8597 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8599 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8600 modelling and verification task performed in Isabelle/HOL +
8601 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8603 * HOL/Algebra: special summation operator SUM no longer exists, it has
8604 been replaced by setsum; infix 'assoc' now has priority 50 (like
8605 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8606 'domain', this makes the theory consistent with mathematical
8609 * HOL basics: added overloaded operations "inverse" and "divide"
8610 (infix "/"), syntax for generic "abs" operation, generic summation
8613 * HOL/typedef: simplified package, provide more useful rules (see also
8616 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8617 now expressed as a proper nested rule (old-style tactic scripts may
8618 require atomize_strip_tac to cope with non-atomic premises);
8620 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8621 to "split_conv" (old name still available for compatibility);
8623 * HOL: improved concrete syntax for strings (e.g. allows translation
8624 rules with string literals);
8626 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8627 and Fleuriot's mechanization of analysis, including the transcendental
8628 functions for the reals;
8630 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8635 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8636 "lam" is displayed as TWO lambda-symbols
8638 * CTT: theory Main now available, containing everything (that is, Bool
8644 * Pure: the Simplifier has been implemented properly as a derived rule
8645 outside of the actual kernel (at last!); the overall performance
8646 penalty in practical applications is about 50%, while reliability of
8647 the Isabelle inference kernel has been greatly improved;
8649 * print modes "brackets" and "no_brackets" control output of nested =>
8650 (types) and ==> (props); the default behaviour is "brackets";
8652 * Provers: fast_tac (and friends) now handle actual object-logic rules
8653 as assumptions as well;
8655 * system: support Poly/ML 4.0;
8657 * system: isatool install handles KDE version 1 or 2;
8661 New in Isabelle99-1 (October 2000)
8662 ----------------------------------
8664 *** Overview of INCOMPATIBILITIES ***
8666 * HOL: simplification of natural numbers is much changed; to partly
8667 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8668 issue the following ML commands:
8670 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8671 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8673 * HOL: simplification no longer dives into case-expressions; this is
8674 controlled by "t.weak_case_cong" for each datatype t;
8676 * HOL: nat_less_induct renamed to less_induct;
8678 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8679 fixsome to patch .thy and .ML sources automatically;
8681 select_equality -> some_equality
8682 select_eq_Ex -> some_eq_ex
8683 selectI2EX -> someI2_ex
8686 select1_equality -> some1_equality
8687 Eps_sym_eq -> some_sym_eq_trivial
8688 Eps_eq -> some_eq_trivial
8690 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8692 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8695 * HOL: the recursion equations generated by 'recdef' are now called
8696 f.simps instead of f.rules;
8698 * HOL: qed_spec_mp now also handles bounded ALL as well;
8700 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8701 sometimes be needed;
8703 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8705 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8707 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8708 product is now "<*>" instead of "Times"; the lexicographic product is
8709 now "<*lex*>" instead of "**";
8711 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8712 of main HOL, but was unused); better use HOL's datatype package;
8714 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8715 the old syntax may be recovered as follows:
8718 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8719 (infixl "\\<oplus>" 100)
8721 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8723 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8724 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8727 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8728 changed from A/r to A//r;
8730 * ZF: new treatment of arithmetic (nat & int) may break some old
8733 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8734 rulify -> rule_format, elimify -> elim_format, ...);
8736 * Isar/Provers: intro/elim/dest attributes changed; renamed
8737 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8738 should have to change intro!! to intro? only); replaced "delrule" by
8741 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8743 * Provers: strengthened force_tac by using new first_best_tac;
8745 * LaTeX document preparation: several changes of isabelle.sty (see
8749 *** Document preparation ***
8751 * formal comments (text blocks etc.) in new-style theories may now
8752 contain antiquotations of thm/prop/term/typ/text to be presented
8753 according to latex print mode; concrete syntax is like this:
8754 @{term[show_types] "f(x) = a + x"};
8756 * isatool mkdir provides easy setup of Isabelle session directories,
8757 including proper document sources;
8759 * generated LaTeX sources are now deleted after successful run
8760 (isatool document -c); may retain a copy somewhere else via -D option
8763 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8764 style files, achieving self-contained LaTeX sources and simplifying
8767 * old-style theories now produce (crude) LaTeX output as well;
8769 * browser info session directories are now self-contained (may be put
8770 on WWW server seperately); improved graphs of nested sessions; removed
8771 graph for 'all sessions';
8773 * several improvements in isabelle style files; \isabellestyle{it}
8774 produces fake math mode output; \isamarkupheader is now \section by
8775 default; see lib/texinputs/isabelle.sty etc.;
8780 * Isar/Pure: local results and corresponding term bindings are now
8781 subject to Hindley-Milner polymorphism (similar to ML); this
8782 accommodates incremental type-inference very nicely;
8784 * Isar/Pure: new derived language element 'obtain' supports
8785 generalized existence reasoning;
8787 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8788 support accumulation of results, without applying any rules yet;
8789 useful to collect intermediate results without explicit name
8790 references, and for use with transitivity rules with more than 2
8793 * Isar/Pure: scalable support for case-analysis type proofs: new
8794 'case' language element refers to local contexts symbolically, as
8795 produced by certain proof methods; internally, case names are attached
8796 to theorems as "tags";
8798 * Isar/Pure: theory command 'hide' removes declarations from
8799 class/type/const name spaces;
8801 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8802 indicate potential overloading;
8804 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8806 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8807 "{a,b,c}" instead of {a,b,c};
8809 * Isar/Pure now provides its own version of intro/elim/dest
8810 attributes; useful for building new logics, but beware of confusion
8811 with the version in Provers/classical;
8813 * Isar/Pure: the local context of (non-atomic) goals is provided via
8814 case name 'antecedent';
8816 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8817 to the current context is now done automatically);
8819 * Isar/Pure: theory command 'method_setup' provides a simple interface
8820 for definining proof methods in ML;
8822 * Isar/Provers: intro/elim/dest attributes changed; renamed
8823 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8824 most cases, one should have to change intro!! to intro? only);
8825 replaced "delrule" by "rule del";
8827 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8828 'symmetric' attribute (the latter supercedes [RS sym]);
8830 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8831 method modifier); 'simp' method: 'only:' modifier removes loopers as
8832 well (including splits);
8834 * Isar/Provers: Simplifier and Classical methods now support all kind
8835 of modifiers used in the past, including 'cong', 'iff', etc.
8837 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8838 of Simplifier and Classical reasoner);
8840 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8841 now support named cases; major packages (inductive, datatype, primrec,
8842 recdef) support case names and properly name parameters;
8844 * Isar/HOL: new transitivity rules for substitution in inequalities --
8845 monotonicity conditions are extracted to be proven at end of
8848 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8851 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8852 split_if split_if_asm; datatype package provides theorems foo.splits =
8853 foo.split foo.split_asm for each datatype;
8855 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8856 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8857 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8858 use "(cases (simplified))" method in proper proof texts);
8860 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8862 * Isar: names of theorems etc. may be natural numbers as well;
8864 * Isar: 'pr' command: optional arguments for goals_limit and
8865 ProofContext.prems_limit; no longer prints theory contexts, but only
8868 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8869 additional print modes to be specified; e.g. "pr(latex)" will print
8870 proof state according to the Isabelle LaTeX style;
8872 * Isar: improved support for emulating tactic scripts, including proof
8873 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8874 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8875 (for HOL datatypes);
8877 * Isar: simplified (more robust) goal selection of proof methods: 1st
8878 goal, all goals, or explicit goal specifier (tactic emulation); thus
8879 'proof method scripts' have to be in depth-first order;
8881 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8883 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8884 should instead use individual commands for printing items
8885 (print_commands, print_methods etc.);
8887 * Isar: added 'nothing' --- the empty list of theorems;
8892 * HOL/MicroJava: formalization of a fragment of Java, together with a
8893 corresponding virtual machine and a specification of its bytecode
8894 verifier and a lightweight bytecode verifier, including proofs of
8895 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8896 Cornelia Pusch (see also the homepage of project Bali at
8897 http://isabelle.in.tum.de/Bali/);
8899 * HOL/Algebra: new theory of rings and univariate polynomials, by
8902 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8903 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8906 * HOL/Lattice: fundamental concepts of lattice theory and order
8907 structures, including duals, properties of bounds versus algebraic
8908 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8909 Theorem for complete lattices etc.; may also serve as a demonstration
8910 for abstract algebraic reasoning using axiomatic type classes, and
8911 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8913 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8916 * HOL/IMPP: extension of IMP with local variables and mutually
8917 recursive procedures, by David von Oheimb;
8919 * HOL/Lambda: converted into new-style theory and document;
8921 * HOL/ex/Multiquote: example of multiple nested quotations and
8922 anti-quotations -- basically a generalized version of de-Bruijn
8923 representation; very useful in avoiding lifting of operations;
8925 * HOL/record: added general record equality rule to simpset; fixed
8926 select-update simplification procedure to handle extended records as
8927 well; admit "r" as field name;
8929 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8930 other numeric types and also as the identity of groups, rings, etc.;
8932 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8933 Types nat and int belong to this axclass;
8935 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8936 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8937 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8938 two terms #m*u and #n*u are replaced by #(m+n)*u
8939 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8940 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8941 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8943 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8944 powerful prover for predicate logic but knows nothing of clasets; see
8945 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8947 * HOL: new version of "case_tac" subsumes both boolean case split and
8948 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8949 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8951 * HOL: simplification no longer dives into case-expressions: only the
8952 selector expression is simplified, but not the remaining arms; to
8953 enable full simplification of case-expressions for datatype t, you may
8954 remove t.weak_case_cong from the simpset, either globally (Delcongs
8955 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8957 * HOL/recdef: the recursion equations generated by 'recdef' for
8958 function 'f' are now called f.simps instead of f.rules; if all
8959 termination conditions are proved automatically, these simplification
8960 rules are added to the simpset, as in primrec; rules may be named
8961 individually as well, resulting in a separate list of theorems for
8964 * HOL/While is a new theory that provides a while-combinator. It
8965 permits the definition of tail-recursive functions without the
8966 provision of a termination measure. The latter is necessary once the
8967 invariant proof rule for while is applied.
8969 * HOL: new (overloaded) notation for the set of elements below/above
8970 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8972 * HOL: theorems impI, allI, ballI bound as "strip";
8974 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8975 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8976 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8978 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8980 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8981 main HOL, but was unused);
8983 * HOL: fewer consts declared as global (e.g. have to refer to
8984 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8986 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8987 in case of overlap with user translations (e.g. judgements over
8988 tuples); (note that the underlying logical represenation is still
8994 * ZF: simplification automatically cancels common terms in arithmetic
8995 expressions over nat and int;
8997 * ZF: new treatment of nat to minimize type-checking: all operators
8998 coerce their operands to a natural number using the function natify,
8999 making the algebraic laws unconditional;
9001 * ZF: as above, for int: operators coerce their operands to an integer
9002 using the function intify;
9004 * ZF: the integer library now contains many of the usual laws for the
9005 orderings, including $<=, and monotonicity laws for $+ and $*;
9007 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9010 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9011 to the simplifier and classical reasoner simultaneously;
9016 * Provers: blast_tac now handles actual object-logic rules as
9017 assumptions; note that auto_tac uses blast_tac internally as well;
9019 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9020 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9022 * Provers: delrules now handles destruct rules as well (no longer need
9023 explicit make_elim);
9025 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9026 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9027 use instead the strong form,
9028 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9029 in HOL, FOL and ZF the function cla_make_elim will create such rules
9030 from destruct-rules;
9032 * Provers: Simplifier.easy_setup provides a fast path to basic
9033 Simplifier setup for new object-logics;
9035 * Pure: AST translation rules no longer require constant head on LHS;
9037 * Pure: improved name spaces: ambiguous output is qualified; support
9038 for hiding of names;
9040 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9041 XSYMBOL_HOME; no longer need to do manual configuration in most
9044 * system: compression of ML heaps images may now be controlled via -c
9045 option of isabelle and isatool usedir (currently only observed by
9048 * system: isatool installfonts may handle X-Symbol fonts as well (very
9049 useful for remote X11);
9051 * system: provide TAGS file for Isabelle sources;
9053 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9056 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9057 timing flag supersedes proof_timing and Toplevel.trace;
9059 * ML: new combinators |>> and |>>> for incremental transformations
9060 with secondary results (e.g. certain theory extensions):
9062 * ML: PureThy.add_defs gets additional argument to indicate potential
9063 overloading (usually false);
9065 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9070 New in Isabelle99 (October 1999)
9071 --------------------------------
9073 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9075 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9076 are no longer simplified. (This allows the simplifier to unfold recursive
9077 functional programs.) To restore the old behaviour, declare
9079 Delcongs [if_weak_cong];
9081 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9084 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9086 * HOL/datatype: mutual_induct_tac no longer exists --
9087 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9089 * HOL/typedef: fixed type inference for representing set; type
9090 arguments now have to occur explicitly on the rhs as type constraints;
9092 * ZF: The con_defs part of an inductive definition may no longer refer
9093 to constants declared in the same theory;
9095 * HOL, ZF: the function mk_cases, generated by the inductive
9096 definition package, has lost an argument. To simplify its result, it
9097 uses the default simpset instead of a supplied list of theorems.
9099 * HOL/List: the constructors of type list are now Nil and Cons;
9101 * Simplifier: the type of the infix ML functions
9102 setSSolver addSSolver setSolver addSolver
9103 is now simpset * solver -> simpset where `solver' is a new abstract type
9104 for packaging solvers. A solver is created via
9105 mk_solver: string -> (thm list -> int -> tactic) -> solver
9106 where the string argument is only a comment.
9111 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9112 decision procedure for linear arithmetic. Currently it is used for
9113 types `nat', `int', and `real' in HOL (see below); it can, should and
9114 will be instantiated for other types and logics as well.
9116 * The simplifier now accepts rewrite rules with flexible heads, eg
9117 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9118 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9124 * New Isabelle/Isar subsystem provides an alternative to traditional
9125 tactical theorem proving; together with the ProofGeneral/isar user
9126 interface it offers an interactive environment for developing human
9127 readable proof documents (Isar == Intelligible semi-automated
9128 reasoning); for further information see isatool doc isar-ref,
9129 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9131 * improved and simplified presentation of theories: better HTML markup
9132 (including colors), graph views in several sizes; isatool usedir now
9133 provides a proper interface for user theories (via -P option); actual
9134 document preparation based on (PDF)LaTeX is available as well (for
9135 new-style theories only); see isatool doc system for more information;
9137 * native support for Proof General, both for classic Isabelle and
9140 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9141 using the graph browser tool;
9143 * Isabelle manuals now also available as PDF;
9145 * theory loader rewritten from scratch (may not be fully
9146 bug-compatible); old loadpath variable has been replaced by show_path,
9147 add_path, del_path, reset_path functions; new operations such as
9148 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9151 * improved isatool install: option -k creates KDE application icon,
9152 option -p DIR installs standalone binaries;
9154 * added ML_PLATFORM setting (useful for cross-platform installations);
9155 more robust handling of platform specific ML images for SML/NJ;
9157 * the settings environment is now statically scoped, i.e. it is never
9158 created again in sub-processes invoked from isabelle, isatool, or
9161 * path element specification '~~' refers to '$ISABELLE_HOME';
9163 * in locales, the "assumes" and "defines" parts may be omitted if
9166 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9169 * new print_mode "HTML";
9171 * new flag show_tags controls display of tags of theorems (which are
9172 basically just comments that may be attached by some tools);
9174 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9175 mode and goal output format:
9177 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9179 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9181 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9182 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9184 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9186 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9188 * function bind_thms stores lists of theorems (cf. bind_thm);
9190 * new shorthand tactics ftac, eatac, datac, fatac;
9192 * qed (and friends) now accept "" as result name; in that case the
9193 theorem is not stored, but proper checks and presentation of the
9196 * theorem database now also indexes constants "Trueprop", "all",
9197 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9202 ** HOL arithmetic **
9204 * There are now decision procedures for linear arithmetic over nat and
9207 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9208 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9209 are treated as atomic; subformulae not involving type `nat' or `int'
9210 are ignored; quantified subformulae are ignored unless they are
9211 positive universal or negative existential. The tactic has to be
9212 invoked by hand and can be a little bit slow. In particular, the
9213 running time is exponential in the number of occurrences of `min' and
9214 `max', and `-' on `nat'.
9216 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9217 (negated) (in)equalities among the premises and the conclusion into
9218 account (i.e. no compound formulae) and does not know about `min' and
9219 `max', and `-' on `nat'. It is fast and is used automatically by the
9222 NB: At the moment, these decision procedures do not cope with mixed
9223 nat/int formulae where the two parts interact, such as `m < n ==>
9226 * HOL/Numeral provides a generic theory of numerals (encoded
9227 efficiently as bit strings); setup for types nat/int/real is in place;
9228 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9229 int, existing theories and proof scripts may require a few additional
9232 * integer division and remainder can now be performed on constant
9235 * many properties of integer multiplication, division and remainder
9238 * An interface to the Stanford Validity Checker (SVC) is available through the
9239 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9240 are proved automatically. SVC must be installed separately, and its results
9241 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9242 invocation of the underlying oracle). For SVC see
9243 http://verify.stanford.edu/SVC
9245 * IsaMakefile: the HOL-Real target now builds an actual image;
9250 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9251 (in Isabelle/Isar) -- by Gertrud Bauer;
9253 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9254 analysis for assembly languages with subtypes;
9256 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9257 -- avoids syntactic ambiguities and treats state, transition, and
9258 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9259 changed syntax and (many) tactics;
9261 * HOL/inductive: Now also handles more general introduction rules such
9262 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9263 theorems are now maintained within the theory (maintained via the
9266 * HOL/datatype: Now also handles arbitrarily branching datatypes
9267 (using function types) such as
9269 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9271 * HOL/record: record_simproc (part of the default simpset) takes care
9272 of selectors applied to updated records; record_split_tac is no longer
9273 part of the default claset; update_defs may now be removed from the
9274 simpset in many cases; COMPATIBILITY: old behavior achieved by
9276 claset_ref () := claset() addSWrapper record_split_wrapper;
9277 Delsimprocs [record_simproc]
9279 * HOL/typedef: fixed type inference for representing set; type
9280 arguments now have to occur explicitly on the rhs as type constraints;
9282 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9283 names rather than an ML expression;
9285 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9286 supplied later. Program schemes can be defined, such as
9287 "While B C s = (if B s then While B C (C s) else s)"
9288 where the well-founded relation can be chosen after B and C have been given.
9290 * HOL/List: the constructors of type list are now Nil and Cons;
9291 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9292 course, ML tools referring to List.list.op # etc. have to be adapted;
9294 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9295 disabled by default; run isabelle with option -m HOL to get back to
9296 the original Gordon/HOL-style output;
9298 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9299 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9301 * HOL basic syntax simplified (more orthogonal): all variants of
9302 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9303 Eps operator is provided as well: "SOME x. P[x]";
9305 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9307 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9308 thus available for user theories;
9310 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9311 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9314 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9315 several times and then mp;
9320 * the notation <<...>> is now available as a notation for sequences of
9323 * the simplifier is now installed
9325 * the axiom system has been generalized (thanks to Soren Heilmann)
9327 * the classical reasoner now has a default rule database
9332 * new primrec section allows primitive recursive functions to be given
9333 directly (as in HOL) over datatypes and the natural numbers;
9335 * new tactics induct_tac and exhaust_tac for induction (or case
9336 analysis) over datatypes and the natural numbers;
9338 * the datatype declaration of type T now defines the recursor T_rec;
9340 * simplification automatically does freeness reasoning for datatype
9343 * automatic type-inference, with AddTCs command to insert new
9344 type-checking rules;
9346 * datatype introduction rules are now added as Safe Introduction rules
9349 * the syntax "if P then x else y" is now available in addition to
9353 *** Internal programming interfaces ***
9355 * tuned simplifier trace output; new flag debug_simp;
9357 * structures Vartab / Termtab (instances of TableFun) offer efficient
9358 tables indexed by indexname_ord / term_ord (compatible with aconv);
9360 * AxClass.axclass_tac lost the theory argument;
9362 * tuned current_goals_markers semantics: begin / end goal avoids
9363 printing empty lines;
9365 * removed prs and prs_fn hook, which was broken because it did not
9366 include \n in its semantics, forcing writeln to add one
9367 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9368 string -> unit if you really want to output text without newline;
9370 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9371 plain output, interface builders may have to enable 'isabelle_font'
9372 mode to get Isabelle font glyphs as before;
9374 * refined token_translation interface; INCOMPATIBILITY: output length
9375 now of type real instead of int;
9377 * theory loader actions may be traced via new ThyInfo.add_hook
9378 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9379 your own database of information attached to *whole* theories -- as
9380 opposed to intra-theory data slots offered via TheoryDataFun;
9382 * proper handling of dangling sort hypotheses (at last!);
9383 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9384 extra sort hypotheses that can be witnessed from the type signature;
9385 the force_strip_shyps flag is gone, any remaining shyps are simply
9386 left in the theorem (with a warning issued by strip_shyps_warning);
9390 New in Isabelle98-1 (October 1998)
9391 ----------------------------------
9393 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9395 * several changes of automated proof tools;
9397 * HOL: major changes to the inductive and datatype packages, including
9398 some minor incompatibilities of theory syntax;
9400 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9403 * HOL: removed duplicate thms in Arith:
9404 less_imp_add_less should be replaced by trans_less_add1
9405 le_imp_add_le should be replaced by trans_le_add1
9407 * HOL: unary minus is now overloaded (new type constraints may be
9410 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9411 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9412 now taken as an integer constant.
9414 * Pure: ML function 'theory_of' renamed to 'theory';
9420 1. Asm_full_simp_tac is now more aggressive.
9421 1. It will sometimes reorient premises if that increases their power to
9423 2. It does no longer proceed strictly from left to right but may also
9424 rotate premises to achieve further simplification.
9425 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9426 old Asm_full_simp_tac in that it does not rotate premises.
9427 2. The simplifier now knows a little bit about nat-arithmetic.
9429 * Classical reasoner: wrapper mechanism for the classical reasoner now
9430 allows for selected deletion of wrappers, by introduction of names for
9431 wrapper functionals. This implies that addbefore, addSbefore,
9432 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9433 and that adding two tactics with the same name overwrites the first
9434 one (emitting a warning).
9435 type wrapper = (int -> tactic) -> (int -> tactic)
9436 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9437 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9438 delWrapper, delSWrapper: claset * string -> claset
9439 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9441 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9442 semantics; addbefore now affects only the unsafe part of step_tac
9443 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9444 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9447 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9448 compWrapper; added safe wrapper (and access functions for it);
9450 * HOL/split_all_tac is now much faster and fails if there is nothing
9451 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9452 and the names of the automatically generated variables have changed.
9453 split_all_tac has moved within claset() from unsafe wrappers to safe
9454 wrappers, which means that !!-bound variables are split much more
9455 aggressively, and safe_tac and clarify_tac now split such variables.
9456 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9457 Note: the same holds for record_split_tac, which does the job of
9458 split_all_tac for record fields.
9460 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9461 permanently to the default simpset using Addsplits just like
9462 Addsimps. They can be removed via Delsplits just like
9463 Delsimps. Lower-case versions are also available.
9465 * HOL/Simplifier: The rule split_if is now part of the default
9466 simpset. This means that the simplifier will eliminate all occurrences
9467 of if-then-else in the conclusion of a goal. To prevent this, you can
9468 either remove split_if completely from the default simpset by
9469 `Delsplits [split_if]' or remove it in a specific call of the
9470 simplifier using `... delsplits [split_if]'. You can also add/delete
9471 other case splitting rules to/from the default simpset: every datatype
9472 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9473 t is the name of the datatype).
9475 * Classical reasoner / Simplifier combination: new force_tac (and
9476 derivatives Force_tac, force) combines rewriting and classical
9477 reasoning (and whatever other tools) similarly to auto_tac, but is
9478 aimed to solve the given subgoal completely.
9483 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9484 and `goalw': the theory is no longer needed as an explicit argument -
9485 the current theory context is used; assumptions are no longer returned
9486 at the ML-level unless one of them starts with ==> or !!; it is
9487 recommended to convert to these new commands using isatool fixgoal
9488 (backup your sources first!);
9490 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9491 the current theory context, and 'theory' to lookup stored theories;
9493 * new theory section 'locale' for declaring constants, assumptions and
9494 definitions that have local scope;
9496 * new theory section 'nonterminals' for purely syntactic types;
9498 * new theory section 'setup' for generic ML setup functions
9499 (e.g. package initialization);
9501 * the distribution now includes Isabelle icons: see
9502 lib/logo/isabelle-{small,tiny}.xpm;
9504 * isatool install - install binaries with absolute references to
9507 * isatool logo -- create instances of the Isabelle logo (as EPS);
9509 * print mode 'emacs' reserved for Isamode;
9511 * support multiple print (ast) translations per constant name;
9513 * theorems involving oracles are now printed with a suffixed [!];
9518 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9520 * HOL/inductive package reorganized and improved: now supports mutual
9526 oddI "n : EVEN ==> Suc n : ODD"
9527 evenI "n : ODD ==> Suc n : EVEN"
9529 new theorem list "elims" contains an elimination rule for each of the
9530 recursive sets; inductive definitions now handle disjunctive premises
9531 correctly (also ZF);
9533 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9534 "mutual_induct" no longer exists - the induction rule is always
9535 contained in "induct";
9538 * HOL/datatype package re-implemented and greatly improved: now
9539 supports mutually recursive datatypes such as
9542 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9543 | SUM ('a aexp) ('a aexp)
9544 | DIFF ('a aexp) ('a aexp)
9547 'a bexp = LESS ('a aexp) ('a aexp)
9548 | AND ('a bexp) ('a bexp)
9549 | OR ('a bexp) ('a bexp)
9551 as well as indirectly recursive datatypes such as
9554 ('a, 'b) term = Var 'a
9555 | App 'b ((('a, 'b) term) list)
9557 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9558 induction on mutually / indirectly recursive datatypes.
9560 Primrec equations are now stored in theory and can be accessed via
9561 <function_name>.simps.
9565 - Theories using datatypes must now have theory Datatype as an
9567 - The specific <typename>.induct_tac no longer exists - use the
9568 generic induct_tac instead.
9569 - natE has been renamed to nat.exhaust - use exhaust_tac
9570 instead of res_inst_tac ... natE. Note that the variable
9571 names in nat.exhaust differ from the names in natE, this
9572 may cause some "fragile" proofs to fail.
9573 - The theorems split_<typename>_case and split_<typename>_case_asm
9574 have been renamed to <typename>.split and <typename>.split_asm.
9575 - Since default sorts of type variables are now handled correctly,
9576 some datatype definitions may have to be annotated with explicit
9578 - Primrec definitions no longer require function name and type
9579 of recursive argument.
9581 Consider using isatool fixdatatype to adapt your theories and proof
9582 scripts to the new package (backup your sources first!).
9585 * HOL/record package: considerably improved implementation; now
9586 includes concrete syntax for record types, terms, updates; theorems
9587 for surjective pairing and splitting !!-bound record variables; proof
9588 support is as follows:
9590 1) standard conversions (selectors or updates applied to record
9591 constructor terms) are part of the standard simpset;
9593 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9594 made part of standard simpset and claset via addIffs;
9596 3) a tactic for record field splitting (record_split_tac) is part of
9597 the standard claset (addSWrapper);
9599 To get a better idea about these rules you may retrieve them via
9600 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9601 the name of your record type.
9603 The split tactic 3) conceptually simplifies by the following rule:
9605 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9607 Thus any record variable that is bound by meta-all will automatically
9608 blow up into some record constructor term, consequently the
9609 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9610 solve record problems automatically.
9613 * reorganized the main HOL image: HOL/Integ and String loaded by
9614 default; theory Main includes everything;
9616 * automatic simplification of integer sums and comparisons, using cancellation;
9618 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9620 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9622 * many new identities for unions, intersections, set difference, etc.;
9624 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9625 called split_if, split_split, split_sum_case and split_nat_case (to go
9626 with add/delsplits);
9628 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9629 (?x::unit) = (); this is made part of the default simpset, which COULD
9630 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9631 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9632 unit_abs_eta_conv is added in order to counter the effect of
9633 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9636 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9639 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9640 It and 'sym RS equals0D' are now in the default claset, giving automatic
9641 disjointness reasoning but breaking a few old proofs.
9643 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9644 to 'converse' from 'inverse' (for compatibility with ZF and some
9647 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9648 the well-founded relation;
9650 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9651 Compl A. The "Compl" syntax remains available as input syntax for this
9654 * HOL/Update: new theory of function updates:
9655 f(a:=b) == %x. if x=a then b else f x
9656 may also be iterated as in f(a:=b,c:=d,...);
9658 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9661 - new function list_update written xs[i:=v] that updates the i-th
9662 list position. May also be iterated as in xs[i:=a,j:=b,...].
9663 - new function `upt' written [i..j(] which generates the list
9664 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9665 bound write [i..j], which is a shorthand for [i..j+1(].
9666 - new lexicographic orderings and corresponding wellfoundedness theorems.
9669 - removed 'pred' (predecessor) function;
9670 - generalized some theorems about n-1;
9671 - many new laws about "div" and "mod";
9672 - new laws about greatest common divisors (see theory ex/Primes);
9674 * HOL/Relation: renamed the relational operator r^-1 "converse"
9675 instead of "inverse";
9677 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9678 of the multiset ordering;
9680 * directory HOL/Real: a construction of the reals using Dedekind cuts
9681 (not included by default);
9683 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9685 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9686 programs, i.e. different program variables may have different types.
9688 * calling (stac rew i) now fails if "rew" has no effect on the goal
9689 [previously, this check worked only if the rewrite rule was unconditional]
9690 Now rew can involve either definitions or equalities (either == or =).
9695 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9696 only the theorems proved on ZF.ML;
9698 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9699 It and 'sym RS equals0D' are now in the default claset, giving automatic
9700 disjointness reasoning but breaking a few old proofs.
9702 * ZF/Update: new theory of function updates
9703 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9704 may also be iterated as in f(a:=b,c:=d,...);
9706 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9708 * calling (stac rew i) now fails if "rew" has no effect on the goal
9709 [previously, this check worked only if the rewrite rule was unconditional]
9710 Now rew can involve either definitions or equalities (either == or =).
9712 * case_tac provided for compatibility with HOL
9713 (like the old excluded_middle_tac, but with subgoals swapped)
9716 *** Internal programming interfaces ***
9718 * Pure: several new basic modules made available for general use, see
9719 also src/Pure/README;
9721 * improved the theory data mechanism to support encapsulation (data
9722 kind name replaced by private Object.kind, acting as authorization
9723 key); new type-safe user interface via functor TheoryDataFun; generic
9724 print_data function becomes basically useless;
9726 * removed global_names compatibility flag -- all theory declarations
9727 are qualified by default;
9729 * module Pure/Syntax now offers quote / antiquote translation
9730 functions (useful for Hoare logic etc. with implicit dependencies);
9731 see HOL/ex/Antiquote for an example use;
9733 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9736 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9739 * Display.print_goals function moved to Locale.print_goals;
9741 * standard print function for goals supports current_goals_markers
9742 variable for marking begin of proof, end of proof, start of goal; the
9743 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9744 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9749 New in Isabelle98 (January 1998)
9750 --------------------------------
9752 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9754 * changed lexical syntax of terms / types: dots made part of long
9755 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9757 * simpset (and claset) reference variable replaced by functions
9758 simpset / simpset_ref;
9760 * no longer supports theory aliases (via merge) and non-trivial
9761 implicit merge of thms' signatures;
9763 * most internal names of constants changed due to qualified names;
9765 * changed Pure/Sequence interface (see Pure/seq.ML);
9768 *** General Changes ***
9770 * hierachically structured name spaces (for consts, types, axms, thms
9771 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9772 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9773 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9774 long_names for fully qualified output names; NOTE: ML programs
9775 (special tactics, packages etc.) referring to internal names may have
9776 to be adapted to cope with fully qualified names; in case of severe
9777 backward campatibility problems try setting 'global_names' at compile
9778 time to have enrything declared within a flat name space; one may also
9779 fine tune name declarations in theories via the 'global' and 'local'
9782 * reimplemented the implicit simpset and claset using the new anytype
9783 data filed in signatures; references simpset:simpset ref etc. are
9784 replaced by functions simpset:unit->simpset and
9785 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9786 to patch your ML files accordingly;
9788 * HTML output now includes theory graph data for display with Java
9789 applet or isatool browser; data generated automatically via isatool
9790 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9792 * defs may now be conditional; improved rewrite_goals_tac to handle
9793 conditional equations;
9795 * defs now admits additional type arguments, using TYPE('a) syntax;
9797 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9798 creates a new theory node; implicit merge of thms' signatures is
9799 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9800 transfer:theory->thm->thm in (rare) cases;
9802 * improved handling of draft signatures / theories; draft thms (and
9803 ctyps, cterms) are automatically promoted to real ones;
9805 * slightly changed interfaces for oracles: admit many per theory, named
9806 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9808 * print_goals: optional output of const types (set show_consts and
9811 * improved output of warnings (###) and errors (***);
9813 * subgoal_tac displays a warning if the new subgoal has type variables;
9815 * removed old README and Makefiles;
9817 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9819 * removed obsolete init_pps and init_database;
9821 * deleted the obsolete tactical STATE, which was declared by
9822 fun STATE tacfun st = tacfun st st;
9824 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9825 (which abbreviates $HOME);
9827 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9828 use isatool fixseq to adapt your ML programs (this works for fully
9829 qualified references to the Sequence structure only!);
9831 * use_thy no longer requires writable current directory; it always
9832 reloads .ML *and* .thy file, if either one is out of date;
9835 *** Classical Reasoner ***
9837 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9838 tactics that use classical reasoning to simplify a subgoal without
9839 splitting it into several subgoals;
9841 * Safe_tac: like safe_tac but uses the default claset;
9846 * added simplification meta rules:
9847 (asm_)(full_)simplify: simpset -> thm -> thm;
9849 * simplifier.ML no longer part of Pure -- has to be loaded by object
9852 * added prems argument to simplification procedures;
9854 * HOL, FOL, ZF: added infix function `addsplits':
9855 instead of `<simpset> setloop (split_tac <thms>)'
9856 you can simply write `<simpset> addsplits <thms>'
9861 * TYPE('a) syntax for type reflection terms;
9863 * no longer handles consts with name "" -- declare as 'syntax' instead;
9865 * pretty printer: changed order of mixfix annotation preference (again!);
9867 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9872 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9873 with `addloop' of the simplifier to faciliate case splitting in premises.
9875 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9877 * HOL/Auth: new protocol proofs including some for the Internet
9880 * HOL/Map: new theory of `maps' a la VDM;
9882 * HOL/simplifier: simplification procedures nat_cancel_sums for
9883 cancelling out common nat summands from =, <, <= (in)equalities, or
9884 differences; simplification procedures nat_cancel_factor for
9885 cancelling common factor from =, <, <= (in)equalities over natural
9886 sums; nat_cancel contains both kinds of procedures, it is installed by
9887 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9889 * HOL/simplifier: terms of the form
9890 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9892 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9893 and those of the form
9894 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9896 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9899 Each datatype `t' now comes with a theorem `split_t_case' of the form
9901 P(t_case f1 ... fn x) =
9902 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9904 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9907 and a theorem `split_t_case_asm' of the form
9909 P(t_case f1 ... fn x) =
9910 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9912 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9914 which can be added to a simpset via `addsplits'. The existing theorems
9915 expand_list_case and expand_option_case have been renamed to
9916 split_list_case and split_option_case.
9919 - `pred n' is automatically converted to `n-1'.
9920 Users are strongly encouraged not to use `pred' any longer,
9921 because it will disappear altogether at some point.
9922 - Users are strongly encouraged to write "0 < n" rather than
9923 "n ~= 0". Theorems and proof tools have been modified towards this
9927 the function "set_of_list" has been renamed "set" (and its theorems too);
9928 the function "nth" now takes its arguments in the reverse order and
9929 has acquired the infix notation "!" as in "xs!n".
9931 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9933 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9934 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9936 * HOL/record: extensible records with schematic structural subtyping
9937 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9938 still lacks various theorems and concrete record syntax;
9943 * removed "axioms" and "generated by" sections;
9945 * replaced "ops" section by extended "consts" section, which is capable of
9946 handling the continuous function space "->" directly;
9949 . proves theorems immediately and stores them in the theory,
9950 . creates hierachical name space,
9951 . now uses normal mixfix annotations (instead of cinfix...),
9952 . minor changes to some names and values (for consistency),
9953 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9954 . separator between mutual domain defs: changed "," to "and",
9955 . improved handling of sort constraints; now they have to
9956 appear on the left-hand side of the equations only;
9958 * fixed LAM <x,y,zs>.b syntax;
9960 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9961 adm (%x. P (t x)), where P is chainfinite and t continuous;
9966 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9967 with `addloop' of the simplifier to faciliate case splitting in premises.
9969 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9970 in HOL, they strip ALL and --> from proved theorems;
9974 New in Isabelle94-8 (May 1997)
9975 ------------------------------
9977 *** General Changes ***
9979 * new utilities to build / run / maintain Isabelle etc. (in parts
9980 still somewhat experimental); old Makefiles etc. still functional;
9982 * new 'Isabelle System Manual';
9984 * INSTALL text, together with ./configure and ./build scripts;
9986 * reimplemented type inference for greater efficiency, better error
9987 messages and clean internal interface;
9989 * prlim command for dealing with lots of subgoals (an easier way of
9990 setting goals_limit);
9995 * supports alternative (named) syntax tables (parser and pretty
9996 printer); internal interface is provided by add_modesyntax(_i);
9998 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9999 be used in conjunction with the Isabelle symbol font; uses the
10000 "symbols" syntax table;
10002 * added token_translation interface (may translate name tokens in
10003 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10004 the current print_mode); IMPORTANT: user print translation functions
10005 are responsible for marking newly introduced bounds
10006 (Syntax.mark_boundT);
10008 * token translations for modes "xterm" and "xterm_color" that display
10009 names in bold, underline etc. or colors (which requires a color
10012 * infixes may now be declared with names independent of their syntax;
10014 * added typed_print_translation (like print_translation, but may
10015 access type of constant);
10018 *** Classical Reasoner ***
10020 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10021 some limitations. Blast_tac...
10022 + ignores addss, addbefore, addafter; this restriction is intrinsic
10023 + ignores elimination rules that don't have the correct format
10024 (the conclusion MUST be a formula variable)
10025 + ignores types, which can make HOL proofs fail
10026 + rules must not require higher-order unification, e.g. apply_type in ZF
10027 [message "Function Var's argument not a bound variable" relates to this]
10028 + its proof strategy is more general but can actually be slower
10030 * substitution with equality assumptions no longer permutes other
10033 * minor changes in semantics of addafter (now called addaltern); renamed
10034 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10035 (and access functions for it);
10037 * improved combination of classical reasoner and simplifier:
10038 + functions for handling clasimpsets
10039 + improvement of addss: now the simplifier is called _after_ the
10041 + safe variant of addss called addSss: uses safe simplifications
10042 _during_ the safe steps. It is more complete as it allows multiple
10043 instantiations of unknowns (e.g. with slow_tac).
10047 * added interface for simplification procedures (functions that
10048 produce *proven* rewrite rules on the fly, depending on current
10051 * ordering on terms as parameter (used for ordered rewriting);
10053 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10055 * the solver is now split into a safe and an unsafe part.
10056 This should be invisible for the normal user, except that the
10057 functions setsolver and addsolver have been renamed to setSolver and
10058 addSolver; added safe_asm_full_simp_tac;
10063 * a generic induction tactic `induct_tac' which works for all datatypes and
10064 also for type `nat';
10066 * a generic case distinction tactic `exhaust_tac' which works for all
10067 datatypes and also for type `nat';
10069 * each datatype comes with a function `size';
10071 * patterns in case expressions allow tuple patterns as arguments to
10072 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10074 * primrec now also works with type nat;
10076 * recdef: a new declaration form, allows general recursive functions to be
10077 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10079 * the constant for negation has been renamed from "not" to "Not" to
10080 harmonize with FOL, ZF, LK, etc.;
10082 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10085 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10087 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10088 problems in commutative rings, using axiomatic type classes for + and *;
10090 * more examples in HOL/MiniML and HOL/Auth;
10092 * more default rewrite rules for quantifiers, union/intersection;
10094 * a new constant `arbitrary == @x.False';
10096 * HOLCF/IOA replaces old HOL/IOA;
10098 * HOLCF changes: derived all rules and arities
10099 + axiomatic type classes instead of classes
10100 + typedef instead of faking type definitions
10101 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10102 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10103 + eliminated the types void, one, tr
10104 + use unit lift and bool lift (with translations) instead of one and tr
10105 + eliminated blift from Lift3.thy (use Def instead of blift)
10106 all eliminated rules are derived as theorems --> no visible changes ;
10111 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10112 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10113 as ZF_cs addSIs [equalityI];
10117 New in Isabelle94-7 (November 96)
10118 ---------------------------------
10120 * allowing negative levels (as offsets) in prlev and choplev;
10122 * super-linear speedup for large simplifications;
10124 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10125 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10126 FAIL); can suppress it using the command Delsimps (ex_simps @
10127 all_simps); De Morgan laws are also now included, by default;
10129 * improved printing of ==> : ~:
10131 * new object-logic "Sequents" adds linear logic, while replacing LK
10132 and Modal (thanks to Sara Kalvala);
10134 * HOL/Auth: correctness proofs for authentication protocols;
10136 * HOL: new auto_tac combines rewriting and classical reasoning (many
10137 examples on HOL/Auth);
10139 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10140 the rewriter and classical reasoner simultaneously;
10142 * function uresult no longer returns theorems in "standard" format;
10143 regain previous version by: val uresult = standard o uresult;
10147 New in Isabelle94-6
10148 -------------------
10150 * oracles -- these establish an interface between Isabelle and trusted
10151 external reasoners, which may deliver results as theorems;
10153 * proof objects (in particular record all uses of oracles);
10155 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10157 * "constdefs" section in theory files;
10159 * "primrec" section (HOL) no longer requires names;
10161 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10165 New in Isabelle94-5
10166 -------------------
10168 * reduced space requirements;
10170 * automatic HTML generation from theories;
10172 * theory files no longer require "..." (quotes) around most types;
10174 * new examples, including two proofs of the Church-Rosser theorem;
10176 * non-curried (1994) version of HOL is no longer distributed;
10180 New in Isabelle94-4
10181 -------------------
10183 * greatly reduced space requirements;
10185 * theory files (.thy) no longer require \...\ escapes at line breaks;
10187 * searchable theorem database (see the section "Retrieving theorems" on
10188 page 8 of the Reference Manual);
10190 * new examples, including Grabczewski's monumental case study of the
10193 * The previous version of HOL renamed to Old_HOL;
10195 * The new version of HOL (previously called CHOL) uses a curried syntax
10196 for functions. Application looks like f a b instead of f(a,b);
10198 * Mutually recursive inductive definitions finally work in HOL;
10200 * In ZF, pattern-matching on tuples is now available in all abstractions and
10201 translates to the operator "split";
10205 New in Isabelle94-3
10206 -------------------
10208 * new infix operator, addss, allowing the classical reasoner to
10209 perform simplification at each step of its search. Example:
10210 fast_tac (cs addss ss)
10212 * a new logic, CHOL, the same as HOL, but with a curried syntax
10213 for functions. Application looks like f a b instead of f(a,b). Also pairs
10214 look like (a,b) instead of <a,b>;
10216 * PLEASE NOTE: CHOL will eventually replace HOL!
10218 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10219 It translates to the operator "split". A new theory of integers is available;
10221 * In ZF, integer numerals now denote two's-complement binary integers.
10222 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10224 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10225 of the Axiom of Choice;
10229 New in Isabelle94-2
10230 -------------------
10232 * Significantly faster resolution;
10234 * the different sections in a .thy file can now be mixed and repeated
10237 * Database of theorems for FOL, HOL and ZF. New
10238 commands including qed, qed_goal and bind_thm store theorems in the database.
10240 * Simple database queries: return a named theorem (get_thm) or all theorems of
10241 a given theory (thms_of), or find out what theory a theorem was proved in
10244 * Bugs fixed in the inductive definition and datatype packages;
10246 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10247 and HOL_dup_cs obsolete;
10249 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10252 * Simpler definition of function space in ZF;
10254 * new results about cardinal and ordinal arithmetic in ZF;
10256 * 'subtype' facility in HOL for introducing new types as subsets of existing
10259 :mode=text:wrap=hard:maxLineLen=72: