1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Discontinued obsolete src/HOL/IsaMakefile (considered legacy since
10 Isabelle2013). Use "isabelle build" to operate on Isabelle sessions.
12 * Numeric types mapped by default to target language numerals:
13 natural (replaces former code_numeral) and integer (replaces
14 former code_int). Conversions are available as integer_of_natural /
15 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
16 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in ML).
19 * Discontinued theories Code_Integer and Efficient_Nat by a more
20 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
21 Code_Target_Nat and Code_Target_Numeral. See the tutorial on
22 code generation for details. INCOMPATIBILITY.
24 * Theory "RealVector" and "Limits": Introduce type class
25 (lin)order_topology. Allows to generalize theorems about limits and
26 order. Instances are reals and extended reals.
28 * Consolidation of library theories on product orders:
30 Product_Lattice ~> Product_Order -- pointwise order on products
31 Product_ord ~> Product_Lexorder -- lexicographic order on products
38 isar_shrink ~> isar_compress
41 New in Isabelle2013 (February 2013)
42 -----------------------------------
46 * Theorem status about oracles and unfinished/failed future proofs is
47 no longer printed by default, since it is incompatible with
48 incremental / parallel checking of the persistent document model. ML
49 function Thm.peek_status may be used to inspect a snapshot of the
50 ongoing evaluation process. Note that in batch mode --- notably
51 isabelle build --- the system ensures that future proofs of all
52 accessible theorems in the theory context are finished (as before).
54 * Configuration option show_markup controls direct inlining of markup
55 into the printed representation of formal entities --- notably type
56 and sort constraints. This enables Prover IDE users to retrieve that
57 information via tooltips in the output window, for example.
59 * Command 'ML_file' evaluates ML text from a file directly within the
60 theory, without any predeclaration via 'uses' in the theory header.
62 * Old command 'use' command and corresponding keyword 'uses' in the
63 theory header are legacy features and will be discontinued soon.
64 Tools that load their additional source files may imitate the
65 'ML_file' implementation, such that the system can take care of
66 dependencies properly.
68 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
69 is called fastforce / fast_force_tac already since Isabelle2011-1.
71 * Updated and extended "isar-ref" and "implementation" manual, reduced
72 remaining material in old "ref" manual.
74 * Improved support for auxiliary contexts that indicate block structure
75 for specifications. Nesting of "context fixes ... context assumes ..."
76 and "class ... context ...".
78 * Attribute "consumes" allows a negative value as well, which is
79 interpreted relatively to the total number of premises of the rule in
80 the target context. This form of declaration is stable when exported
81 from a nested 'context' with additional assumptions. It is the
82 preferred form for definitional packages, notably cases/rules produced
83 in HOL/inductive and HOL/function.
85 * More informative error messages for Isar proof commands involving
86 lazy enumerations (method applications etc.).
88 * Refined 'help' command to retrieve outer syntax commands according
89 to name patterns (with clickable results).
92 *** Prover IDE -- Isabelle/Scala/jEdit ***
94 * Parallel terminal proofs ('by') are enabled by default, likewise
95 proofs that are built into packages like 'datatype', 'function'. This
96 allows to "run ahead" checking the theory specifications on the
97 surface, while the prover is still crunching on internal
98 justifications. Unfinished / cancelled proofs are restarted as
99 required to complete full proof checking eventually.
101 * Improved output panel with tooltips, hyperlinks etc. based on the
102 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
103 tooltips leads to some window that supports the same recursively,
104 which can lead to stacks of tooltips as the semantic document content
105 is explored. ESCAPE closes the whole stack, individual windows may be
106 closed separately, or detached to become independent jEdit dockables.
108 * Improved support for commands that produce graph output: the text
109 message contains a clickable area to open a new instance of the graph
112 * More robust incremental parsing of outer syntax (partial comments,
113 malformed symbols). Changing the balance of open/close quotes and
114 comment delimiters works more conveniently with unfinished situations
115 that frequently occur in user interaction.
117 * More efficient painting and improved reactivity when editing large
118 files. More scalable management of formal document content.
120 * Smarter handling of tracing messages: prover process pauses after
121 certain number of messages per command transaction, with some user
122 dialog to stop or continue. This avoids swamping the front-end with
123 potentially infinite message streams.
125 * More plugin options and preferences, based on Isabelle/Scala. The
126 jEdit plugin option panel provides access to some Isabelle/Scala
127 options, including tuning parameters for editor reactivity and color
130 * Dockable window "Symbols" provides some editing support for Isabelle
133 * Dockable window "Monitor" shows ML runtime statistics. Note that
134 continuous display of the chart slows down the system.
136 * Improved editing support for control styles: subscript, superscript,
137 bold, reset of style -- operating on single symbols or text
138 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
140 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
141 adjust the main text area font size, and its derivatives for output,
142 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
143 need to be adapted to local keyboard layouts.
145 * More reactive completion popup by default: use \t (TAB) instead of
146 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
147 also "Plugin Options / SideKick / General / Code Completion Options".
149 * Implicit check and build dialog of the specified logic session
150 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
151 demand, without bundling big platform-dependent heap images in the
152 Isabelle distribution.
154 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
155 from Oracle provide better multi-platform experience. This version is
156 now bundled exclusively with Isabelle.
161 * Code generation for Haskell: restrict unqualified imports from
162 Haskell Prelude to a small set of fundamental operations.
164 * Command 'export_code': relative file names are interpreted
165 relatively to master directory of current theory rather than the
166 rather arbitrary current working directory. INCOMPATIBILITY.
168 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
169 use regular rule composition via "OF" / "THEN", or explicit proof
170 structure instead. Note that Isabelle/ML provides a variety of
171 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
172 with some care where this is really required.
174 * Command 'typ' supports an additional variant with explicit sort
175 constraint, to infer and check the most general type conforming to a
176 given sort. Example (in HOL):
178 typ "_ * _ * bool * unit" :: finite
180 * Command 'locale_deps' visualizes all locales and their relations as
188 - Added MaSh relevance filter based on machine-learning; see the
189 Sledgehammer manual for details.
190 - Polished Isar proofs generated with "isar_proofs" option.
191 - Rationalized type encodings ("type_enc" option).
192 - Renamed "kill_provers" subcommand to "kill_all".
194 isar_proof ~> isar_proofs
195 isar_shrink_factor ~> isar_shrink
196 max_relevant ~> max_facts
197 relevance_thresholds ~> fact_thresholds
199 * Quickcheck: added an optimisation for equality premises. It is
200 switched on by default, and can be switched off by setting the
201 configuration quickcheck_optimise_equality to false.
203 * Quotient: only one quotient can be defined by quotient_type
207 - generation of an abstraction function equation in lift_definition
209 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
211 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
214 * Preprocessing of the code generator rewrites set comprehensions into
215 pointfree expressions.
217 * The SMT solver Z3 has now by default a restricted set of directly
218 supported features. For the full set of features (div/mod, nonlinear
219 arithmetic, datatypes/records) with potential proof reconstruction
220 failures, enable the configuration option "z3_with_extensions". Minor
223 * Simplified 'typedef' specifications: historical options for implicit
224 set definition and alternative name have been discontinued. The
225 former behavior of "typedef (open) t = A" is now the default, but
226 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
229 * Removed constant "chars"; prefer "Enum.enum" on type "char"
230 directly. INCOMPATIBILITY.
232 * Moved operation product, sublists and n_lists from theory Enum to
233 List. INCOMPATIBILITY.
235 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
237 * Class "comm_monoid_diff" formalises properties of bounded
238 subtraction, with natural numbers and multisets as typical instances.
240 * Added combinator "Option.these" with type "'a option set => 'a set".
242 * Theory "Transitive_Closure": renamed lemmas
244 reflcl_tranclp -> reflclp_tranclp
245 rtranclp_reflcl -> rtranclp_reflclp
249 * Theory "Rings": renamed lemmas (in class semiring)
251 left_distrib ~> distrib_right
252 right_distrib ~> distrib_left
256 * Generalized the definition of limits:
258 - Introduced the predicate filterlim (LIM x F. f x :> G) which
259 expresses that when the input values x converge to F then the
260 output f x converges to G.
262 - Added filters for convergence to positive (at_top) and negative
265 - Moved infinity in the norm (at_infinity) from
266 Multivariate_Analysis to Complex_Main.
268 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
273 * Theory "Library/Option_ord" provides instantiation of option type to
274 lattice type classes.
276 * Theory "Library/Multiset": renamed
278 constant fold_mset ~> Multiset.fold
279 fact fold_mset_commute ~> fold_mset_comm
283 * Renamed theory Library/List_Prefix to Library/Sublist, with related
286 - Renamed constants (and related lemmas)
289 strict_prefix ~> prefix
291 - Replaced constant "postfix" by "suffixeq" with swapped argument
292 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
293 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
294 Renamed lemmas accordingly.
296 - Added constant "list_hembeq" for homeomorphic embedding on
297 lists. Added abbreviation "sublisteq" for special case
298 "list_hembeq (op =)".
300 - Theory Library/Sublist no longer provides "order" and "bot" type
301 class instances for the prefix order (merely corresponding locale
302 interpretations). The type class instances are now in theory
303 Library/Prefix_Order.
305 - The sublist relation of theory Library/Sublist_Order is now based
306 on "Sublist.sublisteq". Renamed lemmas accordingly:
308 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
309 le_list_append_mono ~> Sublist.list_hembeq_append_mono
310 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
311 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
312 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
313 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
314 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
315 le_list_drop_many ~> Sublist.sublisteq_drop_many
316 le_list_filter_left ~> Sublist.sublisteq_filter_left
317 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
318 le_list_rev_take_iff ~> Sublist.sublisteq_append
319 le_list_same_length ~> Sublist.sublisteq_same_length
320 le_list_take_many_iff ~> Sublist.sublisteq_append'
321 less_eq_list.drop ~> less_eq_list_drop
322 less_eq_list.induct ~> less_eq_list_induct
323 not_le_list_length ~> Sublist.not_sublisteq_length
327 * New theory Library/Countable_Set.
329 * Theory Library/Debug and Library/Parallel provide debugging and
330 parallel execution for code generated towards Isabelle/ML.
332 * Theory Library/FuncSet: Extended support for Pi and extensional and
333 introduce the extensional dependent function space "PiE". Replaced
334 extensional_funcset by an abbreviation, and renamed lemmas from
335 extensional_funcset to PiE as follows:
337 extensional_empty ~> PiE_empty
338 extensional_funcset_empty_domain ~> PiE_empty_domain
339 extensional_funcset_empty_range ~> PiE_empty_range
340 extensional_funcset_arb ~> PiE_arb
341 extensional_funcset_mem ~> PiE_mem
342 extensional_funcset_extend_domainI ~> PiE_fun_upd
343 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
344 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
345 card_extensional_funcset ~> card_PiE
346 finite_extensional_funcset ~> finite_PiE
350 * Theory Library/FinFun: theory of almost everywhere constant
351 functions (supersedes the AFP entry "Code Generation for Functions as
354 * Theory Library/Phantom: generic phantom type to make a type
355 parameter appear in a constant's type. This alternative to adding
356 TYPE('a) as another parameter avoids unnecessary closures in generated
359 * Theory Library/RBT_Impl: efficient construction of red-black trees
360 from sorted associative lists. Merging two trees with rbt_union may
361 return a structurally different tree than before. Potential
364 * Theory Library/IArray: immutable arrays with code generation.
366 * Theory Library/Finite_Lattice: theory of finite lattices.
368 * HOL/Multivariate_Analysis: replaced
370 "basis :: 'a::euclidean_space => nat => real"
371 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
373 on euclidean spaces by using the inner product "_ \<bullet> _" with
374 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
375 "SUM i : Basis. f i * r i".
377 With this change the following constants are also changed or removed:
379 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
380 a $$ i ~> inner a i (where i : Basis)
382 \<pi>, \<pi>' removed
384 Theorems about these constants where removed.
388 component_le_norm ~> Basis_le_norm
389 euclidean_eq ~> euclidean_eq_iff
390 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
391 euclidean_simps ~> inner_simps
392 independent_basis ~> independent_Basis
393 span_basis ~> span_Basis
394 in_span_basis ~> in_span_Basis
395 norm_bound_component_le ~> norm_boound_Basis_le
396 norm_bound_component_lt ~> norm_boound_Basis_lt
397 component_le_infnorm ~> Basis_le_infnorm
403 - Added simproc "measurable" to automatically prove measurability.
405 - Added induction rules for sigma sets with disjoint union
406 (sigma_sets_induct_disjoint) and for Borel-measurable functions
407 (borel_measurable_induct).
409 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
412 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
413 AFP entry "Ordinals_and_Cardinals").
415 * HOL/BNF: New (co)datatype package based on bounded natural functors
416 with support for mixed, nested recursion and interesting non-free
419 * HOL/Finite_Set and Relation: added new set and relation operations
420 expressed by Finite_Set.fold.
422 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
423 trees for the code generator.
425 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
427 possible INCOMPATIBILITY.
429 * HOL/Set: renamed Set.project -> Set.filter
433 *** Document preparation ***
435 * Dropped legacy antiquotations "term_style" and "thm_style", since
436 styles may be given as arguments to "term" and "thm" already.
437 Discontinued legacy styles "prem1" .. "prem19".
439 * Default LaTeX rendering for \<euro> is now based on eurosym package,
440 instead of slightly exotic babel/greek.
442 * Document variant NAME may use different LaTeX entry point
443 document/root_NAME.tex if that file exists, instead of the common
446 * Simplified custom document/build script, instead of old-style
447 document/IsaMakefile. Minor INCOMPATIBILITY.
452 * The default limit for maximum number of worker threads is now 8,
453 instead of 4, in correspondence to capabilities of contemporary
454 hardware and Poly/ML runtime system.
456 * Type Seq.results and related operations support embedded error
457 messages within lazy enumerations, and thus allow to provide
458 informative errors in the absence of any usable results.
460 * Renamed Position.str_of to Position.here to emphasize that this is a
461 formal device to inline positions into message text, but not
462 necessarily printing visible text.
467 * Advanced support for Isabelle sessions and build management, see
468 "system" manual for the chapter of that name, especially the "isabelle
469 build" tool and its examples. The "isabelle mkroot" tool prepares
470 session root directories for use with "isabelle build", similar to
471 former "isabelle mkdir" for "isabelle usedir". Note that this affects
472 document preparation as well. INCOMPATIBILITY, isabelle usedir /
473 mkdir / make are rendered obsolete.
475 * Discontinued obsolete Isabelle/build script, it is superseded by the
476 regular isabelle build tool. For example:
478 isabelle build -s -b HOL
480 * Discontinued obsolete "isabelle makeall".
482 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
483 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
484 provides some traditional targets that invoke "isabelle build". Note
485 that this is inefficient! Applications of Isabelle/HOL involving
486 "isabelle make" should be upgraded to use "isabelle build" directly.
488 * The "isabelle options" tool prints Isabelle system options, as
489 required for "isabelle build", for example.
491 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
492 Minor INCOMPATIBILITY in command-line options.
494 * The "isabelle install" tool has now a simpler command-line. Minor
497 * The "isabelle components" tool helps to resolve add-on components
498 that are not bundled, or referenced from a bare-bones repository
501 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
502 platform family: "linux", "macos", "windows".
504 * The ML system is configured as regular component, and no longer
505 picked up from some surrounding directory. Potential INCOMPATIBILITY
506 for home-made settings.
508 * Improved ML runtime statistics (heap, threads, future tasks etc.).
510 * Discontinued support for Poly/ML 5.2.1, which was the last version
511 without exception positions and advanced ML compiler/toplevel
514 * Discontinued special treatment of Proof General -- no longer guess
515 PROOFGENERAL_HOME based on accidental file-system layout. Minor
516 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
517 settings manually, or use a Proof General version that has been
518 bundled as Isabelle component.
522 New in Isabelle2012 (May 2012)
523 ------------------------------
527 * Prover IDE (PIDE) improvements:
529 - more robust Sledgehammer integration (as before the sledgehammer
530 command-line needs to be typed into the source buffer)
531 - markup for bound variables
532 - markup for types of term variables (displayed as tooltips)
533 - support for user-defined Isar commands within the running session
534 - improved support for Unicode outside original 16bit range
535 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
537 * Forward declaration of outer syntax keywords within the theory
538 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
539 commands to be used in the same theory where defined.
541 * Auxiliary contexts indicate block structure for specifications with
542 additional parameters and assumptions. Such unnamed contexts may be
543 nested within other targets, like 'theory', 'locale', 'class',
544 'instantiation' etc. Results from the local context are generalized
545 accordingly and applied to the enclosing target context. Example:
549 assumes xy: "x = y" and yz: "y = z"
552 lemma my_trans: "x = z" using xy yz by simp
558 The most basic application is to factor-out context elements of
559 several fixes/assumes/shows theorem statements, e.g. see
560 ~~/src/HOL/Isar_Examples/Group_Context.thy
562 Any other local theory specification element works within the "context
563 ... begin ... end" block as well.
565 * Bundled declarations associate attributed fact expressions with a
566 given name in the context. These may be later included in other
567 contexts. This allows to manage context extensions casually, without
568 the logical dependencies of locales and locale interpretation. See
569 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
571 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
572 declaration, and results are standardized before being stored. Thus
573 old-style "standard" after instantiation or composition of facts
574 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
575 indices of schematic variables.
577 * Rule attributes in local theory declarations (e.g. locale or class)
578 are now statically evaluated: the resulting theorem is stored instead
579 of the original expression. INCOMPATIBILITY in rare situations, where
580 the historic accident of dynamic re-evaluation in interpretations
583 * New tutorial "Programming and Proving in Isabelle/HOL"
584 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
585 Structured Isar Proofs" ("isar-overview"), which has been removed. It
586 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
587 Logic" as the recommended beginners tutorial, but does not cover all
588 of the material of that old tutorial.
590 * Updated and extended reference manuals: "isar-ref",
591 "implementation", "system"; reduced remaining material in old "ref"
597 * Command 'definition' no longer exports the foundational "raw_def"
598 into the user context. Minor INCOMPATIBILITY, may use the regular
599 "def" result with attribute "abs_def" to imitate the old version.
601 * Attribute "abs_def" turns an equation of the form "f x y == t" into
602 "f == %x y. t", which ensures that "simp" or "unfold" steps always
603 expand it. This also works for object-logic equality. (Formerly
604 undocumented feature.)
606 * Sort constraints are now propagated in simultaneous statements, just
607 like type constraints. INCOMPATIBILITY in rare situations, where
608 distinct sorts used to be assigned accidentally. For example:
610 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
612 lemma "P (x::'a)" and "Q (y::'a::bar)"
613 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
615 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
616 tolerant against multiple unifiers, as long as the final result is
617 unique. (As before, rules are composed in canonical right-to-left
618 order to accommodate newly introduced premises.)
620 * Renamed some inner syntax categories:
626 Minor INCOMPATIBILITY. Note that in practice "num_const" or
627 "num_position" etc. are mainly used instead (which also include
628 position information via constraints).
630 * Simplified configuration options for syntax ambiguity: see
631 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
632 manual. Minor INCOMPATIBILITY.
634 * Discontinued configuration option "syntax_positions": atomic terms
635 in parse trees are always annotated by position constraints.
637 * Old code generator for SML and its commands 'code_module',
638 'code_library', 'consts_code', 'types_code' have been discontinued.
639 Use commands of the generic code generator instead. INCOMPATIBILITY.
641 * Redundant attribute "code_inline" has been discontinued. Use
642 "code_unfold" instead. INCOMPATIBILITY.
644 * Dropped attribute "code_unfold_post" in favor of the its dual
645 "code_abbrev", which yields a common pattern in definitions like
647 definition [code_abbrev]: "f = t"
651 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
652 instead. INCOMPATIBILITY.
654 * Discontinued old "prems" fact, which used to refer to the accidental
655 collection of foundational premises in the context (already marked as
656 legacy since Isabelle2011).
661 * Type 'a set is now a proper type constructor (just as before
662 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
663 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
664 sets separate, it is often sufficient to rephrase some set S that has
665 been accidentally used as predicates by "%x. x : S", and some
666 predicate P that has been accidentally used as set by "{x. P x}".
667 Corresponding proofs in a first step should be pruned from any
668 tinkering with former theorems mem_def and Collect_def as far as
671 For developments which deliberately mix predicates and sets, a
672 planning step is necessary to determine what should become a predicate
673 and what a set. It can be helpful to carry out that step in
674 Isabelle2011-1 before jumping right into the current release.
676 * Code generation by default implements sets as container type rather
677 than predicates. INCOMPATIBILITY.
679 * New type synonym 'a rel = ('a * 'a) set
681 * The representation of numerals has changed. Datatype "num"
682 represents strictly positive binary numerals, along with functions
683 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
684 positive and negated numeric literals, respectively. See also
685 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
686 user theories may require adaptations as follows:
688 - Theorems with number_ring or number_semiring constraints: These
689 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
691 - Theories defining numeric types: Remove number, number_semiring,
692 and number_ring instances. Defer all theorems about numerals until
693 after classes one and semigroup_add have been instantiated.
695 - Numeral-only simp rules: Replace each rule having a "number_of v"
696 pattern with two copies, one for numeral and one for neg_numeral.
698 - Theorems about subclasses of semiring_1 or ring_1: These classes
699 automatically support numerals now, so more simp rules and
700 simprocs may now apply within the proof.
702 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
703 Redefine using other integer operations.
705 * Transfer: New package intended to generalize the existing
706 "descending" method and related theorem attributes from the Quotient
707 package. (Not all functionality is implemented yet, but future
708 development will focus on Transfer as an eventual replacement for the
709 corresponding parts of the Quotient package.)
711 - transfer_rule attribute: Maintains a collection of transfer rules,
712 which relate constants at two different types. Transfer rules may
713 relate different type instances of the same polymorphic constant,
714 or they may relate an operation on a raw type to a corresponding
715 operation on an abstract type (quotient or subtype). For example:
717 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
718 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
720 - transfer method: Replaces a subgoal on abstract types with an
721 equivalent subgoal on the corresponding raw types. Constants are
722 replaced with corresponding ones according to the transfer rules.
723 Goals are generalized over all free variables by default; this is
724 necessary for variables whose types change, but can be overridden
725 for specific variables with e.g. "transfer fixing: x y z". The
726 variant transfer' method allows replacing a subgoal with one that
727 is logically stronger (rather than equivalent).
729 - relator_eq attribute: Collects identity laws for relators of
730 various type constructors, e.g. "list_all2 (op =) = (op =)". The
731 transfer method uses these lemmas to infer transfer rules for
732 non-polymorphic constants on the fly.
734 - transfer_prover method: Assists with proving a transfer rule for a
735 new constant, provided the constant is defined in terms of other
736 constants that already have transfer rules. It should be applied
737 after unfolding the constant definitions.
739 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
740 from type nat to type int.
742 * Lifting: New package intended to generalize the quotient_definition
743 facility of the Quotient package; designed to work with Transfer.
745 - lift_definition command: Defines operations on an abstract type in
746 terms of a corresponding operation on a representation
747 type. Example syntax:
749 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
752 Users must discharge a respectfulness proof obligation when each
753 constant is defined. (For a type copy, i.e. a typedef with UNIV,
754 the proof is discharged automatically.) The obligation is
755 presented in a user-friendly, readable form; a respectfulness
756 theorem in the standard format and a transfer rule are generated
759 - Integration with code_abstype: For typedefs (e.g. subtypes
760 corresponding to a datatype invariant, such as dlist),
761 lift_definition generates a code certificate theorem and sets up
762 code generation for each constant.
764 - setup_lifting command: Sets up the Lifting package to work with a
765 user-defined type. The user must provide either a quotient theorem
766 or a type_definition theorem. The package configures transfer
767 rules for equality and quantifiers on the type, and sets up the
768 lift_definition command to work with the type.
770 - Usage examples: See Quotient_Examples/Lift_DList.thy,
771 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
772 Word/Word.thy and Library/Float.thy.
776 - The 'quotient_type' command now supports a 'morphisms' option with
777 rep and abs functions, similar to typedef.
779 - 'quotient_type' sets up new types to work with the Lifting and
780 Transfer packages, as with 'setup_lifting'.
782 - The 'quotient_definition' command now requires the user to prove a
783 respectfulness property at the point where the constant is
784 defined, similar to lift_definition; INCOMPATIBILITY.
786 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
787 accordingly, INCOMPATIBILITY.
789 * New diagnostic command 'find_unused_assms' to find potentially
790 superfluous assumptions in theorems using Quickcheck.
794 - Quickcheck returns variable assignments as counterexamples, which
795 allows to reveal the underspecification of functions under test.
796 For example, refuting "hd xs = x", it presents the variable
797 assignment xs = [] and x = a1 as a counterexample, assuming that
798 any property is false whenever "hd []" occurs in it.
800 These counterexample are marked as potentially spurious, as
801 Quickcheck also returns "xs = []" as a counterexample to the
802 obvious theorem "hd xs = hd xs".
804 After finding a potentially spurious counterexample, Quickcheck
805 continues searching for genuine ones.
807 By default, Quickcheck shows potentially spurious and genuine
808 counterexamples. The option "genuine_only" sets quickcheck to only
809 show genuine counterexamples.
811 - The command 'quickcheck_generator' creates random and exhaustive
812 value generators for a given type and operations.
814 It generates values by using the operations as if they were
815 constructors of that type.
817 - Support for multisets.
819 - Added "use_subtype" options.
821 - Added "quickcheck_locale" configuration to specify how to process
822 conjectures in a locale context.
824 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
825 and affecting 'rat' and 'real'.
828 - Integrated more tightly with SPASS, as described in the ITP 2012
829 paper "More SPASS with Isabelle".
830 - Made it try "smt" as a fallback if "metis" fails or times out.
831 - Added support for the following provers: Alt-Ergo (via Why3 and
832 TFF1), iProver, iProver-Eq.
833 - Sped up the minimizer.
834 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
835 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
836 - Renamed "sound" option to "strict".
838 * Metis: Added possibility to specify lambda translations scheme as a
839 parenthesized argument (e.g., "by (metis (lifting) ...)").
841 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
843 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
845 * New "case_product" attribute to generate a case rule doing multiple
846 case distinctions at the same time. E.g.
848 list.exhaust [case_product nat.exhaust]
850 produces a rule which can be used to perform case distinction on both
853 * New "eventually_elim" method as a generalized variant of the
854 eventually_elim* rules. Supports structured proofs.
856 * Typedef with implicit set definition is considered legacy. Use
857 "typedef (open)" form instead, which will eventually become the
860 * Record: code generation can be switched off manually with
862 declare [[record_coden = false]] -- "default true"
864 * Datatype: type parameters allow explicit sort constraints.
866 * Concrete syntax for case expressions includes constraints for source
867 positions, and thus produces Prover IDE markup for its bindings.
868 INCOMPATIBILITY for old-style syntax translations that augment the
869 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
872 * Clarified attribute "mono_set": pure declaration without modifying
873 the result of the fact expression.
875 * More default pred/set conversions on a couple of relation operations
876 and predicates. Added powers of predicate relations. Consolidation
877 of some relation theorems:
879 converse_def ~> converse_unfold
880 rel_comp_def ~> relcomp_unfold
881 symp_def ~> (modified, use symp_def and sym_def instead)
882 transp_def ~> transp_trans
883 Domain_def ~> Domain_unfold
884 Range_def ~> Domain_converse [symmetric]
886 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
888 See theory "Relation" for examples for making use of pred/set
889 conversions by means of attributes "to_set" and "to_pred".
893 * Renamed facts about the power operation on relations, i.e., relpow
894 to match the constant's name:
896 rel_pow_1 ~> relpow_1
897 rel_pow_0_I ~> relpow_0_I
898 rel_pow_Suc_I ~> relpow_Suc_I
899 rel_pow_Suc_I2 ~> relpow_Suc_I2
900 rel_pow_0_E ~> relpow_0_E
901 rel_pow_Suc_E ~> relpow_Suc_E
902 rel_pow_E ~> relpow_E
903 rel_pow_Suc_D2 ~> relpow_Suc_D2
904 rel_pow_Suc_E2 ~> relpow_Suc_E2
905 rel_pow_Suc_D2' ~> relpow_Suc_D2'
906 rel_pow_E2 ~> relpow_E2
907 rel_pow_add ~> relpow_add
908 rel_pow_commute ~> relpow
909 rel_pow_empty ~> relpow_empty:
910 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
911 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
912 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
913 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
914 rel_pow_fun_conv ~> relpow_fun_conv
915 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
916 rel_pow_finite_bounded ~> relpow_finite_bounded
917 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
918 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
919 single_valued_rel_pow ~> single_valued_relpow
923 * Theory Relation: Consolidated constant name for relation composition
924 and corresponding theorem names:
926 - Renamed constant rel_comp to relcomp.
928 - Dropped abbreviation pred_comp. Use relcompp instead.
932 rel_compI ~> relcompI
933 rel_compEpair ~> relcompEpair
934 rel_compE ~> relcompE
935 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
936 rel_comp_empty1 ~> relcomp_empty1
937 rel_comp_mono ~> relcomp_mono
938 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
939 rel_comp_distrib ~> relcomp_distrib
940 rel_comp_distrib2 ~> relcomp_distrib2
941 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
942 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
943 single_valued_rel_comp ~> single_valued_relcomp
944 rel_comp_def ~> relcomp_unfold
945 converse_rel_comp ~> converse_relcomp
946 pred_compI ~> relcomppI
947 pred_compE ~> relcomppE
948 pred_comp_bot1 ~> relcompp_bot1
949 pred_comp_bot2 ~> relcompp_bot2
950 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
951 pred_comp_mono ~> relcompp_mono
952 pred_comp_distrib ~> relcompp_distrib
953 pred_comp_distrib2 ~> relcompp_distrib2
954 converse_pred_comp ~> converse_relcompp
956 finite_rel_comp ~> finite_relcomp
958 set_rel_comp ~> set_relcomp
962 * Theory Divides: Discontinued redundant theorems about div and mod.
963 INCOMPATIBILITY, use the corresponding generic theorems instead.
965 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
966 zdiv_self ~> div_self
967 zmod_self ~> mod_self
970 zdiv_zmod_equality ~> div_mod_equality2
971 zdiv_zmod_equality2 ~> div_mod_equality
972 zmod_zdiv_trivial ~> mod_div_trivial
973 zdiv_zminus_zminus ~> div_minus_minus
974 zmod_zminus_zminus ~> mod_minus_minus
975 zdiv_zminus2 ~> div_minus_right
976 zmod_zminus2 ~> mod_minus_right
977 zdiv_minus1_right ~> div_minus1_right
978 zmod_minus1_right ~> mod_minus1_right
979 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
980 zmod_zmult1_eq ~> mod_mult_right_eq
981 zpower_zmod ~> power_mod
983 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
984 mod_mult_distrib ~> mult_mod_left
985 mod_mult_distrib2 ~> mult_mod_right
987 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
988 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
990 * Finite_Set.fold now qualified. INCOMPATIBILITY.
992 * Consolidated theorem names concerning fold combinators:
994 inf_INFI_fold_inf ~> inf_INF_fold_inf
995 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
996 INFI_fold_inf ~> INF_fold_inf
997 SUPR_fold_sup ~> SUP_fold_sup
998 union_set ~> union_set_fold
999 minus_set ~> minus_set_fold
1000 INFI_set_fold ~> INF_set_fold
1001 SUPR_set_fold ~> SUP_set_fold
1002 INF_code ~> INF_set_foldr
1003 SUP_code ~> SUP_set_foldr
1004 foldr.simps ~> foldr.simps (in point-free formulation)
1005 foldr_fold_rev ~> foldr_conv_fold
1006 foldl_fold ~> foldl_conv_fold
1007 foldr_foldr ~> foldr_conv_foldl
1008 foldl_foldr ~> foldl_conv_foldr
1009 fold_set_remdups ~> fold_set_fold_remdups
1010 fold_set ~> fold_set_fold
1011 fold1_set ~> fold1_set_fold
1015 * Dropped rarely useful theorems concerning fold combinators:
1016 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1017 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1018 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1019 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1020 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1021 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1022 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1023 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1024 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1025 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1027 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1028 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1029 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1030 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1031 lemmas over fold rather than foldr, or make use of lemmas
1032 fold_conv_foldr and fold_rev.
1034 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1035 through option types.
1037 * "Transitive_Closure.ntrancl": bounded transitive closure on
1040 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1042 * Theory Int: Discontinued many legacy theorems specific to type int.
1043 INCOMPATIBILITY, use the corresponding generic theorems instead.
1045 zminus_zminus ~> minus_minus
1046 zminus_0 ~> minus_zero
1047 zminus_zadd_distrib ~> minus_add_distrib
1048 zadd_commute ~> add_commute
1049 zadd_assoc ~> add_assoc
1050 zadd_left_commute ~> add_left_commute
1053 zadd_0 ~> add_0_left
1054 zadd_0_right ~> add_0_right
1055 zadd_zminus_inverse2 ~> left_minus
1056 zmult_zminus ~> mult_minus_left
1057 zmult_commute ~> mult_commute
1058 zmult_assoc ~> mult_assoc
1059 zadd_zmult_distrib ~> left_distrib
1060 zadd_zmult_distrib2 ~> right_distrib
1061 zdiff_zmult_distrib ~> left_diff_distrib
1062 zdiff_zmult_distrib2 ~> right_diff_distrib
1063 zmult_1 ~> mult_1_left
1064 zmult_1_right ~> mult_1_right
1065 zle_refl ~> order_refl
1066 zle_trans ~> order_trans
1067 zle_antisym ~> order_antisym
1068 zle_linear ~> linorder_linear
1069 zless_linear ~> linorder_less_linear
1070 zadd_left_mono ~> add_left_mono
1071 zadd_strict_right_mono ~> add_strict_right_mono
1072 zadd_zless_mono ~> add_less_le_mono
1073 int_0_less_1 ~> zero_less_one
1074 int_0_neq_1 ~> zero_neq_one
1076 zpower_zadd_distrib ~> power_add
1077 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1078 zero_le_zpower_abs ~> zero_le_power_abs
1080 * Theory Deriv: Renamed
1082 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1084 * Theory Library/Multiset: Improved code generation of multisets.
1086 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1087 are expressed via type classes again. The special syntax
1088 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1089 setsum_set, which is now subsumed by Big_Operators.setsum.
1092 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1093 use theory HOL/Library/Nat_Bijection instead.
1095 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1096 trees is now inside a type class context. Names of affected
1097 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1098 theories working directly with raw red-black trees, adapt the names as
1102 bulkload -> rbt_bulkload
1103 del_from_left -> rbt_del_from_left
1104 del_from_right -> rbt_del_from_right
1106 delete -> rbt_delete
1108 insert -> rbt_insert
1109 insertw -> rbt_insert_with
1110 insert_with_key -> rbt_insert_with_key
1111 map_entry -> rbt_map_entry
1112 lookup -> rbt_lookup
1113 sorted -> rbt_sorted
1114 tree_greater -> rbt_greater
1115 tree_less -> rbt_less
1116 tree_less_symbol -> rbt_less_symbol
1118 union_with -> rbt_union_with
1119 union_with_key -> rbt_union_with_key
1122 balance_left_sorted -> balance_left_rbt_sorted
1123 balance_left_tree_greater -> balance_left_rbt_greater
1124 balance_left_tree_less -> balance_left_rbt_less
1125 balance_right_sorted -> balance_right_rbt_sorted
1126 balance_right_tree_greater -> balance_right_rbt_greater
1127 balance_right_tree_less -> balance_right_rbt_less
1128 balance_sorted -> balance_rbt_sorted
1129 balance_tree_greater -> balance_rbt_greater
1130 balance_tree_less -> balance_rbt_less
1131 bulkload_is_rbt -> rbt_bulkload_is_rbt
1132 combine_sorted -> combine_rbt_sorted
1133 combine_tree_greater -> combine_rbt_greater
1134 combine_tree_less -> combine_rbt_less
1135 delete_in_tree -> rbt_delete_in_tree
1136 delete_is_rbt -> rbt_delete_is_rbt
1137 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1138 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1139 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1140 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1141 del_in_tree -> rbt_del_in_tree
1142 del_inv1_inv2 -> rbt_del_inv1_inv2
1143 del_sorted -> rbt_del_rbt_sorted
1144 del_tree_greater -> rbt_del_rbt_greater
1145 del_tree_less -> rbt_del_rbt_less
1146 dom_lookup_Branch -> dom_rbt_lookup_Branch
1147 entries_lookup -> entries_rbt_lookup
1148 finite_dom_lookup -> finite_dom_rbt_lookup
1149 insert_sorted -> rbt_insert_rbt_sorted
1150 insertw_is_rbt -> rbt_insertw_is_rbt
1151 insertwk_is_rbt -> rbt_insertwk_is_rbt
1152 insertwk_sorted -> rbt_insertwk_rbt_sorted
1153 insertw_sorted -> rbt_insertw_rbt_sorted
1154 ins_sorted -> ins_rbt_sorted
1155 ins_tree_greater -> ins_rbt_greater
1156 ins_tree_less -> ins_rbt_less
1157 is_rbt_sorted -> is_rbt_rbt_sorted
1158 lookup_balance -> rbt_lookup_balance
1159 lookup_bulkload -> rbt_lookup_rbt_bulkload
1160 lookup_delete -> rbt_lookup_rbt_delete
1161 lookup_Empty -> rbt_lookup_Empty
1162 lookup_from_in_tree -> rbt_lookup_from_in_tree
1163 lookup_in_tree -> rbt_lookup_in_tree
1164 lookup_ins -> rbt_lookup_ins
1165 lookup_insert -> rbt_lookup_rbt_insert
1166 lookup_insertw -> rbt_lookup_rbt_insertw
1167 lookup_insertwk -> rbt_lookup_rbt_insertwk
1168 lookup_keys -> rbt_lookup_keys
1169 lookup_map -> rbt_lookup_map
1170 lookup_map_entry -> rbt_lookup_rbt_map_entry
1171 lookup_tree_greater -> rbt_lookup_rbt_greater
1172 lookup_tree_less -> rbt_lookup_rbt_less
1173 lookup_union -> rbt_lookup_rbt_union
1174 map_entry_color_of -> rbt_map_entry_color_of
1175 map_entry_inv1 -> rbt_map_entry_inv1
1176 map_entry_inv2 -> rbt_map_entry_inv2
1177 map_entry_is_rbt -> rbt_map_entry_is_rbt
1178 map_entry_sorted -> rbt_map_entry_rbt_sorted
1179 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1180 map_entry_tree_less -> rbt_map_entry_rbt_less
1181 map_tree_greater -> map_rbt_greater
1182 map_tree_less -> map_rbt_less
1183 map_sorted -> map_rbt_sorted
1184 paint_sorted -> paint_rbt_sorted
1185 paint_lookup -> paint_rbt_lookup
1186 paint_tree_greater -> paint_rbt_greater
1187 paint_tree_less -> paint_rbt_less
1188 sorted_entries -> rbt_sorted_entries
1189 tree_greater_eq_trans -> rbt_greater_eq_trans
1190 tree_greater_nit -> rbt_greater_nit
1191 tree_greater_prop -> rbt_greater_prop
1192 tree_greater_simps -> rbt_greater_simps
1193 tree_greater_trans -> rbt_greater_trans
1194 tree_less_eq_trans -> rbt_less_eq_trans
1195 tree_less_nit -> rbt_less_nit
1196 tree_less_prop -> rbt_less_prop
1197 tree_less_simps -> rbt_less_simps
1198 tree_less_trans -> rbt_less_trans
1199 tree_ord_props -> rbt_ord_props
1200 union_Branch -> rbt_union_Branch
1201 union_is_rbt -> rbt_union_is_rbt
1202 unionw_is_rbt -> rbt_unionw_is_rbt
1203 unionwk_is_rbt -> rbt_unionwk_is_rbt
1204 unionwk_sorted -> rbt_unionwk_rbt_sorted
1206 * Theory HOL/Library/Float: Floating point numbers are now defined as
1207 a subset of the real numbers. All operations are defined using the
1208 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1215 round_down -> float_round_down
1216 round_up -> float_round_up
1220 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1223 abs_float_def -> Float.compute_float_abs
1224 bitlen_ge0 -> bitlen_nonneg
1225 bitlen.simps -> Float.compute_bitlen
1226 float_components -> Float_mantissa_exponent
1227 float_divl.simps -> Float.compute_float_divl
1228 float_divr.simps -> Float.compute_float_divr
1229 float_eq_odd -> mult_powr_eq_mult_powr_iff
1230 float_power -> real_of_float_power
1231 lapprox_posrat_def -> Float.compute_lapprox_posrat
1232 lapprox_rat.simps -> Float.compute_lapprox_rat
1233 le_float_def' -> Float.compute_float_le
1234 le_float_def -> less_eq_float.rep_eq
1235 less_float_def' -> Float.compute_float_less
1236 less_float_def -> less_float.rep_eq
1237 normfloat_def -> Float.compute_normfloat
1238 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1239 normfloat -> normfloat_def
1240 normfloat_unique -> use normfloat_def
1241 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1242 one_float_def -> Float.compute_float_one
1243 plus_float_def -> Float.compute_float_plus
1244 rapprox_posrat_def -> Float.compute_rapprox_posrat
1245 rapprox_rat.simps -> Float.compute_rapprox_rat
1246 real_of_float_0 -> zero_float.rep_eq
1247 real_of_float_1 -> one_float.rep_eq
1248 real_of_float_abs -> abs_float.rep_eq
1249 real_of_float_add -> plus_float.rep_eq
1250 real_of_float_minus -> uminus_float.rep_eq
1251 real_of_float_mult -> times_float.rep_eq
1252 real_of_float_simp -> Float.rep_eq
1253 real_of_float_sub -> minus_float.rep_eq
1254 round_down.simps -> Float.compute_float_round_down
1255 round_up.simps -> Float.compute_float_round_up
1256 times_float_def -> Float.compute_float_times
1257 uminus_float_def -> Float.compute_float_uminus
1258 zero_float_def -> Float.compute_float_zero
1260 Lemmas not necessary anymore, use the transfer method:
1261 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1262 float_divr, float_le_simp, float_less1_mantissa_bound,
1263 float_less_simp, float_less_zero, float_le_zero,
1264 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1265 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1266 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1267 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1268 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1269 round_up, zero_le_float, zero_less_float
1271 * New theory HOL/Library/DAList provides an abstract type for
1272 association lists with distinct keys.
1274 * Session HOL/IMP: Added new theory of abstract interpretation of
1277 * Session HOL-Import: Re-implementation from scratch is faster,
1278 simpler, and more scalable. Requires a proof bundle, which is
1279 available as an external component. Discontinued old (and mostly
1280 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1282 * Session HOL-Word: Discontinued many redundant theorems specific to
1283 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1286 word_sub_alt ~> word_sub_wi
1287 word_add_alt ~> word_add_def
1288 word_mult_alt ~> word_mult_def
1289 word_minus_alt ~> word_minus_def
1290 word_0_alt ~> word_0_wi
1291 word_1_alt ~> word_1_wi
1292 word_add_0 ~> add_0_left
1293 word_add_0_right ~> add_0_right
1294 word_mult_1 ~> mult_1_left
1295 word_mult_1_right ~> mult_1_right
1296 word_add_commute ~> add_commute
1297 word_add_assoc ~> add_assoc
1298 word_add_left_commute ~> add_left_commute
1299 word_mult_commute ~> mult_commute
1300 word_mult_assoc ~> mult_assoc
1301 word_mult_left_commute ~> mult_left_commute
1302 word_left_distrib ~> left_distrib
1303 word_right_distrib ~> right_distrib
1304 word_left_minus ~> left_minus
1305 word_diff_0_right ~> diff_0_right
1306 word_diff_self ~> diff_self
1307 word_sub_def ~> diff_minus
1308 word_diff_minus ~> diff_minus
1309 word_add_ac ~> add_ac
1310 word_mult_ac ~> mult_ac
1311 word_plus_ac0 ~> add_0_left add_0_right add_ac
1312 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1313 word_order_trans ~> order_trans
1314 word_order_refl ~> order_refl
1315 word_order_antisym ~> order_antisym
1316 word_order_linear ~> linorder_linear
1317 lenw1_zero_neq_one ~> zero_neq_one
1318 word_number_of_eq ~> number_of_eq
1319 word_of_int_add_hom ~> wi_hom_add
1320 word_of_int_sub_hom ~> wi_hom_sub
1321 word_of_int_mult_hom ~> wi_hom_mult
1322 word_of_int_minus_hom ~> wi_hom_neg
1323 word_of_int_succ_hom ~> wi_hom_succ
1324 word_of_int_pred_hom ~> wi_hom_pred
1325 word_of_int_0_hom ~> word_0_wi
1326 word_of_int_1_hom ~> word_1_wi
1328 * Session HOL-Word: New proof method "word_bitwise" for splitting
1329 machine word equalities and inequalities into logical circuits,
1330 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1331 multiplication, shifting by constants, bitwise operators and numeric
1332 constants. Requires fixed-length word types, not 'a word. Solves
1333 many standard word identities outright and converts more into first
1334 order problems amenable to blast or similar. See also examples in
1335 HOL/Word/Examples/WordExamples.thy.
1337 * Session HOL-Probability: Introduced the type "'a measure" to
1338 represent measures, this replaces the records 'a algebra and 'a
1339 measure_space. The locales based on subset_class now have two
1340 locale-parameters the space \<Omega> and the set of measurable sets M.
1341 The product of probability spaces uses now the same constant as the
1342 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1343 measure". Most constants are defined now outside of locales and gain
1344 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1345 Measure space constructions for distributions and densities now got
1346 their own constants distr and density. Instead of using locales to
1347 describe measure spaces with a finite space, the measure count_space
1348 and point_measure is introduced. INCOMPATIBILITY.
1352 finite_measure.\<mu>' -> measure
1353 product_algebra_generator -> prod_algebra
1354 product_prob_space.emb -> prod_emb
1355 product_prob_space.infprod_algebra -> PiM
1358 completeable_measure_space
1359 finite_measure_space
1361 finite_product_finite_prob_space
1362 finite_product_sigma_algebra
1363 finite_sigma_algebra
1365 pair_finite_prob_space
1366 pair_finite_sigma_algebra
1369 product_sigma_algebra
1373 distribution -> use distr measure, or distributed predicate
1375 joint_distribution -> use distr measure, or distributed predicate
1376 pair_measure_generator
1377 product_prob_space.infprod_algebra -> use PiM
1380 Replacement theorems:
1381 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1382 finite_measure.empty_measure -> measure_empty
1383 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1384 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1385 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1386 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1387 finite_measure.finite_measure -> finite_measure.emeasure_finite
1388 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1389 finite_measure.positive_measure' -> measure_nonneg
1390 finite_measure.real_measure -> finite_measure.emeasure_real
1391 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1392 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1393 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1394 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1395 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1396 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1397 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1398 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1399 information_space.entropy_commute -> information_space.entropy_commute_simple
1400 information_space.entropy_eq -> information_space.entropy_simple_distributed
1401 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1402 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1403 information_space.entropy_uniform_max -> information_space.entropy_uniform
1404 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1405 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1406 information_space.KL_ge_0 -> information_space.KL_nonneg
1407 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1408 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1409 Int_stable_cuboids -> Int_stable_atLeastAtMost
1410 Int_stable_product_algebra_generator -> positive_integral
1411 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1412 measure_space.additive -> emeasure_additive
1413 measure_space.AE_iff_null_set -> AE_iff_null
1414 measure_space.almost_everywhere_def -> eventually_ae_filter
1415 measure_space.almost_everywhere_vimage -> AE_distrD
1416 measure_space.continuity_from_above -> INF_emeasure_decseq
1417 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1418 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1419 measure_space.continuity_from_below -> SUP_emeasure_incseq
1420 measure_space_density -> emeasure_density
1421 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1422 measure_space.integrable_vimage -> integrable_distr
1423 measure_space.integral_translated_density -> integral_density
1424 measure_space.integral_vimage -> integral_distr
1425 measure_space.measure_additive -> plus_emeasure
1426 measure_space.measure_compl -> emeasure_compl
1427 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1428 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1429 measure_space.measure_decseq -> decseq_emeasure
1430 measure_space.measure_Diff -> emeasure_Diff
1431 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1432 measure_space.measure_eq_0 -> emeasure_eq_0
1433 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1434 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1435 measure_space.measure_incseq -> incseq_emeasure
1436 measure_space.measure_insert -> emeasure_insert
1437 measure_space.measure_mono -> emeasure_mono
1438 measure_space.measure_not_negative -> emeasure_not_MInf
1439 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1440 measure_space.measure_setsum -> setsum_emeasure
1441 measure_space.measure_setsum_split -> setsum_emeasure_cover
1442 measure_space.measure_space_vimage -> emeasure_distr
1443 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1444 measure_space.measure_subadditive -> subadditive
1445 measure_space.measure_top -> emeasure_space
1446 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1447 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1448 measure_space.positive_integral_translated_density -> positive_integral_density
1449 measure_space.positive_integral_vimage -> positive_integral_distr
1450 measure_space.real_continuity_from_above -> Lim_measure_decseq
1451 measure_space.real_continuity_from_below -> Lim_measure_incseq
1452 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1453 measure_space.real_measure_Diff -> measure_Diff
1454 measure_space.real_measure_finite_Union -> measure_finite_Union
1455 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1456 measure_space.real_measure_subadditive -> measure_subadditive
1457 measure_space.real_measure_Union -> measure_Union
1458 measure_space.real_measure_UNION -> measure_UNION
1459 measure_space.simple_function_vimage -> simple_function_comp
1460 measure_space.simple_integral_vimage -> simple_integral_distr
1461 measure_space.simple_integral_vimage -> simple_integral_distr
1462 measure_unique_Int_stable -> measure_eqI_generator_eq
1463 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1464 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1465 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1466 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1467 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1468 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1469 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1470 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1471 pair_sigma_algebra.sets_swap -> sets_pair_swap
1472 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1473 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1474 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1475 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1476 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1477 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1478 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1479 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1480 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1481 prob_space.prob_space_vimage -> prob_space_distr
1482 prob_space.random_variable_restrict -> measurable_restrict
1483 prob_space_unique_Int_stable -> measure_eqI_prob_space
1484 product_algebraE -> prod_algebraE_all
1485 product_algebra_generator_der -> prod_algebra_eq_finite
1486 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1487 product_algebraI -> sets_PiM_I_finite
1488 product_measure_exists -> product_sigma_finite.sigma_finite
1489 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1490 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1491 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1492 product_prob_space.measurable_component -> measurable_component_singleton
1493 product_prob_space.measurable_emb -> measurable_prod_emb
1494 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1495 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1496 product_prob_space.measure_emb -> emeasure_prod_emb
1497 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1498 product_sigma_algebra.product_algebra_into_space -> space_closed
1499 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1500 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1501 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1502 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1503 sets_product_algebra -> sets_PiM
1504 sigma_algebra.measurable_sigma -> measurable_measure_of
1505 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1506 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1507 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1508 space_product_algebra -> space_PiM
1510 * Session HOL-TPTP: support to parse and import TPTP problems (all
1511 languages) into Isabelle/HOL.
1516 * New "case_product" attribute (see HOL).
1521 * Greater support for structured proofs involving induction or case
1524 * Much greater use of mathematical symbols.
1526 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1531 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1532 from a minor keyword introduced via theory header declaration.
1534 * Antiquotation @{command_spec "name"} produces the
1535 Outer_Syntax.command_spec from a major keyword introduced via theory
1536 header declaration; it can be passed to Outer_Syntax.command etc.
1538 * Local_Theory.define no longer hard-wires default theorem name
1539 "foo_def", but retains the binding as given. If that is Binding.empty
1540 / Attrib.empty_binding, the result is not registered as user-level
1541 fact. The Local_Theory.define_internal variant allows to specify a
1542 non-empty name (used for the foundation in the background theory),
1543 while omitting the fact binding in the user-context. Potential
1544 INCOMPATIBILITY for derived definitional packages: need to specify
1545 naming policy for primitive definitions more explicitly.
1547 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1548 conformance with similar operations in structure Term and Logic.
1550 * Antiquotation @{attributes [...]} embeds attribute source
1551 representation into the ML text, which is particularly useful with
1552 declarations like Local_Theory.note.
1554 * Structure Proof_Context follows standard naming scheme. Old
1555 ProofContext has been discontinued. INCOMPATIBILITY.
1557 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1558 change of semantics: update is applied to auxiliary local theory
1561 * Modernized some old-style infix operations:
1563 addeqcongs ~> Simplifier.add_eqcong
1564 deleqcongs ~> Simplifier.del_eqcong
1565 addcongs ~> Simplifier.add_cong
1566 delcongs ~> Simplifier.del_cong
1567 setmksimps ~> Simplifier.set_mksimps
1568 setmkcong ~> Simplifier.set_mkcong
1569 setmksym ~> Simplifier.set_mksym
1570 setmkeqTrue ~> Simplifier.set_mkeqTrue
1571 settermless ~> Simplifier.set_termless
1572 setsubgoaler ~> Simplifier.set_subgoaler
1573 addsplits ~> Splitter.add_split
1574 delsplits ~> Splitter.del_split
1579 * USER_HOME settings variable points to cross-platform user home
1580 directory, which coincides with HOME on POSIX systems only. Likewise,
1581 the Isabelle path specification "~" now expands to $USER_HOME, instead
1582 of former $HOME. A different default for USER_HOME may be set
1583 explicitly in shell environment, before Isabelle settings are
1584 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1585 the generic user home was intended.
1587 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1588 notation, which is useful for the jEdit file browser, for example.
1590 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1595 New in Isabelle2011-1 (October 2011)
1596 ------------------------------------
1600 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1601 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1603 - Management of multiple theory files directly from the editor
1604 buffer store -- bypassing the file-system (no requirement to save
1605 files for checking).
1607 - Markup of formal entities within the text buffer, with semantic
1608 highlighting, tooltips and hyperlinks to jump to defining source
1611 - Improved text rendering, with sub/superscripts in the source
1612 buffer (including support for copy/paste wrt. output panel, HTML
1613 theory output and other non-Isabelle text boxes).
1615 - Refined scheduling of proof checking and printing of results,
1616 based on interactive editor view. (Note: jEdit folding and
1617 narrowing allows to restrict buffer perspectives explicitly.)
1619 - Reduced CPU performance requirements, usable on machines with few
1622 - Reduced memory requirements due to pruning of unused document
1623 versions (garbage collection).
1625 See also ~~/src/Tools/jEdit/README.html for further information,
1626 including some remaining limitations.
1628 * Theory loader: source files are exclusively located via the master
1629 directory of each theory node (where the .thy file itself resides).
1630 The global load path (such as src/HOL/Library) has been discontinued.
1631 Note that the path element ~~ may be used to reference theories in the
1632 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1635 * Theory loader: source files are identified by content via SHA1
1636 digests. Discontinued former path/modtime identification and optional
1637 ISABELLE_FILE_IDENT plugin scripts.
1639 * Parallelization of nested Isar proofs is subject to
1640 Goal.parallel_proofs_threshold (default 100). See also isabelle
1643 * Name space: former unsynchronized references are now proper
1644 configuration options, with more conventional names:
1646 long_names ~> names_long
1647 short_names ~> names_short
1648 unique_names ~> names_unique
1650 Minor INCOMPATIBILITY, need to declare options in context like this:
1652 declare [[names_unique = false]]
1654 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1655 that the result needs to be unique, which means fact specifications
1656 may have to be refined after enriching a proof context.
1658 * Attribute "case_names" has been refined: the assumptions in each case
1659 can be named now by following the case name with [name1 name2 ...].
1661 * Isabelle/Isar reference manual has been updated and extended:
1662 - "Synopsis" provides a catalog of main Isar language concepts.
1663 - Formal references in syntax diagrams, via @{rail} antiquotation.
1664 - Updated material from classic "ref" manual, notably about
1665 "Classical Reasoner".
1670 * Class bot and top require underlying partial order rather than
1671 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1673 * Class complete_lattice: generalized a couple of lemmas from sets;
1674 generalized theorems INF_cong and SUP_cong. New type classes for
1675 complete boolean algebras and complete linear orders. Lemmas
1676 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1677 class complete_linorder.
1679 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1680 Sup_fun_def, Inf_apply, Sup_apply.
1682 Removed redundant lemmas (the right hand side gives hints how to
1683 replace them for (metis ...), or (simp only: ...) proofs):
1685 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1686 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1687 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1688 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1689 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1690 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1691 Inter_def ~> INF_def, image_def
1692 Union_def ~> SUP_def, image_def
1693 INT_eq ~> INF_def, and image_def
1694 UN_eq ~> SUP_def, and image_def
1695 INF_subset ~> INF_superset_mono [OF _ order_refl]
1697 More consistent and comprehensive names:
1699 INTER_eq_Inter_image ~> INF_def
1700 UNION_eq_Union_image ~> SUP_def
1703 INF_leI ~> INF_lower
1704 INF_leI2 ~> INF_lower2
1705 le_INFI ~> INF_greatest
1706 le_SUPI ~> SUP_upper
1707 le_SUPI2 ~> SUP_upper2
1708 SUP_leI ~> SUP_least
1709 INFI_bool_eq ~> INF_bool_eq
1710 SUPR_bool_eq ~> SUP_bool_eq
1711 INFI_apply ~> INF_apply
1712 SUPR_apply ~> SUP_apply
1713 INTER_def ~> INTER_eq
1714 UNION_def ~> UNION_eq
1718 * Renamed theory Complete_Lattice to Complete_Lattices.
1721 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1722 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1723 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1724 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1726 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1727 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1728 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1731 * Added syntactic classes "inf" and "sup" for the respective
1732 constants. INCOMPATIBILITY: Changes in the argument order of the
1733 (mostly internal) locale predicates for some derived classes.
1735 * Theorem collections ball_simps and bex_simps do not contain theorems
1736 referring to UNION any longer; these have been moved to collection
1737 UN_ball_bex_simps. INCOMPATIBILITY.
1739 * Theory Archimedean_Field: floor now is defined as parameter of a
1740 separate type class floor_ceiling.
1742 * Theory Finite_Set: more coherent development of fold_set locales:
1744 locale fun_left_comm ~> locale comp_fun_commute
1745 locale fun_left_comm_idem ~> locale comp_fun_idem
1747 Both use point-free characterization; interpretation proofs may need
1748 adjustment. INCOMPATIBILITY.
1750 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1751 accordance with standard mathematical terminology. INCOMPATIBILITY.
1753 * Theory Complex_Main: The locale interpretations for the
1754 bounded_linear and bounded_bilinear locales have been removed, in
1755 order to reduce the number of duplicate lemmas. Users must use the
1756 original names for distributivity theorems, potential INCOMPATIBILITY.
1758 divide.add ~> add_divide_distrib
1759 divide.diff ~> diff_divide_distrib
1760 divide.setsum ~> setsum_divide_distrib
1761 mult.add_right ~> right_distrib
1762 mult.diff_right ~> right_diff_distrib
1763 mult_right.setsum ~> setsum_right_distrib
1764 mult_left.diff ~> left_diff_distrib
1766 * Theory Complex_Main: Several redundant theorems have been removed or
1767 replaced by more general versions. INCOMPATIBILITY.
1769 real_diff_def ~> minus_real_def
1770 real_divide_def ~> divide_real_def
1771 real_less_def ~> less_le
1772 real_abs_def ~> abs_real_def
1773 real_sgn_def ~> sgn_real_def
1774 real_mult_commute ~> mult_commute
1775 real_mult_assoc ~> mult_assoc
1776 real_mult_1 ~> mult_1_left
1777 real_add_mult_distrib ~> left_distrib
1778 real_zero_not_eq_one ~> zero_neq_one
1779 real_mult_inverse_left ~> left_inverse
1780 INVERSE_ZERO ~> inverse_zero
1781 real_le_refl ~> order_refl
1782 real_le_antisym ~> order_antisym
1783 real_le_trans ~> order_trans
1784 real_le_linear ~> linear
1785 real_le_eq_diff ~> le_iff_diff_le_0
1786 real_add_left_mono ~> add_left_mono
1787 real_mult_order ~> mult_pos_pos
1788 real_mult_less_mono2 ~> mult_strict_left_mono
1789 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1790 real_0_le_divide_iff ~> zero_le_divide_iff
1791 realpow_two_disj ~> power2_eq_iff
1792 real_squared_diff_one_factored ~> square_diff_one_factored
1793 realpow_two_diff ~> square_diff_square_factored
1794 reals_complete2 ~> complete_real
1795 real_sum_squared_expand ~> power2_sum
1796 exp_ln_eq ~> ln_unique
1798 expi_zero ~> exp_zero
1799 lemma_DERIV_subst ~> DERIV_cong
1800 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1801 LIMSEQ_const ~> tendsto_const
1802 LIMSEQ_norm ~> tendsto_norm
1803 LIMSEQ_add ~> tendsto_add
1804 LIMSEQ_minus ~> tendsto_minus
1805 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1806 LIMSEQ_diff ~> tendsto_diff
1807 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1808 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1809 LIMSEQ_mult ~> tendsto_mult
1810 LIMSEQ_inverse ~> tendsto_inverse
1811 LIMSEQ_divide ~> tendsto_divide
1812 LIMSEQ_pow ~> tendsto_power
1813 LIMSEQ_setsum ~> tendsto_setsum
1814 LIMSEQ_setprod ~> tendsto_setprod
1815 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1816 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1817 LIMSEQ_imp_rabs ~> tendsto_rabs
1818 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1819 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1820 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1821 LIMSEQ_Complex ~> tendsto_Complex
1822 LIM_ident ~> tendsto_ident_at
1823 LIM_const ~> tendsto_const
1824 LIM_add ~> tendsto_add
1825 LIM_add_zero ~> tendsto_add_zero
1826 LIM_minus ~> tendsto_minus
1827 LIM_diff ~> tendsto_diff
1828 LIM_norm ~> tendsto_norm
1829 LIM_norm_zero ~> tendsto_norm_zero
1830 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1831 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1832 LIM_rabs ~> tendsto_rabs
1833 LIM_rabs_zero ~> tendsto_rabs_zero
1834 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1835 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1836 LIM_compose ~> tendsto_compose
1837 LIM_mult ~> tendsto_mult
1838 LIM_scaleR ~> tendsto_scaleR
1839 LIM_of_real ~> tendsto_of_real
1840 LIM_power ~> tendsto_power
1841 LIM_inverse ~> tendsto_inverse
1842 LIM_sgn ~> tendsto_sgn
1843 isCont_LIM_compose ~> isCont_tendsto_compose
1844 bounded_linear.LIM ~> bounded_linear.tendsto
1845 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1846 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1847 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1848 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1849 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1850 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1852 * Theory Complex_Main: The definition of infinite series was
1853 generalized. Now it is defined on the type class {topological_space,
1854 comm_monoid_add}. Hence it is useable also for extended real numbers.
1856 * Theory Complex_Main: The complex exponential function "expi" is now
1857 a type-constrained abbreviation for "exp :: complex => complex"; thus
1858 several polymorphic lemmas about "exp" are now applicable to "expi".
1862 - Theory Library/Code_Char_ord provides native ordering of
1863 characters in the target language.
1865 - Commands code_module and code_library are legacy, use export_code
1868 - Method "evaluation" is legacy, use method "eval" instead.
1870 - Legacy evaluator "SML" is deactivated by default. May be
1871 reactivated by the following theory command:
1873 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1875 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1877 * New proof method "induction" that gives induction hypotheses the
1878 name "IH", thus distinguishing them from further hypotheses that come
1879 from rule induction. The latter are still called "hyps". Method
1880 "induction" is a thin wrapper around "induct" and follows the same
1883 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1884 still available as a legacy feature for some time.
1887 - Added "need" and "total_consts" options.
1888 - Reintroduced "show_skolems" option by popular demand.
1889 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1893 - Use quasi-sound (and efficient) translations by default.
1894 - Added support for the following provers: E-ToFoF, LEO-II,
1895 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1896 - Automatically preplay and minimize proofs before showing them if
1897 this can be done within reasonable time.
1898 - sledgehammer available_provers ~> sledgehammer supported_provers.
1900 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1901 "max_mono_iters", and "max_new_mono_instances" options.
1902 - Removed "explicit_apply" and "full_types" options as well as "Full
1903 Types" Proof General menu item. INCOMPATIBILITY.
1906 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1907 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1911 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1912 "elim:" options. INCOMPATIBILITY.
1913 - Introduced 'try' that not only runs 'try_methods' but also
1914 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1917 - Added "eval" option to evaluate terms for the found counterexample
1918 (currently only supported by the default (exhaustive) tester).
1919 - Added post-processing of terms to obtain readable counterexamples
1920 (currently only supported by the default (exhaustive) tester).
1921 - New counterexample generator quickcheck[narrowing] enables
1922 narrowing-based testing. Requires the Glasgow Haskell compiler
1923 with its installation location defined in the Isabelle settings
1924 environment as ISABELLE_GHC.
1925 - Removed quickcheck tester "SML" based on the SML code generator
1926 (formly in HOL/Library).
1928 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1929 use 'partial_function' instead.
1931 * Theory Library/Extended_Reals replaces now the positive extended
1932 reals found in probability theory. This file is extended by
1933 Multivariate_Analysis/Extended_Real_Limits.
1935 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1936 from where it must be imported explicitly if it is really required.
1939 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1940 been moved here. INCOMPATIBILITY.
1942 * Theory Library/Saturated provides type of numbers with saturated
1945 * Theory Library/Product_Lattice defines a pointwise ordering for the
1946 product type 'a * 'b, and provides instance proofs for various order
1947 and lattice type classes.
1949 * Theory Library/Countable now provides the "countable_datatype" proof
1950 method for proving "countable" class instances for datatypes.
1952 * Theory Library/Cset_Monad allows do notation for computable sets
1953 (cset) via the generic monad ad-hoc overloading facility.
1955 * Library: Theories of common data structures are split into theories
1956 for implementation, an invariant-ensuring type, and connection to an
1957 abstract type. INCOMPATIBILITY.
1959 - RBT is split into RBT and RBT_Mapping.
1960 - AssocList is split and renamed into AList and AList_Mapping.
1961 - DList is split into DList_Impl, DList, and DList_Cset.
1962 - Cset is split into Cset and List_Cset.
1964 * Theory Library/Nat_Infinity has been renamed to
1965 Library/Extended_Nat, with name changes of the following types and
1968 type inat ~> type enat
1970 Infty ~> infinity (overloaded)
1974 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1975 been renamed accordingly. INCOMPATIBILITY.
1977 * Session Multivariate_Analysis: The euclidean_space type class now
1978 fixes a constant "Basis :: 'a set" consisting of the standard
1979 orthonormal basis for the type. Users now have the option of
1980 quantifying over this set instead of using the "basis" function, e.g.
1981 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1983 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1984 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1985 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1986 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1987 changed to match. Definition theorems for overloaded constants now use
1988 the standard "foo_vec_def" naming scheme. A few other theorems have
1989 been renamed as follows (INCOMPATIBILITY):
1991 Cart_eq ~> vec_eq_iff
1992 dist_nth_le_cart ~> dist_vec_nth_le
1993 tendsto_vector ~> vec_tendstoI
1994 Cauchy_vector ~> vec_CauchyI
1996 * Session Multivariate_Analysis: Several duplicate theorems have been
1997 removed, and other theorems have been renamed or replaced with more
1998 general versions. INCOMPATIBILITY.
2000 finite_choice ~> finite_set_choice
2001 eventually_conjI ~> eventually_conj
2002 eventually_and ~> eventually_conj_iff
2003 eventually_false ~> eventually_False
2004 setsum_norm ~> norm_setsum
2005 Lim_sequentially ~> LIMSEQ_def
2006 Lim_ident_at ~> LIM_ident
2007 Lim_const ~> tendsto_const
2008 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2009 Lim_neg ~> tendsto_minus
2010 Lim_add ~> tendsto_add
2011 Lim_sub ~> tendsto_diff
2012 Lim_mul ~> tendsto_scaleR
2013 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2014 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2015 Lim_linear ~> bounded_linear.tendsto
2016 Lim_component ~> tendsto_euclidean_component
2017 Lim_component_cart ~> tendsto_vec_nth
2018 Lim_inner ~> tendsto_inner [OF tendsto_const]
2019 dot_lsum ~> inner_setsum_left
2020 dot_rsum ~> inner_setsum_right
2021 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2022 continuous_neg ~> continuous_minus
2023 continuous_sub ~> continuous_diff
2024 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2025 continuous_mul ~> continuous_scaleR
2026 continuous_inv ~> continuous_inverse
2027 continuous_at_within_inv ~> continuous_at_within_inverse
2028 continuous_at_inv ~> continuous_at_inverse
2029 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2030 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2031 continuous_at_component ~> continuous_component [OF continuous_at_id]
2032 continuous_on_neg ~> continuous_on_minus
2033 continuous_on_sub ~> continuous_on_diff
2034 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2035 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2036 continuous_on_mul ~> continuous_on_scaleR
2037 continuous_on_mul_real ~> continuous_on_mult
2038 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2039 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2040 continuous_on_inverse ~> continuous_on_inv
2041 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2042 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2043 subset_interior ~> interior_mono
2044 subset_closure ~> closure_mono
2045 closure_univ ~> closure_UNIV
2046 real_arch_lt ~> reals_Archimedean2
2047 real_arch ~> reals_Archimedean3
2048 real_abs_norm ~> abs_norm_cancel
2049 real_abs_sub_norm ~> norm_triangle_ineq3
2050 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2052 * Session HOL-Probability:
2053 - Caratheodory's extension lemma is now proved for ring_of_sets.
2054 - Infinite products of probability measures are now available.
2055 - Sigma closure is independent, if the generator is independent
2056 - Use extended reals instead of positive extended
2057 reals. INCOMPATIBILITY.
2059 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2061 expand_fun_below ~> fun_below_iff
2062 below_fun_ext ~> fun_belowI
2063 expand_cfun_eq ~> cfun_eq_iff
2064 ext_cfun ~> cfun_eqI
2065 expand_cfun_below ~> cfun_below_iff
2066 below_cfun_ext ~> cfun_belowI
2067 monofun_fun_fun ~> fun_belowD
2068 monofun_fun_arg ~> monofunE
2069 monofun_lub_fun ~> adm_monofun [THEN admD]
2070 cont_lub_fun ~> adm_cont [THEN admD]
2071 cont2cont_Rep_CFun ~> cont2cont_APP
2072 cont_Rep_CFun_app ~> cont_APP_app
2073 cont_Rep_CFun_app_app ~> cont_APP_app_app
2074 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2075 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2076 contlub_cfun ~> lub_APP [symmetric]
2077 contlub_LAM ~> lub_LAM [symmetric]
2080 lift_distinct1 ~> lift.distinct(1)
2081 lift_distinct2 ~> lift.distinct(2)
2082 Def_not_UU ~> lift.distinct(2)
2083 Def_inject ~> lift.inject
2084 below_UU_iff ~> below_bottom_iff
2085 eq_UU_iff ~> eq_bottom_iff
2088 *** Document preparation ***
2090 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2091 isar-ref manual, both for description and actual application of the
2094 * Antiquotation @{value} evaluates the given term and presents its
2097 * Antiquotations: term style "isub" provides ad-hoc conversion of
2098 variables x1, y23 into subscripted form x\<^isub>1,
2099 y\<^isub>2\<^isub>3.
2101 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2102 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2104 * Localized \isabellestyle switch can be used within blocks or groups
2107 \isabellestyle{it} %preferred default
2108 {\isabellestylett @{text "typewriter stuff"}}
2110 * Discontinued special treatment of hard tabulators. Implicit
2111 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2117 * The inner syntax of sort/type/term/prop supports inlined YXML
2118 representations within quoted string tokens. By encoding logical
2119 entities via Term_XML (in ML or Scala) concrete syntax can be
2120 bypassed, which is particularly useful for producing bits of text
2121 under external program control.
2123 * Antiquotations for ML and document preparation are managed as theory
2124 data, which requires explicit setup.
2126 * Isabelle_Process.is_active allows tools to check if the official
2127 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2128 (better known as Proof General).
2130 * Structure Proof_Context follows standard naming scheme. Old
2131 ProofContext is still available for some time as legacy alias.
2133 * Structure Timing provides various operations for timing; supersedes
2134 former start_timing/end_timing etc.
2136 * Path.print is the official way to show file-system paths to users
2137 (including quotes etc.).
2139 * Inner syntax: identifiers in parse trees of generic categories
2140 "logic", "aprop", "idt" etc. carry position information (disguised as
2141 type constraints). Occasional INCOMPATIBILITY with non-compliant
2142 translations that choke on unexpected type constraints. Positions can
2143 be stripped in ML translations via Syntax.strip_positions /
2144 Syntax.strip_positions_ast, or via the syntax constant
2145 "_strip_positions" within parse trees. As last resort, positions can
2146 be disabled via the configuration option Syntax.positions, which is
2147 called "syntax_positions" in Isar attribute syntax.
2149 * Discontinued special status of various ML structures that contribute
2150 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2151 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2152 refer directly to Ast.Constant, Lexicon.is_identifier,
2153 Syntax_Trans.mk_binder_tr etc.
2155 * Typed print translation: discontinued show_sorts argument, which is
2156 already available via context of "advanced" translation.
2158 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2159 goal states; body tactic needs to address all subgoals uniformly.
2161 * Slightly more special eq_list/eq_set, with shortcut involving
2162 pointer equality (assumes that eq relation is reflexive).
2164 * Classical tactics use proper Proof.context instead of historic types
2165 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2166 operate directly on Proof.context. Raw type claset retains its use as
2167 snapshot of the classical context, which can be recovered via
2168 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2169 INCOMPATIBILITY, classical tactics and derived proof methods require
2170 proper Proof.context.
2175 * Discontinued support for Poly/ML 5.2, which was the last version
2176 without proper multithreading and TimeLimit implementation.
2178 * Discontinued old lib/scripts/polyml-platform, which has been
2179 obsolete since Isabelle2009-2.
2181 * Various optional external tools are referenced more robustly and
2182 uniformly by explicit Isabelle settings as follows:
2184 ISABELLE_CSDP (formerly CSDP_EXE)
2185 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2186 ISABELLE_OCAML (formerly EXEC_OCAML)
2187 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2188 ISABELLE_YAP (formerly EXEC_YAP)
2190 Note that automated detection from the file-system or search path has
2191 been discontinued. INCOMPATIBILITY.
2193 * Scala layer provides JVM method invocation service for static
2194 methods of type (String)String, see Invoke_Scala.method in ML. For
2197 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2199 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2200 this allows to pass structured values between ML and Scala.
2202 * The IsabelleText fonts includes some further glyphs to support the
2203 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2204 installed a local copy (which is normally *not* required) need to
2205 delete or update it from ~~/lib/fonts/.
2209 New in Isabelle2011 (January 2011)
2210 ----------------------------------
2214 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2215 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2216 useful tooltips and hyperlinks produced from its static analysis. The
2217 bundled component provides an executable Isabelle tool that can be run
2220 Isabelle2011/bin/isabelle jedit
2222 * Significantly improved Isabelle/Isar implementation manual.
2224 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2225 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2226 while the default heap location within that directory lacks that extra
2227 suffix. This isolates multiple Isabelle installations from each
2228 other, avoiding problems with old settings in new versions.
2229 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2231 * Source files are always encoded as UTF-8, instead of old-fashioned
2232 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2233 the following package declarations:
2235 \usepackage[utf8]{inputenc}
2236 \usepackage{textcomp}
2238 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2239 a Unicode character is treated as a single symbol, not a sequence of
2240 non-ASCII bytes as before. Since Isabelle/ML string literals may
2241 contain symbols without further backslash escapes, Unicode can now be
2242 used here as well. Recall that Symbol.explode in ML provides a
2243 consistent view on symbols, while raw explode (or String.explode)
2244 merely give a byte-oriented representation.
2246 * Theory loader: source files are primarily located via the master
2247 directory of each theory node (where the .thy file itself resides).
2248 The global load path is still partially available as legacy feature.
2249 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2250 explicit paths, relatively to the theory.
2252 * Special treatment of ML file names has been discontinued.
2253 Historically, optional extensions .ML or .sml were added on demand --
2254 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2255 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2257 * Various options that affect pretty printing etc. are now properly
2258 handled within the context via configuration options, instead of
2259 unsynchronized references or print modes. There are both ML Config.T
2260 entities and Isar declaration attributes to access these.
2262 ML (Config.T) Isar (attribute)
2264 eta_contract eta_contract
2265 show_brackets show_brackets
2266 show_sorts show_sorts
2267 show_types show_types
2268 show_question_marks show_question_marks
2269 show_consts show_consts
2270 show_abbrevs show_abbrevs
2272 Syntax.ast_trace syntax_ast_trace
2273 Syntax.ast_stat syntax_ast_stat
2274 Syntax.ambiguity_level syntax_ambiguity_level
2276 Goal_Display.goals_limit goals_limit
2277 Goal_Display.show_main_goal show_main_goal
2279 Method.rule_trace rule_trace
2281 Thy_Output.display thy_output_display
2282 Thy_Output.quotes thy_output_quotes
2283 Thy_Output.indent thy_output_indent
2284 Thy_Output.source thy_output_source
2285 Thy_Output.break thy_output_break
2287 Note that corresponding "..._default" references in ML may only be
2288 changed globally at the ROOT session setup, but *not* within a theory.
2289 The option "show_abbrevs" supersedes the former print mode
2290 "no_abbrevs" with inverted meaning.
2292 * More systematic naming of some configuration options.
2295 trace_simp ~> simp_trace
2296 debug_simp ~> simp_debug
2298 * Support for real valued configuration options, using simplistic
2299 floating-point notation that coincides with the inner syntax for
2302 * Support for real valued preferences (with approximative PGIP type):
2303 front-ends need to accept "pgint" values in float notation.
2306 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2309 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2314 * Command 'type_synonym' (with single argument) replaces somewhat
2315 outdated 'types', which is still available as legacy feature for some
2318 * Command 'nonterminal' (with 'and' separated list of arguments)
2319 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2321 * Command 'notepad' replaces former 'example_proof' for
2322 experimentation in Isar without any result. INCOMPATIBILITY.
2324 * Locale interpretation commands 'interpret' and 'sublocale' accept
2325 lists of equations to map definitions in a locale to appropriate
2326 entities in the context of the interpretation. The 'interpretation'
2327 command already provided this functionality.
2329 * Diagnostic command 'print_dependencies' prints the locale instances
2330 that would be activated if the specified expression was interpreted in
2331 the current context. Variant "print_dependencies!" assumes a context
2332 without interpretations.
2334 * Diagnostic command 'print_interps' prints interpretations in proofs
2335 in addition to interpretations in theories.
2337 * Discontinued obsolete 'global' and 'local' commands to manipulate
2338 the theory name space. Rare INCOMPATIBILITY. The ML functions
2339 Sign.root_path and Sign.local_path may be applied directly where this
2340 feature is still required for historical reasons.
2342 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2343 'definition' instead.
2345 * The "prems" fact, which refers to the accidental collection of
2346 foundational premises in the context, is now explicitly marked as
2347 legacy feature and will be discontinued soon. Consider using "assms"
2348 of the head statement or reference facts by explicit names.
2350 * Document antiquotations @{class} and @{type} print classes and type
2353 * Document antiquotation @{file} checks file/directory entries within
2354 the local file system.
2359 * Coercive subtyping: functions can be declared as coercions and type
2360 inference will add them as necessary upon input of a term. Theory
2361 Complex_Main declares real :: nat => real and real :: int => real as
2362 coercions. A coercion function f is declared like this:
2364 declare [[coercion f]]
2366 To lift coercions through type constructors (e.g. from nat => real to
2367 nat list => real list), map functions can be declared, e.g.
2369 declare [[coercion_map map]]
2371 Currently coercion inference is activated only in theories including
2372 real numbers, i.e. descendants of Complex_Main. This is controlled by
2373 the configuration option "coercion_enabled", e.g. it can be enabled in
2374 other theories like this:
2376 declare [[coercion_enabled]]
2378 * Command 'partial_function' provides basic support for recursive
2379 function definitions over complete partial orders. Concrete instances
2380 are provided for i) the option type, ii) tail recursion on arbitrary
2381 types, and iii) the heap monad of Imperative_HOL. See
2382 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2385 * Function package: f.psimps rules are no longer implicitly declared
2386 as [simp]. INCOMPATIBILITY.
2388 * Datatype package: theorems generated for executable equality (class
2389 "eq") carry proper names and are treated as default code equations.
2391 * Inductive package: now offers command 'inductive_simps' to
2392 automatically derive instantiated and simplified equations for
2393 inductive predicates, similar to 'inductive_cases'.
2395 * Command 'enriched_type' allows to register properties of the
2396 functorial structure of types.
2398 * Improved infrastructure for term evaluation using code generator
2399 techniques, in particular static evaluation conversions.
2401 * Code generator: Scala (2.8 or higher) has been added to the target
2404 * Code generator: globbing constant expressions "*" and "Theory.*"
2405 have been replaced by the more idiomatic "_" and "Theory._".
2408 * Code generator: export_code without explicit file declaration prints
2409 to standard output. INCOMPATIBILITY.
2411 * Code generator: do not print function definitions for case
2412 combinators any longer.
2414 * Code generator: simplification with rules determined with
2415 src/Tools/Code/code_simp.ML and method "code_simp".
2417 * Code generator for records: more idiomatic representation of record
2418 types. Warning: records are not covered by ancient SML code
2419 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2420 rep_datatype declaration helps to succeed then:
2424 rep_datatype foo_ext ...
2426 * Records: logical foundation type for records does not carry a
2427 '_type' suffix any longer (obsolete due to authentic syntax).
2430 * Quickcheck now by default uses exhaustive testing instead of random
2431 testing. Random testing can be invoked by "quickcheck [random]",
2432 exhaustive testing by "quickcheck [exhaustive]".
2434 * Quickcheck instantiates polymorphic types with small finite
2435 datatypes by default. This enables a simple execution mechanism to
2436 handle quantifiers and function equality over the finite datatypes.
2438 * Quickcheck random generator has been renamed from "code" to
2439 "random". INCOMPATIBILITY.
2441 * Quickcheck now has a configurable time limit which is set to 30
2442 seconds by default. This can be changed by adding [timeout = n] to the
2443 quickcheck command. The time limit for Auto Quickcheck is still set
2446 * Quickcheck in locales considers interpretations of that locale for
2447 counter example search.
2450 - Added "smt" and "remote_smt" provers based on the "smt" proof
2451 method. See the Sledgehammer manual for details ("isabelle doc
2454 sledgehammer atp_info ~> sledgehammer running_provers
2455 sledgehammer atp_kill ~> sledgehammer kill_provers
2456 sledgehammer available_atps ~> sledgehammer available_provers
2459 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2460 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2461 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2462 (and "ms" and "min" are no longer supported)
2467 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2468 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2470 - Added support for partial quotient types.
2471 - Added local versions of the "Nitpick.register_xxx" functions.
2472 - Added "whack" option.
2473 - Allow registration of quotient types as codatatypes.
2474 - Improved "merge_type_vars" option to merge more types.
2475 - Removed unsound "fast_descrs" option.
2476 - Added custom symmetry breaking for datatypes, making it possible to reach
2477 higher cardinalities.
2478 - Prevent the expansion of too large definitions.
2480 * Proof methods "metis" and "meson" now have configuration options
2481 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2482 to diagnose these tools. E.g.
2484 using [[metis_trace = true]]
2486 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2487 manually as command 'solve_direct'.
2489 * The default SMT solver Z3 must be enabled explicitly (due to
2490 licensing issues) by setting the environment variable
2491 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2492 commercial applications, the SMT solver CVC3 is provided as fall-back;
2493 changing the SMT solver is done via the configuration option
2496 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2497 i.e. "remote_cvc3" and "remote_z3".
2499 * Added basic SMT support for datatypes, records, and typedefs using
2500 the oracle mode (no proofs). Direct support of pairs has been dropped
2501 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2502 support for a similar behavior). Minor INCOMPATIBILITY.
2504 * Changed SMT configuration options:
2506 z3_proofs ~> smt_oracle (with inverted meaning)
2507 z3_trace_assms ~> smt_trace_used_facts
2520 * Boogie output files (.b2i files) need to be declared in the theory
2523 * Simplification procedure "list_to_set_comprehension" rewrites list
2524 comprehensions applied to List.set to set comprehensions. Occasional
2525 INCOMPATIBILITY, may be deactivated like this:
2527 declare [[simproc del: list_to_set_comprehension]]
2529 * Removed old version of primrec package. INCOMPATIBILITY.
2531 * Removed simplifier congruence rule of "prod_case", as has for long
2532 been the case with "split". INCOMPATIBILITY.
2534 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2536 * Removed [split_format ... and ... and ...] version of
2537 [split_format]. Potential INCOMPATIBILITY.
2539 * Predicate "sorted" now defined inductively, with nice induction
2540 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2542 * Constant "contents" renamed to "the_elem", to free the generic name
2543 contents for other uses. INCOMPATIBILITY.
2545 * Renamed class eq and constant eq (for code generation) to class
2546 equal and constant equal, plus renaming of related facts and various
2547 tuning. INCOMPATIBILITY.
2549 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2551 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2554 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2555 avoid confusion with finite sets. INCOMPATIBILITY.
2557 * Abandoned locales equiv, congruent and congruent2 for equivalence
2558 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2561 * Some previously unqualified names have been qualified:
2568 Trueprop ~> HOL.Trueprop
2573 op --> ~> HOL.implies
2585 Pair ~> Product_Type.Pair
2586 fst ~> Product_Type.fst
2587 snd ~> Product_Type.snd
2588 curry ~> Product_Type.curry
2590 Collect ~> Set.Collect
2594 * More canonical naming convention for some fundamental definitions:
2596 bot_bool_eq ~> bot_bool_def
2597 top_bool_eq ~> top_bool_def
2598 inf_bool_eq ~> inf_bool_def
2599 sup_bool_eq ~> sup_bool_def
2600 bot_fun_eq ~> bot_fun_def
2601 top_fun_eq ~> top_fun_def
2602 inf_fun_eq ~> inf_fun_def
2603 sup_fun_eq ~> sup_fun_def
2607 * More stylized fact names:
2609 expand_fun_eq ~> fun_eq_iff
2610 expand_set_eq ~> set_eq_iff
2612 nat_number ~> eval_nat_numeral
2616 * Refactoring of code-generation specific operations in theory List:
2622 mem_iff ~> member_def
2623 null_empty ~> null_def
2625 INCOMPATIBILITY. Note that these were not supposed to be used
2626 regularly unless for striking reasons; their main purpose was code
2629 Various operations from the Haskell prelude are used for generating
2632 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2633 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2634 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2636 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2637 "*" and "+" respectively. INCOMPATIBILITY.
2639 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2640 "Sum_Type.Plus" instead.
2642 * Constant "split" has been merged with constant "prod_case"; names of
2643 ML functions, facts etc. involving split have been retained so far,
2644 though. INCOMPATIBILITY.
2646 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2647 instead. INCOMPATIBILITY.
2649 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2652 * Former theory Library/Enum is now part of the HOL-Main image.
2653 INCOMPATIBILITY: all constants of the Enum theory now have to be
2654 referred to by its qualified name.
2657 nlists ~> Enum.nlists
2658 product ~> Enum.product
2660 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2661 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2664 * Theory Library/SetsAndFunctions has been split into
2665 Library/Function_Algebras and Library/Set_Algebras; canonical names
2666 for instance definitions for functions; various improvements.
2669 * Theory Library/Multiset provides stable quicksort implementation of
2672 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2675 * Session Multivariate_Analysis: introduced a type class for euclidean
2676 space. Most theorems are now stated in terms of euclidean spaces
2677 instead of finite cartesian products.
2680 real ^ 'n ~> 'a::real_vector
2681 ~> 'a::euclidean_space
2682 ~> 'a::ordered_euclidean_space
2683 (depends on your needs)
2687 \<chi> x. _ ~> \<chi>\<chi> x. _
2690 Also note that the indices are now natural numbers and not from some
2691 finite type. Finite cartesian products of euclidean spaces, products
2692 of euclidean spaces the real and complex numbers are instantiated to
2693 be euclidean_spaces. INCOMPATIBILITY.
2695 * Session Probability: introduced pextreal as positive extended real
2696 numbers. Use pextreal as value for measures. Introduce the
2697 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2698 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2699 the integral in Multivariate Analysis. INCOMPATIBILITY.
2701 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2704 * Session SPARK (with image HOL-SPARK) provides commands to load and
2705 prove verification conditions generated by the SPARK Ada program
2706 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2711 * Theorems for additive ring operations (locale abelian_monoid and
2712 descendants) are generated by interpretation from their multiplicative
2713 counterparts. Names (in particular theorem names) have the mandatory
2714 qualifier 'add'. Previous theorem names are redeclared for
2717 * Structure "int_ring" is now an abbreviation (previously a
2718 definition). This fits more natural with advanced interpretations.
2723 * The domain package now runs in definitional mode by default: The
2724 former command 'new_domain' is now called 'domain'. To use the domain
2725 package in its original axiomatic mode, use 'domain (unsafe)'.
2728 * The new class "domain" is now the default sort. Class "predomain"
2729 is an unpointed version of "domain". Theories can be updated by
2730 replacing sort annotations as shown below. INCOMPATIBILITY.
2732 'a::type ~> 'a::countable
2733 'a::cpo ~> 'a::predomain
2734 'a::pcpo ~> 'a::domain
2736 * The old type class "rep" has been superseded by class "domain".
2737 Accordingly, users of the definitional package must remove any
2738 "default_sort rep" declarations. INCOMPATIBILITY.
2740 * The domain package (definitional mode) now supports unpointed
2741 predomain argument types, as long as they are marked 'lazy'. (Strict
2742 arguments must be in class "domain".) For example, the following
2743 domain definition now works:
2745 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2747 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2748 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2749 'a option, and 'a list. Additionally, it configures fixrec and the
2750 domain package to work with these types. For example:
2752 fixrec isInl :: "('a + 'b) u -> tr"
2753 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2755 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2757 * The "(permissive)" option of fixrec has been replaced with a
2758 per-equation "(unchecked)" option. See
2759 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2761 * The "bifinite" class no longer fixes a constant "approx"; the class
2762 now just asserts that such a function exists. INCOMPATIBILITY.
2764 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2765 defines an embedding of type 'a defl into udom by default; instances
2766 of "bifinite" and "domain" classes are available in
2767 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2769 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2771 * The predicate "directed" has been removed. INCOMPATIBILITY.
2773 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2775 * The function "cprod_map" has been renamed to "prod_map".
2778 * The monadic bind operator on each powerdomain has new binder syntax
2779 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2780 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2782 * The infix syntax for binary union on each powerdomain has changed
2783 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2784 syntax. INCOMPATIBILITY.
2786 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2787 still supported as an input translation.
2789 * Renamed some theorems (the original names are also still available).
2791 expand_fun_below ~> fun_below_iff
2792 below_fun_ext ~> fun_belowI
2793 expand_cfun_eq ~> cfun_eq_iff
2794 ext_cfun ~> cfun_eqI
2795 expand_cfun_below ~> cfun_below_iff
2796 below_cfun_ext ~> cfun_belowI
2797 cont2cont_Rep_CFun ~> cont2cont_APP
2799 * The Abs and Rep functions for various types have changed names.
2800 Related theorem names have also changed to match. INCOMPATIBILITY.
2802 Rep_CFun ~> Rep_cfun
2803 Abs_CFun ~> Abs_cfun
2804 Rep_Sprod ~> Rep_sprod
2805 Abs_Sprod ~> Abs_sprod
2806 Rep_Ssum ~> Rep_ssum
2807 Abs_Ssum ~> Abs_ssum
2809 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2810 been renamed to *_bottom_iff. INCOMPATIBILITY.
2812 * Various changes to bisimulation/coinduction with domain package:
2814 - Definitions of "bisim" constants no longer mention definedness.
2815 - With mutual recursion, "bisim" predicate is now curried.
2816 - With mutual recursion, each type gets a separate coind theorem.
2817 - Variable names in bisim_def and coinduct rules have changed.
2821 * Case combinators generated by the domain package for type "foo" are
2822 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2824 * Several theorems have been renamed to more accurately reflect the
2825 names of constants and types involved. INCOMPATIBILITY.
2827 thelub_const ~> lub_const
2828 lub_const ~> is_lub_const
2830 is_lub_lub ~> is_lubD2
2832 unique_lub ~> is_lub_unique
2833 is_ub_lub ~> is_lub_rangeD1
2834 lub_bin_chain ~> is_lub_bin_chain
2835 lub_fun ~> is_lub_fun
2836 thelub_fun ~> lub_fun
2837 thelub_cfun ~> lub_cfun
2838 thelub_Pair ~> lub_Pair
2839 lub_cprod ~> is_lub_prod
2840 thelub_cprod ~> lub_prod
2841 minimal_cprod ~> minimal_prod
2842 inst_cprod_pcpo ~> inst_prod_pcpo
2844 compact_UU ~> compact_bottom
2845 deflation_UU ~> deflation_bottom
2846 finite_deflation_UU ~> finite_deflation_bottom
2848 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2850 sq_ord_less_eq_trans ~> below_eq_trans
2851 sq_ord_eq_less_trans ~> eq_below_trans
2852 refl_less ~> below_refl
2853 trans_less ~> below_trans
2854 antisym_less ~> below_antisym
2855 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2856 box_less ~> box_below
2857 rev_trans_less ~> rev_below_trans
2858 not_less2not_eq ~> not_below2not_eq
2859 less_UU_iff ~> below_UU_iff
2860 flat_less_iff ~> flat_below_iff
2861 adm_less ~> adm_below
2862 adm_not_less ~> adm_not_below
2863 adm_compact_not_less ~> adm_compact_not_below
2864 less_fun_def ~> below_fun_def
2865 expand_fun_less ~> fun_below_iff
2866 less_fun_ext ~> fun_belowI
2867 less_discr_def ~> below_discr_def
2868 discr_less_eq ~> discr_below_eq
2869 less_unit_def ~> below_unit_def
2870 less_cprod_def ~> below_prod_def
2871 prod_lessI ~> prod_belowI
2872 Pair_less_iff ~> Pair_below_iff
2873 fst_less_iff ~> fst_below_iff
2874 snd_less_iff ~> snd_below_iff
2875 expand_cfun_less ~> cfun_below_iff
2876 less_cfun_ext ~> cfun_belowI
2877 injection_less ~> injection_below
2878 less_up_def ~> below_up_def
2879 not_Iup_less ~> not_Iup_below
2880 Iup_less ~> Iup_below
2882 Def_inject_less_eq ~> Def_below_Def
2883 Def_less_is_eq ~> Def_below_iff
2884 spair_less_iff ~> spair_below_iff
2885 less_sprod ~> below_sprod
2886 spair_less ~> spair_below
2887 sfst_less_iff ~> sfst_below_iff
2888 ssnd_less_iff ~> ssnd_below_iff
2889 fix_least_less ~> fix_least_below
2890 dist_less_one ~> dist_below_one
2891 less_ONE ~> below_ONE
2892 ONE_less_iff ~> ONE_below_iff
2893 less_sinlD ~> below_sinlD
2894 less_sinrD ~> below_sinrD
2899 * All constant names are now qualified internally and use proper
2900 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2905 * Antiquotation @{assert} inlines a function bool -> unit that raises
2906 Fail if the argument is false. Due to inlining the source position of
2907 failed assertions is included in the error output.
2909 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2910 text is in practice always evaluated with a stable theory checkpoint.
2911 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2913 * Antiquotation @{theory A} refers to theory A from the ancestry of
2914 the current context, not any accidental theory loader state as before.
2915 Potential INCOMPATIBILITY, subtle change in semantics.
2917 * Syntax.pretty_priority (default 0) configures the required priority
2918 of pretty-printed output and thus affects insertion of parentheses.
2920 * Syntax.default_root (default "any") configures the inner syntax
2921 category (nonterminal symbol) for parsing of terms.
2923 * Former exception Library.UnequalLengths now coincides with
2924 ListPair.UnequalLengths.
2926 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2927 main functionality is provided by structure Simplifier.
2929 * Renamed raw "explode" function to "raw_explode" to emphasize its
2930 meaning. Note that internally to Isabelle, Symbol.explode is used in
2931 almost all situations.
2933 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2934 See implementation manual for further details on exceptions in
2937 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2940 * Renamed structure PureThy to Pure_Thy and moved most of its
2941 operations to structure Global_Theory, to emphasize that this is
2942 rarely-used global-only stuff.
2944 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2945 instead (or tracing for high-volume output).
2947 * Configuration option show_question_marks only affects regular pretty
2948 printing of types and terms, not raw Term.string_of_vname.
2950 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2951 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2952 @{thms} for most purposes.
2954 * ML structure Unsynchronized is never opened, not even in Isar
2955 interaction mode as before. Old Unsynchronized.set etc. have been
2956 discontinued -- use plain := instead. This should be *rare* anyway,
2957 since modern tools always work via official context data, notably
2958 configuration options.
2960 * Parallel and asynchronous execution requires special care concerning
2961 interrupts. Structure Exn provides some convenience functions that
2962 avoid working directly with raw Interrupt. User code must not absorb
2963 interrupts -- intermediate handling (for cleanup etc.) needs to be
2964 followed by re-raising of the original exception. Another common
2965 source of mistakes are "handle _" patterns, which make the meaning of
2966 the program subject to physical effects of the environment.
2970 New in Isabelle2009-2 (June 2010)
2971 ---------------------------------
2975 * Authentic syntax for *all* logical entities (type classes, type
2976 constructors, term constants): provides simple and robust
2977 correspondence between formal entities and concrete syntax. Within
2978 the parse tree / AST representations, "constants" are decorated by
2979 their category (class, type, const) and spelled out explicitly with
2980 their full internal name.
2982 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2983 and translations (translation rules and translation functions in ML).
2984 Some hints on upgrading:
2986 - Many existing uses of 'syntax' and 'translations' can be replaced
2987 by more modern 'type_notation', 'notation' and 'abbreviation',
2988 which are independent of this issue.
2990 - 'translations' require markup within the AST; the term syntax
2991 provides the following special forms:
2993 CONST c -- produces syntax version of constant c from context
2994 XCONST c -- literally c, checked as constant from context
2995 c -- literally c, if declared by 'syntax'
2997 Plain identifiers are treated as AST variables -- occasionally the
2998 system indicates accidental variables via the error "rhs contains
3001 Type classes and type constructors are marked according to their
3002 concrete syntax. Some old translations rules need to be written
3003 for the "type" category, using type constructor application
3004 instead of pseudo-term application of the default category
3007 - 'parse_translation' etc. in ML may use the following
3010 @{class_syntax c} -- type class c within parse tree / AST
3011 @{term_syntax c} -- type constructor c within parse tree / AST
3012 @{const_syntax c} -- ML version of "CONST c" above
3013 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3015 - Literal types within 'typed_print_translations', i.e. those *not*
3016 represented as pseudo-terms are represented verbatim. Use @{class
3017 c} or @{type_name c} here instead of the above syntax
3020 Note that old non-authentic syntax was based on unqualified base
3021 names, so all of the above "constant" names would coincide. Recall
3022 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3023 diagnose syntax problems.
3025 * Type constructors admit general mixfix syntax, not just infix.
3027 * Concrete syntax may be attached to local entities without a proof
3028 body, too. This works via regular mixfix annotations for 'fix',
3029 'def', 'obtain' etc. or via the explicit 'write' command, which is
3030 similar to the 'notation' command in theory specifications.
3032 * Discontinued unnamed infix syntax (legacy feature for many years) --
3033 need to specify constant name and syntax separately. Internal ML
3034 datatype constructors have been renamed from InfixName to Infix etc.
3035 Minor INCOMPATIBILITY.
3037 * Schematic theorem statements need to be explicitly markup as such,
3038 via commands 'schematic_lemma', 'schematic_theorem',
3039 'schematic_corollary'. Thus the relevance of the proof is made
3040 syntactically clear, which impacts performance in a parallel or
3041 asynchronous interactive environment. Minor INCOMPATIBILITY.
3043 * Use of cumulative prems via "!" in some proof methods has been
3044 discontinued (old legacy feature).
3046 * References 'trace_simp' and 'debug_simp' have been replaced by
3047 configuration options stored in the context. Enabling tracing (the
3048 case of debugging is similar) in proofs works via
3050 using [[trace_simp = true]]
3052 Tracing is then active for all invocations of the simplifier in
3053 subsequent goal refinement steps. Tracing may also still be enabled or
3054 disabled via the ProofGeneral settings menu.
3056 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3057 'hide_fact' replace the former 'hide' KIND command. Minor
3060 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3061 more efficient than combinations with -q1 or -q2.
3066 * Proofterms record type-class reasoning explicitly, using the
3067 "unconstrain" operation internally. This eliminates all sort
3068 constraints from a theorem and proof, introducing explicit
3069 OFCLASS-premises. On the proof term level, this operation is
3070 automatically applied at theorem boundaries, such that closed proofs
3071 are always free of sort constraints. INCOMPATIBILITY for tools that
3072 inspect proof terms.
3074 * Local theory specifications may depend on extra type variables that
3075 are not present in the result type -- arguments TYPE('a) :: 'a itself
3076 are added internally. For example:
3078 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3080 * Predicates of locales introduced by classes carry a mandatory
3081 "class" prefix. INCOMPATIBILITY.
3083 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3085 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3088 * Command 'code_reflect' allows to incorporate generated ML code into
3089 runtime environment; replaces immature code_datatype antiquotation.
3092 * Code generator: simple concept for abstract datatypes obeying
3095 * Code generator: details of internal data cache have no impact on the
3096 user space functionality any longer.
3098 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3099 subgoals. This is more appropriate for interpretations with 'where'.
3102 * Command 'example_proof' opens an empty proof body. This allows to
3103 experiment with Isar, without producing any persistent result.
3105 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3106 within a local theory context, with explicit checking of the
3107 constructors involved (in contrast to the raw 'syntax' versions).
3109 * Commands 'types' and 'typedecl' now work within a local theory
3110 context -- without introducing dependencies on parameters or
3111 assumptions, which is not possible in Isabelle/Pure.
3113 * Command 'defaultsort' has been renamed to 'default_sort', it works
3114 within a local theory context. Minor INCOMPATIBILITY.
3119 * Command 'typedef' now works within a local theory context -- without
3120 introducing dependencies on parameters or assumptions, which is not
3121 possible in Isabelle/Pure/HOL. Note that the logical environment may
3122 contain multiple interpretations of local typedefs (with different
3123 non-emptiness proofs), even in a global theory context.
3125 * New package for quotient types. Commands 'quotient_type' and
3126 'quotient_definition' may be used for defining types and constants by
3127 quotient constructions. An example is the type of integers created by
3128 quotienting pairs of natural numbers:
3131 intrel :: "(nat * nat) => (nat * nat) => bool"
3133 "intrel (x, y) (u, v) = (x + v = u + y)"
3135 quotient_type int = "nat * nat" / intrel
3136 by (auto simp add: equivp_def expand_fun_eq)
3139 "0::int" is "(0::nat, 0::nat)"
3141 The method "lifting" can be used to lift of theorems from the
3142 underlying "raw" type to the quotient type. The example
3143 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3144 construction and provides a reasoning infrastructure for finite sets.
3146 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3147 clash with new theory Quotient in Main HOL.
3149 * Moved the SMT binding into the main HOL session, eliminating
3150 separate HOL-SMT session.
3152 * List membership infix mem operation is only an input abbreviation.
3155 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3156 for future developements; former Library/Word.thy is still present in
3157 the AFP entry RSAPPS.
3159 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3160 longer shadowed. INCOMPATIBILITY.
3162 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3165 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3168 * Dropped normalizing_semiring etc; use the facts in semiring classes
3169 instead. INCOMPATIBILITY.
3171 * Dropped several real-specific versions of lemmas about floor and
3172 ceiling; use the generic lemmas from theory "Archimedean_Field"
3173 instead. INCOMPATIBILITY.
3175 floor_number_of_eq ~> floor_number_of
3176 le_floor_eq_number_of ~> number_of_le_floor
3177 le_floor_eq_zero ~> zero_le_floor
3178 le_floor_eq_one ~> one_le_floor
3179 floor_less_eq_number_of ~> floor_less_number_of
3180 floor_less_eq_zero ~> floor_less_zero
3181 floor_less_eq_one ~> floor_less_one
3182 less_floor_eq_number_of ~> number_of_less_floor
3183 less_floor_eq_zero ~> zero_less_floor
3184 less_floor_eq_one ~> one_less_floor
3185 floor_le_eq_number_of ~> floor_le_number_of
3186 floor_le_eq_zero ~> floor_le_zero
3187 floor_le_eq_one ~> floor_le_one
3188 floor_subtract_number_of ~> floor_diff_number_of
3189 floor_subtract_one ~> floor_diff_one
3190 ceiling_number_of_eq ~> ceiling_number_of
3191 ceiling_le_eq_number_of ~> ceiling_le_number_of
3192 ceiling_le_zero_eq ~> ceiling_le_zero
3193 ceiling_le_eq_one ~> ceiling_le_one
3194 less_ceiling_eq_number_of ~> number_of_less_ceiling
3195 less_ceiling_eq_zero ~> zero_less_ceiling
3196 less_ceiling_eq_one ~> one_less_ceiling
3197 ceiling_less_eq_number_of ~> ceiling_less_number_of
3198 ceiling_less_eq_zero ~> ceiling_less_zero
3199 ceiling_less_eq_one ~> ceiling_less_one
3200 le_ceiling_eq_number_of ~> number_of_le_ceiling
3201 le_ceiling_eq_zero ~> zero_le_ceiling
3202 le_ceiling_eq_one ~> one_le_ceiling
3203 ceiling_subtract_number_of ~> ceiling_diff_number_of
3204 ceiling_subtract_one ~> ceiling_diff_one
3206 * Theory "Finite_Set": various folding_XXX locales facilitate the
3207 application of the various fold combinators on finite sets.
3209 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3210 provides abstract red-black tree type which is backed by "RBT_Impl" as
3211 implementation. INCOMPATIBILTY.
3213 * Theory Library/Coinductive_List has been removed -- superseded by
3214 AFP/thys/Coinductive.
3216 * Theory PReal, including the type "preal" and related operations, has
3217 been removed. INCOMPATIBILITY.
3219 * Real: new development using Cauchy Sequences.
3221 * Split off theory "Big_Operators" containing setsum, setprod,
3222 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3224 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3225 "Int" etc. INCOMPATIBILITY.
3227 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3229 * New set of rules "ac_simps" provides combined assoc / commute
3230 rewrites for all interpretations of the appropriate generic locales.
3232 * Renamed theory "OrderedGroup" to "Groups" and split theory
3233 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3234 appropriate and more consistent names suitable for name prefixes
3235 within the HOL theories. INCOMPATIBILITY.
3237 * Some generic constants have been put to appropriate theories:
3238 - less_eq, less: Orderings
3239 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3240 - inverse, divide: Rings
3243 * More consistent naming of type classes involving orderings (and
3246 lower_semilattice ~> semilattice_inf
3247 upper_semilattice ~> semilattice_sup
3249 dense_linear_order ~> dense_linorder
3251 pordered_ab_group_add ~> ordered_ab_group_add
3252 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3253 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3254 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3255 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3256 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3257 pordered_cancel_semiring ~> ordered_cancel_semiring
3258 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3259 pordered_comm_ring ~> ordered_comm_ring
3260 pordered_comm_semiring ~> ordered_comm_semiring
3261 pordered_ring ~> ordered_ring
3262 pordered_ring_abs ~> ordered_ring_abs
3263 pordered_semiring ~> ordered_semiring
3265 ordered_ab_group_add ~> linordered_ab_group_add
3266 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3267 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3268 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3269 ordered_field ~> linordered_field
3270 ordered_field_no_lb ~> linordered_field_no_lb
3271 ordered_field_no_ub ~> linordered_field_no_ub
3272 ordered_field_dense_linear_order ~> dense_linordered_field
3273 ordered_idom ~> linordered_idom
3274 ordered_ring ~> linordered_ring
3275 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3276 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3277 ordered_ring_strict ~> linordered_ring_strict
3278 ordered_semidom ~> linordered_semidom
3279 ordered_semiring ~> linordered_semiring
3280 ordered_semiring_1 ~> linordered_semiring_1
3281 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3282 ordered_semiring_strict ~> linordered_semiring_strict
3284 The following slightly odd type classes have been moved to a
3285 separate theory Library/Lattice_Algebras:
3287 lordered_ab_group_add ~> lattice_ab_group_add
3288 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3289 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3290 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3291 lordered_ring ~> lattice_ring
3295 * Refined field classes:
3296 - classes division_ring_inverse_zero, field_inverse_zero,
3297 linordered_field_inverse_zero include rule inverse 0 = 0 --
3298 subsumes former division_by_zero class;
3299 - numerous lemmas have been ported from field to division_ring.
3302 * Refined algebra theorem collections:
3303 - dropped theorem group group_simps, use algebra_simps instead;
3304 - dropped theorem group ring_simps, use field_simps instead;
3305 - proper theorem collection field_simps subsumes former theorem
3306 groups field_eq_simps and field_simps;
3307 - dropped lemma eq_minus_self_iff which is a duplicate for
3311 * Theory Finite_Set and List: some lemmas have been generalized from
3314 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3315 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3316 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3317 union_Union_fold_union ~> sup_Sup_fold_sup
3318 Inter_fold_inter ~> Inf_fold_inf
3319 Union_fold_union ~> Sup_fold_sup
3320 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3321 union_UNION_fold_union ~> sup_SUPR_fold_sup
3322 INTER_fold_inter ~> INFI_fold_inf
3323 UNION_fold_union ~> SUPR_fold_sup
3325 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3326 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3327 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3328 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3329 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3330 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3332 * Reorganized theory Multiset: swapped notation of pointwise and
3335 - pointwise ordering is instance of class order with standard syntax
3337 - multiset ordering has syntax <=# and <#; partial order properties
3338 are provided by means of interpretation with prefix
3340 - less duplication, less historical organization of sections,
3341 conversion from associations lists to multisets, rudimentary code
3343 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3348 multiset_eq_conv_count_eq ~> multiset_ext_iff
3349 multi_count_ext ~> multiset_ext
3350 diff_union_inverse2 ~> diff_union_cancelR
3354 * Theory Permutation: replaced local "remove" by List.remove1.
3356 * Code generation: ML and OCaml code is decorated with signatures.
3358 * Theory List: added transpose.
3360 * Library/Nat_Bijection.thy is a collection of bijective functions
3361 between nat and other types, which supersedes the older libraries
3362 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3365 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3366 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3367 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3368 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3369 Countable.pair_encode ~> prod_encode
3370 NatIso.prod2nat ~> prod_encode
3371 NatIso.nat2prod ~> prod_decode
3372 NatIso.sum2nat ~> sum_encode
3373 NatIso.nat2sum ~> sum_decode
3374 NatIso.list2nat ~> list_encode
3375 NatIso.nat2list ~> list_decode
3376 NatIso.set2nat ~> set_encode
3377 NatIso.nat2set ~> set_decode
3380 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3381 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3382 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3383 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3384 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3385 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3386 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3387 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3388 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3389 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3390 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3391 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3392 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3395 - Renamed ATP commands:
3396 atp_info ~> sledgehammer running_atps
3397 atp_kill ~> sledgehammer kill_atps
3398 atp_messages ~> sledgehammer messages
3399 atp_minimize ~> sledgehammer minimize
3400 print_atps ~> sledgehammer available_atps
3402 - Added user's manual ("isabelle doc sledgehammer").
3403 - Added option syntax and "sledgehammer_params" to customize
3404 Sledgehammer's behavior. See the manual for details.
3405 - Modified the Isar proof reconstruction code so that it produces
3406 direct proofs rather than proofs by contradiction. (This feature
3407 is still experimental.)
3408 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3410 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3413 - Added and implemented "binary_ints" and "bits" options.
3414 - Added "std" option and implemented support for nonstandard models.
3415 - Added and implemented "finitize" option to improve the precision
3416 of infinite datatypes based on a monotonicity analysis.
3417 - Added support for quotient types.
3418 - Added support for "specification" and "ax_specification"
3420 - Added support for local definitions (for "function" and
3421 "termination" proofs).
3422 - Added support for term postprocessors.
3423 - Optimized "Multiset.multiset" and "FinFun.finfun".
3424 - Improved efficiency of "destroy_constrs" optimization.
3425 - Fixed soundness bugs related to "destroy_constrs" optimization and
3427 - Fixed soundness bug related to higher-order constructors.
3428 - Fixed soundness bug when "full_descrs" is enabled.
3429 - Improved precision of set constructs.
3430 - Added "atoms" option.
3431 - Added cache to speed up repeated Kodkod invocations on the same
3433 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3434 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3435 "SAT4J_Light". INCOMPATIBILITY.
3436 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3437 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3438 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3440 * Method "induct" now takes instantiations of the form t, where t is not
3441 a variable, as a shorthand for "x == t", where x is a fresh variable.
3442 If this is not intended, t has to be enclosed in parentheses.
3443 By default, the equalities generated by definitional instantiations
3444 are pre-simplified, which may cause parameters of inductive cases
3445 to disappear, or may even delete some of the inductive cases.
3446 Use "induct (no_simp)" instead of "induct" to restore the old
3447 behaviour. The (no_simp) option is also understood by the "cases"
3448 and "nominal_induct" methods, which now perform pre-simplification, too.
3454 * Variable names in lemmas generated by the domain package have
3455 changed; the naming scheme is now consistent with the HOL datatype
3456 package. Some proof scripts may be affected, INCOMPATIBILITY.
3458 * The domain package no longer defines the function "foo_copy" for
3459 recursive domain "foo". The reach lemma is now stated directly in
3460 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3461 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3463 * Most definedness lemmas generated by the domain package (previously
3464 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3465 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3466 Proofs that used definedness lemmas as intro rules may break,
3467 potential INCOMPATIBILITY.
3469 * Induction and casedist rules generated by the domain package now
3470 declare proper case_names (one called "bottom", and one named for each
3471 constructor). INCOMPATIBILITY.
3473 * For mutually-recursive domains, separate "reach" and "take_lemma"
3474 rules are generated for each domain, INCOMPATIBILITY.
3476 foo_bar.reach ~> foo.reach bar.reach
3477 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3479 * Some lemmas generated by the domain package have been renamed for
3480 consistency with the datatype package, INCOMPATIBILITY.
3482 foo.ind ~> foo.induct
3483 foo.finite_ind ~> foo.finite_induct
3484 foo.coind ~> foo.coinduct
3485 foo.casedist ~> foo.exhaust
3486 foo.exhaust ~> foo.nchotomy
3488 * For consistency with other definition packages, the fixrec package
3489 now generates qualified theorem names, INCOMPATIBILITY.
3491 foo_simps ~> foo.simps
3492 foo_unfold ~> foo.unfold
3493 foo_induct ~> foo.induct
3495 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3496 method and internal fixrec proofs now use the default simpset instead.
3499 * The "contlub" predicate has been removed. Proof scripts should use
3500 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3502 * The "admw" predicate has been removed, INCOMPATIBILITY.
3504 * The constants cpair, cfst, and csnd have been removed in favor of
3505 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3510 * Antiquotations for basic formal entities:
3512 @{class NAME} -- type class
3513 @{class_syntax NAME} -- syntax representation of the above
3515 @{type_name NAME} -- logical type
3516 @{type_abbrev NAME} -- type abbreviation
3517 @{nonterminal NAME} -- type of concrete syntactic category
3518 @{type_syntax NAME} -- syntax representation of any of the above
3520 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3521 @{const_abbrev NAME} -- abbreviated constant
3522 @{const_syntax NAME} -- syntax representation of any of the above
3524 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3525 syntax constant (cf. 'syntax' command).
3527 * Antiquotation @{make_string} inlines a function to print arbitrary
3528 values similar to the ML toplevel. The result is compiler dependent
3529 and may fall back on "?" in certain situations.
3531 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3532 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3533 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3534 not work with the asynchronous Isar document model.
3536 * Configuration options now admit dynamic default values, depending on
3537 the context or even global references.
3539 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3540 uses an efficient external library if available (for Poly/ML).
3542 * Renamed some important ML structures, while keeping the old names
3543 for some time as aliases within the structure Legacy:
3545 OuterKeyword ~> Keyword
3548 OuterSyntax ~> Outer_Syntax
3549 PrintMode ~> Print_Mode
3550 SpecParse ~> Parse_Spec
3553 ThyOutput ~> Thy_Output
3554 TypeInfer ~> Type_Infer
3556 Note that "open Legacy" simplifies porting of sources, but forgetting
3557 to remove it again will complicate porting again in the future.
3559 * Most operations that refer to a global context are named
3560 accordingly, e.g. Simplifier.global_context or
3561 ProofContext.init_global. There are some situations where a global
3562 context actually works, but under normal circumstances one needs to
3563 pass the proper local context through the code!
3565 * Discontinued old TheoryDataFun with its copy/init operation -- data
3566 needs to be pure. Functor Theory_Data_PP retains the traditional
3567 Pretty.pp argument to merge, which is absent in the standard
3568 Theory_Data version.
3570 * Sorts.certify_sort and derived "cert" operations for types and terms
3571 no longer minimize sorts. Thus certification at the boundary of the
3572 inference kernel becomes invariant under addition of class relations,
3573 which is an important monotonicity principle. Sorts are now minimized
3574 in the syntax layer only, at the boundary between the end-user and the
3575 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3576 explicitly in rare situations.
3578 * Renamed old-style Drule.standard to Drule.export_without_context, to
3579 emphasize that this is in no way a standard operation.
3582 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3583 usual for resolution. Rare INCOMPATIBILITY.
3585 * Renamed varify/unvarify operations to varify_global/unvarify_global
3586 to emphasize that these only work in a global situation (which is
3589 * Curried take and drop in library.ML; negative length is interpreted
3590 as infinity (as in chop). Subtle INCOMPATIBILITY.
3592 * Proof terms: type substitutions on proof constants now use canonical
3593 order of type variables. INCOMPATIBILITY for tools working with proof
3596 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3597 may no longer carry premises. User-level specifications are
3598 transformed accordingly by Thm.add_axiom/add_def.
3603 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3604 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3605 proof terms are enabled unconditionally in the new HOL-Proofs image.
3607 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3608 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3611 * Old lib/scripts/polyml-platform is superseded by the
3612 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3613 variant, even on a 64 bit machine. The following example setting
3614 prefers 64 bit if available:
3616 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3618 * The preliminary Isabelle/jEdit application demonstrates the emerging
3619 Isabelle/Scala layer for advanced prover interaction and integration.
3620 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3623 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3624 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3625 similar to the default assignment of the document preparation system
3626 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3627 provides some operations for direct access to the font without asking
3628 the user for manual installation.
3632 New in Isabelle2009-1 (December 2009)
3633 -------------------------------------
3637 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3638 one backslash should be used, even in ML sources.
3643 * Locale interpretation propagates mixins along the locale hierarchy.
3644 The currently only available mixins are the equations used to map
3645 local definitions to terms of the target domain of an interpretation.
3647 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3648 loc" to print all interpretations of locale "loc" in the theory.
3649 Interpretations in proofs are not shown.
3651 * Thoroughly revised locales tutorial. New section on conditional
3654 * On instantiation of classes, remaining undefined class parameters
3655 are formally declared. INCOMPATIBILITY.
3658 *** Document preparation ***
3660 * New generalized style concept for printing terms: @{foo (style) ...}
3661 instead of @{foo_style style ...} (old form is still retained for
3662 backward compatibility). Styles can be also applied for
3663 antiquotations prop, term_type and typeof.
3668 * New proof method "smt" for a combination of first-order logic with
3669 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3670 fixed-size bitvectors; there is also basic support for higher-order
3671 features (esp. lambda abstractions). It is an incomplete decision
3672 procedure based on external SMT solvers using the oracle mechanism;
3673 for the SMT solver Z3, this method is proof-producing. Certificates
3674 are provided to avoid calling the external solvers solely for
3675 re-checking proofs. Due to a remote SMT service there is no need for
3676 installing SMT solvers locally. See src/HOL/SMT.
3678 * New commands to load and prove verification conditions generated by
3679 the Boogie program verifier or derived systems (e.g. the Verifying C
3680 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3682 * New counterexample generator tool 'nitpick' based on the Kodkod
3683 relational model finder. See src/HOL/Tools/Nitpick and
3684 src/HOL/Nitpick_Examples.
3686 * New commands 'code_pred' and 'values' to invoke the predicate
3687 compiler and to enumerate values of inductive predicates.
3689 * A tabled implementation of the reflexive transitive closure.
3691 * New implementation of quickcheck uses generic code generator;
3692 default generators are provided for all suitable HOL types, records
3693 and datatypes. Old quickcheck can be re-activated importing theory
3694 Library/SML_Quickcheck.
3696 * New testing tool Mirabelle for automated proof tools. Applies
3697 several tools and tactics like sledgehammer, metis, or quickcheck, to
3698 every proof step in a theory. To be used in batch mode via the
3699 "mirabelle" utility.
3701 * New proof method "sos" (sum of squares) for nonlinear real
3702 arithmetic (originally due to John Harison). It requires theory
3703 Library/Sum_Of_Squares. It is not a complete decision procedure but
3704 works well in practice on quantifier-free real arithmetic with +, -,
3705 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3706 inequalities between polynomials. It makes use of external
3707 semidefinite programming solvers. Method "sos" generates a
3708 certificate that can be pasted into the proof thus avoiding the need
3709 to call an external tool every time the proof is checked. See
3710 src/HOL/Library/Sum_Of_Squares.
3712 * New method "linarith" invokes existing linear arithmetic decision
3715 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3717 * New Sledgehammer option "Full Types" in Proof General settings menu.
3718 Causes full type information to be output to the ATPs. This slows
3719 ATPs down considerably but eliminates a source of unsound "proofs"
3722 * New method "metisFT": A version of metis that uses full type
3723 information in order to avoid failures of proof reconstruction.
3725 * New evaluator "approximate" approximates an real valued term using
3726 the same method as the approximation method.
3728 * Method "approximate" now supports arithmetic expressions as
3729 boundaries of intervals and implements interval splitting and Taylor
3732 * ML antiquotation @{code_datatype} inserts definition of a datatype
3733 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3735 * New theory SupInf of the supremum and infimum operators for sets of
3738 * New theory Probability, which contains a development of measure
3739 theory, eventually leading to Lebesgue integration and probability.
3741 * Extended Multivariate Analysis to include derivation and Brouwer's
3744 * Reorganization of number theory, INCOMPATIBILITY:
3745 - new number theory development for nat and int, in theories Divides
3746 and GCD as well as in new session Number_Theory
3747 - some constants and facts now suffixed with _nat and _int
3749 - former session NumberTheory now named Old_Number_Theory, including
3750 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3751 - moved theory Pocklington from src/HOL/Library to
3752 src/HOL/Old_Number_Theory
3754 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3755 lcm of finite and infinite sets. It is shown that they form a complete
3758 * Class semiring_div requires superclass no_zero_divisors and proof of
3759 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3760 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3761 generalized to class semiring_div, subsuming former theorems
3762 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3763 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3766 * Refinements to lattice classes and sets:
3767 - less default intro/elim rules in locale variant, more default
3768 intro/elim rules in class variant: more uniformity
3769 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3771 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3773 - renamed ACI to inf_sup_aci
3774 - new class "boolean_algebra"
3775 - class "complete_lattice" moved to separate theory
3776 "Complete_Lattice"; corresponding constants (and abbreviations)
3777 renamed and with authentic syntax:
3778 Set.Inf ~> Complete_Lattice.Inf
3779 Set.Sup ~> Complete_Lattice.Sup
3780 Set.INFI ~> Complete_Lattice.INFI
3781 Set.SUPR ~> Complete_Lattice.SUPR
3782 Set.Inter ~> Complete_Lattice.Inter
3783 Set.Union ~> Complete_Lattice.Union
3784 Set.INTER ~> Complete_Lattice.INTER
3785 Set.UNION ~> Complete_Lattice.UNION
3786 - authentic syntax for
3789 - mere abbreviations:
3792 Set.inter (for inf, formerly Set.Int)
3793 Set.union (for sup, formerly Set.Un)
3794 Complete_Lattice.Inter (for Inf)
3795 Complete_Lattice.Union (for Sup)
3796 Complete_Lattice.INTER (for INFI)
3797 Complete_Lattice.UNION (for SUPR)
3798 - object-logic definitions as far as appropriate
3800 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3801 Un_subset_iff are explicitly deleted as default simp rules; then also
3802 their lattice counterparts le_inf_iff and le_sup_iff have to be
3803 deleted to achieve the desired effect.
3805 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3806 rules by default any longer; the same applies to min_max.inf_absorb1
3807 etc. INCOMPATIBILITY.
3809 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3810 pred_set_conv by default. INCOMPATIBILITY.
3812 * Power operations on relations and functions are now one dedicated
3813 constant "compow" with infix syntax "^^". Power operation on
3814 multiplicative monoids retains syntax "^" and is now defined generic
3815 in class power. INCOMPATIBILITY.
3817 * Relation composition "R O S" now has a more standard argument order:
3818 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3819 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3820 break, since the O_assoc rule was not rewritten like this. Fix using
3821 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3823 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3824 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3827 * Most rules produced by inductive and datatype package have mandatory
3828 prefixes. INCOMPATIBILITY.
3830 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3831 the attribute of the same name. Each of the theorems in the list
3832 DERIV_intros assumes composition with an additional function and
3833 matches a variable to the derivative, which has to be solved by the
3834 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3835 of most elementary terms. Former Maclauren.DERIV_tac and
3836 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3839 * Code generator attributes follow the usual underscore convention:
3840 code_unfold replaces code unfold
3841 code_post replaces code post
3846 sizechange -> size_change
3847 induct_scheme -> induction_schema
3850 * Discontinued abbreviation "arbitrary" of constant "undefined".
3851 INCOMPATIBILITY, use "undefined" directly.
3854 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3855 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3856 Suc_plus1 -> Suc_eq_plus1
3857 *anti_sym -> *antisym*
3858 vector_less_eq_def -> vector_le_def
3861 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3864 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3870 * Theory Representable defines a class "rep" of domains that are
3871 representable (via an ep-pair) in the universal domain type "udom".
3872 Instances are provided for all type constructors defined in HOLCF.
3874 * The 'new_domain' command is a purely definitional version of the
3875 domain package, for representable domains. Syntax is identical to the
3876 old domain package. The 'new_domain' package also supports indirect
3877 recursion using previously-defined type constructors. See
3878 src/HOLCF/ex/New_Domain.thy for examples.
3880 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3881 on the left-hand side of an equation, and then performs
3882 simplification. Rewriting is done using rules declared with the
3883 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3884 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3886 * The pattern-match compiler in 'fixrec' can now handle constructors
3887 with HOL function types. Pattern-match combinators for the Pair
3888 constructor are pre-configured.
3890 * The 'fixrec' package now produces better fixed-point induction rules
3891 for mutually-recursive definitions: Induction rules have conclusions
3892 of the form "P foo bar" instead of "P <foo, bar>".
3894 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3895 been renamed to "below". The name "below" now replaces "less" in many
3896 theorem names. (Legacy theorem names using "less" are still supported
3899 * The 'fixrec' package now supports "bottom patterns". Bottom
3900 patterns can be used to generate strictness rules, or to make
3901 functions more strict (much like the bang-patterns supported by the
3902 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3908 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3909 errors and run-time exceptions, including detailed source positions.
3911 * Structure Name_Space (formerly NameSpace) now manages uniquely
3912 identified entries, with some additional information such as source
3913 position, logical grouping etc.
3915 * Theory and context data is now introduced by the simplified and
3916 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3917 to be pure, but the old TheoryDataFun for mutable data (with explicit
3918 copy operation) is still available for some time.
3920 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3921 provides a high-level programming interface to synchronized state
3922 variables with atomic update. This works via pure function
3923 application within a critical section -- its runtime should be as
3924 short as possible; beware of deadlocks if critical code is nested,
3925 either directly or indirectly via other synchronized variables!
3927 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3928 wraps raw ML references, explicitly indicating their non-thread-safe
3929 behaviour. The Isar toplevel keeps this structure open, to
3930 accommodate Proof General as well as quick and dirty interactive
3931 experiments with references.
3933 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3934 parallel tactical reasoning.
3936 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3937 are similar to SUBPROOF, but are slightly more flexible: only the
3938 specified parts of the subgoal are imported into the context, and the
3939 body tactic may introduce new subgoals and schematic variables.
3941 * Old tactical METAHYPS, which does not observe the proof context, has
3942 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3943 or Subgoal.FOCUS etc.
3945 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3946 functors have their own ML name space there is no point to mark them
3947 separately.) Minor INCOMPATIBILITY.
3949 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3951 * Renamed several structures FooBar to Foo_Bar. Occasional,
3954 * Operations of structure Skip_Proof no longer require quick_and_dirty
3955 mode, which avoids critical setmp.
3957 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3958 combinators for "args". INCOMPATIBILITY, need to use simplified
3959 Attrib/Method.setup introduced in Isabelle2009.
3961 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3962 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3963 last resort. INCOMPATIBILITY.
3965 * Display.pretty_thm now requires a proper context (cf. former
3966 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3967 or even Display.pretty_thm_without_context as last resort.
3970 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3971 Syntax.pretty_typ/term directly, preferably with proper context
3972 instead of global theory.
3977 * Further fine tuning of parallel proof checking, scales up to 8 cores
3978 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3981 * Support for additional "Isabelle components" via etc/components, see
3982 also the system manual.
3984 * The isabelle makeall tool now operates on all components with
3985 IsaMakefile, not just hardwired "logics".
3987 * Removed "compress" option from isabelle-process and isabelle usedir;
3988 this is always enabled.
3990 * Discontinued support for Poly/ML 4.x versions.
3992 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3993 on a given logic image. This requires the lighttpd webserver and is
3994 currently supported on Linux only.
3998 New in Isabelle2009 (April 2009)
3999 --------------------------------
4003 * Simplified main Isabelle executables, with less surprises on
4004 case-insensitive file-systems (such as Mac OS).
4006 - The main Isabelle tool wrapper is now called "isabelle" instead of
4009 - The former "isabelle" alias for "isabelle-process" has been
4010 removed (should rarely occur to regular users).
4012 - The former "isabelle-interface" and its alias "Isabelle" have been
4013 removed (interfaces are now regular Isabelle tools).
4015 Within scripts and make files, the Isabelle environment variables
4016 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4017 respectively. (The latter are still available as legacy feature.)
4019 The old isabelle-interface wrapper could react in confusing ways if
4020 the interface was uninstalled or changed otherwise. Individual
4021 interface tool configuration is now more explicit, see also the
4022 Isabelle system manual. In particular, Proof General is now available
4023 via "isabelle emacs".
4025 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4026 purge installed copies of Isabelle executables and re-run "isabelle
4027 install -p ...", or use symlinks.
4029 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4030 old ~/isabelle, which was slightly non-standard and apt to cause
4031 surprises on case-insensitive file-systems (such as Mac OS).
4033 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4034 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4035 care is required when using older releases of Isabelle. Note that
4036 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4037 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4039 * Proofs of fully specified statements are run in parallel on
4040 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4041 a regular 4-core machine, if the initial heap space is made reasonably
4042 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4044 * The main reference manuals ("isar-ref", "implementation", and
4045 "system") have been updated and extended. Formally checked references
4046 as hyperlinks are now available uniformly.
4051 * Complete re-implementation of locales. INCOMPATIBILITY in several
4052 respects. The most important changes are listed below. See the
4053 Tutorial on Locales ("locales" manual) for details.
4055 - In locale expressions, instantiation replaces renaming. Parameters
4056 must be declared in a for clause. To aid compatibility with previous
4057 parameter inheritance, in locale declarations, parameters that are not
4058 'touched' (instantiation position "_" or omitted) are implicitly added
4059 with their syntax at the beginning of the for clause.
4061 - Syntax from abbreviations and definitions in locales is available in
4062 locale expressions and context elements. The latter is particularly
4063 useful in locale declarations.
4065 - More flexible mechanisms to qualify names generated by locale
4066 expressions. Qualifiers (prefixes) may be specified in locale
4067 expressions, and can be marked as mandatory (syntax: "name!:") or
4068 optional (syntax "name?:"). The default depends for plain "name:"
4069 depends on the situation where a locale expression is used: in
4070 commands 'locale' and 'sublocale' prefixes are optional, in
4071 'interpretation' and 'interpret' prefixes are mandatory. The old
4072 implicit qualifiers derived from the parameter names of a locale are
4073 no longer generated.
4075 - Command "sublocale l < e" replaces "interpretation l < e". The
4076 instantiation clause in "interpretation" and "interpret" (square
4077 brackets) is no longer available. Use locale expressions.
4079 - When converting proof scripts, mandatory qualifiers in
4080 'interpretation' and 'interpret' should be retained by default, even
4081 if this is an INCOMPATIBILITY compared to former behavior. In the
4082 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4083 in locale expressions range over a single locale instance only.
4085 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4086 In existing theorem specifications replace the includes element by the
4087 respective context elements of the included locale, omitting those
4088 that are already present in the theorem specification. Multiple
4089 assume elements of a locale should be replaced by a single one
4090 involving the locale predicate. In the proof body, declarations (most
4091 notably theorems) may be regained by interpreting the respective
4092 locales in the proof context as required (command "interpret").
4094 If using "includes" in replacement of a target solely because the
4095 parameter types in the theorem are not as general as in the target,
4096 consider declaring a new locale with additional type constraints on
4097 the parameters (context element "constrains").
4099 - Discontinued "locale (open)". INCOMPATIBILITY.
4101 - Locale interpretation commands no longer attempt to simplify goal.
4102 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4103 methods intro_locales and unfold_locales to clarify.
4105 - Locale interpretation commands no longer accept interpretation
4106 attributes. INCOMPATIBILITY.
4108 * Class declaration: so-called "base sort" must not be given in import
4109 list any longer, but is inferred from the specification. Particularly
4116 class foo = type + ...
4118 * Class target: global versions of theorems stemming do not carry a
4119 parameter prefix any longer. INCOMPATIBILITY.
4121 * Class 'instance' command no longer accepts attached definitions.
4122 INCOMPATIBILITY, use proper 'instantiation' target instead.
4124 * Recovered hiding of consts, which was accidentally broken in
4125 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4126 makes c inaccessible; consider using ``hide (open) const c'' instead.
4128 * Slightly more coherent Pure syntax, with updated documentation in
4129 isar-ref manual. Removed locales meta_term_syntax and
4130 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4131 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4132 directly in regular applications.
4134 * There is a new syntactic category "float_const" for signed decimal
4135 fractions (e.g. 123.45 or -123.45).
4137 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4138 interface with 'setup' command instead.
4140 * Command 'local_setup' is similar to 'setup', but operates on a local
4143 * The 'axiomatization' command now only works within a global theory
4144 context. INCOMPATIBILITY.
4146 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4147 hypotheses. Sorts required in the course of reasoning need to be
4148 covered by the constraints in the initial statement, completed by the
4149 type instance information of the background theory. Non-trivial sort
4150 hypotheses, which rarely occur in practice, may be specified via
4151 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4153 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4155 The result contains an implicit sort hypotheses as before --
4156 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4159 * Generalized Isar history, with support for linear undo, direct state
4162 * Changed defaults for unify configuration options:
4164 unify_trace_bound = 50 (formerly 25)
4165 unify_search_bound = 60 (formerly 30)
4167 * Different bookkeeping for code equations (INCOMPATIBILITY):
4169 a) On theory merge, the last set of code equations for a particular
4170 constant is taken (in accordance with the policy applied by other
4171 parts of the code generator framework).
4173 b) Code equations stemming from explicit declarations (e.g. code
4174 attribute) gain priority over default code equations stemming
4175 from definition, primrec, fun etc.
4177 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4179 * Unified theorem tables for both code generators. Thus [code
4180 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4182 * Command 'find_consts' searches for constants based on type and name
4185 find_consts "_ => bool"
4187 By default, matching is against subtypes, but it may be restricted to
4188 the whole type. Searching by name is possible. Multiple queries are
4189 conjunctive and queries may be negated by prefixing them with a
4192 find_consts strict: "_ => bool" name: "Int" -"int => int"
4194 * New 'find_theorems' criterion "solves" matches theorems that
4195 directly solve the current goal (modulo higher-order unification).
4197 * Auto solve feature for main theorem statements: whenever a new goal
4198 is stated, "find_theorems solves" is called; any theorems that could
4199 solve the lemma directly are listed as part of the goal state.
4200 Cf. associated options in Proof General Isabelle settings menu,
4201 enabled by default, with reasonable timeout for pathological cases of
4202 higher-order unification.
4205 *** Document preparation ***
4207 * Antiquotation @{lemma} now imitates a regular terminal proof,
4208 demanding keyword 'by' and supporting the full method expression
4209 syntax just like the Isar command 'by'.
4214 * Integrated main parts of former image HOL-Complex with HOL. Entry
4215 points Main and Complex_Main remain as before.
4217 * Logic image HOL-Plain provides a minimal HOL with the most important
4218 tools available (inductive, datatype, primrec, ...). This facilitates
4219 experimentation and tool development. Note that user applications
4220 (and library theories) should never refer to anything below theory
4223 * Logic image HOL-Main stops at theory Main, and thus facilitates
4224 experimentation due to shorter build times.
4226 * Logic image HOL-NSA contains theories of nonstandard analysis which
4227 were previously part of former HOL-Complex. Entry point Hyperreal
4228 remains valid, but theories formerly using Complex_Main should now use
4229 new entry point Hypercomplex.
4231 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4232 Posix processes. Avoids potentially expensive forking of the ML
4233 process. New thread-based implementation also works on non-Unix
4234 platforms (Cygwin). Provers are no longer hardwired, but defined
4235 within the theory via plain ML wrapper functions. Basic Sledgehammer
4236 commands are covered in the isar-ref manual.
4238 * Wrapper scripts for remote SystemOnTPTP service allows to use
4239 sledgehammer without local ATP installation (Vampire etc.). Other
4240 provers may be included via suitable ML wrappers, see also
4241 src/HOL/ATP_Linkup.thy.
4243 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4246 * The metis method no longer fails because the theorem is too trivial
4247 (contains the empty clause).
4249 * The metis method now fails in the usual manner, rather than raising
4250 an exception, if it determines that it cannot prove the theorem.
4252 * Method "coherent" implements a prover for coherent logic (see also
4253 src/Tools/coherent.ML).
4255 * Constants "undefined" and "default" replace "arbitrary". Usually
4256 "undefined" is the right choice to replace "arbitrary", though
4257 logically there is no difference. INCOMPATIBILITY.
4259 * Command "value" now integrates different evaluation mechanisms. The
4260 result of the first successful evaluation mechanism is printed. In
4261 square brackets a particular named evaluation mechanisms may be
4262 specified (currently, [SML], [code] or [nbe]). See further
4263 src/HOL/ex/Eval_Examples.thy.
4265 * Normalization by evaluation now allows non-leftlinear equations.
4266 Declare with attribute [code nbe].
4268 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4269 as the structured Isar versions "cases" and "induct", cf. the
4270 corresponding "cases" and "induct" attributes. Mutual induction rules
4271 are now presented as a list of individual projections
4272 (e.g. foo_bar.inducts for types foo and bar); the old format with
4273 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4274 rare situations a different rule is selected --- notably nested tuple
4275 elimination instead of former prod.exhaust: use explicit (case_tac t
4276 rule: prod.exhaust) here.
4278 * Attributes "cases", "induct", "coinduct" support "del" option.
4280 * Removed fact "case_split_thm", which duplicates "case_split".
4282 * The option datatype has been moved to a new theory Option. Renamed
4283 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4285 * New predicate "strict_mono" classifies strict functions on partial
4286 orders. With strict functions on linear orders, reasoning about
4287 (in)equalities is facilitated by theorems "strict_mono_eq",
4288 "strict_mono_less_eq" and "strict_mono_less".
4290 * Some set operations are now proper qualified constants with
4291 authentic syntax. INCOMPATIBILITY:
4302 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4305 * Auxiliary class "itself" has disappeared -- classes without any
4306 parameter are treated as expected by the 'class' command.
4308 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4310 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4311 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4313 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4314 method "approximation". It proves formulas on real values by using
4315 interval arithmetic. In the formulas are also the transcendental
4316 functions sin, cos, tan, atan, ln, exp and the constant pi are
4317 allowed. For examples see
4318 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4320 * Theory "Reflection" now resides in HOL/Library.
4322 * Entry point to Word library now simply named "Word".
4325 * Made source layout more coherent with logical distribution
4328 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4329 src/HOL/Library/Code_Message.thy ~> src/HOL/
4330 src/HOL/Library/GCD.thy ~> src/HOL/
4331 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4332 src/HOL/Library/Parity.thy ~> src/HOL/
4333 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4334 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4335 src/HOL/Real/Lubs.thy ~> src/HOL/
4336 src/HOL/Real/PReal.thy ~> src/HOL/
4337 src/HOL/Real/Rational.thy ~> src/HOL/
4338 src/HOL/Real/RComplete.thy ~> src/HOL/
4339 src/HOL/Real/RealDef.thy ~> src/HOL/
4340 src/HOL/Real/RealPow.thy ~> src/HOL/
4341 src/HOL/Real/Real.thy ~> src/HOL/
4342 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4343 src/HOL/Complex/Complex.thy ~> src/HOL/
4344 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4345 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4346 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4347 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4348 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4349 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4350 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4351 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4352 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4353 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4354 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4355 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4356 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4357 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4358 src/HOL/Real/Float ~> src/HOL/Library/
4359 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4360 src/HOL/Real/RealVector.thy ~> src/HOL/
4362 src/HOL/arith_data.ML ~> src/HOL/Tools
4363 src/HOL/hologic.ML ~> src/HOL/Tools
4364 src/HOL/simpdata.ML ~> src/HOL/Tools
4365 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4366 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4367 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4368 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4369 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4370 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4371 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4373 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4374 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4375 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4376 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4377 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4378 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4380 * If methods "eval" and "evaluation" encounter a structured proof
4381 state with !!/==>, only the conclusion is evaluated to True (if
4382 possible), avoiding strange error messages.
4384 * Method "sizechange" automates termination proofs using (a
4385 modification of) the size-change principle. Requires SAT solver. See
4386 src/HOL/ex/Termination.thy for examples.
4388 * Simplifier: simproc for let expressions now unfolds if bound
4389 variable occurs at most once in let expression body. INCOMPATIBILITY.
4391 * Method "arith": Linear arithmetic now ignores all inequalities when
4392 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4394 * New attribute "arith" for facts that should always be used
4395 automatically by arithmetic. It is intended to be used locally in
4398 assumes [arith]: "x > 0"
4400 Global usage is discouraged because of possible performance impact.
4402 * New classes "top" and "bot" with corresponding operations "top" and
4403 "bot" in theory Orderings; instantiation of class "complete_lattice"
4404 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4406 * Changed definition lemma "less_fun_def" in order to provide an
4407 instance for preorders on functions; use lemma "less_le" instead.
4410 * Theory Orderings: class "wellorder" moved here, with explicit
4411 induction rule "less_induct" as assumption. For instantiation of
4412 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4415 * Theory Orderings: added class "preorder" as superclass of "order".
4416 INCOMPATIBILITY: Instantiation proofs for order, linorder
4417 etc. slightly changed. Some theorems named order_class.* now named
4420 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4423 * Theory Finite_Set: added a new fold combinator of type
4425 ('a => 'b => 'b) => 'b => 'a set => 'b
4427 Occasionally this is more convenient than the old fold combinator
4428 which is now defined in terms of the new one and renamed to
4431 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4432 and "ring_simps" have been replaced by "algebra_simps" (which can be
4433 extended with further lemmas!). At the moment both still exist but
4434 the former will disappear at some point.
4436 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4437 class recpower. Type-specific simp rules for various recpower types
4438 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4440 rat_power_0 -> power_0
4441 rat_power_Suc -> power_Suc
4442 realpow_0 -> power_0
4443 realpow_Suc -> power_Suc
4444 complexpow_0 -> power_0
4445 complexpow_Suc -> power_Suc
4446 power_poly_0 -> power_0
4447 power_poly_Suc -> power_Suc
4449 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4450 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4451 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4452 of lemmas from Divides has been generalized from nat to class
4453 semiring_div. INCOMPATIBILITY. This involves the following theorem
4454 renames resulting from duplicate elimination:
4456 dvd_def_mod ~> dvd_eq_mod_eq_0
4457 zero_dvd_iff ~> dvd_0_left_iff
4458 dvd_0 ~> dvd_0_right
4459 DIVISION_BY_ZERO_DIV ~> div_by_0
4460 DIVISION_BY_ZERO_MOD ~> mod_by_0
4461 mult_div ~> div_mult_self2_is_id
4462 mult_mod ~> mod_mult_self2_is_0
4464 * Theory IntDiv: removed many lemmas that are instances of class-based
4465 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4466 rename old lemmas as follows:
4468 dvd_diff -> nat_dvd_diff
4469 dvd_zminus_iff -> dvd_minus_iff
4470 mod_add1_eq -> mod_add_eq
4471 mod_mult1_eq -> mod_mult_right_eq
4472 mod_mult1_eq' -> mod_mult_left_eq
4473 mod_mult_distrib_mod -> mod_mult_eq
4474 nat_mod_add_left_eq -> mod_add_left_eq
4475 nat_mod_add_right_eq -> mod_add_right_eq
4476 nat_mod_div_trivial -> mod_div_trivial
4477 nat_mod_mod_trivial -> mod_mod_trivial
4478 zdiv_zadd_self1 -> div_add_self1
4479 zdiv_zadd_self2 -> div_add_self2
4480 zdiv_zmult_self1 -> div_mult_self2_is_id
4481 zdiv_zmult_self2 -> div_mult_self1_is_id
4482 zdvd_triv_left -> dvd_triv_left
4483 zdvd_triv_right -> dvd_triv_right
4484 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4485 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4486 zmod_zadd_left_eq -> mod_add_left_eq
4487 zmod_zadd_right_eq -> mod_add_right_eq
4488 zmod_zadd_self1 -> mod_add_self1
4489 zmod_zadd_self2 -> mod_add_self2
4490 zmod_zadd1_eq -> mod_add_eq
4491 zmod_zdiff1_eq -> mod_diff_eq
4492 zmod_zdvd_zmod -> mod_mod_cancel
4493 zmod_zmod_cancel -> mod_mod_cancel
4494 zmod_zmult_self1 -> mod_mult_self2_is_0
4495 zmod_zmult_self2 -> mod_mult_self1_is_0
4498 zdvd_abs1 -> abs_dvd_iff
4499 zdvd_abs2 -> dvd_abs_iff
4500 zdvd_refl -> dvd_refl
4501 zdvd_trans -> dvd_trans
4502 zdvd_zadd -> dvd_add
4503 zdvd_zdiff -> dvd_diff
4504 zdvd_zminus_iff -> dvd_minus_iff
4505 zdvd_zminus2_iff -> minus_dvd_iff
4506 zdvd_zmultD -> dvd_mult_right
4507 zdvd_zmultD2 -> dvd_mult_left
4508 zdvd_zmult_mono -> mult_dvd_mono
4509 zdvd_0_right -> dvd_0_right
4510 zdvd_0_left -> dvd_0_left_iff
4511 zdvd_1_left -> one_dvd
4512 zminus_dvd_iff -> minus_dvd_iff
4514 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4516 * The real numbers offer decimal input syntax: 12.34 is translated
4517 into 1234/10^2. This translation is not reversed upon output.
4519 * Theory Library/Polynomial defines an abstract type 'a poly of
4520 univariate polynomials with coefficients of type 'a. In addition to
4521 the standard ring operations, it also supports div and mod. Code
4522 generation is also supported, using list-style constructors.
4524 * Theory Library/Inner_Product defines a class of real_inner for real
4525 inner product spaces, with an overloaded operation inner :: 'a => 'a
4526 => real. Class real_inner is a subclass of real_normed_vector from
4529 * Theory Library/Product_Vector provides instances for the product
4530 type 'a * 'b of several classes from RealVector and Inner_Product.
4531 Definitions of addition, subtraction, scalar multiplication, norms,
4532 and inner products are included.
4534 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4535 addition to the field operations, numerals and case syntax are also
4538 * Theory Library/Diagonalize provides constructive version of Cantor's
4539 first diagonalization argument.
4541 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4542 zlcm (for int); carried together from various gcd/lcm developements in
4543 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4544 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4545 may recover tupled syntax as follows:
4547 hide (open) const gcd
4548 abbreviation gcd where
4549 "gcd == (%(a, b). GCD.gcd a b)"
4551 GCD.gcd ("gcd '(_, _')")
4553 The same works for lcm, zgcd, zlcm.
4555 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4556 instantiations for algebraic structures. Removed some duplicate
4557 theorems. Changes in simp rules. INCOMPATIBILITY.
4559 * ML antiquotation @{code} takes a constant as argument and generates
4560 corresponding code in background and inserts name of the corresponding
4561 resulting ML value/function/datatype constructor binding in place.
4562 All occurrences of @{code} with a single ML block are generated
4563 simultaneously. Provides a generic and safe interface for
4564 instrumentalizing code generation. See
4565 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4566 In future you ought to refrain from ad-hoc compiling generated SML
4567 code on the ML toplevel. Note that (for technical reasons) @{code}
4568 cannot refer to constants for which user-defined serializations are
4569 set. Refer to the corresponding ML counterpart directly in that
4572 * Command 'rep_datatype': instead of theorem names the command now
4573 takes a list of terms denoting the constructors of the type to be
4574 represented as datatype. The characteristic theorems have to be
4575 proven. INCOMPATIBILITY. Also observe that the following theorems
4576 have disappeared in favour of existing ones:
4578 unit_induct ~> unit.induct
4579 prod_induct ~> prod.induct
4580 sum_induct ~> sum.induct
4581 Suc_Suc_eq ~> nat.inject
4582 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4587 * New locales for orders and lattices where the equivalence relation
4588 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4589 locales use a record structure with field eq for the equivalence.
4591 * New theory of factorial domains.
4593 * Units_l_inv and Units_r_inv are now simp rules by default.
4594 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4595 and/or r_inv will now also require deletion of these lemmas.
4597 * Renamed the following theorems, INCOMPATIBILITY:
4599 UpperD ~> Upper_memD
4600 LowerD ~> Lower_memD
4601 least_carrier ~> least_closed
4602 greatest_carrier ~> greatest_closed
4603 greatest_Lower_above ~> greatest_Lower_below
4604 one_zero ~> carrier_one_zero
4605 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4610 * Nominal datatypes can now contain type-variables.
4612 * Commands 'nominal_inductive' and 'equivariance' work with local
4615 * Nominal primrec can now works with local theory targets and its
4616 specification syntax now conforms to the general format as seen in
4619 * Method "perm_simp" honours the standard simplifier attributes
4620 (no_asm), (no_asm_use) etc.
4622 * The new predicate #* is defined like freshness, except that on the
4623 left hand side can be a set or list of atoms.
4625 * Experimental command 'nominal_inductive2' derives strong induction
4626 principles for inductive definitions. In contrast to
4627 'nominal_inductive', which can only deal with a fixed number of
4628 binders, it can deal with arbitrary expressions standing for sets of
4629 atoms to be avoided. The only inductive definition we have at the
4630 moment that needs this generalisation is the typing rule for Lets in
4633 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4634 -----------------------------------------------------------------
4635 Gamma |- Let x be t1 in t2 : T2
4637 In this rule one wants to avoid all the binders that are introduced by
4638 "close Gamma T1". We are looking for other examples where this
4639 feature might be useful. Please let us know.
4644 * Reimplemented the simplification procedure for proving continuity
4645 subgoals. The new simproc is extensible; users can declare additional
4646 continuity introduction rules with the attribute [cont2cont].
4648 * The continuity simproc now uses a different introduction rule for
4649 solving continuity subgoals on terms with lambda abstractions. In
4650 some rare cases the new simproc may fail to solve subgoals that the
4651 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4652 Potential INCOMPATIBILITY.
4654 * Command 'fixrec': specification syntax now conforms to the general
4655 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4656 examples. INCOMPATIBILITY.
4661 * Proof of Zorn's Lemma for partial orders.
4666 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4667 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4668 depends on multithreading, so timouts will not work before Poly/ML
4671 * High-level support for concurrent ML programming, see
4672 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4673 particularly convenient to organize independent functional
4674 computations. The concept of "synchronized variables" provides a
4675 higher-order interface for components with shared state, avoiding the
4676 delicate details of mutexes and condition variables. (Requires
4677 Poly/ML 5.2.1 or later.)
4679 * ML bindings produced via Isar commands are stored within the Isar
4680 context (theory or proof). Consequently, commands like 'use' and 'ML'
4681 become thread-safe and work with undo as expected (concerning
4682 top-level bindings, not side-effects on global references).
4683 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4684 compiler at runtime; really global bindings need to be given outside a
4685 theory. (Requires Poly/ML 5.2 or later.)
4687 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4688 context. Top-level ML bindings are stored within the proof context in
4689 a purely sequential fashion, disregarding the nested proof structure.
4690 ML bindings introduced by 'ML_prf' are discarded at the end of the
4691 proof. (Requires Poly/ML 5.2 or later.)
4693 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4694 and Method.setup, as well as Isar commands 'attribute_setup' and
4695 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4696 existing code accordingly, or use plain 'setup' together with old
4699 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4700 to 'a -> thm, while results are always tagged with an authentic oracle
4701 name. The Isar command 'oracle' is now polymorphic, no argument type
4702 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4703 accordingly. Note that extra performance may be gained by producing
4704 the cterm carefully, avoiding slow Thm.cterm_of.
4706 * Simplified interface for defining document antiquotations via
4707 ThyOutput.antiquotation, ThyOutput.output, and optionally
4708 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4709 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4712 * More systematic treatment of long names, abstract name bindings, and
4713 name space operations. Basic operations on qualified names have been
4714 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4715 Long_Name.append. Old type bstring has been mostly replaced by
4716 abstract type binding (see structure Binding), which supports precise
4717 qualification by packages and local theory targets, as well as proper
4718 tracking of source positions. INCOMPATIBILITY, need to wrap old
4719 bstring values into Binding.name, or better pass through abstract
4720 bindings everywhere. See further src/Pure/General/long_name.ML,
4721 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4723 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4724 LocalTheory.note etc.) now refer to the *full* internal name, not the
4725 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4727 * Disposed old type and term read functions (Sign.read_def_typ,
4728 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4729 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4730 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4731 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4732 resort for legacy applications.
4734 * Disposed old declarations, tactics, tactic combinators that refer to
4735 the simpset or claset of an implicit theory (such as Addsimps,
4736 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4737 embedded ML text, or local_simpset_of with a proper context passed as
4738 explicit runtime argument.
4740 * Rules and tactics that read instantiations (read_instantiate,
4741 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4742 context, which is required for parsing and type-checking. Moreover,
4743 the variables are specified as plain indexnames, not string encodings
4744 thereof. INCOMPATIBILITY.
4746 * Generic Toplevel.add_hook interface allows to analyze the result of
4747 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4748 for theorem dependency output of transactions resulting in a new
4751 * ML antiquotations: block-structured compilation context indicated by
4752 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4754 @{binding name} - basic name binding
4755 @{let ?pat = term} - term abbreviation (HO matching)
4756 @{note name = fact} - fact abbreviation
4757 @{thm fact} - singleton fact (with attributes)
4758 @{thms fact} - general fact (with attributes)
4759 @{lemma prop by method} - singleton goal
4760 @{lemma prop by meth1 meth2} - singleton goal
4761 @{lemma prop1 ... propN by method} - general goal
4762 @{lemma prop1 ... propN by meth1 meth2} - general goal
4763 @{lemma (open) ...} - open derivation
4768 * The Isabelle "emacs" tool provides a specific interface to invoke
4769 Proof General / Emacs, with more explicit failure if that is not
4770 installed (the old isabelle-interface script silently falls back on
4771 isabelle-process). The PROOFGENERAL_HOME setting determines the
4772 installation location of the Proof General distribution.
4774 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4775 the Isabelle process into a JVM/Scala application. See
4776 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4777 process wrapper has been discontinued.)
4779 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4781 * Various status messages (with exact source position information) are
4782 emitted, if proper markup print mode is enabled. This allows
4783 user-interface components to provide detailed feedback on internal
4788 New in Isabelle2008 (June 2008)
4789 -------------------------------
4793 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4794 and updated, with formally checked references as hyperlinks.
4796 * Theory loader: use_thy (and similar operations) no longer set the
4797 implicit ML context, which was occasionally hard to predict and in
4798 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4799 provides a proper context already.
4801 * Theory loader: old-style ML proof scripts being *attached* to a thy
4802 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4803 'use' within a theory file will do the job.
4805 * Name space merge now observes canonical order, i.e. the second space
4806 is inserted into the first one, while existing entries in the first
4807 space take precedence. INCOMPATIBILITY in rare situations, may try to
4808 swap theory imports.
4810 * Syntax: symbol \<chi> is now considered a letter. Potential
4811 INCOMPATIBILITY in identifier syntax etc.
4813 * Outer syntax: string tokens no longer admit escaped white space,
4814 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4815 white space without escapes.
4817 * Outer syntax: string tokens may contain arbitrary character codes
4818 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4824 * Context-dependent token translations. Default setup reverts locally
4825 fixed variables, and adds hilite markup for undeclared frees.
4827 * Unused theorems can be found using the new command 'unused_thms'.
4828 There are three ways of invoking it:
4831 Only finds unused theorems in the current theory.
4833 (2) unused_thms thy_1 ... thy_n -
4834 Finds unused theorems in the current theory and all of its ancestors,
4835 excluding the theories thy_1 ... thy_n and all of their ancestors.
4837 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4838 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4839 their ancestors, excluding the theories thy_1 ... thy_n and all of
4842 In order to increase the readability of the list produced by
4843 unused_thms, theorems that have been created by a particular instance
4844 of a theory command such as 'inductive' or 'function' are considered
4845 to belong to the same "group", meaning that if at least one theorem in
4846 this group is used, the other theorems in the same group are no longer
4847 reported as unused. Moreover, if all theorems in the group are
4848 unused, only one theorem in the group is displayed.
4850 Note that proof objects have to be switched on in order for
4851 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4852 usually the case when using Proof General with the default settings).
4854 * Authentic naming of facts disallows ad-hoc overwriting of previous
4855 theorems within the same name space. INCOMPATIBILITY, need to remove
4856 duplicate fact bindings, or even accidental fact duplications. Note
4857 that tools may maintain dynamically scoped facts systematically, using
4858 PureThy.add_thms_dynamic.
4860 * Command 'hide' now allows to hide from "fact" name space as well.
4862 * Eliminated destructive theorem database, simpset, claset, and
4863 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4864 update of theories within ML code.
4866 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4867 INCOMPATIBILITY, object-logics depending on former Pure require
4868 additional setup PureThy.old_appl_syntax_setup; object-logics
4869 depending on former CPure need to refer to Pure.
4871 * Commands 'use' and 'ML' are now purely functional, operating on
4872 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4873 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4876 * Command 'setup': discontinued implicit version with ML reference.
4878 * Instantiation target allows for simultaneous specification of class
4879 instance operations together with an instantiation proof.
4880 Type-checking phase allows to refer to class operations uniformly.
4881 See src/HOL/Complex/Complex.thy for an Isar example and
4882 src/HOL/Library/Eval.thy for an ML example.
4884 * Indexing of literal facts: be more serious about including only
4885 facts from the visible specification/proof context, but not the
4886 background context (locale etc.). Affects `prop` notation and method
4887 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4890 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4891 "(open)" option, which used to expose internal bound variables to the
4894 * Isar statements: removed obsolete case "rule_context".
4895 INCOMPATIBILITY, better use explicit fixes/assumes.
4897 * Locale proofs: default proof step now includes 'unfold_locales';
4898 hence 'proof' without argument may be used to unfold locale
4902 *** Document preparation ***
4904 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4905 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4906 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4907 spot); renamed link color from "darkblue" to "linkcolor" (default
4908 value unchanged, can be redefined via \definecolor); no longer sets
4909 "a4paper" option (unnecessary or even intrusive).
4911 * Antiquotation @{lemma A method} proves proposition A by the given
4912 method (either a method name or a method name plus (optional) method
4913 arguments in parentheses) and prints A just like @{prop A}.
4918 * New primrec package. Specification syntax conforms in style to
4919 definition/function/.... No separate induction rule is provided. The
4920 "primrec" command distinguishes old-style and new-style specifications
4921 by syntax. The former primrec package is now named OldPrimrecPackage.
4922 When adjusting theories, beware: constants stemming from new-style
4923 primrec specifications have authentic syntax.
4925 * Metis prover is now an order of magnitude faster, and also works
4926 with multithreading.
4928 * Metis: the maximum number of clauses that can be produced from a
4929 theorem is now given by the attribute max_clauses. Theorems that
4930 exceed this number are ignored, with a warning printed.
4932 * Sledgehammer no longer produces structured proofs by default. To
4933 enable, declare [[sledgehammer_full = true]]. Attributes
4934 reconstruction_modulus, reconstruction_sorts renamed
4935 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4937 * Method "induct_scheme" derives user-specified induction rules
4938 from well-founded induction and completeness of patterns. This factors
4939 out some operations that are done internally by the function package
4940 and makes them available separately. See
4941 src/HOL/ex/Induction_Scheme.thy for examples.
4943 * More flexible generation of measure functions for termination
4944 proofs: Measure functions can be declared by proving a rule of the
4945 form "is_measure f" and giving it the [measure_function] attribute.
4946 The "is_measure" predicate is logically meaningless (always true), and
4947 just guides the heuristic. To find suitable measure functions, the
4948 termination prover sets up the goal "is_measure ?f" of the appropriate
4949 type and generates all solutions by prolog-style backwards proof using
4952 This setup also deals with rules like
4954 "is_measure f ==> is_measure (list_size f)"
4956 which accommodates nested datatypes that recurse through lists.
4957 Similar rules are predeclared for products and option types.
4959 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4963 - Definitions of overloaded constants on sets have to be replaced by
4964 definitions on => and bool.
4966 - Some definitions of overloaded operators on sets can now be proved
4967 using the definitions of the operators on => and bool. Therefore,
4968 the following theorems have been renamed:
4970 subset_def -> subset_eq
4971 psubset_def -> psubset_eq
4972 set_diff_def -> set_diff_eq
4973 Compl_def -> Compl_eq
4974 Sup_set_def -> Sup_set_eq
4975 Inf_set_def -> Inf_set_eq
4976 sup_set_def -> sup_set_eq
4977 inf_set_def -> inf_set_eq
4979 - Due to the incompleteness of the HO unification algorithm, some
4980 rules such as subst may require manual instantiation, if some of
4981 the unknowns in the rule is a set.
4983 - Higher order unification and forward proofs:
4986 have "P (S::'a set)" <...>
4987 then have "EX S. P S" ..
4989 no longer works (due to the incompleteness of the HO unification
4990 algorithm) and must be replaced by the pattern
4997 - Calculational reasoning with subst (or similar rules):
5000 have "P (S::'a set)" <...>
5001 also have "S = T" <...>
5002 finally have "P T" .
5004 no longer works (for similar reasons as the previous example) and
5005 must be replaced by something like
5007 have "P (S::'a set)" <...>
5008 moreover have "S = T" <...>
5009 ultimately have "P T" by simp
5011 - Tactics or packages written in ML code:
5012 Code performing pattern matching on types via
5014 Type ("set", [T]) => ...
5016 must be rewritten. Moreover, functions like strip_type or
5017 binder_types no longer return the right value when applied to a
5020 T1 => ... => Tn => U => bool
5024 T1 => ... => Tn => U set
5026 * Merged theories Wellfounded_Recursion, Accessible_Part and
5027 Wellfounded_Relations to theory Wellfounded.
5029 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5031 * Class finite no longer treats UNIV as class parameter. Use class
5032 enum from theory Library/Enum instead to achieve a similar effect.
5035 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5036 and "Cons". INCOMPATIBILITY.
5038 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5039 Potential INCOMPATIBILITY.
5041 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5042 injective_fst_snd removed, use split_eta and prod_eqI instead.
5043 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5045 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5046 the same name in theory Orderings:
5056 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5057 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5058 and different variable names.
5060 * Library/Option_ord.thy: Canonical order on option type.
5062 * Library/RBT.thy: Red-black trees, an efficient implementation of
5065 * Library/Countable.thy: Type class for countable types.
5067 * Theory Int: The representation of numerals has changed. The infix
5068 operator BIT and the bit datatype with constructors B0 and B1 have
5069 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5070 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5071 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5074 * Theory Nat: definition of <= and < on natural numbers no longer
5075 depend on well-founded relations. INCOMPATIBILITY. Definitions
5076 le_def and less_def have disappeared. Consider lemmas not_less
5077 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5079 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5080 (whose purpose mainly is for various fold_set functionals) have been
5081 abandoned in favor of the existing algebraic classes
5082 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5083 lower_semilattice (resp. upper_semilattice) and linorder.
5086 * Theory Transitive_Closure: induct and cases rules now declare proper
5087 case_names ("base" and "step"). INCOMPATIBILITY.
5089 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5090 lattices. The form set-specific version is available as
5091 Inductive.lfp_ordinal_induct_set.
5093 * Renamed theorems "power.simps" to "power_int.simps".
5096 * Class semiring_div provides basic abstract properties of semirings
5097 with division and modulo operations. Subsumes former class dvd_mod.
5099 * Merged theories IntDef, Numeral and IntArith into unified theory
5100 Int. INCOMPATIBILITY.
5102 * Theory Library/Code_Index: type "index" now represents natural
5103 numbers rather than integers. INCOMPATIBILITY.
5105 * New class "uminus" with operation "uminus" (split of from class
5106 "minus" which now only has operation "minus", binary).
5109 * Constants "card", "internal_split", "option_map" now with authentic
5110 syntax. INCOMPATIBILITY.
5112 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5113 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5114 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5115 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5116 Sup_set_def, le_def, less_def, option_map_def now with object
5117 equality. INCOMPATIBILITY.
5119 * Records. Removed K_record, and replaced it by pure lambda term
5120 %x. c. The simplifier setup is now more robust against eta expansion.
5121 INCOMPATIBILITY: in cases explicitly referring to K_record.
5123 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5125 * Library/ListVector: new theory of arithmetic vector operations.
5127 * Library/Order_Relation: new theory of various orderings as sets of
5128 pairs. Defines preorders, partial orders, linear orders and
5129 well-orders on sets and on types.
5134 * Renamed some theories to allow to loading both ZF and HOL in the
5137 Datatype -> Datatype_ZF
5138 Inductive -> Inductive_ZF
5145 INCOMPATIBILITY: ZF theories that import individual theories below
5146 Main might need to be adapted. Regular theory Main is still
5147 available, as trivial extension of Main_ZF.
5152 * ML within Isar: antiquotation @{const name} or @{const
5153 name(typargs)} produces statically-checked Const term.
5155 * Functor NamedThmsFun: data is available to the user as dynamic fact
5156 (of the same name). Removed obsolete print command.
5158 * Removed obsolete "use_legacy_bindings" function.
5160 * The ``print mode'' is now a thread-local value derived from a global
5161 template (the former print_mode reference), thus access becomes
5162 non-critical. The global print_mode reference is for session
5163 management only; user-code should use print_mode_value,
5164 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5166 * Functions system/system_out provide a robust way to invoke external
5167 shell commands, with propagation of interrupts (requires Poly/ML
5168 5.2.1). Do not use OS.Process.system etc. from the basis library!
5173 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5174 in accordance with Proof General 3.7, which prefers GNU emacs.
5176 * isatool tty runs Isabelle process with plain tty interaction;
5177 optional line editor may be specified via ISABELLE_LINE_EDITOR
5178 setting, the default settings attempt to locate "ledit" and "rlwrap".
5180 * isatool browser now works with Cygwin as well, using general
5181 "javapath" function defined in Isabelle process environment.
5183 * YXML notation provides a simple and efficient alternative to
5184 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5185 isatool yxml as described in the Isabelle system manual.
5187 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5188 provides general wrapper for managing an Isabelle process in a robust
5189 fashion, with ``cooked'' output from stdin/stderr.
5191 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5192 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5194 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5195 way of changing the user's settings is via
5196 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5199 * Multithreading.max_threads := 0 refers to the number of actual CPU
5200 cores of the underlying machine, which is a good starting point for
5201 optimal performance tuning. The corresponding usedir option -M allows
5202 "max" as an alias for "0". WARNING: does not work on certain versions
5203 of Mac OS (with Poly/ML 5.1).
5205 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5206 adverse effect of Isabelle flooding interactive front-ends (notably
5207 ProofGeneral / XEmacs).
5211 New in Isabelle2007 (November 2007)
5212 -----------------------------------
5216 * More uniform information about legacy features, notably a
5217 warning/error of "Legacy feature: ...", depending on the state of the
5218 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5219 legacy features will disappear eventually.
5221 * Theory syntax: the header format ``theory A = B + C:'' has been
5222 discontinued in favour of ``theory A imports B C begin''. Use isatool
5223 fixheaders to convert existing theory files. INCOMPATIBILITY.
5225 * Theory syntax: the old non-Isar theory file format has been
5226 discontinued altogether. Note that ML proof scripts may still be used
5227 with Isar theories; migration is usually quite simple with the ML
5228 function use_legacy_bindings. INCOMPATIBILITY.
5230 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5231 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5234 * Theory loader: be more serious about observing the static theory
5235 header specifications (including optional directories), but not the
5236 accidental file locations of previously successful loads. The strict
5237 update policy of former update_thy is now already performed by
5238 use_thy, so the former has been removed; use_thys updates several
5239 theories simultaneously, just as 'imports' within a theory header
5240 specification, but without merging the results. Potential
5241 INCOMPATIBILITY: may need to refine theory headers and commands
5242 ROOT.ML which depend on load order.
5244 * Theory loader: optional support for content-based file
5245 identification, instead of the traditional scheme of full physical
5246 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5247 (cf. the system manual). The new scheme allows to work with
5248 non-finished theories in persistent session images, such that source
5249 files may be moved later on without requiring reloads.
5251 * Theory loader: old-style ML proof scripts being *attached* to a thy
5252 file (with the same base name as the theory) are considered a legacy
5253 feature, which will disappear eventually. Even now, the theory loader
5254 no longer maintains dependencies on such files.
5256 * Syntax: the scope for resolving ambiguities via type-inference is
5257 now limited to individual terms, instead of whole simultaneous
5258 specifications as before. This greatly reduces the complexity of the
5259 syntax module and improves flexibility by separating parsing and
5260 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5261 'fixes' etc.) are required in rare situations.
5263 * Syntax: constants introduced by new-style packages ('definition',
5264 'abbreviation' etc.) are passed through the syntax module in
5265 ``authentic mode''. This means that associated mixfix annotations
5266 really stick to such constants, independently of potential name space
5267 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5268 trees are represented slightly differently, may need to adapt syntax
5269 translations accordingly. Use CONST marker in 'translations' and
5270 @{const_syntax} antiquotation in 'parse_translation' etc.
5272 * Legacy goal package: reduced interface to the bare minimum required
5273 to keep existing proof scripts running. Most other user-level
5274 functions are now part of the OldGoals structure, which is *not* open
5275 by default (consider isatool expandshort before open OldGoals).
5276 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5277 these tend to cause confusion about the actual goal (!) context being
5278 used here, which is not necessarily the same as the_context().
5280 * Command 'find_theorems': supports "*" wild-card in "name:"
5281 criterion; "with_dups" option. Certain ProofGeneral versions might
5282 support a specific search form (see ProofGeneral/CHANGES).
5284 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5285 by default, which means that "prems" (and also "fixed variables") are
5286 suppressed from proof state output. Note that the ProofGeneral
5287 settings mechanism allows to change and save options persistently, but
5288 older versions of Isabelle will fail to start up if a negative prems
5291 * Local theory targets may be specified by non-nested blocks of
5292 ``context/locale/class ... begin'' followed by ``end''. The body may
5293 contain definitions, theorems etc., including any derived mechanism
5294 that has been implemented on top of these primitives. This concept
5295 generalizes the existing ``theorem (in ...)'' towards more versatility
5298 * Proof General interface: proper undo of final 'end' command;
5299 discontinued Isabelle/classic mode (ML proof scripts).
5302 *** Document preparation ***
5304 * Added antiquotation @{theory name} which prints the given name,
5305 after checking that it refers to a valid ancestor theory in the
5308 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5309 check the given source text as ML type/structure, printing verbatim.
5311 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5312 "c args == rhs" given in the current context. (Any number of
5313 arguments may be given on the LHS.)
5318 * The 'class' package offers a combination of axclass and locale to
5319 achieve Haskell-like type classes in Isabelle. Definitions and
5320 theorems within a class context produce both relative results (with
5321 implicit parameters according to the locale context), and polymorphic
5322 constants with qualified polymorphism (according to the class
5323 context). Within the body context of a 'class' target, a separate
5324 syntax layer ("user space type system") takes care of converting
5325 between global polymorphic consts and internal locale representation.
5326 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5327 "isatool doc classes" provides a tutorial.
5329 * Generic code generator framework allows to generate executable
5330 code for ML and Haskell (including Isabelle classes). A short usage
5333 internal compilation:
5334 export_code <list of constants (term syntax)> in SML
5335 writing SML code to a file:
5336 export_code <list of constants (term syntax)> in SML <filename>
5337 writing OCaml code to a file:
5338 export_code <list of constants (term syntax)> in OCaml <filename>
5339 writing Haskell code to a bunch of files:
5340 export_code <list of constants (term syntax)> in Haskell <filename>
5342 evaluating closed propositions to True/False using code generation:
5345 Reasonable default setup of framework in HOL.
5347 Theorem attributs for selecting and transforming function equations theorems:
5349 [code fun]: select a theorem as function equation for a specific constant
5350 [code fun del]: deselect a theorem as function equation for a specific constant
5351 [code inline]: select an equation theorem for unfolding (inlining) in place
5352 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5354 User-defined serializations (target in {SML, OCaml, Haskell}):
5356 code_const <and-list of constants (term syntax)>
5357 {(target) <and-list of const target syntax>}+
5359 code_type <and-list of type constructors>
5360 {(target) <and-list of type target syntax>}+
5362 code_instance <and-list of instances>
5364 where instance ::= <type constructor> :: <class>
5366 code_class <and_list of classes>
5367 {(target) <and-list of class target syntax>}+
5368 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5370 code_instance and code_class only are effective to target Haskell.
5372 For example usage see src/HOL/ex/Codegenerator.thy and
5373 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5374 generation from Isabelle/HOL theories is available via "isatool doc
5377 * Code generator: consts in 'consts_code' Isar commands are now
5378 referred to by usual term syntax (including optional type
5381 * Command 'no_translations' removes translation rules from theory
5384 * Overloaded definitions are now actually checked for acyclic
5385 dependencies. The overloading scheme is slightly more general than
5386 that of Haskell98, although Isabelle does not demand an exact
5387 correspondence to type class and instance declarations.
5388 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5389 exotic versions of overloading -- at the discretion of the user!
5391 Polymorphic constants are represented via type arguments, i.e. the
5392 instantiation that matches an instance against the most general
5393 declaration given in the signature. For example, with the declaration
5394 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5395 as c(nat). Overloading is essentially simultaneous structural
5396 recursion over such type arguments. Incomplete specification patterns
5397 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5398 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5399 Command 'print_theory' outputs the normalized system of recursive
5400 equations, see section "definitions".
5402 * Configuration options are maintained within the theory or proof
5403 context (with name and type bool/int/string), providing a very simple
5404 interface to a poor-man's version of general context data. Tools may
5405 declare options in ML (e.g. using Attrib.config_int) and then refer to
5406 these values using Config.get etc. Users may change options via an
5407 associated attribute of the same name. This form of context
5408 declaration works particularly well with commands 'declare' or
5409 'using', for example ``declare [[foo = 42]]''. Thus it has become
5410 very easy to avoid global references, which would not observe Isar
5411 toplevel undo/redo and fail to work with multithreading.
5413 Various global ML references of Pure and HOL have been turned into
5414 configuration options:
5416 Unify.search_bound unify_search_bound
5417 Unify.trace_bound unify_trace_bound
5418 Unify.trace_simp unify_trace_simp
5419 Unify.trace_types unify_trace_types
5420 Simplifier.simp_depth_limit simp_depth_limit
5421 Blast.depth_limit blast_depth_limit
5422 DatatypeProp.dtK datatype_distinctness_limit
5423 fast_arith_neq_limit fast_arith_neq_limit
5424 fast_arith_split_limit fast_arith_split_limit
5426 * Named collections of theorems may be easily installed as context
5427 data using the functor NamedThmsFun (see also
5428 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5429 attributes; there is also a toplevel print command. This facility is
5430 just a common case of general context data, which is the preferred way
5431 for anything more complex than just a list of facts in canonical
5434 * Isar: command 'declaration' augments a local theory by generic
5435 declaration functions written in ML. This enables arbitrary content
5436 being added to the context, depending on a morphism that tells the
5437 difference of the original declaration context wrt. the application
5438 context encountered later on.
5440 * Isar: proper interfaces for simplification procedures. Command
5441 'simproc_setup' declares named simprocs (with match patterns, and body
5442 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5443 context. ML antiquotation @{simproc name} retrieves named simprocs.
5445 * Isar: an extra pair of brackets around attribute declarations
5446 abbreviates a theorem reference involving an internal dummy fact,
5447 which will be ignored later --- only the effect of the attribute on
5448 the background context will persist. This form of in-place
5449 declarations is particularly useful with commands like 'declare' and
5450 'using', for example ``have A using [[simproc a]] by simp''.
5452 * Isar: method "assumption" (and implicit closing of subproofs) now
5453 takes simple non-atomic goal assumptions into account: after applying
5454 an assumption as a rule the resulting subgoals are solved by atomic
5455 assumption steps. This is particularly useful to finish 'obtain'
5456 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5457 without referring to the original premise "!!x. P x ==> thesis" in the
5458 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5461 * Isar: implicit use of prems from the Isar proof context is
5462 considered a legacy feature. Common applications like ``have A .''
5463 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5464 referencing facts explicitly here improves readability and
5465 maintainability of proof texts.
5467 * Isar: improper proof element 'guess' is like 'obtain', but derives
5468 the obtained context from the course of reasoning! For example:
5470 assume "EX x y. A x & B y" -- "any previous fact"
5471 then guess x and y by clarify
5473 This technique is potentially adventurous, depending on the facts and
5474 proof tools being involved here.
5476 * Isar: known facts from the proof context may be specified as literal
5477 propositions, using ASCII back-quote syntax. This works wherever
5478 named facts used to be allowed so far, in proof commands, proof
5479 methods, attributes etc. Literal facts are retrieved from the context
5480 according to unification of type and term parameters. For example,
5481 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5482 theorems in the current context, then these are valid literal facts:
5483 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5485 There is also a proof method "fact" which does the same composition
5486 for explicit goal states, e.g. the following proof texts coincide with
5487 certain special cases of literal facts:
5489 have "A" by fact == note `A`
5490 have "A ==> B" by fact == note `A ==> B`
5491 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5492 have "P a ==> Q a" by fact == note `P a ==> Q a`
5494 * Isar: ":" (colon) is no longer a symbolic identifier character in
5495 outer syntax. Thus symbolic identifiers may be used without
5496 additional white space in declarations like this: ``assume *: A''.
5498 * Isar: 'print_facts' prints all local facts of the current context,
5499 both named and unnamed ones.
5501 * Isar: 'def' now admits simultaneous definitions, e.g.:
5503 def x == "t" and y == "u"
5505 * Isar: added command 'unfolding', which is structurally similar to
5506 'using', but affects both the goal state and facts by unfolding given
5507 rewrite rules. Thus many occurrences of the 'unfold' method or
5508 'unfolded' attribute may be replaced by first-class proof text.
5510 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5511 and command 'unfolding' now all support object-level equalities
5512 (potentially conditional). The underlying notion of rewrite rule is
5513 analogous to the 'rule_format' attribute, but *not* that of the
5514 Simplifier (which is usually more generous).
5516 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5517 premises of a theorem by n. Useful in conjunction with drule.
5519 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5520 method expression within a sandbox consisting of the first N
5521 sub-goals, which need to exist. For example, ``simp_all [3]''
5522 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5523 simplifies all new goals that emerge from applying rule foo to the
5524 originally first one.
5526 * Isar: schematic goals are no longer restricted to higher-order
5527 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5530 * Isar: the conclusion of a long theorem statement is now either
5531 'shows' (a simultaneous conjunction, as before), or 'obtains'
5532 (essentially a disjunction of cases with local parameters and
5533 assumptions). The latter allows to express general elimination rules
5534 adequately; in this notation common elimination rules look like this:
5536 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5538 obtains x where "P x"
5540 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5544 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5550 The subsequent classical rules even refer to the formal "thesis"
5553 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5556 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5557 obtains "thesis ==> something"
5559 The actual proof of an 'obtains' statement is analogous to that of the
5560 Isar proof element 'obtain', only that there may be several cases.
5561 Optional case names may be specified in parentheses; these will be
5562 available both in the present proof and as annotations in the
5563 resulting rule, for later use with the 'cases' method (cf. attribute
5566 * Isar: the assumptions of a long theorem statement are available as
5567 "assms" fact in the proof context. This is more appropriate than the
5568 (historical) "prems", which refers to all assumptions of the current
5569 context, including those from the target locale, proof body etc.
5571 * Isar: 'print_statement' prints theorems from the current theory or
5572 proof context in long statement form, according to the syntax of a
5575 * Isar: 'obtain' takes an optional case name for the local context
5576 introduction rule (default "that").
5578 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5579 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5582 * Pure: syntax "CONST name" produces a fully internalized constant
5583 according to the current context. This is particularly useful for
5584 syntax translations that should refer to internal constant
5585 representations independently of name spaces.
5587 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5588 instead of "FOO ". This allows multiple binder declarations to coexist
5589 in the same context. INCOMPATIBILITY.
5591 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5592 primitive that also works in a locale context (both for constants and
5593 fixed variables). Type declaration and internal syntactic representation
5594 of given constants retrieved from the context. Likewise, the
5595 'no_notation' command allows to remove given syntax annotations from the
5598 * Isar/locales: new derived specification elements 'axiomatization',
5599 'definition', 'abbreviation', which support type-inference, admit
5600 object-level specifications (equality, equivalence). See also the
5601 isar-ref manual. Examples:
5604 eq (infix "===" 50) where
5605 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5607 definition "f x y = x + y + 1"
5608 definition g where "g x = f x x"
5611 neq (infix "=!=" 50) where
5612 "x =!= y == ~ (x === y)"
5614 These specifications may be also used in a locale context. Then the
5615 constants being introduced depend on certain fixed parameters, and the
5616 constant name is qualified by the locale base name. An internal
5617 abbreviation takes care for convenient input and output, making the
5618 parameters implicit and using the original short name. See also
5619 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5620 entities from a monomorphic theory.
5622 Presently, abbreviations are only available 'in' a target locale, but
5623 not inherited by general import expressions. Also note that
5624 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5625 'translations' in common applications. The "no_abbrevs" print mode
5626 prevents folding of abbreviations in term output.
5628 Concrete syntax is attached to specified constants in internal form,
5629 independently of name spaces. The parse tree representation is
5630 slightly different -- use 'notation' instead of raw 'syntax', and
5631 'translations' with explicit "CONST" markup to accommodate this.
5633 * Pure/Isar: unified syntax for new-style specification mechanisms
5634 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5635 full type inference and dummy patterns ("_"). For example:
5637 definition "K x _ = x"
5639 inductive conj for A B
5640 where "A ==> B ==> conj A B"
5642 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5643 the current context. Print mode "no_abbrevs" prevents inversion of
5644 abbreviations on output.
5646 * Isar/locales: improved parameter handling: use of locales "var" and
5647 "struct" no longer necessary; - parameter renamings are no longer
5648 required to be injective. For example, this allows to define
5649 endomorphisms as locale endom = homom mult mult h.
5651 * Isar/locales: changed the way locales with predicates are defined.
5652 Instead of accumulating the specification, the imported expression is
5653 now an interpretation. INCOMPATIBILITY: different normal form of
5654 locale expressions. In particular, in interpretations of locales with
5655 predicates, goals repesenting already interpreted fragments are not
5656 removed automatically. Use methods `intro_locales' and
5657 `unfold_locales'; see below.
5659 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5660 provide backward reasoning on locales predicates. The methods are
5661 aware of interpretations and discharge corresponding goals.
5662 `intro_locales' is less aggressive then `unfold_locales' and does not
5663 unfold predicates to assumptions.
5665 * Isar/locales: the order in which locale fragments are accumulated
5666 has changed. This enables to override declarations from fragments due
5667 to interpretations -- for example, unwanted simp rules.
5669 * Isar/locales: interpretation in theories and proof contexts has been
5670 extended. One may now specify (and prove) equations, which are
5671 unfolded in interpreted theorems. This is useful for replacing
5672 defined concepts (constants depending on locale parameters) by
5673 concepts already existing in the target context. Example:
5675 interpretation partial_order ["op <= :: [int, int] => bool"]
5676 where "partial_order.less (op <=) (x::int) y = (x < y)"
5678 Typically, the constant `partial_order.less' is created by a
5679 definition specification element in the context of locale
5682 * Method "induct": improved internal context management to support
5683 local fixes and defines on-the-fly. Thus explicit meta-level
5684 connectives !! and ==> are rarely required anymore in inductive goals
5685 (using object-logic connectives for this purpose has been long
5686 obsolete anyway). Common proof patterns are explained in
5687 src/HOL/Induct/Common_Patterns.thy, see also
5688 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5691 * Method "induct": improved handling of simultaneous goals. Instead of
5692 introducing object-level conjunction, the statement is now split into
5693 several conclusions, while the corresponding symbolic cases are nested
5694 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5695 see src/HOL/Induct/Common_Patterns.thy, for example.
5697 * Method "induct": mutual induction rules are now specified as a list
5698 of rule sharing the same induction cases. HOL packages usually provide
5699 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5700 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5701 mutual induction rules differently, i.e. like this:
5703 (induct rule: foo_bar.inducts)
5704 (induct set: foo bar)
5705 (induct pred: foo bar)
5706 (induct type: foo bar)
5708 The ML function ProjectRule.projections turns old-style rules into the
5711 * Method "coinduct": dual of induction, see
5712 src/HOL/Library/Coinductive_List.thy for various examples.
5714 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5715 considered a legacy feature.
5717 * Attribute "symmetric" produces result with standardized schematic
5718 variables (index 0). Potential INCOMPATIBILITY.
5720 * Simplifier: by default the simplifier trace only shows top level
5721 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5722 default. Thus there is less danger of being flooded by the trace. The
5723 trace indicates where parts have been suppressed.
5725 * Provers/classical: removed obsolete classical version of elim_format
5726 attribute; classical elim/dest rules are now treated uniformly when
5727 manipulating the claset.
5729 * Provers/classical: stricter checks to ensure that supplied intro,
5730 dest and elim rules are well-formed; dest and elim rules must have at
5733 * Provers/classical: attributes dest/elim/intro take an optional
5734 weight argument for the rule (just as the Pure versions). Weights are
5735 ignored by automated tools, but determine the search order of single
5738 * Syntax: input syntax now supports dummy variable binding "%_. b",
5739 where the body does not mention the bound variable. Note that dummy
5740 patterns implicitly depend on their context of bounds, which makes
5741 "{_. _}" match any set comprehension as expected. Potential
5742 INCOMPATIBILITY -- parse translations need to cope with syntactic
5743 constant "_idtdummy" in the binding position.
5745 * Syntax: removed obsolete syntactic constant "_K" and its associated
5746 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5747 for example "A -> B" => "Pi A (%_. B)".
5749 * Pure: 'class_deps' command visualizes the subclass relation, using
5750 the graph browser tool.
5752 * Pure: 'print_theory' now suppresses certain internal declarations by
5753 default; use '!' option for full details.
5758 * Method "metis" proves goals by applying the Metis general-purpose
5759 resolution prover (see also http://gilith.com/software/metis/).
5760 Examples are in the directory MetisExamples. WARNING: the
5761 Isabelle/HOL-Metis integration does not yet work properly with
5764 * Command 'sledgehammer' invokes external automatic theorem provers as
5765 background processes. It generates calls to the "metis" method if
5766 successful. These can be pasted into the proof. Users do not have to
5767 wait for the automatic provers to return. WARNING: does not really
5768 work with multi-threading.
5770 * New "auto_quickcheck" feature tests outermost goal statements for
5771 potential counter-examples. Controlled by ML references
5772 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5773 5000 milliseconds). Fails silently if statements is outside of
5774 executable fragment, or any other codgenerator problem occurs.
5776 * New constant "undefined" with axiom "undefined x = undefined".
5778 * Added class "HOL.eq", allowing for code generation with polymorphic
5781 * Some renaming of class constants due to canonical name prefixing in
5782 the new 'class' package:
5784 HOL.abs ~> HOL.abs_class.abs
5785 HOL.divide ~> HOL.divide_class.divide
5786 0 ~> HOL.zero_class.zero
5787 1 ~> HOL.one_class.one
5788 op + ~> HOL.plus_class.plus
5789 op - ~> HOL.minus_class.minus
5790 uminus ~> HOL.minus_class.uminus
5791 op * ~> HOL.times_class.times
5792 op < ~> HOL.ord_class.less
5793 op <= > HOL.ord_class.less_eq
5794 Nat.power ~> Power.power_class.power
5795 Nat.size ~> Nat.size_class.size
5796 Numeral.number_of ~> Numeral.number_class.number_of
5797 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5798 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5799 Orderings.min ~> Orderings.ord_class.min
5800 Orderings.max ~> Orderings.ord_class.max
5801 Divides.op div ~> Divides.div_class.div
5802 Divides.op mod ~> Divides.div_class.mod
5803 Divides.op dvd ~> Divides.div_class.dvd
5805 INCOMPATIBILITY. Adaptions may be required in the following cases:
5807 a) User-defined constants using any of the names "plus", "minus",
5808 "times", "less" or "less_eq". The standard syntax translations for
5809 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5812 b) Variables named "plus", "minus", "times", "less", "less_eq"
5813 INCOMPATIBILITY: use more specific names.
5815 c) Permutative equations (e.g. "a + b = b + a")
5816 Since the change of names also changes the order of terms, permutative
5817 rewrite rules may get applied in a different order. Experience shows
5818 that this is rarely the case (only two adaptions in the whole Isabelle
5819 distribution). INCOMPATIBILITY: rewrite proofs
5821 d) ML code directly refering to constant names
5822 This in general only affects hand-written proof tactics, simprocs and
5823 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5824 Consider using @{const_name} antiquotation.
5826 * New class "default" with associated constant "default".
5828 * Function "sgn" is now overloaded and available on int, real, complex
5829 (and other numeric types), using class "sgn". Two possible defs of
5830 sgn are given as equational assumptions in the classes sgn_if and
5831 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5834 * Locale "partial_order" now unified with class "order" (cf. theory
5835 Orderings), added parameter "less". INCOMPATIBILITY.
5837 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5838 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5839 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5841 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5842 changed order of proof goals in instance proofs.
5844 * The transitivity reasoner for partial and linear orders is set up
5845 for classes "order" and "linorder". Instances of the reasoner are available
5846 in all contexts importing or interpreting the corresponding locales.
5847 Method "order" invokes the reasoner separately; the reasoner
5848 is also integrated with the Simplifier as a solver. Diagnostic
5849 command 'print_orders' shows the available instances of the reasoner
5850 in the current context.
5852 * Localized monotonicity predicate in theory "Orderings"; integrated
5853 lemmas max_of_mono and min_of_mono with this predicate.
5856 * Formulation of theorem "dense" changed slightly due to integration
5857 with new class dense_linear_order.
5859 * Uniform lattice theory development in HOL.
5861 constants "meet" and "join" now named "inf" and "sup"
5862 constant "Meet" now named "Inf"
5864 classes "meet_semilorder" and "join_semilorder" now named
5865 "lower_semilattice" and "upper_semilattice"
5866 class "lorder" now named "lattice"
5867 class "comp_lat" now named "complete_lattice"
5869 Instantiation of lattice classes allows explicit definitions
5870 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5872 INCOMPATIBILITY. Theorem renames:
5874 meet_left_le ~> inf_le1
5875 meet_right_le ~> inf_le2
5876 join_left_le ~> sup_ge1
5877 join_right_le ~> sup_ge2
5878 meet_join_le ~> inf_sup_ord
5881 le_meet ~> le_inf_iff
5882 le_join ~> ge_sup_conv
5883 meet_idempotent ~> inf_idem
5884 join_idempotent ~> sup_idem
5885 meet_comm ~> inf_commute
5886 join_comm ~> sup_commute
5887 meet_leI1 ~> le_infI1
5888 meet_leI2 ~> le_infI2
5889 le_joinI1 ~> le_supI1
5890 le_joinI2 ~> le_supI2
5891 meet_assoc ~> inf_assoc
5892 join_assoc ~> sup_assoc
5893 meet_left_comm ~> inf_left_commute
5894 meet_left_idempotent ~> inf_left_idem
5895 join_left_comm ~> sup_left_commute
5896 join_left_idempotent ~> sup_left_idem
5899 le_def_meet ~> le_iff_inf
5900 le_def_join ~> le_iff_sup
5901 join_absorp2 ~> sup_absorb2
5902 join_absorp1 ~> sup_absorb1
5903 meet_absorp1 ~> inf_absorb1
5904 meet_absorp2 ~> inf_absorb2
5905 meet_join_absorp ~> inf_sup_absorb
5906 join_meet_absorp ~> sup_inf_absorb
5907 distrib_join_le ~> distrib_sup_le
5908 distrib_meet_le ~> distrib_inf_le
5910 add_meet_distrib_left ~> add_inf_distrib_left
5911 add_join_distrib_left ~> add_sup_distrib_left
5912 is_join_neg_meet ~> is_join_neg_inf
5913 is_meet_neg_join ~> is_meet_neg_sup
5914 add_meet_distrib_right ~> add_inf_distrib_right
5915 add_join_distrib_right ~> add_sup_distrib_right
5916 add_meet_join_distribs ~> add_sup_inf_distribs
5917 join_eq_neg_meet ~> sup_eq_neg_inf
5918 meet_eq_neg_join ~> inf_eq_neg_sup
5919 add_eq_meet_join ~> add_eq_inf_sup
5920 meet_0_imp_0 ~> inf_0_imp_0
5921 join_0_imp_0 ~> sup_0_imp_0
5922 meet_0_eq_0 ~> inf_0_eq_0
5923 join_0_eq_0 ~> sup_0_eq_0
5924 neg_meet_eq_join ~> neg_inf_eq_sup
5925 neg_join_eq_meet ~> neg_sup_eq_inf
5926 join_eq_if ~> sup_eq_if
5928 mono_meet ~> mono_inf
5929 mono_join ~> mono_sup
5930 meet_bool_eq ~> inf_bool_eq
5931 join_bool_eq ~> sup_bool_eq
5932 meet_fun_eq ~> inf_fun_eq
5933 join_fun_eq ~> sup_fun_eq
5934 meet_set_eq ~> inf_set_eq
5935 join_set_eq ~> sup_set_eq
5936 meet1_iff ~> inf1_iff
5937 meet2_iff ~> inf2_iff
5946 join1_iff ~> sup1_iff
5947 join2_iff ~> sup2_iff
5957 is_meet_Meet ~> is_meet_Inf
5958 Meet_bool_def ~> Inf_bool_def
5959 Meet_fun_def ~> Inf_fun_def
5960 Meet_greatest ~> Inf_greatest
5961 Meet_lower ~> Inf_lower
5962 Meet_set_def ~> Inf_set_def
5965 Sup_bool_eq ~> Sup_bool_def
5966 Sup_fun_eq ~> Sup_fun_def
5967 Sup_set_eq ~> Sup_set_def
5969 listsp_meetI ~> listsp_infI
5970 listsp_meet_eq ~> listsp_inf_eq
5975 * Added syntactic class "size"; overloaded constant "size" now has
5976 type "'a::size ==> bool"
5978 * Internal reorganisation of `size' of datatypes: size theorems
5979 "foo.size" are no longer subsumed by "foo.simps" (but are still
5980 simplification rules by default!); theorems "prod.size" now named
5983 * Class "div" now inherits from class "times" rather than "type".
5986 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5987 Linorder etc. have disappeared; operations defined in terms of
5988 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5990 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5992 * HOL-Word: New extensive library and type for generic, fixed size
5993 machine words, with arithmetic, bit-wise, shifting and rotating
5994 operations, reflection into int, nat, and bool lists, automation for
5995 linear arithmetic (by automatic reflection into nat or int), including
5996 lemmas on overflow and monotonicity. Instantiated to all appropriate
5997 arithmetic type classes, supporting automatic simplification of
5998 numerals on all operations.
6000 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6002 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6004 * Code generator library theories:
6005 - Code_Integer represents HOL integers by big integer literals in target
6007 - Code_Char represents HOL characters by character literals in target
6009 - Code_Char_chr like Code_Char, but also offers treatment of character
6010 codes; includes Code_Integer.
6011 - Executable_Set allows to generate code for finite sets using lists.
6012 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6014 - Executable_Real implements a subset of real numbers, namly those
6015 representable by rational numbers.
6016 - Efficient_Nat implements natural numbers by integers, which in general will
6017 result in higher efficency; pattern matching with 0/Suc is eliminated;
6018 includes Code_Integer.
6019 - Code_Index provides an additional datatype index which is mapped to
6020 target-language built-in integers.
6021 - Code_Message provides an additional datatype message_string which is isomorphic to
6022 strings; messages are mapped to target-language strings.
6024 * New package for inductive predicates
6026 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6029 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6030 for z_1 :: U_1 and ... and z_n :: U_m
6032 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6035 with full support for type-inference, rather than
6037 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6039 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6040 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6042 inductive "s z_1 ... z_m"
6044 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6047 For backward compatibility, there is a wrapper allowing inductive
6048 sets to be defined with the new package via
6051 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6052 for z_1 :: U_1 and ... and z_n :: U_m
6054 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6060 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6061 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6062 for z_1 :: U_1 and ... and z_n :: U_m
6064 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6065 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6068 if the additional syntax "p ..." is required.
6070 Numerous examples can be found in the subdirectories src/HOL/Auth,
6071 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6075 - Since declaration and definition of inductive sets or predicates
6076 is no longer separated, abbreviations involving the newly
6077 introduced sets or predicates must be specified together with the
6078 introduction rules after the 'where' keyword (see above), rather
6079 than before the actual inductive definition.
6081 - The variables in induction and elimination rules are now
6082 quantified in the order of their occurrence in the introduction
6083 rules, rather than in alphabetical order. Since this may break
6084 some proofs, these proofs either have to be repaired, e.g. by
6085 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6086 statements of the form
6088 case (rule_i a_i_1 ... a_i_{k_i})
6090 or the old order of quantification has to be restored by explicitly adding
6091 meta-level quantifiers in the introduction rules, i.e.
6093 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6095 - The format of the elimination rules is now
6097 p z_1 ... z_m x_1 ... x_n ==>
6098 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6103 (x_1, ..., x_n) : s z_1 ... z_m ==>
6104 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6107 for sets rather than
6109 x : s z_1 ... z_m ==>
6110 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6113 This may require terms in goals to be expanded to n-tuples
6114 (e.g. using case_tac or simplification with the split_paired_all
6115 rule) before the above elimination rule is applicable.
6117 - The elimination or case analysis rules for (mutually) inductive
6118 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6119 list of rules "p_1_..._p_k.elims" is no longer available.
6121 * New package "function"/"fun" for general recursive functions,
6122 supporting mutual and nested recursion, definitions in local contexts,
6123 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6124 for small examples, and the separate tutorial on the function
6125 package. The old recdef "package" is still available as before, but
6126 users are encouraged to use the new package.
6128 * Method "lexicographic_order" automatically synthesizes termination
6129 relations as lexicographic combinations of size measures.
6131 * Case-expressions allow arbitrary constructor-patterns (including
6132 "_") and take their order into account, like in functional
6133 programming. Internally, this is translated into nested
6134 case-expressions; missing cases are added and mapped to the predefined
6135 constant "undefined". In complicated cases printing may no longer show
6136 the original input but the internal form. Lambda-abstractions allow
6137 the same form of pattern matching: "% pat1 => e1 | ..." is an
6138 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6141 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6142 is an abbreviation for "of_nat :: nat => int". The simplification
6143 rules for "of_nat" have been changed to work like "int" did
6144 previously. Potential INCOMPATIBILITY:
6145 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6146 - of_nat_diff and of_nat_mult are no longer default simp rules
6148 * Method "algebra" solves polynomial equations over (semi)rings using
6149 Groebner bases. The (semi)ring structure is defined by locales and the
6150 tool setup depends on that generic context. Installing the method for
6151 a specific type involves instantiating the locale and possibly adding
6152 declarations for computation on the coefficients. The method is
6153 already instantiated for natural numbers and for the axiomatic class
6154 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6155 CALCULEMUS 2007 for the general principles underlying this
6156 architecture of context-aware proof-tools.
6158 * Method "ferrack" implements quantifier elimination over
6159 special-purpose dense linear orders using locales (analogous to
6160 "algebra"). The method is already installed for class
6161 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6164 * Former constant "List.op @" now named "List.append". Use ML
6165 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6166 circumvent possible incompatibilities when working on ML level.
6168 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6170 * New function listsum :: 'a list => 'a for arbitrary monoids.
6171 Special syntax: "SUM x <- xs. f x" (and latex variants)
6173 * New syntax for Haskell-like list comprehension (input only), eg.
6174 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6176 * The special syntax for function "filter" has changed from [x :
6177 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6178 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6180 * [a..b] is now defined for arbitrary linear orders. It used to be
6181 defined on nat only, as an abbreviation for [a..<Suc b]
6184 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6186 * New functions "sorted" and "sort" in src/HOL/List.thy.
6188 * New lemma collection field_simps (an extension of ring_simps) for
6189 manipulating (in)equations involving division. Multiplies with all
6190 denominators that can be proved to be non-zero (in equations) or
6191 positive/negative (in inequations).
6193 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6194 have been improved and renamed to ring_simps, group_simps and
6195 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6196 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6198 * Theory Library/Commutative_Ring: switched from recdef to function
6199 package; constants add, mul, pow now curried. Infix syntax for
6200 algebraic operations.
6202 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6205 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6208 * HOL/records: generalised field-update to take a function on the
6209 field rather than the new value: r(|A := x|) is translated to A_update
6210 (K x) r The K-combinator that is internally used is called K_record.
6211 INCOMPATIBILITY: Usage of the plain update functions has to be
6214 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6215 * x = 0, which are required for a semiring. Richer structures do not
6216 inherit from semiring_0 anymore, because this property is a theorem
6217 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6218 there is more to prove, but this is mostly trivial.
6220 * Class "recpower" is generalized to arbitrary monoids, not just
6221 commutative semirings. INCOMPATIBILITY: may need to incorporate
6222 commutativity or semiring properties additionally.
6224 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6225 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6226 better use 'abbreviation'.
6228 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6230 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6231 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6232 significant changes for setting up numeral syntax for types:
6233 - New constants Numeral.pred and Numeral.succ instead
6234 of former Numeral.bin_pred and Numeral.bin_succ.
6235 - Use integer operations instead of bin_add, bin_mult and so on.
6236 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6237 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6239 See src/HOL/Integ/IntArith.thy for an example setup.
6241 * Command 'normal_form' computes the normal form of a term that may
6242 contain free variables. For example ``normal_form "rev [a, b, c]"''
6243 produces ``[b, c, a]'' (without proof). This command is suitable for
6244 heavy-duty computations because the functions are compiled to ML
6245 first. Correspondingly, a method "normalization" is provided. See
6246 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6248 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6249 25 like -->); output depends on the "iff" print_mode, the default is
6250 "A = B" (with priority 50).
6252 * Relations less (<) and less_eq (<=) are also available on type bool.
6253 Modified syntax to disallow nesting without explicit parentheses,
6254 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6257 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6259 * Relation composition operator "op O" now has precedence 75 and binds
6260 stronger than union and intersection. INCOMPATIBILITY.
6262 * The old set interval syntax "{m..n(}" (and relatives) has been
6263 removed. Use "{m..<n}" (and relatives) instead.
6265 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6266 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6267 ``declare [[simproc del: neq]]''.
6269 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6272 * Theorem Cons_eq_map_conv no longer declared as "simp".
6274 * Theorem setsum_mult renamed to setsum_right_distrib.
6276 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6279 * Reimplemented methods "sat" and "satx", with several improvements:
6280 goals no longer need to be stated as "<prems> ==> False", equivalences
6281 (i.e. "=" on type bool) are handled, variable names of the form
6282 "lit_<n>" are no longer reserved, significant speedup.
6284 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6285 zChaff is still supported as well.
6287 * 'inductive' and 'datatype': provide projections of mutual rules,
6288 bundled as foo_bar.inducts;
6290 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6293 * Library: moved theory Accessible_Part to main HOL.
6295 * Library: added theory Coinductive_List of potentially infinite lists
6296 as greatest fixed-point.
6298 * Library: added theory AssocList which implements (finite) maps as
6301 * Method "evaluation" solves goals (i.e. a boolean expression)
6302 efficiently by compiling it to ML. The goal is "proved" (via an
6303 oracle) if it evaluates to True.
6305 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6306 also when invoked by the simplifier. This results in the Simplifier
6307 being more powerful on arithmetic goals. INCOMPATIBILITY.
6308 Configuration option fast_arith_split_limit=0 recovers the old
6311 * Support for hex (0x20) and binary (0b1001) numerals.
6313 * New method: reify eqs (t), where eqs are equations for an
6314 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6315 parameter, computes a term s::'b and a list xs::'a list and proves the
6316 theorem I xs s = t. This is also known as reification or quoting. The
6317 resulting theorem is applied to the subgoal to substitute t with I xs
6318 s. If t is omitted, the subgoal itself is reified.
6320 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6321 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6322 where f is supposed to be a computable function (in the sense of code
6323 generattion). The method uses reify to compute s and xs as above then
6324 applies corr_thm and uses normalization by evaluation to "prove" f s =
6325 r and finally gets the theorem t = r, which is again applied to the
6326 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6328 * Reflection: Automatic reification now handels binding, an example is
6329 available in src/HOL/ex/ReflectionEx.thy
6331 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6332 command 'statespace' that is similar to 'record', but introduces an
6333 abstract specification based on the locale infrastructure instead of
6334 HOL types. This leads to extra flexibility in composing state spaces,
6335 in particular multiple inheritance and renaming of components.
6340 * Hyperreal: Functions root and sqrt are now defined on negative real
6341 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6342 Nonnegativity side conditions have been removed from many lemmas, so
6343 that more subgoals may now be solved by simplification; potential
6346 * Real: new type classes formalize real normed vector spaces and
6347 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6348 and norm :: 'a => real.
6350 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6351 reals into other types. The overloaded constant Reals :: 'a set is now
6352 defined as range of_real; potential INCOMPATIBILITY.
6354 * Real: proper support for ML code generation, including 'quickcheck'.
6355 Reals are implemented as arbitrary precision rationals.
6357 * Hyperreal: Several constants that previously worked only for the
6358 reals have been generalized, so they now work over arbitrary vector
6359 spaces. Type annotations may need to be added in some cases; potential
6362 Infinitesimal :: ('a::real_normed_vector) star set
6363 HFinite :: ('a::real_normed_vector) star set
6364 HInfinite :: ('a::real_normed_vector) star set
6365 approx :: ('a::real_normed_vector) star => 'a star => bool
6366 monad :: ('a::real_normed_vector) star => 'a star set
6367 galaxy :: ('a::real_normed_vector) star => 'a star set
6368 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6369 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6370 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6371 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6372 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6373 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6374 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6375 sgn :: 'a::real_normed_vector => 'a
6376 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6378 * Complex: Some complex-specific constants are now abbreviations for
6379 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6380 hnorm. Other constants have been entirely removed in favor of the
6381 polymorphic versions (INCOMPATIBILITY):
6385 HInfinite <-- CInfinite
6386 Infinitesimal <-- CInfinitesimal
6389 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6390 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6391 (ns)deriv <-- (ns)cderiv
6396 * Formalisation of ideals and the quotient construction over rings.
6398 * Order and lattice theory no longer based on records.
6401 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6402 greatest_closed. INCOMPATIBILITY.
6404 * Method algebra is now set up via an attribute. For examples see
6405 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6406 of algebraic structures.
6408 * Renamed theory CRing to Ring.
6413 * Substantial, yet incomplete support for nominal datatypes (binding
6414 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6415 src/HOL/Nominal/Examples. Prospective users should consult
6416 http://isabelle.in.tum.de/nominal/
6421 * ML basics: just one true type int, which coincides with IntInf.int
6424 * ML within Isar: antiquotations allow to embed statically-checked
6425 formal entities in the source, referring to the context available at
6426 compile-time. For example:
6428 ML {* @{sort "{zero,one}"} *}
6429 ML {* @{typ "'a => 'b"} *}
6430 ML {* @{term "%x. x"} *}
6431 ML {* @{prop "x == y"} *}
6432 ML {* @{ctyp "'a => 'b"} *}
6433 ML {* @{cterm "%x. x"} *}
6434 ML {* @{cprop "x == y"} *}
6435 ML {* @{thm asm_rl} *}
6436 ML {* @{thms asm_rl} *}
6437 ML {* @{type_name c} *}
6438 ML {* @{type_syntax c} *}
6439 ML {* @{const_name c} *}
6440 ML {* @{const_syntax c} *}
6443 ML {* @{theory Pure} *}
6444 ML {* @{theory_ref} *}
6445 ML {* @{theory_ref Pure} *}
6448 ML {* @{clasimpset} *}
6450 The same works for sources being ``used'' within an Isar context.
6452 * ML in Isar: improved error reporting; extra verbosity with
6453 ML_Context.trace enabled.
6455 * Pure/General/table.ML: the join operations now works via exceptions
6456 DUP/SAME instead of type option. This is simpler in simple cases, and
6457 admits slightly more efficient complex applications.
6459 * Pure: 'advanced' translation functions (parse_translation etc.) now
6460 use Context.generic instead of just theory.
6462 * Pure: datatype Context.generic joins theory/Proof.context and
6463 provides some facilities for code that works in either kind of
6464 context, notably GenericDataFun for uniform theory and proof data.
6466 * Pure: simplified internal attribute type, which is now always
6467 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6468 local (Proof.context) attributes have been discontinued, while
6469 minimizing code duplication. Thm.rule_attribute and
6470 Thm.declaration_attribute build canonical attributes; see also structure
6471 Context for further operations on Context.generic, notably
6472 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6473 declarations and definitions.
6475 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6476 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6477 init only required for impure data. INCOMPATIBILITY: empty really need
6478 to be empty (no dependencies on theory content!)
6480 * Pure/kernel: consts certification ignores sort constraints given in
6481 signature declarations. (This information is not relevant to the
6482 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6483 potential INCOMPATIBILITY.
6485 * Pure: axiomatic type classes are now purely definitional, with
6486 explicit proofs of class axioms and super class relations performed
6487 internally. See Pure/axclass.ML for the main internal interfaces --
6488 notably AxClass.define_class supercedes AxClass.add_axclass, and
6489 AxClass.axiomatize_class/classrel/arity supersede
6490 Sign.add_classes/classrel/arities.
6492 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6493 global/local versions on theory vs. Proof.context have been
6494 discontinued; Attrib.syntax and Method.syntax have been adapted
6495 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6496 attributes, methods, etc.
6498 * Pure: several functions of signature "... -> theory -> theory * ..."
6499 have been reoriented to "... -> theory -> ... * theory" in order to
6500 allow natural usage in combination with the ||>, ||>>, |-> and
6501 fold_map combinators.
6503 * Pure: official theorem names (closed derivations) and additional
6504 comments (tags) are now strictly separate. Name hints -- which are
6505 maintained as tags -- may be attached any time without affecting the
6508 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6509 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6510 achieve the old behaviour.
6512 * Pure: the "Goal" constant is now called "prop", supporting a
6513 slightly more general idea of ``protecting'' meta-level rule
6516 * Pure: Logic.(un)varify only works in a global context, which is now
6517 enforced instead of silently assumed. INCOMPATIBILITY, may use
6518 Logic.legacy_(un)varify as temporary workaround.
6520 * Pure: structure Name provides scalable operations for generating
6521 internal variable names, notably Name.variants etc. This replaces
6522 some popular functions from term.ML:
6524 Term.variant -> Name.variant
6525 Term.variantlist -> Name.variant_list
6526 Term.invent_names -> Name.invent_list
6528 Note that low-level renaming rarely occurs in new code -- operations
6529 from structure Variable are used instead (see below).
6531 * Pure: structure Variable provides fundamental operations for proper
6532 treatment of fixed/schematic variables in a context. For example,
6533 Variable.import introduces fixes for schematics of given facts and
6534 Variable.export reverses the effect (up to renaming) -- this replaces
6535 various freeze_thaw operations.
6537 * Pure: structure Goal provides simple interfaces for
6538 init/conclude/finish and tactical prove operations (replacing former
6539 Tactic.prove). Goal.prove is the canonical way to prove results
6540 within a given context; Goal.prove_global is a degraded version for
6541 theory level goals, including a global Drule.standard. Note that
6542 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6543 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6544 in a locale context).
6546 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6547 and type checking (Syntax.check_term etc.), with common combinations
6548 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6549 which are considered legacy and await removal.
6551 * Pure/Syntax: generic interfaces for type unchecking
6552 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6553 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6554 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6555 available for convenience, but refer to the very same operations using
6556 a mere theory instead of a full context.
6558 * Isar: simplified treatment of user-level errors, using exception
6559 ERROR of string uniformly. Function error now merely raises ERROR,
6560 without any side effect on output channels. The Isar toplevel takes
6561 care of proper display of ERROR exceptions. ML code may use plain
6562 handle/can/try; cat_error may be used to concatenate errors like this:
6564 ... handle ERROR msg => cat_error msg "..."
6566 Toplevel ML code (run directly or through the Isar toplevel) may be
6567 embedded into the Isar toplevel with exception display/debug like
6570 Isar.toplevel (fn () => ...)
6572 INCOMPATIBILITY, removed special transform_error facilities, removed
6573 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6574 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6575 -- use plain ERROR instead.
6577 * Isar: theory setup now has type (theory -> theory), instead of a
6578 list. INCOMPATIBILITY, may use #> to compose setup functions.
6580 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6581 ProofContext.debug/verbose flags.
6583 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6584 theory before entering a proof state. Transactions now always see a
6585 quasi-functional intermediate checkpoint, both in interactive and
6588 * Isar: simplified interfaces for outer syntax. Renamed
6589 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6590 OuterSyntax.add_parsers -- this functionality is now included in
6591 OuterSyntax.command etc. INCOMPATIBILITY.
6593 * Simplifier: the simpset of a running simplification process now
6594 contains a proof context (cf. Simplifier.the_context), which is the
6595 very context that the initial simpset has been retrieved from (by
6596 simpset_of/local_simpset_of). Consequently, all plug-in components
6597 (solver, looper etc.) may depend on arbitrary proof data.
6599 * Simplifier.inherit_context inherits the proof context (plus the
6600 local bounds) of the current simplification process; any simproc
6601 etc. that calls the Simplifier recursively should do this! Removed
6602 former Simplifier.inherit_bounds, which is already included here --
6603 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6604 specify an explicit context using Simplifier.context/theory_context.
6606 * Simplifier/Classical Reasoner: more abstract interfaces
6607 change_simpset/claset for modifying the simpset/claset reference of a
6608 theory; raw versions simpset/claset_ref etc. have been discontinued --
6611 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6617 * settings: the default heap location within ISABELLE_HOME_USER now
6618 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6619 Isabelle installations.
6621 * isabelle-process: option -S (secure mode) disables some critical
6622 operations, notably runtime compilation and evaluation of ML source
6625 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6627 * Support for parallel execution, using native multicore support of
6628 Poly/ML 5.1. The theory loader exploits parallelism when processing
6629 independent theories, according to the given theory header
6630 specifications. The maximum number of worker threads is specified via
6631 usedir option -M or the "max-threads" setting in Proof General. A
6632 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6633 to 6 on a 8-core machine. User-code needs to observe certain
6634 guidelines for thread-safe programming, see appendix A in the Isar
6635 Implementation manual.
6639 New in Isabelle2005 (October 2005)
6640 ----------------------------------
6644 * Theory headers: the new header syntax for Isar theories is
6647 imports <theory1> ... <theoryN>
6648 uses <file1> ... <fileM>
6651 where the 'uses' part is optional. The previous syntax
6653 theory <name> = <theory1> + ... + <theoryN>:
6655 will disappear in the next release. Use isatool fixheaders to convert
6656 existing theory files. Note that there is no change in ancient
6657 non-Isar theories now, but these will disappear soon.
6659 * Theory loader: parent theories can now also be referred to via
6660 relative and absolute paths.
6662 * Command 'find_theorems' searches for a list of criteria instead of a
6663 list of constants. Known criteria are: intro, elim, dest, name:string,
6664 simp:term, and any term. Criteria can be preceded by '-' to select
6665 theorems that do not match. Intro, elim, dest select theorems that
6666 match the current goal, name:s selects theorems whose fully qualified
6667 name contain s, and simp:term selects all simplification rules whose
6668 lhs match term. Any other term is interpreted as pattern and selects
6669 all theorems matching the pattern. Available in ProofGeneral under
6670 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6672 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6674 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6675 matching the current goal as introduction rule and not having "HOL."
6676 in their name (i.e. not being defined in theory HOL).
6678 * Command 'thms_containing' has been discontinued in favour of
6679 'find_theorems'; INCOMPATIBILITY.
6681 * Communication with Proof General is now 8bit clean, which means that
6682 Unicode text in UTF-8 encoding may be used within theory texts (both
6683 formal and informal parts). Cf. option -U of the Isabelle Proof
6684 General interface. Here are some simple examples (cf. src/HOL/ex):
6686 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6687 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6689 * Improved efficiency of the Simplifier and, to a lesser degree, the
6690 Classical Reasoner. Typical big applications run around 2 times
6694 *** Document preparation ***
6696 * Commands 'display_drafts' and 'print_drafts' perform simple output
6697 of raw sources. Only those symbols that do not require additional
6698 LaTeX packages (depending on comments in isabellesym.sty) are
6699 displayed properly, everything else is left verbatim. isatool display
6700 and isatool print are used as front ends (these are subject to the
6701 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6703 * Command tags control specific markup of certain regions of text,
6704 notably folding and hiding. Predefined tags include "theory" (for
6705 theory begin and end), "proof" for proof commands, and "ML" for
6706 commands involving ML code; the additional tags "visible" and
6707 "invisible" are unused by default. Users may give explicit tag
6708 specifications in the text, e.g. ''by %invisible (auto)''. The
6709 interpretation of tags is determined by the LaTeX job during document
6710 preparation: see option -V of isatool usedir, or options -n and -t of
6711 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6714 Several document versions may be produced at the same time via isatool
6715 usedir (the generated index.html will link all of them). Typical
6716 specifications include ''-V document=theory,proof,ML'' to present
6717 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6718 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6719 these parts without any formal replacement text. The Isabelle site
6720 default settings produce ''document'' and ''outline'' versions as
6723 * Several new antiquotations:
6725 @{term_type term} prints a term with its type annotated;
6727 @{typeof term} prints the type of a term;
6729 @{const const} is the same as @{term const}, but checks that the
6730 argument is a known logical constant;
6732 @{term_style style term} and @{thm_style style thm} print a term or
6733 theorem applying a "style" to it
6737 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6738 definitions, equations, inequations etc., 'concl' printing only the
6739 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6740 to print the specified premise. TermStyle.add_style provides an ML
6741 interface for introducing further styles. See also the "LaTeX Sugar"
6742 document practical applications. The ML antiquotation prints
6743 type-checked ML expressions verbatim.
6745 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6746 and 'text' support optional locale specification '(in loc)', which
6747 specifies the default context for interpreting antiquotations. For
6748 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6750 * Option 'locale=NAME' of antiquotations specifies an alternative
6751 context interpreting the subsequent argument. For example: @{thm
6752 [locale=lattice] inf_assoc}.
6754 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6757 * Proper output of antiquotations for theory commands involving a
6758 proof context (such as 'locale' or 'theorem (in loc) ...').
6760 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6761 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6763 * isatool usedir: new option -C (default true) controls whether option
6764 -D should include a copy of the original document directory; -C false
6765 prevents unwanted effects such as copying of administrative CVS data.
6770 * Considerably improved version of 'constdefs' command. Now performs
6771 automatic type-inference of declared constants; additional support for
6772 local structure declarations (cf. locales and HOL records), see also
6773 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6774 sequential dependencies of definitions within a single 'constdefs'
6775 section; moreover, the declared name needs to be an identifier. If
6776 all fails, consider to fall back on 'consts' and 'defs' separately.
6778 * Improved indexed syntax and implicit structures. First of all,
6779 indexed syntax provides a notational device for subscripted
6780 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6781 expressions. Secondly, in a local context with structure
6782 declarations, number indexes \<^sub>n or the empty index (default
6783 number 1) refer to a certain fixed variable implicitly; option
6784 show_structs controls printing of implicit structures. Typical
6785 applications of these concepts involve record types and locales.
6787 * New command 'no_syntax' removes grammar declarations (and
6788 translations) resulting from the given syntax specification, which is
6789 interpreted in the same manner as for the 'syntax' command.
6791 * 'Advanced' translation functions (parse_translation etc.) may depend
6792 on the signature of the theory context being presently used for
6793 parsing/printing, see also isar-ref manual.
6795 * Improved 'oracle' command provides a type-safe interface to turn an
6796 ML expression of type theory -> T -> term into a primitive rule of
6797 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6798 is already included here); see also FOL/ex/IffExample.thy;
6801 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6802 before); "cI" is no longer bound, use "c.intro" instead.
6803 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6804 axclasses vs. locales.
6806 * Improved internal renaming of symbolic identifiers -- attach primes
6807 instead of base 26 numbers.
6809 * New flag show_question_marks controls printing of leading question
6810 marks in schematic variable names.
6812 * In schematic variable names, *any* symbol following \<^isub> or
6813 \<^isup> is now treated as part of the base name. For example, the
6814 following works without printing of awkward ".0" indexes:
6816 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6819 * Inner syntax includes (*(*nested*) comments*).
6821 * Pretty printer now supports unbreakable blocks, specified in mixfix
6822 annotations as "(00...)".
6824 * Clear separation of logical types and nonterminals, where the latter
6825 may only occur in 'syntax' specifications or type abbreviations.
6826 Before that distinction was only partially implemented via type class
6827 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6828 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6829 exotic syntax specifications may require further adaption
6830 (e.g. Cube/Cube.thy).
6832 * Removed obsolete type class "logic", use the top sort {} instead.
6833 Note that non-logical types should be declared as 'nonterminals'
6834 rather than 'types'. INCOMPATIBILITY for new object-logic
6837 * Attributes 'induct' and 'cases': type or set names may now be
6838 locally fixed variables as well.
6840 * Simplifier: can now control the depth to which conditional rewriting
6841 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6844 * Simplifier: simplification procedures may now take the current
6845 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6846 interface), which is very useful for calling the Simplifier
6847 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6848 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6849 low-level mk_simproc no longer applies Logic.varify internally, to
6850 allow for use in a context of fixed variables.
6852 * thin_tac now works even if the assumption being deleted contains !!
6853 or ==>. More generally, erule now works even if the major premise of
6854 the elimination rule contains !! or ==>.
6856 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6858 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6859 from Pure, which contains all common declarations already. Both
6860 theories are defined via plain Isabelle/Isar .thy files.
6861 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6862 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6863 use isatool fixcpure to adapt your theory and ML sources.
6865 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6866 selections of theorems in named facts via index ranges.
6868 * 'print_theorems': in theory mode, really print the difference
6869 wrt. the last state (works for interactive theory development only),
6870 in proof mode print all local facts (cf. 'print_facts');
6872 * 'hide': option '(open)' hides only base names.
6874 * More efficient treatment of intermediate checkpoints in interactive
6877 * Code generator is now invoked via code_module (incremental code
6878 generation) and code_library (modular code generation, ML structures
6879 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6880 must be quoted when used as identifiers.
6882 * New 'value' command for reading, evaluating and printing terms using
6883 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6884 quoted when used as identifier.
6889 * New commands for the interpretation of locale expressions in
6890 theories (1), locales (2) and proof contexts (3). These generate
6891 proof obligations from the expression specification. After the
6892 obligations have been discharged, theorems of the expression are added
6893 to the theory, target locale or proof context. The synopsis of the
6894 commands is a follows:
6896 (1) interpretation expr inst
6897 (2) interpretation target < expr
6898 (3) interpret expr inst
6900 Interpretation in theories and proof contexts require a parameter
6901 instantiation of terms from the current context. This is applied to
6902 specifications and theorems of the interpreted expression.
6903 Interpretation in locales only permits parameter renaming through the
6904 locale expression. Interpretation is smart in that interpretations
6905 that are active already do not occur in proof obligations, neither are
6906 instantiated theorems stored in duplicate. Use 'print_interps' to
6907 inspect active interpretations of a particular locale. For details,
6908 see the Isar Reference manual. Examples can be found in
6909 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6911 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6912 'interpret' instead.
6914 * New context element 'constrains' for adding type constraints to
6917 * Context expressions: renaming of parameters with syntax
6920 * Locale declaration: 'includes' disallowed.
6922 * Proper static binding of attribute syntax -- i.e. types / terms /
6923 facts mentioned as arguments are always those of the locale definition
6924 context, independently of the context of later invocations. Moreover,
6925 locale operations (renaming and type / term instantiation) are applied
6926 to attribute arguments as expected.
6928 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6929 actual attributes; rare situations may require Attrib.attribute to
6930 embed those attributes into Attrib.src that lack concrete syntax.
6931 Attribute implementations need to cooperate properly with the static
6932 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6933 Attrib.XXX_thm etc. already do the right thing without further
6934 intervention. Only unusual applications -- such as "where" or "of"
6935 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6936 on the context and the facts involved -- may have to assign parsed
6937 values to argument tokens explicitly.
6939 * Changed parameter management in theorem generation for long goal
6940 statements with 'includes'. INCOMPATIBILITY: produces a different
6941 theorem statement in rare situations.
6943 * Locale inspection command 'print_locale' omits notes elements. Use
6944 'print_locale!' to have them included in the output.
6949 * Provers/hypsubst.ML: improved version of the subst method, for
6950 single-step rewriting: it now works in bound variable contexts. New is
6951 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6952 rewrite a different subterm than the original subst method, which is
6953 still available as 'simplesubst'.
6955 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6958 * Provers/trancl.ML: new transitivity reasoner for transitive and
6959 reflexive-transitive closure of relations.
6961 * Provers/blast.ML: new reference depth_limit to make blast's depth
6962 limit (previously hard-coded with a value of 20) user-definable.
6964 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6965 is peformed already. Object-logics merely need to finish their
6966 initial simpset configuration as before. INCOMPATIBILITY.
6971 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6974 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6976 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6977 and x-symbol; use option '-m epsilon' to get it actually printed.
6978 Moreover, the mathematically important symbolic identifier \<epsilon>
6979 becomes available as variable, constant etc. INCOMPATIBILITY,
6981 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6982 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6983 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6984 support corresponding Isar calculations.
6986 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6989 * theory SetInterval: changed the syntax for open intervals:
6998 The old syntax is still supported but will disappear in the next
6999 release. For conversion use the following Emacs search and replace
7000 patterns (these are not perfect but work quite well):
7002 {)\([^\.]*\)\.\. -> {\1<\.\.}
7003 \.\.\([^(}]*\)(} -> \.\.<\1}
7005 * Theory Commutative_Ring (in Library): method comm_ring for proving
7006 equalities in commutative rings; method 'algebra' provides a generic
7009 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7010 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7011 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7014 Some new syntax forms are available:
7016 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7017 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7018 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7019 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7021 The latter form "\<Sum>x < k. e" used to be based on a separate
7022 function "Summation", which has been discontinued.
7024 * theory Finite_Set: in structured induction proofs, the insert case
7025 is now 'case (insert x F)' instead of the old counterintuitive 'case
7028 * The 'refute' command has been extended to support a much larger
7029 fragment of HOL, including axiomatic type classes, constdefs and
7030 typedefs, inductive datatypes and recursion.
7032 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7033 Requires zChaff with proof generation to be installed. See
7034 HOL/ex/SAT_Examples.thy for examples.
7036 * Datatype induction via method 'induct' now preserves the name of the
7037 induction variable. For example, when proving P(xs::'a list) by
7038 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7039 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7040 in unstructured proof scripts.
7042 * Reworked implementation of records. Improved scalability for
7043 records with many fields, avoiding performance problems for type
7044 inference. Records are no longer composed of nested field types, but
7045 of nested extension types. Therefore the record type only grows linear
7046 in the number of extensions and not in the number of fields. The
7047 top-level (users) view on records is preserved. Potential
7048 INCOMPATIBILITY only in strange cases, where the theory depends on the
7049 old record representation. The type generated for a record is called
7050 <record_name>_ext_type.
7052 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7053 proofs triggered by a record definition or a simproc (if
7054 quick_and_dirty is enabled). Definitions of large records can take
7057 New simproc record_upd_simproc for simplification of multiple record
7058 updates enabled by default. Moreover, trivial updates are also
7059 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7060 occasionally, since simplification is more powerful by default.
7062 * typedef: proper support for polymorphic sets, which contain extra
7063 type-variables in the term.
7065 * Simplifier: automatically reasons about transitivity chains
7066 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7067 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7068 old proofs break occasionally as simplification may now solve more
7069 goals than previously.
7071 * Simplifier: converts x <= y into x = y if assumption y <= x is
7072 present. Works for all partial orders (class "order"), in particular
7073 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7076 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7077 bound variable or a constant then the let is unfolded. Otherwise
7078 first a is simplified to b, and then f b is simplified to g. If
7079 possible we abstract b from g arriving at "let x = b in h x",
7080 otherwise we unfold the let and arrive at g. The simproc can be
7081 enabled/disabled by the reference use_let_simproc. Potential
7082 INCOMPATIBILITY since simplification is more powerful by default.
7084 * Classical reasoning: the meson method now accepts theorems as arguments.
7086 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7087 jobs to provide advice on the provability of subgoals.
7089 * Theory OrderedGroup and Ring_and_Field: various additions and
7090 improvements to faciliate calculations involving equalities and
7093 The following theorems have been eliminated or modified
7096 abs_eq now named abs_of_nonneg
7097 abs_of_ge_0 now named abs_of_nonneg
7098 abs_minus_eq now named abs_of_nonpos
7099 imp_abs_id now named abs_of_nonneg
7100 imp_abs_neg_id now named abs_of_nonpos
7101 mult_pos now named mult_pos_pos
7102 mult_pos_le now named mult_nonneg_nonneg
7103 mult_pos_neg_le now named mult_nonneg_nonpos
7104 mult_pos_neg2_le now named mult_nonneg_nonpos2
7105 mult_neg now named mult_neg_neg
7106 mult_neg_le now named mult_nonpos_nonpos
7108 * The following lemmas in Ring_and_Field have been added to the simplifier:
7111 not_square_less_zero
7113 The following lemmas have been deleted from Real/RealPow:
7123 * Theory Parity: added rules for simplifying exponents.
7127 The following theorems have been eliminated or modified
7130 list_all_Nil now named list_all.simps(1)
7131 list_all_Cons now named list_all.simps(2)
7132 list_all_conv now named list_all_iff
7133 set_mem_eq now named mem_iff
7135 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7136 asymptotic "big O" calculations. See the notes in BigO.thy.
7141 * Theory RealDef: better support for embedding natural numbers and
7142 integers in the reals.
7144 The following theorems have been eliminated or modified
7147 exp_ge_add_one_self now requires no hypotheses
7148 real_of_int_add reversed direction of equality (use [symmetric])
7149 real_of_int_minus reversed direction of equality (use [symmetric])
7150 real_of_int_diff reversed direction of equality (use [symmetric])
7151 real_of_int_mult reversed direction of equality (use [symmetric])
7153 * Theory RComplete: expanded support for floor and ceiling functions.
7155 * Theory Ln is new, with properties of the natural logarithm
7157 * Hyperreal: There is a new type constructor "star" for making
7158 nonstandard types. The old type names are now type synonyms:
7162 hcomplex = complex star
7164 * Hyperreal: Many groups of similarly-defined constants have been
7165 replaced by polymorphic versions (INCOMPATIBILITY):
7167 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7169 starset <-- starsetNat, starsetC
7170 *s* <-- *sNat*, *sc*
7171 starset_n <-- starsetNat_n, starsetC_n
7172 *sn* <-- *sNatn*, *scn*
7173 InternalSets <-- InternalNatSets, InternalCSets
7175 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7176 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7177 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7178 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7179 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7181 * Hyperreal: Many type-specific theorems have been removed in favor of
7182 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7184 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7185 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7186 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7187 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7188 right_minus <-- hypreal_add_minus
7189 left_minus <-- {hypreal,hcomplex}_add_minus_left
7190 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7191 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7192 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7193 mult_1_right <-- hcomplex_mult_one_right
7194 mult_zero_left <-- hcomplex_mult_zero_left
7195 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7196 right_distrib <-- hypnat_add_mult_distrib2
7197 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7198 right_inverse <-- hypreal_mult_inverse
7199 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7200 order_refl <-- {hypreal,hypnat}_le_refl
7201 order_trans <-- {hypreal,hypnat}_le_trans
7202 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7203 order_less_le <-- {hypreal,hypnat}_less_le
7204 linorder_linear <-- {hypreal,hypnat}_le_linear
7205 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7206 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7207 add_nonneg_nonneg <-- hypreal_le_add_order
7209 * Hyperreal: Separate theorems having to do with type-specific
7210 versions of constants have been merged into theorems that apply to the
7211 new polymorphic constants (INCOMPATIBILITY):
7213 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7214 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7215 STAR_Un <-- {STAR,NatStar,STARC}_Un
7216 STAR_Int <-- {STAR,NatStar,STARC}_Int
7217 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7218 STAR_subset <-- {STAR,NatStar,STARC}_subset
7219 STAR_mem <-- {STAR,NatStar,STARC}_mem
7220 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7221 STAR_diff <-- {STAR,STARC}_diff
7222 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7223 STARC_hcomplex_of_complex}_image_subset
7224 starset_n_Un <-- starset{Nat,C}_n_Un
7225 starset_n_Int <-- starset{Nat,C}_n_Int
7226 starset_n_Compl <-- starset{Nat,C}_n_Compl
7227 starset_n_diff <-- starset{Nat,C}_n_diff
7228 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7229 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7230 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7231 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7232 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7233 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7234 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7235 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7236 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7237 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7238 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7239 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7240 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7241 starfun_diff <-- starfun{C,RC,CR}_diff
7242 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7243 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7244 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7245 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7246 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7247 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7248 starfun_Id <-- starfunC_Id
7249 starfun_approx <-- starfun{Nat,CR}_approx
7250 starfun_capprox <-- starfun{C,RC}_capprox
7251 starfun_abs <-- starfunNat_rabs
7252 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7253 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7254 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7255 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7256 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7257 starfun_add_approx <-- starfunCR_add_approx
7258 starfun_inverse_inverse <-- starfunC_inverse_inverse
7259 starfun_divide <-- starfun{C,CR,RC}_divide
7260 starfun_n <-- starfun{Nat,C}_n
7261 starfun_n_mult <-- starfun{Nat,C}_n_mult
7262 starfun_n_add <-- starfun{Nat,C}_n_add
7263 starfun_n_add_minus <-- starfunNat_n_add_minus
7264 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7265 starfun_n_minus <-- starfun{Nat,C}_n_minus
7266 starfun_n_eq <-- starfun{Nat,C}_n_eq
7268 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7269 star_n_minus <-- {hypreal,hcomplex}_minus
7270 star_n_diff <-- {hypreal,hcomplex}_diff
7271 star_n_mult <-- {hypreal,hcomplex}_mult
7272 star_n_inverse <-- {hypreal,hcomplex}_inverse
7273 star_n_le <-- {hypreal,hypnat}_le
7274 star_n_less <-- {hypreal,hypnat}_less
7275 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7276 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7277 star_n_abs <-- hypreal_hrabs
7278 star_n_divide <-- hcomplex_divide
7280 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7281 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7282 star_of_diff <-- hypreal_of_real_diff
7283 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7284 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7285 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7286 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7287 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7288 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7289 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7290 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7291 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7292 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7293 star_of_number_of <-- {hypreal,hcomplex}_number_of
7294 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7295 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7296 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7297 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7298 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7299 star_of_power <-- hypreal_of_real_power
7300 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7302 * Hyperreal: new method "transfer" that implements the transfer
7303 principle of nonstandard analysis. With a subgoal that mentions
7304 nonstandard types like "'a star", the command "apply transfer"
7305 replaces it with an equivalent one that mentions only standard types.
7306 To be successful, all free variables must have standard types; non-
7307 standard variables must have explicit universal quantifiers.
7309 * Hyperreal: A theory of Taylor series.
7314 * Discontinued special version of 'constdefs' (which used to support
7315 continuous functions) in favor of the general Pure one with full
7318 * New simplification procedure for solving continuity conditions; it
7319 is much faster on terms with many nested lambda abstractions (cubic
7320 instead of exponential time).
7322 * New syntax for domain package: selector names are now optional.
7323 Parentheses should be omitted unless argument is lazy, for example:
7325 domain 'a stream = cons "'a" (lazy "'a stream")
7327 * New command 'fixrec' for defining recursive functions with pattern
7328 matching; defining multiple functions with mutual recursion is also
7329 supported. Patterns may include the constants cpair, spair, up, sinl,
7330 sinr, or any data constructor defined by the domain package. The given
7331 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7332 syntax and examples.
7334 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7335 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7336 but the proof obligation additionally includes an admissibility
7337 requirement. The packages generate instances of class cpo or pcpo,
7338 with continuity and strictness theorems for Rep and Abs.
7340 * HOLCF: Many theorems have been renamed according to a more standard naming
7341 scheme (INCOMPATIBILITY):
7343 foo_inject: "foo$x = foo$y ==> x = y"
7344 foo_eq: "(foo$x = foo$y) = (x = y)"
7345 foo_less: "(foo$x << foo$y) = (x << y)"
7346 foo_strict: "foo$UU = UU"
7347 foo_defined: "... ==> foo$x ~= UU"
7348 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7353 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7354 including the First Isomorphism Theorem (on quotienting by the kernel
7357 * ZF/Simplifier: install second copy of type solver that actually
7358 makes use of TC rules declared to Isar proof contexts (or locales);
7359 the old version is still required for ML proof scripts.
7364 * Converted to Isar theory format; use locales instead of axiomatic
7370 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7373 * Pure/library.ML no longer defines its own option datatype, but uses
7374 that of the SML basis, which has constructors NONE and SOME instead of
7375 None and Some, as well as exception Option.Option instead of OPTION.
7376 The functions the, if_none, is_some, is_none have been adapted
7377 accordingly, while Option.map replaces apsome.
7379 * Pure/library.ML: the exception LIST has been given up in favour of
7380 the standard exceptions Empty and Subscript, as well as
7381 Library.UnequalLengths. Function like Library.hd and Library.tl are
7382 superceded by the standard hd and tl functions etc.
7384 A number of basic list functions are no longer exported to the ML
7385 toplevel, as they are variants of predefined functions. The following
7386 suggests how one can translate existing code:
7388 rev_append xs ys = List.revAppend (xs, ys)
7389 nth_elem (i, xs) = List.nth (xs, i)
7390 last_elem xs = List.last xs
7391 flat xss = List.concat xss
7392 seq fs = List.app fs
7393 partition P xs = List.partition P xs
7394 mapfilter f xs = List.mapPartial f xs
7396 * Pure/library.ML: several combinators for linear functional
7397 transformations, notably reverse application and composition:
7400 (x, y) |-> f f #-> g
7402 * Pure/library.ML: introduced/changed precedence of infix operators:
7404 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7406 infix 3 o oo ooo oooo;
7407 infix 4 ~~ upto downto;
7409 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7412 * Pure/library.ML: natural list combinators fold, fold_rev, and
7413 fold_map support linear functional transformations and nesting. For
7416 fold f [x1, ..., xN] y =
7417 y |> f x1 |> ... |> f xN
7419 (fold o fold) f [xs1, ..., xsN] y =
7420 y |> fold f xs1 |> ... |> fold f xsN
7422 fold f [x1, ..., xN] =
7425 (fold o fold) f [xs1, ..., xsN] =
7426 fold f xs1 #> ... #> fold f xsN
7428 * Pure/library.ML: the following selectors on type 'a option are
7431 the: 'a option -> 'a (*partial*)
7432 these: 'a option -> 'a where 'a = 'b list
7433 the_default: 'a -> 'a option -> 'a
7434 the_list: 'a option -> 'a list
7436 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7437 basic operations for association lists, following natural argument
7438 order; moreover the explicit equality predicate passed here avoids
7439 potentially expensive polymorphic runtime equality checks.
7440 The old functions may be expressed as follows:
7442 assoc = uncurry (AList.lookup (op =))
7443 assocs = these oo AList.lookup (op =)
7444 overwrite = uncurry (AList.update (op =)) o swap
7446 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7448 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7449 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7451 replacing make_keylist and keyfilter (occassionally used)
7454 make_keylist = AList.make
7455 keyfilter = AList.find (op =)
7457 * eq_fst and eq_snd now take explicit equality parameter, thus
7458 avoiding eqtypes. Naive rewrites:
7460 eq_fst = eq_fst (op =)
7461 eq_snd = eq_snd (op =)
7463 * Removed deprecated apl and apr (rarely used).
7466 apl (n, op) =>>= curry op n
7467 apr (op, m) =>>= fn n => op (n, m)
7469 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7470 provides a reasonably efficient light-weight implementation of sets as
7473 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7474 few new operations; existing lookup and update are now curried to
7475 follow natural argument order (for use with fold etc.);
7476 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7478 * Pure/General: output via the Isabelle channels of
7479 writeln/warning/error etc. is now passed through Output.output, with a
7480 hook for arbitrary transformations depending on the print_mode
7481 (cf. Output.add_mode -- the first active mode that provides a output
7482 function wins). Already formatted output may be embedded into further
7483 text via Output.raw; the result of Pretty.string_of/str_of and derived
7484 functions (string_of_term/cterm/thm etc.) is already marked raw to
7485 accommodate easy composition of diagnostic messages etc. Programmers
7486 rarely need to care about Output.output or Output.raw at all, with
7487 some notable exceptions: Output.output is required when bypassing the
7488 standard channels (writeln etc.), or in token translations to produce
7489 properly formatted results; Output.raw is required when capturing
7490 already output material that will eventually be presented to the user
7491 a second time. For the default print mode, both Output.output and
7492 Output.raw have no effect.
7494 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7495 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7496 cumulative results are displayed at the end of a batch session.
7498 * Pure/General: File.sysify_path and File.quote_sysify path have been
7499 replaced by File.platform_path and File.shell_path (with appropriate
7500 hooks). This provides a clean interface for unusual systems where the
7501 internal and external process view of file names are different.
7503 * Pure: more efficient orders for basic syntactic entities: added
7504 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7505 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7506 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7507 orders now -- potential INCOMPATIBILITY for code that depends on a
7508 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7509 Library.sort_strings on result).
7511 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7512 fold_types traverse types/terms from left to right, observing natural
7513 argument order. Supercedes previous foldl_XXX versions, add_frees,
7514 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7516 * Pure: name spaces have been refined, with significant changes of the
7517 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7518 to extern(_table). The plain name entry path is superceded by a
7519 general 'naming' context, which also includes the 'policy' to produce
7520 a fully qualified name and external accesses of a fully qualified
7521 name; NameSpace.extend is superceded by context dependent
7522 Sign.declare_name. Several theory and proof context operations modify
7523 the naming context. Especially note Theory.restore_naming and
7524 ProofContext.restore_naming to get back to a sane state; note that
7525 Theory.add_path is no longer sufficient to recover from
7526 Theory.absolute_path in particular.
7528 * Pure: new flags short_names (default false) and unique_names
7529 (default true) for controlling output of qualified names. If
7530 short_names is set, names are printed unqualified. If unique_names is
7531 reset, the name prefix is reduced to the minimum required to achieve
7532 the original result when interning again, even if there is an overlap
7533 with earlier declarations.
7535 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7536 now 'extend', and 'merge' gets an additional Pretty.pp argument
7537 (useful for printing error messages). INCOMPATIBILITY.
7539 * Pure: major reorganization of the theory context. Type Sign.sg and
7540 Theory.theory are now identified, referring to the universal
7541 Context.theory (see Pure/context.ML). Actual signature and theory
7542 content is managed as theory data. The old code and interfaces were
7543 spread over many files and structures; the new arrangement introduces
7544 considerable INCOMPATIBILITY to gain more clarity:
7546 Context -- theory management operations (name, identity, inclusion,
7547 parents, ancestors, merge, etc.), plus generic theory data;
7549 Sign -- logical signature and syntax operations (declaring consts,
7550 types, etc.), plus certify/read for common entities;
7552 Theory -- logical theory operations (stating axioms, definitions,
7553 oracles), plus a copy of logical signature operations (consts,
7554 types, etc.); also a few basic management operations (Theory.copy,
7557 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7558 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7559 for convenience -- they merely return the theory.
7561 * Pure: type Type.tsig is superceded by theory in most interfaces.
7563 * Pure: the Isar proof context type is already defined early in Pure
7564 as Context.proof (note that ProofContext.context and Proof.context are
7565 aliases, where the latter is the preferred name). This enables other
7566 Isabelle components to refer to that type even before Isar is present.
7568 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7569 typeK, constK, axiomK, oracleK), but provide explicit operations for
7570 any of these kinds. For example, Sign.intern typeK is now
7571 Sign.intern_type, Theory.hide_space Sign.typeK is now
7572 Theory.hide_types. Also note that former
7573 Theory.hide_classes/types/consts are now
7574 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7575 internalize their arguments! INCOMPATIBILITY.
7577 * Pure: get_thm interface (of PureThy and ProofContext) expects
7578 datatype thmref (with constructors Name and NameSelection) instead of
7579 plain string -- INCOMPATIBILITY;
7581 * Pure: cases produced by proof methods specify options, where NONE
7582 means to remove case bindings -- INCOMPATIBILITY in
7585 * Pure: the following operations retrieve axioms or theorems from a
7586 theory node or theory hierarchy, respectively:
7588 Theory.axioms_of: theory -> (string * term) list
7589 Theory.all_axioms_of: theory -> (string * term) list
7590 PureThy.thms_of: theory -> (string * thm) list
7591 PureThy.all_thms_of: theory -> (string * thm) list
7593 * Pure: print_tac now outputs the goal through the trace channel.
7595 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7596 Reference Toplevel.debug (default false) controls detailed printing
7597 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7598 controls execution profiling -- set to 1 for time and 2 for space
7599 (both increase the runtime).
7601 * Isar session: The initial use of ROOT.ML is now always timed,
7602 i.e. the log will show the actual process times, in contrast to the
7603 elapsed wall-clock time that the outer shell wrapper produces.
7605 * Simplifier: improved handling of bound variables (nameless
7606 representation, avoid allocating new strings). Simprocs that invoke
7607 the Simplifier recursively should use Simplifier.inherit_bounds to
7608 avoid local name clashes. Failure to do so produces warnings
7609 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7610 for further details.
7612 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7613 bindings for all theorems stored within a given theory; this may help
7614 in porting non-Isar theories to Isar ones, while keeping ML proof
7615 scripts for the time being.
7617 * ML operator HTML.with_charset specifies the charset begin used for
7618 generated HTML files. For example:
7620 HTML.with_charset "utf-8" use_thy "Hebrew";
7621 HTML.with_charset "utf-8" use_thy "Chinese";
7626 * Allow symlinks to all proper Isabelle executables (Isabelle,
7627 isabelle, isatool etc.).
7629 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7630 isatool doc, isatool mkdir, display_drafts etc.).
7632 * isatool usedir: option -f allows specification of the ML file to be
7633 used by Isabelle; default is ROOT.ML.
7635 * New isatool version outputs the version identifier of the Isabelle
7636 distribution being used.
7638 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7639 (containing Boolean satisfiability problems) into Isabelle/HOL
7644 New in Isabelle2004 (April 2004)
7645 --------------------------------
7649 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7650 Replaces linorder.ML.
7652 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7653 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7654 (\<a>...\<z>), are now considered normal letters, and can therefore
7655 be used anywhere where an ASCII letter (a...zA...Z) has until
7656 now. COMPATIBILITY: This obviously changes the parsing of some
7657 terms, especially where a symbol has been used as a binder, say
7658 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7659 as an identifier. Fix it by inserting a space around former
7660 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7661 existing theory and ML files.
7663 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7665 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7666 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7667 a normal (but invisible) letter. For multiple letter subscripts repeat
7668 \<^isub> like this: x\<^isub>1\<^isub>2.
7670 * Pure: There are now sub-/superscripts that can span more than one
7671 character. Text between \<^bsub> and \<^esub> is set in subscript in
7672 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7673 superscript. The new control characters are not identifier parts.
7675 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7676 content of "..." to the latex file instead of \isacntrl... . The "..."
7677 may consist of any printable characters excluding the end bracket >.
7679 * Pure: Using new Isar command "finalconsts" (or the ML functions
7680 Theory.add_finals or Theory.add_finals_i) it is now possible to
7681 declare constants "final", which prevents their being given a definition
7682 later. It is useful for constants whose behaviour is fixed axiomatically
7683 rather than definitionally, such as the meta-logic connectives.
7685 * Pure: 'instance' now handles general arities with general sorts
7686 (i.e. intersections of classes),
7688 * Presentation: generated HTML now uses a CSS style sheet to make layout
7689 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7690 It can be changed to alter the colors/layout of generated pages.
7695 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7696 cut_tac, subgoal_tac and thin_tac:
7697 - Now understand static (Isar) contexts. As a consequence, users of Isar
7698 locales are no longer forced to write Isar proof scripts.
7699 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7701 - INCOMPATIBILITY: names of variables to be instantiated may no
7702 longer be enclosed in quotes. Instead, precede variable name with `?'.
7703 This is consistent with the instantiation attribute "where".
7705 * Attributes "where" and "of":
7706 - Now take type variables of instantiated theorem into account when reading
7707 the instantiation string. This fixes a bug that caused instantiated
7708 theorems to have too special types in some circumstances.
7709 - "where" permits explicit instantiations of type variables.
7711 * Calculation commands "moreover" and "also" no longer interfere with
7712 current facts ("this"), admitting arbitrary combinations with "then"
7716 - Goal statements involving the context element "includes" no longer
7717 generate theorems with internal delta predicates (those ending on
7718 "_axioms") in the premise.
7719 Resolve particular premise with <locale>.intro to obtain old form.
7720 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7721 specification and "includes" elements in goal statement.
7722 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7723 [intro?] and [elim?] (respectively) by default.
7724 - Experimental command for instantiation of locales in proof contexts:
7725 instantiate <label>[<attrs>]: <loc>
7726 Instantiates locale <loc> and adds all its theorems to the current context
7727 taking into account their attributes. Label and attrs are optional
7728 modifiers, like in theorem declarations. If present, names of
7729 instantiated theorems are qualified with <label>, and the attributes
7730 <attrs> are applied after any attributes these theorems might have already.
7731 If the locale has assumptions, a chained fact of the form
7732 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7733 are derived. The command does not support old-style locales declared
7734 with "locale (open)".
7735 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7737 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7743 * Proof import: new image HOL4 contains the imported library from
7744 the HOL4 system with about 2500 theorems. It is imported by
7745 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7746 can be used like any other Isabelle image. See
7747 HOL/Import/HOL/README for more information.
7750 - Much improved handling of linear and partial orders.
7751 Reasoners for linear and partial orders are set up for type classes
7752 "linorder" and "order" respectively, and are added to the default simpset
7753 as solvers. This means that the simplifier can build transitivity chains
7754 to solve goals from the assumptions.
7755 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7756 of blast or auto after simplification become unnecessary because the goal
7757 is solved by simplification already.
7759 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7760 all proved in axiomatic type classes for semirings, rings and fields.
7763 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7764 now formalized using the Ring_and_Field theory mentioned above.
7765 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7766 than before, because now they are set up once in a generic manner.
7767 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7768 Look for the general versions in Ring_and_Field (and Power if they concern
7771 * Type "rat" of the rational numbers is now available in HOL-Complex.
7774 - Record types are now by default printed with their type abbreviation
7775 instead of the list of all field types. This can be configured via
7776 the reference "print_record_type_abbr".
7777 - Simproc "record_upd_simproc" for simplification of multiple updates added
7778 (not enabled by default).
7779 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7780 EX x. x = sel r to True (not enabled by default).
7781 - Tactic "record_split_simp_tac" to split and simplify records added.
7783 * 'specification' command added, allowing for definition by
7784 specification. There is also an 'ax_specification' command that
7785 introduces the new constants axiomatically.
7787 * arith(_tac) is now able to generate counterexamples for reals as well.
7789 * HOL-Algebra: new locale "ring" for non-commutative rings.
7791 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7792 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7794 * HOL-Matrix: a first theory for matrices in HOL with an application of
7795 matrix theory to linear programming.
7797 * Unions and Intersections:
7798 The latex output syntax of UN and INT has been changed
7799 from "\Union x \in A. B" to "\Union_{x \in A} B"
7800 i.e. the index formulae has become a subscript.
7801 Similarly for "\Union x. B", and for \Inter instead of \Union.
7803 * Unions and Intersections over Intervals:
7804 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7805 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7806 like in normal math, and corresponding versions for < and for intersection.
7808 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7809 lexicographic dictonary ordering has been added as "lexord".
7811 * ML: the legacy theory structures Int and List have been removed. They had
7812 conflicted with ML Basis Library structures having the same names.
7814 * 'refute' command added to search for (finite) countermodels. Only works
7815 for a fragment of HOL. The installation of an external SAT solver is
7816 highly recommended. See "HOL/Refute.thy" for details.
7818 * 'quickcheck' command: Allows to find counterexamples by evaluating
7819 formulae under an assignment of free variables to random values.
7820 In contrast to 'refute', it can deal with inductive datatypes,
7821 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7827 * Streams now come with concatenation and are part of the HOLCF image
7831 New in Isabelle2003 (May 2003)
7832 ------------------------------
7836 * Provers/simplifier:
7838 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7839 Assumptions are now subject to complete mutual simplification,
7840 not just from left to right. The simplifier now preserves
7841 the order of assumptions.
7843 Potential INCOMPATIBILITY:
7845 -- simp sometimes diverges where the old version did
7846 not, e.g. invoking simp on the goal
7848 [| P (f x); y = x; f x = f y |] ==> Q
7850 now gives rise to the infinite reduction sequence
7852 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7854 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7857 -- Tactics combining classical reasoner and simplification (such as auto)
7858 are also affected by this change, because many of them rely on
7859 simp. They may sometimes diverge as well or yield a different numbers
7860 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7861 in case of problems. Sometimes subsequent calls to the classical
7862 reasoner will fail because a preceeding call to the simplifier too
7863 eagerly simplified the goal, e.g. deleted redundant premises.
7865 - The simplifier trace now shows the names of the applied rewrite rules
7867 - You can limit the number of recursive invocations of the simplifier
7868 during conditional rewriting (where the simplifie tries to solve the
7869 conditions before applying the rewrite rule):
7870 ML "simp_depth_limit := n"
7871 where n is an integer. Thus you can force termination where previously
7872 the simplifier would diverge.
7874 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7876 - No longer aborts on failed congruence proof. Instead, the
7877 congruence is ignored.
7879 * Pure: New generic framework for extracting programs from constructive
7880 proofs. See HOL/Extraction.thy for an example instantiation, as well
7881 as HOL/Extraction for some case studies.
7883 * Pure: The main goal of the proof state is no longer shown by default, only
7884 the subgoals. This behaviour is controlled by a new flag.
7885 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7886 (ML: Proof.show_main_goal).
7888 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7889 rules whose conclusion matches subgoal 1:
7890 PG menu: Isabelle/Isar -> Show me -> matching rules
7891 The rules are ordered by how closely they match the subgoal.
7892 In particular, rules that solve a subgoal outright are displayed first
7893 (or rather last, the way they are printed).
7894 (ML: ProofGeneral.print_intros())
7896 * Pure: New flag trace_unify_fail causes unification to print
7897 diagnostic information (PG: in trace buffer) when it fails. This is
7898 useful for figuring out why single step proofs like rule, erule or
7901 * Pure: Locale specifications now produce predicate definitions
7902 according to the body of text (covering assumptions modulo local
7903 definitions); predicate "loc_axioms" covers newly introduced text,
7904 while "loc" is cumulative wrt. all included locale expressions; the
7905 latter view is presented only on export into the global theory
7906 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7907 on the old view without predicates;
7909 * Pure: predefined locales "var" and "struct" are useful for sharing
7910 parameters (as in CASL, for example); just specify something like
7911 ``var x + var y + struct M'' as import;
7913 * Pure: improved thms_containing: proper indexing of facts instead of
7914 raw theorems; check validity of results wrt. current name space;
7915 include local facts of proof configuration (also covers active
7916 locales), cover fixed variables in index; may use "_" in term
7917 specification; an optional limit for the number of printed facts may
7918 be given (the default is 40);
7920 * Pure: disallow duplicate fact bindings within new-style theory files
7923 * Provers: improved induct method: assumptions introduced by case
7924 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7925 the goal statement); "foo" still refers to all facts collectively;
7927 * Provers: the function blast.overloaded has been removed: all constants
7928 are regarded as potentially overloaded, which improves robustness in exchange
7929 for slight decrease in efficiency;
7931 * Provers/linorder: New generic prover for transitivity reasoning over
7932 linear orders. Note: this prover is not efficient!
7934 * Isar: preview of problems to finish 'show' now produce an error
7935 rather than just a warning (in interactive mode);
7942 - Produces a counter example if it cannot prove a goal.
7943 Note that the counter example may be spurious if the goal is not a formula
7944 of quantifier-free linear arithmetic.
7945 In ProofGeneral the counter example appears in the trace buffer.
7947 - Knows about div k and mod k where k is a numeral of type nat or int.
7949 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7950 linear arithmetic fails. This takes account of quantifiers and divisibility.
7951 Presburger arithmetic can also be called explicitly via presburger(_tac).
7953 * simp's arithmetic capabilities have been enhanced a bit: it now
7954 takes ~= in premises into account (by performing a case split);
7956 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7957 are distributed over a sum of terms;
7959 * New tactic "trans_tac" and method "trans" instantiate
7960 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7963 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7964 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7966 * 'typedef' command has new option "open" to suppress the set
7969 * functions Min and Max on finite sets have been introduced (theory
7972 * attribute [symmetric] now works for relations as well; it turns
7973 (x,y) : R^-1 into (y,x) : R, and vice versa;
7975 * induct over a !!-quantified statement (say !!x1..xn):
7976 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7978 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7979 %x. None. Warning: empty_def now refers to the previously hidden definition
7982 * Algebra: formalization of classical algebra. Intended as base for
7983 any algebraic development in Isabelle. Currently covers group theory
7984 (up to Sylow's theorem) and ring theory (Universal Property of
7985 Univariate Polynomials). Contributions welcome;
7987 * GroupTheory: deleted, since its material has been moved to Algebra;
7989 * Complex: new directory of the complex numbers with numeric constants,
7990 nonstandard complex numbers, and some complex analysis, standard and
7991 nonstandard (Jacques Fleuriot);
7993 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7995 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7998 * Real/HahnBanach: updated and adapted to locales;
8000 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8003 * UNITY: added the Meier-Sanders theory of progress sets;
8005 * MicroJava: bytecode verifier and lightweight bytecode verifier
8006 as abstract algorithms, instantiated to the JVM;
8008 * Bali: Java source language formalization. Type system, operational
8009 semantics, axiomatic semantics. Supported language features:
8010 classes, interfaces, objects,virtual methods, static methods,
8011 static/instance fields, arrays, access modifiers, definite
8012 assignment, exceptions.
8017 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8020 * Main ZF: virtually all theories converted to new-style format;
8025 * Pure: Tactic.prove provides sane interface for internal proofs;
8026 omits the infamous "standard" operation, so this is more appropriate
8027 than prove_goalw_cterm in many situations (e.g. in simprocs);
8029 * Pure: improved error reporting of simprocs;
8031 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8035 *** Document preparation ***
8037 * uses \par instead of \\ for line breaks in theory text. This may
8038 shift some page breaks in large documents. To get the old behaviour
8039 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8041 * minimized dependencies of isabelle.sty and isabellesym.sty on
8044 * \<euro> now needs package babel/greek instead of marvosym (which
8047 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8052 New in Isabelle2002 (March 2002)
8053 --------------------------------
8055 *** Document preparation ***
8057 * greatly simplified document preparation setup, including more
8058 graceful interpretation of isatool usedir -i/-d/-D options, and more
8059 instructive isatool mkdir; users should basically be able to get
8060 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8061 users may run a separate document processing stage manually like this:
8062 "isatool usedir -D output HOL Test && isatool document Test/output";
8064 * theory dependency graph may now be incorporated into documents;
8065 isatool usedir -g true will produce session_graph.eps/.pdf for use
8066 with \includegraphics of LaTeX;
8068 * proper spacing of consecutive markup elements, especially text
8069 blocks after section headings;
8071 * support bold style (for single symbols only), input syntax is like
8072 this: "\<^bold>\<alpha>" or "\<^bold>A";
8074 * \<bullet> is now output as bold \cdot by default, which looks much
8075 better in printed text;
8077 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8078 note that these symbols are currently unavailable in Proof General /
8079 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8081 * isatool latex no longer depends on changed TEXINPUTS, instead
8082 isatool document copies the Isabelle style files to the target
8088 * Pure/Provers: improved proof by cases and induction;
8089 - 'case' command admits impromptu naming of parameters (such as
8091 - 'induct' method divinates rule instantiation from the inductive
8092 claim; no longer requires excessive ?P bindings for proper
8093 instantiation of cases;
8094 - 'induct' method properly enumerates all possibilities of set/type
8095 rules; as a consequence facts may be also passed through *type*
8096 rules without further ado;
8097 - 'induct' method now derives symbolic cases from the *rulified*
8098 rule (before it used to rulify cases stemming from the internal
8099 atomized version); this means that the context of a non-atomic
8100 statement becomes is included in the hypothesis, avoiding the
8101 slightly cumbersome show "PROP ?case" form;
8102 - 'induct' may now use elim-style induction rules without chaining
8103 facts, using ``missing'' premises from the goal state; this allows
8104 rules stemming from inductive sets to be applied in unstructured
8105 scripts, while still benefitting from proper handling of non-atomic
8106 statements; NB: major inductive premises need to be put first, all
8107 the rest of the goal is passed through the induction;
8108 - 'induct' proper support for mutual induction involving non-atomic
8109 rule statements (uses the new concept of simultaneous goals, see
8111 - append all possible rule selections, but only use the first
8112 success (no backtracking);
8113 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8114 - undeclared rule case names default to numbers 1, 2, 3, ...;
8115 - added 'print_induct_rules' (covered by help item in recent Proof
8117 - moved induct/cases attributes to Pure, methods to Provers;
8118 - generic method setup instantiated for FOL and HOL;
8120 * Pure: support multiple simultaneous goal statements, for example
8121 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8122 meta-level mechanism, this acts as if several individual goals had
8123 been stated separately; in particular common proof methods need to be
8124 repeated in order to cover all claims; note that a single elimination
8125 step is *not* sufficient to establish the two conjunctions, so this
8128 assume "A & B" then have A and B .. (*".." fails*)
8130 better use "obtain" in situations as above; alternative refer to
8131 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8133 * Pure: proper integration with ``locales''; unlike the original
8134 version by Florian Kammller, Isar locales package high-level proof
8135 contexts rather than raw logical ones (e.g. we admit to include
8136 attributes everywhere); operations on locales include merge and
8137 rename; support for implicit arguments (``structures''); simultaneous
8138 type-inference over imports and text; see also HOL/ex/Locales.thy for
8141 * Pure: the following commands have been ``localized'', supporting a
8142 target locale specification "(in name)": 'lemma', 'theorem',
8143 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8144 stored both within the locale and at the theory level (exported and
8145 qualified by the locale name);
8147 * Pure: theory goals may now be specified in ``long'' form, with
8148 ad-hoc contexts consisting of arbitrary locale elements. for example
8149 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8150 definitions may be given, too); the result is a meta-level rule with
8151 the context elements being discharged in the obvious way;
8153 * Pure: new proof command 'using' allows to augment currently used
8154 facts after a goal statement ('using' is syntactically analogous to
8155 'apply', but acts on the goal's facts only); this allows chained facts
8156 to be separated into parts given before and after a claim, as in
8157 ``from a and b have C using d and e <proof>'';
8159 * Pure: renamed "antecedent" case to "rule_context";
8161 * Pure: new 'judgment' command records explicit information about the
8162 object-logic embedding (used by several tools internally); no longer
8163 use hard-wired "Trueprop";
8165 * Pure: added 'corollary' command;
8167 * Pure: fixed 'token_translation' command;
8169 * Pure: removed obsolete 'exported' attribute;
8171 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8172 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8173 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8175 * Pure: method 'atomize' presents local goal premises as object-level
8176 statements (atomic meta-level propositions); setup controlled via
8177 rewrite rules declarations of 'atomize' attribute; example
8178 application: 'induct' method with proper rule statements in improper
8181 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8182 now consider the syntactic context of assumptions, giving a better
8183 chance to get type-inference of the arguments right (this is
8184 especially important for locales);
8186 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8189 * Pure/obtain: the formal conclusion "thesis", being marked as
8190 ``internal'', may no longer be reference directly in the text;
8191 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8194 * Pure: generic 'sym' attribute which declares a rule both as pure
8195 'elim?' and for the 'symmetric' operation;
8197 * Pure: marginal comments ``--'' may now occur just anywhere in the
8198 text; the fixed correlation with particular command syntax has been
8201 * Pure: new method 'rules' is particularly well-suited for proof
8202 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8203 but often produces more compact proof terms with less detours;
8205 * Pure/Provers/classical: simplified integration with pure rule
8206 attributes and methods; the classical "intro?/elim?/dest?"
8207 declarations coincide with the pure ones; the "rule" method no longer
8208 includes classically swapped intros; "intro" and "elim" methods no
8209 longer pick rules from the context; also got rid of ML declarations
8210 AddXIs/AddXEs/AddXDs; all of this has some potential for
8213 * Provers/classical: attribute 'swapped' produces classical inversions
8214 of introduction rules;
8216 * Provers/simplifier: 'simplified' attribute may refer to explicit
8217 rules instead of full simplifier context; 'iff' attribute handles
8220 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8222 * HOL: 'recdef' now fails on unfinished automated proofs, use
8223 "(permissive)" option to recover old behavior;
8225 * HOL: 'inductive' no longer features separate (collective) attributes
8226 for 'intros' (was found too confusing);
8228 * HOL: properly declared induction rules less_induct and
8234 * HOL: moved over to sane numeral syntax; the new policy is as
8237 - 0 and 1 are polymorphic constants, which are defined on any
8238 numeric type (nat, int, real etc.);
8240 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8241 binary representation internally;
8243 - type nat has special constructor Suc, and generally prefers Suc 0
8244 over 1::nat and Suc (Suc 0) over 2::nat;
8246 This change may cause significant problems of INCOMPATIBILITY; here
8247 are some hints on converting existing sources:
8249 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8250 entities, so expressions involving "-" (unary or binary minus) need
8251 to be spaced properly;
8253 - existing occurrences of "1" may need to be constraint "1::nat" or
8254 even replaced by Suc 0; similar for old "2";
8256 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8258 - remove all special provisions on numerals in proofs;
8260 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8261 representation (depends on bin_arith_simps in the default context);
8263 * HOL: symbolic syntax for x^2 (numeral 2);
8265 * HOL: the class of all HOL types is now called "type" rather than
8266 "term"; INCOMPATIBILITY, need to adapt references to this type class
8267 in axclass/classes, instance/arities, and (usually rare) occurrences
8268 in typings (of consts etc.); internally the class is called
8269 "HOL.type", ML programs should refer to HOLogic.typeS;
8271 * HOL/record package improvements:
8272 - new derived operations "fields" to build a partial record section,
8273 "extend" to promote a fixed record to a record scheme, and
8274 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8275 declared as simp by default;
8276 - shared operations ("more", "fields", etc.) now need to be always
8277 qualified) --- potential INCOMPATIBILITY;
8278 - removed "make_scheme" operations (use "make" with "extend") --
8280 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8281 - provides cases/induct rules for use with corresponding Isar
8282 methods (for concrete records, record schemes, concrete more
8283 parts, and schematic more parts -- in that order);
8284 - internal definitions directly based on a light-weight abstract
8285 theory of product types over typedef rather than datatype;
8287 * HOL: generic code generator for generating executable ML code from
8288 specifications; specific support for HOL constructs such as inductive
8289 datatypes and sets, as well as recursive functions; can be invoked
8290 via 'generate_code' theory section;
8292 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8294 * HOL: consolidated and renamed several theories. In particular:
8295 Ord.thy has been absorbed into HOL.thy
8296 String.thy has been absorbed into List.thy
8298 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8299 (beware of argument permutation!);
8301 * HOL: linorder_less_split superseded by linorder_cases;
8303 * HOL/List: "nodups" renamed to "distinct";
8305 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8306 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8307 - Ex_def has changed, now need to use some_eq_ex
8309 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8310 in this (rare) case use:
8312 delSWrapper "split_all_tac"
8313 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8315 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8318 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8319 Isabelle's type classes, ^ on functions and relations has too general
8320 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8321 necessary to attach explicit type constraints;
8323 * HOL/Relation: the prefix name of the infix "O" has been changed from
8324 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8325 renamed accordingly (eg "compI" -> "rel_compI").
8327 * HOL: syntax translations now work properly with numerals and records
8330 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8331 of "lam" -- INCOMPATIBILITY;
8333 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8334 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8335 renamed "Product_Type.unit";
8337 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8339 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8340 the "cases" method);
8342 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8345 * HOL/IMP: updated and converted to new-style theory format; several
8346 parts turned into readable document, with proper Isar proof texts and
8347 some explanations (by Gerwin Klein);
8349 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8351 * HOL-Hyperreal is now a logic image;
8356 * Isar: consts/constdefs supports mixfix syntax for continuous
8359 * Isar: domain package adapted to new-style theory format, e.g. see
8362 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8363 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8364 lift.induct_tac, always use UU instead of Undef;
8366 * HOLCF/IMP: updated and converted to new-style theory;
8371 * Isar: proper integration of logic-specific tools and packages,
8372 including theory commands '(co)inductive', '(co)datatype',
8373 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8374 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8376 * theory Main no longer includes AC; for the Axiom of Choice, base
8377 your theory on Main_ZFC;
8379 * the integer library now covers quotients and remainders, with many
8380 laws relating division to addition, multiplication, etc.;
8382 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8383 typeless version of the formalism;
8385 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8388 * ZF/Induct: new directory for examples of inductive definitions,
8389 including theory Multiset for multiset orderings; converted to
8390 new-style theory format;
8392 * ZF: many new theorems about lists, ordinals, etc.;
8397 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8398 variable proof controls level of detail: 0 = no proofs (only oracle
8399 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8400 also ref manual for further ML interfaces;
8402 * Pure/axclass: removed obsolete ML interface
8403 goal_subclass/goal_arity;
8405 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8406 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8407 separate tokens, so expressions involving minus need to be spaced
8410 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8411 rather than "infixl" or "infixr";
8413 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8414 sort constraint specifications in type inference; e.g. "x::_::foo"
8415 ensures that the type of "x" is of sort "foo" (but not necessarily a
8418 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8419 control output of nested => (types); the default behavior is
8422 * Pure/syntax: builtin parse translation for "_constify" turns valued
8423 tokens into AST constants;
8425 * Pure/syntax: prefer later declarations of translations and print
8426 translation functions; potential INCOMPATIBILITY: need to reverse
8427 multiple declarations for same syntax element constant;
8429 * Pure/show_hyps reset by default (in accordance to existing Isar
8432 * Provers/classical: renamed addaltern to addafter, addSaltern to
8435 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8438 * system: tested support for MacOS X; should be able to get Isabelle +
8439 Proof General to work in a plain Terminal after installing Poly/ML
8440 (e.g. from the Isabelle distribution area) and GNU bash alone
8441 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8442 support requires further installations, e.g. from
8443 http://fink.sourceforge.net/);
8445 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8447 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8448 of 40 MB), cf. ML_OPTIONS;
8450 * system: Proof General keywords specification is now part of the
8451 Isabelle distribution (see etc/isar-keywords.el);
8453 * system: support for persistent Proof General sessions (refrain from
8454 outdating all loaded theories on startup); user may create writable
8455 logic images like this: ``isabelle -q HOL Test'';
8457 * system: smart selection of Isabelle process versus Isabelle
8458 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8459 run both "isabelle" and "Isabelle" even if file names are badly
8460 damaged (executable inspects the case of the first letter of its own
8461 name); added separate "isabelle-process" and "isabelle-interface";
8463 * system: refrain from any attempt at filtering input streams; no
8464 longer support ``8bit'' encoding of old isabelle font, instead proper
8465 iso-latin characters may now be used; the related isatools
8466 "symbolinput" and "nonascii" have disappeared as well;
8468 * system: removed old "xterm" interface (the print modes "xterm" and
8469 "xterm_color" are still available for direct use in a suitable
8474 New in Isabelle99-2 (February 2001)
8475 -----------------------------------
8477 *** Overview of INCOMPATIBILITIES ***
8479 * HOL: please note that theories in the Library and elsewhere often use the
8480 new-style (Isar) format; to refer to their theorems in an ML script you must
8481 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8483 * HOL: inductive package no longer splits induction rule aggressively,
8484 but only as far as specified by the introductions given; the old
8485 format may be recovered via ML function complete_split_rule or attribute
8486 'split_rule (complete)';
8488 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8489 gfp_Tarski to gfp_unfold;
8491 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8493 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8494 relation); infix "^^" has been renamed "``"; infix "``" has been
8495 renamed "`"; "univalent" has been renamed "single_valued";
8497 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8500 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8502 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8504 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8505 consequence, it is no longer monotonic wrt. the local goal context
8506 (which is now passed through the inductive cases);
8508 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8509 \<gg> to \<ggreater>;
8512 *** Document preparation ***
8514 * \isabellestyle{NAME} selects version of Isabelle output (currently
8515 available: are "it" for near math-mode best-style output, "sl" for
8516 slanted text style, and "tt" for plain type-writer; if no
8517 \isabellestyle command is given, output is according to slanted
8520 * support sub/super scripts (for single symbols only), input syntax is
8521 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8523 * some more standard symbols; see Appendix A of the system manual for
8524 the complete list of symbols defined in isabellesym.sty;
8526 * improved isabelle style files; more abstract symbol implementation
8527 (should now use \isamath{...} and \isatext{...} in custom symbol
8530 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8531 state; Note that presentation of goal states does not conform to
8532 actual human-readable proof documents. Please do not include goal
8533 states into document output unless you really know what you are doing!
8535 * proper indentation of antiquoted output with proportional LaTeX
8538 * no_document ML operator temporarily disables LaTeX document
8541 * isatool unsymbolize tunes sources for plain ASCII communication;
8546 * Pure: Isar now suffers initial goal statements to contain unbound
8547 schematic variables (this does not conform to actual readable proof
8548 documents, due to unpredictable outcome and non-compositional proof
8549 checking); users who know what they are doing may use schematic goals
8550 for Prolog-style synthesis of proven results;
8552 * Pure: assumption method (an implicit finishing) now handles actual
8555 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8556 initial goal, declare "that" only as Pure intro (only for single
8557 steps); the "that" rule assumption may now be involved in implicit
8558 finishing, thus ".." becomes a feasible for trivial obtains;
8560 * Pure: default proof step now includes 'intro_classes'; thus trivial
8561 instance proofs may be performed by "..";
8563 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8566 * Pure: more robust selection of calculational rules;
8568 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8569 rule (as well as the assumption rule);
8571 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8572 lemmas, using the graph browser tool;
8574 * Pure: predict failure of "show" in interactive mode;
8576 * Pure: 'thms_containing' now takes actual terms as arguments;
8578 * HOL: improved method 'induct' --- now handles non-atomic goals
8579 (potential INCOMPATIBILITY); tuned error handling;
8581 * HOL: cases and induct rules now provide explicit hints about the
8582 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8583 any remaining facts are inserted into the goal verbatim;
8585 * HOL: local contexts (aka cases) may now contain term bindings as
8586 well; the 'cases' and 'induct' methods new provide a ?case binding for
8587 the result to be shown in each case;
8589 * HOL: added 'recdef_tc' command;
8591 * isatool convert assists in eliminating legacy ML scripts;
8596 * HOL/Library: a collection of generic theories to be used together
8597 with main HOL; the theory loader path already includes this directory
8598 by default; the following existing theories have been moved here:
8599 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8600 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8602 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8603 modelling and verification task performed in Isabelle/HOL +
8604 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8606 * HOL/Algebra: special summation operator SUM no longer exists, it has
8607 been replaced by setsum; infix 'assoc' now has priority 50 (like
8608 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8609 'domain', this makes the theory consistent with mathematical
8612 * HOL basics: added overloaded operations "inverse" and "divide"
8613 (infix "/"), syntax for generic "abs" operation, generic summation
8616 * HOL/typedef: simplified package, provide more useful rules (see also
8619 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8620 now expressed as a proper nested rule (old-style tactic scripts may
8621 require atomize_strip_tac to cope with non-atomic premises);
8623 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8624 to "split_conv" (old name still available for compatibility);
8626 * HOL: improved concrete syntax for strings (e.g. allows translation
8627 rules with string literals);
8629 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8630 and Fleuriot's mechanization of analysis, including the transcendental
8631 functions for the reals;
8633 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8638 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8639 "lam" is displayed as TWO lambda-symbols
8641 * CTT: theory Main now available, containing everything (that is, Bool
8647 * Pure: the Simplifier has been implemented properly as a derived rule
8648 outside of the actual kernel (at last!); the overall performance
8649 penalty in practical applications is about 50%, while reliability of
8650 the Isabelle inference kernel has been greatly improved;
8652 * print modes "brackets" and "no_brackets" control output of nested =>
8653 (types) and ==> (props); the default behaviour is "brackets";
8655 * Provers: fast_tac (and friends) now handle actual object-logic rules
8656 as assumptions as well;
8658 * system: support Poly/ML 4.0;
8660 * system: isatool install handles KDE version 1 or 2;
8664 New in Isabelle99-1 (October 2000)
8665 ----------------------------------
8667 *** Overview of INCOMPATIBILITIES ***
8669 * HOL: simplification of natural numbers is much changed; to partly
8670 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8671 issue the following ML commands:
8673 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8674 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8676 * HOL: simplification no longer dives into case-expressions; this is
8677 controlled by "t.weak_case_cong" for each datatype t;
8679 * HOL: nat_less_induct renamed to less_induct;
8681 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8682 fixsome to patch .thy and .ML sources automatically;
8684 select_equality -> some_equality
8685 select_eq_Ex -> some_eq_ex
8686 selectI2EX -> someI2_ex
8689 select1_equality -> some1_equality
8690 Eps_sym_eq -> some_sym_eq_trivial
8691 Eps_eq -> some_eq_trivial
8693 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8695 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8698 * HOL: the recursion equations generated by 'recdef' are now called
8699 f.simps instead of f.rules;
8701 * HOL: qed_spec_mp now also handles bounded ALL as well;
8703 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8704 sometimes be needed;
8706 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8708 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8710 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8711 product is now "<*>" instead of "Times"; the lexicographic product is
8712 now "<*lex*>" instead of "**";
8714 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8715 of main HOL, but was unused); better use HOL's datatype package;
8717 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8718 the old syntax may be recovered as follows:
8721 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8722 (infixl "\\<oplus>" 100)
8724 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8726 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8727 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8730 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8731 changed from A/r to A//r;
8733 * ZF: new treatment of arithmetic (nat & int) may break some old
8736 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8737 rulify -> rule_format, elimify -> elim_format, ...);
8739 * Isar/Provers: intro/elim/dest attributes changed; renamed
8740 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8741 should have to change intro!! to intro? only); replaced "delrule" by
8744 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8746 * Provers: strengthened force_tac by using new first_best_tac;
8748 * LaTeX document preparation: several changes of isabelle.sty (see
8752 *** Document preparation ***
8754 * formal comments (text blocks etc.) in new-style theories may now
8755 contain antiquotations of thm/prop/term/typ/text to be presented
8756 according to latex print mode; concrete syntax is like this:
8757 @{term[show_types] "f(x) = a + x"};
8759 * isatool mkdir provides easy setup of Isabelle session directories,
8760 including proper document sources;
8762 * generated LaTeX sources are now deleted after successful run
8763 (isatool document -c); may retain a copy somewhere else via -D option
8766 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8767 style files, achieving self-contained LaTeX sources and simplifying
8770 * old-style theories now produce (crude) LaTeX output as well;
8772 * browser info session directories are now self-contained (may be put
8773 on WWW server seperately); improved graphs of nested sessions; removed
8774 graph for 'all sessions';
8776 * several improvements in isabelle style files; \isabellestyle{it}
8777 produces fake math mode output; \isamarkupheader is now \section by
8778 default; see lib/texinputs/isabelle.sty etc.;
8783 * Isar/Pure: local results and corresponding term bindings are now
8784 subject to Hindley-Milner polymorphism (similar to ML); this
8785 accommodates incremental type-inference very nicely;
8787 * Isar/Pure: new derived language element 'obtain' supports
8788 generalized existence reasoning;
8790 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8791 support accumulation of results, without applying any rules yet;
8792 useful to collect intermediate results without explicit name
8793 references, and for use with transitivity rules with more than 2
8796 * Isar/Pure: scalable support for case-analysis type proofs: new
8797 'case' language element refers to local contexts symbolically, as
8798 produced by certain proof methods; internally, case names are attached
8799 to theorems as "tags";
8801 * Isar/Pure: theory command 'hide' removes declarations from
8802 class/type/const name spaces;
8804 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8805 indicate potential overloading;
8807 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8809 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8810 "{a,b,c}" instead of {a,b,c};
8812 * Isar/Pure now provides its own version of intro/elim/dest
8813 attributes; useful for building new logics, but beware of confusion
8814 with the version in Provers/classical;
8816 * Isar/Pure: the local context of (non-atomic) goals is provided via
8817 case name 'antecedent';
8819 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8820 to the current context is now done automatically);
8822 * Isar/Pure: theory command 'method_setup' provides a simple interface
8823 for definining proof methods in ML;
8825 * Isar/Provers: intro/elim/dest attributes changed; renamed
8826 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8827 most cases, one should have to change intro!! to intro? only);
8828 replaced "delrule" by "rule del";
8830 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8831 'symmetric' attribute (the latter supercedes [RS sym]);
8833 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8834 method modifier); 'simp' method: 'only:' modifier removes loopers as
8835 well (including splits);
8837 * Isar/Provers: Simplifier and Classical methods now support all kind
8838 of modifiers used in the past, including 'cong', 'iff', etc.
8840 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8841 of Simplifier and Classical reasoner);
8843 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8844 now support named cases; major packages (inductive, datatype, primrec,
8845 recdef) support case names and properly name parameters;
8847 * Isar/HOL: new transitivity rules for substitution in inequalities --
8848 monotonicity conditions are extracted to be proven at end of
8851 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8854 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8855 split_if split_if_asm; datatype package provides theorems foo.splits =
8856 foo.split foo.split_asm for each datatype;
8858 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8859 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8860 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8861 use "(cases (simplified))" method in proper proof texts);
8863 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8865 * Isar: names of theorems etc. may be natural numbers as well;
8867 * Isar: 'pr' command: optional arguments for goals_limit and
8868 ProofContext.prems_limit; no longer prints theory contexts, but only
8871 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8872 additional print modes to be specified; e.g. "pr(latex)" will print
8873 proof state according to the Isabelle LaTeX style;
8875 * Isar: improved support for emulating tactic scripts, including proof
8876 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8877 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8878 (for HOL datatypes);
8880 * Isar: simplified (more robust) goal selection of proof methods: 1st
8881 goal, all goals, or explicit goal specifier (tactic emulation); thus
8882 'proof method scripts' have to be in depth-first order;
8884 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8886 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8887 should instead use individual commands for printing items
8888 (print_commands, print_methods etc.);
8890 * Isar: added 'nothing' --- the empty list of theorems;
8895 * HOL/MicroJava: formalization of a fragment of Java, together with a
8896 corresponding virtual machine and a specification of its bytecode
8897 verifier and a lightweight bytecode verifier, including proofs of
8898 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8899 Cornelia Pusch (see also the homepage of project Bali at
8900 http://isabelle.in.tum.de/Bali/);
8902 * HOL/Algebra: new theory of rings and univariate polynomials, by
8905 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8906 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8909 * HOL/Lattice: fundamental concepts of lattice theory and order
8910 structures, including duals, properties of bounds versus algebraic
8911 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8912 Theorem for complete lattices etc.; may also serve as a demonstration
8913 for abstract algebraic reasoning using axiomatic type classes, and
8914 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8916 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8919 * HOL/IMPP: extension of IMP with local variables and mutually
8920 recursive procedures, by David von Oheimb;
8922 * HOL/Lambda: converted into new-style theory and document;
8924 * HOL/ex/Multiquote: example of multiple nested quotations and
8925 anti-quotations -- basically a generalized version of de-Bruijn
8926 representation; very useful in avoiding lifting of operations;
8928 * HOL/record: added general record equality rule to simpset; fixed
8929 select-update simplification procedure to handle extended records as
8930 well; admit "r" as field name;
8932 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8933 other numeric types and also as the identity of groups, rings, etc.;
8935 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8936 Types nat and int belong to this axclass;
8938 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8939 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8940 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8941 two terms #m*u and #n*u are replaced by #(m+n)*u
8942 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8943 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8944 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8946 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8947 powerful prover for predicate logic but knows nothing of clasets; see
8948 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8950 * HOL: new version of "case_tac" subsumes both boolean case split and
8951 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8952 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8954 * HOL: simplification no longer dives into case-expressions: only the
8955 selector expression is simplified, but not the remaining arms; to
8956 enable full simplification of case-expressions for datatype t, you may
8957 remove t.weak_case_cong from the simpset, either globally (Delcongs
8958 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8960 * HOL/recdef: the recursion equations generated by 'recdef' for
8961 function 'f' are now called f.simps instead of f.rules; if all
8962 termination conditions are proved automatically, these simplification
8963 rules are added to the simpset, as in primrec; rules may be named
8964 individually as well, resulting in a separate list of theorems for
8967 * HOL/While is a new theory that provides a while-combinator. It
8968 permits the definition of tail-recursive functions without the
8969 provision of a termination measure. The latter is necessary once the
8970 invariant proof rule for while is applied.
8972 * HOL: new (overloaded) notation for the set of elements below/above
8973 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8975 * HOL: theorems impI, allI, ballI bound as "strip";
8977 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8978 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8979 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8981 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8983 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8984 main HOL, but was unused);
8986 * HOL: fewer consts declared as global (e.g. have to refer to
8987 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8989 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8990 in case of overlap with user translations (e.g. judgements over
8991 tuples); (note that the underlying logical represenation is still
8997 * ZF: simplification automatically cancels common terms in arithmetic
8998 expressions over nat and int;
9000 * ZF: new treatment of nat to minimize type-checking: all operators
9001 coerce their operands to a natural number using the function natify,
9002 making the algebraic laws unconditional;
9004 * ZF: as above, for int: operators coerce their operands to an integer
9005 using the function intify;
9007 * ZF: the integer library now contains many of the usual laws for the
9008 orderings, including $<=, and monotonicity laws for $+ and $*;
9010 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9013 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9014 to the simplifier and classical reasoner simultaneously;
9019 * Provers: blast_tac now handles actual object-logic rules as
9020 assumptions; note that auto_tac uses blast_tac internally as well;
9022 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9023 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9025 * Provers: delrules now handles destruct rules as well (no longer need
9026 explicit make_elim);
9028 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9029 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9030 use instead the strong form,
9031 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9032 in HOL, FOL and ZF the function cla_make_elim will create such rules
9033 from destruct-rules;
9035 * Provers: Simplifier.easy_setup provides a fast path to basic
9036 Simplifier setup for new object-logics;
9038 * Pure: AST translation rules no longer require constant head on LHS;
9040 * Pure: improved name spaces: ambiguous output is qualified; support
9041 for hiding of names;
9043 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9044 XSYMBOL_HOME; no longer need to do manual configuration in most
9047 * system: compression of ML heaps images may now be controlled via -c
9048 option of isabelle and isatool usedir (currently only observed by
9051 * system: isatool installfonts may handle X-Symbol fonts as well (very
9052 useful for remote X11);
9054 * system: provide TAGS file for Isabelle sources;
9056 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9059 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9060 timing flag supersedes proof_timing and Toplevel.trace;
9062 * ML: new combinators |>> and |>>> for incremental transformations
9063 with secondary results (e.g. certain theory extensions):
9065 * ML: PureThy.add_defs gets additional argument to indicate potential
9066 overloading (usually false);
9068 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9073 New in Isabelle99 (October 1999)
9074 --------------------------------
9076 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9078 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9079 are no longer simplified. (This allows the simplifier to unfold recursive
9080 functional programs.) To restore the old behaviour, declare
9082 Delcongs [if_weak_cong];
9084 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9087 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9089 * HOL/datatype: mutual_induct_tac no longer exists --
9090 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9092 * HOL/typedef: fixed type inference for representing set; type
9093 arguments now have to occur explicitly on the rhs as type constraints;
9095 * ZF: The con_defs part of an inductive definition may no longer refer
9096 to constants declared in the same theory;
9098 * HOL, ZF: the function mk_cases, generated by the inductive
9099 definition package, has lost an argument. To simplify its result, it
9100 uses the default simpset instead of a supplied list of theorems.
9102 * HOL/List: the constructors of type list are now Nil and Cons;
9104 * Simplifier: the type of the infix ML functions
9105 setSSolver addSSolver setSolver addSolver
9106 is now simpset * solver -> simpset where `solver' is a new abstract type
9107 for packaging solvers. A solver is created via
9108 mk_solver: string -> (thm list -> int -> tactic) -> solver
9109 where the string argument is only a comment.
9114 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9115 decision procedure for linear arithmetic. Currently it is used for
9116 types `nat', `int', and `real' in HOL (see below); it can, should and
9117 will be instantiated for other types and logics as well.
9119 * The simplifier now accepts rewrite rules with flexible heads, eg
9120 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9121 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9127 * New Isabelle/Isar subsystem provides an alternative to traditional
9128 tactical theorem proving; together with the ProofGeneral/isar user
9129 interface it offers an interactive environment for developing human
9130 readable proof documents (Isar == Intelligible semi-automated
9131 reasoning); for further information see isatool doc isar-ref,
9132 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9134 * improved and simplified presentation of theories: better HTML markup
9135 (including colors), graph views in several sizes; isatool usedir now
9136 provides a proper interface for user theories (via -P option); actual
9137 document preparation based on (PDF)LaTeX is available as well (for
9138 new-style theories only); see isatool doc system for more information;
9140 * native support for Proof General, both for classic Isabelle and
9143 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9144 using the graph browser tool;
9146 * Isabelle manuals now also available as PDF;
9148 * theory loader rewritten from scratch (may not be fully
9149 bug-compatible); old loadpath variable has been replaced by show_path,
9150 add_path, del_path, reset_path functions; new operations such as
9151 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9154 * improved isatool install: option -k creates KDE application icon,
9155 option -p DIR installs standalone binaries;
9157 * added ML_PLATFORM setting (useful for cross-platform installations);
9158 more robust handling of platform specific ML images for SML/NJ;
9160 * the settings environment is now statically scoped, i.e. it is never
9161 created again in sub-processes invoked from isabelle, isatool, or
9164 * path element specification '~~' refers to '$ISABELLE_HOME';
9166 * in locales, the "assumes" and "defines" parts may be omitted if
9169 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9172 * new print_mode "HTML";
9174 * new flag show_tags controls display of tags of theorems (which are
9175 basically just comments that may be attached by some tools);
9177 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9178 mode and goal output format:
9180 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9182 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9184 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9185 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9187 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9189 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9191 * function bind_thms stores lists of theorems (cf. bind_thm);
9193 * new shorthand tactics ftac, eatac, datac, fatac;
9195 * qed (and friends) now accept "" as result name; in that case the
9196 theorem is not stored, but proper checks and presentation of the
9199 * theorem database now also indexes constants "Trueprop", "all",
9200 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9205 ** HOL arithmetic **
9207 * There are now decision procedures for linear arithmetic over nat and
9210 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9211 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9212 are treated as atomic; subformulae not involving type `nat' or `int'
9213 are ignored; quantified subformulae are ignored unless they are
9214 positive universal or negative existential. The tactic has to be
9215 invoked by hand and can be a little bit slow. In particular, the
9216 running time is exponential in the number of occurrences of `min' and
9217 `max', and `-' on `nat'.
9219 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9220 (negated) (in)equalities among the premises and the conclusion into
9221 account (i.e. no compound formulae) and does not know about `min' and
9222 `max', and `-' on `nat'. It is fast and is used automatically by the
9225 NB: At the moment, these decision procedures do not cope with mixed
9226 nat/int formulae where the two parts interact, such as `m < n ==>
9229 * HOL/Numeral provides a generic theory of numerals (encoded
9230 efficiently as bit strings); setup for types nat/int/real is in place;
9231 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9232 int, existing theories and proof scripts may require a few additional
9235 * integer division and remainder can now be performed on constant
9238 * many properties of integer multiplication, division and remainder
9241 * An interface to the Stanford Validity Checker (SVC) is available through the
9242 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9243 are proved automatically. SVC must be installed separately, and its results
9244 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9245 invocation of the underlying oracle). For SVC see
9246 http://verify.stanford.edu/SVC
9248 * IsaMakefile: the HOL-Real target now builds an actual image;
9253 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9254 (in Isabelle/Isar) -- by Gertrud Bauer;
9256 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9257 analysis for assembly languages with subtypes;
9259 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9260 -- avoids syntactic ambiguities and treats state, transition, and
9261 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9262 changed syntax and (many) tactics;
9264 * HOL/inductive: Now also handles more general introduction rules such
9265 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9266 theorems are now maintained within the theory (maintained via the
9269 * HOL/datatype: Now also handles arbitrarily branching datatypes
9270 (using function types) such as
9272 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9274 * HOL/record: record_simproc (part of the default simpset) takes care
9275 of selectors applied to updated records; record_split_tac is no longer
9276 part of the default claset; update_defs may now be removed from the
9277 simpset in many cases; COMPATIBILITY: old behavior achieved by
9279 claset_ref () := claset() addSWrapper record_split_wrapper;
9280 Delsimprocs [record_simproc]
9282 * HOL/typedef: fixed type inference for representing set; type
9283 arguments now have to occur explicitly on the rhs as type constraints;
9285 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9286 names rather than an ML expression;
9288 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9289 supplied later. Program schemes can be defined, such as
9290 "While B C s = (if B s then While B C (C s) else s)"
9291 where the well-founded relation can be chosen after B and C have been given.
9293 * HOL/List: the constructors of type list are now Nil and Cons;
9294 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9295 course, ML tools referring to List.list.op # etc. have to be adapted;
9297 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9298 disabled by default; run isabelle with option -m HOL to get back to
9299 the original Gordon/HOL-style output;
9301 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9302 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9304 * HOL basic syntax simplified (more orthogonal): all variants of
9305 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9306 Eps operator is provided as well: "SOME x. P[x]";
9308 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9310 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9311 thus available for user theories;
9313 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9314 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9317 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9318 several times and then mp;
9323 * the notation <<...>> is now available as a notation for sequences of
9326 * the simplifier is now installed
9328 * the axiom system has been generalized (thanks to Soren Heilmann)
9330 * the classical reasoner now has a default rule database
9335 * new primrec section allows primitive recursive functions to be given
9336 directly (as in HOL) over datatypes and the natural numbers;
9338 * new tactics induct_tac and exhaust_tac for induction (or case
9339 analysis) over datatypes and the natural numbers;
9341 * the datatype declaration of type T now defines the recursor T_rec;
9343 * simplification automatically does freeness reasoning for datatype
9346 * automatic type-inference, with AddTCs command to insert new
9347 type-checking rules;
9349 * datatype introduction rules are now added as Safe Introduction rules
9352 * the syntax "if P then x else y" is now available in addition to
9356 *** Internal programming interfaces ***
9358 * tuned simplifier trace output; new flag debug_simp;
9360 * structures Vartab / Termtab (instances of TableFun) offer efficient
9361 tables indexed by indexname_ord / term_ord (compatible with aconv);
9363 * AxClass.axclass_tac lost the theory argument;
9365 * tuned current_goals_markers semantics: begin / end goal avoids
9366 printing empty lines;
9368 * removed prs and prs_fn hook, which was broken because it did not
9369 include \n in its semantics, forcing writeln to add one
9370 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9371 string -> unit if you really want to output text without newline;
9373 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9374 plain output, interface builders may have to enable 'isabelle_font'
9375 mode to get Isabelle font glyphs as before;
9377 * refined token_translation interface; INCOMPATIBILITY: output length
9378 now of type real instead of int;
9380 * theory loader actions may be traced via new ThyInfo.add_hook
9381 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9382 your own database of information attached to *whole* theories -- as
9383 opposed to intra-theory data slots offered via TheoryDataFun;
9385 * proper handling of dangling sort hypotheses (at last!);
9386 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9387 extra sort hypotheses that can be witnessed from the type signature;
9388 the force_strip_shyps flag is gone, any remaining shyps are simply
9389 left in the theorem (with a warning issued by strip_shyps_warning);
9393 New in Isabelle98-1 (October 1998)
9394 ----------------------------------
9396 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9398 * several changes of automated proof tools;
9400 * HOL: major changes to the inductive and datatype packages, including
9401 some minor incompatibilities of theory syntax;
9403 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9406 * HOL: removed duplicate thms in Arith:
9407 less_imp_add_less should be replaced by trans_less_add1
9408 le_imp_add_le should be replaced by trans_le_add1
9410 * HOL: unary minus is now overloaded (new type constraints may be
9413 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9414 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9415 now taken as an integer constant.
9417 * Pure: ML function 'theory_of' renamed to 'theory';
9423 1. Asm_full_simp_tac is now more aggressive.
9424 1. It will sometimes reorient premises if that increases their power to
9426 2. It does no longer proceed strictly from left to right but may also
9427 rotate premises to achieve further simplification.
9428 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9429 old Asm_full_simp_tac in that it does not rotate premises.
9430 2. The simplifier now knows a little bit about nat-arithmetic.
9432 * Classical reasoner: wrapper mechanism for the classical reasoner now
9433 allows for selected deletion of wrappers, by introduction of names for
9434 wrapper functionals. This implies that addbefore, addSbefore,
9435 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9436 and that adding two tactics with the same name overwrites the first
9437 one (emitting a warning).
9438 type wrapper = (int -> tactic) -> (int -> tactic)
9439 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9440 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9441 delWrapper, delSWrapper: claset * string -> claset
9442 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9444 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9445 semantics; addbefore now affects only the unsafe part of step_tac
9446 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9447 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9450 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9451 compWrapper; added safe wrapper (and access functions for it);
9453 * HOL/split_all_tac is now much faster and fails if there is nothing
9454 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9455 and the names of the automatically generated variables have changed.
9456 split_all_tac has moved within claset() from unsafe wrappers to safe
9457 wrappers, which means that !!-bound variables are split much more
9458 aggressively, and safe_tac and clarify_tac now split such variables.
9459 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9460 Note: the same holds for record_split_tac, which does the job of
9461 split_all_tac for record fields.
9463 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9464 permanently to the default simpset using Addsplits just like
9465 Addsimps. They can be removed via Delsplits just like
9466 Delsimps. Lower-case versions are also available.
9468 * HOL/Simplifier: The rule split_if is now part of the default
9469 simpset. This means that the simplifier will eliminate all occurrences
9470 of if-then-else in the conclusion of a goal. To prevent this, you can
9471 either remove split_if completely from the default simpset by
9472 `Delsplits [split_if]' or remove it in a specific call of the
9473 simplifier using `... delsplits [split_if]'. You can also add/delete
9474 other case splitting rules to/from the default simpset: every datatype
9475 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9476 t is the name of the datatype).
9478 * Classical reasoner / Simplifier combination: new force_tac (and
9479 derivatives Force_tac, force) combines rewriting and classical
9480 reasoning (and whatever other tools) similarly to auto_tac, but is
9481 aimed to solve the given subgoal completely.
9486 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9487 and `goalw': the theory is no longer needed as an explicit argument -
9488 the current theory context is used; assumptions are no longer returned
9489 at the ML-level unless one of them starts with ==> or !!; it is
9490 recommended to convert to these new commands using isatool fixgoal
9491 (backup your sources first!);
9493 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9494 the current theory context, and 'theory' to lookup stored theories;
9496 * new theory section 'locale' for declaring constants, assumptions and
9497 definitions that have local scope;
9499 * new theory section 'nonterminals' for purely syntactic types;
9501 * new theory section 'setup' for generic ML setup functions
9502 (e.g. package initialization);
9504 * the distribution now includes Isabelle icons: see
9505 lib/logo/isabelle-{small,tiny}.xpm;
9507 * isatool install - install binaries with absolute references to
9510 * isatool logo -- create instances of the Isabelle logo (as EPS);
9512 * print mode 'emacs' reserved for Isamode;
9514 * support multiple print (ast) translations per constant name;
9516 * theorems involving oracles are now printed with a suffixed [!];
9521 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9523 * HOL/inductive package reorganized and improved: now supports mutual
9529 oddI "n : EVEN ==> Suc n : ODD"
9530 evenI "n : ODD ==> Suc n : EVEN"
9532 new theorem list "elims" contains an elimination rule for each of the
9533 recursive sets; inductive definitions now handle disjunctive premises
9534 correctly (also ZF);
9536 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9537 "mutual_induct" no longer exists - the induction rule is always
9538 contained in "induct";
9541 * HOL/datatype package re-implemented and greatly improved: now
9542 supports mutually recursive datatypes such as
9545 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9546 | SUM ('a aexp) ('a aexp)
9547 | DIFF ('a aexp) ('a aexp)
9550 'a bexp = LESS ('a aexp) ('a aexp)
9551 | AND ('a bexp) ('a bexp)
9552 | OR ('a bexp) ('a bexp)
9554 as well as indirectly recursive datatypes such as
9557 ('a, 'b) term = Var 'a
9558 | App 'b ((('a, 'b) term) list)
9560 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9561 induction on mutually / indirectly recursive datatypes.
9563 Primrec equations are now stored in theory and can be accessed via
9564 <function_name>.simps.
9568 - Theories using datatypes must now have theory Datatype as an
9570 - The specific <typename>.induct_tac no longer exists - use the
9571 generic induct_tac instead.
9572 - natE has been renamed to nat.exhaust - use exhaust_tac
9573 instead of res_inst_tac ... natE. Note that the variable
9574 names in nat.exhaust differ from the names in natE, this
9575 may cause some "fragile" proofs to fail.
9576 - The theorems split_<typename>_case and split_<typename>_case_asm
9577 have been renamed to <typename>.split and <typename>.split_asm.
9578 - Since default sorts of type variables are now handled correctly,
9579 some datatype definitions may have to be annotated with explicit
9581 - Primrec definitions no longer require function name and type
9582 of recursive argument.
9584 Consider using isatool fixdatatype to adapt your theories and proof
9585 scripts to the new package (backup your sources first!).
9588 * HOL/record package: considerably improved implementation; now
9589 includes concrete syntax for record types, terms, updates; theorems
9590 for surjective pairing and splitting !!-bound record variables; proof
9591 support is as follows:
9593 1) standard conversions (selectors or updates applied to record
9594 constructor terms) are part of the standard simpset;
9596 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9597 made part of standard simpset and claset via addIffs;
9599 3) a tactic for record field splitting (record_split_tac) is part of
9600 the standard claset (addSWrapper);
9602 To get a better idea about these rules you may retrieve them via
9603 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9604 the name of your record type.
9606 The split tactic 3) conceptually simplifies by the following rule:
9608 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9610 Thus any record variable that is bound by meta-all will automatically
9611 blow up into some record constructor term, consequently the
9612 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9613 solve record problems automatically.
9616 * reorganized the main HOL image: HOL/Integ and String loaded by
9617 default; theory Main includes everything;
9619 * automatic simplification of integer sums and comparisons, using cancellation;
9621 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9623 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9625 * many new identities for unions, intersections, set difference, etc.;
9627 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9628 called split_if, split_split, split_sum_case and split_nat_case (to go
9629 with add/delsplits);
9631 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9632 (?x::unit) = (); this is made part of the default simpset, which COULD
9633 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9634 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9635 unit_abs_eta_conv is added in order to counter the effect of
9636 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9639 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9642 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9643 It and 'sym RS equals0D' are now in the default claset, giving automatic
9644 disjointness reasoning but breaking a few old proofs.
9646 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9647 to 'converse' from 'inverse' (for compatibility with ZF and some
9650 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9651 the well-founded relation;
9653 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9654 Compl A. The "Compl" syntax remains available as input syntax for this
9657 * HOL/Update: new theory of function updates:
9658 f(a:=b) == %x. if x=a then b else f x
9659 may also be iterated as in f(a:=b,c:=d,...);
9661 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9664 - new function list_update written xs[i:=v] that updates the i-th
9665 list position. May also be iterated as in xs[i:=a,j:=b,...].
9666 - new function `upt' written [i..j(] which generates the list
9667 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9668 bound write [i..j], which is a shorthand for [i..j+1(].
9669 - new lexicographic orderings and corresponding wellfoundedness theorems.
9672 - removed 'pred' (predecessor) function;
9673 - generalized some theorems about n-1;
9674 - many new laws about "div" and "mod";
9675 - new laws about greatest common divisors (see theory ex/Primes);
9677 * HOL/Relation: renamed the relational operator r^-1 "converse"
9678 instead of "inverse";
9680 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9681 of the multiset ordering;
9683 * directory HOL/Real: a construction of the reals using Dedekind cuts
9684 (not included by default);
9686 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9688 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9689 programs, i.e. different program variables may have different types.
9691 * calling (stac rew i) now fails if "rew" has no effect on the goal
9692 [previously, this check worked only if the rewrite rule was unconditional]
9693 Now rew can involve either definitions or equalities (either == or =).
9698 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9699 only the theorems proved on ZF.ML;
9701 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9702 It and 'sym RS equals0D' are now in the default claset, giving automatic
9703 disjointness reasoning but breaking a few old proofs.
9705 * ZF/Update: new theory of function updates
9706 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9707 may also be iterated as in f(a:=b,c:=d,...);
9709 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9711 * calling (stac rew i) now fails if "rew" has no effect on the goal
9712 [previously, this check worked only if the rewrite rule was unconditional]
9713 Now rew can involve either definitions or equalities (either == or =).
9715 * case_tac provided for compatibility with HOL
9716 (like the old excluded_middle_tac, but with subgoals swapped)
9719 *** Internal programming interfaces ***
9721 * Pure: several new basic modules made available for general use, see
9722 also src/Pure/README;
9724 * improved the theory data mechanism to support encapsulation (data
9725 kind name replaced by private Object.kind, acting as authorization
9726 key); new type-safe user interface via functor TheoryDataFun; generic
9727 print_data function becomes basically useless;
9729 * removed global_names compatibility flag -- all theory declarations
9730 are qualified by default;
9732 * module Pure/Syntax now offers quote / antiquote translation
9733 functions (useful for Hoare logic etc. with implicit dependencies);
9734 see HOL/ex/Antiquote for an example use;
9736 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9739 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9742 * Display.print_goals function moved to Locale.print_goals;
9744 * standard print function for goals supports current_goals_markers
9745 variable for marking begin of proof, end of proof, start of goal; the
9746 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9747 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9752 New in Isabelle98 (January 1998)
9753 --------------------------------
9755 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9757 * changed lexical syntax of terms / types: dots made part of long
9758 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9760 * simpset (and claset) reference variable replaced by functions
9761 simpset / simpset_ref;
9763 * no longer supports theory aliases (via merge) and non-trivial
9764 implicit merge of thms' signatures;
9766 * most internal names of constants changed due to qualified names;
9768 * changed Pure/Sequence interface (see Pure/seq.ML);
9771 *** General Changes ***
9773 * hierachically structured name spaces (for consts, types, axms, thms
9774 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9775 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9776 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9777 long_names for fully qualified output names; NOTE: ML programs
9778 (special tactics, packages etc.) referring to internal names may have
9779 to be adapted to cope with fully qualified names; in case of severe
9780 backward campatibility problems try setting 'global_names' at compile
9781 time to have enrything declared within a flat name space; one may also
9782 fine tune name declarations in theories via the 'global' and 'local'
9785 * reimplemented the implicit simpset and claset using the new anytype
9786 data filed in signatures; references simpset:simpset ref etc. are
9787 replaced by functions simpset:unit->simpset and
9788 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9789 to patch your ML files accordingly;
9791 * HTML output now includes theory graph data for display with Java
9792 applet or isatool browser; data generated automatically via isatool
9793 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9795 * defs may now be conditional; improved rewrite_goals_tac to handle
9796 conditional equations;
9798 * defs now admits additional type arguments, using TYPE('a) syntax;
9800 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9801 creates a new theory node; implicit merge of thms' signatures is
9802 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9803 transfer:theory->thm->thm in (rare) cases;
9805 * improved handling of draft signatures / theories; draft thms (and
9806 ctyps, cterms) are automatically promoted to real ones;
9808 * slightly changed interfaces for oracles: admit many per theory, named
9809 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9811 * print_goals: optional output of const types (set show_consts and
9814 * improved output of warnings (###) and errors (***);
9816 * subgoal_tac displays a warning if the new subgoal has type variables;
9818 * removed old README and Makefiles;
9820 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9822 * removed obsolete init_pps and init_database;
9824 * deleted the obsolete tactical STATE, which was declared by
9825 fun STATE tacfun st = tacfun st st;
9827 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9828 (which abbreviates $HOME);
9830 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9831 use isatool fixseq to adapt your ML programs (this works for fully
9832 qualified references to the Sequence structure only!);
9834 * use_thy no longer requires writable current directory; it always
9835 reloads .ML *and* .thy file, if either one is out of date;
9838 *** Classical Reasoner ***
9840 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9841 tactics that use classical reasoning to simplify a subgoal without
9842 splitting it into several subgoals;
9844 * Safe_tac: like safe_tac but uses the default claset;
9849 * added simplification meta rules:
9850 (asm_)(full_)simplify: simpset -> thm -> thm;
9852 * simplifier.ML no longer part of Pure -- has to be loaded by object
9855 * added prems argument to simplification procedures;
9857 * HOL, FOL, ZF: added infix function `addsplits':
9858 instead of `<simpset> setloop (split_tac <thms>)'
9859 you can simply write `<simpset> addsplits <thms>'
9864 * TYPE('a) syntax for type reflection terms;
9866 * no longer handles consts with name "" -- declare as 'syntax' instead;
9868 * pretty printer: changed order of mixfix annotation preference (again!);
9870 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9875 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9876 with `addloop' of the simplifier to faciliate case splitting in premises.
9878 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9880 * HOL/Auth: new protocol proofs including some for the Internet
9883 * HOL/Map: new theory of `maps' a la VDM;
9885 * HOL/simplifier: simplification procedures nat_cancel_sums for
9886 cancelling out common nat summands from =, <, <= (in)equalities, or
9887 differences; simplification procedures nat_cancel_factor for
9888 cancelling common factor from =, <, <= (in)equalities over natural
9889 sums; nat_cancel contains both kinds of procedures, it is installed by
9890 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9892 * HOL/simplifier: terms of the form
9893 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9895 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9896 and those of the form
9897 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9899 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9902 Each datatype `t' now comes with a theorem `split_t_case' of the form
9904 P(t_case f1 ... fn x) =
9905 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9907 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9910 and a theorem `split_t_case_asm' of the form
9912 P(t_case f1 ... fn x) =
9913 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9915 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9917 which can be added to a simpset via `addsplits'. The existing theorems
9918 expand_list_case and expand_option_case have been renamed to
9919 split_list_case and split_option_case.
9922 - `pred n' is automatically converted to `n-1'.
9923 Users are strongly encouraged not to use `pred' any longer,
9924 because it will disappear altogether at some point.
9925 - Users are strongly encouraged to write "0 < n" rather than
9926 "n ~= 0". Theorems and proof tools have been modified towards this
9930 the function "set_of_list" has been renamed "set" (and its theorems too);
9931 the function "nth" now takes its arguments in the reverse order and
9932 has acquired the infix notation "!" as in "xs!n".
9934 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9936 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9937 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9939 * HOL/record: extensible records with schematic structural subtyping
9940 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9941 still lacks various theorems and concrete record syntax;
9946 * removed "axioms" and "generated by" sections;
9948 * replaced "ops" section by extended "consts" section, which is capable of
9949 handling the continuous function space "->" directly;
9952 . proves theorems immediately and stores them in the theory,
9953 . creates hierachical name space,
9954 . now uses normal mixfix annotations (instead of cinfix...),
9955 . minor changes to some names and values (for consistency),
9956 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9957 . separator between mutual domain defs: changed "," to "and",
9958 . improved handling of sort constraints; now they have to
9959 appear on the left-hand side of the equations only;
9961 * fixed LAM <x,y,zs>.b syntax;
9963 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9964 adm (%x. P (t x)), where P is chainfinite and t continuous;
9969 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9970 with `addloop' of the simplifier to faciliate case splitting in premises.
9972 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9973 in HOL, they strip ALL and --> from proved theorems;
9977 New in Isabelle94-8 (May 1997)
9978 ------------------------------
9980 *** General Changes ***
9982 * new utilities to build / run / maintain Isabelle etc. (in parts
9983 still somewhat experimental); old Makefiles etc. still functional;
9985 * new 'Isabelle System Manual';
9987 * INSTALL text, together with ./configure and ./build scripts;
9989 * reimplemented type inference for greater efficiency, better error
9990 messages and clean internal interface;
9992 * prlim command for dealing with lots of subgoals (an easier way of
9993 setting goals_limit);
9998 * supports alternative (named) syntax tables (parser and pretty
9999 printer); internal interface is provided by add_modesyntax(_i);
10001 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10002 be used in conjunction with the Isabelle symbol font; uses the
10003 "symbols" syntax table;
10005 * added token_translation interface (may translate name tokens in
10006 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10007 the current print_mode); IMPORTANT: user print translation functions
10008 are responsible for marking newly introduced bounds
10009 (Syntax.mark_boundT);
10011 * token translations for modes "xterm" and "xterm_color" that display
10012 names in bold, underline etc. or colors (which requires a color
10015 * infixes may now be declared with names independent of their syntax;
10017 * added typed_print_translation (like print_translation, but may
10018 access type of constant);
10021 *** Classical Reasoner ***
10023 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10024 some limitations. Blast_tac...
10025 + ignores addss, addbefore, addafter; this restriction is intrinsic
10026 + ignores elimination rules that don't have the correct format
10027 (the conclusion MUST be a formula variable)
10028 + ignores types, which can make HOL proofs fail
10029 + rules must not require higher-order unification, e.g. apply_type in ZF
10030 [message "Function Var's argument not a bound variable" relates to this]
10031 + its proof strategy is more general but can actually be slower
10033 * substitution with equality assumptions no longer permutes other
10036 * minor changes in semantics of addafter (now called addaltern); renamed
10037 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10038 (and access functions for it);
10040 * improved combination of classical reasoner and simplifier:
10041 + functions for handling clasimpsets
10042 + improvement of addss: now the simplifier is called _after_ the
10044 + safe variant of addss called addSss: uses safe simplifications
10045 _during_ the safe steps. It is more complete as it allows multiple
10046 instantiations of unknowns (e.g. with slow_tac).
10050 * added interface for simplification procedures (functions that
10051 produce *proven* rewrite rules on the fly, depending on current
10054 * ordering on terms as parameter (used for ordered rewriting);
10056 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10058 * the solver is now split into a safe and an unsafe part.
10059 This should be invisible for the normal user, except that the
10060 functions setsolver and addsolver have been renamed to setSolver and
10061 addSolver; added safe_asm_full_simp_tac;
10066 * a generic induction tactic `induct_tac' which works for all datatypes and
10067 also for type `nat';
10069 * a generic case distinction tactic `exhaust_tac' which works for all
10070 datatypes and also for type `nat';
10072 * each datatype comes with a function `size';
10074 * patterns in case expressions allow tuple patterns as arguments to
10075 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10077 * primrec now also works with type nat;
10079 * recdef: a new declaration form, allows general recursive functions to be
10080 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10082 * the constant for negation has been renamed from "not" to "Not" to
10083 harmonize with FOL, ZF, LK, etc.;
10085 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10088 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10090 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10091 problems in commutative rings, using axiomatic type classes for + and *;
10093 * more examples in HOL/MiniML and HOL/Auth;
10095 * more default rewrite rules for quantifiers, union/intersection;
10097 * a new constant `arbitrary == @x.False';
10099 * HOLCF/IOA replaces old HOL/IOA;
10101 * HOLCF changes: derived all rules and arities
10102 + axiomatic type classes instead of classes
10103 + typedef instead of faking type definitions
10104 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10105 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10106 + eliminated the types void, one, tr
10107 + use unit lift and bool lift (with translations) instead of one and tr
10108 + eliminated blift from Lift3.thy (use Def instead of blift)
10109 all eliminated rules are derived as theorems --> no visible changes ;
10114 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10115 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10116 as ZF_cs addSIs [equalityI];
10120 New in Isabelle94-7 (November 96)
10121 ---------------------------------
10123 * allowing negative levels (as offsets) in prlev and choplev;
10125 * super-linear speedup for large simplifications;
10127 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10128 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10129 FAIL); can suppress it using the command Delsimps (ex_simps @
10130 all_simps); De Morgan laws are also now included, by default;
10132 * improved printing of ==> : ~:
10134 * new object-logic "Sequents" adds linear logic, while replacing LK
10135 and Modal (thanks to Sara Kalvala);
10137 * HOL/Auth: correctness proofs for authentication protocols;
10139 * HOL: new auto_tac combines rewriting and classical reasoning (many
10140 examples on HOL/Auth);
10142 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10143 the rewriter and classical reasoner simultaneously;
10145 * function uresult no longer returns theorems in "standard" format;
10146 regain previous version by: val uresult = standard o uresult;
10150 New in Isabelle94-6
10151 -------------------
10153 * oracles -- these establish an interface between Isabelle and trusted
10154 external reasoners, which may deliver results as theorems;
10156 * proof objects (in particular record all uses of oracles);
10158 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10160 * "constdefs" section in theory files;
10162 * "primrec" section (HOL) no longer requires names;
10164 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10168 New in Isabelle94-5
10169 -------------------
10171 * reduced space requirements;
10173 * automatic HTML generation from theories;
10175 * theory files no longer require "..." (quotes) around most types;
10177 * new examples, including two proofs of the Church-Rosser theorem;
10179 * non-curried (1994) version of HOL is no longer distributed;
10183 New in Isabelle94-4
10184 -------------------
10186 * greatly reduced space requirements;
10188 * theory files (.thy) no longer require \...\ escapes at line breaks;
10190 * searchable theorem database (see the section "Retrieving theorems" on
10191 page 8 of the Reference Manual);
10193 * new examples, including Grabczewski's monumental case study of the
10196 * The previous version of HOL renamed to Old_HOL;
10198 * The new version of HOL (previously called CHOL) uses a curried syntax
10199 for functions. Application looks like f a b instead of f(a,b);
10201 * Mutually recursive inductive definitions finally work in HOL;
10203 * In ZF, pattern-matching on tuples is now available in all abstractions and
10204 translates to the operator "split";
10208 New in Isabelle94-3
10209 -------------------
10211 * new infix operator, addss, allowing the classical reasoner to
10212 perform simplification at each step of its search. Example:
10213 fast_tac (cs addss ss)
10215 * a new logic, CHOL, the same as HOL, but with a curried syntax
10216 for functions. Application looks like f a b instead of f(a,b). Also pairs
10217 look like (a,b) instead of <a,b>;
10219 * PLEASE NOTE: CHOL will eventually replace HOL!
10221 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10222 It translates to the operator "split". A new theory of integers is available;
10224 * In ZF, integer numerals now denote two's-complement binary integers.
10225 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10227 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10228 of the Axiom of Choice;
10232 New in Isabelle94-2
10233 -------------------
10235 * Significantly faster resolution;
10237 * the different sections in a .thy file can now be mixed and repeated
10240 * Database of theorems for FOL, HOL and ZF. New
10241 commands including qed, qed_goal and bind_thm store theorems in the database.
10243 * Simple database queries: return a named theorem (get_thm) or all theorems of
10244 a given theory (thms_of), or find out what theory a theorem was proved in
10247 * Bugs fixed in the inductive definition and datatype packages;
10249 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10250 and HOL_dup_cs obsolete;
10252 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10255 * Simpler definition of function space in ZF;
10257 * new results about cardinal and ordinal arithmetic in ZF;
10259 * 'subtype' facility in HOL for introducing new types as subsets of existing
10262 :mode=text:wrap=hard:maxLineLen=72: