1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Theorem status about oracles and unfinished/failed future proofs is
10 no longer printed by default, since it is incompatible with
11 incremental / parallel checking of the persistent document model. ML
12 function Thm.peek_status may be used to inspect a snapshot of the
13 ongoing evaluation process. Note that in batch mode --- notably
14 isabelle build --- the system ensures that future proofs of all
15 accessible theorems in the theory context are finished (as before).
17 * Configuration option show_markup controls direct inlining of markup
18 into the printed representation of formal entities --- notably type
19 and sort constraints. This enables Prover IDE users to retrieve that
20 information via tooltips in the output window, for example.
22 * Command 'ML_file' evaluates ML text from a file directly within the
23 theory, without any predeclaration via 'uses' in the theory header.
25 * Old command 'use' command and corresponding keyword 'uses' in the
26 theory header are legacy features and will be discontinued soon.
27 Tools that load their additional source files may imitate the
28 'ML_file' implementation, such that the system can take care of
29 dependencies properly.
31 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
32 is called fastforce / fast_force_tac already since Isabelle2011-1.
34 * Updated and extended "isar-ref" and "implementation" manual, reduced
35 remaining material in old "ref" manual.
37 * Improved support for auxiliary contexts indicate block structure for
38 specifications: nesting of "context fixes ... context assumes ..."
39 and "class ... context ...".
41 * More informative error messages for Isar proof commands involving
42 lazy enumerations (method applications etc.).
44 * Refined 'help' command to retrieve outer syntax commands according
45 to name patterns (with clickable results).
48 *** Prover IDE -- Isabelle/Scala/jEdit ***
50 * Parallel terminal proofs ('by') are enabled by default, likewise
51 proofs that are built into packages like 'datatype', 'function'. This
52 allows to "run ahead" checking the theory specifications on the
53 surface, while the prover is still crunching on internal
54 justifications. Unfinished / cancelled proofs are restarted as
55 required to complete full proof checking eventually.
57 * Improved output panel with tooltips, hyperlinks etc. based on the
58 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
59 tooltips leads to some window that supports the same recursively,
60 which can lead to stacks of tooltips as the semantic document content
61 is explored. ESCAPE closes the whole stack, individual windows may be
62 closed separately, or detached to become independent jEdit dockables.
64 * Improved support for commands that produce graph output: the text
65 message contains a clickable area to open a new instance of the graph
68 * More robust incremental parsing of outer syntax (partial comments,
69 malformed symbols). Changing the balance of open/close quotes and
70 comment delimiters works more conveniently with unfinished situations
71 that frequently occur in user interaction.
73 * More efficient painting and improved reactivity when editing large
74 files. More scalable management of formal document content.
76 * Smarter handling of tracing messages: prover process pauses after
77 certain number of messages per command transaction, with some user
78 dialog to stop or continue. This avoids swamping the front-end with
79 potentially infinite message streams.
81 * More plugin options and preferences, based on Isabelle/Scala. The
82 jEdit plugin option panel provides access to some Isabelle/Scala
83 options, including tuning parameters for editor reactivity and color
86 * Dockable window "Symbols" provides some editing support for Isabelle
89 * Dockable window "Monitor" shows ML runtime statistics.
91 * Improved editing support for control styles: subscript, superscript,
92 bold, reset of style -- operating on single symbols or text
93 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
95 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
96 adjust the main text area font size, and its derivatives for output,
97 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS.
99 * More reactive completion popup by default: use \t (TAB) instead of
100 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
101 also "Plugin Options / SideKick / General / Code Completion Options".
103 * Implicit check and build dialog of the specified logic session
104 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
105 demand, without bundling big platform-dependent heap images in the
106 Isabelle distribution.
108 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
109 from Oracle provide better multi-platform experience. This version is
110 now bundled exclusively with Isabelle.
115 * Code generation for Haskell: restrict unqualified imports from
116 Haskell Prelude to a small set of fundamental operations.
118 * Command 'export_code': relative file names are interpreted
119 relatively to master directory of current theory rather than the
120 rather arbitrary current working directory. INCOMPATIBILITY.
122 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
123 use regular rule composition via "OF" / "THEN", or explicit proof
124 structure instead. Note that Isabelle/ML provides a variety of
125 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
126 with some care where this is really required.
128 * Command 'typ' supports an additional variant with explicit sort
129 constraint, to infer and check the most general type conforming to a
130 given given sort. Example (in HOL):
132 typ "_ * _ * bool * unit" :: finite
134 * Command 'locale_deps' visualizes all locales and their relations as
142 - Added MaSh relevance filter based on machine-learning; see the
143 Sledgehammer manual for details.
144 - Polished Isar proofs generated with "isar_proofs" option.
145 - Rationalized type encodings ("type_enc" option).
146 - Renamed "kill_provers" subcommand to "kill".
148 isar_proof ~> isar_proofs
149 isar_shrink_factor ~> isar_shrink
150 max_relevant ~> max_facts
151 relevance_thresholds ~> fact_thresholds
153 * Quickcheck: added an optimisation for equality premises. It is
154 switched on by default, and can be switched off by setting the
155 configuration quickcheck_optimise_equality to false.
157 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
160 * Preprocessing of the code generator rewrites set comprehensions into
161 pointfree expressions.
163 * The SMT solver Z3 has now by default a restricted set of directly
164 supported features. For the full set of features (div/mod, nonlinear
165 arithmetic, datatypes/records) with potential proof reconstruction
166 failures, enable the configuration option "z3_with_extensions". Minor
169 * Simplified 'typedef' specifications: historical options for implicit
170 set definition and alternative name have been discontinued. The
171 former behavior of "typedef (open) t = A" is now the default, but
172 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
175 * Removed constant "chars"; prefer "Enum.enum" on type "char"
176 directly. INCOMPATIBILITY.
178 * Moved operation product, sublists and n_lists from theory Enum to
179 List. INCOMPATIBILITY.
181 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
183 * Class "comm_monoid_diff" formalises properties of bounded
184 subtraction, with natural numbers and multisets as typical instances.
186 * Added combinator "Option.these" with type "'a option set => 'a set".
188 * Theory "Transitive_Closure": renamed lemmas
190 reflcl_tranclp -> reflclp_tranclp
191 rtranclp_reflcl -> rtranclp_reflclp
195 * Theory "Rings": renamed lemmas (in class semiring)
197 left_distrib ~> distrib_right
198 right_distrib ~> distrib_left
202 * Generalized the definition of limits:
204 - Introduced the predicate filterlim (LIM x F. f x :> G) which
205 expresses that when the input values x converge to F then the
206 output f x converges to G.
208 - Added filters for convergence to positive (at_top) and negative
211 - Moved infinity in the norm (at_infinity) from
212 Multivariate_Analysis to Complex_Main.
214 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
219 * Theory "Library/Option_ord" provides instantiation of option type to
220 lattice type classes.
222 * Theory "Library/Multiset": renamed
224 constant fold_mset ~> Multiset.fold
225 fact fold_mset_commute ~> fold_mset_comm
229 * Renamed theory Library/List_Prefix to Library/Sublist, with related
232 - Renamed constants (and related lemmas)
235 strict_prefix ~> prefix
237 - Replaced constant "postfix" by "suffixeq" with swapped argument
238 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
239 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
240 Renamed lemmas accordingly.
242 - Added constant "list_hembeq" for homeomorphic embedding on
243 lists. Added abbreviation "sublisteq" for special case
244 "list_hembeq (op =)".
246 - Theory Library/Sublist no longer provides "order" and "bot" type
247 class instances for the prefix order (merely corresponding locale
248 interpretations). The type class instances are now in theory
249 Library/Prefix_Order.
251 - The sublist relation of theory Library/Sublist_Order is now based
252 on "Sublist.sublisteq". Renamed lemmas accordingly:
254 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
255 le_list_append_mono ~> Sublist.list_hembeq_append_mono
256 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
257 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
258 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
259 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
260 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
261 le_list_drop_many ~> Sublist.sublisteq_drop_many
262 le_list_filter_left ~> Sublist.sublisteq_filter_left
263 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
264 le_list_rev_take_iff ~> Sublist.sublisteq_append
265 le_list_same_length ~> Sublist.sublisteq_same_length
266 le_list_take_many_iff ~> Sublist.sublisteq_append'
267 less_eq_list.drop ~> less_eq_list_drop
268 less_eq_list.induct ~> less_eq_list_induct
269 not_le_list_length ~> Sublist.not_sublisteq_length
274 * New theory Library/Countable_Set.
276 * Theory Library/Debug and Library/Parallel provide debugging and
277 parallel execution for code generated towards Isabelle/ML.
279 * Theory Library/FuncSet: Extended support for Pi and extensional and
280 introduce the extensional dependent function space "PiE". Replaced
281 extensional_funcset by an abbreviation, and renamed lemmas from
282 extensional_funcset to PiE as follows:
284 extensional_empty ~> PiE_empty
285 extensional_funcset_empty_domain ~> PiE_empty_domain
286 extensional_funcset_empty_range ~> PiE_empty_range
287 extensional_funcset_arb ~> PiE_arb
288 extensional_funcset_mem ~> PiE_mem
289 extensional_funcset_extend_domainI ~> PiE_fun_upd
290 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
291 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
292 card_extensional_funcset ~> card_PiE
293 finite_extensional_funcset ~> finite_PiE
297 * Theory Library/FinFun: theory of almost everywhere constant
298 functions (supersedes the AFP entry "Code Generation for Functions as
301 * Theory Library/Phantom: generic phantom type to make a type
302 parameter appear in a constant's type. This alternative to adding
303 TYPE('a) as another parameter avoids unnecessary closures in generated
306 * Theory Library/RBT_Impl: efficient construction of red-black trees
307 from sorted associative lists. Merging two trees with rbt_union may
308 return a structurally different tree than before. Potential
311 * Theory Library/IArray: immutable arrays with code generation.
313 * Theory Library/Finite_Lattice: theory of finite lattices.
315 * HOL/Multivariate_Analysis: replaced
317 "basis :: 'a::euclidean_space => nat => real"
318 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
320 on euclidean spaces by using the inner product "_ \<bullet> _" with
321 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
322 "SUM i : Basis. f i * r i".
324 With this change the following constants are also changed or removed:
326 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
327 a $$ i ~> inner a i (where i : Basis)
329 \<pi>, \<pi>' removed
331 Theorems about these constants where removed.
335 component_le_norm ~> Basis_le_norm
336 euclidean_eq ~> euclidean_eq_iff
337 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
338 euclidean_simps ~> inner_simps
339 independent_basis ~> independent_Basis
340 span_basis ~> span_Basis
341 in_span_basis ~> in_span_Basis
342 norm_bound_component_le ~> norm_boound_Basis_le
343 norm_bound_component_lt ~> norm_boound_Basis_lt
344 component_le_infnorm ~> Basis_le_infnorm
350 - Added simproc "measurable" to automatically prove measurability.
352 - Added induction rules for sigma sets with disjoint union
353 (sigma_sets_induct_disjoint) and for Borel-measurable functions
354 (borel_measurable_induct).
356 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
359 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
360 AFP entry "Ordinals_and_Cardinals").
362 * HOL/BNF: New (co)datatype package based on bounded natural functors
363 with support for mixed, nested recursion and interesting non-free
367 *** Document preparation ***
369 * Dropped legacy antiquotations "term_style" and "thm_style", since
370 styles may be given as arguments to "term" and "thm" already.
371 Discontinued legacy styles "prem1" .. "prem19".
373 * Default LaTeX rendering for \<euro> is now based on eurosym package,
374 instead of slightly exotic babel/greek.
376 * Document variant NAME may use different LaTeX entry point
377 document/root_NAME.tex if that file exists, instead of the common
380 * Simplified custom document/build script, instead of old-style
381 document/IsaMakefile. Minor INCOMPATIBILITY.
386 * The default limit for maximum number of worker threads is now 8,
387 instead of 4, in correspondence to capabilities of contemporary
388 hardware and Poly/ML runtime system.
390 * Type Seq.results and related operations support embedded error
391 messages within lazy enumerations, and thus allow to provide
392 informative errors in the absence of any usable results.
394 * Renamed Position.str_of to Position.here to emphasize that this is a
395 formal device to inline positions into message text, but not
396 necessarily printing visible text.
401 * Advanced support for Isabelle sessions and build management, see
402 "system" manual for the chapter of that name, especially the "isabelle
403 build" tool and its examples. INCOMPATIBILITY, isabelle usedir /
404 mkdir / make are rendered obsolete.
406 * Discontinued obsolete "isabelle makeall".
408 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
409 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
410 provides some traditional targets that invoke "isabelle build". Note
411 that this is inefficient! Applications of Isabelle/HOL involving
412 "isabelle make" should be upgraded to use "isabelle build" directly.
414 * Discontinued obsolete Isabelle/build script, it is superseded by the
415 regular isabelle build tool. For example:
417 isabelle build -s -b HOLCF
419 * The "isabelle options" tool prints Isabelle system options, as
420 required for "isabelle build", for example.
422 * The "isabelle mkroot" tool prepares session root directories for use
423 with "isabelle build", similar to former "isabelle mkdir" for
426 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
427 Minor INCOMPATIBILITY in command-line options.
429 * The "isabelle install" tool has now a simpler command-line. Minor
432 * The "isabelle components" tool helps to resolve add-on components
433 that are not bundled, or referenced from a bare-bones repository
436 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
437 platform family: "linux", "macos", "windows".
439 * The ML system is configured as regular component, and no longer
440 picked up from some surrounding directory. Potential INCOMPATIBILITY
441 for home-made settings.
443 * Improved ML runtime statistics (heap, threads, future tasks etc.).
445 * Discontinued support for Poly/ML 5.2.1, which was the last version
446 without exception positions and advanced ML compiler/toplevel
449 * Discontinued special treatment of Proof General -- no longer guess
450 PROOFGENERAL_HOME based on accidental file-system layout. Minor
451 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
452 settings manually, or use a Proof General version that has been
453 bundled as Isabelle component.
457 New in Isabelle2012 (May 2012)
458 ------------------------------
462 * Prover IDE (PIDE) improvements:
464 - more robust Sledgehammer integration (as before the sledgehammer
465 command-line needs to be typed into the source buffer)
466 - markup for bound variables
467 - markup for types of term variables (displayed as tooltips)
468 - support for user-defined Isar commands within the running session
469 - improved support for Unicode outside original 16bit range
470 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
472 * Forward declaration of outer syntax keywords within the theory
473 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
474 commands to be used in the same theory where defined.
476 * Auxiliary contexts indicate block structure for specifications with
477 additional parameters and assumptions. Such unnamed contexts may be
478 nested within other targets, like 'theory', 'locale', 'class',
479 'instantiation' etc. Results from the local context are generalized
480 accordingly and applied to the enclosing target context. Example:
484 assumes xy: "x = y" and yz: "y = z"
487 lemma my_trans: "x = z" using xy yz by simp
493 The most basic application is to factor-out context elements of
494 several fixes/assumes/shows theorem statements, e.g. see
495 ~~/src/HOL/Isar_Examples/Group_Context.thy
497 Any other local theory specification element works within the "context
498 ... begin ... end" block as well.
500 * Bundled declarations associate attributed fact expressions with a
501 given name in the context. These may be later included in other
502 contexts. This allows to manage context extensions casually, without
503 the logical dependencies of locales and locale interpretation. See
504 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
506 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
507 declaration, and results are standardized before being stored. Thus
508 old-style "standard" after instantiation or composition of facts
509 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
510 indices of schematic variables.
512 * Rule attributes in local theory declarations (e.g. locale or class)
513 are now statically evaluated: the resulting theorem is stored instead
514 of the original expression. INCOMPATIBILITY in rare situations, where
515 the historic accident of dynamic re-evaluation in interpretations
518 * New tutorial "Programming and Proving in Isabelle/HOL"
519 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
520 Structured Isar Proofs" ("isar-overview"), which has been removed. It
521 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
522 Logic" as the recommended beginners tutorial, but does not cover all
523 of the material of that old tutorial.
525 * Updated and extended reference manuals: "isar-ref",
526 "implementation", "system"; reduced remaining material in old "ref"
532 * Command 'definition' no longer exports the foundational "raw_def"
533 into the user context. Minor INCOMPATIBILITY, may use the regular
534 "def" result with attribute "abs_def" to imitate the old version.
536 * Attribute "abs_def" turns an equation of the form "f x y == t" into
537 "f == %x y. t", which ensures that "simp" or "unfold" steps always
538 expand it. This also works for object-logic equality. (Formerly
539 undocumented feature.)
541 * Sort constraints are now propagated in simultaneous statements, just
542 like type constraints. INCOMPATIBILITY in rare situations, where
543 distinct sorts used to be assigned accidentally. For example:
545 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
547 lemma "P (x::'a)" and "Q (y::'a::bar)"
548 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
550 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
551 tolerant against multiple unifiers, as long as the final result is
552 unique. (As before, rules are composed in canonical right-to-left
553 order to accommodate newly introduced premises.)
555 * Renamed some inner syntax categories:
561 Minor INCOMPATIBILITY. Note that in practice "num_const" or
562 "num_position" etc. are mainly used instead (which also include
563 position information via constraints).
565 * Simplified configuration options for syntax ambiguity: see
566 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
567 manual. Minor INCOMPATIBILITY.
569 * Discontinued configuration option "syntax_positions": atomic terms
570 in parse trees are always annotated by position constraints.
572 * Old code generator for SML and its commands 'code_module',
573 'code_library', 'consts_code', 'types_code' have been discontinued.
574 Use commands of the generic code generator instead. INCOMPATIBILITY.
576 * Redundant attribute "code_inline" has been discontinued. Use
577 "code_unfold" instead. INCOMPATIBILITY.
579 * Dropped attribute "code_unfold_post" in favor of the its dual
580 "code_abbrev", which yields a common pattern in definitions like
582 definition [code_abbrev]: "f = t"
586 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
587 instead. INCOMPATIBILITY.
589 * Discontinued old "prems" fact, which used to refer to the accidental
590 collection of foundational premises in the context (already marked as
591 legacy since Isabelle2011).
596 * Type 'a set is now a proper type constructor (just as before
597 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
598 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
599 sets separate, it is often sufficient to rephrase some set S that has
600 been accidentally used as predicates by "%x. x : S", and some
601 predicate P that has been accidentally used as set by "{x. P x}".
602 Corresponding proofs in a first step should be pruned from any
603 tinkering with former theorems mem_def and Collect_def as far as
606 For developments which deliberately mix predicates and sets, a
607 planning step is necessary to determine what should become a predicate
608 and what a set. It can be helpful to carry out that step in
609 Isabelle2011-1 before jumping right into the current release.
611 * Code generation by default implements sets as container type rather
612 than predicates. INCOMPATIBILITY.
614 * New type synonym 'a rel = ('a * 'a) set
616 * The representation of numerals has changed. Datatype "num"
617 represents strictly positive binary numerals, along with functions
618 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
619 positive and negated numeric literals, respectively. See also
620 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
621 user theories may require adaptations as follows:
623 - Theorems with number_ring or number_semiring constraints: These
624 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
626 - Theories defining numeric types: Remove number, number_semiring,
627 and number_ring instances. Defer all theorems about numerals until
628 after classes one and semigroup_add have been instantiated.
630 - Numeral-only simp rules: Replace each rule having a "number_of v"
631 pattern with two copies, one for numeral and one for neg_numeral.
633 - Theorems about subclasses of semiring_1 or ring_1: These classes
634 automatically support numerals now, so more simp rules and
635 simprocs may now apply within the proof.
637 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
638 Redefine using other integer operations.
640 * Transfer: New package intended to generalize the existing
641 "descending" method and related theorem attributes from the Quotient
642 package. (Not all functionality is implemented yet, but future
643 development will focus on Transfer as an eventual replacement for the
644 corresponding parts of the Quotient package.)
646 - transfer_rule attribute: Maintains a collection of transfer rules,
647 which relate constants at two different types. Transfer rules may
648 relate different type instances of the same polymorphic constant,
649 or they may relate an operation on a raw type to a corresponding
650 operation on an abstract type (quotient or subtype). For example:
652 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
653 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
655 - transfer method: Replaces a subgoal on abstract types with an
656 equivalent subgoal on the corresponding raw types. Constants are
657 replaced with corresponding ones according to the transfer rules.
658 Goals are generalized over all free variables by default; this is
659 necessary for variables whose types change, but can be overridden
660 for specific variables with e.g. "transfer fixing: x y z". The
661 variant transfer' method allows replacing a subgoal with one that
662 is logically stronger (rather than equivalent).
664 - relator_eq attribute: Collects identity laws for relators of
665 various type constructors, e.g. "list_all2 (op =) = (op =)". The
666 transfer method uses these lemmas to infer transfer rules for
667 non-polymorphic constants on the fly.
669 - transfer_prover method: Assists with proving a transfer rule for a
670 new constant, provided the constant is defined in terms of other
671 constants that already have transfer rules. It should be applied
672 after unfolding the constant definitions.
674 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
675 from type nat to type int.
677 * Lifting: New package intended to generalize the quotient_definition
678 facility of the Quotient package; designed to work with Transfer.
680 - lift_definition command: Defines operations on an abstract type in
681 terms of a corresponding operation on a representation
682 type. Example syntax:
684 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
687 Users must discharge a respectfulness proof obligation when each
688 constant is defined. (For a type copy, i.e. a typedef with UNIV,
689 the proof is discharged automatically.) The obligation is
690 presented in a user-friendly, readable form; a respectfulness
691 theorem in the standard format and a transfer rule are generated
694 - Integration with code_abstype: For typedefs (e.g. subtypes
695 corresponding to a datatype invariant, such as dlist),
696 lift_definition generates a code certificate theorem and sets up
697 code generation for each constant.
699 - setup_lifting command: Sets up the Lifting package to work with a
700 user-defined type. The user must provide either a quotient theorem
701 or a type_definition theorem. The package configures transfer
702 rules for equality and quantifiers on the type, and sets up the
703 lift_definition command to work with the type.
705 - Usage examples: See Quotient_Examples/Lift_DList.thy,
706 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
707 Word/Word.thy and Library/Float.thy.
711 - The 'quotient_type' command now supports a 'morphisms' option with
712 rep and abs functions, similar to typedef.
714 - 'quotient_type' sets up new types to work with the Lifting and
715 Transfer packages, as with 'setup_lifting'.
717 - The 'quotient_definition' command now requires the user to prove a
718 respectfulness property at the point where the constant is
719 defined, similar to lift_definition; INCOMPATIBILITY.
721 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
722 accordingly, INCOMPATIBILITY.
724 * New diagnostic command 'find_unused_assms' to find potentially
725 superfluous assumptions in theorems using Quickcheck.
729 - Quickcheck returns variable assignments as counterexamples, which
730 allows to reveal the underspecification of functions under test.
731 For example, refuting "hd xs = x", it presents the variable
732 assignment xs = [] and x = a1 as a counterexample, assuming that
733 any property is false whenever "hd []" occurs in it.
735 These counterexample are marked as potentially spurious, as
736 Quickcheck also returns "xs = []" as a counterexample to the
737 obvious theorem "hd xs = hd xs".
739 After finding a potentially spurious counterexample, Quickcheck
740 continues searching for genuine ones.
742 By default, Quickcheck shows potentially spurious and genuine
743 counterexamples. The option "genuine_only" sets quickcheck to only
744 show genuine counterexamples.
746 - The command 'quickcheck_generator' creates random and exhaustive
747 value generators for a given type and operations.
749 It generates values by using the operations as if they were
750 constructors of that type.
752 - Support for multisets.
754 - Added "use_subtype" options.
756 - Added "quickcheck_locale" configuration to specify how to process
757 conjectures in a locale context.
759 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
760 and affecting 'rat' and 'real'.
763 - Integrated more tightly with SPASS, as described in the ITP 2012
764 paper "More SPASS with Isabelle".
765 - Made it try "smt" as a fallback if "metis" fails or times out.
766 - Added support for the following provers: Alt-Ergo (via Why3 and
767 TFF1), iProver, iProver-Eq.
768 - Sped up the minimizer.
769 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
770 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
771 - Renamed "sound" option to "strict".
773 * Metis: Added possibility to specify lambda translations scheme as a
774 parenthesized argument (e.g., "by (metis (lifting) ...)").
776 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
778 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
780 * New "case_product" attribute to generate a case rule doing multiple
781 case distinctions at the same time. E.g.
783 list.exhaust [case_product nat.exhaust]
785 produces a rule which can be used to perform case distinction on both
788 * New "eventually_elim" method as a generalized variant of the
789 eventually_elim* rules. Supports structured proofs.
791 * Typedef with implicit set definition is considered legacy. Use
792 "typedef (open)" form instead, which will eventually become the
795 * Record: code generation can be switched off manually with
797 declare [[record_coden = false]] -- "default true"
799 * Datatype: type parameters allow explicit sort constraints.
801 * Concrete syntax for case expressions includes constraints for source
802 positions, and thus produces Prover IDE markup for its bindings.
803 INCOMPATIBILITY for old-style syntax translations that augment the
804 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
807 * Clarified attribute "mono_set": pure declaration without modifying
808 the result of the fact expression.
810 * More default pred/set conversions on a couple of relation operations
811 and predicates. Added powers of predicate relations. Consolidation
812 of some relation theorems:
814 converse_def ~> converse_unfold
815 rel_comp_def ~> relcomp_unfold
816 symp_def ~> (modified, use symp_def and sym_def instead)
817 transp_def ~> transp_trans
818 Domain_def ~> Domain_unfold
819 Range_def ~> Domain_converse [symmetric]
821 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
823 See theory "Relation" for examples for making use of pred/set
824 conversions by means of attributes "to_set" and "to_pred".
828 * Renamed facts about the power operation on relations, i.e., relpow
829 to match the constant's name:
831 rel_pow_1 ~> relpow_1
832 rel_pow_0_I ~> relpow_0_I
833 rel_pow_Suc_I ~> relpow_Suc_I
834 rel_pow_Suc_I2 ~> relpow_Suc_I2
835 rel_pow_0_E ~> relpow_0_E
836 rel_pow_Suc_E ~> relpow_Suc_E
837 rel_pow_E ~> relpow_E
838 rel_pow_Suc_D2 ~> relpow_Suc_D2
839 rel_pow_Suc_E2 ~> relpow_Suc_E2
840 rel_pow_Suc_D2' ~> relpow_Suc_D2'
841 rel_pow_E2 ~> relpow_E2
842 rel_pow_add ~> relpow_add
843 rel_pow_commute ~> relpow
844 rel_pow_empty ~> relpow_empty:
845 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
846 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
847 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
848 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
849 rel_pow_fun_conv ~> relpow_fun_conv
850 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
851 rel_pow_finite_bounded ~> relpow_finite_bounded
852 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
853 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
854 single_valued_rel_pow ~> single_valued_relpow
858 * Theory Relation: Consolidated constant name for relation composition
859 and corresponding theorem names:
861 - Renamed constant rel_comp to relcomp.
863 - Dropped abbreviation pred_comp. Use relcompp instead.
867 rel_compI ~> relcompI
868 rel_compEpair ~> relcompEpair
869 rel_compE ~> relcompE
870 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
871 rel_comp_empty1 ~> relcomp_empty1
872 rel_comp_mono ~> relcomp_mono
873 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
874 rel_comp_distrib ~> relcomp_distrib
875 rel_comp_distrib2 ~> relcomp_distrib2
876 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
877 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
878 single_valued_rel_comp ~> single_valued_relcomp
879 rel_comp_def ~> relcomp_unfold
880 converse_rel_comp ~> converse_relcomp
881 pred_compI ~> relcomppI
882 pred_compE ~> relcomppE
883 pred_comp_bot1 ~> relcompp_bot1
884 pred_comp_bot2 ~> relcompp_bot2
885 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
886 pred_comp_mono ~> relcompp_mono
887 pred_comp_distrib ~> relcompp_distrib
888 pred_comp_distrib2 ~> relcompp_distrib2
889 converse_pred_comp ~> converse_relcompp
891 finite_rel_comp ~> finite_relcomp
893 set_rel_comp ~> set_relcomp
897 * Theory Divides: Discontinued redundant theorems about div and mod.
898 INCOMPATIBILITY, use the corresponding generic theorems instead.
900 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
901 zdiv_self ~> div_self
902 zmod_self ~> mod_self
905 zdiv_zmod_equality ~> div_mod_equality2
906 zdiv_zmod_equality2 ~> div_mod_equality
907 zmod_zdiv_trivial ~> mod_div_trivial
908 zdiv_zminus_zminus ~> div_minus_minus
909 zmod_zminus_zminus ~> mod_minus_minus
910 zdiv_zminus2 ~> div_minus_right
911 zmod_zminus2 ~> mod_minus_right
912 zdiv_minus1_right ~> div_minus1_right
913 zmod_minus1_right ~> mod_minus1_right
914 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
915 zmod_zmult1_eq ~> mod_mult_right_eq
916 zpower_zmod ~> power_mod
918 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
919 mod_mult_distrib ~> mult_mod_left
920 mod_mult_distrib2 ~> mult_mod_right
922 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
923 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
925 * Finite_Set.fold now qualified. INCOMPATIBILITY.
927 * Consolidated theorem names concerning fold combinators:
929 inf_INFI_fold_inf ~> inf_INF_fold_inf
930 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
931 INFI_fold_inf ~> INF_fold_inf
932 SUPR_fold_sup ~> SUP_fold_sup
933 union_set ~> union_set_fold
934 minus_set ~> minus_set_fold
935 INFI_set_fold ~> INF_set_fold
936 SUPR_set_fold ~> SUP_set_fold
937 INF_code ~> INF_set_foldr
938 SUP_code ~> SUP_set_foldr
939 foldr.simps ~> foldr.simps (in point-free formulation)
940 foldr_fold_rev ~> foldr_conv_fold
941 foldl_fold ~> foldl_conv_fold
942 foldr_foldr ~> foldr_conv_foldl
943 foldl_foldr ~> foldl_conv_foldr
944 fold_set_remdups ~> fold_set_fold_remdups
945 fold_set ~> fold_set_fold
946 fold1_set ~> fold1_set_fold
950 * Dropped rarely useful theorems concerning fold combinators:
951 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
952 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
953 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
954 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
955 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
956 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
957 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
958 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
959 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
960 unfolding "foldr_conv_fold" and "foldl_conv_fold".
962 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
963 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
964 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
965 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
966 lemmas over fold rather than foldr, or make use of lemmas
967 fold_conv_foldr and fold_rev.
969 * Congruence rules Option.map_cong and Option.bind_cong for recursion
970 through option types.
972 * "Transitive_Closure.ntrancl": bounded transitive closure on
975 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
977 * Theory Int: Discontinued many legacy theorems specific to type int.
978 INCOMPATIBILITY, use the corresponding generic theorems instead.
980 zminus_zminus ~> minus_minus
981 zminus_0 ~> minus_zero
982 zminus_zadd_distrib ~> minus_add_distrib
983 zadd_commute ~> add_commute
984 zadd_assoc ~> add_assoc
985 zadd_left_commute ~> add_left_commute
989 zadd_0_right ~> add_0_right
990 zadd_zminus_inverse2 ~> left_minus
991 zmult_zminus ~> mult_minus_left
992 zmult_commute ~> mult_commute
993 zmult_assoc ~> mult_assoc
994 zadd_zmult_distrib ~> left_distrib
995 zadd_zmult_distrib2 ~> right_distrib
996 zdiff_zmult_distrib ~> left_diff_distrib
997 zdiff_zmult_distrib2 ~> right_diff_distrib
998 zmult_1 ~> mult_1_left
999 zmult_1_right ~> mult_1_right
1000 zle_refl ~> order_refl
1001 zle_trans ~> order_trans
1002 zle_antisym ~> order_antisym
1003 zle_linear ~> linorder_linear
1004 zless_linear ~> linorder_less_linear
1005 zadd_left_mono ~> add_left_mono
1006 zadd_strict_right_mono ~> add_strict_right_mono
1007 zadd_zless_mono ~> add_less_le_mono
1008 int_0_less_1 ~> zero_less_one
1009 int_0_neq_1 ~> zero_neq_one
1011 zpower_zadd_distrib ~> power_add
1012 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1013 zero_le_zpower_abs ~> zero_le_power_abs
1015 * Theory Deriv: Renamed
1017 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1019 * Theory Library/Multiset: Improved code generation of multisets.
1021 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1022 are expressed via type classes again. The special syntax
1023 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1024 setsum_set, which is now subsumed by Big_Operators.setsum.
1027 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1028 use theory HOL/Library/Nat_Bijection instead.
1030 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1031 trees is now inside a type class context. Names of affected
1032 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1033 theories working directly with raw red-black trees, adapt the names as
1037 bulkload -> rbt_bulkload
1038 del_from_left -> rbt_del_from_left
1039 del_from_right -> rbt_del_from_right
1041 delete -> rbt_delete
1043 insert -> rbt_insert
1044 insertw -> rbt_insert_with
1045 insert_with_key -> rbt_insert_with_key
1046 map_entry -> rbt_map_entry
1047 lookup -> rbt_lookup
1048 sorted -> rbt_sorted
1049 tree_greater -> rbt_greater
1050 tree_less -> rbt_less
1051 tree_less_symbol -> rbt_less_symbol
1053 union_with -> rbt_union_with
1054 union_with_key -> rbt_union_with_key
1057 balance_left_sorted -> balance_left_rbt_sorted
1058 balance_left_tree_greater -> balance_left_rbt_greater
1059 balance_left_tree_less -> balance_left_rbt_less
1060 balance_right_sorted -> balance_right_rbt_sorted
1061 balance_right_tree_greater -> balance_right_rbt_greater
1062 balance_right_tree_less -> balance_right_rbt_less
1063 balance_sorted -> balance_rbt_sorted
1064 balance_tree_greater -> balance_rbt_greater
1065 balance_tree_less -> balance_rbt_less
1066 bulkload_is_rbt -> rbt_bulkload_is_rbt
1067 combine_sorted -> combine_rbt_sorted
1068 combine_tree_greater -> combine_rbt_greater
1069 combine_tree_less -> combine_rbt_less
1070 delete_in_tree -> rbt_delete_in_tree
1071 delete_is_rbt -> rbt_delete_is_rbt
1072 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1073 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1074 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1075 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1076 del_in_tree -> rbt_del_in_tree
1077 del_inv1_inv2 -> rbt_del_inv1_inv2
1078 del_sorted -> rbt_del_rbt_sorted
1079 del_tree_greater -> rbt_del_rbt_greater
1080 del_tree_less -> rbt_del_rbt_less
1081 dom_lookup_Branch -> dom_rbt_lookup_Branch
1082 entries_lookup -> entries_rbt_lookup
1083 finite_dom_lookup -> finite_dom_rbt_lookup
1084 insert_sorted -> rbt_insert_rbt_sorted
1085 insertw_is_rbt -> rbt_insertw_is_rbt
1086 insertwk_is_rbt -> rbt_insertwk_is_rbt
1087 insertwk_sorted -> rbt_insertwk_rbt_sorted
1088 insertw_sorted -> rbt_insertw_rbt_sorted
1089 ins_sorted -> ins_rbt_sorted
1090 ins_tree_greater -> ins_rbt_greater
1091 ins_tree_less -> ins_rbt_less
1092 is_rbt_sorted -> is_rbt_rbt_sorted
1093 lookup_balance -> rbt_lookup_balance
1094 lookup_bulkload -> rbt_lookup_rbt_bulkload
1095 lookup_delete -> rbt_lookup_rbt_delete
1096 lookup_Empty -> rbt_lookup_Empty
1097 lookup_from_in_tree -> rbt_lookup_from_in_tree
1098 lookup_in_tree -> rbt_lookup_in_tree
1099 lookup_ins -> rbt_lookup_ins
1100 lookup_insert -> rbt_lookup_rbt_insert
1101 lookup_insertw -> rbt_lookup_rbt_insertw
1102 lookup_insertwk -> rbt_lookup_rbt_insertwk
1103 lookup_keys -> rbt_lookup_keys
1104 lookup_map -> rbt_lookup_map
1105 lookup_map_entry -> rbt_lookup_rbt_map_entry
1106 lookup_tree_greater -> rbt_lookup_rbt_greater
1107 lookup_tree_less -> rbt_lookup_rbt_less
1108 lookup_union -> rbt_lookup_rbt_union
1109 map_entry_color_of -> rbt_map_entry_color_of
1110 map_entry_inv1 -> rbt_map_entry_inv1
1111 map_entry_inv2 -> rbt_map_entry_inv2
1112 map_entry_is_rbt -> rbt_map_entry_is_rbt
1113 map_entry_sorted -> rbt_map_entry_rbt_sorted
1114 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1115 map_entry_tree_less -> rbt_map_entry_rbt_less
1116 map_tree_greater -> map_rbt_greater
1117 map_tree_less -> map_rbt_less
1118 map_sorted -> map_rbt_sorted
1119 paint_sorted -> paint_rbt_sorted
1120 paint_lookup -> paint_rbt_lookup
1121 paint_tree_greater -> paint_rbt_greater
1122 paint_tree_less -> paint_rbt_less
1123 sorted_entries -> rbt_sorted_entries
1124 tree_greater_eq_trans -> rbt_greater_eq_trans
1125 tree_greater_nit -> rbt_greater_nit
1126 tree_greater_prop -> rbt_greater_prop
1127 tree_greater_simps -> rbt_greater_simps
1128 tree_greater_trans -> rbt_greater_trans
1129 tree_less_eq_trans -> rbt_less_eq_trans
1130 tree_less_nit -> rbt_less_nit
1131 tree_less_prop -> rbt_less_prop
1132 tree_less_simps -> rbt_less_simps
1133 tree_less_trans -> rbt_less_trans
1134 tree_ord_props -> rbt_ord_props
1135 union_Branch -> rbt_union_Branch
1136 union_is_rbt -> rbt_union_is_rbt
1137 unionw_is_rbt -> rbt_unionw_is_rbt
1138 unionwk_is_rbt -> rbt_unionwk_is_rbt
1139 unionwk_sorted -> rbt_unionwk_rbt_sorted
1141 * Theory HOL/Library/Float: Floating point numbers are now defined as
1142 a subset of the real numbers. All operations are defined using the
1143 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1150 round_down -> float_round_down
1151 round_up -> float_round_up
1155 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1158 abs_float_def -> Float.compute_float_abs
1159 bitlen_ge0 -> bitlen_nonneg
1160 bitlen.simps -> Float.compute_bitlen
1161 float_components -> Float_mantissa_exponent
1162 float_divl.simps -> Float.compute_float_divl
1163 float_divr.simps -> Float.compute_float_divr
1164 float_eq_odd -> mult_powr_eq_mult_powr_iff
1165 float_power -> real_of_float_power
1166 lapprox_posrat_def -> Float.compute_lapprox_posrat
1167 lapprox_rat.simps -> Float.compute_lapprox_rat
1168 le_float_def' -> Float.compute_float_le
1169 le_float_def -> less_eq_float.rep_eq
1170 less_float_def' -> Float.compute_float_less
1171 less_float_def -> less_float.rep_eq
1172 normfloat_def -> Float.compute_normfloat
1173 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1174 normfloat -> normfloat_def
1175 normfloat_unique -> use normfloat_def
1176 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1177 one_float_def -> Float.compute_float_one
1178 plus_float_def -> Float.compute_float_plus
1179 rapprox_posrat_def -> Float.compute_rapprox_posrat
1180 rapprox_rat.simps -> Float.compute_rapprox_rat
1181 real_of_float_0 -> zero_float.rep_eq
1182 real_of_float_1 -> one_float.rep_eq
1183 real_of_float_abs -> abs_float.rep_eq
1184 real_of_float_add -> plus_float.rep_eq
1185 real_of_float_minus -> uminus_float.rep_eq
1186 real_of_float_mult -> times_float.rep_eq
1187 real_of_float_simp -> Float.rep_eq
1188 real_of_float_sub -> minus_float.rep_eq
1189 round_down.simps -> Float.compute_float_round_down
1190 round_up.simps -> Float.compute_float_round_up
1191 times_float_def -> Float.compute_float_times
1192 uminus_float_def -> Float.compute_float_uminus
1193 zero_float_def -> Float.compute_float_zero
1195 Lemmas not necessary anymore, use the transfer method:
1196 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1197 float_divr, float_le_simp, float_less1_mantissa_bound,
1198 float_less_simp, float_less_zero, float_le_zero,
1199 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1200 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1201 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1202 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1203 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1204 round_up, zero_le_float, zero_less_float
1206 * New theory HOL/Library/DAList provides an abstract type for
1207 association lists with distinct keys.
1209 * Session HOL/IMP: Added new theory of abstract interpretation of
1212 * Session HOL-Import: Re-implementation from scratch is faster,
1213 simpler, and more scalable. Requires a proof bundle, which is
1214 available as an external component. Discontinued old (and mostly
1215 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1217 * Session HOL-Word: Discontinued many redundant theorems specific to
1218 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1221 word_sub_alt ~> word_sub_wi
1222 word_add_alt ~> word_add_def
1223 word_mult_alt ~> word_mult_def
1224 word_minus_alt ~> word_minus_def
1225 word_0_alt ~> word_0_wi
1226 word_1_alt ~> word_1_wi
1227 word_add_0 ~> add_0_left
1228 word_add_0_right ~> add_0_right
1229 word_mult_1 ~> mult_1_left
1230 word_mult_1_right ~> mult_1_right
1231 word_add_commute ~> add_commute
1232 word_add_assoc ~> add_assoc
1233 word_add_left_commute ~> add_left_commute
1234 word_mult_commute ~> mult_commute
1235 word_mult_assoc ~> mult_assoc
1236 word_mult_left_commute ~> mult_left_commute
1237 word_left_distrib ~> left_distrib
1238 word_right_distrib ~> right_distrib
1239 word_left_minus ~> left_minus
1240 word_diff_0_right ~> diff_0_right
1241 word_diff_self ~> diff_self
1242 word_sub_def ~> diff_minus
1243 word_diff_minus ~> diff_minus
1244 word_add_ac ~> add_ac
1245 word_mult_ac ~> mult_ac
1246 word_plus_ac0 ~> add_0_left add_0_right add_ac
1247 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1248 word_order_trans ~> order_trans
1249 word_order_refl ~> order_refl
1250 word_order_antisym ~> order_antisym
1251 word_order_linear ~> linorder_linear
1252 lenw1_zero_neq_one ~> zero_neq_one
1253 word_number_of_eq ~> number_of_eq
1254 word_of_int_add_hom ~> wi_hom_add
1255 word_of_int_sub_hom ~> wi_hom_sub
1256 word_of_int_mult_hom ~> wi_hom_mult
1257 word_of_int_minus_hom ~> wi_hom_neg
1258 word_of_int_succ_hom ~> wi_hom_succ
1259 word_of_int_pred_hom ~> wi_hom_pred
1260 word_of_int_0_hom ~> word_0_wi
1261 word_of_int_1_hom ~> word_1_wi
1263 * Session HOL-Word: New proof method "word_bitwise" for splitting
1264 machine word equalities and inequalities into logical circuits,
1265 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1266 multiplication, shifting by constants, bitwise operators and numeric
1267 constants. Requires fixed-length word types, not 'a word. Solves
1268 many standard word identities outright and converts more into first
1269 order problems amenable to blast or similar. See also examples in
1270 HOL/Word/Examples/WordExamples.thy.
1272 * Session HOL-Probability: Introduced the type "'a measure" to
1273 represent measures, this replaces the records 'a algebra and 'a
1274 measure_space. The locales based on subset_class now have two
1275 locale-parameters the space \<Omega> and the set of measurable sets M.
1276 The product of probability spaces uses now the same constant as the
1277 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1278 measure". Most constants are defined now outside of locales and gain
1279 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1280 Measure space constructions for distributions and densities now got
1281 their own constants distr and density. Instead of using locales to
1282 describe measure spaces with a finite space, the measure count_space
1283 and point_measure is introduced. INCOMPATIBILITY.
1287 finite_measure.\<mu>' -> measure
1288 product_algebra_generator -> prod_algebra
1289 product_prob_space.emb -> prod_emb
1290 product_prob_space.infprod_algebra -> PiM
1293 completeable_measure_space
1294 finite_measure_space
1296 finite_product_finite_prob_space
1297 finite_product_sigma_algebra
1298 finite_sigma_algebra
1300 pair_finite_prob_space
1301 pair_finite_sigma_algebra
1304 product_sigma_algebra
1308 distribution -> use distr measure, or distributed predicate
1310 joint_distribution -> use distr measure, or distributed predicate
1311 pair_measure_generator
1312 product_prob_space.infprod_algebra -> use PiM
1315 Replacement theorems:
1316 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1317 finite_measure.empty_measure -> measure_empty
1318 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1319 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1320 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1321 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1322 finite_measure.finite_measure -> finite_measure.emeasure_finite
1323 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1324 finite_measure.positive_measure' -> measure_nonneg
1325 finite_measure.real_measure -> finite_measure.emeasure_real
1326 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1327 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1328 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1329 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1330 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1331 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1332 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1333 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1334 information_space.entropy_commute -> information_space.entropy_commute_simple
1335 information_space.entropy_eq -> information_space.entropy_simple_distributed
1336 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1337 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1338 information_space.entropy_uniform_max -> information_space.entropy_uniform
1339 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1340 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1341 information_space.KL_ge_0 -> information_space.KL_nonneg
1342 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1343 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1344 Int_stable_cuboids -> Int_stable_atLeastAtMost
1345 Int_stable_product_algebra_generator -> positive_integral
1346 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1347 measure_space.additive -> emeasure_additive
1348 measure_space.AE_iff_null_set -> AE_iff_null
1349 measure_space.almost_everywhere_def -> eventually_ae_filter
1350 measure_space.almost_everywhere_vimage -> AE_distrD
1351 measure_space.continuity_from_above -> INF_emeasure_decseq
1352 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1353 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1354 measure_space.continuity_from_below -> SUP_emeasure_incseq
1355 measure_space_density -> emeasure_density
1356 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1357 measure_space.integrable_vimage -> integrable_distr
1358 measure_space.integral_translated_density -> integral_density
1359 measure_space.integral_vimage -> integral_distr
1360 measure_space.measure_additive -> plus_emeasure
1361 measure_space.measure_compl -> emeasure_compl
1362 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1363 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1364 measure_space.measure_decseq -> decseq_emeasure
1365 measure_space.measure_Diff -> emeasure_Diff
1366 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1367 measure_space.measure_eq_0 -> emeasure_eq_0
1368 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1369 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1370 measure_space.measure_incseq -> incseq_emeasure
1371 measure_space.measure_insert -> emeasure_insert
1372 measure_space.measure_mono -> emeasure_mono
1373 measure_space.measure_not_negative -> emeasure_not_MInf
1374 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1375 measure_space.measure_setsum -> setsum_emeasure
1376 measure_space.measure_setsum_split -> setsum_emeasure_cover
1377 measure_space.measure_space_vimage -> emeasure_distr
1378 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1379 measure_space.measure_subadditive -> subadditive
1380 measure_space.measure_top -> emeasure_space
1381 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1382 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1383 measure_space.positive_integral_translated_density -> positive_integral_density
1384 measure_space.positive_integral_vimage -> positive_integral_distr
1385 measure_space.real_continuity_from_above -> Lim_measure_decseq
1386 measure_space.real_continuity_from_below -> Lim_measure_incseq
1387 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1388 measure_space.real_measure_Diff -> measure_Diff
1389 measure_space.real_measure_finite_Union -> measure_finite_Union
1390 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1391 measure_space.real_measure_subadditive -> measure_subadditive
1392 measure_space.real_measure_Union -> measure_Union
1393 measure_space.real_measure_UNION -> measure_UNION
1394 measure_space.simple_function_vimage -> simple_function_comp
1395 measure_space.simple_integral_vimage -> simple_integral_distr
1396 measure_space.simple_integral_vimage -> simple_integral_distr
1397 measure_unique_Int_stable -> measure_eqI_generator_eq
1398 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1399 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1400 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1401 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1402 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1403 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1404 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1405 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1406 pair_sigma_algebra.sets_swap -> sets_pair_swap
1407 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1408 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1409 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1410 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1411 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1412 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1413 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1414 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1415 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1416 prob_space.prob_space_vimage -> prob_space_distr
1417 prob_space.random_variable_restrict -> measurable_restrict
1418 prob_space_unique_Int_stable -> measure_eqI_prob_space
1419 product_algebraE -> prod_algebraE_all
1420 product_algebra_generator_der -> prod_algebra_eq_finite
1421 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1422 product_algebraI -> sets_PiM_I_finite
1423 product_measure_exists -> product_sigma_finite.sigma_finite
1424 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1425 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1426 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1427 product_prob_space.measurable_component -> measurable_component_singleton
1428 product_prob_space.measurable_emb -> measurable_prod_emb
1429 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1430 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1431 product_prob_space.measure_emb -> emeasure_prod_emb
1432 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1433 product_sigma_algebra.product_algebra_into_space -> space_closed
1434 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1435 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1436 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1437 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1438 sets_product_algebra -> sets_PiM
1439 sigma_algebra.measurable_sigma -> measurable_measure_of
1440 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1441 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1442 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1443 space_product_algebra -> space_PiM
1445 * Session HOL-TPTP: support to parse and import TPTP problems (all
1446 languages) into Isabelle/HOL.
1451 * New "case_product" attribute (see HOL).
1456 * Greater support for structured proofs involving induction or case
1459 * Much greater use of mathematical symbols.
1461 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1466 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1467 from a minor keyword introduced via theory header declaration.
1469 * Antiquotation @{command_spec "name"} produces the
1470 Outer_Syntax.command_spec from a major keyword introduced via theory
1471 header declaration; it can be passed to Outer_Syntax.command etc.
1473 * Local_Theory.define no longer hard-wires default theorem name
1474 "foo_def", but retains the binding as given. If that is Binding.empty
1475 / Attrib.empty_binding, the result is not registered as user-level
1476 fact. The Local_Theory.define_internal variant allows to specify a
1477 non-empty name (used for the foundation in the background theory),
1478 while omitting the fact binding in the user-context. Potential
1479 INCOMPATIBILITY for derived definitional packages: need to specify
1480 naming policy for primitive definitions more explicitly.
1482 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1483 conformance with similar operations in structure Term and Logic.
1485 * Antiquotation @{attributes [...]} embeds attribute source
1486 representation into the ML text, which is particularly useful with
1487 declarations like Local_Theory.note.
1489 * Structure Proof_Context follows standard naming scheme. Old
1490 ProofContext has been discontinued. INCOMPATIBILITY.
1492 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1493 change of semantics: update is applied to auxiliary local theory
1496 * Modernized some old-style infix operations:
1498 addeqcongs ~> Simplifier.add_eqcong
1499 deleqcongs ~> Simplifier.del_eqcong
1500 addcongs ~> Simplifier.add_cong
1501 delcongs ~> Simplifier.del_cong
1502 setmksimps ~> Simplifier.set_mksimps
1503 setmkcong ~> Simplifier.set_mkcong
1504 setmksym ~> Simplifier.set_mksym
1505 setmkeqTrue ~> Simplifier.set_mkeqTrue
1506 settermless ~> Simplifier.set_termless
1507 setsubgoaler ~> Simplifier.set_subgoaler
1508 addsplits ~> Splitter.add_split
1509 delsplits ~> Splitter.del_split
1514 * USER_HOME settings variable points to cross-platform user home
1515 directory, which coincides with HOME on POSIX systems only. Likewise,
1516 the Isabelle path specification "~" now expands to $USER_HOME, instead
1517 of former $HOME. A different default for USER_HOME may be set
1518 explicitly in shell environment, before Isabelle settings are
1519 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1520 the generic user home was intended.
1522 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1523 notation, which is useful for the jEdit file browser, for example.
1525 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1530 New in Isabelle2011-1 (October 2011)
1531 ------------------------------------
1535 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1536 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1538 - Management of multiple theory files directly from the editor
1539 buffer store -- bypassing the file-system (no requirement to save
1540 files for checking).
1542 - Markup of formal entities within the text buffer, with semantic
1543 highlighting, tooltips and hyperlinks to jump to defining source
1546 - Improved text rendering, with sub/superscripts in the source
1547 buffer (including support for copy/paste wrt. output panel, HTML
1548 theory output and other non-Isabelle text boxes).
1550 - Refined scheduling of proof checking and printing of results,
1551 based on interactive editor view. (Note: jEdit folding and
1552 narrowing allows to restrict buffer perspectives explicitly.)
1554 - Reduced CPU performance requirements, usable on machines with few
1557 - Reduced memory requirements due to pruning of unused document
1558 versions (garbage collection).
1560 See also ~~/src/Tools/jEdit/README.html for further information,
1561 including some remaining limitations.
1563 * Theory loader: source files are exclusively located via the master
1564 directory of each theory node (where the .thy file itself resides).
1565 The global load path (such as src/HOL/Library) has been discontinued.
1566 Note that the path element ~~ may be used to reference theories in the
1567 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1570 * Theory loader: source files are identified by content via SHA1
1571 digests. Discontinued former path/modtime identification and optional
1572 ISABELLE_FILE_IDENT plugin scripts.
1574 * Parallelization of nested Isar proofs is subject to
1575 Goal.parallel_proofs_threshold (default 100). See also isabelle
1578 * Name space: former unsynchronized references are now proper
1579 configuration options, with more conventional names:
1581 long_names ~> names_long
1582 short_names ~> names_short
1583 unique_names ~> names_unique
1585 Minor INCOMPATIBILITY, need to declare options in context like this:
1587 declare [[names_unique = false]]
1589 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
1590 that the result needs to be unique, which means fact specifications
1591 may have to be refined after enriching a proof context.
1593 * Attribute "case_names" has been refined: the assumptions in each case
1594 can be named now by following the case name with [name1 name2 ...].
1596 * Isabelle/Isar reference manual has been updated and extended:
1597 - "Synopsis" provides a catalog of main Isar language concepts.
1598 - Formal references in syntax diagrams, via @{rail} antiquotation.
1599 - Updated material from classic "ref" manual, notably about
1600 "Classical Reasoner".
1605 * Class bot and top require underlying partial order rather than
1606 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
1608 * Class complete_lattice: generalized a couple of lemmas from sets;
1609 generalized theorems INF_cong and SUP_cong. New type classes for
1610 complete boolean algebras and complete linear orders. Lemmas
1611 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
1612 class complete_linorder.
1614 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
1615 Sup_fun_def, Inf_apply, Sup_apply.
1617 Removed redundant lemmas (the right hand side gives hints how to
1618 replace them for (metis ...), or (simp only: ...) proofs):
1620 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
1621 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
1622 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
1623 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
1624 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
1625 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
1626 Inter_def ~> INF_def, image_def
1627 Union_def ~> SUP_def, image_def
1628 INT_eq ~> INF_def, and image_def
1629 UN_eq ~> SUP_def, and image_def
1630 INF_subset ~> INF_superset_mono [OF _ order_refl]
1632 More consistent and comprehensive names:
1634 INTER_eq_Inter_image ~> INF_def
1635 UNION_eq_Union_image ~> SUP_def
1638 INF_leI ~> INF_lower
1639 INF_leI2 ~> INF_lower2
1640 le_INFI ~> INF_greatest
1641 le_SUPI ~> SUP_upper
1642 le_SUPI2 ~> SUP_upper2
1643 SUP_leI ~> SUP_least
1644 INFI_bool_eq ~> INF_bool_eq
1645 SUPR_bool_eq ~> SUP_bool_eq
1646 INFI_apply ~> INF_apply
1647 SUPR_apply ~> SUP_apply
1648 INTER_def ~> INTER_eq
1649 UNION_def ~> UNION_eq
1653 * Renamed theory Complete_Lattice to Complete_Lattices.
1656 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
1657 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
1658 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
1659 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
1661 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
1662 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
1663 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
1666 * Added syntactic classes "inf" and "sup" for the respective
1667 constants. INCOMPATIBILITY: Changes in the argument order of the
1668 (mostly internal) locale predicates for some derived classes.
1670 * Theorem collections ball_simps and bex_simps do not contain theorems
1671 referring to UNION any longer; these have been moved to collection
1672 UN_ball_bex_simps. INCOMPATIBILITY.
1674 * Theory Archimedean_Field: floor now is defined as parameter of a
1675 separate type class floor_ceiling.
1677 * Theory Finite_Set: more coherent development of fold_set locales:
1679 locale fun_left_comm ~> locale comp_fun_commute
1680 locale fun_left_comm_idem ~> locale comp_fun_idem
1682 Both use point-free characterization; interpretation proofs may need
1683 adjustment. INCOMPATIBILITY.
1685 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
1686 accordance with standard mathematical terminology. INCOMPATIBILITY.
1688 * Theory Complex_Main: The locale interpretations for the
1689 bounded_linear and bounded_bilinear locales have been removed, in
1690 order to reduce the number of duplicate lemmas. Users must use the
1691 original names for distributivity theorems, potential INCOMPATIBILITY.
1693 divide.add ~> add_divide_distrib
1694 divide.diff ~> diff_divide_distrib
1695 divide.setsum ~> setsum_divide_distrib
1696 mult.add_right ~> right_distrib
1697 mult.diff_right ~> right_diff_distrib
1698 mult_right.setsum ~> setsum_right_distrib
1699 mult_left.diff ~> left_diff_distrib
1701 * Theory Complex_Main: Several redundant theorems have been removed or
1702 replaced by more general versions. INCOMPATIBILITY.
1704 real_diff_def ~> minus_real_def
1705 real_divide_def ~> divide_real_def
1706 real_less_def ~> less_le
1707 real_abs_def ~> abs_real_def
1708 real_sgn_def ~> sgn_real_def
1709 real_mult_commute ~> mult_commute
1710 real_mult_assoc ~> mult_assoc
1711 real_mult_1 ~> mult_1_left
1712 real_add_mult_distrib ~> left_distrib
1713 real_zero_not_eq_one ~> zero_neq_one
1714 real_mult_inverse_left ~> left_inverse
1715 INVERSE_ZERO ~> inverse_zero
1716 real_le_refl ~> order_refl
1717 real_le_antisym ~> order_antisym
1718 real_le_trans ~> order_trans
1719 real_le_linear ~> linear
1720 real_le_eq_diff ~> le_iff_diff_le_0
1721 real_add_left_mono ~> add_left_mono
1722 real_mult_order ~> mult_pos_pos
1723 real_mult_less_mono2 ~> mult_strict_left_mono
1724 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
1725 real_0_le_divide_iff ~> zero_le_divide_iff
1726 realpow_two_disj ~> power2_eq_iff
1727 real_squared_diff_one_factored ~> square_diff_one_factored
1728 realpow_two_diff ~> square_diff_square_factored
1729 reals_complete2 ~> complete_real
1730 real_sum_squared_expand ~> power2_sum
1731 exp_ln_eq ~> ln_unique
1733 expi_zero ~> exp_zero
1734 lemma_DERIV_subst ~> DERIV_cong
1735 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
1736 LIMSEQ_const ~> tendsto_const
1737 LIMSEQ_norm ~> tendsto_norm
1738 LIMSEQ_add ~> tendsto_add
1739 LIMSEQ_minus ~> tendsto_minus
1740 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
1741 LIMSEQ_diff ~> tendsto_diff
1742 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
1743 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
1744 LIMSEQ_mult ~> tendsto_mult
1745 LIMSEQ_inverse ~> tendsto_inverse
1746 LIMSEQ_divide ~> tendsto_divide
1747 LIMSEQ_pow ~> tendsto_power
1748 LIMSEQ_setsum ~> tendsto_setsum
1749 LIMSEQ_setprod ~> tendsto_setprod
1750 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
1751 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
1752 LIMSEQ_imp_rabs ~> tendsto_rabs
1753 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
1754 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
1755 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
1756 LIMSEQ_Complex ~> tendsto_Complex
1757 LIM_ident ~> tendsto_ident_at
1758 LIM_const ~> tendsto_const
1759 LIM_add ~> tendsto_add
1760 LIM_add_zero ~> tendsto_add_zero
1761 LIM_minus ~> tendsto_minus
1762 LIM_diff ~> tendsto_diff
1763 LIM_norm ~> tendsto_norm
1764 LIM_norm_zero ~> tendsto_norm_zero
1765 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
1766 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
1767 LIM_rabs ~> tendsto_rabs
1768 LIM_rabs_zero ~> tendsto_rabs_zero
1769 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
1770 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
1771 LIM_compose ~> tendsto_compose
1772 LIM_mult ~> tendsto_mult
1773 LIM_scaleR ~> tendsto_scaleR
1774 LIM_of_real ~> tendsto_of_real
1775 LIM_power ~> tendsto_power
1776 LIM_inverse ~> tendsto_inverse
1777 LIM_sgn ~> tendsto_sgn
1778 isCont_LIM_compose ~> isCont_tendsto_compose
1779 bounded_linear.LIM ~> bounded_linear.tendsto
1780 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
1781 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
1782 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
1783 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
1784 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
1785 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
1787 * Theory Complex_Main: The definition of infinite series was
1788 generalized. Now it is defined on the type class {topological_space,
1789 comm_monoid_add}. Hence it is useable also for extended real numbers.
1791 * Theory Complex_Main: The complex exponential function "expi" is now
1792 a type-constrained abbreviation for "exp :: complex => complex"; thus
1793 several polymorphic lemmas about "exp" are now applicable to "expi".
1797 - Theory Library/Code_Char_ord provides native ordering of
1798 characters in the target language.
1800 - Commands code_module and code_library are legacy, use export_code
1803 - Method "evaluation" is legacy, use method "eval" instead.
1805 - Legacy evaluator "SML" is deactivated by default. May be
1806 reactivated by the following theory command:
1808 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
1810 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
1812 * New proof method "induction" that gives induction hypotheses the
1813 name "IH", thus distinguishing them from further hypotheses that come
1814 from rule induction. The latter are still called "hyps". Method
1815 "induction" is a thin wrapper around "induct" and follows the same
1818 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
1819 still available as a legacy feature for some time.
1822 - Added "need" and "total_consts" options.
1823 - Reintroduced "show_skolems" option by popular demand.
1824 - Renamed attribute: nitpick_def ~> nitpick_unfold.
1828 - Use quasi-sound (and efficient) translations by default.
1829 - Added support for the following provers: E-ToFoF, LEO-II,
1830 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
1831 - Automatically preplay and minimize proofs before showing them if
1832 this can be done within reasonable time.
1833 - sledgehammer available_provers ~> sledgehammer supported_provers.
1835 - Added "preplay_timeout", "slicing", "type_enc", "sound",
1836 "max_mono_iters", and "max_new_mono_instances" options.
1837 - Removed "explicit_apply" and "full_types" options as well as "Full
1838 Types" Proof General menu item. INCOMPATIBILITY.
1841 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
1842 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
1846 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
1847 "elim:" options. INCOMPATIBILITY.
1848 - Introduced 'try' that not only runs 'try_methods' but also
1849 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
1852 - Added "eval" option to evaluate terms for the found counterexample
1853 (currently only supported by the default (exhaustive) tester).
1854 - Added post-processing of terms to obtain readable counterexamples
1855 (currently only supported by the default (exhaustive) tester).
1856 - New counterexample generator quickcheck[narrowing] enables
1857 narrowing-based testing. Requires the Glasgow Haskell compiler
1858 with its installation location defined in the Isabelle settings
1859 environment as ISABELLE_GHC.
1860 - Removed quickcheck tester "SML" based on the SML code generator
1861 (formly in HOL/Library).
1863 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
1864 use 'partial_function' instead.
1866 * Theory Library/Extended_Reals replaces now the positive extended
1867 reals found in probability theory. This file is extended by
1868 Multivariate_Analysis/Extended_Real_Limits.
1870 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
1871 from where it must be imported explicitly if it is really required.
1874 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
1875 been moved here. INCOMPATIBILITY.
1877 * Theory Library/Saturated provides type of numbers with saturated
1880 * Theory Library/Product_Lattice defines a pointwise ordering for the
1881 product type 'a * 'b, and provides instance proofs for various order
1882 and lattice type classes.
1884 * Theory Library/Countable now provides the "countable_datatype" proof
1885 method for proving "countable" class instances for datatypes.
1887 * Theory Library/Cset_Monad allows do notation for computable sets
1888 (cset) via the generic monad ad-hoc overloading facility.
1890 * Library: Theories of common data structures are split into theories
1891 for implementation, an invariant-ensuring type, and connection to an
1892 abstract type. INCOMPATIBILITY.
1894 - RBT is split into RBT and RBT_Mapping.
1895 - AssocList is split and renamed into AList and AList_Mapping.
1896 - DList is split into DList_Impl, DList, and DList_Cset.
1897 - Cset is split into Cset and List_Cset.
1899 * Theory Library/Nat_Infinity has been renamed to
1900 Library/Extended_Nat, with name changes of the following types and
1903 type inat ~> type enat
1905 Infty ~> infinity (overloaded)
1909 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
1910 been renamed accordingly. INCOMPATIBILITY.
1912 * Session Multivariate_Analysis: The euclidean_space type class now
1913 fixes a constant "Basis :: 'a set" consisting of the standard
1914 orthonormal basis for the type. Users now have the option of
1915 quantifying over this set instead of using the "basis" function, e.g.
1916 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
1918 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
1919 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
1920 "Cart_nth" and "Cart_lambda" have been respectively renamed to
1921 "vec_nth" and "vec_lambda"; theorems mentioning those names have
1922 changed to match. Definition theorems for overloaded constants now use
1923 the standard "foo_vec_def" naming scheme. A few other theorems have
1924 been renamed as follows (INCOMPATIBILITY):
1926 Cart_eq ~> vec_eq_iff
1927 dist_nth_le_cart ~> dist_vec_nth_le
1928 tendsto_vector ~> vec_tendstoI
1929 Cauchy_vector ~> vec_CauchyI
1931 * Session Multivariate_Analysis: Several duplicate theorems have been
1932 removed, and other theorems have been renamed or replaced with more
1933 general versions. INCOMPATIBILITY.
1935 finite_choice ~> finite_set_choice
1936 eventually_conjI ~> eventually_conj
1937 eventually_and ~> eventually_conj_iff
1938 eventually_false ~> eventually_False
1939 setsum_norm ~> norm_setsum
1940 Lim_sequentially ~> LIMSEQ_def
1941 Lim_ident_at ~> LIM_ident
1942 Lim_const ~> tendsto_const
1943 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
1944 Lim_neg ~> tendsto_minus
1945 Lim_add ~> tendsto_add
1946 Lim_sub ~> tendsto_diff
1947 Lim_mul ~> tendsto_scaleR
1948 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
1949 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
1950 Lim_linear ~> bounded_linear.tendsto
1951 Lim_component ~> tendsto_euclidean_component
1952 Lim_component_cart ~> tendsto_vec_nth
1953 Lim_inner ~> tendsto_inner [OF tendsto_const]
1954 dot_lsum ~> inner_setsum_left
1955 dot_rsum ~> inner_setsum_right
1956 continuous_cmul ~> continuous_scaleR [OF continuous_const]
1957 continuous_neg ~> continuous_minus
1958 continuous_sub ~> continuous_diff
1959 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
1960 continuous_mul ~> continuous_scaleR
1961 continuous_inv ~> continuous_inverse
1962 continuous_at_within_inv ~> continuous_at_within_inverse
1963 continuous_at_inv ~> continuous_at_inverse
1964 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
1965 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
1966 continuous_at_component ~> continuous_component [OF continuous_at_id]
1967 continuous_on_neg ~> continuous_on_minus
1968 continuous_on_sub ~> continuous_on_diff
1969 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
1970 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
1971 continuous_on_mul ~> continuous_on_scaleR
1972 continuous_on_mul_real ~> continuous_on_mult
1973 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
1974 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
1975 continuous_on_inverse ~> continuous_on_inv
1976 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
1977 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
1978 subset_interior ~> interior_mono
1979 subset_closure ~> closure_mono
1980 closure_univ ~> closure_UNIV
1981 real_arch_lt ~> reals_Archimedean2
1982 real_arch ~> reals_Archimedean3
1983 real_abs_norm ~> abs_norm_cancel
1984 real_abs_sub_norm ~> norm_triangle_ineq3
1985 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
1987 * Session HOL-Probability:
1988 - Caratheodory's extension lemma is now proved for ring_of_sets.
1989 - Infinite products of probability measures are now available.
1990 - Sigma closure is independent, if the generator is independent
1991 - Use extended reals instead of positive extended
1992 reals. INCOMPATIBILITY.
1994 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
1996 expand_fun_below ~> fun_below_iff
1997 below_fun_ext ~> fun_belowI
1998 expand_cfun_eq ~> cfun_eq_iff
1999 ext_cfun ~> cfun_eqI
2000 expand_cfun_below ~> cfun_below_iff
2001 below_cfun_ext ~> cfun_belowI
2002 monofun_fun_fun ~> fun_belowD
2003 monofun_fun_arg ~> monofunE
2004 monofun_lub_fun ~> adm_monofun [THEN admD]
2005 cont_lub_fun ~> adm_cont [THEN admD]
2006 cont2cont_Rep_CFun ~> cont2cont_APP
2007 cont_Rep_CFun_app ~> cont_APP_app
2008 cont_Rep_CFun_app_app ~> cont_APP_app_app
2009 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2010 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2011 contlub_cfun ~> lub_APP [symmetric]
2012 contlub_LAM ~> lub_LAM [symmetric]
2015 lift_distinct1 ~> lift.distinct(1)
2016 lift_distinct2 ~> lift.distinct(2)
2017 Def_not_UU ~> lift.distinct(2)
2018 Def_inject ~> lift.inject
2019 below_UU_iff ~> below_bottom_iff
2020 eq_UU_iff ~> eq_bottom_iff
2023 *** Document preparation ***
2025 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2026 isar-ref manual, both for description and actual application of the
2029 * Antiquotation @{value} evaluates the given term and presents its
2032 * Antiquotations: term style "isub" provides ad-hoc conversion of
2033 variables x1, y23 into subscripted form x\<^isub>1,
2034 y\<^isub>2\<^isub>3.
2036 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2037 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2039 * Localized \isabellestyle switch can be used within blocks or groups
2042 \isabellestyle{it} %preferred default
2043 {\isabellestylett @{text "typewriter stuff"}}
2045 * Discontinued special treatment of hard tabulators. Implicit
2046 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2052 * The inner syntax of sort/type/term/prop supports inlined YXML
2053 representations within quoted string tokens. By encoding logical
2054 entities via Term_XML (in ML or Scala) concrete syntax can be
2055 bypassed, which is particularly useful for producing bits of text
2056 under external program control.
2058 * Antiquotations for ML and document preparation are managed as theory
2059 data, which requires explicit setup.
2061 * Isabelle_Process.is_active allows tools to check if the official
2062 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2063 (better known as Proof General).
2065 * Structure Proof_Context follows standard naming scheme. Old
2066 ProofContext is still available for some time as legacy alias.
2068 * Structure Timing provides various operations for timing; supersedes
2069 former start_timing/end_timing etc.
2071 * Path.print is the official way to show file-system paths to users
2072 (including quotes etc.).
2074 * Inner syntax: identifiers in parse trees of generic categories
2075 "logic", "aprop", "idt" etc. carry position information (disguised as
2076 type constraints). Occasional INCOMPATIBILITY with non-compliant
2077 translations that choke on unexpected type constraints. Positions can
2078 be stripped in ML translations via Syntax.strip_positions /
2079 Syntax.strip_positions_ast, or via the syntax constant
2080 "_strip_positions" within parse trees. As last resort, positions can
2081 be disabled via the configuration option Syntax.positions, which is
2082 called "syntax_positions" in Isar attribute syntax.
2084 * Discontinued special status of various ML structures that contribute
2085 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2086 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2087 refer directly to Ast.Constant, Lexicon.is_identifier,
2088 Syntax_Trans.mk_binder_tr etc.
2090 * Typed print translation: discontinued show_sorts argument, which is
2091 already available via context of "advanced" translation.
2093 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2094 goal states; body tactic needs to address all subgoals uniformly.
2096 * Slightly more special eq_list/eq_set, with shortcut involving
2097 pointer equality (assumes that eq relation is reflexive).
2099 * Classical tactics use proper Proof.context instead of historic types
2100 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2101 operate directly on Proof.context. Raw type claset retains its use as
2102 snapshot of the classical context, which can be recovered via
2103 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2104 INCOMPATIBILITY, classical tactics and derived proof methods require
2105 proper Proof.context.
2110 * Discontinued support for Poly/ML 5.2, which was the last version
2111 without proper multithreading and TimeLimit implementation.
2113 * Discontinued old lib/scripts/polyml-platform, which has been
2114 obsolete since Isabelle2009-2.
2116 * Various optional external tools are referenced more robustly and
2117 uniformly by explicit Isabelle settings as follows:
2119 ISABELLE_CSDP (formerly CSDP_EXE)
2120 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2121 ISABELLE_OCAML (formerly EXEC_OCAML)
2122 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2123 ISABELLE_YAP (formerly EXEC_YAP)
2125 Note that automated detection from the file-system or search path has
2126 been discontinued. INCOMPATIBILITY.
2128 * Scala layer provides JVM method invocation service for static
2129 methods of type (String)String, see Invoke_Scala.method in ML. For
2132 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2134 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2135 this allows to pass structured values between ML and Scala.
2137 * The IsabelleText fonts includes some further glyphs to support the
2138 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2139 installed a local copy (which is normally *not* required) need to
2140 delete or update it from ~~/lib/fonts/.
2144 New in Isabelle2011 (January 2011)
2145 ----------------------------------
2149 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2150 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2151 useful tooltips and hyperlinks produced from its static analysis. The
2152 bundled component provides an executable Isabelle tool that can be run
2155 Isabelle2011/bin/isabelle jedit
2157 * Significantly improved Isabelle/Isar implementation manual.
2159 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2160 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2161 while the default heap location within that directory lacks that extra
2162 suffix. This isolates multiple Isabelle installations from each
2163 other, avoiding problems with old settings in new versions.
2164 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2166 * Source files are always encoded as UTF-8, instead of old-fashioned
2167 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2168 the following package declarations:
2170 \usepackage[utf8]{inputenc}
2171 \usepackage{textcomp}
2173 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2174 a Unicode character is treated as a single symbol, not a sequence of
2175 non-ASCII bytes as before. Since Isabelle/ML string literals may
2176 contain symbols without further backslash escapes, Unicode can now be
2177 used here as well. Recall that Symbol.explode in ML provides a
2178 consistent view on symbols, while raw explode (or String.explode)
2179 merely give a byte-oriented representation.
2181 * Theory loader: source files are primarily located via the master
2182 directory of each theory node (where the .thy file itself resides).
2183 The global load path is still partially available as legacy feature.
2184 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2185 explicit paths, relatively to the theory.
2187 * Special treatment of ML file names has been discontinued.
2188 Historically, optional extensions .ML or .sml were added on demand --
2189 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2190 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2192 * Various options that affect pretty printing etc. are now properly
2193 handled within the context via configuration options, instead of
2194 unsynchronized references or print modes. There are both ML Config.T
2195 entities and Isar declaration attributes to access these.
2197 ML (Config.T) Isar (attribute)
2199 eta_contract eta_contract
2200 show_brackets show_brackets
2201 show_sorts show_sorts
2202 show_types show_types
2203 show_question_marks show_question_marks
2204 show_consts show_consts
2205 show_abbrevs show_abbrevs
2207 Syntax.ast_trace syntax_ast_trace
2208 Syntax.ast_stat syntax_ast_stat
2209 Syntax.ambiguity_level syntax_ambiguity_level
2211 Goal_Display.goals_limit goals_limit
2212 Goal_Display.show_main_goal show_main_goal
2214 Method.rule_trace rule_trace
2216 Thy_Output.display thy_output_display
2217 Thy_Output.quotes thy_output_quotes
2218 Thy_Output.indent thy_output_indent
2219 Thy_Output.source thy_output_source
2220 Thy_Output.break thy_output_break
2222 Note that corresponding "..._default" references in ML may only be
2223 changed globally at the ROOT session setup, but *not* within a theory.
2224 The option "show_abbrevs" supersedes the former print mode
2225 "no_abbrevs" with inverted meaning.
2227 * More systematic naming of some configuration options.
2230 trace_simp ~> simp_trace
2231 debug_simp ~> simp_debug
2233 * Support for real valued configuration options, using simplistic
2234 floating-point notation that coincides with the inner syntax for
2237 * Support for real valued preferences (with approximative PGIP type):
2238 front-ends need to accept "pgint" values in float notation.
2241 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2244 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2249 * Command 'type_synonym' (with single argument) replaces somewhat
2250 outdated 'types', which is still available as legacy feature for some
2253 * Command 'nonterminal' (with 'and' separated list of arguments)
2254 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2256 * Command 'notepad' replaces former 'example_proof' for
2257 experimentation in Isar without any result. INCOMPATIBILITY.
2259 * Locale interpretation commands 'interpret' and 'sublocale' accept
2260 lists of equations to map definitions in a locale to appropriate
2261 entities in the context of the interpretation. The 'interpretation'
2262 command already provided this functionality.
2264 * Diagnostic command 'print_dependencies' prints the locale instances
2265 that would be activated if the specified expression was interpreted in
2266 the current context. Variant "print_dependencies!" assumes a context
2267 without interpretations.
2269 * Diagnostic command 'print_interps' prints interpretations in proofs
2270 in addition to interpretations in theories.
2272 * Discontinued obsolete 'global' and 'local' commands to manipulate
2273 the theory name space. Rare INCOMPATIBILITY. The ML functions
2274 Sign.root_path and Sign.local_path may be applied directly where this
2275 feature is still required for historical reasons.
2277 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2278 'definition' instead.
2280 * The "prems" fact, which refers to the accidental collection of
2281 foundational premises in the context, is now explicitly marked as
2282 legacy feature and will be discontinued soon. Consider using "assms"
2283 of the head statement or reference facts by explicit names.
2285 * Document antiquotations @{class} and @{type} print classes and type
2288 * Document antiquotation @{file} checks file/directory entries within
2289 the local file system.
2294 * Coercive subtyping: functions can be declared as coercions and type
2295 inference will add them as necessary upon input of a term. Theory
2296 Complex_Main declares real :: nat => real and real :: int => real as
2297 coercions. A coercion function f is declared like this:
2299 declare [[coercion f]]
2301 To lift coercions through type constructors (e.g. from nat => real to
2302 nat list => real list), map functions can be declared, e.g.
2304 declare [[coercion_map map]]
2306 Currently coercion inference is activated only in theories including
2307 real numbers, i.e. descendants of Complex_Main. This is controlled by
2308 the configuration option "coercion_enabled", e.g. it can be enabled in
2309 other theories like this:
2311 declare [[coercion_enabled]]
2313 * Command 'partial_function' provides basic support for recursive
2314 function definitions over complete partial orders. Concrete instances
2315 are provided for i) the option type, ii) tail recursion on arbitrary
2316 types, and iii) the heap monad of Imperative_HOL. See
2317 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2320 * Function package: f.psimps rules are no longer implicitly declared
2321 as [simp]. INCOMPATIBILITY.
2323 * Datatype package: theorems generated for executable equality (class
2324 "eq") carry proper names and are treated as default code equations.
2326 * Inductive package: now offers command 'inductive_simps' to
2327 automatically derive instantiated and simplified equations for
2328 inductive predicates, similar to 'inductive_cases'.
2330 * Command 'enriched_type' allows to register properties of the
2331 functorial structure of types.
2333 * Improved infrastructure for term evaluation using code generator
2334 techniques, in particular static evaluation conversions.
2336 * Code generator: Scala (2.8 or higher) has been added to the target
2339 * Code generator: globbing constant expressions "*" and "Theory.*"
2340 have been replaced by the more idiomatic "_" and "Theory._".
2343 * Code generator: export_code without explicit file declaration prints
2344 to standard output. INCOMPATIBILITY.
2346 * Code generator: do not print function definitions for case
2347 combinators any longer.
2349 * Code generator: simplification with rules determined with
2350 src/Tools/Code/code_simp.ML and method "code_simp".
2352 * Code generator for records: more idiomatic representation of record
2353 types. Warning: records are not covered by ancient SML code
2354 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2355 rep_datatype declaration helps to succeed then:
2359 rep_datatype foo_ext ...
2361 * Records: logical foundation type for records does not carry a
2362 '_type' suffix any longer (obsolete due to authentic syntax).
2365 * Quickcheck now by default uses exhaustive testing instead of random
2366 testing. Random testing can be invoked by "quickcheck [random]",
2367 exhaustive testing by "quickcheck [exhaustive]".
2369 * Quickcheck instantiates polymorphic types with small finite
2370 datatypes by default. This enables a simple execution mechanism to
2371 handle quantifiers and function equality over the finite datatypes.
2373 * Quickcheck random generator has been renamed from "code" to
2374 "random". INCOMPATIBILITY.
2376 * Quickcheck now has a configurable time limit which is set to 30
2377 seconds by default. This can be changed by adding [timeout = n] to the
2378 quickcheck command. The time limit for Auto Quickcheck is still set
2381 * Quickcheck in locales considers interpretations of that locale for
2382 counter example search.
2385 - Added "smt" and "remote_smt" provers based on the "smt" proof
2386 method. See the Sledgehammer manual for details ("isabelle doc
2389 sledgehammer atp_info ~> sledgehammer running_provers
2390 sledgehammer atp_kill ~> sledgehammer kill_provers
2391 sledgehammer available_atps ~> sledgehammer available_provers
2394 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2395 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2396 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2397 (and "ms" and "min" are no longer supported)
2402 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2403 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2405 - Added support for partial quotient types.
2406 - Added local versions of the "Nitpick.register_xxx" functions.
2407 - Added "whack" option.
2408 - Allow registration of quotient types as codatatypes.
2409 - Improved "merge_type_vars" option to merge more types.
2410 - Removed unsound "fast_descrs" option.
2411 - Added custom symmetry breaking for datatypes, making it possible to reach
2412 higher cardinalities.
2413 - Prevent the expansion of too large definitions.
2415 * Proof methods "metis" and "meson" now have configuration options
2416 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2417 to diagnose these tools. E.g.
2419 using [[metis_trace = true]]
2421 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2422 manually as command 'solve_direct'.
2424 * The default SMT solver Z3 must be enabled explicitly (due to
2425 licensing issues) by setting the environment variable
2426 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2427 commercial applications, the SMT solver CVC3 is provided as fall-back;
2428 changing the SMT solver is done via the configuration option
2431 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2432 i.e. "remote_cvc3" and "remote_z3".
2434 * Added basic SMT support for datatypes, records, and typedefs using
2435 the oracle mode (no proofs). Direct support of pairs has been dropped
2436 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2437 support for a similar behavior). Minor INCOMPATIBILITY.
2439 * Changed SMT configuration options:
2441 z3_proofs ~> smt_oracle (with inverted meaning)
2442 z3_trace_assms ~> smt_trace_used_facts
2455 * Boogie output files (.b2i files) need to be declared in the theory
2458 * Simplification procedure "list_to_set_comprehension" rewrites list
2459 comprehensions applied to List.set to set comprehensions. Occasional
2460 INCOMPATIBILITY, may be deactivated like this:
2462 declare [[simproc del: list_to_set_comprehension]]
2464 * Removed old version of primrec package. INCOMPATIBILITY.
2466 * Removed simplifier congruence rule of "prod_case", as has for long
2467 been the case with "split". INCOMPATIBILITY.
2469 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2471 * Removed [split_format ... and ... and ...] version of
2472 [split_format]. Potential INCOMPATIBILITY.
2474 * Predicate "sorted" now defined inductively, with nice induction
2475 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2477 * Constant "contents" renamed to "the_elem", to free the generic name
2478 contents for other uses. INCOMPATIBILITY.
2480 * Renamed class eq and constant eq (for code generation) to class
2481 equal and constant equal, plus renaming of related facts and various
2482 tuning. INCOMPATIBILITY.
2484 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2486 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2489 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2490 avoid confusion with finite sets. INCOMPATIBILITY.
2492 * Abandoned locales equiv, congruent and congruent2 for equivalence
2493 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2496 * Some previously unqualified names have been qualified:
2503 Trueprop ~> HOL.Trueprop
2508 op --> ~> HOL.implies
2520 Pair ~> Product_Type.Pair
2521 fst ~> Product_Type.fst
2522 snd ~> Product_Type.snd
2523 curry ~> Product_Type.curry
2525 Collect ~> Set.Collect
2529 * More canonical naming convention for some fundamental definitions:
2531 bot_bool_eq ~> bot_bool_def
2532 top_bool_eq ~> top_bool_def
2533 inf_bool_eq ~> inf_bool_def
2534 sup_bool_eq ~> sup_bool_def
2535 bot_fun_eq ~> bot_fun_def
2536 top_fun_eq ~> top_fun_def
2537 inf_fun_eq ~> inf_fun_def
2538 sup_fun_eq ~> sup_fun_def
2542 * More stylized fact names:
2544 expand_fun_eq ~> fun_eq_iff
2545 expand_set_eq ~> set_eq_iff
2547 nat_number ~> eval_nat_numeral
2551 * Refactoring of code-generation specific operations in theory List:
2557 mem_iff ~> member_def
2558 null_empty ~> null_def
2560 INCOMPATIBILITY. Note that these were not supposed to be used
2561 regularly unless for striking reasons; their main purpose was code
2564 Various operations from the Haskell prelude are used for generating
2567 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2568 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2569 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2571 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2572 "*" and "+" respectively. INCOMPATIBILITY.
2574 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2575 "Sum_Type.Plus" instead.
2577 * Constant "split" has been merged with constant "prod_case"; names of
2578 ML functions, facts etc. involving split have been retained so far,
2579 though. INCOMPATIBILITY.
2581 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2582 instead. INCOMPATIBILITY.
2584 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2587 * Former theory Library/Enum is now part of the HOL-Main image.
2588 INCOMPATIBILITY: all constants of the Enum theory now have to be
2589 referred to by its qualified name.
2592 nlists ~> Enum.nlists
2593 product ~> Enum.product
2595 * Theory Library/Monad_Syntax provides do-syntax for monad types.
2596 Syntax in Library/State_Monad has been changed to avoid ambiguities.
2599 * Theory Library/SetsAndFunctions has been split into
2600 Library/Function_Algebras and Library/Set_Algebras; canonical names
2601 for instance definitions for functions; various improvements.
2604 * Theory Library/Multiset provides stable quicksort implementation of
2607 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
2610 * Session Multivariate_Analysis: introduced a type class for euclidean
2611 space. Most theorems are now stated in terms of euclidean spaces
2612 instead of finite cartesian products.
2615 real ^ 'n ~> 'a::real_vector
2616 ~> 'a::euclidean_space
2617 ~> 'a::ordered_euclidean_space
2618 (depends on your needs)
2622 \<chi> x. _ ~> \<chi>\<chi> x. _
2625 Also note that the indices are now natural numbers and not from some
2626 finite type. Finite cartesian products of euclidean spaces, products
2627 of euclidean spaces the real and complex numbers are instantiated to
2628 be euclidean_spaces. INCOMPATIBILITY.
2630 * Session Probability: introduced pextreal as positive extended real
2631 numbers. Use pextreal as value for measures. Introduce the
2632 Radon-Nikodym derivative, product spaces and Fubini's theorem for
2633 arbitrary sigma finite measures. Introduces Lebesgue measure based on
2634 the integral in Multivariate Analysis. INCOMPATIBILITY.
2636 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
2639 * Session SPARK (with image HOL-SPARK) provides commands to load and
2640 prove verification conditions generated by the SPARK Ada program
2641 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
2646 * Theorems for additive ring operations (locale abelian_monoid and
2647 descendants) are generated by interpretation from their multiplicative
2648 counterparts. Names (in particular theorem names) have the mandatory
2649 qualifier 'add'. Previous theorem names are redeclared for
2652 * Structure "int_ring" is now an abbreviation (previously a
2653 definition). This fits more natural with advanced interpretations.
2658 * The domain package now runs in definitional mode by default: The
2659 former command 'new_domain' is now called 'domain'. To use the domain
2660 package in its original axiomatic mode, use 'domain (unsafe)'.
2663 * The new class "domain" is now the default sort. Class "predomain"
2664 is an unpointed version of "domain". Theories can be updated by
2665 replacing sort annotations as shown below. INCOMPATIBILITY.
2667 'a::type ~> 'a::countable
2668 'a::cpo ~> 'a::predomain
2669 'a::pcpo ~> 'a::domain
2671 * The old type class "rep" has been superseded by class "domain".
2672 Accordingly, users of the definitional package must remove any
2673 "default_sort rep" declarations. INCOMPATIBILITY.
2675 * The domain package (definitional mode) now supports unpointed
2676 predomain argument types, as long as they are marked 'lazy'. (Strict
2677 arguments must be in class "domain".) For example, the following
2678 domain definition now works:
2680 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
2682 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
2683 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
2684 'a option, and 'a list. Additionally, it configures fixrec and the
2685 domain package to work with these types. For example:
2687 fixrec isInl :: "('a + 'b) u -> tr"
2688 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
2690 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
2692 * The "(permissive)" option of fixrec has been replaced with a
2693 per-equation "(unchecked)" option. See
2694 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
2696 * The "bifinite" class no longer fixes a constant "approx"; the class
2697 now just asserts that such a function exists. INCOMPATIBILITY.
2699 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
2700 defines an embedding of type 'a defl into udom by default; instances
2701 of "bifinite" and "domain" classes are available in
2702 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
2704 * The syntax "REP('a)" has been replaced with "DEFL('a)".
2706 * The predicate "directed" has been removed. INCOMPATIBILITY.
2708 * The type class "finite_po" has been removed. INCOMPATIBILITY.
2710 * The function "cprod_map" has been renamed to "prod_map".
2713 * The monadic bind operator on each powerdomain has new binder syntax
2714 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
2715 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
2717 * The infix syntax for binary union on each powerdomain has changed
2718 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
2719 syntax. INCOMPATIBILITY.
2721 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
2722 still supported as an input translation.
2724 * Renamed some theorems (the original names are also still available).
2726 expand_fun_below ~> fun_below_iff
2727 below_fun_ext ~> fun_belowI
2728 expand_cfun_eq ~> cfun_eq_iff
2729 ext_cfun ~> cfun_eqI
2730 expand_cfun_below ~> cfun_below_iff
2731 below_cfun_ext ~> cfun_belowI
2732 cont2cont_Rep_CFun ~> cont2cont_APP
2734 * The Abs and Rep functions for various types have changed names.
2735 Related theorem names have also changed to match. INCOMPATIBILITY.
2737 Rep_CFun ~> Rep_cfun
2738 Abs_CFun ~> Abs_cfun
2739 Rep_Sprod ~> Rep_sprod
2740 Abs_Sprod ~> Abs_sprod
2741 Rep_Ssum ~> Rep_ssum
2742 Abs_Ssum ~> Abs_ssum
2744 * Lemmas with names of the form *_defined_iff or *_strict_iff have
2745 been renamed to *_bottom_iff. INCOMPATIBILITY.
2747 * Various changes to bisimulation/coinduction with domain package:
2749 - Definitions of "bisim" constants no longer mention definedness.
2750 - With mutual recursion, "bisim" predicate is now curried.
2751 - With mutual recursion, each type gets a separate coind theorem.
2752 - Variable names in bisim_def and coinduct rules have changed.
2756 * Case combinators generated by the domain package for type "foo" are
2757 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
2759 * Several theorems have been renamed to more accurately reflect the
2760 names of constants and types involved. INCOMPATIBILITY.
2762 thelub_const ~> lub_const
2763 lub_const ~> is_lub_const
2765 is_lub_lub ~> is_lubD2
2767 unique_lub ~> is_lub_unique
2768 is_ub_lub ~> is_lub_rangeD1
2769 lub_bin_chain ~> is_lub_bin_chain
2770 lub_fun ~> is_lub_fun
2771 thelub_fun ~> lub_fun
2772 thelub_cfun ~> lub_cfun
2773 thelub_Pair ~> lub_Pair
2774 lub_cprod ~> is_lub_prod
2775 thelub_cprod ~> lub_prod
2776 minimal_cprod ~> minimal_prod
2777 inst_cprod_pcpo ~> inst_prod_pcpo
2779 compact_UU ~> compact_bottom
2780 deflation_UU ~> deflation_bottom
2781 finite_deflation_UU ~> finite_deflation_bottom
2783 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
2785 sq_ord_less_eq_trans ~> below_eq_trans
2786 sq_ord_eq_less_trans ~> eq_below_trans
2787 refl_less ~> below_refl
2788 trans_less ~> below_trans
2789 antisym_less ~> below_antisym
2790 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
2791 box_less ~> box_below
2792 rev_trans_less ~> rev_below_trans
2793 not_less2not_eq ~> not_below2not_eq
2794 less_UU_iff ~> below_UU_iff
2795 flat_less_iff ~> flat_below_iff
2796 adm_less ~> adm_below
2797 adm_not_less ~> adm_not_below
2798 adm_compact_not_less ~> adm_compact_not_below
2799 less_fun_def ~> below_fun_def
2800 expand_fun_less ~> fun_below_iff
2801 less_fun_ext ~> fun_belowI
2802 less_discr_def ~> below_discr_def
2803 discr_less_eq ~> discr_below_eq
2804 less_unit_def ~> below_unit_def
2805 less_cprod_def ~> below_prod_def
2806 prod_lessI ~> prod_belowI
2807 Pair_less_iff ~> Pair_below_iff
2808 fst_less_iff ~> fst_below_iff
2809 snd_less_iff ~> snd_below_iff
2810 expand_cfun_less ~> cfun_below_iff
2811 less_cfun_ext ~> cfun_belowI
2812 injection_less ~> injection_below
2813 less_up_def ~> below_up_def
2814 not_Iup_less ~> not_Iup_below
2815 Iup_less ~> Iup_below
2817 Def_inject_less_eq ~> Def_below_Def
2818 Def_less_is_eq ~> Def_below_iff
2819 spair_less_iff ~> spair_below_iff
2820 less_sprod ~> below_sprod
2821 spair_less ~> spair_below
2822 sfst_less_iff ~> sfst_below_iff
2823 ssnd_less_iff ~> ssnd_below_iff
2824 fix_least_less ~> fix_least_below
2825 dist_less_one ~> dist_below_one
2826 less_ONE ~> below_ONE
2827 ONE_less_iff ~> ONE_below_iff
2828 less_sinlD ~> below_sinlD
2829 less_sinrD ~> below_sinrD
2834 * All constant names are now qualified internally and use proper
2835 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
2840 * Antiquotation @{assert} inlines a function bool -> unit that raises
2841 Fail if the argument is false. Due to inlining the source position of
2842 failed assertions is included in the error output.
2844 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
2845 text is in practice always evaluated with a stable theory checkpoint.
2846 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
2848 * Antiquotation @{theory A} refers to theory A from the ancestry of
2849 the current context, not any accidental theory loader state as before.
2850 Potential INCOMPATIBILITY, subtle change in semantics.
2852 * Syntax.pretty_priority (default 0) configures the required priority
2853 of pretty-printed output and thus affects insertion of parentheses.
2855 * Syntax.default_root (default "any") configures the inner syntax
2856 category (nonterminal symbol) for parsing of terms.
2858 * Former exception Library.UnequalLengths now coincides with
2859 ListPair.UnequalLengths.
2861 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
2862 main functionality is provided by structure Simplifier.
2864 * Renamed raw "explode" function to "raw_explode" to emphasize its
2865 meaning. Note that internally to Isabelle, Symbol.explode is used in
2866 almost all situations.
2868 * Discontinued obsolete function sys_error and exception SYS_ERROR.
2869 See implementation manual for further details on exceptions in
2872 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
2875 * Renamed structure PureThy to Pure_Thy and moved most of its
2876 operations to structure Global_Theory, to emphasize that this is
2877 rarely-used global-only stuff.
2879 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
2880 instead (or tracing for high-volume output).
2882 * Configuration option show_question_marks only affects regular pretty
2883 printing of types and terms, not raw Term.string_of_vname.
2885 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
2886 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
2887 @{thms} for most purposes.
2889 * ML structure Unsynchronized is never opened, not even in Isar
2890 interaction mode as before. Old Unsynchronized.set etc. have been
2891 discontinued -- use plain := instead. This should be *rare* anyway,
2892 since modern tools always work via official context data, notably
2893 configuration options.
2895 * Parallel and asynchronous execution requires special care concerning
2896 interrupts. Structure Exn provides some convenience functions that
2897 avoid working directly with raw Interrupt. User code must not absorb
2898 interrupts -- intermediate handling (for cleanup etc.) needs to be
2899 followed by re-raising of the original exception. Another common
2900 source of mistakes are "handle _" patterns, which make the meaning of
2901 the program subject to physical effects of the environment.
2905 New in Isabelle2009-2 (June 2010)
2906 ---------------------------------
2910 * Authentic syntax for *all* logical entities (type classes, type
2911 constructors, term constants): provides simple and robust
2912 correspondence between formal entities and concrete syntax. Within
2913 the parse tree / AST representations, "constants" are decorated by
2914 their category (class, type, const) and spelled out explicitly with
2915 their full internal name.
2917 Substantial INCOMPATIBILITY concerning low-level syntax declarations
2918 and translations (translation rules and translation functions in ML).
2919 Some hints on upgrading:
2921 - Many existing uses of 'syntax' and 'translations' can be replaced
2922 by more modern 'type_notation', 'notation' and 'abbreviation',
2923 which are independent of this issue.
2925 - 'translations' require markup within the AST; the term syntax
2926 provides the following special forms:
2928 CONST c -- produces syntax version of constant c from context
2929 XCONST c -- literally c, checked as constant from context
2930 c -- literally c, if declared by 'syntax'
2932 Plain identifiers are treated as AST variables -- occasionally the
2933 system indicates accidental variables via the error "rhs contains
2936 Type classes and type constructors are marked according to their
2937 concrete syntax. Some old translations rules need to be written
2938 for the "type" category, using type constructor application
2939 instead of pseudo-term application of the default category
2942 - 'parse_translation' etc. in ML may use the following
2945 @{class_syntax c} -- type class c within parse tree / AST
2946 @{term_syntax c} -- type constructor c within parse tree / AST
2947 @{const_syntax c} -- ML version of "CONST c" above
2948 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
2950 - Literal types within 'typed_print_translations', i.e. those *not*
2951 represented as pseudo-terms are represented verbatim. Use @{class
2952 c} or @{type_name c} here instead of the above syntax
2955 Note that old non-authentic syntax was based on unqualified base
2956 names, so all of the above "constant" names would coincide. Recall
2957 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
2958 diagnose syntax problems.
2960 * Type constructors admit general mixfix syntax, not just infix.
2962 * Concrete syntax may be attached to local entities without a proof
2963 body, too. This works via regular mixfix annotations for 'fix',
2964 'def', 'obtain' etc. or via the explicit 'write' command, which is
2965 similar to the 'notation' command in theory specifications.
2967 * Discontinued unnamed infix syntax (legacy feature for many years) --
2968 need to specify constant name and syntax separately. Internal ML
2969 datatype constructors have been renamed from InfixName to Infix etc.
2970 Minor INCOMPATIBILITY.
2972 * Schematic theorem statements need to be explicitly markup as such,
2973 via commands 'schematic_lemma', 'schematic_theorem',
2974 'schematic_corollary'. Thus the relevance of the proof is made
2975 syntactically clear, which impacts performance in a parallel or
2976 asynchronous interactive environment. Minor INCOMPATIBILITY.
2978 * Use of cumulative prems via "!" in some proof methods has been
2979 discontinued (old legacy feature).
2981 * References 'trace_simp' and 'debug_simp' have been replaced by
2982 configuration options stored in the context. Enabling tracing (the
2983 case of debugging is similar) in proofs works via
2985 using [[trace_simp = true]]
2987 Tracing is then active for all invocations of the simplifier in
2988 subsequent goal refinement steps. Tracing may also still be enabled or
2989 disabled via the ProofGeneral settings menu.
2991 * Separate commands 'hide_class', 'hide_type', 'hide_const',
2992 'hide_fact' replace the former 'hide' KIND command. Minor
2995 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
2996 more efficient than combinations with -q1 or -q2.
3001 * Proofterms record type-class reasoning explicitly, using the
3002 "unconstrain" operation internally. This eliminates all sort
3003 constraints from a theorem and proof, introducing explicit
3004 OFCLASS-premises. On the proof term level, this operation is
3005 automatically applied at theorem boundaries, such that closed proofs
3006 are always free of sort constraints. INCOMPATIBILITY for tools that
3007 inspect proof terms.
3009 * Local theory specifications may depend on extra type variables that
3010 are not present in the result type -- arguments TYPE('a) :: 'a itself
3011 are added internally. For example:
3013 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3015 * Predicates of locales introduced by classes carry a mandatory
3016 "class" prefix. INCOMPATIBILITY.
3018 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3020 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3023 * Command 'code_reflect' allows to incorporate generated ML code into
3024 runtime environment; replaces immature code_datatype antiquotation.
3027 * Code generator: simple concept for abstract datatypes obeying
3030 * Code generator: details of internal data cache have no impact on the
3031 user space functionality any longer.
3033 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3034 subgoals. This is more appropriate for interpretations with 'where'.
3037 * Command 'example_proof' opens an empty proof body. This allows to
3038 experiment with Isar, without producing any persistent result.
3040 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3041 within a local theory context, with explicit checking of the
3042 constructors involved (in contrast to the raw 'syntax' versions).
3044 * Commands 'types' and 'typedecl' now work within a local theory
3045 context -- without introducing dependencies on parameters or
3046 assumptions, which is not possible in Isabelle/Pure.
3048 * Command 'defaultsort' has been renamed to 'default_sort', it works
3049 within a local theory context. Minor INCOMPATIBILITY.
3054 * Command 'typedef' now works within a local theory context -- without
3055 introducing dependencies on parameters or assumptions, which is not
3056 possible in Isabelle/Pure/HOL. Note that the logical environment may
3057 contain multiple interpretations of local typedefs (with different
3058 non-emptiness proofs), even in a global theory context.
3060 * New package for quotient types. Commands 'quotient_type' and
3061 'quotient_definition' may be used for defining types and constants by
3062 quotient constructions. An example is the type of integers created by
3063 quotienting pairs of natural numbers:
3066 intrel :: "(nat * nat) => (nat * nat) => bool"
3068 "intrel (x, y) (u, v) = (x + v = u + y)"
3070 quotient_type int = "nat * nat" / intrel
3071 by (auto simp add: equivp_def expand_fun_eq)
3074 "0::int" is "(0::nat, 0::nat)"
3076 The method "lifting" can be used to lift of theorems from the
3077 underlying "raw" type to the quotient type. The example
3078 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3079 construction and provides a reasoning infrastructure for finite sets.
3081 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3082 clash with new theory Quotient in Main HOL.
3084 * Moved the SMT binding into the main HOL session, eliminating
3085 separate HOL-SMT session.
3087 * List membership infix mem operation is only an input abbreviation.
3090 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3091 for future developements; former Library/Word.thy is still present in
3092 the AFP entry RSAPPS.
3094 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3095 longer shadowed. INCOMPATIBILITY.
3097 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3100 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3103 * Dropped normalizing_semiring etc; use the facts in semiring classes
3104 instead. INCOMPATIBILITY.
3106 * Dropped several real-specific versions of lemmas about floor and
3107 ceiling; use the generic lemmas from theory "Archimedean_Field"
3108 instead. INCOMPATIBILITY.
3110 floor_number_of_eq ~> floor_number_of
3111 le_floor_eq_number_of ~> number_of_le_floor
3112 le_floor_eq_zero ~> zero_le_floor
3113 le_floor_eq_one ~> one_le_floor
3114 floor_less_eq_number_of ~> floor_less_number_of
3115 floor_less_eq_zero ~> floor_less_zero
3116 floor_less_eq_one ~> floor_less_one
3117 less_floor_eq_number_of ~> number_of_less_floor
3118 less_floor_eq_zero ~> zero_less_floor
3119 less_floor_eq_one ~> one_less_floor
3120 floor_le_eq_number_of ~> floor_le_number_of
3121 floor_le_eq_zero ~> floor_le_zero
3122 floor_le_eq_one ~> floor_le_one
3123 floor_subtract_number_of ~> floor_diff_number_of
3124 floor_subtract_one ~> floor_diff_one
3125 ceiling_number_of_eq ~> ceiling_number_of
3126 ceiling_le_eq_number_of ~> ceiling_le_number_of
3127 ceiling_le_zero_eq ~> ceiling_le_zero
3128 ceiling_le_eq_one ~> ceiling_le_one
3129 less_ceiling_eq_number_of ~> number_of_less_ceiling
3130 less_ceiling_eq_zero ~> zero_less_ceiling
3131 less_ceiling_eq_one ~> one_less_ceiling
3132 ceiling_less_eq_number_of ~> ceiling_less_number_of
3133 ceiling_less_eq_zero ~> ceiling_less_zero
3134 ceiling_less_eq_one ~> ceiling_less_one
3135 le_ceiling_eq_number_of ~> number_of_le_ceiling
3136 le_ceiling_eq_zero ~> zero_le_ceiling
3137 le_ceiling_eq_one ~> one_le_ceiling
3138 ceiling_subtract_number_of ~> ceiling_diff_number_of
3139 ceiling_subtract_one ~> ceiling_diff_one
3141 * Theory "Finite_Set": various folding_XXX locales facilitate the
3142 application of the various fold combinators on finite sets.
3144 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3145 provides abstract red-black tree type which is backed by "RBT_Impl" as
3146 implementation. INCOMPATIBILTY.
3148 * Theory Library/Coinductive_List has been removed -- superseded by
3149 AFP/thys/Coinductive.
3151 * Theory PReal, including the type "preal" and related operations, has
3152 been removed. INCOMPATIBILITY.
3154 * Real: new development using Cauchy Sequences.
3156 * Split off theory "Big_Operators" containing setsum, setprod,
3157 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3159 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3160 "Int" etc. INCOMPATIBILITY.
3162 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3164 * New set of rules "ac_simps" provides combined assoc / commute
3165 rewrites for all interpretations of the appropriate generic locales.
3167 * Renamed theory "OrderedGroup" to "Groups" and split theory
3168 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3169 appropriate and more consistent names suitable for name prefixes
3170 within the HOL theories. INCOMPATIBILITY.
3172 * Some generic constants have been put to appropriate theories:
3173 - less_eq, less: Orderings
3174 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3175 - inverse, divide: Rings
3178 * More consistent naming of type classes involving orderings (and
3181 lower_semilattice ~> semilattice_inf
3182 upper_semilattice ~> semilattice_sup
3184 dense_linear_order ~> dense_linorder
3186 pordered_ab_group_add ~> ordered_ab_group_add
3187 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3188 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3189 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3190 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3191 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3192 pordered_cancel_semiring ~> ordered_cancel_semiring
3193 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3194 pordered_comm_ring ~> ordered_comm_ring
3195 pordered_comm_semiring ~> ordered_comm_semiring
3196 pordered_ring ~> ordered_ring
3197 pordered_ring_abs ~> ordered_ring_abs
3198 pordered_semiring ~> ordered_semiring
3200 ordered_ab_group_add ~> linordered_ab_group_add
3201 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3202 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3203 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3204 ordered_field ~> linordered_field
3205 ordered_field_no_lb ~> linordered_field_no_lb
3206 ordered_field_no_ub ~> linordered_field_no_ub
3207 ordered_field_dense_linear_order ~> dense_linordered_field
3208 ordered_idom ~> linordered_idom
3209 ordered_ring ~> linordered_ring
3210 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3211 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3212 ordered_ring_strict ~> linordered_ring_strict
3213 ordered_semidom ~> linordered_semidom
3214 ordered_semiring ~> linordered_semiring
3215 ordered_semiring_1 ~> linordered_semiring_1
3216 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3217 ordered_semiring_strict ~> linordered_semiring_strict
3219 The following slightly odd type classes have been moved to a
3220 separate theory Library/Lattice_Algebras:
3222 lordered_ab_group_add ~> lattice_ab_group_add
3223 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3224 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3225 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3226 lordered_ring ~> lattice_ring
3230 * Refined field classes:
3231 - classes division_ring_inverse_zero, field_inverse_zero,
3232 linordered_field_inverse_zero include rule inverse 0 = 0 --
3233 subsumes former division_by_zero class;
3234 - numerous lemmas have been ported from field to division_ring.
3237 * Refined algebra theorem collections:
3238 - dropped theorem group group_simps, use algebra_simps instead;
3239 - dropped theorem group ring_simps, use field_simps instead;
3240 - proper theorem collection field_simps subsumes former theorem
3241 groups field_eq_simps and field_simps;
3242 - dropped lemma eq_minus_self_iff which is a duplicate for
3246 * Theory Finite_Set and List: some lemmas have been generalized from
3249 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3250 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3251 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3252 union_Union_fold_union ~> sup_Sup_fold_sup
3253 Inter_fold_inter ~> Inf_fold_inf
3254 Union_fold_union ~> Sup_fold_sup
3255 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3256 union_UNION_fold_union ~> sup_SUPR_fold_sup
3257 INTER_fold_inter ~> INFI_fold_inf
3258 UNION_fold_union ~> SUPR_fold_sup
3260 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3261 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3262 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3263 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3264 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3265 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3267 * Reorganized theory Multiset: swapped notation of pointwise and
3270 - pointwise ordering is instance of class order with standard syntax
3272 - multiset ordering has syntax <=# and <#; partial order properties
3273 are provided by means of interpretation with prefix
3275 - less duplication, less historical organization of sections,
3276 conversion from associations lists to multisets, rudimentary code
3278 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3283 multiset_eq_conv_count_eq ~> multiset_ext_iff
3284 multi_count_ext ~> multiset_ext
3285 diff_union_inverse2 ~> diff_union_cancelR
3289 * Theory Permutation: replaced local "remove" by List.remove1.
3291 * Code generation: ML and OCaml code is decorated with signatures.
3293 * Theory List: added transpose.
3295 * Library/Nat_Bijection.thy is a collection of bijective functions
3296 between nat and other types, which supersedes the older libraries
3297 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3300 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3301 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3302 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3303 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3304 Countable.pair_encode ~> prod_encode
3305 NatIso.prod2nat ~> prod_encode
3306 NatIso.nat2prod ~> prod_decode
3307 NatIso.sum2nat ~> sum_encode
3308 NatIso.nat2sum ~> sum_decode
3309 NatIso.list2nat ~> list_encode
3310 NatIso.nat2list ~> list_decode
3311 NatIso.set2nat ~> set_encode
3312 NatIso.nat2set ~> set_decode
3315 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3316 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3317 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3318 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3319 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3320 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3321 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3322 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3323 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3324 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3325 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3326 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3327 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3330 - Renamed ATP commands:
3331 atp_info ~> sledgehammer running_atps
3332 atp_kill ~> sledgehammer kill_atps
3333 atp_messages ~> sledgehammer messages
3334 atp_minimize ~> sledgehammer minimize
3335 print_atps ~> sledgehammer available_atps
3337 - Added user's manual ("isabelle doc sledgehammer").
3338 - Added option syntax and "sledgehammer_params" to customize
3339 Sledgehammer's behavior. See the manual for details.
3340 - Modified the Isar proof reconstruction code so that it produces
3341 direct proofs rather than proofs by contradiction. (This feature
3342 is still experimental.)
3343 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3345 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3348 - Added and implemented "binary_ints" and "bits" options.
3349 - Added "std" option and implemented support for nonstandard models.
3350 - Added and implemented "finitize" option to improve the precision
3351 of infinite datatypes based on a monotonicity analysis.
3352 - Added support for quotient types.
3353 - Added support for "specification" and "ax_specification"
3355 - Added support for local definitions (for "function" and
3356 "termination" proofs).
3357 - Added support for term postprocessors.
3358 - Optimized "Multiset.multiset" and "FinFun.finfun".
3359 - Improved efficiency of "destroy_constrs" optimization.
3360 - Fixed soundness bugs related to "destroy_constrs" optimization and
3362 - Fixed soundness bug related to higher-order constructors.
3363 - Fixed soundness bug when "full_descrs" is enabled.
3364 - Improved precision of set constructs.
3365 - Added "atoms" option.
3366 - Added cache to speed up repeated Kodkod invocations on the same
3368 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3369 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3370 "SAT4J_Light". INCOMPATIBILITY.
3371 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3372 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3373 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3375 * Method "induct" now takes instantiations of the form t, where t is not
3376 a variable, as a shorthand for "x == t", where x is a fresh variable.
3377 If this is not intended, t has to be enclosed in parentheses.
3378 By default, the equalities generated by definitional instantiations
3379 are pre-simplified, which may cause parameters of inductive cases
3380 to disappear, or may even delete some of the inductive cases.
3381 Use "induct (no_simp)" instead of "induct" to restore the old
3382 behaviour. The (no_simp) option is also understood by the "cases"
3383 and "nominal_induct" methods, which now perform pre-simplification, too.
3389 * Variable names in lemmas generated by the domain package have
3390 changed; the naming scheme is now consistent with the HOL datatype
3391 package. Some proof scripts may be affected, INCOMPATIBILITY.
3393 * The domain package no longer defines the function "foo_copy" for
3394 recursive domain "foo". The reach lemma is now stated directly in
3395 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3396 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3398 * Most definedness lemmas generated by the domain package (previously
3399 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3400 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3401 Proofs that used definedness lemmas as intro rules may break,
3402 potential INCOMPATIBILITY.
3404 * Induction and casedist rules generated by the domain package now
3405 declare proper case_names (one called "bottom", and one named for each
3406 constructor). INCOMPATIBILITY.
3408 * For mutually-recursive domains, separate "reach" and "take_lemma"
3409 rules are generated for each domain, INCOMPATIBILITY.
3411 foo_bar.reach ~> foo.reach bar.reach
3412 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3414 * Some lemmas generated by the domain package have been renamed for
3415 consistency with the datatype package, INCOMPATIBILITY.
3417 foo.ind ~> foo.induct
3418 foo.finite_ind ~> foo.finite_induct
3419 foo.coind ~> foo.coinduct
3420 foo.casedist ~> foo.exhaust
3421 foo.exhaust ~> foo.nchotomy
3423 * For consistency with other definition packages, the fixrec package
3424 now generates qualified theorem names, INCOMPATIBILITY.
3426 foo_simps ~> foo.simps
3427 foo_unfold ~> foo.unfold
3428 foo_induct ~> foo.induct
3430 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3431 method and internal fixrec proofs now use the default simpset instead.
3434 * The "contlub" predicate has been removed. Proof scripts should use
3435 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3437 * The "admw" predicate has been removed, INCOMPATIBILITY.
3439 * The constants cpair, cfst, and csnd have been removed in favor of
3440 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3445 * Antiquotations for basic formal entities:
3447 @{class NAME} -- type class
3448 @{class_syntax NAME} -- syntax representation of the above
3450 @{type_name NAME} -- logical type
3451 @{type_abbrev NAME} -- type abbreviation
3452 @{nonterminal NAME} -- type of concrete syntactic category
3453 @{type_syntax NAME} -- syntax representation of any of the above
3455 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3456 @{const_abbrev NAME} -- abbreviated constant
3457 @{const_syntax NAME} -- syntax representation of any of the above
3459 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3460 syntax constant (cf. 'syntax' command).
3462 * Antiquotation @{make_string} inlines a function to print arbitrary
3463 values similar to the ML toplevel. The result is compiler dependent
3464 and may fall back on "?" in certain situations.
3466 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3467 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3468 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3469 not work with the asynchronous Isar document model.
3471 * Configuration options now admit dynamic default values, depending on
3472 the context or even global references.
3474 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3475 uses an efficient external library if available (for Poly/ML).
3477 * Renamed some important ML structures, while keeping the old names
3478 for some time as aliases within the structure Legacy:
3480 OuterKeyword ~> Keyword
3483 OuterSyntax ~> Outer_Syntax
3484 PrintMode ~> Print_Mode
3485 SpecParse ~> Parse_Spec
3488 ThyOutput ~> Thy_Output
3489 TypeInfer ~> Type_Infer
3491 Note that "open Legacy" simplifies porting of sources, but forgetting
3492 to remove it again will complicate porting again in the future.
3494 * Most operations that refer to a global context are named
3495 accordingly, e.g. Simplifier.global_context or
3496 ProofContext.init_global. There are some situations where a global
3497 context actually works, but under normal circumstances one needs to
3498 pass the proper local context through the code!
3500 * Discontinued old TheoryDataFun with its copy/init operation -- data
3501 needs to be pure. Functor Theory_Data_PP retains the traditional
3502 Pretty.pp argument to merge, which is absent in the standard
3503 Theory_Data version.
3505 * Sorts.certify_sort and derived "cert" operations for types and terms
3506 no longer minimize sorts. Thus certification at the boundary of the
3507 inference kernel becomes invariant under addition of class relations,
3508 which is an important monotonicity principle. Sorts are now minimized
3509 in the syntax layer only, at the boundary between the end-user and the
3510 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3511 explicitly in rare situations.
3513 * Renamed old-style Drule.standard to Drule.export_without_context, to
3514 emphasize that this is in no way a standard operation.
3517 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3518 usual for resolution. Rare INCOMPATIBILITY.
3520 * Renamed varify/unvarify operations to varify_global/unvarify_global
3521 to emphasize that these only work in a global situation (which is
3524 * Curried take and drop in library.ML; negative length is interpreted
3525 as infinity (as in chop). Subtle INCOMPATIBILITY.
3527 * Proof terms: type substitutions on proof constants now use canonical
3528 order of type variables. INCOMPATIBILITY for tools working with proof
3531 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3532 may no longer carry premises. User-level specifications are
3533 transformed accordingly by Thm.add_axiom/add_def.
3538 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3539 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3540 proof terms are enabled unconditionally in the new HOL-Proofs image.
3542 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3543 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3546 * Old lib/scripts/polyml-platform is superseded by the
3547 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3548 variant, even on a 64 bit machine. The following example setting
3549 prefers 64 bit if available:
3551 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3553 * The preliminary Isabelle/jEdit application demonstrates the emerging
3554 Isabelle/Scala layer for advanced prover interaction and integration.
3555 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3558 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3559 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3560 similar to the default assignment of the document preparation system
3561 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3562 provides some operations for direct access to the font without asking
3563 the user for manual installation.
3567 New in Isabelle2009-1 (December 2009)
3568 -------------------------------------
3572 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3573 one backslash should be used, even in ML sources.
3578 * Locale interpretation propagates mixins along the locale hierarchy.
3579 The currently only available mixins are the equations used to map
3580 local definitions to terms of the target domain of an interpretation.
3582 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3583 loc" to print all interpretations of locale "loc" in the theory.
3584 Interpretations in proofs are not shown.
3586 * Thoroughly revised locales tutorial. New section on conditional
3589 * On instantiation of classes, remaining undefined class parameters
3590 are formally declared. INCOMPATIBILITY.
3593 *** Document preparation ***
3595 * New generalized style concept for printing terms: @{foo (style) ...}
3596 instead of @{foo_style style ...} (old form is still retained for
3597 backward compatibility). Styles can be also applied for
3598 antiquotations prop, term_type and typeof.
3603 * New proof method "smt" for a combination of first-order logic with
3604 equality, linear and nonlinear (natural/integer/real) arithmetic, and
3605 fixed-size bitvectors; there is also basic support for higher-order
3606 features (esp. lambda abstractions). It is an incomplete decision
3607 procedure based on external SMT solvers using the oracle mechanism;
3608 for the SMT solver Z3, this method is proof-producing. Certificates
3609 are provided to avoid calling the external solvers solely for
3610 re-checking proofs. Due to a remote SMT service there is no need for
3611 installing SMT solvers locally. See src/HOL/SMT.
3613 * New commands to load and prove verification conditions generated by
3614 the Boogie program verifier or derived systems (e.g. the Verifying C
3615 Compiler (VCC) or Spec#). See src/HOL/Boogie.
3617 * New counterexample generator tool 'nitpick' based on the Kodkod
3618 relational model finder. See src/HOL/Tools/Nitpick and
3619 src/HOL/Nitpick_Examples.
3621 * New commands 'code_pred' and 'values' to invoke the predicate
3622 compiler and to enumerate values of inductive predicates.
3624 * A tabled implementation of the reflexive transitive closure.
3626 * New implementation of quickcheck uses generic code generator;
3627 default generators are provided for all suitable HOL types, records
3628 and datatypes. Old quickcheck can be re-activated importing theory
3629 Library/SML_Quickcheck.
3631 * New testing tool Mirabelle for automated proof tools. Applies
3632 several tools and tactics like sledgehammer, metis, or quickcheck, to
3633 every proof step in a theory. To be used in batch mode via the
3634 "mirabelle" utility.
3636 * New proof method "sos" (sum of squares) for nonlinear real
3637 arithmetic (originally due to John Harison). It requires theory
3638 Library/Sum_Of_Squares. It is not a complete decision procedure but
3639 works well in practice on quantifier-free real arithmetic with +, -,
3640 *, ^, =, <= and <, i.e. boolean combinations of equalities and
3641 inequalities between polynomials. It makes use of external
3642 semidefinite programming solvers. Method "sos" generates a
3643 certificate that can be pasted into the proof thus avoiding the need
3644 to call an external tool every time the proof is checked. See
3645 src/HOL/Library/Sum_Of_Squares.
3647 * New method "linarith" invokes existing linear arithmetic decision
3650 * New command 'atp_minimal' reduces result produced by Sledgehammer.
3652 * New Sledgehammer option "Full Types" in Proof General settings menu.
3653 Causes full type information to be output to the ATPs. This slows
3654 ATPs down considerably but eliminates a source of unsound "proofs"
3657 * New method "metisFT": A version of metis that uses full type
3658 information in order to avoid failures of proof reconstruction.
3660 * New evaluator "approximate" approximates an real valued term using
3661 the same method as the approximation method.
3663 * Method "approximate" now supports arithmetic expressions as
3664 boundaries of intervals and implements interval splitting and Taylor
3667 * ML antiquotation @{code_datatype} inserts definition of a datatype
3668 generated by the code generator; e.g. see src/HOL/Predicate.thy.
3670 * New theory SupInf of the supremum and infimum operators for sets of
3673 * New theory Probability, which contains a development of measure
3674 theory, eventually leading to Lebesgue integration and probability.
3676 * Extended Multivariate Analysis to include derivation and Brouwer's
3679 * Reorganization of number theory, INCOMPATIBILITY:
3680 - new number theory development for nat and int, in theories Divides
3681 and GCD as well as in new session Number_Theory
3682 - some constants and facts now suffixed with _nat and _int
3684 - former session NumberTheory now named Old_Number_Theory, including
3685 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
3686 - moved theory Pocklington from src/HOL/Library to
3687 src/HOL/Old_Number_Theory
3689 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
3690 lcm of finite and infinite sets. It is shown that they form a complete
3693 * Class semiring_div requires superclass no_zero_divisors and proof of
3694 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
3695 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
3696 generalized to class semiring_div, subsuming former theorems
3697 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
3698 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
3701 * Refinements to lattice classes and sets:
3702 - less default intro/elim rules in locale variant, more default
3703 intro/elim rules in class variant: more uniformity
3704 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
3706 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
3708 - renamed ACI to inf_sup_aci
3709 - new class "boolean_algebra"
3710 - class "complete_lattice" moved to separate theory
3711 "Complete_Lattice"; corresponding constants (and abbreviations)
3712 renamed and with authentic syntax:
3713 Set.Inf ~> Complete_Lattice.Inf
3714 Set.Sup ~> Complete_Lattice.Sup
3715 Set.INFI ~> Complete_Lattice.INFI
3716 Set.SUPR ~> Complete_Lattice.SUPR
3717 Set.Inter ~> Complete_Lattice.Inter
3718 Set.Union ~> Complete_Lattice.Union
3719 Set.INTER ~> Complete_Lattice.INTER
3720 Set.UNION ~> Complete_Lattice.UNION
3721 - authentic syntax for
3724 - mere abbreviations:
3727 Set.inter (for inf, formerly Set.Int)
3728 Set.union (for sup, formerly Set.Un)
3729 Complete_Lattice.Inter (for Inf)
3730 Complete_Lattice.Union (for Sup)
3731 Complete_Lattice.INTER (for INFI)
3732 Complete_Lattice.UNION (for SUPR)
3733 - object-logic definitions as far as appropriate
3735 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
3736 Un_subset_iff are explicitly deleted as default simp rules; then also
3737 their lattice counterparts le_inf_iff and le_sup_iff have to be
3738 deleted to achieve the desired effect.
3740 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
3741 rules by default any longer; the same applies to min_max.inf_absorb1
3742 etc. INCOMPATIBILITY.
3744 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
3745 pred_set_conv by default. INCOMPATIBILITY.
3747 * Power operations on relations and functions are now one dedicated
3748 constant "compow" with infix syntax "^^". Power operation on
3749 multiplicative monoids retains syntax "^" and is now defined generic
3750 in class power. INCOMPATIBILITY.
3752 * Relation composition "R O S" now has a more standard argument order:
3753 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
3754 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
3755 break, since the O_assoc rule was not rewritten like this. Fix using
3756 O_assoc[symmetric]. The same applies to the curried version "R OO S".
3758 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
3759 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
3762 * Most rules produced by inductive and datatype package have mandatory
3763 prefixes. INCOMPATIBILITY.
3765 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
3766 the attribute of the same name. Each of the theorems in the list
3767 DERIV_intros assumes composition with an additional function and
3768 matches a variable to the derivative, which has to be solved by the
3769 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
3770 of most elementary terms. Former Maclauren.DERIV_tac and
3771 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
3774 * Code generator attributes follow the usual underscore convention:
3775 code_unfold replaces code unfold
3776 code_post replaces code post
3781 sizechange -> size_change
3782 induct_scheme -> induction_schema
3785 * Discontinued abbreviation "arbitrary" of constant "undefined".
3786 INCOMPATIBILITY, use "undefined" directly.
3789 Suc_eq_add_numeral_1 -> Suc_eq_plus1
3790 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
3791 Suc_plus1 -> Suc_eq_plus1
3792 *anti_sym -> *antisym*
3793 vector_less_eq_def -> vector_le_def
3796 * Added theorem List.map_map as [simp]. Removed List.map_compose.
3799 * Removed predicate "M hassize n" (<--> card M = n & finite M).
3805 * Theory Representable defines a class "rep" of domains that are
3806 representable (via an ep-pair) in the universal domain type "udom".
3807 Instances are provided for all type constructors defined in HOLCF.
3809 * The 'new_domain' command is a purely definitional version of the
3810 domain package, for representable domains. Syntax is identical to the
3811 old domain package. The 'new_domain' package also supports indirect
3812 recursion using previously-defined type constructors. See
3813 src/HOLCF/ex/New_Domain.thy for examples.
3815 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
3816 on the left-hand side of an equation, and then performs
3817 simplification. Rewriting is done using rules declared with the
3818 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
3819 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
3821 * The pattern-match compiler in 'fixrec' can now handle constructors
3822 with HOL function types. Pattern-match combinators for the Pair
3823 constructor are pre-configured.
3825 * The 'fixrec' package now produces better fixed-point induction rules
3826 for mutually-recursive definitions: Induction rules have conclusions
3827 of the form "P foo bar" instead of "P <foo, bar>".
3829 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
3830 been renamed to "below". The name "below" now replaces "less" in many
3831 theorem names. (Legacy theorem names using "less" are still supported
3834 * The 'fixrec' package now supports "bottom patterns". Bottom
3835 patterns can be used to generate strictness rules, or to make
3836 functions more strict (much like the bang-patterns supported by the
3837 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
3843 * Support for Poly/ML 5.3.0, with improved reporting of compiler
3844 errors and run-time exceptions, including detailed source positions.
3846 * Structure Name_Space (formerly NameSpace) now manages uniquely
3847 identified entries, with some additional information such as source
3848 position, logical grouping etc.
3850 * Theory and context data is now introduced by the simplified and
3851 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
3852 to be pure, but the old TheoryDataFun for mutable data (with explicit
3853 copy operation) is still available for some time.
3855 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
3856 provides a high-level programming interface to synchronized state
3857 variables with atomic update. This works via pure function
3858 application within a critical section -- its runtime should be as
3859 short as possible; beware of deadlocks if critical code is nested,
3860 either directly or indirectly via other synchronized variables!
3862 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
3863 wraps raw ML references, explicitly indicating their non-thread-safe
3864 behaviour. The Isar toplevel keeps this structure open, to
3865 accommodate Proof General as well as quick and dirty interactive
3866 experiments with references.
3868 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
3869 parallel tactical reasoning.
3871 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
3872 are similar to SUBPROOF, but are slightly more flexible: only the
3873 specified parts of the subgoal are imported into the context, and the
3874 body tactic may introduce new subgoals and schematic variables.
3876 * Old tactical METAHYPS, which does not observe the proof context, has
3877 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
3878 or Subgoal.FOCUS etc.
3880 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
3881 functors have their own ML name space there is no point to mark them
3882 separately.) Minor INCOMPATIBILITY.
3884 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
3886 * Renamed several structures FooBar to Foo_Bar. Occasional,
3889 * Operations of structure Skip_Proof no longer require quick_and_dirty
3890 mode, which avoids critical setmp.
3892 * Eliminated old Attrib.add_attributes, Method.add_methods and related
3893 combinators for "args". INCOMPATIBILITY, need to use simplified
3894 Attrib/Method.setup introduced in Isabelle2009.
3896 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
3897 back on global_simpset_of, global_claset_of, global_clasimpset_of as
3898 last resort. INCOMPATIBILITY.
3900 * Display.pretty_thm now requires a proper context (cf. former
3901 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
3902 or even Display.pretty_thm_without_context as last resort.
3905 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
3906 Syntax.pretty_typ/term directly, preferably with proper context
3907 instead of global theory.
3912 * Further fine tuning of parallel proof checking, scales up to 8 cores
3913 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
3916 * Support for additional "Isabelle components" via etc/components, see
3917 also the system manual.
3919 * The isabelle makeall tool now operates on all components with
3920 IsaMakefile, not just hardwired "logics".
3922 * Removed "compress" option from isabelle-process and isabelle usedir;
3923 this is always enabled.
3925 * Discontinued support for Poly/ML 4.x versions.
3927 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
3928 on a given logic image. This requires the lighttpd webserver and is
3929 currently supported on Linux only.
3933 New in Isabelle2009 (April 2009)
3934 --------------------------------
3938 * Simplified main Isabelle executables, with less surprises on
3939 case-insensitive file-systems (such as Mac OS).
3941 - The main Isabelle tool wrapper is now called "isabelle" instead of
3944 - The former "isabelle" alias for "isabelle-process" has been
3945 removed (should rarely occur to regular users).
3947 - The former "isabelle-interface" and its alias "Isabelle" have been
3948 removed (interfaces are now regular Isabelle tools).
3950 Within scripts and make files, the Isabelle environment variables
3951 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
3952 respectively. (The latter are still available as legacy feature.)
3954 The old isabelle-interface wrapper could react in confusing ways if
3955 the interface was uninstalled or changed otherwise. Individual
3956 interface tool configuration is now more explicit, see also the
3957 Isabelle system manual. In particular, Proof General is now available
3958 via "isabelle emacs".
3960 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
3961 purge installed copies of Isabelle executables and re-run "isabelle
3962 install -p ...", or use symlinks.
3964 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
3965 old ~/isabelle, which was slightly non-standard and apt to cause
3966 surprises on case-insensitive file-systems (such as Mac OS).
3968 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
3969 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
3970 care is required when using older releases of Isabelle. Note that
3971 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
3972 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
3974 * Proofs of fully specified statements are run in parallel on
3975 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
3976 a regular 4-core machine, if the initial heap space is made reasonably
3977 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
3979 * The main reference manuals ("isar-ref", "implementation", and
3980 "system") have been updated and extended. Formally checked references
3981 as hyperlinks are now available uniformly.
3986 * Complete re-implementation of locales. INCOMPATIBILITY in several
3987 respects. The most important changes are listed below. See the
3988 Tutorial on Locales ("locales" manual) for details.
3990 - In locale expressions, instantiation replaces renaming. Parameters
3991 must be declared in a for clause. To aid compatibility with previous
3992 parameter inheritance, in locale declarations, parameters that are not
3993 'touched' (instantiation position "_" or omitted) are implicitly added
3994 with their syntax at the beginning of the for clause.
3996 - Syntax from abbreviations and definitions in locales is available in
3997 locale expressions and context elements. The latter is particularly
3998 useful in locale declarations.
4000 - More flexible mechanisms to qualify names generated by locale
4001 expressions. Qualifiers (prefixes) may be specified in locale
4002 expressions, and can be marked as mandatory (syntax: "name!:") or
4003 optional (syntax "name?:"). The default depends for plain "name:"
4004 depends on the situation where a locale expression is used: in
4005 commands 'locale' and 'sublocale' prefixes are optional, in
4006 'interpretation' and 'interpret' prefixes are mandatory. The old
4007 implicit qualifiers derived from the parameter names of a locale are
4008 no longer generated.
4010 - Command "sublocale l < e" replaces "interpretation l < e". The
4011 instantiation clause in "interpretation" and "interpret" (square
4012 brackets) is no longer available. Use locale expressions.
4014 - When converting proof scripts, mandatory qualifiers in
4015 'interpretation' and 'interpret' should be retained by default, even
4016 if this is an INCOMPATIBILITY compared to former behavior. In the
4017 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4018 in locale expressions range over a single locale instance only.
4020 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4021 In existing theorem specifications replace the includes element by the
4022 respective context elements of the included locale, omitting those
4023 that are already present in the theorem specification. Multiple
4024 assume elements of a locale should be replaced by a single one
4025 involving the locale predicate. In the proof body, declarations (most
4026 notably theorems) may be regained by interpreting the respective
4027 locales in the proof context as required (command "interpret").
4029 If using "includes" in replacement of a target solely because the
4030 parameter types in the theorem are not as general as in the target,
4031 consider declaring a new locale with additional type constraints on
4032 the parameters (context element "constrains").
4034 - Discontinued "locale (open)". INCOMPATIBILITY.
4036 - Locale interpretation commands no longer attempt to simplify goal.
4037 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4038 methods intro_locales and unfold_locales to clarify.
4040 - Locale interpretation commands no longer accept interpretation
4041 attributes. INCOMPATIBILITY.
4043 * Class declaration: so-called "base sort" must not be given in import
4044 list any longer, but is inferred from the specification. Particularly
4051 class foo = type + ...
4053 * Class target: global versions of theorems stemming do not carry a
4054 parameter prefix any longer. INCOMPATIBILITY.
4056 * Class 'instance' command no longer accepts attached definitions.
4057 INCOMPATIBILITY, use proper 'instantiation' target instead.
4059 * Recovered hiding of consts, which was accidentally broken in
4060 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4061 makes c inaccessible; consider using ``hide (open) const c'' instead.
4063 * Slightly more coherent Pure syntax, with updated documentation in
4064 isar-ref manual. Removed locales meta_term_syntax and
4065 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4066 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4067 directly in regular applications.
4069 * There is a new syntactic category "float_const" for signed decimal
4070 fractions (e.g. 123.45 or -123.45).
4072 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4073 interface with 'setup' command instead.
4075 * Command 'local_setup' is similar to 'setup', but operates on a local
4078 * The 'axiomatization' command now only works within a global theory
4079 context. INCOMPATIBILITY.
4081 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4082 hypotheses. Sorts required in the course of reasoning need to be
4083 covered by the constraints in the initial statement, completed by the
4084 type instance information of the background theory. Non-trivial sort
4085 hypotheses, which rarely occur in practice, may be specified via
4086 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4088 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4090 The result contains an implicit sort hypotheses as before --
4091 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4094 * Generalized Isar history, with support for linear undo, direct state
4097 * Changed defaults for unify configuration options:
4099 unify_trace_bound = 50 (formerly 25)
4100 unify_search_bound = 60 (formerly 30)
4102 * Different bookkeeping for code equations (INCOMPATIBILITY):
4104 a) On theory merge, the last set of code equations for a particular
4105 constant is taken (in accordance with the policy applied by other
4106 parts of the code generator framework).
4108 b) Code equations stemming from explicit declarations (e.g. code
4109 attribute) gain priority over default code equations stemming
4110 from definition, primrec, fun etc.
4112 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4114 * Unified theorem tables for both code generators. Thus [code
4115 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4117 * Command 'find_consts' searches for constants based on type and name
4120 find_consts "_ => bool"
4122 By default, matching is against subtypes, but it may be restricted to
4123 the whole type. Searching by name is possible. Multiple queries are
4124 conjunctive and queries may be negated by prefixing them with a
4127 find_consts strict: "_ => bool" name: "Int" -"int => int"
4129 * New 'find_theorems' criterion "solves" matches theorems that
4130 directly solve the current goal (modulo higher-order unification).
4132 * Auto solve feature for main theorem statements: whenever a new goal
4133 is stated, "find_theorems solves" is called; any theorems that could
4134 solve the lemma directly are listed as part of the goal state.
4135 Cf. associated options in Proof General Isabelle settings menu,
4136 enabled by default, with reasonable timeout for pathological cases of
4137 higher-order unification.
4140 *** Document preparation ***
4142 * Antiquotation @{lemma} now imitates a regular terminal proof,
4143 demanding keyword 'by' and supporting the full method expression
4144 syntax just like the Isar command 'by'.
4149 * Integrated main parts of former image HOL-Complex with HOL. Entry
4150 points Main and Complex_Main remain as before.
4152 * Logic image HOL-Plain provides a minimal HOL with the most important
4153 tools available (inductive, datatype, primrec, ...). This facilitates
4154 experimentation and tool development. Note that user applications
4155 (and library theories) should never refer to anything below theory
4158 * Logic image HOL-Main stops at theory Main, and thus facilitates
4159 experimentation due to shorter build times.
4161 * Logic image HOL-NSA contains theories of nonstandard analysis which
4162 were previously part of former HOL-Complex. Entry point Hyperreal
4163 remains valid, but theories formerly using Complex_Main should now use
4164 new entry point Hypercomplex.
4166 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4167 Posix processes. Avoids potentially expensive forking of the ML
4168 process. New thread-based implementation also works on non-Unix
4169 platforms (Cygwin). Provers are no longer hardwired, but defined
4170 within the theory via plain ML wrapper functions. Basic Sledgehammer
4171 commands are covered in the isar-ref manual.
4173 * Wrapper scripts for remote SystemOnTPTP service allows to use
4174 sledgehammer without local ATP installation (Vampire etc.). Other
4175 provers may be included via suitable ML wrappers, see also
4176 src/HOL/ATP_Linkup.thy.
4178 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4181 * The metis method no longer fails because the theorem is too trivial
4182 (contains the empty clause).
4184 * The metis method now fails in the usual manner, rather than raising
4185 an exception, if it determines that it cannot prove the theorem.
4187 * Method "coherent" implements a prover for coherent logic (see also
4188 src/Tools/coherent.ML).
4190 * Constants "undefined" and "default" replace "arbitrary". Usually
4191 "undefined" is the right choice to replace "arbitrary", though
4192 logically there is no difference. INCOMPATIBILITY.
4194 * Command "value" now integrates different evaluation mechanisms. The
4195 result of the first successful evaluation mechanism is printed. In
4196 square brackets a particular named evaluation mechanisms may be
4197 specified (currently, [SML], [code] or [nbe]). See further
4198 src/HOL/ex/Eval_Examples.thy.
4200 * Normalization by evaluation now allows non-leftlinear equations.
4201 Declare with attribute [code nbe].
4203 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4204 as the structured Isar versions "cases" and "induct", cf. the
4205 corresponding "cases" and "induct" attributes. Mutual induction rules
4206 are now presented as a list of individual projections
4207 (e.g. foo_bar.inducts for types foo and bar); the old format with
4208 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4209 rare situations a different rule is selected --- notably nested tuple
4210 elimination instead of former prod.exhaust: use explicit (case_tac t
4211 rule: prod.exhaust) here.
4213 * Attributes "cases", "induct", "coinduct" support "del" option.
4215 * Removed fact "case_split_thm", which duplicates "case_split".
4217 * The option datatype has been moved to a new theory Option. Renamed
4218 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4220 * New predicate "strict_mono" classifies strict functions on partial
4221 orders. With strict functions on linear orders, reasoning about
4222 (in)equalities is facilitated by theorems "strict_mono_eq",
4223 "strict_mono_less_eq" and "strict_mono_less".
4225 * Some set operations are now proper qualified constants with
4226 authentic syntax. INCOMPATIBILITY:
4237 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4240 * Auxiliary class "itself" has disappeared -- classes without any
4241 parameter are treated as expected by the 'class' command.
4243 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4245 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4246 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4248 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4249 method "approximation". It proves formulas on real values by using
4250 interval arithmetic. In the formulas are also the transcendental
4251 functions sin, cos, tan, atan, ln, exp and the constant pi are
4252 allowed. For examples see
4253 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4255 * Theory "Reflection" now resides in HOL/Library.
4257 * Entry point to Word library now simply named "Word".
4260 * Made source layout more coherent with logical distribution
4263 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4264 src/HOL/Library/Code_Message.thy ~> src/HOL/
4265 src/HOL/Library/GCD.thy ~> src/HOL/
4266 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4267 src/HOL/Library/Parity.thy ~> src/HOL/
4268 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4269 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4270 src/HOL/Real/Lubs.thy ~> src/HOL/
4271 src/HOL/Real/PReal.thy ~> src/HOL/
4272 src/HOL/Real/Rational.thy ~> src/HOL/
4273 src/HOL/Real/RComplete.thy ~> src/HOL/
4274 src/HOL/Real/RealDef.thy ~> src/HOL/
4275 src/HOL/Real/RealPow.thy ~> src/HOL/
4276 src/HOL/Real/Real.thy ~> src/HOL/
4277 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4278 src/HOL/Complex/Complex.thy ~> src/HOL/
4279 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4280 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4281 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4282 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4283 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4284 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4285 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4286 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4287 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4288 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4289 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4290 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4291 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4292 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4293 src/HOL/Real/Float ~> src/HOL/Library/
4294 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4295 src/HOL/Real/RealVector.thy ~> src/HOL/
4297 src/HOL/arith_data.ML ~> src/HOL/Tools
4298 src/HOL/hologic.ML ~> src/HOL/Tools
4299 src/HOL/simpdata.ML ~> src/HOL/Tools
4300 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4301 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4302 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4303 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4304 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4305 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4306 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4308 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4309 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4310 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4311 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4312 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4313 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4315 * If methods "eval" and "evaluation" encounter a structured proof
4316 state with !!/==>, only the conclusion is evaluated to True (if
4317 possible), avoiding strange error messages.
4319 * Method "sizechange" automates termination proofs using (a
4320 modification of) the size-change principle. Requires SAT solver. See
4321 src/HOL/ex/Termination.thy for examples.
4323 * Simplifier: simproc for let expressions now unfolds if bound
4324 variable occurs at most once in let expression body. INCOMPATIBILITY.
4326 * Method "arith": Linear arithmetic now ignores all inequalities when
4327 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4329 * New attribute "arith" for facts that should always be used
4330 automatically by arithmetic. It is intended to be used locally in
4333 assumes [arith]: "x > 0"
4335 Global usage is discouraged because of possible performance impact.
4337 * New classes "top" and "bot" with corresponding operations "top" and
4338 "bot" in theory Orderings; instantiation of class "complete_lattice"
4339 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4341 * Changed definition lemma "less_fun_def" in order to provide an
4342 instance for preorders on functions; use lemma "less_le" instead.
4345 * Theory Orderings: class "wellorder" moved here, with explicit
4346 induction rule "less_induct" as assumption. For instantiation of
4347 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4350 * Theory Orderings: added class "preorder" as superclass of "order".
4351 INCOMPATIBILITY: Instantiation proofs for order, linorder
4352 etc. slightly changed. Some theorems named order_class.* now named
4355 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4358 * Theory Finite_Set: added a new fold combinator of type
4360 ('a => 'b => 'b) => 'b => 'a set => 'b
4362 Occasionally this is more convenient than the old fold combinator
4363 which is now defined in terms of the new one and renamed to
4366 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4367 and "ring_simps" have been replaced by "algebra_simps" (which can be
4368 extended with further lemmas!). At the moment both still exist but
4369 the former will disappear at some point.
4371 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4372 class recpower. Type-specific simp rules for various recpower types
4373 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4375 rat_power_0 -> power_0
4376 rat_power_Suc -> power_Suc
4377 realpow_0 -> power_0
4378 realpow_Suc -> power_Suc
4379 complexpow_0 -> power_0
4380 complexpow_Suc -> power_Suc
4381 power_poly_0 -> power_0
4382 power_poly_Suc -> power_Suc
4384 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4385 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4386 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4387 of lemmas from Divides has been generalized from nat to class
4388 semiring_div. INCOMPATIBILITY. This involves the following theorem
4389 renames resulting from duplicate elimination:
4391 dvd_def_mod ~> dvd_eq_mod_eq_0
4392 zero_dvd_iff ~> dvd_0_left_iff
4393 dvd_0 ~> dvd_0_right
4394 DIVISION_BY_ZERO_DIV ~> div_by_0
4395 DIVISION_BY_ZERO_MOD ~> mod_by_0
4396 mult_div ~> div_mult_self2_is_id
4397 mult_mod ~> mod_mult_self2_is_0
4399 * Theory IntDiv: removed many lemmas that are instances of class-based
4400 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4401 rename old lemmas as follows:
4403 dvd_diff -> nat_dvd_diff
4404 dvd_zminus_iff -> dvd_minus_iff
4405 mod_add1_eq -> mod_add_eq
4406 mod_mult1_eq -> mod_mult_right_eq
4407 mod_mult1_eq' -> mod_mult_left_eq
4408 mod_mult_distrib_mod -> mod_mult_eq
4409 nat_mod_add_left_eq -> mod_add_left_eq
4410 nat_mod_add_right_eq -> mod_add_right_eq
4411 nat_mod_div_trivial -> mod_div_trivial
4412 nat_mod_mod_trivial -> mod_mod_trivial
4413 zdiv_zadd_self1 -> div_add_self1
4414 zdiv_zadd_self2 -> div_add_self2
4415 zdiv_zmult_self1 -> div_mult_self2_is_id
4416 zdiv_zmult_self2 -> div_mult_self1_is_id
4417 zdvd_triv_left -> dvd_triv_left
4418 zdvd_triv_right -> dvd_triv_right
4419 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4420 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4421 zmod_zadd_left_eq -> mod_add_left_eq
4422 zmod_zadd_right_eq -> mod_add_right_eq
4423 zmod_zadd_self1 -> mod_add_self1
4424 zmod_zadd_self2 -> mod_add_self2
4425 zmod_zadd1_eq -> mod_add_eq
4426 zmod_zdiff1_eq -> mod_diff_eq
4427 zmod_zdvd_zmod -> mod_mod_cancel
4428 zmod_zmod_cancel -> mod_mod_cancel
4429 zmod_zmult_self1 -> mod_mult_self2_is_0
4430 zmod_zmult_self2 -> mod_mult_self1_is_0
4433 zdvd_abs1 -> abs_dvd_iff
4434 zdvd_abs2 -> dvd_abs_iff
4435 zdvd_refl -> dvd_refl
4436 zdvd_trans -> dvd_trans
4437 zdvd_zadd -> dvd_add
4438 zdvd_zdiff -> dvd_diff
4439 zdvd_zminus_iff -> dvd_minus_iff
4440 zdvd_zminus2_iff -> minus_dvd_iff
4441 zdvd_zmultD -> dvd_mult_right
4442 zdvd_zmultD2 -> dvd_mult_left
4443 zdvd_zmult_mono -> mult_dvd_mono
4444 zdvd_0_right -> dvd_0_right
4445 zdvd_0_left -> dvd_0_left_iff
4446 zdvd_1_left -> one_dvd
4447 zminus_dvd_iff -> minus_dvd_iff
4449 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4451 * The real numbers offer decimal input syntax: 12.34 is translated
4452 into 1234/10^2. This translation is not reversed upon output.
4454 * Theory Library/Polynomial defines an abstract type 'a poly of
4455 univariate polynomials with coefficients of type 'a. In addition to
4456 the standard ring operations, it also supports div and mod. Code
4457 generation is also supported, using list-style constructors.
4459 * Theory Library/Inner_Product defines a class of real_inner for real
4460 inner product spaces, with an overloaded operation inner :: 'a => 'a
4461 => real. Class real_inner is a subclass of real_normed_vector from
4464 * Theory Library/Product_Vector provides instances for the product
4465 type 'a * 'b of several classes from RealVector and Inner_Product.
4466 Definitions of addition, subtraction, scalar multiplication, norms,
4467 and inner products are included.
4469 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4470 addition to the field operations, numerals and case syntax are also
4473 * Theory Library/Diagonalize provides constructive version of Cantor's
4474 first diagonalization argument.
4476 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4477 zlcm (for int); carried together from various gcd/lcm developements in
4478 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4479 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4480 may recover tupled syntax as follows:
4482 hide (open) const gcd
4483 abbreviation gcd where
4484 "gcd == (%(a, b). GCD.gcd a b)"
4486 GCD.gcd ("gcd '(_, _')")
4488 The same works for lcm, zgcd, zlcm.
4490 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4491 instantiations for algebraic structures. Removed some duplicate
4492 theorems. Changes in simp rules. INCOMPATIBILITY.
4494 * ML antiquotation @{code} takes a constant as argument and generates
4495 corresponding code in background and inserts name of the corresponding
4496 resulting ML value/function/datatype constructor binding in place.
4497 All occurrences of @{code} with a single ML block are generated
4498 simultaneously. Provides a generic and safe interface for
4499 instrumentalizing code generation. See
4500 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4501 In future you ought to refrain from ad-hoc compiling generated SML
4502 code on the ML toplevel. Note that (for technical reasons) @{code}
4503 cannot refer to constants for which user-defined serializations are
4504 set. Refer to the corresponding ML counterpart directly in that
4507 * Command 'rep_datatype': instead of theorem names the command now
4508 takes a list of terms denoting the constructors of the type to be
4509 represented as datatype. The characteristic theorems have to be
4510 proven. INCOMPATIBILITY. Also observe that the following theorems
4511 have disappeared in favour of existing ones:
4513 unit_induct ~> unit.induct
4514 prod_induct ~> prod.induct
4515 sum_induct ~> sum.induct
4516 Suc_Suc_eq ~> nat.inject
4517 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4522 * New locales for orders and lattices where the equivalence relation
4523 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4524 locales use a record structure with field eq for the equivalence.
4526 * New theory of factorial domains.
4528 * Units_l_inv and Units_r_inv are now simp rules by default.
4529 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4530 and/or r_inv will now also require deletion of these lemmas.
4532 * Renamed the following theorems, INCOMPATIBILITY:
4534 UpperD ~> Upper_memD
4535 LowerD ~> Lower_memD
4536 least_carrier ~> least_closed
4537 greatest_carrier ~> greatest_closed
4538 greatest_Lower_above ~> greatest_Lower_below
4539 one_zero ~> carrier_one_zero
4540 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4545 * Nominal datatypes can now contain type-variables.
4547 * Commands 'nominal_inductive' and 'equivariance' work with local
4550 * Nominal primrec can now works with local theory targets and its
4551 specification syntax now conforms to the general format as seen in
4554 * Method "perm_simp" honours the standard simplifier attributes
4555 (no_asm), (no_asm_use) etc.
4557 * The new predicate #* is defined like freshness, except that on the
4558 left hand side can be a set or list of atoms.
4560 * Experimental command 'nominal_inductive2' derives strong induction
4561 principles for inductive definitions. In contrast to
4562 'nominal_inductive', which can only deal with a fixed number of
4563 binders, it can deal with arbitrary expressions standing for sets of
4564 atoms to be avoided. The only inductive definition we have at the
4565 moment that needs this generalisation is the typing rule for Lets in
4568 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4569 -----------------------------------------------------------------
4570 Gamma |- Let x be t1 in t2 : T2
4572 In this rule one wants to avoid all the binders that are introduced by
4573 "close Gamma T1". We are looking for other examples where this
4574 feature might be useful. Please let us know.
4579 * Reimplemented the simplification procedure for proving continuity
4580 subgoals. The new simproc is extensible; users can declare additional
4581 continuity introduction rules with the attribute [cont2cont].
4583 * The continuity simproc now uses a different introduction rule for
4584 solving continuity subgoals on terms with lambda abstractions. In
4585 some rare cases the new simproc may fail to solve subgoals that the
4586 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4587 Potential INCOMPATIBILITY.
4589 * Command 'fixrec': specification syntax now conforms to the general
4590 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
4591 examples. INCOMPATIBILITY.
4596 * Proof of Zorn's Lemma for partial orders.
4601 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
4602 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
4603 depends on multithreading, so timouts will not work before Poly/ML
4606 * High-level support for concurrent ML programming, see
4607 src/Pure/Cuncurrent. The data-oriented model of "future values" is
4608 particularly convenient to organize independent functional
4609 computations. The concept of "synchronized variables" provides a
4610 higher-order interface for components with shared state, avoiding the
4611 delicate details of mutexes and condition variables. (Requires
4612 Poly/ML 5.2.1 or later.)
4614 * ML bindings produced via Isar commands are stored within the Isar
4615 context (theory or proof). Consequently, commands like 'use' and 'ML'
4616 become thread-safe and work with undo as expected (concerning
4617 top-level bindings, not side-effects on global references).
4618 INCOMPATIBILITY, need to provide proper Isar context when invoking the
4619 compiler at runtime; really global bindings need to be given outside a
4620 theory. (Requires Poly/ML 5.2 or later.)
4622 * Command 'ML_prf' is analogous to 'ML' but works within a proof
4623 context. Top-level ML bindings are stored within the proof context in
4624 a purely sequential fashion, disregarding the nested proof structure.
4625 ML bindings introduced by 'ML_prf' are discarded at the end of the
4626 proof. (Requires Poly/ML 5.2 or later.)
4628 * Simplified ML attribute and method setup, cf. functions Attrib.setup
4629 and Method.setup, as well as Isar commands 'attribute_setup' and
4630 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
4631 existing code accordingly, or use plain 'setup' together with old
4634 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
4635 to 'a -> thm, while results are always tagged with an authentic oracle
4636 name. The Isar command 'oracle' is now polymorphic, no argument type
4637 is specified. INCOMPATIBILITY, need to simplify existing oracle code
4638 accordingly. Note that extra performance may be gained by producing
4639 the cterm carefully, avoiding slow Thm.cterm_of.
4641 * Simplified interface for defining document antiquotations via
4642 ThyOutput.antiquotation, ThyOutput.output, and optionally
4643 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
4644 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
4647 * More systematic treatment of long names, abstract name bindings, and
4648 name space operations. Basic operations on qualified names have been
4649 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
4650 Long_Name.append. Old type bstring has been mostly replaced by
4651 abstract type binding (see structure Binding), which supports precise
4652 qualification by packages and local theory targets, as well as proper
4653 tracking of source positions. INCOMPATIBILITY, need to wrap old
4654 bstring values into Binding.name, or better pass through abstract
4655 bindings everywhere. See further src/Pure/General/long_name.ML,
4656 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
4658 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
4659 LocalTheory.note etc.) now refer to the *full* internal name, not the
4660 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
4662 * Disposed old type and term read functions (Sign.read_def_typ,
4663 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
4664 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
4665 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
4666 Syntax.read_term_global etc.; see also OldGoals.read_term as last
4667 resort for legacy applications.
4669 * Disposed old declarations, tactics, tactic combinators that refer to
4670 the simpset or claset of an implicit theory (such as Addsimps,
4671 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
4672 embedded ML text, or local_simpset_of with a proper context passed as
4673 explicit runtime argument.
4675 * Rules and tactics that read instantiations (read_instantiate,
4676 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
4677 context, which is required for parsing and type-checking. Moreover,
4678 the variables are specified as plain indexnames, not string encodings
4679 thereof. INCOMPATIBILITY.
4681 * Generic Toplevel.add_hook interface allows to analyze the result of
4682 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
4683 for theorem dependency output of transactions resulting in a new
4686 * ML antiquotations: block-structured compilation context indicated by
4687 \<lbrace> ... \<rbrace>; additional antiquotation forms:
4689 @{binding name} - basic name binding
4690 @{let ?pat = term} - term abbreviation (HO matching)
4691 @{note name = fact} - fact abbreviation
4692 @{thm fact} - singleton fact (with attributes)
4693 @{thms fact} - general fact (with attributes)
4694 @{lemma prop by method} - singleton goal
4695 @{lemma prop by meth1 meth2} - singleton goal
4696 @{lemma prop1 ... propN by method} - general goal
4697 @{lemma prop1 ... propN by meth1 meth2} - general goal
4698 @{lemma (open) ...} - open derivation
4703 * The Isabelle "emacs" tool provides a specific interface to invoke
4704 Proof General / Emacs, with more explicit failure if that is not
4705 installed (the old isabelle-interface script silently falls back on
4706 isabelle-process). The PROOFGENERAL_HOME setting determines the
4707 installation location of the Proof General distribution.
4709 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
4710 the Isabelle process into a JVM/Scala application. See
4711 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
4712 process wrapper has been discontinued.)
4714 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
4716 * Various status messages (with exact source position information) are
4717 emitted, if proper markup print mode is enabled. This allows
4718 user-interface components to provide detailed feedback on internal
4723 New in Isabelle2008 (June 2008)
4724 -------------------------------
4728 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
4729 and updated, with formally checked references as hyperlinks.
4731 * Theory loader: use_thy (and similar operations) no longer set the
4732 implicit ML context, which was occasionally hard to predict and in
4733 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
4734 provides a proper context already.
4736 * Theory loader: old-style ML proof scripts being *attached* to a thy
4737 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
4738 'use' within a theory file will do the job.
4740 * Name space merge now observes canonical order, i.e. the second space
4741 is inserted into the first one, while existing entries in the first
4742 space take precedence. INCOMPATIBILITY in rare situations, may try to
4743 swap theory imports.
4745 * Syntax: symbol \<chi> is now considered a letter. Potential
4746 INCOMPATIBILITY in identifier syntax etc.
4748 * Outer syntax: string tokens no longer admit escaped white space,
4749 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
4750 white space without escapes.
4752 * Outer syntax: string tokens may contain arbitrary character codes
4753 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
4759 * Context-dependent token translations. Default setup reverts locally
4760 fixed variables, and adds hilite markup for undeclared frees.
4762 * Unused theorems can be found using the new command 'unused_thms'.
4763 There are three ways of invoking it:
4766 Only finds unused theorems in the current theory.
4768 (2) unused_thms thy_1 ... thy_n -
4769 Finds unused theorems in the current theory and all of its ancestors,
4770 excluding the theories thy_1 ... thy_n and all of their ancestors.
4772 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
4773 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
4774 their ancestors, excluding the theories thy_1 ... thy_n and all of
4777 In order to increase the readability of the list produced by
4778 unused_thms, theorems that have been created by a particular instance
4779 of a theory command such as 'inductive' or 'function' are considered
4780 to belong to the same "group", meaning that if at least one theorem in
4781 this group is used, the other theorems in the same group are no longer
4782 reported as unused. Moreover, if all theorems in the group are
4783 unused, only one theorem in the group is displayed.
4785 Note that proof objects have to be switched on in order for
4786 unused_thms to work properly (i.e. !proofs must be >= 1, which is
4787 usually the case when using Proof General with the default settings).
4789 * Authentic naming of facts disallows ad-hoc overwriting of previous
4790 theorems within the same name space. INCOMPATIBILITY, need to remove
4791 duplicate fact bindings, or even accidental fact duplications. Note
4792 that tools may maintain dynamically scoped facts systematically, using
4793 PureThy.add_thms_dynamic.
4795 * Command 'hide' now allows to hide from "fact" name space as well.
4797 * Eliminated destructive theorem database, simpset, claset, and
4798 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
4799 update of theories within ML code.
4801 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
4802 INCOMPATIBILITY, object-logics depending on former Pure require
4803 additional setup PureThy.old_appl_syntax_setup; object-logics
4804 depending on former CPure need to refer to Pure.
4806 * Commands 'use' and 'ML' are now purely functional, operating on
4807 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
4808 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
4811 * Command 'setup': discontinued implicit version with ML reference.
4813 * Instantiation target allows for simultaneous specification of class
4814 instance operations together with an instantiation proof.
4815 Type-checking phase allows to refer to class operations uniformly.
4816 See src/HOL/Complex/Complex.thy for an Isar example and
4817 src/HOL/Library/Eval.thy for an ML example.
4819 * Indexing of literal facts: be more serious about including only
4820 facts from the visible specification/proof context, but not the
4821 background context (locale etc.). Affects `prop` notation and method
4822 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
4825 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
4826 "(open)" option, which used to expose internal bound variables to the
4829 * Isar statements: removed obsolete case "rule_context".
4830 INCOMPATIBILITY, better use explicit fixes/assumes.
4832 * Locale proofs: default proof step now includes 'unfold_locales';
4833 hence 'proof' without argument may be used to unfold locale
4837 *** Document preparation ***
4839 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
4840 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
4841 obsolete thumbpdf setup (contemporary PDF viewers do this on the
4842 spot); renamed link color from "darkblue" to "linkcolor" (default
4843 value unchanged, can be redefined via \definecolor); no longer sets
4844 "a4paper" option (unnecessary or even intrusive).
4846 * Antiquotation @{lemma A method} proves proposition A by the given
4847 method (either a method name or a method name plus (optional) method
4848 arguments in parentheses) and prints A just like @{prop A}.
4853 * New primrec package. Specification syntax conforms in style to
4854 definition/function/.... No separate induction rule is provided. The
4855 "primrec" command distinguishes old-style and new-style specifications
4856 by syntax. The former primrec package is now named OldPrimrecPackage.
4857 When adjusting theories, beware: constants stemming from new-style
4858 primrec specifications have authentic syntax.
4860 * Metis prover is now an order of magnitude faster, and also works
4861 with multithreading.
4863 * Metis: the maximum number of clauses that can be produced from a
4864 theorem is now given by the attribute max_clauses. Theorems that
4865 exceed this number are ignored, with a warning printed.
4867 * Sledgehammer no longer produces structured proofs by default. To
4868 enable, declare [[sledgehammer_full = true]]. Attributes
4869 reconstruction_modulus, reconstruction_sorts renamed
4870 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
4872 * Method "induct_scheme" derives user-specified induction rules
4873 from well-founded induction and completeness of patterns. This factors
4874 out some operations that are done internally by the function package
4875 and makes them available separately. See
4876 src/HOL/ex/Induction_Scheme.thy for examples.
4878 * More flexible generation of measure functions for termination
4879 proofs: Measure functions can be declared by proving a rule of the
4880 form "is_measure f" and giving it the [measure_function] attribute.
4881 The "is_measure" predicate is logically meaningless (always true), and
4882 just guides the heuristic. To find suitable measure functions, the
4883 termination prover sets up the goal "is_measure ?f" of the appropriate
4884 type and generates all solutions by prolog-style backwards proof using
4887 This setup also deals with rules like
4889 "is_measure f ==> is_measure (list_size f)"
4891 which accommodates nested datatypes that recurse through lists.
4892 Similar rules are predeclared for products and option types.
4894 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
4898 - Definitions of overloaded constants on sets have to be replaced by
4899 definitions on => and bool.
4901 - Some definitions of overloaded operators on sets can now be proved
4902 using the definitions of the operators on => and bool. Therefore,
4903 the following theorems have been renamed:
4905 subset_def -> subset_eq
4906 psubset_def -> psubset_eq
4907 set_diff_def -> set_diff_eq
4908 Compl_def -> Compl_eq
4909 Sup_set_def -> Sup_set_eq
4910 Inf_set_def -> Inf_set_eq
4911 sup_set_def -> sup_set_eq
4912 inf_set_def -> inf_set_eq
4914 - Due to the incompleteness of the HO unification algorithm, some
4915 rules such as subst may require manual instantiation, if some of
4916 the unknowns in the rule is a set.
4918 - Higher order unification and forward proofs:
4921 have "P (S::'a set)" <...>
4922 then have "EX S. P S" ..
4924 no longer works (due to the incompleteness of the HO unification
4925 algorithm) and must be replaced by the pattern
4932 - Calculational reasoning with subst (or similar rules):
4935 have "P (S::'a set)" <...>
4936 also have "S = T" <...>
4937 finally have "P T" .
4939 no longer works (for similar reasons as the previous example) and
4940 must be replaced by something like
4942 have "P (S::'a set)" <...>
4943 moreover have "S = T" <...>
4944 ultimately have "P T" by simp
4946 - Tactics or packages written in ML code:
4947 Code performing pattern matching on types via
4949 Type ("set", [T]) => ...
4951 must be rewritten. Moreover, functions like strip_type or
4952 binder_types no longer return the right value when applied to a
4955 T1 => ... => Tn => U => bool
4959 T1 => ... => Tn => U set
4961 * Merged theories Wellfounded_Recursion, Accessible_Part and
4962 Wellfounded_Relations to theory Wellfounded.
4964 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
4966 * Class finite no longer treats UNIV as class parameter. Use class
4967 enum from theory Library/Enum instead to achieve a similar effect.
4970 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
4971 and "Cons". INCOMPATIBILITY.
4973 * HOL (and FOL): renamed variables in rules imp_elim and swap.
4974 Potential INCOMPATIBILITY.
4976 * Theory Product_Type: duplicated lemmas split_Pair_apply and
4977 injective_fst_snd removed, use split_eta and prod_eqI instead.
4978 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
4980 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
4981 the same name in theory Orderings:
4991 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
4992 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
4993 and different variable names.
4995 * Library/Option_ord.thy: Canonical order on option type.
4997 * Library/RBT.thy: Red-black trees, an efficient implementation of
5000 * Library/Countable.thy: Type class for countable types.
5002 * Theory Int: The representation of numerals has changed. The infix
5003 operator BIT and the bit datatype with constructors B0 and B1 have
5004 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5005 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5006 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5009 * Theory Nat: definition of <= and < on natural numbers no longer
5010 depend on well-founded relations. INCOMPATIBILITY. Definitions
5011 le_def and less_def have disappeared. Consider lemmas not_less
5012 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5014 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5015 (whose purpose mainly is for various fold_set functionals) have been
5016 abandoned in favor of the existing algebraic classes
5017 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5018 lower_semilattice (resp. upper_semilattice) and linorder.
5021 * Theory Transitive_Closure: induct and cases rules now declare proper
5022 case_names ("base" and "step"). INCOMPATIBILITY.
5024 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5025 lattices. The form set-specific version is available as
5026 Inductive.lfp_ordinal_induct_set.
5028 * Renamed theorems "power.simps" to "power_int.simps".
5031 * Class semiring_div provides basic abstract properties of semirings
5032 with division and modulo operations. Subsumes former class dvd_mod.
5034 * Merged theories IntDef, Numeral and IntArith into unified theory
5035 Int. INCOMPATIBILITY.
5037 * Theory Library/Code_Index: type "index" now represents natural
5038 numbers rather than integers. INCOMPATIBILITY.
5040 * New class "uminus" with operation "uminus" (split of from class
5041 "minus" which now only has operation "minus", binary).
5044 * Constants "card", "internal_split", "option_map" now with authentic
5045 syntax. INCOMPATIBILITY.
5047 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5048 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5049 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5050 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5051 Sup_set_def, le_def, less_def, option_map_def now with object
5052 equality. INCOMPATIBILITY.
5054 * Records. Removed K_record, and replaced it by pure lambda term
5055 %x. c. The simplifier setup is now more robust against eta expansion.
5056 INCOMPATIBILITY: in cases explicitly referring to K_record.
5058 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5060 * Library/ListVector: new theory of arithmetic vector operations.
5062 * Library/Order_Relation: new theory of various orderings as sets of
5063 pairs. Defines preorders, partial orders, linear orders and
5064 well-orders on sets and on types.
5069 * Renamed some theories to allow to loading both ZF and HOL in the
5072 Datatype -> Datatype_ZF
5073 Inductive -> Inductive_ZF
5080 INCOMPATIBILITY: ZF theories that import individual theories below
5081 Main might need to be adapted. Regular theory Main is still
5082 available, as trivial extension of Main_ZF.
5087 * ML within Isar: antiquotation @{const name} or @{const
5088 name(typargs)} produces statically-checked Const term.
5090 * Functor NamedThmsFun: data is available to the user as dynamic fact
5091 (of the same name). Removed obsolete print command.
5093 * Removed obsolete "use_legacy_bindings" function.
5095 * The ``print mode'' is now a thread-local value derived from a global
5096 template (the former print_mode reference), thus access becomes
5097 non-critical. The global print_mode reference is for session
5098 management only; user-code should use print_mode_value,
5099 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5101 * Functions system/system_out provide a robust way to invoke external
5102 shell commands, with propagation of interrupts (requires Poly/ML
5103 5.2.1). Do not use OS.Process.system etc. from the basis library!
5108 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5109 in accordance with Proof General 3.7, which prefers GNU emacs.
5111 * isatool tty runs Isabelle process with plain tty interaction;
5112 optional line editor may be specified via ISABELLE_LINE_EDITOR
5113 setting, the default settings attempt to locate "ledit" and "rlwrap".
5115 * isatool browser now works with Cygwin as well, using general
5116 "javapath" function defined in Isabelle process environment.
5118 * YXML notation provides a simple and efficient alternative to
5119 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5120 isatool yxml as described in the Isabelle system manual.
5122 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5123 provides general wrapper for managing an Isabelle process in a robust
5124 fashion, with ``cooked'' output from stdin/stderr.
5126 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5127 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5129 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5130 way of changing the user's settings is via
5131 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5134 * Multithreading.max_threads := 0 refers to the number of actual CPU
5135 cores of the underlying machine, which is a good starting point for
5136 optimal performance tuning. The corresponding usedir option -M allows
5137 "max" as an alias for "0". WARNING: does not work on certain versions
5138 of Mac OS (with Poly/ML 5.1).
5140 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5141 adverse effect of Isabelle flooding interactive front-ends (notably
5142 ProofGeneral / XEmacs).
5146 New in Isabelle2007 (November 2007)
5147 -----------------------------------
5151 * More uniform information about legacy features, notably a
5152 warning/error of "Legacy feature: ...", depending on the state of the
5153 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5154 legacy features will disappear eventually.
5156 * Theory syntax: the header format ``theory A = B + C:'' has been
5157 discontinued in favour of ``theory A imports B C begin''. Use isatool
5158 fixheaders to convert existing theory files. INCOMPATIBILITY.
5160 * Theory syntax: the old non-Isar theory file format has been
5161 discontinued altogether. Note that ML proof scripts may still be used
5162 with Isar theories; migration is usually quite simple with the ML
5163 function use_legacy_bindings. INCOMPATIBILITY.
5165 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5166 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5169 * Theory loader: be more serious about observing the static theory
5170 header specifications (including optional directories), but not the
5171 accidental file locations of previously successful loads. The strict
5172 update policy of former update_thy is now already performed by
5173 use_thy, so the former has been removed; use_thys updates several
5174 theories simultaneously, just as 'imports' within a theory header
5175 specification, but without merging the results. Potential
5176 INCOMPATIBILITY: may need to refine theory headers and commands
5177 ROOT.ML which depend on load order.
5179 * Theory loader: optional support for content-based file
5180 identification, instead of the traditional scheme of full physical
5181 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5182 (cf. the system manual). The new scheme allows to work with
5183 non-finished theories in persistent session images, such that source
5184 files may be moved later on without requiring reloads.
5186 * Theory loader: old-style ML proof scripts being *attached* to a thy
5187 file (with the same base name as the theory) are considered a legacy
5188 feature, which will disappear eventually. Even now, the theory loader
5189 no longer maintains dependencies on such files.
5191 * Syntax: the scope for resolving ambiguities via type-inference is
5192 now limited to individual terms, instead of whole simultaneous
5193 specifications as before. This greatly reduces the complexity of the
5194 syntax module and improves flexibility by separating parsing and
5195 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5196 'fixes' etc.) are required in rare situations.
5198 * Syntax: constants introduced by new-style packages ('definition',
5199 'abbreviation' etc.) are passed through the syntax module in
5200 ``authentic mode''. This means that associated mixfix annotations
5201 really stick to such constants, independently of potential name space
5202 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5203 trees are represented slightly differently, may need to adapt syntax
5204 translations accordingly. Use CONST marker in 'translations' and
5205 @{const_syntax} antiquotation in 'parse_translation' etc.
5207 * Legacy goal package: reduced interface to the bare minimum required
5208 to keep existing proof scripts running. Most other user-level
5209 functions are now part of the OldGoals structure, which is *not* open
5210 by default (consider isatool expandshort before open OldGoals).
5211 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5212 these tend to cause confusion about the actual goal (!) context being
5213 used here, which is not necessarily the same as the_context().
5215 * Command 'find_theorems': supports "*" wild-card in "name:"
5216 criterion; "with_dups" option. Certain ProofGeneral versions might
5217 support a specific search form (see ProofGeneral/CHANGES).
5219 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5220 by default, which means that "prems" (and also "fixed variables") are
5221 suppressed from proof state output. Note that the ProofGeneral
5222 settings mechanism allows to change and save options persistently, but
5223 older versions of Isabelle will fail to start up if a negative prems
5226 * Local theory targets may be specified by non-nested blocks of
5227 ``context/locale/class ... begin'' followed by ``end''. The body may
5228 contain definitions, theorems etc., including any derived mechanism
5229 that has been implemented on top of these primitives. This concept
5230 generalizes the existing ``theorem (in ...)'' towards more versatility
5233 * Proof General interface: proper undo of final 'end' command;
5234 discontinued Isabelle/classic mode (ML proof scripts).
5237 *** Document preparation ***
5239 * Added antiquotation @{theory name} which prints the given name,
5240 after checking that it refers to a valid ancestor theory in the
5243 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5244 check the given source text as ML type/structure, printing verbatim.
5246 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5247 "c args == rhs" given in the current context. (Any number of
5248 arguments may be given on the LHS.)
5253 * The 'class' package offers a combination of axclass and locale to
5254 achieve Haskell-like type classes in Isabelle. Definitions and
5255 theorems within a class context produce both relative results (with
5256 implicit parameters according to the locale context), and polymorphic
5257 constants with qualified polymorphism (according to the class
5258 context). Within the body context of a 'class' target, a separate
5259 syntax layer ("user space type system") takes care of converting
5260 between global polymorphic consts and internal locale representation.
5261 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5262 "isatool doc classes" provides a tutorial.
5264 * Generic code generator framework allows to generate executable
5265 code for ML and Haskell (including Isabelle classes). A short usage
5268 internal compilation:
5269 export_code <list of constants (term syntax)> in SML
5270 writing SML code to a file:
5271 export_code <list of constants (term syntax)> in SML <filename>
5272 writing OCaml code to a file:
5273 export_code <list of constants (term syntax)> in OCaml <filename>
5274 writing Haskell code to a bunch of files:
5275 export_code <list of constants (term syntax)> in Haskell <filename>
5277 evaluating closed propositions to True/False using code generation:
5280 Reasonable default setup of framework in HOL.
5282 Theorem attributs for selecting and transforming function equations theorems:
5284 [code fun]: select a theorem as function equation for a specific constant
5285 [code fun del]: deselect a theorem as function equation for a specific constant
5286 [code inline]: select an equation theorem for unfolding (inlining) in place
5287 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5289 User-defined serializations (target in {SML, OCaml, Haskell}):
5291 code_const <and-list of constants (term syntax)>
5292 {(target) <and-list of const target syntax>}+
5294 code_type <and-list of type constructors>
5295 {(target) <and-list of type target syntax>}+
5297 code_instance <and-list of instances>
5299 where instance ::= <type constructor> :: <class>
5301 code_class <and_list of classes>
5302 {(target) <and-list of class target syntax>}+
5303 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5305 code_instance and code_class only are effective to target Haskell.
5307 For example usage see src/HOL/ex/Codegenerator.thy and
5308 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5309 generation from Isabelle/HOL theories is available via "isatool doc
5312 * Code generator: consts in 'consts_code' Isar commands are now
5313 referred to by usual term syntax (including optional type
5316 * Command 'no_translations' removes translation rules from theory
5319 * Overloaded definitions are now actually checked for acyclic
5320 dependencies. The overloading scheme is slightly more general than
5321 that of Haskell98, although Isabelle does not demand an exact
5322 correspondence to type class and instance declarations.
5323 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5324 exotic versions of overloading -- at the discretion of the user!
5326 Polymorphic constants are represented via type arguments, i.e. the
5327 instantiation that matches an instance against the most general
5328 declaration given in the signature. For example, with the declaration
5329 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5330 as c(nat). Overloading is essentially simultaneous structural
5331 recursion over such type arguments. Incomplete specification patterns
5332 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5333 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5334 Command 'print_theory' outputs the normalized system of recursive
5335 equations, see section "definitions".
5337 * Configuration options are maintained within the theory or proof
5338 context (with name and type bool/int/string), providing a very simple
5339 interface to a poor-man's version of general context data. Tools may
5340 declare options in ML (e.g. using Attrib.config_int) and then refer to
5341 these values using Config.get etc. Users may change options via an
5342 associated attribute of the same name. This form of context
5343 declaration works particularly well with commands 'declare' or
5344 'using', for example ``declare [[foo = 42]]''. Thus it has become
5345 very easy to avoid global references, which would not observe Isar
5346 toplevel undo/redo and fail to work with multithreading.
5348 Various global ML references of Pure and HOL have been turned into
5349 configuration options:
5351 Unify.search_bound unify_search_bound
5352 Unify.trace_bound unify_trace_bound
5353 Unify.trace_simp unify_trace_simp
5354 Unify.trace_types unify_trace_types
5355 Simplifier.simp_depth_limit simp_depth_limit
5356 Blast.depth_limit blast_depth_limit
5357 DatatypeProp.dtK datatype_distinctness_limit
5358 fast_arith_neq_limit fast_arith_neq_limit
5359 fast_arith_split_limit fast_arith_split_limit
5361 * Named collections of theorems may be easily installed as context
5362 data using the functor NamedThmsFun (see also
5363 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5364 attributes; there is also a toplevel print command. This facility is
5365 just a common case of general context data, which is the preferred way
5366 for anything more complex than just a list of facts in canonical
5369 * Isar: command 'declaration' augments a local theory by generic
5370 declaration functions written in ML. This enables arbitrary content
5371 being added to the context, depending on a morphism that tells the
5372 difference of the original declaration context wrt. the application
5373 context encountered later on.
5375 * Isar: proper interfaces for simplification procedures. Command
5376 'simproc_setup' declares named simprocs (with match patterns, and body
5377 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5378 context. ML antiquotation @{simproc name} retrieves named simprocs.
5380 * Isar: an extra pair of brackets around attribute declarations
5381 abbreviates a theorem reference involving an internal dummy fact,
5382 which will be ignored later --- only the effect of the attribute on
5383 the background context will persist. This form of in-place
5384 declarations is particularly useful with commands like 'declare' and
5385 'using', for example ``have A using [[simproc a]] by simp''.
5387 * Isar: method "assumption" (and implicit closing of subproofs) now
5388 takes simple non-atomic goal assumptions into account: after applying
5389 an assumption as a rule the resulting subgoals are solved by atomic
5390 assumption steps. This is particularly useful to finish 'obtain'
5391 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5392 without referring to the original premise "!!x. P x ==> thesis" in the
5393 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5396 * Isar: implicit use of prems from the Isar proof context is
5397 considered a legacy feature. Common applications like ``have A .''
5398 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5399 referencing facts explicitly here improves readability and
5400 maintainability of proof texts.
5402 * Isar: improper proof element 'guess' is like 'obtain', but derives
5403 the obtained context from the course of reasoning! For example:
5405 assume "EX x y. A x & B y" -- "any previous fact"
5406 then guess x and y by clarify
5408 This technique is potentially adventurous, depending on the facts and
5409 proof tools being involved here.
5411 * Isar: known facts from the proof context may be specified as literal
5412 propositions, using ASCII back-quote syntax. This works wherever
5413 named facts used to be allowed so far, in proof commands, proof
5414 methods, attributes etc. Literal facts are retrieved from the context
5415 according to unification of type and term parameters. For example,
5416 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5417 theorems in the current context, then these are valid literal facts:
5418 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5420 There is also a proof method "fact" which does the same composition
5421 for explicit goal states, e.g. the following proof texts coincide with
5422 certain special cases of literal facts:
5424 have "A" by fact == note `A`
5425 have "A ==> B" by fact == note `A ==> B`
5426 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5427 have "P a ==> Q a" by fact == note `P a ==> Q a`
5429 * Isar: ":" (colon) is no longer a symbolic identifier character in
5430 outer syntax. Thus symbolic identifiers may be used without
5431 additional white space in declarations like this: ``assume *: A''.
5433 * Isar: 'print_facts' prints all local facts of the current context,
5434 both named and unnamed ones.
5436 * Isar: 'def' now admits simultaneous definitions, e.g.:
5438 def x == "t" and y == "u"
5440 * Isar: added command 'unfolding', which is structurally similar to
5441 'using', but affects both the goal state and facts by unfolding given
5442 rewrite rules. Thus many occurrences of the 'unfold' method or
5443 'unfolded' attribute may be replaced by first-class proof text.
5445 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5446 and command 'unfolding' now all support object-level equalities
5447 (potentially conditional). The underlying notion of rewrite rule is
5448 analogous to the 'rule_format' attribute, but *not* that of the
5449 Simplifier (which is usually more generous).
5451 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5452 premises of a theorem by n. Useful in conjunction with drule.
5454 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5455 method expression within a sandbox consisting of the first N
5456 sub-goals, which need to exist. For example, ``simp_all [3]''
5457 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5458 simplifies all new goals that emerge from applying rule foo to the
5459 originally first one.
5461 * Isar: schematic goals are no longer restricted to higher-order
5462 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5465 * Isar: the conclusion of a long theorem statement is now either
5466 'shows' (a simultaneous conjunction, as before), or 'obtains'
5467 (essentially a disjunction of cases with local parameters and
5468 assumptions). The latter allows to express general elimination rules
5469 adequately; in this notation common elimination rules look like this:
5471 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5473 obtains x where "P x"
5475 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5479 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5485 The subsequent classical rules even refer to the formal "thesis"
5488 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5491 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5492 obtains "thesis ==> something"
5494 The actual proof of an 'obtains' statement is analogous to that of the
5495 Isar proof element 'obtain', only that there may be several cases.
5496 Optional case names may be specified in parentheses; these will be
5497 available both in the present proof and as annotations in the
5498 resulting rule, for later use with the 'cases' method (cf. attribute
5501 * Isar: the assumptions of a long theorem statement are available as
5502 "assms" fact in the proof context. This is more appropriate than the
5503 (historical) "prems", which refers to all assumptions of the current
5504 context, including those from the target locale, proof body etc.
5506 * Isar: 'print_statement' prints theorems from the current theory or
5507 proof context in long statement form, according to the syntax of a
5510 * Isar: 'obtain' takes an optional case name for the local context
5511 introduction rule (default "that").
5513 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5514 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5517 * Pure: syntax "CONST name" produces a fully internalized constant
5518 according to the current context. This is particularly useful for
5519 syntax translations that should refer to internal constant
5520 representations independently of name spaces.
5522 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5523 instead of "FOO ". This allows multiple binder declarations to coexist
5524 in the same context. INCOMPATIBILITY.
5526 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5527 primitive that also works in a locale context (both for constants and
5528 fixed variables). Type declaration and internal syntactic representation
5529 of given constants retrieved from the context. Likewise, the
5530 'no_notation' command allows to remove given syntax annotations from the
5533 * Isar/locales: new derived specification elements 'axiomatization',
5534 'definition', 'abbreviation', which support type-inference, admit
5535 object-level specifications (equality, equivalence). See also the
5536 isar-ref manual. Examples:
5539 eq (infix "===" 50) where
5540 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5542 definition "f x y = x + y + 1"
5543 definition g where "g x = f x x"
5546 neq (infix "=!=" 50) where
5547 "x =!= y == ~ (x === y)"
5549 These specifications may be also used in a locale context. Then the
5550 constants being introduced depend on certain fixed parameters, and the
5551 constant name is qualified by the locale base name. An internal
5552 abbreviation takes care for convenient input and output, making the
5553 parameters implicit and using the original short name. See also
5554 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5555 entities from a monomorphic theory.
5557 Presently, abbreviations are only available 'in' a target locale, but
5558 not inherited by general import expressions. Also note that
5559 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5560 'translations' in common applications. The "no_abbrevs" print mode
5561 prevents folding of abbreviations in term output.
5563 Concrete syntax is attached to specified constants in internal form,
5564 independently of name spaces. The parse tree representation is
5565 slightly different -- use 'notation' instead of raw 'syntax', and
5566 'translations' with explicit "CONST" markup to accommodate this.
5568 * Pure/Isar: unified syntax for new-style specification mechanisms
5569 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5570 full type inference and dummy patterns ("_"). For example:
5572 definition "K x _ = x"
5574 inductive conj for A B
5575 where "A ==> B ==> conj A B"
5577 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5578 the current context. Print mode "no_abbrevs" prevents inversion of
5579 abbreviations on output.
5581 * Isar/locales: improved parameter handling: use of locales "var" and
5582 "struct" no longer necessary; - parameter renamings are no longer
5583 required to be injective. For example, this allows to define
5584 endomorphisms as locale endom = homom mult mult h.
5586 * Isar/locales: changed the way locales with predicates are defined.
5587 Instead of accumulating the specification, the imported expression is
5588 now an interpretation. INCOMPATIBILITY: different normal form of
5589 locale expressions. In particular, in interpretations of locales with
5590 predicates, goals repesenting already interpreted fragments are not
5591 removed automatically. Use methods `intro_locales' and
5592 `unfold_locales'; see below.
5594 * Isar/locales: new methods `intro_locales' and `unfold_locales'
5595 provide backward reasoning on locales predicates. The methods are
5596 aware of interpretations and discharge corresponding goals.
5597 `intro_locales' is less aggressive then `unfold_locales' and does not
5598 unfold predicates to assumptions.
5600 * Isar/locales: the order in which locale fragments are accumulated
5601 has changed. This enables to override declarations from fragments due
5602 to interpretations -- for example, unwanted simp rules.
5604 * Isar/locales: interpretation in theories and proof contexts has been
5605 extended. One may now specify (and prove) equations, which are
5606 unfolded in interpreted theorems. This is useful for replacing
5607 defined concepts (constants depending on locale parameters) by
5608 concepts already existing in the target context. Example:
5610 interpretation partial_order ["op <= :: [int, int] => bool"]
5611 where "partial_order.less (op <=) (x::int) y = (x < y)"
5613 Typically, the constant `partial_order.less' is created by a
5614 definition specification element in the context of locale
5617 * Method "induct": improved internal context management to support
5618 local fixes and defines on-the-fly. Thus explicit meta-level
5619 connectives !! and ==> are rarely required anymore in inductive goals
5620 (using object-logic connectives for this purpose has been long
5621 obsolete anyway). Common proof patterns are explained in
5622 src/HOL/Induct/Common_Patterns.thy, see also
5623 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
5626 * Method "induct": improved handling of simultaneous goals. Instead of
5627 introducing object-level conjunction, the statement is now split into
5628 several conclusions, while the corresponding symbolic cases are nested
5629 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
5630 see src/HOL/Induct/Common_Patterns.thy, for example.
5632 * Method "induct": mutual induction rules are now specified as a list
5633 of rule sharing the same induction cases. HOL packages usually provide
5634 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
5635 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
5636 mutual induction rules differently, i.e. like this:
5638 (induct rule: foo_bar.inducts)
5639 (induct set: foo bar)
5640 (induct pred: foo bar)
5641 (induct type: foo bar)
5643 The ML function ProjectRule.projections turns old-style rules into the
5646 * Method "coinduct": dual of induction, see
5647 src/HOL/Library/Coinductive_List.thy for various examples.
5649 * Method "cases", "induct", "coinduct": the ``(open)'' option is
5650 considered a legacy feature.
5652 * Attribute "symmetric" produces result with standardized schematic
5653 variables (index 0). Potential INCOMPATIBILITY.
5655 * Simplifier: by default the simplifier trace only shows top level
5656 rewrites now. That is, trace_simp_depth_limit is set to 1 by
5657 default. Thus there is less danger of being flooded by the trace. The
5658 trace indicates where parts have been suppressed.
5660 * Provers/classical: removed obsolete classical version of elim_format
5661 attribute; classical elim/dest rules are now treated uniformly when
5662 manipulating the claset.
5664 * Provers/classical: stricter checks to ensure that supplied intro,
5665 dest and elim rules are well-formed; dest and elim rules must have at
5668 * Provers/classical: attributes dest/elim/intro take an optional
5669 weight argument for the rule (just as the Pure versions). Weights are
5670 ignored by automated tools, but determine the search order of single
5673 * Syntax: input syntax now supports dummy variable binding "%_. b",
5674 where the body does not mention the bound variable. Note that dummy
5675 patterns implicitly depend on their context of bounds, which makes
5676 "{_. _}" match any set comprehension as expected. Potential
5677 INCOMPATIBILITY -- parse translations need to cope with syntactic
5678 constant "_idtdummy" in the binding position.
5680 * Syntax: removed obsolete syntactic constant "_K" and its associated
5681 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
5682 for example "A -> B" => "Pi A (%_. B)".
5684 * Pure: 'class_deps' command visualizes the subclass relation, using
5685 the graph browser tool.
5687 * Pure: 'print_theory' now suppresses certain internal declarations by
5688 default; use '!' option for full details.
5693 * Method "metis" proves goals by applying the Metis general-purpose
5694 resolution prover (see also http://gilith.com/software/metis/).
5695 Examples are in the directory MetisExamples. WARNING: the
5696 Isabelle/HOL-Metis integration does not yet work properly with
5699 * Command 'sledgehammer' invokes external automatic theorem provers as
5700 background processes. It generates calls to the "metis" method if
5701 successful. These can be pasted into the proof. Users do not have to
5702 wait for the automatic provers to return. WARNING: does not really
5703 work with multi-threading.
5705 * New "auto_quickcheck" feature tests outermost goal statements for
5706 potential counter-examples. Controlled by ML references
5707 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
5708 5000 milliseconds). Fails silently if statements is outside of
5709 executable fragment, or any other codgenerator problem occurs.
5711 * New constant "undefined" with axiom "undefined x = undefined".
5713 * Added class "HOL.eq", allowing for code generation with polymorphic
5716 * Some renaming of class constants due to canonical name prefixing in
5717 the new 'class' package:
5719 HOL.abs ~> HOL.abs_class.abs
5720 HOL.divide ~> HOL.divide_class.divide
5721 0 ~> HOL.zero_class.zero
5722 1 ~> HOL.one_class.one
5723 op + ~> HOL.plus_class.plus
5724 op - ~> HOL.minus_class.minus
5725 uminus ~> HOL.minus_class.uminus
5726 op * ~> HOL.times_class.times
5727 op < ~> HOL.ord_class.less
5728 op <= > HOL.ord_class.less_eq
5729 Nat.power ~> Power.power_class.power
5730 Nat.size ~> Nat.size_class.size
5731 Numeral.number_of ~> Numeral.number_class.number_of
5732 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
5733 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
5734 Orderings.min ~> Orderings.ord_class.min
5735 Orderings.max ~> Orderings.ord_class.max
5736 Divides.op div ~> Divides.div_class.div
5737 Divides.op mod ~> Divides.div_class.mod
5738 Divides.op dvd ~> Divides.div_class.dvd
5740 INCOMPATIBILITY. Adaptions may be required in the following cases:
5742 a) User-defined constants using any of the names "plus", "minus",
5743 "times", "less" or "less_eq". The standard syntax translations for
5744 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
5747 b) Variables named "plus", "minus", "times", "less", "less_eq"
5748 INCOMPATIBILITY: use more specific names.
5750 c) Permutative equations (e.g. "a + b = b + a")
5751 Since the change of names also changes the order of terms, permutative
5752 rewrite rules may get applied in a different order. Experience shows
5753 that this is rarely the case (only two adaptions in the whole Isabelle
5754 distribution). INCOMPATIBILITY: rewrite proofs
5756 d) ML code directly refering to constant names
5757 This in general only affects hand-written proof tactics, simprocs and
5758 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
5759 Consider using @{const_name} antiquotation.
5761 * New class "default" with associated constant "default".
5763 * Function "sgn" is now overloaded and available on int, real, complex
5764 (and other numeric types), using class "sgn". Two possible defs of
5765 sgn are given as equational assumptions in the classes sgn_if and
5766 sgn_div_norm; ordered_idom now also inherits from sgn_if.
5769 * Locale "partial_order" now unified with class "order" (cf. theory
5770 Orderings), added parameter "less". INCOMPATIBILITY.
5772 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
5773 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
5774 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
5776 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
5777 changed order of proof goals in instance proofs.
5779 * The transitivity reasoner for partial and linear orders is set up
5780 for classes "order" and "linorder". Instances of the reasoner are available
5781 in all contexts importing or interpreting the corresponding locales.
5782 Method "order" invokes the reasoner separately; the reasoner
5783 is also integrated with the Simplifier as a solver. Diagnostic
5784 command 'print_orders' shows the available instances of the reasoner
5785 in the current context.
5787 * Localized monotonicity predicate in theory "Orderings"; integrated
5788 lemmas max_of_mono and min_of_mono with this predicate.
5791 * Formulation of theorem "dense" changed slightly due to integration
5792 with new class dense_linear_order.
5794 * Uniform lattice theory development in HOL.
5796 constants "meet" and "join" now named "inf" and "sup"
5797 constant "Meet" now named "Inf"
5799 classes "meet_semilorder" and "join_semilorder" now named
5800 "lower_semilattice" and "upper_semilattice"
5801 class "lorder" now named "lattice"
5802 class "comp_lat" now named "complete_lattice"
5804 Instantiation of lattice classes allows explicit definitions
5805 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
5807 INCOMPATIBILITY. Theorem renames:
5809 meet_left_le ~> inf_le1
5810 meet_right_le ~> inf_le2
5811 join_left_le ~> sup_ge1
5812 join_right_le ~> sup_ge2
5813 meet_join_le ~> inf_sup_ord
5816 le_meet ~> le_inf_iff
5817 le_join ~> ge_sup_conv
5818 meet_idempotent ~> inf_idem
5819 join_idempotent ~> sup_idem
5820 meet_comm ~> inf_commute
5821 join_comm ~> sup_commute
5822 meet_leI1 ~> le_infI1
5823 meet_leI2 ~> le_infI2
5824 le_joinI1 ~> le_supI1
5825 le_joinI2 ~> le_supI2
5826 meet_assoc ~> inf_assoc
5827 join_assoc ~> sup_assoc
5828 meet_left_comm ~> inf_left_commute
5829 meet_left_idempotent ~> inf_left_idem
5830 join_left_comm ~> sup_left_commute
5831 join_left_idempotent ~> sup_left_idem
5834 le_def_meet ~> le_iff_inf
5835 le_def_join ~> le_iff_sup
5836 join_absorp2 ~> sup_absorb2
5837 join_absorp1 ~> sup_absorb1
5838 meet_absorp1 ~> inf_absorb1
5839 meet_absorp2 ~> inf_absorb2
5840 meet_join_absorp ~> inf_sup_absorb
5841 join_meet_absorp ~> sup_inf_absorb
5842 distrib_join_le ~> distrib_sup_le
5843 distrib_meet_le ~> distrib_inf_le
5845 add_meet_distrib_left ~> add_inf_distrib_left
5846 add_join_distrib_left ~> add_sup_distrib_left
5847 is_join_neg_meet ~> is_join_neg_inf
5848 is_meet_neg_join ~> is_meet_neg_sup
5849 add_meet_distrib_right ~> add_inf_distrib_right
5850 add_join_distrib_right ~> add_sup_distrib_right
5851 add_meet_join_distribs ~> add_sup_inf_distribs
5852 join_eq_neg_meet ~> sup_eq_neg_inf
5853 meet_eq_neg_join ~> inf_eq_neg_sup
5854 add_eq_meet_join ~> add_eq_inf_sup
5855 meet_0_imp_0 ~> inf_0_imp_0
5856 join_0_imp_0 ~> sup_0_imp_0
5857 meet_0_eq_0 ~> inf_0_eq_0
5858 join_0_eq_0 ~> sup_0_eq_0
5859 neg_meet_eq_join ~> neg_inf_eq_sup
5860 neg_join_eq_meet ~> neg_sup_eq_inf
5861 join_eq_if ~> sup_eq_if
5863 mono_meet ~> mono_inf
5864 mono_join ~> mono_sup
5865 meet_bool_eq ~> inf_bool_eq
5866 join_bool_eq ~> sup_bool_eq
5867 meet_fun_eq ~> inf_fun_eq
5868 join_fun_eq ~> sup_fun_eq
5869 meet_set_eq ~> inf_set_eq
5870 join_set_eq ~> sup_set_eq
5871 meet1_iff ~> inf1_iff
5872 meet2_iff ~> inf2_iff
5881 join1_iff ~> sup1_iff
5882 join2_iff ~> sup2_iff
5892 is_meet_Meet ~> is_meet_Inf
5893 Meet_bool_def ~> Inf_bool_def
5894 Meet_fun_def ~> Inf_fun_def
5895 Meet_greatest ~> Inf_greatest
5896 Meet_lower ~> Inf_lower
5897 Meet_set_def ~> Inf_set_def
5900 Sup_bool_eq ~> Sup_bool_def
5901 Sup_fun_eq ~> Sup_fun_def
5902 Sup_set_eq ~> Sup_set_def
5904 listsp_meetI ~> listsp_infI
5905 listsp_meet_eq ~> listsp_inf_eq
5910 * Added syntactic class "size"; overloaded constant "size" now has
5911 type "'a::size ==> bool"
5913 * Internal reorganisation of `size' of datatypes: size theorems
5914 "foo.size" are no longer subsumed by "foo.simps" (but are still
5915 simplification rules by default!); theorems "prod.size" now named
5918 * Class "div" now inherits from class "times" rather than "type".
5921 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
5922 Linorder etc. have disappeared; operations defined in terms of
5923 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
5925 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
5927 * HOL-Word: New extensive library and type for generic, fixed size
5928 machine words, with arithmetic, bit-wise, shifting and rotating
5929 operations, reflection into int, nat, and bool lists, automation for
5930 linear arithmetic (by automatic reflection into nat or int), including
5931 lemmas on overflow and monotonicity. Instantiated to all appropriate
5932 arithmetic type classes, supporting automatic simplification of
5933 numerals on all operations.
5935 * Library/Boolean_Algebra: locales for abstract boolean algebras.
5937 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
5939 * Code generator library theories:
5940 - Code_Integer represents HOL integers by big integer literals in target
5942 - Code_Char represents HOL characters by character literals in target
5944 - Code_Char_chr like Code_Char, but also offers treatment of character
5945 codes; includes Code_Integer.
5946 - Executable_Set allows to generate code for finite sets using lists.
5947 - Executable_Rat implements rational numbers as triples (sign, enumerator,
5949 - Executable_Real implements a subset of real numbers, namly those
5950 representable by rational numbers.
5951 - Efficient_Nat implements natural numbers by integers, which in general will
5952 result in higher efficency; pattern matching with 0/Suc is eliminated;
5953 includes Code_Integer.
5954 - Code_Index provides an additional datatype index which is mapped to
5955 target-language built-in integers.
5956 - Code_Message provides an additional datatype message_string which is isomorphic to
5957 strings; messages are mapped to target-language strings.
5959 * New package for inductive predicates
5961 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
5964 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5965 for z_1 :: U_1 and ... and z_n :: U_m
5967 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
5970 with full support for type-inference, rather than
5972 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5974 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5975 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
5977 inductive "s z_1 ... z_m"
5979 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5982 For backward compatibility, there is a wrapper allowing inductive
5983 sets to be defined with the new package via
5986 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5987 for z_1 :: U_1 and ... and z_n :: U_m
5989 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
5995 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
5996 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
5997 for z_1 :: U_1 and ... and z_n :: U_m
5999 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6000 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6003 if the additional syntax "p ..." is required.
6005 Numerous examples can be found in the subdirectories src/HOL/Auth,
6006 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6010 - Since declaration and definition of inductive sets or predicates
6011 is no longer separated, abbreviations involving the newly
6012 introduced sets or predicates must be specified together with the
6013 introduction rules after the 'where' keyword (see above), rather
6014 than before the actual inductive definition.
6016 - The variables in induction and elimination rules are now
6017 quantified in the order of their occurrence in the introduction
6018 rules, rather than in alphabetical order. Since this may break
6019 some proofs, these proofs either have to be repaired, e.g. by
6020 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6021 statements of the form
6023 case (rule_i a_i_1 ... a_i_{k_i})
6025 or the old order of quantification has to be restored by explicitly adding
6026 meta-level quantifiers in the introduction rules, i.e.
6028 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6030 - The format of the elimination rules is now
6032 p z_1 ... z_m x_1 ... x_n ==>
6033 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6038 (x_1, ..., x_n) : s z_1 ... z_m ==>
6039 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6042 for sets rather than
6044 x : s z_1 ... z_m ==>
6045 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6048 This may require terms in goals to be expanded to n-tuples
6049 (e.g. using case_tac or simplification with the split_paired_all
6050 rule) before the above elimination rule is applicable.
6052 - The elimination or case analysis rules for (mutually) inductive
6053 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6054 list of rules "p_1_..._p_k.elims" is no longer available.
6056 * New package "function"/"fun" for general recursive functions,
6057 supporting mutual and nested recursion, definitions in local contexts,
6058 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6059 for small examples, and the separate tutorial on the function
6060 package. The old recdef "package" is still available as before, but
6061 users are encouraged to use the new package.
6063 * Method "lexicographic_order" automatically synthesizes termination
6064 relations as lexicographic combinations of size measures.
6066 * Case-expressions allow arbitrary constructor-patterns (including
6067 "_") and take their order into account, like in functional
6068 programming. Internally, this is translated into nested
6069 case-expressions; missing cases are added and mapped to the predefined
6070 constant "undefined". In complicated cases printing may no longer show
6071 the original input but the internal form. Lambda-abstractions allow
6072 the same form of pattern matching: "% pat1 => e1 | ..." is an
6073 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6076 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6077 is an abbreviation for "of_nat :: nat => int". The simplification
6078 rules for "of_nat" have been changed to work like "int" did
6079 previously. Potential INCOMPATIBILITY:
6080 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6081 - of_nat_diff and of_nat_mult are no longer default simp rules
6083 * Method "algebra" solves polynomial equations over (semi)rings using
6084 Groebner bases. The (semi)ring structure is defined by locales and the
6085 tool setup depends on that generic context. Installing the method for
6086 a specific type involves instantiating the locale and possibly adding
6087 declarations for computation on the coefficients. The method is
6088 already instantiated for natural numbers and for the axiomatic class
6089 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6090 CALCULEMUS 2007 for the general principles underlying this
6091 architecture of context-aware proof-tools.
6093 * Method "ferrack" implements quantifier elimination over
6094 special-purpose dense linear orders using locales (analogous to
6095 "algebra"). The method is already installed for class
6096 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6099 * Former constant "List.op @" now named "List.append". Use ML
6100 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6101 circumvent possible incompatibilities when working on ML level.
6103 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6105 * New function listsum :: 'a list => 'a for arbitrary monoids.
6106 Special syntax: "SUM x <- xs. f x" (and latex variants)
6108 * New syntax for Haskell-like list comprehension (input only), eg.
6109 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6111 * The special syntax for function "filter" has changed from [x :
6112 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6113 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6115 * [a..b] is now defined for arbitrary linear orders. It used to be
6116 defined on nat only, as an abbreviation for [a..<Suc b]
6119 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6121 * New functions "sorted" and "sort" in src/HOL/List.thy.
6123 * New lemma collection field_simps (an extension of ring_simps) for
6124 manipulating (in)equations involving division. Multiplies with all
6125 denominators that can be proved to be non-zero (in equations) or
6126 positive/negative (in inequations).
6128 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6129 have been improved and renamed to ring_simps, group_simps and
6130 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6131 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6133 * Theory Library/Commutative_Ring: switched from recdef to function
6134 package; constants add, mul, pow now curried. Infix syntax for
6135 algebraic operations.
6137 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6140 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6143 * HOL/records: generalised field-update to take a function on the
6144 field rather than the new value: r(|A := x|) is translated to A_update
6145 (K x) r The K-combinator that is internally used is called K_record.
6146 INCOMPATIBILITY: Usage of the plain update functions has to be
6149 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6150 * x = 0, which are required for a semiring. Richer structures do not
6151 inherit from semiring_0 anymore, because this property is a theorem
6152 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6153 there is more to prove, but this is mostly trivial.
6155 * Class "recpower" is generalized to arbitrary monoids, not just
6156 commutative semirings. INCOMPATIBILITY: may need to incorporate
6157 commutativity or semiring properties additionally.
6159 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6160 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6161 better use 'abbreviation'.
6163 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6165 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6166 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6167 significant changes for setting up numeral syntax for types:
6168 - New constants Numeral.pred and Numeral.succ instead
6169 of former Numeral.bin_pred and Numeral.bin_succ.
6170 - Use integer operations instead of bin_add, bin_mult and so on.
6171 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6172 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6174 See src/HOL/Integ/IntArith.thy for an example setup.
6176 * Command 'normal_form' computes the normal form of a term that may
6177 contain free variables. For example ``normal_form "rev [a, b, c]"''
6178 produces ``[b, c, a]'' (without proof). This command is suitable for
6179 heavy-duty computations because the functions are compiled to ML
6180 first. Correspondingly, a method "normalization" is provided. See
6181 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6183 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6184 25 like -->); output depends on the "iff" print_mode, the default is
6185 "A = B" (with priority 50).
6187 * Relations less (<) and less_eq (<=) are also available on type bool.
6188 Modified syntax to disallow nesting without explicit parentheses,
6189 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6192 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6194 * Relation composition operator "op O" now has precedence 75 and binds
6195 stronger than union and intersection. INCOMPATIBILITY.
6197 * The old set interval syntax "{m..n(}" (and relatives) has been
6198 removed. Use "{m..<n}" (and relatives) instead.
6200 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6201 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6202 ``declare [[simproc del: neq]]''.
6204 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6207 * Theorem Cons_eq_map_conv no longer declared as "simp".
6209 * Theorem setsum_mult renamed to setsum_right_distrib.
6211 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6214 * Reimplemented methods "sat" and "satx", with several improvements:
6215 goals no longer need to be stated as "<prems> ==> False", equivalences
6216 (i.e. "=" on type bool) are handled, variable names of the form
6217 "lit_<n>" are no longer reserved, significant speedup.
6219 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6220 zChaff is still supported as well.
6222 * 'inductive' and 'datatype': provide projections of mutual rules,
6223 bundled as foo_bar.inducts;
6225 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6228 * Library: moved theory Accessible_Part to main HOL.
6230 * Library: added theory Coinductive_List of potentially infinite lists
6231 as greatest fixed-point.
6233 * Library: added theory AssocList which implements (finite) maps as
6236 * Method "evaluation" solves goals (i.e. a boolean expression)
6237 efficiently by compiling it to ML. The goal is "proved" (via an
6238 oracle) if it evaluates to True.
6240 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6241 also when invoked by the simplifier. This results in the Simplifier
6242 being more powerful on arithmetic goals. INCOMPATIBILITY.
6243 Configuration option fast_arith_split_limit=0 recovers the old
6246 * Support for hex (0x20) and binary (0b1001) numerals.
6248 * New method: reify eqs (t), where eqs are equations for an
6249 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6250 parameter, computes a term s::'b and a list xs::'a list and proves the
6251 theorem I xs s = t. This is also known as reification or quoting. The
6252 resulting theorem is applied to the subgoal to substitute t with I xs
6253 s. If t is omitted, the subgoal itself is reified.
6255 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6256 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6257 where f is supposed to be a computable function (in the sense of code
6258 generattion). The method uses reify to compute s and xs as above then
6259 applies corr_thm and uses normalization by evaluation to "prove" f s =
6260 r and finally gets the theorem t = r, which is again applied to the
6261 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6263 * Reflection: Automatic reification now handels binding, an example is
6264 available in src/HOL/ex/ReflectionEx.thy
6266 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6267 command 'statespace' that is similar to 'record', but introduces an
6268 abstract specification based on the locale infrastructure instead of
6269 HOL types. This leads to extra flexibility in composing state spaces,
6270 in particular multiple inheritance and renaming of components.
6275 * Hyperreal: Functions root and sqrt are now defined on negative real
6276 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6277 Nonnegativity side conditions have been removed from many lemmas, so
6278 that more subgoals may now be solved by simplification; potential
6281 * Real: new type classes formalize real normed vector spaces and
6282 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6283 and norm :: 'a => real.
6285 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6286 reals into other types. The overloaded constant Reals :: 'a set is now
6287 defined as range of_real; potential INCOMPATIBILITY.
6289 * Real: proper support for ML code generation, including 'quickcheck'.
6290 Reals are implemented as arbitrary precision rationals.
6292 * Hyperreal: Several constants that previously worked only for the
6293 reals have been generalized, so they now work over arbitrary vector
6294 spaces. Type annotations may need to be added in some cases; potential
6297 Infinitesimal :: ('a::real_normed_vector) star set
6298 HFinite :: ('a::real_normed_vector) star set
6299 HInfinite :: ('a::real_normed_vector) star set
6300 approx :: ('a::real_normed_vector) star => 'a star => bool
6301 monad :: ('a::real_normed_vector) star => 'a star set
6302 galaxy :: ('a::real_normed_vector) star => 'a star set
6303 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6304 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6305 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6306 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6307 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6308 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6309 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6310 sgn :: 'a::real_normed_vector => 'a
6311 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6313 * Complex: Some complex-specific constants are now abbreviations for
6314 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6315 hnorm. Other constants have been entirely removed in favor of the
6316 polymorphic versions (INCOMPATIBILITY):
6320 HInfinite <-- CInfinite
6321 Infinitesimal <-- CInfinitesimal
6324 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6325 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6326 (ns)deriv <-- (ns)cderiv
6331 * Formalisation of ideals and the quotient construction over rings.
6333 * Order and lattice theory no longer based on records.
6336 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6337 greatest_closed. INCOMPATIBILITY.
6339 * Method algebra is now set up via an attribute. For examples see
6340 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6341 of algebraic structures.
6343 * Renamed theory CRing to Ring.
6348 * Substantial, yet incomplete support for nominal datatypes (binding
6349 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6350 src/HOL/Nominal/Examples. Prospective users should consult
6351 http://isabelle.in.tum.de/nominal/
6356 * ML basics: just one true type int, which coincides with IntInf.int
6359 * ML within Isar: antiquotations allow to embed statically-checked
6360 formal entities in the source, referring to the context available at
6361 compile-time. For example:
6363 ML {* @{sort "{zero,one}"} *}
6364 ML {* @{typ "'a => 'b"} *}
6365 ML {* @{term "%x. x"} *}
6366 ML {* @{prop "x == y"} *}
6367 ML {* @{ctyp "'a => 'b"} *}
6368 ML {* @{cterm "%x. x"} *}
6369 ML {* @{cprop "x == y"} *}
6370 ML {* @{thm asm_rl} *}
6371 ML {* @{thms asm_rl} *}
6372 ML {* @{type_name c} *}
6373 ML {* @{type_syntax c} *}
6374 ML {* @{const_name c} *}
6375 ML {* @{const_syntax c} *}
6378 ML {* @{theory Pure} *}
6379 ML {* @{theory_ref} *}
6380 ML {* @{theory_ref Pure} *}
6383 ML {* @{clasimpset} *}
6385 The same works for sources being ``used'' within an Isar context.
6387 * ML in Isar: improved error reporting; extra verbosity with
6388 ML_Context.trace enabled.
6390 * Pure/General/table.ML: the join operations now works via exceptions
6391 DUP/SAME instead of type option. This is simpler in simple cases, and
6392 admits slightly more efficient complex applications.
6394 * Pure: 'advanced' translation functions (parse_translation etc.) now
6395 use Context.generic instead of just theory.
6397 * Pure: datatype Context.generic joins theory/Proof.context and
6398 provides some facilities for code that works in either kind of
6399 context, notably GenericDataFun for uniform theory and proof data.
6401 * Pure: simplified internal attribute type, which is now always
6402 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6403 local (Proof.context) attributes have been discontinued, while
6404 minimizing code duplication. Thm.rule_attribute and
6405 Thm.declaration_attribute build canonical attributes; see also structure
6406 Context for further operations on Context.generic, notably
6407 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6408 declarations and definitions.
6410 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6411 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6412 init only required for impure data. INCOMPATIBILITY: empty really need
6413 to be empty (no dependencies on theory content!)
6415 * Pure/kernel: consts certification ignores sort constraints given in
6416 signature declarations. (This information is not relevant to the
6417 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6418 potential INCOMPATIBILITY.
6420 * Pure: axiomatic type classes are now purely definitional, with
6421 explicit proofs of class axioms and super class relations performed
6422 internally. See Pure/axclass.ML for the main internal interfaces --
6423 notably AxClass.define_class supercedes AxClass.add_axclass, and
6424 AxClass.axiomatize_class/classrel/arity supersede
6425 Sign.add_classes/classrel/arities.
6427 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6428 global/local versions on theory vs. Proof.context have been
6429 discontinued; Attrib.syntax and Method.syntax have been adapted
6430 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6431 attributes, methods, etc.
6433 * Pure: several functions of signature "... -> theory -> theory * ..."
6434 have been reoriented to "... -> theory -> ... * theory" in order to
6435 allow natural usage in combination with the ||>, ||>>, |-> and
6436 fold_map combinators.
6438 * Pure: official theorem names (closed derivations) and additional
6439 comments (tags) are now strictly separate. Name hints -- which are
6440 maintained as tags -- may be attached any time without affecting the
6443 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6444 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6445 achieve the old behaviour.
6447 * Pure: the "Goal" constant is now called "prop", supporting a
6448 slightly more general idea of ``protecting'' meta-level rule
6451 * Pure: Logic.(un)varify only works in a global context, which is now
6452 enforced instead of silently assumed. INCOMPATIBILITY, may use
6453 Logic.legacy_(un)varify as temporary workaround.
6455 * Pure: structure Name provides scalable operations for generating
6456 internal variable names, notably Name.variants etc. This replaces
6457 some popular functions from term.ML:
6459 Term.variant -> Name.variant
6460 Term.variantlist -> Name.variant_list
6461 Term.invent_names -> Name.invent_list
6463 Note that low-level renaming rarely occurs in new code -- operations
6464 from structure Variable are used instead (see below).
6466 * Pure: structure Variable provides fundamental operations for proper
6467 treatment of fixed/schematic variables in a context. For example,
6468 Variable.import introduces fixes for schematics of given facts and
6469 Variable.export reverses the effect (up to renaming) -- this replaces
6470 various freeze_thaw operations.
6472 * Pure: structure Goal provides simple interfaces for
6473 init/conclude/finish and tactical prove operations (replacing former
6474 Tactic.prove). Goal.prove is the canonical way to prove results
6475 within a given context; Goal.prove_global is a degraded version for
6476 theory level goals, including a global Drule.standard. Note that
6477 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6478 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6479 in a locale context).
6481 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6482 and type checking (Syntax.check_term etc.), with common combinations
6483 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6484 which are considered legacy and await removal.
6486 * Pure/Syntax: generic interfaces for type unchecking
6487 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6488 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6489 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6490 available for convenience, but refer to the very same operations using
6491 a mere theory instead of a full context.
6493 * Isar: simplified treatment of user-level errors, using exception
6494 ERROR of string uniformly. Function error now merely raises ERROR,
6495 without any side effect on output channels. The Isar toplevel takes
6496 care of proper display of ERROR exceptions. ML code may use plain
6497 handle/can/try; cat_error may be used to concatenate errors like this:
6499 ... handle ERROR msg => cat_error msg "..."
6501 Toplevel ML code (run directly or through the Isar toplevel) may be
6502 embedded into the Isar toplevel with exception display/debug like
6505 Isar.toplevel (fn () => ...)
6507 INCOMPATIBILITY, removed special transform_error facilities, removed
6508 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6509 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6510 -- use plain ERROR instead.
6512 * Isar: theory setup now has type (theory -> theory), instead of a
6513 list. INCOMPATIBILITY, may use #> to compose setup functions.
6515 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6516 ProofContext.debug/verbose flags.
6518 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6519 theory before entering a proof state. Transactions now always see a
6520 quasi-functional intermediate checkpoint, both in interactive and
6523 * Isar: simplified interfaces for outer syntax. Renamed
6524 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6525 OuterSyntax.add_parsers -- this functionality is now included in
6526 OuterSyntax.command etc. INCOMPATIBILITY.
6528 * Simplifier: the simpset of a running simplification process now
6529 contains a proof context (cf. Simplifier.the_context), which is the
6530 very context that the initial simpset has been retrieved from (by
6531 simpset_of/local_simpset_of). Consequently, all plug-in components
6532 (solver, looper etc.) may depend on arbitrary proof data.
6534 * Simplifier.inherit_context inherits the proof context (plus the
6535 local bounds) of the current simplification process; any simproc
6536 etc. that calls the Simplifier recursively should do this! Removed
6537 former Simplifier.inherit_bounds, which is already included here --
6538 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6539 specify an explicit context using Simplifier.context/theory_context.
6541 * Simplifier/Classical Reasoner: more abstract interfaces
6542 change_simpset/claset for modifying the simpset/claset reference of a
6543 theory; raw versions simpset/claset_ref etc. have been discontinued --
6546 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6552 * settings: the default heap location within ISABELLE_HOME_USER now
6553 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6554 Isabelle installations.
6556 * isabelle-process: option -S (secure mode) disables some critical
6557 operations, notably runtime compilation and evaluation of ML source
6560 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6562 * Support for parallel execution, using native multicore support of
6563 Poly/ML 5.1. The theory loader exploits parallelism when processing
6564 independent theories, according to the given theory header
6565 specifications. The maximum number of worker threads is specified via
6566 usedir option -M or the "max-threads" setting in Proof General. A
6567 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6568 to 6 on a 8-core machine. User-code needs to observe certain
6569 guidelines for thread-safe programming, see appendix A in the Isar
6570 Implementation manual.
6574 New in Isabelle2005 (October 2005)
6575 ----------------------------------
6579 * Theory headers: the new header syntax for Isar theories is
6582 imports <theory1> ... <theoryN>
6583 uses <file1> ... <fileM>
6586 where the 'uses' part is optional. The previous syntax
6588 theory <name> = <theory1> + ... + <theoryN>:
6590 will disappear in the next release. Use isatool fixheaders to convert
6591 existing theory files. Note that there is no change in ancient
6592 non-Isar theories now, but these will disappear soon.
6594 * Theory loader: parent theories can now also be referred to via
6595 relative and absolute paths.
6597 * Command 'find_theorems' searches for a list of criteria instead of a
6598 list of constants. Known criteria are: intro, elim, dest, name:string,
6599 simp:term, and any term. Criteria can be preceded by '-' to select
6600 theorems that do not match. Intro, elim, dest select theorems that
6601 match the current goal, name:s selects theorems whose fully qualified
6602 name contain s, and simp:term selects all simplification rules whose
6603 lhs match term. Any other term is interpreted as pattern and selects
6604 all theorems matching the pattern. Available in ProofGeneral under
6605 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
6607 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
6609 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
6610 matching the current goal as introduction rule and not having "HOL."
6611 in their name (i.e. not being defined in theory HOL).
6613 * Command 'thms_containing' has been discontinued in favour of
6614 'find_theorems'; INCOMPATIBILITY.
6616 * Communication with Proof General is now 8bit clean, which means that
6617 Unicode text in UTF-8 encoding may be used within theory texts (both
6618 formal and informal parts). Cf. option -U of the Isabelle Proof
6619 General interface. Here are some simple examples (cf. src/HOL/ex):
6621 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
6622 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
6624 * Improved efficiency of the Simplifier and, to a lesser degree, the
6625 Classical Reasoner. Typical big applications run around 2 times
6629 *** Document preparation ***
6631 * Commands 'display_drafts' and 'print_drafts' perform simple output
6632 of raw sources. Only those symbols that do not require additional
6633 LaTeX packages (depending on comments in isabellesym.sty) are
6634 displayed properly, everything else is left verbatim. isatool display
6635 and isatool print are used as front ends (these are subject to the
6636 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
6638 * Command tags control specific markup of certain regions of text,
6639 notably folding and hiding. Predefined tags include "theory" (for
6640 theory begin and end), "proof" for proof commands, and "ML" for
6641 commands involving ML code; the additional tags "visible" and
6642 "invisible" are unused by default. Users may give explicit tag
6643 specifications in the text, e.g. ''by %invisible (auto)''. The
6644 interpretation of tags is determined by the LaTeX job during document
6645 preparation: see option -V of isatool usedir, or options -n and -t of
6646 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
6649 Several document versions may be produced at the same time via isatool
6650 usedir (the generated index.html will link all of them). Typical
6651 specifications include ''-V document=theory,proof,ML'' to present
6652 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
6653 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
6654 these parts without any formal replacement text. The Isabelle site
6655 default settings produce ''document'' and ''outline'' versions as
6658 * Several new antiquotations:
6660 @{term_type term} prints a term with its type annotated;
6662 @{typeof term} prints the type of a term;
6664 @{const const} is the same as @{term const}, but checks that the
6665 argument is a known logical constant;
6667 @{term_style style term} and @{thm_style style thm} print a term or
6668 theorem applying a "style" to it
6672 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
6673 definitions, equations, inequations etc., 'concl' printing only the
6674 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
6675 to print the specified premise. TermStyle.add_style provides an ML
6676 interface for introducing further styles. See also the "LaTeX Sugar"
6677 document practical applications. The ML antiquotation prints
6678 type-checked ML expressions verbatim.
6680 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
6681 and 'text' support optional locale specification '(in loc)', which
6682 specifies the default context for interpreting antiquotations. For
6683 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
6685 * Option 'locale=NAME' of antiquotations specifies an alternative
6686 context interpreting the subsequent argument. For example: @{thm
6687 [locale=lattice] inf_assoc}.
6689 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
6692 * Proper output of antiquotations for theory commands involving a
6693 proof context (such as 'locale' or 'theorem (in loc) ...').
6695 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
6696 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
6698 * isatool usedir: new option -C (default true) controls whether option
6699 -D should include a copy of the original document directory; -C false
6700 prevents unwanted effects such as copying of administrative CVS data.
6705 * Considerably improved version of 'constdefs' command. Now performs
6706 automatic type-inference of declared constants; additional support for
6707 local structure declarations (cf. locales and HOL records), see also
6708 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
6709 sequential dependencies of definitions within a single 'constdefs'
6710 section; moreover, the declared name needs to be an identifier. If
6711 all fails, consider to fall back on 'consts' and 'defs' separately.
6713 * Improved indexed syntax and implicit structures. First of all,
6714 indexed syntax provides a notational device for subscripted
6715 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
6716 expressions. Secondly, in a local context with structure
6717 declarations, number indexes \<^sub>n or the empty index (default
6718 number 1) refer to a certain fixed variable implicitly; option
6719 show_structs controls printing of implicit structures. Typical
6720 applications of these concepts involve record types and locales.
6722 * New command 'no_syntax' removes grammar declarations (and
6723 translations) resulting from the given syntax specification, which is
6724 interpreted in the same manner as for the 'syntax' command.
6726 * 'Advanced' translation functions (parse_translation etc.) may depend
6727 on the signature of the theory context being presently used for
6728 parsing/printing, see also isar-ref manual.
6730 * Improved 'oracle' command provides a type-safe interface to turn an
6731 ML expression of type theory -> T -> term into a primitive rule of
6732 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
6733 is already included here); see also FOL/ex/IffExample.thy;
6736 * axclass: name space prefix for class "c" is now "c_class" (was "c"
6737 before); "cI" is no longer bound, use "c.intro" instead.
6738 INCOMPATIBILITY. This change avoids clashes of fact bindings for
6739 axclasses vs. locales.
6741 * Improved internal renaming of symbolic identifiers -- attach primes
6742 instead of base 26 numbers.
6744 * New flag show_question_marks controls printing of leading question
6745 marks in schematic variable names.
6747 * In schematic variable names, *any* symbol following \<^isub> or
6748 \<^isup> is now treated as part of the base name. For example, the
6749 following works without printing of awkward ".0" indexes:
6751 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
6754 * Inner syntax includes (*(*nested*) comments*).
6756 * Pretty printer now supports unbreakable blocks, specified in mixfix
6757 annotations as "(00...)".
6759 * Clear separation of logical types and nonterminals, where the latter
6760 may only occur in 'syntax' specifications or type abbreviations.
6761 Before that distinction was only partially implemented via type class
6762 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
6763 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
6764 exotic syntax specifications may require further adaption
6765 (e.g. Cube/Cube.thy).
6767 * Removed obsolete type class "logic", use the top sort {} instead.
6768 Note that non-logical types should be declared as 'nonterminals'
6769 rather than 'types'. INCOMPATIBILITY for new object-logic
6772 * Attributes 'induct' and 'cases': type or set names may now be
6773 locally fixed variables as well.
6775 * Simplifier: can now control the depth to which conditional rewriting
6776 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
6779 * Simplifier: simplification procedures may now take the current
6780 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
6781 interface), which is very useful for calling the Simplifier
6782 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
6783 is gone -- use prems_of_ss on the simpset instead. Moreover, the
6784 low-level mk_simproc no longer applies Logic.varify internally, to
6785 allow for use in a context of fixed variables.
6787 * thin_tac now works even if the assumption being deleted contains !!
6788 or ==>. More generally, erule now works even if the major premise of
6789 the elimination rule contains !! or ==>.
6791 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
6793 * Reorganized bootstrapping of the Pure theories; CPure is now derived
6794 from Pure, which contains all common declarations already. Both
6795 theories are defined via plain Isabelle/Isar .thy files.
6796 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
6797 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
6798 use isatool fixcpure to adapt your theory and ML sources.
6800 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
6801 selections of theorems in named facts via index ranges.
6803 * 'print_theorems': in theory mode, really print the difference
6804 wrt. the last state (works for interactive theory development only),
6805 in proof mode print all local facts (cf. 'print_facts');
6807 * 'hide': option '(open)' hides only base names.
6809 * More efficient treatment of intermediate checkpoints in interactive
6812 * Code generator is now invoked via code_module (incremental code
6813 generation) and code_library (modular code generation, ML structures
6814 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
6815 must be quoted when used as identifiers.
6817 * New 'value' command for reading, evaluating and printing terms using
6818 the code generator. INCOMPATIBILITY: command keyword 'value' must be
6819 quoted when used as identifier.
6824 * New commands for the interpretation of locale expressions in
6825 theories (1), locales (2) and proof contexts (3). These generate
6826 proof obligations from the expression specification. After the
6827 obligations have been discharged, theorems of the expression are added
6828 to the theory, target locale or proof context. The synopsis of the
6829 commands is a follows:
6831 (1) interpretation expr inst
6832 (2) interpretation target < expr
6833 (3) interpret expr inst
6835 Interpretation in theories and proof contexts require a parameter
6836 instantiation of terms from the current context. This is applied to
6837 specifications and theorems of the interpreted expression.
6838 Interpretation in locales only permits parameter renaming through the
6839 locale expression. Interpretation is smart in that interpretations
6840 that are active already do not occur in proof obligations, neither are
6841 instantiated theorems stored in duplicate. Use 'print_interps' to
6842 inspect active interpretations of a particular locale. For details,
6843 see the Isar Reference manual. Examples can be found in
6844 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
6846 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
6847 'interpret' instead.
6849 * New context element 'constrains' for adding type constraints to
6852 * Context expressions: renaming of parameters with syntax
6855 * Locale declaration: 'includes' disallowed.
6857 * Proper static binding of attribute syntax -- i.e. types / terms /
6858 facts mentioned as arguments are always those of the locale definition
6859 context, independently of the context of later invocations. Moreover,
6860 locale operations (renaming and type / term instantiation) are applied
6861 to attribute arguments as expected.
6863 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
6864 actual attributes; rare situations may require Attrib.attribute to
6865 embed those attributes into Attrib.src that lack concrete syntax.
6866 Attribute implementations need to cooperate properly with the static
6867 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
6868 Attrib.XXX_thm etc. already do the right thing without further
6869 intervention. Only unusual applications -- such as "where" or "of"
6870 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
6871 on the context and the facts involved -- may have to assign parsed
6872 values to argument tokens explicitly.
6874 * Changed parameter management in theorem generation for long goal
6875 statements with 'includes'. INCOMPATIBILITY: produces a different
6876 theorem statement in rare situations.
6878 * Locale inspection command 'print_locale' omits notes elements. Use
6879 'print_locale!' to have them included in the output.
6884 * Provers/hypsubst.ML: improved version of the subst method, for
6885 single-step rewriting: it now works in bound variable contexts. New is
6886 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
6887 rewrite a different subterm than the original subst method, which is
6888 still available as 'simplesubst'.
6890 * Provers/quasi.ML: new transitivity reasoners for transitivity only
6893 * Provers/trancl.ML: new transitivity reasoner for transitive and
6894 reflexive-transitive closure of relations.
6896 * Provers/blast.ML: new reference depth_limit to make blast's depth
6897 limit (previously hard-coded with a value of 20) user-definable.
6899 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
6900 is peformed already. Object-logics merely need to finish their
6901 initial simpset configuration as before. INCOMPATIBILITY.
6906 * Symbolic syntax of Hilbert Choice Operator is now as follows:
6909 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
6911 The symbol \<some> is displayed as the alternative epsilon of LaTeX
6912 and x-symbol; use option '-m epsilon' to get it actually printed.
6913 Moreover, the mathematically important symbolic identifier \<epsilon>
6914 becomes available as variable, constant etc. INCOMPATIBILITY,
6916 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
6917 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
6918 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
6919 support corresponding Isar calculations.
6921 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
6924 * theory SetInterval: changed the syntax for open intervals:
6933 The old syntax is still supported but will disappear in the next
6934 release. For conversion use the following Emacs search and replace
6935 patterns (these are not perfect but work quite well):
6937 {)\([^\.]*\)\.\. -> {\1<\.\.}
6938 \.\.\([^(}]*\)(} -> \.\.<\1}
6940 * Theory Commutative_Ring (in Library): method comm_ring for proving
6941 equalities in commutative rings; method 'algebra' provides a generic
6944 * Theory Finite_Set: changed the syntax for 'setsum', summation over
6945 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
6946 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
6949 Some new syntax forms are available:
6951 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
6952 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
6953 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
6954 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
6956 The latter form "\<Sum>x < k. e" used to be based on a separate
6957 function "Summation", which has been discontinued.
6959 * theory Finite_Set: in structured induction proofs, the insert case
6960 is now 'case (insert x F)' instead of the old counterintuitive 'case
6963 * The 'refute' command has been extended to support a much larger
6964 fragment of HOL, including axiomatic type classes, constdefs and
6965 typedefs, inductive datatypes and recursion.
6967 * New tactics 'sat' and 'satx' to prove propositional tautologies.
6968 Requires zChaff with proof generation to be installed. See
6969 HOL/ex/SAT_Examples.thy for examples.
6971 * Datatype induction via method 'induct' now preserves the name of the
6972 induction variable. For example, when proving P(xs::'a list) by
6973 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
6974 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
6975 in unstructured proof scripts.
6977 * Reworked implementation of records. Improved scalability for
6978 records with many fields, avoiding performance problems for type
6979 inference. Records are no longer composed of nested field types, but
6980 of nested extension types. Therefore the record type only grows linear
6981 in the number of extensions and not in the number of fields. The
6982 top-level (users) view on records is preserved. Potential
6983 INCOMPATIBILITY only in strange cases, where the theory depends on the
6984 old record representation. The type generated for a record is called
6985 <record_name>_ext_type.
6987 Flag record_quick_and_dirty_sensitive can be enabled to skip the
6988 proofs triggered by a record definition or a simproc (if
6989 quick_and_dirty is enabled). Definitions of large records can take
6992 New simproc record_upd_simproc for simplification of multiple record
6993 updates enabled by default. Moreover, trivial updates are also
6994 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
6995 occasionally, since simplification is more powerful by default.
6997 * typedef: proper support for polymorphic sets, which contain extra
6998 type-variables in the term.
7000 * Simplifier: automatically reasons about transitivity chains
7001 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7002 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7003 old proofs break occasionally as simplification may now solve more
7004 goals than previously.
7006 * Simplifier: converts x <= y into x = y if assumption y <= x is
7007 present. Works for all partial orders (class "order"), in particular
7008 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7011 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7012 bound variable or a constant then the let is unfolded. Otherwise
7013 first a is simplified to b, and then f b is simplified to g. If
7014 possible we abstract b from g arriving at "let x = b in h x",
7015 otherwise we unfold the let and arrive at g. The simproc can be
7016 enabled/disabled by the reference use_let_simproc. Potential
7017 INCOMPATIBILITY since simplification is more powerful by default.
7019 * Classical reasoning: the meson method now accepts theorems as arguments.
7021 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7022 jobs to provide advice on the provability of subgoals.
7024 * Theory OrderedGroup and Ring_and_Field: various additions and
7025 improvements to faciliate calculations involving equalities and
7028 The following theorems have been eliminated or modified
7031 abs_eq now named abs_of_nonneg
7032 abs_of_ge_0 now named abs_of_nonneg
7033 abs_minus_eq now named abs_of_nonpos
7034 imp_abs_id now named abs_of_nonneg
7035 imp_abs_neg_id now named abs_of_nonpos
7036 mult_pos now named mult_pos_pos
7037 mult_pos_le now named mult_nonneg_nonneg
7038 mult_pos_neg_le now named mult_nonneg_nonpos
7039 mult_pos_neg2_le now named mult_nonneg_nonpos2
7040 mult_neg now named mult_neg_neg
7041 mult_neg_le now named mult_nonpos_nonpos
7043 * The following lemmas in Ring_and_Field have been added to the simplifier:
7046 not_square_less_zero
7048 The following lemmas have been deleted from Real/RealPow:
7058 * Theory Parity: added rules for simplifying exponents.
7062 The following theorems have been eliminated or modified
7065 list_all_Nil now named list_all.simps(1)
7066 list_all_Cons now named list_all.simps(2)
7067 list_all_conv now named list_all_iff
7068 set_mem_eq now named mem_iff
7070 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7071 asymptotic "big O" calculations. See the notes in BigO.thy.
7076 * Theory RealDef: better support for embedding natural numbers and
7077 integers in the reals.
7079 The following theorems have been eliminated or modified
7082 exp_ge_add_one_self now requires no hypotheses
7083 real_of_int_add reversed direction of equality (use [symmetric])
7084 real_of_int_minus reversed direction of equality (use [symmetric])
7085 real_of_int_diff reversed direction of equality (use [symmetric])
7086 real_of_int_mult reversed direction of equality (use [symmetric])
7088 * Theory RComplete: expanded support for floor and ceiling functions.
7090 * Theory Ln is new, with properties of the natural logarithm
7092 * Hyperreal: There is a new type constructor "star" for making
7093 nonstandard types. The old type names are now type synonyms:
7097 hcomplex = complex star
7099 * Hyperreal: Many groups of similarly-defined constants have been
7100 replaced by polymorphic versions (INCOMPATIBILITY):
7102 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7104 starset <-- starsetNat, starsetC
7105 *s* <-- *sNat*, *sc*
7106 starset_n <-- starsetNat_n, starsetC_n
7107 *sn* <-- *sNatn*, *scn*
7108 InternalSets <-- InternalNatSets, InternalCSets
7110 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7111 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7112 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7113 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7114 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7116 * Hyperreal: Many type-specific theorems have been removed in favor of
7117 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7119 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7120 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7121 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7122 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7123 right_minus <-- hypreal_add_minus
7124 left_minus <-- {hypreal,hcomplex}_add_minus_left
7125 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7126 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7127 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7128 mult_1_right <-- hcomplex_mult_one_right
7129 mult_zero_left <-- hcomplex_mult_zero_left
7130 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7131 right_distrib <-- hypnat_add_mult_distrib2
7132 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7133 right_inverse <-- hypreal_mult_inverse
7134 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7135 order_refl <-- {hypreal,hypnat}_le_refl
7136 order_trans <-- {hypreal,hypnat}_le_trans
7137 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7138 order_less_le <-- {hypreal,hypnat}_less_le
7139 linorder_linear <-- {hypreal,hypnat}_le_linear
7140 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7141 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7142 add_nonneg_nonneg <-- hypreal_le_add_order
7144 * Hyperreal: Separate theorems having to do with type-specific
7145 versions of constants have been merged into theorems that apply to the
7146 new polymorphic constants (INCOMPATIBILITY):
7148 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7149 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7150 STAR_Un <-- {STAR,NatStar,STARC}_Un
7151 STAR_Int <-- {STAR,NatStar,STARC}_Int
7152 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7153 STAR_subset <-- {STAR,NatStar,STARC}_subset
7154 STAR_mem <-- {STAR,NatStar,STARC}_mem
7155 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7156 STAR_diff <-- {STAR,STARC}_diff
7157 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7158 STARC_hcomplex_of_complex}_image_subset
7159 starset_n_Un <-- starset{Nat,C}_n_Un
7160 starset_n_Int <-- starset{Nat,C}_n_Int
7161 starset_n_Compl <-- starset{Nat,C}_n_Compl
7162 starset_n_diff <-- starset{Nat,C}_n_diff
7163 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7164 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7165 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7166 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7167 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7168 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7169 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7170 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7171 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7172 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7173 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7174 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7175 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7176 starfun_diff <-- starfun{C,RC,CR}_diff
7177 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7178 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7179 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7180 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7181 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7182 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7183 starfun_Id <-- starfunC_Id
7184 starfun_approx <-- starfun{Nat,CR}_approx
7185 starfun_capprox <-- starfun{C,RC}_capprox
7186 starfun_abs <-- starfunNat_rabs
7187 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7188 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7189 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7190 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7191 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7192 starfun_add_approx <-- starfunCR_add_approx
7193 starfun_inverse_inverse <-- starfunC_inverse_inverse
7194 starfun_divide <-- starfun{C,CR,RC}_divide
7195 starfun_n <-- starfun{Nat,C}_n
7196 starfun_n_mult <-- starfun{Nat,C}_n_mult
7197 starfun_n_add <-- starfun{Nat,C}_n_add
7198 starfun_n_add_minus <-- starfunNat_n_add_minus
7199 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7200 starfun_n_minus <-- starfun{Nat,C}_n_minus
7201 starfun_n_eq <-- starfun{Nat,C}_n_eq
7203 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7204 star_n_minus <-- {hypreal,hcomplex}_minus
7205 star_n_diff <-- {hypreal,hcomplex}_diff
7206 star_n_mult <-- {hypreal,hcomplex}_mult
7207 star_n_inverse <-- {hypreal,hcomplex}_inverse
7208 star_n_le <-- {hypreal,hypnat}_le
7209 star_n_less <-- {hypreal,hypnat}_less
7210 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7211 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7212 star_n_abs <-- hypreal_hrabs
7213 star_n_divide <-- hcomplex_divide
7215 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7216 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7217 star_of_diff <-- hypreal_of_real_diff
7218 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7219 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7220 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7221 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7222 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7223 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7224 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7225 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7226 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7227 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7228 star_of_number_of <-- {hypreal,hcomplex}_number_of
7229 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7230 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7231 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7232 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7233 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7234 star_of_power <-- hypreal_of_real_power
7235 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7237 * Hyperreal: new method "transfer" that implements the transfer
7238 principle of nonstandard analysis. With a subgoal that mentions
7239 nonstandard types like "'a star", the command "apply transfer"
7240 replaces it with an equivalent one that mentions only standard types.
7241 To be successful, all free variables must have standard types; non-
7242 standard variables must have explicit universal quantifiers.
7244 * Hyperreal: A theory of Taylor series.
7249 * Discontinued special version of 'constdefs' (which used to support
7250 continuous functions) in favor of the general Pure one with full
7253 * New simplification procedure for solving continuity conditions; it
7254 is much faster on terms with many nested lambda abstractions (cubic
7255 instead of exponential time).
7257 * New syntax for domain package: selector names are now optional.
7258 Parentheses should be omitted unless argument is lazy, for example:
7260 domain 'a stream = cons "'a" (lazy "'a stream")
7262 * New command 'fixrec' for defining recursive functions with pattern
7263 matching; defining multiple functions with mutual recursion is also
7264 supported. Patterns may include the constants cpair, spair, up, sinl,
7265 sinr, or any data constructor defined by the domain package. The given
7266 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7267 syntax and examples.
7269 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7270 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7271 but the proof obligation additionally includes an admissibility
7272 requirement. The packages generate instances of class cpo or pcpo,
7273 with continuity and strictness theorems for Rep and Abs.
7275 * HOLCF: Many theorems have been renamed according to a more standard naming
7276 scheme (INCOMPATIBILITY):
7278 foo_inject: "foo$x = foo$y ==> x = y"
7279 foo_eq: "(foo$x = foo$y) = (x = y)"
7280 foo_less: "(foo$x << foo$y) = (x << y)"
7281 foo_strict: "foo$UU = UU"
7282 foo_defined: "... ==> foo$x ~= UU"
7283 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7288 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7289 including the First Isomorphism Theorem (on quotienting by the kernel
7292 * ZF/Simplifier: install second copy of type solver that actually
7293 makes use of TC rules declared to Isar proof contexts (or locales);
7294 the old version is still required for ML proof scripts.
7299 * Converted to Isar theory format; use locales instead of axiomatic
7305 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7308 * Pure/library.ML no longer defines its own option datatype, but uses
7309 that of the SML basis, which has constructors NONE and SOME instead of
7310 None and Some, as well as exception Option.Option instead of OPTION.
7311 The functions the, if_none, is_some, is_none have been adapted
7312 accordingly, while Option.map replaces apsome.
7314 * Pure/library.ML: the exception LIST has been given up in favour of
7315 the standard exceptions Empty and Subscript, as well as
7316 Library.UnequalLengths. Function like Library.hd and Library.tl are
7317 superceded by the standard hd and tl functions etc.
7319 A number of basic list functions are no longer exported to the ML
7320 toplevel, as they are variants of predefined functions. The following
7321 suggests how one can translate existing code:
7323 rev_append xs ys = List.revAppend (xs, ys)
7324 nth_elem (i, xs) = List.nth (xs, i)
7325 last_elem xs = List.last xs
7326 flat xss = List.concat xss
7327 seq fs = List.app fs
7328 partition P xs = List.partition P xs
7329 mapfilter f xs = List.mapPartial f xs
7331 * Pure/library.ML: several combinators for linear functional
7332 transformations, notably reverse application and composition:
7335 (x, y) |-> f f #-> g
7337 * Pure/library.ML: introduced/changed precedence of infix operators:
7339 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7341 infix 3 o oo ooo oooo;
7342 infix 4 ~~ upto downto;
7344 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7347 * Pure/library.ML: natural list combinators fold, fold_rev, and
7348 fold_map support linear functional transformations and nesting. For
7351 fold f [x1, ..., xN] y =
7352 y |> f x1 |> ... |> f xN
7354 (fold o fold) f [xs1, ..., xsN] y =
7355 y |> fold f xs1 |> ... |> fold f xsN
7357 fold f [x1, ..., xN] =
7360 (fold o fold) f [xs1, ..., xsN] =
7361 fold f xs1 #> ... #> fold f xsN
7363 * Pure/library.ML: the following selectors on type 'a option are
7366 the: 'a option -> 'a (*partial*)
7367 these: 'a option -> 'a where 'a = 'b list
7368 the_default: 'a -> 'a option -> 'a
7369 the_list: 'a option -> 'a list
7371 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7372 basic operations for association lists, following natural argument
7373 order; moreover the explicit equality predicate passed here avoids
7374 potentially expensive polymorphic runtime equality checks.
7375 The old functions may be expressed as follows:
7377 assoc = uncurry (AList.lookup (op =))
7378 assocs = these oo AList.lookup (op =)
7379 overwrite = uncurry (AList.update (op =)) o swap
7381 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7383 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7384 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7386 replacing make_keylist and keyfilter (occassionally used)
7389 make_keylist = AList.make
7390 keyfilter = AList.find (op =)
7392 * eq_fst and eq_snd now take explicit equality parameter, thus
7393 avoiding eqtypes. Naive rewrites:
7395 eq_fst = eq_fst (op =)
7396 eq_snd = eq_snd (op =)
7398 * Removed deprecated apl and apr (rarely used).
7401 apl (n, op) =>>= curry op n
7402 apr (op, m) =>>= fn n => op (n, m)
7404 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7405 provides a reasonably efficient light-weight implementation of sets as
7408 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7409 few new operations; existing lookup and update are now curried to
7410 follow natural argument order (for use with fold etc.);
7411 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7413 * Pure/General: output via the Isabelle channels of
7414 writeln/warning/error etc. is now passed through Output.output, with a
7415 hook for arbitrary transformations depending on the print_mode
7416 (cf. Output.add_mode -- the first active mode that provides a output
7417 function wins). Already formatted output may be embedded into further
7418 text via Output.raw; the result of Pretty.string_of/str_of and derived
7419 functions (string_of_term/cterm/thm etc.) is already marked raw to
7420 accommodate easy composition of diagnostic messages etc. Programmers
7421 rarely need to care about Output.output or Output.raw at all, with
7422 some notable exceptions: Output.output is required when bypassing the
7423 standard channels (writeln etc.), or in token translations to produce
7424 properly formatted results; Output.raw is required when capturing
7425 already output material that will eventually be presented to the user
7426 a second time. For the default print mode, both Output.output and
7427 Output.raw have no effect.
7429 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7430 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7431 cumulative results are displayed at the end of a batch session.
7433 * Pure/General: File.sysify_path and File.quote_sysify path have been
7434 replaced by File.platform_path and File.shell_path (with appropriate
7435 hooks). This provides a clean interface for unusual systems where the
7436 internal and external process view of file names are different.
7438 * Pure: more efficient orders for basic syntactic entities: added
7439 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7440 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7441 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7442 orders now -- potential INCOMPATIBILITY for code that depends on a
7443 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7444 Library.sort_strings on result).
7446 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7447 fold_types traverse types/terms from left to right, observing natural
7448 argument order. Supercedes previous foldl_XXX versions, add_frees,
7449 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7451 * Pure: name spaces have been refined, with significant changes of the
7452 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7453 to extern(_table). The plain name entry path is superceded by a
7454 general 'naming' context, which also includes the 'policy' to produce
7455 a fully qualified name and external accesses of a fully qualified
7456 name; NameSpace.extend is superceded by context dependent
7457 Sign.declare_name. Several theory and proof context operations modify
7458 the naming context. Especially note Theory.restore_naming and
7459 ProofContext.restore_naming to get back to a sane state; note that
7460 Theory.add_path is no longer sufficient to recover from
7461 Theory.absolute_path in particular.
7463 * Pure: new flags short_names (default false) and unique_names
7464 (default true) for controlling output of qualified names. If
7465 short_names is set, names are printed unqualified. If unique_names is
7466 reset, the name prefix is reduced to the minimum required to achieve
7467 the original result when interning again, even if there is an overlap
7468 with earlier declarations.
7470 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7471 now 'extend', and 'merge' gets an additional Pretty.pp argument
7472 (useful for printing error messages). INCOMPATIBILITY.
7474 * Pure: major reorganization of the theory context. Type Sign.sg and
7475 Theory.theory are now identified, referring to the universal
7476 Context.theory (see Pure/context.ML). Actual signature and theory
7477 content is managed as theory data. The old code and interfaces were
7478 spread over many files and structures; the new arrangement introduces
7479 considerable INCOMPATIBILITY to gain more clarity:
7481 Context -- theory management operations (name, identity, inclusion,
7482 parents, ancestors, merge, etc.), plus generic theory data;
7484 Sign -- logical signature and syntax operations (declaring consts,
7485 types, etc.), plus certify/read for common entities;
7487 Theory -- logical theory operations (stating axioms, definitions,
7488 oracles), plus a copy of logical signature operations (consts,
7489 types, etc.); also a few basic management operations (Theory.copy,
7492 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7493 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7494 for convenience -- they merely return the theory.
7496 * Pure: type Type.tsig is superceded by theory in most interfaces.
7498 * Pure: the Isar proof context type is already defined early in Pure
7499 as Context.proof (note that ProofContext.context and Proof.context are
7500 aliases, where the latter is the preferred name). This enables other
7501 Isabelle components to refer to that type even before Isar is present.
7503 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7504 typeK, constK, axiomK, oracleK), but provide explicit operations for
7505 any of these kinds. For example, Sign.intern typeK is now
7506 Sign.intern_type, Theory.hide_space Sign.typeK is now
7507 Theory.hide_types. Also note that former
7508 Theory.hide_classes/types/consts are now
7509 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7510 internalize their arguments! INCOMPATIBILITY.
7512 * Pure: get_thm interface (of PureThy and ProofContext) expects
7513 datatype thmref (with constructors Name and NameSelection) instead of
7514 plain string -- INCOMPATIBILITY;
7516 * Pure: cases produced by proof methods specify options, where NONE
7517 means to remove case bindings -- INCOMPATIBILITY in
7520 * Pure: the following operations retrieve axioms or theorems from a
7521 theory node or theory hierarchy, respectively:
7523 Theory.axioms_of: theory -> (string * term) list
7524 Theory.all_axioms_of: theory -> (string * term) list
7525 PureThy.thms_of: theory -> (string * thm) list
7526 PureThy.all_thms_of: theory -> (string * thm) list
7528 * Pure: print_tac now outputs the goal through the trace channel.
7530 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7531 Reference Toplevel.debug (default false) controls detailed printing
7532 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7533 controls execution profiling -- set to 1 for time and 2 for space
7534 (both increase the runtime).
7536 * Isar session: The initial use of ROOT.ML is now always timed,
7537 i.e. the log will show the actual process times, in contrast to the
7538 elapsed wall-clock time that the outer shell wrapper produces.
7540 * Simplifier: improved handling of bound variables (nameless
7541 representation, avoid allocating new strings). Simprocs that invoke
7542 the Simplifier recursively should use Simplifier.inherit_bounds to
7543 avoid local name clashes. Failure to do so produces warnings
7544 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7545 for further details.
7547 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7548 bindings for all theorems stored within a given theory; this may help
7549 in porting non-Isar theories to Isar ones, while keeping ML proof
7550 scripts for the time being.
7552 * ML operator HTML.with_charset specifies the charset begin used for
7553 generated HTML files. For example:
7555 HTML.with_charset "utf-8" use_thy "Hebrew";
7556 HTML.with_charset "utf-8" use_thy "Chinese";
7561 * Allow symlinks to all proper Isabelle executables (Isabelle,
7562 isabelle, isatool etc.).
7564 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7565 isatool doc, isatool mkdir, display_drafts etc.).
7567 * isatool usedir: option -f allows specification of the ML file to be
7568 used by Isabelle; default is ROOT.ML.
7570 * New isatool version outputs the version identifier of the Isabelle
7571 distribution being used.
7573 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7574 (containing Boolean satisfiability problems) into Isabelle/HOL
7579 New in Isabelle2004 (April 2004)
7580 --------------------------------
7584 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7585 Replaces linorder.ML.
7587 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7588 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7589 (\<a>...\<z>), are now considered normal letters, and can therefore
7590 be used anywhere where an ASCII letter (a...zA...Z) has until
7591 now. COMPATIBILITY: This obviously changes the parsing of some
7592 terms, especially where a symbol has been used as a binder, say
7593 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
7594 as an identifier. Fix it by inserting a space around former
7595 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
7596 existing theory and ML files.
7598 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
7600 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
7601 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
7602 a normal (but invisible) letter. For multiple letter subscripts repeat
7603 \<^isub> like this: x\<^isub>1\<^isub>2.
7605 * Pure: There are now sub-/superscripts that can span more than one
7606 character. Text between \<^bsub> and \<^esub> is set in subscript in
7607 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
7608 superscript. The new control characters are not identifier parts.
7610 * Pure: Control-symbols of the form \<^raw:...> will literally print the
7611 content of "..." to the latex file instead of \isacntrl... . The "..."
7612 may consist of any printable characters excluding the end bracket >.
7614 * Pure: Using new Isar command "finalconsts" (or the ML functions
7615 Theory.add_finals or Theory.add_finals_i) it is now possible to
7616 declare constants "final", which prevents their being given a definition
7617 later. It is useful for constants whose behaviour is fixed axiomatically
7618 rather than definitionally, such as the meta-logic connectives.
7620 * Pure: 'instance' now handles general arities with general sorts
7621 (i.e. intersections of classes),
7623 * Presentation: generated HTML now uses a CSS style sheet to make layout
7624 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
7625 It can be changed to alter the colors/layout of generated pages.
7630 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
7631 cut_tac, subgoal_tac and thin_tac:
7632 - Now understand static (Isar) contexts. As a consequence, users of Isar
7633 locales are no longer forced to write Isar proof scripts.
7634 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
7636 - INCOMPATIBILITY: names of variables to be instantiated may no
7637 longer be enclosed in quotes. Instead, precede variable name with `?'.
7638 This is consistent with the instantiation attribute "where".
7640 * Attributes "where" and "of":
7641 - Now take type variables of instantiated theorem into account when reading
7642 the instantiation string. This fixes a bug that caused instantiated
7643 theorems to have too special types in some circumstances.
7644 - "where" permits explicit instantiations of type variables.
7646 * Calculation commands "moreover" and "also" no longer interfere with
7647 current facts ("this"), admitting arbitrary combinations with "then"
7651 - Goal statements involving the context element "includes" no longer
7652 generate theorems with internal delta predicates (those ending on
7653 "_axioms") in the premise.
7654 Resolve particular premise with <locale>.intro to obtain old form.
7655 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
7656 specification and "includes" elements in goal statement.
7657 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
7658 [intro?] and [elim?] (respectively) by default.
7659 - Experimental command for instantiation of locales in proof contexts:
7660 instantiate <label>[<attrs>]: <loc>
7661 Instantiates locale <loc> and adds all its theorems to the current context
7662 taking into account their attributes. Label and attrs are optional
7663 modifiers, like in theorem declarations. If present, names of
7664 instantiated theorems are qualified with <label>, and the attributes
7665 <attrs> are applied after any attributes these theorems might have already.
7666 If the locale has assumptions, a chained fact of the form
7667 "<loc> t1 ... tn" is expected from which instantiations of the parameters
7668 are derived. The command does not support old-style locales declared
7669 with "locale (open)".
7670 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
7672 * HOL: Tactic emulation methods induct_tac and case_tac understand static
7678 * Proof import: new image HOL4 contains the imported library from
7679 the HOL4 system with about 2500 theorems. It is imported by
7680 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
7681 can be used like any other Isabelle image. See
7682 HOL/Import/HOL/README for more information.
7685 - Much improved handling of linear and partial orders.
7686 Reasoners for linear and partial orders are set up for type classes
7687 "linorder" and "order" respectively, and are added to the default simpset
7688 as solvers. This means that the simplifier can build transitivity chains
7689 to solve goals from the assumptions.
7690 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
7691 of blast or auto after simplification become unnecessary because the goal
7692 is solved by simplification already.
7694 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
7695 all proved in axiomatic type classes for semirings, rings and fields.
7698 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
7699 now formalized using the Ring_and_Field theory mentioned above.
7700 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
7701 than before, because now they are set up once in a generic manner.
7702 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
7703 Look for the general versions in Ring_and_Field (and Power if they concern
7706 * Type "rat" of the rational numbers is now available in HOL-Complex.
7709 - Record types are now by default printed with their type abbreviation
7710 instead of the list of all field types. This can be configured via
7711 the reference "print_record_type_abbr".
7712 - Simproc "record_upd_simproc" for simplification of multiple updates added
7713 (not enabled by default).
7714 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
7715 EX x. x = sel r to True (not enabled by default).
7716 - Tactic "record_split_simp_tac" to split and simplify records added.
7718 * 'specification' command added, allowing for definition by
7719 specification. There is also an 'ax_specification' command that
7720 introduces the new constants axiomatically.
7722 * arith(_tac) is now able to generate counterexamples for reals as well.
7724 * HOL-Algebra: new locale "ring" for non-commutative rings.
7726 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
7727 definitions, thanks to Sava Krsti\'{c} and John Matthews.
7729 * HOL-Matrix: a first theory for matrices in HOL with an application of
7730 matrix theory to linear programming.
7732 * Unions and Intersections:
7733 The latex output syntax of UN and INT has been changed
7734 from "\Union x \in A. B" to "\Union_{x \in A} B"
7735 i.e. the index formulae has become a subscript.
7736 Similarly for "\Union x. B", and for \Inter instead of \Union.
7738 * Unions and Intersections over Intervals:
7739 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
7740 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
7741 like in normal math, and corresponding versions for < and for intersection.
7743 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
7744 lexicographic dictonary ordering has been added as "lexord".
7746 * ML: the legacy theory structures Int and List have been removed. They had
7747 conflicted with ML Basis Library structures having the same names.
7749 * 'refute' command added to search for (finite) countermodels. Only works
7750 for a fragment of HOL. The installation of an external SAT solver is
7751 highly recommended. See "HOL/Refute.thy" for details.
7753 * 'quickcheck' command: Allows to find counterexamples by evaluating
7754 formulae under an assignment of free variables to random values.
7755 In contrast to 'refute', it can deal with inductive datatypes,
7756 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
7762 * Streams now come with concatenation and are part of the HOLCF image
7766 New in Isabelle2003 (May 2003)
7767 ------------------------------
7771 * Provers/simplifier:
7773 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
7774 Assumptions are now subject to complete mutual simplification,
7775 not just from left to right. The simplifier now preserves
7776 the order of assumptions.
7778 Potential INCOMPATIBILITY:
7780 -- simp sometimes diverges where the old version did
7781 not, e.g. invoking simp on the goal
7783 [| P (f x); y = x; f x = f y |] ==> Q
7785 now gives rise to the infinite reduction sequence
7787 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
7789 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
7792 -- Tactics combining classical reasoner and simplification (such as auto)
7793 are also affected by this change, because many of them rely on
7794 simp. They may sometimes diverge as well or yield a different numbers
7795 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
7796 in case of problems. Sometimes subsequent calls to the classical
7797 reasoner will fail because a preceeding call to the simplifier too
7798 eagerly simplified the goal, e.g. deleted redundant premises.
7800 - The simplifier trace now shows the names of the applied rewrite rules
7802 - You can limit the number of recursive invocations of the simplifier
7803 during conditional rewriting (where the simplifie tries to solve the
7804 conditions before applying the rewrite rule):
7805 ML "simp_depth_limit := n"
7806 where n is an integer. Thus you can force termination where previously
7807 the simplifier would diverge.
7809 - Accepts free variables as head terms in congruence rules. Useful in Isar.
7811 - No longer aborts on failed congruence proof. Instead, the
7812 congruence is ignored.
7814 * Pure: New generic framework for extracting programs from constructive
7815 proofs. See HOL/Extraction.thy for an example instantiation, as well
7816 as HOL/Extraction for some case studies.
7818 * Pure: The main goal of the proof state is no longer shown by default, only
7819 the subgoals. This behaviour is controlled by a new flag.
7820 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
7821 (ML: Proof.show_main_goal).
7823 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
7824 rules whose conclusion matches subgoal 1:
7825 PG menu: Isabelle/Isar -> Show me -> matching rules
7826 The rules are ordered by how closely they match the subgoal.
7827 In particular, rules that solve a subgoal outright are displayed first
7828 (or rather last, the way they are printed).
7829 (ML: ProofGeneral.print_intros())
7831 * Pure: New flag trace_unify_fail causes unification to print
7832 diagnostic information (PG: in trace buffer) when it fails. This is
7833 useful for figuring out why single step proofs like rule, erule or
7836 * Pure: Locale specifications now produce predicate definitions
7837 according to the body of text (covering assumptions modulo local
7838 definitions); predicate "loc_axioms" covers newly introduced text,
7839 while "loc" is cumulative wrt. all included locale expressions; the
7840 latter view is presented only on export into the global theory
7841 context; potential INCOMPATIBILITY, use "(open)" option to fall back
7842 on the old view without predicates;
7844 * Pure: predefined locales "var" and "struct" are useful for sharing
7845 parameters (as in CASL, for example); just specify something like
7846 ``var x + var y + struct M'' as import;
7848 * Pure: improved thms_containing: proper indexing of facts instead of
7849 raw theorems; check validity of results wrt. current name space;
7850 include local facts of proof configuration (also covers active
7851 locales), cover fixed variables in index; may use "_" in term
7852 specification; an optional limit for the number of printed facts may
7853 be given (the default is 40);
7855 * Pure: disallow duplicate fact bindings within new-style theory files
7858 * Provers: improved induct method: assumptions introduced by case
7859 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
7860 the goal statement); "foo" still refers to all facts collectively;
7862 * Provers: the function blast.overloaded has been removed: all constants
7863 are regarded as potentially overloaded, which improves robustness in exchange
7864 for slight decrease in efficiency;
7866 * Provers/linorder: New generic prover for transitivity reasoning over
7867 linear orders. Note: this prover is not efficient!
7869 * Isar: preview of problems to finish 'show' now produce an error
7870 rather than just a warning (in interactive mode);
7877 - Produces a counter example if it cannot prove a goal.
7878 Note that the counter example may be spurious if the goal is not a formula
7879 of quantifier-free linear arithmetic.
7880 In ProofGeneral the counter example appears in the trace buffer.
7882 - Knows about div k and mod k where k is a numeral of type nat or int.
7884 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
7885 linear arithmetic fails. This takes account of quantifiers and divisibility.
7886 Presburger arithmetic can also be called explicitly via presburger(_tac).
7888 * simp's arithmetic capabilities have been enhanced a bit: it now
7889 takes ~= in premises into account (by performing a case split);
7891 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
7892 are distributed over a sum of terms;
7894 * New tactic "trans_tac" and method "trans" instantiate
7895 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
7898 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
7899 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
7901 * 'typedef' command has new option "open" to suppress the set
7904 * functions Min and Max on finite sets have been introduced (theory
7907 * attribute [symmetric] now works for relations as well; it turns
7908 (x,y) : R^-1 into (y,x) : R, and vice versa;
7910 * induct over a !!-quantified statement (say !!x1..xn):
7911 each "case" automatically performs "fix x1 .. xn" with exactly those names.
7913 * Map: `empty' is no longer a constant but a syntactic abbreviation for
7914 %x. None. Warning: empty_def now refers to the previously hidden definition
7917 * Algebra: formalization of classical algebra. Intended as base for
7918 any algebraic development in Isabelle. Currently covers group theory
7919 (up to Sylow's theorem) and ring theory (Universal Property of
7920 Univariate Polynomials). Contributions welcome;
7922 * GroupTheory: deleted, since its material has been moved to Algebra;
7924 * Complex: new directory of the complex numbers with numeric constants,
7925 nonstandard complex numbers, and some complex analysis, standard and
7926 nonstandard (Jacques Fleuriot);
7928 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
7930 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
7933 * Real/HahnBanach: updated and adapted to locales;
7935 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
7938 * UNITY: added the Meier-Sanders theory of progress sets;
7940 * MicroJava: bytecode verifier and lightweight bytecode verifier
7941 as abstract algorithms, instantiated to the JVM;
7943 * Bali: Java source language formalization. Type system, operational
7944 semantics, axiomatic semantics. Supported language features:
7945 classes, interfaces, objects,virtual methods, static methods,
7946 static/instance fields, arrays, access modifiers, definite
7947 assignment, exceptions.
7952 * ZF/Constructible: consistency proof for AC (Gdel's constructible
7955 * Main ZF: virtually all theories converted to new-style format;
7960 * Pure: Tactic.prove provides sane interface for internal proofs;
7961 omits the infamous "standard" operation, so this is more appropriate
7962 than prove_goalw_cterm in many situations (e.g. in simprocs);
7964 * Pure: improved error reporting of simprocs;
7966 * Provers: Simplifier.simproc(_i) provides sane interface for setting
7970 *** Document preparation ***
7972 * uses \par instead of \\ for line breaks in theory text. This may
7973 shift some page breaks in large documents. To get the old behaviour
7974 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
7976 * minimized dependencies of isabelle.sty and isabellesym.sty on
7979 * \<euro> now needs package babel/greek instead of marvosym (which
7982 * normal size for \<zero>...\<nine> (uses \mathbf instead of
7987 New in Isabelle2002 (March 2002)
7988 --------------------------------
7990 *** Document preparation ***
7992 * greatly simplified document preparation setup, including more
7993 graceful interpretation of isatool usedir -i/-d/-D options, and more
7994 instructive isatool mkdir; users should basically be able to get
7995 started with "isatool mkdir HOL Test && isatool make"; alternatively,
7996 users may run a separate document processing stage manually like this:
7997 "isatool usedir -D output HOL Test && isatool document Test/output";
7999 * theory dependency graph may now be incorporated into documents;
8000 isatool usedir -g true will produce session_graph.eps/.pdf for use
8001 with \includegraphics of LaTeX;
8003 * proper spacing of consecutive markup elements, especially text
8004 blocks after section headings;
8006 * support bold style (for single symbols only), input syntax is like
8007 this: "\<^bold>\<alpha>" or "\<^bold>A";
8009 * \<bullet> is now output as bold \cdot by default, which looks much
8010 better in printed text;
8012 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8013 note that these symbols are currently unavailable in Proof General /
8014 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8016 * isatool latex no longer depends on changed TEXINPUTS, instead
8017 isatool document copies the Isabelle style files to the target
8023 * Pure/Provers: improved proof by cases and induction;
8024 - 'case' command admits impromptu naming of parameters (such as
8026 - 'induct' method divinates rule instantiation from the inductive
8027 claim; no longer requires excessive ?P bindings for proper
8028 instantiation of cases;
8029 - 'induct' method properly enumerates all possibilities of set/type
8030 rules; as a consequence facts may be also passed through *type*
8031 rules without further ado;
8032 - 'induct' method now derives symbolic cases from the *rulified*
8033 rule (before it used to rulify cases stemming from the internal
8034 atomized version); this means that the context of a non-atomic
8035 statement becomes is included in the hypothesis, avoiding the
8036 slightly cumbersome show "PROP ?case" form;
8037 - 'induct' may now use elim-style induction rules without chaining
8038 facts, using ``missing'' premises from the goal state; this allows
8039 rules stemming from inductive sets to be applied in unstructured
8040 scripts, while still benefitting from proper handling of non-atomic
8041 statements; NB: major inductive premises need to be put first, all
8042 the rest of the goal is passed through the induction;
8043 - 'induct' proper support for mutual induction involving non-atomic
8044 rule statements (uses the new concept of simultaneous goals, see
8046 - append all possible rule selections, but only use the first
8047 success (no backtracking);
8048 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8049 - undeclared rule case names default to numbers 1, 2, 3, ...;
8050 - added 'print_induct_rules' (covered by help item in recent Proof
8052 - moved induct/cases attributes to Pure, methods to Provers;
8053 - generic method setup instantiated for FOL and HOL;
8055 * Pure: support multiple simultaneous goal statements, for example
8056 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8057 meta-level mechanism, this acts as if several individual goals had
8058 been stated separately; in particular common proof methods need to be
8059 repeated in order to cover all claims; note that a single elimination
8060 step is *not* sufficient to establish the two conjunctions, so this
8063 assume "A & B" then have A and B .. (*".." fails*)
8065 better use "obtain" in situations as above; alternative refer to
8066 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8068 * Pure: proper integration with ``locales''; unlike the original
8069 version by Florian Kammller, Isar locales package high-level proof
8070 contexts rather than raw logical ones (e.g. we admit to include
8071 attributes everywhere); operations on locales include merge and
8072 rename; support for implicit arguments (``structures''); simultaneous
8073 type-inference over imports and text; see also HOL/ex/Locales.thy for
8076 * Pure: the following commands have been ``localized'', supporting a
8077 target locale specification "(in name)": 'lemma', 'theorem',
8078 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8079 stored both within the locale and at the theory level (exported and
8080 qualified by the locale name);
8082 * Pure: theory goals may now be specified in ``long'' form, with
8083 ad-hoc contexts consisting of arbitrary locale elements. for example
8084 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8085 definitions may be given, too); the result is a meta-level rule with
8086 the context elements being discharged in the obvious way;
8088 * Pure: new proof command 'using' allows to augment currently used
8089 facts after a goal statement ('using' is syntactically analogous to
8090 'apply', but acts on the goal's facts only); this allows chained facts
8091 to be separated into parts given before and after a claim, as in
8092 ``from a and b have C using d and e <proof>'';
8094 * Pure: renamed "antecedent" case to "rule_context";
8096 * Pure: new 'judgment' command records explicit information about the
8097 object-logic embedding (used by several tools internally); no longer
8098 use hard-wired "Trueprop";
8100 * Pure: added 'corollary' command;
8102 * Pure: fixed 'token_translation' command;
8104 * Pure: removed obsolete 'exported' attribute;
8106 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8107 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8108 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8110 * Pure: method 'atomize' presents local goal premises as object-level
8111 statements (atomic meta-level propositions); setup controlled via
8112 rewrite rules declarations of 'atomize' attribute; example
8113 application: 'induct' method with proper rule statements in improper
8116 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8117 now consider the syntactic context of assumptions, giving a better
8118 chance to get type-inference of the arguments right (this is
8119 especially important for locales);
8121 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8124 * Pure/obtain: the formal conclusion "thesis", being marked as
8125 ``internal'', may no longer be reference directly in the text;
8126 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8129 * Pure: generic 'sym' attribute which declares a rule both as pure
8130 'elim?' and for the 'symmetric' operation;
8132 * Pure: marginal comments ``--'' may now occur just anywhere in the
8133 text; the fixed correlation with particular command syntax has been
8136 * Pure: new method 'rules' is particularly well-suited for proof
8137 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8138 but often produces more compact proof terms with less detours;
8140 * Pure/Provers/classical: simplified integration with pure rule
8141 attributes and methods; the classical "intro?/elim?/dest?"
8142 declarations coincide with the pure ones; the "rule" method no longer
8143 includes classically swapped intros; "intro" and "elim" methods no
8144 longer pick rules from the context; also got rid of ML declarations
8145 AddXIs/AddXEs/AddXDs; all of this has some potential for
8148 * Provers/classical: attribute 'swapped' produces classical inversions
8149 of introduction rules;
8151 * Provers/simplifier: 'simplified' attribute may refer to explicit
8152 rules instead of full simplifier context; 'iff' attribute handles
8155 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8157 * HOL: 'recdef' now fails on unfinished automated proofs, use
8158 "(permissive)" option to recover old behavior;
8160 * HOL: 'inductive' no longer features separate (collective) attributes
8161 for 'intros' (was found too confusing);
8163 * HOL: properly declared induction rules less_induct and
8169 * HOL: moved over to sane numeral syntax; the new policy is as
8172 - 0 and 1 are polymorphic constants, which are defined on any
8173 numeric type (nat, int, real etc.);
8175 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8176 binary representation internally;
8178 - type nat has special constructor Suc, and generally prefers Suc 0
8179 over 1::nat and Suc (Suc 0) over 2::nat;
8181 This change may cause significant problems of INCOMPATIBILITY; here
8182 are some hints on converting existing sources:
8184 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8185 entities, so expressions involving "-" (unary or binary minus) need
8186 to be spaced properly;
8188 - existing occurrences of "1" may need to be constraint "1::nat" or
8189 even replaced by Suc 0; similar for old "2";
8191 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8193 - remove all special provisions on numerals in proofs;
8195 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8196 representation (depends on bin_arith_simps in the default context);
8198 * HOL: symbolic syntax for x^2 (numeral 2);
8200 * HOL: the class of all HOL types is now called "type" rather than
8201 "term"; INCOMPATIBILITY, need to adapt references to this type class
8202 in axclass/classes, instance/arities, and (usually rare) occurrences
8203 in typings (of consts etc.); internally the class is called
8204 "HOL.type", ML programs should refer to HOLogic.typeS;
8206 * HOL/record package improvements:
8207 - new derived operations "fields" to build a partial record section,
8208 "extend" to promote a fixed record to a record scheme, and
8209 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8210 declared as simp by default;
8211 - shared operations ("more", "fields", etc.) now need to be always
8212 qualified) --- potential INCOMPATIBILITY;
8213 - removed "make_scheme" operations (use "make" with "extend") --
8215 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8216 - provides cases/induct rules for use with corresponding Isar
8217 methods (for concrete records, record schemes, concrete more
8218 parts, and schematic more parts -- in that order);
8219 - internal definitions directly based on a light-weight abstract
8220 theory of product types over typedef rather than datatype;
8222 * HOL: generic code generator for generating executable ML code from
8223 specifications; specific support for HOL constructs such as inductive
8224 datatypes and sets, as well as recursive functions; can be invoked
8225 via 'generate_code' theory section;
8227 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8229 * HOL: consolidated and renamed several theories. In particular:
8230 Ord.thy has been absorbed into HOL.thy
8231 String.thy has been absorbed into List.thy
8233 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8234 (beware of argument permutation!);
8236 * HOL: linorder_less_split superseded by linorder_cases;
8238 * HOL/List: "nodups" renamed to "distinct";
8240 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8241 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8242 - Ex_def has changed, now need to use some_eq_ex
8244 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8245 in this (rare) case use:
8247 delSWrapper "split_all_tac"
8248 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8250 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8253 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8254 Isabelle's type classes, ^ on functions and relations has too general
8255 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8256 necessary to attach explicit type constraints;
8258 * HOL/Relation: the prefix name of the infix "O" has been changed from
8259 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8260 renamed accordingly (eg "compI" -> "rel_compI").
8262 * HOL: syntax translations now work properly with numerals and records
8265 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8266 of "lam" -- INCOMPATIBILITY;
8268 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8269 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8270 renamed "Product_Type.unit";
8272 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8274 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8275 the "cases" method);
8277 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8280 * HOL/IMP: updated and converted to new-style theory format; several
8281 parts turned into readable document, with proper Isar proof texts and
8282 some explanations (by Gerwin Klein);
8284 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8286 * HOL-Hyperreal is now a logic image;
8291 * Isar: consts/constdefs supports mixfix syntax for continuous
8294 * Isar: domain package adapted to new-style theory format, e.g. see
8297 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8298 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8299 lift.induct_tac, always use UU instead of Undef;
8301 * HOLCF/IMP: updated and converted to new-style theory;
8306 * Isar: proper integration of logic-specific tools and packages,
8307 including theory commands '(co)inductive', '(co)datatype',
8308 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8309 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8311 * theory Main no longer includes AC; for the Axiom of Choice, base
8312 your theory on Main_ZFC;
8314 * the integer library now covers quotients and remainders, with many
8315 laws relating division to addition, multiplication, etc.;
8317 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8318 typeless version of the formalism;
8320 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8323 * ZF/Induct: new directory for examples of inductive definitions,
8324 including theory Multiset for multiset orderings; converted to
8325 new-style theory format;
8327 * ZF: many new theorems about lists, ordinals, etc.;
8332 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8333 variable proof controls level of detail: 0 = no proofs (only oracle
8334 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8335 also ref manual for further ML interfaces;
8337 * Pure/axclass: removed obsolete ML interface
8338 goal_subclass/goal_arity;
8340 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8341 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8342 separate tokens, so expressions involving minus need to be spaced
8345 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8346 rather than "infixl" or "infixr";
8348 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8349 sort constraint specifications in type inference; e.g. "x::_::foo"
8350 ensures that the type of "x" is of sort "foo" (but not necessarily a
8353 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8354 control output of nested => (types); the default behavior is
8357 * Pure/syntax: builtin parse translation for "_constify" turns valued
8358 tokens into AST constants;
8360 * Pure/syntax: prefer later declarations of translations and print
8361 translation functions; potential INCOMPATIBILITY: need to reverse
8362 multiple declarations for same syntax element constant;
8364 * Pure/show_hyps reset by default (in accordance to existing Isar
8367 * Provers/classical: renamed addaltern to addafter, addSaltern to
8370 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8373 * system: tested support for MacOS X; should be able to get Isabelle +
8374 Proof General to work in a plain Terminal after installing Poly/ML
8375 (e.g. from the Isabelle distribution area) and GNU bash alone
8376 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8377 support requires further installations, e.g. from
8378 http://fink.sourceforge.net/);
8380 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8382 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8383 of 40 MB), cf. ML_OPTIONS;
8385 * system: Proof General keywords specification is now part of the
8386 Isabelle distribution (see etc/isar-keywords.el);
8388 * system: support for persistent Proof General sessions (refrain from
8389 outdating all loaded theories on startup); user may create writable
8390 logic images like this: ``isabelle -q HOL Test'';
8392 * system: smart selection of Isabelle process versus Isabelle
8393 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8394 run both "isabelle" and "Isabelle" even if file names are badly
8395 damaged (executable inspects the case of the first letter of its own
8396 name); added separate "isabelle-process" and "isabelle-interface";
8398 * system: refrain from any attempt at filtering input streams; no
8399 longer support ``8bit'' encoding of old isabelle font, instead proper
8400 iso-latin characters may now be used; the related isatools
8401 "symbolinput" and "nonascii" have disappeared as well;
8403 * system: removed old "xterm" interface (the print modes "xterm" and
8404 "xterm_color" are still available for direct use in a suitable
8409 New in Isabelle99-2 (February 2001)
8410 -----------------------------------
8412 *** Overview of INCOMPATIBILITIES ***
8414 * HOL: please note that theories in the Library and elsewhere often use the
8415 new-style (Isar) format; to refer to their theorems in an ML script you must
8416 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8418 * HOL: inductive package no longer splits induction rule aggressively,
8419 but only as far as specified by the introductions given; the old
8420 format may be recovered via ML function complete_split_rule or attribute
8421 'split_rule (complete)';
8423 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8424 gfp_Tarski to gfp_unfold;
8426 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8428 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8429 relation); infix "^^" has been renamed "``"; infix "``" has been
8430 renamed "`"; "univalent" has been renamed "single_valued";
8432 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8435 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8437 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8439 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8440 consequence, it is no longer monotonic wrt. the local goal context
8441 (which is now passed through the inductive cases);
8443 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8444 \<gg> to \<ggreater>;
8447 *** Document preparation ***
8449 * \isabellestyle{NAME} selects version of Isabelle output (currently
8450 available: are "it" for near math-mode best-style output, "sl" for
8451 slanted text style, and "tt" for plain type-writer; if no
8452 \isabellestyle command is given, output is according to slanted
8455 * support sub/super scripts (for single symbols only), input syntax is
8456 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8458 * some more standard symbols; see Appendix A of the system manual for
8459 the complete list of symbols defined in isabellesym.sty;
8461 * improved isabelle style files; more abstract symbol implementation
8462 (should now use \isamath{...} and \isatext{...} in custom symbol
8465 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8466 state; Note that presentation of goal states does not conform to
8467 actual human-readable proof documents. Please do not include goal
8468 states into document output unless you really know what you are doing!
8470 * proper indentation of antiquoted output with proportional LaTeX
8473 * no_document ML operator temporarily disables LaTeX document
8476 * isatool unsymbolize tunes sources for plain ASCII communication;
8481 * Pure: Isar now suffers initial goal statements to contain unbound
8482 schematic variables (this does not conform to actual readable proof
8483 documents, due to unpredictable outcome and non-compositional proof
8484 checking); users who know what they are doing may use schematic goals
8485 for Prolog-style synthesis of proven results;
8487 * Pure: assumption method (an implicit finishing) now handles actual
8490 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8491 initial goal, declare "that" only as Pure intro (only for single
8492 steps); the "that" rule assumption may now be involved in implicit
8493 finishing, thus ".." becomes a feasible for trivial obtains;
8495 * Pure: default proof step now includes 'intro_classes'; thus trivial
8496 instance proofs may be performed by "..";
8498 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8501 * Pure: more robust selection of calculational rules;
8503 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8504 rule (as well as the assumption rule);
8506 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8507 lemmas, using the graph browser tool;
8509 * Pure: predict failure of "show" in interactive mode;
8511 * Pure: 'thms_containing' now takes actual terms as arguments;
8513 * HOL: improved method 'induct' --- now handles non-atomic goals
8514 (potential INCOMPATIBILITY); tuned error handling;
8516 * HOL: cases and induct rules now provide explicit hints about the
8517 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8518 any remaining facts are inserted into the goal verbatim;
8520 * HOL: local contexts (aka cases) may now contain term bindings as
8521 well; the 'cases' and 'induct' methods new provide a ?case binding for
8522 the result to be shown in each case;
8524 * HOL: added 'recdef_tc' command;
8526 * isatool convert assists in eliminating legacy ML scripts;
8531 * HOL/Library: a collection of generic theories to be used together
8532 with main HOL; the theory loader path already includes this directory
8533 by default; the following existing theories have been moved here:
8534 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8535 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8537 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8538 modelling and verification task performed in Isabelle/HOL +
8539 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8541 * HOL/Algebra: special summation operator SUM no longer exists, it has
8542 been replaced by setsum; infix 'assoc' now has priority 50 (like
8543 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8544 'domain', this makes the theory consistent with mathematical
8547 * HOL basics: added overloaded operations "inverse" and "divide"
8548 (infix "/"), syntax for generic "abs" operation, generic summation
8551 * HOL/typedef: simplified package, provide more useful rules (see also
8554 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8555 now expressed as a proper nested rule (old-style tactic scripts may
8556 require atomize_strip_tac to cope with non-atomic premises);
8558 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8559 to "split_conv" (old name still available for compatibility);
8561 * HOL: improved concrete syntax for strings (e.g. allows translation
8562 rules with string literals);
8564 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8565 and Fleuriot's mechanization of analysis, including the transcendental
8566 functions for the reals;
8568 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8573 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8574 "lam" is displayed as TWO lambda-symbols
8576 * CTT: theory Main now available, containing everything (that is, Bool
8582 * Pure: the Simplifier has been implemented properly as a derived rule
8583 outside of the actual kernel (at last!); the overall performance
8584 penalty in practical applications is about 50%, while reliability of
8585 the Isabelle inference kernel has been greatly improved;
8587 * print modes "brackets" and "no_brackets" control output of nested =>
8588 (types) and ==> (props); the default behaviour is "brackets";
8590 * Provers: fast_tac (and friends) now handle actual object-logic rules
8591 as assumptions as well;
8593 * system: support Poly/ML 4.0;
8595 * system: isatool install handles KDE version 1 or 2;
8599 New in Isabelle99-1 (October 2000)
8600 ----------------------------------
8602 *** Overview of INCOMPATIBILITIES ***
8604 * HOL: simplification of natural numbers is much changed; to partly
8605 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
8606 issue the following ML commands:
8608 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
8609 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
8611 * HOL: simplification no longer dives into case-expressions; this is
8612 controlled by "t.weak_case_cong" for each datatype t;
8614 * HOL: nat_less_induct renamed to less_induct;
8616 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
8617 fixsome to patch .thy and .ML sources automatically;
8619 select_equality -> some_equality
8620 select_eq_Ex -> some_eq_ex
8621 selectI2EX -> someI2_ex
8624 select1_equality -> some1_equality
8625 Eps_sym_eq -> some_sym_eq_trivial
8626 Eps_eq -> some_eq_trivial
8628 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
8630 * HOL: removed obsolete theorem binding expand_if (refer to split_if
8633 * HOL: the recursion equations generated by 'recdef' are now called
8634 f.simps instead of f.rules;
8636 * HOL: qed_spec_mp now also handles bounded ALL as well;
8638 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
8639 sometimes be needed;
8641 * HOL: the constant for "f``x" is now "image" rather than "op ``";
8643 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
8645 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
8646 product is now "<*>" instead of "Times"; the lexicographic product is
8647 now "<*lex*>" instead of "**";
8649 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
8650 of main HOL, but was unused); better use HOL's datatype package;
8652 * HOL: removed "symbols" syntax for constant "override" of theory Map;
8653 the old syntax may be recovered as follows:
8656 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
8657 (infixl "\\<oplus>" 100)
8659 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8661 * HOL/ML: even fewer consts are declared as global (see theories Ord,
8662 Lfp, Gfp, WF); this only affects ML packages that refer to const names
8665 * HOL and ZF: syntax for quotienting wrt an equivalence relation
8666 changed from A/r to A//r;
8668 * ZF: new treatment of arithmetic (nat & int) may break some old
8671 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
8672 rulify -> rule_format, elimify -> elim_format, ...);
8674 * Isar/Provers: intro/elim/dest attributes changed; renamed
8675 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
8676 should have to change intro!! to intro? only); replaced "delrule" by
8679 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
8681 * Provers: strengthened force_tac by using new first_best_tac;
8683 * LaTeX document preparation: several changes of isabelle.sty (see
8687 *** Document preparation ***
8689 * formal comments (text blocks etc.) in new-style theories may now
8690 contain antiquotations of thm/prop/term/typ/text to be presented
8691 according to latex print mode; concrete syntax is like this:
8692 @{term[show_types] "f(x) = a + x"};
8694 * isatool mkdir provides easy setup of Isabelle session directories,
8695 including proper document sources;
8697 * generated LaTeX sources are now deleted after successful run
8698 (isatool document -c); may retain a copy somewhere else via -D option
8701 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
8702 style files, achieving self-contained LaTeX sources and simplifying
8705 * old-style theories now produce (crude) LaTeX output as well;
8707 * browser info session directories are now self-contained (may be put
8708 on WWW server seperately); improved graphs of nested sessions; removed
8709 graph for 'all sessions';
8711 * several improvements in isabelle style files; \isabellestyle{it}
8712 produces fake math mode output; \isamarkupheader is now \section by
8713 default; see lib/texinputs/isabelle.sty etc.;
8718 * Isar/Pure: local results and corresponding term bindings are now
8719 subject to Hindley-Milner polymorphism (similar to ML); this
8720 accommodates incremental type-inference very nicely;
8722 * Isar/Pure: new derived language element 'obtain' supports
8723 generalized existence reasoning;
8725 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
8726 support accumulation of results, without applying any rules yet;
8727 useful to collect intermediate results without explicit name
8728 references, and for use with transitivity rules with more than 2
8731 * Isar/Pure: scalable support for case-analysis type proofs: new
8732 'case' language element refers to local contexts symbolically, as
8733 produced by certain proof methods; internally, case names are attached
8734 to theorems as "tags";
8736 * Isar/Pure: theory command 'hide' removes declarations from
8737 class/type/const name spaces;
8739 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
8740 indicate potential overloading;
8742 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
8744 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
8745 "{a,b,c}" instead of {a,b,c};
8747 * Isar/Pure now provides its own version of intro/elim/dest
8748 attributes; useful for building new logics, but beware of confusion
8749 with the version in Provers/classical;
8751 * Isar/Pure: the local context of (non-atomic) goals is provided via
8752 case name 'antecedent';
8754 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
8755 to the current context is now done automatically);
8757 * Isar/Pure: theory command 'method_setup' provides a simple interface
8758 for definining proof methods in ML;
8760 * Isar/Provers: intro/elim/dest attributes changed; renamed
8761 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
8762 most cases, one should have to change intro!! to intro? only);
8763 replaced "delrule" by "rule del";
8765 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
8766 'symmetric' attribute (the latter supercedes [RS sym]);
8768 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
8769 method modifier); 'simp' method: 'only:' modifier removes loopers as
8770 well (including splits);
8772 * Isar/Provers: Simplifier and Classical methods now support all kind
8773 of modifiers used in the past, including 'cong', 'iff', etc.
8775 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
8776 of Simplifier and Classical reasoner);
8778 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
8779 now support named cases; major packages (inductive, datatype, primrec,
8780 recdef) support case names and properly name parameters;
8782 * Isar/HOL: new transitivity rules for substitution in inequalities --
8783 monotonicity conditions are extracted to be proven at end of
8786 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
8789 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
8790 split_if split_if_asm; datatype package provides theorems foo.splits =
8791 foo.split foo.split_asm for each datatype;
8793 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
8794 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
8795 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
8796 use "(cases (simplified))" method in proper proof texts);
8798 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
8800 * Isar: names of theorems etc. may be natural numbers as well;
8802 * Isar: 'pr' command: optional arguments for goals_limit and
8803 ProofContext.prems_limit; no longer prints theory contexts, but only
8806 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
8807 additional print modes to be specified; e.g. "pr(latex)" will print
8808 proof state according to the Isabelle LaTeX style;
8810 * Isar: improved support for emulating tactic scripts, including proof
8811 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
8812 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
8813 (for HOL datatypes);
8815 * Isar: simplified (more robust) goal selection of proof methods: 1st
8816 goal, all goals, or explicit goal specifier (tactic emulation); thus
8817 'proof method scripts' have to be in depth-first order;
8819 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
8821 * Isar: removed 'help' command, which hasn't been too helpful anyway;
8822 should instead use individual commands for printing items
8823 (print_commands, print_methods etc.);
8825 * Isar: added 'nothing' --- the empty list of theorems;
8830 * HOL/MicroJava: formalization of a fragment of Java, together with a
8831 corresponding virtual machine and a specification of its bytecode
8832 verifier and a lightweight bytecode verifier, including proofs of
8833 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
8834 Cornelia Pusch (see also the homepage of project Bali at
8835 http://isabelle.in.tum.de/Bali/);
8837 * HOL/Algebra: new theory of rings and univariate polynomials, by
8840 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
8841 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
8844 * HOL/Lattice: fundamental concepts of lattice theory and order
8845 structures, including duals, properties of bounds versus algebraic
8846 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
8847 Theorem for complete lattices etc.; may also serve as a demonstration
8848 for abstract algebraic reasoning using axiomatic type classes, and
8849 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
8851 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
8854 * HOL/IMPP: extension of IMP with local variables and mutually
8855 recursive procedures, by David von Oheimb;
8857 * HOL/Lambda: converted into new-style theory and document;
8859 * HOL/ex/Multiquote: example of multiple nested quotations and
8860 anti-quotations -- basically a generalized version of de-Bruijn
8861 representation; very useful in avoiding lifting of operations;
8863 * HOL/record: added general record equality rule to simpset; fixed
8864 select-update simplification procedure to handle extended records as
8865 well; admit "r" as field name;
8867 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
8868 other numeric types and also as the identity of groups, rings, etc.;
8870 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
8871 Types nat and int belong to this axclass;
8873 * HOL: greatly improved simplification involving numerals of type nat, int, real:
8874 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
8875 i*j + k + j*#3*i simplifies to #4*(i*j) + k
8876 two terms #m*u and #n*u are replaced by #(m+n)*u
8877 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
8878 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
8879 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
8881 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
8882 powerful prover for predicate logic but knows nothing of clasets; see
8883 ex/mesontest.ML and ex/mesontest2.ML for example applications;
8885 * HOL: new version of "case_tac" subsumes both boolean case split and
8886 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
8887 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
8889 * HOL: simplification no longer dives into case-expressions: only the
8890 selector expression is simplified, but not the remaining arms; to
8891 enable full simplification of case-expressions for datatype t, you may
8892 remove t.weak_case_cong from the simpset, either globally (Delcongs
8893 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
8895 * HOL/recdef: the recursion equations generated by 'recdef' for
8896 function 'f' are now called f.simps instead of f.rules; if all
8897 termination conditions are proved automatically, these simplification
8898 rules are added to the simpset, as in primrec; rules may be named
8899 individually as well, resulting in a separate list of theorems for
8902 * HOL/While is a new theory that provides a while-combinator. It
8903 permits the definition of tail-recursive functions without the
8904 provision of a termination measure. The latter is necessary once the
8905 invariant proof rule for while is applied.
8907 * HOL: new (overloaded) notation for the set of elements below/above
8908 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
8910 * HOL: theorems impI, allI, ballI bound as "strip";
8912 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
8913 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
8914 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
8916 * HOL/Real: "rabs" replaced by overloaded "abs" function;
8918 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
8919 main HOL, but was unused);
8921 * HOL: fewer consts declared as global (e.g. have to refer to
8922 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
8924 * HOL: tuned AST representation of nested pairs, avoiding bogus output
8925 in case of overlap with user translations (e.g. judgements over
8926 tuples); (note that the underlying logical represenation is still
8932 * ZF: simplification automatically cancels common terms in arithmetic
8933 expressions over nat and int;
8935 * ZF: new treatment of nat to minimize type-checking: all operators
8936 coerce their operands to a natural number using the function natify,
8937 making the algebraic laws unconditional;
8939 * ZF: as above, for int: operators coerce their operands to an integer
8940 using the function intify;
8942 * ZF: the integer library now contains many of the usual laws for the
8943 orderings, including $<=, and monotonicity laws for $+ and $*;
8945 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
8948 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
8949 to the simplifier and classical reasoner simultaneously;
8954 * Provers: blast_tac now handles actual object-logic rules as
8955 assumptions; note that auto_tac uses blast_tac internally as well;
8957 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
8958 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
8960 * Provers: delrules now handles destruct rules as well (no longer need
8961 explicit make_elim);
8963 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
8964 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8965 use instead the strong form,
8966 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
8967 in HOL, FOL and ZF the function cla_make_elim will create such rules
8968 from destruct-rules;
8970 * Provers: Simplifier.easy_setup provides a fast path to basic
8971 Simplifier setup for new object-logics;
8973 * Pure: AST translation rules no longer require constant head on LHS;
8975 * Pure: improved name spaces: ambiguous output is qualified; support
8976 for hiding of names;
8978 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
8979 XSYMBOL_HOME; no longer need to do manual configuration in most
8982 * system: compression of ML heaps images may now be controlled via -c
8983 option of isabelle and isatool usedir (currently only observed by
8986 * system: isatool installfonts may handle X-Symbol fonts as well (very
8987 useful for remote X11);
8989 * system: provide TAGS file for Isabelle sources;
8991 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
8994 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
8995 timing flag supersedes proof_timing and Toplevel.trace;
8997 * ML: new combinators |>> and |>>> for incremental transformations
8998 with secondary results (e.g. certain theory extensions):
9000 * ML: PureThy.add_defs gets additional argument to indicate potential
9001 overloading (usually false);
9003 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9008 New in Isabelle99 (October 1999)
9009 --------------------------------
9011 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9013 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9014 are no longer simplified. (This allows the simplifier to unfold recursive
9015 functional programs.) To restore the old behaviour, declare
9017 Delcongs [if_weak_cong];
9019 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9022 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9024 * HOL/datatype: mutual_induct_tac no longer exists --
9025 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9027 * HOL/typedef: fixed type inference for representing set; type
9028 arguments now have to occur explicitly on the rhs as type constraints;
9030 * ZF: The con_defs part of an inductive definition may no longer refer
9031 to constants declared in the same theory;
9033 * HOL, ZF: the function mk_cases, generated by the inductive
9034 definition package, has lost an argument. To simplify its result, it
9035 uses the default simpset instead of a supplied list of theorems.
9037 * HOL/List: the constructors of type list are now Nil and Cons;
9039 * Simplifier: the type of the infix ML functions
9040 setSSolver addSSolver setSolver addSolver
9041 is now simpset * solver -> simpset where `solver' is a new abstract type
9042 for packaging solvers. A solver is created via
9043 mk_solver: string -> (thm list -> int -> tactic) -> solver
9044 where the string argument is only a comment.
9049 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9050 decision procedure for linear arithmetic. Currently it is used for
9051 types `nat', `int', and `real' in HOL (see below); it can, should and
9052 will be instantiated for other types and logics as well.
9054 * The simplifier now accepts rewrite rules with flexible heads, eg
9055 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9056 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9062 * New Isabelle/Isar subsystem provides an alternative to traditional
9063 tactical theorem proving; together with the ProofGeneral/isar user
9064 interface it offers an interactive environment for developing human
9065 readable proof documents (Isar == Intelligible semi-automated
9066 reasoning); for further information see isatool doc isar-ref,
9067 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9069 * improved and simplified presentation of theories: better HTML markup
9070 (including colors), graph views in several sizes; isatool usedir now
9071 provides a proper interface for user theories (via -P option); actual
9072 document preparation based on (PDF)LaTeX is available as well (for
9073 new-style theories only); see isatool doc system for more information;
9075 * native support for Proof General, both for classic Isabelle and
9078 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9079 using the graph browser tool;
9081 * Isabelle manuals now also available as PDF;
9083 * theory loader rewritten from scratch (may not be fully
9084 bug-compatible); old loadpath variable has been replaced by show_path,
9085 add_path, del_path, reset_path functions; new operations such as
9086 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9089 * improved isatool install: option -k creates KDE application icon,
9090 option -p DIR installs standalone binaries;
9092 * added ML_PLATFORM setting (useful for cross-platform installations);
9093 more robust handling of platform specific ML images for SML/NJ;
9095 * the settings environment is now statically scoped, i.e. it is never
9096 created again in sub-processes invoked from isabelle, isatool, or
9099 * path element specification '~~' refers to '$ISABELLE_HOME';
9101 * in locales, the "assumes" and "defines" parts may be omitted if
9104 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9107 * new print_mode "HTML";
9109 * new flag show_tags controls display of tags of theorems (which are
9110 basically just comments that may be attached by some tools);
9112 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9113 mode and goal output format:
9115 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9117 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9119 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9120 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9122 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9124 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9126 * function bind_thms stores lists of theorems (cf. bind_thm);
9128 * new shorthand tactics ftac, eatac, datac, fatac;
9130 * qed (and friends) now accept "" as result name; in that case the
9131 theorem is not stored, but proper checks and presentation of the
9134 * theorem database now also indexes constants "Trueprop", "all",
9135 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9140 ** HOL arithmetic **
9142 * There are now decision procedures for linear arithmetic over nat and
9145 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9146 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9147 are treated as atomic; subformulae not involving type `nat' or `int'
9148 are ignored; quantified subformulae are ignored unless they are
9149 positive universal or negative existential. The tactic has to be
9150 invoked by hand and can be a little bit slow. In particular, the
9151 running time is exponential in the number of occurrences of `min' and
9152 `max', and `-' on `nat'.
9154 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9155 (negated) (in)equalities among the premises and the conclusion into
9156 account (i.e. no compound formulae) and does not know about `min' and
9157 `max', and `-' on `nat'. It is fast and is used automatically by the
9160 NB: At the moment, these decision procedures do not cope with mixed
9161 nat/int formulae where the two parts interact, such as `m < n ==>
9164 * HOL/Numeral provides a generic theory of numerals (encoded
9165 efficiently as bit strings); setup for types nat/int/real is in place;
9166 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9167 int, existing theories and proof scripts may require a few additional
9170 * integer division and remainder can now be performed on constant
9173 * many properties of integer multiplication, division and remainder
9176 * An interface to the Stanford Validity Checker (SVC) is available through the
9177 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9178 are proved automatically. SVC must be installed separately, and its results
9179 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9180 invocation of the underlying oracle). For SVC see
9181 http://verify.stanford.edu/SVC
9183 * IsaMakefile: the HOL-Real target now builds an actual image;
9188 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9189 (in Isabelle/Isar) -- by Gertrud Bauer;
9191 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9192 analysis for assembly languages with subtypes;
9194 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9195 -- avoids syntactic ambiguities and treats state, transition, and
9196 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9197 changed syntax and (many) tactics;
9199 * HOL/inductive: Now also handles more general introduction rules such
9200 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9201 theorems are now maintained within the theory (maintained via the
9204 * HOL/datatype: Now also handles arbitrarily branching datatypes
9205 (using function types) such as
9207 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9209 * HOL/record: record_simproc (part of the default simpset) takes care
9210 of selectors applied to updated records; record_split_tac is no longer
9211 part of the default claset; update_defs may now be removed from the
9212 simpset in many cases; COMPATIBILITY: old behavior achieved by
9214 claset_ref () := claset() addSWrapper record_split_wrapper;
9215 Delsimprocs [record_simproc]
9217 * HOL/typedef: fixed type inference for representing set; type
9218 arguments now have to occur explicitly on the rhs as type constraints;
9220 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9221 names rather than an ML expression;
9223 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9224 supplied later. Program schemes can be defined, such as
9225 "While B C s = (if B s then While B C (C s) else s)"
9226 where the well-founded relation can be chosen after B and C have been given.
9228 * HOL/List: the constructors of type list are now Nil and Cons;
9229 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9230 course, ML tools referring to List.list.op # etc. have to be adapted;
9232 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9233 disabled by default; run isabelle with option -m HOL to get back to
9234 the original Gordon/HOL-style output;
9236 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9237 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9239 * HOL basic syntax simplified (more orthogonal): all variants of
9240 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9241 Eps operator is provided as well: "SOME x. P[x]";
9243 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9245 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9246 thus available for user theories;
9248 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9249 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9252 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9253 several times and then mp;
9258 * the notation <<...>> is now available as a notation for sequences of
9261 * the simplifier is now installed
9263 * the axiom system has been generalized (thanks to Soren Heilmann)
9265 * the classical reasoner now has a default rule database
9270 * new primrec section allows primitive recursive functions to be given
9271 directly (as in HOL) over datatypes and the natural numbers;
9273 * new tactics induct_tac and exhaust_tac for induction (or case
9274 analysis) over datatypes and the natural numbers;
9276 * the datatype declaration of type T now defines the recursor T_rec;
9278 * simplification automatically does freeness reasoning for datatype
9281 * automatic type-inference, with AddTCs command to insert new
9282 type-checking rules;
9284 * datatype introduction rules are now added as Safe Introduction rules
9287 * the syntax "if P then x else y" is now available in addition to
9291 *** Internal programming interfaces ***
9293 * tuned simplifier trace output; new flag debug_simp;
9295 * structures Vartab / Termtab (instances of TableFun) offer efficient
9296 tables indexed by indexname_ord / term_ord (compatible with aconv);
9298 * AxClass.axclass_tac lost the theory argument;
9300 * tuned current_goals_markers semantics: begin / end goal avoids
9301 printing empty lines;
9303 * removed prs and prs_fn hook, which was broken because it did not
9304 include \n in its semantics, forcing writeln to add one
9305 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9306 string -> unit if you really want to output text without newline;
9308 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9309 plain output, interface builders may have to enable 'isabelle_font'
9310 mode to get Isabelle font glyphs as before;
9312 * refined token_translation interface; INCOMPATIBILITY: output length
9313 now of type real instead of int;
9315 * theory loader actions may be traced via new ThyInfo.add_hook
9316 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9317 your own database of information attached to *whole* theories -- as
9318 opposed to intra-theory data slots offered via TheoryDataFun;
9320 * proper handling of dangling sort hypotheses (at last!);
9321 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9322 extra sort hypotheses that can be witnessed from the type signature;
9323 the force_strip_shyps flag is gone, any remaining shyps are simply
9324 left in the theorem (with a warning issued by strip_shyps_warning);
9328 New in Isabelle98-1 (October 1998)
9329 ----------------------------------
9331 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9333 * several changes of automated proof tools;
9335 * HOL: major changes to the inductive and datatype packages, including
9336 some minor incompatibilities of theory syntax;
9338 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9341 * HOL: removed duplicate thms in Arith:
9342 less_imp_add_less should be replaced by trans_less_add1
9343 le_imp_add_le should be replaced by trans_le_add1
9345 * HOL: unary minus is now overloaded (new type constraints may be
9348 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9349 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9350 now taken as an integer constant.
9352 * Pure: ML function 'theory_of' renamed to 'theory';
9358 1. Asm_full_simp_tac is now more aggressive.
9359 1. It will sometimes reorient premises if that increases their power to
9361 2. It does no longer proceed strictly from left to right but may also
9362 rotate premises to achieve further simplification.
9363 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9364 old Asm_full_simp_tac in that it does not rotate premises.
9365 2. The simplifier now knows a little bit about nat-arithmetic.
9367 * Classical reasoner: wrapper mechanism for the classical reasoner now
9368 allows for selected deletion of wrappers, by introduction of names for
9369 wrapper functionals. This implies that addbefore, addSbefore,
9370 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9371 and that adding two tactics with the same name overwrites the first
9372 one (emitting a warning).
9373 type wrapper = (int -> tactic) -> (int -> tactic)
9374 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9375 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9376 delWrapper, delSWrapper: claset * string -> claset
9377 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9379 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9380 semantics; addbefore now affects only the unsafe part of step_tac
9381 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9382 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9385 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9386 compWrapper; added safe wrapper (and access functions for it);
9388 * HOL/split_all_tac is now much faster and fails if there is nothing
9389 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9390 and the names of the automatically generated variables have changed.
9391 split_all_tac has moved within claset() from unsafe wrappers to safe
9392 wrappers, which means that !!-bound variables are split much more
9393 aggressively, and safe_tac and clarify_tac now split such variables.
9394 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9395 Note: the same holds for record_split_tac, which does the job of
9396 split_all_tac for record fields.
9398 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9399 permanently to the default simpset using Addsplits just like
9400 Addsimps. They can be removed via Delsplits just like
9401 Delsimps. Lower-case versions are also available.
9403 * HOL/Simplifier: The rule split_if is now part of the default
9404 simpset. This means that the simplifier will eliminate all occurrences
9405 of if-then-else in the conclusion of a goal. To prevent this, you can
9406 either remove split_if completely from the default simpset by
9407 `Delsplits [split_if]' or remove it in a specific call of the
9408 simplifier using `... delsplits [split_if]'. You can also add/delete
9409 other case splitting rules to/from the default simpset: every datatype
9410 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9411 t is the name of the datatype).
9413 * Classical reasoner / Simplifier combination: new force_tac (and
9414 derivatives Force_tac, force) combines rewriting and classical
9415 reasoning (and whatever other tools) similarly to auto_tac, but is
9416 aimed to solve the given subgoal completely.
9421 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9422 and `goalw': the theory is no longer needed as an explicit argument -
9423 the current theory context is used; assumptions are no longer returned
9424 at the ML-level unless one of them starts with ==> or !!; it is
9425 recommended to convert to these new commands using isatool fixgoal
9426 (backup your sources first!);
9428 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9429 the current theory context, and 'theory' to lookup stored theories;
9431 * new theory section 'locale' for declaring constants, assumptions and
9432 definitions that have local scope;
9434 * new theory section 'nonterminals' for purely syntactic types;
9436 * new theory section 'setup' for generic ML setup functions
9437 (e.g. package initialization);
9439 * the distribution now includes Isabelle icons: see
9440 lib/logo/isabelle-{small,tiny}.xpm;
9442 * isatool install - install binaries with absolute references to
9445 * isatool logo -- create instances of the Isabelle logo (as EPS);
9447 * print mode 'emacs' reserved for Isamode;
9449 * support multiple print (ast) translations per constant name;
9451 * theorems involving oracles are now printed with a suffixed [!];
9456 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9458 * HOL/inductive package reorganized and improved: now supports mutual
9464 oddI "n : EVEN ==> Suc n : ODD"
9465 evenI "n : ODD ==> Suc n : EVEN"
9467 new theorem list "elims" contains an elimination rule for each of the
9468 recursive sets; inductive definitions now handle disjunctive premises
9469 correctly (also ZF);
9471 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9472 "mutual_induct" no longer exists - the induction rule is always
9473 contained in "induct";
9476 * HOL/datatype package re-implemented and greatly improved: now
9477 supports mutually recursive datatypes such as
9480 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9481 | SUM ('a aexp) ('a aexp)
9482 | DIFF ('a aexp) ('a aexp)
9485 'a bexp = LESS ('a aexp) ('a aexp)
9486 | AND ('a bexp) ('a bexp)
9487 | OR ('a bexp) ('a bexp)
9489 as well as indirectly recursive datatypes such as
9492 ('a, 'b) term = Var 'a
9493 | App 'b ((('a, 'b) term) list)
9495 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9496 induction on mutually / indirectly recursive datatypes.
9498 Primrec equations are now stored in theory and can be accessed via
9499 <function_name>.simps.
9503 - Theories using datatypes must now have theory Datatype as an
9505 - The specific <typename>.induct_tac no longer exists - use the
9506 generic induct_tac instead.
9507 - natE has been renamed to nat.exhaust - use exhaust_tac
9508 instead of res_inst_tac ... natE. Note that the variable
9509 names in nat.exhaust differ from the names in natE, this
9510 may cause some "fragile" proofs to fail.
9511 - The theorems split_<typename>_case and split_<typename>_case_asm
9512 have been renamed to <typename>.split and <typename>.split_asm.
9513 - Since default sorts of type variables are now handled correctly,
9514 some datatype definitions may have to be annotated with explicit
9516 - Primrec definitions no longer require function name and type
9517 of recursive argument.
9519 Consider using isatool fixdatatype to adapt your theories and proof
9520 scripts to the new package (backup your sources first!).
9523 * HOL/record package: considerably improved implementation; now
9524 includes concrete syntax for record types, terms, updates; theorems
9525 for surjective pairing and splitting !!-bound record variables; proof
9526 support is as follows:
9528 1) standard conversions (selectors or updates applied to record
9529 constructor terms) are part of the standard simpset;
9531 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9532 made part of standard simpset and claset via addIffs;
9534 3) a tactic for record field splitting (record_split_tac) is part of
9535 the standard claset (addSWrapper);
9537 To get a better idea about these rules you may retrieve them via
9538 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9539 the name of your record type.
9541 The split tactic 3) conceptually simplifies by the following rule:
9543 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9545 Thus any record variable that is bound by meta-all will automatically
9546 blow up into some record constructor term, consequently the
9547 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9548 solve record problems automatically.
9551 * reorganized the main HOL image: HOL/Integ and String loaded by
9552 default; theory Main includes everything;
9554 * automatic simplification of integer sums and comparisons, using cancellation;
9556 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9558 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9560 * many new identities for unions, intersections, set difference, etc.;
9562 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9563 called split_if, split_split, split_sum_case and split_nat_case (to go
9564 with add/delsplits);
9566 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9567 (?x::unit) = (); this is made part of the default simpset, which COULD
9568 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9569 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9570 unit_abs_eta_conv is added in order to counter the effect of
9571 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9574 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9577 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9578 It and 'sym RS equals0D' are now in the default claset, giving automatic
9579 disjointness reasoning but breaking a few old proofs.
9581 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9582 to 'converse' from 'inverse' (for compatibility with ZF and some
9585 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9586 the well-founded relation;
9588 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9589 Compl A. The "Compl" syntax remains available as input syntax for this
9592 * HOL/Update: new theory of function updates:
9593 f(a:=b) == %x. if x=a then b else f x
9594 may also be iterated as in f(a:=b,c:=d,...);
9596 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
9599 - new function list_update written xs[i:=v] that updates the i-th
9600 list position. May also be iterated as in xs[i:=a,j:=b,...].
9601 - new function `upt' written [i..j(] which generates the list
9602 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
9603 bound write [i..j], which is a shorthand for [i..j+1(].
9604 - new lexicographic orderings and corresponding wellfoundedness theorems.
9607 - removed 'pred' (predecessor) function;
9608 - generalized some theorems about n-1;
9609 - many new laws about "div" and "mod";
9610 - new laws about greatest common divisors (see theory ex/Primes);
9612 * HOL/Relation: renamed the relational operator r^-1 "converse"
9613 instead of "inverse";
9615 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
9616 of the multiset ordering;
9618 * directory HOL/Real: a construction of the reals using Dedekind cuts
9619 (not included by default);
9621 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
9623 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
9624 programs, i.e. different program variables may have different types.
9626 * calling (stac rew i) now fails if "rew" has no effect on the goal
9627 [previously, this check worked only if the rewrite rule was unconditional]
9628 Now rew can involve either definitions or equalities (either == or =).
9633 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
9634 only the theorems proved on ZF.ML;
9636 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9637 It and 'sym RS equals0D' are now in the default claset, giving automatic
9638 disjointness reasoning but breaking a few old proofs.
9640 * ZF/Update: new theory of function updates
9641 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
9642 may also be iterated as in f(a:=b,c:=d,...);
9644 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
9646 * calling (stac rew i) now fails if "rew" has no effect on the goal
9647 [previously, this check worked only if the rewrite rule was unconditional]
9648 Now rew can involve either definitions or equalities (either == or =).
9650 * case_tac provided for compatibility with HOL
9651 (like the old excluded_middle_tac, but with subgoals swapped)
9654 *** Internal programming interfaces ***
9656 * Pure: several new basic modules made available for general use, see
9657 also src/Pure/README;
9659 * improved the theory data mechanism to support encapsulation (data
9660 kind name replaced by private Object.kind, acting as authorization
9661 key); new type-safe user interface via functor TheoryDataFun; generic
9662 print_data function becomes basically useless;
9664 * removed global_names compatibility flag -- all theory declarations
9665 are qualified by default;
9667 * module Pure/Syntax now offers quote / antiquote translation
9668 functions (useful for Hoare logic etc. with implicit dependencies);
9669 see HOL/ex/Antiquote for an example use;
9671 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
9674 * new tactical CHANGED_GOAL for checking that a tactic modifies a
9677 * Display.print_goals function moved to Locale.print_goals;
9679 * standard print function for goals supports current_goals_markers
9680 variable for marking begin of proof, end of proof, start of goal; the
9681 default is ("", "", ""); setting current_goals_markers := ("<proof>",
9682 "</proof>", "<goal>") causes SGML like tagged proof state printing,
9687 New in Isabelle98 (January 1998)
9688 --------------------------------
9690 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9692 * changed lexical syntax of terms / types: dots made part of long
9693 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
9695 * simpset (and claset) reference variable replaced by functions
9696 simpset / simpset_ref;
9698 * no longer supports theory aliases (via merge) and non-trivial
9699 implicit merge of thms' signatures;
9701 * most internal names of constants changed due to qualified names;
9703 * changed Pure/Sequence interface (see Pure/seq.ML);
9706 *** General Changes ***
9708 * hierachically structured name spaces (for consts, types, axms, thms
9709 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
9710 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
9711 isatool fixdots ensures space after dots (e.g. "%x. x"); set
9712 long_names for fully qualified output names; NOTE: ML programs
9713 (special tactics, packages etc.) referring to internal names may have
9714 to be adapted to cope with fully qualified names; in case of severe
9715 backward campatibility problems try setting 'global_names' at compile
9716 time to have enrything declared within a flat name space; one may also
9717 fine tune name declarations in theories via the 'global' and 'local'
9720 * reimplemented the implicit simpset and claset using the new anytype
9721 data filed in signatures; references simpset:simpset ref etc. are
9722 replaced by functions simpset:unit->simpset and
9723 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
9724 to patch your ML files accordingly;
9726 * HTML output now includes theory graph data for display with Java
9727 applet or isatool browser; data generated automatically via isatool
9728 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
9730 * defs may now be conditional; improved rewrite_goals_tac to handle
9731 conditional equations;
9733 * defs now admits additional type arguments, using TYPE('a) syntax;
9735 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
9736 creates a new theory node; implicit merge of thms' signatures is
9737 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
9738 transfer:theory->thm->thm in (rare) cases;
9740 * improved handling of draft signatures / theories; draft thms (and
9741 ctyps, cterms) are automatically promoted to real ones;
9743 * slightly changed interfaces for oracles: admit many per theory, named
9744 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
9746 * print_goals: optional output of const types (set show_consts and
9749 * improved output of warnings (###) and errors (***);
9751 * subgoal_tac displays a warning if the new subgoal has type variables;
9753 * removed old README and Makefiles;
9755 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
9757 * removed obsolete init_pps and init_database;
9759 * deleted the obsolete tactical STATE, which was declared by
9760 fun STATE tacfun st = tacfun st st;
9762 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
9763 (which abbreviates $HOME);
9765 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
9766 use isatool fixseq to adapt your ML programs (this works for fully
9767 qualified references to the Sequence structure only!);
9769 * use_thy no longer requires writable current directory; it always
9770 reloads .ML *and* .thy file, if either one is out of date;
9773 *** Classical Reasoner ***
9775 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
9776 tactics that use classical reasoning to simplify a subgoal without
9777 splitting it into several subgoals;
9779 * Safe_tac: like safe_tac but uses the default claset;
9784 * added simplification meta rules:
9785 (asm_)(full_)simplify: simpset -> thm -> thm;
9787 * simplifier.ML no longer part of Pure -- has to be loaded by object
9790 * added prems argument to simplification procedures;
9792 * HOL, FOL, ZF: added infix function `addsplits':
9793 instead of `<simpset> setloop (split_tac <thms>)'
9794 you can simply write `<simpset> addsplits <thms>'
9799 * TYPE('a) syntax for type reflection terms;
9801 * no longer handles consts with name "" -- declare as 'syntax' instead;
9803 * pretty printer: changed order of mixfix annotation preference (again!);
9805 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
9810 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
9811 with `addloop' of the simplifier to faciliate case splitting in premises.
9813 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
9815 * HOL/Auth: new protocol proofs including some for the Internet
9818 * HOL/Map: new theory of `maps' a la VDM;
9820 * HOL/simplifier: simplification procedures nat_cancel_sums for
9821 cancelling out common nat summands from =, <, <= (in)equalities, or
9822 differences; simplification procedures nat_cancel_factor for
9823 cancelling common factor from =, <, <= (in)equalities over natural
9824 sums; nat_cancel contains both kinds of procedures, it is installed by
9825 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
9827 * HOL/simplifier: terms of the form
9828 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
9830 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
9831 and those of the form
9832 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
9834 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
9837 Each datatype `t' now comes with a theorem `split_t_case' of the form
9839 P(t_case f1 ... fn x) =
9840 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
9842 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
9845 and a theorem `split_t_case_asm' of the form
9847 P(t_case f1 ... fn x) =
9848 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
9850 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
9852 which can be added to a simpset via `addsplits'. The existing theorems
9853 expand_list_case and expand_option_case have been renamed to
9854 split_list_case and split_option_case.
9857 - `pred n' is automatically converted to `n-1'.
9858 Users are strongly encouraged not to use `pred' any longer,
9859 because it will disappear altogether at some point.
9860 - Users are strongly encouraged to write "0 < n" rather than
9861 "n ~= 0". Theorems and proof tools have been modified towards this
9865 the function "set_of_list" has been renamed "set" (and its theorems too);
9866 the function "nth" now takes its arguments in the reverse order and
9867 has acquired the infix notation "!" as in "xs!n".
9869 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
9871 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
9872 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
9874 * HOL/record: extensible records with schematic structural subtyping
9875 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
9876 still lacks various theorems and concrete record syntax;
9881 * removed "axioms" and "generated by" sections;
9883 * replaced "ops" section by extended "consts" section, which is capable of
9884 handling the continuous function space "->" directly;
9887 . proves theorems immediately and stores them in the theory,
9888 . creates hierachical name space,
9889 . now uses normal mixfix annotations (instead of cinfix...),
9890 . minor changes to some names and values (for consistency),
9891 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
9892 . separator between mutual domain defs: changed "," to "and",
9893 . improved handling of sort constraints; now they have to
9894 appear on the left-hand side of the equations only;
9896 * fixed LAM <x,y,zs>.b syntax;
9898 * added extended adm_tac to simplifier in HOLCF -- can now discharge
9899 adm (%x. P (t x)), where P is chainfinite and t continuous;
9904 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
9905 with `addloop' of the simplifier to faciliate case splitting in premises.
9907 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
9908 in HOL, they strip ALL and --> from proved theorems;
9912 New in Isabelle94-8 (May 1997)
9913 ------------------------------
9915 *** General Changes ***
9917 * new utilities to build / run / maintain Isabelle etc. (in parts
9918 still somewhat experimental); old Makefiles etc. still functional;
9920 * new 'Isabelle System Manual';
9922 * INSTALL text, together with ./configure and ./build scripts;
9924 * reimplemented type inference for greater efficiency, better error
9925 messages and clean internal interface;
9927 * prlim command for dealing with lots of subgoals (an easier way of
9928 setting goals_limit);
9933 * supports alternative (named) syntax tables (parser and pretty
9934 printer); internal interface is provided by add_modesyntax(_i);
9936 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
9937 be used in conjunction with the Isabelle symbol font; uses the
9938 "symbols" syntax table;
9940 * added token_translation interface (may translate name tokens in
9941 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
9942 the current print_mode); IMPORTANT: user print translation functions
9943 are responsible for marking newly introduced bounds
9944 (Syntax.mark_boundT);
9946 * token translations for modes "xterm" and "xterm_color" that display
9947 names in bold, underline etc. or colors (which requires a color
9950 * infixes may now be declared with names independent of their syntax;
9952 * added typed_print_translation (like print_translation, but may
9953 access type of constant);
9956 *** Classical Reasoner ***
9958 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
9959 some limitations. Blast_tac...
9960 + ignores addss, addbefore, addafter; this restriction is intrinsic
9961 + ignores elimination rules that don't have the correct format
9962 (the conclusion MUST be a formula variable)
9963 + ignores types, which can make HOL proofs fail
9964 + rules must not require higher-order unification, e.g. apply_type in ZF
9965 [message "Function Var's argument not a bound variable" relates to this]
9966 + its proof strategy is more general but can actually be slower
9968 * substitution with equality assumptions no longer permutes other
9971 * minor changes in semantics of addafter (now called addaltern); renamed
9972 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
9973 (and access functions for it);
9975 * improved combination of classical reasoner and simplifier:
9976 + functions for handling clasimpsets
9977 + improvement of addss: now the simplifier is called _after_ the
9979 + safe variant of addss called addSss: uses safe simplifications
9980 _during_ the safe steps. It is more complete as it allows multiple
9981 instantiations of unknowns (e.g. with slow_tac).
9985 * added interface for simplification procedures (functions that
9986 produce *proven* rewrite rules on the fly, depending on current
9989 * ordering on terms as parameter (used for ordered rewriting);
9991 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
9993 * the solver is now split into a safe and an unsafe part.
9994 This should be invisible for the normal user, except that the
9995 functions setsolver and addsolver have been renamed to setSolver and
9996 addSolver; added safe_asm_full_simp_tac;
10001 * a generic induction tactic `induct_tac' which works for all datatypes and
10002 also for type `nat';
10004 * a generic case distinction tactic `exhaust_tac' which works for all
10005 datatypes and also for type `nat';
10007 * each datatype comes with a function `size';
10009 * patterns in case expressions allow tuple patterns as arguments to
10010 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10012 * primrec now also works with type nat;
10014 * recdef: a new declaration form, allows general recursive functions to be
10015 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10017 * the constant for negation has been renamed from "not" to "Not" to
10018 harmonize with FOL, ZF, LK, etc.;
10020 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10023 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10025 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10026 problems in commutative rings, using axiomatic type classes for + and *;
10028 * more examples in HOL/MiniML and HOL/Auth;
10030 * more default rewrite rules for quantifiers, union/intersection;
10032 * a new constant `arbitrary == @x.False';
10034 * HOLCF/IOA replaces old HOL/IOA;
10036 * HOLCF changes: derived all rules and arities
10037 + axiomatic type classes instead of classes
10038 + typedef instead of faking type definitions
10039 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10040 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10041 + eliminated the types void, one, tr
10042 + use unit lift and bool lift (with translations) instead of one and tr
10043 + eliminated blift from Lift3.thy (use Def instead of blift)
10044 all eliminated rules are derived as theorems --> no visible changes ;
10049 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10050 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10051 as ZF_cs addSIs [equalityI];
10055 New in Isabelle94-7 (November 96)
10056 ---------------------------------
10058 * allowing negative levels (as offsets) in prlev and choplev;
10060 * super-linear speedup for large simplifications;
10062 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10063 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10064 FAIL); can suppress it using the command Delsimps (ex_simps @
10065 all_simps); De Morgan laws are also now included, by default;
10067 * improved printing of ==> : ~:
10069 * new object-logic "Sequents" adds linear logic, while replacing LK
10070 and Modal (thanks to Sara Kalvala);
10072 * HOL/Auth: correctness proofs for authentication protocols;
10074 * HOL: new auto_tac combines rewriting and classical reasoning (many
10075 examples on HOL/Auth);
10077 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10078 the rewriter and classical reasoner simultaneously;
10080 * function uresult no longer returns theorems in "standard" format;
10081 regain previous version by: val uresult = standard o uresult;
10085 New in Isabelle94-6
10086 -------------------
10088 * oracles -- these establish an interface between Isabelle and trusted
10089 external reasoners, which may deliver results as theorems;
10091 * proof objects (in particular record all uses of oracles);
10093 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10095 * "constdefs" section in theory files;
10097 * "primrec" section (HOL) no longer requires names;
10099 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10103 New in Isabelle94-5
10104 -------------------
10106 * reduced space requirements;
10108 * automatic HTML generation from theories;
10110 * theory files no longer require "..." (quotes) around most types;
10112 * new examples, including two proofs of the Church-Rosser theorem;
10114 * non-curried (1994) version of HOL is no longer distributed;
10118 New in Isabelle94-4
10119 -------------------
10121 * greatly reduced space requirements;
10123 * theory files (.thy) no longer require \...\ escapes at line breaks;
10125 * searchable theorem database (see the section "Retrieving theorems" on
10126 page 8 of the Reference Manual);
10128 * new examples, including Grabczewski's monumental case study of the
10131 * The previous version of HOL renamed to Old_HOL;
10133 * The new version of HOL (previously called CHOL) uses a curried syntax
10134 for functions. Application looks like f a b instead of f(a,b);
10136 * Mutually recursive inductive definitions finally work in HOL;
10138 * In ZF, pattern-matching on tuples is now available in all abstractions and
10139 translates to the operator "split";
10143 New in Isabelle94-3
10144 -------------------
10146 * new infix operator, addss, allowing the classical reasoner to
10147 perform simplification at each step of its search. Example:
10148 fast_tac (cs addss ss)
10150 * a new logic, CHOL, the same as HOL, but with a curried syntax
10151 for functions. Application looks like f a b instead of f(a,b). Also pairs
10152 look like (a,b) instead of <a,b>;
10154 * PLEASE NOTE: CHOL will eventually replace HOL!
10156 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10157 It translates to the operator "split". A new theory of integers is available;
10159 * In ZF, integer numerals now denote two's-complement binary integers.
10160 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10162 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10163 of the Axiom of Choice;
10167 New in Isabelle94-2
10168 -------------------
10170 * Significantly faster resolution;
10172 * the different sections in a .thy file can now be mixed and repeated
10175 * Database of theorems for FOL, HOL and ZF. New
10176 commands including qed, qed_goal and bind_thm store theorems in the database.
10178 * Simple database queries: return a named theorem (get_thm) or all theorems of
10179 a given theory (thms_of), or find out what theory a theorem was proved in
10182 * Bugs fixed in the inductive definition and datatype packages;
10184 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10185 and HOL_dup_cs obsolete;
10187 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10190 * Simpler definition of function space in ZF;
10192 * new results about cardinal and ordinal arithmetic in ZF;
10194 * 'subtype' facility in HOL for introducing new types as subsets of existing
10197 :mode=text:wrap=hard:maxLineLen=72: