1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2013 (February 2013)
5 -----------------------------------
9 * Theorem status about oracles and unfinished/failed future proofs is
10 no longer printed by default, since it is incompatible with
11 incremental / parallel checking of the persistent document model. ML
12 function Thm.peek_status may be used to inspect a snapshot of the
13 ongoing evaluation process. Note that in batch mode --- notably
14 isabelle build --- the system ensures that future proofs of all
15 accessible theorems in the theory context are finished (as before).
17 * Configuration option show_markup controls direct inlining of markup
18 into the printed representation of formal entities --- notably type
19 and sort constraints. This enables Prover IDE users to retrieve that
20 information via tooltips in the output window, for example.
22 * Command 'ML_file' evaluates ML text from a file directly within the
23 theory, without any predeclaration via 'uses' in the theory header.
25 * Old command 'use' command and corresponding keyword 'uses' in the
26 theory header are legacy features and will be discontinued soon.
27 Tools that load their additional source files may imitate the
28 'ML_file' implementation, such that the system can take care of
29 dependencies properly.
31 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
32 is called fastforce / fast_force_tac already since Isabelle2011-1.
34 * Updated and extended "isar-ref" and "implementation" manual, reduced
35 remaining material in old "ref" manual.
37 * Improved support for auxiliary contexts that indicate block structure
38 for specifications. Nesting of "context fixes ... context assumes ..."
39 and "class ... context ...".
41 * Attribute "consumes" allows a negative value as well, which is
42 interpreted relatively to the total number of premises of the rule in
43 the target context. This form of declaration is stable when exported
44 from a nested 'context' with additional assumptions. It is the
45 preferred form for definitional packages, notably cases/rules produced
46 in HOL/inductive and HOL/function.
48 * More informative error messages for Isar proof commands involving
49 lazy enumerations (method applications etc.).
51 * Refined 'help' command to retrieve outer syntax commands according
52 to name patterns (with clickable results).
55 *** Prover IDE -- Isabelle/Scala/jEdit ***
57 * Parallel terminal proofs ('by') are enabled by default, likewise
58 proofs that are built into packages like 'datatype', 'function'. This
59 allows to "run ahead" checking the theory specifications on the
60 surface, while the prover is still crunching on internal
61 justifications. Unfinished / cancelled proofs are restarted as
62 required to complete full proof checking eventually.
64 * Improved output panel with tooltips, hyperlinks etc. based on the
65 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
66 tooltips leads to some window that supports the same recursively,
67 which can lead to stacks of tooltips as the semantic document content
68 is explored. ESCAPE closes the whole stack, individual windows may be
69 closed separately, or detached to become independent jEdit dockables.
71 * Improved support for commands that produce graph output: the text
72 message contains a clickable area to open a new instance of the graph
75 * More robust incremental parsing of outer syntax (partial comments,
76 malformed symbols). Changing the balance of open/close quotes and
77 comment delimiters works more conveniently with unfinished situations
78 that frequently occur in user interaction.
80 * More efficient painting and improved reactivity when editing large
81 files. More scalable management of formal document content.
83 * Smarter handling of tracing messages: prover process pauses after
84 certain number of messages per command transaction, with some user
85 dialog to stop or continue. This avoids swamping the front-end with
86 potentially infinite message streams.
88 * More plugin options and preferences, based on Isabelle/Scala. The
89 jEdit plugin option panel provides access to some Isabelle/Scala
90 options, including tuning parameters for editor reactivity and color
93 * Dockable window "Symbols" provides some editing support for Isabelle
96 * Dockable window "Monitor" shows ML runtime statistics. Note that
97 continuous display of the chart slows down the system.
99 * Improved editing support for control styles: subscript, superscript,
100 bold, reset of style -- operating on single symbols or text
101 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
103 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
104 adjust the main text area font size, and its derivatives for output,
105 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
106 need to be adapted to local keyboard layouts.
108 * More reactive completion popup by default: use \t (TAB) instead of
109 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
110 also "Plugin Options / SideKick / General / Code Completion Options".
112 * Implicit check and build dialog of the specified logic session
113 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
114 demand, without bundling big platform-dependent heap images in the
115 Isabelle distribution.
117 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
118 from Oracle provide better multi-platform experience. This version is
119 now bundled exclusively with Isabelle.
124 * Code generation for Haskell: restrict unqualified imports from
125 Haskell Prelude to a small set of fundamental operations.
127 * Command 'export_code': relative file names are interpreted
128 relatively to master directory of current theory rather than the
129 rather arbitrary current working directory. INCOMPATIBILITY.
131 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
132 use regular rule composition via "OF" / "THEN", or explicit proof
133 structure instead. Note that Isabelle/ML provides a variety of
134 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
135 with some care where this is really required.
137 * Command 'typ' supports an additional variant with explicit sort
138 constraint, to infer and check the most general type conforming to a
139 given sort. Example (in HOL):
141 typ "_ * _ * bool * unit" :: finite
143 * Command 'locale_deps' visualizes all locales and their relations as
151 - Added MaSh relevance filter based on machine-learning; see the
152 Sledgehammer manual for details.
153 - Polished Isar proofs generated with "isar_proofs" option.
154 - Rationalized type encodings ("type_enc" option).
155 - Renamed "kill_provers" subcommand to "kill_all".
157 isar_proof ~> isar_proofs
158 isar_shrink_factor ~> isar_shrink
159 max_relevant ~> max_facts
160 relevance_thresholds ~> fact_thresholds
162 * Quickcheck: added an optimisation for equality premises. It is
163 switched on by default, and can be switched off by setting the
164 configuration quickcheck_optimise_equality to false.
166 * Quotient: only one quotient can be defined by quotient_type
170 - generation of an abstraction function equation in lift_definition
172 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
174 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
177 * Preprocessing of the code generator rewrites set comprehensions into
178 pointfree expressions.
180 * The SMT solver Z3 has now by default a restricted set of directly
181 supported features. For the full set of features (div/mod, nonlinear
182 arithmetic, datatypes/records) with potential proof reconstruction
183 failures, enable the configuration option "z3_with_extensions". Minor
186 * Simplified 'typedef' specifications: historical options for implicit
187 set definition and alternative name have been discontinued. The
188 former behavior of "typedef (open) t = A" is now the default, but
189 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
192 * Removed constant "chars"; prefer "Enum.enum" on type "char"
193 directly. INCOMPATIBILITY.
195 * Moved operation product, sublists and n_lists from theory Enum to
196 List. INCOMPATIBILITY.
198 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
200 * Class "comm_monoid_diff" formalises properties of bounded
201 subtraction, with natural numbers and multisets as typical instances.
203 * Added combinator "Option.these" with type "'a option set => 'a set".
205 * Theory "Transitive_Closure": renamed lemmas
207 reflcl_tranclp -> reflclp_tranclp
208 rtranclp_reflcl -> rtranclp_reflclp
212 * Theory "Rings": renamed lemmas (in class semiring)
214 left_distrib ~> distrib_right
215 right_distrib ~> distrib_left
219 * Generalized the definition of limits:
221 - Introduced the predicate filterlim (LIM x F. f x :> G) which
222 expresses that when the input values x converge to F then the
223 output f x converges to G.
225 - Added filters for convergence to positive (at_top) and negative
228 - Moved infinity in the norm (at_infinity) from
229 Multivariate_Analysis to Complex_Main.
231 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
236 * Theory "Library/Option_ord" provides instantiation of option type to
237 lattice type classes.
239 * Theory "Library/Multiset": renamed
241 constant fold_mset ~> Multiset.fold
242 fact fold_mset_commute ~> fold_mset_comm
246 * Renamed theory Library/List_Prefix to Library/Sublist, with related
249 - Renamed constants (and related lemmas)
252 strict_prefix ~> prefix
254 - Replaced constant "postfix" by "suffixeq" with swapped argument
255 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
256 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
257 Renamed lemmas accordingly.
259 - Added constant "list_hembeq" for homeomorphic embedding on
260 lists. Added abbreviation "sublisteq" for special case
261 "list_hembeq (op =)".
263 - Theory Library/Sublist no longer provides "order" and "bot" type
264 class instances for the prefix order (merely corresponding locale
265 interpretations). The type class instances are now in theory
266 Library/Prefix_Order.
268 - The sublist relation of theory Library/Sublist_Order is now based
269 on "Sublist.sublisteq". Renamed lemmas accordingly:
271 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
272 le_list_append_mono ~> Sublist.list_hembeq_append_mono
273 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
274 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
275 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
276 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
277 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
278 le_list_drop_many ~> Sublist.sublisteq_drop_many
279 le_list_filter_left ~> Sublist.sublisteq_filter_left
280 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
281 le_list_rev_take_iff ~> Sublist.sublisteq_append
282 le_list_same_length ~> Sublist.sublisteq_same_length
283 le_list_take_many_iff ~> Sublist.sublisteq_append'
284 less_eq_list.drop ~> less_eq_list_drop
285 less_eq_list.induct ~> less_eq_list_induct
286 not_le_list_length ~> Sublist.not_sublisteq_length
290 * New theory Library/Countable_Set.
292 * Theory Library/Debug and Library/Parallel provide debugging and
293 parallel execution for code generated towards Isabelle/ML.
295 * Theory Library/FuncSet: Extended support for Pi and extensional and
296 introduce the extensional dependent function space "PiE". Replaced
297 extensional_funcset by an abbreviation, and renamed lemmas from
298 extensional_funcset to PiE as follows:
300 extensional_empty ~> PiE_empty
301 extensional_funcset_empty_domain ~> PiE_empty_domain
302 extensional_funcset_empty_range ~> PiE_empty_range
303 extensional_funcset_arb ~> PiE_arb
304 extensional_funcset_mem ~> PiE_mem
305 extensional_funcset_extend_domainI ~> PiE_fun_upd
306 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
307 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
308 card_extensional_funcset ~> card_PiE
309 finite_extensional_funcset ~> finite_PiE
313 * Theory Library/FinFun: theory of almost everywhere constant
314 functions (supersedes the AFP entry "Code Generation for Functions as
317 * Theory Library/Phantom: generic phantom type to make a type
318 parameter appear in a constant's type. This alternative to adding
319 TYPE('a) as another parameter avoids unnecessary closures in generated
322 * Theory Library/RBT_Impl: efficient construction of red-black trees
323 from sorted associative lists. Merging two trees with rbt_union may
324 return a structurally different tree than before. Potential
327 * Theory Library/IArray: immutable arrays with code generation.
329 * Theory Library/Finite_Lattice: theory of finite lattices.
331 * HOL/Multivariate_Analysis: replaced
333 "basis :: 'a::euclidean_space => nat => real"
334 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
336 on euclidean spaces by using the inner product "_ \<bullet> _" with
337 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
338 "SUM i : Basis. f i * r i".
340 With this change the following constants are also changed or removed:
342 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
343 a $$ i ~> inner a i (where i : Basis)
345 \<pi>, \<pi>' removed
347 Theorems about these constants where removed.
351 component_le_norm ~> Basis_le_norm
352 euclidean_eq ~> euclidean_eq_iff
353 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
354 euclidean_simps ~> inner_simps
355 independent_basis ~> independent_Basis
356 span_basis ~> span_Basis
357 in_span_basis ~> in_span_Basis
358 norm_bound_component_le ~> norm_boound_Basis_le
359 norm_bound_component_lt ~> norm_boound_Basis_lt
360 component_le_infnorm ~> Basis_le_infnorm
366 - Added simproc "measurable" to automatically prove measurability.
368 - Added induction rules for sigma sets with disjoint union
369 (sigma_sets_induct_disjoint) and for Borel-measurable functions
370 (borel_measurable_induct).
372 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
375 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
376 AFP entry "Ordinals_and_Cardinals").
378 * HOL/BNF: New (co)datatype package based on bounded natural functors
379 with support for mixed, nested recursion and interesting non-free
382 * HOL/Finite_Set and Relation: added new set and relation operations
383 expressed by Finite_Set.fold.
385 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
386 trees for the code generator.
388 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
390 possible INCOMPATIBILITY.
392 * HOL/Set: renamed Set.project -> Set.filter
396 *** Document preparation ***
398 * Dropped legacy antiquotations "term_style" and "thm_style", since
399 styles may be given as arguments to "term" and "thm" already.
400 Discontinued legacy styles "prem1" .. "prem19".
402 * Default LaTeX rendering for \<euro> is now based on eurosym package,
403 instead of slightly exotic babel/greek.
405 * Document variant NAME may use different LaTeX entry point
406 document/root_NAME.tex if that file exists, instead of the common
409 * Simplified custom document/build script, instead of old-style
410 document/IsaMakefile. Minor INCOMPATIBILITY.
415 * The default limit for maximum number of worker threads is now 8,
416 instead of 4, in correspondence to capabilities of contemporary
417 hardware and Poly/ML runtime system.
419 * Type Seq.results and related operations support embedded error
420 messages within lazy enumerations, and thus allow to provide
421 informative errors in the absence of any usable results.
423 * Renamed Position.str_of to Position.here to emphasize that this is a
424 formal device to inline positions into message text, but not
425 necessarily printing visible text.
430 * Advanced support for Isabelle sessions and build management, see
431 "system" manual for the chapter of that name, especially the "isabelle
432 build" tool and its examples. The "isabelle mkroot" tool prepares
433 session root directories for use with "isabelle build", similar to
434 former "isabelle mkdir" for "isabelle usedir". Note that this affects
435 document preparation as well. INCOMPATIBILITY, isabelle usedir /
436 mkdir / make are rendered obsolete.
438 * Discontinued obsolete Isabelle/build script, it is superseded by the
439 regular isabelle build tool. For example:
441 isabelle build -s -b HOL
443 * Discontinued obsolete "isabelle makeall".
445 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
446 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
447 provides some traditional targets that invoke "isabelle build". Note
448 that this is inefficient! Applications of Isabelle/HOL involving
449 "isabelle make" should be upgraded to use "isabelle build" directly.
451 * The "isabelle options" tool prints Isabelle system options, as
452 required for "isabelle build", for example.
454 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
455 Minor INCOMPATIBILITY in command-line options.
457 * The "isabelle install" tool has now a simpler command-line. Minor
460 * The "isabelle components" tool helps to resolve add-on components
461 that are not bundled, or referenced from a bare-bones repository
464 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
465 platform family: "linux", "macos", "windows".
467 * The ML system is configured as regular component, and no longer
468 picked up from some surrounding directory. Potential INCOMPATIBILITY
469 for home-made settings.
471 * Improved ML runtime statistics (heap, threads, future tasks etc.).
473 * Discontinued support for Poly/ML 5.2.1, which was the last version
474 without exception positions and advanced ML compiler/toplevel
477 * Discontinued special treatment of Proof General -- no longer guess
478 PROOFGENERAL_HOME based on accidental file-system layout. Minor
479 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
480 settings manually, or use a Proof General version that has been
481 bundled as Isabelle component.
485 New in Isabelle2012 (May 2012)
486 ------------------------------
490 * Prover IDE (PIDE) improvements:
492 - more robust Sledgehammer integration (as before the sledgehammer
493 command-line needs to be typed into the source buffer)
494 - markup for bound variables
495 - markup for types of term variables (displayed as tooltips)
496 - support for user-defined Isar commands within the running session
497 - improved support for Unicode outside original 16bit range
498 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
500 * Forward declaration of outer syntax keywords within the theory
501 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
502 commands to be used in the same theory where defined.
504 * Auxiliary contexts indicate block structure for specifications with
505 additional parameters and assumptions. Such unnamed contexts may be
506 nested within other targets, like 'theory', 'locale', 'class',
507 'instantiation' etc. Results from the local context are generalized
508 accordingly and applied to the enclosing target context. Example:
512 assumes xy: "x = y" and yz: "y = z"
515 lemma my_trans: "x = z" using xy yz by simp
521 The most basic application is to factor-out context elements of
522 several fixes/assumes/shows theorem statements, e.g. see
523 ~~/src/HOL/Isar_Examples/Group_Context.thy
525 Any other local theory specification element works within the "context
526 ... begin ... end" block as well.
528 * Bundled declarations associate attributed fact expressions with a
529 given name in the context. These may be later included in other
530 contexts. This allows to manage context extensions casually, without
531 the logical dependencies of locales and locale interpretation. See
532 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
534 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
535 declaration, and results are standardized before being stored. Thus
536 old-style "standard" after instantiation or composition of facts
537 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
538 indices of schematic variables.
540 * Rule attributes in local theory declarations (e.g. locale or class)
541 are now statically evaluated: the resulting theorem is stored instead
542 of the original expression. INCOMPATIBILITY in rare situations, where
543 the historic accident of dynamic re-evaluation in interpretations
546 * New tutorial "Programming and Proving in Isabelle/HOL"
547 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
548 Structured Isar Proofs" ("isar-overview"), which has been removed. It
549 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
550 Logic" as the recommended beginners tutorial, but does not cover all
551 of the material of that old tutorial.
553 * Updated and extended reference manuals: "isar-ref",
554 "implementation", "system"; reduced remaining material in old "ref"
560 * Command 'definition' no longer exports the foundational "raw_def"
561 into the user context. Minor INCOMPATIBILITY, may use the regular
562 "def" result with attribute "abs_def" to imitate the old version.
564 * Attribute "abs_def" turns an equation of the form "f x y == t" into
565 "f == %x y. t", which ensures that "simp" or "unfold" steps always
566 expand it. This also works for object-logic equality. (Formerly
567 undocumented feature.)
569 * Sort constraints are now propagated in simultaneous statements, just
570 like type constraints. INCOMPATIBILITY in rare situations, where
571 distinct sorts used to be assigned accidentally. For example:
573 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
575 lemma "P (x::'a)" and "Q (y::'a::bar)"
576 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
578 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
579 tolerant against multiple unifiers, as long as the final result is
580 unique. (As before, rules are composed in canonical right-to-left
581 order to accommodate newly introduced premises.)
583 * Renamed some inner syntax categories:
589 Minor INCOMPATIBILITY. Note that in practice "num_const" or
590 "num_position" etc. are mainly used instead (which also include
591 position information via constraints).
593 * Simplified configuration options for syntax ambiguity: see
594 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
595 manual. Minor INCOMPATIBILITY.
597 * Discontinued configuration option "syntax_positions": atomic terms
598 in parse trees are always annotated by position constraints.
600 * Old code generator for SML and its commands 'code_module',
601 'code_library', 'consts_code', 'types_code' have been discontinued.
602 Use commands of the generic code generator instead. INCOMPATIBILITY.
604 * Redundant attribute "code_inline" has been discontinued. Use
605 "code_unfold" instead. INCOMPATIBILITY.
607 * Dropped attribute "code_unfold_post" in favor of the its dual
608 "code_abbrev", which yields a common pattern in definitions like
610 definition [code_abbrev]: "f = t"
614 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
615 instead. INCOMPATIBILITY.
617 * Discontinued old "prems" fact, which used to refer to the accidental
618 collection of foundational premises in the context (already marked as
619 legacy since Isabelle2011).
624 * Type 'a set is now a proper type constructor (just as before
625 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
626 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
627 sets separate, it is often sufficient to rephrase some set S that has
628 been accidentally used as predicates by "%x. x : S", and some
629 predicate P that has been accidentally used as set by "{x. P x}".
630 Corresponding proofs in a first step should be pruned from any
631 tinkering with former theorems mem_def and Collect_def as far as
634 For developments which deliberately mix predicates and sets, a
635 planning step is necessary to determine what should become a predicate
636 and what a set. It can be helpful to carry out that step in
637 Isabelle2011-1 before jumping right into the current release.
639 * Code generation by default implements sets as container type rather
640 than predicates. INCOMPATIBILITY.
642 * New type synonym 'a rel = ('a * 'a) set
644 * The representation of numerals has changed. Datatype "num"
645 represents strictly positive binary numerals, along with functions
646 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
647 positive and negated numeric literals, respectively. See also
648 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
649 user theories may require adaptations as follows:
651 - Theorems with number_ring or number_semiring constraints: These
652 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
654 - Theories defining numeric types: Remove number, number_semiring,
655 and number_ring instances. Defer all theorems about numerals until
656 after classes one and semigroup_add have been instantiated.
658 - Numeral-only simp rules: Replace each rule having a "number_of v"
659 pattern with two copies, one for numeral and one for neg_numeral.
661 - Theorems about subclasses of semiring_1 or ring_1: These classes
662 automatically support numerals now, so more simp rules and
663 simprocs may now apply within the proof.
665 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
666 Redefine using other integer operations.
668 * Transfer: New package intended to generalize the existing
669 "descending" method and related theorem attributes from the Quotient
670 package. (Not all functionality is implemented yet, but future
671 development will focus on Transfer as an eventual replacement for the
672 corresponding parts of the Quotient package.)
674 - transfer_rule attribute: Maintains a collection of transfer rules,
675 which relate constants at two different types. Transfer rules may
676 relate different type instances of the same polymorphic constant,
677 or they may relate an operation on a raw type to a corresponding
678 operation on an abstract type (quotient or subtype). For example:
680 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
681 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
683 - transfer method: Replaces a subgoal on abstract types with an
684 equivalent subgoal on the corresponding raw types. Constants are
685 replaced with corresponding ones according to the transfer rules.
686 Goals are generalized over all free variables by default; this is
687 necessary for variables whose types change, but can be overridden
688 for specific variables with e.g. "transfer fixing: x y z". The
689 variant transfer' method allows replacing a subgoal with one that
690 is logically stronger (rather than equivalent).
692 - relator_eq attribute: Collects identity laws for relators of
693 various type constructors, e.g. "list_all2 (op =) = (op =)". The
694 transfer method uses these lemmas to infer transfer rules for
695 non-polymorphic constants on the fly.
697 - transfer_prover method: Assists with proving a transfer rule for a
698 new constant, provided the constant is defined in terms of other
699 constants that already have transfer rules. It should be applied
700 after unfolding the constant definitions.
702 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
703 from type nat to type int.
705 * Lifting: New package intended to generalize the quotient_definition
706 facility of the Quotient package; designed to work with Transfer.
708 - lift_definition command: Defines operations on an abstract type in
709 terms of a corresponding operation on a representation
710 type. Example syntax:
712 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
715 Users must discharge a respectfulness proof obligation when each
716 constant is defined. (For a type copy, i.e. a typedef with UNIV,
717 the proof is discharged automatically.) The obligation is
718 presented in a user-friendly, readable form; a respectfulness
719 theorem in the standard format and a transfer rule are generated
722 - Integration with code_abstype: For typedefs (e.g. subtypes
723 corresponding to a datatype invariant, such as dlist),
724 lift_definition generates a code certificate theorem and sets up
725 code generation for each constant.
727 - setup_lifting command: Sets up the Lifting package to work with a
728 user-defined type. The user must provide either a quotient theorem
729 or a type_definition theorem. The package configures transfer
730 rules for equality and quantifiers on the type, and sets up the
731 lift_definition command to work with the type.
733 - Usage examples: See Quotient_Examples/Lift_DList.thy,
734 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
735 Word/Word.thy and Library/Float.thy.
739 - The 'quotient_type' command now supports a 'morphisms' option with
740 rep and abs functions, similar to typedef.
742 - 'quotient_type' sets up new types to work with the Lifting and
743 Transfer packages, as with 'setup_lifting'.
745 - The 'quotient_definition' command now requires the user to prove a
746 respectfulness property at the point where the constant is
747 defined, similar to lift_definition; INCOMPATIBILITY.
749 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
750 accordingly, INCOMPATIBILITY.
752 * New diagnostic command 'find_unused_assms' to find potentially
753 superfluous assumptions in theorems using Quickcheck.
757 - Quickcheck returns variable assignments as counterexamples, which
758 allows to reveal the underspecification of functions under test.
759 For example, refuting "hd xs = x", it presents the variable
760 assignment xs = [] and x = a1 as a counterexample, assuming that
761 any property is false whenever "hd []" occurs in it.
763 These counterexample are marked as potentially spurious, as
764 Quickcheck also returns "xs = []" as a counterexample to the
765 obvious theorem "hd xs = hd xs".
767 After finding a potentially spurious counterexample, Quickcheck
768 continues searching for genuine ones.
770 By default, Quickcheck shows potentially spurious and genuine
771 counterexamples. The option "genuine_only" sets quickcheck to only
772 show genuine counterexamples.
774 - The command 'quickcheck_generator' creates random and exhaustive
775 value generators for a given type and operations.
777 It generates values by using the operations as if they were
778 constructors of that type.
780 - Support for multisets.
782 - Added "use_subtype" options.
784 - Added "quickcheck_locale" configuration to specify how to process
785 conjectures in a locale context.
787 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
788 and affecting 'rat' and 'real'.
791 - Integrated more tightly with SPASS, as described in the ITP 2012
792 paper "More SPASS with Isabelle".
793 - Made it try "smt" as a fallback if "metis" fails or times out.
794 - Added support for the following provers: Alt-Ergo (via Why3 and
795 TFF1), iProver, iProver-Eq.
796 - Sped up the minimizer.
797 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
798 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
799 - Renamed "sound" option to "strict".
801 * Metis: Added possibility to specify lambda translations scheme as a
802 parenthesized argument (e.g., "by (metis (lifting) ...)").
804 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
806 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
808 * New "case_product" attribute to generate a case rule doing multiple
809 case distinctions at the same time. E.g.
811 list.exhaust [case_product nat.exhaust]
813 produces a rule which can be used to perform case distinction on both
816 * New "eventually_elim" method as a generalized variant of the
817 eventually_elim* rules. Supports structured proofs.
819 * Typedef with implicit set definition is considered legacy. Use
820 "typedef (open)" form instead, which will eventually become the
823 * Record: code generation can be switched off manually with
825 declare [[record_coden = false]] -- "default true"
827 * Datatype: type parameters allow explicit sort constraints.
829 * Concrete syntax for case expressions includes constraints for source
830 positions, and thus produces Prover IDE markup for its bindings.
831 INCOMPATIBILITY for old-style syntax translations that augment the
832 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
835 * Clarified attribute "mono_set": pure declaration without modifying
836 the result of the fact expression.
838 * More default pred/set conversions on a couple of relation operations
839 and predicates. Added powers of predicate relations. Consolidation
840 of some relation theorems:
842 converse_def ~> converse_unfold
843 rel_comp_def ~> relcomp_unfold
844 symp_def ~> (modified, use symp_def and sym_def instead)
845 transp_def ~> transp_trans
846 Domain_def ~> Domain_unfold
847 Range_def ~> Domain_converse [symmetric]
849 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
851 See theory "Relation" for examples for making use of pred/set
852 conversions by means of attributes "to_set" and "to_pred".
856 * Renamed facts about the power operation on relations, i.e., relpow
857 to match the constant's name:
859 rel_pow_1 ~> relpow_1
860 rel_pow_0_I ~> relpow_0_I
861 rel_pow_Suc_I ~> relpow_Suc_I
862 rel_pow_Suc_I2 ~> relpow_Suc_I2
863 rel_pow_0_E ~> relpow_0_E
864 rel_pow_Suc_E ~> relpow_Suc_E
865 rel_pow_E ~> relpow_E
866 rel_pow_Suc_D2 ~> relpow_Suc_D2
867 rel_pow_Suc_E2 ~> relpow_Suc_E2
868 rel_pow_Suc_D2' ~> relpow_Suc_D2'
869 rel_pow_E2 ~> relpow_E2
870 rel_pow_add ~> relpow_add
871 rel_pow_commute ~> relpow
872 rel_pow_empty ~> relpow_empty:
873 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
874 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
875 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
876 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
877 rel_pow_fun_conv ~> relpow_fun_conv
878 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
879 rel_pow_finite_bounded ~> relpow_finite_bounded
880 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
881 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
882 single_valued_rel_pow ~> single_valued_relpow
886 * Theory Relation: Consolidated constant name for relation composition
887 and corresponding theorem names:
889 - Renamed constant rel_comp to relcomp.
891 - Dropped abbreviation pred_comp. Use relcompp instead.
895 rel_compI ~> relcompI
896 rel_compEpair ~> relcompEpair
897 rel_compE ~> relcompE
898 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
899 rel_comp_empty1 ~> relcomp_empty1
900 rel_comp_mono ~> relcomp_mono
901 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
902 rel_comp_distrib ~> relcomp_distrib
903 rel_comp_distrib2 ~> relcomp_distrib2
904 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
905 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
906 single_valued_rel_comp ~> single_valued_relcomp
907 rel_comp_def ~> relcomp_unfold
908 converse_rel_comp ~> converse_relcomp
909 pred_compI ~> relcomppI
910 pred_compE ~> relcomppE
911 pred_comp_bot1 ~> relcompp_bot1
912 pred_comp_bot2 ~> relcompp_bot2
913 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
914 pred_comp_mono ~> relcompp_mono
915 pred_comp_distrib ~> relcompp_distrib
916 pred_comp_distrib2 ~> relcompp_distrib2
917 converse_pred_comp ~> converse_relcompp
919 finite_rel_comp ~> finite_relcomp
921 set_rel_comp ~> set_relcomp
925 * Theory Divides: Discontinued redundant theorems about div and mod.
926 INCOMPATIBILITY, use the corresponding generic theorems instead.
928 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
929 zdiv_self ~> div_self
930 zmod_self ~> mod_self
933 zdiv_zmod_equality ~> div_mod_equality2
934 zdiv_zmod_equality2 ~> div_mod_equality
935 zmod_zdiv_trivial ~> mod_div_trivial
936 zdiv_zminus_zminus ~> div_minus_minus
937 zmod_zminus_zminus ~> mod_minus_minus
938 zdiv_zminus2 ~> div_minus_right
939 zmod_zminus2 ~> mod_minus_right
940 zdiv_minus1_right ~> div_minus1_right
941 zmod_minus1_right ~> mod_minus1_right
942 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
943 zmod_zmult1_eq ~> mod_mult_right_eq
944 zpower_zmod ~> power_mod
946 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
947 mod_mult_distrib ~> mult_mod_left
948 mod_mult_distrib2 ~> mult_mod_right
950 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
951 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
953 * Finite_Set.fold now qualified. INCOMPATIBILITY.
955 * Consolidated theorem names concerning fold combinators:
957 inf_INFI_fold_inf ~> inf_INF_fold_inf
958 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
959 INFI_fold_inf ~> INF_fold_inf
960 SUPR_fold_sup ~> SUP_fold_sup
961 union_set ~> union_set_fold
962 minus_set ~> minus_set_fold
963 INFI_set_fold ~> INF_set_fold
964 SUPR_set_fold ~> SUP_set_fold
965 INF_code ~> INF_set_foldr
966 SUP_code ~> SUP_set_foldr
967 foldr.simps ~> foldr.simps (in point-free formulation)
968 foldr_fold_rev ~> foldr_conv_fold
969 foldl_fold ~> foldl_conv_fold
970 foldr_foldr ~> foldr_conv_foldl
971 foldl_foldr ~> foldl_conv_foldr
972 fold_set_remdups ~> fold_set_fold_remdups
973 fold_set ~> fold_set_fold
974 fold1_set ~> fold1_set_fold
978 * Dropped rarely useful theorems concerning fold combinators:
979 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
980 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
981 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
982 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
983 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
984 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
985 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
986 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
987 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
988 unfolding "foldr_conv_fold" and "foldl_conv_fold".
990 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
991 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
992 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
993 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
994 lemmas over fold rather than foldr, or make use of lemmas
995 fold_conv_foldr and fold_rev.
997 * Congruence rules Option.map_cong and Option.bind_cong for recursion
998 through option types.
1000 * "Transitive_Closure.ntrancl": bounded transitive closure on
1003 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1005 * Theory Int: Discontinued many legacy theorems specific to type int.
1006 INCOMPATIBILITY, use the corresponding generic theorems instead.
1008 zminus_zminus ~> minus_minus
1009 zminus_0 ~> minus_zero
1010 zminus_zadd_distrib ~> minus_add_distrib
1011 zadd_commute ~> add_commute
1012 zadd_assoc ~> add_assoc
1013 zadd_left_commute ~> add_left_commute
1016 zadd_0 ~> add_0_left
1017 zadd_0_right ~> add_0_right
1018 zadd_zminus_inverse2 ~> left_minus
1019 zmult_zminus ~> mult_minus_left
1020 zmult_commute ~> mult_commute
1021 zmult_assoc ~> mult_assoc
1022 zadd_zmult_distrib ~> left_distrib
1023 zadd_zmult_distrib2 ~> right_distrib
1024 zdiff_zmult_distrib ~> left_diff_distrib
1025 zdiff_zmult_distrib2 ~> right_diff_distrib
1026 zmult_1 ~> mult_1_left
1027 zmult_1_right ~> mult_1_right
1028 zle_refl ~> order_refl
1029 zle_trans ~> order_trans
1030 zle_antisym ~> order_antisym
1031 zle_linear ~> linorder_linear
1032 zless_linear ~> linorder_less_linear
1033 zadd_left_mono ~> add_left_mono
1034 zadd_strict_right_mono ~> add_strict_right_mono
1035 zadd_zless_mono ~> add_less_le_mono
1036 int_0_less_1 ~> zero_less_one
1037 int_0_neq_1 ~> zero_neq_one
1039 zpower_zadd_distrib ~> power_add
1040 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1041 zero_le_zpower_abs ~> zero_le_power_abs
1043 * Theory Deriv: Renamed
1045 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1047 * Theory Library/Multiset: Improved code generation of multisets.
1049 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1050 are expressed via type classes again. The special syntax
1051 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1052 setsum_set, which is now subsumed by Big_Operators.setsum.
1055 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1056 use theory HOL/Library/Nat_Bijection instead.
1058 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1059 trees is now inside a type class context. Names of affected
1060 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1061 theories working directly with raw red-black trees, adapt the names as
1065 bulkload -> rbt_bulkload
1066 del_from_left -> rbt_del_from_left
1067 del_from_right -> rbt_del_from_right
1069 delete -> rbt_delete
1071 insert -> rbt_insert
1072 insertw -> rbt_insert_with
1073 insert_with_key -> rbt_insert_with_key
1074 map_entry -> rbt_map_entry
1075 lookup -> rbt_lookup
1076 sorted -> rbt_sorted
1077 tree_greater -> rbt_greater
1078 tree_less -> rbt_less
1079 tree_less_symbol -> rbt_less_symbol
1081 union_with -> rbt_union_with
1082 union_with_key -> rbt_union_with_key
1085 balance_left_sorted -> balance_left_rbt_sorted
1086 balance_left_tree_greater -> balance_left_rbt_greater
1087 balance_left_tree_less -> balance_left_rbt_less
1088 balance_right_sorted -> balance_right_rbt_sorted
1089 balance_right_tree_greater -> balance_right_rbt_greater
1090 balance_right_tree_less -> balance_right_rbt_less
1091 balance_sorted -> balance_rbt_sorted
1092 balance_tree_greater -> balance_rbt_greater
1093 balance_tree_less -> balance_rbt_less
1094 bulkload_is_rbt -> rbt_bulkload_is_rbt
1095 combine_sorted -> combine_rbt_sorted
1096 combine_tree_greater -> combine_rbt_greater
1097 combine_tree_less -> combine_rbt_less
1098 delete_in_tree -> rbt_delete_in_tree
1099 delete_is_rbt -> rbt_delete_is_rbt
1100 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1101 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1102 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1103 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1104 del_in_tree -> rbt_del_in_tree
1105 del_inv1_inv2 -> rbt_del_inv1_inv2
1106 del_sorted -> rbt_del_rbt_sorted
1107 del_tree_greater -> rbt_del_rbt_greater
1108 del_tree_less -> rbt_del_rbt_less
1109 dom_lookup_Branch -> dom_rbt_lookup_Branch
1110 entries_lookup -> entries_rbt_lookup
1111 finite_dom_lookup -> finite_dom_rbt_lookup
1112 insert_sorted -> rbt_insert_rbt_sorted
1113 insertw_is_rbt -> rbt_insertw_is_rbt
1114 insertwk_is_rbt -> rbt_insertwk_is_rbt
1115 insertwk_sorted -> rbt_insertwk_rbt_sorted
1116 insertw_sorted -> rbt_insertw_rbt_sorted
1117 ins_sorted -> ins_rbt_sorted
1118 ins_tree_greater -> ins_rbt_greater
1119 ins_tree_less -> ins_rbt_less
1120 is_rbt_sorted -> is_rbt_rbt_sorted
1121 lookup_balance -> rbt_lookup_balance
1122 lookup_bulkload -> rbt_lookup_rbt_bulkload
1123 lookup_delete -> rbt_lookup_rbt_delete
1124 lookup_Empty -> rbt_lookup_Empty
1125 lookup_from_in_tree -> rbt_lookup_from_in_tree
1126 lookup_in_tree -> rbt_lookup_in_tree
1127 lookup_ins -> rbt_lookup_ins
1128 lookup_insert -> rbt_lookup_rbt_insert
1129 lookup_insertw -> rbt_lookup_rbt_insertw
1130 lookup_insertwk -> rbt_lookup_rbt_insertwk
1131 lookup_keys -> rbt_lookup_keys
1132 lookup_map -> rbt_lookup_map
1133 lookup_map_entry -> rbt_lookup_rbt_map_entry
1134 lookup_tree_greater -> rbt_lookup_rbt_greater
1135 lookup_tree_less -> rbt_lookup_rbt_less
1136 lookup_union -> rbt_lookup_rbt_union
1137 map_entry_color_of -> rbt_map_entry_color_of
1138 map_entry_inv1 -> rbt_map_entry_inv1
1139 map_entry_inv2 -> rbt_map_entry_inv2
1140 map_entry_is_rbt -> rbt_map_entry_is_rbt
1141 map_entry_sorted -> rbt_map_entry_rbt_sorted
1142 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1143 map_entry_tree_less -> rbt_map_entry_rbt_less
1144 map_tree_greater -> map_rbt_greater
1145 map_tree_less -> map_rbt_less
1146 map_sorted -> map_rbt_sorted
1147 paint_sorted -> paint_rbt_sorted
1148 paint_lookup -> paint_rbt_lookup
1149 paint_tree_greater -> paint_rbt_greater
1150 paint_tree_less -> paint_rbt_less
1151 sorted_entries -> rbt_sorted_entries
1152 tree_greater_eq_trans -> rbt_greater_eq_trans
1153 tree_greater_nit -> rbt_greater_nit
1154 tree_greater_prop -> rbt_greater_prop
1155 tree_greater_simps -> rbt_greater_simps
1156 tree_greater_trans -> rbt_greater_trans
1157 tree_less_eq_trans -> rbt_less_eq_trans
1158 tree_less_nit -> rbt_less_nit
1159 tree_less_prop -> rbt_less_prop
1160 tree_less_simps -> rbt_less_simps
1161 tree_less_trans -> rbt_less_trans
1162 tree_ord_props -> rbt_ord_props
1163 union_Branch -> rbt_union_Branch
1164 union_is_rbt -> rbt_union_is_rbt
1165 unionw_is_rbt -> rbt_unionw_is_rbt
1166 unionwk_is_rbt -> rbt_unionwk_is_rbt
1167 unionwk_sorted -> rbt_unionwk_rbt_sorted
1169 * Theory HOL/Library/Float: Floating point numbers are now defined as
1170 a subset of the real numbers. All operations are defined using the
1171 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1178 round_down -> float_round_down
1179 round_up -> float_round_up
1183 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1186 abs_float_def -> Float.compute_float_abs
1187 bitlen_ge0 -> bitlen_nonneg
1188 bitlen.simps -> Float.compute_bitlen
1189 float_components -> Float_mantissa_exponent
1190 float_divl.simps -> Float.compute_float_divl
1191 float_divr.simps -> Float.compute_float_divr
1192 float_eq_odd -> mult_powr_eq_mult_powr_iff
1193 float_power -> real_of_float_power
1194 lapprox_posrat_def -> Float.compute_lapprox_posrat
1195 lapprox_rat.simps -> Float.compute_lapprox_rat
1196 le_float_def' -> Float.compute_float_le
1197 le_float_def -> less_eq_float.rep_eq
1198 less_float_def' -> Float.compute_float_less
1199 less_float_def -> less_float.rep_eq
1200 normfloat_def -> Float.compute_normfloat
1201 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1202 normfloat -> normfloat_def
1203 normfloat_unique -> use normfloat_def
1204 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1205 one_float_def -> Float.compute_float_one
1206 plus_float_def -> Float.compute_float_plus
1207 rapprox_posrat_def -> Float.compute_rapprox_posrat
1208 rapprox_rat.simps -> Float.compute_rapprox_rat
1209 real_of_float_0 -> zero_float.rep_eq
1210 real_of_float_1 -> one_float.rep_eq
1211 real_of_float_abs -> abs_float.rep_eq
1212 real_of_float_add -> plus_float.rep_eq
1213 real_of_float_minus -> uminus_float.rep_eq
1214 real_of_float_mult -> times_float.rep_eq
1215 real_of_float_simp -> Float.rep_eq
1216 real_of_float_sub -> minus_float.rep_eq
1217 round_down.simps -> Float.compute_float_round_down
1218 round_up.simps -> Float.compute_float_round_up
1219 times_float_def -> Float.compute_float_times
1220 uminus_float_def -> Float.compute_float_uminus
1221 zero_float_def -> Float.compute_float_zero
1223 Lemmas not necessary anymore, use the transfer method:
1224 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1225 float_divr, float_le_simp, float_less1_mantissa_bound,
1226 float_less_simp, float_less_zero, float_le_zero,
1227 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1228 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1229 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1230 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1231 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1232 round_up, zero_le_float, zero_less_float
1234 * New theory HOL/Library/DAList provides an abstract type for
1235 association lists with distinct keys.
1237 * Session HOL/IMP: Added new theory of abstract interpretation of
1240 * Session HOL-Import: Re-implementation from scratch is faster,
1241 simpler, and more scalable. Requires a proof bundle, which is
1242 available as an external component. Discontinued old (and mostly
1243 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1245 * Session HOL-Word: Discontinued many redundant theorems specific to
1246 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1249 word_sub_alt ~> word_sub_wi
1250 word_add_alt ~> word_add_def
1251 word_mult_alt ~> word_mult_def
1252 word_minus_alt ~> word_minus_def
1253 word_0_alt ~> word_0_wi
1254 word_1_alt ~> word_1_wi
1255 word_add_0 ~> add_0_left
1256 word_add_0_right ~> add_0_right
1257 word_mult_1 ~> mult_1_left
1258 word_mult_1_right ~> mult_1_right
1259 word_add_commute ~> add_commute
1260 word_add_assoc ~> add_assoc
1261 word_add_left_commute ~> add_left_commute
1262 word_mult_commute ~> mult_commute
1263 word_mult_assoc ~> mult_assoc
1264 word_mult_left_commute ~> mult_left_commute
1265 word_left_distrib ~> left_distrib
1266 word_right_distrib ~> right_distrib
1267 word_left_minus ~> left_minus
1268 word_diff_0_right ~> diff_0_right
1269 word_diff_self ~> diff_self
1270 word_sub_def ~> diff_minus
1271 word_diff_minus ~> diff_minus
1272 word_add_ac ~> add_ac
1273 word_mult_ac ~> mult_ac
1274 word_plus_ac0 ~> add_0_left add_0_right add_ac
1275 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1276 word_order_trans ~> order_trans
1277 word_order_refl ~> order_refl
1278 word_order_antisym ~> order_antisym
1279 word_order_linear ~> linorder_linear
1280 lenw1_zero_neq_one ~> zero_neq_one
1281 word_number_of_eq ~> number_of_eq
1282 word_of_int_add_hom ~> wi_hom_add
1283 word_of_int_sub_hom ~> wi_hom_sub
1284 word_of_int_mult_hom ~> wi_hom_mult
1285 word_of_int_minus_hom ~> wi_hom_neg
1286 word_of_int_succ_hom ~> wi_hom_succ
1287 word_of_int_pred_hom ~> wi_hom_pred
1288 word_of_int_0_hom ~> word_0_wi
1289 word_of_int_1_hom ~> word_1_wi
1291 * Session HOL-Word: New proof method "word_bitwise" for splitting
1292 machine word equalities and inequalities into logical circuits,
1293 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1294 multiplication, shifting by constants, bitwise operators and numeric
1295 constants. Requires fixed-length word types, not 'a word. Solves
1296 many standard word identities outright and converts more into first
1297 order problems amenable to blast or similar. See also examples in
1298 HOL/Word/Examples/WordExamples.thy.
1300 * Session HOL-Probability: Introduced the type "'a measure" to
1301 represent measures, this replaces the records 'a algebra and 'a
1302 measure_space. The locales based on subset_class now have two
1303 locale-parameters the space \<Omega> and the set of measurable sets M.
1304 The product of probability spaces uses now the same constant as the
1305 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1306 measure". Most constants are defined now outside of locales and gain
1307 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1308 Measure space constructions for distributions and densities now got
1309 their own constants distr and density. Instead of using locales to
1310 describe measure spaces with a finite space, the measure count_space
1311 and point_measure is introduced. INCOMPATIBILITY.
1315 finite_measure.\<mu>' -> measure
1316 product_algebra_generator -> prod_algebra
1317 product_prob_space.emb -> prod_emb
1318 product_prob_space.infprod_algebra -> PiM
1321 completeable_measure_space
1322 finite_measure_space
1324 finite_product_finite_prob_space
1325 finite_product_sigma_algebra
1326 finite_sigma_algebra
1328 pair_finite_prob_space
1329 pair_finite_sigma_algebra
1332 product_sigma_algebra
1336 distribution -> use distr measure, or distributed predicate
1338 joint_distribution -> use distr measure, or distributed predicate
1339 pair_measure_generator
1340 product_prob_space.infprod_algebra -> use PiM
1343 Replacement theorems:
1344 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1345 finite_measure.empty_measure -> measure_empty
1346 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1347 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1348 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1349 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1350 finite_measure.finite_measure -> finite_measure.emeasure_finite
1351 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1352 finite_measure.positive_measure' -> measure_nonneg
1353 finite_measure.real_measure -> finite_measure.emeasure_real
1354 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1355 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1356 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1357 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1358 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1359 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1360 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1361 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1362 information_space.entropy_commute -> information_space.entropy_commute_simple
1363 information_space.entropy_eq -> information_space.entropy_simple_distributed
1364 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1365 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1366 information_space.entropy_uniform_max -> information_space.entropy_uniform
1367 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1368 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1369 information_space.KL_ge_0 -> information_space.KL_nonneg
1370 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1371 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1372 Int_stable_cuboids -> Int_stable_atLeastAtMost
1373 Int_stable_product_algebra_generator -> positive_integral
1374 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1375 measure_space.additive -> emeasure_additive
1376 measure_space.AE_iff_null_set -> AE_iff_null
1377 measure_space.almost_everywhere_def -> eventually_ae_filter
1378 measure_space.almost_everywhere_vimage -> AE_distrD
1379 measure_space.continuity_from_above -> INF_emeasure_decseq
1380 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1381 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1382 measure_space.continuity_from_below -> SUP_emeasure_incseq
1383 measure_space_density -> emeasure_density
1384 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1385 measure_space.integrable_vimage -> integrable_distr
1386 measure_space.integral_translated_density -> integral_density
1387 measure_space.integral_vimage -> integral_distr
1388 measure_space.measure_additive -> plus_emeasure
1389 measure_space.measure_compl -> emeasure_compl
1390 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1391 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1392 measure_space.measure_decseq -> decseq_emeasure
1393 measure_space.measure_Diff -> emeasure_Diff
1394 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1395 measure_space.measure_eq_0 -> emeasure_eq_0
1396 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1397 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1398 measure_space.measure_incseq -> incseq_emeasure
1399 measure_space.measure_insert -> emeasure_insert
1400 measure_space.measure_mono -> emeasure_mono
1401 measure_space.measure_not_negative -> emeasure_not_MInf
1402 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1403 measure_space.measure_setsum -> setsum_emeasure
1404 measure_space.measure_setsum_split -> setsum_emeasure_cover
1405 measure_space.measure_space_vimage -> emeasure_distr
1406 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1407 measure_space.measure_subadditive -> subadditive
1408 measure_space.measure_top -> emeasure_space
1409 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1410 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1411 measure_space.positive_integral_translated_density -> positive_integral_density
1412 measure_space.positive_integral_vimage -> positive_integral_distr
1413 measure_space.real_continuity_from_above -> Lim_measure_decseq
1414 measure_space.real_continuity_from_below -> Lim_measure_incseq
1415 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1416 measure_space.real_measure_Diff -> measure_Diff
1417 measure_space.real_measure_finite_Union -> measure_finite_Union
1418 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1419 measure_space.real_measure_subadditive -> measure_subadditive
1420 measure_space.real_measure_Union -> measure_Union
1421 measure_space.real_measure_UNION -> measure_UNION
1422 measure_space.simple_function_vimage -> simple_function_comp
1423 measure_space.simple_integral_vimage -> simple_integral_distr
1424 measure_space.simple_integral_vimage -> simple_integral_distr
1425 measure_unique_Int_stable -> measure_eqI_generator_eq
1426 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1427 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1428 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1429 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1430 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1431 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1432 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1433 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1434 pair_sigma_algebra.sets_swap -> sets_pair_swap
1435 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1436 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1437 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1438 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1439 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1440 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1441 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1442 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1443 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1444 prob_space.prob_space_vimage -> prob_space_distr
1445 prob_space.random_variable_restrict -> measurable_restrict
1446 prob_space_unique_Int_stable -> measure_eqI_prob_space
1447 product_algebraE -> prod_algebraE_all
1448 product_algebra_generator_der -> prod_algebra_eq_finite
1449 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1450 product_algebraI -> sets_PiM_I_finite
1451 product_measure_exists -> product_sigma_finite.sigma_finite
1452 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1453 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1454 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1455 product_prob_space.measurable_component -> measurable_component_singleton
1456 product_prob_space.measurable_emb -> measurable_prod_emb
1457 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1458 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1459 product_prob_space.measure_emb -> emeasure_prod_emb
1460 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1461 product_sigma_algebra.product_algebra_into_space -> space_closed
1462 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1463 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1464 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1465 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1466 sets_product_algebra -> sets_PiM
1467 sigma_algebra.measurable_sigma -> measurable_measure_of
1468 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1469 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1470 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1471 space_product_algebra -> space_PiM
1473 * Session HOL-TPTP: support to parse and import TPTP problems (all
1474 languages) into Isabelle/HOL.
1479 * New "case_product" attribute (see HOL).
1484 * Greater support for structured proofs involving induction or case
1487 * Much greater use of mathematical symbols.
1489 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1494 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1495 from a minor keyword introduced via theory header declaration.
1497 * Antiquotation @{command_spec "name"} produces the
1498 Outer_Syntax.command_spec from a major keyword introduced via theory
1499 header declaration; it can be passed to Outer_Syntax.command etc.
1501 * Local_Theory.define no longer hard-wires default theorem name
1502 "foo_def", but retains the binding as given. If that is Binding.empty
1503 / Attrib.empty_binding, the result is not registered as user-level
1504 fact. The Local_Theory.define_internal variant allows to specify a
1505 non-empty name (used for the foundation in the background theory),
1506 while omitting the fact binding in the user-context. Potential
1507 INCOMPATIBILITY for derived definitional packages: need to specify
1508 naming policy for primitive definitions more explicitly.
1510 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1511 conformance with similar operations in structure Term and Logic.
1513 * Antiquotation @{attributes [...]} embeds attribute source
1514 representation into the ML text, which is particularly useful with
1515 declarations like Local_Theory.note.
1517 * Structure Proof_Context follows standard naming scheme. Old
1518 ProofContext has been discontinued. INCOMPATIBILITY.
1520 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1521 change of semantics: update is applied to auxiliary local theory
1524 * Modernized some old-style infix operations:
1526 addeqcongs ~> Simplifier.add_eqcong
1527 deleqcongs ~> Simplifier.del_eqcong
1528 addcongs ~> Simplifier.add_cong
1529 delcongs ~> Simplifier.del_cong
1530 setmksimps ~> Simplifier.set_mksimps
1531 setmkcong ~> Simplifier.set_mkcong
1532 setmksym ~> Simplifier.set_mksym
1533 setmkeqTrue ~> Simplifier.set_mkeqTrue
1534 settermless ~> Simplifier.set_termless
1535 setsubgoaler ~> Simplifier.set_subgoaler
1536 addsplits ~> Splitter.add_split
1537 delsplits ~> Splitter.del_split
1542 * USER_HOME settings variable points to cross-platform user home
1543 directory, which coincides with HOME on POSIX systems only. Likewise,
1544 the Isabelle path specification "~" now expands to $USER_HOME, instead
1545 of former $HOME. A different default for USER_HOME may be set
1546 explicitly in shell environment, before Isabelle settings are
1547 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1548 the generic user home was intended.
1550 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1551 notation, which is useful for the jEdit file browser, for example.
1553 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1558 New in Isabelle2011-1 (October 2011)
1559 ------------------------------------
1563 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1564 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1566 - Management of multiple theory files directly from the editor
1567 buffer store -- bypassing the file-system (no requirement to save
1568 files for checking).
1570 - Markup of formal entities within the text buffer, with semantic
1571 highlighting, tooltips and hyperlinks to jump to defining source
1574 - Improved text rendering, with sub/superscripts in the source
1575 buffer (including support for copy/paste wrt. output panel, HTML
1576 theory output and other non-Isabelle text boxes).
1578 - Refined scheduling of proof checking and printing of results,
1579 based on interactive editor view. (Note: jEdit folding and
1580 narrowing allows to restrict buffer perspectives explicitly.)
1582 - Reduced CPU performance requirements, usable on machines with few
1585 - Reduced memory requirements due to pruning of unused document
1586 versions (garbage collection).
1588 See also ~~/src/Tools/jEdit/README.html for further information,
1589 including some remaining limitations.
1591 * Theory loader: source files are exclusively located via the master
1592 directory of each theory node (where the .thy file itself resides).
1593 The global load path (such as src/HOL/Library) has been discontinued.
1594 Note that the path element ~~ may be used to reference theories in the
1595 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1598 * Theory loader: source files are identified by content via SHA1
1599 digests. Discontinued former path/modtime identification and optional
1600 ISABELLE_FILE_IDENT plugin scripts.
1602 * Parallelization of nested Isar proofs is subject to
1603 Goal.parallel_proofs_threshold (default 100). See also isabelle
1606 * Name space: former unsynchronized references are now proper
1607 configuration options, with more conventional names:
1609 long_names ~> names_long
1610 short_names ~> names_short
1611 unique_names ~> names_unique
1613 Minor INCOMPATIBILITY, need to declare options in context like this:
1615 declare [[names_unique = false]]
1617 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1618 that the result needs to be unique, which means fact specifications
1619 may have to be refined after enriching a proof context.
1621 * Attribute "case_names" has been refined: the assumptions in each case
1622 can be named now by following the case name with [name1 name2 ...].
1624 * Isabelle/Isar reference manual has been updated and extended:
1625 - "Synopsis" provides a catalog of main Isar language concepts.
1626 - Formal references in syntax diagrams, via @{rail} antiquotation.
1627 - Updated material from classic "ref" manual, notably about
1628 "Classical Reasoner".
1633 * Class bot and top require underlying partial order rather than
1634 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1636 * Class complete_lattice: generalized a couple of lemmas from sets;
1637 generalized theorems INF_cong and SUP_cong. New type classes for
1638 complete boolean algebras and complete linear orders. Lemmas
1639 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1640 class complete_linorder.
1642 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1643 Sup_fun_def, Inf_apply, Sup_apply.
1645 Removed redundant lemmas (the right hand side gives hints how to
1646 replace them for (metis ...), or (simp only: ...) proofs):
1648 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1649 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1650 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1651 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1652 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1653 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1654 Inter_def ~> INF_def, image_def
1655 Union_def ~> SUP_def, image_def
1656 INT_eq ~> INF_def, and image_def
1657 UN_eq ~> SUP_def, and image_def
1658 INF_subset ~> INF_superset_mono [OF _ order_refl]
1660 More consistent and comprehensive names:
1662 INTER_eq_Inter_image ~> INF_def
1663 UNION_eq_Union_image ~> SUP_def
1666 INF_leI ~> INF_lower
1667 INF_leI2 ~> INF_lower2
1668 le_INFI ~> INF_greatest
1669 le_SUPI ~> SUP_upper
1670 le_SUPI2 ~> SUP_upper2
1671 SUP_leI ~> SUP_least
1672 INFI_bool_eq ~> INF_bool_eq
1673 SUPR_bool_eq ~> SUP_bool_eq
1674 INFI_apply ~> INF_apply
1675 SUPR_apply ~> SUP_apply
1676 INTER_def ~> INTER_eq
1677 UNION_def ~> UNION_eq
1681 * Renamed theory Complete_Lattice to Complete_Lattices.
1684 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1685 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1686 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1687 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1689 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1690 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1691 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1694 * Added syntactic classes "inf" and "sup" for the respective
1695 constants. INCOMPATIBILITY: Changes in the argument order of the
1696 (mostly internal) locale predicates for some derived classes.
1698 * Theorem collections ball_simps and bex_simps do not contain theorems
1699 referring to UNION any longer; these have been moved to collection
1700 UN_ball_bex_simps. INCOMPATIBILITY.
1702 * Theory Archimedean_Field: floor now is defined as parameter of a
1703 separate type class floor_ceiling.
1705 * Theory Finite_Set: more coherent development of fold_set locales:
1707 locale fun_left_comm ~> locale comp_fun_commute
1708 locale fun_left_comm_idem ~> locale comp_fun_idem
1710 Both use point-free characterization; interpretation proofs may need
1711 adjustment. INCOMPATIBILITY.
1713 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1714 accordance with standard mathematical terminology. INCOMPATIBILITY.
1716 * Theory Complex_Main: The locale interpretations for the
1717 bounded_linear and bounded_bilinear locales have been removed, in
1718 order to reduce the number of duplicate lemmas. Users must use the
1719 original names for distributivity theorems, potential INCOMPATIBILITY.
1721 divide.add ~> add_divide_distrib
1722 divide.diff ~> diff_divide_distrib
1723 divide.setsum ~> setsum_divide_distrib
1724 mult.add_right ~> right_distrib
1725 mult.diff_right ~> right_diff_distrib
1726 mult_right.setsum ~> setsum_right_distrib
1727 mult_left.diff ~> left_diff_distrib
1729 * Theory Complex_Main: Several redundant theorems have been removed or
1730 replaced by more general versions. INCOMPATIBILITY.
1732 real_diff_def ~> minus_real_def
1733 real_divide_def ~> divide_real_def
1734 real_less_def ~> less_le
1735 real_abs_def ~> abs_real_def
1736 real_sgn_def ~> sgn_real_def
1737 real_mult_commute ~> mult_commute
1738 real_mult_assoc ~> mult_assoc
1739 real_mult_1 ~> mult_1_left
1740 real_add_mult_distrib ~> left_distrib
1741 real_zero_not_eq_one ~> zero_neq_one
1742 real_mult_inverse_left ~> left_inverse
1743 INVERSE_ZERO ~> inverse_zero
1744 real_le_refl ~> order_refl
1745 real_le_antisym ~> order_antisym
1746 real_le_trans ~> order_trans
1747 real_le_linear ~> linear
1748 real_le_eq_diff ~> le_iff_diff_le_0
1749 real_add_left_mono ~> add_left_mono
1750 real_mult_order ~> mult_pos_pos
1751 real_mult_less_mono2 ~> mult_strict_left_mono
1752 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1753 real_0_le_divide_iff ~> zero_le_divide_iff
1754 realpow_two_disj ~> power2_eq_iff
1755 real_squared_diff_one_factored ~> square_diff_one_factored
1756 realpow_two_diff ~> square_diff_square_factored
1757 reals_complete2 ~> complete_real
1758 real_sum_squared_expand ~> power2_sum
1759 exp_ln_eq ~> ln_unique
1761 expi_zero ~> exp_zero
1762 lemma_DERIV_subst ~> DERIV_cong
1763 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1764 LIMSEQ_const ~> tendsto_const
1765 LIMSEQ_norm ~> tendsto_norm
1766 LIMSEQ_add ~> tendsto_add
1767 LIMSEQ_minus ~> tendsto_minus
1768 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1769 LIMSEQ_diff ~> tendsto_diff
1770 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1771 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1772 LIMSEQ_mult ~> tendsto_mult
1773 LIMSEQ_inverse ~> tendsto_inverse
1774 LIMSEQ_divide ~> tendsto_divide
1775 LIMSEQ_pow ~> tendsto_power
1776 LIMSEQ_setsum ~> tendsto_setsum
1777 LIMSEQ_setprod ~> tendsto_setprod
1778 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1779 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1780 LIMSEQ_imp_rabs ~> tendsto_rabs
1781 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1782 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1783 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1784 LIMSEQ_Complex ~> tendsto_Complex
1785 LIM_ident ~> tendsto_ident_at
1786 LIM_const ~> tendsto_const
1787 LIM_add ~> tendsto_add
1788 LIM_add_zero ~> tendsto_add_zero
1789 LIM_minus ~> tendsto_minus
1790 LIM_diff ~> tendsto_diff
1791 LIM_norm ~> tendsto_norm
1792 LIM_norm_zero ~> tendsto_norm_zero
1793 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1794 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1795 LIM_rabs ~> tendsto_rabs
1796 LIM_rabs_zero ~> tendsto_rabs_zero
1797 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1798 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1799 LIM_compose ~> tendsto_compose
1800 LIM_mult ~> tendsto_mult
1801 LIM_scaleR ~> tendsto_scaleR
1802 LIM_of_real ~> tendsto_of_real
1803 LIM_power ~> tendsto_power
1804 LIM_inverse ~> tendsto_inverse
1805 LIM_sgn ~> tendsto_sgn
1806 isCont_LIM_compose ~> isCont_tendsto_compose
1807 bounded_linear.LIM ~> bounded_linear.tendsto
1808 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1809 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1810 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1811 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1812 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1813 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1815 * Theory Complex_Main: The definition of infinite series was
1816 generalized. Now it is defined on the type class {topological_space,
1817 comm_monoid_add}. Hence it is useable also for extended real numbers.
1819 * Theory Complex_Main: The complex exponential function "expi" is now
1820 a type-constrained abbreviation for "exp :: complex => complex"; thus
1821 several polymorphic lemmas about "exp" are now applicable to "expi".
1825 - Theory Library/Code_Char_ord provides native ordering of
1826 characters in the target language.
1828 - Commands code_module and code_library are legacy, use export_code
1831 - Method "evaluation" is legacy, use method "eval" instead.
1833 - Legacy evaluator "SML" is deactivated by default. May be
1834 reactivated by the following theory command:
1836 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1838 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1840 * New proof method "induction" that gives induction hypotheses the
1841 name "IH", thus distinguishing them from further hypotheses that come
1842 from rule induction. The latter are still called "hyps". Method
1843 "induction" is a thin wrapper around "induct" and follows the same
1846 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1847 still available as a legacy feature for some time.
1850 - Added "need" and "total_consts" options.
1851 - Reintroduced "show_skolems" option by popular demand.
1852 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1856 - Use quasi-sound (and efficient) translations by default.
1857 - Added support for the following provers: E-ToFoF, LEO-II,
1858 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1859 - Automatically preplay and minimize proofs before showing them if
1860 this can be done within reasonable time.
1861 - sledgehammer available_provers ~> sledgehammer supported_provers.
1863 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1864 "max_mono_iters", and "max_new_mono_instances" options.
1865 - Removed "explicit_apply" and "full_types" options as well as "Full
1866 Types" Proof General menu item. INCOMPATIBILITY.
1869 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1870 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1874 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1875 "elim:" options. INCOMPATIBILITY.
1876 - Introduced 'try' that not only runs 'try_methods' but also
1877 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1880 - Added "eval" option to evaluate terms for the found counterexample
1881 (currently only supported by the default (exhaustive) tester).
1882 - Added post-processing of terms to obtain readable counterexamples
1883 (currently only supported by the default (exhaustive) tester).
1884 - New counterexample generator quickcheck[narrowing] enables
1885 narrowing-based testing. Requires the Glasgow Haskell compiler
1886 with its installation location defined in the Isabelle settings
1887 environment as ISABELLE_GHC.
1888 - Removed quickcheck tester "SML" based on the SML code generator
1889 (formly in HOL/Library).
1891 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1892 use 'partial_function' instead.
1894 * Theory Library/Extended_Reals replaces now the positive extended
1895 reals found in probability theory. This file is extended by
1896 Multivariate_Analysis/Extended_Real_Limits.
1898 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1899 from where it must be imported explicitly if it is really required.
1902 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1903 been moved here. INCOMPATIBILITY.
1905 * Theory Library/Saturated provides type of numbers with saturated
1908 * Theory Library/Product_Lattice defines a pointwise ordering for the
1909 product type 'a * 'b, and provides instance proofs for various order
1910 and lattice type classes.
1912 * Theory Library/Countable now provides the "countable_datatype" proof
1913 method for proving "countable" class instances for datatypes.
1915 * Theory Library/Cset_Monad allows do notation for computable sets
1916 (cset) via the generic monad ad-hoc overloading facility.
1918 * Library: Theories of common data structures are split into theories
1919 for implementation, an invariant-ensuring type, and connection to an
1920 abstract type. INCOMPATIBILITY.
1922 - RBT is split into RBT and RBT_Mapping.
1923 - AssocList is split and renamed into AList and AList_Mapping.
1924 - DList is split into DList_Impl, DList, and DList_Cset.
1925 - Cset is split into Cset and List_Cset.
1927 * Theory Library/Nat_Infinity has been renamed to
1928 Library/Extended_Nat, with name changes of the following types and
1931 type inat ~> type enat
1933 Infty ~> infinity (overloaded)
1937 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1938 been renamed accordingly. INCOMPATIBILITY.
1940 * Session Multivariate_Analysis: The euclidean_space type class now
1941 fixes a constant "Basis :: 'a set" consisting of the standard
1942 orthonormal basis for the type. Users now have the option of
1943 quantifying over this set instead of using the "basis" function, e.g.
1944 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1946 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1947 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1948 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1949 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1950 changed to match. Definition theorems for overloaded constants now use
1951 the standard "foo_vec_def" naming scheme. A few other theorems have
1952 been renamed as follows (INCOMPATIBILITY):
1954 Cart_eq ~> vec_eq_iff
1955 dist_nth_le_cart ~> dist_vec_nth_le
1956 tendsto_vector ~> vec_tendstoI
1957 Cauchy_vector ~> vec_CauchyI
1959 * Session Multivariate_Analysis: Several duplicate theorems have been
1960 removed, and other theorems have been renamed or replaced with more
1961 general versions. INCOMPATIBILITY.
1963 finite_choice ~> finite_set_choice
1964 eventually_conjI ~> eventually_conj
1965 eventually_and ~> eventually_conj_iff
1966 eventually_false ~> eventually_False
1967 setsum_norm ~> norm_setsum
1968 Lim_sequentially ~> LIMSEQ_def
1969 Lim_ident_at ~> LIM_ident
1970 Lim_const ~> tendsto_const
1971 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1972 Lim_neg ~> tendsto_minus
1973 Lim_add ~> tendsto_add
1974 Lim_sub ~> tendsto_diff
1975 Lim_mul ~> tendsto_scaleR
1976 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1977 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1978 Lim_linear ~> bounded_linear.tendsto
1979 Lim_component ~> tendsto_euclidean_component
1980 Lim_component_cart ~> tendsto_vec_nth
1981 Lim_inner ~> tendsto_inner [OF tendsto_const]
1982 dot_lsum ~> inner_setsum_left
1983 dot_rsum ~> inner_setsum_right
1984 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1985 continuous_neg ~> continuous_minus
1986 continuous_sub ~> continuous_diff
1987 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1988 continuous_mul ~> continuous_scaleR
1989 continuous_inv ~> continuous_inverse
1990 continuous_at_within_inv ~> continuous_at_within_inverse
1991 continuous_at_inv ~> continuous_at_inverse
1992 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1993 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1994 continuous_at_component ~> continuous_component [OF continuous_at_id]
1995 continuous_on_neg ~> continuous_on_minus
1996 continuous_on_sub ~> continuous_on_diff
1997 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1998 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1999 continuous_on_mul ~> continuous_on_scaleR
2000 continuous_on_mul_real ~> continuous_on_mult
2001 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2002 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2003 continuous_on_inverse ~> continuous_on_inv
2004 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2005 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2006 subset_interior ~> interior_mono
2007 subset_closure ~> closure_mono
2008 closure_univ ~> closure_UNIV
2009 real_arch_lt ~> reals_Archimedean2
2010 real_arch ~> reals_Archimedean3
2011 real_abs_norm ~> abs_norm_cancel
2012 real_abs_sub_norm ~> norm_triangle_ineq3
2013 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2015 * Session HOL-Probability:
2016 - Caratheodory's extension lemma is now proved for ring_of_sets.
2017 - Infinite products of probability measures are now available.
2018 - Sigma closure is independent, if the generator is independent
2019 - Use extended reals instead of positive extended
2020 reals. INCOMPATIBILITY.
2022 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2024 expand_fun_below ~> fun_below_iff
2025 below_fun_ext ~> fun_belowI
2026 expand_cfun_eq ~> cfun_eq_iff
2027 ext_cfun ~> cfun_eqI
2028 expand_cfun_below ~> cfun_below_iff
2029 below_cfun_ext ~> cfun_belowI
2030 monofun_fun_fun ~> fun_belowD
2031 monofun_fun_arg ~> monofunE
2032 monofun_lub_fun ~> adm_monofun [THEN admD]
2033 cont_lub_fun ~> adm_cont [THEN admD]
2034 cont2cont_Rep_CFun ~> cont2cont_APP
2035 cont_Rep_CFun_app ~> cont_APP_app
2036 cont_Rep_CFun_app_app ~> cont_APP_app_app
2037 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2038 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2039 contlub_cfun ~> lub_APP [symmetric]
2040 contlub_LAM ~> lub_LAM [symmetric]
2043 lift_distinct1 ~> lift.distinct(1)
2044 lift_distinct2 ~> lift.distinct(2)
2045 Def_not_UU ~> lift.distinct(2)
2046 Def_inject ~> lift.inject
2047 below_UU_iff ~> below_bottom_iff
2048 eq_UU_iff ~> eq_bottom_iff
2051 *** Document preparation ***
2053 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2054 isar-ref manual, both for description and actual application of the
2057 * Antiquotation @{value} evaluates the given term and presents its
2060 * Antiquotations: term style "isub" provides ad-hoc conversion of
2061 variables x1, y23 into subscripted form x\<^isub>1,
2062 y\<^isub>2\<^isub>3.
2064 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2065 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2067 * Localized \isabellestyle switch can be used within blocks or groups
2070 \isabellestyle{it} %preferred default
2071 {\isabellestylett @{text "typewriter stuff"}}
2073 * Discontinued special treatment of hard tabulators. Implicit
2074 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2080 * The inner syntax of sort/type/term/prop supports inlined YXML
2081 representations within quoted string tokens. By encoding logical
2082 entities via Term_XML (in ML or Scala) concrete syntax can be
2083 bypassed, which is particularly useful for producing bits of text
2084 under external program control.
2086 * Antiquotations for ML and document preparation are managed as theory
2087 data, which requires explicit setup.
2089 * Isabelle_Process.is_active allows tools to check if the official
2090 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2091 (better known as Proof General).
2093 * Structure Proof_Context follows standard naming scheme. Old
2094 ProofContext is still available for some time as legacy alias.
2096 * Structure Timing provides various operations for timing; supersedes
2097 former start_timing/end_timing etc.
2099 * Path.print is the official way to show file-system paths to users
2100 (including quotes etc.).
2102 * Inner syntax: identifiers in parse trees of generic categories
2103 "logic", "aprop", "idt" etc. carry position information (disguised as
2104 type constraints). Occasional INCOMPATIBILITY with non-compliant
2105 translations that choke on unexpected type constraints. Positions can
2106 be stripped in ML translations via Syntax.strip_positions /
2107 Syntax.strip_positions_ast, or via the syntax constant
2108 "_strip_positions" within parse trees. As last resort, positions can
2109 be disabled via the configuration option Syntax.positions, which is
2110 called "syntax_positions" in Isar attribute syntax.
2112 * Discontinued special status of various ML structures that contribute
2113 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2114 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2115 refer directly to Ast.Constant, Lexicon.is_identifier,
2116 Syntax_Trans.mk_binder_tr etc.
2118 * Typed print translation: discontinued show_sorts argument, which is
2119 already available via context of "advanced" translation.
2121 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2122 goal states; body tactic needs to address all subgoals uniformly.
2124 * Slightly more special eq_list/eq_set, with shortcut involving
2125 pointer equality (assumes that eq relation is reflexive).
2127 * Classical tactics use proper Proof.context instead of historic types
2128 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2129 operate directly on Proof.context. Raw type claset retains its use as
2130 snapshot of the classical context, which can be recovered via
2131 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2132 INCOMPATIBILITY, classical tactics and derived proof methods require
2133 proper Proof.context.
2138 * Discontinued support for Poly/ML 5.2, which was the last version
2139 without proper multithreading and TimeLimit implementation.
2141 * Discontinued old lib/scripts/polyml-platform, which has been
2142 obsolete since Isabelle2009-2.
2144 * Various optional external tools are referenced more robustly and
2145 uniformly by explicit Isabelle settings as follows:
2147 ISABELLE_CSDP (formerly CSDP_EXE)
2148 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2149 ISABELLE_OCAML (formerly EXEC_OCAML)
2150 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2151 ISABELLE_YAP (formerly EXEC_YAP)
2153 Note that automated detection from the file-system or search path has
2154 been discontinued. INCOMPATIBILITY.
2156 * Scala layer provides JVM method invocation service for static
2157 methods of type (String)String, see Invoke_Scala.method in ML. For
2160 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2162 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2163 this allows to pass structured values between ML and Scala.
2165 * The IsabelleText fonts includes some further glyphs to support the
2166 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2167 installed a local copy (which is normally *not* required) need to
2168 delete or update it from ~~/lib/fonts/.
2172 New in Isabelle2011 (January 2011)
2173 ----------------------------------
2177 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2178 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2179 useful tooltips and hyperlinks produced from its static analysis. The
2180 bundled component provides an executable Isabelle tool that can be run
2183 Isabelle2011/bin/isabelle jedit
2185 * Significantly improved Isabelle/Isar implementation manual.
2187 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2188 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2189 while the default heap location within that directory lacks that extra
2190 suffix. This isolates multiple Isabelle installations from each
2191 other, avoiding problems with old settings in new versions.
2192 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2194 * Source files are always encoded as UTF-8, instead of old-fashioned
2195 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2196 the following package declarations:
2198 \usepackage[utf8]{inputenc}
2199 \usepackage{textcomp}
2201 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2202 a Unicode character is treated as a single symbol, not a sequence of
2203 non-ASCII bytes as before. Since Isabelle/ML string literals may
2204 contain symbols without further backslash escapes, Unicode can now be
2205 used here as well. Recall that Symbol.explode in ML provides a
2206 consistent view on symbols, while raw explode (or String.explode)
2207 merely give a byte-oriented representation.
2209 * Theory loader: source files are primarily located via the master
2210 directory of each theory node (where the .thy file itself resides).
2211 The global load path is still partially available as legacy feature.
2212 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2213 explicit paths, relatively to the theory.
2215 * Special treatment of ML file names has been discontinued.
2216 Historically, optional extensions .ML or .sml were added on demand --
2217 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2218 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2220 * Various options that affect pretty printing etc. are now properly
2221 handled within the context via configuration options, instead of
2222 unsynchronized references or print modes. There are both ML Config.T
2223 entities and Isar declaration attributes to access these.
2225 ML (Config.T) Isar (attribute)
2227 eta_contract eta_contract
2228 show_brackets show_brackets
2229 show_sorts show_sorts
2230 show_types show_types
2231 show_question_marks show_question_marks
2232 show_consts show_consts
2233 show_abbrevs show_abbrevs
2235 Syntax.ast_trace syntax_ast_trace
2236 Syntax.ast_stat syntax_ast_stat
2237 Syntax.ambiguity_level syntax_ambiguity_level
2239 Goal_Display.goals_limit goals_limit
2240 Goal_Display.show_main_goal show_main_goal
2242 Method.rule_trace rule_trace
2244 Thy_Output.display thy_output_display
2245 Thy_Output.quotes thy_output_quotes
2246 Thy_Output.indent thy_output_indent
2247 Thy_Output.source thy_output_source
2248 Thy_Output.break thy_output_break
2250 Note that corresponding "..._default" references in ML may only be
2251 changed globally at the ROOT session setup, but *not* within a theory.
2252 The option "show_abbrevs" supersedes the former print mode
2253 "no_abbrevs" with inverted meaning.
2255 * More systematic naming of some configuration options.
2258 trace_simp ~> simp_trace
2259 debug_simp ~> simp_debug
2261 * Support for real valued configuration options, using simplistic
2262 floating-point notation that coincides with the inner syntax for
2265 * Support for real valued preferences (with approximative PGIP type):
2266 front-ends need to accept "pgint" values in float notation.
2269 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2272 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2277 * Command 'type_synonym' (with single argument) replaces somewhat
2278 outdated 'types', which is still available as legacy feature for some
2281 * Command 'nonterminal' (with 'and' separated list of arguments)
2282 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2284 * Command 'notepad' replaces former 'example_proof' for
2285 experimentation in Isar without any result. INCOMPATIBILITY.
2287 * Locale interpretation commands 'interpret' and 'sublocale' accept
2288 lists of equations to map definitions in a locale to appropriate
2289 entities in the context of the interpretation. The 'interpretation'
2290 command already provided this functionality.
2292 * Diagnostic command 'print_dependencies' prints the locale instances
2293 that would be activated if the specified expression was interpreted in
2294 the current context. Variant "print_dependencies!" assumes a context
2295 without interpretations.
2297 * Diagnostic command 'print_interps' prints interpretations in proofs
2298 in addition to interpretations in theories.
2300 * Discontinued obsolete 'global' and 'local' commands to manipulate
2301 the theory name space. Rare INCOMPATIBILITY. The ML functions
2302 Sign.root_path and Sign.local_path may be applied directly where this
2303 feature is still required for historical reasons.
2305 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2306 'definition' instead.
2308 * The "prems" fact, which refers to the accidental collection of
2309 foundational premises in the context, is now explicitly marked as
2310 legacy feature and will be discontinued soon. Consider using "assms"
2311 of the head statement or reference facts by explicit names.
2313 * Document antiquotations @{class} and @{type} print classes and type
2316 * Document antiquotation @{file} checks file/directory entries within
2317 the local file system.
2322 * Coercive subtyping: functions can be declared as coercions and type
2323 inference will add them as necessary upon input of a term. Theory
2324 Complex_Main declares real :: nat => real and real :: int => real as
2325 coercions. A coercion function f is declared like this:
2327 declare [[coercion f]]
2329 To lift coercions through type constructors (e.g. from nat => real to
2330 nat list => real list), map functions can be declared, e.g.
2332 declare [[coercion_map map]]
2334 Currently coercion inference is activated only in theories including
2335 real numbers, i.e. descendants of Complex_Main. This is controlled by
2336 the configuration option "coercion_enabled", e.g. it can be enabled in
2337 other theories like this:
2339 declare [[coercion_enabled]]
2341 * Command 'partial_function' provides basic support for recursive
2342 function definitions over complete partial orders. Concrete instances
2343 are provided for i) the option type, ii) tail recursion on arbitrary
2344 types, and iii) the heap monad of Imperative_HOL. See
2345 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2348 * Function package: f.psimps rules are no longer implicitly declared
2349 as [simp]. INCOMPATIBILITY.
2351 * Datatype package: theorems generated for executable equality (class
2352 "eq") carry proper names and are treated as default code equations.
2354 * Inductive package: now offers command 'inductive_simps' to
2355 automatically derive instantiated and simplified equations for
2356 inductive predicates, similar to 'inductive_cases'.
2358 * Command 'enriched_type' allows to register properties of the
2359 functorial structure of types.
2361 * Improved infrastructure for term evaluation using code generator
2362 techniques, in particular static evaluation conversions.
2364 * Code generator: Scala (2.8 or higher) has been added to the target
2367 * Code generator: globbing constant expressions "*" and "Theory.*"
2368 have been replaced by the more idiomatic "_" and "Theory._".
2371 * Code generator: export_code without explicit file declaration prints
2372 to standard output. INCOMPATIBILITY.
2374 * Code generator: do not print function definitions for case
2375 combinators any longer.
2377 * Code generator: simplification with rules determined with
2378 src/Tools/Code/code_simp.ML and method "code_simp".
2380 * Code generator for records: more idiomatic representation of record
2381 types. Warning: records are not covered by ancient SML code
2382 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2383 rep_datatype declaration helps to succeed then:
2387 rep_datatype foo_ext ...
2389 * Records: logical foundation type for records does not carry a
2390 '_type' suffix any longer (obsolete due to authentic syntax).
2393 * Quickcheck now by default uses exhaustive testing instead of random
2394 testing. Random testing can be invoked by "quickcheck [random]",
2395 exhaustive testing by "quickcheck [exhaustive]".
2397 * Quickcheck instantiates polymorphic types with small finite
2398 datatypes by default. This enables a simple execution mechanism to
2399 handle quantifiers and function equality over the finite datatypes.
2401 * Quickcheck random generator has been renamed from "code" to
2402 "random". INCOMPATIBILITY.
2404 * Quickcheck now has a configurable time limit which is set to 30
2405 seconds by default. This can be changed by adding [timeout = n] to the
2406 quickcheck command. The time limit for Auto Quickcheck is still set
2409 * Quickcheck in locales considers interpretations of that locale for
2410 counter example search.
2413 - Added "smt" and "remote_smt" provers based on the "smt" proof
2414 method. See the Sledgehammer manual for details ("isabelle doc
2417 sledgehammer atp_info ~> sledgehammer running_provers
2418 sledgehammer atp_kill ~> sledgehammer kill_provers
2419 sledgehammer available_atps ~> sledgehammer available_provers
2422 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2423 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2424 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2425 (and "ms" and "min" are no longer supported)
2430 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2431 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2433 - Added support for partial quotient types.
2434 - Added local versions of the "Nitpick.register_xxx" functions.
2435 - Added "whack" option.
2436 - Allow registration of quotient types as codatatypes.
2437 - Improved "merge_type_vars" option to merge more types.
2438 - Removed unsound "fast_descrs" option.
2439 - Added custom symmetry breaking for datatypes, making it possible to reach
2440 higher cardinalities.
2441 - Prevent the expansion of too large definitions.
2443 * Proof methods "metis" and "meson" now have configuration options
2444 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2445 to diagnose these tools. E.g.
2447 using [[metis_trace = true]]
2449 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2450 manually as command 'solve_direct'.
2452 * The default SMT solver Z3 must be enabled explicitly (due to
2453 licensing issues) by setting the environment variable
2454 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2455 commercial applications, the SMT solver CVC3 is provided as fall-back;
2456 changing the SMT solver is done via the configuration option
2459 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2460 i.e. "remote_cvc3" and "remote_z3".
2462 * Added basic SMT support for datatypes, records, and typedefs using
2463 the oracle mode (no proofs). Direct support of pairs has been dropped
2464 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2465 support for a similar behavior). Minor INCOMPATIBILITY.
2467 * Changed SMT configuration options:
2469 z3_proofs ~> smt_oracle (with inverted meaning)
2470 z3_trace_assms ~> smt_trace_used_facts
2483 * Boogie output files (.b2i files) need to be declared in the theory
2486 * Simplification procedure "list_to_set_comprehension" rewrites list
2487 comprehensions applied to List.set to set comprehensions. Occasional
2488 INCOMPATIBILITY, may be deactivated like this:
2490 declare [[simproc del: list_to_set_comprehension]]
2492 * Removed old version of primrec package. INCOMPATIBILITY.
2494 * Removed simplifier congruence rule of "prod_case", as has for long
2495 been the case with "split". INCOMPATIBILITY.
2497 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2499 * Removed [split_format ... and ... and ...] version of
2500 [split_format]. Potential INCOMPATIBILITY.
2502 * Predicate "sorted" now defined inductively, with nice induction
2503 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2505 * Constant "contents" renamed to "the_elem", to free the generic name
2506 contents for other uses. INCOMPATIBILITY.
2508 * Renamed class eq and constant eq (for code generation) to class
2509 equal and constant equal, plus renaming of related facts and various
2510 tuning. INCOMPATIBILITY.
2512 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2514 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2517 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2518 avoid confusion with finite sets. INCOMPATIBILITY.
2520 * Abandoned locales equiv, congruent and congruent2 for equivalence
2521 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2524 * Some previously unqualified names have been qualified:
2531 Trueprop ~> HOL.Trueprop
2536 op --> ~> HOL.implies
2548 Pair ~> Product_Type.Pair
2549 fst ~> Product_Type.fst
2550 snd ~> Product_Type.snd
2551 curry ~> Product_Type.curry
2553 Collect ~> Set.Collect
2557 * More canonical naming convention for some fundamental definitions:
2559 bot_bool_eq ~> bot_bool_def
2560 top_bool_eq ~> top_bool_def
2561 inf_bool_eq ~> inf_bool_def
2562 sup_bool_eq ~> sup_bool_def
2563 bot_fun_eq ~> bot_fun_def
2564 top_fun_eq ~> top_fun_def
2565 inf_fun_eq ~> inf_fun_def
2566 sup_fun_eq ~> sup_fun_def
2570 * More stylized fact names:
2572 expand_fun_eq ~> fun_eq_iff
2573 expand_set_eq ~> set_eq_iff
2575 nat_number ~> eval_nat_numeral
2579 * Refactoring of code-generation specific operations in theory List:
2585 mem_iff ~> member_def
2586 null_empty ~> null_def
2588 INCOMPATIBILITY. Note that these were not supposed to be used
2589 regularly unless for striking reasons; their main purpose was code
2592 Various operations from the Haskell prelude are used for generating
2595 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2596 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2597 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2599 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2600 "*" and "+" respectively. INCOMPATIBILITY.
2602 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2603 "Sum_Type.Plus" instead.
2605 * Constant "split" has been merged with constant "prod_case"; names of
2606 ML functions, facts etc. involving split have been retained so far,
2607 though. INCOMPATIBILITY.
2609 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2610 instead. INCOMPATIBILITY.
2612 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2615 * Former theory Library/Enum is now part of the HOL-Main image.
2616 INCOMPATIBILITY: all constants of the Enum theory now have to be
2617 referred to by its qualified name.
2620 nlists ~> Enum.nlists
2621 product ~> Enum.product
2623 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2624 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2627 * Theory Library/SetsAndFunctions has been split into
2628 Library/Function_Algebras and Library/Set_Algebras; canonical names
2629 for instance definitions for functions; various improvements.
2632 * Theory Library/Multiset provides stable quicksort implementation of
2635 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2638 * Session Multivariate_Analysis: introduced a type class for euclidean
2639 space. Most theorems are now stated in terms of euclidean spaces
2640 instead of finite cartesian products.
2643 real ^ 'n ~> 'a::real_vector
2644 ~> 'a::euclidean_space
2645 ~> 'a::ordered_euclidean_space
2646 (depends on your needs)
2650 \<chi> x. _ ~> \<chi>\<chi> x. _
2653 Also note that the indices are now natural numbers and not from some
2654 finite type. Finite cartesian products of euclidean spaces, products
2655 of euclidean spaces the real and complex numbers are instantiated to
2656 be euclidean_spaces. INCOMPATIBILITY.
2658 * Session Probability: introduced pextreal as positive extended real
2659 numbers. Use pextreal as value for measures. Introduce the
2660 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2661 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2662 the integral in Multivariate Analysis. INCOMPATIBILITY.
2664 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2667 * Session SPARK (with image HOL-SPARK) provides commands to load and
2668 prove verification conditions generated by the SPARK Ada program
2669 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2674 * Theorems for additive ring operations (locale abelian_monoid and
2675 descendants) are generated by interpretation from their multiplicative
2676 counterparts. Names (in particular theorem names) have the mandatory
2677 qualifier 'add'. Previous theorem names are redeclared for
2680 * Structure "int_ring" is now an abbreviation (previously a
2681 definition). This fits more natural with advanced interpretations.
2686 * The domain package now runs in definitional mode by default: The
2687 former command 'new_domain' is now called 'domain'. To use the domain
2688 package in its original axiomatic mode, use 'domain (unsafe)'.
2691 * The new class "domain" is now the default sort. Class "predomain"
2692 is an unpointed version of "domain". Theories can be updated by
2693 replacing sort annotations as shown below. INCOMPATIBILITY.
2695 'a::type ~> 'a::countable
2696 'a::cpo ~> 'a::predomain
2697 'a::pcpo ~> 'a::domain
2699 * The old type class "rep" has been superseded by class "domain".
2700 Accordingly, users of the definitional package must remove any
2701 "default_sort rep" declarations. INCOMPATIBILITY.
2703 * The domain package (definitional mode) now supports unpointed
2704 predomain argument types, as long as they are marked 'lazy'. (Strict
2705 arguments must be in class "domain".) For example, the following
2706 domain definition now works:
2708 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2710 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2711 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2712 'a option, and 'a list. Additionally, it configures fixrec and the
2713 domain package to work with these types. For example:
2715 fixrec isInl :: "('a + 'b) u -> tr"
2716 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2718 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2720 * The "(permissive)" option of fixrec has been replaced with a
2721 per-equation "(unchecked)" option. See
2722 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2724 * The "bifinite" class no longer fixes a constant "approx"; the class
2725 now just asserts that such a function exists. INCOMPATIBILITY.
2727 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2728 defines an embedding of type 'a defl into udom by default; instances
2729 of "bifinite" and "domain" classes are available in
2730 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2732 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2734 * The predicate "directed" has been removed. INCOMPATIBILITY.
2736 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2738 * The function "cprod_map" has been renamed to "prod_map".
2741 * The monadic bind operator on each powerdomain has new binder syntax
2742 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2743 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2745 * The infix syntax for binary union on each powerdomain has changed
2746 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2747 syntax. INCOMPATIBILITY.
2749 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2750 still supported as an input translation.
2752 * Renamed some theorems (the original names are also still available).
2754 expand_fun_below ~> fun_below_iff
2755 below_fun_ext ~> fun_belowI
2756 expand_cfun_eq ~> cfun_eq_iff
2757 ext_cfun ~> cfun_eqI
2758 expand_cfun_below ~> cfun_below_iff
2759 below_cfun_ext ~> cfun_belowI
2760 cont2cont_Rep_CFun ~> cont2cont_APP
2762 * The Abs and Rep functions for various types have changed names.
2763 Related theorem names have also changed to match. INCOMPATIBILITY.
2765 Rep_CFun ~> Rep_cfun
2766 Abs_CFun ~> Abs_cfun
2767 Rep_Sprod ~> Rep_sprod
2768 Abs_Sprod ~> Abs_sprod
2769 Rep_Ssum ~> Rep_ssum
2770 Abs_Ssum ~> Abs_ssum
2772 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2773 been renamed to *_bottom_iff. INCOMPATIBILITY.
2775 * Various changes to bisimulation/coinduction with domain package:
2777 - Definitions of "bisim" constants no longer mention definedness.
2778 - With mutual recursion, "bisim" predicate is now curried.
2779 - With mutual recursion, each type gets a separate coind theorem.
2780 - Variable names in bisim_def and coinduct rules have changed.
2784 * Case combinators generated by the domain package for type "foo" are
2785 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2787 * Several theorems have been renamed to more accurately reflect the
2788 names of constants and types involved. INCOMPATIBILITY.
2790 thelub_const ~> lub_const
2791 lub_const ~> is_lub_const
2793 is_lub_lub ~> is_lubD2
2795 unique_lub ~> is_lub_unique
2796 is_ub_lub ~> is_lub_rangeD1
2797 lub_bin_chain ~> is_lub_bin_chain
2798 lub_fun ~> is_lub_fun
2799 thelub_fun ~> lub_fun
2800 thelub_cfun ~> lub_cfun
2801 thelub_Pair ~> lub_Pair
2802 lub_cprod ~> is_lub_prod
2803 thelub_cprod ~> lub_prod
2804 minimal_cprod ~> minimal_prod
2805 inst_cprod_pcpo ~> inst_prod_pcpo
2807 compact_UU ~> compact_bottom
2808 deflation_UU ~> deflation_bottom
2809 finite_deflation_UU ~> finite_deflation_bottom
2811 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2813 sq_ord_less_eq_trans ~> below_eq_trans
2814 sq_ord_eq_less_trans ~> eq_below_trans
2815 refl_less ~> below_refl
2816 trans_less ~> below_trans
2817 antisym_less ~> below_antisym
2818 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2819 box_less ~> box_below
2820 rev_trans_less ~> rev_below_trans
2821 not_less2not_eq ~> not_below2not_eq
2822 less_UU_iff ~> below_UU_iff
2823 flat_less_iff ~> flat_below_iff
2824 adm_less ~> adm_below
2825 adm_not_less ~> adm_not_below
2826 adm_compact_not_less ~> adm_compact_not_below
2827 less_fun_def ~> below_fun_def
2828 expand_fun_less ~> fun_below_iff
2829 less_fun_ext ~> fun_belowI
2830 less_discr_def ~> below_discr_def
2831 discr_less_eq ~> discr_below_eq
2832 less_unit_def ~> below_unit_def
2833 less_cprod_def ~> below_prod_def
2834 prod_lessI ~> prod_belowI
2835 Pair_less_iff ~> Pair_below_iff
2836 fst_less_iff ~> fst_below_iff
2837 snd_less_iff ~> snd_below_iff
2838 expand_cfun_less ~> cfun_below_iff
2839 less_cfun_ext ~> cfun_belowI
2840 injection_less ~> injection_below
2841 less_up_def ~> below_up_def
2842 not_Iup_less ~> not_Iup_below
2843 Iup_less ~> Iup_below
2845 Def_inject_less_eq ~> Def_below_Def
2846 Def_less_is_eq ~> Def_below_iff
2847 spair_less_iff ~> spair_below_iff
2848 less_sprod ~> below_sprod
2849 spair_less ~> spair_below
2850 sfst_less_iff ~> sfst_below_iff
2851 ssnd_less_iff ~> ssnd_below_iff
2852 fix_least_less ~> fix_least_below
2853 dist_less_one ~> dist_below_one
2854 less_ONE ~> below_ONE
2855 ONE_less_iff ~> ONE_below_iff
2856 less_sinlD ~> below_sinlD
2857 less_sinrD ~> below_sinrD
2862 * All constant names are now qualified internally and use proper
2863 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2868 * Antiquotation @{assert} inlines a function bool -> unit that raises
2869 Fail if the argument is false. Due to inlining the source position of
2870 failed assertions is included in the error output.
2872 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2873 text is in practice always evaluated with a stable theory checkpoint.
2874 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2876 * Antiquotation @{theory A} refers to theory A from the ancestry of
2877 the current context, not any accidental theory loader state as before.
2878 Potential INCOMPATIBILITY, subtle change in semantics.
2880 * Syntax.pretty_priority (default 0) configures the required priority
2881 of pretty-printed output and thus affects insertion of parentheses.
2883 * Syntax.default_root (default "any") configures the inner syntax
2884 category (nonterminal symbol) for parsing of terms.
2886 * Former exception Library.UnequalLengths now coincides with
2887 ListPair.UnequalLengths.
2889 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2890 main functionality is provided by structure Simplifier.
2892 * Renamed raw "explode" function to "raw_explode" to emphasize its
2893 meaning. Note that internally to Isabelle, Symbol.explode is used in
2894 almost all situations.
2896 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2897 See implementation manual for further details on exceptions in
2900 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2903 * Renamed structure PureThy to Pure_Thy and moved most of its
2904 operations to structure Global_Theory, to emphasize that this is
2905 rarely-used global-only stuff.
2907 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2908 instead (or tracing for high-volume output).
2910 * Configuration option show_question_marks only affects regular pretty
2911 printing of types and terms, not raw Term.string_of_vname.
2913 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2914 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2915 @{thms} for most purposes.
2917 * ML structure Unsynchronized is never opened, not even in Isar
2918 interaction mode as before. Old Unsynchronized.set etc. have been
2919 discontinued -- use plain := instead. This should be *rare* anyway,
2920 since modern tools always work via official context data, notably
2921 configuration options.
2923 * Parallel and asynchronous execution requires special care concerning
2924 interrupts. Structure Exn provides some convenience functions that
2925 avoid working directly with raw Interrupt. User code must not absorb
2926 interrupts -- intermediate handling (for cleanup etc.) needs to be
2927 followed by re-raising of the original exception. Another common
2928 source of mistakes are "handle _" patterns, which make the meaning of
2929 the program subject to physical effects of the environment.
2933 New in Isabelle2009-2 (June 2010)
2934 ---------------------------------
2938 * Authentic syntax for *all* logical entities (type classes, type
2939 constructors, term constants): provides simple and robust
2940 correspondence between formal entities and concrete syntax. Within
2941 the parse tree / AST representations, "constants" are decorated by
2942 their category (class, type, const) and spelled out explicitly with
2943 their full internal name.
2945 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2946 and translations (translation rules and translation functions in ML).
2947 Some hints on upgrading:
2949 - Many existing uses of 'syntax' and 'translations' can be replaced
2950 by more modern 'type_notation', 'notation' and 'abbreviation',
2951 which are independent of this issue.
2953 - 'translations' require markup within the AST; the term syntax
2954 provides the following special forms:
2956 CONST c -- produces syntax version of constant c from context
2957 XCONST c -- literally c, checked as constant from context
2958 c -- literally c, if declared by 'syntax'
2960 Plain identifiers are treated as AST variables -- occasionally the
2961 system indicates accidental variables via the error "rhs contains
2964 Type classes and type constructors are marked according to their
2965 concrete syntax. Some old translations rules need to be written
2966 for the "type" category, using type constructor application
2967 instead of pseudo-term application of the default category
2970 - 'parse_translation' etc. in ML may use the following
2973 @{class_syntax c} -- type class c within parse tree / AST
2974 @{term_syntax c} -- type constructor c within parse tree / AST
2975 @{const_syntax c} -- ML version of "CONST c" above
2976 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2978 - Literal types within 'typed_print_translations', i.e. those *not*
2979 represented as pseudo-terms are represented verbatim. Use @{class
2980 c} or @{type_name c} here instead of the above syntax
2983 Note that old non-authentic syntax was based on unqualified base
2984 names, so all of the above "constant" names would coincide. Recall
2985 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2986 diagnose syntax problems.
2988 * Type constructors admit general mixfix syntax, not just infix.
2990 * Concrete syntax may be attached to local entities without a proof
2991 body, too. This works via regular mixfix annotations for 'fix',
2992 'def', 'obtain' etc. or via the explicit 'write' command, which is
2993 similar to the 'notation' command in theory specifications.
2995 * Discontinued unnamed infix syntax (legacy feature for many years) --
2996 need to specify constant name and syntax separately. Internal ML
2997 datatype constructors have been renamed from InfixName to Infix etc.
2998 Minor INCOMPATIBILITY.
3000 * Schematic theorem statements need to be explicitly markup as such,
3001 via commands 'schematic_lemma', 'schematic_theorem',
3002 'schematic_corollary'. Thus the relevance of the proof is made
3003 syntactically clear, which impacts performance in a parallel or
3004 asynchronous interactive environment. Minor INCOMPATIBILITY.
3006 * Use of cumulative prems via "!" in some proof methods has been
3007 discontinued (old legacy feature).
3009 * References 'trace_simp' and 'debug_simp' have been replaced by
3010 configuration options stored in the context. Enabling tracing (the
3011 case of debugging is similar) in proofs works via
3013 using [[trace_simp = true]]
3015 Tracing is then active for all invocations of the simplifier in
3016 subsequent goal refinement steps. Tracing may also still be enabled or
3017 disabled via the ProofGeneral settings menu.
3019 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3020 'hide_fact' replace the former 'hide' KIND command. Minor
3023 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3024 more efficient than combinations with -q1 or -q2.
3029 * Proofterms record type-class reasoning explicitly, using the
3030 "unconstrain" operation internally. This eliminates all sort
3031 constraints from a theorem and proof, introducing explicit
3032 OFCLASS-premises. On the proof term level, this operation is
3033 automatically applied at theorem boundaries, such that closed proofs
3034 are always free of sort constraints. INCOMPATIBILITY for tools that
3035 inspect proof terms.
3037 * Local theory specifications may depend on extra type variables that
3038 are not present in the result type -- arguments TYPE('a) :: 'a itself
3039 are added internally. For example:
3041 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3043 * Predicates of locales introduced by classes carry a mandatory
3044 "class" prefix. INCOMPATIBILITY.
3046 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3048 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3051 * Command 'code_reflect' allows to incorporate generated ML code into
3052 runtime environment; replaces immature code_datatype antiquotation.
3055 * Code generator: simple concept for abstract datatypes obeying
3058 * Code generator: details of internal data cache have no impact on the
3059 user space functionality any longer.
3061 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3062 subgoals. This is more appropriate for interpretations with 'where'.
3065 * Command 'example_proof' opens an empty proof body. This allows to
3066 experiment with Isar, without producing any persistent result.
3068 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3069 within a local theory context, with explicit checking of the
3070 constructors involved (in contrast to the raw 'syntax' versions).
3072 * Commands 'types' and 'typedecl' now work within a local theory
3073 context -- without introducing dependencies on parameters or
3074 assumptions, which is not possible in Isabelle/Pure.
3076 * Command 'defaultsort' has been renamed to 'default_sort', it works
3077 within a local theory context. Minor INCOMPATIBILITY.
3082 * Command 'typedef' now works within a local theory context -- without
3083 introducing dependencies on parameters or assumptions, which is not
3084 possible in Isabelle/Pure/HOL. Note that the logical environment may
3085 contain multiple interpretations of local typedefs (with different
3086 non-emptiness proofs), even in a global theory context.
3088 * New package for quotient types. Commands 'quotient_type' and
3089 'quotient_definition' may be used for defining types and constants by
3090 quotient constructions. An example is the type of integers created by
3091 quotienting pairs of natural numbers:
3094 intrel :: "(nat * nat) => (nat * nat) => bool"
3096 "intrel (x, y) (u, v) = (x + v = u + y)"
3098 quotient_type int = "nat * nat" / intrel
3099 by (auto simp add: equivp_def expand_fun_eq)
3102 "0::int" is "(0::nat, 0::nat)"
3104 The method "lifting" can be used to lift of theorems from the
3105 underlying "raw" type to the quotient type. The example
3106 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3107 construction and provides a reasoning infrastructure for finite sets.
3109 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3110 clash with new theory Quotient in Main HOL.
3112 * Moved the SMT binding into the main HOL session, eliminating
3113 separate HOL-SMT session.
3115 * List membership infix mem operation is only an input abbreviation.
3118 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3119 for future developements; former Library/Word.thy is still present in
3120 the AFP entry RSAPPS.
3122 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3123 longer shadowed. INCOMPATIBILITY.
3125 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3128 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3131 * Dropped normalizing_semiring etc; use the facts in semiring classes
3132 instead. INCOMPATIBILITY.
3134 * Dropped several real-specific versions of lemmas about floor and
3135 ceiling; use the generic lemmas from theory "Archimedean_Field"
3136 instead. INCOMPATIBILITY.
3138 floor_number_of_eq ~> floor_number_of
3139 le_floor_eq_number_of ~> number_of_le_floor
3140 le_floor_eq_zero ~> zero_le_floor
3141 le_floor_eq_one ~> one_le_floor
3142 floor_less_eq_number_of ~> floor_less_number_of
3143 floor_less_eq_zero ~> floor_less_zero
3144 floor_less_eq_one ~> floor_less_one
3145 less_floor_eq_number_of ~> number_of_less_floor
3146 less_floor_eq_zero ~> zero_less_floor
3147 less_floor_eq_one ~> one_less_floor
3148 floor_le_eq_number_of ~> floor_le_number_of
3149 floor_le_eq_zero ~> floor_le_zero
3150 floor_le_eq_one ~> floor_le_one
3151 floor_subtract_number_of ~> floor_diff_number_of
3152 floor_subtract_one ~> floor_diff_one
3153 ceiling_number_of_eq ~> ceiling_number_of
3154 ceiling_le_eq_number_of ~> ceiling_le_number_of
3155 ceiling_le_zero_eq ~> ceiling_le_zero
3156 ceiling_le_eq_one ~> ceiling_le_one
3157 less_ceiling_eq_number_of ~> number_of_less_ceiling
3158 less_ceiling_eq_zero ~> zero_less_ceiling
3159 less_ceiling_eq_one ~> one_less_ceiling
3160 ceiling_less_eq_number_of ~> ceiling_less_number_of
3161 ceiling_less_eq_zero ~> ceiling_less_zero
3162 ceiling_less_eq_one ~> ceiling_less_one
3163 le_ceiling_eq_number_of ~> number_of_le_ceiling
3164 le_ceiling_eq_zero ~> zero_le_ceiling
3165 le_ceiling_eq_one ~> one_le_ceiling
3166 ceiling_subtract_number_of ~> ceiling_diff_number_of
3167 ceiling_subtract_one ~> ceiling_diff_one
3169 * Theory "Finite_Set": various folding_XXX locales facilitate the
3170 application of the various fold combinators on finite sets.
3172 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3173 provides abstract red-black tree type which is backed by "RBT_Impl" as
3174 implementation. INCOMPATIBILTY.
3176 * Theory Library/Coinductive_List has been removed -- superseded by
3177 AFP/thys/Coinductive.
3179 * Theory PReal, including the type "preal" and related operations, has
3180 been removed. INCOMPATIBILITY.
3182 * Real: new development using Cauchy Sequences.
3184 * Split off theory "Big_Operators" containing setsum, setprod,
3185 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3187 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3188 "Int" etc. INCOMPATIBILITY.
3190 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3192 * New set of rules "ac_simps" provides combined assoc / commute
3193 rewrites for all interpretations of the appropriate generic locales.
3195 * Renamed theory "OrderedGroup" to "Groups" and split theory
3196 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3197 appropriate and more consistent names suitable for name prefixes
3198 within the HOL theories. INCOMPATIBILITY.
3200 * Some generic constants have been put to appropriate theories:
3201 - less_eq, less: Orderings
3202 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3203 - inverse, divide: Rings
3206 * More consistent naming of type classes involving orderings (and
3209 lower_semilattice ~> semilattice_inf
3210 upper_semilattice ~> semilattice_sup
3212 dense_linear_order ~> dense_linorder
3214 pordered_ab_group_add ~> ordered_ab_group_add
3215 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3216 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3217 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3218 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3219 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3220 pordered_cancel_semiring ~> ordered_cancel_semiring
3221 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3222 pordered_comm_ring ~> ordered_comm_ring
3223 pordered_comm_semiring ~> ordered_comm_semiring
3224 pordered_ring ~> ordered_ring
3225 pordered_ring_abs ~> ordered_ring_abs
3226 pordered_semiring ~> ordered_semiring
3228 ordered_ab_group_add ~> linordered_ab_group_add
3229 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3230 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3231 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3232 ordered_field ~> linordered_field
3233 ordered_field_no_lb ~> linordered_field_no_lb
3234 ordered_field_no_ub ~> linordered_field_no_ub
3235 ordered_field_dense_linear_order ~> dense_linordered_field
3236 ordered_idom ~> linordered_idom
3237 ordered_ring ~> linordered_ring
3238 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3239 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3240 ordered_ring_strict ~> linordered_ring_strict
3241 ordered_semidom ~> linordered_semidom
3242 ordered_semiring ~> linordered_semiring
3243 ordered_semiring_1 ~> linordered_semiring_1
3244 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3245 ordered_semiring_strict ~> linordered_semiring_strict
3247 The following slightly odd type classes have been moved to a
3248 separate theory Library/Lattice_Algebras:
3250 lordered_ab_group_add ~> lattice_ab_group_add
3251 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3252 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3253 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3254 lordered_ring ~> lattice_ring
3258 * Refined field classes:
3259 - classes division_ring_inverse_zero, field_inverse_zero,
3260 linordered_field_inverse_zero include rule inverse 0 = 0 --
3261 subsumes former division_by_zero class;
3262 - numerous lemmas have been ported from field to division_ring.
3265 * Refined algebra theorem collections:
3266 - dropped theorem group group_simps, use algebra_simps instead;
3267 - dropped theorem group ring_simps, use field_simps instead;
3268 - proper theorem collection field_simps subsumes former theorem
3269 groups field_eq_simps and field_simps;
3270 - dropped lemma eq_minus_self_iff which is a duplicate for
3274 * Theory Finite_Set and List: some lemmas have been generalized from
3277 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3278 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3279 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3280 union_Union_fold_union ~> sup_Sup_fold_sup
3281 Inter_fold_inter ~> Inf_fold_inf
3282 Union_fold_union ~> Sup_fold_sup
3283 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3284 union_UNION_fold_union ~> sup_SUPR_fold_sup
3285 INTER_fold_inter ~> INFI_fold_inf
3286 UNION_fold_union ~> SUPR_fold_sup
3288 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3289 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3290 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3291 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3292 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3293 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3295 * Reorganized theory Multiset: swapped notation of pointwise and
3298 - pointwise ordering is instance of class order with standard syntax
3300 - multiset ordering has syntax <=# and <#; partial order properties
3301 are provided by means of interpretation with prefix
3303 - less duplication, less historical organization of sections,
3304 conversion from associations lists to multisets, rudimentary code
3306 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3311 multiset_eq_conv_count_eq ~> multiset_ext_iff
3312 multi_count_ext ~> multiset_ext
3313 diff_union_inverse2 ~> diff_union_cancelR
3317 * Theory Permutation: replaced local "remove" by List.remove1.
3319 * Code generation: ML and OCaml code is decorated with signatures.
3321 * Theory List: added transpose.
3323 * Library/Nat_Bijection.thy is a collection of bijective functions
3324 between nat and other types, which supersedes the older libraries
3325 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3328 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3329 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3330 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3331 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3332 Countable.pair_encode ~> prod_encode
3333 NatIso.prod2nat ~> prod_encode
3334 NatIso.nat2prod ~> prod_decode
3335 NatIso.sum2nat ~> sum_encode
3336 NatIso.nat2sum ~> sum_decode
3337 NatIso.list2nat ~> list_encode
3338 NatIso.nat2list ~> list_decode
3339 NatIso.set2nat ~> set_encode
3340 NatIso.nat2set ~> set_decode
3343 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3344 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3345 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3346 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3347 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3348 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3349 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3350 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3351 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3352 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3353 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3354 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3355 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3358 - Renamed ATP commands:
3359 atp_info ~> sledgehammer running_atps
3360 atp_kill ~> sledgehammer kill_atps
3361 atp_messages ~> sledgehammer messages
3362 atp_minimize ~> sledgehammer minimize
3363 print_atps ~> sledgehammer available_atps
3365 - Added user's manual ("isabelle doc sledgehammer").
3366 - Added option syntax and "sledgehammer_params" to customize
3367 Sledgehammer's behavior. See the manual for details.
3368 - Modified the Isar proof reconstruction code so that it produces
3369 direct proofs rather than proofs by contradiction. (This feature
3370 is still experimental.)
3371 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3373 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3376 - Added and implemented "binary_ints" and "bits" options.
3377 - Added "std" option and implemented support for nonstandard models.
3378 - Added and implemented "finitize" option to improve the precision
3379 of infinite datatypes based on a monotonicity analysis.
3380 - Added support for quotient types.
3381 - Added support for "specification" and "ax_specification"
3383 - Added support for local definitions (for "function" and
3384 "termination" proofs).
3385 - Added support for term postprocessors.
3386 - Optimized "Multiset.multiset" and "FinFun.finfun".
3387 - Improved efficiency of "destroy_constrs" optimization.
3388 - Fixed soundness bugs related to "destroy_constrs" optimization and
3390 - Fixed soundness bug related to higher-order constructors.
3391 - Fixed soundness bug when "full_descrs" is enabled.
3392 - Improved precision of set constructs.
3393 - Added "atoms" option.
3394 - Added cache to speed up repeated Kodkod invocations on the same
3396 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3397 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3398 "SAT4J_Light". INCOMPATIBILITY.
3399 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3400 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3401 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3403 * Method "induct" now takes instantiations of the form t, where t is not
3404 a variable, as a shorthand for "x == t", where x is a fresh variable.
3405 If this is not intended, t has to be enclosed in parentheses.
3406 By default, the equalities generated by definitional instantiations
3407 are pre-simplified, which may cause parameters of inductive cases
3408 to disappear, or may even delete some of the inductive cases.
3409 Use "induct (no_simp)" instead of "induct" to restore the old
3410 behaviour. The (no_simp) option is also understood by the "cases"
3411 and "nominal_induct" methods, which now perform pre-simplification, too.
3417 * Variable names in lemmas generated by the domain package have
3418 changed; the naming scheme is now consistent with the HOL datatype
3419 package. Some proof scripts may be affected, INCOMPATIBILITY.
3421 * The domain package no longer defines the function "foo_copy" for
3422 recursive domain "foo". The reach lemma is now stated directly in
3423 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3424 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3426 * Most definedness lemmas generated by the domain package (previously
3427 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3428 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3429 Proofs that used definedness lemmas as intro rules may break,
3430 potential INCOMPATIBILITY.
3432 * Induction and casedist rules generated by the domain package now
3433 declare proper case_names (one called "bottom", and one named for each
3434 constructor). INCOMPATIBILITY.
3436 * For mutually-recursive domains, separate "reach" and "take_lemma"
3437 rules are generated for each domain, INCOMPATIBILITY.
3439 foo_bar.reach ~> foo.reach bar.reach
3440 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3442 * Some lemmas generated by the domain package have been renamed for
3443 consistency with the datatype package, INCOMPATIBILITY.
3445 foo.ind ~> foo.induct
3446 foo.finite_ind ~> foo.finite_induct
3447 foo.coind ~> foo.coinduct
3448 foo.casedist ~> foo.exhaust
3449 foo.exhaust ~> foo.nchotomy
3451 * For consistency with other definition packages, the fixrec package
3452 now generates qualified theorem names, INCOMPATIBILITY.
3454 foo_simps ~> foo.simps
3455 foo_unfold ~> foo.unfold
3456 foo_induct ~> foo.induct
3458 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3459 method and internal fixrec proofs now use the default simpset instead.
3462 * The "contlub" predicate has been removed. Proof scripts should use
3463 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3465 * The "admw" predicate has been removed, INCOMPATIBILITY.
3467 * The constants cpair, cfst, and csnd have been removed in favor of
3468 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3473 * Antiquotations for basic formal entities:
3475 @{class NAME} -- type class
3476 @{class_syntax NAME} -- syntax representation of the above
3478 @{type_name NAME} -- logical type
3479 @{type_abbrev NAME} -- type abbreviation
3480 @{nonterminal NAME} -- type of concrete syntactic category
3481 @{type_syntax NAME} -- syntax representation of any of the above
3483 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3484 @{const_abbrev NAME} -- abbreviated constant
3485 @{const_syntax NAME} -- syntax representation of any of the above
3487 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3488 syntax constant (cf. 'syntax' command).
3490 * Antiquotation @{make_string} inlines a function to print arbitrary
3491 values similar to the ML toplevel. The result is compiler dependent
3492 and may fall back on "?" in certain situations.
3494 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3495 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3496 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3497 not work with the asynchronous Isar document model.
3499 * Configuration options now admit dynamic default values, depending on
3500 the context or even global references.
3502 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3503 uses an efficient external library if available (for Poly/ML).
3505 * Renamed some important ML structures, while keeping the old names
3506 for some time as aliases within the structure Legacy:
3508 OuterKeyword ~> Keyword
3511 OuterSyntax ~> Outer_Syntax
3512 PrintMode ~> Print_Mode
3513 SpecParse ~> Parse_Spec
3516 ThyOutput ~> Thy_Output
3517 TypeInfer ~> Type_Infer
3519 Note that "open Legacy" simplifies porting of sources, but forgetting
3520 to remove it again will complicate porting again in the future.
3522 * Most operations that refer to a global context are named
3523 accordingly, e.g. Simplifier.global_context or
3524 ProofContext.init_global. There are some situations where a global
3525 context actually works, but under normal circumstances one needs to
3526 pass the proper local context through the code!
3528 * Discontinued old TheoryDataFun with its copy/init operation -- data
3529 needs to be pure. Functor Theory_Data_PP retains the traditional
3530 Pretty.pp argument to merge, which is absent in the standard
3531 Theory_Data version.
3533 * Sorts.certify_sort and derived "cert" operations for types and terms
3534 no longer minimize sorts. Thus certification at the boundary of the
3535 inference kernel becomes invariant under addition of class relations,
3536 which is an important monotonicity principle. Sorts are now minimized
3537 in the syntax layer only, at the boundary between the end-user and the
3538 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3539 explicitly in rare situations.
3541 * Renamed old-style Drule.standard to Drule.export_without_context, to
3542 emphasize that this is in no way a standard operation.
3545 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3546 usual for resolution. Rare INCOMPATIBILITY.
3548 * Renamed varify/unvarify operations to varify_global/unvarify_global
3549 to emphasize that these only work in a global situation (which is
3552 * Curried take and drop in library.ML; negative length is interpreted
3553 as infinity (as in chop). Subtle INCOMPATIBILITY.
3555 * Proof terms: type substitutions on proof constants now use canonical
3556 order of type variables. INCOMPATIBILITY for tools working with proof
3559 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3560 may no longer carry premises. User-level specifications are
3561 transformed accordingly by Thm.add_axiom/add_def.
3566 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3567 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3568 proof terms are enabled unconditionally in the new HOL-Proofs image.
3570 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3571 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3574 * Old lib/scripts/polyml-platform is superseded by the
3575 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3576 variant, even on a 64 bit machine. The following example setting
3577 prefers 64 bit if available:
3579 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3581 * The preliminary Isabelle/jEdit application demonstrates the emerging
3582 Isabelle/Scala layer for advanced prover interaction and integration.
3583 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3586 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3587 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3588 similar to the default assignment of the document preparation system
3589 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3590 provides some operations for direct access to the font without asking
3591 the user for manual installation.
3595 New in Isabelle2009-1 (December 2009)
3596 -------------------------------------
3600 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3601 one backslash should be used, even in ML sources.
3606 * Locale interpretation propagates mixins along the locale hierarchy.
3607 The currently only available mixins are the equations used to map
3608 local definitions to terms of the target domain of an interpretation.
3610 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3611 loc" to print all interpretations of locale "loc" in the theory.
3612 Interpretations in proofs are not shown.
3614 * Thoroughly revised locales tutorial. New section on conditional
3617 * On instantiation of classes, remaining undefined class parameters
3618 are formally declared. INCOMPATIBILITY.
3621 *** Document preparation ***
3623 * New generalized style concept for printing terms: @{foo (style) ...}
3624 instead of @{foo_style style ...} (old form is still retained for
3625 backward compatibility). Styles can be also applied for
3626 antiquotations prop, term_type and typeof.
3631 * New proof method "smt" for a combination of first-order logic with
3632 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3633 fixed-size bitvectors; there is also basic support for higher-order
3634 features (esp. lambda abstractions). It is an incomplete decision
3635 procedure based on external SMT solvers using the oracle mechanism;
3636 for the SMT solver Z3, this method is proof-producing. Certificates
3637 are provided to avoid calling the external solvers solely for
3638 re-checking proofs. Due to a remote SMT service there is no need for
3639 installing SMT solvers locally. See src/HOL/SMT.
3641 * New commands to load and prove verification conditions generated by
3642 the Boogie program verifier or derived systems (e.g. the Verifying C
3643 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3645 * New counterexample generator tool 'nitpick' based on the Kodkod
3646 relational model finder. See src/HOL/Tools/Nitpick and
3647 src/HOL/Nitpick_Examples.
3649 * New commands 'code_pred' and 'values' to invoke the predicate
3650 compiler and to enumerate values of inductive predicates.
3652 * A tabled implementation of the reflexive transitive closure.
3654 * New implementation of quickcheck uses generic code generator;
3655 default generators are provided for all suitable HOL types, records
3656 and datatypes. Old quickcheck can be re-activated importing theory
3657 Library/SML_Quickcheck.
3659 * New testing tool Mirabelle for automated proof tools. Applies
3660 several tools and tactics like sledgehammer, metis, or quickcheck, to
3661 every proof step in a theory. To be used in batch mode via the
3662 "mirabelle" utility.
3664 * New proof method "sos" (sum of squares) for nonlinear real
3665 arithmetic (originally due to John Harison). It requires theory
3666 Library/Sum_Of_Squares. It is not a complete decision procedure but
3667 works well in practice on quantifier-free real arithmetic with +, -,
3668 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3669 inequalities between polynomials. It makes use of external
3670 semidefinite programming solvers. Method "sos" generates a
3671 certificate that can be pasted into the proof thus avoiding the need
3672 to call an external tool every time the proof is checked. See
3673 src/HOL/Library/Sum_Of_Squares.
3675 * New method "linarith" invokes existing linear arithmetic decision
3678 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3680 * New Sledgehammer option "Full Types" in Proof General settings menu.
3681 Causes full type information to be output to the ATPs. This slows
3682 ATPs down considerably but eliminates a source of unsound "proofs"
3685 * New method "metisFT": A version of metis that uses full type
3686 information in order to avoid failures of proof reconstruction.
3688 * New evaluator "approximate" approximates an real valued term using
3689 the same method as the approximation method.
3691 * Method "approximate" now supports arithmetic expressions as
3692 boundaries of intervals and implements interval splitting and Taylor
3695 * ML antiquotation @{code_datatype} inserts definition of a datatype
3696 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3698 * New theory SupInf of the supremum and infimum operators for sets of
3701 * New theory Probability, which contains a development of measure
3702 theory, eventually leading to Lebesgue integration and probability.
3704 * Extended Multivariate Analysis to include derivation and Brouwer's
3707 * Reorganization of number theory, INCOMPATIBILITY:
3708 - new number theory development for nat and int, in theories Divides
3709 and GCD as well as in new session Number_Theory
3710 - some constants and facts now suffixed with _nat and _int
3712 - former session NumberTheory now named Old_Number_Theory, including
3713 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3714 - moved theory Pocklington from src/HOL/Library to
3715 src/HOL/Old_Number_Theory
3717 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3718 lcm of finite and infinite sets. It is shown that they form a complete
3721 * Class semiring_div requires superclass no_zero_divisors and proof of
3722 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3723 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3724 generalized to class semiring_div, subsuming former theorems
3725 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3726 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3729 * Refinements to lattice classes and sets:
3730 - less default intro/elim rules in locale variant, more default
3731 intro/elim rules in class variant: more uniformity
3732 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3734 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3736 - renamed ACI to inf_sup_aci
3737 - new class "boolean_algebra"
3738 - class "complete_lattice" moved to separate theory
3739 "Complete_Lattice"; corresponding constants (and abbreviations)
3740 renamed and with authentic syntax:
3741 Set.Inf ~> Complete_Lattice.Inf
3742 Set.Sup ~> Complete_Lattice.Sup
3743 Set.INFI ~> Complete_Lattice.INFI
3744 Set.SUPR ~> Complete_Lattice.SUPR
3745 Set.Inter ~> Complete_Lattice.Inter
3746 Set.Union ~> Complete_Lattice.Union
3747 Set.INTER ~> Complete_Lattice.INTER
3748 Set.UNION ~> Complete_Lattice.UNION
3749 - authentic syntax for
3752 - mere abbreviations:
3755 Set.inter (for inf, formerly Set.Int)
3756 Set.union (for sup, formerly Set.Un)
3757 Complete_Lattice.Inter (for Inf)
3758 Complete_Lattice.Union (for Sup)
3759 Complete_Lattice.INTER (for INFI)
3760 Complete_Lattice.UNION (for SUPR)
3761 - object-logic definitions as far as appropriate
3763 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3764 Un_subset_iff are explicitly deleted as default simp rules; then also
3765 their lattice counterparts le_inf_iff and le_sup_iff have to be
3766 deleted to achieve the desired effect.
3768 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3769 rules by default any longer; the same applies to min_max.inf_absorb1
3770 etc. INCOMPATIBILITY.
3772 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3773 pred_set_conv by default. INCOMPATIBILITY.
3775 * Power operations on relations and functions are now one dedicated
3776 constant "compow" with infix syntax "^^". Power operation on
3777 multiplicative monoids retains syntax "^" and is now defined generic
3778 in class power. INCOMPATIBILITY.
3780 * Relation composition "R O S" now has a more standard argument order:
3781 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3782 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3783 break, since the O_assoc rule was not rewritten like this. Fix using
3784 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3786 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3787 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3790 * Most rules produced by inductive and datatype package have mandatory
3791 prefixes. INCOMPATIBILITY.
3793 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3794 the attribute of the same name. Each of the theorems in the list
3795 DERIV_intros assumes composition with an additional function and
3796 matches a variable to the derivative, which has to be solved by the
3797 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3798 of most elementary terms. Former Maclauren.DERIV_tac and
3799 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3802 * Code generator attributes follow the usual underscore convention:
3803 code_unfold replaces code unfold
3804 code_post replaces code post
3809 sizechange -> size_change
3810 induct_scheme -> induction_schema
3813 * Discontinued abbreviation "arbitrary" of constant "undefined".
3814 INCOMPATIBILITY, use "undefined" directly.
3817 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3818 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3819 Suc_plus1 -> Suc_eq_plus1
3820 *anti_sym -> *antisym*
3821 vector_less_eq_def -> vector_le_def
3824 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3827 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3833 * Theory Representable defines a class "rep" of domains that are
3834 representable (via an ep-pair) in the universal domain type "udom".
3835 Instances are provided for all type constructors defined in HOLCF.
3837 * The 'new_domain' command is a purely definitional version of the
3838 domain package, for representable domains. Syntax is identical to the
3839 old domain package. The 'new_domain' package also supports indirect
3840 recursion using previously-defined type constructors. See
3841 src/HOLCF/ex/New_Domain.thy for examples.
3843 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3844 on the left-hand side of an equation, and then performs
3845 simplification. Rewriting is done using rules declared with the
3846 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3847 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3849 * The pattern-match compiler in 'fixrec' can now handle constructors
3850 with HOL function types. Pattern-match combinators for the Pair
3851 constructor are pre-configured.
3853 * The 'fixrec' package now produces better fixed-point induction rules
3854 for mutually-recursive definitions: Induction rules have conclusions
3855 of the form "P foo bar" instead of "P <foo, bar>".
3857 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3858 been renamed to "below". The name "below" now replaces "less" in many
3859 theorem names. (Legacy theorem names using "less" are still supported
3862 * The 'fixrec' package now supports "bottom patterns". Bottom
3863 patterns can be used to generate strictness rules, or to make
3864 functions more strict (much like the bang-patterns supported by the
3865 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3871 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3872 errors and run-time exceptions, including detailed source positions.
3874 * Structure Name_Space (formerly NameSpace) now manages uniquely
3875 identified entries, with some additional information such as source
3876 position, logical grouping etc.
3878 * Theory and context data is now introduced by the simplified and
3879 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3880 to be pure, but the old TheoryDataFun for mutable data (with explicit
3881 copy operation) is still available for some time.
3883 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3884 provides a high-level programming interface to synchronized state
3885 variables with atomic update. This works via pure function
3886 application within a critical section -- its runtime should be as
3887 short as possible; beware of deadlocks if critical code is nested,
3888 either directly or indirectly via other synchronized variables!
3890 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3891 wraps raw ML references, explicitly indicating their non-thread-safe
3892 behaviour. The Isar toplevel keeps this structure open, to
3893 accommodate Proof General as well as quick and dirty interactive
3894 experiments with references.
3896 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3897 parallel tactical reasoning.
3899 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3900 are similar to SUBPROOF, but are slightly more flexible: only the
3901 specified parts of the subgoal are imported into the context, and the
3902 body tactic may introduce new subgoals and schematic variables.
3904 * Old tactical METAHYPS, which does not observe the proof context, has
3905 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3906 or Subgoal.FOCUS etc.
3908 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3909 functors have their own ML name space there is no point to mark them
3910 separately.) Minor INCOMPATIBILITY.
3912 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3914 * Renamed several structures FooBar to Foo_Bar. Occasional,
3917 * Operations of structure Skip_Proof no longer require quick_and_dirty
3918 mode, which avoids critical setmp.
3920 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3921 combinators for "args". INCOMPATIBILITY, need to use simplified
3922 Attrib/Method.setup introduced in Isabelle2009.
3924 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3925 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3926 last resort. INCOMPATIBILITY.
3928 * Display.pretty_thm now requires a proper context (cf. former
3929 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3930 or even Display.pretty_thm_without_context as last resort.
3933 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3934 Syntax.pretty_typ/term directly, preferably with proper context
3935 instead of global theory.
3940 * Further fine tuning of parallel proof checking, scales up to 8 cores
3941 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3944 * Support for additional "Isabelle components" via etc/components, see
3945 also the system manual.
3947 * The isabelle makeall tool now operates on all components with
3948 IsaMakefile, not just hardwired "logics".
3950 * Removed "compress" option from isabelle-process and isabelle usedir;
3951 this is always enabled.
3953 * Discontinued support for Poly/ML 4.x versions.
3955 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3956 on a given logic image. This requires the lighttpd webserver and is
3957 currently supported on Linux only.
3961 New in Isabelle2009 (April 2009)
3962 --------------------------------
3966 * Simplified main Isabelle executables, with less surprises on
3967 case-insensitive file-systems (such as Mac OS).
3969 - The main Isabelle tool wrapper is now called "isabelle" instead of
3972 - The former "isabelle" alias for "isabelle-process" has been
3973 removed (should rarely occur to regular users).
3975 - The former "isabelle-interface" and its alias "Isabelle" have been
3976 removed (interfaces are now regular Isabelle tools).
3978 Within scripts and make files, the Isabelle environment variables
3979 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3980 respectively. (The latter are still available as legacy feature.)
3982 The old isabelle-interface wrapper could react in confusing ways if
3983 the interface was uninstalled or changed otherwise. Individual
3984 interface tool configuration is now more explicit, see also the
3985 Isabelle system manual. In particular, Proof General is now available
3986 via "isabelle emacs".
3988 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3989 purge installed copies of Isabelle executables and re-run "isabelle
3990 install -p ...", or use symlinks.
3992 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3993 old ~/isabelle, which was slightly non-standard and apt to cause
3994 surprises on case-insensitive file-systems (such as Mac OS).
3996 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3997 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3998 care is required when using older releases of Isabelle. Note that
3999 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4000 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4002 * Proofs of fully specified statements are run in parallel on
4003 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4004 a regular 4-core machine, if the initial heap space is made reasonably
4005 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4007 * The main reference manuals ("isar-ref", "implementation", and
4008 "system") have been updated and extended. Formally checked references
4009 as hyperlinks are now available uniformly.
4014 * Complete re-implementation of locales. INCOMPATIBILITY in several
4015 respects. The most important changes are listed below. See the
4016 Tutorial on Locales ("locales" manual) for details.
4018 - In locale expressions, instantiation replaces renaming. Parameters
4019 must be declared in a for clause. To aid compatibility with previous
4020 parameter inheritance, in locale declarations, parameters that are not
4021 'touched' (instantiation position "_" or omitted) are implicitly added
4022 with their syntax at the beginning of the for clause.
4024 - Syntax from abbreviations and definitions in locales is available in
4025 locale expressions and context elements. The latter is particularly
4026 useful in locale declarations.
4028 - More flexible mechanisms to qualify names generated by locale
4029 expressions. Qualifiers (prefixes) may be specified in locale
4030 expressions, and can be marked as mandatory (syntax: "name!:") or
4031 optional (syntax "name?:"). The default depends for plain "name:"
4032 depends on the situation where a locale expression is used: in
4033 commands 'locale' and 'sublocale' prefixes are optional, in
4034 'interpretation' and 'interpret' prefixes are mandatory. The old
4035 implicit qualifiers derived from the parameter names of a locale are
4036 no longer generated.
4038 - Command "sublocale l < e" replaces "interpretation l < e". The
4039 instantiation clause in "interpretation" and "interpret" (square
4040 brackets) is no longer available. Use locale expressions.
4042 - When converting proof scripts, mandatory qualifiers in
4043 'interpretation' and 'interpret' should be retained by default, even
4044 if this is an INCOMPATIBILITY compared to former behavior. In the
4045 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4046 in locale expressions range over a single locale instance only.
4048 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4049 In existing theorem specifications replace the includes element by the
4050 respective context elements of the included locale, omitting those
4051 that are already present in the theorem specification. Multiple
4052 assume elements of a locale should be replaced by a single one
4053 involving the locale predicate. In the proof body, declarations (most
4054 notably theorems) may be regained by interpreting the respective
4055 locales in the proof context as required (command "interpret").
4057 If using "includes" in replacement of a target solely because the
4058 parameter types in the theorem are not as general as in the target,
4059 consider declaring a new locale with additional type constraints on
4060 the parameters (context element "constrains").
4062 - Discontinued "locale (open)". INCOMPATIBILITY.
4064 - Locale interpretation commands no longer attempt to simplify goal.
4065 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4066 methods intro_locales and unfold_locales to clarify.
4068 - Locale interpretation commands no longer accept interpretation
4069 attributes. INCOMPATIBILITY.
4071 * Class declaration: so-called "base sort" must not be given in import
4072 list any longer, but is inferred from the specification. Particularly
4079 class foo = type + ...
4081 * Class target: global versions of theorems stemming do not carry a
4082 parameter prefix any longer. INCOMPATIBILITY.
4084 * Class 'instance' command no longer accepts attached definitions.
4085 INCOMPATIBILITY, use proper 'instantiation' target instead.
4087 * Recovered hiding of consts, which was accidentally broken in
4088 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4089 makes c inaccessible; consider using ``hide (open) const c'' instead.
4091 * Slightly more coherent Pure syntax, with updated documentation in
4092 isar-ref manual. Removed locales meta_term_syntax and
4093 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4094 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4095 directly in regular applications.
4097 * There is a new syntactic category "float_const" for signed decimal
4098 fractions (e.g. 123.45 or -123.45).
4100 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4101 interface with 'setup' command instead.
4103 * Command 'local_setup' is similar to 'setup', but operates on a local
4106 * The 'axiomatization' command now only works within a global theory
4107 context. INCOMPATIBILITY.
4109 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4110 hypotheses. Sorts required in the course of reasoning need to be
4111 covered by the constraints in the initial statement, completed by the
4112 type instance information of the background theory. Non-trivial sort
4113 hypotheses, which rarely occur in practice, may be specified via
4114 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4116 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4118 The result contains an implicit sort hypotheses as before --
4119 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4122 * Generalized Isar history, with support for linear undo, direct state
4125 * Changed defaults for unify configuration options:
4127 unify_trace_bound = 50 (formerly 25)
4128 unify_search_bound = 60 (formerly 30)
4130 * Different bookkeeping for code equations (INCOMPATIBILITY):
4132 a) On theory merge, the last set of code equations for a particular
4133 constant is taken (in accordance with the policy applied by other
4134 parts of the code generator framework).
4136 b) Code equations stemming from explicit declarations (e.g. code
4137 attribute) gain priority over default code equations stemming
4138 from definition, primrec, fun etc.
4140 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4142 * Unified theorem tables for both code generators. Thus [code
4143 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4145 * Command 'find_consts' searches for constants based on type and name
4148 find_consts "_ => bool"
4150 By default, matching is against subtypes, but it may be restricted to
4151 the whole type. Searching by name is possible. Multiple queries are
4152 conjunctive and queries may be negated by prefixing them with a
4155 find_consts strict: "_ => bool" name: "Int" -"int => int"
4157 * New 'find_theorems' criterion "solves" matches theorems that
4158 directly solve the current goal (modulo higher-order unification).
4160 * Auto solve feature for main theorem statements: whenever a new goal
4161 is stated, "find_theorems solves" is called; any theorems that could
4162 solve the lemma directly are listed as part of the goal state.
4163 Cf. associated options in Proof General Isabelle settings menu,
4164 enabled by default, with reasonable timeout for pathological cases of
4165 higher-order unification.
4168 *** Document preparation ***
4170 * Antiquotation @{lemma} now imitates a regular terminal proof,
4171 demanding keyword 'by' and supporting the full method expression
4172 syntax just like the Isar command 'by'.
4177 * Integrated main parts of former image HOL-Complex with HOL. Entry
4178 points Main and Complex_Main remain as before.
4180 * Logic image HOL-Plain provides a minimal HOL with the most important
4181 tools available (inductive, datatype, primrec, ...). This facilitates
4182 experimentation and tool development. Note that user applications
4183 (and library theories) should never refer to anything below theory
4186 * Logic image HOL-Main stops at theory Main, and thus facilitates
4187 experimentation due to shorter build times.
4189 * Logic image HOL-NSA contains theories of nonstandard analysis which
4190 were previously part of former HOL-Complex. Entry point Hyperreal
4191 remains valid, but theories formerly using Complex_Main should now use
4192 new entry point Hypercomplex.
4194 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4195 Posix processes. Avoids potentially expensive forking of the ML
4196 process. New thread-based implementation also works on non-Unix
4197 platforms (Cygwin). Provers are no longer hardwired, but defined
4198 within the theory via plain ML wrapper functions. Basic Sledgehammer
4199 commands are covered in the isar-ref manual.
4201 * Wrapper scripts for remote SystemOnTPTP service allows to use
4202 sledgehammer without local ATP installation (Vampire etc.). Other
4203 provers may be included via suitable ML wrappers, see also
4204 src/HOL/ATP_Linkup.thy.
4206 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4209 * The metis method no longer fails because the theorem is too trivial
4210 (contains the empty clause).
4212 * The metis method now fails in the usual manner, rather than raising
4213 an exception, if it determines that it cannot prove the theorem.
4215 * Method "coherent" implements a prover for coherent logic (see also
4216 src/Tools/coherent.ML).
4218 * Constants "undefined" and "default" replace "arbitrary". Usually
4219 "undefined" is the right choice to replace "arbitrary", though
4220 logically there is no difference. INCOMPATIBILITY.
4222 * Command "value" now integrates different evaluation mechanisms. The
4223 result of the first successful evaluation mechanism is printed. In
4224 square brackets a particular named evaluation mechanisms may be
4225 specified (currently, [SML], [code] or [nbe]). See further
4226 src/HOL/ex/Eval_Examples.thy.
4228 * Normalization by evaluation now allows non-leftlinear equations.
4229 Declare with attribute [code nbe].
4231 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4232 as the structured Isar versions "cases" and "induct", cf. the
4233 corresponding "cases" and "induct" attributes. Mutual induction rules
4234 are now presented as a list of individual projections
4235 (e.g. foo_bar.inducts for types foo and bar); the old format with
4236 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4237 rare situations a different rule is selected --- notably nested tuple
4238 elimination instead of former prod.exhaust: use explicit (case_tac t
4239 rule: prod.exhaust) here.
4241 * Attributes "cases", "induct", "coinduct" support "del" option.
4243 * Removed fact "case_split_thm", which duplicates "case_split".
4245 * The option datatype has been moved to a new theory Option. Renamed
4246 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4248 * New predicate "strict_mono" classifies strict functions on partial
4249 orders. With strict functions on linear orders, reasoning about
4250 (in)equalities is facilitated by theorems "strict_mono_eq",
4251 "strict_mono_less_eq" and "strict_mono_less".
4253 * Some set operations are now proper qualified constants with
4254 authentic syntax. INCOMPATIBILITY:
4265 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4268 * Auxiliary class "itself" has disappeared -- classes without any
4269 parameter are treated as expected by the 'class' command.
4271 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4273 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4274 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4276 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4277 method "approximation". It proves formulas on real values by using
4278 interval arithmetic. In the formulas are also the transcendental
4279 functions sin, cos, tan, atan, ln, exp and the constant pi are
4280 allowed. For examples see
4281 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4283 * Theory "Reflection" now resides in HOL/Library.
4285 * Entry point to Word library now simply named "Word".
4288 * Made source layout more coherent with logical distribution
4291 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4292 src/HOL/Library/Code_Message.thy ~> src/HOL/
4293 src/HOL/Library/GCD.thy ~> src/HOL/
4294 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4295 src/HOL/Library/Parity.thy ~> src/HOL/
4296 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4297 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4298 src/HOL/Real/Lubs.thy ~> src/HOL/
4299 src/HOL/Real/PReal.thy ~> src/HOL/
4300 src/HOL/Real/Rational.thy ~> src/HOL/
4301 src/HOL/Real/RComplete.thy ~> src/HOL/
4302 src/HOL/Real/RealDef.thy ~> src/HOL/
4303 src/HOL/Real/RealPow.thy ~> src/HOL/
4304 src/HOL/Real/Real.thy ~> src/HOL/
4305 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4306 src/HOL/Complex/Complex.thy ~> src/HOL/
4307 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4308 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4309 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4310 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4311 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4312 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4313 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4314 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4315 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4316 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4317 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4318 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4319 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4320 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4321 src/HOL/Real/Float ~> src/HOL/Library/
4322 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4323 src/HOL/Real/RealVector.thy ~> src/HOL/
4325 src/HOL/arith_data.ML ~> src/HOL/Tools
4326 src/HOL/hologic.ML ~> src/HOL/Tools
4327 src/HOL/simpdata.ML ~> src/HOL/Tools
4328 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4329 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4330 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4331 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4332 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4333 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4334 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4336 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4337 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4338 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4339 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4340 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4341 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4343 * If methods "eval" and "evaluation" encounter a structured proof
4344 state with !!/==>, only the conclusion is evaluated to True (if
4345 possible), avoiding strange error messages.
4347 * Method "sizechange" automates termination proofs using (a
4348 modification of) the size-change principle. Requires SAT solver. See
4349 src/HOL/ex/Termination.thy for examples.
4351 * Simplifier: simproc for let expressions now unfolds if bound
4352 variable occurs at most once in let expression body. INCOMPATIBILITY.
4354 * Method "arith": Linear arithmetic now ignores all inequalities when
4355 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4357 * New attribute "arith" for facts that should always be used
4358 automatically by arithmetic. It is intended to be used locally in
4361 assumes [arith]: "x > 0"
4363 Global usage is discouraged because of possible performance impact.
4365 * New classes "top" and "bot" with corresponding operations "top" and
4366 "bot" in theory Orderings; instantiation of class "complete_lattice"
4367 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4369 * Changed definition lemma "less_fun_def" in order to provide an
4370 instance for preorders on functions; use lemma "less_le" instead.
4373 * Theory Orderings: class "wellorder" moved here, with explicit
4374 induction rule "less_induct" as assumption. For instantiation of
4375 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4378 * Theory Orderings: added class "preorder" as superclass of "order".
4379 INCOMPATIBILITY: Instantiation proofs for order, linorder
4380 etc. slightly changed. Some theorems named order_class.* now named
4383 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4386 * Theory Finite_Set: added a new fold combinator of type
4388 ('a => 'b => 'b) => 'b => 'a set => 'b
4390 Occasionally this is more convenient than the old fold combinator
4391 which is now defined in terms of the new one and renamed to
4394 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4395 and "ring_simps" have been replaced by "algebra_simps" (which can be
4396 extended with further lemmas!). At the moment both still exist but
4397 the former will disappear at some point.
4399 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4400 class recpower. Type-specific simp rules for various recpower types
4401 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4403 rat_power_0 -> power_0
4404 rat_power_Suc -> power_Suc
4405 realpow_0 -> power_0
4406 realpow_Suc -> power_Suc
4407 complexpow_0 -> power_0
4408 complexpow_Suc -> power_Suc
4409 power_poly_0 -> power_0
4410 power_poly_Suc -> power_Suc
4412 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4413 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4414 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4415 of lemmas from Divides has been generalized from nat to class
4416 semiring_div. INCOMPATIBILITY. This involves the following theorem
4417 renames resulting from duplicate elimination:
4419 dvd_def_mod ~> dvd_eq_mod_eq_0
4420 zero_dvd_iff ~> dvd_0_left_iff
4421 dvd_0 ~> dvd_0_right
4422 DIVISION_BY_ZERO_DIV ~> div_by_0
4423 DIVISION_BY_ZERO_MOD ~> mod_by_0
4424 mult_div ~> div_mult_self2_is_id
4425 mult_mod ~> mod_mult_self2_is_0
4427 * Theory IntDiv: removed many lemmas that are instances of class-based
4428 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4429 rename old lemmas as follows:
4431 dvd_diff -> nat_dvd_diff
4432 dvd_zminus_iff -> dvd_minus_iff
4433 mod_add1_eq -> mod_add_eq
4434 mod_mult1_eq -> mod_mult_right_eq
4435 mod_mult1_eq' -> mod_mult_left_eq
4436 mod_mult_distrib_mod -> mod_mult_eq
4437 nat_mod_add_left_eq -> mod_add_left_eq
4438 nat_mod_add_right_eq -> mod_add_right_eq
4439 nat_mod_div_trivial -> mod_div_trivial
4440 nat_mod_mod_trivial -> mod_mod_trivial
4441 zdiv_zadd_self1 -> div_add_self1
4442 zdiv_zadd_self2 -> div_add_self2
4443 zdiv_zmult_self1 -> div_mult_self2_is_id
4444 zdiv_zmult_self2 -> div_mult_self1_is_id
4445 zdvd_triv_left -> dvd_triv_left
4446 zdvd_triv_right -> dvd_triv_right
4447 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4448 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4449 zmod_zadd_left_eq -> mod_add_left_eq
4450 zmod_zadd_right_eq -> mod_add_right_eq
4451 zmod_zadd_self1 -> mod_add_self1
4452 zmod_zadd_self2 -> mod_add_self2
4453 zmod_zadd1_eq -> mod_add_eq
4454 zmod_zdiff1_eq -> mod_diff_eq
4455 zmod_zdvd_zmod -> mod_mod_cancel
4456 zmod_zmod_cancel -> mod_mod_cancel
4457 zmod_zmult_self1 -> mod_mult_self2_is_0
4458 zmod_zmult_self2 -> mod_mult_self1_is_0
4461 zdvd_abs1 -> abs_dvd_iff
4462 zdvd_abs2 -> dvd_abs_iff
4463 zdvd_refl -> dvd_refl
4464 zdvd_trans -> dvd_trans
4465 zdvd_zadd -> dvd_add
4466 zdvd_zdiff -> dvd_diff
4467 zdvd_zminus_iff -> dvd_minus_iff
4468 zdvd_zminus2_iff -> minus_dvd_iff
4469 zdvd_zmultD -> dvd_mult_right
4470 zdvd_zmultD2 -> dvd_mult_left
4471 zdvd_zmult_mono -> mult_dvd_mono
4472 zdvd_0_right -> dvd_0_right
4473 zdvd_0_left -> dvd_0_left_iff
4474 zdvd_1_left -> one_dvd
4475 zminus_dvd_iff -> minus_dvd_iff
4477 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4479 * The real numbers offer decimal input syntax: 12.34 is translated
4480 into 1234/10^2. This translation is not reversed upon output.
4482 * Theory Library/Polynomial defines an abstract type 'a poly of
4483 univariate polynomials with coefficients of type 'a. In addition to
4484 the standard ring operations, it also supports div and mod. Code
4485 generation is also supported, using list-style constructors.
4487 * Theory Library/Inner_Product defines a class of real_inner for real
4488 inner product spaces, with an overloaded operation inner :: 'a => 'a
4489 => real. Class real_inner is a subclass of real_normed_vector from
4492 * Theory Library/Product_Vector provides instances for the product
4493 type 'a * 'b of several classes from RealVector and Inner_Product.
4494 Definitions of addition, subtraction, scalar multiplication, norms,
4495 and inner products are included.
4497 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4498 addition to the field operations, numerals and case syntax are also
4501 * Theory Library/Diagonalize provides constructive version of Cantor's
4502 first diagonalization argument.
4504 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4505 zlcm (for int); carried together from various gcd/lcm developements in
4506 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4507 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4508 may recover tupled syntax as follows:
4510 hide (open) const gcd
4511 abbreviation gcd where
4512 "gcd == (%(a, b). GCD.gcd a b)"
4514 GCD.gcd ("gcd '(_, _')")
4516 The same works for lcm, zgcd, zlcm.
4518 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4519 instantiations for algebraic structures. Removed some duplicate
4520 theorems. Changes in simp rules. INCOMPATIBILITY.
4522 * ML antiquotation @{code} takes a constant as argument and generates
4523 corresponding code in background and inserts name of the corresponding
4524 resulting ML value/function/datatype constructor binding in place.
4525 All occurrences of @{code} with a single ML block are generated
4526 simultaneously. Provides a generic and safe interface for
4527 instrumentalizing code generation. See
4528 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4529 In future you ought to refrain from ad-hoc compiling generated SML
4530 code on the ML toplevel. Note that (for technical reasons) @{code}
4531 cannot refer to constants for which user-defined serializations are
4532 set. Refer to the corresponding ML counterpart directly in that
4535 * Command 'rep_datatype': instead of theorem names the command now
4536 takes a list of terms denoting the constructors of the type to be
4537 represented as datatype. The characteristic theorems have to be
4538 proven. INCOMPATIBILITY. Also observe that the following theorems
4539 have disappeared in favour of existing ones:
4541 unit_induct ~> unit.induct
4542 prod_induct ~> prod.induct
4543 sum_induct ~> sum.induct
4544 Suc_Suc_eq ~> nat.inject
4545 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4550 * New locales for orders and lattices where the equivalence relation
4551 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4552 locales use a record structure with field eq for the equivalence.
4554 * New theory of factorial domains.
4556 * Units_l_inv and Units_r_inv are now simp rules by default.
4557 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4558 and/or r_inv will now also require deletion of these lemmas.
4560 * Renamed the following theorems, INCOMPATIBILITY:
4562 UpperD ~> Upper_memD
4563 LowerD ~> Lower_memD
4564 least_carrier ~> least_closed
4565 greatest_carrier ~> greatest_closed
4566 greatest_Lower_above ~> greatest_Lower_below
4567 one_zero ~> carrier_one_zero
4568 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4573 * Nominal datatypes can now contain type-variables.
4575 * Commands 'nominal_inductive' and 'equivariance' work with local
4578 * Nominal primrec can now works with local theory targets and its
4579 specification syntax now conforms to the general format as seen in
4582 * Method "perm_simp" honours the standard simplifier attributes
4583 (no_asm), (no_asm_use) etc.
4585 * The new predicate #* is defined like freshness, except that on the
4586 left hand side can be a set or list of atoms.
4588 * Experimental command 'nominal_inductive2' derives strong induction
4589 principles for inductive definitions. In contrast to
4590 'nominal_inductive', which can only deal with a fixed number of
4591 binders, it can deal with arbitrary expressions standing for sets of
4592 atoms to be avoided. The only inductive definition we have at the
4593 moment that needs this generalisation is the typing rule for Lets in
4596 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4597 -----------------------------------------------------------------
4598 Gamma |- Let x be t1 in t2 : T2
4600 In this rule one wants to avoid all the binders that are introduced by
4601 "close Gamma T1". We are looking for other examples where this
4602 feature might be useful. Please let us know.
4607 * Reimplemented the simplification procedure for proving continuity
4608 subgoals. The new simproc is extensible; users can declare additional
4609 continuity introduction rules with the attribute [cont2cont].
4611 * The continuity simproc now uses a different introduction rule for
4612 solving continuity subgoals on terms with lambda abstractions. In
4613 some rare cases the new simproc may fail to solve subgoals that the
4614 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4615 Potential INCOMPATIBILITY.
4617 * Command 'fixrec': specification syntax now conforms to the general
4618 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4619 examples. INCOMPATIBILITY.
4624 * Proof of Zorn's Lemma for partial orders.
4629 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4630 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4631 depends on multithreading, so timouts will not work before Poly/ML
4634 * High-level support for concurrent ML programming, see
4635 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4636 particularly convenient to organize independent functional
4637 computations. The concept of "synchronized variables" provides a
4638 higher-order interface for components with shared state, avoiding the
4639 delicate details of mutexes and condition variables. (Requires
4640 Poly/ML 5.2.1 or later.)
4642 * ML bindings produced via Isar commands are stored within the Isar
4643 context (theory or proof). Consequently, commands like 'use' and 'ML'
4644 become thread-safe and work with undo as expected (concerning
4645 top-level bindings, not side-effects on global references).
4646 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4647 compiler at runtime; really global bindings need to be given outside a
4648 theory. (Requires Poly/ML 5.2 or later.)
4650 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4651 context. Top-level ML bindings are stored within the proof context in
4652 a purely sequential fashion, disregarding the nested proof structure.
4653 ML bindings introduced by 'ML_prf' are discarded at the end of the
4654 proof. (Requires Poly/ML 5.2 or later.)
4656 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4657 and Method.setup, as well as Isar commands 'attribute_setup' and
4658 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4659 existing code accordingly, or use plain 'setup' together with old
4662 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4663 to 'a -> thm, while results are always tagged with an authentic oracle
4664 name. The Isar command 'oracle' is now polymorphic, no argument type
4665 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4666 accordingly. Note that extra performance may be gained by producing
4667 the cterm carefully, avoiding slow Thm.cterm_of.
4669 * Simplified interface for defining document antiquotations via
4670 ThyOutput.antiquotation, ThyOutput.output, and optionally
4671 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4672 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4675 * More systematic treatment of long names, abstract name bindings, and
4676 name space operations. Basic operations on qualified names have been
4677 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4678 Long_Name.append. Old type bstring has been mostly replaced by
4679 abstract type binding (see structure Binding), which supports precise
4680 qualification by packages and local theory targets, as well as proper
4681 tracking of source positions. INCOMPATIBILITY, need to wrap old
4682 bstring values into Binding.name, or better pass through abstract
4683 bindings everywhere. See further src/Pure/General/long_name.ML,
4684 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4686 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4687 LocalTheory.note etc.) now refer to the *full* internal name, not the
4688 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4690 * Disposed old type and term read functions (Sign.read_def_typ,
4691 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4692 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4693 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4694 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4695 resort for legacy applications.
4697 * Disposed old declarations, tactics, tactic combinators that refer to
4698 the simpset or claset of an implicit theory (such as Addsimps,
4699 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4700 embedded ML text, or local_simpset_of with a proper context passed as
4701 explicit runtime argument.
4703 * Rules and tactics that read instantiations (read_instantiate,
4704 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4705 context, which is required for parsing and type-checking. Moreover,
4706 the variables are specified as plain indexnames, not string encodings
4707 thereof. INCOMPATIBILITY.
4709 * Generic Toplevel.add_hook interface allows to analyze the result of
4710 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4711 for theorem dependency output of transactions resulting in a new
4714 * ML antiquotations: block-structured compilation context indicated by
4715 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4717 @{binding name} - basic name binding
4718 @{let ?pat = term} - term abbreviation (HO matching)
4719 @{note name = fact} - fact abbreviation
4720 @{thm fact} - singleton fact (with attributes)
4721 @{thms fact} - general fact (with attributes)
4722 @{lemma prop by method} - singleton goal
4723 @{lemma prop by meth1 meth2} - singleton goal
4724 @{lemma prop1 ... propN by method} - general goal
4725 @{lemma prop1 ... propN by meth1 meth2} - general goal
4726 @{lemma (open) ...} - open derivation
4731 * The Isabelle "emacs" tool provides a specific interface to invoke
4732 Proof General / Emacs, with more explicit failure if that is not
4733 installed (the old isabelle-interface script silently falls back on
4734 isabelle-process). The PROOFGENERAL_HOME setting determines the
4735 installation location of the Proof General distribution.
4737 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4738 the Isabelle process into a JVM/Scala application. See
4739 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4740 process wrapper has been discontinued.)
4742 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4744 * Various status messages (with exact source position information) are
4745 emitted, if proper markup print mode is enabled. This allows
4746 user-interface components to provide detailed feedback on internal
4751 New in Isabelle2008 (June 2008)
4752 -------------------------------
4756 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4757 and updated, with formally checked references as hyperlinks.
4759 * Theory loader: use_thy (and similar operations) no longer set the
4760 implicit ML context, which was occasionally hard to predict and in
4761 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4762 provides a proper context already.
4764 * Theory loader: old-style ML proof scripts being *attached* to a thy
4765 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4766 'use' within a theory file will do the job.
4768 * Name space merge now observes canonical order, i.e. the second space
4769 is inserted into the first one, while existing entries in the first
4770 space take precedence. INCOMPATIBILITY in rare situations, may try to
4771 swap theory imports.
4773 * Syntax: symbol \<chi> is now considered a letter. Potential
4774 INCOMPATIBILITY in identifier syntax etc.
4776 * Outer syntax: string tokens no longer admit escaped white space,
4777 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4778 white space without escapes.
4780 * Outer syntax: string tokens may contain arbitrary character codes
4781 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4787 * Context-dependent token translations. Default setup reverts locally
4788 fixed variables, and adds hilite markup for undeclared frees.
4790 * Unused theorems can be found using the new command 'unused_thms'.
4791 There are three ways of invoking it:
4794 Only finds unused theorems in the current theory.
4796 (2) unused_thms thy_1 ... thy_n -
4797 Finds unused theorems in the current theory and all of its ancestors,
4798 excluding the theories thy_1 ... thy_n and all of their ancestors.
4800 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4801 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4802 their ancestors, excluding the theories thy_1 ... thy_n and all of
4805 In order to increase the readability of the list produced by
4806 unused_thms, theorems that have been created by a particular instance
4807 of a theory command such as 'inductive' or 'function' are considered
4808 to belong to the same "group", meaning that if at least one theorem in
4809 this group is used, the other theorems in the same group are no longer
4810 reported as unused. Moreover, if all theorems in the group are
4811 unused, only one theorem in the group is displayed.
4813 Note that proof objects have to be switched on in order for
4814 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4815 usually the case when using Proof General with the default settings).
4817 * Authentic naming of facts disallows ad-hoc overwriting of previous
4818 theorems within the same name space. INCOMPATIBILITY, need to remove
4819 duplicate fact bindings, or even accidental fact duplications. Note
4820 that tools may maintain dynamically scoped facts systematically, using
4821 PureThy.add_thms_dynamic.
4823 * Command 'hide' now allows to hide from "fact" name space as well.
4825 * Eliminated destructive theorem database, simpset, claset, and
4826 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4827 update of theories within ML code.
4829 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4830 INCOMPATIBILITY, object-logics depending on former Pure require
4831 additional setup PureThy.old_appl_syntax_setup; object-logics
4832 depending on former CPure need to refer to Pure.
4834 * Commands 'use' and 'ML' are now purely functional, operating on
4835 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4836 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4839 * Command 'setup': discontinued implicit version with ML reference.
4841 * Instantiation target allows for simultaneous specification of class
4842 instance operations together with an instantiation proof.
4843 Type-checking phase allows to refer to class operations uniformly.
4844 See src/HOL/Complex/Complex.thy for an Isar example and
4845 src/HOL/Library/Eval.thy for an ML example.
4847 * Indexing of literal facts: be more serious about including only
4848 facts from the visible specification/proof context, but not the
4849 background context (locale etc.). Affects `prop` notation and method
4850 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4853 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4854 "(open)" option, which used to expose internal bound variables to the
4857 * Isar statements: removed obsolete case "rule_context".
4858 INCOMPATIBILITY, better use explicit fixes/assumes.
4860 * Locale proofs: default proof step now includes 'unfold_locales';
4861 hence 'proof' without argument may be used to unfold locale
4865 *** Document preparation ***
4867 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4868 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4869 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4870 spot); renamed link color from "darkblue" to "linkcolor" (default
4871 value unchanged, can be redefined via \definecolor); no longer sets
4872 "a4paper" option (unnecessary or even intrusive).
4874 * Antiquotation @{lemma A method} proves proposition A by the given
4875 method (either a method name or a method name plus (optional) method
4876 arguments in parentheses) and prints A just like @{prop A}.
4881 * New primrec package. Specification syntax conforms in style to
4882 definition/function/.... No separate induction rule is provided. The
4883 "primrec" command distinguishes old-style and new-style specifications
4884 by syntax. The former primrec package is now named OldPrimrecPackage.
4885 When adjusting theories, beware: constants stemming from new-style
4886 primrec specifications have authentic syntax.
4888 * Metis prover is now an order of magnitude faster, and also works
4889 with multithreading.
4891 * Metis: the maximum number of clauses that can be produced from a
4892 theorem is now given by the attribute max_clauses. Theorems that
4893 exceed this number are ignored, with a warning printed.
4895 * Sledgehammer no longer produces structured proofs by default. To
4896 enable, declare [[sledgehammer_full = true]]. Attributes
4897 reconstruction_modulus, reconstruction_sorts renamed
4898 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4900 * Method "induct_scheme" derives user-specified induction rules
4901 from well-founded induction and completeness of patterns. This factors
4902 out some operations that are done internally by the function package
4903 and makes them available separately. See
4904 src/HOL/ex/Induction_Scheme.thy for examples.
4906 * More flexible generation of measure functions for termination
4907 proofs: Measure functions can be declared by proving a rule of the
4908 form "is_measure f" and giving it the [measure_function] attribute.
4909 The "is_measure" predicate is logically meaningless (always true), and
4910 just guides the heuristic. To find suitable measure functions, the
4911 termination prover sets up the goal "is_measure ?f" of the appropriate
4912 type and generates all solutions by prolog-style backwards proof using
4915 This setup also deals with rules like
4917 "is_measure f ==> is_measure (list_size f)"
4919 which accommodates nested datatypes that recurse through lists.
4920 Similar rules are predeclared for products and option types.
4922 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4926 - Definitions of overloaded constants on sets have to be replaced by
4927 definitions on => and bool.
4929 - Some definitions of overloaded operators on sets can now be proved
4930 using the definitions of the operators on => and bool. Therefore,
4931 the following theorems have been renamed:
4933 subset_def -> subset_eq
4934 psubset_def -> psubset_eq
4935 set_diff_def -> set_diff_eq
4936 Compl_def -> Compl_eq
4937 Sup_set_def -> Sup_set_eq
4938 Inf_set_def -> Inf_set_eq
4939 sup_set_def -> sup_set_eq
4940 inf_set_def -> inf_set_eq
4942 - Due to the incompleteness of the HO unification algorithm, some
4943 rules such as subst may require manual instantiation, if some of
4944 the unknowns in the rule is a set.
4946 - Higher order unification and forward proofs:
4949 have "P (S::'a set)" <...>
4950 then have "EX S. P S" ..
4952 no longer works (due to the incompleteness of the HO unification
4953 algorithm) and must be replaced by the pattern
4960 - Calculational reasoning with subst (or similar rules):
4963 have "P (S::'a set)" <...>
4964 also have "S = T" <...>
4965 finally have "P T" .
4967 no longer works (for similar reasons as the previous example) and
4968 must be replaced by something like
4970 have "P (S::'a set)" <...>
4971 moreover have "S = T" <...>
4972 ultimately have "P T" by simp
4974 - Tactics or packages written in ML code:
4975 Code performing pattern matching on types via
4977 Type ("set", [T]) => ...
4979 must be rewritten. Moreover, functions like strip_type or
4980 binder_types no longer return the right value when applied to a
4983 T1 => ... => Tn => U => bool
4987 T1 => ... => Tn => U set
4989 * Merged theories Wellfounded_Recursion, Accessible_Part and
4990 Wellfounded_Relations to theory Wellfounded.
4992 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4994 * Class finite no longer treats UNIV as class parameter. Use class
4995 enum from theory Library/Enum instead to achieve a similar effect.
4998 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4999 and "Cons". INCOMPATIBILITY.
5001 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5002 Potential INCOMPATIBILITY.
5004 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5005 injective_fst_snd removed, use split_eta and prod_eqI instead.
5006 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5008 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5009 the same name in theory Orderings:
5019 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5020 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5021 and different variable names.
5023 * Library/Option_ord.thy: Canonical order on option type.
5025 * Library/RBT.thy: Red-black trees, an efficient implementation of
5028 * Library/Countable.thy: Type class for countable types.
5030 * Theory Int: The representation of numerals has changed. The infix
5031 operator BIT and the bit datatype with constructors B0 and B1 have
5032 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5033 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5034 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5037 * Theory Nat: definition of <= and < on natural numbers no longer
5038 depend on well-founded relations. INCOMPATIBILITY. Definitions
5039 le_def and less_def have disappeared. Consider lemmas not_less
5040 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5042 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5043 (whose purpose mainly is for various fold_set functionals) have been
5044 abandoned in favor of the existing algebraic classes
5045 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5046 lower_semilattice (resp. upper_semilattice) and linorder.
5049 * Theory Transitive_Closure: induct and cases rules now declare proper
5050 case_names ("base" and "step"). INCOMPATIBILITY.
5052 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5053 lattices. The form set-specific version is available as
5054 Inductive.lfp_ordinal_induct_set.
5056 * Renamed theorems "power.simps" to "power_int.simps".
5059 * Class semiring_div provides basic abstract properties of semirings
5060 with division and modulo operations. Subsumes former class dvd_mod.
5062 * Merged theories IntDef, Numeral and IntArith into unified theory
5063 Int. INCOMPATIBILITY.
5065 * Theory Library/Code_Index: type "index" now represents natural
5066 numbers rather than integers. INCOMPATIBILITY.
5068 * New class "uminus" with operation "uminus" (split of from class
5069 "minus" which now only has operation "minus", binary).
5072 * Constants "card", "internal_split", "option_map" now with authentic
5073 syntax. INCOMPATIBILITY.
5075 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5076 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5077 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5078 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5079 Sup_set_def, le_def, less_def, option_map_def now with object
5080 equality. INCOMPATIBILITY.
5082 * Records. Removed K_record, and replaced it by pure lambda term
5083 %x. c. The simplifier setup is now more robust against eta expansion.
5084 INCOMPATIBILITY: in cases explicitly referring to K_record.
5086 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5088 * Library/ListVector: new theory of arithmetic vector operations.
5090 * Library/Order_Relation: new theory of various orderings as sets of
5091 pairs. Defines preorders, partial orders, linear orders and
5092 well-orders on sets and on types.
5097 * Renamed some theories to allow to loading both ZF and HOL in the
5100 Datatype -> Datatype_ZF
5101 Inductive -> Inductive_ZF
5108 INCOMPATIBILITY: ZF theories that import individual theories below
5109 Main might need to be adapted. Regular theory Main is still
5110 available, as trivial extension of Main_ZF.
5115 * ML within Isar: antiquotation @{const name} or @{const
5116 name(typargs)} produces statically-checked Const term.
5118 * Functor NamedThmsFun: data is available to the user as dynamic fact
5119 (of the same name). Removed obsolete print command.
5121 * Removed obsolete "use_legacy_bindings" function.
5123 * The ``print mode'' is now a thread-local value derived from a global
5124 template (the former print_mode reference), thus access becomes
5125 non-critical. The global print_mode reference is for session
5126 management only; user-code should use print_mode_value,
5127 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5129 * Functions system/system_out provide a robust way to invoke external
5130 shell commands, with propagation of interrupts (requires Poly/ML
5131 5.2.1). Do not use OS.Process.system etc. from the basis library!
5136 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5137 in accordance with Proof General 3.7, which prefers GNU emacs.
5139 * isatool tty runs Isabelle process with plain tty interaction;
5140 optional line editor may be specified via ISABELLE_LINE_EDITOR
5141 setting, the default settings attempt to locate "ledit" and "rlwrap".
5143 * isatool browser now works with Cygwin as well, using general
5144 "javapath" function defined in Isabelle process environment.
5146 * YXML notation provides a simple and efficient alternative to
5147 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5148 isatool yxml as described in the Isabelle system manual.
5150 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5151 provides general wrapper for managing an Isabelle process in a robust
5152 fashion, with ``cooked'' output from stdin/stderr.
5154 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5155 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5157 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5158 way of changing the user's settings is via
5159 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5162 * Multithreading.max_threads := 0 refers to the number of actual CPU
5163 cores of the underlying machine, which is a good starting point for
5164 optimal performance tuning. The corresponding usedir option -M allows
5165 "max" as an alias for "0". WARNING: does not work on certain versions
5166 of Mac OS (with Poly/ML 5.1).
5168 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5169 adverse effect of Isabelle flooding interactive front-ends (notably
5170 ProofGeneral / XEmacs).
5174 New in Isabelle2007 (November 2007)
5175 -----------------------------------
5179 * More uniform information about legacy features, notably a
5180 warning/error of "Legacy feature: ...", depending on the state of the
5181 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5182 legacy features will disappear eventually.
5184 * Theory syntax: the header format ``theory A = B + C:'' has been
5185 discontinued in favour of ``theory A imports B C begin''. Use isatool
5186 fixheaders to convert existing theory files. INCOMPATIBILITY.
5188 * Theory syntax: the old non-Isar theory file format has been
5189 discontinued altogether. Note that ML proof scripts may still be used
5190 with Isar theories; migration is usually quite simple with the ML
5191 function use_legacy_bindings. INCOMPATIBILITY.
5193 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5194 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5197 * Theory loader: be more serious about observing the static theory
5198 header specifications (including optional directories), but not the
5199 accidental file locations of previously successful loads. The strict
5200 update policy of former update_thy is now already performed by
5201 use_thy, so the former has been removed; use_thys updates several
5202 theories simultaneously, just as 'imports' within a theory header
5203 specification, but without merging the results. Potential
5204 INCOMPATIBILITY: may need to refine theory headers and commands
5205 ROOT.ML which depend on load order.
5207 * Theory loader: optional support for content-based file
5208 identification, instead of the traditional scheme of full physical
5209 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5210 (cf. the system manual). The new scheme allows to work with
5211 non-finished theories in persistent session images, such that source
5212 files may be moved later on without requiring reloads.
5214 * Theory loader: old-style ML proof scripts being *attached* to a thy
5215 file (with the same base name as the theory) are considered a legacy
5216 feature, which will disappear eventually. Even now, the theory loader
5217 no longer maintains dependencies on such files.
5219 * Syntax: the scope for resolving ambiguities via type-inference is
5220 now limited to individual terms, instead of whole simultaneous
5221 specifications as before. This greatly reduces the complexity of the
5222 syntax module and improves flexibility by separating parsing and
5223 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5224 'fixes' etc.) are required in rare situations.
5226 * Syntax: constants introduced by new-style packages ('definition',
5227 'abbreviation' etc.) are passed through the syntax module in
5228 ``authentic mode''. This means that associated mixfix annotations
5229 really stick to such constants, independently of potential name space
5230 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5231 trees are represented slightly differently, may need to adapt syntax
5232 translations accordingly. Use CONST marker in 'translations' and
5233 @{const_syntax} antiquotation in 'parse_translation' etc.
5235 * Legacy goal package: reduced interface to the bare minimum required
5236 to keep existing proof scripts running. Most other user-level
5237 functions are now part of the OldGoals structure, which is *not* open
5238 by default (consider isatool expandshort before open OldGoals).
5239 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5240 these tend to cause confusion about the actual goal (!) context being
5241 used here, which is not necessarily the same as the_context().
5243 * Command 'find_theorems': supports "*" wild-card in "name:"
5244 criterion; "with_dups" option. Certain ProofGeneral versions might
5245 support a specific search form (see ProofGeneral/CHANGES).
5247 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5248 by default, which means that "prems" (and also "fixed variables") are
5249 suppressed from proof state output. Note that the ProofGeneral
5250 settings mechanism allows to change and save options persistently, but
5251 older versions of Isabelle will fail to start up if a negative prems
5254 * Local theory targets may be specified by non-nested blocks of
5255 ``context/locale/class ... begin'' followed by ``end''. The body may
5256 contain definitions, theorems etc., including any derived mechanism
5257 that has been implemented on top of these primitives. This concept
5258 generalizes the existing ``theorem (in ...)'' towards more versatility
5261 * Proof General interface: proper undo of final 'end' command;
5262 discontinued Isabelle/classic mode (ML proof scripts).
5265 *** Document preparation ***
5267 * Added antiquotation @{theory name} which prints the given name,
5268 after checking that it refers to a valid ancestor theory in the
5271 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5272 check the given source text as ML type/structure, printing verbatim.
5274 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5275 "c args == rhs" given in the current context. (Any number of
5276 arguments may be given on the LHS.)
5281 * The 'class' package offers a combination of axclass and locale to
5282 achieve Haskell-like type classes in Isabelle. Definitions and
5283 theorems within a class context produce both relative results (with
5284 implicit parameters according to the locale context), and polymorphic
5285 constants with qualified polymorphism (according to the class
5286 context). Within the body context of a 'class' target, a separate
5287 syntax layer ("user space type system") takes care of converting
5288 between global polymorphic consts and internal locale representation.
5289 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5290 "isatool doc classes" provides a tutorial.
5292 * Generic code generator framework allows to generate executable
5293 code for ML and Haskell (including Isabelle classes). A short usage
5296 internal compilation:
5297 export_code <list of constants (term syntax)> in SML
5298 writing SML code to a file:
5299 export_code <list of constants (term syntax)> in SML <filename>
5300 writing OCaml code to a file:
5301 export_code <list of constants (term syntax)> in OCaml <filename>
5302 writing Haskell code to a bunch of files:
5303 export_code <list of constants (term syntax)> in Haskell <filename>
5305 evaluating closed propositions to True/False using code generation:
5308 Reasonable default setup of framework in HOL.
5310 Theorem attributs for selecting and transforming function equations theorems:
5312 [code fun]: select a theorem as function equation for a specific constant
5313 [code fun del]: deselect a theorem as function equation for a specific constant
5314 [code inline]: select an equation theorem for unfolding (inlining) in place
5315 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5317 User-defined serializations (target in {SML, OCaml, Haskell}):
5319 code_const <and-list of constants (term syntax)>
5320 {(target) <and-list of const target syntax>}+
5322 code_type <and-list of type constructors>
5323 {(target) <and-list of type target syntax>}+
5325 code_instance <and-list of instances>
5327 where instance ::= <type constructor> :: <class>
5329 code_class <and_list of classes>
5330 {(target) <and-list of class target syntax>}+
5331 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5333 code_instance and code_class only are effective to target Haskell.
5335 For example usage see src/HOL/ex/Codegenerator.thy and
5336 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5337 generation from Isabelle/HOL theories is available via "isatool doc
5340 * Code generator: consts in 'consts_code' Isar commands are now
5341 referred to by usual term syntax (including optional type
5344 * Command 'no_translations' removes translation rules from theory
5347 * Overloaded definitions are now actually checked for acyclic
5348 dependencies. The overloading scheme is slightly more general than
5349 that of Haskell98, although Isabelle does not demand an exact
5350 correspondence to type class and instance declarations.
5351 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5352 exotic versions of overloading -- at the discretion of the user!
5354 Polymorphic constants are represented via type arguments, i.e. the
5355 instantiation that matches an instance against the most general
5356 declaration given in the signature. For example, with the declaration
5357 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5358 as c(nat). Overloading is essentially simultaneous structural
5359 recursion over such type arguments. Incomplete specification patterns
5360 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5361 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5362 Command 'print_theory' outputs the normalized system of recursive
5363 equations, see section "definitions".
5365 * Configuration options are maintained within the theory or proof
5366 context (with name and type bool/int/string), providing a very simple
5367 interface to a poor-man's version of general context data. Tools may
5368 declare options in ML (e.g. using Attrib.config_int) and then refer to
5369 these values using Config.get etc. Users may change options via an
5370 associated attribute of the same name. This form of context
5371 declaration works particularly well with commands 'declare' or
5372 'using', for example ``declare [[foo = 42]]''. Thus it has become
5373 very easy to avoid global references, which would not observe Isar
5374 toplevel undo/redo and fail to work with multithreading.
5376 Various global ML references of Pure and HOL have been turned into
5377 configuration options:
5379 Unify.search_bound unify_search_bound
5380 Unify.trace_bound unify_trace_bound
5381 Unify.trace_simp unify_trace_simp
5382 Unify.trace_types unify_trace_types
5383 Simplifier.simp_depth_limit simp_depth_limit
5384 Blast.depth_limit blast_depth_limit
5385 DatatypeProp.dtK datatype_distinctness_limit
5386 fast_arith_neq_limit fast_arith_neq_limit
5387 fast_arith_split_limit fast_arith_split_limit
5389 * Named collections of theorems may be easily installed as context
5390 data using the functor NamedThmsFun (see also
5391 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5392 attributes; there is also a toplevel print command. This facility is
5393 just a common case of general context data, which is the preferred way
5394 for anything more complex than just a list of facts in canonical
5397 * Isar: command 'declaration' augments a local theory by generic
5398 declaration functions written in ML. This enables arbitrary content
5399 being added to the context, depending on a morphism that tells the
5400 difference of the original declaration context wrt. the application
5401 context encountered later on.
5403 * Isar: proper interfaces for simplification procedures. Command
5404 'simproc_setup' declares named simprocs (with match patterns, and body
5405 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5406 context. ML antiquotation @{simproc name} retrieves named simprocs.
5408 * Isar: an extra pair of brackets around attribute declarations
5409 abbreviates a theorem reference involving an internal dummy fact,
5410 which will be ignored later --- only the effect of the attribute on
5411 the background context will persist. This form of in-place
5412 declarations is particularly useful with commands like 'declare' and
5413 'using', for example ``have A using [[simproc a]] by simp''.
5415 * Isar: method "assumption" (and implicit closing of subproofs) now
5416 takes simple non-atomic goal assumptions into account: after applying
5417 an assumption as a rule the resulting subgoals are solved by atomic
5418 assumption steps. This is particularly useful to finish 'obtain'
5419 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5420 without referring to the original premise "!!x. P x ==> thesis" in the
5421 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5424 * Isar: implicit use of prems from the Isar proof context is
5425 considered a legacy feature. Common applications like ``have A .''
5426 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5427 referencing facts explicitly here improves readability and
5428 maintainability of proof texts.
5430 * Isar: improper proof element 'guess' is like 'obtain', but derives
5431 the obtained context from the course of reasoning! For example:
5433 assume "EX x y. A x & B y" -- "any previous fact"
5434 then guess x and y by clarify
5436 This technique is potentially adventurous, depending on the facts and
5437 proof tools being involved here.
5439 * Isar: known facts from the proof context may be specified as literal
5440 propositions, using ASCII back-quote syntax. This works wherever
5441 named facts used to be allowed so far, in proof commands, proof
5442 methods, attributes etc. Literal facts are retrieved from the context
5443 according to unification of type and term parameters. For example,
5444 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5445 theorems in the current context, then these are valid literal facts:
5446 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5448 There is also a proof method "fact" which does the same composition
5449 for explicit goal states, e.g. the following proof texts coincide with
5450 certain special cases of literal facts:
5452 have "A" by fact == note `A`
5453 have "A ==> B" by fact == note `A ==> B`
5454 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5455 have "P a ==> Q a" by fact == note `P a ==> Q a`
5457 * Isar: ":" (colon) is no longer a symbolic identifier character in
5458 outer syntax. Thus symbolic identifiers may be used without
5459 additional white space in declarations like this: ``assume *: A''.
5461 * Isar: 'print_facts' prints all local facts of the current context,
5462 both named and unnamed ones.
5464 * Isar: 'def' now admits simultaneous definitions, e.g.:
5466 def x == "t" and y == "u"
5468 * Isar: added command 'unfolding', which is structurally similar to
5469 'using', but affects both the goal state and facts by unfolding given
5470 rewrite rules. Thus many occurrences of the 'unfold' method or
5471 'unfolded' attribute may be replaced by first-class proof text.
5473 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5474 and command 'unfolding' now all support object-level equalities
5475 (potentially conditional). The underlying notion of rewrite rule is
5476 analogous to the 'rule_format' attribute, but *not* that of the
5477 Simplifier (which is usually more generous).
5479 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5480 premises of a theorem by n. Useful in conjunction with drule.
5482 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5483 method expression within a sandbox consisting of the first N
5484 sub-goals, which need to exist. For example, ``simp_all [3]''
5485 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5486 simplifies all new goals that emerge from applying rule foo to the
5487 originally first one.
5489 * Isar: schematic goals are no longer restricted to higher-order
5490 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5493 * Isar: the conclusion of a long theorem statement is now either
5494 'shows' (a simultaneous conjunction, as before), or 'obtains'
5495 (essentially a disjunction of cases with local parameters and
5496 assumptions). The latter allows to express general elimination rules
5497 adequately; in this notation common elimination rules look like this:
5499 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5501 obtains x where "P x"
5503 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5507 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5513 The subsequent classical rules even refer to the formal "thesis"
5516 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5519 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5520 obtains "thesis ==> something"
5522 The actual proof of an 'obtains' statement is analogous to that of the
5523 Isar proof element 'obtain', only that there may be several cases.
5524 Optional case names may be specified in parentheses; these will be
5525 available both in the present proof and as annotations in the
5526 resulting rule, for later use with the 'cases' method (cf. attribute
5529 * Isar: the assumptions of a long theorem statement are available as
5530 "assms" fact in the proof context. This is more appropriate than the
5531 (historical) "prems", which refers to all assumptions of the current
5532 context, including those from the target locale, proof body etc.
5534 * Isar: 'print_statement' prints theorems from the current theory or
5535 proof context in long statement form, according to the syntax of a
5538 * Isar: 'obtain' takes an optional case name for the local context
5539 introduction rule (default "that").
5541 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5542 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5545 * Pure: syntax "CONST name" produces a fully internalized constant
5546 according to the current context. This is particularly useful for
5547 syntax translations that should refer to internal constant
5548 representations independently of name spaces.
5550 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5551 instead of "FOO ". This allows multiple binder declarations to coexist
5552 in the same context. INCOMPATIBILITY.
5554 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5555 primitive that also works in a locale context (both for constants and
5556 fixed variables). Type declaration and internal syntactic representation
5557 of given constants retrieved from the context. Likewise, the
5558 'no_notation' command allows to remove given syntax annotations from the
5561 * Isar/locales: new derived specification elements 'axiomatization',
5562 'definition', 'abbreviation', which support type-inference, admit
5563 object-level specifications (equality, equivalence). See also the
5564 isar-ref manual. Examples:
5567 eq (infix "===" 50) where
5568 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5570 definition "f x y = x + y + 1"
5571 definition g where "g x = f x x"
5574 neq (infix "=!=" 50) where
5575 "x =!= y == ~ (x === y)"
5577 These specifications may be also used in a locale context. Then the
5578 constants being introduced depend on certain fixed parameters, and the
5579 constant name is qualified by the locale base name. An internal
5580 abbreviation takes care for convenient input and output, making the
5581 parameters implicit and using the original short name. See also
5582 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5583 entities from a monomorphic theory.
5585 Presently, abbreviations are only available 'in' a target locale, but
5586 not inherited by general import expressions. Also note that
5587 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5588 'translations' in common applications. The "no_abbrevs" print mode
5589 prevents folding of abbreviations in term output.
5591 Concrete syntax is attached to specified constants in internal form,
5592 independently of name spaces. The parse tree representation is
5593 slightly different -- use 'notation' instead of raw 'syntax', and
5594 'translations' with explicit "CONST" markup to accommodate this.
5596 * Pure/Isar: unified syntax for new-style specification mechanisms
5597 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5598 full type inference and dummy patterns ("_"). For example:
5600 definition "K x _ = x"
5602 inductive conj for A B
5603 where "A ==> B ==> conj A B"
5605 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5606 the current context. Print mode "no_abbrevs" prevents inversion of
5607 abbreviations on output.
5609 * Isar/locales: improved parameter handling: use of locales "var" and
5610 "struct" no longer necessary; - parameter renamings are no longer
5611 required to be injective. For example, this allows to define
5612 endomorphisms as locale endom = homom mult mult h.
5614 * Isar/locales: changed the way locales with predicates are defined.
5615 Instead of accumulating the specification, the imported expression is
5616 now an interpretation. INCOMPATIBILITY: different normal form of
5617 locale expressions. In particular, in interpretations of locales with
5618 predicates, goals repesenting already interpreted fragments are not
5619 removed automatically. Use methods `intro_locales' and
5620 `unfold_locales'; see below.
5622 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5623 provide backward reasoning on locales predicates. The methods are
5624 aware of interpretations and discharge corresponding goals.
5625 `intro_locales' is less aggressive then `unfold_locales' and does not
5626 unfold predicates to assumptions.
5628 * Isar/locales: the order in which locale fragments are accumulated
5629 has changed. This enables to override declarations from fragments due
5630 to interpretations -- for example, unwanted simp rules.
5632 * Isar/locales: interpretation in theories and proof contexts has been
5633 extended. One may now specify (and prove) equations, which are
5634 unfolded in interpreted theorems. This is useful for replacing
5635 defined concepts (constants depending on locale parameters) by
5636 concepts already existing in the target context. Example:
5638 interpretation partial_order ["op <= :: [int, int] => bool"]
5639 where "partial_order.less (op <=) (x::int) y = (x < y)"
5641 Typically, the constant `partial_order.less' is created by a
5642 definition specification element in the context of locale
5645 * Method "induct": improved internal context management to support
5646 local fixes and defines on-the-fly. Thus explicit meta-level
5647 connectives !! and ==> are rarely required anymore in inductive goals
5648 (using object-logic connectives for this purpose has been long
5649 obsolete anyway). Common proof patterns are explained in
5650 src/HOL/Induct/Common_Patterns.thy, see also
5651 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5654 * Method "induct": improved handling of simultaneous goals. Instead of
5655 introducing object-level conjunction, the statement is now split into
5656 several conclusions, while the corresponding symbolic cases are nested
5657 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5658 see src/HOL/Induct/Common_Patterns.thy, for example.
5660 * Method "induct": mutual induction rules are now specified as a list
5661 of rule sharing the same induction cases. HOL packages usually provide
5662 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5663 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5664 mutual induction rules differently, i.e. like this:
5666 (induct rule: foo_bar.inducts)
5667 (induct set: foo bar)
5668 (induct pred: foo bar)
5669 (induct type: foo bar)
5671 The ML function ProjectRule.projections turns old-style rules into the
5674 * Method "coinduct": dual of induction, see
5675 src/HOL/Library/Coinductive_List.thy for various examples.
5677 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5678 considered a legacy feature.
5680 * Attribute "symmetric" produces result with standardized schematic
5681 variables (index 0). Potential INCOMPATIBILITY.
5683 * Simplifier: by default the simplifier trace only shows top level
5684 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5685 default. Thus there is less danger of being flooded by the trace. The
5686 trace indicates where parts have been suppressed.
5688 * Provers/classical: removed obsolete classical version of elim_format
5689 attribute; classical elim/dest rules are now treated uniformly when
5690 manipulating the claset.
5692 * Provers/classical: stricter checks to ensure that supplied intro,
5693 dest and elim rules are well-formed; dest and elim rules must have at
5696 * Provers/classical: attributes dest/elim/intro take an optional
5697 weight argument for the rule (just as the Pure versions). Weights are
5698 ignored by automated tools, but determine the search order of single
5701 * Syntax: input syntax now supports dummy variable binding "%_. b",
5702 where the body does not mention the bound variable. Note that dummy
5703 patterns implicitly depend on their context of bounds, which makes
5704 "{_. _}" match any set comprehension as expected. Potential
5705 INCOMPATIBILITY -- parse translations need to cope with syntactic
5706 constant "_idtdummy" in the binding position.
5708 * Syntax: removed obsolete syntactic constant "_K" and its associated
5709 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5710 for example "A -> B" => "Pi A (%_. B)".
5712 * Pure: 'class_deps' command visualizes the subclass relation, using
5713 the graph browser tool.
5715 * Pure: 'print_theory' now suppresses certain internal declarations by
5716 default; use '!' option for full details.
5721 * Method "metis" proves goals by applying the Metis general-purpose
5722 resolution prover (see also http://gilith.com/software/metis/).
5723 Examples are in the directory MetisExamples. WARNING: the
5724 Isabelle/HOL-Metis integration does not yet work properly with
5727 * Command 'sledgehammer' invokes external automatic theorem provers as
5728 background processes. It generates calls to the "metis" method if
5729 successful. These can be pasted into the proof. Users do not have to
5730 wait for the automatic provers to return. WARNING: does not really
5731 work with multi-threading.
5733 * New "auto_quickcheck" feature tests outermost goal statements for
5734 potential counter-examples. Controlled by ML references
5735 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5736 5000 milliseconds). Fails silently if statements is outside of
5737 executable fragment, or any other codgenerator problem occurs.
5739 * New constant "undefined" with axiom "undefined x = undefined".
5741 * Added class "HOL.eq", allowing for code generation with polymorphic
5744 * Some renaming of class constants due to canonical name prefixing in
5745 the new 'class' package:
5747 HOL.abs ~> HOL.abs_class.abs
5748 HOL.divide ~> HOL.divide_class.divide
5749 0 ~> HOL.zero_class.zero
5750 1 ~> HOL.one_class.one
5751 op + ~> HOL.plus_class.plus
5752 op - ~> HOL.minus_class.minus
5753 uminus ~> HOL.minus_class.uminus
5754 op * ~> HOL.times_class.times
5755 op < ~> HOL.ord_class.less
5756 op <= > HOL.ord_class.less_eq
5757 Nat.power ~> Power.power_class.power
5758 Nat.size ~> Nat.size_class.size
5759 Numeral.number_of ~> Numeral.number_class.number_of
5760 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5761 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5762 Orderings.min ~> Orderings.ord_class.min
5763 Orderings.max ~> Orderings.ord_class.max
5764 Divides.op div ~> Divides.div_class.div
5765 Divides.op mod ~> Divides.div_class.mod
5766 Divides.op dvd ~> Divides.div_class.dvd
5768 INCOMPATIBILITY. Adaptions may be required in the following cases:
5770 a) User-defined constants using any of the names "plus", "minus",
5771 "times", "less" or "less_eq". The standard syntax translations for
5772 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5775 b) Variables named "plus", "minus", "times", "less", "less_eq"
5776 INCOMPATIBILITY: use more specific names.
5778 c) Permutative equations (e.g. "a + b = b + a")
5779 Since the change of names also changes the order of terms, permutative
5780 rewrite rules may get applied in a different order. Experience shows
5781 that this is rarely the case (only two adaptions in the whole Isabelle
5782 distribution). INCOMPATIBILITY: rewrite proofs
5784 d) ML code directly refering to constant names
5785 This in general only affects hand-written proof tactics, simprocs and
5786 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5787 Consider using @{const_name} antiquotation.
5789 * New class "default" with associated constant "default".
5791 * Function "sgn" is now overloaded and available on int, real, complex
5792 (and other numeric types), using class "sgn". Two possible defs of
5793 sgn are given as equational assumptions in the classes sgn_if and
5794 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5797 * Locale "partial_order" now unified with class "order" (cf. theory
5798 Orderings), added parameter "less". INCOMPATIBILITY.
5800 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5801 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5802 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5804 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5805 changed order of proof goals in instance proofs.
5807 * The transitivity reasoner for partial and linear orders is set up
5808 for classes "order" and "linorder". Instances of the reasoner are available
5809 in all contexts importing or interpreting the corresponding locales.
5810 Method "order" invokes the reasoner separately; the reasoner
5811 is also integrated with the Simplifier as a solver. Diagnostic
5812 command 'print_orders' shows the available instances of the reasoner
5813 in the current context.
5815 * Localized monotonicity predicate in theory "Orderings"; integrated
5816 lemmas max_of_mono and min_of_mono with this predicate.
5819 * Formulation of theorem "dense" changed slightly due to integration
5820 with new class dense_linear_order.
5822 * Uniform lattice theory development in HOL.
5824 constants "meet" and "join" now named "inf" and "sup"
5825 constant "Meet" now named "Inf"
5827 classes "meet_semilorder" and "join_semilorder" now named
5828 "lower_semilattice" and "upper_semilattice"
5829 class "lorder" now named "lattice"
5830 class "comp_lat" now named "complete_lattice"
5832 Instantiation of lattice classes allows explicit definitions
5833 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5835 INCOMPATIBILITY. Theorem renames:
5837 meet_left_le ~> inf_le1
5838 meet_right_le ~> inf_le2
5839 join_left_le ~> sup_ge1
5840 join_right_le ~> sup_ge2
5841 meet_join_le ~> inf_sup_ord
5844 le_meet ~> le_inf_iff
5845 le_join ~> ge_sup_conv
5846 meet_idempotent ~> inf_idem
5847 join_idempotent ~> sup_idem
5848 meet_comm ~> inf_commute
5849 join_comm ~> sup_commute
5850 meet_leI1 ~> le_infI1
5851 meet_leI2 ~> le_infI2
5852 le_joinI1 ~> le_supI1
5853 le_joinI2 ~> le_supI2
5854 meet_assoc ~> inf_assoc
5855 join_assoc ~> sup_assoc
5856 meet_left_comm ~> inf_left_commute
5857 meet_left_idempotent ~> inf_left_idem
5858 join_left_comm ~> sup_left_commute
5859 join_left_idempotent ~> sup_left_idem
5862 le_def_meet ~> le_iff_inf
5863 le_def_join ~> le_iff_sup
5864 join_absorp2 ~> sup_absorb2
5865 join_absorp1 ~> sup_absorb1
5866 meet_absorp1 ~> inf_absorb1
5867 meet_absorp2 ~> inf_absorb2
5868 meet_join_absorp ~> inf_sup_absorb
5869 join_meet_absorp ~> sup_inf_absorb
5870 distrib_join_le ~> distrib_sup_le
5871 distrib_meet_le ~> distrib_inf_le
5873 add_meet_distrib_left ~> add_inf_distrib_left
5874 add_join_distrib_left ~> add_sup_distrib_left
5875 is_join_neg_meet ~> is_join_neg_inf
5876 is_meet_neg_join ~> is_meet_neg_sup
5877 add_meet_distrib_right ~> add_inf_distrib_right
5878 add_join_distrib_right ~> add_sup_distrib_right
5879 add_meet_join_distribs ~> add_sup_inf_distribs
5880 join_eq_neg_meet ~> sup_eq_neg_inf
5881 meet_eq_neg_join ~> inf_eq_neg_sup
5882 add_eq_meet_join ~> add_eq_inf_sup
5883 meet_0_imp_0 ~> inf_0_imp_0
5884 join_0_imp_0 ~> sup_0_imp_0
5885 meet_0_eq_0 ~> inf_0_eq_0
5886 join_0_eq_0 ~> sup_0_eq_0
5887 neg_meet_eq_join ~> neg_inf_eq_sup
5888 neg_join_eq_meet ~> neg_sup_eq_inf
5889 join_eq_if ~> sup_eq_if
5891 mono_meet ~> mono_inf
5892 mono_join ~> mono_sup
5893 meet_bool_eq ~> inf_bool_eq
5894 join_bool_eq ~> sup_bool_eq
5895 meet_fun_eq ~> inf_fun_eq
5896 join_fun_eq ~> sup_fun_eq
5897 meet_set_eq ~> inf_set_eq
5898 join_set_eq ~> sup_set_eq
5899 meet1_iff ~> inf1_iff
5900 meet2_iff ~> inf2_iff
5909 join1_iff ~> sup1_iff
5910 join2_iff ~> sup2_iff
5920 is_meet_Meet ~> is_meet_Inf
5921 Meet_bool_def ~> Inf_bool_def
5922 Meet_fun_def ~> Inf_fun_def
5923 Meet_greatest ~> Inf_greatest
5924 Meet_lower ~> Inf_lower
5925 Meet_set_def ~> Inf_set_def
5928 Sup_bool_eq ~> Sup_bool_def
5929 Sup_fun_eq ~> Sup_fun_def
5930 Sup_set_eq ~> Sup_set_def
5932 listsp_meetI ~> listsp_infI
5933 listsp_meet_eq ~> listsp_inf_eq
5938 * Added syntactic class "size"; overloaded constant "size" now has
5939 type "'a::size ==> bool"
5941 * Internal reorganisation of `size' of datatypes: size theorems
5942 "foo.size" are no longer subsumed by "foo.simps" (but are still
5943 simplification rules by default!); theorems "prod.size" now named
5946 * Class "div" now inherits from class "times" rather than "type".
5949 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5950 Linorder etc. have disappeared; operations defined in terms of
5951 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5953 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5955 * HOL-Word: New extensive library and type for generic, fixed size
5956 machine words, with arithmetic, bit-wise, shifting and rotating
5957 operations, reflection into int, nat, and bool lists, automation for
5958 linear arithmetic (by automatic reflection into nat or int), including
5959 lemmas on overflow and monotonicity. Instantiated to all appropriate
5960 arithmetic type classes, supporting automatic simplification of
5961 numerals on all operations.
5963 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5965 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5967 * Code generator library theories:
5968 - Code_Integer represents HOL integers by big integer literals in target
5970 - Code_Char represents HOL characters by character literals in target
5972 - Code_Char_chr like Code_Char, but also offers treatment of character
5973 codes; includes Code_Integer.
5974 - Executable_Set allows to generate code for finite sets using lists.
5975 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5977 - Executable_Real implements a subset of real numbers, namly those
5978 representable by rational numbers.
5979 - Efficient_Nat implements natural numbers by integers, which in general will
5980 result in higher efficency; pattern matching with 0/Suc is eliminated;
5981 includes Code_Integer.
5982 - Code_Index provides an additional datatype index which is mapped to
5983 target-language built-in integers.
5984 - Code_Message provides an additional datatype message_string which is isomorphic to
5985 strings; messages are mapped to target-language strings.
5987 * New package for inductive predicates
5989 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5992 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5993 for z_1 :: U_1 and ... and z_n :: U_m
5995 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5998 with full support for type-inference, rather than
6000 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6002 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6003 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6005 inductive "s z_1 ... z_m"
6007 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6010 For backward compatibility, there is a wrapper allowing inductive
6011 sets to be defined with the new package via
6014 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6015 for z_1 :: U_1 and ... and z_n :: U_m
6017 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6023 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6024 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6025 for z_1 :: U_1 and ... and z_n :: U_m
6027 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6028 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6031 if the additional syntax "p ..." is required.
6033 Numerous examples can be found in the subdirectories src/HOL/Auth,
6034 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6038 - Since declaration and definition of inductive sets or predicates
6039 is no longer separated, abbreviations involving the newly
6040 introduced sets or predicates must be specified together with the
6041 introduction rules after the 'where' keyword (see above), rather
6042 than before the actual inductive definition.
6044 - The variables in induction and elimination rules are now
6045 quantified in the order of their occurrence in the introduction
6046 rules, rather than in alphabetical order. Since this may break
6047 some proofs, these proofs either have to be repaired, e.g. by
6048 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6049 statements of the form
6051 case (rule_i a_i_1 ... a_i_{k_i})
6053 or the old order of quantification has to be restored by explicitly adding
6054 meta-level quantifiers in the introduction rules, i.e.
6056 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6058 - The format of the elimination rules is now
6060 p z_1 ... z_m x_1 ... x_n ==>
6061 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6066 (x_1, ..., x_n) : s z_1 ... z_m ==>
6067 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6070 for sets rather than
6072 x : s z_1 ... z_m ==>
6073 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6076 This may require terms in goals to be expanded to n-tuples
6077 (e.g. using case_tac or simplification with the split_paired_all
6078 rule) before the above elimination rule is applicable.
6080 - The elimination or case analysis rules for (mutually) inductive
6081 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6082 list of rules "p_1_..._p_k.elims" is no longer available.
6084 * New package "function"/"fun" for general recursive functions,
6085 supporting mutual and nested recursion, definitions in local contexts,
6086 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6087 for small examples, and the separate tutorial on the function
6088 package. The old recdef "package" is still available as before, but
6089 users are encouraged to use the new package.
6091 * Method "lexicographic_order" automatically synthesizes termination
6092 relations as lexicographic combinations of size measures.
6094 * Case-expressions allow arbitrary constructor-patterns (including
6095 "_") and take their order into account, like in functional
6096 programming. Internally, this is translated into nested
6097 case-expressions; missing cases are added and mapped to the predefined
6098 constant "undefined". In complicated cases printing may no longer show
6099 the original input but the internal form. Lambda-abstractions allow
6100 the same form of pattern matching: "% pat1 => e1 | ..." is an
6101 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6104 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6105 is an abbreviation for "of_nat :: nat => int". The simplification
6106 rules for "of_nat" have been changed to work like "int" did
6107 previously. Potential INCOMPATIBILITY:
6108 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6109 - of_nat_diff and of_nat_mult are no longer default simp rules
6111 * Method "algebra" solves polynomial equations over (semi)rings using
6112 Groebner bases. The (semi)ring structure is defined by locales and the
6113 tool setup depends on that generic context. Installing the method for
6114 a specific type involves instantiating the locale and possibly adding
6115 declarations for computation on the coefficients. The method is
6116 already instantiated for natural numbers and for the axiomatic class
6117 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6118 CALCULEMUS 2007 for the general principles underlying this
6119 architecture of context-aware proof-tools.
6121 * Method "ferrack" implements quantifier elimination over
6122 special-purpose dense linear orders using locales (analogous to
6123 "algebra"). The method is already installed for class
6124 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6127 * Former constant "List.op @" now named "List.append". Use ML
6128 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6129 circumvent possible incompatibilities when working on ML level.
6131 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6133 * New function listsum :: 'a list => 'a for arbitrary monoids.
6134 Special syntax: "SUM x <- xs. f x" (and latex variants)
6136 * New syntax for Haskell-like list comprehension (input only), eg.
6137 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6139 * The special syntax for function "filter" has changed from [x :
6140 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6141 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6143 * [a..b] is now defined for arbitrary linear orders. It used to be
6144 defined on nat only, as an abbreviation for [a..<Suc b]
6147 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6149 * New functions "sorted" and "sort" in src/HOL/List.thy.
6151 * New lemma collection field_simps (an extension of ring_simps) for
6152 manipulating (in)equations involving division. Multiplies with all
6153 denominators that can be proved to be non-zero (in equations) or
6154 positive/negative (in inequations).
6156 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6157 have been improved and renamed to ring_simps, group_simps and
6158 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6159 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6161 * Theory Library/Commutative_Ring: switched from recdef to function
6162 package; constants add, mul, pow now curried. Infix syntax for
6163 algebraic operations.
6165 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6168 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6171 * HOL/records: generalised field-update to take a function on the
6172 field rather than the new value: r(|A := x|) is translated to A_update
6173 (K x) r The K-combinator that is internally used is called K_record.
6174 INCOMPATIBILITY: Usage of the plain update functions has to be
6177 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6178 * x = 0, which are required for a semiring. Richer structures do not
6179 inherit from semiring_0 anymore, because this property is a theorem
6180 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6181 there is more to prove, but this is mostly trivial.
6183 * Class "recpower" is generalized to arbitrary monoids, not just
6184 commutative semirings. INCOMPATIBILITY: may need to incorporate
6185 commutativity or semiring properties additionally.
6187 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6188 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6189 better use 'abbreviation'.
6191 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6193 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6194 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6195 significant changes for setting up numeral syntax for types:
6196 - New constants Numeral.pred and Numeral.succ instead
6197 of former Numeral.bin_pred and Numeral.bin_succ.
6198 - Use integer operations instead of bin_add, bin_mult and so on.
6199 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6200 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6202 See src/HOL/Integ/IntArith.thy for an example setup.
6204 * Command 'normal_form' computes the normal form of a term that may
6205 contain free variables. For example ``normal_form "rev [a, b, c]"''
6206 produces ``[b, c, a]'' (without proof). This command is suitable for
6207 heavy-duty computations because the functions are compiled to ML
6208 first. Correspondingly, a method "normalization" is provided. See
6209 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6211 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6212 25 like -->); output depends on the "iff" print_mode, the default is
6213 "A = B" (with priority 50).
6215 * Relations less (<) and less_eq (<=) are also available on type bool.
6216 Modified syntax to disallow nesting without explicit parentheses,
6217 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6220 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6222 * Relation composition operator "op O" now has precedence 75 and binds
6223 stronger than union and intersection. INCOMPATIBILITY.
6225 * The old set interval syntax "{m..n(}" (and relatives) has been
6226 removed. Use "{m..<n}" (and relatives) instead.
6228 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6229 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6230 ``declare [[simproc del: neq]]''.
6232 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6235 * Theorem Cons_eq_map_conv no longer declared as "simp".
6237 * Theorem setsum_mult renamed to setsum_right_distrib.
6239 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6242 * Reimplemented methods "sat" and "satx", with several improvements:
6243 goals no longer need to be stated as "<prems> ==> False", equivalences
6244 (i.e. "=" on type bool) are handled, variable names of the form
6245 "lit_<n>" are no longer reserved, significant speedup.
6247 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6248 zChaff is still supported as well.
6250 * 'inductive' and 'datatype': provide projections of mutual rules,
6251 bundled as foo_bar.inducts;
6253 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6256 * Library: moved theory Accessible_Part to main HOL.
6258 * Library: added theory Coinductive_List of potentially infinite lists
6259 as greatest fixed-point.
6261 * Library: added theory AssocList which implements (finite) maps as
6264 * Method "evaluation" solves goals (i.e. a boolean expression)
6265 efficiently by compiling it to ML. The goal is "proved" (via an
6266 oracle) if it evaluates to True.
6268 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6269 also when invoked by the simplifier. This results in the Simplifier
6270 being more powerful on arithmetic goals. INCOMPATIBILITY.
6271 Configuration option fast_arith_split_limit=0 recovers the old
6274 * Support for hex (0x20) and binary (0b1001) numerals.
6276 * New method: reify eqs (t), where eqs are equations for an
6277 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6278 parameter, computes a term s::'b and a list xs::'a list and proves the
6279 theorem I xs s = t. This is also known as reification or quoting. The
6280 resulting theorem is applied to the subgoal to substitute t with I xs
6281 s. If t is omitted, the subgoal itself is reified.
6283 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6284 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6285 where f is supposed to be a computable function (in the sense of code
6286 generattion). The method uses reify to compute s and xs as above then
6287 applies corr_thm and uses normalization by evaluation to "prove" f s =
6288 r and finally gets the theorem t = r, which is again applied to the
6289 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6291 * Reflection: Automatic reification now handels binding, an example is
6292 available in src/HOL/ex/ReflectionEx.thy
6294 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6295 command 'statespace' that is similar to 'record', but introduces an
6296 abstract specification based on the locale infrastructure instead of
6297 HOL types. This leads to extra flexibility in composing state spaces,
6298 in particular multiple inheritance and renaming of components.
6303 * Hyperreal: Functions root and sqrt are now defined on negative real
6304 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6305 Nonnegativity side conditions have been removed from many lemmas, so
6306 that more subgoals may now be solved by simplification; potential
6309 * Real: new type classes formalize real normed vector spaces and
6310 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6311 and norm :: 'a => real.
6313 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6314 reals into other types. The overloaded constant Reals :: 'a set is now
6315 defined as range of_real; potential INCOMPATIBILITY.
6317 * Real: proper support for ML code generation, including 'quickcheck'.
6318 Reals are implemented as arbitrary precision rationals.
6320 * Hyperreal: Several constants that previously worked only for the
6321 reals have been generalized, so they now work over arbitrary vector
6322 spaces. Type annotations may need to be added in some cases; potential
6325 Infinitesimal :: ('a::real_normed_vector) star set
6326 HFinite :: ('a::real_normed_vector) star set
6327 HInfinite :: ('a::real_normed_vector) star set
6328 approx :: ('a::real_normed_vector) star => 'a star => bool
6329 monad :: ('a::real_normed_vector) star => 'a star set
6330 galaxy :: ('a::real_normed_vector) star => 'a star set
6331 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6332 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6333 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6334 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6335 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6336 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6337 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6338 sgn :: 'a::real_normed_vector => 'a
6339 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6341 * Complex: Some complex-specific constants are now abbreviations for
6342 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6343 hnorm. Other constants have been entirely removed in favor of the
6344 polymorphic versions (INCOMPATIBILITY):
6348 HInfinite <-- CInfinite
6349 Infinitesimal <-- CInfinitesimal
6352 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6353 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6354 (ns)deriv <-- (ns)cderiv
6359 * Formalisation of ideals and the quotient construction over rings.
6361 * Order and lattice theory no longer based on records.
6364 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6365 greatest_closed. INCOMPATIBILITY.
6367 * Method algebra is now set up via an attribute. For examples see
6368 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6369 of algebraic structures.
6371 * Renamed theory CRing to Ring.
6376 * Substantial, yet incomplete support for nominal datatypes (binding
6377 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6378 src/HOL/Nominal/Examples. Prospective users should consult
6379 http://isabelle.in.tum.de/nominal/
6384 * ML basics: just one true type int, which coincides with IntInf.int
6387 * ML within Isar: antiquotations allow to embed statically-checked
6388 formal entities in the source, referring to the context available at
6389 compile-time. For example:
6391 ML {* @{sort "{zero,one}"} *}
6392 ML {* @{typ "'a => 'b"} *}
6393 ML {* @{term "%x. x"} *}
6394 ML {* @{prop "x == y"} *}
6395 ML {* @{ctyp "'a => 'b"} *}
6396 ML {* @{cterm "%x. x"} *}
6397 ML {* @{cprop "x == y"} *}
6398 ML {* @{thm asm_rl} *}
6399 ML {* @{thms asm_rl} *}
6400 ML {* @{type_name c} *}
6401 ML {* @{type_syntax c} *}
6402 ML {* @{const_name c} *}
6403 ML {* @{const_syntax c} *}
6406 ML {* @{theory Pure} *}
6407 ML {* @{theory_ref} *}
6408 ML {* @{theory_ref Pure} *}
6411 ML {* @{clasimpset} *}
6413 The same works for sources being ``used'' within an Isar context.
6415 * ML in Isar: improved error reporting; extra verbosity with
6416 ML_Context.trace enabled.
6418 * Pure/General/table.ML: the join operations now works via exceptions
6419 DUP/SAME instead of type option. This is simpler in simple cases, and
6420 admits slightly more efficient complex applications.
6422 * Pure: 'advanced' translation functions (parse_translation etc.) now
6423 use Context.generic instead of just theory.
6425 * Pure: datatype Context.generic joins theory/Proof.context and
6426 provides some facilities for code that works in either kind of
6427 context, notably GenericDataFun for uniform theory and proof data.
6429 * Pure: simplified internal attribute type, which is now always
6430 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6431 local (Proof.context) attributes have been discontinued, while
6432 minimizing code duplication. Thm.rule_attribute and
6433 Thm.declaration_attribute build canonical attributes; see also structure
6434 Context for further operations on Context.generic, notably
6435 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6436 declarations and definitions.
6438 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6439 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6440 init only required for impure data. INCOMPATIBILITY: empty really need
6441 to be empty (no dependencies on theory content!)
6443 * Pure/kernel: consts certification ignores sort constraints given in
6444 signature declarations. (This information is not relevant to the
6445 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6446 potential INCOMPATIBILITY.
6448 * Pure: axiomatic type classes are now purely definitional, with
6449 explicit proofs of class axioms and super class relations performed
6450 internally. See Pure/axclass.ML for the main internal interfaces --
6451 notably AxClass.define_class supercedes AxClass.add_axclass, and
6452 AxClass.axiomatize_class/classrel/arity supersede
6453 Sign.add_classes/classrel/arities.
6455 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6456 global/local versions on theory vs. Proof.context have been
6457 discontinued; Attrib.syntax and Method.syntax have been adapted
6458 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6459 attributes, methods, etc.
6461 * Pure: several functions of signature "... -> theory -> theory * ..."
6462 have been reoriented to "... -> theory -> ... * theory" in order to
6463 allow natural usage in combination with the ||>, ||>>, |-> and
6464 fold_map combinators.
6466 * Pure: official theorem names (closed derivations) and additional
6467 comments (tags) are now strictly separate. Name hints -- which are
6468 maintained as tags -- may be attached any time without affecting the
6471 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6472 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6473 achieve the old behaviour.
6475 * Pure: the "Goal" constant is now called "prop", supporting a
6476 slightly more general idea of ``protecting'' meta-level rule
6479 * Pure: Logic.(un)varify only works in a global context, which is now
6480 enforced instead of silently assumed. INCOMPATIBILITY, may use
6481 Logic.legacy_(un)varify as temporary workaround.
6483 * Pure: structure Name provides scalable operations for generating
6484 internal variable names, notably Name.variants etc. This replaces
6485 some popular functions from term.ML:
6487 Term.variant -> Name.variant
6488 Term.variantlist -> Name.variant_list
6489 Term.invent_names -> Name.invent_list
6491 Note that low-level renaming rarely occurs in new code -- operations
6492 from structure Variable are used instead (see below).
6494 * Pure: structure Variable provides fundamental operations for proper
6495 treatment of fixed/schematic variables in a context. For example,
6496 Variable.import introduces fixes for schematics of given facts and
6497 Variable.export reverses the effect (up to renaming) -- this replaces
6498 various freeze_thaw operations.
6500 * Pure: structure Goal provides simple interfaces for
6501 init/conclude/finish and tactical prove operations (replacing former
6502 Tactic.prove). Goal.prove is the canonical way to prove results
6503 within a given context; Goal.prove_global is a degraded version for
6504 theory level goals, including a global Drule.standard. Note that
6505 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6506 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6507 in a locale context).
6509 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6510 and type checking (Syntax.check_term etc.), with common combinations
6511 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6512 which are considered legacy and await removal.
6514 * Pure/Syntax: generic interfaces for type unchecking
6515 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6516 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6517 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6518 available for convenience, but refer to the very same operations using
6519 a mere theory instead of a full context.
6521 * Isar: simplified treatment of user-level errors, using exception
6522 ERROR of string uniformly. Function error now merely raises ERROR,
6523 without any side effect on output channels. The Isar toplevel takes
6524 care of proper display of ERROR exceptions. ML code may use plain
6525 handle/can/try; cat_error may be used to concatenate errors like this:
6527 ... handle ERROR msg => cat_error msg "..."
6529 Toplevel ML code (run directly or through the Isar toplevel) may be
6530 embedded into the Isar toplevel with exception display/debug like
6533 Isar.toplevel (fn () => ...)
6535 INCOMPATIBILITY, removed special transform_error facilities, removed
6536 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6537 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6538 -- use plain ERROR instead.
6540 * Isar: theory setup now has type (theory -> theory), instead of a
6541 list. INCOMPATIBILITY, may use #> to compose setup functions.
6543 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6544 ProofContext.debug/verbose flags.
6546 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6547 theory before entering a proof state. Transactions now always see a
6548 quasi-functional intermediate checkpoint, both in interactive and
6551 * Isar: simplified interfaces for outer syntax. Renamed
6552 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6553 OuterSyntax.add_parsers -- this functionality is now included in
6554 OuterSyntax.command etc. INCOMPATIBILITY.
6556 * Simplifier: the simpset of a running simplification process now
6557 contains a proof context (cf. Simplifier.the_context), which is the
6558 very context that the initial simpset has been retrieved from (by
6559 simpset_of/local_simpset_of). Consequently, all plug-in components
6560 (solver, looper etc.) may depend on arbitrary proof data.
6562 * Simplifier.inherit_context inherits the proof context (plus the
6563 local bounds) of the current simplification process; any simproc
6564 etc. that calls the Simplifier recursively should do this! Removed
6565 former Simplifier.inherit_bounds, which is already included here --
6566 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6567 specify an explicit context using Simplifier.context/theory_context.
6569 * Simplifier/Classical Reasoner: more abstract interfaces
6570 change_simpset/claset for modifying the simpset/claset reference of a
6571 theory; raw versions simpset/claset_ref etc. have been discontinued --
6574 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6580 * settings: the default heap location within ISABELLE_HOME_USER now
6581 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6582 Isabelle installations.
6584 * isabelle-process: option -S (secure mode) disables some critical
6585 operations, notably runtime compilation and evaluation of ML source
6588 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6590 * Support for parallel execution, using native multicore support of
6591 Poly/ML 5.1. The theory loader exploits parallelism when processing
6592 independent theories, according to the given theory header
6593 specifications. The maximum number of worker threads is specified via
6594 usedir option -M or the "max-threads" setting in Proof General. A
6595 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6596 to 6 on a 8-core machine. User-code needs to observe certain
6597 guidelines for thread-safe programming, see appendix A in the Isar
6598 Implementation manual.
6602 New in Isabelle2005 (October 2005)
6603 ----------------------------------
6607 * Theory headers: the new header syntax for Isar theories is
6610 imports <theory1> ... <theoryN>
6611 uses <file1> ... <fileM>
6614 where the 'uses' part is optional. The previous syntax
6616 theory <name> = <theory1> + ... + <theoryN>:
6618 will disappear in the next release. Use isatool fixheaders to convert
6619 existing theory files. Note that there is no change in ancient
6620 non-Isar theories now, but these will disappear soon.
6622 * Theory loader: parent theories can now also be referred to via
6623 relative and absolute paths.
6625 * Command 'find_theorems' searches for a list of criteria instead of a
6626 list of constants. Known criteria are: intro, elim, dest, name:string,
6627 simp:term, and any term. Criteria can be preceded by '-' to select
6628 theorems that do not match. Intro, elim, dest select theorems that
6629 match the current goal, name:s selects theorems whose fully qualified
6630 name contain s, and simp:term selects all simplification rules whose
6631 lhs match term. Any other term is interpreted as pattern and selects
6632 all theorems matching the pattern. Available in ProofGeneral under
6633 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6635 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6637 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6638 matching the current goal as introduction rule and not having "HOL."
6639 in their name (i.e. not being defined in theory HOL).
6641 * Command 'thms_containing' has been discontinued in favour of
6642 'find_theorems'; INCOMPATIBILITY.
6644 * Communication with Proof General is now 8bit clean, which means that
6645 Unicode text in UTF-8 encoding may be used within theory texts (both
6646 formal and informal parts). Cf. option -U of the Isabelle Proof
6647 General interface. Here are some simple examples (cf. src/HOL/ex):
6649 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6650 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6652 * Improved efficiency of the Simplifier and, to a lesser degree, the
6653 Classical Reasoner. Typical big applications run around 2 times
6657 *** Document preparation ***
6659 * Commands 'display_drafts' and 'print_drafts' perform simple output
6660 of raw sources. Only those symbols that do not require additional
6661 LaTeX packages (depending on comments in isabellesym.sty) are
6662 displayed properly, everything else is left verbatim. isatool display
6663 and isatool print are used as front ends (these are subject to the
6664 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6666 * Command tags control specific markup of certain regions of text,
6667 notably folding and hiding. Predefined tags include "theory" (for
6668 theory begin and end), "proof" for proof commands, and "ML" for
6669 commands involving ML code; the additional tags "visible" and
6670 "invisible" are unused by default. Users may give explicit tag
6671 specifications in the text, e.g. ''by %invisible (auto)''. The
6672 interpretation of tags is determined by the LaTeX job during document
6673 preparation: see option -V of isatool usedir, or options -n and -t of
6674 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6677 Several document versions may be produced at the same time via isatool
6678 usedir (the generated index.html will link all of them). Typical
6679 specifications include ''-V document=theory,proof,ML'' to present
6680 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6681 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6682 these parts without any formal replacement text. The Isabelle site
6683 default settings produce ''document'' and ''outline'' versions as
6686 * Several new antiquotations:
6688 @{term_type term} prints a term with its type annotated;
6690 @{typeof term} prints the type of a term;
6692 @{const const} is the same as @{term const}, but checks that the
6693 argument is a known logical constant;
6695 @{term_style style term} and @{thm_style style thm} print a term or
6696 theorem applying a "style" to it
6700 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6701 definitions, equations, inequations etc., 'concl' printing only the
6702 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6703 to print the specified premise. TermStyle.add_style provides an ML
6704 interface for introducing further styles. See also the "LaTeX Sugar"
6705 document practical applications. The ML antiquotation prints
6706 type-checked ML expressions verbatim.
6708 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6709 and 'text' support optional locale specification '(in loc)', which
6710 specifies the default context for interpreting antiquotations. For
6711 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6713 * Option 'locale=NAME' of antiquotations specifies an alternative
6714 context interpreting the subsequent argument. For example: @{thm
6715 [locale=lattice] inf_assoc}.
6717 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6720 * Proper output of antiquotations for theory commands involving a
6721 proof context (such as 'locale' or 'theorem (in loc) ...').
6723 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6724 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6726 * isatool usedir: new option -C (default true) controls whether option
6727 -D should include a copy of the original document directory; -C false
6728 prevents unwanted effects such as copying of administrative CVS data.
6733 * Considerably improved version of 'constdefs' command. Now performs
6734 automatic type-inference of declared constants; additional support for
6735 local structure declarations (cf. locales and HOL records), see also
6736 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6737 sequential dependencies of definitions within a single 'constdefs'
6738 section; moreover, the declared name needs to be an identifier. If
6739 all fails, consider to fall back on 'consts' and 'defs' separately.
6741 * Improved indexed syntax and implicit structures. First of all,
6742 indexed syntax provides a notational device for subscripted
6743 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6744 expressions. Secondly, in a local context with structure
6745 declarations, number indexes \<^sub>n or the empty index (default
6746 number 1) refer to a certain fixed variable implicitly; option
6747 show_structs controls printing of implicit structures. Typical
6748 applications of these concepts involve record types and locales.
6750 * New command 'no_syntax' removes grammar declarations (and
6751 translations) resulting from the given syntax specification, which is
6752 interpreted in the same manner as for the 'syntax' command.
6754 * 'Advanced' translation functions (parse_translation etc.) may depend
6755 on the signature of the theory context being presently used for
6756 parsing/printing, see also isar-ref manual.
6758 * Improved 'oracle' command provides a type-safe interface to turn an
6759 ML expression of type theory -> T -> term into a primitive rule of
6760 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6761 is already included here); see also FOL/ex/IffExample.thy;
6764 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6765 before); "cI" is no longer bound, use "c.intro" instead.
6766 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6767 axclasses vs. locales.
6769 * Improved internal renaming of symbolic identifiers -- attach primes
6770 instead of base 26 numbers.
6772 * New flag show_question_marks controls printing of leading question
6773 marks in schematic variable names.
6775 * In schematic variable names, *any* symbol following \<^isub> or
6776 \<^isup> is now treated as part of the base name. For example, the
6777 following works without printing of awkward ".0" indexes:
6779 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6782 * Inner syntax includes (*(*nested*) comments*).
6784 * Pretty printer now supports unbreakable blocks, specified in mixfix
6785 annotations as "(00...)".
6787 * Clear separation of logical types and nonterminals, where the latter
6788 may only occur in 'syntax' specifications or type abbreviations.
6789 Before that distinction was only partially implemented via type class
6790 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6791 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6792 exotic syntax specifications may require further adaption
6793 (e.g. Cube/Cube.thy).
6795 * Removed obsolete type class "logic", use the top sort {} instead.
6796 Note that non-logical types should be declared as 'nonterminals'
6797 rather than 'types'. INCOMPATIBILITY for new object-logic
6800 * Attributes 'induct' and 'cases': type or set names may now be
6801 locally fixed variables as well.
6803 * Simplifier: can now control the depth to which conditional rewriting
6804 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6807 * Simplifier: simplification procedures may now take the current
6808 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6809 interface), which is very useful for calling the Simplifier
6810 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6811 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6812 low-level mk_simproc no longer applies Logic.varify internally, to
6813 allow for use in a context of fixed variables.
6815 * thin_tac now works even if the assumption being deleted contains !!
6816 or ==>. More generally, erule now works even if the major premise of
6817 the elimination rule contains !! or ==>.
6819 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6821 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6822 from Pure, which contains all common declarations already. Both
6823 theories are defined via plain Isabelle/Isar .thy files.
6824 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6825 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6826 use isatool fixcpure to adapt your theory and ML sources.
6828 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6829 selections of theorems in named facts via index ranges.
6831 * 'print_theorems': in theory mode, really print the difference
6832 wrt. the last state (works for interactive theory development only),
6833 in proof mode print all local facts (cf. 'print_facts');
6835 * 'hide': option '(open)' hides only base names.
6837 * More efficient treatment of intermediate checkpoints in interactive
6840 * Code generator is now invoked via code_module (incremental code
6841 generation) and code_library (modular code generation, ML structures
6842 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6843 must be quoted when used as identifiers.
6845 * New 'value' command for reading, evaluating and printing terms using
6846 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6847 quoted when used as identifier.
6852 * New commands for the interpretation of locale expressions in
6853 theories (1), locales (2) and proof contexts (3). These generate
6854 proof obligations from the expression specification. After the
6855 obligations have been discharged, theorems of the expression are added
6856 to the theory, target locale or proof context. The synopsis of the
6857 commands is a follows:
6859 (1) interpretation expr inst
6860 (2) interpretation target < expr
6861 (3) interpret expr inst
6863 Interpretation in theories and proof contexts require a parameter
6864 instantiation of terms from the current context. This is applied to
6865 specifications and theorems of the interpreted expression.
6866 Interpretation in locales only permits parameter renaming through the
6867 locale expression. Interpretation is smart in that interpretations
6868 that are active already do not occur in proof obligations, neither are
6869 instantiated theorems stored in duplicate. Use 'print_interps' to
6870 inspect active interpretations of a particular locale. For details,
6871 see the Isar Reference manual. Examples can be found in
6872 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6874 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6875 'interpret' instead.
6877 * New context element 'constrains' for adding type constraints to
6880 * Context expressions: renaming of parameters with syntax
6883 * Locale declaration: 'includes' disallowed.
6885 * Proper static binding of attribute syntax -- i.e. types / terms /
6886 facts mentioned as arguments are always those of the locale definition
6887 context, independently of the context of later invocations. Moreover,
6888 locale operations (renaming and type / term instantiation) are applied
6889 to attribute arguments as expected.
6891 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6892 actual attributes; rare situations may require Attrib.attribute to
6893 embed those attributes into Attrib.src that lack concrete syntax.
6894 Attribute implementations need to cooperate properly with the static
6895 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6896 Attrib.XXX_thm etc. already do the right thing without further
6897 intervention. Only unusual applications -- such as "where" or "of"
6898 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6899 on the context and the facts involved -- may have to assign parsed
6900 values to argument tokens explicitly.
6902 * Changed parameter management in theorem generation for long goal
6903 statements with 'includes'. INCOMPATIBILITY: produces a different
6904 theorem statement in rare situations.
6906 * Locale inspection command 'print_locale' omits notes elements. Use
6907 'print_locale!' to have them included in the output.
6912 * Provers/hypsubst.ML: improved version of the subst method, for
6913 single-step rewriting: it now works in bound variable contexts. New is
6914 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6915 rewrite a different subterm than the original subst method, which is
6916 still available as 'simplesubst'.
6918 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6921 * Provers/trancl.ML: new transitivity reasoner for transitive and
6922 reflexive-transitive closure of relations.
6924 * Provers/blast.ML: new reference depth_limit to make blast's depth
6925 limit (previously hard-coded with a value of 20) user-definable.
6927 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6928 is peformed already. Object-logics merely need to finish their
6929 initial simpset configuration as before. INCOMPATIBILITY.
6934 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6937 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6939 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6940 and x-symbol; use option '-m epsilon' to get it actually printed.
6941 Moreover, the mathematically important symbolic identifier \<epsilon>
6942 becomes available as variable, constant etc. INCOMPATIBILITY,
6944 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6945 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6946 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6947 support corresponding Isar calculations.
6949 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6952 * theory SetInterval: changed the syntax for open intervals:
6961 The old syntax is still supported but will disappear in the next
6962 release. For conversion use the following Emacs search and replace
6963 patterns (these are not perfect but work quite well):
6965 {)\([^\.]*\)\.\. -> {\1<\.\.}
6966 \.\.\([^(}]*\)(} -> \.\.<\1}
6968 * Theory Commutative_Ring (in Library): method comm_ring for proving
6969 equalities in commutative rings; method 'algebra' provides a generic
6972 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6973 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6974 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6977 Some new syntax forms are available:
6979 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6980 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6981 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6982 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6984 The latter form "\<Sum>x < k. e" used to be based on a separate
6985 function "Summation", which has been discontinued.
6987 * theory Finite_Set: in structured induction proofs, the insert case
6988 is now 'case (insert x F)' instead of the old counterintuitive 'case
6991 * The 'refute' command has been extended to support a much larger
6992 fragment of HOL, including axiomatic type classes, constdefs and
6993 typedefs, inductive datatypes and recursion.
6995 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6996 Requires zChaff with proof generation to be installed. See
6997 HOL/ex/SAT_Examples.thy for examples.
6999 * Datatype induction via method 'induct' now preserves the name of the
7000 induction variable. For example, when proving P(xs::'a list) by
7001 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7002 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7003 in unstructured proof scripts.
7005 * Reworked implementation of records. Improved scalability for
7006 records with many fields, avoiding performance problems for type
7007 inference. Records are no longer composed of nested field types, but
7008 of nested extension types. Therefore the record type only grows linear
7009 in the number of extensions and not in the number of fields. The
7010 top-level (users) view on records is preserved. Potential
7011 INCOMPATIBILITY only in strange cases, where the theory depends on the
7012 old record representation. The type generated for a record is called
7013 <record_name>_ext_type.
7015 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7016 proofs triggered by a record definition or a simproc (if
7017 quick_and_dirty is enabled). Definitions of large records can take
7020 New simproc record_upd_simproc for simplification of multiple record
7021 updates enabled by default. Moreover, trivial updates are also
7022 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7023 occasionally, since simplification is more powerful by default.
7025 * typedef: proper support for polymorphic sets, which contain extra
7026 type-variables in the term.
7028 * Simplifier: automatically reasons about transitivity chains
7029 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7030 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7031 old proofs break occasionally as simplification may now solve more
7032 goals than previously.
7034 * Simplifier: converts x <= y into x = y if assumption y <= x is
7035 present. Works for all partial orders (class "order"), in particular
7036 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7039 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7040 bound variable or a constant then the let is unfolded. Otherwise
7041 first a is simplified to b, and then f b is simplified to g. If
7042 possible we abstract b from g arriving at "let x = b in h x",
7043 otherwise we unfold the let and arrive at g. The simproc can be
7044 enabled/disabled by the reference use_let_simproc. Potential
7045 INCOMPATIBILITY since simplification is more powerful by default.
7047 * Classical reasoning: the meson method now accepts theorems as arguments.
7049 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7050 jobs to provide advice on the provability of subgoals.
7052 * Theory OrderedGroup and Ring_and_Field: various additions and
7053 improvements to faciliate calculations involving equalities and
7056 The following theorems have been eliminated or modified
7059 abs_eq now named abs_of_nonneg
7060 abs_of_ge_0 now named abs_of_nonneg
7061 abs_minus_eq now named abs_of_nonpos
7062 imp_abs_id now named abs_of_nonneg
7063 imp_abs_neg_id now named abs_of_nonpos
7064 mult_pos now named mult_pos_pos
7065 mult_pos_le now named mult_nonneg_nonneg
7066 mult_pos_neg_le now named mult_nonneg_nonpos
7067 mult_pos_neg2_le now named mult_nonneg_nonpos2
7068 mult_neg now named mult_neg_neg
7069 mult_neg_le now named mult_nonpos_nonpos
7071 * The following lemmas in Ring_and_Field have been added to the simplifier:
7074 not_square_less_zero
7076 The following lemmas have been deleted from Real/RealPow:
7086 * Theory Parity: added rules for simplifying exponents.
7090 The following theorems have been eliminated or modified
7093 list_all_Nil now named list_all.simps(1)
7094 list_all_Cons now named list_all.simps(2)
7095 list_all_conv now named list_all_iff
7096 set_mem_eq now named mem_iff
7098 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7099 asymptotic "big O" calculations. See the notes in BigO.thy.
7104 * Theory RealDef: better support for embedding natural numbers and
7105 integers in the reals.
7107 The following theorems have been eliminated or modified
7110 exp_ge_add_one_self now requires no hypotheses
7111 real_of_int_add reversed direction of equality (use [symmetric])
7112 real_of_int_minus reversed direction of equality (use [symmetric])
7113 real_of_int_diff reversed direction of equality (use [symmetric])
7114 real_of_int_mult reversed direction of equality (use [symmetric])
7116 * Theory RComplete: expanded support for floor and ceiling functions.
7118 * Theory Ln is new, with properties of the natural logarithm
7120 * Hyperreal: There is a new type constructor "star" for making
7121 nonstandard types. The old type names are now type synonyms:
7125 hcomplex = complex star
7127 * Hyperreal: Many groups of similarly-defined constants have been
7128 replaced by polymorphic versions (INCOMPATIBILITY):
7130 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7132 starset <-- starsetNat, starsetC
7133 *s* <-- *sNat*, *sc*
7134 starset_n <-- starsetNat_n, starsetC_n
7135 *sn* <-- *sNatn*, *scn*
7136 InternalSets <-- InternalNatSets, InternalCSets
7138 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7139 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7140 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7141 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7142 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7144 * Hyperreal: Many type-specific theorems have been removed in favor of
7145 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7147 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7148 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7149 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7150 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7151 right_minus <-- hypreal_add_minus
7152 left_minus <-- {hypreal,hcomplex}_add_minus_left
7153 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7154 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7155 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7156 mult_1_right <-- hcomplex_mult_one_right
7157 mult_zero_left <-- hcomplex_mult_zero_left
7158 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7159 right_distrib <-- hypnat_add_mult_distrib2
7160 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7161 right_inverse <-- hypreal_mult_inverse
7162 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7163 order_refl <-- {hypreal,hypnat}_le_refl
7164 order_trans <-- {hypreal,hypnat}_le_trans
7165 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7166 order_less_le <-- {hypreal,hypnat}_less_le
7167 linorder_linear <-- {hypreal,hypnat}_le_linear
7168 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7169 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7170 add_nonneg_nonneg <-- hypreal_le_add_order
7172 * Hyperreal: Separate theorems having to do with type-specific
7173 versions of constants have been merged into theorems that apply to the
7174 new polymorphic constants (INCOMPATIBILITY):
7176 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7177 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7178 STAR_Un <-- {STAR,NatStar,STARC}_Un
7179 STAR_Int <-- {STAR,NatStar,STARC}_Int
7180 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7181 STAR_subset <-- {STAR,NatStar,STARC}_subset
7182 STAR_mem <-- {STAR,NatStar,STARC}_mem
7183 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7184 STAR_diff <-- {STAR,STARC}_diff
7185 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7186 STARC_hcomplex_of_complex}_image_subset
7187 starset_n_Un <-- starset{Nat,C}_n_Un
7188 starset_n_Int <-- starset{Nat,C}_n_Int
7189 starset_n_Compl <-- starset{Nat,C}_n_Compl
7190 starset_n_diff <-- starset{Nat,C}_n_diff
7191 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7192 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7193 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7194 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7195 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7196 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7197 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7198 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7199 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7200 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7201 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7202 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7203 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7204 starfun_diff <-- starfun{C,RC,CR}_diff
7205 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7206 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7207 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7208 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7209 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7210 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7211 starfun_Id <-- starfunC_Id
7212 starfun_approx <-- starfun{Nat,CR}_approx
7213 starfun_capprox <-- starfun{C,RC}_capprox
7214 starfun_abs <-- starfunNat_rabs
7215 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7216 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7217 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7218 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7219 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7220 starfun_add_approx <-- starfunCR_add_approx
7221 starfun_inverse_inverse <-- starfunC_inverse_inverse
7222 starfun_divide <-- starfun{C,CR,RC}_divide
7223 starfun_n <-- starfun{Nat,C}_n
7224 starfun_n_mult <-- starfun{Nat,C}_n_mult
7225 starfun_n_add <-- starfun{Nat,C}_n_add
7226 starfun_n_add_minus <-- starfunNat_n_add_minus
7227 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7228 starfun_n_minus <-- starfun{Nat,C}_n_minus
7229 starfun_n_eq <-- starfun{Nat,C}_n_eq
7231 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7232 star_n_minus <-- {hypreal,hcomplex}_minus
7233 star_n_diff <-- {hypreal,hcomplex}_diff
7234 star_n_mult <-- {hypreal,hcomplex}_mult
7235 star_n_inverse <-- {hypreal,hcomplex}_inverse
7236 star_n_le <-- {hypreal,hypnat}_le
7237 star_n_less <-- {hypreal,hypnat}_less
7238 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7239 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7240 star_n_abs <-- hypreal_hrabs
7241 star_n_divide <-- hcomplex_divide
7243 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7244 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7245 star_of_diff <-- hypreal_of_real_diff
7246 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7247 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7248 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7249 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7250 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7251 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7252 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7253 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7254 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7255 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7256 star_of_number_of <-- {hypreal,hcomplex}_number_of
7257 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7258 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7259 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7260 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7261 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7262 star_of_power <-- hypreal_of_real_power
7263 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7265 * Hyperreal: new method "transfer" that implements the transfer
7266 principle of nonstandard analysis. With a subgoal that mentions
7267 nonstandard types like "'a star", the command "apply transfer"
7268 replaces it with an equivalent one that mentions only standard types.
7269 To be successful, all free variables must have standard types; non-
7270 standard variables must have explicit universal quantifiers.
7272 * Hyperreal: A theory of Taylor series.
7277 * Discontinued special version of 'constdefs' (which used to support
7278 continuous functions) in favor of the general Pure one with full
7281 * New simplification procedure for solving continuity conditions; it
7282 is much faster on terms with many nested lambda abstractions (cubic
7283 instead of exponential time).
7285 * New syntax for domain package: selector names are now optional.
7286 Parentheses should be omitted unless argument is lazy, for example:
7288 domain 'a stream = cons "'a" (lazy "'a stream")
7290 * New command 'fixrec' for defining recursive functions with pattern
7291 matching; defining multiple functions with mutual recursion is also
7292 supported. Patterns may include the constants cpair, spair, up, sinl,
7293 sinr, or any data constructor defined by the domain package. The given
7294 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7295 syntax and examples.
7297 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7298 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7299 but the proof obligation additionally includes an admissibility
7300 requirement. The packages generate instances of class cpo or pcpo,
7301 with continuity and strictness theorems for Rep and Abs.
7303 * HOLCF: Many theorems have been renamed according to a more standard naming
7304 scheme (INCOMPATIBILITY):
7306 foo_inject: "foo$x = foo$y ==> x = y"
7307 foo_eq: "(foo$x = foo$y) = (x = y)"
7308 foo_less: "(foo$x << foo$y) = (x << y)"
7309 foo_strict: "foo$UU = UU"
7310 foo_defined: "... ==> foo$x ~= UU"
7311 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7316 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7317 including the First Isomorphism Theorem (on quotienting by the kernel
7320 * ZF/Simplifier: install second copy of type solver that actually
7321 makes use of TC rules declared to Isar proof contexts (or locales);
7322 the old version is still required for ML proof scripts.
7327 * Converted to Isar theory format; use locales instead of axiomatic
7333 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7336 * Pure/library.ML no longer defines its own option datatype, but uses
7337 that of the SML basis, which has constructors NONE and SOME instead of
7338 None and Some, as well as exception Option.Option instead of OPTION.
7339 The functions the, if_none, is_some, is_none have been adapted
7340 accordingly, while Option.map replaces apsome.
7342 * Pure/library.ML: the exception LIST has been given up in favour of
7343 the standard exceptions Empty and Subscript, as well as
7344 Library.UnequalLengths. Function like Library.hd and Library.tl are
7345 superceded by the standard hd and tl functions etc.
7347 A number of basic list functions are no longer exported to the ML
7348 toplevel, as they are variants of predefined functions. The following
7349 suggests how one can translate existing code:
7351 rev_append xs ys = List.revAppend (xs, ys)
7352 nth_elem (i, xs) = List.nth (xs, i)
7353 last_elem xs = List.last xs
7354 flat xss = List.concat xss
7355 seq fs = List.app fs
7356 partition P xs = List.partition P xs
7357 mapfilter f xs = List.mapPartial f xs
7359 * Pure/library.ML: several combinators for linear functional
7360 transformations, notably reverse application and composition:
7363 (x, y) |-> f f #-> g
7365 * Pure/library.ML: introduced/changed precedence of infix operators:
7367 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7369 infix 3 o oo ooo oooo;
7370 infix 4 ~~ upto downto;
7372 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7375 * Pure/library.ML: natural list combinators fold, fold_rev, and
7376 fold_map support linear functional transformations and nesting. For
7379 fold f [x1, ..., xN] y =
7380 y |> f x1 |> ... |> f xN
7382 (fold o fold) f [xs1, ..., xsN] y =
7383 y |> fold f xs1 |> ... |> fold f xsN
7385 fold f [x1, ..., xN] =
7388 (fold o fold) f [xs1, ..., xsN] =
7389 fold f xs1 #> ... #> fold f xsN
7391 * Pure/library.ML: the following selectors on type 'a option are
7394 the: 'a option -> 'a (*partial*)
7395 these: 'a option -> 'a where 'a = 'b list
7396 the_default: 'a -> 'a option -> 'a
7397 the_list: 'a option -> 'a list
7399 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7400 basic operations for association lists, following natural argument
7401 order; moreover the explicit equality predicate passed here avoids
7402 potentially expensive polymorphic runtime equality checks.
7403 The old functions may be expressed as follows:
7405 assoc = uncurry (AList.lookup (op =))
7406 assocs = these oo AList.lookup (op =)
7407 overwrite = uncurry (AList.update (op =)) o swap
7409 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7411 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7412 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7414 replacing make_keylist and keyfilter (occassionally used)
7417 make_keylist = AList.make
7418 keyfilter = AList.find (op =)
7420 * eq_fst and eq_snd now take explicit equality parameter, thus
7421 avoiding eqtypes. Naive rewrites:
7423 eq_fst = eq_fst (op =)
7424 eq_snd = eq_snd (op =)
7426 * Removed deprecated apl and apr (rarely used).
7429 apl (n, op) =>>= curry op n
7430 apr (op, m) =>>= fn n => op (n, m)
7432 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7433 provides a reasonably efficient light-weight implementation of sets as
7436 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7437 few new operations; existing lookup and update are now curried to
7438 follow natural argument order (for use with fold etc.);
7439 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7441 * Pure/General: output via the Isabelle channels of
7442 writeln/warning/error etc. is now passed through Output.output, with a
7443 hook for arbitrary transformations depending on the print_mode
7444 (cf. Output.add_mode -- the first active mode that provides a output
7445 function wins). Already formatted output may be embedded into further
7446 text via Output.raw; the result of Pretty.string_of/str_of and derived
7447 functions (string_of_term/cterm/thm etc.) is already marked raw to
7448 accommodate easy composition of diagnostic messages etc. Programmers
7449 rarely need to care about Output.output or Output.raw at all, with
7450 some notable exceptions: Output.output is required when bypassing the
7451 standard channels (writeln etc.), or in token translations to produce
7452 properly formatted results; Output.raw is required when capturing
7453 already output material that will eventually be presented to the user
7454 a second time. For the default print mode, both Output.output and
7455 Output.raw have no effect.
7457 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7458 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7459 cumulative results are displayed at the end of a batch session.
7461 * Pure/General: File.sysify_path and File.quote_sysify path have been
7462 replaced by File.platform_path and File.shell_path (with appropriate
7463 hooks). This provides a clean interface for unusual systems where the
7464 internal and external process view of file names are different.
7466 * Pure: more efficient orders for basic syntactic entities: added
7467 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7468 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7469 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7470 orders now -- potential INCOMPATIBILITY for code that depends on a
7471 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7472 Library.sort_strings on result).
7474 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7475 fold_types traverse types/terms from left to right, observing natural
7476 argument order. Supercedes previous foldl_XXX versions, add_frees,
7477 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7479 * Pure: name spaces have been refined, with significant changes of the
7480 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7481 to extern(_table). The plain name entry path is superceded by a
7482 general 'naming' context, which also includes the 'policy' to produce
7483 a fully qualified name and external accesses of a fully qualified
7484 name; NameSpace.extend is superceded by context dependent
7485 Sign.declare_name. Several theory and proof context operations modify
7486 the naming context. Especially note Theory.restore_naming and
7487 ProofContext.restore_naming to get back to a sane state; note that
7488 Theory.add_path is no longer sufficient to recover from
7489 Theory.absolute_path in particular.
7491 * Pure: new flags short_names (default false) and unique_names
7492 (default true) for controlling output of qualified names. If
7493 short_names is set, names are printed unqualified. If unique_names is
7494 reset, the name prefix is reduced to the minimum required to achieve
7495 the original result when interning again, even if there is an overlap
7496 with earlier declarations.
7498 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7499 now 'extend', and 'merge' gets an additional Pretty.pp argument
7500 (useful for printing error messages). INCOMPATIBILITY.
7502 * Pure: major reorganization of the theory context. Type Sign.sg and
7503 Theory.theory are now identified, referring to the universal
7504 Context.theory (see Pure/context.ML). Actual signature and theory
7505 content is managed as theory data. The old code and interfaces were
7506 spread over many files and structures; the new arrangement introduces
7507 considerable INCOMPATIBILITY to gain more clarity:
7509 Context -- theory management operations (name, identity, inclusion,
7510 parents, ancestors, merge, etc.), plus generic theory data;
7512 Sign -- logical signature and syntax operations (declaring consts,
7513 types, etc.), plus certify/read for common entities;
7515 Theory -- logical theory operations (stating axioms, definitions,
7516 oracles), plus a copy of logical signature operations (consts,
7517 types, etc.); also a few basic management operations (Theory.copy,
7520 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7521 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7522 for convenience -- they merely return the theory.
7524 * Pure: type Type.tsig is superceded by theory in most interfaces.
7526 * Pure: the Isar proof context type is already defined early in Pure
7527 as Context.proof (note that ProofContext.context and Proof.context are
7528 aliases, where the latter is the preferred name). This enables other
7529 Isabelle components to refer to that type even before Isar is present.
7531 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7532 typeK, constK, axiomK, oracleK), but provide explicit operations for
7533 any of these kinds. For example, Sign.intern typeK is now
7534 Sign.intern_type, Theory.hide_space Sign.typeK is now
7535 Theory.hide_types. Also note that former
7536 Theory.hide_classes/types/consts are now
7537 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7538 internalize their arguments! INCOMPATIBILITY.
7540 * Pure: get_thm interface (of PureThy and ProofContext) expects
7541 datatype thmref (with constructors Name and NameSelection) instead of
7542 plain string -- INCOMPATIBILITY;
7544 * Pure: cases produced by proof methods specify options, where NONE
7545 means to remove case bindings -- INCOMPATIBILITY in
7548 * Pure: the following operations retrieve axioms or theorems from a
7549 theory node or theory hierarchy, respectively:
7551 Theory.axioms_of: theory -> (string * term) list
7552 Theory.all_axioms_of: theory -> (string * term) list
7553 PureThy.thms_of: theory -> (string * thm) list
7554 PureThy.all_thms_of: theory -> (string * thm) list
7556 * Pure: print_tac now outputs the goal through the trace channel.
7558 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7559 Reference Toplevel.debug (default false) controls detailed printing
7560 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7561 controls execution profiling -- set to 1 for time and 2 for space
7562 (both increase the runtime).
7564 * Isar session: The initial use of ROOT.ML is now always timed,
7565 i.e. the log will show the actual process times, in contrast to the
7566 elapsed wall-clock time that the outer shell wrapper produces.
7568 * Simplifier: improved handling of bound variables (nameless
7569 representation, avoid allocating new strings). Simprocs that invoke
7570 the Simplifier recursively should use Simplifier.inherit_bounds to
7571 avoid local name clashes. Failure to do so produces warnings
7572 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7573 for further details.
7575 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7576 bindings for all theorems stored within a given theory; this may help
7577 in porting non-Isar theories to Isar ones, while keeping ML proof
7578 scripts for the time being.
7580 * ML operator HTML.with_charset specifies the charset begin used for
7581 generated HTML files. For example:
7583 HTML.with_charset "utf-8" use_thy "Hebrew";
7584 HTML.with_charset "utf-8" use_thy "Chinese";
7589 * Allow symlinks to all proper Isabelle executables (Isabelle,
7590 isabelle, isatool etc.).
7592 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7593 isatool doc, isatool mkdir, display_drafts etc.).
7595 * isatool usedir: option -f allows specification of the ML file to be
7596 used by Isabelle; default is ROOT.ML.
7598 * New isatool version outputs the version identifier of the Isabelle
7599 distribution being used.
7601 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7602 (containing Boolean satisfiability problems) into Isabelle/HOL
7607 New in Isabelle2004 (April 2004)
7608 --------------------------------
7612 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7613 Replaces linorder.ML.
7615 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7616 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7617 (\<a>...\<z>), are now considered normal letters, and can therefore
7618 be used anywhere where an ASCII letter (a...zA...Z) has until
7619 now. COMPATIBILITY: This obviously changes the parsing of some
7620 terms, especially where a symbol has been used as a binder, say
7621 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7622 as an identifier. Fix it by inserting a space around former
7623 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7624 existing theory and ML files.
7626 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7628 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7629 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7630 a normal (but invisible) letter. For multiple letter subscripts repeat
7631 \<^isub> like this: x\<^isub>1\<^isub>2.
7633 * Pure: There are now sub-/superscripts that can span more than one
7634 character. Text between \<^bsub> and \<^esub> is set in subscript in
7635 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7636 superscript. The new control characters are not identifier parts.
7638 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7639 content of "..." to the latex file instead of \isacntrl... . The "..."
7640 may consist of any printable characters excluding the end bracket >.
7642 * Pure: Using new Isar command "finalconsts" (or the ML functions
7643 Theory.add_finals or Theory.add_finals_i) it is now possible to
7644 declare constants "final", which prevents their being given a definition
7645 later. It is useful for constants whose behaviour is fixed axiomatically
7646 rather than definitionally, such as the meta-logic connectives.
7648 * Pure: 'instance' now handles general arities with general sorts
7649 (i.e. intersections of classes),
7651 * Presentation: generated HTML now uses a CSS style sheet to make layout
7652 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7653 It can be changed to alter the colors/layout of generated pages.
7658 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7659 cut_tac, subgoal_tac and thin_tac:
7660 - Now understand static (Isar) contexts. As a consequence, users of Isar
7661 locales are no longer forced to write Isar proof scripts.
7662 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7664 - INCOMPATIBILITY: names of variables to be instantiated may no
7665 longer be enclosed in quotes. Instead, precede variable name with `?'.
7666 This is consistent with the instantiation attribute "where".
7668 * Attributes "where" and "of":
7669 - Now take type variables of instantiated theorem into account when reading
7670 the instantiation string. This fixes a bug that caused instantiated
7671 theorems to have too special types in some circumstances.
7672 - "where" permits explicit instantiations of type variables.
7674 * Calculation commands "moreover" and "also" no longer interfere with
7675 current facts ("this"), admitting arbitrary combinations with "then"
7679 - Goal statements involving the context element "includes" no longer
7680 generate theorems with internal delta predicates (those ending on
7681 "_axioms") in the premise.
7682 Resolve particular premise with <locale>.intro to obtain old form.
7683 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7684 specification and "includes" elements in goal statement.
7685 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7686 [intro?] and [elim?] (respectively) by default.
7687 - Experimental command for instantiation of locales in proof contexts:
7688 instantiate <label>[<attrs>]: <loc>
7689 Instantiates locale <loc> and adds all its theorems to the current context
7690 taking into account their attributes. Label and attrs are optional
7691 modifiers, like in theorem declarations. If present, names of
7692 instantiated theorems are qualified with <label>, and the attributes
7693 <attrs> are applied after any attributes these theorems might have already.
7694 If the locale has assumptions, a chained fact of the form
7695 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7696 are derived. The command does not support old-style locales declared
7697 with "locale (open)".
7698 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7700 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7706 * Proof import: new image HOL4 contains the imported library from
7707 the HOL4 system with about 2500 theorems. It is imported by
7708 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7709 can be used like any other Isabelle image. See
7710 HOL/Import/HOL/README for more information.
7713 - Much improved handling of linear and partial orders.
7714 Reasoners for linear and partial orders are set up for type classes
7715 "linorder" and "order" respectively, and are added to the default simpset
7716 as solvers. This means that the simplifier can build transitivity chains
7717 to solve goals from the assumptions.
7718 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7719 of blast or auto after simplification become unnecessary because the goal
7720 is solved by simplification already.
7722 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7723 all proved in axiomatic type classes for semirings, rings and fields.
7726 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7727 now formalized using the Ring_and_Field theory mentioned above.
7728 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7729 than before, because now they are set up once in a generic manner.
7730 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7731 Look for the general versions in Ring_and_Field (and Power if they concern
7734 * Type "rat" of the rational numbers is now available in HOL-Complex.
7737 - Record types are now by default printed with their type abbreviation
7738 instead of the list of all field types. This can be configured via
7739 the reference "print_record_type_abbr".
7740 - Simproc "record_upd_simproc" for simplification of multiple updates added
7741 (not enabled by default).
7742 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7743 EX x. x = sel r to True (not enabled by default).
7744 - Tactic "record_split_simp_tac" to split and simplify records added.
7746 * 'specification' command added, allowing for definition by
7747 specification. There is also an 'ax_specification' command that
7748 introduces the new constants axiomatically.
7750 * arith(_tac) is now able to generate counterexamples for reals as well.
7752 * HOL-Algebra: new locale "ring" for non-commutative rings.
7754 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7755 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7757 * HOL-Matrix: a first theory for matrices in HOL with an application of
7758 matrix theory to linear programming.
7760 * Unions and Intersections:
7761 The latex output syntax of UN and INT has been changed
7762 from "\Union x \in A. B" to "\Union_{x \in A} B"
7763 i.e. the index formulae has become a subscript.
7764 Similarly for "\Union x. B", and for \Inter instead of \Union.
7766 * Unions and Intersections over Intervals:
7767 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7768 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7769 like in normal math, and corresponding versions for < and for intersection.
7771 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7772 lexicographic dictonary ordering has been added as "lexord".
7774 * ML: the legacy theory structures Int and List have been removed. They had
7775 conflicted with ML Basis Library structures having the same names.
7777 * 'refute' command added to search for (finite) countermodels. Only works
7778 for a fragment of HOL. The installation of an external SAT solver is
7779 highly recommended. See "HOL/Refute.thy" for details.
7781 * 'quickcheck' command: Allows to find counterexamples by evaluating
7782 formulae under an assignment of free variables to random values.
7783 In contrast to 'refute', it can deal with inductive datatypes,
7784 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7790 * Streams now come with concatenation and are part of the HOLCF image
7794 New in Isabelle2003 (May 2003)
7795 ------------------------------
7799 * Provers/simplifier:
7801 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7802 Assumptions are now subject to complete mutual simplification,
7803 not just from left to right. The simplifier now preserves
7804 the order of assumptions.
7806 Potential INCOMPATIBILITY:
7808 -- simp sometimes diverges where the old version did
7809 not, e.g. invoking simp on the goal
7811 [| P (f x); y = x; f x = f y |] ==> Q
7813 now gives rise to the infinite reduction sequence
7815 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7817 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7820 -- Tactics combining classical reasoner and simplification (such as auto)
7821 are also affected by this change, because many of them rely on
7822 simp. They may sometimes diverge as well or yield a different numbers
7823 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7824 in case of problems. Sometimes subsequent calls to the classical
7825 reasoner will fail because a preceeding call to the simplifier too
7826 eagerly simplified the goal, e.g. deleted redundant premises.
7828 - The simplifier trace now shows the names of the applied rewrite rules
7830 - You can limit the number of recursive invocations of the simplifier
7831 during conditional rewriting (where the simplifie tries to solve the
7832 conditions before applying the rewrite rule):
7833 ML "simp_depth_limit := n"
7834 where n is an integer. Thus you can force termination where previously
7835 the simplifier would diverge.
7837 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7839 - No longer aborts on failed congruence proof. Instead, the
7840 congruence is ignored.
7842 * Pure: New generic framework for extracting programs from constructive
7843 proofs. See HOL/Extraction.thy for an example instantiation, as well
7844 as HOL/Extraction for some case studies.
7846 * Pure: The main goal of the proof state is no longer shown by default, only
7847 the subgoals. This behaviour is controlled by a new flag.
7848 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7849 (ML: Proof.show_main_goal).
7851 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7852 rules whose conclusion matches subgoal 1:
7853 PG menu: Isabelle/Isar -> Show me -> matching rules
7854 The rules are ordered by how closely they match the subgoal.
7855 In particular, rules that solve a subgoal outright are displayed first
7856 (or rather last, the way they are printed).
7857 (ML: ProofGeneral.print_intros())
7859 * Pure: New flag trace_unify_fail causes unification to print
7860 diagnostic information (PG: in trace buffer) when it fails. This is
7861 useful for figuring out why single step proofs like rule, erule or
7864 * Pure: Locale specifications now produce predicate definitions
7865 according to the body of text (covering assumptions modulo local
7866 definitions); predicate "loc_axioms" covers newly introduced text,
7867 while "loc" is cumulative wrt. all included locale expressions; the
7868 latter view is presented only on export into the global theory
7869 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7870 on the old view without predicates;
7872 * Pure: predefined locales "var" and "struct" are useful for sharing
7873 parameters (as in CASL, for example); just specify something like
7874 ``var x + var y + struct M'' as import;
7876 * Pure: improved thms_containing: proper indexing of facts instead of
7877 raw theorems; check validity of results wrt. current name space;
7878 include local facts of proof configuration (also covers active
7879 locales), cover fixed variables in index; may use "_" in term
7880 specification; an optional limit for the number of printed facts may
7881 be given (the default is 40);
7883 * Pure: disallow duplicate fact bindings within new-style theory files
7886 * Provers: improved induct method: assumptions introduced by case
7887 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7888 the goal statement); "foo" still refers to all facts collectively;
7890 * Provers: the function blast.overloaded has been removed: all constants
7891 are regarded as potentially overloaded, which improves robustness in exchange
7892 for slight decrease in efficiency;
7894 * Provers/linorder: New generic prover for transitivity reasoning over
7895 linear orders. Note: this prover is not efficient!
7897 * Isar: preview of problems to finish 'show' now produce an error
7898 rather than just a warning (in interactive mode);
7905 - Produces a counter example if it cannot prove a goal.
7906 Note that the counter example may be spurious if the goal is not a formula
7907 of quantifier-free linear arithmetic.
7908 In ProofGeneral the counter example appears in the trace buffer.
7910 - Knows about div k and mod k where k is a numeral of type nat or int.
7912 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7913 linear arithmetic fails. This takes account of quantifiers and divisibility.
7914 Presburger arithmetic can also be called explicitly via presburger(_tac).
7916 * simp's arithmetic capabilities have been enhanced a bit: it now
7917 takes ~= in premises into account (by performing a case split);
7919 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7920 are distributed over a sum of terms;
7922 * New tactic "trans_tac" and method "trans" instantiate
7923 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7926 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7927 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7929 * 'typedef' command has new option "open" to suppress the set
7932 * functions Min and Max on finite sets have been introduced (theory
7935 * attribute [symmetric] now works for relations as well; it turns
7936 (x,y) : R^-1 into (y,x) : R, and vice versa;
7938 * induct over a !!-quantified statement (say !!x1..xn):
7939 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7941 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7942 %x. None. Warning: empty_def now refers to the previously hidden definition
7945 * Algebra: formalization of classical algebra. Intended as base for
7946 any algebraic development in Isabelle. Currently covers group theory
7947 (up to Sylow's theorem) and ring theory (Universal Property of
7948 Univariate Polynomials). Contributions welcome;
7950 * GroupTheory: deleted, since its material has been moved to Algebra;
7952 * Complex: new directory of the complex numbers with numeric constants,
7953 nonstandard complex numbers, and some complex analysis, standard and
7954 nonstandard (Jacques Fleuriot);
7956 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7958 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7961 * Real/HahnBanach: updated and adapted to locales;
7963 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7966 * UNITY: added the Meier-Sanders theory of progress sets;
7968 * MicroJava: bytecode verifier and lightweight bytecode verifier
7969 as abstract algorithms, instantiated to the JVM;
7971 * Bali: Java source language formalization. Type system, operational
7972 semantics, axiomatic semantics. Supported language features:
7973 classes, interfaces, objects,virtual methods, static methods,
7974 static/instance fields, arrays, access modifiers, definite
7975 assignment, exceptions.
7980 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7983 * Main ZF: virtually all theories converted to new-style format;
7988 * Pure: Tactic.prove provides sane interface for internal proofs;
7989 omits the infamous "standard" operation, so this is more appropriate
7990 than prove_goalw_cterm in many situations (e.g. in simprocs);
7992 * Pure: improved error reporting of simprocs;
7994 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7998 *** Document preparation ***
8000 * uses \par instead of \\ for line breaks in theory text. This may
8001 shift some page breaks in large documents. To get the old behaviour
8002 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8004 * minimized dependencies of isabelle.sty and isabellesym.sty on
8007 * \<euro> now needs package babel/greek instead of marvosym (which
8010 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8015 New in Isabelle2002 (March 2002)
8016 --------------------------------
8018 *** Document preparation ***
8020 * greatly simplified document preparation setup, including more
8021 graceful interpretation of isatool usedir -i/-d/-D options, and more
8022 instructive isatool mkdir; users should basically be able to get
8023 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8024 users may run a separate document processing stage manually like this:
8025 "isatool usedir -D output HOL Test && isatool document Test/output";
8027 * theory dependency graph may now be incorporated into documents;
8028 isatool usedir -g true will produce session_graph.eps/.pdf for use
8029 with \includegraphics of LaTeX;
8031 * proper spacing of consecutive markup elements, especially text
8032 blocks after section headings;
8034 * support bold style (for single symbols only), input syntax is like
8035 this: "\<^bold>\<alpha>" or "\<^bold>A";
8037 * \<bullet> is now output as bold \cdot by default, which looks much
8038 better in printed text;
8040 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8041 note that these symbols are currently unavailable in Proof General /
8042 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8044 * isatool latex no longer depends on changed TEXINPUTS, instead
8045 isatool document copies the Isabelle style files to the target
8051 * Pure/Provers: improved proof by cases and induction;
8052 - 'case' command admits impromptu naming of parameters (such as
8054 - 'induct' method divinates rule instantiation from the inductive
8055 claim; no longer requires excessive ?P bindings for proper
8056 instantiation of cases;
8057 - 'induct' method properly enumerates all possibilities of set/type
8058 rules; as a consequence facts may be also passed through *type*
8059 rules without further ado;
8060 - 'induct' method now derives symbolic cases from the *rulified*
8061 rule (before it used to rulify cases stemming from the internal
8062 atomized version); this means that the context of a non-atomic
8063 statement becomes is included in the hypothesis, avoiding the
8064 slightly cumbersome show "PROP ?case" form;
8065 - 'induct' may now use elim-style induction rules without chaining
8066 facts, using ``missing'' premises from the goal state; this allows
8067 rules stemming from inductive sets to be applied in unstructured
8068 scripts, while still benefitting from proper handling of non-atomic
8069 statements; NB: major inductive premises need to be put first, all
8070 the rest of the goal is passed through the induction;
8071 - 'induct' proper support for mutual induction involving non-atomic
8072 rule statements (uses the new concept of simultaneous goals, see
8074 - append all possible rule selections, but only use the first
8075 success (no backtracking);
8076 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8077 - undeclared rule case names default to numbers 1, 2, 3, ...;
8078 - added 'print_induct_rules' (covered by help item in recent Proof
8080 - moved induct/cases attributes to Pure, methods to Provers;
8081 - generic method setup instantiated for FOL and HOL;
8083 * Pure: support multiple simultaneous goal statements, for example
8084 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8085 meta-level mechanism, this acts as if several individual goals had
8086 been stated separately; in particular common proof methods need to be
8087 repeated in order to cover all claims; note that a single elimination
8088 step is *not* sufficient to establish the two conjunctions, so this
8091 assume "A & B" then have A and B .. (*".." fails*)
8093 better use "obtain" in situations as above; alternative refer to
8094 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8096 * Pure: proper integration with ``locales''; unlike the original
8097 version by Florian Kammller, Isar locales package high-level proof
8098 contexts rather than raw logical ones (e.g. we admit to include
8099 attributes everywhere); operations on locales include merge and
8100 rename; support for implicit arguments (``structures''); simultaneous
8101 type-inference over imports and text; see also HOL/ex/Locales.thy for
8104 * Pure: the following commands have been ``localized'', supporting a
8105 target locale specification "(in name)": 'lemma', 'theorem',
8106 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8107 stored both within the locale and at the theory level (exported and
8108 qualified by the locale name);
8110 * Pure: theory goals may now be specified in ``long'' form, with
8111 ad-hoc contexts consisting of arbitrary locale elements. for example
8112 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8113 definitions may be given, too); the result is a meta-level rule with
8114 the context elements being discharged in the obvious way;
8116 * Pure: new proof command 'using' allows to augment currently used
8117 facts after a goal statement ('using' is syntactically analogous to
8118 'apply', but acts on the goal's facts only); this allows chained facts
8119 to be separated into parts given before and after a claim, as in
8120 ``from a and b have C using d and e <proof>'';
8122 * Pure: renamed "antecedent" case to "rule_context";
8124 * Pure: new 'judgment' command records explicit information about the
8125 object-logic embedding (used by several tools internally); no longer
8126 use hard-wired "Trueprop";
8128 * Pure: added 'corollary' command;
8130 * Pure: fixed 'token_translation' command;
8132 * Pure: removed obsolete 'exported' attribute;
8134 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8135 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8136 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8138 * Pure: method 'atomize' presents local goal premises as object-level
8139 statements (atomic meta-level propositions); setup controlled via
8140 rewrite rules declarations of 'atomize' attribute; example
8141 application: 'induct' method with proper rule statements in improper
8144 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8145 now consider the syntactic context of assumptions, giving a better
8146 chance to get type-inference of the arguments right (this is
8147 especially important for locales);
8149 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8152 * Pure/obtain: the formal conclusion "thesis", being marked as
8153 ``internal'', may no longer be reference directly in the text;
8154 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8157 * Pure: generic 'sym' attribute which declares a rule both as pure
8158 'elim?' and for the 'symmetric' operation;
8160 * Pure: marginal comments ``--'' may now occur just anywhere in the
8161 text; the fixed correlation with particular command syntax has been
8164 * Pure: new method 'rules' is particularly well-suited for proof
8165 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8166 but often produces more compact proof terms with less detours;
8168 * Pure/Provers/classical: simplified integration with pure rule
8169 attributes and methods; the classical "intro?/elim?/dest?"
8170 declarations coincide with the pure ones; the "rule" method no longer
8171 includes classically swapped intros; "intro" and "elim" methods no
8172 longer pick rules from the context; also got rid of ML declarations
8173 AddXIs/AddXEs/AddXDs; all of this has some potential for
8176 * Provers/classical: attribute 'swapped' produces classical inversions
8177 of introduction rules;
8179 * Provers/simplifier: 'simplified' attribute may refer to explicit
8180 rules instead of full simplifier context; 'iff' attribute handles
8183 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8185 * HOL: 'recdef' now fails on unfinished automated proofs, use
8186 "(permissive)" option to recover old behavior;
8188 * HOL: 'inductive' no longer features separate (collective) attributes
8189 for 'intros' (was found too confusing);
8191 * HOL: properly declared induction rules less_induct and
8197 * HOL: moved over to sane numeral syntax; the new policy is as
8200 - 0 and 1 are polymorphic constants, which are defined on any
8201 numeric type (nat, int, real etc.);
8203 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8204 binary representation internally;
8206 - type nat has special constructor Suc, and generally prefers Suc 0
8207 over 1::nat and Suc (Suc 0) over 2::nat;
8209 This change may cause significant problems of INCOMPATIBILITY; here
8210 are some hints on converting existing sources:
8212 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8213 entities, so expressions involving "-" (unary or binary minus) need
8214 to be spaced properly;
8216 - existing occurrences of "1" may need to be constraint "1::nat" or
8217 even replaced by Suc 0; similar for old "2";
8219 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8221 - remove all special provisions on numerals in proofs;
8223 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8224 representation (depends on bin_arith_simps in the default context);
8226 * HOL: symbolic syntax for x^2 (numeral 2);
8228 * HOL: the class of all HOL types is now called "type" rather than
8229 "term"; INCOMPATIBILITY, need to adapt references to this type class
8230 in axclass/classes, instance/arities, and (usually rare) occurrences
8231 in typings (of consts etc.); internally the class is called
8232 "HOL.type", ML programs should refer to HOLogic.typeS;
8234 * HOL/record package improvements:
8235 - new derived operations "fields" to build a partial record section,
8236 "extend" to promote a fixed record to a record scheme, and
8237 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8238 declared as simp by default;
8239 - shared operations ("more", "fields", etc.) now need to be always
8240 qualified) --- potential INCOMPATIBILITY;
8241 - removed "make_scheme" operations (use "make" with "extend") --
8243 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8244 - provides cases/induct rules for use with corresponding Isar
8245 methods (for concrete records, record schemes, concrete more
8246 parts, and schematic more parts -- in that order);
8247 - internal definitions directly based on a light-weight abstract
8248 theory of product types over typedef rather than datatype;
8250 * HOL: generic code generator for generating executable ML code from
8251 specifications; specific support for HOL constructs such as inductive
8252 datatypes and sets, as well as recursive functions; can be invoked
8253 via 'generate_code' theory section;
8255 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8257 * HOL: consolidated and renamed several theories. In particular:
8258 Ord.thy has been absorbed into HOL.thy
8259 String.thy has been absorbed into List.thy
8261 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8262 (beware of argument permutation!);
8264 * HOL: linorder_less_split superseded by linorder_cases;
8266 * HOL/List: "nodups" renamed to "distinct";
8268 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8269 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8270 - Ex_def has changed, now need to use some_eq_ex
8272 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8273 in this (rare) case use:
8275 delSWrapper "split_all_tac"
8276 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8278 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8281 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8282 Isabelle's type classes, ^ on functions and relations has too general
8283 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8284 necessary to attach explicit type constraints;
8286 * HOL/Relation: the prefix name of the infix "O" has been changed from
8287 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8288 renamed accordingly (eg "compI" -> "rel_compI").
8290 * HOL: syntax translations now work properly with numerals and records
8293 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8294 of "lam" -- INCOMPATIBILITY;
8296 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8297 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8298 renamed "Product_Type.unit";
8300 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8302 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8303 the "cases" method);
8305 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8308 * HOL/IMP: updated and converted to new-style theory format; several
8309 parts turned into readable document, with proper Isar proof texts and
8310 some explanations (by Gerwin Klein);
8312 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8314 * HOL-Hyperreal is now a logic image;
8319 * Isar: consts/constdefs supports mixfix syntax for continuous
8322 * Isar: domain package adapted to new-style theory format, e.g. see
8325 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8326 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8327 lift.induct_tac, always use UU instead of Undef;
8329 * HOLCF/IMP: updated and converted to new-style theory;
8334 * Isar: proper integration of logic-specific tools and packages,
8335 including theory commands '(co)inductive', '(co)datatype',
8336 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8337 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8339 * theory Main no longer includes AC; for the Axiom of Choice, base
8340 your theory on Main_ZFC;
8342 * the integer library now covers quotients and remainders, with many
8343 laws relating division to addition, multiplication, etc.;
8345 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8346 typeless version of the formalism;
8348 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8351 * ZF/Induct: new directory for examples of inductive definitions,
8352 including theory Multiset for multiset orderings; converted to
8353 new-style theory format;
8355 * ZF: many new theorems about lists, ordinals, etc.;
8360 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8361 variable proof controls level of detail: 0 = no proofs (only oracle
8362 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8363 also ref manual for further ML interfaces;
8365 * Pure/axclass: removed obsolete ML interface
8366 goal_subclass/goal_arity;
8368 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8369 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8370 separate tokens, so expressions involving minus need to be spaced
8373 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8374 rather than "infixl" or "infixr";
8376 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8377 sort constraint specifications in type inference; e.g. "x::_::foo"
8378 ensures that the type of "x" is of sort "foo" (but not necessarily a
8381 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8382 control output of nested => (types); the default behavior is
8385 * Pure/syntax: builtin parse translation for "_constify" turns valued
8386 tokens into AST constants;
8388 * Pure/syntax: prefer later declarations of translations and print
8389 translation functions; potential INCOMPATIBILITY: need to reverse
8390 multiple declarations for same syntax element constant;
8392 * Pure/show_hyps reset by default (in accordance to existing Isar
8395 * Provers/classical: renamed addaltern to addafter, addSaltern to
8398 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8401 * system: tested support for MacOS X; should be able to get Isabelle +
8402 Proof General to work in a plain Terminal after installing Poly/ML
8403 (e.g. from the Isabelle distribution area) and GNU bash alone
8404 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8405 support requires further installations, e.g. from
8406 http://fink.sourceforge.net/);
8408 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8410 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8411 of 40 MB), cf. ML_OPTIONS;
8413 * system: Proof General keywords specification is now part of the
8414 Isabelle distribution (see etc/isar-keywords.el);
8416 * system: support for persistent Proof General sessions (refrain from
8417 outdating all loaded theories on startup); user may create writable
8418 logic images like this: ``isabelle -q HOL Test'';
8420 * system: smart selection of Isabelle process versus Isabelle
8421 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8422 run both "isabelle" and "Isabelle" even if file names are badly
8423 damaged (executable inspects the case of the first letter of its own
8424 name); added separate "isabelle-process" and "isabelle-interface";
8426 * system: refrain from any attempt at filtering input streams; no
8427 longer support ``8bit'' encoding of old isabelle font, instead proper
8428 iso-latin characters may now be used; the related isatools
8429 "symbolinput" and "nonascii" have disappeared as well;
8431 * system: removed old "xterm" interface (the print modes "xterm" and
8432 "xterm_color" are still available for direct use in a suitable
8437 New in Isabelle99-2 (February 2001)
8438 -----------------------------------
8440 *** Overview of INCOMPATIBILITIES ***
8442 * HOL: please note that theories in the Library and elsewhere often use the
8443 new-style (Isar) format; to refer to their theorems in an ML script you must
8444 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8446 * HOL: inductive package no longer splits induction rule aggressively,
8447 but only as far as specified by the introductions given; the old
8448 format may be recovered via ML function complete_split_rule or attribute
8449 'split_rule (complete)';
8451 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8452 gfp_Tarski to gfp_unfold;
8454 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8456 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8457 relation); infix "^^" has been renamed "``"; infix "``" has been
8458 renamed "`"; "univalent" has been renamed "single_valued";
8460 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8463 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8465 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8467 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8468 consequence, it is no longer monotonic wrt. the local goal context
8469 (which is now passed through the inductive cases);
8471 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8472 \<gg> to \<ggreater>;
8475 *** Document preparation ***
8477 * \isabellestyle{NAME} selects version of Isabelle output (currently
8478 available: are "it" for near math-mode best-style output, "sl" for
8479 slanted text style, and "tt" for plain type-writer; if no
8480 \isabellestyle command is given, output is according to slanted
8483 * support sub/super scripts (for single symbols only), input syntax is
8484 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8486 * some more standard symbols; see Appendix A of the system manual for
8487 the complete list of symbols defined in isabellesym.sty;
8489 * improved isabelle style files; more abstract symbol implementation
8490 (should now use \isamath{...} and \isatext{...} in custom symbol
8493 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8494 state; Note that presentation of goal states does not conform to
8495 actual human-readable proof documents. Please do not include goal
8496 states into document output unless you really know what you are doing!
8498 * proper indentation of antiquoted output with proportional LaTeX
8501 * no_document ML operator temporarily disables LaTeX document
8504 * isatool unsymbolize tunes sources for plain ASCII communication;
8509 * Pure: Isar now suffers initial goal statements to contain unbound
8510 schematic variables (this does not conform to actual readable proof
8511 documents, due to unpredictable outcome and non-compositional proof
8512 checking); users who know what they are doing may use schematic goals
8513 for Prolog-style synthesis of proven results;
8515 * Pure: assumption method (an implicit finishing) now handles actual
8518 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8519 initial goal, declare "that" only as Pure intro (only for single
8520 steps); the "that" rule assumption may now be involved in implicit
8521 finishing, thus ".." becomes a feasible for trivial obtains;
8523 * Pure: default proof step now includes 'intro_classes'; thus trivial
8524 instance proofs may be performed by "..";
8526 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8529 * Pure: more robust selection of calculational rules;
8531 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8532 rule (as well as the assumption rule);
8534 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8535 lemmas, using the graph browser tool;
8537 * Pure: predict failure of "show" in interactive mode;
8539 * Pure: 'thms_containing' now takes actual terms as arguments;
8541 * HOL: improved method 'induct' --- now handles non-atomic goals
8542 (potential INCOMPATIBILITY); tuned error handling;
8544 * HOL: cases and induct rules now provide explicit hints about the
8545 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8546 any remaining facts are inserted into the goal verbatim;
8548 * HOL: local contexts (aka cases) may now contain term bindings as
8549 well; the 'cases' and 'induct' methods new provide a ?case binding for
8550 the result to be shown in each case;
8552 * HOL: added 'recdef_tc' command;
8554 * isatool convert assists in eliminating legacy ML scripts;
8559 * HOL/Library: a collection of generic theories to be used together
8560 with main HOL; the theory loader path already includes this directory
8561 by default; the following existing theories have been moved here:
8562 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8563 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8565 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8566 modelling and verification task performed in Isabelle/HOL +
8567 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8569 * HOL/Algebra: special summation operator SUM no longer exists, it has
8570 been replaced by setsum; infix 'assoc' now has priority 50 (like
8571 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8572 'domain', this makes the theory consistent with mathematical
8575 * HOL basics: added overloaded operations "inverse" and "divide"
8576 (infix "/"), syntax for generic "abs" operation, generic summation
8579 * HOL/typedef: simplified package, provide more useful rules (see also
8582 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8583 now expressed as a proper nested rule (old-style tactic scripts may
8584 require atomize_strip_tac to cope with non-atomic premises);
8586 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8587 to "split_conv" (old name still available for compatibility);
8589 * HOL: improved concrete syntax for strings (e.g. allows translation
8590 rules with string literals);
8592 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8593 and Fleuriot's mechanization of analysis, including the transcendental
8594 functions for the reals;
8596 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8601 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8602 "lam" is displayed as TWO lambda-symbols
8604 * CTT: theory Main now available, containing everything (that is, Bool
8610 * Pure: the Simplifier has been implemented properly as a derived rule
8611 outside of the actual kernel (at last!); the overall performance
8612 penalty in practical applications is about 50%, while reliability of
8613 the Isabelle inference kernel has been greatly improved;
8615 * print modes "brackets" and "no_brackets" control output of nested =>
8616 (types) and ==> (props); the default behaviour is "brackets";
8618 * Provers: fast_tac (and friends) now handle actual object-logic rules
8619 as assumptions as well;
8621 * system: support Poly/ML 4.0;
8623 * system: isatool install handles KDE version 1 or 2;
8627 New in Isabelle99-1 (October 2000)
8628 ----------------------------------
8630 *** Overview of INCOMPATIBILITIES ***
8632 * HOL: simplification of natural numbers is much changed; to partly
8633 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8634 issue the following ML commands:
8636 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8637 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8639 * HOL: simplification no longer dives into case-expressions; this is
8640 controlled by "t.weak_case_cong" for each datatype t;
8642 * HOL: nat_less_induct renamed to less_induct;
8644 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8645 fixsome to patch .thy and .ML sources automatically;
8647 select_equality -> some_equality
8648 select_eq_Ex -> some_eq_ex
8649 selectI2EX -> someI2_ex
8652 select1_equality -> some1_equality
8653 Eps_sym_eq -> some_sym_eq_trivial
8654 Eps_eq -> some_eq_trivial
8656 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8658 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8661 * HOL: the recursion equations generated by 'recdef' are now called
8662 f.simps instead of f.rules;
8664 * HOL: qed_spec_mp now also handles bounded ALL as well;
8666 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8667 sometimes be needed;
8669 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8671 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8673 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8674 product is now "<*>" instead of "Times"; the lexicographic product is
8675 now "<*lex*>" instead of "**";
8677 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8678 of main HOL, but was unused); better use HOL's datatype package;
8680 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8681 the old syntax may be recovered as follows:
8684 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8685 (infixl "\\<oplus>" 100)
8687 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8689 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8690 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8693 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8694 changed from A/r to A//r;
8696 * ZF: new treatment of arithmetic (nat & int) may break some old
8699 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8700 rulify -> rule_format, elimify -> elim_format, ...);
8702 * Isar/Provers: intro/elim/dest attributes changed; renamed
8703 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8704 should have to change intro!! to intro? only); replaced "delrule" by
8707 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8709 * Provers: strengthened force_tac by using new first_best_tac;
8711 * LaTeX document preparation: several changes of isabelle.sty (see
8715 *** Document preparation ***
8717 * formal comments (text blocks etc.) in new-style theories may now
8718 contain antiquotations of thm/prop/term/typ/text to be presented
8719 according to latex print mode; concrete syntax is like this:
8720 @{term[show_types] "f(x) = a + x"};
8722 * isatool mkdir provides easy setup of Isabelle session directories,
8723 including proper document sources;
8725 * generated LaTeX sources are now deleted after successful run
8726 (isatool document -c); may retain a copy somewhere else via -D option
8729 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8730 style files, achieving self-contained LaTeX sources and simplifying
8733 * old-style theories now produce (crude) LaTeX output as well;
8735 * browser info session directories are now self-contained (may be put
8736 on WWW server seperately); improved graphs of nested sessions; removed
8737 graph for 'all sessions';
8739 * several improvements in isabelle style files; \isabellestyle{it}
8740 produces fake math mode output; \isamarkupheader is now \section by
8741 default; see lib/texinputs/isabelle.sty etc.;
8746 * Isar/Pure: local results and corresponding term bindings are now
8747 subject to Hindley-Milner polymorphism (similar to ML); this
8748 accommodates incremental type-inference very nicely;
8750 * Isar/Pure: new derived language element 'obtain' supports
8751 generalized existence reasoning;
8753 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8754 support accumulation of results, without applying any rules yet;
8755 useful to collect intermediate results without explicit name
8756 references, and for use with transitivity rules with more than 2
8759 * Isar/Pure: scalable support for case-analysis type proofs: new
8760 'case' language element refers to local contexts symbolically, as
8761 produced by certain proof methods; internally, case names are attached
8762 to theorems as "tags";
8764 * Isar/Pure: theory command 'hide' removes declarations from
8765 class/type/const name spaces;
8767 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8768 indicate potential overloading;
8770 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8772 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8773 "{a,b,c}" instead of {a,b,c};
8775 * Isar/Pure now provides its own version of intro/elim/dest
8776 attributes; useful for building new logics, but beware of confusion
8777 with the version in Provers/classical;
8779 * Isar/Pure: the local context of (non-atomic) goals is provided via
8780 case name 'antecedent';
8782 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8783 to the current context is now done automatically);
8785 * Isar/Pure: theory command 'method_setup' provides a simple interface
8786 for definining proof methods in ML;
8788 * Isar/Provers: intro/elim/dest attributes changed; renamed
8789 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8790 most cases, one should have to change intro!! to intro? only);
8791 replaced "delrule" by "rule del";
8793 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8794 'symmetric' attribute (the latter supercedes [RS sym]);
8796 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8797 method modifier); 'simp' method: 'only:' modifier removes loopers as
8798 well (including splits);
8800 * Isar/Provers: Simplifier and Classical methods now support all kind
8801 of modifiers used in the past, including 'cong', 'iff', etc.
8803 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8804 of Simplifier and Classical reasoner);
8806 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8807 now support named cases; major packages (inductive, datatype, primrec,
8808 recdef) support case names and properly name parameters;
8810 * Isar/HOL: new transitivity rules for substitution in inequalities --
8811 monotonicity conditions are extracted to be proven at end of
8814 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8817 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8818 split_if split_if_asm; datatype package provides theorems foo.splits =
8819 foo.split foo.split_asm for each datatype;
8821 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8822 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8823 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8824 use "(cases (simplified))" method in proper proof texts);
8826 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8828 * Isar: names of theorems etc. may be natural numbers as well;
8830 * Isar: 'pr' command: optional arguments for goals_limit and
8831 ProofContext.prems_limit; no longer prints theory contexts, but only
8834 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8835 additional print modes to be specified; e.g. "pr(latex)" will print
8836 proof state according to the Isabelle LaTeX style;
8838 * Isar: improved support for emulating tactic scripts, including proof
8839 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8840 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8841 (for HOL datatypes);
8843 * Isar: simplified (more robust) goal selection of proof methods: 1st
8844 goal, all goals, or explicit goal specifier (tactic emulation); thus
8845 'proof method scripts' have to be in depth-first order;
8847 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8849 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8850 should instead use individual commands for printing items
8851 (print_commands, print_methods etc.);
8853 * Isar: added 'nothing' --- the empty list of theorems;
8858 * HOL/MicroJava: formalization of a fragment of Java, together with a
8859 corresponding virtual machine and a specification of its bytecode
8860 verifier and a lightweight bytecode verifier, including proofs of
8861 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8862 Cornelia Pusch (see also the homepage of project Bali at
8863 http://isabelle.in.tum.de/Bali/);
8865 * HOL/Algebra: new theory of rings and univariate polynomials, by
8868 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8869 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8872 * HOL/Lattice: fundamental concepts of lattice theory and order
8873 structures, including duals, properties of bounds versus algebraic
8874 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8875 Theorem for complete lattices etc.; may also serve as a demonstration
8876 for abstract algebraic reasoning using axiomatic type classes, and
8877 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8879 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8882 * HOL/IMPP: extension of IMP with local variables and mutually
8883 recursive procedures, by David von Oheimb;
8885 * HOL/Lambda: converted into new-style theory and document;
8887 * HOL/ex/Multiquote: example of multiple nested quotations and
8888 anti-quotations -- basically a generalized version of de-Bruijn
8889 representation; very useful in avoiding lifting of operations;
8891 * HOL/record: added general record equality rule to simpset; fixed
8892 select-update simplification procedure to handle extended records as
8893 well; admit "r" as field name;
8895 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8896 other numeric types and also as the identity of groups, rings, etc.;
8898 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8899 Types nat and int belong to this axclass;
8901 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8902 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8903 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8904 two terms #m*u and #n*u are replaced by #(m+n)*u
8905 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8906 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8907 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8909 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8910 powerful prover for predicate logic but knows nothing of clasets; see
8911 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8913 * HOL: new version of "case_tac" subsumes both boolean case split and
8914 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8915 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8917 * HOL: simplification no longer dives into case-expressions: only the
8918 selector expression is simplified, but not the remaining arms; to
8919 enable full simplification of case-expressions for datatype t, you may
8920 remove t.weak_case_cong from the simpset, either globally (Delcongs
8921 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8923 * HOL/recdef: the recursion equations generated by 'recdef' for
8924 function 'f' are now called f.simps instead of f.rules; if all
8925 termination conditions are proved automatically, these simplification
8926 rules are added to the simpset, as in primrec; rules may be named
8927 individually as well, resulting in a separate list of theorems for
8930 * HOL/While is a new theory that provides a while-combinator. It
8931 permits the definition of tail-recursive functions without the
8932 provision of a termination measure. The latter is necessary once the
8933 invariant proof rule for while is applied.
8935 * HOL: new (overloaded) notation for the set of elements below/above
8936 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8938 * HOL: theorems impI, allI, ballI bound as "strip";
8940 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8941 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8942 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8944 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8946 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8947 main HOL, but was unused);
8949 * HOL: fewer consts declared as global (e.g. have to refer to
8950 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8952 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8953 in case of overlap with user translations (e.g. judgements over
8954 tuples); (note that the underlying logical represenation is still
8960 * ZF: simplification automatically cancels common terms in arithmetic
8961 expressions over nat and int;
8963 * ZF: new treatment of nat to minimize type-checking: all operators
8964 coerce their operands to a natural number using the function natify,
8965 making the algebraic laws unconditional;
8967 * ZF: as above, for int: operators coerce their operands to an integer
8968 using the function intify;
8970 * ZF: the integer library now contains many of the usual laws for the
8971 orderings, including $<=, and monotonicity laws for $+ and $*;
8973 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8976 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8977 to the simplifier and classical reasoner simultaneously;
8982 * Provers: blast_tac now handles actual object-logic rules as
8983 assumptions; note that auto_tac uses blast_tac internally as well;
8985 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8986 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8988 * Provers: delrules now handles destruct rules as well (no longer need
8989 explicit make_elim);
8991 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8992 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8993 use instead the strong form,
8994 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8995 in HOL, FOL and ZF the function cla_make_elim will create such rules
8996 from destruct-rules;
8998 * Provers: Simplifier.easy_setup provides a fast path to basic
8999 Simplifier setup for new object-logics;
9001 * Pure: AST translation rules no longer require constant head on LHS;
9003 * Pure: improved name spaces: ambiguous output is qualified; support
9004 for hiding of names;
9006 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9007 XSYMBOL_HOME; no longer need to do manual configuration in most
9010 * system: compression of ML heaps images may now be controlled via -c
9011 option of isabelle and isatool usedir (currently only observed by
9014 * system: isatool installfonts may handle X-Symbol fonts as well (very
9015 useful for remote X11);
9017 * system: provide TAGS file for Isabelle sources;
9019 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9022 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9023 timing flag supersedes proof_timing and Toplevel.trace;
9025 * ML: new combinators |>> and |>>> for incremental transformations
9026 with secondary results (e.g. certain theory extensions):
9028 * ML: PureThy.add_defs gets additional argument to indicate potential
9029 overloading (usually false);
9031 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9036 New in Isabelle99 (October 1999)
9037 --------------------------------
9039 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9041 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9042 are no longer simplified. (This allows the simplifier to unfold recursive
9043 functional programs.) To restore the old behaviour, declare
9045 Delcongs [if_weak_cong];
9047 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9050 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9052 * HOL/datatype: mutual_induct_tac no longer exists --
9053 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9055 * HOL/typedef: fixed type inference for representing set; type
9056 arguments now have to occur explicitly on the rhs as type constraints;
9058 * ZF: The con_defs part of an inductive definition may no longer refer
9059 to constants declared in the same theory;
9061 * HOL, ZF: the function mk_cases, generated by the inductive
9062 definition package, has lost an argument. To simplify its result, it
9063 uses the default simpset instead of a supplied list of theorems.
9065 * HOL/List: the constructors of type list are now Nil and Cons;
9067 * Simplifier: the type of the infix ML functions
9068 setSSolver addSSolver setSolver addSolver
9069 is now simpset * solver -> simpset where `solver' is a new abstract type
9070 for packaging solvers. A solver is created via
9071 mk_solver: string -> (thm list -> int -> tactic) -> solver
9072 where the string argument is only a comment.
9077 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9078 decision procedure for linear arithmetic. Currently it is used for
9079 types `nat', `int', and `real' in HOL (see below); it can, should and
9080 will be instantiated for other types and logics as well.
9082 * The simplifier now accepts rewrite rules with flexible heads, eg
9083 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9084 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9090 * New Isabelle/Isar subsystem provides an alternative to traditional
9091 tactical theorem proving; together with the ProofGeneral/isar user
9092 interface it offers an interactive environment for developing human
9093 readable proof documents (Isar == Intelligible semi-automated
9094 reasoning); for further information see isatool doc isar-ref,
9095 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9097 * improved and simplified presentation of theories: better HTML markup
9098 (including colors), graph views in several sizes; isatool usedir now
9099 provides a proper interface for user theories (via -P option); actual
9100 document preparation based on (PDF)LaTeX is available as well (for
9101 new-style theories only); see isatool doc system for more information;
9103 * native support for Proof General, both for classic Isabelle and
9106 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9107 using the graph browser tool;
9109 * Isabelle manuals now also available as PDF;
9111 * theory loader rewritten from scratch (may not be fully
9112 bug-compatible); old loadpath variable has been replaced by show_path,
9113 add_path, del_path, reset_path functions; new operations such as
9114 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9117 * improved isatool install: option -k creates KDE application icon,
9118 option -p DIR installs standalone binaries;
9120 * added ML_PLATFORM setting (useful for cross-platform installations);
9121 more robust handling of platform specific ML images for SML/NJ;
9123 * the settings environment is now statically scoped, i.e. it is never
9124 created again in sub-processes invoked from isabelle, isatool, or
9127 * path element specification '~~' refers to '$ISABELLE_HOME';
9129 * in locales, the "assumes" and "defines" parts may be omitted if
9132 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9135 * new print_mode "HTML";
9137 * new flag show_tags controls display of tags of theorems (which are
9138 basically just comments that may be attached by some tools);
9140 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9141 mode and goal output format:
9143 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9145 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9147 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9148 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9150 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9152 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9154 * function bind_thms stores lists of theorems (cf. bind_thm);
9156 * new shorthand tactics ftac, eatac, datac, fatac;
9158 * qed (and friends) now accept "" as result name; in that case the
9159 theorem is not stored, but proper checks and presentation of the
9162 * theorem database now also indexes constants "Trueprop", "all",
9163 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9168 ** HOL arithmetic **
9170 * There are now decision procedures for linear arithmetic over nat and
9173 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9174 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9175 are treated as atomic; subformulae not involving type `nat' or `int'
9176 are ignored; quantified subformulae are ignored unless they are
9177 positive universal or negative existential. The tactic has to be
9178 invoked by hand and can be a little bit slow. In particular, the
9179 running time is exponential in the number of occurrences of `min' and
9180 `max', and `-' on `nat'.
9182 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9183 (negated) (in)equalities among the premises and the conclusion into
9184 account (i.e. no compound formulae) and does not know about `min' and
9185 `max', and `-' on `nat'. It is fast and is used automatically by the
9188 NB: At the moment, these decision procedures do not cope with mixed
9189 nat/int formulae where the two parts interact, such as `m < n ==>
9192 * HOL/Numeral provides a generic theory of numerals (encoded
9193 efficiently as bit strings); setup for types nat/int/real is in place;
9194 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9195 int, existing theories and proof scripts may require a few additional
9198 * integer division and remainder can now be performed on constant
9201 * many properties of integer multiplication, division and remainder
9204 * An interface to the Stanford Validity Checker (SVC) is available through the
9205 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9206 are proved automatically. SVC must be installed separately, and its results
9207 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9208 invocation of the underlying oracle). For SVC see
9209 http://verify.stanford.edu/SVC
9211 * IsaMakefile: the HOL-Real target now builds an actual image;
9216 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9217 (in Isabelle/Isar) -- by Gertrud Bauer;
9219 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9220 analysis for assembly languages with subtypes;
9222 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9223 -- avoids syntactic ambiguities and treats state, transition, and
9224 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9225 changed syntax and (many) tactics;
9227 * HOL/inductive: Now also handles more general introduction rules such
9228 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9229 theorems are now maintained within the theory (maintained via the
9232 * HOL/datatype: Now also handles arbitrarily branching datatypes
9233 (using function types) such as
9235 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9237 * HOL/record: record_simproc (part of the default simpset) takes care
9238 of selectors applied to updated records; record_split_tac is no longer
9239 part of the default claset; update_defs may now be removed from the
9240 simpset in many cases; COMPATIBILITY: old behavior achieved by
9242 claset_ref () := claset() addSWrapper record_split_wrapper;
9243 Delsimprocs [record_simproc]
9245 * HOL/typedef: fixed type inference for representing set; type
9246 arguments now have to occur explicitly on the rhs as type constraints;
9248 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9249 names rather than an ML expression;
9251 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9252 supplied later. Program schemes can be defined, such as
9253 "While B C s = (if B s then While B C (C s) else s)"
9254 where the well-founded relation can be chosen after B and C have been given.
9256 * HOL/List: the constructors of type list are now Nil and Cons;
9257 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9258 course, ML tools referring to List.list.op # etc. have to be adapted;
9260 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9261 disabled by default; run isabelle with option -m HOL to get back to
9262 the original Gordon/HOL-style output;
9264 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9265 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9267 * HOL basic syntax simplified (more orthogonal): all variants of
9268 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9269 Eps operator is provided as well: "SOME x. P[x]";
9271 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9273 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9274 thus available for user theories;
9276 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9277 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9280 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9281 several times and then mp;
9286 * the notation <<...>> is now available as a notation for sequences of
9289 * the simplifier is now installed
9291 * the axiom system has been generalized (thanks to Soren Heilmann)
9293 * the classical reasoner now has a default rule database
9298 * new primrec section allows primitive recursive functions to be given
9299 directly (as in HOL) over datatypes and the natural numbers;
9301 * new tactics induct_tac and exhaust_tac for induction (or case
9302 analysis) over datatypes and the natural numbers;
9304 * the datatype declaration of type T now defines the recursor T_rec;
9306 * simplification automatically does freeness reasoning for datatype
9309 * automatic type-inference, with AddTCs command to insert new
9310 type-checking rules;
9312 * datatype introduction rules are now added as Safe Introduction rules
9315 * the syntax "if P then x else y" is now available in addition to
9319 *** Internal programming interfaces ***
9321 * tuned simplifier trace output; new flag debug_simp;
9323 * structures Vartab / Termtab (instances of TableFun) offer efficient
9324 tables indexed by indexname_ord / term_ord (compatible with aconv);
9326 * AxClass.axclass_tac lost the theory argument;
9328 * tuned current_goals_markers semantics: begin / end goal avoids
9329 printing empty lines;
9331 * removed prs and prs_fn hook, which was broken because it did not
9332 include \n in its semantics, forcing writeln to add one
9333 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9334 string -> unit if you really want to output text without newline;
9336 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9337 plain output, interface builders may have to enable 'isabelle_font'
9338 mode to get Isabelle font glyphs as before;
9340 * refined token_translation interface; INCOMPATIBILITY: output length
9341 now of type real instead of int;
9343 * theory loader actions may be traced via new ThyInfo.add_hook
9344 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9345 your own database of information attached to *whole* theories -- as
9346 opposed to intra-theory data slots offered via TheoryDataFun;
9348 * proper handling of dangling sort hypotheses (at last!);
9349 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9350 extra sort hypotheses that can be witnessed from the type signature;
9351 the force_strip_shyps flag is gone, any remaining shyps are simply
9352 left in the theorem (with a warning issued by strip_shyps_warning);
9356 New in Isabelle98-1 (October 1998)
9357 ----------------------------------
9359 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9361 * several changes of automated proof tools;
9363 * HOL: major changes to the inductive and datatype packages, including
9364 some minor incompatibilities of theory syntax;
9366 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9369 * HOL: removed duplicate thms in Arith:
9370 less_imp_add_less should be replaced by trans_less_add1
9371 le_imp_add_le should be replaced by trans_le_add1
9373 * HOL: unary minus is now overloaded (new type constraints may be
9376 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9377 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9378 now taken as an integer constant.
9380 * Pure: ML function 'theory_of' renamed to 'theory';
9386 1. Asm_full_simp_tac is now more aggressive.
9387 1. It will sometimes reorient premises if that increases their power to
9389 2. It does no longer proceed strictly from left to right but may also
9390 rotate premises to achieve further simplification.
9391 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9392 old Asm_full_simp_tac in that it does not rotate premises.
9393 2. The simplifier now knows a little bit about nat-arithmetic.
9395 * Classical reasoner: wrapper mechanism for the classical reasoner now
9396 allows for selected deletion of wrappers, by introduction of names for
9397 wrapper functionals. This implies that addbefore, addSbefore,
9398 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9399 and that adding two tactics with the same name overwrites the first
9400 one (emitting a warning).
9401 type wrapper = (int -> tactic) -> (int -> tactic)
9402 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9403 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9404 delWrapper, delSWrapper: claset * string -> claset
9405 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9407 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9408 semantics; addbefore now affects only the unsafe part of step_tac
9409 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9410 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9413 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9414 compWrapper; added safe wrapper (and access functions for it);
9416 * HOL/split_all_tac is now much faster and fails if there is nothing
9417 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9418 and the names of the automatically generated variables have changed.
9419 split_all_tac has moved within claset() from unsafe wrappers to safe
9420 wrappers, which means that !!-bound variables are split much more
9421 aggressively, and safe_tac and clarify_tac now split such variables.
9422 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9423 Note: the same holds for record_split_tac, which does the job of
9424 split_all_tac for record fields.
9426 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9427 permanently to the default simpset using Addsplits just like
9428 Addsimps. They can be removed via Delsplits just like
9429 Delsimps. Lower-case versions are also available.
9431 * HOL/Simplifier: The rule split_if is now part of the default
9432 simpset. This means that the simplifier will eliminate all occurrences
9433 of if-then-else in the conclusion of a goal. To prevent this, you can
9434 either remove split_if completely from the default simpset by
9435 `Delsplits [split_if]' or remove it in a specific call of the
9436 simplifier using `... delsplits [split_if]'. You can also add/delete
9437 other case splitting rules to/from the default simpset: every datatype
9438 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9439 t is the name of the datatype).
9441 * Classical reasoner / Simplifier combination: new force_tac (and
9442 derivatives Force_tac, force) combines rewriting and classical
9443 reasoning (and whatever other tools) similarly to auto_tac, but is
9444 aimed to solve the given subgoal completely.
9449 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9450 and `goalw': the theory is no longer needed as an explicit argument -
9451 the current theory context is used; assumptions are no longer returned
9452 at the ML-level unless one of them starts with ==> or !!; it is
9453 recommended to convert to these new commands using isatool fixgoal
9454 (backup your sources first!);
9456 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9457 the current theory context, and 'theory' to lookup stored theories;
9459 * new theory section 'locale' for declaring constants, assumptions and
9460 definitions that have local scope;
9462 * new theory section 'nonterminals' for purely syntactic types;
9464 * new theory section 'setup' for generic ML setup functions
9465 (e.g. package initialization);
9467 * the distribution now includes Isabelle icons: see
9468 lib/logo/isabelle-{small,tiny}.xpm;
9470 * isatool install - install binaries with absolute references to
9473 * isatool logo -- create instances of the Isabelle logo (as EPS);
9475 * print mode 'emacs' reserved for Isamode;
9477 * support multiple print (ast) translations per constant name;
9479 * theorems involving oracles are now printed with a suffixed [!];
9484 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9486 * HOL/inductive package reorganized and improved: now supports mutual
9492 oddI "n : EVEN ==> Suc n : ODD"
9493 evenI "n : ODD ==> Suc n : EVEN"
9495 new theorem list "elims" contains an elimination rule for each of the
9496 recursive sets; inductive definitions now handle disjunctive premises
9497 correctly (also ZF);
9499 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9500 "mutual_induct" no longer exists - the induction rule is always
9501 contained in "induct";
9504 * HOL/datatype package re-implemented and greatly improved: now
9505 supports mutually recursive datatypes such as
9508 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9509 | SUM ('a aexp) ('a aexp)
9510 | DIFF ('a aexp) ('a aexp)
9513 'a bexp = LESS ('a aexp) ('a aexp)
9514 | AND ('a bexp) ('a bexp)
9515 | OR ('a bexp) ('a bexp)
9517 as well as indirectly recursive datatypes such as
9520 ('a, 'b) term = Var 'a
9521 | App 'b ((('a, 'b) term) list)
9523 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9524 induction on mutually / indirectly recursive datatypes.
9526 Primrec equations are now stored in theory and can be accessed via
9527 <function_name>.simps.
9531 - Theories using datatypes must now have theory Datatype as an
9533 - The specific <typename>.induct_tac no longer exists - use the
9534 generic induct_tac instead.
9535 - natE has been renamed to nat.exhaust - use exhaust_tac
9536 instead of res_inst_tac ... natE. Note that the variable
9537 names in nat.exhaust differ from the names in natE, this
9538 may cause some "fragile" proofs to fail.
9539 - The theorems split_<typename>_case and split_<typename>_case_asm
9540 have been renamed to <typename>.split and <typename>.split_asm.
9541 - Since default sorts of type variables are now handled correctly,
9542 some datatype definitions may have to be annotated with explicit
9544 - Primrec definitions no longer require function name and type
9545 of recursive argument.
9547 Consider using isatool fixdatatype to adapt your theories and proof
9548 scripts to the new package (backup your sources first!).
9551 * HOL/record package: considerably improved implementation; now
9552 includes concrete syntax for record types, terms, updates; theorems
9553 for surjective pairing and splitting !!-bound record variables; proof
9554 support is as follows:
9556 1) standard conversions (selectors or updates applied to record
9557 constructor terms) are part of the standard simpset;
9559 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9560 made part of standard simpset and claset via addIffs;
9562 3) a tactic for record field splitting (record_split_tac) is part of
9563 the standard claset (addSWrapper);
9565 To get a better idea about these rules you may retrieve them via
9566 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9567 the name of your record type.
9569 The split tactic 3) conceptually simplifies by the following rule:
9571 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9573 Thus any record variable that is bound by meta-all will automatically
9574 blow up into some record constructor term, consequently the
9575 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9576 solve record problems automatically.
9579 * reorganized the main HOL image: HOL/Integ and String loaded by
9580 default; theory Main includes everything;
9582 * automatic simplification of integer sums and comparisons, using cancellation;
9584 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9586 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9588 * many new identities for unions, intersections, set difference, etc.;
9590 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9591 called split_if, split_split, split_sum_case and split_nat_case (to go
9592 with add/delsplits);
9594 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9595 (?x::unit) = (); this is made part of the default simpset, which COULD
9596 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9597 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9598 unit_abs_eta_conv is added in order to counter the effect of
9599 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9602 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9605 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9606 It and 'sym RS equals0D' are now in the default claset, giving automatic
9607 disjointness reasoning but breaking a few old proofs.
9609 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9610 to 'converse' from 'inverse' (for compatibility with ZF and some
9613 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9614 the well-founded relation;
9616 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9617 Compl A. The "Compl" syntax remains available as input syntax for this
9620 * HOL/Update: new theory of function updates:
9621 f(a:=b) == %x. if x=a then b else f x
9622 may also be iterated as in f(a:=b,c:=d,...);
9624 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9627 - new function list_update written xs[i:=v] that updates the i-th
9628 list position. May also be iterated as in xs[i:=a,j:=b,...].
9629 - new function `upt' written [i..j(] which generates the list
9630 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9631 bound write [i..j], which is a shorthand for [i..j+1(].
9632 - new lexicographic orderings and corresponding wellfoundedness theorems.
9635 - removed 'pred' (predecessor) function;
9636 - generalized some theorems about n-1;
9637 - many new laws about "div" and "mod";
9638 - new laws about greatest common divisors (see theory ex/Primes);
9640 * HOL/Relation: renamed the relational operator r^-1 "converse"
9641 instead of "inverse";
9643 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9644 of the multiset ordering;
9646 * directory HOL/Real: a construction of the reals using Dedekind cuts
9647 (not included by default);
9649 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9651 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9652 programs, i.e. different program variables may have different types.
9654 * calling (stac rew i) now fails if "rew" has no effect on the goal
9655 [previously, this check worked only if the rewrite rule was unconditional]
9656 Now rew can involve either definitions or equalities (either == or =).
9661 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9662 only the theorems proved on ZF.ML;
9664 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9665 It and 'sym RS equals0D' are now in the default claset, giving automatic
9666 disjointness reasoning but breaking a few old proofs.
9668 * ZF/Update: new theory of function updates
9669 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9670 may also be iterated as in f(a:=b,c:=d,...);
9672 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9674 * calling (stac rew i) now fails if "rew" has no effect on the goal
9675 [previously, this check worked only if the rewrite rule was unconditional]
9676 Now rew can involve either definitions or equalities (either == or =).
9678 * case_tac provided for compatibility with HOL
9679 (like the old excluded_middle_tac, but with subgoals swapped)
9682 *** Internal programming interfaces ***
9684 * Pure: several new basic modules made available for general use, see
9685 also src/Pure/README;
9687 * improved the theory data mechanism to support encapsulation (data
9688 kind name replaced by private Object.kind, acting as authorization
9689 key); new type-safe user interface via functor TheoryDataFun; generic
9690 print_data function becomes basically useless;
9692 * removed global_names compatibility flag -- all theory declarations
9693 are qualified by default;
9695 * module Pure/Syntax now offers quote / antiquote translation
9696 functions (useful for Hoare logic etc. with implicit dependencies);
9697 see HOL/ex/Antiquote for an example use;
9699 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9702 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9705 * Display.print_goals function moved to Locale.print_goals;
9707 * standard print function for goals supports current_goals_markers
9708 variable for marking begin of proof, end of proof, start of goal; the
9709 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9710 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9715 New in Isabelle98 (January 1998)
9716 --------------------------------
9718 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9720 * changed lexical syntax of terms / types: dots made part of long
9721 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9723 * simpset (and claset) reference variable replaced by functions
9724 simpset / simpset_ref;
9726 * no longer supports theory aliases (via merge) and non-trivial
9727 implicit merge of thms' signatures;
9729 * most internal names of constants changed due to qualified names;
9731 * changed Pure/Sequence interface (see Pure/seq.ML);
9734 *** General Changes ***
9736 * hierachically structured name spaces (for consts, types, axms, thms
9737 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9738 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9739 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9740 long_names for fully qualified output names; NOTE: ML programs
9741 (special tactics, packages etc.) referring to internal names may have
9742 to be adapted to cope with fully qualified names; in case of severe
9743 backward campatibility problems try setting 'global_names' at compile
9744 time to have enrything declared within a flat name space; one may also
9745 fine tune name declarations in theories via the 'global' and 'local'
9748 * reimplemented the implicit simpset and claset using the new anytype
9749 data filed in signatures; references simpset:simpset ref etc. are
9750 replaced by functions simpset:unit->simpset and
9751 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9752 to patch your ML files accordingly;
9754 * HTML output now includes theory graph data for display with Java
9755 applet or isatool browser; data generated automatically via isatool
9756 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9758 * defs may now be conditional; improved rewrite_goals_tac to handle
9759 conditional equations;
9761 * defs now admits additional type arguments, using TYPE('a) syntax;
9763 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9764 creates a new theory node; implicit merge of thms' signatures is
9765 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9766 transfer:theory->thm->thm in (rare) cases;
9768 * improved handling of draft signatures / theories; draft thms (and
9769 ctyps, cterms) are automatically promoted to real ones;
9771 * slightly changed interfaces for oracles: admit many per theory, named
9772 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9774 * print_goals: optional output of const types (set show_consts and
9777 * improved output of warnings (###) and errors (***);
9779 * subgoal_tac displays a warning if the new subgoal has type variables;
9781 * removed old README and Makefiles;
9783 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9785 * removed obsolete init_pps and init_database;
9787 * deleted the obsolete tactical STATE, which was declared by
9788 fun STATE tacfun st = tacfun st st;
9790 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9791 (which abbreviates $HOME);
9793 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9794 use isatool fixseq to adapt your ML programs (this works for fully
9795 qualified references to the Sequence structure only!);
9797 * use_thy no longer requires writable current directory; it always
9798 reloads .ML *and* .thy file, if either one is out of date;
9801 *** Classical Reasoner ***
9803 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9804 tactics that use classical reasoning to simplify a subgoal without
9805 splitting it into several subgoals;
9807 * Safe_tac: like safe_tac but uses the default claset;
9812 * added simplification meta rules:
9813 (asm_)(full_)simplify: simpset -> thm -> thm;
9815 * simplifier.ML no longer part of Pure -- has to be loaded by object
9818 * added prems argument to simplification procedures;
9820 * HOL, FOL, ZF: added infix function `addsplits':
9821 instead of `<simpset> setloop (split_tac <thms>)'
9822 you can simply write `<simpset> addsplits <thms>'
9827 * TYPE('a) syntax for type reflection terms;
9829 * no longer handles consts with name "" -- declare as 'syntax' instead;
9831 * pretty printer: changed order of mixfix annotation preference (again!);
9833 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9838 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9839 with `addloop' of the simplifier to faciliate case splitting in premises.
9841 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9843 * HOL/Auth: new protocol proofs including some for the Internet
9846 * HOL/Map: new theory of `maps' a la VDM;
9848 * HOL/simplifier: simplification procedures nat_cancel_sums for
9849 cancelling out common nat summands from =, <, <= (in)equalities, or
9850 differences; simplification procedures nat_cancel_factor for
9851 cancelling common factor from =, <, <= (in)equalities over natural
9852 sums; nat_cancel contains both kinds of procedures, it is installed by
9853 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9855 * HOL/simplifier: terms of the form
9856 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9858 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9859 and those of the form
9860 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9862 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9865 Each datatype `t' now comes with a theorem `split_t_case' of the form
9867 P(t_case f1 ... fn x) =
9868 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9870 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9873 and a theorem `split_t_case_asm' of the form
9875 P(t_case f1 ... fn x) =
9876 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9878 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9880 which can be added to a simpset via `addsplits'. The existing theorems
9881 expand_list_case and expand_option_case have been renamed to
9882 split_list_case and split_option_case.
9885 - `pred n' is automatically converted to `n-1'.
9886 Users are strongly encouraged not to use `pred' any longer,
9887 because it will disappear altogether at some point.
9888 - Users are strongly encouraged to write "0 < n" rather than
9889 "n ~= 0". Theorems and proof tools have been modified towards this
9893 the function "set_of_list" has been renamed "set" (and its theorems too);
9894 the function "nth" now takes its arguments in the reverse order and
9895 has acquired the infix notation "!" as in "xs!n".
9897 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9899 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9900 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9902 * HOL/record: extensible records with schematic structural subtyping
9903 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9904 still lacks various theorems and concrete record syntax;
9909 * removed "axioms" and "generated by" sections;
9911 * replaced "ops" section by extended "consts" section, which is capable of
9912 handling the continuous function space "->" directly;
9915 . proves theorems immediately and stores them in the theory,
9916 . creates hierachical name space,
9917 . now uses normal mixfix annotations (instead of cinfix...),
9918 . minor changes to some names and values (for consistency),
9919 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9920 . separator between mutual domain defs: changed "," to "and",
9921 . improved handling of sort constraints; now they have to
9922 appear on the left-hand side of the equations only;
9924 * fixed LAM <x,y,zs>.b syntax;
9926 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9927 adm (%x. P (t x)), where P is chainfinite and t continuous;
9932 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9933 with `addloop' of the simplifier to faciliate case splitting in premises.
9935 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9936 in HOL, they strip ALL and --> from proved theorems;
9940 New in Isabelle94-8 (May 1997)
9941 ------------------------------
9943 *** General Changes ***
9945 * new utilities to build / run / maintain Isabelle etc. (in parts
9946 still somewhat experimental); old Makefiles etc. still functional;
9948 * new 'Isabelle System Manual';
9950 * INSTALL text, together with ./configure and ./build scripts;
9952 * reimplemented type inference for greater efficiency, better error
9953 messages and clean internal interface;
9955 * prlim command for dealing with lots of subgoals (an easier way of
9956 setting goals_limit);
9961 * supports alternative (named) syntax tables (parser and pretty
9962 printer); internal interface is provided by add_modesyntax(_i);
9964 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9965 be used in conjunction with the Isabelle symbol font; uses the
9966 "symbols" syntax table;
9968 * added token_translation interface (may translate name tokens in
9969 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9970 the current print_mode); IMPORTANT: user print translation functions
9971 are responsible for marking newly introduced bounds
9972 (Syntax.mark_boundT);
9974 * token translations for modes "xterm" and "xterm_color" that display
9975 names in bold, underline etc. or colors (which requires a color
9978 * infixes may now be declared with names independent of their syntax;
9980 * added typed_print_translation (like print_translation, but may
9981 access type of constant);
9984 *** Classical Reasoner ***
9986 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9987 some limitations. Blast_tac...
9988 + ignores addss, addbefore, addafter; this restriction is intrinsic
9989 + ignores elimination rules that don't have the correct format
9990 (the conclusion MUST be a formula variable)
9991 + ignores types, which can make HOL proofs fail
9992 + rules must not require higher-order unification, e.g. apply_type in ZF
9993 [message "Function Var's argument not a bound variable" relates to this]
9994 + its proof strategy is more general but can actually be slower
9996 * substitution with equality assumptions no longer permutes other
9999 * minor changes in semantics of addafter (now called addaltern); renamed
10000 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10001 (and access functions for it);
10003 * improved combination of classical reasoner and simplifier:
10004 + functions for handling clasimpsets
10005 + improvement of addss: now the simplifier is called _after_ the
10007 + safe variant of addss called addSss: uses safe simplifications
10008 _during_ the safe steps. It is more complete as it allows multiple
10009 instantiations of unknowns (e.g. with slow_tac).
10013 * added interface for simplification procedures (functions that
10014 produce *proven* rewrite rules on the fly, depending on current
10017 * ordering on terms as parameter (used for ordered rewriting);
10019 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10021 * the solver is now split into a safe and an unsafe part.
10022 This should be invisible for the normal user, except that the
10023 functions setsolver and addsolver have been renamed to setSolver and
10024 addSolver; added safe_asm_full_simp_tac;
10029 * a generic induction tactic `induct_tac' which works for all datatypes and
10030 also for type `nat';
10032 * a generic case distinction tactic `exhaust_tac' which works for all
10033 datatypes and also for type `nat';
10035 * each datatype comes with a function `size';
10037 * patterns in case expressions allow tuple patterns as arguments to
10038 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10040 * primrec now also works with type nat;
10042 * recdef: a new declaration form, allows general recursive functions to be
10043 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10045 * the constant for negation has been renamed from "not" to "Not" to
10046 harmonize with FOL, ZF, LK, etc.;
10048 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10051 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10053 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10054 problems in commutative rings, using axiomatic type classes for + and *;
10056 * more examples in HOL/MiniML and HOL/Auth;
10058 * more default rewrite rules for quantifiers, union/intersection;
10060 * a new constant `arbitrary == @x.False';
10062 * HOLCF/IOA replaces old HOL/IOA;
10064 * HOLCF changes: derived all rules and arities
10065 + axiomatic type classes instead of classes
10066 + typedef instead of faking type definitions
10067 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10068 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10069 + eliminated the types void, one, tr
10070 + use unit lift and bool lift (with translations) instead of one and tr
10071 + eliminated blift from Lift3.thy (use Def instead of blift)
10072 all eliminated rules are derived as theorems --> no visible changes ;
10077 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10078 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10079 as ZF_cs addSIs [equalityI];
10083 New in Isabelle94-7 (November 96)
10084 ---------------------------------
10086 * allowing negative levels (as offsets) in prlev and choplev;
10088 * super-linear speedup for large simplifications;
10090 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10091 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10092 FAIL); can suppress it using the command Delsimps (ex_simps @
10093 all_simps); De Morgan laws are also now included, by default;
10095 * improved printing of ==> : ~:
10097 * new object-logic "Sequents" adds linear logic, while replacing LK
10098 and Modal (thanks to Sara Kalvala);
10100 * HOL/Auth: correctness proofs for authentication protocols;
10102 * HOL: new auto_tac combines rewriting and classical reasoning (many
10103 examples on HOL/Auth);
10105 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10106 the rewriter and classical reasoner simultaneously;
10108 * function uresult no longer returns theorems in "standard" format;
10109 regain previous version by: val uresult = standard o uresult;
10113 New in Isabelle94-6
10114 -------------------
10116 * oracles -- these establish an interface between Isabelle and trusted
10117 external reasoners, which may deliver results as theorems;
10119 * proof objects (in particular record all uses of oracles);
10121 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10123 * "constdefs" section in theory files;
10125 * "primrec" section (HOL) no longer requires names;
10127 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10131 New in Isabelle94-5
10132 -------------------
10134 * reduced space requirements;
10136 * automatic HTML generation from theories;
10138 * theory files no longer require "..." (quotes) around most types;
10140 * new examples, including two proofs of the Church-Rosser theorem;
10142 * non-curried (1994) version of HOL is no longer distributed;
10146 New in Isabelle94-4
10147 -------------------
10149 * greatly reduced space requirements;
10151 * theory files (.thy) no longer require \...\ escapes at line breaks;
10153 * searchable theorem database (see the section "Retrieving theorems" on
10154 page 8 of the Reference Manual);
10156 * new examples, including Grabczewski's monumental case study of the
10159 * The previous version of HOL renamed to Old_HOL;
10161 * The new version of HOL (previously called CHOL) uses a curried syntax
10162 for functions. Application looks like f a b instead of f(a,b);
10164 * Mutually recursive inductive definitions finally work in HOL;
10166 * In ZF, pattern-matching on tuples is now available in all abstractions and
10167 translates to the operator "split";
10171 New in Isabelle94-3
10172 -------------------
10174 * new infix operator, addss, allowing the classical reasoner to
10175 perform simplification at each step of its search. Example:
10176 fast_tac (cs addss ss)
10178 * a new logic, CHOL, the same as HOL, but with a curried syntax
10179 for functions. Application looks like f a b instead of f(a,b). Also pairs
10180 look like (a,b) instead of <a,b>;
10182 * PLEASE NOTE: CHOL will eventually replace HOL!
10184 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10185 It translates to the operator "split". A new theory of integers is available;
10187 * In ZF, integer numerals now denote two's-complement binary integers.
10188 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10190 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10191 of the Axiom of Choice;
10195 New in Isabelle94-2
10196 -------------------
10198 * Significantly faster resolution;
10200 * the different sections in a .thy file can now be mixed and repeated
10203 * Database of theorems for FOL, HOL and ZF. New
10204 commands including qed, qed_goal and bind_thm store theorems in the database.
10206 * Simple database queries: return a named theorem (get_thm) or all theorems of
10207 a given theory (thms_of), or find out what theory a theorem was proved in
10210 * Bugs fixed in the inductive definition and datatype packages;
10212 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10213 and HOL_dup_cs obsolete;
10215 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10218 * Simpler definition of function space in ZF;
10220 * new results about cardinal and ordinal arithmetic in ZF;
10222 * 'subtype' facility in HOL for introducing new types as subsets of existing
10225 :mode=text:wrap=hard:maxLineLen=72: