1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Simplified subscripts within identifiers, using plain \<^sub>
10 instead of the second copy \<^isub> and \<^isup>. Superscripts are
11 only for literal tokens within notation; explicit mixfix annotations
12 for consts or fixed variables may be used as fall-back for unusual
13 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
14 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
15 standardize symbols as a starting point for further manual cleanup.
16 The ML reference variable "legacy_isub_isup" may be set as temporary
17 workaround, to make the prover accept a subset of the old identifier
20 * Document antiquotations: term style "isub" has been renamed to
21 "sub". Minor INCOMPATIBILITY.
23 * Uniform management of "quick_and_dirty" as system option (see also
24 "isabelle options"), configuration option within the context (see also
25 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
26 INCOMPATIBILITY, need to use more official Isabelle means to access
27 quick_and_dirty, instead of historical poking into mutable reference.
29 * Renamed command 'print_configs' to 'print_options'. Minor
32 * Sessions may be organized via 'chapter' specifications in the ROOT
33 file, which determines a two-level hierarchy of browser info. The old
34 tree-like organization via implicit sub-session relation, with its
35 tendency towards erratic fluctuation of URLs, has been discontinued.
36 The default chapter is "Unsorted". Potential INCOMPATIBILITY for HTML
37 presentation of theories.
39 * Discontinued obsolete 'uses' within theory header. Note that
40 commands like 'ML_file' work without separate declaration of file
41 dependencies. Minor INCOMPATIBILITY.
43 * Discontinued redundant 'use' command, which was superseded by
44 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
46 * Updated and extended "isar-ref" and "implementation" manual,
47 eliminated old "ref" manual.
49 * Proper diagnostic command 'print_state'. Old 'pr' (with its
50 implicit change of some global references) is retained for now as
51 control command, e.g. for ProofGeneral 3.7.x.
53 * Discontinued 'print_drafts' command with its old-fashioned PS output
54 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
55 'display_drafts' instead and print via the regular document viewer.
58 *** Prover IDE -- Isabelle/Scala/jEdit ***
60 * Improved "Theories" panel: Continuous checking of proof document
61 (visible and required parts) may be controlled explicitly, using check
62 box or shortcut "C+e ENTER". Individual theory nodes may be marked
63 explicitly as required and checked in full, using check box or
66 * Strictly monotonic document update, without premature cancelation of
67 running transactions that are still needed: avoid reset/restart of
68 such command executions while editing.
70 * Support for asynchronous print functions, as overlay to existing
73 * Support for automatic tools in HOL, which try to prove or disprove
74 toplevel theorem statements.
76 * Dockable window "Find" provides query operations for formal entities
77 (GUI front-end to 'find_theorems' command).
79 * Dockable window "Documentation" provides access to Isabelle
82 * Dockable window "Sledgehammer" manages asynchronous / parallel
83 sledgehammer runs over existing document sources, independently of
84 normal editing and checking process.
86 * Dockable window "Timing" provides an overview of relevant command
89 * Action isabelle.reset-font-size resets main text area font size
90 according to Isabelle/Scala plugin option "jedit_font_reset_size"
91 (cf. keyboard shortcut C+0).
93 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
94 / Global Options / Appearance".
96 * Improved completion mechanism, which is now managed by the
97 Isabelle/jEdit plugin instead of SideKick.
99 - Various Isabelle plugin options to control popup behaviour and
100 immediate insertion into buffer.
102 - Light-weight popup, which avoids explicit window (more reactive
103 and more robust). Interpreted key events: TAB, ESCAPE, UP, DOWN,
104 PAGE_UP, PAGE_DOWN. All other key events are passed to the jEdit
107 - Explicit completion via standard jEdit shortcut C+b, which has
108 been remapped to action "isabelle.complete" (fall-back on regular
109 "complete-word" for non-Isabelle buffers).
111 - Implicit completion via keyboard input on text area, with popup or
112 immediate insertion into buffer.
114 - Implicit completion of plain words requires at least 3 characters
117 - Immediate completion ignores plain words; it requires > 1
118 characters of symbol abbreviation to complete, otherwise fall-back
121 - Isabelle Symbols are only completed in backslashed forms,
122 e.g. \forall or \<forall> that both produce the Isabelle symbol
123 \<forall> in its Unicode rendering.
125 - Refined table of Isabelle symbol abbreviations (see
126 $ISABELLE_HOME/etc/symbols).
131 * Type theory is now immutable, without any special treatment of
132 drafts or linear updates (which could lead to "stale theory" errors in
133 the past). Discontinued obsolete operations like Theory.copy,
134 Theory.checkpoint, and the auxiliary type theory_ref. Minor
137 * System option "proofs" has been discontinued. Instead the global
138 state of Proofterm.proofs is persistently compiled into logic images
139 as required, notably HOL-Proofs. Users no longer need to change
140 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
142 * Syntax translation functions (print_translation etc.) always depend
143 on Proof.context. Discontinued former "(advanced)" option -- this is
144 now the default. Minor INCOMPATIBILITY.
146 * Target-sensitive commands 'interpretation' and 'sublocale'.
147 Particulary, 'interpretation' now allows for non-persistent
148 interpretation within "context ... begin ... end" blocks. See
149 "isar-ref" manual for details.
151 * Improved locales diagnostic command 'print_dependencies'.
153 * Discontinued obsolete 'axioms' command, which has been marked as
154 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
155 instead, while observing its uniform scope for polymorphism.
157 * Discontinued empty name bindings in 'axiomatization'.
160 * SELECT_GOAL now retains the syntactic context of the overall goal
161 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
167 * Improved support for ad hoc overloading of constants (see also
168 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
170 * Attibute 'code': 'code' now declares concrete and abstract code
171 equations uniformly. Use explicit 'code equation' and 'code abstract'
172 to distinguish both when desired.
175 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
177 - 'code_identifier' declares name hints for arbitrary identifiers in
178 generated code, subsuming 'code_modulename'.
179 See the isar-ref manual for syntax diagrams, and the HOL theories
183 - Various improvements to BNF-based (co)datatype package, including a
184 "primrec_new" command, a "datatype_new_compat" command, and
185 documentation. See "datatypes.pdf" for details.
190 - Renamed many generated theorems, including
191 map_comp' ~> map_comp
196 * Library/Polynomial.thy:
197 - Use lifting for primitive definitions.
198 - Explicit conversions from and to lists of coefficients, used for
200 - Replaced recursion operator poly_rec by fold_coeffs.
201 - Prefer pre-existing gcd operation for gcd.
203 poly_eq_iff ~> poly_eq_poly_eq_iff
205 expand_poly_eq ~> poly_eq_iff
208 * Reification and reflection:
209 - Reification is now directly available in HOL-Main in structure
211 - Reflection now handles multiple lists with variables also.
212 - The whole reflection stack has been decomposed into conversions.
215 * Weaker precendence of syntax for big intersection and union on sets,
216 in accordance with corresponding lattice operations. INCOMPATIBILITY.
218 * Nested case expressions are now translated in a separate check phase
219 rather than during parsing. The data for case combinators is separated
220 from the datatype package. The declaration attribute
221 "case_translation" can be used to register new case combinators:
223 declare [[case_translation case_combinator constructor1 ... constructorN]]
225 * Notation "{p:A. P}" now allows tuple patterns as well.
227 * Revised devices for recursive definitions over finite sets:
228 - Only one fundamental fold combinator on finite set remains:
229 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
230 This is now identity on infinite sets.
231 - Locales ("mini packages") for fundamental definitions with
232 Finite_Set.fold: folding, folding_idem.
233 - Locales comm_monoid_set, semilattice_order_set and
234 semilattice_neutr_order_set for big operators on sets.
235 See theory Big_Operators for canonical examples.
236 Note that foundational constants comm_monoid_set.F and
237 semilattice_set.F correspond to former combinators fold_image
238 and fold1 respectively. These are now gone. You may use
239 those foundational constants as substitutes, but it is
240 preferable to interpret the above locales accordingly.
241 - Dropped class ab_semigroup_idem_mult (special case of lattice,
242 no longer needed in connection with Finite_Set.fold etc.)
244 card.union_inter ~> card_Un_Int [symmetric]
245 card.union_disjoint ~> card_Un_disjoint
248 * Locale hierarchy for abstract orderings and (semi)lattices.
250 * Discontinued theory src/HOL/Library/Eval_Witness.
253 * Discontinued obsolete src/HOL/IsaMakefile (considered legacy since
254 Isabelle2013). Use "isabelle build" to operate on Isabelle sessions.
256 * Numeric types mapped by default to target language numerals: natural
257 (replaces former code_numeral) and integer (replaces former code_int).
258 Conversions are available as integer_of_natural / natural_of_integer /
259 integer_of_nat / nat_of_integer (in HOL) and
260 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
261 ML). INCOMPATIBILITY.
263 * Discontinued theories Code_Integer and Efficient_Nat by a more
264 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
265 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
266 generation for details. INCOMPATIBILITY.
268 * Introduce type class "conditionally_complete_lattice": Like a
269 complete lattice but does not assume the existence of the top and
270 bottom elements. Allows to generalize some lemmas about reals and
271 extended reals. Removed SupInf and replaced it by the instantiation
272 of conditionally_complete_lattice for real. Renamed lemmas about
273 conditionally-complete lattice from Sup_... to cSup_... and from
274 Inf_... to cInf_... to avoid hidding of similar complete lattice
277 * Introduce type class linear_continuum as combination of
278 conditionally-complete lattices and inner dense linorders which have
279 more than one element. INCOMPATIBILITY.
281 * Introduce type classes "no_top" and "no_bot" for orderings without
282 top and bottom elements.
284 * Split dense_linorder into inner_dense_order and no_top, no_bot.
286 * Complex_Main: Unify and move various concepts from
287 HOL-Multivariate_Analysis to HOL-Complex_Main.
289 - Introduce type class (lin)order_topology and linear_continuum_topology.
290 Allows to generalize theorems about limits and order.
291 Instances are reals and extended reals.
293 - continuous and continuos_on from Multivariate_Analysis:
294 "continuous" is the continuity of a function at a filter.
295 "isCont" is now an abbrevitation: "isCont x f == continuous (at _) f".
297 Generalized continuity lemmas from isCont to continuous on an arbitrary
300 - compact from Multivariate_Analysis. Use Bolzano's lemma
301 to prove compactness of closed intervals on reals. Continuous functions
302 attain infimum and supremum on compact sets. The inverse of a continuous
303 function is continuous, when the function is continuous on a compact set.
305 - connected from Multivariate_Analysis. Use it to prove the
306 intermediate value theorem. Show connectedness of intervals on
307 linear_continuum_topology).
309 - first_countable_topology from Multivariate_Analysis. Is used to
310 show equivalence of properties on the neighbourhood filter of x and on
311 all sequences converging to x.
313 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved theorems
314 from Library/FDERIV.thy to Deriv.thy and base the definition of DERIV on
315 FDERIV. Add variants of DERIV and FDERIV which are restricted to sets,
316 i.e. to represent derivatives from left or right.
318 - Removed the within-filter. It is replaced by the principal filter:
320 F within X = inf F (principal X)
322 - Introduce "at x within U" as a single constant, "at x" is now an
323 abbreviation for "at x within UNIV"
325 - Introduce named theorem collections tendsto_intros, continuous_intros,
326 continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or
327 FDERIV_intros) are also available as tendsto_eq_intros (or
328 FDERIV_eq_intros) where the right-hand side is replaced by a congruence
329 rule. This allows to apply them as intro rules and then proving
330 equivalence by the simplifier.
332 - Restructured theories in HOL-Complex_Main:
334 + Moved RealDef and RComplete into Real
336 + Introduced Topological_Spaces and moved theorems about
337 topological spaces, filters, limits and continuity to it
339 + Renamed RealVector to Real_Vector_Spaces
341 + Split Lim, SEQ, Series into Topological_Spaces, Real_Vector_Spaces, and
344 + Moved Ln and Log to Transcendental
346 + Moved theorems about continuity from Deriv to Topological_Spaces
348 - Remove various auxiliary lemmas.
352 * Consolidation of library theories on product orders:
354 Product_Lattice ~> Product_Order -- pointwise order on products
355 Product_ord ~> Product_Lexorder -- lexicographic order on products
362 isar_shrink ~> isar_compress
364 * Imperative-HOL: The MREC combinator is considered legacy and no
365 longer included by default. INCOMPATIBILITY, use partial_function
366 instead, or import theory Legacy_Mrec as a fallback.
368 * HOL-Algebra: Discontinued theories src/HOL/Algebra/abstract and
369 .../poly. Existing theories should be based on
370 src/HOL/Library/Polynomial instead. The latter provides integration
371 with HOL's type classes for rings. INCOMPATIBILITY.
376 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
377 "check_property" allows to check specifications of the form "ALL x y
378 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
379 Examples.thy in particular.
381 * More uniform naming of goal functions for skipped proofs:
383 Skip_Proof.prove ~> Goal.prove_sorry
384 Skip_Proof.prove_global ~> Goal.prove_sorry_global
386 * Antiquotation @{theory_context A} is similar to @{theory A}, but
387 presents the result as initial Proof.context.
389 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
390 operate on Proof.context instead of claset, for uniformity with addIs,
391 addEs, addDs etc. Note that claset_of and put_claset allow to manage
392 clasets separately from the context.
394 * Simplifier tactics and tools use proper Proof.context instead of
395 historic type simpset. Old-style declarations like addsimps,
396 addsimprocs etc. operate directly on Proof.context. Raw type simpset
397 retains its use as snapshot of the main Simplifier context, using
398 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
399 old tools by making them depend on (ctxt : Proof.context) instead of
400 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
402 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
403 INCOMPATIBILITY, use @{context} instead.
408 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
409 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
411 * Discontinued obsolete isabelle-process options -f and -u (former
412 administrative aliases of option -e). Minor INCOMPATIBILITY.
414 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
417 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
418 document formats: dvi.gz, ps, ps.gz -- the default document format is
421 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
422 specify global resources of the JVM process run by isabelle build.
424 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
425 to run Isabelle/Scala source files as standalone programs.
427 * Improved "isabelle keywords" tool (for old-style ProofGeneral
428 keyword tables): use Isabelle/Scala operations, which inspect outer
429 syntax without requiring to build sessions first.
433 New in Isabelle2013 (February 2013)
434 -----------------------------------
438 * Theorem status about oracles and unfinished/failed future proofs is
439 no longer printed by default, since it is incompatible with
440 incremental / parallel checking of the persistent document model. ML
441 function Thm.peek_status may be used to inspect a snapshot of the
442 ongoing evaluation process. Note that in batch mode --- notably
443 isabelle build --- the system ensures that future proofs of all
444 accessible theorems in the theory context are finished (as before).
446 * Configuration option show_markup controls direct inlining of markup
447 into the printed representation of formal entities --- notably type
448 and sort constraints. This enables Prover IDE users to retrieve that
449 information via tooltips in the output window, for example.
451 * Command 'ML_file' evaluates ML text from a file directly within the
452 theory, without any predeclaration via 'uses' in the theory header.
454 * Old command 'use' command and corresponding keyword 'uses' in the
455 theory header are legacy features and will be discontinued soon.
456 Tools that load their additional source files may imitate the
457 'ML_file' implementation, such that the system can take care of
458 dependencies properly.
460 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
461 is called fastforce / fast_force_tac already since Isabelle2011-1.
463 * Updated and extended "isar-ref" and "implementation" manual, reduced
464 remaining material in old "ref" manual.
466 * Improved support for auxiliary contexts that indicate block structure
467 for specifications. Nesting of "context fixes ... context assumes ..."
468 and "class ... context ...".
470 * Attribute "consumes" allows a negative value as well, which is
471 interpreted relatively to the total number of premises of the rule in
472 the target context. This form of declaration is stable when exported
473 from a nested 'context' with additional assumptions. It is the
474 preferred form for definitional packages, notably cases/rules produced
475 in HOL/inductive and HOL/function.
477 * More informative error messages for Isar proof commands involving
478 lazy enumerations (method applications etc.).
480 * Refined 'help' command to retrieve outer syntax commands according
481 to name patterns (with clickable results).
484 *** Prover IDE -- Isabelle/Scala/jEdit ***
486 * Parallel terminal proofs ('by') are enabled by default, likewise
487 proofs that are built into packages like 'datatype', 'function'. This
488 allows to "run ahead" checking the theory specifications on the
489 surface, while the prover is still crunching on internal
490 justifications. Unfinished / cancelled proofs are restarted as
491 required to complete full proof checking eventually.
493 * Improved output panel with tooltips, hyperlinks etc. based on the
494 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
495 tooltips leads to some window that supports the same recursively,
496 which can lead to stacks of tooltips as the semantic document content
497 is explored. ESCAPE closes the whole stack, individual windows may be
498 closed separately, or detached to become independent jEdit dockables.
500 * Improved support for commands that produce graph output: the text
501 message contains a clickable area to open a new instance of the graph
504 * More robust incremental parsing of outer syntax (partial comments,
505 malformed symbols). Changing the balance of open/close quotes and
506 comment delimiters works more conveniently with unfinished situations
507 that frequently occur in user interaction.
509 * More efficient painting and improved reactivity when editing large
510 files. More scalable management of formal document content.
512 * Smarter handling of tracing messages: prover process pauses after
513 certain number of messages per command transaction, with some user
514 dialog to stop or continue. This avoids swamping the front-end with
515 potentially infinite message streams.
517 * More plugin options and preferences, based on Isabelle/Scala. The
518 jEdit plugin option panel provides access to some Isabelle/Scala
519 options, including tuning parameters for editor reactivity and color
522 * Dockable window "Symbols" provides some editing support for Isabelle
525 * Dockable window "Monitor" shows ML runtime statistics. Note that
526 continuous display of the chart slows down the system.
528 * Improved editing support for control styles: subscript, superscript,
529 bold, reset of style -- operating on single symbols or text
530 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
532 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
533 adjust the main text area font size, and its derivatives for output,
534 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
535 need to be adapted to local keyboard layouts.
537 * More reactive completion popup by default: use \t (TAB) instead of
538 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
539 also "Plugin Options / SideKick / General / Code Completion Options".
541 * Implicit check and build dialog of the specified logic session
542 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
543 demand, without bundling big platform-dependent heap images in the
544 Isabelle distribution.
546 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
547 from Oracle provide better multi-platform experience. This version is
548 now bundled exclusively with Isabelle.
553 * Code generation for Haskell: restrict unqualified imports from
554 Haskell Prelude to a small set of fundamental operations.
556 * Command 'export_code': relative file names are interpreted
557 relatively to master directory of current theory rather than the
558 rather arbitrary current working directory. INCOMPATIBILITY.
560 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
561 use regular rule composition via "OF" / "THEN", or explicit proof
562 structure instead. Note that Isabelle/ML provides a variety of
563 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
564 with some care where this is really required.
566 * Command 'typ' supports an additional variant with explicit sort
567 constraint, to infer and check the most general type conforming to a
568 given sort. Example (in HOL):
570 typ "_ * _ * bool * unit" :: finite
572 * Command 'locale_deps' visualizes all locales and their relations as
580 - Added MaSh relevance filter based on machine-learning; see the
581 Sledgehammer manual for details.
582 - Polished Isar proofs generated with "isar_proofs" option.
583 - Rationalized type encodings ("type_enc" option).
584 - Renamed "kill_provers" subcommand to "kill_all".
586 isar_proof ~> isar_proofs
587 isar_shrink_factor ~> isar_shrink
588 max_relevant ~> max_facts
589 relevance_thresholds ~> fact_thresholds
591 * Quickcheck: added an optimisation for equality premises. It is
592 switched on by default, and can be switched off by setting the
593 configuration quickcheck_optimise_equality to false.
595 * Quotient: only one quotient can be defined by quotient_type
599 - generation of an abstraction function equation in lift_definition
601 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
603 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
606 * Preprocessing of the code generator rewrites set comprehensions into
607 pointfree expressions.
609 * The SMT solver Z3 has now by default a restricted set of directly
610 supported features. For the full set of features (div/mod, nonlinear
611 arithmetic, datatypes/records) with potential proof reconstruction
612 failures, enable the configuration option "z3_with_extensions". Minor
615 * Simplified 'typedef' specifications: historical options for implicit
616 set definition and alternative name have been discontinued. The
617 former behavior of "typedef (open) t = A" is now the default, but
618 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
621 * Removed constant "chars"; prefer "Enum.enum" on type "char"
622 directly. INCOMPATIBILITY.
624 * Moved operation product, sublists and n_lists from theory Enum to
625 List. INCOMPATIBILITY.
627 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
629 * Class "comm_monoid_diff" formalises properties of bounded
630 subtraction, with natural numbers and multisets as typical instances.
632 * Added combinator "Option.these" with type "'a option set => 'a set".
634 * Theory "Transitive_Closure": renamed lemmas
636 reflcl_tranclp -> reflclp_tranclp
637 rtranclp_reflcl -> rtranclp_reflclp
641 * Theory "Rings": renamed lemmas (in class semiring)
643 left_distrib ~> distrib_right
644 right_distrib ~> distrib_left
648 * Generalized the definition of limits:
650 - Introduced the predicate filterlim (LIM x F. f x :> G) which
651 expresses that when the input values x converge to F then the
652 output f x converges to G.
654 - Added filters for convergence to positive (at_top) and negative
657 - Moved infinity in the norm (at_infinity) from
658 Multivariate_Analysis to Complex_Main.
660 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
665 * Theory "Library/Option_ord" provides instantiation of option type to
666 lattice type classes.
668 * Theory "Library/Multiset": renamed
670 constant fold_mset ~> Multiset.fold
671 fact fold_mset_commute ~> fold_mset_comm
675 * Renamed theory Library/List_Prefix to Library/Sublist, with related
678 - Renamed constants (and related lemmas)
681 strict_prefix ~> prefix
683 - Replaced constant "postfix" by "suffixeq" with swapped argument
684 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
685 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
686 Renamed lemmas accordingly.
688 - Added constant "list_hembeq" for homeomorphic embedding on
689 lists. Added abbreviation "sublisteq" for special case
690 "list_hembeq (op =)".
692 - Theory Library/Sublist no longer provides "order" and "bot" type
693 class instances for the prefix order (merely corresponding locale
694 interpretations). The type class instances are now in theory
695 Library/Prefix_Order.
697 - The sublist relation of theory Library/Sublist_Order is now based
698 on "Sublist.sublisteq". Renamed lemmas accordingly:
700 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
701 le_list_append_mono ~> Sublist.list_hembeq_append_mono
702 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
703 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
704 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
705 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
706 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
707 le_list_drop_many ~> Sublist.sublisteq_drop_many
708 le_list_filter_left ~> Sublist.sublisteq_filter_left
709 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
710 le_list_rev_take_iff ~> Sublist.sublisteq_append
711 le_list_same_length ~> Sublist.sublisteq_same_length
712 le_list_take_many_iff ~> Sublist.sublisteq_append'
713 less_eq_list.drop ~> less_eq_list_drop
714 less_eq_list.induct ~> less_eq_list_induct
715 not_le_list_length ~> Sublist.not_sublisteq_length
719 * New theory Library/Countable_Set.
721 * Theory Library/Debug and Library/Parallel provide debugging and
722 parallel execution for code generated towards Isabelle/ML.
724 * Theory Library/FuncSet: Extended support for Pi and extensional and
725 introduce the extensional dependent function space "PiE". Replaced
726 extensional_funcset by an abbreviation, and renamed lemmas from
727 extensional_funcset to PiE as follows:
729 extensional_empty ~> PiE_empty
730 extensional_funcset_empty_domain ~> PiE_empty_domain
731 extensional_funcset_empty_range ~> PiE_empty_range
732 extensional_funcset_arb ~> PiE_arb
733 extensional_funcset_mem ~> PiE_mem
734 extensional_funcset_extend_domainI ~> PiE_fun_upd
735 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
736 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
737 card_extensional_funcset ~> card_PiE
738 finite_extensional_funcset ~> finite_PiE
742 * Theory Library/FinFun: theory of almost everywhere constant
743 functions (supersedes the AFP entry "Code Generation for Functions as
746 * Theory Library/Phantom: generic phantom type to make a type
747 parameter appear in a constant's type. This alternative to adding
748 TYPE('a) as another parameter avoids unnecessary closures in generated
751 * Theory Library/RBT_Impl: efficient construction of red-black trees
752 from sorted associative lists. Merging two trees with rbt_union may
753 return a structurally different tree than before. Potential
756 * Theory Library/IArray: immutable arrays with code generation.
758 * Theory Library/Finite_Lattice: theory of finite lattices.
760 * HOL/Multivariate_Analysis: replaced
762 "basis :: 'a::euclidean_space => nat => real"
763 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
765 on euclidean spaces by using the inner product "_ \<bullet> _" with
766 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
767 "SUM i : Basis. f i * r i".
769 With this change the following constants are also changed or removed:
771 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
772 a $$ i ~> inner a i (where i : Basis)
774 \<pi>, \<pi>' removed
776 Theorems about these constants where removed.
780 component_le_norm ~> Basis_le_norm
781 euclidean_eq ~> euclidean_eq_iff
782 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
783 euclidean_simps ~> inner_simps
784 independent_basis ~> independent_Basis
785 span_basis ~> span_Basis
786 in_span_basis ~> in_span_Basis
787 norm_bound_component_le ~> norm_boound_Basis_le
788 norm_bound_component_lt ~> norm_boound_Basis_lt
789 component_le_infnorm ~> Basis_le_infnorm
795 - Added simproc "measurable" to automatically prove measurability.
797 - Added induction rules for sigma sets with disjoint union
798 (sigma_sets_induct_disjoint) and for Borel-measurable functions
799 (borel_measurable_induct).
801 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
804 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
805 AFP entry "Ordinals_and_Cardinals").
807 * HOL/BNF: New (co)datatype package based on bounded natural functors
808 with support for mixed, nested recursion and interesting non-free
811 * HOL/Finite_Set and Relation: added new set and relation operations
812 expressed by Finite_Set.fold.
814 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
815 trees for the code generator.
817 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
819 possible INCOMPATIBILITY.
821 * HOL/Set: renamed Set.project -> Set.filter
825 *** Document preparation ***
827 * Dropped legacy antiquotations "term_style" and "thm_style", since
828 styles may be given as arguments to "term" and "thm" already.
829 Discontinued legacy styles "prem1" .. "prem19".
831 * Default LaTeX rendering for \<euro> is now based on eurosym package,
832 instead of slightly exotic babel/greek.
834 * Document variant NAME may use different LaTeX entry point
835 document/root_NAME.tex if that file exists, instead of the common
838 * Simplified custom document/build script, instead of old-style
839 document/IsaMakefile. Minor INCOMPATIBILITY.
844 * The default limit for maximum number of worker threads is now 8,
845 instead of 4, in correspondence to capabilities of contemporary
846 hardware and Poly/ML runtime system.
848 * Type Seq.results and related operations support embedded error
849 messages within lazy enumerations, and thus allow to provide
850 informative errors in the absence of any usable results.
852 * Renamed Position.str_of to Position.here to emphasize that this is a
853 formal device to inline positions into message text, but not
854 necessarily printing visible text.
859 * Advanced support for Isabelle sessions and build management, see
860 "system" manual for the chapter of that name, especially the "isabelle
861 build" tool and its examples. The "isabelle mkroot" tool prepares
862 session root directories for use with "isabelle build", similar to
863 former "isabelle mkdir" for "isabelle usedir". Note that this affects
864 document preparation as well. INCOMPATIBILITY, isabelle usedir /
865 mkdir / make are rendered obsolete.
867 * Discontinued obsolete Isabelle/build script, it is superseded by the
868 regular isabelle build tool. For example:
870 isabelle build -s -b HOL
872 * Discontinued obsolete "isabelle makeall".
874 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
875 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
876 provides some traditional targets that invoke "isabelle build". Note
877 that this is inefficient! Applications of Isabelle/HOL involving
878 "isabelle make" should be upgraded to use "isabelle build" directly.
880 * The "isabelle options" tool prints Isabelle system options, as
881 required for "isabelle build", for example.
883 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
884 Minor INCOMPATIBILITY in command-line options.
886 * The "isabelle install" tool has now a simpler command-line. Minor
889 * The "isabelle components" tool helps to resolve add-on components
890 that are not bundled, or referenced from a bare-bones repository
893 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
894 platform family: "linux", "macos", "windows".
896 * The ML system is configured as regular component, and no longer
897 picked up from some surrounding directory. Potential INCOMPATIBILITY
898 for home-made settings.
900 * Improved ML runtime statistics (heap, threads, future tasks etc.).
902 * Discontinued support for Poly/ML 5.2.1, which was the last version
903 without exception positions and advanced ML compiler/toplevel
906 * Discontinued special treatment of Proof General -- no longer guess
907 PROOFGENERAL_HOME based on accidental file-system layout. Minor
908 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
909 settings manually, or use a Proof General version that has been
910 bundled as Isabelle component.
914 New in Isabelle2012 (May 2012)
915 ------------------------------
919 * Prover IDE (PIDE) improvements:
921 - more robust Sledgehammer integration (as before the sledgehammer
922 command-line needs to be typed into the source buffer)
923 - markup for bound variables
924 - markup for types of term variables (displayed as tooltips)
925 - support for user-defined Isar commands within the running session
926 - improved support for Unicode outside original 16bit range
927 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
929 * Forward declaration of outer syntax keywords within the theory
930 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
931 commands to be used in the same theory where defined.
933 * Auxiliary contexts indicate block structure for specifications with
934 additional parameters and assumptions. Such unnamed contexts may be
935 nested within other targets, like 'theory', 'locale', 'class',
936 'instantiation' etc. Results from the local context are generalized
937 accordingly and applied to the enclosing target context. Example:
941 assumes xy: "x = y" and yz: "y = z"
944 lemma my_trans: "x = z" using xy yz by simp
950 The most basic application is to factor-out context elements of
951 several fixes/assumes/shows theorem statements, e.g. see
952 ~~/src/HOL/Isar_Examples/Group_Context.thy
954 Any other local theory specification element works within the "context
955 ... begin ... end" block as well.
957 * Bundled declarations associate attributed fact expressions with a
958 given name in the context. These may be later included in other
959 contexts. This allows to manage context extensions casually, without
960 the logical dependencies of locales and locale interpretation. See
961 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
963 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
964 declaration, and results are standardized before being stored. Thus
965 old-style "standard" after instantiation or composition of facts
966 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
967 indices of schematic variables.
969 * Rule attributes in local theory declarations (e.g. locale or class)
970 are now statically evaluated: the resulting theorem is stored instead
971 of the original expression. INCOMPATIBILITY in rare situations, where
972 the historic accident of dynamic re-evaluation in interpretations
975 * New tutorial "Programming and Proving in Isabelle/HOL"
976 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
977 Structured Isar Proofs" ("isar-overview"), which has been removed. It
978 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
979 Logic" as the recommended beginners tutorial, but does not cover all
980 of the material of that old tutorial.
982 * Updated and extended reference manuals: "isar-ref",
983 "implementation", "system"; reduced remaining material in old "ref"
989 * Command 'definition' no longer exports the foundational "raw_def"
990 into the user context. Minor INCOMPATIBILITY, may use the regular
991 "def" result with attribute "abs_def" to imitate the old version.
993 * Attribute "abs_def" turns an equation of the form "f x y == t" into
994 "f == %x y. t", which ensures that "simp" or "unfold" steps always
995 expand it. This also works for object-logic equality. (Formerly
996 undocumented feature.)
998 * Sort constraints are now propagated in simultaneous statements, just
999 like type constraints. INCOMPATIBILITY in rare situations, where
1000 distinct sorts used to be assigned accidentally. For example:
1002 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1004 lemma "P (x::'a)" and "Q (y::'a::bar)"
1005 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1007 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1008 tolerant against multiple unifiers, as long as the final result is
1009 unique. (As before, rules are composed in canonical right-to-left
1010 order to accommodate newly introduced premises.)
1012 * Renamed some inner syntax categories:
1018 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1019 "num_position" etc. are mainly used instead (which also include
1020 position information via constraints).
1022 * Simplified configuration options for syntax ambiguity: see
1023 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1024 manual. Minor INCOMPATIBILITY.
1026 * Discontinued configuration option "syntax_positions": atomic terms
1027 in parse trees are always annotated by position constraints.
1029 * Old code generator for SML and its commands 'code_module',
1030 'code_library', 'consts_code', 'types_code' have been discontinued.
1031 Use commands of the generic code generator instead. INCOMPATIBILITY.
1033 * Redundant attribute "code_inline" has been discontinued. Use
1034 "code_unfold" instead. INCOMPATIBILITY.
1036 * Dropped attribute "code_unfold_post" in favor of the its dual
1037 "code_abbrev", which yields a common pattern in definitions like
1039 definition [code_abbrev]: "f = t"
1043 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1044 instead. INCOMPATIBILITY.
1046 * Discontinued old "prems" fact, which used to refer to the accidental
1047 collection of foundational premises in the context (already marked as
1048 legacy since Isabelle2011).
1053 * Type 'a set is now a proper type constructor (just as before
1054 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1055 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1056 sets separate, it is often sufficient to rephrase some set S that has
1057 been accidentally used as predicates by "%x. x : S", and some
1058 predicate P that has been accidentally used as set by "{x. P x}".
1059 Corresponding proofs in a first step should be pruned from any
1060 tinkering with former theorems mem_def and Collect_def as far as
1063 For developments which deliberately mix predicates and sets, a
1064 planning step is necessary to determine what should become a predicate
1065 and what a set. It can be helpful to carry out that step in
1066 Isabelle2011-1 before jumping right into the current release.
1068 * Code generation by default implements sets as container type rather
1069 than predicates. INCOMPATIBILITY.
1071 * New type synonym 'a rel = ('a * 'a) set
1073 * The representation of numerals has changed. Datatype "num"
1074 represents strictly positive binary numerals, along with functions
1075 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1076 positive and negated numeric literals, respectively. See also
1077 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1078 user theories may require adaptations as follows:
1080 - Theorems with number_ring or number_semiring constraints: These
1081 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1083 - Theories defining numeric types: Remove number, number_semiring,
1084 and number_ring instances. Defer all theorems about numerals until
1085 after classes one and semigroup_add have been instantiated.
1087 - Numeral-only simp rules: Replace each rule having a "number_of v"
1088 pattern with two copies, one for numeral and one for neg_numeral.
1090 - Theorems about subclasses of semiring_1 or ring_1: These classes
1091 automatically support numerals now, so more simp rules and
1092 simprocs may now apply within the proof.
1094 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1095 Redefine using other integer operations.
1097 * Transfer: New package intended to generalize the existing
1098 "descending" method and related theorem attributes from the Quotient
1099 package. (Not all functionality is implemented yet, but future
1100 development will focus on Transfer as an eventual replacement for the
1101 corresponding parts of the Quotient package.)
1103 - transfer_rule attribute: Maintains a collection of transfer rules,
1104 which relate constants at two different types. Transfer rules may
1105 relate different type instances of the same polymorphic constant,
1106 or they may relate an operation on a raw type to a corresponding
1107 operation on an abstract type (quotient or subtype). For example:
1109 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1110 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1112 - transfer method: Replaces a subgoal on abstract types with an
1113 equivalent subgoal on the corresponding raw types. Constants are
1114 replaced with corresponding ones according to the transfer rules.
1115 Goals are generalized over all free variables by default; this is
1116 necessary for variables whose types change, but can be overridden
1117 for specific variables with e.g. "transfer fixing: x y z". The
1118 variant transfer' method allows replacing a subgoal with one that
1119 is logically stronger (rather than equivalent).
1121 - relator_eq attribute: Collects identity laws for relators of
1122 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1123 transfer method uses these lemmas to infer transfer rules for
1124 non-polymorphic constants on the fly.
1126 - transfer_prover method: Assists with proving a transfer rule for a
1127 new constant, provided the constant is defined in terms of other
1128 constants that already have transfer rules. It should be applied
1129 after unfolding the constant definitions.
1131 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1132 from type nat to type int.
1134 * Lifting: New package intended to generalize the quotient_definition
1135 facility of the Quotient package; designed to work with Transfer.
1137 - lift_definition command: Defines operations on an abstract type in
1138 terms of a corresponding operation on a representation
1139 type. Example syntax:
1141 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1144 Users must discharge a respectfulness proof obligation when each
1145 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1146 the proof is discharged automatically.) The obligation is
1147 presented in a user-friendly, readable form; a respectfulness
1148 theorem in the standard format and a transfer rule are generated
1151 - Integration with code_abstype: For typedefs (e.g. subtypes
1152 corresponding to a datatype invariant, such as dlist),
1153 lift_definition generates a code certificate theorem and sets up
1154 code generation for each constant.
1156 - setup_lifting command: Sets up the Lifting package to work with a
1157 user-defined type. The user must provide either a quotient theorem
1158 or a type_definition theorem. The package configures transfer
1159 rules for equality and quantifiers on the type, and sets up the
1160 lift_definition command to work with the type.
1162 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1163 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1164 Word/Word.thy and Library/Float.thy.
1168 - The 'quotient_type' command now supports a 'morphisms' option with
1169 rep and abs functions, similar to typedef.
1171 - 'quotient_type' sets up new types to work with the Lifting and
1172 Transfer packages, as with 'setup_lifting'.
1174 - The 'quotient_definition' command now requires the user to prove a
1175 respectfulness property at the point where the constant is
1176 defined, similar to lift_definition; INCOMPATIBILITY.
1178 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1179 accordingly, INCOMPATIBILITY.
1181 * New diagnostic command 'find_unused_assms' to find potentially
1182 superfluous assumptions in theorems using Quickcheck.
1186 - Quickcheck returns variable assignments as counterexamples, which
1187 allows to reveal the underspecification of functions under test.
1188 For example, refuting "hd xs = x", it presents the variable
1189 assignment xs = [] and x = a1 as a counterexample, assuming that
1190 any property is false whenever "hd []" occurs in it.
1192 These counterexample are marked as potentially spurious, as
1193 Quickcheck also returns "xs = []" as a counterexample to the
1194 obvious theorem "hd xs = hd xs".
1196 After finding a potentially spurious counterexample, Quickcheck
1197 continues searching for genuine ones.
1199 By default, Quickcheck shows potentially spurious and genuine
1200 counterexamples. The option "genuine_only" sets quickcheck to only
1201 show genuine counterexamples.
1203 - The command 'quickcheck_generator' creates random and exhaustive
1204 value generators for a given type and operations.
1206 It generates values by using the operations as if they were
1207 constructors of that type.
1209 - Support for multisets.
1211 - Added "use_subtype" options.
1213 - Added "quickcheck_locale" configuration to specify how to process
1214 conjectures in a locale context.
1216 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1217 and affecting 'rat' and 'real'.
1220 - Integrated more tightly with SPASS, as described in the ITP 2012
1221 paper "More SPASS with Isabelle".
1222 - Made it try "smt" as a fallback if "metis" fails or times out.
1223 - Added support for the following provers: Alt-Ergo (via Why3 and
1224 TFF1), iProver, iProver-Eq.
1225 - Sped up the minimizer.
1226 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1227 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1228 - Renamed "sound" option to "strict".
1230 * Metis: Added possibility to specify lambda translations scheme as a
1231 parenthesized argument (e.g., "by (metis (lifting) ...)").
1233 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1235 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1237 * New "case_product" attribute to generate a case rule doing multiple
1238 case distinctions at the same time. E.g.
1240 list.exhaust [case_product nat.exhaust]
1242 produces a rule which can be used to perform case distinction on both
1245 * New "eventually_elim" method as a generalized variant of the
1246 eventually_elim* rules. Supports structured proofs.
1248 * Typedef with implicit set definition is considered legacy. Use
1249 "typedef (open)" form instead, which will eventually become the
1252 * Record: code generation can be switched off manually with
1254 declare [[record_coden = false]] -- "default true"
1256 * Datatype: type parameters allow explicit sort constraints.
1258 * Concrete syntax for case expressions includes constraints for source
1259 positions, and thus produces Prover IDE markup for its bindings.
1260 INCOMPATIBILITY for old-style syntax translations that augment the
1261 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1264 * Clarified attribute "mono_set": pure declaration without modifying
1265 the result of the fact expression.
1267 * More default pred/set conversions on a couple of relation operations
1268 and predicates. Added powers of predicate relations. Consolidation
1269 of some relation theorems:
1271 converse_def ~> converse_unfold
1272 rel_comp_def ~> relcomp_unfold
1273 symp_def ~> (modified, use symp_def and sym_def instead)
1274 transp_def ~> transp_trans
1275 Domain_def ~> Domain_unfold
1276 Range_def ~> Domain_converse [symmetric]
1278 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1280 See theory "Relation" for examples for making use of pred/set
1281 conversions by means of attributes "to_set" and "to_pred".
1285 * Renamed facts about the power operation on relations, i.e., relpow
1286 to match the constant's name:
1288 rel_pow_1 ~> relpow_1
1289 rel_pow_0_I ~> relpow_0_I
1290 rel_pow_Suc_I ~> relpow_Suc_I
1291 rel_pow_Suc_I2 ~> relpow_Suc_I2
1292 rel_pow_0_E ~> relpow_0_E
1293 rel_pow_Suc_E ~> relpow_Suc_E
1294 rel_pow_E ~> relpow_E
1295 rel_pow_Suc_D2 ~> relpow_Suc_D2
1296 rel_pow_Suc_E2 ~> relpow_Suc_E2
1297 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1298 rel_pow_E2 ~> relpow_E2
1299 rel_pow_add ~> relpow_add
1300 rel_pow_commute ~> relpow
1301 rel_pow_empty ~> relpow_empty:
1302 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1303 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1304 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1305 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1306 rel_pow_fun_conv ~> relpow_fun_conv
1307 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1308 rel_pow_finite_bounded ~> relpow_finite_bounded
1309 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1310 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1311 single_valued_rel_pow ~> single_valued_relpow
1315 * Theory Relation: Consolidated constant name for relation composition
1316 and corresponding theorem names:
1318 - Renamed constant rel_comp to relcomp.
1320 - Dropped abbreviation pred_comp. Use relcompp instead.
1324 rel_compI ~> relcompI
1325 rel_compEpair ~> relcompEpair
1326 rel_compE ~> relcompE
1327 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1328 rel_comp_empty1 ~> relcomp_empty1
1329 rel_comp_mono ~> relcomp_mono
1330 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1331 rel_comp_distrib ~> relcomp_distrib
1332 rel_comp_distrib2 ~> relcomp_distrib2
1333 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1334 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1335 single_valued_rel_comp ~> single_valued_relcomp
1336 rel_comp_def ~> relcomp_unfold
1337 converse_rel_comp ~> converse_relcomp
1338 pred_compI ~> relcomppI
1339 pred_compE ~> relcomppE
1340 pred_comp_bot1 ~> relcompp_bot1
1341 pred_comp_bot2 ~> relcompp_bot2
1342 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1343 pred_comp_mono ~> relcompp_mono
1344 pred_comp_distrib ~> relcompp_distrib
1345 pred_comp_distrib2 ~> relcompp_distrib2
1346 converse_pred_comp ~> converse_relcompp
1348 finite_rel_comp ~> finite_relcomp
1350 set_rel_comp ~> set_relcomp
1354 * Theory Divides: Discontinued redundant theorems about div and mod.
1355 INCOMPATIBILITY, use the corresponding generic theorems instead.
1357 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1358 zdiv_self ~> div_self
1359 zmod_self ~> mod_self
1362 zdiv_zmod_equality ~> div_mod_equality2
1363 zdiv_zmod_equality2 ~> div_mod_equality
1364 zmod_zdiv_trivial ~> mod_div_trivial
1365 zdiv_zminus_zminus ~> div_minus_minus
1366 zmod_zminus_zminus ~> mod_minus_minus
1367 zdiv_zminus2 ~> div_minus_right
1368 zmod_zminus2 ~> mod_minus_right
1369 zdiv_minus1_right ~> div_minus1_right
1370 zmod_minus1_right ~> mod_minus1_right
1371 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1372 zmod_zmult1_eq ~> mod_mult_right_eq
1373 zpower_zmod ~> power_mod
1374 zdvd_zmod ~> dvd_mod
1375 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1376 mod_mult_distrib ~> mult_mod_left
1377 mod_mult_distrib2 ~> mult_mod_right
1379 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1380 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1382 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1384 * Consolidated theorem names concerning fold combinators:
1386 inf_INFI_fold_inf ~> inf_INF_fold_inf
1387 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1388 INFI_fold_inf ~> INF_fold_inf
1389 SUPR_fold_sup ~> SUP_fold_sup
1390 union_set ~> union_set_fold
1391 minus_set ~> minus_set_fold
1392 INFI_set_fold ~> INF_set_fold
1393 SUPR_set_fold ~> SUP_set_fold
1394 INF_code ~> INF_set_foldr
1395 SUP_code ~> SUP_set_foldr
1396 foldr.simps ~> foldr.simps (in point-free formulation)
1397 foldr_fold_rev ~> foldr_conv_fold
1398 foldl_fold ~> foldl_conv_fold
1399 foldr_foldr ~> foldr_conv_foldl
1400 foldl_foldr ~> foldl_conv_foldr
1401 fold_set_remdups ~> fold_set_fold_remdups
1402 fold_set ~> fold_set_fold
1403 fold1_set ~> fold1_set_fold
1407 * Dropped rarely useful theorems concerning fold combinators:
1408 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1409 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1410 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1411 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1412 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1413 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1414 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1415 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1416 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1417 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1419 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1420 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1421 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1422 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1423 lemmas over fold rather than foldr, or make use of lemmas
1424 fold_conv_foldr and fold_rev.
1426 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1427 through option types.
1429 * "Transitive_Closure.ntrancl": bounded transitive closure on
1432 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1434 * Theory Int: Discontinued many legacy theorems specific to type int.
1435 INCOMPATIBILITY, use the corresponding generic theorems instead.
1437 zminus_zminus ~> minus_minus
1438 zminus_0 ~> minus_zero
1439 zminus_zadd_distrib ~> minus_add_distrib
1440 zadd_commute ~> add_commute
1441 zadd_assoc ~> add_assoc
1442 zadd_left_commute ~> add_left_commute
1445 zadd_0 ~> add_0_left
1446 zadd_0_right ~> add_0_right
1447 zadd_zminus_inverse2 ~> left_minus
1448 zmult_zminus ~> mult_minus_left
1449 zmult_commute ~> mult_commute
1450 zmult_assoc ~> mult_assoc
1451 zadd_zmult_distrib ~> left_distrib
1452 zadd_zmult_distrib2 ~> right_distrib
1453 zdiff_zmult_distrib ~> left_diff_distrib
1454 zdiff_zmult_distrib2 ~> right_diff_distrib
1455 zmult_1 ~> mult_1_left
1456 zmult_1_right ~> mult_1_right
1457 zle_refl ~> order_refl
1458 zle_trans ~> order_trans
1459 zle_antisym ~> order_antisym
1460 zle_linear ~> linorder_linear
1461 zless_linear ~> linorder_less_linear
1462 zadd_left_mono ~> add_left_mono
1463 zadd_strict_right_mono ~> add_strict_right_mono
1464 zadd_zless_mono ~> add_less_le_mono
1465 int_0_less_1 ~> zero_less_one
1466 int_0_neq_1 ~> zero_neq_one
1468 zpower_zadd_distrib ~> power_add
1469 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1470 zero_le_zpower_abs ~> zero_le_power_abs
1472 * Theory Deriv: Renamed
1474 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1476 * Theory Library/Multiset: Improved code generation of multisets.
1478 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1479 are expressed via type classes again. The special syntax
1480 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1481 setsum_set, which is now subsumed by Big_Operators.setsum.
1484 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1485 use theory HOL/Library/Nat_Bijection instead.
1487 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1488 trees is now inside a type class context. Names of affected
1489 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1490 theories working directly with raw red-black trees, adapt the names as
1494 bulkload -> rbt_bulkload
1495 del_from_left -> rbt_del_from_left
1496 del_from_right -> rbt_del_from_right
1498 delete -> rbt_delete
1500 insert -> rbt_insert
1501 insertw -> rbt_insert_with
1502 insert_with_key -> rbt_insert_with_key
1503 map_entry -> rbt_map_entry
1504 lookup -> rbt_lookup
1505 sorted -> rbt_sorted
1506 tree_greater -> rbt_greater
1507 tree_less -> rbt_less
1508 tree_less_symbol -> rbt_less_symbol
1510 union_with -> rbt_union_with
1511 union_with_key -> rbt_union_with_key
1514 balance_left_sorted -> balance_left_rbt_sorted
1515 balance_left_tree_greater -> balance_left_rbt_greater
1516 balance_left_tree_less -> balance_left_rbt_less
1517 balance_right_sorted -> balance_right_rbt_sorted
1518 balance_right_tree_greater -> balance_right_rbt_greater
1519 balance_right_tree_less -> balance_right_rbt_less
1520 balance_sorted -> balance_rbt_sorted
1521 balance_tree_greater -> balance_rbt_greater
1522 balance_tree_less -> balance_rbt_less
1523 bulkload_is_rbt -> rbt_bulkload_is_rbt
1524 combine_sorted -> combine_rbt_sorted
1525 combine_tree_greater -> combine_rbt_greater
1526 combine_tree_less -> combine_rbt_less
1527 delete_in_tree -> rbt_delete_in_tree
1528 delete_is_rbt -> rbt_delete_is_rbt
1529 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1530 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1531 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1532 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1533 del_in_tree -> rbt_del_in_tree
1534 del_inv1_inv2 -> rbt_del_inv1_inv2
1535 del_sorted -> rbt_del_rbt_sorted
1536 del_tree_greater -> rbt_del_rbt_greater
1537 del_tree_less -> rbt_del_rbt_less
1538 dom_lookup_Branch -> dom_rbt_lookup_Branch
1539 entries_lookup -> entries_rbt_lookup
1540 finite_dom_lookup -> finite_dom_rbt_lookup
1541 insert_sorted -> rbt_insert_rbt_sorted
1542 insertw_is_rbt -> rbt_insertw_is_rbt
1543 insertwk_is_rbt -> rbt_insertwk_is_rbt
1544 insertwk_sorted -> rbt_insertwk_rbt_sorted
1545 insertw_sorted -> rbt_insertw_rbt_sorted
1546 ins_sorted -> ins_rbt_sorted
1547 ins_tree_greater -> ins_rbt_greater
1548 ins_tree_less -> ins_rbt_less
1549 is_rbt_sorted -> is_rbt_rbt_sorted
1550 lookup_balance -> rbt_lookup_balance
1551 lookup_bulkload -> rbt_lookup_rbt_bulkload
1552 lookup_delete -> rbt_lookup_rbt_delete
1553 lookup_Empty -> rbt_lookup_Empty
1554 lookup_from_in_tree -> rbt_lookup_from_in_tree
1555 lookup_in_tree -> rbt_lookup_in_tree
1556 lookup_ins -> rbt_lookup_ins
1557 lookup_insert -> rbt_lookup_rbt_insert
1558 lookup_insertw -> rbt_lookup_rbt_insertw
1559 lookup_insertwk -> rbt_lookup_rbt_insertwk
1560 lookup_keys -> rbt_lookup_keys
1561 lookup_map -> rbt_lookup_map
1562 lookup_map_entry -> rbt_lookup_rbt_map_entry
1563 lookup_tree_greater -> rbt_lookup_rbt_greater
1564 lookup_tree_less -> rbt_lookup_rbt_less
1565 lookup_union -> rbt_lookup_rbt_union
1566 map_entry_color_of -> rbt_map_entry_color_of
1567 map_entry_inv1 -> rbt_map_entry_inv1
1568 map_entry_inv2 -> rbt_map_entry_inv2
1569 map_entry_is_rbt -> rbt_map_entry_is_rbt
1570 map_entry_sorted -> rbt_map_entry_rbt_sorted
1571 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1572 map_entry_tree_less -> rbt_map_entry_rbt_less
1573 map_tree_greater -> map_rbt_greater
1574 map_tree_less -> map_rbt_less
1575 map_sorted -> map_rbt_sorted
1576 paint_sorted -> paint_rbt_sorted
1577 paint_lookup -> paint_rbt_lookup
1578 paint_tree_greater -> paint_rbt_greater
1579 paint_tree_less -> paint_rbt_less
1580 sorted_entries -> rbt_sorted_entries
1581 tree_greater_eq_trans -> rbt_greater_eq_trans
1582 tree_greater_nit -> rbt_greater_nit
1583 tree_greater_prop -> rbt_greater_prop
1584 tree_greater_simps -> rbt_greater_simps
1585 tree_greater_trans -> rbt_greater_trans
1586 tree_less_eq_trans -> rbt_less_eq_trans
1587 tree_less_nit -> rbt_less_nit
1588 tree_less_prop -> rbt_less_prop
1589 tree_less_simps -> rbt_less_simps
1590 tree_less_trans -> rbt_less_trans
1591 tree_ord_props -> rbt_ord_props
1592 union_Branch -> rbt_union_Branch
1593 union_is_rbt -> rbt_union_is_rbt
1594 unionw_is_rbt -> rbt_unionw_is_rbt
1595 unionwk_is_rbt -> rbt_unionwk_is_rbt
1596 unionwk_sorted -> rbt_unionwk_rbt_sorted
1598 * Theory HOL/Library/Float: Floating point numbers are now defined as
1599 a subset of the real numbers. All operations are defined using the
1600 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1607 round_down -> float_round_down
1608 round_up -> float_round_up
1612 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1615 abs_float_def -> Float.compute_float_abs
1616 bitlen_ge0 -> bitlen_nonneg
1617 bitlen.simps -> Float.compute_bitlen
1618 float_components -> Float_mantissa_exponent
1619 float_divl.simps -> Float.compute_float_divl
1620 float_divr.simps -> Float.compute_float_divr
1621 float_eq_odd -> mult_powr_eq_mult_powr_iff
1622 float_power -> real_of_float_power
1623 lapprox_posrat_def -> Float.compute_lapprox_posrat
1624 lapprox_rat.simps -> Float.compute_lapprox_rat
1625 le_float_def' -> Float.compute_float_le
1626 le_float_def -> less_eq_float.rep_eq
1627 less_float_def' -> Float.compute_float_less
1628 less_float_def -> less_float.rep_eq
1629 normfloat_def -> Float.compute_normfloat
1630 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1631 normfloat -> normfloat_def
1632 normfloat_unique -> use normfloat_def
1633 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1634 one_float_def -> Float.compute_float_one
1635 plus_float_def -> Float.compute_float_plus
1636 rapprox_posrat_def -> Float.compute_rapprox_posrat
1637 rapprox_rat.simps -> Float.compute_rapprox_rat
1638 real_of_float_0 -> zero_float.rep_eq
1639 real_of_float_1 -> one_float.rep_eq
1640 real_of_float_abs -> abs_float.rep_eq
1641 real_of_float_add -> plus_float.rep_eq
1642 real_of_float_minus -> uminus_float.rep_eq
1643 real_of_float_mult -> times_float.rep_eq
1644 real_of_float_simp -> Float.rep_eq
1645 real_of_float_sub -> minus_float.rep_eq
1646 round_down.simps -> Float.compute_float_round_down
1647 round_up.simps -> Float.compute_float_round_up
1648 times_float_def -> Float.compute_float_times
1649 uminus_float_def -> Float.compute_float_uminus
1650 zero_float_def -> Float.compute_float_zero
1652 Lemmas not necessary anymore, use the transfer method:
1653 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1654 float_divr, float_le_simp, float_less1_mantissa_bound,
1655 float_less_simp, float_less_zero, float_le_zero,
1656 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1657 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1658 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1659 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1660 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1661 round_up, zero_le_float, zero_less_float
1663 * New theory HOL/Library/DAList provides an abstract type for
1664 association lists with distinct keys.
1666 * Session HOL/IMP: Added new theory of abstract interpretation of
1669 * Session HOL-Import: Re-implementation from scratch is faster,
1670 simpler, and more scalable. Requires a proof bundle, which is
1671 available as an external component. Discontinued old (and mostly
1672 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1674 * Session HOL-Word: Discontinued many redundant theorems specific to
1675 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1678 word_sub_alt ~> word_sub_wi
1679 word_add_alt ~> word_add_def
1680 word_mult_alt ~> word_mult_def
1681 word_minus_alt ~> word_minus_def
1682 word_0_alt ~> word_0_wi
1683 word_1_alt ~> word_1_wi
1684 word_add_0 ~> add_0_left
1685 word_add_0_right ~> add_0_right
1686 word_mult_1 ~> mult_1_left
1687 word_mult_1_right ~> mult_1_right
1688 word_add_commute ~> add_commute
1689 word_add_assoc ~> add_assoc
1690 word_add_left_commute ~> add_left_commute
1691 word_mult_commute ~> mult_commute
1692 word_mult_assoc ~> mult_assoc
1693 word_mult_left_commute ~> mult_left_commute
1694 word_left_distrib ~> left_distrib
1695 word_right_distrib ~> right_distrib
1696 word_left_minus ~> left_minus
1697 word_diff_0_right ~> diff_0_right
1698 word_diff_self ~> diff_self
1699 word_sub_def ~> diff_minus
1700 word_diff_minus ~> diff_minus
1701 word_add_ac ~> add_ac
1702 word_mult_ac ~> mult_ac
1703 word_plus_ac0 ~> add_0_left add_0_right add_ac
1704 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1705 word_order_trans ~> order_trans
1706 word_order_refl ~> order_refl
1707 word_order_antisym ~> order_antisym
1708 word_order_linear ~> linorder_linear
1709 lenw1_zero_neq_one ~> zero_neq_one
1710 word_number_of_eq ~> number_of_eq
1711 word_of_int_add_hom ~> wi_hom_add
1712 word_of_int_sub_hom ~> wi_hom_sub
1713 word_of_int_mult_hom ~> wi_hom_mult
1714 word_of_int_minus_hom ~> wi_hom_neg
1715 word_of_int_succ_hom ~> wi_hom_succ
1716 word_of_int_pred_hom ~> wi_hom_pred
1717 word_of_int_0_hom ~> word_0_wi
1718 word_of_int_1_hom ~> word_1_wi
1720 * Session HOL-Word: New proof method "word_bitwise" for splitting
1721 machine word equalities and inequalities into logical circuits,
1722 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1723 multiplication, shifting by constants, bitwise operators and numeric
1724 constants. Requires fixed-length word types, not 'a word. Solves
1725 many standard word identities outright and converts more into first
1726 order problems amenable to blast or similar. See also examples in
1727 HOL/Word/Examples/WordExamples.thy.
1729 * Session HOL-Probability: Introduced the type "'a measure" to
1730 represent measures, this replaces the records 'a algebra and 'a
1731 measure_space. The locales based on subset_class now have two
1732 locale-parameters the space \<Omega> and the set of measurable sets M.
1733 The product of probability spaces uses now the same constant as the
1734 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1735 measure". Most constants are defined now outside of locales and gain
1736 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1737 Measure space constructions for distributions and densities now got
1738 their own constants distr and density. Instead of using locales to
1739 describe measure spaces with a finite space, the measure count_space
1740 and point_measure is introduced. INCOMPATIBILITY.
1744 finite_measure.\<mu>' -> measure
1745 product_algebra_generator -> prod_algebra
1746 product_prob_space.emb -> prod_emb
1747 product_prob_space.infprod_algebra -> PiM
1750 completeable_measure_space
1751 finite_measure_space
1753 finite_product_finite_prob_space
1754 finite_product_sigma_algebra
1755 finite_sigma_algebra
1757 pair_finite_prob_space
1758 pair_finite_sigma_algebra
1761 product_sigma_algebra
1765 distribution -> use distr measure, or distributed predicate
1767 joint_distribution -> use distr measure, or distributed predicate
1768 pair_measure_generator
1769 product_prob_space.infprod_algebra -> use PiM
1772 Replacement theorems:
1773 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1774 finite_measure.empty_measure -> measure_empty
1775 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1776 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1777 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1778 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1779 finite_measure.finite_measure -> finite_measure.emeasure_finite
1780 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1781 finite_measure.positive_measure' -> measure_nonneg
1782 finite_measure.real_measure -> finite_measure.emeasure_real
1783 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1784 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1785 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1786 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1787 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1788 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1789 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1790 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1791 information_space.entropy_commute -> information_space.entropy_commute_simple
1792 information_space.entropy_eq -> information_space.entropy_simple_distributed
1793 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1794 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1795 information_space.entropy_uniform_max -> information_space.entropy_uniform
1796 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1797 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1798 information_space.KL_ge_0 -> information_space.KL_nonneg
1799 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1800 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1801 Int_stable_cuboids -> Int_stable_atLeastAtMost
1802 Int_stable_product_algebra_generator -> positive_integral
1803 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1804 measure_space.additive -> emeasure_additive
1805 measure_space.AE_iff_null_set -> AE_iff_null
1806 measure_space.almost_everywhere_def -> eventually_ae_filter
1807 measure_space.almost_everywhere_vimage -> AE_distrD
1808 measure_space.continuity_from_above -> INF_emeasure_decseq
1809 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1810 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1811 measure_space.continuity_from_below -> SUP_emeasure_incseq
1812 measure_space_density -> emeasure_density
1813 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1814 measure_space.integrable_vimage -> integrable_distr
1815 measure_space.integral_translated_density -> integral_density
1816 measure_space.integral_vimage -> integral_distr
1817 measure_space.measure_additive -> plus_emeasure
1818 measure_space.measure_compl -> emeasure_compl
1819 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1820 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1821 measure_space.measure_decseq -> decseq_emeasure
1822 measure_space.measure_Diff -> emeasure_Diff
1823 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1824 measure_space.measure_eq_0 -> emeasure_eq_0
1825 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1826 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1827 measure_space.measure_incseq -> incseq_emeasure
1828 measure_space.measure_insert -> emeasure_insert
1829 measure_space.measure_mono -> emeasure_mono
1830 measure_space.measure_not_negative -> emeasure_not_MInf
1831 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1832 measure_space.measure_setsum -> setsum_emeasure
1833 measure_space.measure_setsum_split -> setsum_emeasure_cover
1834 measure_space.measure_space_vimage -> emeasure_distr
1835 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1836 measure_space.measure_subadditive -> subadditive
1837 measure_space.measure_top -> emeasure_space
1838 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1839 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1840 measure_space.positive_integral_translated_density -> positive_integral_density
1841 measure_space.positive_integral_vimage -> positive_integral_distr
1842 measure_space.real_continuity_from_above -> Lim_measure_decseq
1843 measure_space.real_continuity_from_below -> Lim_measure_incseq
1844 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1845 measure_space.real_measure_Diff -> measure_Diff
1846 measure_space.real_measure_finite_Union -> measure_finite_Union
1847 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1848 measure_space.real_measure_subadditive -> measure_subadditive
1849 measure_space.real_measure_Union -> measure_Union
1850 measure_space.real_measure_UNION -> measure_UNION
1851 measure_space.simple_function_vimage -> simple_function_comp
1852 measure_space.simple_integral_vimage -> simple_integral_distr
1853 measure_space.simple_integral_vimage -> simple_integral_distr
1854 measure_unique_Int_stable -> measure_eqI_generator_eq
1855 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1856 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1857 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1858 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1859 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1860 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1861 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1862 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1863 pair_sigma_algebra.sets_swap -> sets_pair_swap
1864 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1865 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1866 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1867 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1868 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1869 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1870 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1871 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1872 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1873 prob_space.prob_space_vimage -> prob_space_distr
1874 prob_space.random_variable_restrict -> measurable_restrict
1875 prob_space_unique_Int_stable -> measure_eqI_prob_space
1876 product_algebraE -> prod_algebraE_all
1877 product_algebra_generator_der -> prod_algebra_eq_finite
1878 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1879 product_algebraI -> sets_PiM_I_finite
1880 product_measure_exists -> product_sigma_finite.sigma_finite
1881 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1882 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1883 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1884 product_prob_space.measurable_component -> measurable_component_singleton
1885 product_prob_space.measurable_emb -> measurable_prod_emb
1886 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1887 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1888 product_prob_space.measure_emb -> emeasure_prod_emb
1889 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1890 product_sigma_algebra.product_algebra_into_space -> space_closed
1891 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1892 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1893 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1894 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1895 sets_product_algebra -> sets_PiM
1896 sigma_algebra.measurable_sigma -> measurable_measure_of
1897 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1898 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1899 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1900 space_product_algebra -> space_PiM
1902 * Session HOL-TPTP: support to parse and import TPTP problems (all
1903 languages) into Isabelle/HOL.
1908 * New "case_product" attribute (see HOL).
1913 * Greater support for structured proofs involving induction or case
1916 * Much greater use of mathematical symbols.
1918 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1923 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1924 from a minor keyword introduced via theory header declaration.
1926 * Antiquotation @{command_spec "name"} produces the
1927 Outer_Syntax.command_spec from a major keyword introduced via theory
1928 header declaration; it can be passed to Outer_Syntax.command etc.
1930 * Local_Theory.define no longer hard-wires default theorem name
1931 "foo_def", but retains the binding as given. If that is Binding.empty
1932 / Attrib.empty_binding, the result is not registered as user-level
1933 fact. The Local_Theory.define_internal variant allows to specify a
1934 non-empty name (used for the foundation in the background theory),
1935 while omitting the fact binding in the user-context. Potential
1936 INCOMPATIBILITY for derived definitional packages: need to specify
1937 naming policy for primitive definitions more explicitly.
1939 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1940 conformance with similar operations in structure Term and Logic.
1942 * Antiquotation @{attributes [...]} embeds attribute source
1943 representation into the ML text, which is particularly useful with
1944 declarations like Local_Theory.note.
1946 * Structure Proof_Context follows standard naming scheme. Old
1947 ProofContext has been discontinued. INCOMPATIBILITY.
1949 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1950 change of semantics: update is applied to auxiliary local theory
1953 * Modernized some old-style infix operations:
1955 addeqcongs ~> Simplifier.add_eqcong
1956 deleqcongs ~> Simplifier.del_eqcong
1957 addcongs ~> Simplifier.add_cong
1958 delcongs ~> Simplifier.del_cong
1959 setmksimps ~> Simplifier.set_mksimps
1960 setmkcong ~> Simplifier.set_mkcong
1961 setmksym ~> Simplifier.set_mksym
1962 setmkeqTrue ~> Simplifier.set_mkeqTrue
1963 settermless ~> Simplifier.set_termless
1964 setsubgoaler ~> Simplifier.set_subgoaler
1965 addsplits ~> Splitter.add_split
1966 delsplits ~> Splitter.del_split
1971 * USER_HOME settings variable points to cross-platform user home
1972 directory, which coincides with HOME on POSIX systems only. Likewise,
1973 the Isabelle path specification "~" now expands to $USER_HOME, instead
1974 of former $HOME. A different default for USER_HOME may be set
1975 explicitly in shell environment, before Isabelle settings are
1976 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1977 the generic user home was intended.
1979 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1980 notation, which is useful for the jEdit file browser, for example.
1982 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1987 New in Isabelle2011-1 (October 2011)
1988 ------------------------------------
1992 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1993 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1995 - Management of multiple theory files directly from the editor
1996 buffer store -- bypassing the file-system (no requirement to save
1997 files for checking).
1999 - Markup of formal entities within the text buffer, with semantic
2000 highlighting, tooltips and hyperlinks to jump to defining source
2003 - Improved text rendering, with sub/superscripts in the source
2004 buffer (including support for copy/paste wrt. output panel, HTML
2005 theory output and other non-Isabelle text boxes).
2007 - Refined scheduling of proof checking and printing of results,
2008 based on interactive editor view. (Note: jEdit folding and
2009 narrowing allows to restrict buffer perspectives explicitly.)
2011 - Reduced CPU performance requirements, usable on machines with few
2014 - Reduced memory requirements due to pruning of unused document
2015 versions (garbage collection).
2017 See also ~~/src/Tools/jEdit/README.html for further information,
2018 including some remaining limitations.
2020 * Theory loader: source files are exclusively located via the master
2021 directory of each theory node (where the .thy file itself resides).
2022 The global load path (such as src/HOL/Library) has been discontinued.
2023 Note that the path element ~~ may be used to reference theories in the
2024 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2027 * Theory loader: source files are identified by content via SHA1
2028 digests. Discontinued former path/modtime identification and optional
2029 ISABELLE_FILE_IDENT plugin scripts.
2031 * Parallelization of nested Isar proofs is subject to
2032 Goal.parallel_proofs_threshold (default 100). See also isabelle
2035 * Name space: former unsynchronized references are now proper
2036 configuration options, with more conventional names:
2038 long_names ~> names_long
2039 short_names ~> names_short
2040 unique_names ~> names_unique
2042 Minor INCOMPATIBILITY, need to declare options in context like this:
2044 declare [[names_unique = false]]
2046 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2047 that the result needs to be unique, which means fact specifications
2048 may have to be refined after enriching a proof context.
2050 * Attribute "case_names" has been refined: the assumptions in each case
2051 can be named now by following the case name with [name1 name2 ...].
2053 * Isabelle/Isar reference manual has been updated and extended:
2054 - "Synopsis" provides a catalog of main Isar language concepts.
2055 - Formal references in syntax diagrams, via @{rail} antiquotation.
2056 - Updated material from classic "ref" manual, notably about
2057 "Classical Reasoner".
2062 * Class bot and top require underlying partial order rather than
2063 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2065 * Class complete_lattice: generalized a couple of lemmas from sets;
2066 generalized theorems INF_cong and SUP_cong. New type classes for
2067 complete boolean algebras and complete linear orders. Lemmas
2068 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2069 class complete_linorder.
2071 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2072 Sup_fun_def, Inf_apply, Sup_apply.
2074 Removed redundant lemmas (the right hand side gives hints how to
2075 replace them for (metis ...), or (simp only: ...) proofs):
2077 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2078 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2079 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2080 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2081 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2082 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2083 Inter_def ~> INF_def, image_def
2084 Union_def ~> SUP_def, image_def
2085 INT_eq ~> INF_def, and image_def
2086 UN_eq ~> SUP_def, and image_def
2087 INF_subset ~> INF_superset_mono [OF _ order_refl]
2089 More consistent and comprehensive names:
2091 INTER_eq_Inter_image ~> INF_def
2092 UNION_eq_Union_image ~> SUP_def
2095 INF_leI ~> INF_lower
2096 INF_leI2 ~> INF_lower2
2097 le_INFI ~> INF_greatest
2098 le_SUPI ~> SUP_upper
2099 le_SUPI2 ~> SUP_upper2
2100 SUP_leI ~> SUP_least
2101 INFI_bool_eq ~> INF_bool_eq
2102 SUPR_bool_eq ~> SUP_bool_eq
2103 INFI_apply ~> INF_apply
2104 SUPR_apply ~> SUP_apply
2105 INTER_def ~> INTER_eq
2106 UNION_def ~> UNION_eq
2110 * Renamed theory Complete_Lattice to Complete_Lattices.
2113 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2114 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2115 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2116 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2118 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2119 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2120 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2123 * Added syntactic classes "inf" and "sup" for the respective
2124 constants. INCOMPATIBILITY: Changes in the argument order of the
2125 (mostly internal) locale predicates for some derived classes.
2127 * Theorem collections ball_simps and bex_simps do not contain theorems
2128 referring to UNION any longer; these have been moved to collection
2129 UN_ball_bex_simps. INCOMPATIBILITY.
2131 * Theory Archimedean_Field: floor now is defined as parameter of a
2132 separate type class floor_ceiling.
2134 * Theory Finite_Set: more coherent development of fold_set locales:
2136 locale fun_left_comm ~> locale comp_fun_commute
2137 locale fun_left_comm_idem ~> locale comp_fun_idem
2139 Both use point-free characterization; interpretation proofs may need
2140 adjustment. INCOMPATIBILITY.
2142 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2143 accordance with standard mathematical terminology. INCOMPATIBILITY.
2145 * Theory Complex_Main: The locale interpretations for the
2146 bounded_linear and bounded_bilinear locales have been removed, in
2147 order to reduce the number of duplicate lemmas. Users must use the
2148 original names for distributivity theorems, potential INCOMPATIBILITY.
2150 divide.add ~> add_divide_distrib
2151 divide.diff ~> diff_divide_distrib
2152 divide.setsum ~> setsum_divide_distrib
2153 mult.add_right ~> right_distrib
2154 mult.diff_right ~> right_diff_distrib
2155 mult_right.setsum ~> setsum_right_distrib
2156 mult_left.diff ~> left_diff_distrib
2158 * Theory Complex_Main: Several redundant theorems have been removed or
2159 replaced by more general versions. INCOMPATIBILITY.
2161 real_diff_def ~> minus_real_def
2162 real_divide_def ~> divide_real_def
2163 real_less_def ~> less_le
2164 real_abs_def ~> abs_real_def
2165 real_sgn_def ~> sgn_real_def
2166 real_mult_commute ~> mult_commute
2167 real_mult_assoc ~> mult_assoc
2168 real_mult_1 ~> mult_1_left
2169 real_add_mult_distrib ~> left_distrib
2170 real_zero_not_eq_one ~> zero_neq_one
2171 real_mult_inverse_left ~> left_inverse
2172 INVERSE_ZERO ~> inverse_zero
2173 real_le_refl ~> order_refl
2174 real_le_antisym ~> order_antisym
2175 real_le_trans ~> order_trans
2176 real_le_linear ~> linear
2177 real_le_eq_diff ~> le_iff_diff_le_0
2178 real_add_left_mono ~> add_left_mono
2179 real_mult_order ~> mult_pos_pos
2180 real_mult_less_mono2 ~> mult_strict_left_mono
2181 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2182 real_0_le_divide_iff ~> zero_le_divide_iff
2183 realpow_two_disj ~> power2_eq_iff
2184 real_squared_diff_one_factored ~> square_diff_one_factored
2185 realpow_two_diff ~> square_diff_square_factored
2186 reals_complete2 ~> complete_real
2187 real_sum_squared_expand ~> power2_sum
2188 exp_ln_eq ~> ln_unique
2190 expi_zero ~> exp_zero
2191 lemma_DERIV_subst ~> DERIV_cong
2192 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2193 LIMSEQ_const ~> tendsto_const
2194 LIMSEQ_norm ~> tendsto_norm
2195 LIMSEQ_add ~> tendsto_add
2196 LIMSEQ_minus ~> tendsto_minus
2197 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2198 LIMSEQ_diff ~> tendsto_diff
2199 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2200 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2201 LIMSEQ_mult ~> tendsto_mult
2202 LIMSEQ_inverse ~> tendsto_inverse
2203 LIMSEQ_divide ~> tendsto_divide
2204 LIMSEQ_pow ~> tendsto_power
2205 LIMSEQ_setsum ~> tendsto_setsum
2206 LIMSEQ_setprod ~> tendsto_setprod
2207 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2208 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2209 LIMSEQ_imp_rabs ~> tendsto_rabs
2210 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2211 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2212 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2213 LIMSEQ_Complex ~> tendsto_Complex
2214 LIM_ident ~> tendsto_ident_at
2215 LIM_const ~> tendsto_const
2216 LIM_add ~> tendsto_add
2217 LIM_add_zero ~> tendsto_add_zero
2218 LIM_minus ~> tendsto_minus
2219 LIM_diff ~> tendsto_diff
2220 LIM_norm ~> tendsto_norm
2221 LIM_norm_zero ~> tendsto_norm_zero
2222 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2223 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2224 LIM_rabs ~> tendsto_rabs
2225 LIM_rabs_zero ~> tendsto_rabs_zero
2226 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2227 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2228 LIM_compose ~> tendsto_compose
2229 LIM_mult ~> tendsto_mult
2230 LIM_scaleR ~> tendsto_scaleR
2231 LIM_of_real ~> tendsto_of_real
2232 LIM_power ~> tendsto_power
2233 LIM_inverse ~> tendsto_inverse
2234 LIM_sgn ~> tendsto_sgn
2235 isCont_LIM_compose ~> isCont_tendsto_compose
2236 bounded_linear.LIM ~> bounded_linear.tendsto
2237 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2238 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2239 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2240 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2241 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2242 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2244 * Theory Complex_Main: The definition of infinite series was
2245 generalized. Now it is defined on the type class {topological_space,
2246 comm_monoid_add}. Hence it is useable also for extended real numbers.
2248 * Theory Complex_Main: The complex exponential function "expi" is now
2249 a type-constrained abbreviation for "exp :: complex => complex"; thus
2250 several polymorphic lemmas about "exp" are now applicable to "expi".
2254 - Theory Library/Code_Char_ord provides native ordering of
2255 characters in the target language.
2257 - Commands code_module and code_library are legacy, use export_code
2260 - Method "evaluation" is legacy, use method "eval" instead.
2262 - Legacy evaluator "SML" is deactivated by default. May be
2263 reactivated by the following theory command:
2265 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2267 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2269 * New proof method "induction" that gives induction hypotheses the
2270 name "IH", thus distinguishing them from further hypotheses that come
2271 from rule induction. The latter are still called "hyps". Method
2272 "induction" is a thin wrapper around "induct" and follows the same
2275 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2276 still available as a legacy feature for some time.
2279 - Added "need" and "total_consts" options.
2280 - Reintroduced "show_skolems" option by popular demand.
2281 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2285 - Use quasi-sound (and efficient) translations by default.
2286 - Added support for the following provers: E-ToFoF, LEO-II,
2287 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2288 - Automatically preplay and minimize proofs before showing them if
2289 this can be done within reasonable time.
2290 - sledgehammer available_provers ~> sledgehammer supported_provers.
2292 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2293 "max_mono_iters", and "max_new_mono_instances" options.
2294 - Removed "explicit_apply" and "full_types" options as well as "Full
2295 Types" Proof General menu item. INCOMPATIBILITY.
2298 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2299 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2303 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2304 "elim:" options. INCOMPATIBILITY.
2305 - Introduced 'try' that not only runs 'try_methods' but also
2306 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2309 - Added "eval" option to evaluate terms for the found counterexample
2310 (currently only supported by the default (exhaustive) tester).
2311 - Added post-processing of terms to obtain readable counterexamples
2312 (currently only supported by the default (exhaustive) tester).
2313 - New counterexample generator quickcheck[narrowing] enables
2314 narrowing-based testing. Requires the Glasgow Haskell compiler
2315 with its installation location defined in the Isabelle settings
2316 environment as ISABELLE_GHC.
2317 - Removed quickcheck tester "SML" based on the SML code generator
2318 (formly in HOL/Library).
2320 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2321 use 'partial_function' instead.
2323 * Theory Library/Extended_Reals replaces now the positive extended
2324 reals found in probability theory. This file is extended by
2325 Multivariate_Analysis/Extended_Real_Limits.
2327 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2328 from where it must be imported explicitly if it is really required.
2331 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2332 been moved here. INCOMPATIBILITY.
2334 * Theory Library/Saturated provides type of numbers with saturated
2337 * Theory Library/Product_Lattice defines a pointwise ordering for the
2338 product type 'a * 'b, and provides instance proofs for various order
2339 and lattice type classes.
2341 * Theory Library/Countable now provides the "countable_datatype" proof
2342 method for proving "countable" class instances for datatypes.
2344 * Theory Library/Cset_Monad allows do notation for computable sets
2345 (cset) via the generic monad ad-hoc overloading facility.
2347 * Library: Theories of common data structures are split into theories
2348 for implementation, an invariant-ensuring type, and connection to an
2349 abstract type. INCOMPATIBILITY.
2351 - RBT is split into RBT and RBT_Mapping.
2352 - AssocList is split and renamed into AList and AList_Mapping.
2353 - DList is split into DList_Impl, DList, and DList_Cset.
2354 - Cset is split into Cset and List_Cset.
2356 * Theory Library/Nat_Infinity has been renamed to
2357 Library/Extended_Nat, with name changes of the following types and
2360 type inat ~> type enat
2362 Infty ~> infinity (overloaded)
2366 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2367 been renamed accordingly. INCOMPATIBILITY.
2369 * Session Multivariate_Analysis: The euclidean_space type class now
2370 fixes a constant "Basis :: 'a set" consisting of the standard
2371 orthonormal basis for the type. Users now have the option of
2372 quantifying over this set instead of using the "basis" function, e.g.
2373 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2375 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2376 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2377 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2378 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2379 changed to match. Definition theorems for overloaded constants now use
2380 the standard "foo_vec_def" naming scheme. A few other theorems have
2381 been renamed as follows (INCOMPATIBILITY):
2383 Cart_eq ~> vec_eq_iff
2384 dist_nth_le_cart ~> dist_vec_nth_le
2385 tendsto_vector ~> vec_tendstoI
2386 Cauchy_vector ~> vec_CauchyI
2388 * Session Multivariate_Analysis: Several duplicate theorems have been
2389 removed, and other theorems have been renamed or replaced with more
2390 general versions. INCOMPATIBILITY.
2392 finite_choice ~> finite_set_choice
2393 eventually_conjI ~> eventually_conj
2394 eventually_and ~> eventually_conj_iff
2395 eventually_false ~> eventually_False
2396 setsum_norm ~> norm_setsum
2397 Lim_sequentially ~> LIMSEQ_def
2398 Lim_ident_at ~> LIM_ident
2399 Lim_const ~> tendsto_const
2400 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2401 Lim_neg ~> tendsto_minus
2402 Lim_add ~> tendsto_add
2403 Lim_sub ~> tendsto_diff
2404 Lim_mul ~> tendsto_scaleR
2405 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2406 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2407 Lim_linear ~> bounded_linear.tendsto
2408 Lim_component ~> tendsto_euclidean_component
2409 Lim_component_cart ~> tendsto_vec_nth
2410 Lim_inner ~> tendsto_inner [OF tendsto_const]
2411 dot_lsum ~> inner_setsum_left
2412 dot_rsum ~> inner_setsum_right
2413 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2414 continuous_neg ~> continuous_minus
2415 continuous_sub ~> continuous_diff
2416 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2417 continuous_mul ~> continuous_scaleR
2418 continuous_inv ~> continuous_inverse
2419 continuous_at_within_inv ~> continuous_at_within_inverse
2420 continuous_at_inv ~> continuous_at_inverse
2421 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2422 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2423 continuous_at_component ~> continuous_component [OF continuous_at_id]
2424 continuous_on_neg ~> continuous_on_minus
2425 continuous_on_sub ~> continuous_on_diff
2426 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2427 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2428 continuous_on_mul ~> continuous_on_scaleR
2429 continuous_on_mul_real ~> continuous_on_mult
2430 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2431 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2432 continuous_on_inverse ~> continuous_on_inv
2433 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2434 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2435 subset_interior ~> interior_mono
2436 subset_closure ~> closure_mono
2437 closure_univ ~> closure_UNIV
2438 real_arch_lt ~> reals_Archimedean2
2439 real_arch ~> reals_Archimedean3
2440 real_abs_norm ~> abs_norm_cancel
2441 real_abs_sub_norm ~> norm_triangle_ineq3
2442 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2444 * Session HOL-Probability:
2445 - Caratheodory's extension lemma is now proved for ring_of_sets.
2446 - Infinite products of probability measures are now available.
2447 - Sigma closure is independent, if the generator is independent
2448 - Use extended reals instead of positive extended
2449 reals. INCOMPATIBILITY.
2451 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2453 expand_fun_below ~> fun_below_iff
2454 below_fun_ext ~> fun_belowI
2455 expand_cfun_eq ~> cfun_eq_iff
2456 ext_cfun ~> cfun_eqI
2457 expand_cfun_below ~> cfun_below_iff
2458 below_cfun_ext ~> cfun_belowI
2459 monofun_fun_fun ~> fun_belowD
2460 monofun_fun_arg ~> monofunE
2461 monofun_lub_fun ~> adm_monofun [THEN admD]
2462 cont_lub_fun ~> adm_cont [THEN admD]
2463 cont2cont_Rep_CFun ~> cont2cont_APP
2464 cont_Rep_CFun_app ~> cont_APP_app
2465 cont_Rep_CFun_app_app ~> cont_APP_app_app
2466 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2467 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2468 contlub_cfun ~> lub_APP [symmetric]
2469 contlub_LAM ~> lub_LAM [symmetric]
2472 lift_distinct1 ~> lift.distinct(1)
2473 lift_distinct2 ~> lift.distinct(2)
2474 Def_not_UU ~> lift.distinct(2)
2475 Def_inject ~> lift.inject
2476 below_UU_iff ~> below_bottom_iff
2477 eq_UU_iff ~> eq_bottom_iff
2480 *** Document preparation ***
2482 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2483 isar-ref manual, both for description and actual application of the
2486 * Antiquotation @{value} evaluates the given term and presents its
2489 * Antiquotations: term style "isub" provides ad-hoc conversion of
2490 variables x1, y23 into subscripted form x\<^isub>1,
2491 y\<^isub>2\<^isub>3.
2493 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2494 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2496 * Localized \isabellestyle switch can be used within blocks or groups
2499 \isabellestyle{it} %preferred default
2500 {\isabellestylett @{text "typewriter stuff"}}
2502 * Discontinued special treatment of hard tabulators. Implicit
2503 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2509 * The inner syntax of sort/type/term/prop supports inlined YXML
2510 representations within quoted string tokens. By encoding logical
2511 entities via Term_XML (in ML or Scala) concrete syntax can be
2512 bypassed, which is particularly useful for producing bits of text
2513 under external program control.
2515 * Antiquotations for ML and document preparation are managed as theory
2516 data, which requires explicit setup.
2518 * Isabelle_Process.is_active allows tools to check if the official
2519 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2520 (better known as Proof General).
2522 * Structure Proof_Context follows standard naming scheme. Old
2523 ProofContext is still available for some time as legacy alias.
2525 * Structure Timing provides various operations for timing; supersedes
2526 former start_timing/end_timing etc.
2528 * Path.print is the official way to show file-system paths to users
2529 (including quotes etc.).
2531 * Inner syntax: identifiers in parse trees of generic categories
2532 "logic", "aprop", "idt" etc. carry position information (disguised as
2533 type constraints). Occasional INCOMPATIBILITY with non-compliant
2534 translations that choke on unexpected type constraints. Positions can
2535 be stripped in ML translations via Syntax.strip_positions /
2536 Syntax.strip_positions_ast, or via the syntax constant
2537 "_strip_positions" within parse trees. As last resort, positions can
2538 be disabled via the configuration option Syntax.positions, which is
2539 called "syntax_positions" in Isar attribute syntax.
2541 * Discontinued special status of various ML structures that contribute
2542 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2543 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2544 refer directly to Ast.Constant, Lexicon.is_identifier,
2545 Syntax_Trans.mk_binder_tr etc.
2547 * Typed print translation: discontinued show_sorts argument, which is
2548 already available via context of "advanced" translation.
2550 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2551 goal states; body tactic needs to address all subgoals uniformly.
2553 * Slightly more special eq_list/eq_set, with shortcut involving
2554 pointer equality (assumes that eq relation is reflexive).
2556 * Classical tactics use proper Proof.context instead of historic types
2557 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2558 operate directly on Proof.context. Raw type claset retains its use as
2559 snapshot of the classical context, which can be recovered via
2560 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2561 INCOMPATIBILITY, classical tactics and derived proof methods require
2562 proper Proof.context.
2567 * Discontinued support for Poly/ML 5.2, which was the last version
2568 without proper multithreading and TimeLimit implementation.
2570 * Discontinued old lib/scripts/polyml-platform, which has been
2571 obsolete since Isabelle2009-2.
2573 * Various optional external tools are referenced more robustly and
2574 uniformly by explicit Isabelle settings as follows:
2576 ISABELLE_CSDP (formerly CSDP_EXE)
2577 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2578 ISABELLE_OCAML (formerly EXEC_OCAML)
2579 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2580 ISABELLE_YAP (formerly EXEC_YAP)
2582 Note that automated detection from the file-system or search path has
2583 been discontinued. INCOMPATIBILITY.
2585 * Scala layer provides JVM method invocation service for static
2586 methods of type (String)String, see Invoke_Scala.method in ML. For
2589 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2591 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2592 this allows to pass structured values between ML and Scala.
2594 * The IsabelleText fonts includes some further glyphs to support the
2595 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2596 installed a local copy (which is normally *not* required) need to
2597 delete or update it from ~~/lib/fonts/.
2601 New in Isabelle2011 (January 2011)
2602 ----------------------------------
2606 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2607 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2608 useful tooltips and hyperlinks produced from its static analysis. The
2609 bundled component provides an executable Isabelle tool that can be run
2612 Isabelle2011/bin/isabelle jedit
2614 * Significantly improved Isabelle/Isar implementation manual.
2616 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2617 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2618 while the default heap location within that directory lacks that extra
2619 suffix. This isolates multiple Isabelle installations from each
2620 other, avoiding problems with old settings in new versions.
2621 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2623 * Source files are always encoded as UTF-8, instead of old-fashioned
2624 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2625 the following package declarations:
2627 \usepackage[utf8]{inputenc}
2628 \usepackage{textcomp}
2630 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2631 a Unicode character is treated as a single symbol, not a sequence of
2632 non-ASCII bytes as before. Since Isabelle/ML string literals may
2633 contain symbols without further backslash escapes, Unicode can now be
2634 used here as well. Recall that Symbol.explode in ML provides a
2635 consistent view on symbols, while raw explode (or String.explode)
2636 merely give a byte-oriented representation.
2638 * Theory loader: source files are primarily located via the master
2639 directory of each theory node (where the .thy file itself resides).
2640 The global load path is still partially available as legacy feature.
2641 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2642 explicit paths, relatively to the theory.
2644 * Special treatment of ML file names has been discontinued.
2645 Historically, optional extensions .ML or .sml were added on demand --
2646 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2647 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2649 * Various options that affect pretty printing etc. are now properly
2650 handled within the context via configuration options, instead of
2651 unsynchronized references or print modes. There are both ML Config.T
2652 entities and Isar declaration attributes to access these.
2654 ML (Config.T) Isar (attribute)
2656 eta_contract eta_contract
2657 show_brackets show_brackets
2658 show_sorts show_sorts
2659 show_types show_types
2660 show_question_marks show_question_marks
2661 show_consts show_consts
2662 show_abbrevs show_abbrevs
2664 Syntax.ast_trace syntax_ast_trace
2665 Syntax.ast_stat syntax_ast_stat
2666 Syntax.ambiguity_level syntax_ambiguity_level
2668 Goal_Display.goals_limit goals_limit
2669 Goal_Display.show_main_goal show_main_goal
2671 Method.rule_trace rule_trace
2673 Thy_Output.display thy_output_display
2674 Thy_Output.quotes thy_output_quotes
2675 Thy_Output.indent thy_output_indent
2676 Thy_Output.source thy_output_source
2677 Thy_Output.break thy_output_break
2679 Note that corresponding "..._default" references in ML may only be
2680 changed globally at the ROOT session setup, but *not* within a theory.
2681 The option "show_abbrevs" supersedes the former print mode
2682 "no_abbrevs" with inverted meaning.
2684 * More systematic naming of some configuration options.
2687 trace_simp ~> simp_trace
2688 debug_simp ~> simp_debug
2690 * Support for real valued configuration options, using simplistic
2691 floating-point notation that coincides with the inner syntax for
2694 * Support for real valued preferences (with approximative PGIP type):
2695 front-ends need to accept "pgint" values in float notation.
2698 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2701 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2706 * Command 'type_synonym' (with single argument) replaces somewhat
2707 outdated 'types', which is still available as legacy feature for some
2710 * Command 'nonterminal' (with 'and' separated list of arguments)
2711 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2713 * Command 'notepad' replaces former 'example_proof' for
2714 experimentation in Isar without any result. INCOMPATIBILITY.
2716 * Locale interpretation commands 'interpret' and 'sublocale' accept
2717 lists of equations to map definitions in a locale to appropriate
2718 entities in the context of the interpretation. The 'interpretation'
2719 command already provided this functionality.
2721 * Diagnostic command 'print_dependencies' prints the locale instances
2722 that would be activated if the specified expression was interpreted in
2723 the current context. Variant "print_dependencies!" assumes a context
2724 without interpretations.
2726 * Diagnostic command 'print_interps' prints interpretations in proofs
2727 in addition to interpretations in theories.
2729 * Discontinued obsolete 'global' and 'local' commands to manipulate
2730 the theory name space. Rare INCOMPATIBILITY. The ML functions
2731 Sign.root_path and Sign.local_path may be applied directly where this
2732 feature is still required for historical reasons.
2734 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2735 'definition' instead.
2737 * The "prems" fact, which refers to the accidental collection of
2738 foundational premises in the context, is now explicitly marked as
2739 legacy feature and will be discontinued soon. Consider using "assms"
2740 of the head statement or reference facts by explicit names.
2742 * Document antiquotations @{class} and @{type} print classes and type
2745 * Document antiquotation @{file} checks file/directory entries within
2746 the local file system.
2751 * Coercive subtyping: functions can be declared as coercions and type
2752 inference will add them as necessary upon input of a term. Theory
2753 Complex_Main declares real :: nat => real and real :: int => real as
2754 coercions. A coercion function f is declared like this:
2756 declare [[coercion f]]
2758 To lift coercions through type constructors (e.g. from nat => real to
2759 nat list => real list), map functions can be declared, e.g.
2761 declare [[coercion_map map]]
2763 Currently coercion inference is activated only in theories including
2764 real numbers, i.e. descendants of Complex_Main. This is controlled by
2765 the configuration option "coercion_enabled", e.g. it can be enabled in
2766 other theories like this:
2768 declare [[coercion_enabled]]
2770 * Command 'partial_function' provides basic support for recursive
2771 function definitions over complete partial orders. Concrete instances
2772 are provided for i) the option type, ii) tail recursion on arbitrary
2773 types, and iii) the heap monad of Imperative_HOL. See
2774 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2777 * Function package: f.psimps rules are no longer implicitly declared
2778 as [simp]. INCOMPATIBILITY.
2780 * Datatype package: theorems generated for executable equality (class
2781 "eq") carry proper names and are treated as default code equations.
2783 * Inductive package: now offers command 'inductive_simps' to
2784 automatically derive instantiated and simplified equations for
2785 inductive predicates, similar to 'inductive_cases'.
2787 * Command 'enriched_type' allows to register properties of the
2788 functorial structure of types.
2790 * Improved infrastructure for term evaluation using code generator
2791 techniques, in particular static evaluation conversions.
2793 * Code generator: Scala (2.8 or higher) has been added to the target
2796 * Code generator: globbing constant expressions "*" and "Theory.*"
2797 have been replaced by the more idiomatic "_" and "Theory._".
2800 * Code generator: export_code without explicit file declaration prints
2801 to standard output. INCOMPATIBILITY.
2803 * Code generator: do not print function definitions for case
2804 combinators any longer.
2806 * Code generator: simplification with rules determined with
2807 src/Tools/Code/code_simp.ML and method "code_simp".
2809 * Code generator for records: more idiomatic representation of record
2810 types. Warning: records are not covered by ancient SML code
2811 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2812 rep_datatype declaration helps to succeed then:
2816 rep_datatype foo_ext ...
2818 * Records: logical foundation type for records does not carry a
2819 '_type' suffix any longer (obsolete due to authentic syntax).
2822 * Quickcheck now by default uses exhaustive testing instead of random
2823 testing. Random testing can be invoked by "quickcheck [random]",
2824 exhaustive testing by "quickcheck [exhaustive]".
2826 * Quickcheck instantiates polymorphic types with small finite
2827 datatypes by default. This enables a simple execution mechanism to
2828 handle quantifiers and function equality over the finite datatypes.
2830 * Quickcheck random generator has been renamed from "code" to
2831 "random". INCOMPATIBILITY.
2833 * Quickcheck now has a configurable time limit which is set to 30
2834 seconds by default. This can be changed by adding [timeout = n] to the
2835 quickcheck command. The time limit for Auto Quickcheck is still set
2838 * Quickcheck in locales considers interpretations of that locale for
2839 counter example search.
2842 - Added "smt" and "remote_smt" provers based on the "smt" proof
2843 method. See the Sledgehammer manual for details ("isabelle doc
2846 sledgehammer atp_info ~> sledgehammer running_provers
2847 sledgehammer atp_kill ~> sledgehammer kill_provers
2848 sledgehammer available_atps ~> sledgehammer available_provers
2851 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2852 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2853 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2854 (and "ms" and "min" are no longer supported)
2859 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2860 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2862 - Added support for partial quotient types.
2863 - Added local versions of the "Nitpick.register_xxx" functions.
2864 - Added "whack" option.
2865 - Allow registration of quotient types as codatatypes.
2866 - Improved "merge_type_vars" option to merge more types.
2867 - Removed unsound "fast_descrs" option.
2868 - Added custom symmetry breaking for datatypes, making it possible to reach
2869 higher cardinalities.
2870 - Prevent the expansion of too large definitions.
2872 * Proof methods "metis" and "meson" now have configuration options
2873 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2874 to diagnose these tools. E.g.
2876 using [[metis_trace = true]]
2878 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2879 manually as command 'solve_direct'.
2881 * The default SMT solver Z3 must be enabled explicitly (due to
2882 licensing issues) by setting the environment variable
2883 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2884 commercial applications, the SMT solver CVC3 is provided as fall-back;
2885 changing the SMT solver is done via the configuration option
2888 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2889 i.e. "remote_cvc3" and "remote_z3".
2891 * Added basic SMT support for datatypes, records, and typedefs using
2892 the oracle mode (no proofs). Direct support of pairs has been dropped
2893 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2894 support for a similar behavior). Minor INCOMPATIBILITY.
2896 * Changed SMT configuration options:
2898 z3_proofs ~> smt_oracle (with inverted meaning)
2899 z3_trace_assms ~> smt_trace_used_facts
2912 * Boogie output files (.b2i files) need to be declared in the theory
2915 * Simplification procedure "list_to_set_comprehension" rewrites list
2916 comprehensions applied to List.set to set comprehensions. Occasional
2917 INCOMPATIBILITY, may be deactivated like this:
2919 declare [[simproc del: list_to_set_comprehension]]
2921 * Removed old version of primrec package. INCOMPATIBILITY.
2923 * Removed simplifier congruence rule of "prod_case", as has for long
2924 been the case with "split". INCOMPATIBILITY.
2926 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2928 * Removed [split_format ... and ... and ...] version of
2929 [split_format]. Potential INCOMPATIBILITY.
2931 * Predicate "sorted" now defined inductively, with nice induction
2932 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2934 * Constant "contents" renamed to "the_elem", to free the generic name
2935 contents for other uses. INCOMPATIBILITY.
2937 * Renamed class eq and constant eq (for code generation) to class
2938 equal and constant equal, plus renaming of related facts and various
2939 tuning. INCOMPATIBILITY.
2941 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2943 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2946 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2947 avoid confusion with finite sets. INCOMPATIBILITY.
2949 * Abandoned locales equiv, congruent and congruent2 for equivalence
2950 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2953 * Some previously unqualified names have been qualified:
2960 Trueprop ~> HOL.Trueprop
2965 op --> ~> HOL.implies
2977 Pair ~> Product_Type.Pair
2978 fst ~> Product_Type.fst
2979 snd ~> Product_Type.snd
2980 curry ~> Product_Type.curry
2982 Collect ~> Set.Collect
2986 * More canonical naming convention for some fundamental definitions:
2988 bot_bool_eq ~> bot_bool_def
2989 top_bool_eq ~> top_bool_def
2990 inf_bool_eq ~> inf_bool_def
2991 sup_bool_eq ~> sup_bool_def
2992 bot_fun_eq ~> bot_fun_def
2993 top_fun_eq ~> top_fun_def
2994 inf_fun_eq ~> inf_fun_def
2995 sup_fun_eq ~> sup_fun_def
2999 * More stylized fact names:
3001 expand_fun_eq ~> fun_eq_iff
3002 expand_set_eq ~> set_eq_iff
3004 nat_number ~> eval_nat_numeral
3008 * Refactoring of code-generation specific operations in theory List:
3014 mem_iff ~> member_def
3015 null_empty ~> null_def
3017 INCOMPATIBILITY. Note that these were not supposed to be used
3018 regularly unless for striking reasons; their main purpose was code
3021 Various operations from the Haskell prelude are used for generating
3024 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3025 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3026 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3028 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3029 "*" and "+" respectively. INCOMPATIBILITY.
3031 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3032 "Sum_Type.Plus" instead.
3034 * Constant "split" has been merged with constant "prod_case"; names of
3035 ML functions, facts etc. involving split have been retained so far,
3036 though. INCOMPATIBILITY.
3038 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3039 instead. INCOMPATIBILITY.
3041 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3044 * Former theory Library/Enum is now part of the HOL-Main image.
3045 INCOMPATIBILITY: all constants of the Enum theory now have to be
3046 referred to by its qualified name.
3049 nlists ~> Enum.nlists
3050 product ~> Enum.product
3052 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3053 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3056 * Theory Library/SetsAndFunctions has been split into
3057 Library/Function_Algebras and Library/Set_Algebras; canonical names
3058 for instance definitions for functions; various improvements.
3061 * Theory Library/Multiset provides stable quicksort implementation of
3064 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3067 * Session Multivariate_Analysis: introduced a type class for euclidean
3068 space. Most theorems are now stated in terms of euclidean spaces
3069 instead of finite cartesian products.
3072 real ^ 'n ~> 'a::real_vector
3073 ~> 'a::euclidean_space
3074 ~> 'a::ordered_euclidean_space
3075 (depends on your needs)
3079 \<chi> x. _ ~> \<chi>\<chi> x. _
3082 Also note that the indices are now natural numbers and not from some
3083 finite type. Finite cartesian products of euclidean spaces, products
3084 of euclidean spaces the real and complex numbers are instantiated to
3085 be euclidean_spaces. INCOMPATIBILITY.
3087 * Session Probability: introduced pextreal as positive extended real
3088 numbers. Use pextreal as value for measures. Introduce the
3089 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3090 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3091 the integral in Multivariate Analysis. INCOMPATIBILITY.
3093 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3096 * Session SPARK (with image HOL-SPARK) provides commands to load and
3097 prove verification conditions generated by the SPARK Ada program
3098 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3103 * Theorems for additive ring operations (locale abelian_monoid and
3104 descendants) are generated by interpretation from their multiplicative
3105 counterparts. Names (in particular theorem names) have the mandatory
3106 qualifier 'add'. Previous theorem names are redeclared for
3109 * Structure "int_ring" is now an abbreviation (previously a
3110 definition). This fits more natural with advanced interpretations.
3115 * The domain package now runs in definitional mode by default: The
3116 former command 'new_domain' is now called 'domain'. To use the domain
3117 package in its original axiomatic mode, use 'domain (unsafe)'.
3120 * The new class "domain" is now the default sort. Class "predomain"
3121 is an unpointed version of "domain". Theories can be updated by
3122 replacing sort annotations as shown below. INCOMPATIBILITY.
3124 'a::type ~> 'a::countable
3125 'a::cpo ~> 'a::predomain
3126 'a::pcpo ~> 'a::domain
3128 * The old type class "rep" has been superseded by class "domain".
3129 Accordingly, users of the definitional package must remove any
3130 "default_sort rep" declarations. INCOMPATIBILITY.
3132 * The domain package (definitional mode) now supports unpointed
3133 predomain argument types, as long as they are marked 'lazy'. (Strict
3134 arguments must be in class "domain".) For example, the following
3135 domain definition now works:
3137 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3139 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3140 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3141 'a option, and 'a list. Additionally, it configures fixrec and the
3142 domain package to work with these types. For example:
3144 fixrec isInl :: "('a + 'b) u -> tr"
3145 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3147 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3149 * The "(permissive)" option of fixrec has been replaced with a
3150 per-equation "(unchecked)" option. See
3151 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3153 * The "bifinite" class no longer fixes a constant "approx"; the class
3154 now just asserts that such a function exists. INCOMPATIBILITY.
3156 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3157 defines an embedding of type 'a defl into udom by default; instances
3158 of "bifinite" and "domain" classes are available in
3159 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3161 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3163 * The predicate "directed" has been removed. INCOMPATIBILITY.
3165 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3167 * The function "cprod_map" has been renamed to "prod_map".
3170 * The monadic bind operator on each powerdomain has new binder syntax
3171 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3172 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3174 * The infix syntax for binary union on each powerdomain has changed
3175 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3176 syntax. INCOMPATIBILITY.
3178 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3179 still supported as an input translation.
3181 * Renamed some theorems (the original names are also still available).
3183 expand_fun_below ~> fun_below_iff
3184 below_fun_ext ~> fun_belowI
3185 expand_cfun_eq ~> cfun_eq_iff
3186 ext_cfun ~> cfun_eqI
3187 expand_cfun_below ~> cfun_below_iff
3188 below_cfun_ext ~> cfun_belowI
3189 cont2cont_Rep_CFun ~> cont2cont_APP
3191 * The Abs and Rep functions for various types have changed names.
3192 Related theorem names have also changed to match. INCOMPATIBILITY.
3194 Rep_CFun ~> Rep_cfun
3195 Abs_CFun ~> Abs_cfun
3196 Rep_Sprod ~> Rep_sprod
3197 Abs_Sprod ~> Abs_sprod
3198 Rep_Ssum ~> Rep_ssum
3199 Abs_Ssum ~> Abs_ssum
3201 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3202 been renamed to *_bottom_iff. INCOMPATIBILITY.
3204 * Various changes to bisimulation/coinduction with domain package:
3206 - Definitions of "bisim" constants no longer mention definedness.
3207 - With mutual recursion, "bisim" predicate is now curried.
3208 - With mutual recursion, each type gets a separate coind theorem.
3209 - Variable names in bisim_def and coinduct rules have changed.
3213 * Case combinators generated by the domain package for type "foo" are
3214 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3216 * Several theorems have been renamed to more accurately reflect the
3217 names of constants and types involved. INCOMPATIBILITY.
3219 thelub_const ~> lub_const
3220 lub_const ~> is_lub_const
3222 is_lub_lub ~> is_lubD2
3224 unique_lub ~> is_lub_unique
3225 is_ub_lub ~> is_lub_rangeD1
3226 lub_bin_chain ~> is_lub_bin_chain
3227 lub_fun ~> is_lub_fun
3228 thelub_fun ~> lub_fun
3229 thelub_cfun ~> lub_cfun
3230 thelub_Pair ~> lub_Pair
3231 lub_cprod ~> is_lub_prod
3232 thelub_cprod ~> lub_prod
3233 minimal_cprod ~> minimal_prod
3234 inst_cprod_pcpo ~> inst_prod_pcpo
3236 compact_UU ~> compact_bottom
3237 deflation_UU ~> deflation_bottom
3238 finite_deflation_UU ~> finite_deflation_bottom
3240 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3242 sq_ord_less_eq_trans ~> below_eq_trans
3243 sq_ord_eq_less_trans ~> eq_below_trans
3244 refl_less ~> below_refl
3245 trans_less ~> below_trans
3246 antisym_less ~> below_antisym
3247 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3248 box_less ~> box_below
3249 rev_trans_less ~> rev_below_trans
3250 not_less2not_eq ~> not_below2not_eq
3251 less_UU_iff ~> below_UU_iff
3252 flat_less_iff ~> flat_below_iff
3253 adm_less ~> adm_below
3254 adm_not_less ~> adm_not_below
3255 adm_compact_not_less ~> adm_compact_not_below
3256 less_fun_def ~> below_fun_def
3257 expand_fun_less ~> fun_below_iff
3258 less_fun_ext ~> fun_belowI
3259 less_discr_def ~> below_discr_def
3260 discr_less_eq ~> discr_below_eq
3261 less_unit_def ~> below_unit_def
3262 less_cprod_def ~> below_prod_def
3263 prod_lessI ~> prod_belowI
3264 Pair_less_iff ~> Pair_below_iff
3265 fst_less_iff ~> fst_below_iff
3266 snd_less_iff ~> snd_below_iff
3267 expand_cfun_less ~> cfun_below_iff
3268 less_cfun_ext ~> cfun_belowI
3269 injection_less ~> injection_below
3270 less_up_def ~> below_up_def
3271 not_Iup_less ~> not_Iup_below
3272 Iup_less ~> Iup_below
3274 Def_inject_less_eq ~> Def_below_Def
3275 Def_less_is_eq ~> Def_below_iff
3276 spair_less_iff ~> spair_below_iff
3277 less_sprod ~> below_sprod
3278 spair_less ~> spair_below
3279 sfst_less_iff ~> sfst_below_iff
3280 ssnd_less_iff ~> ssnd_below_iff
3281 fix_least_less ~> fix_least_below
3282 dist_less_one ~> dist_below_one
3283 less_ONE ~> below_ONE
3284 ONE_less_iff ~> ONE_below_iff
3285 less_sinlD ~> below_sinlD
3286 less_sinrD ~> below_sinrD
3291 * All constant names are now qualified internally and use proper
3292 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3297 * Antiquotation @{assert} inlines a function bool -> unit that raises
3298 Fail if the argument is false. Due to inlining the source position of
3299 failed assertions is included in the error output.
3301 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3302 text is in practice always evaluated with a stable theory checkpoint.
3303 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3305 * Antiquotation @{theory A} refers to theory A from the ancestry of
3306 the current context, not any accidental theory loader state as before.
3307 Potential INCOMPATIBILITY, subtle change in semantics.
3309 * Syntax.pretty_priority (default 0) configures the required priority
3310 of pretty-printed output and thus affects insertion of parentheses.
3312 * Syntax.default_root (default "any") configures the inner syntax
3313 category (nonterminal symbol) for parsing of terms.
3315 * Former exception Library.UnequalLengths now coincides with
3316 ListPair.UnequalLengths.
3318 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3319 main functionality is provided by structure Simplifier.
3321 * Renamed raw "explode" function to "raw_explode" to emphasize its
3322 meaning. Note that internally to Isabelle, Symbol.explode is used in
3323 almost all situations.
3325 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3326 See implementation manual for further details on exceptions in
3329 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3332 * Renamed structure PureThy to Pure_Thy and moved most of its
3333 operations to structure Global_Theory, to emphasize that this is
3334 rarely-used global-only stuff.
3336 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3337 instead (or tracing for high-volume output).
3339 * Configuration option show_question_marks only affects regular pretty
3340 printing of types and terms, not raw Term.string_of_vname.
3342 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3343 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3344 @{thms} for most purposes.
3346 * ML structure Unsynchronized is never opened, not even in Isar
3347 interaction mode as before. Old Unsynchronized.set etc. have been
3348 discontinued -- use plain := instead. This should be *rare* anyway,
3349 since modern tools always work via official context data, notably
3350 configuration options.
3352 * Parallel and asynchronous execution requires special care concerning
3353 interrupts. Structure Exn provides some convenience functions that
3354 avoid working directly with raw Interrupt. User code must not absorb
3355 interrupts -- intermediate handling (for cleanup etc.) needs to be
3356 followed by re-raising of the original exception. Another common
3357 source of mistakes are "handle _" patterns, which make the meaning of
3358 the program subject to physical effects of the environment.
3362 New in Isabelle2009-2 (June 2010)
3363 ---------------------------------
3367 * Authentic syntax for *all* logical entities (type classes, type
3368 constructors, term constants): provides simple and robust
3369 correspondence between formal entities and concrete syntax. Within
3370 the parse tree / AST representations, "constants" are decorated by
3371 their category (class, type, const) and spelled out explicitly with
3372 their full internal name.
3374 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3375 and translations (translation rules and translation functions in ML).
3376 Some hints on upgrading:
3378 - Many existing uses of 'syntax' and 'translations' can be replaced
3379 by more modern 'type_notation', 'notation' and 'abbreviation',
3380 which are independent of this issue.
3382 - 'translations' require markup within the AST; the term syntax
3383 provides the following special forms:
3385 CONST c -- produces syntax version of constant c from context
3386 XCONST c -- literally c, checked as constant from context
3387 c -- literally c, if declared by 'syntax'
3389 Plain identifiers are treated as AST variables -- occasionally the
3390 system indicates accidental variables via the error "rhs contains
3393 Type classes and type constructors are marked according to their
3394 concrete syntax. Some old translations rules need to be written
3395 for the "type" category, using type constructor application
3396 instead of pseudo-term application of the default category
3399 - 'parse_translation' etc. in ML may use the following
3402 @{class_syntax c} -- type class c within parse tree / AST
3403 @{term_syntax c} -- type constructor c within parse tree / AST
3404 @{const_syntax c} -- ML version of "CONST c" above
3405 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3407 - Literal types within 'typed_print_translations', i.e. those *not*
3408 represented as pseudo-terms are represented verbatim. Use @{class
3409 c} or @{type_name c} here instead of the above syntax
3412 Note that old non-authentic syntax was based on unqualified base
3413 names, so all of the above "constant" names would coincide. Recall
3414 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3415 diagnose syntax problems.
3417 * Type constructors admit general mixfix syntax, not just infix.
3419 * Concrete syntax may be attached to local entities without a proof
3420 body, too. This works via regular mixfix annotations for 'fix',
3421 'def', 'obtain' etc. or via the explicit 'write' command, which is
3422 similar to the 'notation' command in theory specifications.
3424 * Discontinued unnamed infix syntax (legacy feature for many years) --
3425 need to specify constant name and syntax separately. Internal ML
3426 datatype constructors have been renamed from InfixName to Infix etc.
3427 Minor INCOMPATIBILITY.
3429 * Schematic theorem statements need to be explicitly markup as such,
3430 via commands 'schematic_lemma', 'schematic_theorem',
3431 'schematic_corollary'. Thus the relevance of the proof is made
3432 syntactically clear, which impacts performance in a parallel or
3433 asynchronous interactive environment. Minor INCOMPATIBILITY.
3435 * Use of cumulative prems via "!" in some proof methods has been
3436 discontinued (old legacy feature).
3438 * References 'trace_simp' and 'debug_simp' have been replaced by
3439 configuration options stored in the context. Enabling tracing (the
3440 case of debugging is similar) in proofs works via
3442 using [[trace_simp = true]]
3444 Tracing is then active for all invocations of the simplifier in
3445 subsequent goal refinement steps. Tracing may also still be enabled or
3446 disabled via the ProofGeneral settings menu.
3448 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3449 'hide_fact' replace the former 'hide' KIND command. Minor
3452 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3453 more efficient than combinations with -q1 or -q2.
3458 * Proofterms record type-class reasoning explicitly, using the
3459 "unconstrain" operation internally. This eliminates all sort
3460 constraints from a theorem and proof, introducing explicit
3461 OFCLASS-premises. On the proof term level, this operation is
3462 automatically applied at theorem boundaries, such that closed proofs
3463 are always free of sort constraints. INCOMPATIBILITY for tools that
3464 inspect proof terms.
3466 * Local theory specifications may depend on extra type variables that
3467 are not present in the result type -- arguments TYPE('a) :: 'a itself
3468 are added internally. For example:
3470 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3472 * Predicates of locales introduced by classes carry a mandatory
3473 "class" prefix. INCOMPATIBILITY.
3475 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3477 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3480 * Command 'code_reflect' allows to incorporate generated ML code into
3481 runtime environment; replaces immature code_datatype antiquotation.
3484 * Code generator: simple concept for abstract datatypes obeying
3487 * Code generator: details of internal data cache have no impact on the
3488 user space functionality any longer.
3490 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3491 subgoals. This is more appropriate for interpretations with 'where'.
3494 * Command 'example_proof' opens an empty proof body. This allows to
3495 experiment with Isar, without producing any persistent result.
3497 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3498 within a local theory context, with explicit checking of the
3499 constructors involved (in contrast to the raw 'syntax' versions).
3501 * Commands 'types' and 'typedecl' now work within a local theory
3502 context -- without introducing dependencies on parameters or
3503 assumptions, which is not possible in Isabelle/Pure.
3505 * Command 'defaultsort' has been renamed to 'default_sort', it works
3506 within a local theory context. Minor INCOMPATIBILITY.
3511 * Command 'typedef' now works within a local theory context -- without
3512 introducing dependencies on parameters or assumptions, which is not
3513 possible in Isabelle/Pure/HOL. Note that the logical environment may
3514 contain multiple interpretations of local typedefs (with different
3515 non-emptiness proofs), even in a global theory context.
3517 * New package for quotient types. Commands 'quotient_type' and
3518 'quotient_definition' may be used for defining types and constants by
3519 quotient constructions. An example is the type of integers created by
3520 quotienting pairs of natural numbers:
3523 intrel :: "(nat * nat) => (nat * nat) => bool"
3525 "intrel (x, y) (u, v) = (x + v = u + y)"
3527 quotient_type int = "nat * nat" / intrel
3528 by (auto simp add: equivp_def expand_fun_eq)
3531 "0::int" is "(0::nat, 0::nat)"
3533 The method "lifting" can be used to lift of theorems from the
3534 underlying "raw" type to the quotient type. The example
3535 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3536 construction and provides a reasoning infrastructure for finite sets.
3538 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3539 clash with new theory Quotient in Main HOL.
3541 * Moved the SMT binding into the main HOL session, eliminating
3542 separate HOL-SMT session.
3544 * List membership infix mem operation is only an input abbreviation.
3547 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3548 for future developements; former Library/Word.thy is still present in
3549 the AFP entry RSAPPS.
3551 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3552 longer shadowed. INCOMPATIBILITY.
3554 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3557 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3560 * Dropped normalizing_semiring etc; use the facts in semiring classes
3561 instead. INCOMPATIBILITY.
3563 * Dropped several real-specific versions of lemmas about floor and
3564 ceiling; use the generic lemmas from theory "Archimedean_Field"
3565 instead. INCOMPATIBILITY.
3567 floor_number_of_eq ~> floor_number_of
3568 le_floor_eq_number_of ~> number_of_le_floor
3569 le_floor_eq_zero ~> zero_le_floor
3570 le_floor_eq_one ~> one_le_floor
3571 floor_less_eq_number_of ~> floor_less_number_of
3572 floor_less_eq_zero ~> floor_less_zero
3573 floor_less_eq_one ~> floor_less_one
3574 less_floor_eq_number_of ~> number_of_less_floor
3575 less_floor_eq_zero ~> zero_less_floor
3576 less_floor_eq_one ~> one_less_floor
3577 floor_le_eq_number_of ~> floor_le_number_of
3578 floor_le_eq_zero ~> floor_le_zero
3579 floor_le_eq_one ~> floor_le_one
3580 floor_subtract_number_of ~> floor_diff_number_of
3581 floor_subtract_one ~> floor_diff_one
3582 ceiling_number_of_eq ~> ceiling_number_of
3583 ceiling_le_eq_number_of ~> ceiling_le_number_of
3584 ceiling_le_zero_eq ~> ceiling_le_zero
3585 ceiling_le_eq_one ~> ceiling_le_one
3586 less_ceiling_eq_number_of ~> number_of_less_ceiling
3587 less_ceiling_eq_zero ~> zero_less_ceiling
3588 less_ceiling_eq_one ~> one_less_ceiling
3589 ceiling_less_eq_number_of ~> ceiling_less_number_of
3590 ceiling_less_eq_zero ~> ceiling_less_zero
3591 ceiling_less_eq_one ~> ceiling_less_one
3592 le_ceiling_eq_number_of ~> number_of_le_ceiling
3593 le_ceiling_eq_zero ~> zero_le_ceiling
3594 le_ceiling_eq_one ~> one_le_ceiling
3595 ceiling_subtract_number_of ~> ceiling_diff_number_of
3596 ceiling_subtract_one ~> ceiling_diff_one
3598 * Theory "Finite_Set": various folding_XXX locales facilitate the
3599 application of the various fold combinators on finite sets.
3601 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3602 provides abstract red-black tree type which is backed by "RBT_Impl" as
3603 implementation. INCOMPATIBILTY.
3605 * Theory Library/Coinductive_List has been removed -- superseded by
3606 AFP/thys/Coinductive.
3608 * Theory PReal, including the type "preal" and related operations, has
3609 been removed. INCOMPATIBILITY.
3611 * Real: new development using Cauchy Sequences.
3613 * Split off theory "Big_Operators" containing setsum, setprod,
3614 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3616 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3617 "Int" etc. INCOMPATIBILITY.
3619 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3621 * New set of rules "ac_simps" provides combined assoc / commute
3622 rewrites for all interpretations of the appropriate generic locales.
3624 * Renamed theory "OrderedGroup" to "Groups" and split theory
3625 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3626 appropriate and more consistent names suitable for name prefixes
3627 within the HOL theories. INCOMPATIBILITY.
3629 * Some generic constants have been put to appropriate theories:
3630 - less_eq, less: Orderings
3631 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3632 - inverse, divide: Rings
3635 * More consistent naming of type classes involving orderings (and
3638 lower_semilattice ~> semilattice_inf
3639 upper_semilattice ~> semilattice_sup
3641 dense_linear_order ~> dense_linorder
3643 pordered_ab_group_add ~> ordered_ab_group_add
3644 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3645 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3646 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3647 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3648 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3649 pordered_cancel_semiring ~> ordered_cancel_semiring
3650 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3651 pordered_comm_ring ~> ordered_comm_ring
3652 pordered_comm_semiring ~> ordered_comm_semiring
3653 pordered_ring ~> ordered_ring
3654 pordered_ring_abs ~> ordered_ring_abs
3655 pordered_semiring ~> ordered_semiring
3657 ordered_ab_group_add ~> linordered_ab_group_add
3658 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3659 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3660 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3661 ordered_field ~> linordered_field
3662 ordered_field_no_lb ~> linordered_field_no_lb
3663 ordered_field_no_ub ~> linordered_field_no_ub
3664 ordered_field_dense_linear_order ~> dense_linordered_field
3665 ordered_idom ~> linordered_idom
3666 ordered_ring ~> linordered_ring
3667 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3668 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3669 ordered_ring_strict ~> linordered_ring_strict
3670 ordered_semidom ~> linordered_semidom
3671 ordered_semiring ~> linordered_semiring
3672 ordered_semiring_1 ~> linordered_semiring_1
3673 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3674 ordered_semiring_strict ~> linordered_semiring_strict
3676 The following slightly odd type classes have been moved to a
3677 separate theory Library/Lattice_Algebras:
3679 lordered_ab_group_add ~> lattice_ab_group_add
3680 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3681 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3682 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3683 lordered_ring ~> lattice_ring
3687 * Refined field classes:
3688 - classes division_ring_inverse_zero, field_inverse_zero,
3689 linordered_field_inverse_zero include rule inverse 0 = 0 --
3690 subsumes former division_by_zero class;
3691 - numerous lemmas have been ported from field to division_ring.
3694 * Refined algebra theorem collections:
3695 - dropped theorem group group_simps, use algebra_simps instead;
3696 - dropped theorem group ring_simps, use field_simps instead;
3697 - proper theorem collection field_simps subsumes former theorem
3698 groups field_eq_simps and field_simps;
3699 - dropped lemma eq_minus_self_iff which is a duplicate for
3703 * Theory Finite_Set and List: some lemmas have been generalized from
3706 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3707 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3708 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3709 union_Union_fold_union ~> sup_Sup_fold_sup
3710 Inter_fold_inter ~> Inf_fold_inf
3711 Union_fold_union ~> Sup_fold_sup
3712 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3713 union_UNION_fold_union ~> sup_SUPR_fold_sup
3714 INTER_fold_inter ~> INFI_fold_inf
3715 UNION_fold_union ~> SUPR_fold_sup
3717 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3718 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3719 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3720 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3721 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3722 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3724 * Reorganized theory Multiset: swapped notation of pointwise and
3727 - pointwise ordering is instance of class order with standard syntax
3729 - multiset ordering has syntax <=# and <#; partial order properties
3730 are provided by means of interpretation with prefix
3732 - less duplication, less historical organization of sections,
3733 conversion from associations lists to multisets, rudimentary code
3735 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3740 multiset_eq_conv_count_eq ~> multiset_ext_iff
3741 multi_count_ext ~> multiset_ext
3742 diff_union_inverse2 ~> diff_union_cancelR
3746 * Theory Permutation: replaced local "remove" by List.remove1.
3748 * Code generation: ML and OCaml code is decorated with signatures.
3750 * Theory List: added transpose.
3752 * Library/Nat_Bijection.thy is a collection of bijective functions
3753 between nat and other types, which supersedes the older libraries
3754 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3757 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3758 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3759 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3760 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3761 Countable.pair_encode ~> prod_encode
3762 NatIso.prod2nat ~> prod_encode
3763 NatIso.nat2prod ~> prod_decode
3764 NatIso.sum2nat ~> sum_encode
3765 NatIso.nat2sum ~> sum_decode
3766 NatIso.list2nat ~> list_encode
3767 NatIso.nat2list ~> list_decode
3768 NatIso.set2nat ~> set_encode
3769 NatIso.nat2set ~> set_decode
3772 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3773 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3774 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3775 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3776 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3777 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3778 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3779 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3780 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3781 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3782 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3783 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3784 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3787 - Renamed ATP commands:
3788 atp_info ~> sledgehammer running_atps
3789 atp_kill ~> sledgehammer kill_atps
3790 atp_messages ~> sledgehammer messages
3791 atp_minimize ~> sledgehammer minimize
3792 print_atps ~> sledgehammer available_atps
3794 - Added user's manual ("isabelle doc sledgehammer").
3795 - Added option syntax and "sledgehammer_params" to customize
3796 Sledgehammer's behavior. See the manual for details.
3797 - Modified the Isar proof reconstruction code so that it produces
3798 direct proofs rather than proofs by contradiction. (This feature
3799 is still experimental.)
3800 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3802 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3805 - Added and implemented "binary_ints" and "bits" options.
3806 - Added "std" option and implemented support for nonstandard models.
3807 - Added and implemented "finitize" option to improve the precision
3808 of infinite datatypes based on a monotonicity analysis.
3809 - Added support for quotient types.
3810 - Added support for "specification" and "ax_specification"
3812 - Added support for local definitions (for "function" and
3813 "termination" proofs).
3814 - Added support for term postprocessors.
3815 - Optimized "Multiset.multiset" and "FinFun.finfun".
3816 - Improved efficiency of "destroy_constrs" optimization.
3817 - Fixed soundness bugs related to "destroy_constrs" optimization and
3819 - Fixed soundness bug related to higher-order constructors.
3820 - Fixed soundness bug when "full_descrs" is enabled.
3821 - Improved precision of set constructs.
3822 - Added "atoms" option.
3823 - Added cache to speed up repeated Kodkod invocations on the same
3825 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3826 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3827 "SAT4J_Light". INCOMPATIBILITY.
3828 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3829 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3830 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3832 * Method "induct" now takes instantiations of the form t, where t is not
3833 a variable, as a shorthand for "x == t", where x is a fresh variable.
3834 If this is not intended, t has to be enclosed in parentheses.
3835 By default, the equalities generated by definitional instantiations
3836 are pre-simplified, which may cause parameters of inductive cases
3837 to disappear, or may even delete some of the inductive cases.
3838 Use "induct (no_simp)" instead of "induct" to restore the old
3839 behaviour. The (no_simp) option is also understood by the "cases"
3840 and "nominal_induct" methods, which now perform pre-simplification, too.
3846 * Variable names in lemmas generated by the domain package have
3847 changed; the naming scheme is now consistent with the HOL datatype
3848 package. Some proof scripts may be affected, INCOMPATIBILITY.
3850 * The domain package no longer defines the function "foo_copy" for
3851 recursive domain "foo". The reach lemma is now stated directly in
3852 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3853 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3855 * Most definedness lemmas generated by the domain package (previously
3856 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3857 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3858 Proofs that used definedness lemmas as intro rules may break,
3859 potential INCOMPATIBILITY.
3861 * Induction and casedist rules generated by the domain package now
3862 declare proper case_names (one called "bottom", and one named for each
3863 constructor). INCOMPATIBILITY.
3865 * For mutually-recursive domains, separate "reach" and "take_lemma"
3866 rules are generated for each domain, INCOMPATIBILITY.
3868 foo_bar.reach ~> foo.reach bar.reach
3869 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3871 * Some lemmas generated by the domain package have been renamed for
3872 consistency with the datatype package, INCOMPATIBILITY.
3874 foo.ind ~> foo.induct
3875 foo.finite_ind ~> foo.finite_induct
3876 foo.coind ~> foo.coinduct
3877 foo.casedist ~> foo.exhaust
3878 foo.exhaust ~> foo.nchotomy
3880 * For consistency with other definition packages, the fixrec package
3881 now generates qualified theorem names, INCOMPATIBILITY.
3883 foo_simps ~> foo.simps
3884 foo_unfold ~> foo.unfold
3885 foo_induct ~> foo.induct
3887 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3888 method and internal fixrec proofs now use the default simpset instead.
3891 * The "contlub" predicate has been removed. Proof scripts should use
3892 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3894 * The "admw" predicate has been removed, INCOMPATIBILITY.
3896 * The constants cpair, cfst, and csnd have been removed in favor of
3897 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3902 * Antiquotations for basic formal entities:
3904 @{class NAME} -- type class
3905 @{class_syntax NAME} -- syntax representation of the above
3907 @{type_name NAME} -- logical type
3908 @{type_abbrev NAME} -- type abbreviation
3909 @{nonterminal NAME} -- type of concrete syntactic category
3910 @{type_syntax NAME} -- syntax representation of any of the above
3912 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3913 @{const_abbrev NAME} -- abbreviated constant
3914 @{const_syntax NAME} -- syntax representation of any of the above
3916 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3917 syntax constant (cf. 'syntax' command).
3919 * Antiquotation @{make_string} inlines a function to print arbitrary
3920 values similar to the ML toplevel. The result is compiler dependent
3921 and may fall back on "?" in certain situations.
3923 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3924 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3925 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3926 not work with the asynchronous Isar document model.
3928 * Configuration options now admit dynamic default values, depending on
3929 the context or even global references.
3931 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3932 uses an efficient external library if available (for Poly/ML).
3934 * Renamed some important ML structures, while keeping the old names
3935 for some time as aliases within the structure Legacy:
3937 OuterKeyword ~> Keyword
3940 OuterSyntax ~> Outer_Syntax
3941 PrintMode ~> Print_Mode
3942 SpecParse ~> Parse_Spec
3945 ThyOutput ~> Thy_Output
3946 TypeInfer ~> Type_Infer
3948 Note that "open Legacy" simplifies porting of sources, but forgetting
3949 to remove it again will complicate porting again in the future.
3951 * Most operations that refer to a global context are named
3952 accordingly, e.g. Simplifier.global_context or
3953 ProofContext.init_global. There are some situations where a global
3954 context actually works, but under normal circumstances one needs to
3955 pass the proper local context through the code!
3957 * Discontinued old TheoryDataFun with its copy/init operation -- data
3958 needs to be pure. Functor Theory_Data_PP retains the traditional
3959 Pretty.pp argument to merge, which is absent in the standard
3960 Theory_Data version.
3962 * Sorts.certify_sort and derived "cert" operations for types and terms
3963 no longer minimize sorts. Thus certification at the boundary of the
3964 inference kernel becomes invariant under addition of class relations,
3965 which is an important monotonicity principle. Sorts are now minimized
3966 in the syntax layer only, at the boundary between the end-user and the
3967 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3968 explicitly in rare situations.
3970 * Renamed old-style Drule.standard to Drule.export_without_context, to
3971 emphasize that this is in no way a standard operation.
3974 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3975 usual for resolution. Rare INCOMPATIBILITY.
3977 * Renamed varify/unvarify operations to varify_global/unvarify_global
3978 to emphasize that these only work in a global situation (which is
3981 * Curried take and drop in library.ML; negative length is interpreted
3982 as infinity (as in chop). Subtle INCOMPATIBILITY.
3984 * Proof terms: type substitutions on proof constants now use canonical
3985 order of type variables. INCOMPATIBILITY for tools working with proof
3988 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3989 may no longer carry premises. User-level specifications are
3990 transformed accordingly by Thm.add_axiom/add_def.
3995 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3996 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3997 proof terms are enabled unconditionally in the new HOL-Proofs image.
3999 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4000 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4003 * Old lib/scripts/polyml-platform is superseded by the
4004 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4005 variant, even on a 64 bit machine. The following example setting
4006 prefers 64 bit if available:
4008 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4010 * The preliminary Isabelle/jEdit application demonstrates the emerging
4011 Isabelle/Scala layer for advanced prover interaction and integration.
4012 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4015 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4016 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4017 similar to the default assignment of the document preparation system
4018 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4019 provides some operations for direct access to the font without asking
4020 the user for manual installation.
4024 New in Isabelle2009-1 (December 2009)
4025 -------------------------------------
4029 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4030 one backslash should be used, even in ML sources.
4035 * Locale interpretation propagates mixins along the locale hierarchy.
4036 The currently only available mixins are the equations used to map
4037 local definitions to terms of the target domain of an interpretation.
4039 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4040 loc" to print all interpretations of locale "loc" in the theory.
4041 Interpretations in proofs are not shown.
4043 * Thoroughly revised locales tutorial. New section on conditional
4046 * On instantiation of classes, remaining undefined class parameters
4047 are formally declared. INCOMPATIBILITY.
4050 *** Document preparation ***
4052 * New generalized style concept for printing terms: @{foo (style) ...}
4053 instead of @{foo_style style ...} (old form is still retained for
4054 backward compatibility). Styles can be also applied for
4055 antiquotations prop, term_type and typeof.
4060 * New proof method "smt" for a combination of first-order logic with
4061 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4062 fixed-size bitvectors; there is also basic support for higher-order
4063 features (esp. lambda abstractions). It is an incomplete decision
4064 procedure based on external SMT solvers using the oracle mechanism;
4065 for the SMT solver Z3, this method is proof-producing. Certificates
4066 are provided to avoid calling the external solvers solely for
4067 re-checking proofs. Due to a remote SMT service there is no need for
4068 installing SMT solvers locally. See src/HOL/SMT.
4070 * New commands to load and prove verification conditions generated by
4071 the Boogie program verifier or derived systems (e.g. the Verifying C
4072 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4074 * New counterexample generator tool 'nitpick' based on the Kodkod
4075 relational model finder. See src/HOL/Tools/Nitpick and
4076 src/HOL/Nitpick_Examples.
4078 * New commands 'code_pred' and 'values' to invoke the predicate
4079 compiler and to enumerate values of inductive predicates.
4081 * A tabled implementation of the reflexive transitive closure.
4083 * New implementation of quickcheck uses generic code generator;
4084 default generators are provided for all suitable HOL types, records
4085 and datatypes. Old quickcheck can be re-activated importing theory
4086 Library/SML_Quickcheck.
4088 * New testing tool Mirabelle for automated proof tools. Applies
4089 several tools and tactics like sledgehammer, metis, or quickcheck, to
4090 every proof step in a theory. To be used in batch mode via the
4091 "mirabelle" utility.
4093 * New proof method "sos" (sum of squares) for nonlinear real
4094 arithmetic (originally due to John Harison). It requires theory
4095 Library/Sum_Of_Squares. It is not a complete decision procedure but
4096 works well in practice on quantifier-free real arithmetic with +, -,
4097 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4098 inequalities between polynomials. It makes use of external
4099 semidefinite programming solvers. Method "sos" generates a
4100 certificate that can be pasted into the proof thus avoiding the need
4101 to call an external tool every time the proof is checked. See
4102 src/HOL/Library/Sum_Of_Squares.
4104 * New method "linarith" invokes existing linear arithmetic decision
4107 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4109 * New Sledgehammer option "Full Types" in Proof General settings menu.
4110 Causes full type information to be output to the ATPs. This slows
4111 ATPs down considerably but eliminates a source of unsound "proofs"
4114 * New method "metisFT": A version of metis that uses full type
4115 information in order to avoid failures of proof reconstruction.
4117 * New evaluator "approximate" approximates an real valued term using
4118 the same method as the approximation method.
4120 * Method "approximate" now supports arithmetic expressions as
4121 boundaries of intervals and implements interval splitting and Taylor
4124 * ML antiquotation @{code_datatype} inserts definition of a datatype
4125 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4127 * New theory SupInf of the supremum and infimum operators for sets of
4130 * New theory Probability, which contains a development of measure
4131 theory, eventually leading to Lebesgue integration and probability.
4133 * Extended Multivariate Analysis to include derivation and Brouwer's
4136 * Reorganization of number theory, INCOMPATIBILITY:
4137 - new number theory development for nat and int, in theories Divides
4138 and GCD as well as in new session Number_Theory
4139 - some constants and facts now suffixed with _nat and _int
4141 - former session NumberTheory now named Old_Number_Theory, including
4142 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4143 - moved theory Pocklington from src/HOL/Library to
4144 src/HOL/Old_Number_Theory
4146 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4147 lcm of finite and infinite sets. It is shown that they form a complete
4150 * Class semiring_div requires superclass no_zero_divisors and proof of
4151 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4152 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4153 generalized to class semiring_div, subsuming former theorems
4154 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4155 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4158 * Refinements to lattice classes and sets:
4159 - less default intro/elim rules in locale variant, more default
4160 intro/elim rules in class variant: more uniformity
4161 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4163 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4165 - renamed ACI to inf_sup_aci
4166 - new class "boolean_algebra"
4167 - class "complete_lattice" moved to separate theory
4168 "Complete_Lattice"; corresponding constants (and abbreviations)
4169 renamed and with authentic syntax:
4170 Set.Inf ~> Complete_Lattice.Inf
4171 Set.Sup ~> Complete_Lattice.Sup
4172 Set.INFI ~> Complete_Lattice.INFI
4173 Set.SUPR ~> Complete_Lattice.SUPR
4174 Set.Inter ~> Complete_Lattice.Inter
4175 Set.Union ~> Complete_Lattice.Union
4176 Set.INTER ~> Complete_Lattice.INTER
4177 Set.UNION ~> Complete_Lattice.UNION
4178 - authentic syntax for
4181 - mere abbreviations:
4184 Set.inter (for inf, formerly Set.Int)
4185 Set.union (for sup, formerly Set.Un)
4186 Complete_Lattice.Inter (for Inf)
4187 Complete_Lattice.Union (for Sup)
4188 Complete_Lattice.INTER (for INFI)
4189 Complete_Lattice.UNION (for SUPR)
4190 - object-logic definitions as far as appropriate
4192 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4193 Un_subset_iff are explicitly deleted as default simp rules; then also
4194 their lattice counterparts le_inf_iff and le_sup_iff have to be
4195 deleted to achieve the desired effect.
4197 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4198 rules by default any longer; the same applies to min_max.inf_absorb1
4199 etc. INCOMPATIBILITY.
4201 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4202 pred_set_conv by default. INCOMPATIBILITY.
4204 * Power operations on relations and functions are now one dedicated
4205 constant "compow" with infix syntax "^^". Power operation on
4206 multiplicative monoids retains syntax "^" and is now defined generic
4207 in class power. INCOMPATIBILITY.
4209 * Relation composition "R O S" now has a more standard argument order:
4210 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4211 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4212 break, since the O_assoc rule was not rewritten like this. Fix using
4213 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4215 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4216 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4219 * Most rules produced by inductive and datatype package have mandatory
4220 prefixes. INCOMPATIBILITY.
4222 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4223 the attribute of the same name. Each of the theorems in the list
4224 DERIV_intros assumes composition with an additional function and
4225 matches a variable to the derivative, which has to be solved by the
4226 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4227 of most elementary terms. Former Maclauren.DERIV_tac and
4228 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4231 * Code generator attributes follow the usual underscore convention:
4232 code_unfold replaces code unfold
4233 code_post replaces code post
4238 sizechange -> size_change
4239 induct_scheme -> induction_schema
4242 * Discontinued abbreviation "arbitrary" of constant "undefined".
4243 INCOMPATIBILITY, use "undefined" directly.
4246 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4247 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4248 Suc_plus1 -> Suc_eq_plus1
4249 *anti_sym -> *antisym*
4250 vector_less_eq_def -> vector_le_def
4253 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4256 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4262 * Theory Representable defines a class "rep" of domains that are
4263 representable (via an ep-pair) in the universal domain type "udom".
4264 Instances are provided for all type constructors defined in HOLCF.
4266 * The 'new_domain' command is a purely definitional version of the
4267 domain package, for representable domains. Syntax is identical to the
4268 old domain package. The 'new_domain' package also supports indirect
4269 recursion using previously-defined type constructors. See
4270 src/HOLCF/ex/New_Domain.thy for examples.
4272 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4273 on the left-hand side of an equation, and then performs
4274 simplification. Rewriting is done using rules declared with the
4275 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4276 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4278 * The pattern-match compiler in 'fixrec' can now handle constructors
4279 with HOL function types. Pattern-match combinators for the Pair
4280 constructor are pre-configured.
4282 * The 'fixrec' package now produces better fixed-point induction rules
4283 for mutually-recursive definitions: Induction rules have conclusions
4284 of the form "P foo bar" instead of "P <foo, bar>".
4286 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4287 been renamed to "below". The name "below" now replaces "less" in many
4288 theorem names. (Legacy theorem names using "less" are still supported
4291 * The 'fixrec' package now supports "bottom patterns". Bottom
4292 patterns can be used to generate strictness rules, or to make
4293 functions more strict (much like the bang-patterns supported by the
4294 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4300 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4301 errors and run-time exceptions, including detailed source positions.
4303 * Structure Name_Space (formerly NameSpace) now manages uniquely
4304 identified entries, with some additional information such as source
4305 position, logical grouping etc.
4307 * Theory and context data is now introduced by the simplified and
4308 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4309 to be pure, but the old TheoryDataFun for mutable data (with explicit
4310 copy operation) is still available for some time.
4312 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4313 provides a high-level programming interface to synchronized state
4314 variables with atomic update. This works via pure function
4315 application within a critical section -- its runtime should be as
4316 short as possible; beware of deadlocks if critical code is nested,
4317 either directly or indirectly via other synchronized variables!
4319 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4320 wraps raw ML references, explicitly indicating their non-thread-safe
4321 behaviour. The Isar toplevel keeps this structure open, to
4322 accommodate Proof General as well as quick and dirty interactive
4323 experiments with references.
4325 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4326 parallel tactical reasoning.
4328 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4329 are similar to SUBPROOF, but are slightly more flexible: only the
4330 specified parts of the subgoal are imported into the context, and the
4331 body tactic may introduce new subgoals and schematic variables.
4333 * Old tactical METAHYPS, which does not observe the proof context, has
4334 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4335 or Subgoal.FOCUS etc.
4337 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4338 functors have their own ML name space there is no point to mark them
4339 separately.) Minor INCOMPATIBILITY.
4341 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4343 * Renamed several structures FooBar to Foo_Bar. Occasional,
4346 * Operations of structure Skip_Proof no longer require quick_and_dirty
4347 mode, which avoids critical setmp.
4349 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4350 combinators for "args". INCOMPATIBILITY, need to use simplified
4351 Attrib/Method.setup introduced in Isabelle2009.
4353 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4354 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4355 last resort. INCOMPATIBILITY.
4357 * Display.pretty_thm now requires a proper context (cf. former
4358 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4359 or even Display.pretty_thm_without_context as last resort.
4362 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4363 Syntax.pretty_typ/term directly, preferably with proper context
4364 instead of global theory.
4369 * Further fine tuning of parallel proof checking, scales up to 8 cores
4370 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4373 * Support for additional "Isabelle components" via etc/components, see
4374 also the system manual.
4376 * The isabelle makeall tool now operates on all components with
4377 IsaMakefile, not just hardwired "logics".
4379 * Removed "compress" option from isabelle-process and isabelle usedir;
4380 this is always enabled.
4382 * Discontinued support for Poly/ML 4.x versions.
4384 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4385 on a given logic image. This requires the lighttpd webserver and is
4386 currently supported on Linux only.
4390 New in Isabelle2009 (April 2009)
4391 --------------------------------
4395 * Simplified main Isabelle executables, with less surprises on
4396 case-insensitive file-systems (such as Mac OS).
4398 - The main Isabelle tool wrapper is now called "isabelle" instead of
4401 - The former "isabelle" alias for "isabelle-process" has been
4402 removed (should rarely occur to regular users).
4404 - The former "isabelle-interface" and its alias "Isabelle" have been
4405 removed (interfaces are now regular Isabelle tools).
4407 Within scripts and make files, the Isabelle environment variables
4408 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4409 respectively. (The latter are still available as legacy feature.)
4411 The old isabelle-interface wrapper could react in confusing ways if
4412 the interface was uninstalled or changed otherwise. Individual
4413 interface tool configuration is now more explicit, see also the
4414 Isabelle system manual. In particular, Proof General is now available
4415 via "isabelle emacs".
4417 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4418 purge installed copies of Isabelle executables and re-run "isabelle
4419 install -p ...", or use symlinks.
4421 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4422 old ~/isabelle, which was slightly non-standard and apt to cause
4423 surprises on case-insensitive file-systems (such as Mac OS).
4425 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4426 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4427 care is required when using older releases of Isabelle. Note that
4428 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4429 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4431 * Proofs of fully specified statements are run in parallel on
4432 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4433 a regular 4-core machine, if the initial heap space is made reasonably
4434 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4436 * The main reference manuals ("isar-ref", "implementation", and
4437 "system") have been updated and extended. Formally checked references
4438 as hyperlinks are now available uniformly.
4443 * Complete re-implementation of locales. INCOMPATIBILITY in several
4444 respects. The most important changes are listed below. See the
4445 Tutorial on Locales ("locales" manual) for details.
4447 - In locale expressions, instantiation replaces renaming. Parameters
4448 must be declared in a for clause. To aid compatibility with previous
4449 parameter inheritance, in locale declarations, parameters that are not
4450 'touched' (instantiation position "_" or omitted) are implicitly added
4451 with their syntax at the beginning of the for clause.
4453 - Syntax from abbreviations and definitions in locales is available in
4454 locale expressions and context elements. The latter is particularly
4455 useful in locale declarations.
4457 - More flexible mechanisms to qualify names generated by locale
4458 expressions. Qualifiers (prefixes) may be specified in locale
4459 expressions, and can be marked as mandatory (syntax: "name!:") or
4460 optional (syntax "name?:"). The default depends for plain "name:"
4461 depends on the situation where a locale expression is used: in
4462 commands 'locale' and 'sublocale' prefixes are optional, in
4463 'interpretation' and 'interpret' prefixes are mandatory. The old
4464 implicit qualifiers derived from the parameter names of a locale are
4465 no longer generated.
4467 - Command "sublocale l < e" replaces "interpretation l < e". The
4468 instantiation clause in "interpretation" and "interpret" (square
4469 brackets) is no longer available. Use locale expressions.
4471 - When converting proof scripts, mandatory qualifiers in
4472 'interpretation' and 'interpret' should be retained by default, even
4473 if this is an INCOMPATIBILITY compared to former behavior. In the
4474 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4475 in locale expressions range over a single locale instance only.
4477 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4478 In existing theorem specifications replace the includes element by the
4479 respective context elements of the included locale, omitting those
4480 that are already present in the theorem specification. Multiple
4481 assume elements of a locale should be replaced by a single one
4482 involving the locale predicate. In the proof body, declarations (most
4483 notably theorems) may be regained by interpreting the respective
4484 locales in the proof context as required (command "interpret").
4486 If using "includes" in replacement of a target solely because the
4487 parameter types in the theorem are not as general as in the target,
4488 consider declaring a new locale with additional type constraints on
4489 the parameters (context element "constrains").
4491 - Discontinued "locale (open)". INCOMPATIBILITY.
4493 - Locale interpretation commands no longer attempt to simplify goal.
4494 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4495 methods intro_locales and unfold_locales to clarify.
4497 - Locale interpretation commands no longer accept interpretation
4498 attributes. INCOMPATIBILITY.
4500 * Class declaration: so-called "base sort" must not be given in import
4501 list any longer, but is inferred from the specification. Particularly
4508 class foo = type + ...
4510 * Class target: global versions of theorems stemming do not carry a
4511 parameter prefix any longer. INCOMPATIBILITY.
4513 * Class 'instance' command no longer accepts attached definitions.
4514 INCOMPATIBILITY, use proper 'instantiation' target instead.
4516 * Recovered hiding of consts, which was accidentally broken in
4517 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4518 makes c inaccessible; consider using ``hide (open) const c'' instead.
4520 * Slightly more coherent Pure syntax, with updated documentation in
4521 isar-ref manual. Removed locales meta_term_syntax and
4522 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4523 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4524 directly in regular applications.
4526 * There is a new syntactic category "float_const" for signed decimal
4527 fractions (e.g. 123.45 or -123.45).
4529 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4530 interface with 'setup' command instead.
4532 * Command 'local_setup' is similar to 'setup', but operates on a local
4535 * The 'axiomatization' command now only works within a global theory
4536 context. INCOMPATIBILITY.
4538 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4539 hypotheses. Sorts required in the course of reasoning need to be
4540 covered by the constraints in the initial statement, completed by the
4541 type instance information of the background theory. Non-trivial sort
4542 hypotheses, which rarely occur in practice, may be specified via
4543 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4545 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4547 The result contains an implicit sort hypotheses as before --
4548 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4551 * Generalized Isar history, with support for linear undo, direct state
4554 * Changed defaults for unify configuration options:
4556 unify_trace_bound = 50 (formerly 25)
4557 unify_search_bound = 60 (formerly 30)
4559 * Different bookkeeping for code equations (INCOMPATIBILITY):
4561 a) On theory merge, the last set of code equations for a particular
4562 constant is taken (in accordance with the policy applied by other
4563 parts of the code generator framework).
4565 b) Code equations stemming from explicit declarations (e.g. code
4566 attribute) gain priority over default code equations stemming
4567 from definition, primrec, fun etc.
4569 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4571 * Unified theorem tables for both code generators. Thus [code
4572 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4574 * Command 'find_consts' searches for constants based on type and name
4577 find_consts "_ => bool"
4579 By default, matching is against subtypes, but it may be restricted to
4580 the whole type. Searching by name is possible. Multiple queries are
4581 conjunctive and queries may be negated by prefixing them with a
4584 find_consts strict: "_ => bool" name: "Int" -"int => int"
4586 * New 'find_theorems' criterion "solves" matches theorems that
4587 directly solve the current goal (modulo higher-order unification).
4589 * Auto solve feature for main theorem statements: whenever a new goal
4590 is stated, "find_theorems solves" is called; any theorems that could
4591 solve the lemma directly are listed as part of the goal state.
4592 Cf. associated options in Proof General Isabelle settings menu,
4593 enabled by default, with reasonable timeout for pathological cases of
4594 higher-order unification.
4597 *** Document preparation ***
4599 * Antiquotation @{lemma} now imitates a regular terminal proof,
4600 demanding keyword 'by' and supporting the full method expression
4601 syntax just like the Isar command 'by'.
4606 * Integrated main parts of former image HOL-Complex with HOL. Entry
4607 points Main and Complex_Main remain as before.
4609 * Logic image HOL-Plain provides a minimal HOL with the most important
4610 tools available (inductive, datatype, primrec, ...). This facilitates
4611 experimentation and tool development. Note that user applications
4612 (and library theories) should never refer to anything below theory
4615 * Logic image HOL-Main stops at theory Main, and thus facilitates
4616 experimentation due to shorter build times.
4618 * Logic image HOL-NSA contains theories of nonstandard analysis which
4619 were previously part of former HOL-Complex. Entry point Hyperreal
4620 remains valid, but theories formerly using Complex_Main should now use
4621 new entry point Hypercomplex.
4623 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4624 Posix processes. Avoids potentially expensive forking of the ML
4625 process. New thread-based implementation also works on non-Unix
4626 platforms (Cygwin). Provers are no longer hardwired, but defined
4627 within the theory via plain ML wrapper functions. Basic Sledgehammer
4628 commands are covered in the isar-ref manual.
4630 * Wrapper scripts for remote SystemOnTPTP service allows to use
4631 sledgehammer without local ATP installation (Vampire etc.). Other
4632 provers may be included via suitable ML wrappers, see also
4633 src/HOL/ATP_Linkup.thy.
4635 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4638 * The metis method no longer fails because the theorem is too trivial
4639 (contains the empty clause).
4641 * The metis method now fails in the usual manner, rather than raising
4642 an exception, if it determines that it cannot prove the theorem.
4644 * Method "coherent" implements a prover for coherent logic (see also
4645 src/Tools/coherent.ML).
4647 * Constants "undefined" and "default" replace "arbitrary". Usually
4648 "undefined" is the right choice to replace "arbitrary", though
4649 logically there is no difference. INCOMPATIBILITY.
4651 * Command "value" now integrates different evaluation mechanisms. The
4652 result of the first successful evaluation mechanism is printed. In
4653 square brackets a particular named evaluation mechanisms may be
4654 specified (currently, [SML], [code] or [nbe]). See further
4655 src/HOL/ex/Eval_Examples.thy.
4657 * Normalization by evaluation now allows non-leftlinear equations.
4658 Declare with attribute [code nbe].
4660 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4661 as the structured Isar versions "cases" and "induct", cf. the
4662 corresponding "cases" and "induct" attributes. Mutual induction rules
4663 are now presented as a list of individual projections
4664 (e.g. foo_bar.inducts for types foo and bar); the old format with
4665 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4666 rare situations a different rule is selected --- notably nested tuple
4667 elimination instead of former prod.exhaust: use explicit (case_tac t
4668 rule: prod.exhaust) here.
4670 * Attributes "cases", "induct", "coinduct" support "del" option.
4672 * Removed fact "case_split_thm", which duplicates "case_split".
4674 * The option datatype has been moved to a new theory Option. Renamed
4675 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4677 * New predicate "strict_mono" classifies strict functions on partial
4678 orders. With strict functions on linear orders, reasoning about
4679 (in)equalities is facilitated by theorems "strict_mono_eq",
4680 "strict_mono_less_eq" and "strict_mono_less".
4682 * Some set operations are now proper qualified constants with
4683 authentic syntax. INCOMPATIBILITY:
4694 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4697 * Auxiliary class "itself" has disappeared -- classes without any
4698 parameter are treated as expected by the 'class' command.
4700 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4702 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4703 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4705 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4706 method "approximation". It proves formulas on real values by using
4707 interval arithmetic. In the formulas are also the transcendental
4708 functions sin, cos, tan, atan, ln, exp and the constant pi are
4709 allowed. For examples see
4710 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4712 * Theory "Reflection" now resides in HOL/Library.
4714 * Entry point to Word library now simply named "Word".
4717 * Made source layout more coherent with logical distribution
4720 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4721 src/HOL/Library/Code_Message.thy ~> src/HOL/
4722 src/HOL/Library/GCD.thy ~> src/HOL/
4723 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4724 src/HOL/Library/Parity.thy ~> src/HOL/
4725 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4726 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4727 src/HOL/Real/Lubs.thy ~> src/HOL/
4728 src/HOL/Real/PReal.thy ~> src/HOL/
4729 src/HOL/Real/Rational.thy ~> src/HOL/
4730 src/HOL/Real/RComplete.thy ~> src/HOL/
4731 src/HOL/Real/RealDef.thy ~> src/HOL/
4732 src/HOL/Real/RealPow.thy ~> src/HOL/
4733 src/HOL/Real/Real.thy ~> src/HOL/
4734 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4735 src/HOL/Complex/Complex.thy ~> src/HOL/
4736 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4737 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4738 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4739 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4740 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4741 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4742 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4743 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4744 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4745 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4746 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4747 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4748 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4749 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4750 src/HOL/Real/Float ~> src/HOL/Library/
4751 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4752 src/HOL/Real/RealVector.thy ~> src/HOL/
4754 src/HOL/arith_data.ML ~> src/HOL/Tools
4755 src/HOL/hologic.ML ~> src/HOL/Tools
4756 src/HOL/simpdata.ML ~> src/HOL/Tools
4757 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4758 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4759 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4760 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4761 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4762 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4763 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4765 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4766 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4767 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4768 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4769 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4770 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4772 * If methods "eval" and "evaluation" encounter a structured proof
4773 state with !!/==>, only the conclusion is evaluated to True (if
4774 possible), avoiding strange error messages.
4776 * Method "sizechange" automates termination proofs using (a
4777 modification of) the size-change principle. Requires SAT solver. See
4778 src/HOL/ex/Termination.thy for examples.
4780 * Simplifier: simproc for let expressions now unfolds if bound
4781 variable occurs at most once in let expression body. INCOMPATIBILITY.
4783 * Method "arith": Linear arithmetic now ignores all inequalities when
4784 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4786 * New attribute "arith" for facts that should always be used
4787 automatically by arithmetic. It is intended to be used locally in
4790 assumes [arith]: "x > 0"
4792 Global usage is discouraged because of possible performance impact.
4794 * New classes "top" and "bot" with corresponding operations "top" and
4795 "bot" in theory Orderings; instantiation of class "complete_lattice"
4796 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4798 * Changed definition lemma "less_fun_def" in order to provide an
4799 instance for preorders on functions; use lemma "less_le" instead.
4802 * Theory Orderings: class "wellorder" moved here, with explicit
4803 induction rule "less_induct" as assumption. For instantiation of
4804 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4807 * Theory Orderings: added class "preorder" as superclass of "order".
4808 INCOMPATIBILITY: Instantiation proofs for order, linorder
4809 etc. slightly changed. Some theorems named order_class.* now named
4812 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4815 * Theory Finite_Set: added a new fold combinator of type
4817 ('a => 'b => 'b) => 'b => 'a set => 'b
4819 Occasionally this is more convenient than the old fold combinator
4820 which is now defined in terms of the new one and renamed to
4823 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4824 and "ring_simps" have been replaced by "algebra_simps" (which can be
4825 extended with further lemmas!). At the moment both still exist but
4826 the former will disappear at some point.
4828 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4829 class recpower. Type-specific simp rules for various recpower types
4830 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4832 rat_power_0 -> power_0
4833 rat_power_Suc -> power_Suc
4834 realpow_0 -> power_0
4835 realpow_Suc -> power_Suc
4836 complexpow_0 -> power_0
4837 complexpow_Suc -> power_Suc
4838 power_poly_0 -> power_0
4839 power_poly_Suc -> power_Suc
4841 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4842 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4843 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4844 of lemmas from Divides has been generalized from nat to class
4845 semiring_div. INCOMPATIBILITY. This involves the following theorem
4846 renames resulting from duplicate elimination:
4848 dvd_def_mod ~> dvd_eq_mod_eq_0
4849 zero_dvd_iff ~> dvd_0_left_iff
4850 dvd_0 ~> dvd_0_right
4851 DIVISION_BY_ZERO_DIV ~> div_by_0
4852 DIVISION_BY_ZERO_MOD ~> mod_by_0
4853 mult_div ~> div_mult_self2_is_id
4854 mult_mod ~> mod_mult_self2_is_0
4856 * Theory IntDiv: removed many lemmas that are instances of class-based
4857 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4858 rename old lemmas as follows:
4860 dvd_diff -> nat_dvd_diff
4861 dvd_zminus_iff -> dvd_minus_iff
4862 mod_add1_eq -> mod_add_eq
4863 mod_mult1_eq -> mod_mult_right_eq
4864 mod_mult1_eq' -> mod_mult_left_eq
4865 mod_mult_distrib_mod -> mod_mult_eq
4866 nat_mod_add_left_eq -> mod_add_left_eq
4867 nat_mod_add_right_eq -> mod_add_right_eq
4868 nat_mod_div_trivial -> mod_div_trivial
4869 nat_mod_mod_trivial -> mod_mod_trivial
4870 zdiv_zadd_self1 -> div_add_self1
4871 zdiv_zadd_self2 -> div_add_self2
4872 zdiv_zmult_self1 -> div_mult_self2_is_id
4873 zdiv_zmult_self2 -> div_mult_self1_is_id
4874 zdvd_triv_left -> dvd_triv_left
4875 zdvd_triv_right -> dvd_triv_right
4876 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4877 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4878 zmod_zadd_left_eq -> mod_add_left_eq
4879 zmod_zadd_right_eq -> mod_add_right_eq
4880 zmod_zadd_self1 -> mod_add_self1
4881 zmod_zadd_self2 -> mod_add_self2
4882 zmod_zadd1_eq -> mod_add_eq
4883 zmod_zdiff1_eq -> mod_diff_eq
4884 zmod_zdvd_zmod -> mod_mod_cancel
4885 zmod_zmod_cancel -> mod_mod_cancel
4886 zmod_zmult_self1 -> mod_mult_self2_is_0
4887 zmod_zmult_self2 -> mod_mult_self1_is_0
4890 zdvd_abs1 -> abs_dvd_iff
4891 zdvd_abs2 -> dvd_abs_iff
4892 zdvd_refl -> dvd_refl
4893 zdvd_trans -> dvd_trans
4894 zdvd_zadd -> dvd_add
4895 zdvd_zdiff -> dvd_diff
4896 zdvd_zminus_iff -> dvd_minus_iff
4897 zdvd_zminus2_iff -> minus_dvd_iff
4898 zdvd_zmultD -> dvd_mult_right
4899 zdvd_zmultD2 -> dvd_mult_left
4900 zdvd_zmult_mono -> mult_dvd_mono
4901 zdvd_0_right -> dvd_0_right
4902 zdvd_0_left -> dvd_0_left_iff
4903 zdvd_1_left -> one_dvd
4904 zminus_dvd_iff -> minus_dvd_iff
4906 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4908 * The real numbers offer decimal input syntax: 12.34 is translated
4909 into 1234/10^2. This translation is not reversed upon output.
4911 * Theory Library/Polynomial defines an abstract type 'a poly of
4912 univariate polynomials with coefficients of type 'a. In addition to
4913 the standard ring operations, it also supports div and mod. Code
4914 generation is also supported, using list-style constructors.
4916 * Theory Library/Inner_Product defines a class of real_inner for real
4917 inner product spaces, with an overloaded operation inner :: 'a => 'a
4918 => real. Class real_inner is a subclass of real_normed_vector from
4921 * Theory Library/Product_Vector provides instances for the product
4922 type 'a * 'b of several classes from RealVector and Inner_Product.
4923 Definitions of addition, subtraction, scalar multiplication, norms,
4924 and inner products are included.
4926 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4927 addition to the field operations, numerals and case syntax are also
4930 * Theory Library/Diagonalize provides constructive version of Cantor's
4931 first diagonalization argument.
4933 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4934 zlcm (for int); carried together from various gcd/lcm developements in
4935 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4936 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4937 may recover tupled syntax as follows:
4939 hide (open) const gcd
4940 abbreviation gcd where
4941 "gcd == (%(a, b). GCD.gcd a b)"
4943 GCD.gcd ("gcd '(_, _')")
4945 The same works for lcm, zgcd, zlcm.
4947 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4948 instantiations for algebraic structures. Removed some duplicate
4949 theorems. Changes in simp rules. INCOMPATIBILITY.
4951 * ML antiquotation @{code} takes a constant as argument and generates
4952 corresponding code in background and inserts name of the corresponding
4953 resulting ML value/function/datatype constructor binding in place.
4954 All occurrences of @{code} with a single ML block are generated
4955 simultaneously. Provides a generic and safe interface for
4956 instrumentalizing code generation. See
4957 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4958 In future you ought to refrain from ad-hoc compiling generated SML
4959 code on the ML toplevel. Note that (for technical reasons) @{code}
4960 cannot refer to constants for which user-defined serializations are
4961 set. Refer to the corresponding ML counterpart directly in that
4964 * Command 'rep_datatype': instead of theorem names the command now
4965 takes a list of terms denoting the constructors of the type to be
4966 represented as datatype. The characteristic theorems have to be
4967 proven. INCOMPATIBILITY. Also observe that the following theorems
4968 have disappeared in favour of existing ones:
4970 unit_induct ~> unit.induct
4971 prod_induct ~> prod.induct
4972 sum_induct ~> sum.induct
4973 Suc_Suc_eq ~> nat.inject
4974 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4979 * New locales for orders and lattices where the equivalence relation
4980 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4981 locales use a record structure with field eq for the equivalence.
4983 * New theory of factorial domains.
4985 * Units_l_inv and Units_r_inv are now simp rules by default.
4986 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4987 and/or r_inv will now also require deletion of these lemmas.
4989 * Renamed the following theorems, INCOMPATIBILITY:
4991 UpperD ~> Upper_memD
4992 LowerD ~> Lower_memD
4993 least_carrier ~> least_closed
4994 greatest_carrier ~> greatest_closed
4995 greatest_Lower_above ~> greatest_Lower_below
4996 one_zero ~> carrier_one_zero
4997 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5002 * Nominal datatypes can now contain type-variables.
5004 * Commands 'nominal_inductive' and 'equivariance' work with local
5007 * Nominal primrec can now works with local theory targets and its
5008 specification syntax now conforms to the general format as seen in
5011 * Method "perm_simp" honours the standard simplifier attributes
5012 (no_asm), (no_asm_use) etc.
5014 * The new predicate #* is defined like freshness, except that on the
5015 left hand side can be a set or list of atoms.
5017 * Experimental command 'nominal_inductive2' derives strong induction
5018 principles for inductive definitions. In contrast to
5019 'nominal_inductive', which can only deal with a fixed number of
5020 binders, it can deal with arbitrary expressions standing for sets of
5021 atoms to be avoided. The only inductive definition we have at the
5022 moment that needs this generalisation is the typing rule for Lets in
5025 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5026 -----------------------------------------------------------------
5027 Gamma |- Let x be t1 in t2 : T2
5029 In this rule one wants to avoid all the binders that are introduced by
5030 "close Gamma T1". We are looking for other examples where this
5031 feature might be useful. Please let us know.
5036 * Reimplemented the simplification procedure for proving continuity
5037 subgoals. The new simproc is extensible; users can declare additional
5038 continuity introduction rules with the attribute [cont2cont].
5040 * The continuity simproc now uses a different introduction rule for
5041 solving continuity subgoals on terms with lambda abstractions. In
5042 some rare cases the new simproc may fail to solve subgoals that the
5043 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5044 Potential INCOMPATIBILITY.
5046 * Command 'fixrec': specification syntax now conforms to the general
5047 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5048 examples. INCOMPATIBILITY.
5053 * Proof of Zorn's Lemma for partial orders.
5058 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5059 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5060 depends on multithreading, so timouts will not work before Poly/ML
5063 * High-level support for concurrent ML programming, see
5064 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5065 particularly convenient to organize independent functional
5066 computations. The concept of "synchronized variables" provides a
5067 higher-order interface for components with shared state, avoiding the
5068 delicate details of mutexes and condition variables. (Requires
5069 Poly/ML 5.2.1 or later.)
5071 * ML bindings produced via Isar commands are stored within the Isar
5072 context (theory or proof). Consequently, commands like 'use' and 'ML'
5073 become thread-safe and work with undo as expected (concerning
5074 top-level bindings, not side-effects on global references).
5075 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5076 compiler at runtime; really global bindings need to be given outside a
5077 theory. (Requires Poly/ML 5.2 or later.)
5079 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5080 context. Top-level ML bindings are stored within the proof context in
5081 a purely sequential fashion, disregarding the nested proof structure.
5082 ML bindings introduced by 'ML_prf' are discarded at the end of the
5083 proof. (Requires Poly/ML 5.2 or later.)
5085 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5086 and Method.setup, as well as Isar commands 'attribute_setup' and
5087 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5088 existing code accordingly, or use plain 'setup' together with old
5091 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5092 to 'a -> thm, while results are always tagged with an authentic oracle
5093 name. The Isar command 'oracle' is now polymorphic, no argument type
5094 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5095 accordingly. Note that extra performance may be gained by producing
5096 the cterm carefully, avoiding slow Thm.cterm_of.
5098 * Simplified interface for defining document antiquotations via
5099 ThyOutput.antiquotation, ThyOutput.output, and optionally
5100 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5101 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5104 * More systematic treatment of long names, abstract name bindings, and
5105 name space operations. Basic operations on qualified names have been
5106 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5107 Long_Name.append. Old type bstring has been mostly replaced by
5108 abstract type binding (see structure Binding), which supports precise
5109 qualification by packages and local theory targets, as well as proper
5110 tracking of source positions. INCOMPATIBILITY, need to wrap old
5111 bstring values into Binding.name, or better pass through abstract
5112 bindings everywhere. See further src/Pure/General/long_name.ML,
5113 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5115 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5116 LocalTheory.note etc.) now refer to the *full* internal name, not the
5117 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5119 * Disposed old type and term read functions (Sign.read_def_typ,
5120 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5121 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5122 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5123 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5124 resort for legacy applications.
5126 * Disposed old declarations, tactics, tactic combinators that refer to
5127 the simpset or claset of an implicit theory (such as Addsimps,
5128 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5129 embedded ML text, or local_simpset_of with a proper context passed as
5130 explicit runtime argument.
5132 * Rules and tactics that read instantiations (read_instantiate,
5133 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5134 context, which is required for parsing and type-checking. Moreover,
5135 the variables are specified as plain indexnames, not string encodings
5136 thereof. INCOMPATIBILITY.
5138 * Generic Toplevel.add_hook interface allows to analyze the result of
5139 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5140 for theorem dependency output of transactions resulting in a new
5143 * ML antiquotations: block-structured compilation context indicated by
5144 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5146 @{binding name} - basic name binding
5147 @{let ?pat = term} - term abbreviation (HO matching)
5148 @{note name = fact} - fact abbreviation
5149 @{thm fact} - singleton fact (with attributes)
5150 @{thms fact} - general fact (with attributes)
5151 @{lemma prop by method} - singleton goal
5152 @{lemma prop by meth1 meth2} - singleton goal
5153 @{lemma prop1 ... propN by method} - general goal
5154 @{lemma prop1 ... propN by meth1 meth2} - general goal
5155 @{lemma (open) ...} - open derivation
5160 * The Isabelle "emacs" tool provides a specific interface to invoke
5161 Proof General / Emacs, with more explicit failure if that is not
5162 installed (the old isabelle-interface script silently falls back on
5163 isabelle-process). The PROOFGENERAL_HOME setting determines the
5164 installation location of the Proof General distribution.
5166 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5167 the Isabelle process into a JVM/Scala application. See
5168 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5169 process wrapper has been discontinued.)
5171 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5173 * Various status messages (with exact source position information) are
5174 emitted, if proper markup print mode is enabled. This allows
5175 user-interface components to provide detailed feedback on internal
5180 New in Isabelle2008 (June 2008)
5181 -------------------------------
5185 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5186 and updated, with formally checked references as hyperlinks.
5188 * Theory loader: use_thy (and similar operations) no longer set the
5189 implicit ML context, which was occasionally hard to predict and in
5190 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5191 provides a proper context already.
5193 * Theory loader: old-style ML proof scripts being *attached* to a thy
5194 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5195 'use' within a theory file will do the job.
5197 * Name space merge now observes canonical order, i.e. the second space
5198 is inserted into the first one, while existing entries in the first
5199 space take precedence. INCOMPATIBILITY in rare situations, may try to
5200 swap theory imports.
5202 * Syntax: symbol \<chi> is now considered a letter. Potential
5203 INCOMPATIBILITY in identifier syntax etc.
5205 * Outer syntax: string tokens no longer admit escaped white space,
5206 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5207 white space without escapes.
5209 * Outer syntax: string tokens may contain arbitrary character codes
5210 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5216 * Context-dependent token translations. Default setup reverts locally
5217 fixed variables, and adds hilite markup for undeclared frees.
5219 * Unused theorems can be found using the new command 'unused_thms'.
5220 There are three ways of invoking it:
5223 Only finds unused theorems in the current theory.
5225 (2) unused_thms thy_1 ... thy_n -
5226 Finds unused theorems in the current theory and all of its ancestors,
5227 excluding the theories thy_1 ... thy_n and all of their ancestors.
5229 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5230 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5231 their ancestors, excluding the theories thy_1 ... thy_n and all of
5234 In order to increase the readability of the list produced by
5235 unused_thms, theorems that have been created by a particular instance
5236 of a theory command such as 'inductive' or 'function' are considered
5237 to belong to the same "group", meaning that if at least one theorem in
5238 this group is used, the other theorems in the same group are no longer
5239 reported as unused. Moreover, if all theorems in the group are
5240 unused, only one theorem in the group is displayed.
5242 Note that proof objects have to be switched on in order for
5243 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5244 usually the case when using Proof General with the default settings).
5246 * Authentic naming of facts disallows ad-hoc overwriting of previous
5247 theorems within the same name space. INCOMPATIBILITY, need to remove
5248 duplicate fact bindings, or even accidental fact duplications. Note
5249 that tools may maintain dynamically scoped facts systematically, using
5250 PureThy.add_thms_dynamic.
5252 * Command 'hide' now allows to hide from "fact" name space as well.
5254 * Eliminated destructive theorem database, simpset, claset, and
5255 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5256 update of theories within ML code.
5258 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5259 INCOMPATIBILITY, object-logics depending on former Pure require
5260 additional setup PureThy.old_appl_syntax_setup; object-logics
5261 depending on former CPure need to refer to Pure.
5263 * Commands 'use' and 'ML' are now purely functional, operating on
5264 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5265 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5268 * Command 'setup': discontinued implicit version with ML reference.
5270 * Instantiation target allows for simultaneous specification of class
5271 instance operations together with an instantiation proof.
5272 Type-checking phase allows to refer to class operations uniformly.
5273 See src/HOL/Complex/Complex.thy for an Isar example and
5274 src/HOL/Library/Eval.thy for an ML example.
5276 * Indexing of literal facts: be more serious about including only
5277 facts from the visible specification/proof context, but not the
5278 background context (locale etc.). Affects `prop` notation and method
5279 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5282 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5283 "(open)" option, which used to expose internal bound variables to the
5286 * Isar statements: removed obsolete case "rule_context".
5287 INCOMPATIBILITY, better use explicit fixes/assumes.
5289 * Locale proofs: default proof step now includes 'unfold_locales';
5290 hence 'proof' without argument may be used to unfold locale
5294 *** Document preparation ***
5296 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5297 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5298 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5299 spot); renamed link color from "darkblue" to "linkcolor" (default
5300 value unchanged, can be redefined via \definecolor); no longer sets
5301 "a4paper" option (unnecessary or even intrusive).
5303 * Antiquotation @{lemma A method} proves proposition A by the given
5304 method (either a method name or a method name plus (optional) method
5305 arguments in parentheses) and prints A just like @{prop A}.
5310 * New primrec package. Specification syntax conforms in style to
5311 definition/function/.... No separate induction rule is provided. The
5312 "primrec" command distinguishes old-style and new-style specifications
5313 by syntax. The former primrec package is now named OldPrimrecPackage.
5314 When adjusting theories, beware: constants stemming from new-style
5315 primrec specifications have authentic syntax.
5317 * Metis prover is now an order of magnitude faster, and also works
5318 with multithreading.
5320 * Metis: the maximum number of clauses that can be produced from a
5321 theorem is now given by the attribute max_clauses. Theorems that
5322 exceed this number are ignored, with a warning printed.
5324 * Sledgehammer no longer produces structured proofs by default. To
5325 enable, declare [[sledgehammer_full = true]]. Attributes
5326 reconstruction_modulus, reconstruction_sorts renamed
5327 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5329 * Method "induct_scheme" derives user-specified induction rules
5330 from well-founded induction and completeness of patterns. This factors
5331 out some operations that are done internally by the function package
5332 and makes them available separately. See
5333 src/HOL/ex/Induction_Scheme.thy for examples.
5335 * More flexible generation of measure functions for termination
5336 proofs: Measure functions can be declared by proving a rule of the
5337 form "is_measure f" and giving it the [measure_function] attribute.
5338 The "is_measure" predicate is logically meaningless (always true), and
5339 just guides the heuristic. To find suitable measure functions, the
5340 termination prover sets up the goal "is_measure ?f" of the appropriate
5341 type and generates all solutions by prolog-style backwards proof using
5344 This setup also deals with rules like
5346 "is_measure f ==> is_measure (list_size f)"
5348 which accommodates nested datatypes that recurse through lists.
5349 Similar rules are predeclared for products and option types.
5351 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5355 - Definitions of overloaded constants on sets have to be replaced by
5356 definitions on => and bool.
5358 - Some definitions of overloaded operators on sets can now be proved
5359 using the definitions of the operators on => and bool. Therefore,
5360 the following theorems have been renamed:
5362 subset_def -> subset_eq
5363 psubset_def -> psubset_eq
5364 set_diff_def -> set_diff_eq
5365 Compl_def -> Compl_eq
5366 Sup_set_def -> Sup_set_eq
5367 Inf_set_def -> Inf_set_eq
5368 sup_set_def -> sup_set_eq
5369 inf_set_def -> inf_set_eq
5371 - Due to the incompleteness of the HO unification algorithm, some
5372 rules such as subst may require manual instantiation, if some of
5373 the unknowns in the rule is a set.
5375 - Higher order unification and forward proofs:
5378 have "P (S::'a set)" <...>
5379 then have "EX S. P S" ..
5381 no longer works (due to the incompleteness of the HO unification
5382 algorithm) and must be replaced by the pattern
5389 - Calculational reasoning with subst (or similar rules):
5392 have "P (S::'a set)" <...>
5393 also have "S = T" <...>
5394 finally have "P T" .
5396 no longer works (for similar reasons as the previous example) and
5397 must be replaced by something like
5399 have "P (S::'a set)" <...>
5400 moreover have "S = T" <...>
5401 ultimately have "P T" by simp
5403 - Tactics or packages written in ML code:
5404 Code performing pattern matching on types via
5406 Type ("set", [T]) => ...
5408 must be rewritten. Moreover, functions like strip_type or
5409 binder_types no longer return the right value when applied to a
5412 T1 => ... => Tn => U => bool
5416 T1 => ... => Tn => U set
5418 * Merged theories Wellfounded_Recursion, Accessible_Part and
5419 Wellfounded_Relations to theory Wellfounded.
5421 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5423 * Class finite no longer treats UNIV as class parameter. Use class
5424 enum from theory Library/Enum instead to achieve a similar effect.
5427 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5428 and "Cons". INCOMPATIBILITY.
5430 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5431 Potential INCOMPATIBILITY.
5433 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5434 injective_fst_snd removed, use split_eta and prod_eqI instead.
5435 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5437 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5438 the same name in theory Orderings:
5448 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5449 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5450 and different variable names.
5452 * Library/Option_ord.thy: Canonical order on option type.
5454 * Library/RBT.thy: Red-black trees, an efficient implementation of
5457 * Library/Countable.thy: Type class for countable types.
5459 * Theory Int: The representation of numerals has changed. The infix
5460 operator BIT and the bit datatype with constructors B0 and B1 have
5461 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5462 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5463 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5466 * Theory Nat: definition of <= and < on natural numbers no longer
5467 depend on well-founded relations. INCOMPATIBILITY. Definitions
5468 le_def and less_def have disappeared. Consider lemmas not_less
5469 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5471 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5472 (whose purpose mainly is for various fold_set functionals) have been
5473 abandoned in favor of the existing algebraic classes
5474 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5475 lower_semilattice (resp. upper_semilattice) and linorder.
5478 * Theory Transitive_Closure: induct and cases rules now declare proper
5479 case_names ("base" and "step"). INCOMPATIBILITY.
5481 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5482 lattices. The form set-specific version is available as
5483 Inductive.lfp_ordinal_induct_set.
5485 * Renamed theorems "power.simps" to "power_int.simps".
5488 * Class semiring_div provides basic abstract properties of semirings
5489 with division and modulo operations. Subsumes former class dvd_mod.
5491 * Merged theories IntDef, Numeral and IntArith into unified theory
5492 Int. INCOMPATIBILITY.
5494 * Theory Library/Code_Index: type "index" now represents natural
5495 numbers rather than integers. INCOMPATIBILITY.
5497 * New class "uminus" with operation "uminus" (split of from class
5498 "minus" which now only has operation "minus", binary).
5501 * Constants "card", "internal_split", "option_map" now with authentic
5502 syntax. INCOMPATIBILITY.
5504 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5505 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5506 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5507 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5508 Sup_set_def, le_def, less_def, option_map_def now with object
5509 equality. INCOMPATIBILITY.
5511 * Records. Removed K_record, and replaced it by pure lambda term
5512 %x. c. The simplifier setup is now more robust against eta expansion.
5513 INCOMPATIBILITY: in cases explicitly referring to K_record.
5515 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5517 * Library/ListVector: new theory of arithmetic vector operations.
5519 * Library/Order_Relation: new theory of various orderings as sets of
5520 pairs. Defines preorders, partial orders, linear orders and
5521 well-orders on sets and on types.
5526 * Renamed some theories to allow to loading both ZF and HOL in the
5529 Datatype -> Datatype_ZF
5530 Inductive -> Inductive_ZF
5537 INCOMPATIBILITY: ZF theories that import individual theories below
5538 Main might need to be adapted. Regular theory Main is still
5539 available, as trivial extension of Main_ZF.
5544 * ML within Isar: antiquotation @{const name} or @{const
5545 name(typargs)} produces statically-checked Const term.
5547 * Functor NamedThmsFun: data is available to the user as dynamic fact
5548 (of the same name). Removed obsolete print command.
5550 * Removed obsolete "use_legacy_bindings" function.
5552 * The ``print mode'' is now a thread-local value derived from a global
5553 template (the former print_mode reference), thus access becomes
5554 non-critical. The global print_mode reference is for session
5555 management only; user-code should use print_mode_value,
5556 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5558 * Functions system/system_out provide a robust way to invoke external
5559 shell commands, with propagation of interrupts (requires Poly/ML
5560 5.2.1). Do not use OS.Process.system etc. from the basis library!
5565 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5566 in accordance with Proof General 3.7, which prefers GNU emacs.
5568 * isatool tty runs Isabelle process with plain tty interaction;
5569 optional line editor may be specified via ISABELLE_LINE_EDITOR
5570 setting, the default settings attempt to locate "ledit" and "rlwrap".
5572 * isatool browser now works with Cygwin as well, using general
5573 "javapath" function defined in Isabelle process environment.
5575 * YXML notation provides a simple and efficient alternative to
5576 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5577 isatool yxml as described in the Isabelle system manual.
5579 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5580 provides general wrapper for managing an Isabelle process in a robust
5581 fashion, with ``cooked'' output from stdin/stderr.
5583 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5584 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5586 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5587 way of changing the user's settings is via
5588 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5591 * Multithreading.max_threads := 0 refers to the number of actual CPU
5592 cores of the underlying machine, which is a good starting point for
5593 optimal performance tuning. The corresponding usedir option -M allows
5594 "max" as an alias for "0". WARNING: does not work on certain versions
5595 of Mac OS (with Poly/ML 5.1).
5597 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5598 adverse effect of Isabelle flooding interactive front-ends (notably
5599 ProofGeneral / XEmacs).
5603 New in Isabelle2007 (November 2007)
5604 -----------------------------------
5608 * More uniform information about legacy features, notably a
5609 warning/error of "Legacy feature: ...", depending on the state of the
5610 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5611 legacy features will disappear eventually.
5613 * Theory syntax: the header format ``theory A = B + C:'' has been
5614 discontinued in favour of ``theory A imports B C begin''. Use isatool
5615 fixheaders to convert existing theory files. INCOMPATIBILITY.
5617 * Theory syntax: the old non-Isar theory file format has been
5618 discontinued altogether. Note that ML proof scripts may still be used
5619 with Isar theories; migration is usually quite simple with the ML
5620 function use_legacy_bindings. INCOMPATIBILITY.
5622 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5623 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5626 * Theory loader: be more serious about observing the static theory
5627 header specifications (including optional directories), but not the
5628 accidental file locations of previously successful loads. The strict
5629 update policy of former update_thy is now already performed by
5630 use_thy, so the former has been removed; use_thys updates several
5631 theories simultaneously, just as 'imports' within a theory header
5632 specification, but without merging the results. Potential
5633 INCOMPATIBILITY: may need to refine theory headers and commands
5634 ROOT.ML which depend on load order.
5636 * Theory loader: optional support for content-based file
5637 identification, instead of the traditional scheme of full physical
5638 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5639 (cf. the system manual). The new scheme allows to work with
5640 non-finished theories in persistent session images, such that source
5641 files may be moved later on without requiring reloads.
5643 * Theory loader: old-style ML proof scripts being *attached* to a thy
5644 file (with the same base name as the theory) are considered a legacy
5645 feature, which will disappear eventually. Even now, the theory loader
5646 no longer maintains dependencies on such files.
5648 * Syntax: the scope for resolving ambiguities via type-inference is
5649 now limited to individual terms, instead of whole simultaneous
5650 specifications as before. This greatly reduces the complexity of the
5651 syntax module and improves flexibility by separating parsing and
5652 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5653 'fixes' etc.) are required in rare situations.
5655 * Syntax: constants introduced by new-style packages ('definition',
5656 'abbreviation' etc.) are passed through the syntax module in
5657 ``authentic mode''. This means that associated mixfix annotations
5658 really stick to such constants, independently of potential name space
5659 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5660 trees are represented slightly differently, may need to adapt syntax
5661 translations accordingly. Use CONST marker in 'translations' and
5662 @{const_syntax} antiquotation in 'parse_translation' etc.
5664 * Legacy goal package: reduced interface to the bare minimum required
5665 to keep existing proof scripts running. Most other user-level
5666 functions are now part of the OldGoals structure, which is *not* open
5667 by default (consider isatool expandshort before open OldGoals).
5668 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5669 these tend to cause confusion about the actual goal (!) context being
5670 used here, which is not necessarily the same as the_context().
5672 * Command 'find_theorems': supports "*" wild-card in "name:"
5673 criterion; "with_dups" option. Certain ProofGeneral versions might
5674 support a specific search form (see ProofGeneral/CHANGES).
5676 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5677 by default, which means that "prems" (and also "fixed variables") are
5678 suppressed from proof state output. Note that the ProofGeneral
5679 settings mechanism allows to change and save options persistently, but
5680 older versions of Isabelle will fail to start up if a negative prems
5683 * Local theory targets may be specified by non-nested blocks of
5684 ``context/locale/class ... begin'' followed by ``end''. The body may
5685 contain definitions, theorems etc., including any derived mechanism
5686 that has been implemented on top of these primitives. This concept
5687 generalizes the existing ``theorem (in ...)'' towards more versatility
5690 * Proof General interface: proper undo of final 'end' command;
5691 discontinued Isabelle/classic mode (ML proof scripts).
5694 *** Document preparation ***
5696 * Added antiquotation @{theory name} which prints the given name,
5697 after checking that it refers to a valid ancestor theory in the
5700 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5701 check the given source text as ML type/structure, printing verbatim.
5703 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5704 "c args == rhs" given in the current context. (Any number of
5705 arguments may be given on the LHS.)
5710 * The 'class' package offers a combination of axclass and locale to
5711 achieve Haskell-like type classes in Isabelle. Definitions and
5712 theorems within a class context produce both relative results (with
5713 implicit parameters according to the locale context), and polymorphic
5714 constants with qualified polymorphism (according to the class
5715 context). Within the body context of a 'class' target, a separate
5716 syntax layer ("user space type system") takes care of converting
5717 between global polymorphic consts and internal locale representation.
5718 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5719 "isatool doc classes" provides a tutorial.
5721 * Generic code generator framework allows to generate executable
5722 code for ML and Haskell (including Isabelle classes). A short usage
5725 internal compilation:
5726 export_code <list of constants (term syntax)> in SML
5727 writing SML code to a file:
5728 export_code <list of constants (term syntax)> in SML <filename>
5729 writing OCaml code to a file:
5730 export_code <list of constants (term syntax)> in OCaml <filename>
5731 writing Haskell code to a bunch of files:
5732 export_code <list of constants (term syntax)> in Haskell <filename>
5734 evaluating closed propositions to True/False using code generation:
5737 Reasonable default setup of framework in HOL.
5739 Theorem attributs for selecting and transforming function equations theorems:
5741 [code fun]: select a theorem as function equation for a specific constant
5742 [code fun del]: deselect a theorem as function equation for a specific constant
5743 [code inline]: select an equation theorem for unfolding (inlining) in place
5744 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5746 User-defined serializations (target in {SML, OCaml, Haskell}):
5748 code_const <and-list of constants (term syntax)>
5749 {(target) <and-list of const target syntax>}+
5751 code_type <and-list of type constructors>
5752 {(target) <and-list of type target syntax>}+
5754 code_instance <and-list of instances>
5756 where instance ::= <type constructor> :: <class>
5758 code_class <and_list of classes>
5759 {(target) <and-list of class target syntax>}+
5760 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5762 code_instance and code_class only are effective to target Haskell.
5764 For example usage see src/HOL/ex/Codegenerator.thy and
5765 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5766 generation from Isabelle/HOL theories is available via "isatool doc
5769 * Code generator: consts in 'consts_code' Isar commands are now
5770 referred to by usual term syntax (including optional type
5773 * Command 'no_translations' removes translation rules from theory
5776 * Overloaded definitions are now actually checked for acyclic
5777 dependencies. The overloading scheme is slightly more general than
5778 that of Haskell98, although Isabelle does not demand an exact
5779 correspondence to type class and instance declarations.
5780 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5781 exotic versions of overloading -- at the discretion of the user!
5783 Polymorphic constants are represented via type arguments, i.e. the
5784 instantiation that matches an instance against the most general
5785 declaration given in the signature. For example, with the declaration
5786 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5787 as c(nat). Overloading is essentially simultaneous structural
5788 recursion over such type arguments. Incomplete specification patterns
5789 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5790 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5791 Command 'print_theory' outputs the normalized system of recursive
5792 equations, see section "definitions".
5794 * Configuration options are maintained within the theory or proof
5795 context (with name and type bool/int/string), providing a very simple
5796 interface to a poor-man's version of general context data. Tools may
5797 declare options in ML (e.g. using Attrib.config_int) and then refer to
5798 these values using Config.get etc. Users may change options via an
5799 associated attribute of the same name. This form of context
5800 declaration works particularly well with commands 'declare' or
5801 'using', for example ``declare [[foo = 42]]''. Thus it has become
5802 very easy to avoid global references, which would not observe Isar
5803 toplevel undo/redo and fail to work with multithreading.
5805 Various global ML references of Pure and HOL have been turned into
5806 configuration options:
5808 Unify.search_bound unify_search_bound
5809 Unify.trace_bound unify_trace_bound
5810 Unify.trace_simp unify_trace_simp
5811 Unify.trace_types unify_trace_types
5812 Simplifier.simp_depth_limit simp_depth_limit
5813 Blast.depth_limit blast_depth_limit
5814 DatatypeProp.dtK datatype_distinctness_limit
5815 fast_arith_neq_limit fast_arith_neq_limit
5816 fast_arith_split_limit fast_arith_split_limit
5818 * Named collections of theorems may be easily installed as context
5819 data using the functor NamedThmsFun (see also
5820 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5821 attributes; there is also a toplevel print command. This facility is
5822 just a common case of general context data, which is the preferred way
5823 for anything more complex than just a list of facts in canonical
5826 * Isar: command 'declaration' augments a local theory by generic
5827 declaration functions written in ML. This enables arbitrary content
5828 being added to the context, depending on a morphism that tells the
5829 difference of the original declaration context wrt. the application
5830 context encountered later on.
5832 * Isar: proper interfaces for simplification procedures. Command
5833 'simproc_setup' declares named simprocs (with match patterns, and body
5834 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5835 context. ML antiquotation @{simproc name} retrieves named simprocs.
5837 * Isar: an extra pair of brackets around attribute declarations
5838 abbreviates a theorem reference involving an internal dummy fact,
5839 which will be ignored later --- only the effect of the attribute on
5840 the background context will persist. This form of in-place
5841 declarations is particularly useful with commands like 'declare' and
5842 'using', for example ``have A using [[simproc a]] by simp''.
5844 * Isar: method "assumption" (and implicit closing of subproofs) now
5845 takes simple non-atomic goal assumptions into account: after applying
5846 an assumption as a rule the resulting subgoals are solved by atomic
5847 assumption steps. This is particularly useful to finish 'obtain'
5848 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5849 without referring to the original premise "!!x. P x ==> thesis" in the
5850 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5853 * Isar: implicit use of prems from the Isar proof context is
5854 considered a legacy feature. Common applications like ``have A .''
5855 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5856 referencing facts explicitly here improves readability and
5857 maintainability of proof texts.
5859 * Isar: improper proof element 'guess' is like 'obtain', but derives
5860 the obtained context from the course of reasoning! For example:
5862 assume "EX x y. A x & B y" -- "any previous fact"
5863 then guess x and y by clarify
5865 This technique is potentially adventurous, depending on the facts and
5866 proof tools being involved here.
5868 * Isar: known facts from the proof context may be specified as literal
5869 propositions, using ASCII back-quote syntax. This works wherever
5870 named facts used to be allowed so far, in proof commands, proof
5871 methods, attributes etc. Literal facts are retrieved from the context
5872 according to unification of type and term parameters. For example,
5873 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5874 theorems in the current context, then these are valid literal facts:
5875 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5877 There is also a proof method "fact" which does the same composition
5878 for explicit goal states, e.g. the following proof texts coincide with
5879 certain special cases of literal facts:
5881 have "A" by fact == note `A`
5882 have "A ==> B" by fact == note `A ==> B`
5883 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5884 have "P a ==> Q a" by fact == note `P a ==> Q a`
5886 * Isar: ":" (colon) is no longer a symbolic identifier character in
5887 outer syntax. Thus symbolic identifiers may be used without
5888 additional white space in declarations like this: ``assume *: A''.
5890 * Isar: 'print_facts' prints all local facts of the current context,
5891 both named and unnamed ones.
5893 * Isar: 'def' now admits simultaneous definitions, e.g.:
5895 def x == "t" and y == "u"
5897 * Isar: added command 'unfolding', which is structurally similar to
5898 'using', but affects both the goal state and facts by unfolding given
5899 rewrite rules. Thus many occurrences of the 'unfold' method or
5900 'unfolded' attribute may be replaced by first-class proof text.
5902 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5903 and command 'unfolding' now all support object-level equalities
5904 (potentially conditional). The underlying notion of rewrite rule is
5905 analogous to the 'rule_format' attribute, but *not* that of the
5906 Simplifier (which is usually more generous).
5908 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5909 premises of a theorem by n. Useful in conjunction with drule.
5911 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5912 method expression within a sandbox consisting of the first N
5913 sub-goals, which need to exist. For example, ``simp_all [3]''
5914 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5915 simplifies all new goals that emerge from applying rule foo to the
5916 originally first one.
5918 * Isar: schematic goals are no longer restricted to higher-order
5919 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5922 * Isar: the conclusion of a long theorem statement is now either
5923 'shows' (a simultaneous conjunction, as before), or 'obtains'
5924 (essentially a disjunction of cases with local parameters and
5925 assumptions). The latter allows to express general elimination rules
5926 adequately; in this notation common elimination rules look like this:
5928 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5930 obtains x where "P x"
5932 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5936 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5942 The subsequent classical rules even refer to the formal "thesis"
5945 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5948 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5949 obtains "thesis ==> something"
5951 The actual proof of an 'obtains' statement is analogous to that of the
5952 Isar proof element 'obtain', only that there may be several cases.
5953 Optional case names may be specified in parentheses; these will be
5954 available both in the present proof and as annotations in the
5955 resulting rule, for later use with the 'cases' method (cf. attribute
5958 * Isar: the assumptions of a long theorem statement are available as
5959 "assms" fact in the proof context. This is more appropriate than the
5960 (historical) "prems", which refers to all assumptions of the current
5961 context, including those from the target locale, proof body etc.
5963 * Isar: 'print_statement' prints theorems from the current theory or
5964 proof context in long statement form, according to the syntax of a
5967 * Isar: 'obtain' takes an optional case name for the local context
5968 introduction rule (default "that").
5970 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5971 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5974 * Pure: syntax "CONST name" produces a fully internalized constant
5975 according to the current context. This is particularly useful for
5976 syntax translations that should refer to internal constant
5977 representations independently of name spaces.
5979 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5980 instead of "FOO ". This allows multiple binder declarations to coexist
5981 in the same context. INCOMPATIBILITY.
5983 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5984 primitive that also works in a locale context (both for constants and
5985 fixed variables). Type declaration and internal syntactic representation
5986 of given constants retrieved from the context. Likewise, the
5987 'no_notation' command allows to remove given syntax annotations from the
5990 * Isar/locales: new derived specification elements 'axiomatization',
5991 'definition', 'abbreviation', which support type-inference, admit
5992 object-level specifications (equality, equivalence). See also the
5993 isar-ref manual. Examples:
5996 eq (infix "===" 50) where
5997 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5999 definition "f x y = x + y + 1"
6000 definition g where "g x = f x x"
6003 neq (infix "=!=" 50) where
6004 "x =!= y == ~ (x === y)"
6006 These specifications may be also used in a locale context. Then the
6007 constants being introduced depend on certain fixed parameters, and the
6008 constant name is qualified by the locale base name. An internal
6009 abbreviation takes care for convenient input and output, making the
6010 parameters implicit and using the original short name. See also
6011 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6012 entities from a monomorphic theory.
6014 Presently, abbreviations are only available 'in' a target locale, but
6015 not inherited by general import expressions. Also note that
6016 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6017 'translations' in common applications. The "no_abbrevs" print mode
6018 prevents folding of abbreviations in term output.
6020 Concrete syntax is attached to specified constants in internal form,
6021 independently of name spaces. The parse tree representation is
6022 slightly different -- use 'notation' instead of raw 'syntax', and
6023 'translations' with explicit "CONST" markup to accommodate this.
6025 * Pure/Isar: unified syntax for new-style specification mechanisms
6026 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6027 full type inference and dummy patterns ("_"). For example:
6029 definition "K x _ = x"
6031 inductive conj for A B
6032 where "A ==> B ==> conj A B"
6034 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6035 the current context. Print mode "no_abbrevs" prevents inversion of
6036 abbreviations on output.
6038 * Isar/locales: improved parameter handling: use of locales "var" and
6039 "struct" no longer necessary; - parameter renamings are no longer
6040 required to be injective. For example, this allows to define
6041 endomorphisms as locale endom = homom mult mult h.
6043 * Isar/locales: changed the way locales with predicates are defined.
6044 Instead of accumulating the specification, the imported expression is
6045 now an interpretation. INCOMPATIBILITY: different normal form of
6046 locale expressions. In particular, in interpretations of locales with
6047 predicates, goals repesenting already interpreted fragments are not
6048 removed automatically. Use methods `intro_locales' and
6049 `unfold_locales'; see below.
6051 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6052 provide backward reasoning on locales predicates. The methods are
6053 aware of interpretations and discharge corresponding goals.
6054 `intro_locales' is less aggressive then `unfold_locales' and does not
6055 unfold predicates to assumptions.
6057 * Isar/locales: the order in which locale fragments are accumulated
6058 has changed. This enables to override declarations from fragments due
6059 to interpretations -- for example, unwanted simp rules.
6061 * Isar/locales: interpretation in theories and proof contexts has been
6062 extended. One may now specify (and prove) equations, which are
6063 unfolded in interpreted theorems. This is useful for replacing
6064 defined concepts (constants depending on locale parameters) by
6065 concepts already existing in the target context. Example:
6067 interpretation partial_order ["op <= :: [int, int] => bool"]
6068 where "partial_order.less (op <=) (x::int) y = (x < y)"
6070 Typically, the constant `partial_order.less' is created by a
6071 definition specification element in the context of locale
6074 * Method "induct": improved internal context management to support
6075 local fixes and defines on-the-fly. Thus explicit meta-level
6076 connectives !! and ==> are rarely required anymore in inductive goals
6077 (using object-logic connectives for this purpose has been long
6078 obsolete anyway). Common proof patterns are explained in
6079 src/HOL/Induct/Common_Patterns.thy, see also
6080 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6083 * Method "induct": improved handling of simultaneous goals. Instead of
6084 introducing object-level conjunction, the statement is now split into
6085 several conclusions, while the corresponding symbolic cases are nested
6086 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6087 see src/HOL/Induct/Common_Patterns.thy, for example.
6089 * Method "induct": mutual induction rules are now specified as a list
6090 of rule sharing the same induction cases. HOL packages usually provide
6091 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6092 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6093 mutual induction rules differently, i.e. like this:
6095 (induct rule: foo_bar.inducts)
6096 (induct set: foo bar)
6097 (induct pred: foo bar)
6098 (induct type: foo bar)
6100 The ML function ProjectRule.projections turns old-style rules into the
6103 * Method "coinduct": dual of induction, see
6104 src/HOL/Library/Coinductive_List.thy for various examples.
6106 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6107 considered a legacy feature.
6109 * Attribute "symmetric" produces result with standardized schematic
6110 variables (index 0). Potential INCOMPATIBILITY.
6112 * Simplifier: by default the simplifier trace only shows top level
6113 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6114 default. Thus there is less danger of being flooded by the trace. The
6115 trace indicates where parts have been suppressed.
6117 * Provers/classical: removed obsolete classical version of elim_format
6118 attribute; classical elim/dest rules are now treated uniformly when
6119 manipulating the claset.
6121 * Provers/classical: stricter checks to ensure that supplied intro,
6122 dest and elim rules are well-formed; dest and elim rules must have at
6125 * Provers/classical: attributes dest/elim/intro take an optional
6126 weight argument for the rule (just as the Pure versions). Weights are
6127 ignored by automated tools, but determine the search order of single
6130 * Syntax: input syntax now supports dummy variable binding "%_. b",
6131 where the body does not mention the bound variable. Note that dummy
6132 patterns implicitly depend on their context of bounds, which makes
6133 "{_. _}" match any set comprehension as expected. Potential
6134 INCOMPATIBILITY -- parse translations need to cope with syntactic
6135 constant "_idtdummy" in the binding position.
6137 * Syntax: removed obsolete syntactic constant "_K" and its associated
6138 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6139 for example "A -> B" => "Pi A (%_. B)".
6141 * Pure: 'class_deps' command visualizes the subclass relation, using
6142 the graph browser tool.
6144 * Pure: 'print_theory' now suppresses certain internal declarations by
6145 default; use '!' option for full details.
6150 * Method "metis" proves goals by applying the Metis general-purpose
6151 resolution prover (see also http://gilith.com/software/metis/).
6152 Examples are in the directory MetisExamples. WARNING: the
6153 Isabelle/HOL-Metis integration does not yet work properly with
6156 * Command 'sledgehammer' invokes external automatic theorem provers as
6157 background processes. It generates calls to the "metis" method if
6158 successful. These can be pasted into the proof. Users do not have to
6159 wait for the automatic provers to return. WARNING: does not really
6160 work with multi-threading.
6162 * New "auto_quickcheck" feature tests outermost goal statements for
6163 potential counter-examples. Controlled by ML references
6164 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6165 5000 milliseconds). Fails silently if statements is outside of
6166 executable fragment, or any other codgenerator problem occurs.
6168 * New constant "undefined" with axiom "undefined x = undefined".
6170 * Added class "HOL.eq", allowing for code generation with polymorphic
6173 * Some renaming of class constants due to canonical name prefixing in
6174 the new 'class' package:
6176 HOL.abs ~> HOL.abs_class.abs
6177 HOL.divide ~> HOL.divide_class.divide
6178 0 ~> HOL.zero_class.zero
6179 1 ~> HOL.one_class.one
6180 op + ~> HOL.plus_class.plus
6181 op - ~> HOL.minus_class.minus
6182 uminus ~> HOL.minus_class.uminus
6183 op * ~> HOL.times_class.times
6184 op < ~> HOL.ord_class.less
6185 op <= > HOL.ord_class.less_eq
6186 Nat.power ~> Power.power_class.power
6187 Nat.size ~> Nat.size_class.size
6188 Numeral.number_of ~> Numeral.number_class.number_of
6189 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6190 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6191 Orderings.min ~> Orderings.ord_class.min
6192 Orderings.max ~> Orderings.ord_class.max
6193 Divides.op div ~> Divides.div_class.div
6194 Divides.op mod ~> Divides.div_class.mod
6195 Divides.op dvd ~> Divides.div_class.dvd
6197 INCOMPATIBILITY. Adaptions may be required in the following cases:
6199 a) User-defined constants using any of the names "plus", "minus",
6200 "times", "less" or "less_eq". The standard syntax translations for
6201 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6204 b) Variables named "plus", "minus", "times", "less", "less_eq"
6205 INCOMPATIBILITY: use more specific names.
6207 c) Permutative equations (e.g. "a + b = b + a")
6208 Since the change of names also changes the order of terms, permutative
6209 rewrite rules may get applied in a different order. Experience shows
6210 that this is rarely the case (only two adaptions in the whole Isabelle
6211 distribution). INCOMPATIBILITY: rewrite proofs
6213 d) ML code directly refering to constant names
6214 This in general only affects hand-written proof tactics, simprocs and
6215 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6216 Consider using @{const_name} antiquotation.
6218 * New class "default" with associated constant "default".
6220 * Function "sgn" is now overloaded and available on int, real, complex
6221 (and other numeric types), using class "sgn". Two possible defs of
6222 sgn are given as equational assumptions in the classes sgn_if and
6223 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6226 * Locale "partial_order" now unified with class "order" (cf. theory
6227 Orderings), added parameter "less". INCOMPATIBILITY.
6229 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6230 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6231 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6233 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6234 changed order of proof goals in instance proofs.
6236 * The transitivity reasoner for partial and linear orders is set up
6237 for classes "order" and "linorder". Instances of the reasoner are available
6238 in all contexts importing or interpreting the corresponding locales.
6239 Method "order" invokes the reasoner separately; the reasoner
6240 is also integrated with the Simplifier as a solver. Diagnostic
6241 command 'print_orders' shows the available instances of the reasoner
6242 in the current context.
6244 * Localized monotonicity predicate in theory "Orderings"; integrated
6245 lemmas max_of_mono and min_of_mono with this predicate.
6248 * Formulation of theorem "dense" changed slightly due to integration
6249 with new class dense_linear_order.
6251 * Uniform lattice theory development in HOL.
6253 constants "meet" and "join" now named "inf" and "sup"
6254 constant "Meet" now named "Inf"
6256 classes "meet_semilorder" and "join_semilorder" now named
6257 "lower_semilattice" and "upper_semilattice"
6258 class "lorder" now named "lattice"
6259 class "comp_lat" now named "complete_lattice"
6261 Instantiation of lattice classes allows explicit definitions
6262 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6264 INCOMPATIBILITY. Theorem renames:
6266 meet_left_le ~> inf_le1
6267 meet_right_le ~> inf_le2
6268 join_left_le ~> sup_ge1
6269 join_right_le ~> sup_ge2
6270 meet_join_le ~> inf_sup_ord
6273 le_meet ~> le_inf_iff
6274 le_join ~> ge_sup_conv
6275 meet_idempotent ~> inf_idem
6276 join_idempotent ~> sup_idem
6277 meet_comm ~> inf_commute
6278 join_comm ~> sup_commute
6279 meet_leI1 ~> le_infI1
6280 meet_leI2 ~> le_infI2
6281 le_joinI1 ~> le_supI1
6282 le_joinI2 ~> le_supI2
6283 meet_assoc ~> inf_assoc
6284 join_assoc ~> sup_assoc
6285 meet_left_comm ~> inf_left_commute
6286 meet_left_idempotent ~> inf_left_idem
6287 join_left_comm ~> sup_left_commute
6288 join_left_idempotent ~> sup_left_idem
6291 le_def_meet ~> le_iff_inf
6292 le_def_join ~> le_iff_sup
6293 join_absorp2 ~> sup_absorb2
6294 join_absorp1 ~> sup_absorb1
6295 meet_absorp1 ~> inf_absorb1
6296 meet_absorp2 ~> inf_absorb2
6297 meet_join_absorp ~> inf_sup_absorb
6298 join_meet_absorp ~> sup_inf_absorb
6299 distrib_join_le ~> distrib_sup_le
6300 distrib_meet_le ~> distrib_inf_le
6302 add_meet_distrib_left ~> add_inf_distrib_left
6303 add_join_distrib_left ~> add_sup_distrib_left
6304 is_join_neg_meet ~> is_join_neg_inf
6305 is_meet_neg_join ~> is_meet_neg_sup
6306 add_meet_distrib_right ~> add_inf_distrib_right
6307 add_join_distrib_right ~> add_sup_distrib_right
6308 add_meet_join_distribs ~> add_sup_inf_distribs
6309 join_eq_neg_meet ~> sup_eq_neg_inf
6310 meet_eq_neg_join ~> inf_eq_neg_sup
6311 add_eq_meet_join ~> add_eq_inf_sup
6312 meet_0_imp_0 ~> inf_0_imp_0
6313 join_0_imp_0 ~> sup_0_imp_0
6314 meet_0_eq_0 ~> inf_0_eq_0
6315 join_0_eq_0 ~> sup_0_eq_0
6316 neg_meet_eq_join ~> neg_inf_eq_sup
6317 neg_join_eq_meet ~> neg_sup_eq_inf
6318 join_eq_if ~> sup_eq_if
6320 mono_meet ~> mono_inf
6321 mono_join ~> mono_sup
6322 meet_bool_eq ~> inf_bool_eq
6323 join_bool_eq ~> sup_bool_eq
6324 meet_fun_eq ~> inf_fun_eq
6325 join_fun_eq ~> sup_fun_eq
6326 meet_set_eq ~> inf_set_eq
6327 join_set_eq ~> sup_set_eq
6328 meet1_iff ~> inf1_iff
6329 meet2_iff ~> inf2_iff
6338 join1_iff ~> sup1_iff
6339 join2_iff ~> sup2_iff
6349 is_meet_Meet ~> is_meet_Inf
6350 Meet_bool_def ~> Inf_bool_def
6351 Meet_fun_def ~> Inf_fun_def
6352 Meet_greatest ~> Inf_greatest
6353 Meet_lower ~> Inf_lower
6354 Meet_set_def ~> Inf_set_def
6357 Sup_bool_eq ~> Sup_bool_def
6358 Sup_fun_eq ~> Sup_fun_def
6359 Sup_set_eq ~> Sup_set_def
6361 listsp_meetI ~> listsp_infI
6362 listsp_meet_eq ~> listsp_inf_eq
6367 * Added syntactic class "size"; overloaded constant "size" now has
6368 type "'a::size ==> bool"
6370 * Internal reorganisation of `size' of datatypes: size theorems
6371 "foo.size" are no longer subsumed by "foo.simps" (but are still
6372 simplification rules by default!); theorems "prod.size" now named
6375 * Class "div" now inherits from class "times" rather than "type".
6378 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6379 Linorder etc. have disappeared; operations defined in terms of
6380 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6382 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6384 * HOL-Word: New extensive library and type for generic, fixed size
6385 machine words, with arithmetic, bit-wise, shifting and rotating
6386 operations, reflection into int, nat, and bool lists, automation for
6387 linear arithmetic (by automatic reflection into nat or int), including
6388 lemmas on overflow and monotonicity. Instantiated to all appropriate
6389 arithmetic type classes, supporting automatic simplification of
6390 numerals on all operations.
6392 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6394 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6396 * Code generator library theories:
6397 - Code_Integer represents HOL integers by big integer literals in target
6399 - Code_Char represents HOL characters by character literals in target
6401 - Code_Char_chr like Code_Char, but also offers treatment of character
6402 codes; includes Code_Integer.
6403 - Executable_Set allows to generate code for finite sets using lists.
6404 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6406 - Executable_Real implements a subset of real numbers, namly those
6407 representable by rational numbers.
6408 - Efficient_Nat implements natural numbers by integers, which in general will
6409 result in higher efficency; pattern matching with 0/Suc is eliminated;
6410 includes Code_Integer.
6411 - Code_Index provides an additional datatype index which is mapped to
6412 target-language built-in integers.
6413 - Code_Message provides an additional datatype message_string which is isomorphic to
6414 strings; messages are mapped to target-language strings.
6416 * New package for inductive predicates
6418 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6421 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6422 for z_1 :: U_1 and ... and z_n :: U_m
6424 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6427 with full support for type-inference, rather than
6429 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6431 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6432 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6434 inductive "s z_1 ... z_m"
6436 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6439 For backward compatibility, there is a wrapper allowing inductive
6440 sets to be defined with the new package via
6443 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6444 for z_1 :: U_1 and ... and z_n :: U_m
6446 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6452 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6453 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6454 for z_1 :: U_1 and ... and z_n :: U_m
6456 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6457 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6460 if the additional syntax "p ..." is required.
6462 Numerous examples can be found in the subdirectories src/HOL/Auth,
6463 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6467 - Since declaration and definition of inductive sets or predicates
6468 is no longer separated, abbreviations involving the newly
6469 introduced sets or predicates must be specified together with the
6470 introduction rules after the 'where' keyword (see above), rather
6471 than before the actual inductive definition.
6473 - The variables in induction and elimination rules are now
6474 quantified in the order of their occurrence in the introduction
6475 rules, rather than in alphabetical order. Since this may break
6476 some proofs, these proofs either have to be repaired, e.g. by
6477 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6478 statements of the form
6480 case (rule_i a_i_1 ... a_i_{k_i})
6482 or the old order of quantification has to be restored by explicitly adding
6483 meta-level quantifiers in the introduction rules, i.e.
6485 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6487 - The format of the elimination rules is now
6489 p z_1 ... z_m x_1 ... x_n ==>
6490 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6495 (x_1, ..., x_n) : s z_1 ... z_m ==>
6496 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6499 for sets rather than
6501 x : s z_1 ... z_m ==>
6502 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6505 This may require terms in goals to be expanded to n-tuples
6506 (e.g. using case_tac or simplification with the split_paired_all
6507 rule) before the above elimination rule is applicable.
6509 - The elimination or case analysis rules for (mutually) inductive
6510 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6511 list of rules "p_1_..._p_k.elims" is no longer available.
6513 * New package "function"/"fun" for general recursive functions,
6514 supporting mutual and nested recursion, definitions in local contexts,
6515 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6516 for small examples, and the separate tutorial on the function
6517 package. The old recdef "package" is still available as before, but
6518 users are encouraged to use the new package.
6520 * Method "lexicographic_order" automatically synthesizes termination
6521 relations as lexicographic combinations of size measures.
6523 * Case-expressions allow arbitrary constructor-patterns (including
6524 "_") and take their order into account, like in functional
6525 programming. Internally, this is translated into nested
6526 case-expressions; missing cases are added and mapped to the predefined
6527 constant "undefined". In complicated cases printing may no longer show
6528 the original input but the internal form. Lambda-abstractions allow
6529 the same form of pattern matching: "% pat1 => e1 | ..." is an
6530 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6533 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6534 is an abbreviation for "of_nat :: nat => int". The simplification
6535 rules for "of_nat" have been changed to work like "int" did
6536 previously. Potential INCOMPATIBILITY:
6537 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6538 - of_nat_diff and of_nat_mult are no longer default simp rules
6540 * Method "algebra" solves polynomial equations over (semi)rings using
6541 Groebner bases. The (semi)ring structure is defined by locales and the
6542 tool setup depends on that generic context. Installing the method for
6543 a specific type involves instantiating the locale and possibly adding
6544 declarations for computation on the coefficients. The method is
6545 already instantiated for natural numbers and for the axiomatic class
6546 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6547 CALCULEMUS 2007 for the general principles underlying this
6548 architecture of context-aware proof-tools.
6550 * Method "ferrack" implements quantifier elimination over
6551 special-purpose dense linear orders using locales (analogous to
6552 "algebra"). The method is already installed for class
6553 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6556 * Former constant "List.op @" now named "List.append". Use ML
6557 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6558 circumvent possible incompatibilities when working on ML level.
6560 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6562 * New function listsum :: 'a list => 'a for arbitrary monoids.
6563 Special syntax: "SUM x <- xs. f x" (and latex variants)
6565 * New syntax for Haskell-like list comprehension (input only), eg.
6566 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6568 * The special syntax for function "filter" has changed from [x :
6569 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6570 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6572 * [a..b] is now defined for arbitrary linear orders. It used to be
6573 defined on nat only, as an abbreviation for [a..<Suc b]
6576 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6578 * New functions "sorted" and "sort" in src/HOL/List.thy.
6580 * New lemma collection field_simps (an extension of ring_simps) for
6581 manipulating (in)equations involving division. Multiplies with all
6582 denominators that can be proved to be non-zero (in equations) or
6583 positive/negative (in inequations).
6585 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6586 have been improved and renamed to ring_simps, group_simps and
6587 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6588 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6590 * Theory Library/Commutative_Ring: switched from recdef to function
6591 package; constants add, mul, pow now curried. Infix syntax for
6592 algebraic operations.
6594 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6597 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6600 * HOL/records: generalised field-update to take a function on the
6601 field rather than the new value: r(|A := x|) is translated to A_update
6602 (K x) r The K-combinator that is internally used is called K_record.
6603 INCOMPATIBILITY: Usage of the plain update functions has to be
6606 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6607 * x = 0, which are required for a semiring. Richer structures do not
6608 inherit from semiring_0 anymore, because this property is a theorem
6609 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6610 there is more to prove, but this is mostly trivial.
6612 * Class "recpower" is generalized to arbitrary monoids, not just
6613 commutative semirings. INCOMPATIBILITY: may need to incorporate
6614 commutativity or semiring properties additionally.
6616 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6617 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6618 better use 'abbreviation'.
6620 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6622 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6623 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6624 significant changes for setting up numeral syntax for types:
6625 - New constants Numeral.pred and Numeral.succ instead
6626 of former Numeral.bin_pred and Numeral.bin_succ.
6627 - Use integer operations instead of bin_add, bin_mult and so on.
6628 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6629 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6631 See src/HOL/Integ/IntArith.thy for an example setup.
6633 * Command 'normal_form' computes the normal form of a term that may
6634 contain free variables. For example ``normal_form "rev [a, b, c]"''
6635 produces ``[b, c, a]'' (without proof). This command is suitable for
6636 heavy-duty computations because the functions are compiled to ML
6637 first. Correspondingly, a method "normalization" is provided. See
6638 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6640 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6641 25 like -->); output depends on the "iff" print_mode, the default is
6642 "A = B" (with priority 50).
6644 * Relations less (<) and less_eq (<=) are also available on type bool.
6645 Modified syntax to disallow nesting without explicit parentheses,
6646 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6649 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6651 * Relation composition operator "op O" now has precedence 75 and binds
6652 stronger than union and intersection. INCOMPATIBILITY.
6654 * The old set interval syntax "{m..n(}" (and relatives) has been
6655 removed. Use "{m..<n}" (and relatives) instead.
6657 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6658 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6659 ``declare [[simproc del: neq]]''.
6661 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6664 * Theorem Cons_eq_map_conv no longer declared as "simp".
6666 * Theorem setsum_mult renamed to setsum_right_distrib.
6668 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6671 * Reimplemented methods "sat" and "satx", with several improvements:
6672 goals no longer need to be stated as "<prems> ==> False", equivalences
6673 (i.e. "=" on type bool) are handled, variable names of the form
6674 "lit_<n>" are no longer reserved, significant speedup.
6676 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6677 zChaff is still supported as well.
6679 * 'inductive' and 'datatype': provide projections of mutual rules,
6680 bundled as foo_bar.inducts;
6682 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6685 * Library: moved theory Accessible_Part to main HOL.
6687 * Library: added theory Coinductive_List of potentially infinite lists
6688 as greatest fixed-point.
6690 * Library: added theory AssocList which implements (finite) maps as
6693 * Method "evaluation" solves goals (i.e. a boolean expression)
6694 efficiently by compiling it to ML. The goal is "proved" (via an
6695 oracle) if it evaluates to True.
6697 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6698 also when invoked by the simplifier. This results in the Simplifier
6699 being more powerful on arithmetic goals. INCOMPATIBILITY.
6700 Configuration option fast_arith_split_limit=0 recovers the old
6703 * Support for hex (0x20) and binary (0b1001) numerals.
6705 * New method: reify eqs (t), where eqs are equations for an
6706 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6707 parameter, computes a term s::'b and a list xs::'a list and proves the
6708 theorem I xs s = t. This is also known as reification or quoting. The
6709 resulting theorem is applied to the subgoal to substitute t with I xs
6710 s. If t is omitted, the subgoal itself is reified.
6712 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6713 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6714 where f is supposed to be a computable function (in the sense of code
6715 generattion). The method uses reify to compute s and xs as above then
6716 applies corr_thm and uses normalization by evaluation to "prove" f s =
6717 r and finally gets the theorem t = r, which is again applied to the
6718 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6720 * Reflection: Automatic reification now handels binding, an example is
6721 available in src/HOL/ex/ReflectionEx.thy
6723 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6724 command 'statespace' that is similar to 'record', but introduces an
6725 abstract specification based on the locale infrastructure instead of
6726 HOL types. This leads to extra flexibility in composing state spaces,
6727 in particular multiple inheritance and renaming of components.
6732 * Hyperreal: Functions root and sqrt are now defined on negative real
6733 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6734 Nonnegativity side conditions have been removed from many lemmas, so
6735 that more subgoals may now be solved by simplification; potential
6738 * Real: new type classes formalize real normed vector spaces and
6739 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6740 and norm :: 'a => real.
6742 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6743 reals into other types. The overloaded constant Reals :: 'a set is now
6744 defined as range of_real; potential INCOMPATIBILITY.
6746 * Real: proper support for ML code generation, including 'quickcheck'.
6747 Reals are implemented as arbitrary precision rationals.
6749 * Hyperreal: Several constants that previously worked only for the
6750 reals have been generalized, so they now work over arbitrary vector
6751 spaces. Type annotations may need to be added in some cases; potential
6754 Infinitesimal :: ('a::real_normed_vector) star set
6755 HFinite :: ('a::real_normed_vector) star set
6756 HInfinite :: ('a::real_normed_vector) star set
6757 approx :: ('a::real_normed_vector) star => 'a star => bool
6758 monad :: ('a::real_normed_vector) star => 'a star set
6759 galaxy :: ('a::real_normed_vector) star => 'a star set
6760 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6761 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6762 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6763 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6764 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6765 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6766 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6767 sgn :: 'a::real_normed_vector => 'a
6768 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6770 * Complex: Some complex-specific constants are now abbreviations for
6771 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6772 hnorm. Other constants have been entirely removed in favor of the
6773 polymorphic versions (INCOMPATIBILITY):
6777 HInfinite <-- CInfinite
6778 Infinitesimal <-- CInfinitesimal
6781 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6782 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6783 (ns)deriv <-- (ns)cderiv
6788 * Formalisation of ideals and the quotient construction over rings.
6790 * Order and lattice theory no longer based on records.
6793 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6794 greatest_closed. INCOMPATIBILITY.
6796 * Method algebra is now set up via an attribute. For examples see
6797 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6798 of algebraic structures.
6800 * Renamed theory CRing to Ring.
6805 * Substantial, yet incomplete support for nominal datatypes (binding
6806 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6807 src/HOL/Nominal/Examples. Prospective users should consult
6808 http://isabelle.in.tum.de/nominal/
6813 * ML basics: just one true type int, which coincides with IntInf.int
6816 * ML within Isar: antiquotations allow to embed statically-checked
6817 formal entities in the source, referring to the context available at
6818 compile-time. For example:
6820 ML {* @{sort "{zero,one}"} *}
6821 ML {* @{typ "'a => 'b"} *}
6822 ML {* @{term "%x. x"} *}
6823 ML {* @{prop "x == y"} *}
6824 ML {* @{ctyp "'a => 'b"} *}
6825 ML {* @{cterm "%x. x"} *}
6826 ML {* @{cprop "x == y"} *}
6827 ML {* @{thm asm_rl} *}
6828 ML {* @{thms asm_rl} *}
6829 ML {* @{type_name c} *}
6830 ML {* @{type_syntax c} *}
6831 ML {* @{const_name c} *}
6832 ML {* @{const_syntax c} *}
6835 ML {* @{theory Pure} *}
6836 ML {* @{theory_ref} *}
6837 ML {* @{theory_ref Pure} *}
6840 ML {* @{clasimpset} *}
6842 The same works for sources being ``used'' within an Isar context.
6844 * ML in Isar: improved error reporting; extra verbosity with
6845 ML_Context.trace enabled.
6847 * Pure/General/table.ML: the join operations now works via exceptions
6848 DUP/SAME instead of type option. This is simpler in simple cases, and
6849 admits slightly more efficient complex applications.
6851 * Pure: 'advanced' translation functions (parse_translation etc.) now
6852 use Context.generic instead of just theory.
6854 * Pure: datatype Context.generic joins theory/Proof.context and
6855 provides some facilities for code that works in either kind of
6856 context, notably GenericDataFun for uniform theory and proof data.
6858 * Pure: simplified internal attribute type, which is now always
6859 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6860 local (Proof.context) attributes have been discontinued, while
6861 minimizing code duplication. Thm.rule_attribute and
6862 Thm.declaration_attribute build canonical attributes; see also structure
6863 Context for further operations on Context.generic, notably
6864 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6865 declarations and definitions.
6867 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6868 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6869 init only required for impure data. INCOMPATIBILITY: empty really need
6870 to be empty (no dependencies on theory content!)
6872 * Pure/kernel: consts certification ignores sort constraints given in
6873 signature declarations. (This information is not relevant to the
6874 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6875 potential INCOMPATIBILITY.
6877 * Pure: axiomatic type classes are now purely definitional, with
6878 explicit proofs of class axioms and super class relations performed
6879 internally. See Pure/axclass.ML for the main internal interfaces --
6880 notably AxClass.define_class supercedes AxClass.add_axclass, and
6881 AxClass.axiomatize_class/classrel/arity supersede
6882 Sign.add_classes/classrel/arities.
6884 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6885 global/local versions on theory vs. Proof.context have been
6886 discontinued; Attrib.syntax and Method.syntax have been adapted
6887 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6888 attributes, methods, etc.
6890 * Pure: several functions of signature "... -> theory -> theory * ..."
6891 have been reoriented to "... -> theory -> ... * theory" in order to
6892 allow natural usage in combination with the ||>, ||>>, |-> and
6893 fold_map combinators.
6895 * Pure: official theorem names (closed derivations) and additional
6896 comments (tags) are now strictly separate. Name hints -- which are
6897 maintained as tags -- may be attached any time without affecting the
6900 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6901 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6902 achieve the old behaviour.
6904 * Pure: the "Goal" constant is now called "prop", supporting a
6905 slightly more general idea of ``protecting'' meta-level rule
6908 * Pure: Logic.(un)varify only works in a global context, which is now
6909 enforced instead of silently assumed. INCOMPATIBILITY, may use
6910 Logic.legacy_(un)varify as temporary workaround.
6912 * Pure: structure Name provides scalable operations for generating
6913 internal variable names, notably Name.variants etc. This replaces
6914 some popular functions from term.ML:
6916 Term.variant -> Name.variant
6917 Term.variantlist -> Name.variant_list
6918 Term.invent_names -> Name.invent_list
6920 Note that low-level renaming rarely occurs in new code -- operations
6921 from structure Variable are used instead (see below).
6923 * Pure: structure Variable provides fundamental operations for proper
6924 treatment of fixed/schematic variables in a context. For example,
6925 Variable.import introduces fixes for schematics of given facts and
6926 Variable.export reverses the effect (up to renaming) -- this replaces
6927 various freeze_thaw operations.
6929 * Pure: structure Goal provides simple interfaces for
6930 init/conclude/finish and tactical prove operations (replacing former
6931 Tactic.prove). Goal.prove is the canonical way to prove results
6932 within a given context; Goal.prove_global is a degraded version for
6933 theory level goals, including a global Drule.standard. Note that
6934 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6935 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6936 in a locale context).
6938 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6939 and type checking (Syntax.check_term etc.), with common combinations
6940 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6941 which are considered legacy and await removal.
6943 * Pure/Syntax: generic interfaces for type unchecking
6944 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6945 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6946 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6947 available for convenience, but refer to the very same operations using
6948 a mere theory instead of a full context.
6950 * Isar: simplified treatment of user-level errors, using exception
6951 ERROR of string uniformly. Function error now merely raises ERROR,
6952 without any side effect on output channels. The Isar toplevel takes
6953 care of proper display of ERROR exceptions. ML code may use plain
6954 handle/can/try; cat_error may be used to concatenate errors like this:
6956 ... handle ERROR msg => cat_error msg "..."
6958 Toplevel ML code (run directly or through the Isar toplevel) may be
6959 embedded into the Isar toplevel with exception display/debug like
6962 Isar.toplevel (fn () => ...)
6964 INCOMPATIBILITY, removed special transform_error facilities, removed
6965 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6966 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6967 -- use plain ERROR instead.
6969 * Isar: theory setup now has type (theory -> theory), instead of a
6970 list. INCOMPATIBILITY, may use #> to compose setup functions.
6972 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6973 ProofContext.debug/verbose flags.
6975 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6976 theory before entering a proof state. Transactions now always see a
6977 quasi-functional intermediate checkpoint, both in interactive and
6980 * Isar: simplified interfaces for outer syntax. Renamed
6981 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6982 OuterSyntax.add_parsers -- this functionality is now included in
6983 OuterSyntax.command etc. INCOMPATIBILITY.
6985 * Simplifier: the simpset of a running simplification process now
6986 contains a proof context (cf. Simplifier.the_context), which is the
6987 very context that the initial simpset has been retrieved from (by
6988 simpset_of/local_simpset_of). Consequently, all plug-in components
6989 (solver, looper etc.) may depend on arbitrary proof data.
6991 * Simplifier.inherit_context inherits the proof context (plus the
6992 local bounds) of the current simplification process; any simproc
6993 etc. that calls the Simplifier recursively should do this! Removed
6994 former Simplifier.inherit_bounds, which is already included here --
6995 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6996 specify an explicit context using Simplifier.context/theory_context.
6998 * Simplifier/Classical Reasoner: more abstract interfaces
6999 change_simpset/claset for modifying the simpset/claset reference of a
7000 theory; raw versions simpset/claset_ref etc. have been discontinued --
7003 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7009 * settings: the default heap location within ISABELLE_HOME_USER now
7010 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7011 Isabelle installations.
7013 * isabelle-process: option -S (secure mode) disables some critical
7014 operations, notably runtime compilation and evaluation of ML source
7017 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7019 * Support for parallel execution, using native multicore support of
7020 Poly/ML 5.1. The theory loader exploits parallelism when processing
7021 independent theories, according to the given theory header
7022 specifications. The maximum number of worker threads is specified via
7023 usedir option -M or the "max-threads" setting in Proof General. A
7024 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7025 to 6 on a 8-core machine. User-code needs to observe certain
7026 guidelines for thread-safe programming, see appendix A in the Isar
7027 Implementation manual.
7031 New in Isabelle2005 (October 2005)
7032 ----------------------------------
7036 * Theory headers: the new header syntax for Isar theories is
7039 imports <theory1> ... <theoryN>
7040 uses <file1> ... <fileM>
7043 where the 'uses' part is optional. The previous syntax
7045 theory <name> = <theory1> + ... + <theoryN>:
7047 will disappear in the next release. Use isatool fixheaders to convert
7048 existing theory files. Note that there is no change in ancient
7049 non-Isar theories now, but these will disappear soon.
7051 * Theory loader: parent theories can now also be referred to via
7052 relative and absolute paths.
7054 * Command 'find_theorems' searches for a list of criteria instead of a
7055 list of constants. Known criteria are: intro, elim, dest, name:string,
7056 simp:term, and any term. Criteria can be preceded by '-' to select
7057 theorems that do not match. Intro, elim, dest select theorems that
7058 match the current goal, name:s selects theorems whose fully qualified
7059 name contain s, and simp:term selects all simplification rules whose
7060 lhs match term. Any other term is interpreted as pattern and selects
7061 all theorems matching the pattern. Available in ProofGeneral under
7062 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7064 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7066 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7067 matching the current goal as introduction rule and not having "HOL."
7068 in their name (i.e. not being defined in theory HOL).
7070 * Command 'thms_containing' has been discontinued in favour of
7071 'find_theorems'; INCOMPATIBILITY.
7073 * Communication with Proof General is now 8bit clean, which means that
7074 Unicode text in UTF-8 encoding may be used within theory texts (both
7075 formal and informal parts). Cf. option -U of the Isabelle Proof
7076 General interface. Here are some simple examples (cf. src/HOL/ex):
7078 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7079 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7081 * Improved efficiency of the Simplifier and, to a lesser degree, the
7082 Classical Reasoner. Typical big applications run around 2 times
7086 *** Document preparation ***
7088 * Commands 'display_drafts' and 'print_drafts' perform simple output
7089 of raw sources. Only those symbols that do not require additional
7090 LaTeX packages (depending on comments in isabellesym.sty) are
7091 displayed properly, everything else is left verbatim. isatool display
7092 and isatool print are used as front ends (these are subject to the
7093 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7095 * Command tags control specific markup of certain regions of text,
7096 notably folding and hiding. Predefined tags include "theory" (for
7097 theory begin and end), "proof" for proof commands, and "ML" for
7098 commands involving ML code; the additional tags "visible" and
7099 "invisible" are unused by default. Users may give explicit tag
7100 specifications in the text, e.g. ''by %invisible (auto)''. The
7101 interpretation of tags is determined by the LaTeX job during document
7102 preparation: see option -V of isatool usedir, or options -n and -t of
7103 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7106 Several document versions may be produced at the same time via isatool
7107 usedir (the generated index.html will link all of them). Typical
7108 specifications include ''-V document=theory,proof,ML'' to present
7109 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7110 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7111 these parts without any formal replacement text. The Isabelle site
7112 default settings produce ''document'' and ''outline'' versions as
7115 * Several new antiquotations:
7117 @{term_type term} prints a term with its type annotated;
7119 @{typeof term} prints the type of a term;
7121 @{const const} is the same as @{term const}, but checks that the
7122 argument is a known logical constant;
7124 @{term_style style term} and @{thm_style style thm} print a term or
7125 theorem applying a "style" to it
7129 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7130 definitions, equations, inequations etc., 'concl' printing only the
7131 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7132 to print the specified premise. TermStyle.add_style provides an ML
7133 interface for introducing further styles. See also the "LaTeX Sugar"
7134 document practical applications. The ML antiquotation prints
7135 type-checked ML expressions verbatim.
7137 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7138 and 'text' support optional locale specification '(in loc)', which
7139 specifies the default context for interpreting antiquotations. For
7140 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7142 * Option 'locale=NAME' of antiquotations specifies an alternative
7143 context interpreting the subsequent argument. For example: @{thm
7144 [locale=lattice] inf_assoc}.
7146 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7149 * Proper output of antiquotations for theory commands involving a
7150 proof context (such as 'locale' or 'theorem (in loc) ...').
7152 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7153 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7155 * isatool usedir: new option -C (default true) controls whether option
7156 -D should include a copy of the original document directory; -C false
7157 prevents unwanted effects such as copying of administrative CVS data.
7162 * Considerably improved version of 'constdefs' command. Now performs
7163 automatic type-inference of declared constants; additional support for
7164 local structure declarations (cf. locales and HOL records), see also
7165 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7166 sequential dependencies of definitions within a single 'constdefs'
7167 section; moreover, the declared name needs to be an identifier. If
7168 all fails, consider to fall back on 'consts' and 'defs' separately.
7170 * Improved indexed syntax and implicit structures. First of all,
7171 indexed syntax provides a notational device for subscripted
7172 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7173 expressions. Secondly, in a local context with structure
7174 declarations, number indexes \<^sub>n or the empty index (default
7175 number 1) refer to a certain fixed variable implicitly; option
7176 show_structs controls printing of implicit structures. Typical
7177 applications of these concepts involve record types and locales.
7179 * New command 'no_syntax' removes grammar declarations (and
7180 translations) resulting from the given syntax specification, which is
7181 interpreted in the same manner as for the 'syntax' command.
7183 * 'Advanced' translation functions (parse_translation etc.) may depend
7184 on the signature of the theory context being presently used for
7185 parsing/printing, see also isar-ref manual.
7187 * Improved 'oracle' command provides a type-safe interface to turn an
7188 ML expression of type theory -> T -> term into a primitive rule of
7189 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7190 is already included here); see also FOL/ex/IffExample.thy;
7193 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7194 before); "cI" is no longer bound, use "c.intro" instead.
7195 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7196 axclasses vs. locales.
7198 * Improved internal renaming of symbolic identifiers -- attach primes
7199 instead of base 26 numbers.
7201 * New flag show_question_marks controls printing of leading question
7202 marks in schematic variable names.
7204 * In schematic variable names, *any* symbol following \<^isub> or
7205 \<^isup> is now treated as part of the base name. For example, the
7206 following works without printing of awkward ".0" indexes:
7208 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7211 * Inner syntax includes (*(*nested*) comments*).
7213 * Pretty printer now supports unbreakable blocks, specified in mixfix
7214 annotations as "(00...)".
7216 * Clear separation of logical types and nonterminals, where the latter
7217 may only occur in 'syntax' specifications or type abbreviations.
7218 Before that distinction was only partially implemented via type class
7219 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7220 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7221 exotic syntax specifications may require further adaption
7222 (e.g. Cube/Cube.thy).
7224 * Removed obsolete type class "logic", use the top sort {} instead.
7225 Note that non-logical types should be declared as 'nonterminals'
7226 rather than 'types'. INCOMPATIBILITY for new object-logic
7229 * Attributes 'induct' and 'cases': type or set names may now be
7230 locally fixed variables as well.
7232 * Simplifier: can now control the depth to which conditional rewriting
7233 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7236 * Simplifier: simplification procedures may now take the current
7237 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7238 interface), which is very useful for calling the Simplifier
7239 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7240 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7241 low-level mk_simproc no longer applies Logic.varify internally, to
7242 allow for use in a context of fixed variables.
7244 * thin_tac now works even if the assumption being deleted contains !!
7245 or ==>. More generally, erule now works even if the major premise of
7246 the elimination rule contains !! or ==>.
7248 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7250 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7251 from Pure, which contains all common declarations already. Both
7252 theories are defined via plain Isabelle/Isar .thy files.
7253 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7254 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7255 use isatool fixcpure to adapt your theory and ML sources.
7257 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7258 selections of theorems in named facts via index ranges.
7260 * 'print_theorems': in theory mode, really print the difference
7261 wrt. the last state (works for interactive theory development only),
7262 in proof mode print all local facts (cf. 'print_facts');
7264 * 'hide': option '(open)' hides only base names.
7266 * More efficient treatment of intermediate checkpoints in interactive
7269 * Code generator is now invoked via code_module (incremental code
7270 generation) and code_library (modular code generation, ML structures
7271 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7272 must be quoted when used as identifiers.
7274 * New 'value' command for reading, evaluating and printing terms using
7275 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7276 quoted when used as identifier.
7281 * New commands for the interpretation of locale expressions in
7282 theories (1), locales (2) and proof contexts (3). These generate
7283 proof obligations from the expression specification. After the
7284 obligations have been discharged, theorems of the expression are added
7285 to the theory, target locale or proof context. The synopsis of the
7286 commands is a follows:
7288 (1) interpretation expr inst
7289 (2) interpretation target < expr
7290 (3) interpret expr inst
7292 Interpretation in theories and proof contexts require a parameter
7293 instantiation of terms from the current context. This is applied to
7294 specifications and theorems of the interpreted expression.
7295 Interpretation in locales only permits parameter renaming through the
7296 locale expression. Interpretation is smart in that interpretations
7297 that are active already do not occur in proof obligations, neither are
7298 instantiated theorems stored in duplicate. Use 'print_interps' to
7299 inspect active interpretations of a particular locale. For details,
7300 see the Isar Reference manual. Examples can be found in
7301 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7303 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7304 'interpret' instead.
7306 * New context element 'constrains' for adding type constraints to
7309 * Context expressions: renaming of parameters with syntax
7312 * Locale declaration: 'includes' disallowed.
7314 * Proper static binding of attribute syntax -- i.e. types / terms /
7315 facts mentioned as arguments are always those of the locale definition
7316 context, independently of the context of later invocations. Moreover,
7317 locale operations (renaming and type / term instantiation) are applied
7318 to attribute arguments as expected.
7320 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7321 actual attributes; rare situations may require Attrib.attribute to
7322 embed those attributes into Attrib.src that lack concrete syntax.
7323 Attribute implementations need to cooperate properly with the static
7324 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7325 Attrib.XXX_thm etc. already do the right thing without further
7326 intervention. Only unusual applications -- such as "where" or "of"
7327 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7328 on the context and the facts involved -- may have to assign parsed
7329 values to argument tokens explicitly.
7331 * Changed parameter management in theorem generation for long goal
7332 statements with 'includes'. INCOMPATIBILITY: produces a different
7333 theorem statement in rare situations.
7335 * Locale inspection command 'print_locale' omits notes elements. Use
7336 'print_locale!' to have them included in the output.
7341 * Provers/hypsubst.ML: improved version of the subst method, for
7342 single-step rewriting: it now works in bound variable contexts. New is
7343 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7344 rewrite a different subterm than the original subst method, which is
7345 still available as 'simplesubst'.
7347 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7350 * Provers/trancl.ML: new transitivity reasoner for transitive and
7351 reflexive-transitive closure of relations.
7353 * Provers/blast.ML: new reference depth_limit to make blast's depth
7354 limit (previously hard-coded with a value of 20) user-definable.
7356 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7357 is peformed already. Object-logics merely need to finish their
7358 initial simpset configuration as before. INCOMPATIBILITY.
7363 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7366 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7368 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7369 and x-symbol; use option '-m epsilon' to get it actually printed.
7370 Moreover, the mathematically important symbolic identifier \<epsilon>
7371 becomes available as variable, constant etc. INCOMPATIBILITY,
7373 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7374 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7375 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7376 support corresponding Isar calculations.
7378 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7381 * theory SetInterval: changed the syntax for open intervals:
7390 The old syntax is still supported but will disappear in the next
7391 release. For conversion use the following Emacs search and replace
7392 patterns (these are not perfect but work quite well):
7394 {)\([^\.]*\)\.\. -> {\1<\.\.}
7395 \.\.\([^(}]*\)(} -> \.\.<\1}
7397 * Theory Commutative_Ring (in Library): method comm_ring for proving
7398 equalities in commutative rings; method 'algebra' provides a generic
7401 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7402 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7403 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7406 Some new syntax forms are available:
7408 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7409 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7410 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7411 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7413 The latter form "\<Sum>x < k. e" used to be based on a separate
7414 function "Summation", which has been discontinued.
7416 * theory Finite_Set: in structured induction proofs, the insert case
7417 is now 'case (insert x F)' instead of the old counterintuitive 'case
7420 * The 'refute' command has been extended to support a much larger
7421 fragment of HOL, including axiomatic type classes, constdefs and
7422 typedefs, inductive datatypes and recursion.
7424 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7425 Requires zChaff with proof generation to be installed. See
7426 HOL/ex/SAT_Examples.thy for examples.
7428 * Datatype induction via method 'induct' now preserves the name of the
7429 induction variable. For example, when proving P(xs::'a list) by
7430 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7431 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7432 in unstructured proof scripts.
7434 * Reworked implementation of records. Improved scalability for
7435 records with many fields, avoiding performance problems for type
7436 inference. Records are no longer composed of nested field types, but
7437 of nested extension types. Therefore the record type only grows linear
7438 in the number of extensions and not in the number of fields. The
7439 top-level (users) view on records is preserved. Potential
7440 INCOMPATIBILITY only in strange cases, where the theory depends on the
7441 old record representation. The type generated for a record is called
7442 <record_name>_ext_type.
7444 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7445 proofs triggered by a record definition or a simproc (if
7446 quick_and_dirty is enabled). Definitions of large records can take
7449 New simproc record_upd_simproc for simplification of multiple record
7450 updates enabled by default. Moreover, trivial updates are also
7451 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7452 occasionally, since simplification is more powerful by default.
7454 * typedef: proper support for polymorphic sets, which contain extra
7455 type-variables in the term.
7457 * Simplifier: automatically reasons about transitivity chains
7458 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7459 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7460 old proofs break occasionally as simplification may now solve more
7461 goals than previously.
7463 * Simplifier: converts x <= y into x = y if assumption y <= x is
7464 present. Works for all partial orders (class "order"), in particular
7465 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7468 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7469 bound variable or a constant then the let is unfolded. Otherwise
7470 first a is simplified to b, and then f b is simplified to g. If
7471 possible we abstract b from g arriving at "let x = b in h x",
7472 otherwise we unfold the let and arrive at g. The simproc can be
7473 enabled/disabled by the reference use_let_simproc. Potential
7474 INCOMPATIBILITY since simplification is more powerful by default.
7476 * Classical reasoning: the meson method now accepts theorems as arguments.
7478 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7479 jobs to provide advice on the provability of subgoals.
7481 * Theory OrderedGroup and Ring_and_Field: various additions and
7482 improvements to faciliate calculations involving equalities and
7485 The following theorems have been eliminated or modified
7488 abs_eq now named abs_of_nonneg
7489 abs_of_ge_0 now named abs_of_nonneg
7490 abs_minus_eq now named abs_of_nonpos
7491 imp_abs_id now named abs_of_nonneg
7492 imp_abs_neg_id now named abs_of_nonpos
7493 mult_pos now named mult_pos_pos
7494 mult_pos_le now named mult_nonneg_nonneg
7495 mult_pos_neg_le now named mult_nonneg_nonpos
7496 mult_pos_neg2_le now named mult_nonneg_nonpos2
7497 mult_neg now named mult_neg_neg
7498 mult_neg_le now named mult_nonpos_nonpos
7500 * The following lemmas in Ring_and_Field have been added to the simplifier:
7503 not_square_less_zero
7505 The following lemmas have been deleted from Real/RealPow:
7515 * Theory Parity: added rules for simplifying exponents.
7519 The following theorems have been eliminated or modified
7522 list_all_Nil now named list_all.simps(1)
7523 list_all_Cons now named list_all.simps(2)
7524 list_all_conv now named list_all_iff
7525 set_mem_eq now named mem_iff
7527 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7528 asymptotic "big O" calculations. See the notes in BigO.thy.
7533 * Theory RealDef: better support for embedding natural numbers and
7534 integers in the reals.
7536 The following theorems have been eliminated or modified
7539 exp_ge_add_one_self now requires no hypotheses
7540 real_of_int_add reversed direction of equality (use [symmetric])
7541 real_of_int_minus reversed direction of equality (use [symmetric])
7542 real_of_int_diff reversed direction of equality (use [symmetric])
7543 real_of_int_mult reversed direction of equality (use [symmetric])
7545 * Theory RComplete: expanded support for floor and ceiling functions.
7547 * Theory Ln is new, with properties of the natural logarithm
7549 * Hyperreal: There is a new type constructor "star" for making
7550 nonstandard types. The old type names are now type synonyms:
7554 hcomplex = complex star
7556 * Hyperreal: Many groups of similarly-defined constants have been
7557 replaced by polymorphic versions (INCOMPATIBILITY):
7559 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7561 starset <-- starsetNat, starsetC
7562 *s* <-- *sNat*, *sc*
7563 starset_n <-- starsetNat_n, starsetC_n
7564 *sn* <-- *sNatn*, *scn*
7565 InternalSets <-- InternalNatSets, InternalCSets
7567 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7568 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7569 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7570 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7571 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7573 * Hyperreal: Many type-specific theorems have been removed in favor of
7574 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7576 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7577 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7578 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7579 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7580 right_minus <-- hypreal_add_minus
7581 left_minus <-- {hypreal,hcomplex}_add_minus_left
7582 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7583 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7584 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7585 mult_1_right <-- hcomplex_mult_one_right
7586 mult_zero_left <-- hcomplex_mult_zero_left
7587 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7588 right_distrib <-- hypnat_add_mult_distrib2
7589 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7590 right_inverse <-- hypreal_mult_inverse
7591 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7592 order_refl <-- {hypreal,hypnat}_le_refl
7593 order_trans <-- {hypreal,hypnat}_le_trans
7594 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7595 order_less_le <-- {hypreal,hypnat}_less_le
7596 linorder_linear <-- {hypreal,hypnat}_le_linear
7597 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7598 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7599 add_nonneg_nonneg <-- hypreal_le_add_order
7601 * Hyperreal: Separate theorems having to do with type-specific
7602 versions of constants have been merged into theorems that apply to the
7603 new polymorphic constants (INCOMPATIBILITY):
7605 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7606 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7607 STAR_Un <-- {STAR,NatStar,STARC}_Un
7608 STAR_Int <-- {STAR,NatStar,STARC}_Int
7609 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7610 STAR_subset <-- {STAR,NatStar,STARC}_subset
7611 STAR_mem <-- {STAR,NatStar,STARC}_mem
7612 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7613 STAR_diff <-- {STAR,STARC}_diff
7614 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7615 STARC_hcomplex_of_complex}_image_subset
7616 starset_n_Un <-- starset{Nat,C}_n_Un
7617 starset_n_Int <-- starset{Nat,C}_n_Int
7618 starset_n_Compl <-- starset{Nat,C}_n_Compl
7619 starset_n_diff <-- starset{Nat,C}_n_diff
7620 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7621 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7622 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7623 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7624 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7625 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7626 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7627 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7628 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7629 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7630 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7631 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7632 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7633 starfun_diff <-- starfun{C,RC,CR}_diff
7634 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7635 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7636 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7637 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7638 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7639 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7640 starfun_Id <-- starfunC_Id
7641 starfun_approx <-- starfun{Nat,CR}_approx
7642 starfun_capprox <-- starfun{C,RC}_capprox
7643 starfun_abs <-- starfunNat_rabs
7644 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7645 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7646 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7647 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7648 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7649 starfun_add_approx <-- starfunCR_add_approx
7650 starfun_inverse_inverse <-- starfunC_inverse_inverse
7651 starfun_divide <-- starfun{C,CR,RC}_divide
7652 starfun_n <-- starfun{Nat,C}_n
7653 starfun_n_mult <-- starfun{Nat,C}_n_mult
7654 starfun_n_add <-- starfun{Nat,C}_n_add
7655 starfun_n_add_minus <-- starfunNat_n_add_minus
7656 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7657 starfun_n_minus <-- starfun{Nat,C}_n_minus
7658 starfun_n_eq <-- starfun{Nat,C}_n_eq
7660 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7661 star_n_minus <-- {hypreal,hcomplex}_minus
7662 star_n_diff <-- {hypreal,hcomplex}_diff
7663 star_n_mult <-- {hypreal,hcomplex}_mult
7664 star_n_inverse <-- {hypreal,hcomplex}_inverse
7665 star_n_le <-- {hypreal,hypnat}_le
7666 star_n_less <-- {hypreal,hypnat}_less
7667 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7668 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7669 star_n_abs <-- hypreal_hrabs
7670 star_n_divide <-- hcomplex_divide
7672 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7673 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7674 star_of_diff <-- hypreal_of_real_diff
7675 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7676 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7677 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7678 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7679 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7680 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7681 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7682 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7683 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7684 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7685 star_of_number_of <-- {hypreal,hcomplex}_number_of
7686 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7687 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7688 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7689 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7690 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7691 star_of_power <-- hypreal_of_real_power
7692 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7694 * Hyperreal: new method "transfer" that implements the transfer
7695 principle of nonstandard analysis. With a subgoal that mentions
7696 nonstandard types like "'a star", the command "apply transfer"
7697 replaces it with an equivalent one that mentions only standard types.
7698 To be successful, all free variables must have standard types; non-
7699 standard variables must have explicit universal quantifiers.
7701 * Hyperreal: A theory of Taylor series.
7706 * Discontinued special version of 'constdefs' (which used to support
7707 continuous functions) in favor of the general Pure one with full
7710 * New simplification procedure for solving continuity conditions; it
7711 is much faster on terms with many nested lambda abstractions (cubic
7712 instead of exponential time).
7714 * New syntax for domain package: selector names are now optional.
7715 Parentheses should be omitted unless argument is lazy, for example:
7717 domain 'a stream = cons "'a" (lazy "'a stream")
7719 * New command 'fixrec' for defining recursive functions with pattern
7720 matching; defining multiple functions with mutual recursion is also
7721 supported. Patterns may include the constants cpair, spair, up, sinl,
7722 sinr, or any data constructor defined by the domain package. The given
7723 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7724 syntax and examples.
7726 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7727 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7728 but the proof obligation additionally includes an admissibility
7729 requirement. The packages generate instances of class cpo or pcpo,
7730 with continuity and strictness theorems for Rep and Abs.
7732 * HOLCF: Many theorems have been renamed according to a more standard naming
7733 scheme (INCOMPATIBILITY):
7735 foo_inject: "foo$x = foo$y ==> x = y"
7736 foo_eq: "(foo$x = foo$y) = (x = y)"
7737 foo_less: "(foo$x << foo$y) = (x << y)"
7738 foo_strict: "foo$UU = UU"
7739 foo_defined: "... ==> foo$x ~= UU"
7740 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7745 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7746 including the First Isomorphism Theorem (on quotienting by the kernel
7749 * ZF/Simplifier: install second copy of type solver that actually
7750 makes use of TC rules declared to Isar proof contexts (or locales);
7751 the old version is still required for ML proof scripts.
7756 * Converted to Isar theory format; use locales instead of axiomatic
7762 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7765 * Pure/library.ML no longer defines its own option datatype, but uses
7766 that of the SML basis, which has constructors NONE and SOME instead of
7767 None and Some, as well as exception Option.Option instead of OPTION.
7768 The functions the, if_none, is_some, is_none have been adapted
7769 accordingly, while Option.map replaces apsome.
7771 * Pure/library.ML: the exception LIST has been given up in favour of
7772 the standard exceptions Empty and Subscript, as well as
7773 Library.UnequalLengths. Function like Library.hd and Library.tl are
7774 superceded by the standard hd and tl functions etc.
7776 A number of basic list functions are no longer exported to the ML
7777 toplevel, as they are variants of predefined functions. The following
7778 suggests how one can translate existing code:
7780 rev_append xs ys = List.revAppend (xs, ys)
7781 nth_elem (i, xs) = List.nth (xs, i)
7782 last_elem xs = List.last xs
7783 flat xss = List.concat xss
7784 seq fs = List.app fs
7785 partition P xs = List.partition P xs
7786 mapfilter f xs = List.mapPartial f xs
7788 * Pure/library.ML: several combinators for linear functional
7789 transformations, notably reverse application and composition:
7792 (x, y) |-> f f #-> g
7794 * Pure/library.ML: introduced/changed precedence of infix operators:
7796 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7798 infix 3 o oo ooo oooo;
7799 infix 4 ~~ upto downto;
7801 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7804 * Pure/library.ML: natural list combinators fold, fold_rev, and
7805 fold_map support linear functional transformations and nesting. For
7808 fold f [x1, ..., xN] y =
7809 y |> f x1 |> ... |> f xN
7811 (fold o fold) f [xs1, ..., xsN] y =
7812 y |> fold f xs1 |> ... |> fold f xsN
7814 fold f [x1, ..., xN] =
7817 (fold o fold) f [xs1, ..., xsN] =
7818 fold f xs1 #> ... #> fold f xsN
7820 * Pure/library.ML: the following selectors on type 'a option are
7823 the: 'a option -> 'a (*partial*)
7824 these: 'a option -> 'a where 'a = 'b list
7825 the_default: 'a -> 'a option -> 'a
7826 the_list: 'a option -> 'a list
7828 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7829 basic operations for association lists, following natural argument
7830 order; moreover the explicit equality predicate passed here avoids
7831 potentially expensive polymorphic runtime equality checks.
7832 The old functions may be expressed as follows:
7834 assoc = uncurry (AList.lookup (op =))
7835 assocs = these oo AList.lookup (op =)
7836 overwrite = uncurry (AList.update (op =)) o swap
7838 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7840 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7841 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7843 replacing make_keylist and keyfilter (occassionally used)
7846 make_keylist = AList.make
7847 keyfilter = AList.find (op =)
7849 * eq_fst and eq_snd now take explicit equality parameter, thus
7850 avoiding eqtypes. Naive rewrites:
7852 eq_fst = eq_fst (op =)
7853 eq_snd = eq_snd (op =)
7855 * Removed deprecated apl and apr (rarely used).
7858 apl (n, op) =>>= curry op n
7859 apr (op, m) =>>= fn n => op (n, m)
7861 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7862 provides a reasonably efficient light-weight implementation of sets as
7865 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7866 few new operations; existing lookup and update are now curried to
7867 follow natural argument order (for use with fold etc.);
7868 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7870 * Pure/General: output via the Isabelle channels of
7871 writeln/warning/error etc. is now passed through Output.output, with a
7872 hook for arbitrary transformations depending on the print_mode
7873 (cf. Output.add_mode -- the first active mode that provides a output
7874 function wins). Already formatted output may be embedded into further
7875 text via Output.raw; the result of Pretty.string_of/str_of and derived
7876 functions (string_of_term/cterm/thm etc.) is already marked raw to
7877 accommodate easy composition of diagnostic messages etc. Programmers
7878 rarely need to care about Output.output or Output.raw at all, with
7879 some notable exceptions: Output.output is required when bypassing the
7880 standard channels (writeln etc.), or in token translations to produce
7881 properly formatted results; Output.raw is required when capturing
7882 already output material that will eventually be presented to the user
7883 a second time. For the default print mode, both Output.output and
7884 Output.raw have no effect.
7886 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7887 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7888 cumulative results are displayed at the end of a batch session.
7890 * Pure/General: File.sysify_path and File.quote_sysify path have been
7891 replaced by File.platform_path and File.shell_path (with appropriate
7892 hooks). This provides a clean interface for unusual systems where the
7893 internal and external process view of file names are different.
7895 * Pure: more efficient orders for basic syntactic entities: added
7896 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7897 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7898 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7899 orders now -- potential INCOMPATIBILITY for code that depends on a
7900 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7901 Library.sort_strings on result).
7903 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7904 fold_types traverse types/terms from left to right, observing natural
7905 argument order. Supercedes previous foldl_XXX versions, add_frees,
7906 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7908 * Pure: name spaces have been refined, with significant changes of the
7909 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7910 to extern(_table). The plain name entry path is superceded by a
7911 general 'naming' context, which also includes the 'policy' to produce
7912 a fully qualified name and external accesses of a fully qualified
7913 name; NameSpace.extend is superceded by context dependent
7914 Sign.declare_name. Several theory and proof context operations modify
7915 the naming context. Especially note Theory.restore_naming and
7916 ProofContext.restore_naming to get back to a sane state; note that
7917 Theory.add_path is no longer sufficient to recover from
7918 Theory.absolute_path in particular.
7920 * Pure: new flags short_names (default false) and unique_names
7921 (default true) for controlling output of qualified names. If
7922 short_names is set, names are printed unqualified. If unique_names is
7923 reset, the name prefix is reduced to the minimum required to achieve
7924 the original result when interning again, even if there is an overlap
7925 with earlier declarations.
7927 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7928 now 'extend', and 'merge' gets an additional Pretty.pp argument
7929 (useful for printing error messages). INCOMPATIBILITY.
7931 * Pure: major reorganization of the theory context. Type Sign.sg and
7932 Theory.theory are now identified, referring to the universal
7933 Context.theory (see Pure/context.ML). Actual signature and theory
7934 content is managed as theory data. The old code and interfaces were
7935 spread over many files and structures; the new arrangement introduces
7936 considerable INCOMPATIBILITY to gain more clarity:
7938 Context -- theory management operations (name, identity, inclusion,
7939 parents, ancestors, merge, etc.), plus generic theory data;
7941 Sign -- logical signature and syntax operations (declaring consts,
7942 types, etc.), plus certify/read for common entities;
7944 Theory -- logical theory operations (stating axioms, definitions,
7945 oracles), plus a copy of logical signature operations (consts,
7946 types, etc.); also a few basic management operations (Theory.copy,
7949 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7950 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7951 for convenience -- they merely return the theory.
7953 * Pure: type Type.tsig is superceded by theory in most interfaces.
7955 * Pure: the Isar proof context type is already defined early in Pure
7956 as Context.proof (note that ProofContext.context and Proof.context are
7957 aliases, where the latter is the preferred name). This enables other
7958 Isabelle components to refer to that type even before Isar is present.
7960 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7961 typeK, constK, axiomK, oracleK), but provide explicit operations for
7962 any of these kinds. For example, Sign.intern typeK is now
7963 Sign.intern_type, Theory.hide_space Sign.typeK is now
7964 Theory.hide_types. Also note that former
7965 Theory.hide_classes/types/consts are now
7966 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7967 internalize their arguments! INCOMPATIBILITY.
7969 * Pure: get_thm interface (of PureThy and ProofContext) expects
7970 datatype thmref (with constructors Name and NameSelection) instead of
7971 plain string -- INCOMPATIBILITY;
7973 * Pure: cases produced by proof methods specify options, where NONE
7974 means to remove case bindings -- INCOMPATIBILITY in
7977 * Pure: the following operations retrieve axioms or theorems from a
7978 theory node or theory hierarchy, respectively:
7980 Theory.axioms_of: theory -> (string * term) list
7981 Theory.all_axioms_of: theory -> (string * term) list
7982 PureThy.thms_of: theory -> (string * thm) list
7983 PureThy.all_thms_of: theory -> (string * thm) list
7985 * Pure: print_tac now outputs the goal through the trace channel.
7987 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7988 Reference Toplevel.debug (default false) controls detailed printing
7989 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7990 controls execution profiling -- set to 1 for time and 2 for space
7991 (both increase the runtime).
7993 * Isar session: The initial use of ROOT.ML is now always timed,
7994 i.e. the log will show the actual process times, in contrast to the
7995 elapsed wall-clock time that the outer shell wrapper produces.
7997 * Simplifier: improved handling of bound variables (nameless
7998 representation, avoid allocating new strings). Simprocs that invoke
7999 the Simplifier recursively should use Simplifier.inherit_bounds to
8000 avoid local name clashes. Failure to do so produces warnings
8001 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8002 for further details.
8004 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8005 bindings for all theorems stored within a given theory; this may help
8006 in porting non-Isar theories to Isar ones, while keeping ML proof
8007 scripts for the time being.
8009 * ML operator HTML.with_charset specifies the charset begin used for
8010 generated HTML files. For example:
8012 HTML.with_charset "utf-8" use_thy "Hebrew";
8013 HTML.with_charset "utf-8" use_thy "Chinese";
8018 * Allow symlinks to all proper Isabelle executables (Isabelle,
8019 isabelle, isatool etc.).
8021 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8022 isatool doc, isatool mkdir, display_drafts etc.).
8024 * isatool usedir: option -f allows specification of the ML file to be
8025 used by Isabelle; default is ROOT.ML.
8027 * New isatool version outputs the version identifier of the Isabelle
8028 distribution being used.
8030 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8031 (containing Boolean satisfiability problems) into Isabelle/HOL
8036 New in Isabelle2004 (April 2004)
8037 --------------------------------
8041 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8042 Replaces linorder.ML.
8044 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8045 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8046 (\<a>...\<z>), are now considered normal letters, and can therefore
8047 be used anywhere where an ASCII letter (a...zA...Z) has until
8048 now. COMPATIBILITY: This obviously changes the parsing of some
8049 terms, especially where a symbol has been used as a binder, say
8050 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8051 as an identifier. Fix it by inserting a space around former
8052 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8053 existing theory and ML files.
8055 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8057 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8058 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8059 a normal (but invisible) letter. For multiple letter subscripts repeat
8060 \<^isub> like this: x\<^isub>1\<^isub>2.
8062 * Pure: There are now sub-/superscripts that can span more than one
8063 character. Text between \<^bsub> and \<^esub> is set in subscript in
8064 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8065 superscript. The new control characters are not identifier parts.
8067 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8068 content of "..." to the latex file instead of \isacntrl... . The "..."
8069 may consist of any printable characters excluding the end bracket >.
8071 * Pure: Using new Isar command "finalconsts" (or the ML functions
8072 Theory.add_finals or Theory.add_finals_i) it is now possible to
8073 declare constants "final", which prevents their being given a definition
8074 later. It is useful for constants whose behaviour is fixed axiomatically
8075 rather than definitionally, such as the meta-logic connectives.
8077 * Pure: 'instance' now handles general arities with general sorts
8078 (i.e. intersections of classes),
8080 * Presentation: generated HTML now uses a CSS style sheet to make layout
8081 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8082 It can be changed to alter the colors/layout of generated pages.
8087 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8088 cut_tac, subgoal_tac and thin_tac:
8089 - Now understand static (Isar) contexts. As a consequence, users of Isar
8090 locales are no longer forced to write Isar proof scripts.
8091 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8093 - INCOMPATIBILITY: names of variables to be instantiated may no
8094 longer be enclosed in quotes. Instead, precede variable name with `?'.
8095 This is consistent with the instantiation attribute "where".
8097 * Attributes "where" and "of":
8098 - Now take type variables of instantiated theorem into account when reading
8099 the instantiation string. This fixes a bug that caused instantiated
8100 theorems to have too special types in some circumstances.
8101 - "where" permits explicit instantiations of type variables.
8103 * Calculation commands "moreover" and "also" no longer interfere with
8104 current facts ("this"), admitting arbitrary combinations with "then"
8108 - Goal statements involving the context element "includes" no longer
8109 generate theorems with internal delta predicates (those ending on
8110 "_axioms") in the premise.
8111 Resolve particular premise with <locale>.intro to obtain old form.
8112 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8113 specification and "includes" elements in goal statement.
8114 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8115 [intro?] and [elim?] (respectively) by default.
8116 - Experimental command for instantiation of locales in proof contexts:
8117 instantiate <label>[<attrs>]: <loc>
8118 Instantiates locale <loc> and adds all its theorems to the current context
8119 taking into account their attributes. Label and attrs are optional
8120 modifiers, like in theorem declarations. If present, names of
8121 instantiated theorems are qualified with <label>, and the attributes
8122 <attrs> are applied after any attributes these theorems might have already.
8123 If the locale has assumptions, a chained fact of the form
8124 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8125 are derived. The command does not support old-style locales declared
8126 with "locale (open)".
8127 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8129 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8135 * Proof import: new image HOL4 contains the imported library from
8136 the HOL4 system with about 2500 theorems. It is imported by
8137 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8138 can be used like any other Isabelle image. See
8139 HOL/Import/HOL/README for more information.
8142 - Much improved handling of linear and partial orders.
8143 Reasoners for linear and partial orders are set up for type classes
8144 "linorder" and "order" respectively, and are added to the default simpset
8145 as solvers. This means that the simplifier can build transitivity chains
8146 to solve goals from the assumptions.
8147 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8148 of blast or auto after simplification become unnecessary because the goal
8149 is solved by simplification already.
8151 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8152 all proved in axiomatic type classes for semirings, rings and fields.
8155 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8156 now formalized using the Ring_and_Field theory mentioned above.
8157 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8158 than before, because now they are set up once in a generic manner.
8159 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8160 Look for the general versions in Ring_and_Field (and Power if they concern
8163 * Type "rat" of the rational numbers is now available in HOL-Complex.
8166 - Record types are now by default printed with their type abbreviation
8167 instead of the list of all field types. This can be configured via
8168 the reference "print_record_type_abbr".
8169 - Simproc "record_upd_simproc" for simplification of multiple updates added
8170 (not enabled by default).
8171 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8172 EX x. x = sel r to True (not enabled by default).
8173 - Tactic "record_split_simp_tac" to split and simplify records added.
8175 * 'specification' command added, allowing for definition by
8176 specification. There is also an 'ax_specification' command that
8177 introduces the new constants axiomatically.
8179 * arith(_tac) is now able to generate counterexamples for reals as well.
8181 * HOL-Algebra: new locale "ring" for non-commutative rings.
8183 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8184 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8186 * HOL-Matrix: a first theory for matrices in HOL with an application of
8187 matrix theory to linear programming.
8189 * Unions and Intersections:
8190 The latex output syntax of UN and INT has been changed
8191 from "\Union x \in A. B" to "\Union_{x \in A} B"
8192 i.e. the index formulae has become a subscript.
8193 Similarly for "\Union x. B", and for \Inter instead of \Union.
8195 * Unions and Intersections over Intervals:
8196 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8197 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8198 like in normal math, and corresponding versions for < and for intersection.
8200 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8201 lexicographic dictonary ordering has been added as "lexord".
8203 * ML: the legacy theory structures Int and List have been removed. They had
8204 conflicted with ML Basis Library structures having the same names.
8206 * 'refute' command added to search for (finite) countermodels. Only works
8207 for a fragment of HOL. The installation of an external SAT solver is
8208 highly recommended. See "HOL/Refute.thy" for details.
8210 * 'quickcheck' command: Allows to find counterexamples by evaluating
8211 formulae under an assignment of free variables to random values.
8212 In contrast to 'refute', it can deal with inductive datatypes,
8213 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8219 * Streams now come with concatenation and are part of the HOLCF image
8223 New in Isabelle2003 (May 2003)
8224 ------------------------------
8228 * Provers/simplifier:
8230 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8231 Assumptions are now subject to complete mutual simplification,
8232 not just from left to right. The simplifier now preserves
8233 the order of assumptions.
8235 Potential INCOMPATIBILITY:
8237 -- simp sometimes diverges where the old version did
8238 not, e.g. invoking simp on the goal
8240 [| P (f x); y = x; f x = f y |] ==> Q
8242 now gives rise to the infinite reduction sequence
8244 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8246 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8249 -- Tactics combining classical reasoner and simplification (such as auto)
8250 are also affected by this change, because many of them rely on
8251 simp. They may sometimes diverge as well or yield a different numbers
8252 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8253 in case of problems. Sometimes subsequent calls to the classical
8254 reasoner will fail because a preceeding call to the simplifier too
8255 eagerly simplified the goal, e.g. deleted redundant premises.
8257 - The simplifier trace now shows the names of the applied rewrite rules
8259 - You can limit the number of recursive invocations of the simplifier
8260 during conditional rewriting (where the simplifie tries to solve the
8261 conditions before applying the rewrite rule):
8262 ML "simp_depth_limit := n"
8263 where n is an integer. Thus you can force termination where previously
8264 the simplifier would diverge.
8266 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8268 - No longer aborts on failed congruence proof. Instead, the
8269 congruence is ignored.
8271 * Pure: New generic framework for extracting programs from constructive
8272 proofs. See HOL/Extraction.thy for an example instantiation, as well
8273 as HOL/Extraction for some case studies.
8275 * Pure: The main goal of the proof state is no longer shown by default, only
8276 the subgoals. This behaviour is controlled by a new flag.
8277 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8278 (ML: Proof.show_main_goal).
8280 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8281 rules whose conclusion matches subgoal 1:
8282 PG menu: Isabelle/Isar -> Show me -> matching rules
8283 The rules are ordered by how closely they match the subgoal.
8284 In particular, rules that solve a subgoal outright are displayed first
8285 (or rather last, the way they are printed).
8286 (ML: ProofGeneral.print_intros())
8288 * Pure: New flag trace_unify_fail causes unification to print
8289 diagnostic information (PG: in trace buffer) when it fails. This is
8290 useful for figuring out why single step proofs like rule, erule or
8293 * Pure: Locale specifications now produce predicate definitions
8294 according to the body of text (covering assumptions modulo local
8295 definitions); predicate "loc_axioms" covers newly introduced text,
8296 while "loc" is cumulative wrt. all included locale expressions; the
8297 latter view is presented only on export into the global theory
8298 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8299 on the old view without predicates;
8301 * Pure: predefined locales "var" and "struct" are useful for sharing
8302 parameters (as in CASL, for example); just specify something like
8303 ``var x + var y + struct M'' as import;
8305 * Pure: improved thms_containing: proper indexing of facts instead of
8306 raw theorems; check validity of results wrt. current name space;
8307 include local facts of proof configuration (also covers active
8308 locales), cover fixed variables in index; may use "_" in term
8309 specification; an optional limit for the number of printed facts may
8310 be given (the default is 40);
8312 * Pure: disallow duplicate fact bindings within new-style theory files
8315 * Provers: improved induct method: assumptions introduced by case
8316 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8317 the goal statement); "foo" still refers to all facts collectively;
8319 * Provers: the function blast.overloaded has been removed: all constants
8320 are regarded as potentially overloaded, which improves robustness in exchange
8321 for slight decrease in efficiency;
8323 * Provers/linorder: New generic prover for transitivity reasoning over
8324 linear orders. Note: this prover is not efficient!
8326 * Isar: preview of problems to finish 'show' now produce an error
8327 rather than just a warning (in interactive mode);
8334 - Produces a counter example if it cannot prove a goal.
8335 Note that the counter example may be spurious if the goal is not a formula
8336 of quantifier-free linear arithmetic.
8337 In ProofGeneral the counter example appears in the trace buffer.
8339 - Knows about div k and mod k where k is a numeral of type nat or int.
8341 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8342 linear arithmetic fails. This takes account of quantifiers and divisibility.
8343 Presburger arithmetic can also be called explicitly via presburger(_tac).
8345 * simp's arithmetic capabilities have been enhanced a bit: it now
8346 takes ~= in premises into account (by performing a case split);
8348 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8349 are distributed over a sum of terms;
8351 * New tactic "trans_tac" and method "trans" instantiate
8352 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8355 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8356 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8358 * 'typedef' command has new option "open" to suppress the set
8361 * functions Min and Max on finite sets have been introduced (theory
8364 * attribute [symmetric] now works for relations as well; it turns
8365 (x,y) : R^-1 into (y,x) : R, and vice versa;
8367 * induct over a !!-quantified statement (say !!x1..xn):
8368 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8370 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8371 %x. None. Warning: empty_def now refers to the previously hidden definition
8374 * Algebra: formalization of classical algebra. Intended as base for
8375 any algebraic development in Isabelle. Currently covers group theory
8376 (up to Sylow's theorem) and ring theory (Universal Property of
8377 Univariate Polynomials). Contributions welcome;
8379 * GroupTheory: deleted, since its material has been moved to Algebra;
8381 * Complex: new directory of the complex numbers with numeric constants,
8382 nonstandard complex numbers, and some complex analysis, standard and
8383 nonstandard (Jacques Fleuriot);
8385 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8387 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8390 * Real/HahnBanach: updated and adapted to locales;
8392 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8395 * UNITY: added the Meier-Sanders theory of progress sets;
8397 * MicroJava: bytecode verifier and lightweight bytecode verifier
8398 as abstract algorithms, instantiated to the JVM;
8400 * Bali: Java source language formalization. Type system, operational
8401 semantics, axiomatic semantics. Supported language features:
8402 classes, interfaces, objects,virtual methods, static methods,
8403 static/instance fields, arrays, access modifiers, definite
8404 assignment, exceptions.
8409 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8412 * Main ZF: virtually all theories converted to new-style format;
8417 * Pure: Tactic.prove provides sane interface for internal proofs;
8418 omits the infamous "standard" operation, so this is more appropriate
8419 than prove_goalw_cterm in many situations (e.g. in simprocs);
8421 * Pure: improved error reporting of simprocs;
8423 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8427 *** Document preparation ***
8429 * uses \par instead of \\ for line breaks in theory text. This may
8430 shift some page breaks in large documents. To get the old behaviour
8431 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8433 * minimized dependencies of isabelle.sty and isabellesym.sty on
8436 * \<euro> now needs package babel/greek instead of marvosym (which
8439 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8444 New in Isabelle2002 (March 2002)
8445 --------------------------------
8447 *** Document preparation ***
8449 * greatly simplified document preparation setup, including more
8450 graceful interpretation of isatool usedir -i/-d/-D options, and more
8451 instructive isatool mkdir; users should basically be able to get
8452 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8453 users may run a separate document processing stage manually like this:
8454 "isatool usedir -D output HOL Test && isatool document Test/output";
8456 * theory dependency graph may now be incorporated into documents;
8457 isatool usedir -g true will produce session_graph.eps/.pdf for use
8458 with \includegraphics of LaTeX;
8460 * proper spacing of consecutive markup elements, especially text
8461 blocks after section headings;
8463 * support bold style (for single symbols only), input syntax is like
8464 this: "\<^bold>\<alpha>" or "\<^bold>A";
8466 * \<bullet> is now output as bold \cdot by default, which looks much
8467 better in printed text;
8469 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8470 note that these symbols are currently unavailable in Proof General /
8471 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8473 * isatool latex no longer depends on changed TEXINPUTS, instead
8474 isatool document copies the Isabelle style files to the target
8480 * Pure/Provers: improved proof by cases and induction;
8481 - 'case' command admits impromptu naming of parameters (such as
8483 - 'induct' method divinates rule instantiation from the inductive
8484 claim; no longer requires excessive ?P bindings for proper
8485 instantiation of cases;
8486 - 'induct' method properly enumerates all possibilities of set/type
8487 rules; as a consequence facts may be also passed through *type*
8488 rules without further ado;
8489 - 'induct' method now derives symbolic cases from the *rulified*
8490 rule (before it used to rulify cases stemming from the internal
8491 atomized version); this means that the context of a non-atomic
8492 statement becomes is included in the hypothesis, avoiding the
8493 slightly cumbersome show "PROP ?case" form;
8494 - 'induct' may now use elim-style induction rules without chaining
8495 facts, using ``missing'' premises from the goal state; this allows
8496 rules stemming from inductive sets to be applied in unstructured
8497 scripts, while still benefitting from proper handling of non-atomic
8498 statements; NB: major inductive premises need to be put first, all
8499 the rest of the goal is passed through the induction;
8500 - 'induct' proper support for mutual induction involving non-atomic
8501 rule statements (uses the new concept of simultaneous goals, see
8503 - append all possible rule selections, but only use the first
8504 success (no backtracking);
8505 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8506 - undeclared rule case names default to numbers 1, 2, 3, ...;
8507 - added 'print_induct_rules' (covered by help item in recent Proof
8509 - moved induct/cases attributes to Pure, methods to Provers;
8510 - generic method setup instantiated for FOL and HOL;
8512 * Pure: support multiple simultaneous goal statements, for example
8513 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8514 meta-level mechanism, this acts as if several individual goals had
8515 been stated separately; in particular common proof methods need to be
8516 repeated in order to cover all claims; note that a single elimination
8517 step is *not* sufficient to establish the two conjunctions, so this
8520 assume "A & B" then have A and B .. (*".." fails*)
8522 better use "obtain" in situations as above; alternative refer to
8523 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8525 * Pure: proper integration with ``locales''; unlike the original
8526 version by Florian Kammller, Isar locales package high-level proof
8527 contexts rather than raw logical ones (e.g. we admit to include
8528 attributes everywhere); operations on locales include merge and
8529 rename; support for implicit arguments (``structures''); simultaneous
8530 type-inference over imports and text; see also HOL/ex/Locales.thy for
8533 * Pure: the following commands have been ``localized'', supporting a
8534 target locale specification "(in name)": 'lemma', 'theorem',
8535 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8536 stored both within the locale and at the theory level (exported and
8537 qualified by the locale name);
8539 * Pure: theory goals may now be specified in ``long'' form, with
8540 ad-hoc contexts consisting of arbitrary locale elements. for example
8541 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8542 definitions may be given, too); the result is a meta-level rule with
8543 the context elements being discharged in the obvious way;
8545 * Pure: new proof command 'using' allows to augment currently used
8546 facts after a goal statement ('using' is syntactically analogous to
8547 'apply', but acts on the goal's facts only); this allows chained facts
8548 to be separated into parts given before and after a claim, as in
8549 ``from a and b have C using d and e <proof>'';
8551 * Pure: renamed "antecedent" case to "rule_context";
8553 * Pure: new 'judgment' command records explicit information about the
8554 object-logic embedding (used by several tools internally); no longer
8555 use hard-wired "Trueprop";
8557 * Pure: added 'corollary' command;
8559 * Pure: fixed 'token_translation' command;
8561 * Pure: removed obsolete 'exported' attribute;
8563 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8564 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8565 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8567 * Pure: method 'atomize' presents local goal premises as object-level
8568 statements (atomic meta-level propositions); setup controlled via
8569 rewrite rules declarations of 'atomize' attribute; example
8570 application: 'induct' method with proper rule statements in improper
8573 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8574 now consider the syntactic context of assumptions, giving a better
8575 chance to get type-inference of the arguments right (this is
8576 especially important for locales);
8578 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8581 * Pure/obtain: the formal conclusion "thesis", being marked as
8582 ``internal'', may no longer be reference directly in the text;
8583 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8586 * Pure: generic 'sym' attribute which declares a rule both as pure
8587 'elim?' and for the 'symmetric' operation;
8589 * Pure: marginal comments ``--'' may now occur just anywhere in the
8590 text; the fixed correlation with particular command syntax has been
8593 * Pure: new method 'rules' is particularly well-suited for proof
8594 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8595 but often produces more compact proof terms with less detours;
8597 * Pure/Provers/classical: simplified integration with pure rule
8598 attributes and methods; the classical "intro?/elim?/dest?"
8599 declarations coincide with the pure ones; the "rule" method no longer
8600 includes classically swapped intros; "intro" and "elim" methods no
8601 longer pick rules from the context; also got rid of ML declarations
8602 AddXIs/AddXEs/AddXDs; all of this has some potential for
8605 * Provers/classical: attribute 'swapped' produces classical inversions
8606 of introduction rules;
8608 * Provers/simplifier: 'simplified' attribute may refer to explicit
8609 rules instead of full simplifier context; 'iff' attribute handles
8612 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8614 * HOL: 'recdef' now fails on unfinished automated proofs, use
8615 "(permissive)" option to recover old behavior;
8617 * HOL: 'inductive' no longer features separate (collective) attributes
8618 for 'intros' (was found too confusing);
8620 * HOL: properly declared induction rules less_induct and
8626 * HOL: moved over to sane numeral syntax; the new policy is as
8629 - 0 and 1 are polymorphic constants, which are defined on any
8630 numeric type (nat, int, real etc.);
8632 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8633 binary representation internally;
8635 - type nat has special constructor Suc, and generally prefers Suc 0
8636 over 1::nat and Suc (Suc 0) over 2::nat;
8638 This change may cause significant problems of INCOMPATIBILITY; here
8639 are some hints on converting existing sources:
8641 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8642 entities, so expressions involving "-" (unary or binary minus) need
8643 to be spaced properly;
8645 - existing occurrences of "1" may need to be constraint "1::nat" or
8646 even replaced by Suc 0; similar for old "2";
8648 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8650 - remove all special provisions on numerals in proofs;
8652 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8653 representation (depends on bin_arith_simps in the default context);
8655 * HOL: symbolic syntax for x^2 (numeral 2);
8657 * HOL: the class of all HOL types is now called "type" rather than
8658 "term"; INCOMPATIBILITY, need to adapt references to this type class
8659 in axclass/classes, instance/arities, and (usually rare) occurrences
8660 in typings (of consts etc.); internally the class is called
8661 "HOL.type", ML programs should refer to HOLogic.typeS;
8663 * HOL/record package improvements:
8664 - new derived operations "fields" to build a partial record section,
8665 "extend" to promote a fixed record to a record scheme, and
8666 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8667 declared as simp by default;
8668 - shared operations ("more", "fields", etc.) now need to be always
8669 qualified) --- potential INCOMPATIBILITY;
8670 - removed "make_scheme" operations (use "make" with "extend") --
8672 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8673 - provides cases/induct rules for use with corresponding Isar
8674 methods (for concrete records, record schemes, concrete more
8675 parts, and schematic more parts -- in that order);
8676 - internal definitions directly based on a light-weight abstract
8677 theory of product types over typedef rather than datatype;
8679 * HOL: generic code generator for generating executable ML code from
8680 specifications; specific support for HOL constructs such as inductive
8681 datatypes and sets, as well as recursive functions; can be invoked
8682 via 'generate_code' theory section;
8684 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8686 * HOL: consolidated and renamed several theories. In particular:
8687 Ord.thy has been absorbed into HOL.thy
8688 String.thy has been absorbed into List.thy
8690 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8691 (beware of argument permutation!);
8693 * HOL: linorder_less_split superseded by linorder_cases;
8695 * HOL/List: "nodups" renamed to "distinct";
8697 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8698 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8699 - Ex_def has changed, now need to use some_eq_ex
8701 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8702 in this (rare) case use:
8704 delSWrapper "split_all_tac"
8705 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8707 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8710 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8711 Isabelle's type classes, ^ on functions and relations has too general
8712 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8713 necessary to attach explicit type constraints;
8715 * HOL/Relation: the prefix name of the infix "O" has been changed from
8716 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8717 renamed accordingly (eg "compI" -> "rel_compI").
8719 * HOL: syntax translations now work properly with numerals and records
8722 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8723 of "lam" -- INCOMPATIBILITY;
8725 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8726 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8727 renamed "Product_Type.unit";
8729 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8731 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8732 the "cases" method);
8734 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8737 * HOL/IMP: updated and converted to new-style theory format; several
8738 parts turned into readable document, with proper Isar proof texts and
8739 some explanations (by Gerwin Klein);
8741 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8743 * HOL-Hyperreal is now a logic image;
8748 * Isar: consts/constdefs supports mixfix syntax for continuous
8751 * Isar: domain package adapted to new-style theory format, e.g. see
8754 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8755 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8756 lift.induct_tac, always use UU instead of Undef;
8758 * HOLCF/IMP: updated and converted to new-style theory;
8763 * Isar: proper integration of logic-specific tools and packages,
8764 including theory commands '(co)inductive', '(co)datatype',
8765 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8766 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8768 * theory Main no longer includes AC; for the Axiom of Choice, base
8769 your theory on Main_ZFC;
8771 * the integer library now covers quotients and remainders, with many
8772 laws relating division to addition, multiplication, etc.;
8774 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8775 typeless version of the formalism;
8777 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8780 * ZF/Induct: new directory for examples of inductive definitions,
8781 including theory Multiset for multiset orderings; converted to
8782 new-style theory format;
8784 * ZF: many new theorems about lists, ordinals, etc.;
8789 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8790 variable proof controls level of detail: 0 = no proofs (only oracle
8791 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8792 also ref manual for further ML interfaces;
8794 * Pure/axclass: removed obsolete ML interface
8795 goal_subclass/goal_arity;
8797 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8798 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8799 separate tokens, so expressions involving minus need to be spaced
8802 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8803 rather than "infixl" or "infixr";
8805 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8806 sort constraint specifications in type inference; e.g. "x::_::foo"
8807 ensures that the type of "x" is of sort "foo" (but not necessarily a
8810 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8811 control output of nested => (types); the default behavior is
8814 * Pure/syntax: builtin parse translation for "_constify" turns valued
8815 tokens into AST constants;
8817 * Pure/syntax: prefer later declarations of translations and print
8818 translation functions; potential INCOMPATIBILITY: need to reverse
8819 multiple declarations for same syntax element constant;
8821 * Pure/show_hyps reset by default (in accordance to existing Isar
8824 * Provers/classical: renamed addaltern to addafter, addSaltern to
8827 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8830 * system: tested support for MacOS X; should be able to get Isabelle +
8831 Proof General to work in a plain Terminal after installing Poly/ML
8832 (e.g. from the Isabelle distribution area) and GNU bash alone
8833 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8834 support requires further installations, e.g. from
8835 http://fink.sourceforge.net/);
8837 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8839 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8840 of 40 MB), cf. ML_OPTIONS;
8842 * system: Proof General keywords specification is now part of the
8843 Isabelle distribution (see etc/isar-keywords.el);
8845 * system: support for persistent Proof General sessions (refrain from
8846 outdating all loaded theories on startup); user may create writable
8847 logic images like this: ``isabelle -q HOL Test'';
8849 * system: smart selection of Isabelle process versus Isabelle
8850 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8851 run both "isabelle" and "Isabelle" even if file names are badly
8852 damaged (executable inspects the case of the first letter of its own
8853 name); added separate "isabelle-process" and "isabelle-interface";
8855 * system: refrain from any attempt at filtering input streams; no
8856 longer support ``8bit'' encoding of old isabelle font, instead proper
8857 iso-latin characters may now be used; the related isatools
8858 "symbolinput" and "nonascii" have disappeared as well;
8860 * system: removed old "xterm" interface (the print modes "xterm" and
8861 "xterm_color" are still available for direct use in a suitable
8866 New in Isabelle99-2 (February 2001)
8867 -----------------------------------
8869 *** Overview of INCOMPATIBILITIES ***
8871 * HOL: please note that theories in the Library and elsewhere often use the
8872 new-style (Isar) format; to refer to their theorems in an ML script you must
8873 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8875 * HOL: inductive package no longer splits induction rule aggressively,
8876 but only as far as specified by the introductions given; the old
8877 format may be recovered via ML function complete_split_rule or attribute
8878 'split_rule (complete)';
8880 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8881 gfp_Tarski to gfp_unfold;
8883 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8885 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8886 relation); infix "^^" has been renamed "``"; infix "``" has been
8887 renamed "`"; "univalent" has been renamed "single_valued";
8889 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8892 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8894 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8896 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8897 consequence, it is no longer monotonic wrt. the local goal context
8898 (which is now passed through the inductive cases);
8900 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8901 \<gg> to \<ggreater>;
8904 *** Document preparation ***
8906 * \isabellestyle{NAME} selects version of Isabelle output (currently
8907 available: are "it" for near math-mode best-style output, "sl" for
8908 slanted text style, and "tt" for plain type-writer; if no
8909 \isabellestyle command is given, output is according to slanted
8912 * support sub/super scripts (for single symbols only), input syntax is
8913 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8915 * some more standard symbols; see Appendix A of the system manual for
8916 the complete list of symbols defined in isabellesym.sty;
8918 * improved isabelle style files; more abstract symbol implementation
8919 (should now use \isamath{...} and \isatext{...} in custom symbol
8922 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8923 state; Note that presentation of goal states does not conform to
8924 actual human-readable proof documents. Please do not include goal
8925 states into document output unless you really know what you are doing!
8927 * proper indentation of antiquoted output with proportional LaTeX
8930 * no_document ML operator temporarily disables LaTeX document
8933 * isatool unsymbolize tunes sources for plain ASCII communication;
8938 * Pure: Isar now suffers initial goal statements to contain unbound
8939 schematic variables (this does not conform to actual readable proof
8940 documents, due to unpredictable outcome and non-compositional proof
8941 checking); users who know what they are doing may use schematic goals
8942 for Prolog-style synthesis of proven results;
8944 * Pure: assumption method (an implicit finishing) now handles actual
8947 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8948 initial goal, declare "that" only as Pure intro (only for single
8949 steps); the "that" rule assumption may now be involved in implicit
8950 finishing, thus ".." becomes a feasible for trivial obtains;
8952 * Pure: default proof step now includes 'intro_classes'; thus trivial
8953 instance proofs may be performed by "..";
8955 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8958 * Pure: more robust selection of calculational rules;
8960 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8961 rule (as well as the assumption rule);
8963 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8964 lemmas, using the graph browser tool;
8966 * Pure: predict failure of "show" in interactive mode;
8968 * Pure: 'thms_containing' now takes actual terms as arguments;
8970 * HOL: improved method 'induct' --- now handles non-atomic goals
8971 (potential INCOMPATIBILITY); tuned error handling;
8973 * HOL: cases and induct rules now provide explicit hints about the
8974 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8975 any remaining facts are inserted into the goal verbatim;
8977 * HOL: local contexts (aka cases) may now contain term bindings as
8978 well; the 'cases' and 'induct' methods new provide a ?case binding for
8979 the result to be shown in each case;
8981 * HOL: added 'recdef_tc' command;
8983 * isatool convert assists in eliminating legacy ML scripts;
8988 * HOL/Library: a collection of generic theories to be used together
8989 with main HOL; the theory loader path already includes this directory
8990 by default; the following existing theories have been moved here:
8991 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8992 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8994 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8995 modelling and verification task performed in Isabelle/HOL +
8996 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8998 * HOL/Algebra: special summation operator SUM no longer exists, it has
8999 been replaced by setsum; infix 'assoc' now has priority 50 (like
9000 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9001 'domain', this makes the theory consistent with mathematical
9004 * HOL basics: added overloaded operations "inverse" and "divide"
9005 (infix "/"), syntax for generic "abs" operation, generic summation
9008 * HOL/typedef: simplified package, provide more useful rules (see also
9011 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9012 now expressed as a proper nested rule (old-style tactic scripts may
9013 require atomize_strip_tac to cope with non-atomic premises);
9015 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9016 to "split_conv" (old name still available for compatibility);
9018 * HOL: improved concrete syntax for strings (e.g. allows translation
9019 rules with string literals);
9021 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9022 and Fleuriot's mechanization of analysis, including the transcendental
9023 functions for the reals;
9025 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9030 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9031 "lam" is displayed as TWO lambda-symbols
9033 * CTT: theory Main now available, containing everything (that is, Bool
9039 * Pure: the Simplifier has been implemented properly as a derived rule
9040 outside of the actual kernel (at last!); the overall performance
9041 penalty in practical applications is about 50%, while reliability of
9042 the Isabelle inference kernel has been greatly improved;
9044 * print modes "brackets" and "no_brackets" control output of nested =>
9045 (types) and ==> (props); the default behaviour is "brackets";
9047 * Provers: fast_tac (and friends) now handle actual object-logic rules
9048 as assumptions as well;
9050 * system: support Poly/ML 4.0;
9052 * system: isatool install handles KDE version 1 or 2;
9056 New in Isabelle99-1 (October 2000)
9057 ----------------------------------
9059 *** Overview of INCOMPATIBILITIES ***
9061 * HOL: simplification of natural numbers is much changed; to partly
9062 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9063 issue the following ML commands:
9065 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9066 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9068 * HOL: simplification no longer dives into case-expressions; this is
9069 controlled by "t.weak_case_cong" for each datatype t;
9071 * HOL: nat_less_induct renamed to less_induct;
9073 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9074 fixsome to patch .thy and .ML sources automatically;
9076 select_equality -> some_equality
9077 select_eq_Ex -> some_eq_ex
9078 selectI2EX -> someI2_ex
9081 select1_equality -> some1_equality
9082 Eps_sym_eq -> some_sym_eq_trivial
9083 Eps_eq -> some_eq_trivial
9085 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9087 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9090 * HOL: the recursion equations generated by 'recdef' are now called
9091 f.simps instead of f.rules;
9093 * HOL: qed_spec_mp now also handles bounded ALL as well;
9095 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9096 sometimes be needed;
9098 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9100 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9102 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9103 product is now "<*>" instead of "Times"; the lexicographic product is
9104 now "<*lex*>" instead of "**";
9106 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9107 of main HOL, but was unused); better use HOL's datatype package;
9109 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9110 the old syntax may be recovered as follows:
9113 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9114 (infixl "\\<oplus>" 100)
9116 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9118 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9119 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9122 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9123 changed from A/r to A//r;
9125 * ZF: new treatment of arithmetic (nat & int) may break some old
9128 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9129 rulify -> rule_format, elimify -> elim_format, ...);
9131 * Isar/Provers: intro/elim/dest attributes changed; renamed
9132 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9133 should have to change intro!! to intro? only); replaced "delrule" by
9136 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9138 * Provers: strengthened force_tac by using new first_best_tac;
9140 * LaTeX document preparation: several changes of isabelle.sty (see
9144 *** Document preparation ***
9146 * formal comments (text blocks etc.) in new-style theories may now
9147 contain antiquotations of thm/prop/term/typ/text to be presented
9148 according to latex print mode; concrete syntax is like this:
9149 @{term[show_types] "f(x) = a + x"};
9151 * isatool mkdir provides easy setup of Isabelle session directories,
9152 including proper document sources;
9154 * generated LaTeX sources are now deleted after successful run
9155 (isatool document -c); may retain a copy somewhere else via -D option
9158 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9159 style files, achieving self-contained LaTeX sources and simplifying
9162 * old-style theories now produce (crude) LaTeX output as well;
9164 * browser info session directories are now self-contained (may be put
9165 on WWW server seperately); improved graphs of nested sessions; removed
9166 graph for 'all sessions';
9168 * several improvements in isabelle style files; \isabellestyle{it}
9169 produces fake math mode output; \isamarkupheader is now \section by
9170 default; see lib/texinputs/isabelle.sty etc.;
9175 * Isar/Pure: local results and corresponding term bindings are now
9176 subject to Hindley-Milner polymorphism (similar to ML); this
9177 accommodates incremental type-inference very nicely;
9179 * Isar/Pure: new derived language element 'obtain' supports
9180 generalized existence reasoning;
9182 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9183 support accumulation of results, without applying any rules yet;
9184 useful to collect intermediate results without explicit name
9185 references, and for use with transitivity rules with more than 2
9188 * Isar/Pure: scalable support for case-analysis type proofs: new
9189 'case' language element refers to local contexts symbolically, as
9190 produced by certain proof methods; internally, case names are attached
9191 to theorems as "tags";
9193 * Isar/Pure: theory command 'hide' removes declarations from
9194 class/type/const name spaces;
9196 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9197 indicate potential overloading;
9199 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9201 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9202 "{a,b,c}" instead of {a,b,c};
9204 * Isar/Pure now provides its own version of intro/elim/dest
9205 attributes; useful for building new logics, but beware of confusion
9206 with the version in Provers/classical;
9208 * Isar/Pure: the local context of (non-atomic) goals is provided via
9209 case name 'antecedent';
9211 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9212 to the current context is now done automatically);
9214 * Isar/Pure: theory command 'method_setup' provides a simple interface
9215 for definining proof methods in ML;
9217 * Isar/Provers: intro/elim/dest attributes changed; renamed
9218 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9219 most cases, one should have to change intro!! to intro? only);
9220 replaced "delrule" by "rule del";
9222 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9223 'symmetric' attribute (the latter supercedes [RS sym]);
9225 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9226 method modifier); 'simp' method: 'only:' modifier removes loopers as
9227 well (including splits);
9229 * Isar/Provers: Simplifier and Classical methods now support all kind
9230 of modifiers used in the past, including 'cong', 'iff', etc.
9232 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9233 of Simplifier and Classical reasoner);
9235 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9236 now support named cases; major packages (inductive, datatype, primrec,
9237 recdef) support case names and properly name parameters;
9239 * Isar/HOL: new transitivity rules for substitution in inequalities --
9240 monotonicity conditions are extracted to be proven at end of
9243 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9246 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9247 split_if split_if_asm; datatype package provides theorems foo.splits =
9248 foo.split foo.split_asm for each datatype;
9250 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9251 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9252 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9253 use "(cases (simplified))" method in proper proof texts);
9255 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9257 * Isar: names of theorems etc. may be natural numbers as well;
9259 * Isar: 'pr' command: optional arguments for goals_limit and
9260 ProofContext.prems_limit; no longer prints theory contexts, but only
9263 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9264 additional print modes to be specified; e.g. "pr(latex)" will print
9265 proof state according to the Isabelle LaTeX style;
9267 * Isar: improved support for emulating tactic scripts, including proof
9268 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9269 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9270 (for HOL datatypes);
9272 * Isar: simplified (more robust) goal selection of proof methods: 1st
9273 goal, all goals, or explicit goal specifier (tactic emulation); thus
9274 'proof method scripts' have to be in depth-first order;
9276 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9278 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9279 should instead use individual commands for printing items
9280 (print_commands, print_methods etc.);
9282 * Isar: added 'nothing' --- the empty list of theorems;
9287 * HOL/MicroJava: formalization of a fragment of Java, together with a
9288 corresponding virtual machine and a specification of its bytecode
9289 verifier and a lightweight bytecode verifier, including proofs of
9290 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9291 Cornelia Pusch (see also the homepage of project Bali at
9292 http://isabelle.in.tum.de/Bali/);
9294 * HOL/Algebra: new theory of rings and univariate polynomials, by
9297 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9298 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9301 * HOL/Lattice: fundamental concepts of lattice theory and order
9302 structures, including duals, properties of bounds versus algebraic
9303 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9304 Theorem for complete lattices etc.; may also serve as a demonstration
9305 for abstract algebraic reasoning using axiomatic type classes, and
9306 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9308 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9311 * HOL/IMPP: extension of IMP with local variables and mutually
9312 recursive procedures, by David von Oheimb;
9314 * HOL/Lambda: converted into new-style theory and document;
9316 * HOL/ex/Multiquote: example of multiple nested quotations and
9317 anti-quotations -- basically a generalized version of de-Bruijn
9318 representation; very useful in avoiding lifting of operations;
9320 * HOL/record: added general record equality rule to simpset; fixed
9321 select-update simplification procedure to handle extended records as
9322 well; admit "r" as field name;
9324 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9325 other numeric types and also as the identity of groups, rings, etc.;
9327 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9328 Types nat and int belong to this axclass;
9330 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9331 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9332 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9333 two terms #m*u and #n*u are replaced by #(m+n)*u
9334 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9335 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9336 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9338 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9339 powerful prover for predicate logic but knows nothing of clasets; see
9340 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9342 * HOL: new version of "case_tac" subsumes both boolean case split and
9343 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9344 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9346 * HOL: simplification no longer dives into case-expressions: only the
9347 selector expression is simplified, but not the remaining arms; to
9348 enable full simplification of case-expressions for datatype t, you may
9349 remove t.weak_case_cong from the simpset, either globally (Delcongs
9350 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9352 * HOL/recdef: the recursion equations generated by 'recdef' for
9353 function 'f' are now called f.simps instead of f.rules; if all
9354 termination conditions are proved automatically, these simplification
9355 rules are added to the simpset, as in primrec; rules may be named
9356 individually as well, resulting in a separate list of theorems for
9359 * HOL/While is a new theory that provides a while-combinator. It
9360 permits the definition of tail-recursive functions without the
9361 provision of a termination measure. The latter is necessary once the
9362 invariant proof rule for while is applied.
9364 * HOL: new (overloaded) notation for the set of elements below/above
9365 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9367 * HOL: theorems impI, allI, ballI bound as "strip";
9369 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9370 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9371 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9373 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9375 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9376 main HOL, but was unused);
9378 * HOL: fewer consts declared as global (e.g. have to refer to
9379 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9381 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9382 in case of overlap with user translations (e.g. judgements over
9383 tuples); (note that the underlying logical represenation is still
9389 * ZF: simplification automatically cancels common terms in arithmetic
9390 expressions over nat and int;
9392 * ZF: new treatment of nat to minimize type-checking: all operators
9393 coerce their operands to a natural number using the function natify,
9394 making the algebraic laws unconditional;
9396 * ZF: as above, for int: operators coerce their operands to an integer
9397 using the function intify;
9399 * ZF: the integer library now contains many of the usual laws for the
9400 orderings, including $<=, and monotonicity laws for $+ and $*;
9402 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9405 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9406 to the simplifier and classical reasoner simultaneously;
9411 * Provers: blast_tac now handles actual object-logic rules as
9412 assumptions; note that auto_tac uses blast_tac internally as well;
9414 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9415 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9417 * Provers: delrules now handles destruct rules as well (no longer need
9418 explicit make_elim);
9420 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9421 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9422 use instead the strong form,
9423 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9424 in HOL, FOL and ZF the function cla_make_elim will create such rules
9425 from destruct-rules;
9427 * Provers: Simplifier.easy_setup provides a fast path to basic
9428 Simplifier setup for new object-logics;
9430 * Pure: AST translation rules no longer require constant head on LHS;
9432 * Pure: improved name spaces: ambiguous output is qualified; support
9433 for hiding of names;
9435 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9436 XSYMBOL_HOME; no longer need to do manual configuration in most
9439 * system: compression of ML heaps images may now be controlled via -c
9440 option of isabelle and isatool usedir (currently only observed by
9443 * system: isatool installfonts may handle X-Symbol fonts as well (very
9444 useful for remote X11);
9446 * system: provide TAGS file for Isabelle sources;
9448 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9451 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9452 timing flag supersedes proof_timing and Toplevel.trace;
9454 * ML: new combinators |>> and |>>> for incremental transformations
9455 with secondary results (e.g. certain theory extensions):
9457 * ML: PureThy.add_defs gets additional argument to indicate potential
9458 overloading (usually false);
9460 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9465 New in Isabelle99 (October 1999)
9466 --------------------------------
9468 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9470 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9471 are no longer simplified. (This allows the simplifier to unfold recursive
9472 functional programs.) To restore the old behaviour, declare
9474 Delcongs [if_weak_cong];
9476 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9479 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9481 * HOL/datatype: mutual_induct_tac no longer exists --
9482 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9484 * HOL/typedef: fixed type inference for representing set; type
9485 arguments now have to occur explicitly on the rhs as type constraints;
9487 * ZF: The con_defs part of an inductive definition may no longer refer
9488 to constants declared in the same theory;
9490 * HOL, ZF: the function mk_cases, generated by the inductive
9491 definition package, has lost an argument. To simplify its result, it
9492 uses the default simpset instead of a supplied list of theorems.
9494 * HOL/List: the constructors of type list are now Nil and Cons;
9496 * Simplifier: the type of the infix ML functions
9497 setSSolver addSSolver setSolver addSolver
9498 is now simpset * solver -> simpset where `solver' is a new abstract type
9499 for packaging solvers. A solver is created via
9500 mk_solver: string -> (thm list -> int -> tactic) -> solver
9501 where the string argument is only a comment.
9506 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9507 decision procedure for linear arithmetic. Currently it is used for
9508 types `nat', `int', and `real' in HOL (see below); it can, should and
9509 will be instantiated for other types and logics as well.
9511 * The simplifier now accepts rewrite rules with flexible heads, eg
9512 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9513 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9519 * New Isabelle/Isar subsystem provides an alternative to traditional
9520 tactical theorem proving; together with the ProofGeneral/isar user
9521 interface it offers an interactive environment for developing human
9522 readable proof documents (Isar == Intelligible semi-automated
9523 reasoning); for further information see isatool doc isar-ref,
9524 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9526 * improved and simplified presentation of theories: better HTML markup
9527 (including colors), graph views in several sizes; isatool usedir now
9528 provides a proper interface for user theories (via -P option); actual
9529 document preparation based on (PDF)LaTeX is available as well (for
9530 new-style theories only); see isatool doc system for more information;
9532 * native support for Proof General, both for classic Isabelle and
9535 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9536 using the graph browser tool;
9538 * Isabelle manuals now also available as PDF;
9540 * theory loader rewritten from scratch (may not be fully
9541 bug-compatible); old loadpath variable has been replaced by show_path,
9542 add_path, del_path, reset_path functions; new operations such as
9543 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9546 * improved isatool install: option -k creates KDE application icon,
9547 option -p DIR installs standalone binaries;
9549 * added ML_PLATFORM setting (useful for cross-platform installations);
9550 more robust handling of platform specific ML images for SML/NJ;
9552 * the settings environment is now statically scoped, i.e. it is never
9553 created again in sub-processes invoked from isabelle, isatool, or
9556 * path element specification '~~' refers to '$ISABELLE_HOME';
9558 * in locales, the "assumes" and "defines" parts may be omitted if
9561 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9564 * new print_mode "HTML";
9566 * new flag show_tags controls display of tags of theorems (which are
9567 basically just comments that may be attached by some tools);
9569 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9570 mode and goal output format:
9572 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9574 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9576 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9577 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9579 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9581 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9583 * function bind_thms stores lists of theorems (cf. bind_thm);
9585 * new shorthand tactics ftac, eatac, datac, fatac;
9587 * qed (and friends) now accept "" as result name; in that case the
9588 theorem is not stored, but proper checks and presentation of the
9591 * theorem database now also indexes constants "Trueprop", "all",
9592 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9597 ** HOL arithmetic **
9599 * There are now decision procedures for linear arithmetic over nat and
9602 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9603 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9604 are treated as atomic; subformulae not involving type `nat' or `int'
9605 are ignored; quantified subformulae are ignored unless they are
9606 positive universal or negative existential. The tactic has to be
9607 invoked by hand and can be a little bit slow. In particular, the
9608 running time is exponential in the number of occurrences of `min' and
9609 `max', and `-' on `nat'.
9611 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9612 (negated) (in)equalities among the premises and the conclusion into
9613 account (i.e. no compound formulae) and does not know about `min' and
9614 `max', and `-' on `nat'. It is fast and is used automatically by the
9617 NB: At the moment, these decision procedures do not cope with mixed
9618 nat/int formulae where the two parts interact, such as `m < n ==>
9621 * HOL/Numeral provides a generic theory of numerals (encoded
9622 efficiently as bit strings); setup for types nat/int/real is in place;
9623 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9624 int, existing theories and proof scripts may require a few additional
9627 * integer division and remainder can now be performed on constant
9630 * many properties of integer multiplication, division and remainder
9633 * An interface to the Stanford Validity Checker (SVC) is available through the
9634 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9635 are proved automatically. SVC must be installed separately, and its results
9636 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9637 invocation of the underlying oracle). For SVC see
9638 http://verify.stanford.edu/SVC
9640 * IsaMakefile: the HOL-Real target now builds an actual image;
9645 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9646 (in Isabelle/Isar) -- by Gertrud Bauer;
9648 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9649 analysis for assembly languages with subtypes;
9651 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9652 -- avoids syntactic ambiguities and treats state, transition, and
9653 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9654 changed syntax and (many) tactics;
9656 * HOL/inductive: Now also handles more general introduction rules such
9657 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9658 theorems are now maintained within the theory (maintained via the
9661 * HOL/datatype: Now also handles arbitrarily branching datatypes
9662 (using function types) such as
9664 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9666 * HOL/record: record_simproc (part of the default simpset) takes care
9667 of selectors applied to updated records; record_split_tac is no longer
9668 part of the default claset; update_defs may now be removed from the
9669 simpset in many cases; COMPATIBILITY: old behavior achieved by
9671 claset_ref () := claset() addSWrapper record_split_wrapper;
9672 Delsimprocs [record_simproc]
9674 * HOL/typedef: fixed type inference for representing set; type
9675 arguments now have to occur explicitly on the rhs as type constraints;
9677 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9678 names rather than an ML expression;
9680 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9681 supplied later. Program schemes can be defined, such as
9682 "While B C s = (if B s then While B C (C s) else s)"
9683 where the well-founded relation can be chosen after B and C have been given.
9685 * HOL/List: the constructors of type list are now Nil and Cons;
9686 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9687 course, ML tools referring to List.list.op # etc. have to be adapted;
9689 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9690 disabled by default; run isabelle with option -m HOL to get back to
9691 the original Gordon/HOL-style output;
9693 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9694 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9696 * HOL basic syntax simplified (more orthogonal): all variants of
9697 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9698 Eps operator is provided as well: "SOME x. P[x]";
9700 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9702 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9703 thus available for user theories;
9705 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9706 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9709 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9710 several times and then mp;
9715 * the notation <<...>> is now available as a notation for sequences of
9718 * the simplifier is now installed
9720 * the axiom system has been generalized (thanks to Soren Heilmann)
9722 * the classical reasoner now has a default rule database
9727 * new primrec section allows primitive recursive functions to be given
9728 directly (as in HOL) over datatypes and the natural numbers;
9730 * new tactics induct_tac and exhaust_tac for induction (or case
9731 analysis) over datatypes and the natural numbers;
9733 * the datatype declaration of type T now defines the recursor T_rec;
9735 * simplification automatically does freeness reasoning for datatype
9738 * automatic type-inference, with AddTCs command to insert new
9739 type-checking rules;
9741 * datatype introduction rules are now added as Safe Introduction rules
9744 * the syntax "if P then x else y" is now available in addition to
9748 *** Internal programming interfaces ***
9750 * tuned simplifier trace output; new flag debug_simp;
9752 * structures Vartab / Termtab (instances of TableFun) offer efficient
9753 tables indexed by indexname_ord / term_ord (compatible with aconv);
9755 * AxClass.axclass_tac lost the theory argument;
9757 * tuned current_goals_markers semantics: begin / end goal avoids
9758 printing empty lines;
9760 * removed prs and prs_fn hook, which was broken because it did not
9761 include \n in its semantics, forcing writeln to add one
9762 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9763 string -> unit if you really want to output text without newline;
9765 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9766 plain output, interface builders may have to enable 'isabelle_font'
9767 mode to get Isabelle font glyphs as before;
9769 * refined token_translation interface; INCOMPATIBILITY: output length
9770 now of type real instead of int;
9772 * theory loader actions may be traced via new ThyInfo.add_hook
9773 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9774 your own database of information attached to *whole* theories -- as
9775 opposed to intra-theory data slots offered via TheoryDataFun;
9777 * proper handling of dangling sort hypotheses (at last!);
9778 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9779 extra sort hypotheses that can be witnessed from the type signature;
9780 the force_strip_shyps flag is gone, any remaining shyps are simply
9781 left in the theorem (with a warning issued by strip_shyps_warning);
9785 New in Isabelle98-1 (October 1998)
9786 ----------------------------------
9788 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9790 * several changes of automated proof tools;
9792 * HOL: major changes to the inductive and datatype packages, including
9793 some minor incompatibilities of theory syntax;
9795 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9798 * HOL: removed duplicate thms in Arith:
9799 less_imp_add_less should be replaced by trans_less_add1
9800 le_imp_add_le should be replaced by trans_le_add1
9802 * HOL: unary minus is now overloaded (new type constraints may be
9805 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9806 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9807 now taken as an integer constant.
9809 * Pure: ML function 'theory_of' renamed to 'theory';
9815 1. Asm_full_simp_tac is now more aggressive.
9816 1. It will sometimes reorient premises if that increases their power to
9818 2. It does no longer proceed strictly from left to right but may also
9819 rotate premises to achieve further simplification.
9820 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9821 old Asm_full_simp_tac in that it does not rotate premises.
9822 2. The simplifier now knows a little bit about nat-arithmetic.
9824 * Classical reasoner: wrapper mechanism for the classical reasoner now
9825 allows for selected deletion of wrappers, by introduction of names for
9826 wrapper functionals. This implies that addbefore, addSbefore,
9827 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9828 and that adding two tactics with the same name overwrites the first
9829 one (emitting a warning).
9830 type wrapper = (int -> tactic) -> (int -> tactic)
9831 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9832 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9833 delWrapper, delSWrapper: claset * string -> claset
9834 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9836 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9837 semantics; addbefore now affects only the unsafe part of step_tac
9838 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9839 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9842 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9843 compWrapper; added safe wrapper (and access functions for it);
9845 * HOL/split_all_tac is now much faster and fails if there is nothing
9846 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9847 and the names of the automatically generated variables have changed.
9848 split_all_tac has moved within claset() from unsafe wrappers to safe
9849 wrappers, which means that !!-bound variables are split much more
9850 aggressively, and safe_tac and clarify_tac now split such variables.
9851 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9852 Note: the same holds for record_split_tac, which does the job of
9853 split_all_tac for record fields.
9855 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9856 permanently to the default simpset using Addsplits just like
9857 Addsimps. They can be removed via Delsplits just like
9858 Delsimps. Lower-case versions are also available.
9860 * HOL/Simplifier: The rule split_if is now part of the default
9861 simpset. This means that the simplifier will eliminate all occurrences
9862 of if-then-else in the conclusion of a goal. To prevent this, you can
9863 either remove split_if completely from the default simpset by
9864 `Delsplits [split_if]' or remove it in a specific call of the
9865 simplifier using `... delsplits [split_if]'. You can also add/delete
9866 other case splitting rules to/from the default simpset: every datatype
9867 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9868 t is the name of the datatype).
9870 * Classical reasoner / Simplifier combination: new force_tac (and
9871 derivatives Force_tac, force) combines rewriting and classical
9872 reasoning (and whatever other tools) similarly to auto_tac, but is
9873 aimed to solve the given subgoal completely.
9878 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9879 and `goalw': the theory is no longer needed as an explicit argument -
9880 the current theory context is used; assumptions are no longer returned
9881 at the ML-level unless one of them starts with ==> or !!; it is
9882 recommended to convert to these new commands using isatool fixgoal
9883 (backup your sources first!);
9885 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9886 the current theory context, and 'theory' to lookup stored theories;
9888 * new theory section 'locale' for declaring constants, assumptions and
9889 definitions that have local scope;
9891 * new theory section 'nonterminals' for purely syntactic types;
9893 * new theory section 'setup' for generic ML setup functions
9894 (e.g. package initialization);
9896 * the distribution now includes Isabelle icons: see
9897 lib/logo/isabelle-{small,tiny}.xpm;
9899 * isatool install - install binaries with absolute references to
9902 * isatool logo -- create instances of the Isabelle logo (as EPS);
9904 * print mode 'emacs' reserved for Isamode;
9906 * support multiple print (ast) translations per constant name;
9908 * theorems involving oracles are now printed with a suffixed [!];
9913 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9915 * HOL/inductive package reorganized and improved: now supports mutual
9921 oddI "n : EVEN ==> Suc n : ODD"
9922 evenI "n : ODD ==> Suc n : EVEN"
9924 new theorem list "elims" contains an elimination rule for each of the
9925 recursive sets; inductive definitions now handle disjunctive premises
9926 correctly (also ZF);
9928 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9929 "mutual_induct" no longer exists - the induction rule is always
9930 contained in "induct";
9933 * HOL/datatype package re-implemented and greatly improved: now
9934 supports mutually recursive datatypes such as
9937 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9938 | SUM ('a aexp) ('a aexp)
9939 | DIFF ('a aexp) ('a aexp)
9942 'a bexp = LESS ('a aexp) ('a aexp)
9943 | AND ('a bexp) ('a bexp)
9944 | OR ('a bexp) ('a bexp)
9946 as well as indirectly recursive datatypes such as
9949 ('a, 'b) term = Var 'a
9950 | App 'b ((('a, 'b) term) list)
9952 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9953 induction on mutually / indirectly recursive datatypes.
9955 Primrec equations are now stored in theory and can be accessed via
9956 <function_name>.simps.
9960 - Theories using datatypes must now have theory Datatype as an
9962 - The specific <typename>.induct_tac no longer exists - use the
9963 generic induct_tac instead.
9964 - natE has been renamed to nat.exhaust - use exhaust_tac
9965 instead of res_inst_tac ... natE. Note that the variable
9966 names in nat.exhaust differ from the names in natE, this
9967 may cause some "fragile" proofs to fail.
9968 - The theorems split_<typename>_case and split_<typename>_case_asm
9969 have been renamed to <typename>.split and <typename>.split_asm.
9970 - Since default sorts of type variables are now handled correctly,
9971 some datatype definitions may have to be annotated with explicit
9973 - Primrec definitions no longer require function name and type
9974 of recursive argument.
9976 Consider using isatool fixdatatype to adapt your theories and proof
9977 scripts to the new package (backup your sources first!).
9980 * HOL/record package: considerably improved implementation; now
9981 includes concrete syntax for record types, terms, updates; theorems
9982 for surjective pairing and splitting !!-bound record variables; proof
9983 support is as follows:
9985 1) standard conversions (selectors or updates applied to record
9986 constructor terms) are part of the standard simpset;
9988 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9989 made part of standard simpset and claset via addIffs;
9991 3) a tactic for record field splitting (record_split_tac) is part of
9992 the standard claset (addSWrapper);
9994 To get a better idea about these rules you may retrieve them via
9995 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9996 the name of your record type.
9998 The split tactic 3) conceptually simplifies by the following rule:
10000 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10002 Thus any record variable that is bound by meta-all will automatically
10003 blow up into some record constructor term, consequently the
10004 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10005 solve record problems automatically.
10008 * reorganized the main HOL image: HOL/Integ and String loaded by
10009 default; theory Main includes everything;
10011 * automatic simplification of integer sums and comparisons, using cancellation;
10013 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10015 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10017 * many new identities for unions, intersections, set difference, etc.;
10019 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10020 called split_if, split_split, split_sum_case and split_nat_case (to go
10021 with add/delsplits);
10023 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10024 (?x::unit) = (); this is made part of the default simpset, which COULD
10025 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10026 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10027 unit_abs_eta_conv is added in order to counter the effect of
10028 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10031 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10034 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10035 It and 'sym RS equals0D' are now in the default claset, giving automatic
10036 disjointness reasoning but breaking a few old proofs.
10038 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10039 to 'converse' from 'inverse' (for compatibility with ZF and some
10042 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10043 the well-founded relation;
10045 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10046 Compl A. The "Compl" syntax remains available as input syntax for this
10049 * HOL/Update: new theory of function updates:
10050 f(a:=b) == %x. if x=a then b else f x
10051 may also be iterated as in f(a:=b,c:=d,...);
10053 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10056 - new function list_update written xs[i:=v] that updates the i-th
10057 list position. May also be iterated as in xs[i:=a,j:=b,...].
10058 - new function `upt' written [i..j(] which generates the list
10059 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10060 bound write [i..j], which is a shorthand for [i..j+1(].
10061 - new lexicographic orderings and corresponding wellfoundedness theorems.
10064 - removed 'pred' (predecessor) function;
10065 - generalized some theorems about n-1;
10066 - many new laws about "div" and "mod";
10067 - new laws about greatest common divisors (see theory ex/Primes);
10069 * HOL/Relation: renamed the relational operator r^-1 "converse"
10070 instead of "inverse";
10072 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10073 of the multiset ordering;
10075 * directory HOL/Real: a construction of the reals using Dedekind cuts
10076 (not included by default);
10078 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10080 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10081 programs, i.e. different program variables may have different types.
10083 * calling (stac rew i) now fails if "rew" has no effect on the goal
10084 [previously, this check worked only if the rewrite rule was unconditional]
10085 Now rew can involve either definitions or equalities (either == or =).
10090 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10091 only the theorems proved on ZF.ML;
10093 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10094 It and 'sym RS equals0D' are now in the default claset, giving automatic
10095 disjointness reasoning but breaking a few old proofs.
10097 * ZF/Update: new theory of function updates
10098 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10099 may also be iterated as in f(a:=b,c:=d,...);
10101 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10103 * calling (stac rew i) now fails if "rew" has no effect on the goal
10104 [previously, this check worked only if the rewrite rule was unconditional]
10105 Now rew can involve either definitions or equalities (either == or =).
10107 * case_tac provided for compatibility with HOL
10108 (like the old excluded_middle_tac, but with subgoals swapped)
10111 *** Internal programming interfaces ***
10113 * Pure: several new basic modules made available for general use, see
10114 also src/Pure/README;
10116 * improved the theory data mechanism to support encapsulation (data
10117 kind name replaced by private Object.kind, acting as authorization
10118 key); new type-safe user interface via functor TheoryDataFun; generic
10119 print_data function becomes basically useless;
10121 * removed global_names compatibility flag -- all theory declarations
10122 are qualified by default;
10124 * module Pure/Syntax now offers quote / antiquote translation
10125 functions (useful for Hoare logic etc. with implicit dependencies);
10126 see HOL/ex/Antiquote for an example use;
10128 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10131 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10134 * Display.print_goals function moved to Locale.print_goals;
10136 * standard print function for goals supports current_goals_markers
10137 variable for marking begin of proof, end of proof, start of goal; the
10138 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10139 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10144 New in Isabelle98 (January 1998)
10145 --------------------------------
10147 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10149 * changed lexical syntax of terms / types: dots made part of long
10150 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10152 * simpset (and claset) reference variable replaced by functions
10153 simpset / simpset_ref;
10155 * no longer supports theory aliases (via merge) and non-trivial
10156 implicit merge of thms' signatures;
10158 * most internal names of constants changed due to qualified names;
10160 * changed Pure/Sequence interface (see Pure/seq.ML);
10163 *** General Changes ***
10165 * hierachically structured name spaces (for consts, types, axms, thms
10166 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10167 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10168 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10169 long_names for fully qualified output names; NOTE: ML programs
10170 (special tactics, packages etc.) referring to internal names may have
10171 to be adapted to cope with fully qualified names; in case of severe
10172 backward campatibility problems try setting 'global_names' at compile
10173 time to have enrything declared within a flat name space; one may also
10174 fine tune name declarations in theories via the 'global' and 'local'
10177 * reimplemented the implicit simpset and claset using the new anytype
10178 data filed in signatures; references simpset:simpset ref etc. are
10179 replaced by functions simpset:unit->simpset and
10180 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10181 to patch your ML files accordingly;
10183 * HTML output now includes theory graph data for display with Java
10184 applet or isatool browser; data generated automatically via isatool
10185 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10187 * defs may now be conditional; improved rewrite_goals_tac to handle
10188 conditional equations;
10190 * defs now admits additional type arguments, using TYPE('a) syntax;
10192 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10193 creates a new theory node; implicit merge of thms' signatures is
10194 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10195 transfer:theory->thm->thm in (rare) cases;
10197 * improved handling of draft signatures / theories; draft thms (and
10198 ctyps, cterms) are automatically promoted to real ones;
10200 * slightly changed interfaces for oracles: admit many per theory, named
10201 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10203 * print_goals: optional output of const types (set show_consts and
10206 * improved output of warnings (###) and errors (***);
10208 * subgoal_tac displays a warning if the new subgoal has type variables;
10210 * removed old README and Makefiles;
10212 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10214 * removed obsolete init_pps and init_database;
10216 * deleted the obsolete tactical STATE, which was declared by
10217 fun STATE tacfun st = tacfun st st;
10219 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10220 (which abbreviates $HOME);
10222 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10223 use isatool fixseq to adapt your ML programs (this works for fully
10224 qualified references to the Sequence structure only!);
10226 * use_thy no longer requires writable current directory; it always
10227 reloads .ML *and* .thy file, if either one is out of date;
10230 *** Classical Reasoner ***
10232 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10233 tactics that use classical reasoning to simplify a subgoal without
10234 splitting it into several subgoals;
10236 * Safe_tac: like safe_tac but uses the default claset;
10241 * added simplification meta rules:
10242 (asm_)(full_)simplify: simpset -> thm -> thm;
10244 * simplifier.ML no longer part of Pure -- has to be loaded by object
10247 * added prems argument to simplification procedures;
10249 * HOL, FOL, ZF: added infix function `addsplits':
10250 instead of `<simpset> setloop (split_tac <thms>)'
10251 you can simply write `<simpset> addsplits <thms>'
10256 * TYPE('a) syntax for type reflection terms;
10258 * no longer handles consts with name "" -- declare as 'syntax' instead;
10260 * pretty printer: changed order of mixfix annotation preference (again!);
10262 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10267 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10268 with `addloop' of the simplifier to faciliate case splitting in premises.
10270 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10272 * HOL/Auth: new protocol proofs including some for the Internet
10275 * HOL/Map: new theory of `maps' a la VDM;
10277 * HOL/simplifier: simplification procedures nat_cancel_sums for
10278 cancelling out common nat summands from =, <, <= (in)equalities, or
10279 differences; simplification procedures nat_cancel_factor for
10280 cancelling common factor from =, <, <= (in)equalities over natural
10281 sums; nat_cancel contains both kinds of procedures, it is installed by
10282 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10284 * HOL/simplifier: terms of the form
10285 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10287 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10288 and those of the form
10289 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10291 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10294 Each datatype `t' now comes with a theorem `split_t_case' of the form
10296 P(t_case f1 ... fn x) =
10297 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10299 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10302 and a theorem `split_t_case_asm' of the form
10304 P(t_case f1 ... fn x) =
10305 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10307 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10309 which can be added to a simpset via `addsplits'. The existing theorems
10310 expand_list_case and expand_option_case have been renamed to
10311 split_list_case and split_option_case.
10314 - `pred n' is automatically converted to `n-1'.
10315 Users are strongly encouraged not to use `pred' any longer,
10316 because it will disappear altogether at some point.
10317 - Users are strongly encouraged to write "0 < n" rather than
10318 "n ~= 0". Theorems and proof tools have been modified towards this
10322 the function "set_of_list" has been renamed "set" (and its theorems too);
10323 the function "nth" now takes its arguments in the reverse order and
10324 has acquired the infix notation "!" as in "xs!n".
10326 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10328 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10329 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10331 * HOL/record: extensible records with schematic structural subtyping
10332 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10333 still lacks various theorems and concrete record syntax;
10338 * removed "axioms" and "generated by" sections;
10340 * replaced "ops" section by extended "consts" section, which is capable of
10341 handling the continuous function space "->" directly;
10344 . proves theorems immediately and stores them in the theory,
10345 . creates hierachical name space,
10346 . now uses normal mixfix annotations (instead of cinfix...),
10347 . minor changes to some names and values (for consistency),
10348 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10349 . separator between mutual domain defs: changed "," to "and",
10350 . improved handling of sort constraints; now they have to
10351 appear on the left-hand side of the equations only;
10353 * fixed LAM <x,y,zs>.b syntax;
10355 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10356 adm (%x. P (t x)), where P is chainfinite and t continuous;
10361 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10362 with `addloop' of the simplifier to faciliate case splitting in premises.
10364 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10365 in HOL, they strip ALL and --> from proved theorems;
10369 New in Isabelle94-8 (May 1997)
10370 ------------------------------
10372 *** General Changes ***
10374 * new utilities to build / run / maintain Isabelle etc. (in parts
10375 still somewhat experimental); old Makefiles etc. still functional;
10377 * new 'Isabelle System Manual';
10379 * INSTALL text, together with ./configure and ./build scripts;
10381 * reimplemented type inference for greater efficiency, better error
10382 messages and clean internal interface;
10384 * prlim command for dealing with lots of subgoals (an easier way of
10385 setting goals_limit);
10390 * supports alternative (named) syntax tables (parser and pretty
10391 printer); internal interface is provided by add_modesyntax(_i);
10393 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10394 be used in conjunction with the Isabelle symbol font; uses the
10395 "symbols" syntax table;
10397 * added token_translation interface (may translate name tokens in
10398 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10399 the current print_mode); IMPORTANT: user print translation functions
10400 are responsible for marking newly introduced bounds
10401 (Syntax.mark_boundT);
10403 * token translations for modes "xterm" and "xterm_color" that display
10404 names in bold, underline etc. or colors (which requires a color
10407 * infixes may now be declared with names independent of their syntax;
10409 * added typed_print_translation (like print_translation, but may
10410 access type of constant);
10413 *** Classical Reasoner ***
10415 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10416 some limitations. Blast_tac...
10417 + ignores addss, addbefore, addafter; this restriction is intrinsic
10418 + ignores elimination rules that don't have the correct format
10419 (the conclusion MUST be a formula variable)
10420 + ignores types, which can make HOL proofs fail
10421 + rules must not require higher-order unification, e.g. apply_type in ZF
10422 [message "Function Var's argument not a bound variable" relates to this]
10423 + its proof strategy is more general but can actually be slower
10425 * substitution with equality assumptions no longer permutes other
10428 * minor changes in semantics of addafter (now called addaltern); renamed
10429 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10430 (and access functions for it);
10432 * improved combination of classical reasoner and simplifier:
10433 + functions for handling clasimpsets
10434 + improvement of addss: now the simplifier is called _after_ the
10436 + safe variant of addss called addSss: uses safe simplifications
10437 _during_ the safe steps. It is more complete as it allows multiple
10438 instantiations of unknowns (e.g. with slow_tac).
10442 * added interface for simplification procedures (functions that
10443 produce *proven* rewrite rules on the fly, depending on current
10446 * ordering on terms as parameter (used for ordered rewriting);
10448 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10450 * the solver is now split into a safe and an unsafe part.
10451 This should be invisible for the normal user, except that the
10452 functions setsolver and addsolver have been renamed to setSolver and
10453 addSolver; added safe_asm_full_simp_tac;
10458 * a generic induction tactic `induct_tac' which works for all datatypes and
10459 also for type `nat';
10461 * a generic case distinction tactic `exhaust_tac' which works for all
10462 datatypes and also for type `nat';
10464 * each datatype comes with a function `size';
10466 * patterns in case expressions allow tuple patterns as arguments to
10467 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10469 * primrec now also works with type nat;
10471 * recdef: a new declaration form, allows general recursive functions to be
10472 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10474 * the constant for negation has been renamed from "not" to "Not" to
10475 harmonize with FOL, ZF, LK, etc.;
10477 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10480 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10482 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10483 problems in commutative rings, using axiomatic type classes for + and *;
10485 * more examples in HOL/MiniML and HOL/Auth;
10487 * more default rewrite rules for quantifiers, union/intersection;
10489 * a new constant `arbitrary == @x.False';
10491 * HOLCF/IOA replaces old HOL/IOA;
10493 * HOLCF changes: derived all rules and arities
10494 + axiomatic type classes instead of classes
10495 + typedef instead of faking type definitions
10496 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10497 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10498 + eliminated the types void, one, tr
10499 + use unit lift and bool lift (with translations) instead of one and tr
10500 + eliminated blift from Lift3.thy (use Def instead of blift)
10501 all eliminated rules are derived as theorems --> no visible changes ;
10506 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10507 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10508 as ZF_cs addSIs [equalityI];
10512 New in Isabelle94-7 (November 96)
10513 ---------------------------------
10515 * allowing negative levels (as offsets) in prlev and choplev;
10517 * super-linear speedup for large simplifications;
10519 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10520 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10521 FAIL); can suppress it using the command Delsimps (ex_simps @
10522 all_simps); De Morgan laws are also now included, by default;
10524 * improved printing of ==> : ~:
10526 * new object-logic "Sequents" adds linear logic, while replacing LK
10527 and Modal (thanks to Sara Kalvala);
10529 * HOL/Auth: correctness proofs for authentication protocols;
10531 * HOL: new auto_tac combines rewriting and classical reasoning (many
10532 examples on HOL/Auth);
10534 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10535 the rewriter and classical reasoner simultaneously;
10537 * function uresult no longer returns theorems in "standard" format;
10538 regain previous version by: val uresult = standard o uresult;
10542 New in Isabelle94-6
10543 -------------------
10545 * oracles -- these establish an interface between Isabelle and trusted
10546 external reasoners, which may deliver results as theorems;
10548 * proof objects (in particular record all uses of oracles);
10550 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10552 * "constdefs" section in theory files;
10554 * "primrec" section (HOL) no longer requires names;
10556 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10560 New in Isabelle94-5
10561 -------------------
10563 * reduced space requirements;
10565 * automatic HTML generation from theories;
10567 * theory files no longer require "..." (quotes) around most types;
10569 * new examples, including two proofs of the Church-Rosser theorem;
10571 * non-curried (1994) version of HOL is no longer distributed;
10575 New in Isabelle94-4
10576 -------------------
10578 * greatly reduced space requirements;
10580 * theory files (.thy) no longer require \...\ escapes at line breaks;
10582 * searchable theorem database (see the section "Retrieving theorems" on
10583 page 8 of the Reference Manual);
10585 * new examples, including Grabczewski's monumental case study of the
10588 * The previous version of HOL renamed to Old_HOL;
10590 * The new version of HOL (previously called CHOL) uses a curried syntax
10591 for functions. Application looks like f a b instead of f(a,b);
10593 * Mutually recursive inductive definitions finally work in HOL;
10595 * In ZF, pattern-matching on tuples is now available in all abstractions and
10596 translates to the operator "split";
10600 New in Isabelle94-3
10601 -------------------
10603 * new infix operator, addss, allowing the classical reasoner to
10604 perform simplification at each step of its search. Example:
10605 fast_tac (cs addss ss)
10607 * a new logic, CHOL, the same as HOL, but with a curried syntax
10608 for functions. Application looks like f a b instead of f(a,b). Also pairs
10609 look like (a,b) instead of <a,b>;
10611 * PLEASE NOTE: CHOL will eventually replace HOL!
10613 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10614 It translates to the operator "split". A new theory of integers is available;
10616 * In ZF, integer numerals now denote two's-complement binary integers.
10617 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10619 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10620 of the Axiom of Choice;
10624 New in Isabelle94-2
10625 -------------------
10627 * Significantly faster resolution;
10629 * the different sections in a .thy file can now be mixed and repeated
10632 * Database of theorems for FOL, HOL and ZF. New
10633 commands including qed, qed_goal and bind_thm store theorems in the database.
10635 * Simple database queries: return a named theorem (get_thm) or all theorems of
10636 a given theory (thms_of), or find out what theory a theorem was proved in
10639 * Bugs fixed in the inductive definition and datatype packages;
10641 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10642 and HOL_dup_cs obsolete;
10644 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10647 * Simpler definition of function space in ZF;
10649 * new results about cardinal and ordinal arithmetic in ZF;
10651 * 'subtype' facility in HOL for introducing new types as subsets of existing
10654 :mode=isabelle-news:wrap=hard:maxLineLen=72: