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 include TAB, ESCAPE, UP,
104 DOWN, PAGE_UP, PAGE_DOWN. All other key events are passed to
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 * Function package: For mutually recursive functions f and g, separate
197 cases rules f.cases and g.cases are generated instead of unusable
198 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
199 in the case that the unusable rule was used nevertheless.
201 * Function package: For each function f, new rules f.elims are
202 automatically generated, which eliminate equalities of the form "f x =
205 * New command "fun_cases" derives ad-hoc elimination rules for
206 function equations as simplified instances of f.elims, analogous to
207 inductive_cases. See HOL/ex/Fundefs.thy for some examples.
209 * Library/Polynomial.thy:
210 - Use lifting for primitive definitions.
211 - Explicit conversions from and to lists of coefficients, used for
213 - Replaced recursion operator poly_rec by fold_coeffs.
214 - Prefer pre-existing gcd operation for gcd.
216 poly_eq_iff ~> poly_eq_poly_eq_iff
218 expand_poly_eq ~> poly_eq_iff
221 * Reification and reflection:
222 - Reification is now directly available in HOL-Main in structure
224 - Reflection now handles multiple lists with variables also.
225 - The whole reflection stack has been decomposed into conversions.
228 * Weaker precendence of syntax for big intersection and union on sets,
229 in accordance with corresponding lattice operations. INCOMPATIBILITY.
231 * Nested case expressions are now translated in a separate check phase
232 rather than during parsing. The data for case combinators is separated
233 from the datatype package. The declaration attribute
234 "case_translation" can be used to register new case combinators:
236 declare [[case_translation case_combinator constructor1 ... constructorN]]
238 * Notation "{p:A. P}" now allows tuple patterns as well.
240 * Revised devices for recursive definitions over finite sets:
241 - Only one fundamental fold combinator on finite set remains:
242 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
243 This is now identity on infinite sets.
244 - Locales ("mini packages") for fundamental definitions with
245 Finite_Set.fold: folding, folding_idem.
246 - Locales comm_monoid_set, semilattice_order_set and
247 semilattice_neutr_order_set for big operators on sets.
248 See theory Big_Operators for canonical examples.
249 Note that foundational constants comm_monoid_set.F and
250 semilattice_set.F correspond to former combinators fold_image
251 and fold1 respectively. These are now gone. You may use
252 those foundational constants as substitutes, but it is
253 preferable to interpret the above locales accordingly.
254 - Dropped class ab_semigroup_idem_mult (special case of lattice,
255 no longer needed in connection with Finite_Set.fold etc.)
257 card.union_inter ~> card_Un_Int [symmetric]
258 card.union_disjoint ~> card_Un_disjoint
261 * Locale hierarchy for abstract orderings and (semi)lattices.
263 * Discontinued theory src/HOL/Library/Eval_Witness.
266 * Discontinued obsolete src/HOL/IsaMakefile (considered legacy since
267 Isabelle2013). Use "isabelle build" to operate on Isabelle sessions.
269 * Numeric types mapped by default to target language numerals: natural
270 (replaces former code_numeral) and integer (replaces former code_int).
271 Conversions are available as integer_of_natural / natural_of_integer /
272 integer_of_nat / nat_of_integer (in HOL) and
273 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
274 ML). INCOMPATIBILITY.
276 * Discontinued theories Code_Integer and Efficient_Nat by a more
277 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
278 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
279 generation for details. INCOMPATIBILITY.
281 * Complete_Partial_Order.admissible is defined outside the type
282 class ccpo, but with mandatory prefix ccpo. Admissibility theorems
283 lose the class predicate assumption or sort constraint when possible.
286 * Introduce type class "conditionally_complete_lattice": Like a
287 complete lattice but does not assume the existence of the top and
288 bottom elements. Allows to generalize some lemmas about reals and
289 extended reals. Removed SupInf and replaced it by the instantiation
290 of conditionally_complete_lattice for real. Renamed lemmas about
291 conditionally-complete lattice from Sup_... to cSup_... and from
292 Inf_... to cInf_... to avoid hidding of similar complete lattice
295 * Introduce type class linear_continuum as combination of
296 conditionally-complete lattices and inner dense linorders which have
297 more than one element. INCOMPATIBILITY.
299 * Introduce type classes "no_top" and "no_bot" for orderings without
300 top and bottom elements.
302 * Split dense_linorder into inner_dense_order and no_top, no_bot.
304 * Complex_Main: Unify and move various concepts from
305 HOL-Multivariate_Analysis to HOL-Complex_Main.
307 - Introduce type class (lin)order_topology and linear_continuum_topology.
308 Allows to generalize theorems about limits and order.
309 Instances are reals and extended reals.
311 - continuous and continuos_on from Multivariate_Analysis:
312 "continuous" is the continuity of a function at a filter.
313 "isCont" is now an abbrevitation: "isCont x f == continuous (at _) f".
315 Generalized continuity lemmas from isCont to continuous on an arbitrary
318 - compact from Multivariate_Analysis. Use Bolzano's lemma
319 to prove compactness of closed intervals on reals. Continuous functions
320 attain infimum and supremum on compact sets. The inverse of a continuous
321 function is continuous, when the function is continuous on a compact set.
323 - connected from Multivariate_Analysis. Use it to prove the
324 intermediate value theorem. Show connectedness of intervals on
325 linear_continuum_topology).
327 - first_countable_topology from Multivariate_Analysis. Is used to
328 show equivalence of properties on the neighbourhood filter of x and on
329 all sequences converging to x.
331 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved theorems
332 from Library/FDERIV.thy to Deriv.thy and base the definition of DERIV on
333 FDERIV. Add variants of DERIV and FDERIV which are restricted to sets,
334 i.e. to represent derivatives from left or right.
336 - Removed the within-filter. It is replaced by the principal filter:
338 F within X = inf F (principal X)
340 - Introduce "at x within U" as a single constant, "at x" is now an
341 abbreviation for "at x within UNIV"
343 - Introduce named theorem collections tendsto_intros, continuous_intros,
344 continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or
345 FDERIV_intros) are also available as tendsto_eq_intros (or
346 FDERIV_eq_intros) where the right-hand side is replaced by a congruence
347 rule. This allows to apply them as intro rules and then proving
348 equivalence by the simplifier.
350 - Restructured theories in HOL-Complex_Main:
352 + Moved RealDef and RComplete into Real
354 + Introduced Topological_Spaces and moved theorems about
355 topological spaces, filters, limits and continuity to it
357 + Renamed RealVector to Real_Vector_Spaces
359 + Split Lim, SEQ, Series into Topological_Spaces, Real_Vector_Spaces, and
362 + Moved Ln and Log to Transcendental
364 + Moved theorems about continuity from Deriv to Topological_Spaces
366 - Remove various auxiliary lemmas.
370 * Consolidation of library theories on product orders:
372 Product_Lattice ~> Product_Order -- pointwise order on products
373 Product_ord ~> Product_Lexorder -- lexicographic order on products
380 isar_shrink ~> isar_compress
382 * Imperative-HOL: The MREC combinator is considered legacy and no
383 longer included by default. INCOMPATIBILITY, use partial_function
384 instead, or import theory Legacy_Mrec as a fallback.
386 * HOL-Algebra: Discontinued theories src/HOL/Algebra/abstract and
387 .../poly. Existing theories should be based on
388 src/HOL/Library/Polynomial instead. The latter provides integration
389 with HOL's type classes for rings. INCOMPATIBILITY.
394 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
395 "check_property" allows to check specifications of the form "ALL x y
396 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
397 Examples.thy in particular.
399 * More uniform naming of goal functions for skipped proofs:
401 Skip_Proof.prove ~> Goal.prove_sorry
402 Skip_Proof.prove_global ~> Goal.prove_sorry_global
404 * Antiquotation @{theory_context A} is similar to @{theory A}, but
405 presents the result as initial Proof.context.
407 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
408 operate on Proof.context instead of claset, for uniformity with addIs,
409 addEs, addDs etc. Note that claset_of and put_claset allow to manage
410 clasets separately from the context.
412 * Simplifier tactics and tools use proper Proof.context instead of
413 historic type simpset. Old-style declarations like addsimps,
414 addsimprocs etc. operate directly on Proof.context. Raw type simpset
415 retains its use as snapshot of the main Simplifier context, using
416 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
417 old tools by making them depend on (ctxt : Proof.context) instead of
418 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
420 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
421 INCOMPATIBILITY, use @{context} instead.
426 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
427 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
429 * Discontinued obsolete isabelle-process options -f and -u (former
430 administrative aliases of option -e). Minor INCOMPATIBILITY.
432 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
435 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
436 document formats: dvi.gz, ps, ps.gz -- the default document format is
439 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
440 specify global resources of the JVM process run by isabelle build.
442 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
443 to run Isabelle/Scala source files as standalone programs.
445 * Improved "isabelle keywords" tool (for old-style ProofGeneral
446 keyword tables): use Isabelle/Scala operations, which inspect outer
447 syntax without requiring to build sessions first.
451 New in Isabelle2013 (February 2013)
452 -----------------------------------
456 * Theorem status about oracles and unfinished/failed future proofs is
457 no longer printed by default, since it is incompatible with
458 incremental / parallel checking of the persistent document model. ML
459 function Thm.peek_status may be used to inspect a snapshot of the
460 ongoing evaluation process. Note that in batch mode --- notably
461 isabelle build --- the system ensures that future proofs of all
462 accessible theorems in the theory context are finished (as before).
464 * Configuration option show_markup controls direct inlining of markup
465 into the printed representation of formal entities --- notably type
466 and sort constraints. This enables Prover IDE users to retrieve that
467 information via tooltips in the output window, for example.
469 * Command 'ML_file' evaluates ML text from a file directly within the
470 theory, without any predeclaration via 'uses' in the theory header.
472 * Old command 'use' command and corresponding keyword 'uses' in the
473 theory header are legacy features and will be discontinued soon.
474 Tools that load their additional source files may imitate the
475 'ML_file' implementation, such that the system can take care of
476 dependencies properly.
478 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
479 is called fastforce / fast_force_tac already since Isabelle2011-1.
481 * Updated and extended "isar-ref" and "implementation" manual, reduced
482 remaining material in old "ref" manual.
484 * Improved support for auxiliary contexts that indicate block structure
485 for specifications. Nesting of "context fixes ... context assumes ..."
486 and "class ... context ...".
488 * Attribute "consumes" allows a negative value as well, which is
489 interpreted relatively to the total number of premises of the rule in
490 the target context. This form of declaration is stable when exported
491 from a nested 'context' with additional assumptions. It is the
492 preferred form for definitional packages, notably cases/rules produced
493 in HOL/inductive and HOL/function.
495 * More informative error messages for Isar proof commands involving
496 lazy enumerations (method applications etc.).
498 * Refined 'help' command to retrieve outer syntax commands according
499 to name patterns (with clickable results).
502 *** Prover IDE -- Isabelle/Scala/jEdit ***
504 * Parallel terminal proofs ('by') are enabled by default, likewise
505 proofs that are built into packages like 'datatype', 'function'. This
506 allows to "run ahead" checking the theory specifications on the
507 surface, while the prover is still crunching on internal
508 justifications. Unfinished / cancelled proofs are restarted as
509 required to complete full proof checking eventually.
511 * Improved output panel with tooltips, hyperlinks etc. based on the
512 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
513 tooltips leads to some window that supports the same recursively,
514 which can lead to stacks of tooltips as the semantic document content
515 is explored. ESCAPE closes the whole stack, individual windows may be
516 closed separately, or detached to become independent jEdit dockables.
518 * Improved support for commands that produce graph output: the text
519 message contains a clickable area to open a new instance of the graph
522 * More robust incremental parsing of outer syntax (partial comments,
523 malformed symbols). Changing the balance of open/close quotes and
524 comment delimiters works more conveniently with unfinished situations
525 that frequently occur in user interaction.
527 * More efficient painting and improved reactivity when editing large
528 files. More scalable management of formal document content.
530 * Smarter handling of tracing messages: prover process pauses after
531 certain number of messages per command transaction, with some user
532 dialog to stop or continue. This avoids swamping the front-end with
533 potentially infinite message streams.
535 * More plugin options and preferences, based on Isabelle/Scala. The
536 jEdit plugin option panel provides access to some Isabelle/Scala
537 options, including tuning parameters for editor reactivity and color
540 * Dockable window "Symbols" provides some editing support for Isabelle
543 * Dockable window "Monitor" shows ML runtime statistics. Note that
544 continuous display of the chart slows down the system.
546 * Improved editing support for control styles: subscript, superscript,
547 bold, reset of style -- operating on single symbols or text
548 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
550 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
551 adjust the main text area font size, and its derivatives for output,
552 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
553 need to be adapted to local keyboard layouts.
555 * More reactive completion popup by default: use \t (TAB) instead of
556 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
557 also "Plugin Options / SideKick / General / Code Completion Options".
559 * Implicit check and build dialog of the specified logic session
560 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
561 demand, without bundling big platform-dependent heap images in the
562 Isabelle distribution.
564 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
565 from Oracle provide better multi-platform experience. This version is
566 now bundled exclusively with Isabelle.
571 * Code generation for Haskell: restrict unqualified imports from
572 Haskell Prelude to a small set of fundamental operations.
574 * Command 'export_code': relative file names are interpreted
575 relatively to master directory of current theory rather than the
576 rather arbitrary current working directory. INCOMPATIBILITY.
578 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
579 use regular rule composition via "OF" / "THEN", or explicit proof
580 structure instead. Note that Isabelle/ML provides a variety of
581 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
582 with some care where this is really required.
584 * Command 'typ' supports an additional variant with explicit sort
585 constraint, to infer and check the most general type conforming to a
586 given sort. Example (in HOL):
588 typ "_ * _ * bool * unit" :: finite
590 * Command 'locale_deps' visualizes all locales and their relations as
598 - Added MaSh relevance filter based on machine-learning; see the
599 Sledgehammer manual for details.
600 - Polished Isar proofs generated with "isar_proofs" option.
601 - Rationalized type encodings ("type_enc" option).
602 - Renamed "kill_provers" subcommand to "kill_all".
604 isar_proof ~> isar_proofs
605 isar_shrink_factor ~> isar_shrink
606 max_relevant ~> max_facts
607 relevance_thresholds ~> fact_thresholds
609 * Quickcheck: added an optimisation for equality premises. It is
610 switched on by default, and can be switched off by setting the
611 configuration quickcheck_optimise_equality to false.
613 * Quotient: only one quotient can be defined by quotient_type
617 - generation of an abstraction function equation in lift_definition
619 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
621 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
624 * Preprocessing of the code generator rewrites set comprehensions into
625 pointfree expressions.
627 * The SMT solver Z3 has now by default a restricted set of directly
628 supported features. For the full set of features (div/mod, nonlinear
629 arithmetic, datatypes/records) with potential proof reconstruction
630 failures, enable the configuration option "z3_with_extensions". Minor
633 * Simplified 'typedef' specifications: historical options for implicit
634 set definition and alternative name have been discontinued. The
635 former behavior of "typedef (open) t = A" is now the default, but
636 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
639 * Removed constant "chars"; prefer "Enum.enum" on type "char"
640 directly. INCOMPATIBILITY.
642 * Moved operation product, sublists and n_lists from theory Enum to
643 List. INCOMPATIBILITY.
645 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
647 * Class "comm_monoid_diff" formalises properties of bounded
648 subtraction, with natural numbers and multisets as typical instances.
650 * Added combinator "Option.these" with type "'a option set => 'a set".
652 * Theory "Transitive_Closure": renamed lemmas
654 reflcl_tranclp -> reflclp_tranclp
655 rtranclp_reflcl -> rtranclp_reflclp
659 * Theory "Rings": renamed lemmas (in class semiring)
661 left_distrib ~> distrib_right
662 right_distrib ~> distrib_left
666 * Generalized the definition of limits:
668 - Introduced the predicate filterlim (LIM x F. f x :> G) which
669 expresses that when the input values x converge to F then the
670 output f x converges to G.
672 - Added filters for convergence to positive (at_top) and negative
675 - Moved infinity in the norm (at_infinity) from
676 Multivariate_Analysis to Complex_Main.
678 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
683 * Theory "Library/Option_ord" provides instantiation of option type to
684 lattice type classes.
686 * Theory "Library/Multiset": renamed
688 constant fold_mset ~> Multiset.fold
689 fact fold_mset_commute ~> fold_mset_comm
693 * Renamed theory Library/List_Prefix to Library/Sublist, with related
696 - Renamed constants (and related lemmas)
699 strict_prefix ~> prefix
701 - Replaced constant "postfix" by "suffixeq" with swapped argument
702 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
703 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
704 Renamed lemmas accordingly.
706 - Added constant "list_hembeq" for homeomorphic embedding on
707 lists. Added abbreviation "sublisteq" for special case
708 "list_hembeq (op =)".
710 - Theory Library/Sublist no longer provides "order" and "bot" type
711 class instances for the prefix order (merely corresponding locale
712 interpretations). The type class instances are now in theory
713 Library/Prefix_Order.
715 - The sublist relation of theory Library/Sublist_Order is now based
716 on "Sublist.sublisteq". Renamed lemmas accordingly:
718 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
719 le_list_append_mono ~> Sublist.list_hembeq_append_mono
720 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
721 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
722 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
723 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
724 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
725 le_list_drop_many ~> Sublist.sublisteq_drop_many
726 le_list_filter_left ~> Sublist.sublisteq_filter_left
727 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
728 le_list_rev_take_iff ~> Sublist.sublisteq_append
729 le_list_same_length ~> Sublist.sublisteq_same_length
730 le_list_take_many_iff ~> Sublist.sublisteq_append'
731 less_eq_list.drop ~> less_eq_list_drop
732 less_eq_list.induct ~> less_eq_list_induct
733 not_le_list_length ~> Sublist.not_sublisteq_length
737 * New theory Library/Countable_Set.
739 * Theory Library/Debug and Library/Parallel provide debugging and
740 parallel execution for code generated towards Isabelle/ML.
742 * Theory Library/FuncSet: Extended support for Pi and extensional and
743 introduce the extensional dependent function space "PiE". Replaced
744 extensional_funcset by an abbreviation, and renamed lemmas from
745 extensional_funcset to PiE as follows:
747 extensional_empty ~> PiE_empty
748 extensional_funcset_empty_domain ~> PiE_empty_domain
749 extensional_funcset_empty_range ~> PiE_empty_range
750 extensional_funcset_arb ~> PiE_arb
751 extensional_funcset_mem ~> PiE_mem
752 extensional_funcset_extend_domainI ~> PiE_fun_upd
753 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
754 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
755 card_extensional_funcset ~> card_PiE
756 finite_extensional_funcset ~> finite_PiE
760 * Theory Library/FinFun: theory of almost everywhere constant
761 functions (supersedes the AFP entry "Code Generation for Functions as
764 * Theory Library/Phantom: generic phantom type to make a type
765 parameter appear in a constant's type. This alternative to adding
766 TYPE('a) as another parameter avoids unnecessary closures in generated
769 * Theory Library/RBT_Impl: efficient construction of red-black trees
770 from sorted associative lists. Merging two trees with rbt_union may
771 return a structurally different tree than before. Potential
774 * Theory Library/IArray: immutable arrays with code generation.
776 * Theory Library/Finite_Lattice: theory of finite lattices.
778 * HOL/Multivariate_Analysis: replaced
780 "basis :: 'a::euclidean_space => nat => real"
781 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
783 on euclidean spaces by using the inner product "_ \<bullet> _" with
784 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
785 "SUM i : Basis. f i * r i".
787 With this change the following constants are also changed or removed:
789 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
790 a $$ i ~> inner a i (where i : Basis)
792 \<pi>, \<pi>' removed
794 Theorems about these constants where removed.
798 component_le_norm ~> Basis_le_norm
799 euclidean_eq ~> euclidean_eq_iff
800 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
801 euclidean_simps ~> inner_simps
802 independent_basis ~> independent_Basis
803 span_basis ~> span_Basis
804 in_span_basis ~> in_span_Basis
805 norm_bound_component_le ~> norm_boound_Basis_le
806 norm_bound_component_lt ~> norm_boound_Basis_lt
807 component_le_infnorm ~> Basis_le_infnorm
813 - Added simproc "measurable" to automatically prove measurability.
815 - Added induction rules for sigma sets with disjoint union
816 (sigma_sets_induct_disjoint) and for Borel-measurable functions
817 (borel_measurable_induct).
819 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
822 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
823 AFP entry "Ordinals_and_Cardinals").
825 * HOL/BNF: New (co)datatype package based on bounded natural functors
826 with support for mixed, nested recursion and interesting non-free
829 * HOL/Finite_Set and Relation: added new set and relation operations
830 expressed by Finite_Set.fold.
832 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
833 trees for the code generator.
835 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
837 possible INCOMPATIBILITY.
839 * HOL/Set: renamed Set.project -> Set.filter
843 *** Document preparation ***
845 * Dropped legacy antiquotations "term_style" and "thm_style", since
846 styles may be given as arguments to "term" and "thm" already.
847 Discontinued legacy styles "prem1" .. "prem19".
849 * Default LaTeX rendering for \<euro> is now based on eurosym package,
850 instead of slightly exotic babel/greek.
852 * Document variant NAME may use different LaTeX entry point
853 document/root_NAME.tex if that file exists, instead of the common
856 * Simplified custom document/build script, instead of old-style
857 document/IsaMakefile. Minor INCOMPATIBILITY.
862 * The default limit for maximum number of worker threads is now 8,
863 instead of 4, in correspondence to capabilities of contemporary
864 hardware and Poly/ML runtime system.
866 * Type Seq.results and related operations support embedded error
867 messages within lazy enumerations, and thus allow to provide
868 informative errors in the absence of any usable results.
870 * Renamed Position.str_of to Position.here to emphasize that this is a
871 formal device to inline positions into message text, but not
872 necessarily printing visible text.
877 * Advanced support for Isabelle sessions and build management, see
878 "system" manual for the chapter of that name, especially the "isabelle
879 build" tool and its examples. The "isabelle mkroot" tool prepares
880 session root directories for use with "isabelle build", similar to
881 former "isabelle mkdir" for "isabelle usedir". Note that this affects
882 document preparation as well. INCOMPATIBILITY, isabelle usedir /
883 mkdir / make are rendered obsolete.
885 * Discontinued obsolete Isabelle/build script, it is superseded by the
886 regular isabelle build tool. For example:
888 isabelle build -s -b HOL
890 * Discontinued obsolete "isabelle makeall".
892 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
893 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
894 provides some traditional targets that invoke "isabelle build". Note
895 that this is inefficient! Applications of Isabelle/HOL involving
896 "isabelle make" should be upgraded to use "isabelle build" directly.
898 * The "isabelle options" tool prints Isabelle system options, as
899 required for "isabelle build", for example.
901 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
902 Minor INCOMPATIBILITY in command-line options.
904 * The "isabelle install" tool has now a simpler command-line. Minor
907 * The "isabelle components" tool helps to resolve add-on components
908 that are not bundled, or referenced from a bare-bones repository
911 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
912 platform family: "linux", "macos", "windows".
914 * The ML system is configured as regular component, and no longer
915 picked up from some surrounding directory. Potential INCOMPATIBILITY
916 for home-made settings.
918 * Improved ML runtime statistics (heap, threads, future tasks etc.).
920 * Discontinued support for Poly/ML 5.2.1, which was the last version
921 without exception positions and advanced ML compiler/toplevel
924 * Discontinued special treatment of Proof General -- no longer guess
925 PROOFGENERAL_HOME based on accidental file-system layout. Minor
926 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
927 settings manually, or use a Proof General version that has been
928 bundled as Isabelle component.
932 New in Isabelle2012 (May 2012)
933 ------------------------------
937 * Prover IDE (PIDE) improvements:
939 - more robust Sledgehammer integration (as before the sledgehammer
940 command-line needs to be typed into the source buffer)
941 - markup for bound variables
942 - markup for types of term variables (displayed as tooltips)
943 - support for user-defined Isar commands within the running session
944 - improved support for Unicode outside original 16bit range
945 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
947 * Forward declaration of outer syntax keywords within the theory
948 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
949 commands to be used in the same theory where defined.
951 * Auxiliary contexts indicate block structure for specifications with
952 additional parameters and assumptions. Such unnamed contexts may be
953 nested within other targets, like 'theory', 'locale', 'class',
954 'instantiation' etc. Results from the local context are generalized
955 accordingly and applied to the enclosing target context. Example:
959 assumes xy: "x = y" and yz: "y = z"
962 lemma my_trans: "x = z" using xy yz by simp
968 The most basic application is to factor-out context elements of
969 several fixes/assumes/shows theorem statements, e.g. see
970 ~~/src/HOL/Isar_Examples/Group_Context.thy
972 Any other local theory specification element works within the "context
973 ... begin ... end" block as well.
975 * Bundled declarations associate attributed fact expressions with a
976 given name in the context. These may be later included in other
977 contexts. This allows to manage context extensions casually, without
978 the logical dependencies of locales and locale interpretation. See
979 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
981 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
982 declaration, and results are standardized before being stored. Thus
983 old-style "standard" after instantiation or composition of facts
984 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
985 indices of schematic variables.
987 * Rule attributes in local theory declarations (e.g. locale or class)
988 are now statically evaluated: the resulting theorem is stored instead
989 of the original expression. INCOMPATIBILITY in rare situations, where
990 the historic accident of dynamic re-evaluation in interpretations
993 * New tutorial "Programming and Proving in Isabelle/HOL"
994 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
995 Structured Isar Proofs" ("isar-overview"), which has been removed. It
996 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
997 Logic" as the recommended beginners tutorial, but does not cover all
998 of the material of that old tutorial.
1000 * Updated and extended reference manuals: "isar-ref",
1001 "implementation", "system"; reduced remaining material in old "ref"
1007 * Command 'definition' no longer exports the foundational "raw_def"
1008 into the user context. Minor INCOMPATIBILITY, may use the regular
1009 "def" result with attribute "abs_def" to imitate the old version.
1011 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1012 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1013 expand it. This also works for object-logic equality. (Formerly
1014 undocumented feature.)
1016 * Sort constraints are now propagated in simultaneous statements, just
1017 like type constraints. INCOMPATIBILITY in rare situations, where
1018 distinct sorts used to be assigned accidentally. For example:
1020 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1022 lemma "P (x::'a)" and "Q (y::'a::bar)"
1023 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1025 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1026 tolerant against multiple unifiers, as long as the final result is
1027 unique. (As before, rules are composed in canonical right-to-left
1028 order to accommodate newly introduced premises.)
1030 * Renamed some inner syntax categories:
1036 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1037 "num_position" etc. are mainly used instead (which also include
1038 position information via constraints).
1040 * Simplified configuration options for syntax ambiguity: see
1041 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1042 manual. Minor INCOMPATIBILITY.
1044 * Discontinued configuration option "syntax_positions": atomic terms
1045 in parse trees are always annotated by position constraints.
1047 * Old code generator for SML and its commands 'code_module',
1048 'code_library', 'consts_code', 'types_code' have been discontinued.
1049 Use commands of the generic code generator instead. INCOMPATIBILITY.
1051 * Redundant attribute "code_inline" has been discontinued. Use
1052 "code_unfold" instead. INCOMPATIBILITY.
1054 * Dropped attribute "code_unfold_post" in favor of the its dual
1055 "code_abbrev", which yields a common pattern in definitions like
1057 definition [code_abbrev]: "f = t"
1061 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1062 instead. INCOMPATIBILITY.
1064 * Discontinued old "prems" fact, which used to refer to the accidental
1065 collection of foundational premises in the context (already marked as
1066 legacy since Isabelle2011).
1071 * Type 'a set is now a proper type constructor (just as before
1072 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1073 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1074 sets separate, it is often sufficient to rephrase some set S that has
1075 been accidentally used as predicates by "%x. x : S", and some
1076 predicate P that has been accidentally used as set by "{x. P x}".
1077 Corresponding proofs in a first step should be pruned from any
1078 tinkering with former theorems mem_def and Collect_def as far as
1081 For developments which deliberately mix predicates and sets, a
1082 planning step is necessary to determine what should become a predicate
1083 and what a set. It can be helpful to carry out that step in
1084 Isabelle2011-1 before jumping right into the current release.
1086 * Code generation by default implements sets as container type rather
1087 than predicates. INCOMPATIBILITY.
1089 * New type synonym 'a rel = ('a * 'a) set
1091 * The representation of numerals has changed. Datatype "num"
1092 represents strictly positive binary numerals, along with functions
1093 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1094 positive and negated numeric literals, respectively. See also
1095 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1096 user theories may require adaptations as follows:
1098 - Theorems with number_ring or number_semiring constraints: These
1099 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1101 - Theories defining numeric types: Remove number, number_semiring,
1102 and number_ring instances. Defer all theorems about numerals until
1103 after classes one and semigroup_add have been instantiated.
1105 - Numeral-only simp rules: Replace each rule having a "number_of v"
1106 pattern with two copies, one for numeral and one for neg_numeral.
1108 - Theorems about subclasses of semiring_1 or ring_1: These classes
1109 automatically support numerals now, so more simp rules and
1110 simprocs may now apply within the proof.
1112 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1113 Redefine using other integer operations.
1115 * Transfer: New package intended to generalize the existing
1116 "descending" method and related theorem attributes from the Quotient
1117 package. (Not all functionality is implemented yet, but future
1118 development will focus on Transfer as an eventual replacement for the
1119 corresponding parts of the Quotient package.)
1121 - transfer_rule attribute: Maintains a collection of transfer rules,
1122 which relate constants at two different types. Transfer rules may
1123 relate different type instances of the same polymorphic constant,
1124 or they may relate an operation on a raw type to a corresponding
1125 operation on an abstract type (quotient or subtype). For example:
1127 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1128 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1130 - transfer method: Replaces a subgoal on abstract types with an
1131 equivalent subgoal on the corresponding raw types. Constants are
1132 replaced with corresponding ones according to the transfer rules.
1133 Goals are generalized over all free variables by default; this is
1134 necessary for variables whose types change, but can be overridden
1135 for specific variables with e.g. "transfer fixing: x y z". The
1136 variant transfer' method allows replacing a subgoal with one that
1137 is logically stronger (rather than equivalent).
1139 - relator_eq attribute: Collects identity laws for relators of
1140 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1141 transfer method uses these lemmas to infer transfer rules for
1142 non-polymorphic constants on the fly.
1144 - transfer_prover method: Assists with proving a transfer rule for a
1145 new constant, provided the constant is defined in terms of other
1146 constants that already have transfer rules. It should be applied
1147 after unfolding the constant definitions.
1149 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1150 from type nat to type int.
1152 * Lifting: New package intended to generalize the quotient_definition
1153 facility of the Quotient package; designed to work with Transfer.
1155 - lift_definition command: Defines operations on an abstract type in
1156 terms of a corresponding operation on a representation
1157 type. Example syntax:
1159 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1162 Users must discharge a respectfulness proof obligation when each
1163 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1164 the proof is discharged automatically.) The obligation is
1165 presented in a user-friendly, readable form; a respectfulness
1166 theorem in the standard format and a transfer rule are generated
1169 - Integration with code_abstype: For typedefs (e.g. subtypes
1170 corresponding to a datatype invariant, such as dlist),
1171 lift_definition generates a code certificate theorem and sets up
1172 code generation for each constant.
1174 - setup_lifting command: Sets up the Lifting package to work with a
1175 user-defined type. The user must provide either a quotient theorem
1176 or a type_definition theorem. The package configures transfer
1177 rules for equality and quantifiers on the type, and sets up the
1178 lift_definition command to work with the type.
1180 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1181 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1182 Word/Word.thy and Library/Float.thy.
1186 - The 'quotient_type' command now supports a 'morphisms' option with
1187 rep and abs functions, similar to typedef.
1189 - 'quotient_type' sets up new types to work with the Lifting and
1190 Transfer packages, as with 'setup_lifting'.
1192 - The 'quotient_definition' command now requires the user to prove a
1193 respectfulness property at the point where the constant is
1194 defined, similar to lift_definition; INCOMPATIBILITY.
1196 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1197 accordingly, INCOMPATIBILITY.
1199 * New diagnostic command 'find_unused_assms' to find potentially
1200 superfluous assumptions in theorems using Quickcheck.
1204 - Quickcheck returns variable assignments as counterexamples, which
1205 allows to reveal the underspecification of functions under test.
1206 For example, refuting "hd xs = x", it presents the variable
1207 assignment xs = [] and x = a1 as a counterexample, assuming that
1208 any property is false whenever "hd []" occurs in it.
1210 These counterexample are marked as potentially spurious, as
1211 Quickcheck also returns "xs = []" as a counterexample to the
1212 obvious theorem "hd xs = hd xs".
1214 After finding a potentially spurious counterexample, Quickcheck
1215 continues searching for genuine ones.
1217 By default, Quickcheck shows potentially spurious and genuine
1218 counterexamples. The option "genuine_only" sets quickcheck to only
1219 show genuine counterexamples.
1221 - The command 'quickcheck_generator' creates random and exhaustive
1222 value generators for a given type and operations.
1224 It generates values by using the operations as if they were
1225 constructors of that type.
1227 - Support for multisets.
1229 - Added "use_subtype" options.
1231 - Added "quickcheck_locale" configuration to specify how to process
1232 conjectures in a locale context.
1234 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1235 and affecting 'rat' and 'real'.
1238 - Integrated more tightly with SPASS, as described in the ITP 2012
1239 paper "More SPASS with Isabelle".
1240 - Made it try "smt" as a fallback if "metis" fails or times out.
1241 - Added support for the following provers: Alt-Ergo (via Why3 and
1242 TFF1), iProver, iProver-Eq.
1243 - Sped up the minimizer.
1244 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1245 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1246 - Renamed "sound" option to "strict".
1248 * Metis: Added possibility to specify lambda translations scheme as a
1249 parenthesized argument (e.g., "by (metis (lifting) ...)").
1251 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1253 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1255 * New "case_product" attribute to generate a case rule doing multiple
1256 case distinctions at the same time. E.g.
1258 list.exhaust [case_product nat.exhaust]
1260 produces a rule which can be used to perform case distinction on both
1263 * New "eventually_elim" method as a generalized variant of the
1264 eventually_elim* rules. Supports structured proofs.
1266 * Typedef with implicit set definition is considered legacy. Use
1267 "typedef (open)" form instead, which will eventually become the
1270 * Record: code generation can be switched off manually with
1272 declare [[record_coden = false]] -- "default true"
1274 * Datatype: type parameters allow explicit sort constraints.
1276 * Concrete syntax for case expressions includes constraints for source
1277 positions, and thus produces Prover IDE markup for its bindings.
1278 INCOMPATIBILITY for old-style syntax translations that augment the
1279 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1282 * Clarified attribute "mono_set": pure declaration without modifying
1283 the result of the fact expression.
1285 * More default pred/set conversions on a couple of relation operations
1286 and predicates. Added powers of predicate relations. Consolidation
1287 of some relation theorems:
1289 converse_def ~> converse_unfold
1290 rel_comp_def ~> relcomp_unfold
1291 symp_def ~> (modified, use symp_def and sym_def instead)
1292 transp_def ~> transp_trans
1293 Domain_def ~> Domain_unfold
1294 Range_def ~> Domain_converse [symmetric]
1296 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1298 See theory "Relation" for examples for making use of pred/set
1299 conversions by means of attributes "to_set" and "to_pred".
1303 * Renamed facts about the power operation on relations, i.e., relpow
1304 to match the constant's name:
1306 rel_pow_1 ~> relpow_1
1307 rel_pow_0_I ~> relpow_0_I
1308 rel_pow_Suc_I ~> relpow_Suc_I
1309 rel_pow_Suc_I2 ~> relpow_Suc_I2
1310 rel_pow_0_E ~> relpow_0_E
1311 rel_pow_Suc_E ~> relpow_Suc_E
1312 rel_pow_E ~> relpow_E
1313 rel_pow_Suc_D2 ~> relpow_Suc_D2
1314 rel_pow_Suc_E2 ~> relpow_Suc_E2
1315 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1316 rel_pow_E2 ~> relpow_E2
1317 rel_pow_add ~> relpow_add
1318 rel_pow_commute ~> relpow
1319 rel_pow_empty ~> relpow_empty:
1320 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1321 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1322 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1323 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1324 rel_pow_fun_conv ~> relpow_fun_conv
1325 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1326 rel_pow_finite_bounded ~> relpow_finite_bounded
1327 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1328 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1329 single_valued_rel_pow ~> single_valued_relpow
1333 * Theory Relation: Consolidated constant name for relation composition
1334 and corresponding theorem names:
1336 - Renamed constant rel_comp to relcomp.
1338 - Dropped abbreviation pred_comp. Use relcompp instead.
1342 rel_compI ~> relcompI
1343 rel_compEpair ~> relcompEpair
1344 rel_compE ~> relcompE
1345 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1346 rel_comp_empty1 ~> relcomp_empty1
1347 rel_comp_mono ~> relcomp_mono
1348 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1349 rel_comp_distrib ~> relcomp_distrib
1350 rel_comp_distrib2 ~> relcomp_distrib2
1351 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1352 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1353 single_valued_rel_comp ~> single_valued_relcomp
1354 rel_comp_def ~> relcomp_unfold
1355 converse_rel_comp ~> converse_relcomp
1356 pred_compI ~> relcomppI
1357 pred_compE ~> relcomppE
1358 pred_comp_bot1 ~> relcompp_bot1
1359 pred_comp_bot2 ~> relcompp_bot2
1360 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1361 pred_comp_mono ~> relcompp_mono
1362 pred_comp_distrib ~> relcompp_distrib
1363 pred_comp_distrib2 ~> relcompp_distrib2
1364 converse_pred_comp ~> converse_relcompp
1366 finite_rel_comp ~> finite_relcomp
1368 set_rel_comp ~> set_relcomp
1372 * Theory Divides: Discontinued redundant theorems about div and mod.
1373 INCOMPATIBILITY, use the corresponding generic theorems instead.
1375 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1376 zdiv_self ~> div_self
1377 zmod_self ~> mod_self
1380 zdiv_zmod_equality ~> div_mod_equality2
1381 zdiv_zmod_equality2 ~> div_mod_equality
1382 zmod_zdiv_trivial ~> mod_div_trivial
1383 zdiv_zminus_zminus ~> div_minus_minus
1384 zmod_zminus_zminus ~> mod_minus_minus
1385 zdiv_zminus2 ~> div_minus_right
1386 zmod_zminus2 ~> mod_minus_right
1387 zdiv_minus1_right ~> div_minus1_right
1388 zmod_minus1_right ~> mod_minus1_right
1389 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1390 zmod_zmult1_eq ~> mod_mult_right_eq
1391 zpower_zmod ~> power_mod
1392 zdvd_zmod ~> dvd_mod
1393 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1394 mod_mult_distrib ~> mult_mod_left
1395 mod_mult_distrib2 ~> mult_mod_right
1397 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1398 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1400 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1402 * Consolidated theorem names concerning fold combinators:
1404 inf_INFI_fold_inf ~> inf_INF_fold_inf
1405 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1406 INFI_fold_inf ~> INF_fold_inf
1407 SUPR_fold_sup ~> SUP_fold_sup
1408 union_set ~> union_set_fold
1409 minus_set ~> minus_set_fold
1410 INFI_set_fold ~> INF_set_fold
1411 SUPR_set_fold ~> SUP_set_fold
1412 INF_code ~> INF_set_foldr
1413 SUP_code ~> SUP_set_foldr
1414 foldr.simps ~> foldr.simps (in point-free formulation)
1415 foldr_fold_rev ~> foldr_conv_fold
1416 foldl_fold ~> foldl_conv_fold
1417 foldr_foldr ~> foldr_conv_foldl
1418 foldl_foldr ~> foldl_conv_foldr
1419 fold_set_remdups ~> fold_set_fold_remdups
1420 fold_set ~> fold_set_fold
1421 fold1_set ~> fold1_set_fold
1425 * Dropped rarely useful theorems concerning fold combinators:
1426 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1427 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1428 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1429 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1430 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1431 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1432 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1433 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1434 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1435 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1437 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1438 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1439 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1440 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1441 lemmas over fold rather than foldr, or make use of lemmas
1442 fold_conv_foldr and fold_rev.
1444 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1445 through option types.
1447 * "Transitive_Closure.ntrancl": bounded transitive closure on
1450 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1452 * Theory Int: Discontinued many legacy theorems specific to type int.
1453 INCOMPATIBILITY, use the corresponding generic theorems instead.
1455 zminus_zminus ~> minus_minus
1456 zminus_0 ~> minus_zero
1457 zminus_zadd_distrib ~> minus_add_distrib
1458 zadd_commute ~> add_commute
1459 zadd_assoc ~> add_assoc
1460 zadd_left_commute ~> add_left_commute
1463 zadd_0 ~> add_0_left
1464 zadd_0_right ~> add_0_right
1465 zadd_zminus_inverse2 ~> left_minus
1466 zmult_zminus ~> mult_minus_left
1467 zmult_commute ~> mult_commute
1468 zmult_assoc ~> mult_assoc
1469 zadd_zmult_distrib ~> left_distrib
1470 zadd_zmult_distrib2 ~> right_distrib
1471 zdiff_zmult_distrib ~> left_diff_distrib
1472 zdiff_zmult_distrib2 ~> right_diff_distrib
1473 zmult_1 ~> mult_1_left
1474 zmult_1_right ~> mult_1_right
1475 zle_refl ~> order_refl
1476 zle_trans ~> order_trans
1477 zle_antisym ~> order_antisym
1478 zle_linear ~> linorder_linear
1479 zless_linear ~> linorder_less_linear
1480 zadd_left_mono ~> add_left_mono
1481 zadd_strict_right_mono ~> add_strict_right_mono
1482 zadd_zless_mono ~> add_less_le_mono
1483 int_0_less_1 ~> zero_less_one
1484 int_0_neq_1 ~> zero_neq_one
1486 zpower_zadd_distrib ~> power_add
1487 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1488 zero_le_zpower_abs ~> zero_le_power_abs
1490 * Theory Deriv: Renamed
1492 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1494 * Theory Library/Multiset: Improved code generation of multisets.
1496 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1497 are expressed via type classes again. The special syntax
1498 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1499 setsum_set, which is now subsumed by Big_Operators.setsum.
1502 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1503 use theory HOL/Library/Nat_Bijection instead.
1505 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1506 trees is now inside a type class context. Names of affected
1507 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1508 theories working directly with raw red-black trees, adapt the names as
1512 bulkload -> rbt_bulkload
1513 del_from_left -> rbt_del_from_left
1514 del_from_right -> rbt_del_from_right
1516 delete -> rbt_delete
1518 insert -> rbt_insert
1519 insertw -> rbt_insert_with
1520 insert_with_key -> rbt_insert_with_key
1521 map_entry -> rbt_map_entry
1522 lookup -> rbt_lookup
1523 sorted -> rbt_sorted
1524 tree_greater -> rbt_greater
1525 tree_less -> rbt_less
1526 tree_less_symbol -> rbt_less_symbol
1528 union_with -> rbt_union_with
1529 union_with_key -> rbt_union_with_key
1532 balance_left_sorted -> balance_left_rbt_sorted
1533 balance_left_tree_greater -> balance_left_rbt_greater
1534 balance_left_tree_less -> balance_left_rbt_less
1535 balance_right_sorted -> balance_right_rbt_sorted
1536 balance_right_tree_greater -> balance_right_rbt_greater
1537 balance_right_tree_less -> balance_right_rbt_less
1538 balance_sorted -> balance_rbt_sorted
1539 balance_tree_greater -> balance_rbt_greater
1540 balance_tree_less -> balance_rbt_less
1541 bulkload_is_rbt -> rbt_bulkload_is_rbt
1542 combine_sorted -> combine_rbt_sorted
1543 combine_tree_greater -> combine_rbt_greater
1544 combine_tree_less -> combine_rbt_less
1545 delete_in_tree -> rbt_delete_in_tree
1546 delete_is_rbt -> rbt_delete_is_rbt
1547 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1548 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1549 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1550 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1551 del_in_tree -> rbt_del_in_tree
1552 del_inv1_inv2 -> rbt_del_inv1_inv2
1553 del_sorted -> rbt_del_rbt_sorted
1554 del_tree_greater -> rbt_del_rbt_greater
1555 del_tree_less -> rbt_del_rbt_less
1556 dom_lookup_Branch -> dom_rbt_lookup_Branch
1557 entries_lookup -> entries_rbt_lookup
1558 finite_dom_lookup -> finite_dom_rbt_lookup
1559 insert_sorted -> rbt_insert_rbt_sorted
1560 insertw_is_rbt -> rbt_insertw_is_rbt
1561 insertwk_is_rbt -> rbt_insertwk_is_rbt
1562 insertwk_sorted -> rbt_insertwk_rbt_sorted
1563 insertw_sorted -> rbt_insertw_rbt_sorted
1564 ins_sorted -> ins_rbt_sorted
1565 ins_tree_greater -> ins_rbt_greater
1566 ins_tree_less -> ins_rbt_less
1567 is_rbt_sorted -> is_rbt_rbt_sorted
1568 lookup_balance -> rbt_lookup_balance
1569 lookup_bulkload -> rbt_lookup_rbt_bulkload
1570 lookup_delete -> rbt_lookup_rbt_delete
1571 lookup_Empty -> rbt_lookup_Empty
1572 lookup_from_in_tree -> rbt_lookup_from_in_tree
1573 lookup_in_tree -> rbt_lookup_in_tree
1574 lookup_ins -> rbt_lookup_ins
1575 lookup_insert -> rbt_lookup_rbt_insert
1576 lookup_insertw -> rbt_lookup_rbt_insertw
1577 lookup_insertwk -> rbt_lookup_rbt_insertwk
1578 lookup_keys -> rbt_lookup_keys
1579 lookup_map -> rbt_lookup_map
1580 lookup_map_entry -> rbt_lookup_rbt_map_entry
1581 lookup_tree_greater -> rbt_lookup_rbt_greater
1582 lookup_tree_less -> rbt_lookup_rbt_less
1583 lookup_union -> rbt_lookup_rbt_union
1584 map_entry_color_of -> rbt_map_entry_color_of
1585 map_entry_inv1 -> rbt_map_entry_inv1
1586 map_entry_inv2 -> rbt_map_entry_inv2
1587 map_entry_is_rbt -> rbt_map_entry_is_rbt
1588 map_entry_sorted -> rbt_map_entry_rbt_sorted
1589 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1590 map_entry_tree_less -> rbt_map_entry_rbt_less
1591 map_tree_greater -> map_rbt_greater
1592 map_tree_less -> map_rbt_less
1593 map_sorted -> map_rbt_sorted
1594 paint_sorted -> paint_rbt_sorted
1595 paint_lookup -> paint_rbt_lookup
1596 paint_tree_greater -> paint_rbt_greater
1597 paint_tree_less -> paint_rbt_less
1598 sorted_entries -> rbt_sorted_entries
1599 tree_greater_eq_trans -> rbt_greater_eq_trans
1600 tree_greater_nit -> rbt_greater_nit
1601 tree_greater_prop -> rbt_greater_prop
1602 tree_greater_simps -> rbt_greater_simps
1603 tree_greater_trans -> rbt_greater_trans
1604 tree_less_eq_trans -> rbt_less_eq_trans
1605 tree_less_nit -> rbt_less_nit
1606 tree_less_prop -> rbt_less_prop
1607 tree_less_simps -> rbt_less_simps
1608 tree_less_trans -> rbt_less_trans
1609 tree_ord_props -> rbt_ord_props
1610 union_Branch -> rbt_union_Branch
1611 union_is_rbt -> rbt_union_is_rbt
1612 unionw_is_rbt -> rbt_unionw_is_rbt
1613 unionwk_is_rbt -> rbt_unionwk_is_rbt
1614 unionwk_sorted -> rbt_unionwk_rbt_sorted
1616 * Theory HOL/Library/Float: Floating point numbers are now defined as
1617 a subset of the real numbers. All operations are defined using the
1618 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1625 round_down -> float_round_down
1626 round_up -> float_round_up
1630 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1633 abs_float_def -> Float.compute_float_abs
1634 bitlen_ge0 -> bitlen_nonneg
1635 bitlen.simps -> Float.compute_bitlen
1636 float_components -> Float_mantissa_exponent
1637 float_divl.simps -> Float.compute_float_divl
1638 float_divr.simps -> Float.compute_float_divr
1639 float_eq_odd -> mult_powr_eq_mult_powr_iff
1640 float_power -> real_of_float_power
1641 lapprox_posrat_def -> Float.compute_lapprox_posrat
1642 lapprox_rat.simps -> Float.compute_lapprox_rat
1643 le_float_def' -> Float.compute_float_le
1644 le_float_def -> less_eq_float.rep_eq
1645 less_float_def' -> Float.compute_float_less
1646 less_float_def -> less_float.rep_eq
1647 normfloat_def -> Float.compute_normfloat
1648 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1649 normfloat -> normfloat_def
1650 normfloat_unique -> use normfloat_def
1651 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1652 one_float_def -> Float.compute_float_one
1653 plus_float_def -> Float.compute_float_plus
1654 rapprox_posrat_def -> Float.compute_rapprox_posrat
1655 rapprox_rat.simps -> Float.compute_rapprox_rat
1656 real_of_float_0 -> zero_float.rep_eq
1657 real_of_float_1 -> one_float.rep_eq
1658 real_of_float_abs -> abs_float.rep_eq
1659 real_of_float_add -> plus_float.rep_eq
1660 real_of_float_minus -> uminus_float.rep_eq
1661 real_of_float_mult -> times_float.rep_eq
1662 real_of_float_simp -> Float.rep_eq
1663 real_of_float_sub -> minus_float.rep_eq
1664 round_down.simps -> Float.compute_float_round_down
1665 round_up.simps -> Float.compute_float_round_up
1666 times_float_def -> Float.compute_float_times
1667 uminus_float_def -> Float.compute_float_uminus
1668 zero_float_def -> Float.compute_float_zero
1670 Lemmas not necessary anymore, use the transfer method:
1671 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1672 float_divr, float_le_simp, float_less1_mantissa_bound,
1673 float_less_simp, float_less_zero, float_le_zero,
1674 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1675 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1676 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1677 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1678 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1679 round_up, zero_le_float, zero_less_float
1681 * New theory HOL/Library/DAList provides an abstract type for
1682 association lists with distinct keys.
1684 * Session HOL/IMP: Added new theory of abstract interpretation of
1687 * Session HOL-Import: Re-implementation from scratch is faster,
1688 simpler, and more scalable. Requires a proof bundle, which is
1689 available as an external component. Discontinued old (and mostly
1690 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1692 * Session HOL-Word: Discontinued many redundant theorems specific to
1693 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1696 word_sub_alt ~> word_sub_wi
1697 word_add_alt ~> word_add_def
1698 word_mult_alt ~> word_mult_def
1699 word_minus_alt ~> word_minus_def
1700 word_0_alt ~> word_0_wi
1701 word_1_alt ~> word_1_wi
1702 word_add_0 ~> add_0_left
1703 word_add_0_right ~> add_0_right
1704 word_mult_1 ~> mult_1_left
1705 word_mult_1_right ~> mult_1_right
1706 word_add_commute ~> add_commute
1707 word_add_assoc ~> add_assoc
1708 word_add_left_commute ~> add_left_commute
1709 word_mult_commute ~> mult_commute
1710 word_mult_assoc ~> mult_assoc
1711 word_mult_left_commute ~> mult_left_commute
1712 word_left_distrib ~> left_distrib
1713 word_right_distrib ~> right_distrib
1714 word_left_minus ~> left_minus
1715 word_diff_0_right ~> diff_0_right
1716 word_diff_self ~> diff_self
1717 word_sub_def ~> diff_minus
1718 word_diff_minus ~> diff_minus
1719 word_add_ac ~> add_ac
1720 word_mult_ac ~> mult_ac
1721 word_plus_ac0 ~> add_0_left add_0_right add_ac
1722 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1723 word_order_trans ~> order_trans
1724 word_order_refl ~> order_refl
1725 word_order_antisym ~> order_antisym
1726 word_order_linear ~> linorder_linear
1727 lenw1_zero_neq_one ~> zero_neq_one
1728 word_number_of_eq ~> number_of_eq
1729 word_of_int_add_hom ~> wi_hom_add
1730 word_of_int_sub_hom ~> wi_hom_sub
1731 word_of_int_mult_hom ~> wi_hom_mult
1732 word_of_int_minus_hom ~> wi_hom_neg
1733 word_of_int_succ_hom ~> wi_hom_succ
1734 word_of_int_pred_hom ~> wi_hom_pred
1735 word_of_int_0_hom ~> word_0_wi
1736 word_of_int_1_hom ~> word_1_wi
1738 * Session HOL-Word: New proof method "word_bitwise" for splitting
1739 machine word equalities and inequalities into logical circuits,
1740 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1741 multiplication, shifting by constants, bitwise operators and numeric
1742 constants. Requires fixed-length word types, not 'a word. Solves
1743 many standard word identities outright and converts more into first
1744 order problems amenable to blast or similar. See also examples in
1745 HOL/Word/Examples/WordExamples.thy.
1747 * Session HOL-Probability: Introduced the type "'a measure" to
1748 represent measures, this replaces the records 'a algebra and 'a
1749 measure_space. The locales based on subset_class now have two
1750 locale-parameters the space \<Omega> and the set of measurable sets M.
1751 The product of probability spaces uses now the same constant as the
1752 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1753 measure". Most constants are defined now outside of locales and gain
1754 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1755 Measure space constructions for distributions and densities now got
1756 their own constants distr and density. Instead of using locales to
1757 describe measure spaces with a finite space, the measure count_space
1758 and point_measure is introduced. INCOMPATIBILITY.
1762 finite_measure.\<mu>' -> measure
1763 product_algebra_generator -> prod_algebra
1764 product_prob_space.emb -> prod_emb
1765 product_prob_space.infprod_algebra -> PiM
1768 completeable_measure_space
1769 finite_measure_space
1771 finite_product_finite_prob_space
1772 finite_product_sigma_algebra
1773 finite_sigma_algebra
1775 pair_finite_prob_space
1776 pair_finite_sigma_algebra
1779 product_sigma_algebra
1783 distribution -> use distr measure, or distributed predicate
1785 joint_distribution -> use distr measure, or distributed predicate
1786 pair_measure_generator
1787 product_prob_space.infprod_algebra -> use PiM
1790 Replacement theorems:
1791 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1792 finite_measure.empty_measure -> measure_empty
1793 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1794 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1795 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1796 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1797 finite_measure.finite_measure -> finite_measure.emeasure_finite
1798 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1799 finite_measure.positive_measure' -> measure_nonneg
1800 finite_measure.real_measure -> finite_measure.emeasure_real
1801 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1802 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1803 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1804 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1805 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1806 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1807 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1808 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1809 information_space.entropy_commute -> information_space.entropy_commute_simple
1810 information_space.entropy_eq -> information_space.entropy_simple_distributed
1811 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1812 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1813 information_space.entropy_uniform_max -> information_space.entropy_uniform
1814 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1815 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1816 information_space.KL_ge_0 -> information_space.KL_nonneg
1817 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1818 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1819 Int_stable_cuboids -> Int_stable_atLeastAtMost
1820 Int_stable_product_algebra_generator -> positive_integral
1821 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1822 measure_space.additive -> emeasure_additive
1823 measure_space.AE_iff_null_set -> AE_iff_null
1824 measure_space.almost_everywhere_def -> eventually_ae_filter
1825 measure_space.almost_everywhere_vimage -> AE_distrD
1826 measure_space.continuity_from_above -> INF_emeasure_decseq
1827 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1828 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1829 measure_space.continuity_from_below -> SUP_emeasure_incseq
1830 measure_space_density -> emeasure_density
1831 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1832 measure_space.integrable_vimage -> integrable_distr
1833 measure_space.integral_translated_density -> integral_density
1834 measure_space.integral_vimage -> integral_distr
1835 measure_space.measure_additive -> plus_emeasure
1836 measure_space.measure_compl -> emeasure_compl
1837 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1838 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1839 measure_space.measure_decseq -> decseq_emeasure
1840 measure_space.measure_Diff -> emeasure_Diff
1841 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1842 measure_space.measure_eq_0 -> emeasure_eq_0
1843 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1844 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1845 measure_space.measure_incseq -> incseq_emeasure
1846 measure_space.measure_insert -> emeasure_insert
1847 measure_space.measure_mono -> emeasure_mono
1848 measure_space.measure_not_negative -> emeasure_not_MInf
1849 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1850 measure_space.measure_setsum -> setsum_emeasure
1851 measure_space.measure_setsum_split -> setsum_emeasure_cover
1852 measure_space.measure_space_vimage -> emeasure_distr
1853 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1854 measure_space.measure_subadditive -> subadditive
1855 measure_space.measure_top -> emeasure_space
1856 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1857 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1858 measure_space.positive_integral_translated_density -> positive_integral_density
1859 measure_space.positive_integral_vimage -> positive_integral_distr
1860 measure_space.real_continuity_from_above -> Lim_measure_decseq
1861 measure_space.real_continuity_from_below -> Lim_measure_incseq
1862 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1863 measure_space.real_measure_Diff -> measure_Diff
1864 measure_space.real_measure_finite_Union -> measure_finite_Union
1865 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1866 measure_space.real_measure_subadditive -> measure_subadditive
1867 measure_space.real_measure_Union -> measure_Union
1868 measure_space.real_measure_UNION -> measure_UNION
1869 measure_space.simple_function_vimage -> simple_function_comp
1870 measure_space.simple_integral_vimage -> simple_integral_distr
1871 measure_space.simple_integral_vimage -> simple_integral_distr
1872 measure_unique_Int_stable -> measure_eqI_generator_eq
1873 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1874 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1875 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1876 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1877 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1878 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1879 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1880 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1881 pair_sigma_algebra.sets_swap -> sets_pair_swap
1882 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1883 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1884 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1885 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1886 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1887 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1888 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1889 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1890 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1891 prob_space.prob_space_vimage -> prob_space_distr
1892 prob_space.random_variable_restrict -> measurable_restrict
1893 prob_space_unique_Int_stable -> measure_eqI_prob_space
1894 product_algebraE -> prod_algebraE_all
1895 product_algebra_generator_der -> prod_algebra_eq_finite
1896 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1897 product_algebraI -> sets_PiM_I_finite
1898 product_measure_exists -> product_sigma_finite.sigma_finite
1899 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1900 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1901 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1902 product_prob_space.measurable_component -> measurable_component_singleton
1903 product_prob_space.measurable_emb -> measurable_prod_emb
1904 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1905 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1906 product_prob_space.measure_emb -> emeasure_prod_emb
1907 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1908 product_sigma_algebra.product_algebra_into_space -> space_closed
1909 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1910 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1911 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1912 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1913 sets_product_algebra -> sets_PiM
1914 sigma_algebra.measurable_sigma -> measurable_measure_of
1915 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1916 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1917 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1918 space_product_algebra -> space_PiM
1920 * Session HOL-TPTP: support to parse and import TPTP problems (all
1921 languages) into Isabelle/HOL.
1926 * New "case_product" attribute (see HOL).
1931 * Greater support for structured proofs involving induction or case
1934 * Much greater use of mathematical symbols.
1936 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1941 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1942 from a minor keyword introduced via theory header declaration.
1944 * Antiquotation @{command_spec "name"} produces the
1945 Outer_Syntax.command_spec from a major keyword introduced via theory
1946 header declaration; it can be passed to Outer_Syntax.command etc.
1948 * Local_Theory.define no longer hard-wires default theorem name
1949 "foo_def", but retains the binding as given. If that is Binding.empty
1950 / Attrib.empty_binding, the result is not registered as user-level
1951 fact. The Local_Theory.define_internal variant allows to specify a
1952 non-empty name (used for the foundation in the background theory),
1953 while omitting the fact binding in the user-context. Potential
1954 INCOMPATIBILITY for derived definitional packages: need to specify
1955 naming policy for primitive definitions more explicitly.
1957 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1958 conformance with similar operations in structure Term and Logic.
1960 * Antiquotation @{attributes [...]} embeds attribute source
1961 representation into the ML text, which is particularly useful with
1962 declarations like Local_Theory.note.
1964 * Structure Proof_Context follows standard naming scheme. Old
1965 ProofContext has been discontinued. INCOMPATIBILITY.
1967 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1968 change of semantics: update is applied to auxiliary local theory
1971 * Modernized some old-style infix operations:
1973 addeqcongs ~> Simplifier.add_eqcong
1974 deleqcongs ~> Simplifier.del_eqcong
1975 addcongs ~> Simplifier.add_cong
1976 delcongs ~> Simplifier.del_cong
1977 setmksimps ~> Simplifier.set_mksimps
1978 setmkcong ~> Simplifier.set_mkcong
1979 setmksym ~> Simplifier.set_mksym
1980 setmkeqTrue ~> Simplifier.set_mkeqTrue
1981 settermless ~> Simplifier.set_termless
1982 setsubgoaler ~> Simplifier.set_subgoaler
1983 addsplits ~> Splitter.add_split
1984 delsplits ~> Splitter.del_split
1989 * USER_HOME settings variable points to cross-platform user home
1990 directory, which coincides with HOME on POSIX systems only. Likewise,
1991 the Isabelle path specification "~" now expands to $USER_HOME, instead
1992 of former $HOME. A different default for USER_HOME may be set
1993 explicitly in shell environment, before Isabelle settings are
1994 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1995 the generic user home was intended.
1997 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1998 notation, which is useful for the jEdit file browser, for example.
2000 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2005 New in Isabelle2011-1 (October 2011)
2006 ------------------------------------
2010 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2011 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2013 - Management of multiple theory files directly from the editor
2014 buffer store -- bypassing the file-system (no requirement to save
2015 files for checking).
2017 - Markup of formal entities within the text buffer, with semantic
2018 highlighting, tooltips and hyperlinks to jump to defining source
2021 - Improved text rendering, with sub/superscripts in the source
2022 buffer (including support for copy/paste wrt. output panel, HTML
2023 theory output and other non-Isabelle text boxes).
2025 - Refined scheduling of proof checking and printing of results,
2026 based on interactive editor view. (Note: jEdit folding and
2027 narrowing allows to restrict buffer perspectives explicitly.)
2029 - Reduced CPU performance requirements, usable on machines with few
2032 - Reduced memory requirements due to pruning of unused document
2033 versions (garbage collection).
2035 See also ~~/src/Tools/jEdit/README.html for further information,
2036 including some remaining limitations.
2038 * Theory loader: source files are exclusively located via the master
2039 directory of each theory node (where the .thy file itself resides).
2040 The global load path (such as src/HOL/Library) has been discontinued.
2041 Note that the path element ~~ may be used to reference theories in the
2042 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2045 * Theory loader: source files are identified by content via SHA1
2046 digests. Discontinued former path/modtime identification and optional
2047 ISABELLE_FILE_IDENT plugin scripts.
2049 * Parallelization of nested Isar proofs is subject to
2050 Goal.parallel_proofs_threshold (default 100). See also isabelle
2053 * Name space: former unsynchronized references are now proper
2054 configuration options, with more conventional names:
2056 long_names ~> names_long
2057 short_names ~> names_short
2058 unique_names ~> names_unique
2060 Minor INCOMPATIBILITY, need to declare options in context like this:
2062 declare [[names_unique = false]]
2064 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2065 that the result needs to be unique, which means fact specifications
2066 may have to be refined after enriching a proof context.
2068 * Attribute "case_names" has been refined: the assumptions in each case
2069 can be named now by following the case name with [name1 name2 ...].
2071 * Isabelle/Isar reference manual has been updated and extended:
2072 - "Synopsis" provides a catalog of main Isar language concepts.
2073 - Formal references in syntax diagrams, via @{rail} antiquotation.
2074 - Updated material from classic "ref" manual, notably about
2075 "Classical Reasoner".
2080 * Class bot and top require underlying partial order rather than
2081 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2083 * Class complete_lattice: generalized a couple of lemmas from sets;
2084 generalized theorems INF_cong and SUP_cong. New type classes for
2085 complete boolean algebras and complete linear orders. Lemmas
2086 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2087 class complete_linorder.
2089 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2090 Sup_fun_def, Inf_apply, Sup_apply.
2092 Removed redundant lemmas (the right hand side gives hints how to
2093 replace them for (metis ...), or (simp only: ...) proofs):
2095 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2096 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2097 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2098 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2099 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2100 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2101 Inter_def ~> INF_def, image_def
2102 Union_def ~> SUP_def, image_def
2103 INT_eq ~> INF_def, and image_def
2104 UN_eq ~> SUP_def, and image_def
2105 INF_subset ~> INF_superset_mono [OF _ order_refl]
2107 More consistent and comprehensive names:
2109 INTER_eq_Inter_image ~> INF_def
2110 UNION_eq_Union_image ~> SUP_def
2113 INF_leI ~> INF_lower
2114 INF_leI2 ~> INF_lower2
2115 le_INFI ~> INF_greatest
2116 le_SUPI ~> SUP_upper
2117 le_SUPI2 ~> SUP_upper2
2118 SUP_leI ~> SUP_least
2119 INFI_bool_eq ~> INF_bool_eq
2120 SUPR_bool_eq ~> SUP_bool_eq
2121 INFI_apply ~> INF_apply
2122 SUPR_apply ~> SUP_apply
2123 INTER_def ~> INTER_eq
2124 UNION_def ~> UNION_eq
2128 * Renamed theory Complete_Lattice to Complete_Lattices.
2131 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2132 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2133 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2134 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2136 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2137 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2138 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2141 * Added syntactic classes "inf" and "sup" for the respective
2142 constants. INCOMPATIBILITY: Changes in the argument order of the
2143 (mostly internal) locale predicates for some derived classes.
2145 * Theorem collections ball_simps and bex_simps do not contain theorems
2146 referring to UNION any longer; these have been moved to collection
2147 UN_ball_bex_simps. INCOMPATIBILITY.
2149 * Theory Archimedean_Field: floor now is defined as parameter of a
2150 separate type class floor_ceiling.
2152 * Theory Finite_Set: more coherent development of fold_set locales:
2154 locale fun_left_comm ~> locale comp_fun_commute
2155 locale fun_left_comm_idem ~> locale comp_fun_idem
2157 Both use point-free characterization; interpretation proofs may need
2158 adjustment. INCOMPATIBILITY.
2160 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2161 accordance with standard mathematical terminology. INCOMPATIBILITY.
2163 * Theory Complex_Main: The locale interpretations for the
2164 bounded_linear and bounded_bilinear locales have been removed, in
2165 order to reduce the number of duplicate lemmas. Users must use the
2166 original names for distributivity theorems, potential INCOMPATIBILITY.
2168 divide.add ~> add_divide_distrib
2169 divide.diff ~> diff_divide_distrib
2170 divide.setsum ~> setsum_divide_distrib
2171 mult.add_right ~> right_distrib
2172 mult.diff_right ~> right_diff_distrib
2173 mult_right.setsum ~> setsum_right_distrib
2174 mult_left.diff ~> left_diff_distrib
2176 * Theory Complex_Main: Several redundant theorems have been removed or
2177 replaced by more general versions. INCOMPATIBILITY.
2179 real_diff_def ~> minus_real_def
2180 real_divide_def ~> divide_real_def
2181 real_less_def ~> less_le
2182 real_abs_def ~> abs_real_def
2183 real_sgn_def ~> sgn_real_def
2184 real_mult_commute ~> mult_commute
2185 real_mult_assoc ~> mult_assoc
2186 real_mult_1 ~> mult_1_left
2187 real_add_mult_distrib ~> left_distrib
2188 real_zero_not_eq_one ~> zero_neq_one
2189 real_mult_inverse_left ~> left_inverse
2190 INVERSE_ZERO ~> inverse_zero
2191 real_le_refl ~> order_refl
2192 real_le_antisym ~> order_antisym
2193 real_le_trans ~> order_trans
2194 real_le_linear ~> linear
2195 real_le_eq_diff ~> le_iff_diff_le_0
2196 real_add_left_mono ~> add_left_mono
2197 real_mult_order ~> mult_pos_pos
2198 real_mult_less_mono2 ~> mult_strict_left_mono
2199 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2200 real_0_le_divide_iff ~> zero_le_divide_iff
2201 realpow_two_disj ~> power2_eq_iff
2202 real_squared_diff_one_factored ~> square_diff_one_factored
2203 realpow_two_diff ~> square_diff_square_factored
2204 reals_complete2 ~> complete_real
2205 real_sum_squared_expand ~> power2_sum
2206 exp_ln_eq ~> ln_unique
2208 expi_zero ~> exp_zero
2209 lemma_DERIV_subst ~> DERIV_cong
2210 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2211 LIMSEQ_const ~> tendsto_const
2212 LIMSEQ_norm ~> tendsto_norm
2213 LIMSEQ_add ~> tendsto_add
2214 LIMSEQ_minus ~> tendsto_minus
2215 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2216 LIMSEQ_diff ~> tendsto_diff
2217 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2218 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2219 LIMSEQ_mult ~> tendsto_mult
2220 LIMSEQ_inverse ~> tendsto_inverse
2221 LIMSEQ_divide ~> tendsto_divide
2222 LIMSEQ_pow ~> tendsto_power
2223 LIMSEQ_setsum ~> tendsto_setsum
2224 LIMSEQ_setprod ~> tendsto_setprod
2225 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2226 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2227 LIMSEQ_imp_rabs ~> tendsto_rabs
2228 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2229 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2230 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2231 LIMSEQ_Complex ~> tendsto_Complex
2232 LIM_ident ~> tendsto_ident_at
2233 LIM_const ~> tendsto_const
2234 LIM_add ~> tendsto_add
2235 LIM_add_zero ~> tendsto_add_zero
2236 LIM_minus ~> tendsto_minus
2237 LIM_diff ~> tendsto_diff
2238 LIM_norm ~> tendsto_norm
2239 LIM_norm_zero ~> tendsto_norm_zero
2240 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2241 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2242 LIM_rabs ~> tendsto_rabs
2243 LIM_rabs_zero ~> tendsto_rabs_zero
2244 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2245 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2246 LIM_compose ~> tendsto_compose
2247 LIM_mult ~> tendsto_mult
2248 LIM_scaleR ~> tendsto_scaleR
2249 LIM_of_real ~> tendsto_of_real
2250 LIM_power ~> tendsto_power
2251 LIM_inverse ~> tendsto_inverse
2252 LIM_sgn ~> tendsto_sgn
2253 isCont_LIM_compose ~> isCont_tendsto_compose
2254 bounded_linear.LIM ~> bounded_linear.tendsto
2255 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2256 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2257 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2258 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2259 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2260 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2262 * Theory Complex_Main: The definition of infinite series was
2263 generalized. Now it is defined on the type class {topological_space,
2264 comm_monoid_add}. Hence it is useable also for extended real numbers.
2266 * Theory Complex_Main: The complex exponential function "expi" is now
2267 a type-constrained abbreviation for "exp :: complex => complex"; thus
2268 several polymorphic lemmas about "exp" are now applicable to "expi".
2272 - Theory Library/Code_Char_ord provides native ordering of
2273 characters in the target language.
2275 - Commands code_module and code_library are legacy, use export_code
2278 - Method "evaluation" is legacy, use method "eval" instead.
2280 - Legacy evaluator "SML" is deactivated by default. May be
2281 reactivated by the following theory command:
2283 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2285 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2287 * New proof method "induction" that gives induction hypotheses the
2288 name "IH", thus distinguishing them from further hypotheses that come
2289 from rule induction. The latter are still called "hyps". Method
2290 "induction" is a thin wrapper around "induct" and follows the same
2293 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2294 still available as a legacy feature for some time.
2297 - Added "need" and "total_consts" options.
2298 - Reintroduced "show_skolems" option by popular demand.
2299 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2303 - Use quasi-sound (and efficient) translations by default.
2304 - Added support for the following provers: E-ToFoF, LEO-II,
2305 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2306 - Automatically preplay and minimize proofs before showing them if
2307 this can be done within reasonable time.
2308 - sledgehammer available_provers ~> sledgehammer supported_provers.
2310 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2311 "max_mono_iters", and "max_new_mono_instances" options.
2312 - Removed "explicit_apply" and "full_types" options as well as "Full
2313 Types" Proof General menu item. INCOMPATIBILITY.
2316 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2317 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2321 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2322 "elim:" options. INCOMPATIBILITY.
2323 - Introduced 'try' that not only runs 'try_methods' but also
2324 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2327 - Added "eval" option to evaluate terms for the found counterexample
2328 (currently only supported by the default (exhaustive) tester).
2329 - Added post-processing of terms to obtain readable counterexamples
2330 (currently only supported by the default (exhaustive) tester).
2331 - New counterexample generator quickcheck[narrowing] enables
2332 narrowing-based testing. Requires the Glasgow Haskell compiler
2333 with its installation location defined in the Isabelle settings
2334 environment as ISABELLE_GHC.
2335 - Removed quickcheck tester "SML" based on the SML code generator
2336 (formly in HOL/Library).
2338 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2339 use 'partial_function' instead.
2341 * Theory Library/Extended_Reals replaces now the positive extended
2342 reals found in probability theory. This file is extended by
2343 Multivariate_Analysis/Extended_Real_Limits.
2345 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2346 from where it must be imported explicitly if it is really required.
2349 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2350 been moved here. INCOMPATIBILITY.
2352 * Theory Library/Saturated provides type of numbers with saturated
2355 * Theory Library/Product_Lattice defines a pointwise ordering for the
2356 product type 'a * 'b, and provides instance proofs for various order
2357 and lattice type classes.
2359 * Theory Library/Countable now provides the "countable_datatype" proof
2360 method for proving "countable" class instances for datatypes.
2362 * Theory Library/Cset_Monad allows do notation for computable sets
2363 (cset) via the generic monad ad-hoc overloading facility.
2365 * Library: Theories of common data structures are split into theories
2366 for implementation, an invariant-ensuring type, and connection to an
2367 abstract type. INCOMPATIBILITY.
2369 - RBT is split into RBT and RBT_Mapping.
2370 - AssocList is split and renamed into AList and AList_Mapping.
2371 - DList is split into DList_Impl, DList, and DList_Cset.
2372 - Cset is split into Cset and List_Cset.
2374 * Theory Library/Nat_Infinity has been renamed to
2375 Library/Extended_Nat, with name changes of the following types and
2378 type inat ~> type enat
2380 Infty ~> infinity (overloaded)
2384 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2385 been renamed accordingly. INCOMPATIBILITY.
2387 * Session Multivariate_Analysis: The euclidean_space type class now
2388 fixes a constant "Basis :: 'a set" consisting of the standard
2389 orthonormal basis for the type. Users now have the option of
2390 quantifying over this set instead of using the "basis" function, e.g.
2391 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2393 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2394 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2395 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2396 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2397 changed to match. Definition theorems for overloaded constants now use
2398 the standard "foo_vec_def" naming scheme. A few other theorems have
2399 been renamed as follows (INCOMPATIBILITY):
2401 Cart_eq ~> vec_eq_iff
2402 dist_nth_le_cart ~> dist_vec_nth_le
2403 tendsto_vector ~> vec_tendstoI
2404 Cauchy_vector ~> vec_CauchyI
2406 * Session Multivariate_Analysis: Several duplicate theorems have been
2407 removed, and other theorems have been renamed or replaced with more
2408 general versions. INCOMPATIBILITY.
2410 finite_choice ~> finite_set_choice
2411 eventually_conjI ~> eventually_conj
2412 eventually_and ~> eventually_conj_iff
2413 eventually_false ~> eventually_False
2414 setsum_norm ~> norm_setsum
2415 Lim_sequentially ~> LIMSEQ_def
2416 Lim_ident_at ~> LIM_ident
2417 Lim_const ~> tendsto_const
2418 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2419 Lim_neg ~> tendsto_minus
2420 Lim_add ~> tendsto_add
2421 Lim_sub ~> tendsto_diff
2422 Lim_mul ~> tendsto_scaleR
2423 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2424 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2425 Lim_linear ~> bounded_linear.tendsto
2426 Lim_component ~> tendsto_euclidean_component
2427 Lim_component_cart ~> tendsto_vec_nth
2428 Lim_inner ~> tendsto_inner [OF tendsto_const]
2429 dot_lsum ~> inner_setsum_left
2430 dot_rsum ~> inner_setsum_right
2431 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2432 continuous_neg ~> continuous_minus
2433 continuous_sub ~> continuous_diff
2434 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2435 continuous_mul ~> continuous_scaleR
2436 continuous_inv ~> continuous_inverse
2437 continuous_at_within_inv ~> continuous_at_within_inverse
2438 continuous_at_inv ~> continuous_at_inverse
2439 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2440 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2441 continuous_at_component ~> continuous_component [OF continuous_at_id]
2442 continuous_on_neg ~> continuous_on_minus
2443 continuous_on_sub ~> continuous_on_diff
2444 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2445 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2446 continuous_on_mul ~> continuous_on_scaleR
2447 continuous_on_mul_real ~> continuous_on_mult
2448 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2449 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2450 continuous_on_inverse ~> continuous_on_inv
2451 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2452 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2453 subset_interior ~> interior_mono
2454 subset_closure ~> closure_mono
2455 closure_univ ~> closure_UNIV
2456 real_arch_lt ~> reals_Archimedean2
2457 real_arch ~> reals_Archimedean3
2458 real_abs_norm ~> abs_norm_cancel
2459 real_abs_sub_norm ~> norm_triangle_ineq3
2460 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2462 * Session HOL-Probability:
2463 - Caratheodory's extension lemma is now proved for ring_of_sets.
2464 - Infinite products of probability measures are now available.
2465 - Sigma closure is independent, if the generator is independent
2466 - Use extended reals instead of positive extended
2467 reals. INCOMPATIBILITY.
2469 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2471 expand_fun_below ~> fun_below_iff
2472 below_fun_ext ~> fun_belowI
2473 expand_cfun_eq ~> cfun_eq_iff
2474 ext_cfun ~> cfun_eqI
2475 expand_cfun_below ~> cfun_below_iff
2476 below_cfun_ext ~> cfun_belowI
2477 monofun_fun_fun ~> fun_belowD
2478 monofun_fun_arg ~> monofunE
2479 monofun_lub_fun ~> adm_monofun [THEN admD]
2480 cont_lub_fun ~> adm_cont [THEN admD]
2481 cont2cont_Rep_CFun ~> cont2cont_APP
2482 cont_Rep_CFun_app ~> cont_APP_app
2483 cont_Rep_CFun_app_app ~> cont_APP_app_app
2484 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2485 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2486 contlub_cfun ~> lub_APP [symmetric]
2487 contlub_LAM ~> lub_LAM [symmetric]
2490 lift_distinct1 ~> lift.distinct(1)
2491 lift_distinct2 ~> lift.distinct(2)
2492 Def_not_UU ~> lift.distinct(2)
2493 Def_inject ~> lift.inject
2494 below_UU_iff ~> below_bottom_iff
2495 eq_UU_iff ~> eq_bottom_iff
2498 *** Document preparation ***
2500 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2501 isar-ref manual, both for description and actual application of the
2504 * Antiquotation @{value} evaluates the given term and presents its
2507 * Antiquotations: term style "isub" provides ad-hoc conversion of
2508 variables x1, y23 into subscripted form x\<^isub>1,
2509 y\<^isub>2\<^isub>3.
2511 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2512 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2514 * Localized \isabellestyle switch can be used within blocks or groups
2517 \isabellestyle{it} %preferred default
2518 {\isabellestylett @{text "typewriter stuff"}}
2520 * Discontinued special treatment of hard tabulators. Implicit
2521 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2527 * The inner syntax of sort/type/term/prop supports inlined YXML
2528 representations within quoted string tokens. By encoding logical
2529 entities via Term_XML (in ML or Scala) concrete syntax can be
2530 bypassed, which is particularly useful for producing bits of text
2531 under external program control.
2533 * Antiquotations for ML and document preparation are managed as theory
2534 data, which requires explicit setup.
2536 * Isabelle_Process.is_active allows tools to check if the official
2537 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2538 (better known as Proof General).
2540 * Structure Proof_Context follows standard naming scheme. Old
2541 ProofContext is still available for some time as legacy alias.
2543 * Structure Timing provides various operations for timing; supersedes
2544 former start_timing/end_timing etc.
2546 * Path.print is the official way to show file-system paths to users
2547 (including quotes etc.).
2549 * Inner syntax: identifiers in parse trees of generic categories
2550 "logic", "aprop", "idt" etc. carry position information (disguised as
2551 type constraints). Occasional INCOMPATIBILITY with non-compliant
2552 translations that choke on unexpected type constraints. Positions can
2553 be stripped in ML translations via Syntax.strip_positions /
2554 Syntax.strip_positions_ast, or via the syntax constant
2555 "_strip_positions" within parse trees. As last resort, positions can
2556 be disabled via the configuration option Syntax.positions, which is
2557 called "syntax_positions" in Isar attribute syntax.
2559 * Discontinued special status of various ML structures that contribute
2560 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2561 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2562 refer directly to Ast.Constant, Lexicon.is_identifier,
2563 Syntax_Trans.mk_binder_tr etc.
2565 * Typed print translation: discontinued show_sorts argument, which is
2566 already available via context of "advanced" translation.
2568 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2569 goal states; body tactic needs to address all subgoals uniformly.
2571 * Slightly more special eq_list/eq_set, with shortcut involving
2572 pointer equality (assumes that eq relation is reflexive).
2574 * Classical tactics use proper Proof.context instead of historic types
2575 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2576 operate directly on Proof.context. Raw type claset retains its use as
2577 snapshot of the classical context, which can be recovered via
2578 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2579 INCOMPATIBILITY, classical tactics and derived proof methods require
2580 proper Proof.context.
2585 * Discontinued support for Poly/ML 5.2, which was the last version
2586 without proper multithreading and TimeLimit implementation.
2588 * Discontinued old lib/scripts/polyml-platform, which has been
2589 obsolete since Isabelle2009-2.
2591 * Various optional external tools are referenced more robustly and
2592 uniformly by explicit Isabelle settings as follows:
2594 ISABELLE_CSDP (formerly CSDP_EXE)
2595 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2596 ISABELLE_OCAML (formerly EXEC_OCAML)
2597 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2598 ISABELLE_YAP (formerly EXEC_YAP)
2600 Note that automated detection from the file-system or search path has
2601 been discontinued. INCOMPATIBILITY.
2603 * Scala layer provides JVM method invocation service for static
2604 methods of type (String)String, see Invoke_Scala.method in ML. For
2607 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2609 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2610 this allows to pass structured values between ML and Scala.
2612 * The IsabelleText fonts includes some further glyphs to support the
2613 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2614 installed a local copy (which is normally *not* required) need to
2615 delete or update it from ~~/lib/fonts/.
2619 New in Isabelle2011 (January 2011)
2620 ----------------------------------
2624 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2625 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2626 useful tooltips and hyperlinks produced from its static analysis. The
2627 bundled component provides an executable Isabelle tool that can be run
2630 Isabelle2011/bin/isabelle jedit
2632 * Significantly improved Isabelle/Isar implementation manual.
2634 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2635 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2636 while the default heap location within that directory lacks that extra
2637 suffix. This isolates multiple Isabelle installations from each
2638 other, avoiding problems with old settings in new versions.
2639 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2641 * Source files are always encoded as UTF-8, instead of old-fashioned
2642 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2643 the following package declarations:
2645 \usepackage[utf8]{inputenc}
2646 \usepackage{textcomp}
2648 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2649 a Unicode character is treated as a single symbol, not a sequence of
2650 non-ASCII bytes as before. Since Isabelle/ML string literals may
2651 contain symbols without further backslash escapes, Unicode can now be
2652 used here as well. Recall that Symbol.explode in ML provides a
2653 consistent view on symbols, while raw explode (or String.explode)
2654 merely give a byte-oriented representation.
2656 * Theory loader: source files are primarily located via the master
2657 directory of each theory node (where the .thy file itself resides).
2658 The global load path is still partially available as legacy feature.
2659 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2660 explicit paths, relatively to the theory.
2662 * Special treatment of ML file names has been discontinued.
2663 Historically, optional extensions .ML or .sml were added on demand --
2664 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2665 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2667 * Various options that affect pretty printing etc. are now properly
2668 handled within the context via configuration options, instead of
2669 unsynchronized references or print modes. There are both ML Config.T
2670 entities and Isar declaration attributes to access these.
2672 ML (Config.T) Isar (attribute)
2674 eta_contract eta_contract
2675 show_brackets show_brackets
2676 show_sorts show_sorts
2677 show_types show_types
2678 show_question_marks show_question_marks
2679 show_consts show_consts
2680 show_abbrevs show_abbrevs
2682 Syntax.ast_trace syntax_ast_trace
2683 Syntax.ast_stat syntax_ast_stat
2684 Syntax.ambiguity_level syntax_ambiguity_level
2686 Goal_Display.goals_limit goals_limit
2687 Goal_Display.show_main_goal show_main_goal
2689 Method.rule_trace rule_trace
2691 Thy_Output.display thy_output_display
2692 Thy_Output.quotes thy_output_quotes
2693 Thy_Output.indent thy_output_indent
2694 Thy_Output.source thy_output_source
2695 Thy_Output.break thy_output_break
2697 Note that corresponding "..._default" references in ML may only be
2698 changed globally at the ROOT session setup, but *not* within a theory.
2699 The option "show_abbrevs" supersedes the former print mode
2700 "no_abbrevs" with inverted meaning.
2702 * More systematic naming of some configuration options.
2705 trace_simp ~> simp_trace
2706 debug_simp ~> simp_debug
2708 * Support for real valued configuration options, using simplistic
2709 floating-point notation that coincides with the inner syntax for
2712 * Support for real valued preferences (with approximative PGIP type):
2713 front-ends need to accept "pgint" values in float notation.
2716 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2719 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2724 * Command 'type_synonym' (with single argument) replaces somewhat
2725 outdated 'types', which is still available as legacy feature for some
2728 * Command 'nonterminal' (with 'and' separated list of arguments)
2729 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2731 * Command 'notepad' replaces former 'example_proof' for
2732 experimentation in Isar without any result. INCOMPATIBILITY.
2734 * Locale interpretation commands 'interpret' and 'sublocale' accept
2735 lists of equations to map definitions in a locale to appropriate
2736 entities in the context of the interpretation. The 'interpretation'
2737 command already provided this functionality.
2739 * Diagnostic command 'print_dependencies' prints the locale instances
2740 that would be activated if the specified expression was interpreted in
2741 the current context. Variant "print_dependencies!" assumes a context
2742 without interpretations.
2744 * Diagnostic command 'print_interps' prints interpretations in proofs
2745 in addition to interpretations in theories.
2747 * Discontinued obsolete 'global' and 'local' commands to manipulate
2748 the theory name space. Rare INCOMPATIBILITY. The ML functions
2749 Sign.root_path and Sign.local_path may be applied directly where this
2750 feature is still required for historical reasons.
2752 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2753 'definition' instead.
2755 * The "prems" fact, which refers to the accidental collection of
2756 foundational premises in the context, is now explicitly marked as
2757 legacy feature and will be discontinued soon. Consider using "assms"
2758 of the head statement or reference facts by explicit names.
2760 * Document antiquotations @{class} and @{type} print classes and type
2763 * Document antiquotation @{file} checks file/directory entries within
2764 the local file system.
2769 * Coercive subtyping: functions can be declared as coercions and type
2770 inference will add them as necessary upon input of a term. Theory
2771 Complex_Main declares real :: nat => real and real :: int => real as
2772 coercions. A coercion function f is declared like this:
2774 declare [[coercion f]]
2776 To lift coercions through type constructors (e.g. from nat => real to
2777 nat list => real list), map functions can be declared, e.g.
2779 declare [[coercion_map map]]
2781 Currently coercion inference is activated only in theories including
2782 real numbers, i.e. descendants of Complex_Main. This is controlled by
2783 the configuration option "coercion_enabled", e.g. it can be enabled in
2784 other theories like this:
2786 declare [[coercion_enabled]]
2788 * Command 'partial_function' provides basic support for recursive
2789 function definitions over complete partial orders. Concrete instances
2790 are provided for i) the option type, ii) tail recursion on arbitrary
2791 types, and iii) the heap monad of Imperative_HOL. See
2792 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2795 * Function package: f.psimps rules are no longer implicitly declared
2796 as [simp]. INCOMPATIBILITY.
2798 * Datatype package: theorems generated for executable equality (class
2799 "eq") carry proper names and are treated as default code equations.
2801 * Inductive package: now offers command 'inductive_simps' to
2802 automatically derive instantiated and simplified equations for
2803 inductive predicates, similar to 'inductive_cases'.
2805 * Command 'enriched_type' allows to register properties of the
2806 functorial structure of types.
2808 * Improved infrastructure for term evaluation using code generator
2809 techniques, in particular static evaluation conversions.
2811 * Code generator: Scala (2.8 or higher) has been added to the target
2814 * Code generator: globbing constant expressions "*" and "Theory.*"
2815 have been replaced by the more idiomatic "_" and "Theory._".
2818 * Code generator: export_code without explicit file declaration prints
2819 to standard output. INCOMPATIBILITY.
2821 * Code generator: do not print function definitions for case
2822 combinators any longer.
2824 * Code generator: simplification with rules determined with
2825 src/Tools/Code/code_simp.ML and method "code_simp".
2827 * Code generator for records: more idiomatic representation of record
2828 types. Warning: records are not covered by ancient SML code
2829 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2830 rep_datatype declaration helps to succeed then:
2834 rep_datatype foo_ext ...
2836 * Records: logical foundation type for records does not carry a
2837 '_type' suffix any longer (obsolete due to authentic syntax).
2840 * Quickcheck now by default uses exhaustive testing instead of random
2841 testing. Random testing can be invoked by "quickcheck [random]",
2842 exhaustive testing by "quickcheck [exhaustive]".
2844 * Quickcheck instantiates polymorphic types with small finite
2845 datatypes by default. This enables a simple execution mechanism to
2846 handle quantifiers and function equality over the finite datatypes.
2848 * Quickcheck random generator has been renamed from "code" to
2849 "random". INCOMPATIBILITY.
2851 * Quickcheck now has a configurable time limit which is set to 30
2852 seconds by default. This can be changed by adding [timeout = n] to the
2853 quickcheck command. The time limit for Auto Quickcheck is still set
2856 * Quickcheck in locales considers interpretations of that locale for
2857 counter example search.
2860 - Added "smt" and "remote_smt" provers based on the "smt" proof
2861 method. See the Sledgehammer manual for details ("isabelle doc
2864 sledgehammer atp_info ~> sledgehammer running_provers
2865 sledgehammer atp_kill ~> sledgehammer kill_provers
2866 sledgehammer available_atps ~> sledgehammer available_provers
2869 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2870 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2871 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2872 (and "ms" and "min" are no longer supported)
2877 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2878 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2880 - Added support for partial quotient types.
2881 - Added local versions of the "Nitpick.register_xxx" functions.
2882 - Added "whack" option.
2883 - Allow registration of quotient types as codatatypes.
2884 - Improved "merge_type_vars" option to merge more types.
2885 - Removed unsound "fast_descrs" option.
2886 - Added custom symmetry breaking for datatypes, making it possible to reach
2887 higher cardinalities.
2888 - Prevent the expansion of too large definitions.
2890 * Proof methods "metis" and "meson" now have configuration options
2891 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2892 to diagnose these tools. E.g.
2894 using [[metis_trace = true]]
2896 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2897 manually as command 'solve_direct'.
2899 * The default SMT solver Z3 must be enabled explicitly (due to
2900 licensing issues) by setting the environment variable
2901 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2902 commercial applications, the SMT solver CVC3 is provided as fall-back;
2903 changing the SMT solver is done via the configuration option
2906 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2907 i.e. "remote_cvc3" and "remote_z3".
2909 * Added basic SMT support for datatypes, records, and typedefs using
2910 the oracle mode (no proofs). Direct support of pairs has been dropped
2911 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2912 support for a similar behavior). Minor INCOMPATIBILITY.
2914 * Changed SMT configuration options:
2916 z3_proofs ~> smt_oracle (with inverted meaning)
2917 z3_trace_assms ~> smt_trace_used_facts
2930 * Boogie output files (.b2i files) need to be declared in the theory
2933 * Simplification procedure "list_to_set_comprehension" rewrites list
2934 comprehensions applied to List.set to set comprehensions. Occasional
2935 INCOMPATIBILITY, may be deactivated like this:
2937 declare [[simproc del: list_to_set_comprehension]]
2939 * Removed old version of primrec package. INCOMPATIBILITY.
2941 * Removed simplifier congruence rule of "prod_case", as has for long
2942 been the case with "split". INCOMPATIBILITY.
2944 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2946 * Removed [split_format ... and ... and ...] version of
2947 [split_format]. Potential INCOMPATIBILITY.
2949 * Predicate "sorted" now defined inductively, with nice induction
2950 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2952 * Constant "contents" renamed to "the_elem", to free the generic name
2953 contents for other uses. INCOMPATIBILITY.
2955 * Renamed class eq and constant eq (for code generation) to class
2956 equal and constant equal, plus renaming of related facts and various
2957 tuning. INCOMPATIBILITY.
2959 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2961 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2964 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2965 avoid confusion with finite sets. INCOMPATIBILITY.
2967 * Abandoned locales equiv, congruent and congruent2 for equivalence
2968 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2971 * Some previously unqualified names have been qualified:
2978 Trueprop ~> HOL.Trueprop
2983 op --> ~> HOL.implies
2995 Pair ~> Product_Type.Pair
2996 fst ~> Product_Type.fst
2997 snd ~> Product_Type.snd
2998 curry ~> Product_Type.curry
3000 Collect ~> Set.Collect
3004 * More canonical naming convention for some fundamental definitions:
3006 bot_bool_eq ~> bot_bool_def
3007 top_bool_eq ~> top_bool_def
3008 inf_bool_eq ~> inf_bool_def
3009 sup_bool_eq ~> sup_bool_def
3010 bot_fun_eq ~> bot_fun_def
3011 top_fun_eq ~> top_fun_def
3012 inf_fun_eq ~> inf_fun_def
3013 sup_fun_eq ~> sup_fun_def
3017 * More stylized fact names:
3019 expand_fun_eq ~> fun_eq_iff
3020 expand_set_eq ~> set_eq_iff
3022 nat_number ~> eval_nat_numeral
3026 * Refactoring of code-generation specific operations in theory List:
3032 mem_iff ~> member_def
3033 null_empty ~> null_def
3035 INCOMPATIBILITY. Note that these were not supposed to be used
3036 regularly unless for striking reasons; their main purpose was code
3039 Various operations from the Haskell prelude are used for generating
3042 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3043 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3044 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3046 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3047 "*" and "+" respectively. INCOMPATIBILITY.
3049 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3050 "Sum_Type.Plus" instead.
3052 * Constant "split" has been merged with constant "prod_case"; names of
3053 ML functions, facts etc. involving split have been retained so far,
3054 though. INCOMPATIBILITY.
3056 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3057 instead. INCOMPATIBILITY.
3059 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3062 * Former theory Library/Enum is now part of the HOL-Main image.
3063 INCOMPATIBILITY: all constants of the Enum theory now have to be
3064 referred to by its qualified name.
3067 nlists ~> Enum.nlists
3068 product ~> Enum.product
3070 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3071 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3074 * Theory Library/SetsAndFunctions has been split into
3075 Library/Function_Algebras and Library/Set_Algebras; canonical names
3076 for instance definitions for functions; various improvements.
3079 * Theory Library/Multiset provides stable quicksort implementation of
3082 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3085 * Session Multivariate_Analysis: introduced a type class for euclidean
3086 space. Most theorems are now stated in terms of euclidean spaces
3087 instead of finite cartesian products.
3090 real ^ 'n ~> 'a::real_vector
3091 ~> 'a::euclidean_space
3092 ~> 'a::ordered_euclidean_space
3093 (depends on your needs)
3097 \<chi> x. _ ~> \<chi>\<chi> x. _
3100 Also note that the indices are now natural numbers and not from some
3101 finite type. Finite cartesian products of euclidean spaces, products
3102 of euclidean spaces the real and complex numbers are instantiated to
3103 be euclidean_spaces. INCOMPATIBILITY.
3105 * Session Probability: introduced pextreal as positive extended real
3106 numbers. Use pextreal as value for measures. Introduce the
3107 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3108 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3109 the integral in Multivariate Analysis. INCOMPATIBILITY.
3111 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3114 * Session SPARK (with image HOL-SPARK) provides commands to load and
3115 prove verification conditions generated by the SPARK Ada program
3116 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3121 * Theorems for additive ring operations (locale abelian_monoid and
3122 descendants) are generated by interpretation from their multiplicative
3123 counterparts. Names (in particular theorem names) have the mandatory
3124 qualifier 'add'. Previous theorem names are redeclared for
3127 * Structure "int_ring" is now an abbreviation (previously a
3128 definition). This fits more natural with advanced interpretations.
3133 * The domain package now runs in definitional mode by default: The
3134 former command 'new_domain' is now called 'domain'. To use the domain
3135 package in its original axiomatic mode, use 'domain (unsafe)'.
3138 * The new class "domain" is now the default sort. Class "predomain"
3139 is an unpointed version of "domain". Theories can be updated by
3140 replacing sort annotations as shown below. INCOMPATIBILITY.
3142 'a::type ~> 'a::countable
3143 'a::cpo ~> 'a::predomain
3144 'a::pcpo ~> 'a::domain
3146 * The old type class "rep" has been superseded by class "domain".
3147 Accordingly, users of the definitional package must remove any
3148 "default_sort rep" declarations. INCOMPATIBILITY.
3150 * The domain package (definitional mode) now supports unpointed
3151 predomain argument types, as long as they are marked 'lazy'. (Strict
3152 arguments must be in class "domain".) For example, the following
3153 domain definition now works:
3155 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3157 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3158 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3159 'a option, and 'a list. Additionally, it configures fixrec and the
3160 domain package to work with these types. For example:
3162 fixrec isInl :: "('a + 'b) u -> tr"
3163 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3165 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3167 * The "(permissive)" option of fixrec has been replaced with a
3168 per-equation "(unchecked)" option. See
3169 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3171 * The "bifinite" class no longer fixes a constant "approx"; the class
3172 now just asserts that such a function exists. INCOMPATIBILITY.
3174 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3175 defines an embedding of type 'a defl into udom by default; instances
3176 of "bifinite" and "domain" classes are available in
3177 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3179 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3181 * The predicate "directed" has been removed. INCOMPATIBILITY.
3183 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3185 * The function "cprod_map" has been renamed to "prod_map".
3188 * The monadic bind operator on each powerdomain has new binder syntax
3189 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3190 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3192 * The infix syntax for binary union on each powerdomain has changed
3193 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3194 syntax. INCOMPATIBILITY.
3196 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3197 still supported as an input translation.
3199 * Renamed some theorems (the original names are also still available).
3201 expand_fun_below ~> fun_below_iff
3202 below_fun_ext ~> fun_belowI
3203 expand_cfun_eq ~> cfun_eq_iff
3204 ext_cfun ~> cfun_eqI
3205 expand_cfun_below ~> cfun_below_iff
3206 below_cfun_ext ~> cfun_belowI
3207 cont2cont_Rep_CFun ~> cont2cont_APP
3209 * The Abs and Rep functions for various types have changed names.
3210 Related theorem names have also changed to match. INCOMPATIBILITY.
3212 Rep_CFun ~> Rep_cfun
3213 Abs_CFun ~> Abs_cfun
3214 Rep_Sprod ~> Rep_sprod
3215 Abs_Sprod ~> Abs_sprod
3216 Rep_Ssum ~> Rep_ssum
3217 Abs_Ssum ~> Abs_ssum
3219 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3220 been renamed to *_bottom_iff. INCOMPATIBILITY.
3222 * Various changes to bisimulation/coinduction with domain package:
3224 - Definitions of "bisim" constants no longer mention definedness.
3225 - With mutual recursion, "bisim" predicate is now curried.
3226 - With mutual recursion, each type gets a separate coind theorem.
3227 - Variable names in bisim_def and coinduct rules have changed.
3231 * Case combinators generated by the domain package for type "foo" are
3232 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3234 * Several theorems have been renamed to more accurately reflect the
3235 names of constants and types involved. INCOMPATIBILITY.
3237 thelub_const ~> lub_const
3238 lub_const ~> is_lub_const
3240 is_lub_lub ~> is_lubD2
3242 unique_lub ~> is_lub_unique
3243 is_ub_lub ~> is_lub_rangeD1
3244 lub_bin_chain ~> is_lub_bin_chain
3245 lub_fun ~> is_lub_fun
3246 thelub_fun ~> lub_fun
3247 thelub_cfun ~> lub_cfun
3248 thelub_Pair ~> lub_Pair
3249 lub_cprod ~> is_lub_prod
3250 thelub_cprod ~> lub_prod
3251 minimal_cprod ~> minimal_prod
3252 inst_cprod_pcpo ~> inst_prod_pcpo
3254 compact_UU ~> compact_bottom
3255 deflation_UU ~> deflation_bottom
3256 finite_deflation_UU ~> finite_deflation_bottom
3258 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3260 sq_ord_less_eq_trans ~> below_eq_trans
3261 sq_ord_eq_less_trans ~> eq_below_trans
3262 refl_less ~> below_refl
3263 trans_less ~> below_trans
3264 antisym_less ~> below_antisym
3265 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3266 box_less ~> box_below
3267 rev_trans_less ~> rev_below_trans
3268 not_less2not_eq ~> not_below2not_eq
3269 less_UU_iff ~> below_UU_iff
3270 flat_less_iff ~> flat_below_iff
3271 adm_less ~> adm_below
3272 adm_not_less ~> adm_not_below
3273 adm_compact_not_less ~> adm_compact_not_below
3274 less_fun_def ~> below_fun_def
3275 expand_fun_less ~> fun_below_iff
3276 less_fun_ext ~> fun_belowI
3277 less_discr_def ~> below_discr_def
3278 discr_less_eq ~> discr_below_eq
3279 less_unit_def ~> below_unit_def
3280 less_cprod_def ~> below_prod_def
3281 prod_lessI ~> prod_belowI
3282 Pair_less_iff ~> Pair_below_iff
3283 fst_less_iff ~> fst_below_iff
3284 snd_less_iff ~> snd_below_iff
3285 expand_cfun_less ~> cfun_below_iff
3286 less_cfun_ext ~> cfun_belowI
3287 injection_less ~> injection_below
3288 less_up_def ~> below_up_def
3289 not_Iup_less ~> not_Iup_below
3290 Iup_less ~> Iup_below
3292 Def_inject_less_eq ~> Def_below_Def
3293 Def_less_is_eq ~> Def_below_iff
3294 spair_less_iff ~> spair_below_iff
3295 less_sprod ~> below_sprod
3296 spair_less ~> spair_below
3297 sfst_less_iff ~> sfst_below_iff
3298 ssnd_less_iff ~> ssnd_below_iff
3299 fix_least_less ~> fix_least_below
3300 dist_less_one ~> dist_below_one
3301 less_ONE ~> below_ONE
3302 ONE_less_iff ~> ONE_below_iff
3303 less_sinlD ~> below_sinlD
3304 less_sinrD ~> below_sinrD
3309 * All constant names are now qualified internally and use proper
3310 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3315 * Antiquotation @{assert} inlines a function bool -> unit that raises
3316 Fail if the argument is false. Due to inlining the source position of
3317 failed assertions is included in the error output.
3319 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3320 text is in practice always evaluated with a stable theory checkpoint.
3321 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3323 * Antiquotation @{theory A} refers to theory A from the ancestry of
3324 the current context, not any accidental theory loader state as before.
3325 Potential INCOMPATIBILITY, subtle change in semantics.
3327 * Syntax.pretty_priority (default 0) configures the required priority
3328 of pretty-printed output and thus affects insertion of parentheses.
3330 * Syntax.default_root (default "any") configures the inner syntax
3331 category (nonterminal symbol) for parsing of terms.
3333 * Former exception Library.UnequalLengths now coincides with
3334 ListPair.UnequalLengths.
3336 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3337 main functionality is provided by structure Simplifier.
3339 * Renamed raw "explode" function to "raw_explode" to emphasize its
3340 meaning. Note that internally to Isabelle, Symbol.explode is used in
3341 almost all situations.
3343 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3344 See implementation manual for further details on exceptions in
3347 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3350 * Renamed structure PureThy to Pure_Thy and moved most of its
3351 operations to structure Global_Theory, to emphasize that this is
3352 rarely-used global-only stuff.
3354 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3355 instead (or tracing for high-volume output).
3357 * Configuration option show_question_marks only affects regular pretty
3358 printing of types and terms, not raw Term.string_of_vname.
3360 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3361 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3362 @{thms} for most purposes.
3364 * ML structure Unsynchronized is never opened, not even in Isar
3365 interaction mode as before. Old Unsynchronized.set etc. have been
3366 discontinued -- use plain := instead. This should be *rare* anyway,
3367 since modern tools always work via official context data, notably
3368 configuration options.
3370 * Parallel and asynchronous execution requires special care concerning
3371 interrupts. Structure Exn provides some convenience functions that
3372 avoid working directly with raw Interrupt. User code must not absorb
3373 interrupts -- intermediate handling (for cleanup etc.) needs to be
3374 followed by re-raising of the original exception. Another common
3375 source of mistakes are "handle _" patterns, which make the meaning of
3376 the program subject to physical effects of the environment.
3380 New in Isabelle2009-2 (June 2010)
3381 ---------------------------------
3385 * Authentic syntax for *all* logical entities (type classes, type
3386 constructors, term constants): provides simple and robust
3387 correspondence between formal entities and concrete syntax. Within
3388 the parse tree / AST representations, "constants" are decorated by
3389 their category (class, type, const) and spelled out explicitly with
3390 their full internal name.
3392 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3393 and translations (translation rules and translation functions in ML).
3394 Some hints on upgrading:
3396 - Many existing uses of 'syntax' and 'translations' can be replaced
3397 by more modern 'type_notation', 'notation' and 'abbreviation',
3398 which are independent of this issue.
3400 - 'translations' require markup within the AST; the term syntax
3401 provides the following special forms:
3403 CONST c -- produces syntax version of constant c from context
3404 XCONST c -- literally c, checked as constant from context
3405 c -- literally c, if declared by 'syntax'
3407 Plain identifiers are treated as AST variables -- occasionally the
3408 system indicates accidental variables via the error "rhs contains
3411 Type classes and type constructors are marked according to their
3412 concrete syntax. Some old translations rules need to be written
3413 for the "type" category, using type constructor application
3414 instead of pseudo-term application of the default category
3417 - 'parse_translation' etc. in ML may use the following
3420 @{class_syntax c} -- type class c within parse tree / AST
3421 @{term_syntax c} -- type constructor c within parse tree / AST
3422 @{const_syntax c} -- ML version of "CONST c" above
3423 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3425 - Literal types within 'typed_print_translations', i.e. those *not*
3426 represented as pseudo-terms are represented verbatim. Use @{class
3427 c} or @{type_name c} here instead of the above syntax
3430 Note that old non-authentic syntax was based on unqualified base
3431 names, so all of the above "constant" names would coincide. Recall
3432 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3433 diagnose syntax problems.
3435 * Type constructors admit general mixfix syntax, not just infix.
3437 * Concrete syntax may be attached to local entities without a proof
3438 body, too. This works via regular mixfix annotations for 'fix',
3439 'def', 'obtain' etc. or via the explicit 'write' command, which is
3440 similar to the 'notation' command in theory specifications.
3442 * Discontinued unnamed infix syntax (legacy feature for many years) --
3443 need to specify constant name and syntax separately. Internal ML
3444 datatype constructors have been renamed from InfixName to Infix etc.
3445 Minor INCOMPATIBILITY.
3447 * Schematic theorem statements need to be explicitly markup as such,
3448 via commands 'schematic_lemma', 'schematic_theorem',
3449 'schematic_corollary'. Thus the relevance of the proof is made
3450 syntactically clear, which impacts performance in a parallel or
3451 asynchronous interactive environment. Minor INCOMPATIBILITY.
3453 * Use of cumulative prems via "!" in some proof methods has been
3454 discontinued (old legacy feature).
3456 * References 'trace_simp' and 'debug_simp' have been replaced by
3457 configuration options stored in the context. Enabling tracing (the
3458 case of debugging is similar) in proofs works via
3460 using [[trace_simp = true]]
3462 Tracing is then active for all invocations of the simplifier in
3463 subsequent goal refinement steps. Tracing may also still be enabled or
3464 disabled via the ProofGeneral settings menu.
3466 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3467 'hide_fact' replace the former 'hide' KIND command. Minor
3470 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3471 more efficient than combinations with -q1 or -q2.
3476 * Proofterms record type-class reasoning explicitly, using the
3477 "unconstrain" operation internally. This eliminates all sort
3478 constraints from a theorem and proof, introducing explicit
3479 OFCLASS-premises. On the proof term level, this operation is
3480 automatically applied at theorem boundaries, such that closed proofs
3481 are always free of sort constraints. INCOMPATIBILITY for tools that
3482 inspect proof terms.
3484 * Local theory specifications may depend on extra type variables that
3485 are not present in the result type -- arguments TYPE('a) :: 'a itself
3486 are added internally. For example:
3488 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3490 * Predicates of locales introduced by classes carry a mandatory
3491 "class" prefix. INCOMPATIBILITY.
3493 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3495 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3498 * Command 'code_reflect' allows to incorporate generated ML code into
3499 runtime environment; replaces immature code_datatype antiquotation.
3502 * Code generator: simple concept for abstract datatypes obeying
3505 * Code generator: details of internal data cache have no impact on the
3506 user space functionality any longer.
3508 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3509 subgoals. This is more appropriate for interpretations with 'where'.
3512 * Command 'example_proof' opens an empty proof body. This allows to
3513 experiment with Isar, without producing any persistent result.
3515 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3516 within a local theory context, with explicit checking of the
3517 constructors involved (in contrast to the raw 'syntax' versions).
3519 * Commands 'types' and 'typedecl' now work within a local theory
3520 context -- without introducing dependencies on parameters or
3521 assumptions, which is not possible in Isabelle/Pure.
3523 * Command 'defaultsort' has been renamed to 'default_sort', it works
3524 within a local theory context. Minor INCOMPATIBILITY.
3529 * Command 'typedef' now works within a local theory context -- without
3530 introducing dependencies on parameters or assumptions, which is not
3531 possible in Isabelle/Pure/HOL. Note that the logical environment may
3532 contain multiple interpretations of local typedefs (with different
3533 non-emptiness proofs), even in a global theory context.
3535 * New package for quotient types. Commands 'quotient_type' and
3536 'quotient_definition' may be used for defining types and constants by
3537 quotient constructions. An example is the type of integers created by
3538 quotienting pairs of natural numbers:
3541 intrel :: "(nat * nat) => (nat * nat) => bool"
3543 "intrel (x, y) (u, v) = (x + v = u + y)"
3545 quotient_type int = "nat * nat" / intrel
3546 by (auto simp add: equivp_def expand_fun_eq)
3549 "0::int" is "(0::nat, 0::nat)"
3551 The method "lifting" can be used to lift of theorems from the
3552 underlying "raw" type to the quotient type. The example
3553 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3554 construction and provides a reasoning infrastructure for finite sets.
3556 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3557 clash with new theory Quotient in Main HOL.
3559 * Moved the SMT binding into the main HOL session, eliminating
3560 separate HOL-SMT session.
3562 * List membership infix mem operation is only an input abbreviation.
3565 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3566 for future developements; former Library/Word.thy is still present in
3567 the AFP entry RSAPPS.
3569 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3570 longer shadowed. INCOMPATIBILITY.
3572 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3575 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3578 * Dropped normalizing_semiring etc; use the facts in semiring classes
3579 instead. INCOMPATIBILITY.
3581 * Dropped several real-specific versions of lemmas about floor and
3582 ceiling; use the generic lemmas from theory "Archimedean_Field"
3583 instead. INCOMPATIBILITY.
3585 floor_number_of_eq ~> floor_number_of
3586 le_floor_eq_number_of ~> number_of_le_floor
3587 le_floor_eq_zero ~> zero_le_floor
3588 le_floor_eq_one ~> one_le_floor
3589 floor_less_eq_number_of ~> floor_less_number_of
3590 floor_less_eq_zero ~> floor_less_zero
3591 floor_less_eq_one ~> floor_less_one
3592 less_floor_eq_number_of ~> number_of_less_floor
3593 less_floor_eq_zero ~> zero_less_floor
3594 less_floor_eq_one ~> one_less_floor
3595 floor_le_eq_number_of ~> floor_le_number_of
3596 floor_le_eq_zero ~> floor_le_zero
3597 floor_le_eq_one ~> floor_le_one
3598 floor_subtract_number_of ~> floor_diff_number_of
3599 floor_subtract_one ~> floor_diff_one
3600 ceiling_number_of_eq ~> ceiling_number_of
3601 ceiling_le_eq_number_of ~> ceiling_le_number_of
3602 ceiling_le_zero_eq ~> ceiling_le_zero
3603 ceiling_le_eq_one ~> ceiling_le_one
3604 less_ceiling_eq_number_of ~> number_of_less_ceiling
3605 less_ceiling_eq_zero ~> zero_less_ceiling
3606 less_ceiling_eq_one ~> one_less_ceiling
3607 ceiling_less_eq_number_of ~> ceiling_less_number_of
3608 ceiling_less_eq_zero ~> ceiling_less_zero
3609 ceiling_less_eq_one ~> ceiling_less_one
3610 le_ceiling_eq_number_of ~> number_of_le_ceiling
3611 le_ceiling_eq_zero ~> zero_le_ceiling
3612 le_ceiling_eq_one ~> one_le_ceiling
3613 ceiling_subtract_number_of ~> ceiling_diff_number_of
3614 ceiling_subtract_one ~> ceiling_diff_one
3616 * Theory "Finite_Set": various folding_XXX locales facilitate the
3617 application of the various fold combinators on finite sets.
3619 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3620 provides abstract red-black tree type which is backed by "RBT_Impl" as
3621 implementation. INCOMPATIBILTY.
3623 * Theory Library/Coinductive_List has been removed -- superseded by
3624 AFP/thys/Coinductive.
3626 * Theory PReal, including the type "preal" and related operations, has
3627 been removed. INCOMPATIBILITY.
3629 * Real: new development using Cauchy Sequences.
3631 * Split off theory "Big_Operators" containing setsum, setprod,
3632 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3634 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3635 "Int" etc. INCOMPATIBILITY.
3637 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3639 * New set of rules "ac_simps" provides combined assoc / commute
3640 rewrites for all interpretations of the appropriate generic locales.
3642 * Renamed theory "OrderedGroup" to "Groups" and split theory
3643 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3644 appropriate and more consistent names suitable for name prefixes
3645 within the HOL theories. INCOMPATIBILITY.
3647 * Some generic constants have been put to appropriate theories:
3648 - less_eq, less: Orderings
3649 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3650 - inverse, divide: Rings
3653 * More consistent naming of type classes involving orderings (and
3656 lower_semilattice ~> semilattice_inf
3657 upper_semilattice ~> semilattice_sup
3659 dense_linear_order ~> dense_linorder
3661 pordered_ab_group_add ~> ordered_ab_group_add
3662 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3663 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3664 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3665 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3666 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3667 pordered_cancel_semiring ~> ordered_cancel_semiring
3668 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3669 pordered_comm_ring ~> ordered_comm_ring
3670 pordered_comm_semiring ~> ordered_comm_semiring
3671 pordered_ring ~> ordered_ring
3672 pordered_ring_abs ~> ordered_ring_abs
3673 pordered_semiring ~> ordered_semiring
3675 ordered_ab_group_add ~> linordered_ab_group_add
3676 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3677 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3678 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3679 ordered_field ~> linordered_field
3680 ordered_field_no_lb ~> linordered_field_no_lb
3681 ordered_field_no_ub ~> linordered_field_no_ub
3682 ordered_field_dense_linear_order ~> dense_linordered_field
3683 ordered_idom ~> linordered_idom
3684 ordered_ring ~> linordered_ring
3685 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3686 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3687 ordered_ring_strict ~> linordered_ring_strict
3688 ordered_semidom ~> linordered_semidom
3689 ordered_semiring ~> linordered_semiring
3690 ordered_semiring_1 ~> linordered_semiring_1
3691 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3692 ordered_semiring_strict ~> linordered_semiring_strict
3694 The following slightly odd type classes have been moved to a
3695 separate theory Library/Lattice_Algebras:
3697 lordered_ab_group_add ~> lattice_ab_group_add
3698 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3699 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3700 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3701 lordered_ring ~> lattice_ring
3705 * Refined field classes:
3706 - classes division_ring_inverse_zero, field_inverse_zero,
3707 linordered_field_inverse_zero include rule inverse 0 = 0 --
3708 subsumes former division_by_zero class;
3709 - numerous lemmas have been ported from field to division_ring.
3712 * Refined algebra theorem collections:
3713 - dropped theorem group group_simps, use algebra_simps instead;
3714 - dropped theorem group ring_simps, use field_simps instead;
3715 - proper theorem collection field_simps subsumes former theorem
3716 groups field_eq_simps and field_simps;
3717 - dropped lemma eq_minus_self_iff which is a duplicate for
3721 * Theory Finite_Set and List: some lemmas have been generalized from
3724 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3725 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3726 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3727 union_Union_fold_union ~> sup_Sup_fold_sup
3728 Inter_fold_inter ~> Inf_fold_inf
3729 Union_fold_union ~> Sup_fold_sup
3730 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3731 union_UNION_fold_union ~> sup_SUPR_fold_sup
3732 INTER_fold_inter ~> INFI_fold_inf
3733 UNION_fold_union ~> SUPR_fold_sup
3735 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3736 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3737 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3738 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3739 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3740 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3742 * Reorganized theory Multiset: swapped notation of pointwise and
3745 - pointwise ordering is instance of class order with standard syntax
3747 - multiset ordering has syntax <=# and <#; partial order properties
3748 are provided by means of interpretation with prefix
3750 - less duplication, less historical organization of sections,
3751 conversion from associations lists to multisets, rudimentary code
3753 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3758 multiset_eq_conv_count_eq ~> multiset_ext_iff
3759 multi_count_ext ~> multiset_ext
3760 diff_union_inverse2 ~> diff_union_cancelR
3764 * Theory Permutation: replaced local "remove" by List.remove1.
3766 * Code generation: ML and OCaml code is decorated with signatures.
3768 * Theory List: added transpose.
3770 * Library/Nat_Bijection.thy is a collection of bijective functions
3771 between nat and other types, which supersedes the older libraries
3772 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3775 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3776 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3777 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3778 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3779 Countable.pair_encode ~> prod_encode
3780 NatIso.prod2nat ~> prod_encode
3781 NatIso.nat2prod ~> prod_decode
3782 NatIso.sum2nat ~> sum_encode
3783 NatIso.nat2sum ~> sum_decode
3784 NatIso.list2nat ~> list_encode
3785 NatIso.nat2list ~> list_decode
3786 NatIso.set2nat ~> set_encode
3787 NatIso.nat2set ~> set_decode
3790 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3791 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3792 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3793 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3794 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3795 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3796 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3797 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3798 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3799 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3800 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3801 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3802 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3805 - Renamed ATP commands:
3806 atp_info ~> sledgehammer running_atps
3807 atp_kill ~> sledgehammer kill_atps
3808 atp_messages ~> sledgehammer messages
3809 atp_minimize ~> sledgehammer minimize
3810 print_atps ~> sledgehammer available_atps
3812 - Added user's manual ("isabelle doc sledgehammer").
3813 - Added option syntax and "sledgehammer_params" to customize
3814 Sledgehammer's behavior. See the manual for details.
3815 - Modified the Isar proof reconstruction code so that it produces
3816 direct proofs rather than proofs by contradiction. (This feature
3817 is still experimental.)
3818 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3820 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3823 - Added and implemented "binary_ints" and "bits" options.
3824 - Added "std" option and implemented support for nonstandard models.
3825 - Added and implemented "finitize" option to improve the precision
3826 of infinite datatypes based on a monotonicity analysis.
3827 - Added support for quotient types.
3828 - Added support for "specification" and "ax_specification"
3830 - Added support for local definitions (for "function" and
3831 "termination" proofs).
3832 - Added support for term postprocessors.
3833 - Optimized "Multiset.multiset" and "FinFun.finfun".
3834 - Improved efficiency of "destroy_constrs" optimization.
3835 - Fixed soundness bugs related to "destroy_constrs" optimization and
3837 - Fixed soundness bug related to higher-order constructors.
3838 - Fixed soundness bug when "full_descrs" is enabled.
3839 - Improved precision of set constructs.
3840 - Added "atoms" option.
3841 - Added cache to speed up repeated Kodkod invocations on the same
3843 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3844 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3845 "SAT4J_Light". INCOMPATIBILITY.
3846 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3847 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3848 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3850 * Method "induct" now takes instantiations of the form t, where t is not
3851 a variable, as a shorthand for "x == t", where x is a fresh variable.
3852 If this is not intended, t has to be enclosed in parentheses.
3853 By default, the equalities generated by definitional instantiations
3854 are pre-simplified, which may cause parameters of inductive cases
3855 to disappear, or may even delete some of the inductive cases.
3856 Use "induct (no_simp)" instead of "induct" to restore the old
3857 behaviour. The (no_simp) option is also understood by the "cases"
3858 and "nominal_induct" methods, which now perform pre-simplification, too.
3864 * Variable names in lemmas generated by the domain package have
3865 changed; the naming scheme is now consistent with the HOL datatype
3866 package. Some proof scripts may be affected, INCOMPATIBILITY.
3868 * The domain package no longer defines the function "foo_copy" for
3869 recursive domain "foo". The reach lemma is now stated directly in
3870 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3871 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3873 * Most definedness lemmas generated by the domain package (previously
3874 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3875 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3876 Proofs that used definedness lemmas as intro rules may break,
3877 potential INCOMPATIBILITY.
3879 * Induction and casedist rules generated by the domain package now
3880 declare proper case_names (one called "bottom", and one named for each
3881 constructor). INCOMPATIBILITY.
3883 * For mutually-recursive domains, separate "reach" and "take_lemma"
3884 rules are generated for each domain, INCOMPATIBILITY.
3886 foo_bar.reach ~> foo.reach bar.reach
3887 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3889 * Some lemmas generated by the domain package have been renamed for
3890 consistency with the datatype package, INCOMPATIBILITY.
3892 foo.ind ~> foo.induct
3893 foo.finite_ind ~> foo.finite_induct
3894 foo.coind ~> foo.coinduct
3895 foo.casedist ~> foo.exhaust
3896 foo.exhaust ~> foo.nchotomy
3898 * For consistency with other definition packages, the fixrec package
3899 now generates qualified theorem names, INCOMPATIBILITY.
3901 foo_simps ~> foo.simps
3902 foo_unfold ~> foo.unfold
3903 foo_induct ~> foo.induct
3905 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3906 method and internal fixrec proofs now use the default simpset instead.
3909 * The "contlub" predicate has been removed. Proof scripts should use
3910 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3912 * The "admw" predicate has been removed, INCOMPATIBILITY.
3914 * The constants cpair, cfst, and csnd have been removed in favor of
3915 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3920 * Antiquotations for basic formal entities:
3922 @{class NAME} -- type class
3923 @{class_syntax NAME} -- syntax representation of the above
3925 @{type_name NAME} -- logical type
3926 @{type_abbrev NAME} -- type abbreviation
3927 @{nonterminal NAME} -- type of concrete syntactic category
3928 @{type_syntax NAME} -- syntax representation of any of the above
3930 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3931 @{const_abbrev NAME} -- abbreviated constant
3932 @{const_syntax NAME} -- syntax representation of any of the above
3934 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3935 syntax constant (cf. 'syntax' command).
3937 * Antiquotation @{make_string} inlines a function to print arbitrary
3938 values similar to the ML toplevel. The result is compiler dependent
3939 and may fall back on "?" in certain situations.
3941 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3942 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3943 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3944 not work with the asynchronous Isar document model.
3946 * Configuration options now admit dynamic default values, depending on
3947 the context or even global references.
3949 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3950 uses an efficient external library if available (for Poly/ML).
3952 * Renamed some important ML structures, while keeping the old names
3953 for some time as aliases within the structure Legacy:
3955 OuterKeyword ~> Keyword
3958 OuterSyntax ~> Outer_Syntax
3959 PrintMode ~> Print_Mode
3960 SpecParse ~> Parse_Spec
3963 ThyOutput ~> Thy_Output
3964 TypeInfer ~> Type_Infer
3966 Note that "open Legacy" simplifies porting of sources, but forgetting
3967 to remove it again will complicate porting again in the future.
3969 * Most operations that refer to a global context are named
3970 accordingly, e.g. Simplifier.global_context or
3971 ProofContext.init_global. There are some situations where a global
3972 context actually works, but under normal circumstances one needs to
3973 pass the proper local context through the code!
3975 * Discontinued old TheoryDataFun with its copy/init operation -- data
3976 needs to be pure. Functor Theory_Data_PP retains the traditional
3977 Pretty.pp argument to merge, which is absent in the standard
3978 Theory_Data version.
3980 * Sorts.certify_sort and derived "cert" operations for types and terms
3981 no longer minimize sorts. Thus certification at the boundary of the
3982 inference kernel becomes invariant under addition of class relations,
3983 which is an important monotonicity principle. Sorts are now minimized
3984 in the syntax layer only, at the boundary between the end-user and the
3985 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3986 explicitly in rare situations.
3988 * Renamed old-style Drule.standard to Drule.export_without_context, to
3989 emphasize that this is in no way a standard operation.
3992 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3993 usual for resolution. Rare INCOMPATIBILITY.
3995 * Renamed varify/unvarify operations to varify_global/unvarify_global
3996 to emphasize that these only work in a global situation (which is
3999 * Curried take and drop in library.ML; negative length is interpreted
4000 as infinity (as in chop). Subtle INCOMPATIBILITY.
4002 * Proof terms: type substitutions on proof constants now use canonical
4003 order of type variables. INCOMPATIBILITY for tools working with proof
4006 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4007 may no longer carry premises. User-level specifications are
4008 transformed accordingly by Thm.add_axiom/add_def.
4013 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4014 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4015 proof terms are enabled unconditionally in the new HOL-Proofs image.
4017 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4018 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4021 * Old lib/scripts/polyml-platform is superseded by the
4022 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4023 variant, even on a 64 bit machine. The following example setting
4024 prefers 64 bit if available:
4026 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4028 * The preliminary Isabelle/jEdit application demonstrates the emerging
4029 Isabelle/Scala layer for advanced prover interaction and integration.
4030 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4033 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4034 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4035 similar to the default assignment of the document preparation system
4036 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4037 provides some operations for direct access to the font without asking
4038 the user for manual installation.
4042 New in Isabelle2009-1 (December 2009)
4043 -------------------------------------
4047 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4048 one backslash should be used, even in ML sources.
4053 * Locale interpretation propagates mixins along the locale hierarchy.
4054 The currently only available mixins are the equations used to map
4055 local definitions to terms of the target domain of an interpretation.
4057 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4058 loc" to print all interpretations of locale "loc" in the theory.
4059 Interpretations in proofs are not shown.
4061 * Thoroughly revised locales tutorial. New section on conditional
4064 * On instantiation of classes, remaining undefined class parameters
4065 are formally declared. INCOMPATIBILITY.
4068 *** Document preparation ***
4070 * New generalized style concept for printing terms: @{foo (style) ...}
4071 instead of @{foo_style style ...} (old form is still retained for
4072 backward compatibility). Styles can be also applied for
4073 antiquotations prop, term_type and typeof.
4078 * New proof method "smt" for a combination of first-order logic with
4079 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4080 fixed-size bitvectors; there is also basic support for higher-order
4081 features (esp. lambda abstractions). It is an incomplete decision
4082 procedure based on external SMT solvers using the oracle mechanism;
4083 for the SMT solver Z3, this method is proof-producing. Certificates
4084 are provided to avoid calling the external solvers solely for
4085 re-checking proofs. Due to a remote SMT service there is no need for
4086 installing SMT solvers locally. See src/HOL/SMT.
4088 * New commands to load and prove verification conditions generated by
4089 the Boogie program verifier or derived systems (e.g. the Verifying C
4090 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4092 * New counterexample generator tool 'nitpick' based on the Kodkod
4093 relational model finder. See src/HOL/Tools/Nitpick and
4094 src/HOL/Nitpick_Examples.
4096 * New commands 'code_pred' and 'values' to invoke the predicate
4097 compiler and to enumerate values of inductive predicates.
4099 * A tabled implementation of the reflexive transitive closure.
4101 * New implementation of quickcheck uses generic code generator;
4102 default generators are provided for all suitable HOL types, records
4103 and datatypes. Old quickcheck can be re-activated importing theory
4104 Library/SML_Quickcheck.
4106 * New testing tool Mirabelle for automated proof tools. Applies
4107 several tools and tactics like sledgehammer, metis, or quickcheck, to
4108 every proof step in a theory. To be used in batch mode via the
4109 "mirabelle" utility.
4111 * New proof method "sos" (sum of squares) for nonlinear real
4112 arithmetic (originally due to John Harison). It requires theory
4113 Library/Sum_Of_Squares. It is not a complete decision procedure but
4114 works well in practice on quantifier-free real arithmetic with +, -,
4115 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4116 inequalities between polynomials. It makes use of external
4117 semidefinite programming solvers. Method "sos" generates a
4118 certificate that can be pasted into the proof thus avoiding the need
4119 to call an external tool every time the proof is checked. See
4120 src/HOL/Library/Sum_Of_Squares.
4122 * New method "linarith" invokes existing linear arithmetic decision
4125 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4127 * New Sledgehammer option "Full Types" in Proof General settings menu.
4128 Causes full type information to be output to the ATPs. This slows
4129 ATPs down considerably but eliminates a source of unsound "proofs"
4132 * New method "metisFT": A version of metis that uses full type
4133 information in order to avoid failures of proof reconstruction.
4135 * New evaluator "approximate" approximates an real valued term using
4136 the same method as the approximation method.
4138 * Method "approximate" now supports arithmetic expressions as
4139 boundaries of intervals and implements interval splitting and Taylor
4142 * ML antiquotation @{code_datatype} inserts definition of a datatype
4143 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4145 * New theory SupInf of the supremum and infimum operators for sets of
4148 * New theory Probability, which contains a development of measure
4149 theory, eventually leading to Lebesgue integration and probability.
4151 * Extended Multivariate Analysis to include derivation and Brouwer's
4154 * Reorganization of number theory, INCOMPATIBILITY:
4155 - new number theory development for nat and int, in theories Divides
4156 and GCD as well as in new session Number_Theory
4157 - some constants and facts now suffixed with _nat and _int
4159 - former session NumberTheory now named Old_Number_Theory, including
4160 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4161 - moved theory Pocklington from src/HOL/Library to
4162 src/HOL/Old_Number_Theory
4164 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4165 lcm of finite and infinite sets. It is shown that they form a complete
4168 * Class semiring_div requires superclass no_zero_divisors and proof of
4169 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4170 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4171 generalized to class semiring_div, subsuming former theorems
4172 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4173 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4176 * Refinements to lattice classes and sets:
4177 - less default intro/elim rules in locale variant, more default
4178 intro/elim rules in class variant: more uniformity
4179 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4181 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4183 - renamed ACI to inf_sup_aci
4184 - new class "boolean_algebra"
4185 - class "complete_lattice" moved to separate theory
4186 "Complete_Lattice"; corresponding constants (and abbreviations)
4187 renamed and with authentic syntax:
4188 Set.Inf ~> Complete_Lattice.Inf
4189 Set.Sup ~> Complete_Lattice.Sup
4190 Set.INFI ~> Complete_Lattice.INFI
4191 Set.SUPR ~> Complete_Lattice.SUPR
4192 Set.Inter ~> Complete_Lattice.Inter
4193 Set.Union ~> Complete_Lattice.Union
4194 Set.INTER ~> Complete_Lattice.INTER
4195 Set.UNION ~> Complete_Lattice.UNION
4196 - authentic syntax for
4199 - mere abbreviations:
4202 Set.inter (for inf, formerly Set.Int)
4203 Set.union (for sup, formerly Set.Un)
4204 Complete_Lattice.Inter (for Inf)
4205 Complete_Lattice.Union (for Sup)
4206 Complete_Lattice.INTER (for INFI)
4207 Complete_Lattice.UNION (for SUPR)
4208 - object-logic definitions as far as appropriate
4210 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4211 Un_subset_iff are explicitly deleted as default simp rules; then also
4212 their lattice counterparts le_inf_iff and le_sup_iff have to be
4213 deleted to achieve the desired effect.
4215 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4216 rules by default any longer; the same applies to min_max.inf_absorb1
4217 etc. INCOMPATIBILITY.
4219 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4220 pred_set_conv by default. INCOMPATIBILITY.
4222 * Power operations on relations and functions are now one dedicated
4223 constant "compow" with infix syntax "^^". Power operation on
4224 multiplicative monoids retains syntax "^" and is now defined generic
4225 in class power. INCOMPATIBILITY.
4227 * Relation composition "R O S" now has a more standard argument order:
4228 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4229 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4230 break, since the O_assoc rule was not rewritten like this. Fix using
4231 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4233 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4234 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4237 * Most rules produced by inductive and datatype package have mandatory
4238 prefixes. INCOMPATIBILITY.
4240 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4241 the attribute of the same name. Each of the theorems in the list
4242 DERIV_intros assumes composition with an additional function and
4243 matches a variable to the derivative, which has to be solved by the
4244 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4245 of most elementary terms. Former Maclauren.DERIV_tac and
4246 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4249 * Code generator attributes follow the usual underscore convention:
4250 code_unfold replaces code unfold
4251 code_post replaces code post
4256 sizechange -> size_change
4257 induct_scheme -> induction_schema
4260 * Discontinued abbreviation "arbitrary" of constant "undefined".
4261 INCOMPATIBILITY, use "undefined" directly.
4264 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4265 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4266 Suc_plus1 -> Suc_eq_plus1
4267 *anti_sym -> *antisym*
4268 vector_less_eq_def -> vector_le_def
4271 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4274 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4280 * Theory Representable defines a class "rep" of domains that are
4281 representable (via an ep-pair) in the universal domain type "udom".
4282 Instances are provided for all type constructors defined in HOLCF.
4284 * The 'new_domain' command is a purely definitional version of the
4285 domain package, for representable domains. Syntax is identical to the
4286 old domain package. The 'new_domain' package also supports indirect
4287 recursion using previously-defined type constructors. See
4288 src/HOLCF/ex/New_Domain.thy for examples.
4290 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4291 on the left-hand side of an equation, and then performs
4292 simplification. Rewriting is done using rules declared with the
4293 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4294 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4296 * The pattern-match compiler in 'fixrec' can now handle constructors
4297 with HOL function types. Pattern-match combinators for the Pair
4298 constructor are pre-configured.
4300 * The 'fixrec' package now produces better fixed-point induction rules
4301 for mutually-recursive definitions: Induction rules have conclusions
4302 of the form "P foo bar" instead of "P <foo, bar>".
4304 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4305 been renamed to "below". The name "below" now replaces "less" in many
4306 theorem names. (Legacy theorem names using "less" are still supported
4309 * The 'fixrec' package now supports "bottom patterns". Bottom
4310 patterns can be used to generate strictness rules, or to make
4311 functions more strict (much like the bang-patterns supported by the
4312 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4318 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4319 errors and run-time exceptions, including detailed source positions.
4321 * Structure Name_Space (formerly NameSpace) now manages uniquely
4322 identified entries, with some additional information such as source
4323 position, logical grouping etc.
4325 * Theory and context data is now introduced by the simplified and
4326 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4327 to be pure, but the old TheoryDataFun for mutable data (with explicit
4328 copy operation) is still available for some time.
4330 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4331 provides a high-level programming interface to synchronized state
4332 variables with atomic update. This works via pure function
4333 application within a critical section -- its runtime should be as
4334 short as possible; beware of deadlocks if critical code is nested,
4335 either directly or indirectly via other synchronized variables!
4337 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4338 wraps raw ML references, explicitly indicating their non-thread-safe
4339 behaviour. The Isar toplevel keeps this structure open, to
4340 accommodate Proof General as well as quick and dirty interactive
4341 experiments with references.
4343 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4344 parallel tactical reasoning.
4346 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4347 are similar to SUBPROOF, but are slightly more flexible: only the
4348 specified parts of the subgoal are imported into the context, and the
4349 body tactic may introduce new subgoals and schematic variables.
4351 * Old tactical METAHYPS, which does not observe the proof context, has
4352 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4353 or Subgoal.FOCUS etc.
4355 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4356 functors have their own ML name space there is no point to mark them
4357 separately.) Minor INCOMPATIBILITY.
4359 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4361 * Renamed several structures FooBar to Foo_Bar. Occasional,
4364 * Operations of structure Skip_Proof no longer require quick_and_dirty
4365 mode, which avoids critical setmp.
4367 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4368 combinators for "args". INCOMPATIBILITY, need to use simplified
4369 Attrib/Method.setup introduced in Isabelle2009.
4371 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4372 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4373 last resort. INCOMPATIBILITY.
4375 * Display.pretty_thm now requires a proper context (cf. former
4376 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4377 or even Display.pretty_thm_without_context as last resort.
4380 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4381 Syntax.pretty_typ/term directly, preferably with proper context
4382 instead of global theory.
4387 * Further fine tuning of parallel proof checking, scales up to 8 cores
4388 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4391 * Support for additional "Isabelle components" via etc/components, see
4392 also the system manual.
4394 * The isabelle makeall tool now operates on all components with
4395 IsaMakefile, not just hardwired "logics".
4397 * Removed "compress" option from isabelle-process and isabelle usedir;
4398 this is always enabled.
4400 * Discontinued support for Poly/ML 4.x versions.
4402 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4403 on a given logic image. This requires the lighttpd webserver and is
4404 currently supported on Linux only.
4408 New in Isabelle2009 (April 2009)
4409 --------------------------------
4413 * Simplified main Isabelle executables, with less surprises on
4414 case-insensitive file-systems (such as Mac OS).
4416 - The main Isabelle tool wrapper is now called "isabelle" instead of
4419 - The former "isabelle" alias for "isabelle-process" has been
4420 removed (should rarely occur to regular users).
4422 - The former "isabelle-interface" and its alias "Isabelle" have been
4423 removed (interfaces are now regular Isabelle tools).
4425 Within scripts and make files, the Isabelle environment variables
4426 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4427 respectively. (The latter are still available as legacy feature.)
4429 The old isabelle-interface wrapper could react in confusing ways if
4430 the interface was uninstalled or changed otherwise. Individual
4431 interface tool configuration is now more explicit, see also the
4432 Isabelle system manual. In particular, Proof General is now available
4433 via "isabelle emacs".
4435 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4436 purge installed copies of Isabelle executables and re-run "isabelle
4437 install -p ...", or use symlinks.
4439 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4440 old ~/isabelle, which was slightly non-standard and apt to cause
4441 surprises on case-insensitive file-systems (such as Mac OS).
4443 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4444 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4445 care is required when using older releases of Isabelle. Note that
4446 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4447 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4449 * Proofs of fully specified statements are run in parallel on
4450 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4451 a regular 4-core machine, if the initial heap space is made reasonably
4452 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4454 * The main reference manuals ("isar-ref", "implementation", and
4455 "system") have been updated and extended. Formally checked references
4456 as hyperlinks are now available uniformly.
4461 * Complete re-implementation of locales. INCOMPATIBILITY in several
4462 respects. The most important changes are listed below. See the
4463 Tutorial on Locales ("locales" manual) for details.
4465 - In locale expressions, instantiation replaces renaming. Parameters
4466 must be declared in a for clause. To aid compatibility with previous
4467 parameter inheritance, in locale declarations, parameters that are not
4468 'touched' (instantiation position "_" or omitted) are implicitly added
4469 with their syntax at the beginning of the for clause.
4471 - Syntax from abbreviations and definitions in locales is available in
4472 locale expressions and context elements. The latter is particularly
4473 useful in locale declarations.
4475 - More flexible mechanisms to qualify names generated by locale
4476 expressions. Qualifiers (prefixes) may be specified in locale
4477 expressions, and can be marked as mandatory (syntax: "name!:") or
4478 optional (syntax "name?:"). The default depends for plain "name:"
4479 depends on the situation where a locale expression is used: in
4480 commands 'locale' and 'sublocale' prefixes are optional, in
4481 'interpretation' and 'interpret' prefixes are mandatory. The old
4482 implicit qualifiers derived from the parameter names of a locale are
4483 no longer generated.
4485 - Command "sublocale l < e" replaces "interpretation l < e". The
4486 instantiation clause in "interpretation" and "interpret" (square
4487 brackets) is no longer available. Use locale expressions.
4489 - When converting proof scripts, mandatory qualifiers in
4490 'interpretation' and 'interpret' should be retained by default, even
4491 if this is an INCOMPATIBILITY compared to former behavior. In the
4492 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4493 in locale expressions range over a single locale instance only.
4495 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4496 In existing theorem specifications replace the includes element by the
4497 respective context elements of the included locale, omitting those
4498 that are already present in the theorem specification. Multiple
4499 assume elements of a locale should be replaced by a single one
4500 involving the locale predicate. In the proof body, declarations (most
4501 notably theorems) may be regained by interpreting the respective
4502 locales in the proof context as required (command "interpret").
4504 If using "includes" in replacement of a target solely because the
4505 parameter types in the theorem are not as general as in the target,
4506 consider declaring a new locale with additional type constraints on
4507 the parameters (context element "constrains").
4509 - Discontinued "locale (open)". INCOMPATIBILITY.
4511 - Locale interpretation commands no longer attempt to simplify goal.
4512 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4513 methods intro_locales and unfold_locales to clarify.
4515 - Locale interpretation commands no longer accept interpretation
4516 attributes. INCOMPATIBILITY.
4518 * Class declaration: so-called "base sort" must not be given in import
4519 list any longer, but is inferred from the specification. Particularly
4526 class foo = type + ...
4528 * Class target: global versions of theorems stemming do not carry a
4529 parameter prefix any longer. INCOMPATIBILITY.
4531 * Class 'instance' command no longer accepts attached definitions.
4532 INCOMPATIBILITY, use proper 'instantiation' target instead.
4534 * Recovered hiding of consts, which was accidentally broken in
4535 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4536 makes c inaccessible; consider using ``hide (open) const c'' instead.
4538 * Slightly more coherent Pure syntax, with updated documentation in
4539 isar-ref manual. Removed locales meta_term_syntax and
4540 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4541 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4542 directly in regular applications.
4544 * There is a new syntactic category "float_const" for signed decimal
4545 fractions (e.g. 123.45 or -123.45).
4547 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4548 interface with 'setup' command instead.
4550 * Command 'local_setup' is similar to 'setup', but operates on a local
4553 * The 'axiomatization' command now only works within a global theory
4554 context. INCOMPATIBILITY.
4556 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4557 hypotheses. Sorts required in the course of reasoning need to be
4558 covered by the constraints in the initial statement, completed by the
4559 type instance information of the background theory. Non-trivial sort
4560 hypotheses, which rarely occur in practice, may be specified via
4561 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4563 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4565 The result contains an implicit sort hypotheses as before --
4566 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4569 * Generalized Isar history, with support for linear undo, direct state
4572 * Changed defaults for unify configuration options:
4574 unify_trace_bound = 50 (formerly 25)
4575 unify_search_bound = 60 (formerly 30)
4577 * Different bookkeeping for code equations (INCOMPATIBILITY):
4579 a) On theory merge, the last set of code equations for a particular
4580 constant is taken (in accordance with the policy applied by other
4581 parts of the code generator framework).
4583 b) Code equations stemming from explicit declarations (e.g. code
4584 attribute) gain priority over default code equations stemming
4585 from definition, primrec, fun etc.
4587 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4589 * Unified theorem tables for both code generators. Thus [code
4590 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4592 * Command 'find_consts' searches for constants based on type and name
4595 find_consts "_ => bool"
4597 By default, matching is against subtypes, but it may be restricted to
4598 the whole type. Searching by name is possible. Multiple queries are
4599 conjunctive and queries may be negated by prefixing them with a
4602 find_consts strict: "_ => bool" name: "Int" -"int => int"
4604 * New 'find_theorems' criterion "solves" matches theorems that
4605 directly solve the current goal (modulo higher-order unification).
4607 * Auto solve feature for main theorem statements: whenever a new goal
4608 is stated, "find_theorems solves" is called; any theorems that could
4609 solve the lemma directly are listed as part of the goal state.
4610 Cf. associated options in Proof General Isabelle settings menu,
4611 enabled by default, with reasonable timeout for pathological cases of
4612 higher-order unification.
4615 *** Document preparation ***
4617 * Antiquotation @{lemma} now imitates a regular terminal proof,
4618 demanding keyword 'by' and supporting the full method expression
4619 syntax just like the Isar command 'by'.
4624 * Integrated main parts of former image HOL-Complex with HOL. Entry
4625 points Main and Complex_Main remain as before.
4627 * Logic image HOL-Plain provides a minimal HOL with the most important
4628 tools available (inductive, datatype, primrec, ...). This facilitates
4629 experimentation and tool development. Note that user applications
4630 (and library theories) should never refer to anything below theory
4633 * Logic image HOL-Main stops at theory Main, and thus facilitates
4634 experimentation due to shorter build times.
4636 * Logic image HOL-NSA contains theories of nonstandard analysis which
4637 were previously part of former HOL-Complex. Entry point Hyperreal
4638 remains valid, but theories formerly using Complex_Main should now use
4639 new entry point Hypercomplex.
4641 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4642 Posix processes. Avoids potentially expensive forking of the ML
4643 process. New thread-based implementation also works on non-Unix
4644 platforms (Cygwin). Provers are no longer hardwired, but defined
4645 within the theory via plain ML wrapper functions. Basic Sledgehammer
4646 commands are covered in the isar-ref manual.
4648 * Wrapper scripts for remote SystemOnTPTP service allows to use
4649 sledgehammer without local ATP installation (Vampire etc.). Other
4650 provers may be included via suitable ML wrappers, see also
4651 src/HOL/ATP_Linkup.thy.
4653 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4656 * The metis method no longer fails because the theorem is too trivial
4657 (contains the empty clause).
4659 * The metis method now fails in the usual manner, rather than raising
4660 an exception, if it determines that it cannot prove the theorem.
4662 * Method "coherent" implements a prover for coherent logic (see also
4663 src/Tools/coherent.ML).
4665 * Constants "undefined" and "default" replace "arbitrary". Usually
4666 "undefined" is the right choice to replace "arbitrary", though
4667 logically there is no difference. INCOMPATIBILITY.
4669 * Command "value" now integrates different evaluation mechanisms. The
4670 result of the first successful evaluation mechanism is printed. In
4671 square brackets a particular named evaluation mechanisms may be
4672 specified (currently, [SML], [code] or [nbe]). See further
4673 src/HOL/ex/Eval_Examples.thy.
4675 * Normalization by evaluation now allows non-leftlinear equations.
4676 Declare with attribute [code nbe].
4678 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4679 as the structured Isar versions "cases" and "induct", cf. the
4680 corresponding "cases" and "induct" attributes. Mutual induction rules
4681 are now presented as a list of individual projections
4682 (e.g. foo_bar.inducts for types foo and bar); the old format with
4683 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4684 rare situations a different rule is selected --- notably nested tuple
4685 elimination instead of former prod.exhaust: use explicit (case_tac t
4686 rule: prod.exhaust) here.
4688 * Attributes "cases", "induct", "coinduct" support "del" option.
4690 * Removed fact "case_split_thm", which duplicates "case_split".
4692 * The option datatype has been moved to a new theory Option. Renamed
4693 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4695 * New predicate "strict_mono" classifies strict functions on partial
4696 orders. With strict functions on linear orders, reasoning about
4697 (in)equalities is facilitated by theorems "strict_mono_eq",
4698 "strict_mono_less_eq" and "strict_mono_less".
4700 * Some set operations are now proper qualified constants with
4701 authentic syntax. INCOMPATIBILITY:
4712 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4715 * Auxiliary class "itself" has disappeared -- classes without any
4716 parameter are treated as expected by the 'class' command.
4718 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4720 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4721 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4723 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4724 method "approximation". It proves formulas on real values by using
4725 interval arithmetic. In the formulas are also the transcendental
4726 functions sin, cos, tan, atan, ln, exp and the constant pi are
4727 allowed. For examples see
4728 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4730 * Theory "Reflection" now resides in HOL/Library.
4732 * Entry point to Word library now simply named "Word".
4735 * Made source layout more coherent with logical distribution
4738 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4739 src/HOL/Library/Code_Message.thy ~> src/HOL/
4740 src/HOL/Library/GCD.thy ~> src/HOL/
4741 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4742 src/HOL/Library/Parity.thy ~> src/HOL/
4743 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4744 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4745 src/HOL/Real/Lubs.thy ~> src/HOL/
4746 src/HOL/Real/PReal.thy ~> src/HOL/
4747 src/HOL/Real/Rational.thy ~> src/HOL/
4748 src/HOL/Real/RComplete.thy ~> src/HOL/
4749 src/HOL/Real/RealDef.thy ~> src/HOL/
4750 src/HOL/Real/RealPow.thy ~> src/HOL/
4751 src/HOL/Real/Real.thy ~> src/HOL/
4752 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4753 src/HOL/Complex/Complex.thy ~> src/HOL/
4754 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4755 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4756 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4757 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4758 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4759 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4760 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4761 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4762 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4763 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4764 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4765 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4766 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4767 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4768 src/HOL/Real/Float ~> src/HOL/Library/
4769 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4770 src/HOL/Real/RealVector.thy ~> src/HOL/
4772 src/HOL/arith_data.ML ~> src/HOL/Tools
4773 src/HOL/hologic.ML ~> src/HOL/Tools
4774 src/HOL/simpdata.ML ~> src/HOL/Tools
4775 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4776 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4777 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4778 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4779 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4780 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4781 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4783 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4784 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4785 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4786 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4787 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4788 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4790 * If methods "eval" and "evaluation" encounter a structured proof
4791 state with !!/==>, only the conclusion is evaluated to True (if
4792 possible), avoiding strange error messages.
4794 * Method "sizechange" automates termination proofs using (a
4795 modification of) the size-change principle. Requires SAT solver. See
4796 src/HOL/ex/Termination.thy for examples.
4798 * Simplifier: simproc for let expressions now unfolds if bound
4799 variable occurs at most once in let expression body. INCOMPATIBILITY.
4801 * Method "arith": Linear arithmetic now ignores all inequalities when
4802 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4804 * New attribute "arith" for facts that should always be used
4805 automatically by arithmetic. It is intended to be used locally in
4808 assumes [arith]: "x > 0"
4810 Global usage is discouraged because of possible performance impact.
4812 * New classes "top" and "bot" with corresponding operations "top" and
4813 "bot" in theory Orderings; instantiation of class "complete_lattice"
4814 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4816 * Changed definition lemma "less_fun_def" in order to provide an
4817 instance for preorders on functions; use lemma "less_le" instead.
4820 * Theory Orderings: class "wellorder" moved here, with explicit
4821 induction rule "less_induct" as assumption. For instantiation of
4822 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4825 * Theory Orderings: added class "preorder" as superclass of "order".
4826 INCOMPATIBILITY: Instantiation proofs for order, linorder
4827 etc. slightly changed. Some theorems named order_class.* now named
4830 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4833 * Theory Finite_Set: added a new fold combinator of type
4835 ('a => 'b => 'b) => 'b => 'a set => 'b
4837 Occasionally this is more convenient than the old fold combinator
4838 which is now defined in terms of the new one and renamed to
4841 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4842 and "ring_simps" have been replaced by "algebra_simps" (which can be
4843 extended with further lemmas!). At the moment both still exist but
4844 the former will disappear at some point.
4846 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4847 class recpower. Type-specific simp rules for various recpower types
4848 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4850 rat_power_0 -> power_0
4851 rat_power_Suc -> power_Suc
4852 realpow_0 -> power_0
4853 realpow_Suc -> power_Suc
4854 complexpow_0 -> power_0
4855 complexpow_Suc -> power_Suc
4856 power_poly_0 -> power_0
4857 power_poly_Suc -> power_Suc
4859 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4860 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4861 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4862 of lemmas from Divides has been generalized from nat to class
4863 semiring_div. INCOMPATIBILITY. This involves the following theorem
4864 renames resulting from duplicate elimination:
4866 dvd_def_mod ~> dvd_eq_mod_eq_0
4867 zero_dvd_iff ~> dvd_0_left_iff
4868 dvd_0 ~> dvd_0_right
4869 DIVISION_BY_ZERO_DIV ~> div_by_0
4870 DIVISION_BY_ZERO_MOD ~> mod_by_0
4871 mult_div ~> div_mult_self2_is_id
4872 mult_mod ~> mod_mult_self2_is_0
4874 * Theory IntDiv: removed many lemmas that are instances of class-based
4875 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4876 rename old lemmas as follows:
4878 dvd_diff -> nat_dvd_diff
4879 dvd_zminus_iff -> dvd_minus_iff
4880 mod_add1_eq -> mod_add_eq
4881 mod_mult1_eq -> mod_mult_right_eq
4882 mod_mult1_eq' -> mod_mult_left_eq
4883 mod_mult_distrib_mod -> mod_mult_eq
4884 nat_mod_add_left_eq -> mod_add_left_eq
4885 nat_mod_add_right_eq -> mod_add_right_eq
4886 nat_mod_div_trivial -> mod_div_trivial
4887 nat_mod_mod_trivial -> mod_mod_trivial
4888 zdiv_zadd_self1 -> div_add_self1
4889 zdiv_zadd_self2 -> div_add_self2
4890 zdiv_zmult_self1 -> div_mult_self2_is_id
4891 zdiv_zmult_self2 -> div_mult_self1_is_id
4892 zdvd_triv_left -> dvd_triv_left
4893 zdvd_triv_right -> dvd_triv_right
4894 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4895 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4896 zmod_zadd_left_eq -> mod_add_left_eq
4897 zmod_zadd_right_eq -> mod_add_right_eq
4898 zmod_zadd_self1 -> mod_add_self1
4899 zmod_zadd_self2 -> mod_add_self2
4900 zmod_zadd1_eq -> mod_add_eq
4901 zmod_zdiff1_eq -> mod_diff_eq
4902 zmod_zdvd_zmod -> mod_mod_cancel
4903 zmod_zmod_cancel -> mod_mod_cancel
4904 zmod_zmult_self1 -> mod_mult_self2_is_0
4905 zmod_zmult_self2 -> mod_mult_self1_is_0
4908 zdvd_abs1 -> abs_dvd_iff
4909 zdvd_abs2 -> dvd_abs_iff
4910 zdvd_refl -> dvd_refl
4911 zdvd_trans -> dvd_trans
4912 zdvd_zadd -> dvd_add
4913 zdvd_zdiff -> dvd_diff
4914 zdvd_zminus_iff -> dvd_minus_iff
4915 zdvd_zminus2_iff -> minus_dvd_iff
4916 zdvd_zmultD -> dvd_mult_right
4917 zdvd_zmultD2 -> dvd_mult_left
4918 zdvd_zmult_mono -> mult_dvd_mono
4919 zdvd_0_right -> dvd_0_right
4920 zdvd_0_left -> dvd_0_left_iff
4921 zdvd_1_left -> one_dvd
4922 zminus_dvd_iff -> minus_dvd_iff
4924 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4926 * The real numbers offer decimal input syntax: 12.34 is translated
4927 into 1234/10^2. This translation is not reversed upon output.
4929 * Theory Library/Polynomial defines an abstract type 'a poly of
4930 univariate polynomials with coefficients of type 'a. In addition to
4931 the standard ring operations, it also supports div and mod. Code
4932 generation is also supported, using list-style constructors.
4934 * Theory Library/Inner_Product defines a class of real_inner for real
4935 inner product spaces, with an overloaded operation inner :: 'a => 'a
4936 => real. Class real_inner is a subclass of real_normed_vector from
4939 * Theory Library/Product_Vector provides instances for the product
4940 type 'a * 'b of several classes from RealVector and Inner_Product.
4941 Definitions of addition, subtraction, scalar multiplication, norms,
4942 and inner products are included.
4944 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4945 addition to the field operations, numerals and case syntax are also
4948 * Theory Library/Diagonalize provides constructive version of Cantor's
4949 first diagonalization argument.
4951 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4952 zlcm (for int); carried together from various gcd/lcm developements in
4953 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4954 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4955 may recover tupled syntax as follows:
4957 hide (open) const gcd
4958 abbreviation gcd where
4959 "gcd == (%(a, b). GCD.gcd a b)"
4961 GCD.gcd ("gcd '(_, _')")
4963 The same works for lcm, zgcd, zlcm.
4965 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4966 instantiations for algebraic structures. Removed some duplicate
4967 theorems. Changes in simp rules. INCOMPATIBILITY.
4969 * ML antiquotation @{code} takes a constant as argument and generates
4970 corresponding code in background and inserts name of the corresponding
4971 resulting ML value/function/datatype constructor binding in place.
4972 All occurrences of @{code} with a single ML block are generated
4973 simultaneously. Provides a generic and safe interface for
4974 instrumentalizing code generation. See
4975 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4976 In future you ought to refrain from ad-hoc compiling generated SML
4977 code on the ML toplevel. Note that (for technical reasons) @{code}
4978 cannot refer to constants for which user-defined serializations are
4979 set. Refer to the corresponding ML counterpart directly in that
4982 * Command 'rep_datatype': instead of theorem names the command now
4983 takes a list of terms denoting the constructors of the type to be
4984 represented as datatype. The characteristic theorems have to be
4985 proven. INCOMPATIBILITY. Also observe that the following theorems
4986 have disappeared in favour of existing ones:
4988 unit_induct ~> unit.induct
4989 prod_induct ~> prod.induct
4990 sum_induct ~> sum.induct
4991 Suc_Suc_eq ~> nat.inject
4992 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4997 * New locales for orders and lattices where the equivalence relation
4998 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4999 locales use a record structure with field eq for the equivalence.
5001 * New theory of factorial domains.
5003 * Units_l_inv and Units_r_inv are now simp rules by default.
5004 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5005 and/or r_inv will now also require deletion of these lemmas.
5007 * Renamed the following theorems, INCOMPATIBILITY:
5009 UpperD ~> Upper_memD
5010 LowerD ~> Lower_memD
5011 least_carrier ~> least_closed
5012 greatest_carrier ~> greatest_closed
5013 greatest_Lower_above ~> greatest_Lower_below
5014 one_zero ~> carrier_one_zero
5015 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5020 * Nominal datatypes can now contain type-variables.
5022 * Commands 'nominal_inductive' and 'equivariance' work with local
5025 * Nominal primrec can now works with local theory targets and its
5026 specification syntax now conforms to the general format as seen in
5029 * Method "perm_simp" honours the standard simplifier attributes
5030 (no_asm), (no_asm_use) etc.
5032 * The new predicate #* is defined like freshness, except that on the
5033 left hand side can be a set or list of atoms.
5035 * Experimental command 'nominal_inductive2' derives strong induction
5036 principles for inductive definitions. In contrast to
5037 'nominal_inductive', which can only deal with a fixed number of
5038 binders, it can deal with arbitrary expressions standing for sets of
5039 atoms to be avoided. The only inductive definition we have at the
5040 moment that needs this generalisation is the typing rule for Lets in
5043 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5044 -----------------------------------------------------------------
5045 Gamma |- Let x be t1 in t2 : T2
5047 In this rule one wants to avoid all the binders that are introduced by
5048 "close Gamma T1". We are looking for other examples where this
5049 feature might be useful. Please let us know.
5054 * Reimplemented the simplification procedure for proving continuity
5055 subgoals. The new simproc is extensible; users can declare additional
5056 continuity introduction rules with the attribute [cont2cont].
5058 * The continuity simproc now uses a different introduction rule for
5059 solving continuity subgoals on terms with lambda abstractions. In
5060 some rare cases the new simproc may fail to solve subgoals that the
5061 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5062 Potential INCOMPATIBILITY.
5064 * Command 'fixrec': specification syntax now conforms to the general
5065 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5066 examples. INCOMPATIBILITY.
5071 * Proof of Zorn's Lemma for partial orders.
5076 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5077 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5078 depends on multithreading, so timouts will not work before Poly/ML
5081 * High-level support for concurrent ML programming, see
5082 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5083 particularly convenient to organize independent functional
5084 computations. The concept of "synchronized variables" provides a
5085 higher-order interface for components with shared state, avoiding the
5086 delicate details of mutexes and condition variables. (Requires
5087 Poly/ML 5.2.1 or later.)
5089 * ML bindings produced via Isar commands are stored within the Isar
5090 context (theory or proof). Consequently, commands like 'use' and 'ML'
5091 become thread-safe and work with undo as expected (concerning
5092 top-level bindings, not side-effects on global references).
5093 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5094 compiler at runtime; really global bindings need to be given outside a
5095 theory. (Requires Poly/ML 5.2 or later.)
5097 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5098 context. Top-level ML bindings are stored within the proof context in
5099 a purely sequential fashion, disregarding the nested proof structure.
5100 ML bindings introduced by 'ML_prf' are discarded at the end of the
5101 proof. (Requires Poly/ML 5.2 or later.)
5103 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5104 and Method.setup, as well as Isar commands 'attribute_setup' and
5105 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5106 existing code accordingly, or use plain 'setup' together with old
5109 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5110 to 'a -> thm, while results are always tagged with an authentic oracle
5111 name. The Isar command 'oracle' is now polymorphic, no argument type
5112 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5113 accordingly. Note that extra performance may be gained by producing
5114 the cterm carefully, avoiding slow Thm.cterm_of.
5116 * Simplified interface for defining document antiquotations via
5117 ThyOutput.antiquotation, ThyOutput.output, and optionally
5118 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5119 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5122 * More systematic treatment of long names, abstract name bindings, and
5123 name space operations. Basic operations on qualified names have been
5124 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5125 Long_Name.append. Old type bstring has been mostly replaced by
5126 abstract type binding (see structure Binding), which supports precise
5127 qualification by packages and local theory targets, as well as proper
5128 tracking of source positions. INCOMPATIBILITY, need to wrap old
5129 bstring values into Binding.name, or better pass through abstract
5130 bindings everywhere. See further src/Pure/General/long_name.ML,
5131 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5133 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5134 LocalTheory.note etc.) now refer to the *full* internal name, not the
5135 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5137 * Disposed old type and term read functions (Sign.read_def_typ,
5138 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5139 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5140 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5141 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5142 resort for legacy applications.
5144 * Disposed old declarations, tactics, tactic combinators that refer to
5145 the simpset or claset of an implicit theory (such as Addsimps,
5146 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5147 embedded ML text, or local_simpset_of with a proper context passed as
5148 explicit runtime argument.
5150 * Rules and tactics that read instantiations (read_instantiate,
5151 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5152 context, which is required for parsing and type-checking. Moreover,
5153 the variables are specified as plain indexnames, not string encodings
5154 thereof. INCOMPATIBILITY.
5156 * Generic Toplevel.add_hook interface allows to analyze the result of
5157 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5158 for theorem dependency output of transactions resulting in a new
5161 * ML antiquotations: block-structured compilation context indicated by
5162 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5164 @{binding name} - basic name binding
5165 @{let ?pat = term} - term abbreviation (HO matching)
5166 @{note name = fact} - fact abbreviation
5167 @{thm fact} - singleton fact (with attributes)
5168 @{thms fact} - general fact (with attributes)
5169 @{lemma prop by method} - singleton goal
5170 @{lemma prop by meth1 meth2} - singleton goal
5171 @{lemma prop1 ... propN by method} - general goal
5172 @{lemma prop1 ... propN by meth1 meth2} - general goal
5173 @{lemma (open) ...} - open derivation
5178 * The Isabelle "emacs" tool provides a specific interface to invoke
5179 Proof General / Emacs, with more explicit failure if that is not
5180 installed (the old isabelle-interface script silently falls back on
5181 isabelle-process). The PROOFGENERAL_HOME setting determines the
5182 installation location of the Proof General distribution.
5184 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5185 the Isabelle process into a JVM/Scala application. See
5186 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5187 process wrapper has been discontinued.)
5189 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5191 * Various status messages (with exact source position information) are
5192 emitted, if proper markup print mode is enabled. This allows
5193 user-interface components to provide detailed feedback on internal
5198 New in Isabelle2008 (June 2008)
5199 -------------------------------
5203 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5204 and updated, with formally checked references as hyperlinks.
5206 * Theory loader: use_thy (and similar operations) no longer set the
5207 implicit ML context, which was occasionally hard to predict and in
5208 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5209 provides a proper context already.
5211 * Theory loader: old-style ML proof scripts being *attached* to a thy
5212 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5213 'use' within a theory file will do the job.
5215 * Name space merge now observes canonical order, i.e. the second space
5216 is inserted into the first one, while existing entries in the first
5217 space take precedence. INCOMPATIBILITY in rare situations, may try to
5218 swap theory imports.
5220 * Syntax: symbol \<chi> is now considered a letter. Potential
5221 INCOMPATIBILITY in identifier syntax etc.
5223 * Outer syntax: string tokens no longer admit escaped white space,
5224 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5225 white space without escapes.
5227 * Outer syntax: string tokens may contain arbitrary character codes
5228 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5234 * Context-dependent token translations. Default setup reverts locally
5235 fixed variables, and adds hilite markup for undeclared frees.
5237 * Unused theorems can be found using the new command 'unused_thms'.
5238 There are three ways of invoking it:
5241 Only finds unused theorems in the current theory.
5243 (2) unused_thms thy_1 ... thy_n -
5244 Finds unused theorems in the current theory and all of its ancestors,
5245 excluding the theories thy_1 ... thy_n and all of their ancestors.
5247 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5248 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5249 their ancestors, excluding the theories thy_1 ... thy_n and all of
5252 In order to increase the readability of the list produced by
5253 unused_thms, theorems that have been created by a particular instance
5254 of a theory command such as 'inductive' or 'function' are considered
5255 to belong to the same "group", meaning that if at least one theorem in
5256 this group is used, the other theorems in the same group are no longer
5257 reported as unused. Moreover, if all theorems in the group are
5258 unused, only one theorem in the group is displayed.
5260 Note that proof objects have to be switched on in order for
5261 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5262 usually the case when using Proof General with the default settings).
5264 * Authentic naming of facts disallows ad-hoc overwriting of previous
5265 theorems within the same name space. INCOMPATIBILITY, need to remove
5266 duplicate fact bindings, or even accidental fact duplications. Note
5267 that tools may maintain dynamically scoped facts systematically, using
5268 PureThy.add_thms_dynamic.
5270 * Command 'hide' now allows to hide from "fact" name space as well.
5272 * Eliminated destructive theorem database, simpset, claset, and
5273 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5274 update of theories within ML code.
5276 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5277 INCOMPATIBILITY, object-logics depending on former Pure require
5278 additional setup PureThy.old_appl_syntax_setup; object-logics
5279 depending on former CPure need to refer to Pure.
5281 * Commands 'use' and 'ML' are now purely functional, operating on
5282 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5283 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5286 * Command 'setup': discontinued implicit version with ML reference.
5288 * Instantiation target allows for simultaneous specification of class
5289 instance operations together with an instantiation proof.
5290 Type-checking phase allows to refer to class operations uniformly.
5291 See src/HOL/Complex/Complex.thy for an Isar example and
5292 src/HOL/Library/Eval.thy for an ML example.
5294 * Indexing of literal facts: be more serious about including only
5295 facts from the visible specification/proof context, but not the
5296 background context (locale etc.). Affects `prop` notation and method
5297 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5300 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5301 "(open)" option, which used to expose internal bound variables to the
5304 * Isar statements: removed obsolete case "rule_context".
5305 INCOMPATIBILITY, better use explicit fixes/assumes.
5307 * Locale proofs: default proof step now includes 'unfold_locales';
5308 hence 'proof' without argument may be used to unfold locale
5312 *** Document preparation ***
5314 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5315 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5316 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5317 spot); renamed link color from "darkblue" to "linkcolor" (default
5318 value unchanged, can be redefined via \definecolor); no longer sets
5319 "a4paper" option (unnecessary or even intrusive).
5321 * Antiquotation @{lemma A method} proves proposition A by the given
5322 method (either a method name or a method name plus (optional) method
5323 arguments in parentheses) and prints A just like @{prop A}.
5328 * New primrec package. Specification syntax conforms in style to
5329 definition/function/.... No separate induction rule is provided. The
5330 "primrec" command distinguishes old-style and new-style specifications
5331 by syntax. The former primrec package is now named OldPrimrecPackage.
5332 When adjusting theories, beware: constants stemming from new-style
5333 primrec specifications have authentic syntax.
5335 * Metis prover is now an order of magnitude faster, and also works
5336 with multithreading.
5338 * Metis: the maximum number of clauses that can be produced from a
5339 theorem is now given by the attribute max_clauses. Theorems that
5340 exceed this number are ignored, with a warning printed.
5342 * Sledgehammer no longer produces structured proofs by default. To
5343 enable, declare [[sledgehammer_full = true]]. Attributes
5344 reconstruction_modulus, reconstruction_sorts renamed
5345 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5347 * Method "induct_scheme" derives user-specified induction rules
5348 from well-founded induction and completeness of patterns. This factors
5349 out some operations that are done internally by the function package
5350 and makes them available separately. See
5351 src/HOL/ex/Induction_Scheme.thy for examples.
5353 * More flexible generation of measure functions for termination
5354 proofs: Measure functions can be declared by proving a rule of the
5355 form "is_measure f" and giving it the [measure_function] attribute.
5356 The "is_measure" predicate is logically meaningless (always true), and
5357 just guides the heuristic. To find suitable measure functions, the
5358 termination prover sets up the goal "is_measure ?f" of the appropriate
5359 type and generates all solutions by prolog-style backwards proof using
5362 This setup also deals with rules like
5364 "is_measure f ==> is_measure (list_size f)"
5366 which accommodates nested datatypes that recurse through lists.
5367 Similar rules are predeclared for products and option types.
5369 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5373 - Definitions of overloaded constants on sets have to be replaced by
5374 definitions on => and bool.
5376 - Some definitions of overloaded operators on sets can now be proved
5377 using the definitions of the operators on => and bool. Therefore,
5378 the following theorems have been renamed:
5380 subset_def -> subset_eq
5381 psubset_def -> psubset_eq
5382 set_diff_def -> set_diff_eq
5383 Compl_def -> Compl_eq
5384 Sup_set_def -> Sup_set_eq
5385 Inf_set_def -> Inf_set_eq
5386 sup_set_def -> sup_set_eq
5387 inf_set_def -> inf_set_eq
5389 - Due to the incompleteness of the HO unification algorithm, some
5390 rules such as subst may require manual instantiation, if some of
5391 the unknowns in the rule is a set.
5393 - Higher order unification and forward proofs:
5396 have "P (S::'a set)" <...>
5397 then have "EX S. P S" ..
5399 no longer works (due to the incompleteness of the HO unification
5400 algorithm) and must be replaced by the pattern
5407 - Calculational reasoning with subst (or similar rules):
5410 have "P (S::'a set)" <...>
5411 also have "S = T" <...>
5412 finally have "P T" .
5414 no longer works (for similar reasons as the previous example) and
5415 must be replaced by something like
5417 have "P (S::'a set)" <...>
5418 moreover have "S = T" <...>
5419 ultimately have "P T" by simp
5421 - Tactics or packages written in ML code:
5422 Code performing pattern matching on types via
5424 Type ("set", [T]) => ...
5426 must be rewritten. Moreover, functions like strip_type or
5427 binder_types no longer return the right value when applied to a
5430 T1 => ... => Tn => U => bool
5434 T1 => ... => Tn => U set
5436 * Merged theories Wellfounded_Recursion, Accessible_Part and
5437 Wellfounded_Relations to theory Wellfounded.
5439 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5441 * Class finite no longer treats UNIV as class parameter. Use class
5442 enum from theory Library/Enum instead to achieve a similar effect.
5445 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5446 and "Cons". INCOMPATIBILITY.
5448 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5449 Potential INCOMPATIBILITY.
5451 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5452 injective_fst_snd removed, use split_eta and prod_eqI instead.
5453 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5455 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5456 the same name in theory Orderings:
5466 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5467 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5468 and different variable names.
5470 * Library/Option_ord.thy: Canonical order on option type.
5472 * Library/RBT.thy: Red-black trees, an efficient implementation of
5475 * Library/Countable.thy: Type class for countable types.
5477 * Theory Int: The representation of numerals has changed. The infix
5478 operator BIT and the bit datatype with constructors B0 and B1 have
5479 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5480 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5481 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5484 * Theory Nat: definition of <= and < on natural numbers no longer
5485 depend on well-founded relations. INCOMPATIBILITY. Definitions
5486 le_def and less_def have disappeared. Consider lemmas not_less
5487 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5489 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5490 (whose purpose mainly is for various fold_set functionals) have been
5491 abandoned in favor of the existing algebraic classes
5492 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5493 lower_semilattice (resp. upper_semilattice) and linorder.
5496 * Theory Transitive_Closure: induct and cases rules now declare proper
5497 case_names ("base" and "step"). INCOMPATIBILITY.
5499 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5500 lattices. The form set-specific version is available as
5501 Inductive.lfp_ordinal_induct_set.
5503 * Renamed theorems "power.simps" to "power_int.simps".
5506 * Class semiring_div provides basic abstract properties of semirings
5507 with division and modulo operations. Subsumes former class dvd_mod.
5509 * Merged theories IntDef, Numeral and IntArith into unified theory
5510 Int. INCOMPATIBILITY.
5512 * Theory Library/Code_Index: type "index" now represents natural
5513 numbers rather than integers. INCOMPATIBILITY.
5515 * New class "uminus" with operation "uminus" (split of from class
5516 "minus" which now only has operation "minus", binary).
5519 * Constants "card", "internal_split", "option_map" now with authentic
5520 syntax. INCOMPATIBILITY.
5522 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5523 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5524 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5525 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5526 Sup_set_def, le_def, less_def, option_map_def now with object
5527 equality. INCOMPATIBILITY.
5529 * Records. Removed K_record, and replaced it by pure lambda term
5530 %x. c. The simplifier setup is now more robust against eta expansion.
5531 INCOMPATIBILITY: in cases explicitly referring to K_record.
5533 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5535 * Library/ListVector: new theory of arithmetic vector operations.
5537 * Library/Order_Relation: new theory of various orderings as sets of
5538 pairs. Defines preorders, partial orders, linear orders and
5539 well-orders on sets and on types.
5544 * Renamed some theories to allow to loading both ZF and HOL in the
5547 Datatype -> Datatype_ZF
5548 Inductive -> Inductive_ZF
5555 INCOMPATIBILITY: ZF theories that import individual theories below
5556 Main might need to be adapted. Regular theory Main is still
5557 available, as trivial extension of Main_ZF.
5562 * ML within Isar: antiquotation @{const name} or @{const
5563 name(typargs)} produces statically-checked Const term.
5565 * Functor NamedThmsFun: data is available to the user as dynamic fact
5566 (of the same name). Removed obsolete print command.
5568 * Removed obsolete "use_legacy_bindings" function.
5570 * The ``print mode'' is now a thread-local value derived from a global
5571 template (the former print_mode reference), thus access becomes
5572 non-critical. The global print_mode reference is for session
5573 management only; user-code should use print_mode_value,
5574 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5576 * Functions system/system_out provide a robust way to invoke external
5577 shell commands, with propagation of interrupts (requires Poly/ML
5578 5.2.1). Do not use OS.Process.system etc. from the basis library!
5583 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5584 in accordance with Proof General 3.7, which prefers GNU emacs.
5586 * isatool tty runs Isabelle process with plain tty interaction;
5587 optional line editor may be specified via ISABELLE_LINE_EDITOR
5588 setting, the default settings attempt to locate "ledit" and "rlwrap".
5590 * isatool browser now works with Cygwin as well, using general
5591 "javapath" function defined in Isabelle process environment.
5593 * YXML notation provides a simple and efficient alternative to
5594 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5595 isatool yxml as described in the Isabelle system manual.
5597 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5598 provides general wrapper for managing an Isabelle process in a robust
5599 fashion, with ``cooked'' output from stdin/stderr.
5601 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5602 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5604 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5605 way of changing the user's settings is via
5606 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5609 * Multithreading.max_threads := 0 refers to the number of actual CPU
5610 cores of the underlying machine, which is a good starting point for
5611 optimal performance tuning. The corresponding usedir option -M allows
5612 "max" as an alias for "0". WARNING: does not work on certain versions
5613 of Mac OS (with Poly/ML 5.1).
5615 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5616 adverse effect of Isabelle flooding interactive front-ends (notably
5617 ProofGeneral / XEmacs).
5621 New in Isabelle2007 (November 2007)
5622 -----------------------------------
5626 * More uniform information about legacy features, notably a
5627 warning/error of "Legacy feature: ...", depending on the state of the
5628 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5629 legacy features will disappear eventually.
5631 * Theory syntax: the header format ``theory A = B + C:'' has been
5632 discontinued in favour of ``theory A imports B C begin''. Use isatool
5633 fixheaders to convert existing theory files. INCOMPATIBILITY.
5635 * Theory syntax: the old non-Isar theory file format has been
5636 discontinued altogether. Note that ML proof scripts may still be used
5637 with Isar theories; migration is usually quite simple with the ML
5638 function use_legacy_bindings. INCOMPATIBILITY.
5640 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5641 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5644 * Theory loader: be more serious about observing the static theory
5645 header specifications (including optional directories), but not the
5646 accidental file locations of previously successful loads. The strict
5647 update policy of former update_thy is now already performed by
5648 use_thy, so the former has been removed; use_thys updates several
5649 theories simultaneously, just as 'imports' within a theory header
5650 specification, but without merging the results. Potential
5651 INCOMPATIBILITY: may need to refine theory headers and commands
5652 ROOT.ML which depend on load order.
5654 * Theory loader: optional support for content-based file
5655 identification, instead of the traditional scheme of full physical
5656 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5657 (cf. the system manual). The new scheme allows to work with
5658 non-finished theories in persistent session images, such that source
5659 files may be moved later on without requiring reloads.
5661 * Theory loader: old-style ML proof scripts being *attached* to a thy
5662 file (with the same base name as the theory) are considered a legacy
5663 feature, which will disappear eventually. Even now, the theory loader
5664 no longer maintains dependencies on such files.
5666 * Syntax: the scope for resolving ambiguities via type-inference is
5667 now limited to individual terms, instead of whole simultaneous
5668 specifications as before. This greatly reduces the complexity of the
5669 syntax module and improves flexibility by separating parsing and
5670 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5671 'fixes' etc.) are required in rare situations.
5673 * Syntax: constants introduced by new-style packages ('definition',
5674 'abbreviation' etc.) are passed through the syntax module in
5675 ``authentic mode''. This means that associated mixfix annotations
5676 really stick to such constants, independently of potential name space
5677 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5678 trees are represented slightly differently, may need to adapt syntax
5679 translations accordingly. Use CONST marker in 'translations' and
5680 @{const_syntax} antiquotation in 'parse_translation' etc.
5682 * Legacy goal package: reduced interface to the bare minimum required
5683 to keep existing proof scripts running. Most other user-level
5684 functions are now part of the OldGoals structure, which is *not* open
5685 by default (consider isatool expandshort before open OldGoals).
5686 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5687 these tend to cause confusion about the actual goal (!) context being
5688 used here, which is not necessarily the same as the_context().
5690 * Command 'find_theorems': supports "*" wild-card in "name:"
5691 criterion; "with_dups" option. Certain ProofGeneral versions might
5692 support a specific search form (see ProofGeneral/CHANGES).
5694 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5695 by default, which means that "prems" (and also "fixed variables") are
5696 suppressed from proof state output. Note that the ProofGeneral
5697 settings mechanism allows to change and save options persistently, but
5698 older versions of Isabelle will fail to start up if a negative prems
5701 * Local theory targets may be specified by non-nested blocks of
5702 ``context/locale/class ... begin'' followed by ``end''. The body may
5703 contain definitions, theorems etc., including any derived mechanism
5704 that has been implemented on top of these primitives. This concept
5705 generalizes the existing ``theorem (in ...)'' towards more versatility
5708 * Proof General interface: proper undo of final 'end' command;
5709 discontinued Isabelle/classic mode (ML proof scripts).
5712 *** Document preparation ***
5714 * Added antiquotation @{theory name} which prints the given name,
5715 after checking that it refers to a valid ancestor theory in the
5718 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5719 check the given source text as ML type/structure, printing verbatim.
5721 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5722 "c args == rhs" given in the current context. (Any number of
5723 arguments may be given on the LHS.)
5728 * The 'class' package offers a combination of axclass and locale to
5729 achieve Haskell-like type classes in Isabelle. Definitions and
5730 theorems within a class context produce both relative results (with
5731 implicit parameters according to the locale context), and polymorphic
5732 constants with qualified polymorphism (according to the class
5733 context). Within the body context of a 'class' target, a separate
5734 syntax layer ("user space type system") takes care of converting
5735 between global polymorphic consts and internal locale representation.
5736 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5737 "isatool doc classes" provides a tutorial.
5739 * Generic code generator framework allows to generate executable
5740 code for ML and Haskell (including Isabelle classes). A short usage
5743 internal compilation:
5744 export_code <list of constants (term syntax)> in SML
5745 writing SML code to a file:
5746 export_code <list of constants (term syntax)> in SML <filename>
5747 writing OCaml code to a file:
5748 export_code <list of constants (term syntax)> in OCaml <filename>
5749 writing Haskell code to a bunch of files:
5750 export_code <list of constants (term syntax)> in Haskell <filename>
5752 evaluating closed propositions to True/False using code generation:
5755 Reasonable default setup of framework in HOL.
5757 Theorem attributs for selecting and transforming function equations theorems:
5759 [code fun]: select a theorem as function equation for a specific constant
5760 [code fun del]: deselect a theorem as function equation for a specific constant
5761 [code inline]: select an equation theorem for unfolding (inlining) in place
5762 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5764 User-defined serializations (target in {SML, OCaml, Haskell}):
5766 code_const <and-list of constants (term syntax)>
5767 {(target) <and-list of const target syntax>}+
5769 code_type <and-list of type constructors>
5770 {(target) <and-list of type target syntax>}+
5772 code_instance <and-list of instances>
5774 where instance ::= <type constructor> :: <class>
5776 code_class <and_list of classes>
5777 {(target) <and-list of class target syntax>}+
5778 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5780 code_instance and code_class only are effective to target Haskell.
5782 For example usage see src/HOL/ex/Codegenerator.thy and
5783 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5784 generation from Isabelle/HOL theories is available via "isatool doc
5787 * Code generator: consts in 'consts_code' Isar commands are now
5788 referred to by usual term syntax (including optional type
5791 * Command 'no_translations' removes translation rules from theory
5794 * Overloaded definitions are now actually checked for acyclic
5795 dependencies. The overloading scheme is slightly more general than
5796 that of Haskell98, although Isabelle does not demand an exact
5797 correspondence to type class and instance declarations.
5798 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5799 exotic versions of overloading -- at the discretion of the user!
5801 Polymorphic constants are represented via type arguments, i.e. the
5802 instantiation that matches an instance against the most general
5803 declaration given in the signature. For example, with the declaration
5804 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5805 as c(nat). Overloading is essentially simultaneous structural
5806 recursion over such type arguments. Incomplete specification patterns
5807 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5808 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5809 Command 'print_theory' outputs the normalized system of recursive
5810 equations, see section "definitions".
5812 * Configuration options are maintained within the theory or proof
5813 context (with name and type bool/int/string), providing a very simple
5814 interface to a poor-man's version of general context data. Tools may
5815 declare options in ML (e.g. using Attrib.config_int) and then refer to
5816 these values using Config.get etc. Users may change options via an
5817 associated attribute of the same name. This form of context
5818 declaration works particularly well with commands 'declare' or
5819 'using', for example ``declare [[foo = 42]]''. Thus it has become
5820 very easy to avoid global references, which would not observe Isar
5821 toplevel undo/redo and fail to work with multithreading.
5823 Various global ML references of Pure and HOL have been turned into
5824 configuration options:
5826 Unify.search_bound unify_search_bound
5827 Unify.trace_bound unify_trace_bound
5828 Unify.trace_simp unify_trace_simp
5829 Unify.trace_types unify_trace_types
5830 Simplifier.simp_depth_limit simp_depth_limit
5831 Blast.depth_limit blast_depth_limit
5832 DatatypeProp.dtK datatype_distinctness_limit
5833 fast_arith_neq_limit fast_arith_neq_limit
5834 fast_arith_split_limit fast_arith_split_limit
5836 * Named collections of theorems may be easily installed as context
5837 data using the functor NamedThmsFun (see also
5838 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5839 attributes; there is also a toplevel print command. This facility is
5840 just a common case of general context data, which is the preferred way
5841 for anything more complex than just a list of facts in canonical
5844 * Isar: command 'declaration' augments a local theory by generic
5845 declaration functions written in ML. This enables arbitrary content
5846 being added to the context, depending on a morphism that tells the
5847 difference of the original declaration context wrt. the application
5848 context encountered later on.
5850 * Isar: proper interfaces for simplification procedures. Command
5851 'simproc_setup' declares named simprocs (with match patterns, and body
5852 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5853 context. ML antiquotation @{simproc name} retrieves named simprocs.
5855 * Isar: an extra pair of brackets around attribute declarations
5856 abbreviates a theorem reference involving an internal dummy fact,
5857 which will be ignored later --- only the effect of the attribute on
5858 the background context will persist. This form of in-place
5859 declarations is particularly useful with commands like 'declare' and
5860 'using', for example ``have A using [[simproc a]] by simp''.
5862 * Isar: method "assumption" (and implicit closing of subproofs) now
5863 takes simple non-atomic goal assumptions into account: after applying
5864 an assumption as a rule the resulting subgoals are solved by atomic
5865 assumption steps. This is particularly useful to finish 'obtain'
5866 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5867 without referring to the original premise "!!x. P x ==> thesis" in the
5868 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5871 * Isar: implicit use of prems from the Isar proof context is
5872 considered a legacy feature. Common applications like ``have A .''
5873 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5874 referencing facts explicitly here improves readability and
5875 maintainability of proof texts.
5877 * Isar: improper proof element 'guess' is like 'obtain', but derives
5878 the obtained context from the course of reasoning! For example:
5880 assume "EX x y. A x & B y" -- "any previous fact"
5881 then guess x and y by clarify
5883 This technique is potentially adventurous, depending on the facts and
5884 proof tools being involved here.
5886 * Isar: known facts from the proof context may be specified as literal
5887 propositions, using ASCII back-quote syntax. This works wherever
5888 named facts used to be allowed so far, in proof commands, proof
5889 methods, attributes etc. Literal facts are retrieved from the context
5890 according to unification of type and term parameters. For example,
5891 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5892 theorems in the current context, then these are valid literal facts:
5893 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5895 There is also a proof method "fact" which does the same composition
5896 for explicit goal states, e.g. the following proof texts coincide with
5897 certain special cases of literal facts:
5899 have "A" by fact == note `A`
5900 have "A ==> B" by fact == note `A ==> B`
5901 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5902 have "P a ==> Q a" by fact == note `P a ==> Q a`
5904 * Isar: ":" (colon) is no longer a symbolic identifier character in
5905 outer syntax. Thus symbolic identifiers may be used without
5906 additional white space in declarations like this: ``assume *: A''.
5908 * Isar: 'print_facts' prints all local facts of the current context,
5909 both named and unnamed ones.
5911 * Isar: 'def' now admits simultaneous definitions, e.g.:
5913 def x == "t" and y == "u"
5915 * Isar: added command 'unfolding', which is structurally similar to
5916 'using', but affects both the goal state and facts by unfolding given
5917 rewrite rules. Thus many occurrences of the 'unfold' method or
5918 'unfolded' attribute may be replaced by first-class proof text.
5920 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5921 and command 'unfolding' now all support object-level equalities
5922 (potentially conditional). The underlying notion of rewrite rule is
5923 analogous to the 'rule_format' attribute, but *not* that of the
5924 Simplifier (which is usually more generous).
5926 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5927 premises of a theorem by n. Useful in conjunction with drule.
5929 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5930 method expression within a sandbox consisting of the first N
5931 sub-goals, which need to exist. For example, ``simp_all [3]''
5932 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5933 simplifies all new goals that emerge from applying rule foo to the
5934 originally first one.
5936 * Isar: schematic goals are no longer restricted to higher-order
5937 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5940 * Isar: the conclusion of a long theorem statement is now either
5941 'shows' (a simultaneous conjunction, as before), or 'obtains'
5942 (essentially a disjunction of cases with local parameters and
5943 assumptions). The latter allows to express general elimination rules
5944 adequately; in this notation common elimination rules look like this:
5946 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5948 obtains x where "P x"
5950 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5954 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5960 The subsequent classical rules even refer to the formal "thesis"
5963 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5966 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5967 obtains "thesis ==> something"
5969 The actual proof of an 'obtains' statement is analogous to that of the
5970 Isar proof element 'obtain', only that there may be several cases.
5971 Optional case names may be specified in parentheses; these will be
5972 available both in the present proof and as annotations in the
5973 resulting rule, for later use with the 'cases' method (cf. attribute
5976 * Isar: the assumptions of a long theorem statement are available as
5977 "assms" fact in the proof context. This is more appropriate than the
5978 (historical) "prems", which refers to all assumptions of the current
5979 context, including those from the target locale, proof body etc.
5981 * Isar: 'print_statement' prints theorems from the current theory or
5982 proof context in long statement form, according to the syntax of a
5985 * Isar: 'obtain' takes an optional case name for the local context
5986 introduction rule (default "that").
5988 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5989 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5992 * Pure: syntax "CONST name" produces a fully internalized constant
5993 according to the current context. This is particularly useful for
5994 syntax translations that should refer to internal constant
5995 representations independently of name spaces.
5997 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5998 instead of "FOO ". This allows multiple binder declarations to coexist
5999 in the same context. INCOMPATIBILITY.
6001 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6002 primitive that also works in a locale context (both for constants and
6003 fixed variables). Type declaration and internal syntactic representation
6004 of given constants retrieved from the context. Likewise, the
6005 'no_notation' command allows to remove given syntax annotations from the
6008 * Isar/locales: new derived specification elements 'axiomatization',
6009 'definition', 'abbreviation', which support type-inference, admit
6010 object-level specifications (equality, equivalence). See also the
6011 isar-ref manual. Examples:
6014 eq (infix "===" 50) where
6015 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6017 definition "f x y = x + y + 1"
6018 definition g where "g x = f x x"
6021 neq (infix "=!=" 50) where
6022 "x =!= y == ~ (x === y)"
6024 These specifications may be also used in a locale context. Then the
6025 constants being introduced depend on certain fixed parameters, and the
6026 constant name is qualified by the locale base name. An internal
6027 abbreviation takes care for convenient input and output, making the
6028 parameters implicit and using the original short name. See also
6029 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6030 entities from a monomorphic theory.
6032 Presently, abbreviations are only available 'in' a target locale, but
6033 not inherited by general import expressions. Also note that
6034 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6035 'translations' in common applications. The "no_abbrevs" print mode
6036 prevents folding of abbreviations in term output.
6038 Concrete syntax is attached to specified constants in internal form,
6039 independently of name spaces. The parse tree representation is
6040 slightly different -- use 'notation' instead of raw 'syntax', and
6041 'translations' with explicit "CONST" markup to accommodate this.
6043 * Pure/Isar: unified syntax for new-style specification mechanisms
6044 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6045 full type inference and dummy patterns ("_"). For example:
6047 definition "K x _ = x"
6049 inductive conj for A B
6050 where "A ==> B ==> conj A B"
6052 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6053 the current context. Print mode "no_abbrevs" prevents inversion of
6054 abbreviations on output.
6056 * Isar/locales: improved parameter handling: use of locales "var" and
6057 "struct" no longer necessary; - parameter renamings are no longer
6058 required to be injective. For example, this allows to define
6059 endomorphisms as locale endom = homom mult mult h.
6061 * Isar/locales: changed the way locales with predicates are defined.
6062 Instead of accumulating the specification, the imported expression is
6063 now an interpretation. INCOMPATIBILITY: different normal form of
6064 locale expressions. In particular, in interpretations of locales with
6065 predicates, goals repesenting already interpreted fragments are not
6066 removed automatically. Use methods `intro_locales' and
6067 `unfold_locales'; see below.
6069 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6070 provide backward reasoning on locales predicates. The methods are
6071 aware of interpretations and discharge corresponding goals.
6072 `intro_locales' is less aggressive then `unfold_locales' and does not
6073 unfold predicates to assumptions.
6075 * Isar/locales: the order in which locale fragments are accumulated
6076 has changed. This enables to override declarations from fragments due
6077 to interpretations -- for example, unwanted simp rules.
6079 * Isar/locales: interpretation in theories and proof contexts has been
6080 extended. One may now specify (and prove) equations, which are
6081 unfolded in interpreted theorems. This is useful for replacing
6082 defined concepts (constants depending on locale parameters) by
6083 concepts already existing in the target context. Example:
6085 interpretation partial_order ["op <= :: [int, int] => bool"]
6086 where "partial_order.less (op <=) (x::int) y = (x < y)"
6088 Typically, the constant `partial_order.less' is created by a
6089 definition specification element in the context of locale
6092 * Method "induct": improved internal context management to support
6093 local fixes and defines on-the-fly. Thus explicit meta-level
6094 connectives !! and ==> are rarely required anymore in inductive goals
6095 (using object-logic connectives for this purpose has been long
6096 obsolete anyway). Common proof patterns are explained in
6097 src/HOL/Induct/Common_Patterns.thy, see also
6098 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6101 * Method "induct": improved handling of simultaneous goals. Instead of
6102 introducing object-level conjunction, the statement is now split into
6103 several conclusions, while the corresponding symbolic cases are nested
6104 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6105 see src/HOL/Induct/Common_Patterns.thy, for example.
6107 * Method "induct": mutual induction rules are now specified as a list
6108 of rule sharing the same induction cases. HOL packages usually provide
6109 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6110 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6111 mutual induction rules differently, i.e. like this:
6113 (induct rule: foo_bar.inducts)
6114 (induct set: foo bar)
6115 (induct pred: foo bar)
6116 (induct type: foo bar)
6118 The ML function ProjectRule.projections turns old-style rules into the
6121 * Method "coinduct": dual of induction, see
6122 src/HOL/Library/Coinductive_List.thy for various examples.
6124 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6125 considered a legacy feature.
6127 * Attribute "symmetric" produces result with standardized schematic
6128 variables (index 0). Potential INCOMPATIBILITY.
6130 * Simplifier: by default the simplifier trace only shows top level
6131 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6132 default. Thus there is less danger of being flooded by the trace. The
6133 trace indicates where parts have been suppressed.
6135 * Provers/classical: removed obsolete classical version of elim_format
6136 attribute; classical elim/dest rules are now treated uniformly when
6137 manipulating the claset.
6139 * Provers/classical: stricter checks to ensure that supplied intro,
6140 dest and elim rules are well-formed; dest and elim rules must have at
6143 * Provers/classical: attributes dest/elim/intro take an optional
6144 weight argument for the rule (just as the Pure versions). Weights are
6145 ignored by automated tools, but determine the search order of single
6148 * Syntax: input syntax now supports dummy variable binding "%_. b",
6149 where the body does not mention the bound variable. Note that dummy
6150 patterns implicitly depend on their context of bounds, which makes
6151 "{_. _}" match any set comprehension as expected. Potential
6152 INCOMPATIBILITY -- parse translations need to cope with syntactic
6153 constant "_idtdummy" in the binding position.
6155 * Syntax: removed obsolete syntactic constant "_K" and its associated
6156 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6157 for example "A -> B" => "Pi A (%_. B)".
6159 * Pure: 'class_deps' command visualizes the subclass relation, using
6160 the graph browser tool.
6162 * Pure: 'print_theory' now suppresses certain internal declarations by
6163 default; use '!' option for full details.
6168 * Method "metis" proves goals by applying the Metis general-purpose
6169 resolution prover (see also http://gilith.com/software/metis/).
6170 Examples are in the directory MetisExamples. WARNING: the
6171 Isabelle/HOL-Metis integration does not yet work properly with
6174 * Command 'sledgehammer' invokes external automatic theorem provers as
6175 background processes. It generates calls to the "metis" method if
6176 successful. These can be pasted into the proof. Users do not have to
6177 wait for the automatic provers to return. WARNING: does not really
6178 work with multi-threading.
6180 * New "auto_quickcheck" feature tests outermost goal statements for
6181 potential counter-examples. Controlled by ML references
6182 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6183 5000 milliseconds). Fails silently if statements is outside of
6184 executable fragment, or any other codgenerator problem occurs.
6186 * New constant "undefined" with axiom "undefined x = undefined".
6188 * Added class "HOL.eq", allowing for code generation with polymorphic
6191 * Some renaming of class constants due to canonical name prefixing in
6192 the new 'class' package:
6194 HOL.abs ~> HOL.abs_class.abs
6195 HOL.divide ~> HOL.divide_class.divide
6196 0 ~> HOL.zero_class.zero
6197 1 ~> HOL.one_class.one
6198 op + ~> HOL.plus_class.plus
6199 op - ~> HOL.minus_class.minus
6200 uminus ~> HOL.minus_class.uminus
6201 op * ~> HOL.times_class.times
6202 op < ~> HOL.ord_class.less
6203 op <= > HOL.ord_class.less_eq
6204 Nat.power ~> Power.power_class.power
6205 Nat.size ~> Nat.size_class.size
6206 Numeral.number_of ~> Numeral.number_class.number_of
6207 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6208 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6209 Orderings.min ~> Orderings.ord_class.min
6210 Orderings.max ~> Orderings.ord_class.max
6211 Divides.op div ~> Divides.div_class.div
6212 Divides.op mod ~> Divides.div_class.mod
6213 Divides.op dvd ~> Divides.div_class.dvd
6215 INCOMPATIBILITY. Adaptions may be required in the following cases:
6217 a) User-defined constants using any of the names "plus", "minus",
6218 "times", "less" or "less_eq". The standard syntax translations for
6219 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6222 b) Variables named "plus", "minus", "times", "less", "less_eq"
6223 INCOMPATIBILITY: use more specific names.
6225 c) Permutative equations (e.g. "a + b = b + a")
6226 Since the change of names also changes the order of terms, permutative
6227 rewrite rules may get applied in a different order. Experience shows
6228 that this is rarely the case (only two adaptions in the whole Isabelle
6229 distribution). INCOMPATIBILITY: rewrite proofs
6231 d) ML code directly refering to constant names
6232 This in general only affects hand-written proof tactics, simprocs and
6233 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6234 Consider using @{const_name} antiquotation.
6236 * New class "default" with associated constant "default".
6238 * Function "sgn" is now overloaded and available on int, real, complex
6239 (and other numeric types), using class "sgn". Two possible defs of
6240 sgn are given as equational assumptions in the classes sgn_if and
6241 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6244 * Locale "partial_order" now unified with class "order" (cf. theory
6245 Orderings), added parameter "less". INCOMPATIBILITY.
6247 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6248 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6249 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6251 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6252 changed order of proof goals in instance proofs.
6254 * The transitivity reasoner for partial and linear orders is set up
6255 for classes "order" and "linorder". Instances of the reasoner are available
6256 in all contexts importing or interpreting the corresponding locales.
6257 Method "order" invokes the reasoner separately; the reasoner
6258 is also integrated with the Simplifier as a solver. Diagnostic
6259 command 'print_orders' shows the available instances of the reasoner
6260 in the current context.
6262 * Localized monotonicity predicate in theory "Orderings"; integrated
6263 lemmas max_of_mono and min_of_mono with this predicate.
6266 * Formulation of theorem "dense" changed slightly due to integration
6267 with new class dense_linear_order.
6269 * Uniform lattice theory development in HOL.
6271 constants "meet" and "join" now named "inf" and "sup"
6272 constant "Meet" now named "Inf"
6274 classes "meet_semilorder" and "join_semilorder" now named
6275 "lower_semilattice" and "upper_semilattice"
6276 class "lorder" now named "lattice"
6277 class "comp_lat" now named "complete_lattice"
6279 Instantiation of lattice classes allows explicit definitions
6280 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6282 INCOMPATIBILITY. Theorem renames:
6284 meet_left_le ~> inf_le1
6285 meet_right_le ~> inf_le2
6286 join_left_le ~> sup_ge1
6287 join_right_le ~> sup_ge2
6288 meet_join_le ~> inf_sup_ord
6291 le_meet ~> le_inf_iff
6292 le_join ~> ge_sup_conv
6293 meet_idempotent ~> inf_idem
6294 join_idempotent ~> sup_idem
6295 meet_comm ~> inf_commute
6296 join_comm ~> sup_commute
6297 meet_leI1 ~> le_infI1
6298 meet_leI2 ~> le_infI2
6299 le_joinI1 ~> le_supI1
6300 le_joinI2 ~> le_supI2
6301 meet_assoc ~> inf_assoc
6302 join_assoc ~> sup_assoc
6303 meet_left_comm ~> inf_left_commute
6304 meet_left_idempotent ~> inf_left_idem
6305 join_left_comm ~> sup_left_commute
6306 join_left_idempotent ~> sup_left_idem
6309 le_def_meet ~> le_iff_inf
6310 le_def_join ~> le_iff_sup
6311 join_absorp2 ~> sup_absorb2
6312 join_absorp1 ~> sup_absorb1
6313 meet_absorp1 ~> inf_absorb1
6314 meet_absorp2 ~> inf_absorb2
6315 meet_join_absorp ~> inf_sup_absorb
6316 join_meet_absorp ~> sup_inf_absorb
6317 distrib_join_le ~> distrib_sup_le
6318 distrib_meet_le ~> distrib_inf_le
6320 add_meet_distrib_left ~> add_inf_distrib_left
6321 add_join_distrib_left ~> add_sup_distrib_left
6322 is_join_neg_meet ~> is_join_neg_inf
6323 is_meet_neg_join ~> is_meet_neg_sup
6324 add_meet_distrib_right ~> add_inf_distrib_right
6325 add_join_distrib_right ~> add_sup_distrib_right
6326 add_meet_join_distribs ~> add_sup_inf_distribs
6327 join_eq_neg_meet ~> sup_eq_neg_inf
6328 meet_eq_neg_join ~> inf_eq_neg_sup
6329 add_eq_meet_join ~> add_eq_inf_sup
6330 meet_0_imp_0 ~> inf_0_imp_0
6331 join_0_imp_0 ~> sup_0_imp_0
6332 meet_0_eq_0 ~> inf_0_eq_0
6333 join_0_eq_0 ~> sup_0_eq_0
6334 neg_meet_eq_join ~> neg_inf_eq_sup
6335 neg_join_eq_meet ~> neg_sup_eq_inf
6336 join_eq_if ~> sup_eq_if
6338 mono_meet ~> mono_inf
6339 mono_join ~> mono_sup
6340 meet_bool_eq ~> inf_bool_eq
6341 join_bool_eq ~> sup_bool_eq
6342 meet_fun_eq ~> inf_fun_eq
6343 join_fun_eq ~> sup_fun_eq
6344 meet_set_eq ~> inf_set_eq
6345 join_set_eq ~> sup_set_eq
6346 meet1_iff ~> inf1_iff
6347 meet2_iff ~> inf2_iff
6356 join1_iff ~> sup1_iff
6357 join2_iff ~> sup2_iff
6367 is_meet_Meet ~> is_meet_Inf
6368 Meet_bool_def ~> Inf_bool_def
6369 Meet_fun_def ~> Inf_fun_def
6370 Meet_greatest ~> Inf_greatest
6371 Meet_lower ~> Inf_lower
6372 Meet_set_def ~> Inf_set_def
6375 Sup_bool_eq ~> Sup_bool_def
6376 Sup_fun_eq ~> Sup_fun_def
6377 Sup_set_eq ~> Sup_set_def
6379 listsp_meetI ~> listsp_infI
6380 listsp_meet_eq ~> listsp_inf_eq
6385 * Added syntactic class "size"; overloaded constant "size" now has
6386 type "'a::size ==> bool"
6388 * Internal reorganisation of `size' of datatypes: size theorems
6389 "foo.size" are no longer subsumed by "foo.simps" (but are still
6390 simplification rules by default!); theorems "prod.size" now named
6393 * Class "div" now inherits from class "times" rather than "type".
6396 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6397 Linorder etc. have disappeared; operations defined in terms of
6398 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6400 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6402 * HOL-Word: New extensive library and type for generic, fixed size
6403 machine words, with arithmetic, bit-wise, shifting and rotating
6404 operations, reflection into int, nat, and bool lists, automation for
6405 linear arithmetic (by automatic reflection into nat or int), including
6406 lemmas on overflow and monotonicity. Instantiated to all appropriate
6407 arithmetic type classes, supporting automatic simplification of
6408 numerals on all operations.
6410 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6412 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6414 * Code generator library theories:
6415 - Code_Integer represents HOL integers by big integer literals in target
6417 - Code_Char represents HOL characters by character literals in target
6419 - Code_Char_chr like Code_Char, but also offers treatment of character
6420 codes; includes Code_Integer.
6421 - Executable_Set allows to generate code for finite sets using lists.
6422 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6424 - Executable_Real implements a subset of real numbers, namly those
6425 representable by rational numbers.
6426 - Efficient_Nat implements natural numbers by integers, which in general will
6427 result in higher efficency; pattern matching with 0/Suc is eliminated;
6428 includes Code_Integer.
6429 - Code_Index provides an additional datatype index which is mapped to
6430 target-language built-in integers.
6431 - Code_Message provides an additional datatype message_string which is isomorphic to
6432 strings; messages are mapped to target-language strings.
6434 * New package for inductive predicates
6436 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6439 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6440 for z_1 :: U_1 and ... and z_n :: U_m
6442 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6445 with full support for type-inference, rather than
6447 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6449 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6450 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6452 inductive "s z_1 ... z_m"
6454 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6457 For backward compatibility, there is a wrapper allowing inductive
6458 sets to be defined with the new package via
6461 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6462 for z_1 :: U_1 and ... and z_n :: U_m
6464 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6470 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6471 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6472 for z_1 :: U_1 and ... and z_n :: U_m
6474 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6475 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6478 if the additional syntax "p ..." is required.
6480 Numerous examples can be found in the subdirectories src/HOL/Auth,
6481 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6485 - Since declaration and definition of inductive sets or predicates
6486 is no longer separated, abbreviations involving the newly
6487 introduced sets or predicates must be specified together with the
6488 introduction rules after the 'where' keyword (see above), rather
6489 than before the actual inductive definition.
6491 - The variables in induction and elimination rules are now
6492 quantified in the order of their occurrence in the introduction
6493 rules, rather than in alphabetical order. Since this may break
6494 some proofs, these proofs either have to be repaired, e.g. by
6495 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6496 statements of the form
6498 case (rule_i a_i_1 ... a_i_{k_i})
6500 or the old order of quantification has to be restored by explicitly adding
6501 meta-level quantifiers in the introduction rules, i.e.
6503 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6505 - The format of the elimination rules is now
6507 p z_1 ... z_m x_1 ... x_n ==>
6508 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6513 (x_1, ..., x_n) : s z_1 ... z_m ==>
6514 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6517 for sets rather than
6519 x : s z_1 ... z_m ==>
6520 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6523 This may require terms in goals to be expanded to n-tuples
6524 (e.g. using case_tac or simplification with the split_paired_all
6525 rule) before the above elimination rule is applicable.
6527 - The elimination or case analysis rules for (mutually) inductive
6528 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6529 list of rules "p_1_..._p_k.elims" is no longer available.
6531 * New package "function"/"fun" for general recursive functions,
6532 supporting mutual and nested recursion, definitions in local contexts,
6533 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6534 for small examples, and the separate tutorial on the function
6535 package. The old recdef "package" is still available as before, but
6536 users are encouraged to use the new package.
6538 * Method "lexicographic_order" automatically synthesizes termination
6539 relations as lexicographic combinations of size measures.
6541 * Case-expressions allow arbitrary constructor-patterns (including
6542 "_") and take their order into account, like in functional
6543 programming. Internally, this is translated into nested
6544 case-expressions; missing cases are added and mapped to the predefined
6545 constant "undefined". In complicated cases printing may no longer show
6546 the original input but the internal form. Lambda-abstractions allow
6547 the same form of pattern matching: "% pat1 => e1 | ..." is an
6548 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6551 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6552 is an abbreviation for "of_nat :: nat => int". The simplification
6553 rules for "of_nat" have been changed to work like "int" did
6554 previously. Potential INCOMPATIBILITY:
6555 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6556 - of_nat_diff and of_nat_mult are no longer default simp rules
6558 * Method "algebra" solves polynomial equations over (semi)rings using
6559 Groebner bases. The (semi)ring structure is defined by locales and the
6560 tool setup depends on that generic context. Installing the method for
6561 a specific type involves instantiating the locale and possibly adding
6562 declarations for computation on the coefficients. The method is
6563 already instantiated for natural numbers and for the axiomatic class
6564 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6565 CALCULEMUS 2007 for the general principles underlying this
6566 architecture of context-aware proof-tools.
6568 * Method "ferrack" implements quantifier elimination over
6569 special-purpose dense linear orders using locales (analogous to
6570 "algebra"). The method is already installed for class
6571 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6574 * Former constant "List.op @" now named "List.append". Use ML
6575 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6576 circumvent possible incompatibilities when working on ML level.
6578 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6580 * New function listsum :: 'a list => 'a for arbitrary monoids.
6581 Special syntax: "SUM x <- xs. f x" (and latex variants)
6583 * New syntax for Haskell-like list comprehension (input only), eg.
6584 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6586 * The special syntax for function "filter" has changed from [x :
6587 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6588 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6590 * [a..b] is now defined for arbitrary linear orders. It used to be
6591 defined on nat only, as an abbreviation for [a..<Suc b]
6594 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6596 * New functions "sorted" and "sort" in src/HOL/List.thy.
6598 * New lemma collection field_simps (an extension of ring_simps) for
6599 manipulating (in)equations involving division. Multiplies with all
6600 denominators that can be proved to be non-zero (in equations) or
6601 positive/negative (in inequations).
6603 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6604 have been improved and renamed to ring_simps, group_simps and
6605 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6606 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6608 * Theory Library/Commutative_Ring: switched from recdef to function
6609 package; constants add, mul, pow now curried. Infix syntax for
6610 algebraic operations.
6612 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6615 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6618 * HOL/records: generalised field-update to take a function on the
6619 field rather than the new value: r(|A := x|) is translated to A_update
6620 (K x) r The K-combinator that is internally used is called K_record.
6621 INCOMPATIBILITY: Usage of the plain update functions has to be
6624 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6625 * x = 0, which are required for a semiring. Richer structures do not
6626 inherit from semiring_0 anymore, because this property is a theorem
6627 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6628 there is more to prove, but this is mostly trivial.
6630 * Class "recpower" is generalized to arbitrary monoids, not just
6631 commutative semirings. INCOMPATIBILITY: may need to incorporate
6632 commutativity or semiring properties additionally.
6634 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6635 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6636 better use 'abbreviation'.
6638 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6640 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6641 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6642 significant changes for setting up numeral syntax for types:
6643 - New constants Numeral.pred and Numeral.succ instead
6644 of former Numeral.bin_pred and Numeral.bin_succ.
6645 - Use integer operations instead of bin_add, bin_mult and so on.
6646 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6647 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6649 See src/HOL/Integ/IntArith.thy for an example setup.
6651 * Command 'normal_form' computes the normal form of a term that may
6652 contain free variables. For example ``normal_form "rev [a, b, c]"''
6653 produces ``[b, c, a]'' (without proof). This command is suitable for
6654 heavy-duty computations because the functions are compiled to ML
6655 first. Correspondingly, a method "normalization" is provided. See
6656 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6658 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6659 25 like -->); output depends on the "iff" print_mode, the default is
6660 "A = B" (with priority 50).
6662 * Relations less (<) and less_eq (<=) are also available on type bool.
6663 Modified syntax to disallow nesting without explicit parentheses,
6664 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6667 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6669 * Relation composition operator "op O" now has precedence 75 and binds
6670 stronger than union and intersection. INCOMPATIBILITY.
6672 * The old set interval syntax "{m..n(}" (and relatives) has been
6673 removed. Use "{m..<n}" (and relatives) instead.
6675 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6676 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6677 ``declare [[simproc del: neq]]''.
6679 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6682 * Theorem Cons_eq_map_conv no longer declared as "simp".
6684 * Theorem setsum_mult renamed to setsum_right_distrib.
6686 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6689 * Reimplemented methods "sat" and "satx", with several improvements:
6690 goals no longer need to be stated as "<prems> ==> False", equivalences
6691 (i.e. "=" on type bool) are handled, variable names of the form
6692 "lit_<n>" are no longer reserved, significant speedup.
6694 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6695 zChaff is still supported as well.
6697 * 'inductive' and 'datatype': provide projections of mutual rules,
6698 bundled as foo_bar.inducts;
6700 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6703 * Library: moved theory Accessible_Part to main HOL.
6705 * Library: added theory Coinductive_List of potentially infinite lists
6706 as greatest fixed-point.
6708 * Library: added theory AssocList which implements (finite) maps as
6711 * Method "evaluation" solves goals (i.e. a boolean expression)
6712 efficiently by compiling it to ML. The goal is "proved" (via an
6713 oracle) if it evaluates to True.
6715 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6716 also when invoked by the simplifier. This results in the Simplifier
6717 being more powerful on arithmetic goals. INCOMPATIBILITY.
6718 Configuration option fast_arith_split_limit=0 recovers the old
6721 * Support for hex (0x20) and binary (0b1001) numerals.
6723 * New method: reify eqs (t), where eqs are equations for an
6724 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6725 parameter, computes a term s::'b and a list xs::'a list and proves the
6726 theorem I xs s = t. This is also known as reification or quoting. The
6727 resulting theorem is applied to the subgoal to substitute t with I xs
6728 s. If t is omitted, the subgoal itself is reified.
6730 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6731 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6732 where f is supposed to be a computable function (in the sense of code
6733 generattion). The method uses reify to compute s and xs as above then
6734 applies corr_thm and uses normalization by evaluation to "prove" f s =
6735 r and finally gets the theorem t = r, which is again applied to the
6736 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6738 * Reflection: Automatic reification now handels binding, an example is
6739 available in src/HOL/ex/ReflectionEx.thy
6741 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6742 command 'statespace' that is similar to 'record', but introduces an
6743 abstract specification based on the locale infrastructure instead of
6744 HOL types. This leads to extra flexibility in composing state spaces,
6745 in particular multiple inheritance and renaming of components.
6750 * Hyperreal: Functions root and sqrt are now defined on negative real
6751 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6752 Nonnegativity side conditions have been removed from many lemmas, so
6753 that more subgoals may now be solved by simplification; potential
6756 * Real: new type classes formalize real normed vector spaces and
6757 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6758 and norm :: 'a => real.
6760 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6761 reals into other types. The overloaded constant Reals :: 'a set is now
6762 defined as range of_real; potential INCOMPATIBILITY.
6764 * Real: proper support for ML code generation, including 'quickcheck'.
6765 Reals are implemented as arbitrary precision rationals.
6767 * Hyperreal: Several constants that previously worked only for the
6768 reals have been generalized, so they now work over arbitrary vector
6769 spaces. Type annotations may need to be added in some cases; potential
6772 Infinitesimal :: ('a::real_normed_vector) star set
6773 HFinite :: ('a::real_normed_vector) star set
6774 HInfinite :: ('a::real_normed_vector) star set
6775 approx :: ('a::real_normed_vector) star => 'a star => bool
6776 monad :: ('a::real_normed_vector) star => 'a star set
6777 galaxy :: ('a::real_normed_vector) star => 'a star set
6778 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6779 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6780 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6781 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6782 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6783 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6784 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6785 sgn :: 'a::real_normed_vector => 'a
6786 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6788 * Complex: Some complex-specific constants are now abbreviations for
6789 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6790 hnorm. Other constants have been entirely removed in favor of the
6791 polymorphic versions (INCOMPATIBILITY):
6795 HInfinite <-- CInfinite
6796 Infinitesimal <-- CInfinitesimal
6799 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6800 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6801 (ns)deriv <-- (ns)cderiv
6806 * Formalisation of ideals and the quotient construction over rings.
6808 * Order and lattice theory no longer based on records.
6811 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6812 greatest_closed. INCOMPATIBILITY.
6814 * Method algebra is now set up via an attribute. For examples see
6815 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6816 of algebraic structures.
6818 * Renamed theory CRing to Ring.
6823 * Substantial, yet incomplete support for nominal datatypes (binding
6824 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6825 src/HOL/Nominal/Examples. Prospective users should consult
6826 http://isabelle.in.tum.de/nominal/
6831 * ML basics: just one true type int, which coincides with IntInf.int
6834 * ML within Isar: antiquotations allow to embed statically-checked
6835 formal entities in the source, referring to the context available at
6836 compile-time. For example:
6838 ML {* @{sort "{zero,one}"} *}
6839 ML {* @{typ "'a => 'b"} *}
6840 ML {* @{term "%x. x"} *}
6841 ML {* @{prop "x == y"} *}
6842 ML {* @{ctyp "'a => 'b"} *}
6843 ML {* @{cterm "%x. x"} *}
6844 ML {* @{cprop "x == y"} *}
6845 ML {* @{thm asm_rl} *}
6846 ML {* @{thms asm_rl} *}
6847 ML {* @{type_name c} *}
6848 ML {* @{type_syntax c} *}
6849 ML {* @{const_name c} *}
6850 ML {* @{const_syntax c} *}
6853 ML {* @{theory Pure} *}
6854 ML {* @{theory_ref} *}
6855 ML {* @{theory_ref Pure} *}
6858 ML {* @{clasimpset} *}
6860 The same works for sources being ``used'' within an Isar context.
6862 * ML in Isar: improved error reporting; extra verbosity with
6863 ML_Context.trace enabled.
6865 * Pure/General/table.ML: the join operations now works via exceptions
6866 DUP/SAME instead of type option. This is simpler in simple cases, and
6867 admits slightly more efficient complex applications.
6869 * Pure: 'advanced' translation functions (parse_translation etc.) now
6870 use Context.generic instead of just theory.
6872 * Pure: datatype Context.generic joins theory/Proof.context and
6873 provides some facilities for code that works in either kind of
6874 context, notably GenericDataFun for uniform theory and proof data.
6876 * Pure: simplified internal attribute type, which is now always
6877 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6878 local (Proof.context) attributes have been discontinued, while
6879 minimizing code duplication. Thm.rule_attribute and
6880 Thm.declaration_attribute build canonical attributes; see also structure
6881 Context for further operations on Context.generic, notably
6882 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6883 declarations and definitions.
6885 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6886 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6887 init only required for impure data. INCOMPATIBILITY: empty really need
6888 to be empty (no dependencies on theory content!)
6890 * Pure/kernel: consts certification ignores sort constraints given in
6891 signature declarations. (This information is not relevant to the
6892 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6893 potential INCOMPATIBILITY.
6895 * Pure: axiomatic type classes are now purely definitional, with
6896 explicit proofs of class axioms and super class relations performed
6897 internally. See Pure/axclass.ML for the main internal interfaces --
6898 notably AxClass.define_class supercedes AxClass.add_axclass, and
6899 AxClass.axiomatize_class/classrel/arity supersede
6900 Sign.add_classes/classrel/arities.
6902 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6903 global/local versions on theory vs. Proof.context have been
6904 discontinued; Attrib.syntax and Method.syntax have been adapted
6905 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6906 attributes, methods, etc.
6908 * Pure: several functions of signature "... -> theory -> theory * ..."
6909 have been reoriented to "... -> theory -> ... * theory" in order to
6910 allow natural usage in combination with the ||>, ||>>, |-> and
6911 fold_map combinators.
6913 * Pure: official theorem names (closed derivations) and additional
6914 comments (tags) are now strictly separate. Name hints -- which are
6915 maintained as tags -- may be attached any time without affecting the
6918 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6919 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6920 achieve the old behaviour.
6922 * Pure: the "Goal" constant is now called "prop", supporting a
6923 slightly more general idea of ``protecting'' meta-level rule
6926 * Pure: Logic.(un)varify only works in a global context, which is now
6927 enforced instead of silently assumed. INCOMPATIBILITY, may use
6928 Logic.legacy_(un)varify as temporary workaround.
6930 * Pure: structure Name provides scalable operations for generating
6931 internal variable names, notably Name.variants etc. This replaces
6932 some popular functions from term.ML:
6934 Term.variant -> Name.variant
6935 Term.variantlist -> Name.variant_list
6936 Term.invent_names -> Name.invent_list
6938 Note that low-level renaming rarely occurs in new code -- operations
6939 from structure Variable are used instead (see below).
6941 * Pure: structure Variable provides fundamental operations for proper
6942 treatment of fixed/schematic variables in a context. For example,
6943 Variable.import introduces fixes for schematics of given facts and
6944 Variable.export reverses the effect (up to renaming) -- this replaces
6945 various freeze_thaw operations.
6947 * Pure: structure Goal provides simple interfaces for
6948 init/conclude/finish and tactical prove operations (replacing former
6949 Tactic.prove). Goal.prove is the canonical way to prove results
6950 within a given context; Goal.prove_global is a degraded version for
6951 theory level goals, including a global Drule.standard. Note that
6952 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6953 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6954 in a locale context).
6956 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6957 and type checking (Syntax.check_term etc.), with common combinations
6958 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6959 which are considered legacy and await removal.
6961 * Pure/Syntax: generic interfaces for type unchecking
6962 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6963 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6964 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6965 available for convenience, but refer to the very same operations using
6966 a mere theory instead of a full context.
6968 * Isar: simplified treatment of user-level errors, using exception
6969 ERROR of string uniformly. Function error now merely raises ERROR,
6970 without any side effect on output channels. The Isar toplevel takes
6971 care of proper display of ERROR exceptions. ML code may use plain
6972 handle/can/try; cat_error may be used to concatenate errors like this:
6974 ... handle ERROR msg => cat_error msg "..."
6976 Toplevel ML code (run directly or through the Isar toplevel) may be
6977 embedded into the Isar toplevel with exception display/debug like
6980 Isar.toplevel (fn () => ...)
6982 INCOMPATIBILITY, removed special transform_error facilities, removed
6983 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6984 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6985 -- use plain ERROR instead.
6987 * Isar: theory setup now has type (theory -> theory), instead of a
6988 list. INCOMPATIBILITY, may use #> to compose setup functions.
6990 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6991 ProofContext.debug/verbose flags.
6993 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6994 theory before entering a proof state. Transactions now always see a
6995 quasi-functional intermediate checkpoint, both in interactive and
6998 * Isar: simplified interfaces for outer syntax. Renamed
6999 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7000 OuterSyntax.add_parsers -- this functionality is now included in
7001 OuterSyntax.command etc. INCOMPATIBILITY.
7003 * Simplifier: the simpset of a running simplification process now
7004 contains a proof context (cf. Simplifier.the_context), which is the
7005 very context that the initial simpset has been retrieved from (by
7006 simpset_of/local_simpset_of). Consequently, all plug-in components
7007 (solver, looper etc.) may depend on arbitrary proof data.
7009 * Simplifier.inherit_context inherits the proof context (plus the
7010 local bounds) of the current simplification process; any simproc
7011 etc. that calls the Simplifier recursively should do this! Removed
7012 former Simplifier.inherit_bounds, which is already included here --
7013 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7014 specify an explicit context using Simplifier.context/theory_context.
7016 * Simplifier/Classical Reasoner: more abstract interfaces
7017 change_simpset/claset for modifying the simpset/claset reference of a
7018 theory; raw versions simpset/claset_ref etc. have been discontinued --
7021 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7027 * settings: the default heap location within ISABELLE_HOME_USER now
7028 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7029 Isabelle installations.
7031 * isabelle-process: option -S (secure mode) disables some critical
7032 operations, notably runtime compilation and evaluation of ML source
7035 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7037 * Support for parallel execution, using native multicore support of
7038 Poly/ML 5.1. The theory loader exploits parallelism when processing
7039 independent theories, according to the given theory header
7040 specifications. The maximum number of worker threads is specified via
7041 usedir option -M or the "max-threads" setting in Proof General. A
7042 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7043 to 6 on a 8-core machine. User-code needs to observe certain
7044 guidelines for thread-safe programming, see appendix A in the Isar
7045 Implementation manual.
7049 New in Isabelle2005 (October 2005)
7050 ----------------------------------
7054 * Theory headers: the new header syntax for Isar theories is
7057 imports <theory1> ... <theoryN>
7058 uses <file1> ... <fileM>
7061 where the 'uses' part is optional. The previous syntax
7063 theory <name> = <theory1> + ... + <theoryN>:
7065 will disappear in the next release. Use isatool fixheaders to convert
7066 existing theory files. Note that there is no change in ancient
7067 non-Isar theories now, but these will disappear soon.
7069 * Theory loader: parent theories can now also be referred to via
7070 relative and absolute paths.
7072 * Command 'find_theorems' searches for a list of criteria instead of a
7073 list of constants. Known criteria are: intro, elim, dest, name:string,
7074 simp:term, and any term. Criteria can be preceded by '-' to select
7075 theorems that do not match. Intro, elim, dest select theorems that
7076 match the current goal, name:s selects theorems whose fully qualified
7077 name contain s, and simp:term selects all simplification rules whose
7078 lhs match term. Any other term is interpreted as pattern and selects
7079 all theorems matching the pattern. Available in ProofGeneral under
7080 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7082 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7084 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7085 matching the current goal as introduction rule and not having "HOL."
7086 in their name (i.e. not being defined in theory HOL).
7088 * Command 'thms_containing' has been discontinued in favour of
7089 'find_theorems'; INCOMPATIBILITY.
7091 * Communication with Proof General is now 8bit clean, which means that
7092 Unicode text in UTF-8 encoding may be used within theory texts (both
7093 formal and informal parts). Cf. option -U of the Isabelle Proof
7094 General interface. Here are some simple examples (cf. src/HOL/ex):
7096 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7097 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7099 * Improved efficiency of the Simplifier and, to a lesser degree, the
7100 Classical Reasoner. Typical big applications run around 2 times
7104 *** Document preparation ***
7106 * Commands 'display_drafts' and 'print_drafts' perform simple output
7107 of raw sources. Only those symbols that do not require additional
7108 LaTeX packages (depending on comments in isabellesym.sty) are
7109 displayed properly, everything else is left verbatim. isatool display
7110 and isatool print are used as front ends (these are subject to the
7111 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7113 * Command tags control specific markup of certain regions of text,
7114 notably folding and hiding. Predefined tags include "theory" (for
7115 theory begin and end), "proof" for proof commands, and "ML" for
7116 commands involving ML code; the additional tags "visible" and
7117 "invisible" are unused by default. Users may give explicit tag
7118 specifications in the text, e.g. ''by %invisible (auto)''. The
7119 interpretation of tags is determined by the LaTeX job during document
7120 preparation: see option -V of isatool usedir, or options -n and -t of
7121 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7124 Several document versions may be produced at the same time via isatool
7125 usedir (the generated index.html will link all of them). Typical
7126 specifications include ''-V document=theory,proof,ML'' to present
7127 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7128 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7129 these parts without any formal replacement text. The Isabelle site
7130 default settings produce ''document'' and ''outline'' versions as
7133 * Several new antiquotations:
7135 @{term_type term} prints a term with its type annotated;
7137 @{typeof term} prints the type of a term;
7139 @{const const} is the same as @{term const}, but checks that the
7140 argument is a known logical constant;
7142 @{term_style style term} and @{thm_style style thm} print a term or
7143 theorem applying a "style" to it
7147 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7148 definitions, equations, inequations etc., 'concl' printing only the
7149 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7150 to print the specified premise. TermStyle.add_style provides an ML
7151 interface for introducing further styles. See also the "LaTeX Sugar"
7152 document practical applications. The ML antiquotation prints
7153 type-checked ML expressions verbatim.
7155 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7156 and 'text' support optional locale specification '(in loc)', which
7157 specifies the default context for interpreting antiquotations. For
7158 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7160 * Option 'locale=NAME' of antiquotations specifies an alternative
7161 context interpreting the subsequent argument. For example: @{thm
7162 [locale=lattice] inf_assoc}.
7164 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7167 * Proper output of antiquotations for theory commands involving a
7168 proof context (such as 'locale' or 'theorem (in loc) ...').
7170 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7171 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7173 * isatool usedir: new option -C (default true) controls whether option
7174 -D should include a copy of the original document directory; -C false
7175 prevents unwanted effects such as copying of administrative CVS data.
7180 * Considerably improved version of 'constdefs' command. Now performs
7181 automatic type-inference of declared constants; additional support for
7182 local structure declarations (cf. locales and HOL records), see also
7183 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7184 sequential dependencies of definitions within a single 'constdefs'
7185 section; moreover, the declared name needs to be an identifier. If
7186 all fails, consider to fall back on 'consts' and 'defs' separately.
7188 * Improved indexed syntax and implicit structures. First of all,
7189 indexed syntax provides a notational device for subscripted
7190 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7191 expressions. Secondly, in a local context with structure
7192 declarations, number indexes \<^sub>n or the empty index (default
7193 number 1) refer to a certain fixed variable implicitly; option
7194 show_structs controls printing of implicit structures. Typical
7195 applications of these concepts involve record types and locales.
7197 * New command 'no_syntax' removes grammar declarations (and
7198 translations) resulting from the given syntax specification, which is
7199 interpreted in the same manner as for the 'syntax' command.
7201 * 'Advanced' translation functions (parse_translation etc.) may depend
7202 on the signature of the theory context being presently used for
7203 parsing/printing, see also isar-ref manual.
7205 * Improved 'oracle' command provides a type-safe interface to turn an
7206 ML expression of type theory -> T -> term into a primitive rule of
7207 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7208 is already included here); see also FOL/ex/IffExample.thy;
7211 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7212 before); "cI" is no longer bound, use "c.intro" instead.
7213 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7214 axclasses vs. locales.
7216 * Improved internal renaming of symbolic identifiers -- attach primes
7217 instead of base 26 numbers.
7219 * New flag show_question_marks controls printing of leading question
7220 marks in schematic variable names.
7222 * In schematic variable names, *any* symbol following \<^isub> or
7223 \<^isup> is now treated as part of the base name. For example, the
7224 following works without printing of awkward ".0" indexes:
7226 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7229 * Inner syntax includes (*(*nested*) comments*).
7231 * Pretty printer now supports unbreakable blocks, specified in mixfix
7232 annotations as "(00...)".
7234 * Clear separation of logical types and nonterminals, where the latter
7235 may only occur in 'syntax' specifications or type abbreviations.
7236 Before that distinction was only partially implemented via type class
7237 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7238 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7239 exotic syntax specifications may require further adaption
7240 (e.g. Cube/Cube.thy).
7242 * Removed obsolete type class "logic", use the top sort {} instead.
7243 Note that non-logical types should be declared as 'nonterminals'
7244 rather than 'types'. INCOMPATIBILITY for new object-logic
7247 * Attributes 'induct' and 'cases': type or set names may now be
7248 locally fixed variables as well.
7250 * Simplifier: can now control the depth to which conditional rewriting
7251 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7254 * Simplifier: simplification procedures may now take the current
7255 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7256 interface), which is very useful for calling the Simplifier
7257 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7258 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7259 low-level mk_simproc no longer applies Logic.varify internally, to
7260 allow for use in a context of fixed variables.
7262 * thin_tac now works even if the assumption being deleted contains !!
7263 or ==>. More generally, erule now works even if the major premise of
7264 the elimination rule contains !! or ==>.
7266 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7268 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7269 from Pure, which contains all common declarations already. Both
7270 theories are defined via plain Isabelle/Isar .thy files.
7271 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7272 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7273 use isatool fixcpure to adapt your theory and ML sources.
7275 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7276 selections of theorems in named facts via index ranges.
7278 * 'print_theorems': in theory mode, really print the difference
7279 wrt. the last state (works for interactive theory development only),
7280 in proof mode print all local facts (cf. 'print_facts');
7282 * 'hide': option '(open)' hides only base names.
7284 * More efficient treatment of intermediate checkpoints in interactive
7287 * Code generator is now invoked via code_module (incremental code
7288 generation) and code_library (modular code generation, ML structures
7289 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7290 must be quoted when used as identifiers.
7292 * New 'value' command for reading, evaluating and printing terms using
7293 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7294 quoted when used as identifier.
7299 * New commands for the interpretation of locale expressions in
7300 theories (1), locales (2) and proof contexts (3). These generate
7301 proof obligations from the expression specification. After the
7302 obligations have been discharged, theorems of the expression are added
7303 to the theory, target locale or proof context. The synopsis of the
7304 commands is a follows:
7306 (1) interpretation expr inst
7307 (2) interpretation target < expr
7308 (3) interpret expr inst
7310 Interpretation in theories and proof contexts require a parameter
7311 instantiation of terms from the current context. This is applied to
7312 specifications and theorems of the interpreted expression.
7313 Interpretation in locales only permits parameter renaming through the
7314 locale expression. Interpretation is smart in that interpretations
7315 that are active already do not occur in proof obligations, neither are
7316 instantiated theorems stored in duplicate. Use 'print_interps' to
7317 inspect active interpretations of a particular locale. For details,
7318 see the Isar Reference manual. Examples can be found in
7319 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7321 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7322 'interpret' instead.
7324 * New context element 'constrains' for adding type constraints to
7327 * Context expressions: renaming of parameters with syntax
7330 * Locale declaration: 'includes' disallowed.
7332 * Proper static binding of attribute syntax -- i.e. types / terms /
7333 facts mentioned as arguments are always those of the locale definition
7334 context, independently of the context of later invocations. Moreover,
7335 locale operations (renaming and type / term instantiation) are applied
7336 to attribute arguments as expected.
7338 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7339 actual attributes; rare situations may require Attrib.attribute to
7340 embed those attributes into Attrib.src that lack concrete syntax.
7341 Attribute implementations need to cooperate properly with the static
7342 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7343 Attrib.XXX_thm etc. already do the right thing without further
7344 intervention. Only unusual applications -- such as "where" or "of"
7345 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7346 on the context and the facts involved -- may have to assign parsed
7347 values to argument tokens explicitly.
7349 * Changed parameter management in theorem generation for long goal
7350 statements with 'includes'. INCOMPATIBILITY: produces a different
7351 theorem statement in rare situations.
7353 * Locale inspection command 'print_locale' omits notes elements. Use
7354 'print_locale!' to have them included in the output.
7359 * Provers/hypsubst.ML: improved version of the subst method, for
7360 single-step rewriting: it now works in bound variable contexts. New is
7361 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7362 rewrite a different subterm than the original subst method, which is
7363 still available as 'simplesubst'.
7365 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7368 * Provers/trancl.ML: new transitivity reasoner for transitive and
7369 reflexive-transitive closure of relations.
7371 * Provers/blast.ML: new reference depth_limit to make blast's depth
7372 limit (previously hard-coded with a value of 20) user-definable.
7374 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7375 is peformed already. Object-logics merely need to finish their
7376 initial simpset configuration as before. INCOMPATIBILITY.
7381 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7384 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7386 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7387 and x-symbol; use option '-m epsilon' to get it actually printed.
7388 Moreover, the mathematically important symbolic identifier \<epsilon>
7389 becomes available as variable, constant etc. INCOMPATIBILITY,
7391 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7392 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7393 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7394 support corresponding Isar calculations.
7396 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7399 * theory SetInterval: changed the syntax for open intervals:
7408 The old syntax is still supported but will disappear in the next
7409 release. For conversion use the following Emacs search and replace
7410 patterns (these are not perfect but work quite well):
7412 {)\([^\.]*\)\.\. -> {\1<\.\.}
7413 \.\.\([^(}]*\)(} -> \.\.<\1}
7415 * Theory Commutative_Ring (in Library): method comm_ring for proving
7416 equalities in commutative rings; method 'algebra' provides a generic
7419 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7420 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7421 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7424 Some new syntax forms are available:
7426 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7427 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7428 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7429 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7431 The latter form "\<Sum>x < k. e" used to be based on a separate
7432 function "Summation", which has been discontinued.
7434 * theory Finite_Set: in structured induction proofs, the insert case
7435 is now 'case (insert x F)' instead of the old counterintuitive 'case
7438 * The 'refute' command has been extended to support a much larger
7439 fragment of HOL, including axiomatic type classes, constdefs and
7440 typedefs, inductive datatypes and recursion.
7442 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7443 Requires zChaff with proof generation to be installed. See
7444 HOL/ex/SAT_Examples.thy for examples.
7446 * Datatype induction via method 'induct' now preserves the name of the
7447 induction variable. For example, when proving P(xs::'a list) by
7448 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7449 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7450 in unstructured proof scripts.
7452 * Reworked implementation of records. Improved scalability for
7453 records with many fields, avoiding performance problems for type
7454 inference. Records are no longer composed of nested field types, but
7455 of nested extension types. Therefore the record type only grows linear
7456 in the number of extensions and not in the number of fields. The
7457 top-level (users) view on records is preserved. Potential
7458 INCOMPATIBILITY only in strange cases, where the theory depends on the
7459 old record representation. The type generated for a record is called
7460 <record_name>_ext_type.
7462 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7463 proofs triggered by a record definition or a simproc (if
7464 quick_and_dirty is enabled). Definitions of large records can take
7467 New simproc record_upd_simproc for simplification of multiple record
7468 updates enabled by default. Moreover, trivial updates are also
7469 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7470 occasionally, since simplification is more powerful by default.
7472 * typedef: proper support for polymorphic sets, which contain extra
7473 type-variables in the term.
7475 * Simplifier: automatically reasons about transitivity chains
7476 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7477 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7478 old proofs break occasionally as simplification may now solve more
7479 goals than previously.
7481 * Simplifier: converts x <= y into x = y if assumption y <= x is
7482 present. Works for all partial orders (class "order"), in particular
7483 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7486 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7487 bound variable or a constant then the let is unfolded. Otherwise
7488 first a is simplified to b, and then f b is simplified to g. If
7489 possible we abstract b from g arriving at "let x = b in h x",
7490 otherwise we unfold the let and arrive at g. The simproc can be
7491 enabled/disabled by the reference use_let_simproc. Potential
7492 INCOMPATIBILITY since simplification is more powerful by default.
7494 * Classical reasoning: the meson method now accepts theorems as arguments.
7496 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7497 jobs to provide advice on the provability of subgoals.
7499 * Theory OrderedGroup and Ring_and_Field: various additions and
7500 improvements to faciliate calculations involving equalities and
7503 The following theorems have been eliminated or modified
7506 abs_eq now named abs_of_nonneg
7507 abs_of_ge_0 now named abs_of_nonneg
7508 abs_minus_eq now named abs_of_nonpos
7509 imp_abs_id now named abs_of_nonneg
7510 imp_abs_neg_id now named abs_of_nonpos
7511 mult_pos now named mult_pos_pos
7512 mult_pos_le now named mult_nonneg_nonneg
7513 mult_pos_neg_le now named mult_nonneg_nonpos
7514 mult_pos_neg2_le now named mult_nonneg_nonpos2
7515 mult_neg now named mult_neg_neg
7516 mult_neg_le now named mult_nonpos_nonpos
7518 * The following lemmas in Ring_and_Field have been added to the simplifier:
7521 not_square_less_zero
7523 The following lemmas have been deleted from Real/RealPow:
7533 * Theory Parity: added rules for simplifying exponents.
7537 The following theorems have been eliminated or modified
7540 list_all_Nil now named list_all.simps(1)
7541 list_all_Cons now named list_all.simps(2)
7542 list_all_conv now named list_all_iff
7543 set_mem_eq now named mem_iff
7545 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7546 asymptotic "big O" calculations. See the notes in BigO.thy.
7551 * Theory RealDef: better support for embedding natural numbers and
7552 integers in the reals.
7554 The following theorems have been eliminated or modified
7557 exp_ge_add_one_self now requires no hypotheses
7558 real_of_int_add reversed direction of equality (use [symmetric])
7559 real_of_int_minus reversed direction of equality (use [symmetric])
7560 real_of_int_diff reversed direction of equality (use [symmetric])
7561 real_of_int_mult reversed direction of equality (use [symmetric])
7563 * Theory RComplete: expanded support for floor and ceiling functions.
7565 * Theory Ln is new, with properties of the natural logarithm
7567 * Hyperreal: There is a new type constructor "star" for making
7568 nonstandard types. The old type names are now type synonyms:
7572 hcomplex = complex star
7574 * Hyperreal: Many groups of similarly-defined constants have been
7575 replaced by polymorphic versions (INCOMPATIBILITY):
7577 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7579 starset <-- starsetNat, starsetC
7580 *s* <-- *sNat*, *sc*
7581 starset_n <-- starsetNat_n, starsetC_n
7582 *sn* <-- *sNatn*, *scn*
7583 InternalSets <-- InternalNatSets, InternalCSets
7585 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7586 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7587 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7588 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7589 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7591 * Hyperreal: Many type-specific theorems have been removed in favor of
7592 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7594 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7595 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7596 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7597 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7598 right_minus <-- hypreal_add_minus
7599 left_minus <-- {hypreal,hcomplex}_add_minus_left
7600 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7601 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7602 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7603 mult_1_right <-- hcomplex_mult_one_right
7604 mult_zero_left <-- hcomplex_mult_zero_left
7605 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7606 right_distrib <-- hypnat_add_mult_distrib2
7607 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7608 right_inverse <-- hypreal_mult_inverse
7609 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7610 order_refl <-- {hypreal,hypnat}_le_refl
7611 order_trans <-- {hypreal,hypnat}_le_trans
7612 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7613 order_less_le <-- {hypreal,hypnat}_less_le
7614 linorder_linear <-- {hypreal,hypnat}_le_linear
7615 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7616 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7617 add_nonneg_nonneg <-- hypreal_le_add_order
7619 * Hyperreal: Separate theorems having to do with type-specific
7620 versions of constants have been merged into theorems that apply to the
7621 new polymorphic constants (INCOMPATIBILITY):
7623 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7624 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7625 STAR_Un <-- {STAR,NatStar,STARC}_Un
7626 STAR_Int <-- {STAR,NatStar,STARC}_Int
7627 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7628 STAR_subset <-- {STAR,NatStar,STARC}_subset
7629 STAR_mem <-- {STAR,NatStar,STARC}_mem
7630 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7631 STAR_diff <-- {STAR,STARC}_diff
7632 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7633 STARC_hcomplex_of_complex}_image_subset
7634 starset_n_Un <-- starset{Nat,C}_n_Un
7635 starset_n_Int <-- starset{Nat,C}_n_Int
7636 starset_n_Compl <-- starset{Nat,C}_n_Compl
7637 starset_n_diff <-- starset{Nat,C}_n_diff
7638 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7639 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7640 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7641 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7642 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7643 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7644 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7645 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7646 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7647 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7648 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7649 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7650 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7651 starfun_diff <-- starfun{C,RC,CR}_diff
7652 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7653 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7654 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7655 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7656 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7657 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7658 starfun_Id <-- starfunC_Id
7659 starfun_approx <-- starfun{Nat,CR}_approx
7660 starfun_capprox <-- starfun{C,RC}_capprox
7661 starfun_abs <-- starfunNat_rabs
7662 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7663 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7664 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7665 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7666 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7667 starfun_add_approx <-- starfunCR_add_approx
7668 starfun_inverse_inverse <-- starfunC_inverse_inverse
7669 starfun_divide <-- starfun{C,CR,RC}_divide
7670 starfun_n <-- starfun{Nat,C}_n
7671 starfun_n_mult <-- starfun{Nat,C}_n_mult
7672 starfun_n_add <-- starfun{Nat,C}_n_add
7673 starfun_n_add_minus <-- starfunNat_n_add_minus
7674 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7675 starfun_n_minus <-- starfun{Nat,C}_n_minus
7676 starfun_n_eq <-- starfun{Nat,C}_n_eq
7678 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7679 star_n_minus <-- {hypreal,hcomplex}_minus
7680 star_n_diff <-- {hypreal,hcomplex}_diff
7681 star_n_mult <-- {hypreal,hcomplex}_mult
7682 star_n_inverse <-- {hypreal,hcomplex}_inverse
7683 star_n_le <-- {hypreal,hypnat}_le
7684 star_n_less <-- {hypreal,hypnat}_less
7685 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7686 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7687 star_n_abs <-- hypreal_hrabs
7688 star_n_divide <-- hcomplex_divide
7690 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7691 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7692 star_of_diff <-- hypreal_of_real_diff
7693 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7694 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7695 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7696 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7697 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7698 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7699 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7700 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7701 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7702 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7703 star_of_number_of <-- {hypreal,hcomplex}_number_of
7704 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7705 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7706 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7707 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7708 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7709 star_of_power <-- hypreal_of_real_power
7710 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7712 * Hyperreal: new method "transfer" that implements the transfer
7713 principle of nonstandard analysis. With a subgoal that mentions
7714 nonstandard types like "'a star", the command "apply transfer"
7715 replaces it with an equivalent one that mentions only standard types.
7716 To be successful, all free variables must have standard types; non-
7717 standard variables must have explicit universal quantifiers.
7719 * Hyperreal: A theory of Taylor series.
7724 * Discontinued special version of 'constdefs' (which used to support
7725 continuous functions) in favor of the general Pure one with full
7728 * New simplification procedure for solving continuity conditions; it
7729 is much faster on terms with many nested lambda abstractions (cubic
7730 instead of exponential time).
7732 * New syntax for domain package: selector names are now optional.
7733 Parentheses should be omitted unless argument is lazy, for example:
7735 domain 'a stream = cons "'a" (lazy "'a stream")
7737 * New command 'fixrec' for defining recursive functions with pattern
7738 matching; defining multiple functions with mutual recursion is also
7739 supported. Patterns may include the constants cpair, spair, up, sinl,
7740 sinr, or any data constructor defined by the domain package. The given
7741 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7742 syntax and examples.
7744 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7745 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7746 but the proof obligation additionally includes an admissibility
7747 requirement. The packages generate instances of class cpo or pcpo,
7748 with continuity and strictness theorems for Rep and Abs.
7750 * HOLCF: Many theorems have been renamed according to a more standard naming
7751 scheme (INCOMPATIBILITY):
7753 foo_inject: "foo$x = foo$y ==> x = y"
7754 foo_eq: "(foo$x = foo$y) = (x = y)"
7755 foo_less: "(foo$x << foo$y) = (x << y)"
7756 foo_strict: "foo$UU = UU"
7757 foo_defined: "... ==> foo$x ~= UU"
7758 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7763 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7764 including the First Isomorphism Theorem (on quotienting by the kernel
7767 * ZF/Simplifier: install second copy of type solver that actually
7768 makes use of TC rules declared to Isar proof contexts (or locales);
7769 the old version is still required for ML proof scripts.
7774 * Converted to Isar theory format; use locales instead of axiomatic
7780 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7783 * Pure/library.ML no longer defines its own option datatype, but uses
7784 that of the SML basis, which has constructors NONE and SOME instead of
7785 None and Some, as well as exception Option.Option instead of OPTION.
7786 The functions the, if_none, is_some, is_none have been adapted
7787 accordingly, while Option.map replaces apsome.
7789 * Pure/library.ML: the exception LIST has been given up in favour of
7790 the standard exceptions Empty and Subscript, as well as
7791 Library.UnequalLengths. Function like Library.hd and Library.tl are
7792 superceded by the standard hd and tl functions etc.
7794 A number of basic list functions are no longer exported to the ML
7795 toplevel, as they are variants of predefined functions. The following
7796 suggests how one can translate existing code:
7798 rev_append xs ys = List.revAppend (xs, ys)
7799 nth_elem (i, xs) = List.nth (xs, i)
7800 last_elem xs = List.last xs
7801 flat xss = List.concat xss
7802 seq fs = List.app fs
7803 partition P xs = List.partition P xs
7804 mapfilter f xs = List.mapPartial f xs
7806 * Pure/library.ML: several combinators for linear functional
7807 transformations, notably reverse application and composition:
7810 (x, y) |-> f f #-> g
7812 * Pure/library.ML: introduced/changed precedence of infix operators:
7814 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7816 infix 3 o oo ooo oooo;
7817 infix 4 ~~ upto downto;
7819 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7822 * Pure/library.ML: natural list combinators fold, fold_rev, and
7823 fold_map support linear functional transformations and nesting. For
7826 fold f [x1, ..., xN] y =
7827 y |> f x1 |> ... |> f xN
7829 (fold o fold) f [xs1, ..., xsN] y =
7830 y |> fold f xs1 |> ... |> fold f xsN
7832 fold f [x1, ..., xN] =
7835 (fold o fold) f [xs1, ..., xsN] =
7836 fold f xs1 #> ... #> fold f xsN
7838 * Pure/library.ML: the following selectors on type 'a option are
7841 the: 'a option -> 'a (*partial*)
7842 these: 'a option -> 'a where 'a = 'b list
7843 the_default: 'a -> 'a option -> 'a
7844 the_list: 'a option -> 'a list
7846 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7847 basic operations for association lists, following natural argument
7848 order; moreover the explicit equality predicate passed here avoids
7849 potentially expensive polymorphic runtime equality checks.
7850 The old functions may be expressed as follows:
7852 assoc = uncurry (AList.lookup (op =))
7853 assocs = these oo AList.lookup (op =)
7854 overwrite = uncurry (AList.update (op =)) o swap
7856 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7858 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7859 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7861 replacing make_keylist and keyfilter (occassionally used)
7864 make_keylist = AList.make
7865 keyfilter = AList.find (op =)
7867 * eq_fst and eq_snd now take explicit equality parameter, thus
7868 avoiding eqtypes. Naive rewrites:
7870 eq_fst = eq_fst (op =)
7871 eq_snd = eq_snd (op =)
7873 * Removed deprecated apl and apr (rarely used).
7876 apl (n, op) =>>= curry op n
7877 apr (op, m) =>>= fn n => op (n, m)
7879 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7880 provides a reasonably efficient light-weight implementation of sets as
7883 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7884 few new operations; existing lookup and update are now curried to
7885 follow natural argument order (for use with fold etc.);
7886 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7888 * Pure/General: output via the Isabelle channels of
7889 writeln/warning/error etc. is now passed through Output.output, with a
7890 hook for arbitrary transformations depending on the print_mode
7891 (cf. Output.add_mode -- the first active mode that provides a output
7892 function wins). Already formatted output may be embedded into further
7893 text via Output.raw; the result of Pretty.string_of/str_of and derived
7894 functions (string_of_term/cterm/thm etc.) is already marked raw to
7895 accommodate easy composition of diagnostic messages etc. Programmers
7896 rarely need to care about Output.output or Output.raw at all, with
7897 some notable exceptions: Output.output is required when bypassing the
7898 standard channels (writeln etc.), or in token translations to produce
7899 properly formatted results; Output.raw is required when capturing
7900 already output material that will eventually be presented to the user
7901 a second time. For the default print mode, both Output.output and
7902 Output.raw have no effect.
7904 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7905 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7906 cumulative results are displayed at the end of a batch session.
7908 * Pure/General: File.sysify_path and File.quote_sysify path have been
7909 replaced by File.platform_path and File.shell_path (with appropriate
7910 hooks). This provides a clean interface for unusual systems where the
7911 internal and external process view of file names are different.
7913 * Pure: more efficient orders for basic syntactic entities: added
7914 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7915 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7916 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7917 orders now -- potential INCOMPATIBILITY for code that depends on a
7918 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7919 Library.sort_strings on result).
7921 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7922 fold_types traverse types/terms from left to right, observing natural
7923 argument order. Supercedes previous foldl_XXX versions, add_frees,
7924 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7926 * Pure: name spaces have been refined, with significant changes of the
7927 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7928 to extern(_table). The plain name entry path is superceded by a
7929 general 'naming' context, which also includes the 'policy' to produce
7930 a fully qualified name and external accesses of a fully qualified
7931 name; NameSpace.extend is superceded by context dependent
7932 Sign.declare_name. Several theory and proof context operations modify
7933 the naming context. Especially note Theory.restore_naming and
7934 ProofContext.restore_naming to get back to a sane state; note that
7935 Theory.add_path is no longer sufficient to recover from
7936 Theory.absolute_path in particular.
7938 * Pure: new flags short_names (default false) and unique_names
7939 (default true) for controlling output of qualified names. If
7940 short_names is set, names are printed unqualified. If unique_names is
7941 reset, the name prefix is reduced to the minimum required to achieve
7942 the original result when interning again, even if there is an overlap
7943 with earlier declarations.
7945 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7946 now 'extend', and 'merge' gets an additional Pretty.pp argument
7947 (useful for printing error messages). INCOMPATIBILITY.
7949 * Pure: major reorganization of the theory context. Type Sign.sg and
7950 Theory.theory are now identified, referring to the universal
7951 Context.theory (see Pure/context.ML). Actual signature and theory
7952 content is managed as theory data. The old code and interfaces were
7953 spread over many files and structures; the new arrangement introduces
7954 considerable INCOMPATIBILITY to gain more clarity:
7956 Context -- theory management operations (name, identity, inclusion,
7957 parents, ancestors, merge, etc.), plus generic theory data;
7959 Sign -- logical signature and syntax operations (declaring consts,
7960 types, etc.), plus certify/read for common entities;
7962 Theory -- logical theory operations (stating axioms, definitions,
7963 oracles), plus a copy of logical signature operations (consts,
7964 types, etc.); also a few basic management operations (Theory.copy,
7967 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7968 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7969 for convenience -- they merely return the theory.
7971 * Pure: type Type.tsig is superceded by theory in most interfaces.
7973 * Pure: the Isar proof context type is already defined early in Pure
7974 as Context.proof (note that ProofContext.context and Proof.context are
7975 aliases, where the latter is the preferred name). This enables other
7976 Isabelle components to refer to that type even before Isar is present.
7978 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7979 typeK, constK, axiomK, oracleK), but provide explicit operations for
7980 any of these kinds. For example, Sign.intern typeK is now
7981 Sign.intern_type, Theory.hide_space Sign.typeK is now
7982 Theory.hide_types. Also note that former
7983 Theory.hide_classes/types/consts are now
7984 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7985 internalize their arguments! INCOMPATIBILITY.
7987 * Pure: get_thm interface (of PureThy and ProofContext) expects
7988 datatype thmref (with constructors Name and NameSelection) instead of
7989 plain string -- INCOMPATIBILITY;
7991 * Pure: cases produced by proof methods specify options, where NONE
7992 means to remove case bindings -- INCOMPATIBILITY in
7995 * Pure: the following operations retrieve axioms or theorems from a
7996 theory node or theory hierarchy, respectively:
7998 Theory.axioms_of: theory -> (string * term) list
7999 Theory.all_axioms_of: theory -> (string * term) list
8000 PureThy.thms_of: theory -> (string * thm) list
8001 PureThy.all_thms_of: theory -> (string * thm) list
8003 * Pure: print_tac now outputs the goal through the trace channel.
8005 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8006 Reference Toplevel.debug (default false) controls detailed printing
8007 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8008 controls execution profiling -- set to 1 for time and 2 for space
8009 (both increase the runtime).
8011 * Isar session: The initial use of ROOT.ML is now always timed,
8012 i.e. the log will show the actual process times, in contrast to the
8013 elapsed wall-clock time that the outer shell wrapper produces.
8015 * Simplifier: improved handling of bound variables (nameless
8016 representation, avoid allocating new strings). Simprocs that invoke
8017 the Simplifier recursively should use Simplifier.inherit_bounds to
8018 avoid local name clashes. Failure to do so produces warnings
8019 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8020 for further details.
8022 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8023 bindings for all theorems stored within a given theory; this may help
8024 in porting non-Isar theories to Isar ones, while keeping ML proof
8025 scripts for the time being.
8027 * ML operator HTML.with_charset specifies the charset begin used for
8028 generated HTML files. For example:
8030 HTML.with_charset "utf-8" use_thy "Hebrew";
8031 HTML.with_charset "utf-8" use_thy "Chinese";
8036 * Allow symlinks to all proper Isabelle executables (Isabelle,
8037 isabelle, isatool etc.).
8039 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8040 isatool doc, isatool mkdir, display_drafts etc.).
8042 * isatool usedir: option -f allows specification of the ML file to be
8043 used by Isabelle; default is ROOT.ML.
8045 * New isatool version outputs the version identifier of the Isabelle
8046 distribution being used.
8048 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8049 (containing Boolean satisfiability problems) into Isabelle/HOL
8054 New in Isabelle2004 (April 2004)
8055 --------------------------------
8059 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8060 Replaces linorder.ML.
8062 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8063 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8064 (\<a>...\<z>), are now considered normal letters, and can therefore
8065 be used anywhere where an ASCII letter (a...zA...Z) has until
8066 now. COMPATIBILITY: This obviously changes the parsing of some
8067 terms, especially where a symbol has been used as a binder, say
8068 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8069 as an identifier. Fix it by inserting a space around former
8070 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8071 existing theory and ML files.
8073 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8075 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8076 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8077 a normal (but invisible) letter. For multiple letter subscripts repeat
8078 \<^isub> like this: x\<^isub>1\<^isub>2.
8080 * Pure: There are now sub-/superscripts that can span more than one
8081 character. Text between \<^bsub> and \<^esub> is set in subscript in
8082 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8083 superscript. The new control characters are not identifier parts.
8085 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8086 content of "..." to the latex file instead of \isacntrl... . The "..."
8087 may consist of any printable characters excluding the end bracket >.
8089 * Pure: Using new Isar command "finalconsts" (or the ML functions
8090 Theory.add_finals or Theory.add_finals_i) it is now possible to
8091 declare constants "final", which prevents their being given a definition
8092 later. It is useful for constants whose behaviour is fixed axiomatically
8093 rather than definitionally, such as the meta-logic connectives.
8095 * Pure: 'instance' now handles general arities with general sorts
8096 (i.e. intersections of classes),
8098 * Presentation: generated HTML now uses a CSS style sheet to make layout
8099 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8100 It can be changed to alter the colors/layout of generated pages.
8105 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8106 cut_tac, subgoal_tac and thin_tac:
8107 - Now understand static (Isar) contexts. As a consequence, users of Isar
8108 locales are no longer forced to write Isar proof scripts.
8109 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8111 - INCOMPATIBILITY: names of variables to be instantiated may no
8112 longer be enclosed in quotes. Instead, precede variable name with `?'.
8113 This is consistent with the instantiation attribute "where".
8115 * Attributes "where" and "of":
8116 - Now take type variables of instantiated theorem into account when reading
8117 the instantiation string. This fixes a bug that caused instantiated
8118 theorems to have too special types in some circumstances.
8119 - "where" permits explicit instantiations of type variables.
8121 * Calculation commands "moreover" and "also" no longer interfere with
8122 current facts ("this"), admitting arbitrary combinations with "then"
8126 - Goal statements involving the context element "includes" no longer
8127 generate theorems with internal delta predicates (those ending on
8128 "_axioms") in the premise.
8129 Resolve particular premise with <locale>.intro to obtain old form.
8130 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8131 specification and "includes" elements in goal statement.
8132 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8133 [intro?] and [elim?] (respectively) by default.
8134 - Experimental command for instantiation of locales in proof contexts:
8135 instantiate <label>[<attrs>]: <loc>
8136 Instantiates locale <loc> and adds all its theorems to the current context
8137 taking into account their attributes. Label and attrs are optional
8138 modifiers, like in theorem declarations. If present, names of
8139 instantiated theorems are qualified with <label>, and the attributes
8140 <attrs> are applied after any attributes these theorems might have already.
8141 If the locale has assumptions, a chained fact of the form
8142 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8143 are derived. The command does not support old-style locales declared
8144 with "locale (open)".
8145 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8147 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8153 * Proof import: new image HOL4 contains the imported library from
8154 the HOL4 system with about 2500 theorems. It is imported by
8155 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8156 can be used like any other Isabelle image. See
8157 HOL/Import/HOL/README for more information.
8160 - Much improved handling of linear and partial orders.
8161 Reasoners for linear and partial orders are set up for type classes
8162 "linorder" and "order" respectively, and are added to the default simpset
8163 as solvers. This means that the simplifier can build transitivity chains
8164 to solve goals from the assumptions.
8165 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8166 of blast or auto after simplification become unnecessary because the goal
8167 is solved by simplification already.
8169 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8170 all proved in axiomatic type classes for semirings, rings and fields.
8173 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8174 now formalized using the Ring_and_Field theory mentioned above.
8175 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8176 than before, because now they are set up once in a generic manner.
8177 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8178 Look for the general versions in Ring_and_Field (and Power if they concern
8181 * Type "rat" of the rational numbers is now available in HOL-Complex.
8184 - Record types are now by default printed with their type abbreviation
8185 instead of the list of all field types. This can be configured via
8186 the reference "print_record_type_abbr".
8187 - Simproc "record_upd_simproc" for simplification of multiple updates added
8188 (not enabled by default).
8189 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8190 EX x. x = sel r to True (not enabled by default).
8191 - Tactic "record_split_simp_tac" to split and simplify records added.
8193 * 'specification' command added, allowing for definition by
8194 specification. There is also an 'ax_specification' command that
8195 introduces the new constants axiomatically.
8197 * arith(_tac) is now able to generate counterexamples for reals as well.
8199 * HOL-Algebra: new locale "ring" for non-commutative rings.
8201 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8202 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8204 * HOL-Matrix: a first theory for matrices in HOL with an application of
8205 matrix theory to linear programming.
8207 * Unions and Intersections:
8208 The latex output syntax of UN and INT has been changed
8209 from "\Union x \in A. B" to "\Union_{x \in A} B"
8210 i.e. the index formulae has become a subscript.
8211 Similarly for "\Union x. B", and for \Inter instead of \Union.
8213 * Unions and Intersections over Intervals:
8214 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8215 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8216 like in normal math, and corresponding versions for < and for intersection.
8218 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8219 lexicographic dictonary ordering has been added as "lexord".
8221 * ML: the legacy theory structures Int and List have been removed. They had
8222 conflicted with ML Basis Library structures having the same names.
8224 * 'refute' command added to search for (finite) countermodels. Only works
8225 for a fragment of HOL. The installation of an external SAT solver is
8226 highly recommended. See "HOL/Refute.thy" for details.
8228 * 'quickcheck' command: Allows to find counterexamples by evaluating
8229 formulae under an assignment of free variables to random values.
8230 In contrast to 'refute', it can deal with inductive datatypes,
8231 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8237 * Streams now come with concatenation and are part of the HOLCF image
8241 New in Isabelle2003 (May 2003)
8242 ------------------------------
8246 * Provers/simplifier:
8248 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8249 Assumptions are now subject to complete mutual simplification,
8250 not just from left to right. The simplifier now preserves
8251 the order of assumptions.
8253 Potential INCOMPATIBILITY:
8255 -- simp sometimes diverges where the old version did
8256 not, e.g. invoking simp on the goal
8258 [| P (f x); y = x; f x = f y |] ==> Q
8260 now gives rise to the infinite reduction sequence
8262 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8264 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8267 -- Tactics combining classical reasoner and simplification (such as auto)
8268 are also affected by this change, because many of them rely on
8269 simp. They may sometimes diverge as well or yield a different numbers
8270 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8271 in case of problems. Sometimes subsequent calls to the classical
8272 reasoner will fail because a preceeding call to the simplifier too
8273 eagerly simplified the goal, e.g. deleted redundant premises.
8275 - The simplifier trace now shows the names of the applied rewrite rules
8277 - You can limit the number of recursive invocations of the simplifier
8278 during conditional rewriting (where the simplifie tries to solve the
8279 conditions before applying the rewrite rule):
8280 ML "simp_depth_limit := n"
8281 where n is an integer. Thus you can force termination where previously
8282 the simplifier would diverge.
8284 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8286 - No longer aborts on failed congruence proof. Instead, the
8287 congruence is ignored.
8289 * Pure: New generic framework for extracting programs from constructive
8290 proofs. See HOL/Extraction.thy for an example instantiation, as well
8291 as HOL/Extraction for some case studies.
8293 * Pure: The main goal of the proof state is no longer shown by default, only
8294 the subgoals. This behaviour is controlled by a new flag.
8295 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8296 (ML: Proof.show_main_goal).
8298 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8299 rules whose conclusion matches subgoal 1:
8300 PG menu: Isabelle/Isar -> Show me -> matching rules
8301 The rules are ordered by how closely they match the subgoal.
8302 In particular, rules that solve a subgoal outright are displayed first
8303 (or rather last, the way they are printed).
8304 (ML: ProofGeneral.print_intros())
8306 * Pure: New flag trace_unify_fail causes unification to print
8307 diagnostic information (PG: in trace buffer) when it fails. This is
8308 useful for figuring out why single step proofs like rule, erule or
8311 * Pure: Locale specifications now produce predicate definitions
8312 according to the body of text (covering assumptions modulo local
8313 definitions); predicate "loc_axioms" covers newly introduced text,
8314 while "loc" is cumulative wrt. all included locale expressions; the
8315 latter view is presented only on export into the global theory
8316 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8317 on the old view without predicates;
8319 * Pure: predefined locales "var" and "struct" are useful for sharing
8320 parameters (as in CASL, for example); just specify something like
8321 ``var x + var y + struct M'' as import;
8323 * Pure: improved thms_containing: proper indexing of facts instead of
8324 raw theorems; check validity of results wrt. current name space;
8325 include local facts of proof configuration (also covers active
8326 locales), cover fixed variables in index; may use "_" in term
8327 specification; an optional limit for the number of printed facts may
8328 be given (the default is 40);
8330 * Pure: disallow duplicate fact bindings within new-style theory files
8333 * Provers: improved induct method: assumptions introduced by case
8334 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8335 the goal statement); "foo" still refers to all facts collectively;
8337 * Provers: the function blast.overloaded has been removed: all constants
8338 are regarded as potentially overloaded, which improves robustness in exchange
8339 for slight decrease in efficiency;
8341 * Provers/linorder: New generic prover for transitivity reasoning over
8342 linear orders. Note: this prover is not efficient!
8344 * Isar: preview of problems to finish 'show' now produce an error
8345 rather than just a warning (in interactive mode);
8352 - Produces a counter example if it cannot prove a goal.
8353 Note that the counter example may be spurious if the goal is not a formula
8354 of quantifier-free linear arithmetic.
8355 In ProofGeneral the counter example appears in the trace buffer.
8357 - Knows about div k and mod k where k is a numeral of type nat or int.
8359 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8360 linear arithmetic fails. This takes account of quantifiers and divisibility.
8361 Presburger arithmetic can also be called explicitly via presburger(_tac).
8363 * simp's arithmetic capabilities have been enhanced a bit: it now
8364 takes ~= in premises into account (by performing a case split);
8366 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8367 are distributed over a sum of terms;
8369 * New tactic "trans_tac" and method "trans" instantiate
8370 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8373 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8374 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8376 * 'typedef' command has new option "open" to suppress the set
8379 * functions Min and Max on finite sets have been introduced (theory
8382 * attribute [symmetric] now works for relations as well; it turns
8383 (x,y) : R^-1 into (y,x) : R, and vice versa;
8385 * induct over a !!-quantified statement (say !!x1..xn):
8386 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8388 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8389 %x. None. Warning: empty_def now refers to the previously hidden definition
8392 * Algebra: formalization of classical algebra. Intended as base for
8393 any algebraic development in Isabelle. Currently covers group theory
8394 (up to Sylow's theorem) and ring theory (Universal Property of
8395 Univariate Polynomials). Contributions welcome;
8397 * GroupTheory: deleted, since its material has been moved to Algebra;
8399 * Complex: new directory of the complex numbers with numeric constants,
8400 nonstandard complex numbers, and some complex analysis, standard and
8401 nonstandard (Jacques Fleuriot);
8403 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8405 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8408 * Real/HahnBanach: updated and adapted to locales;
8410 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8413 * UNITY: added the Meier-Sanders theory of progress sets;
8415 * MicroJava: bytecode verifier and lightweight bytecode verifier
8416 as abstract algorithms, instantiated to the JVM;
8418 * Bali: Java source language formalization. Type system, operational
8419 semantics, axiomatic semantics. Supported language features:
8420 classes, interfaces, objects,virtual methods, static methods,
8421 static/instance fields, arrays, access modifiers, definite
8422 assignment, exceptions.
8427 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8430 * Main ZF: virtually all theories converted to new-style format;
8435 * Pure: Tactic.prove provides sane interface for internal proofs;
8436 omits the infamous "standard" operation, so this is more appropriate
8437 than prove_goalw_cterm in many situations (e.g. in simprocs);
8439 * Pure: improved error reporting of simprocs;
8441 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8445 *** Document preparation ***
8447 * uses \par instead of \\ for line breaks in theory text. This may
8448 shift some page breaks in large documents. To get the old behaviour
8449 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8451 * minimized dependencies of isabelle.sty and isabellesym.sty on
8454 * \<euro> now needs package babel/greek instead of marvosym (which
8457 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8462 New in Isabelle2002 (March 2002)
8463 --------------------------------
8465 *** Document preparation ***
8467 * greatly simplified document preparation setup, including more
8468 graceful interpretation of isatool usedir -i/-d/-D options, and more
8469 instructive isatool mkdir; users should basically be able to get
8470 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8471 users may run a separate document processing stage manually like this:
8472 "isatool usedir -D output HOL Test && isatool document Test/output";
8474 * theory dependency graph may now be incorporated into documents;
8475 isatool usedir -g true will produce session_graph.eps/.pdf for use
8476 with \includegraphics of LaTeX;
8478 * proper spacing of consecutive markup elements, especially text
8479 blocks after section headings;
8481 * support bold style (for single symbols only), input syntax is like
8482 this: "\<^bold>\<alpha>" or "\<^bold>A";
8484 * \<bullet> is now output as bold \cdot by default, which looks much
8485 better in printed text;
8487 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8488 note that these symbols are currently unavailable in Proof General /
8489 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8491 * isatool latex no longer depends on changed TEXINPUTS, instead
8492 isatool document copies the Isabelle style files to the target
8498 * Pure/Provers: improved proof by cases and induction;
8499 - 'case' command admits impromptu naming of parameters (such as
8501 - 'induct' method divinates rule instantiation from the inductive
8502 claim; no longer requires excessive ?P bindings for proper
8503 instantiation of cases;
8504 - 'induct' method properly enumerates all possibilities of set/type
8505 rules; as a consequence facts may be also passed through *type*
8506 rules without further ado;
8507 - 'induct' method now derives symbolic cases from the *rulified*
8508 rule (before it used to rulify cases stemming from the internal
8509 atomized version); this means that the context of a non-atomic
8510 statement becomes is included in the hypothesis, avoiding the
8511 slightly cumbersome show "PROP ?case" form;
8512 - 'induct' may now use elim-style induction rules without chaining
8513 facts, using ``missing'' premises from the goal state; this allows
8514 rules stemming from inductive sets to be applied in unstructured
8515 scripts, while still benefitting from proper handling of non-atomic
8516 statements; NB: major inductive premises need to be put first, all
8517 the rest of the goal is passed through the induction;
8518 - 'induct' proper support for mutual induction involving non-atomic
8519 rule statements (uses the new concept of simultaneous goals, see
8521 - append all possible rule selections, but only use the first
8522 success (no backtracking);
8523 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8524 - undeclared rule case names default to numbers 1, 2, 3, ...;
8525 - added 'print_induct_rules' (covered by help item in recent Proof
8527 - moved induct/cases attributes to Pure, methods to Provers;
8528 - generic method setup instantiated for FOL and HOL;
8530 * Pure: support multiple simultaneous goal statements, for example
8531 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8532 meta-level mechanism, this acts as if several individual goals had
8533 been stated separately; in particular common proof methods need to be
8534 repeated in order to cover all claims; note that a single elimination
8535 step is *not* sufficient to establish the two conjunctions, so this
8538 assume "A & B" then have A and B .. (*".." fails*)
8540 better use "obtain" in situations as above; alternative refer to
8541 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8543 * Pure: proper integration with ``locales''; unlike the original
8544 version by Florian Kammller, Isar locales package high-level proof
8545 contexts rather than raw logical ones (e.g. we admit to include
8546 attributes everywhere); operations on locales include merge and
8547 rename; support for implicit arguments (``structures''); simultaneous
8548 type-inference over imports and text; see also HOL/ex/Locales.thy for
8551 * Pure: the following commands have been ``localized'', supporting a
8552 target locale specification "(in name)": 'lemma', 'theorem',
8553 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8554 stored both within the locale and at the theory level (exported and
8555 qualified by the locale name);
8557 * Pure: theory goals may now be specified in ``long'' form, with
8558 ad-hoc contexts consisting of arbitrary locale elements. for example
8559 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8560 definitions may be given, too); the result is a meta-level rule with
8561 the context elements being discharged in the obvious way;
8563 * Pure: new proof command 'using' allows to augment currently used
8564 facts after a goal statement ('using' is syntactically analogous to
8565 'apply', but acts on the goal's facts only); this allows chained facts
8566 to be separated into parts given before and after a claim, as in
8567 ``from a and b have C using d and e <proof>'';
8569 * Pure: renamed "antecedent" case to "rule_context";
8571 * Pure: new 'judgment' command records explicit information about the
8572 object-logic embedding (used by several tools internally); no longer
8573 use hard-wired "Trueprop";
8575 * Pure: added 'corollary' command;
8577 * Pure: fixed 'token_translation' command;
8579 * Pure: removed obsolete 'exported' attribute;
8581 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8582 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8583 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8585 * Pure: method 'atomize' presents local goal premises as object-level
8586 statements (atomic meta-level propositions); setup controlled via
8587 rewrite rules declarations of 'atomize' attribute; example
8588 application: 'induct' method with proper rule statements in improper
8591 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8592 now consider the syntactic context of assumptions, giving a better
8593 chance to get type-inference of the arguments right (this is
8594 especially important for locales);
8596 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8599 * Pure/obtain: the formal conclusion "thesis", being marked as
8600 ``internal'', may no longer be reference directly in the text;
8601 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8604 * Pure: generic 'sym' attribute which declares a rule both as pure
8605 'elim?' and for the 'symmetric' operation;
8607 * Pure: marginal comments ``--'' may now occur just anywhere in the
8608 text; the fixed correlation with particular command syntax has been
8611 * Pure: new method 'rules' is particularly well-suited for proof
8612 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8613 but often produces more compact proof terms with less detours;
8615 * Pure/Provers/classical: simplified integration with pure rule
8616 attributes and methods; the classical "intro?/elim?/dest?"
8617 declarations coincide with the pure ones; the "rule" method no longer
8618 includes classically swapped intros; "intro" and "elim" methods no
8619 longer pick rules from the context; also got rid of ML declarations
8620 AddXIs/AddXEs/AddXDs; all of this has some potential for
8623 * Provers/classical: attribute 'swapped' produces classical inversions
8624 of introduction rules;
8626 * Provers/simplifier: 'simplified' attribute may refer to explicit
8627 rules instead of full simplifier context; 'iff' attribute handles
8630 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8632 * HOL: 'recdef' now fails on unfinished automated proofs, use
8633 "(permissive)" option to recover old behavior;
8635 * HOL: 'inductive' no longer features separate (collective) attributes
8636 for 'intros' (was found too confusing);
8638 * HOL: properly declared induction rules less_induct and
8644 * HOL: moved over to sane numeral syntax; the new policy is as
8647 - 0 and 1 are polymorphic constants, which are defined on any
8648 numeric type (nat, int, real etc.);
8650 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8651 binary representation internally;
8653 - type nat has special constructor Suc, and generally prefers Suc 0
8654 over 1::nat and Suc (Suc 0) over 2::nat;
8656 This change may cause significant problems of INCOMPATIBILITY; here
8657 are some hints on converting existing sources:
8659 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8660 entities, so expressions involving "-" (unary or binary minus) need
8661 to be spaced properly;
8663 - existing occurrences of "1" may need to be constraint "1::nat" or
8664 even replaced by Suc 0; similar for old "2";
8666 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8668 - remove all special provisions on numerals in proofs;
8670 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8671 representation (depends on bin_arith_simps in the default context);
8673 * HOL: symbolic syntax for x^2 (numeral 2);
8675 * HOL: the class of all HOL types is now called "type" rather than
8676 "term"; INCOMPATIBILITY, need to adapt references to this type class
8677 in axclass/classes, instance/arities, and (usually rare) occurrences
8678 in typings (of consts etc.); internally the class is called
8679 "HOL.type", ML programs should refer to HOLogic.typeS;
8681 * HOL/record package improvements:
8682 - new derived operations "fields" to build a partial record section,
8683 "extend" to promote a fixed record to a record scheme, and
8684 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8685 declared as simp by default;
8686 - shared operations ("more", "fields", etc.) now need to be always
8687 qualified) --- potential INCOMPATIBILITY;
8688 - removed "make_scheme" operations (use "make" with "extend") --
8690 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8691 - provides cases/induct rules for use with corresponding Isar
8692 methods (for concrete records, record schemes, concrete more
8693 parts, and schematic more parts -- in that order);
8694 - internal definitions directly based on a light-weight abstract
8695 theory of product types over typedef rather than datatype;
8697 * HOL: generic code generator for generating executable ML code from
8698 specifications; specific support for HOL constructs such as inductive
8699 datatypes and sets, as well as recursive functions; can be invoked
8700 via 'generate_code' theory section;
8702 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8704 * HOL: consolidated and renamed several theories. In particular:
8705 Ord.thy has been absorbed into HOL.thy
8706 String.thy has been absorbed into List.thy
8708 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8709 (beware of argument permutation!);
8711 * HOL: linorder_less_split superseded by linorder_cases;
8713 * HOL/List: "nodups" renamed to "distinct";
8715 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8716 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8717 - Ex_def has changed, now need to use some_eq_ex
8719 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8720 in this (rare) case use:
8722 delSWrapper "split_all_tac"
8723 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8725 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8728 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8729 Isabelle's type classes, ^ on functions and relations has too general
8730 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8731 necessary to attach explicit type constraints;
8733 * HOL/Relation: the prefix name of the infix "O" has been changed from
8734 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8735 renamed accordingly (eg "compI" -> "rel_compI").
8737 * HOL: syntax translations now work properly with numerals and records
8740 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8741 of "lam" -- INCOMPATIBILITY;
8743 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8744 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8745 renamed "Product_Type.unit";
8747 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8749 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8750 the "cases" method);
8752 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8755 * HOL/IMP: updated and converted to new-style theory format; several
8756 parts turned into readable document, with proper Isar proof texts and
8757 some explanations (by Gerwin Klein);
8759 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8761 * HOL-Hyperreal is now a logic image;
8766 * Isar: consts/constdefs supports mixfix syntax for continuous
8769 * Isar: domain package adapted to new-style theory format, e.g. see
8772 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8773 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8774 lift.induct_tac, always use UU instead of Undef;
8776 * HOLCF/IMP: updated and converted to new-style theory;
8781 * Isar: proper integration of logic-specific tools and packages,
8782 including theory commands '(co)inductive', '(co)datatype',
8783 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8784 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8786 * theory Main no longer includes AC; for the Axiom of Choice, base
8787 your theory on Main_ZFC;
8789 * the integer library now covers quotients and remainders, with many
8790 laws relating division to addition, multiplication, etc.;
8792 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8793 typeless version of the formalism;
8795 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8798 * ZF/Induct: new directory for examples of inductive definitions,
8799 including theory Multiset for multiset orderings; converted to
8800 new-style theory format;
8802 * ZF: many new theorems about lists, ordinals, etc.;
8807 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8808 variable proof controls level of detail: 0 = no proofs (only oracle
8809 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8810 also ref manual for further ML interfaces;
8812 * Pure/axclass: removed obsolete ML interface
8813 goal_subclass/goal_arity;
8815 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8816 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8817 separate tokens, so expressions involving minus need to be spaced
8820 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8821 rather than "infixl" or "infixr";
8823 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8824 sort constraint specifications in type inference; e.g. "x::_::foo"
8825 ensures that the type of "x" is of sort "foo" (but not necessarily a
8828 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8829 control output of nested => (types); the default behavior is
8832 * Pure/syntax: builtin parse translation for "_constify" turns valued
8833 tokens into AST constants;
8835 * Pure/syntax: prefer later declarations of translations and print
8836 translation functions; potential INCOMPATIBILITY: need to reverse
8837 multiple declarations for same syntax element constant;
8839 * Pure/show_hyps reset by default (in accordance to existing Isar
8842 * Provers/classical: renamed addaltern to addafter, addSaltern to
8845 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8848 * system: tested support for MacOS X; should be able to get Isabelle +
8849 Proof General to work in a plain Terminal after installing Poly/ML
8850 (e.g. from the Isabelle distribution area) and GNU bash alone
8851 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8852 support requires further installations, e.g. from
8853 http://fink.sourceforge.net/);
8855 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8857 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8858 of 40 MB), cf. ML_OPTIONS;
8860 * system: Proof General keywords specification is now part of the
8861 Isabelle distribution (see etc/isar-keywords.el);
8863 * system: support for persistent Proof General sessions (refrain from
8864 outdating all loaded theories on startup); user may create writable
8865 logic images like this: ``isabelle -q HOL Test'';
8867 * system: smart selection of Isabelle process versus Isabelle
8868 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8869 run both "isabelle" and "Isabelle" even if file names are badly
8870 damaged (executable inspects the case of the first letter of its own
8871 name); added separate "isabelle-process" and "isabelle-interface";
8873 * system: refrain from any attempt at filtering input streams; no
8874 longer support ``8bit'' encoding of old isabelle font, instead proper
8875 iso-latin characters may now be used; the related isatools
8876 "symbolinput" and "nonascii" have disappeared as well;
8878 * system: removed old "xterm" interface (the print modes "xterm" and
8879 "xterm_color" are still available for direct use in a suitable
8884 New in Isabelle99-2 (February 2001)
8885 -----------------------------------
8887 *** Overview of INCOMPATIBILITIES ***
8889 * HOL: please note that theories in the Library and elsewhere often use the
8890 new-style (Isar) format; to refer to their theorems in an ML script you must
8891 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8893 * HOL: inductive package no longer splits induction rule aggressively,
8894 but only as far as specified by the introductions given; the old
8895 format may be recovered via ML function complete_split_rule or attribute
8896 'split_rule (complete)';
8898 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8899 gfp_Tarski to gfp_unfold;
8901 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8903 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8904 relation); infix "^^" has been renamed "``"; infix "``" has been
8905 renamed "`"; "univalent" has been renamed "single_valued";
8907 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8910 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8912 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8914 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8915 consequence, it is no longer monotonic wrt. the local goal context
8916 (which is now passed through the inductive cases);
8918 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8919 \<gg> to \<ggreater>;
8922 *** Document preparation ***
8924 * \isabellestyle{NAME} selects version of Isabelle output (currently
8925 available: are "it" for near math-mode best-style output, "sl" for
8926 slanted text style, and "tt" for plain type-writer; if no
8927 \isabellestyle command is given, output is according to slanted
8930 * support sub/super scripts (for single symbols only), input syntax is
8931 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8933 * some more standard symbols; see Appendix A of the system manual for
8934 the complete list of symbols defined in isabellesym.sty;
8936 * improved isabelle style files; more abstract symbol implementation
8937 (should now use \isamath{...} and \isatext{...} in custom symbol
8940 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8941 state; Note that presentation of goal states does not conform to
8942 actual human-readable proof documents. Please do not include goal
8943 states into document output unless you really know what you are doing!
8945 * proper indentation of antiquoted output with proportional LaTeX
8948 * no_document ML operator temporarily disables LaTeX document
8951 * isatool unsymbolize tunes sources for plain ASCII communication;
8956 * Pure: Isar now suffers initial goal statements to contain unbound
8957 schematic variables (this does not conform to actual readable proof
8958 documents, due to unpredictable outcome and non-compositional proof
8959 checking); users who know what they are doing may use schematic goals
8960 for Prolog-style synthesis of proven results;
8962 * Pure: assumption method (an implicit finishing) now handles actual
8965 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8966 initial goal, declare "that" only as Pure intro (only for single
8967 steps); the "that" rule assumption may now be involved in implicit
8968 finishing, thus ".." becomes a feasible for trivial obtains;
8970 * Pure: default proof step now includes 'intro_classes'; thus trivial
8971 instance proofs may be performed by "..";
8973 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8976 * Pure: more robust selection of calculational rules;
8978 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8979 rule (as well as the assumption rule);
8981 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8982 lemmas, using the graph browser tool;
8984 * Pure: predict failure of "show" in interactive mode;
8986 * Pure: 'thms_containing' now takes actual terms as arguments;
8988 * HOL: improved method 'induct' --- now handles non-atomic goals
8989 (potential INCOMPATIBILITY); tuned error handling;
8991 * HOL: cases and induct rules now provide explicit hints about the
8992 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8993 any remaining facts are inserted into the goal verbatim;
8995 * HOL: local contexts (aka cases) may now contain term bindings as
8996 well; the 'cases' and 'induct' methods new provide a ?case binding for
8997 the result to be shown in each case;
8999 * HOL: added 'recdef_tc' command;
9001 * isatool convert assists in eliminating legacy ML scripts;
9006 * HOL/Library: a collection of generic theories to be used together
9007 with main HOL; the theory loader path already includes this directory
9008 by default; the following existing theories have been moved here:
9009 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9010 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9012 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9013 modelling and verification task performed in Isabelle/HOL +
9014 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9016 * HOL/Algebra: special summation operator SUM no longer exists, it has
9017 been replaced by setsum; infix 'assoc' now has priority 50 (like
9018 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9019 'domain', this makes the theory consistent with mathematical
9022 * HOL basics: added overloaded operations "inverse" and "divide"
9023 (infix "/"), syntax for generic "abs" operation, generic summation
9026 * HOL/typedef: simplified package, provide more useful rules (see also
9029 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9030 now expressed as a proper nested rule (old-style tactic scripts may
9031 require atomize_strip_tac to cope with non-atomic premises);
9033 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9034 to "split_conv" (old name still available for compatibility);
9036 * HOL: improved concrete syntax for strings (e.g. allows translation
9037 rules with string literals);
9039 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9040 and Fleuriot's mechanization of analysis, including the transcendental
9041 functions for the reals;
9043 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9048 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9049 "lam" is displayed as TWO lambda-symbols
9051 * CTT: theory Main now available, containing everything (that is, Bool
9057 * Pure: the Simplifier has been implemented properly as a derived rule
9058 outside of the actual kernel (at last!); the overall performance
9059 penalty in practical applications is about 50%, while reliability of
9060 the Isabelle inference kernel has been greatly improved;
9062 * print modes "brackets" and "no_brackets" control output of nested =>
9063 (types) and ==> (props); the default behaviour is "brackets";
9065 * Provers: fast_tac (and friends) now handle actual object-logic rules
9066 as assumptions as well;
9068 * system: support Poly/ML 4.0;
9070 * system: isatool install handles KDE version 1 or 2;
9074 New in Isabelle99-1 (October 2000)
9075 ----------------------------------
9077 *** Overview of INCOMPATIBILITIES ***
9079 * HOL: simplification of natural numbers is much changed; to partly
9080 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9081 issue the following ML commands:
9083 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9084 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9086 * HOL: simplification no longer dives into case-expressions; this is
9087 controlled by "t.weak_case_cong" for each datatype t;
9089 * HOL: nat_less_induct renamed to less_induct;
9091 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9092 fixsome to patch .thy and .ML sources automatically;
9094 select_equality -> some_equality
9095 select_eq_Ex -> some_eq_ex
9096 selectI2EX -> someI2_ex
9099 select1_equality -> some1_equality
9100 Eps_sym_eq -> some_sym_eq_trivial
9101 Eps_eq -> some_eq_trivial
9103 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9105 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9108 * HOL: the recursion equations generated by 'recdef' are now called
9109 f.simps instead of f.rules;
9111 * HOL: qed_spec_mp now also handles bounded ALL as well;
9113 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9114 sometimes be needed;
9116 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9118 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9120 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9121 product is now "<*>" instead of "Times"; the lexicographic product is
9122 now "<*lex*>" instead of "**";
9124 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9125 of main HOL, but was unused); better use HOL's datatype package;
9127 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9128 the old syntax may be recovered as follows:
9131 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9132 (infixl "\\<oplus>" 100)
9134 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9136 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9137 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9140 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9141 changed from A/r to A//r;
9143 * ZF: new treatment of arithmetic (nat & int) may break some old
9146 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9147 rulify -> rule_format, elimify -> elim_format, ...);
9149 * Isar/Provers: intro/elim/dest attributes changed; renamed
9150 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9151 should have to change intro!! to intro? only); replaced "delrule" by
9154 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9156 * Provers: strengthened force_tac by using new first_best_tac;
9158 * LaTeX document preparation: several changes of isabelle.sty (see
9162 *** Document preparation ***
9164 * formal comments (text blocks etc.) in new-style theories may now
9165 contain antiquotations of thm/prop/term/typ/text to be presented
9166 according to latex print mode; concrete syntax is like this:
9167 @{term[show_types] "f(x) = a + x"};
9169 * isatool mkdir provides easy setup of Isabelle session directories,
9170 including proper document sources;
9172 * generated LaTeX sources are now deleted after successful run
9173 (isatool document -c); may retain a copy somewhere else via -D option
9176 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9177 style files, achieving self-contained LaTeX sources and simplifying
9180 * old-style theories now produce (crude) LaTeX output as well;
9182 * browser info session directories are now self-contained (may be put
9183 on WWW server seperately); improved graphs of nested sessions; removed
9184 graph for 'all sessions';
9186 * several improvements in isabelle style files; \isabellestyle{it}
9187 produces fake math mode output; \isamarkupheader is now \section by
9188 default; see lib/texinputs/isabelle.sty etc.;
9193 * Isar/Pure: local results and corresponding term bindings are now
9194 subject to Hindley-Milner polymorphism (similar to ML); this
9195 accommodates incremental type-inference very nicely;
9197 * Isar/Pure: new derived language element 'obtain' supports
9198 generalized existence reasoning;
9200 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9201 support accumulation of results, without applying any rules yet;
9202 useful to collect intermediate results without explicit name
9203 references, and for use with transitivity rules with more than 2
9206 * Isar/Pure: scalable support for case-analysis type proofs: new
9207 'case' language element refers to local contexts symbolically, as
9208 produced by certain proof methods; internally, case names are attached
9209 to theorems as "tags";
9211 * Isar/Pure: theory command 'hide' removes declarations from
9212 class/type/const name spaces;
9214 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9215 indicate potential overloading;
9217 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9219 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9220 "{a,b,c}" instead of {a,b,c};
9222 * Isar/Pure now provides its own version of intro/elim/dest
9223 attributes; useful for building new logics, but beware of confusion
9224 with the version in Provers/classical;
9226 * Isar/Pure: the local context of (non-atomic) goals is provided via
9227 case name 'antecedent';
9229 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9230 to the current context is now done automatically);
9232 * Isar/Pure: theory command 'method_setup' provides a simple interface
9233 for definining proof methods in ML;
9235 * Isar/Provers: intro/elim/dest attributes changed; renamed
9236 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9237 most cases, one should have to change intro!! to intro? only);
9238 replaced "delrule" by "rule del";
9240 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9241 'symmetric' attribute (the latter supercedes [RS sym]);
9243 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9244 method modifier); 'simp' method: 'only:' modifier removes loopers as
9245 well (including splits);
9247 * Isar/Provers: Simplifier and Classical methods now support all kind
9248 of modifiers used in the past, including 'cong', 'iff', etc.
9250 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9251 of Simplifier and Classical reasoner);
9253 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9254 now support named cases; major packages (inductive, datatype, primrec,
9255 recdef) support case names and properly name parameters;
9257 * Isar/HOL: new transitivity rules for substitution in inequalities --
9258 monotonicity conditions are extracted to be proven at end of
9261 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9264 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9265 split_if split_if_asm; datatype package provides theorems foo.splits =
9266 foo.split foo.split_asm for each datatype;
9268 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9269 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9270 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9271 use "(cases (simplified))" method in proper proof texts);
9273 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9275 * Isar: names of theorems etc. may be natural numbers as well;
9277 * Isar: 'pr' command: optional arguments for goals_limit and
9278 ProofContext.prems_limit; no longer prints theory contexts, but only
9281 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9282 additional print modes to be specified; e.g. "pr(latex)" will print
9283 proof state according to the Isabelle LaTeX style;
9285 * Isar: improved support for emulating tactic scripts, including proof
9286 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9287 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9288 (for HOL datatypes);
9290 * Isar: simplified (more robust) goal selection of proof methods: 1st
9291 goal, all goals, or explicit goal specifier (tactic emulation); thus
9292 'proof method scripts' have to be in depth-first order;
9294 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9296 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9297 should instead use individual commands for printing items
9298 (print_commands, print_methods etc.);
9300 * Isar: added 'nothing' --- the empty list of theorems;
9305 * HOL/MicroJava: formalization of a fragment of Java, together with a
9306 corresponding virtual machine and a specification of its bytecode
9307 verifier and a lightweight bytecode verifier, including proofs of
9308 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9309 Cornelia Pusch (see also the homepage of project Bali at
9310 http://isabelle.in.tum.de/Bali/);
9312 * HOL/Algebra: new theory of rings and univariate polynomials, by
9315 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9316 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9319 * HOL/Lattice: fundamental concepts of lattice theory and order
9320 structures, including duals, properties of bounds versus algebraic
9321 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9322 Theorem for complete lattices etc.; may also serve as a demonstration
9323 for abstract algebraic reasoning using axiomatic type classes, and
9324 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9326 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9329 * HOL/IMPP: extension of IMP with local variables and mutually
9330 recursive procedures, by David von Oheimb;
9332 * HOL/Lambda: converted into new-style theory and document;
9334 * HOL/ex/Multiquote: example of multiple nested quotations and
9335 anti-quotations -- basically a generalized version of de-Bruijn
9336 representation; very useful in avoiding lifting of operations;
9338 * HOL/record: added general record equality rule to simpset; fixed
9339 select-update simplification procedure to handle extended records as
9340 well; admit "r" as field name;
9342 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9343 other numeric types and also as the identity of groups, rings, etc.;
9345 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9346 Types nat and int belong to this axclass;
9348 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9349 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9350 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9351 two terms #m*u and #n*u are replaced by #(m+n)*u
9352 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9353 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9354 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9356 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9357 powerful prover for predicate logic but knows nothing of clasets; see
9358 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9360 * HOL: new version of "case_tac" subsumes both boolean case split and
9361 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9362 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9364 * HOL: simplification no longer dives into case-expressions: only the
9365 selector expression is simplified, but not the remaining arms; to
9366 enable full simplification of case-expressions for datatype t, you may
9367 remove t.weak_case_cong from the simpset, either globally (Delcongs
9368 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9370 * HOL/recdef: the recursion equations generated by 'recdef' for
9371 function 'f' are now called f.simps instead of f.rules; if all
9372 termination conditions are proved automatically, these simplification
9373 rules are added to the simpset, as in primrec; rules may be named
9374 individually as well, resulting in a separate list of theorems for
9377 * HOL/While is a new theory that provides a while-combinator. It
9378 permits the definition of tail-recursive functions without the
9379 provision of a termination measure. The latter is necessary once the
9380 invariant proof rule for while is applied.
9382 * HOL: new (overloaded) notation for the set of elements below/above
9383 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9385 * HOL: theorems impI, allI, ballI bound as "strip";
9387 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9388 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9389 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9391 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9393 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9394 main HOL, but was unused);
9396 * HOL: fewer consts declared as global (e.g. have to refer to
9397 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9399 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9400 in case of overlap with user translations (e.g. judgements over
9401 tuples); (note that the underlying logical represenation is still
9407 * ZF: simplification automatically cancels common terms in arithmetic
9408 expressions over nat and int;
9410 * ZF: new treatment of nat to minimize type-checking: all operators
9411 coerce their operands to a natural number using the function natify,
9412 making the algebraic laws unconditional;
9414 * ZF: as above, for int: operators coerce their operands to an integer
9415 using the function intify;
9417 * ZF: the integer library now contains many of the usual laws for the
9418 orderings, including $<=, and monotonicity laws for $+ and $*;
9420 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9423 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9424 to the simplifier and classical reasoner simultaneously;
9429 * Provers: blast_tac now handles actual object-logic rules as
9430 assumptions; note that auto_tac uses blast_tac internally as well;
9432 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9433 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9435 * Provers: delrules now handles destruct rules as well (no longer need
9436 explicit make_elim);
9438 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9439 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9440 use instead the strong form,
9441 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9442 in HOL, FOL and ZF the function cla_make_elim will create such rules
9443 from destruct-rules;
9445 * Provers: Simplifier.easy_setup provides a fast path to basic
9446 Simplifier setup for new object-logics;
9448 * Pure: AST translation rules no longer require constant head on LHS;
9450 * Pure: improved name spaces: ambiguous output is qualified; support
9451 for hiding of names;
9453 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9454 XSYMBOL_HOME; no longer need to do manual configuration in most
9457 * system: compression of ML heaps images may now be controlled via -c
9458 option of isabelle and isatool usedir (currently only observed by
9461 * system: isatool installfonts may handle X-Symbol fonts as well (very
9462 useful for remote X11);
9464 * system: provide TAGS file for Isabelle sources;
9466 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9469 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9470 timing flag supersedes proof_timing and Toplevel.trace;
9472 * ML: new combinators |>> and |>>> for incremental transformations
9473 with secondary results (e.g. certain theory extensions):
9475 * ML: PureThy.add_defs gets additional argument to indicate potential
9476 overloading (usually false);
9478 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9483 New in Isabelle99 (October 1999)
9484 --------------------------------
9486 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9488 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9489 are no longer simplified. (This allows the simplifier to unfold recursive
9490 functional programs.) To restore the old behaviour, declare
9492 Delcongs [if_weak_cong];
9494 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9497 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9499 * HOL/datatype: mutual_induct_tac no longer exists --
9500 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9502 * HOL/typedef: fixed type inference for representing set; type
9503 arguments now have to occur explicitly on the rhs as type constraints;
9505 * ZF: The con_defs part of an inductive definition may no longer refer
9506 to constants declared in the same theory;
9508 * HOL, ZF: the function mk_cases, generated by the inductive
9509 definition package, has lost an argument. To simplify its result, it
9510 uses the default simpset instead of a supplied list of theorems.
9512 * HOL/List: the constructors of type list are now Nil and Cons;
9514 * Simplifier: the type of the infix ML functions
9515 setSSolver addSSolver setSolver addSolver
9516 is now simpset * solver -> simpset where `solver' is a new abstract type
9517 for packaging solvers. A solver is created via
9518 mk_solver: string -> (thm list -> int -> tactic) -> solver
9519 where the string argument is only a comment.
9524 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9525 decision procedure for linear arithmetic. Currently it is used for
9526 types `nat', `int', and `real' in HOL (see below); it can, should and
9527 will be instantiated for other types and logics as well.
9529 * The simplifier now accepts rewrite rules with flexible heads, eg
9530 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9531 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9537 * New Isabelle/Isar subsystem provides an alternative to traditional
9538 tactical theorem proving; together with the ProofGeneral/isar user
9539 interface it offers an interactive environment for developing human
9540 readable proof documents (Isar == Intelligible semi-automated
9541 reasoning); for further information see isatool doc isar-ref,
9542 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9544 * improved and simplified presentation of theories: better HTML markup
9545 (including colors), graph views in several sizes; isatool usedir now
9546 provides a proper interface for user theories (via -P option); actual
9547 document preparation based on (PDF)LaTeX is available as well (for
9548 new-style theories only); see isatool doc system for more information;
9550 * native support for Proof General, both for classic Isabelle and
9553 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9554 using the graph browser tool;
9556 * Isabelle manuals now also available as PDF;
9558 * theory loader rewritten from scratch (may not be fully
9559 bug-compatible); old loadpath variable has been replaced by show_path,
9560 add_path, del_path, reset_path functions; new operations such as
9561 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9564 * improved isatool install: option -k creates KDE application icon,
9565 option -p DIR installs standalone binaries;
9567 * added ML_PLATFORM setting (useful for cross-platform installations);
9568 more robust handling of platform specific ML images for SML/NJ;
9570 * the settings environment is now statically scoped, i.e. it is never
9571 created again in sub-processes invoked from isabelle, isatool, or
9574 * path element specification '~~' refers to '$ISABELLE_HOME';
9576 * in locales, the "assumes" and "defines" parts may be omitted if
9579 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9582 * new print_mode "HTML";
9584 * new flag show_tags controls display of tags of theorems (which are
9585 basically just comments that may be attached by some tools);
9587 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9588 mode and goal output format:
9590 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9592 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9594 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9595 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9597 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9599 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9601 * function bind_thms stores lists of theorems (cf. bind_thm);
9603 * new shorthand tactics ftac, eatac, datac, fatac;
9605 * qed (and friends) now accept "" as result name; in that case the
9606 theorem is not stored, but proper checks and presentation of the
9609 * theorem database now also indexes constants "Trueprop", "all",
9610 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9615 ** HOL arithmetic **
9617 * There are now decision procedures for linear arithmetic over nat and
9620 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9621 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9622 are treated as atomic; subformulae not involving type `nat' or `int'
9623 are ignored; quantified subformulae are ignored unless they are
9624 positive universal or negative existential. The tactic has to be
9625 invoked by hand and can be a little bit slow. In particular, the
9626 running time is exponential in the number of occurrences of `min' and
9627 `max', and `-' on `nat'.
9629 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9630 (negated) (in)equalities among the premises and the conclusion into
9631 account (i.e. no compound formulae) and does not know about `min' and
9632 `max', and `-' on `nat'. It is fast and is used automatically by the
9635 NB: At the moment, these decision procedures do not cope with mixed
9636 nat/int formulae where the two parts interact, such as `m < n ==>
9639 * HOL/Numeral provides a generic theory of numerals (encoded
9640 efficiently as bit strings); setup for types nat/int/real is in place;
9641 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9642 int, existing theories and proof scripts may require a few additional
9645 * integer division and remainder can now be performed on constant
9648 * many properties of integer multiplication, division and remainder
9651 * An interface to the Stanford Validity Checker (SVC) is available through the
9652 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9653 are proved automatically. SVC must be installed separately, and its results
9654 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9655 invocation of the underlying oracle). For SVC see
9656 http://verify.stanford.edu/SVC
9658 * IsaMakefile: the HOL-Real target now builds an actual image;
9663 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9664 (in Isabelle/Isar) -- by Gertrud Bauer;
9666 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9667 analysis for assembly languages with subtypes;
9669 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9670 -- avoids syntactic ambiguities and treats state, transition, and
9671 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9672 changed syntax and (many) tactics;
9674 * HOL/inductive: Now also handles more general introduction rules such
9675 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9676 theorems are now maintained within the theory (maintained via the
9679 * HOL/datatype: Now also handles arbitrarily branching datatypes
9680 (using function types) such as
9682 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9684 * HOL/record: record_simproc (part of the default simpset) takes care
9685 of selectors applied to updated records; record_split_tac is no longer
9686 part of the default claset; update_defs may now be removed from the
9687 simpset in many cases; COMPATIBILITY: old behavior achieved by
9689 claset_ref () := claset() addSWrapper record_split_wrapper;
9690 Delsimprocs [record_simproc]
9692 * HOL/typedef: fixed type inference for representing set; type
9693 arguments now have to occur explicitly on the rhs as type constraints;
9695 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9696 names rather than an ML expression;
9698 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9699 supplied later. Program schemes can be defined, such as
9700 "While B C s = (if B s then While B C (C s) else s)"
9701 where the well-founded relation can be chosen after B and C have been given.
9703 * HOL/List: the constructors of type list are now Nil and Cons;
9704 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9705 course, ML tools referring to List.list.op # etc. have to be adapted;
9707 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9708 disabled by default; run isabelle with option -m HOL to get back to
9709 the original Gordon/HOL-style output;
9711 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9712 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9714 * HOL basic syntax simplified (more orthogonal): all variants of
9715 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9716 Eps operator is provided as well: "SOME x. P[x]";
9718 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9720 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9721 thus available for user theories;
9723 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9724 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9727 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9728 several times and then mp;
9733 * the notation <<...>> is now available as a notation for sequences of
9736 * the simplifier is now installed
9738 * the axiom system has been generalized (thanks to Soren Heilmann)
9740 * the classical reasoner now has a default rule database
9745 * new primrec section allows primitive recursive functions to be given
9746 directly (as in HOL) over datatypes and the natural numbers;
9748 * new tactics induct_tac and exhaust_tac for induction (or case
9749 analysis) over datatypes and the natural numbers;
9751 * the datatype declaration of type T now defines the recursor T_rec;
9753 * simplification automatically does freeness reasoning for datatype
9756 * automatic type-inference, with AddTCs command to insert new
9757 type-checking rules;
9759 * datatype introduction rules are now added as Safe Introduction rules
9762 * the syntax "if P then x else y" is now available in addition to
9766 *** Internal programming interfaces ***
9768 * tuned simplifier trace output; new flag debug_simp;
9770 * structures Vartab / Termtab (instances of TableFun) offer efficient
9771 tables indexed by indexname_ord / term_ord (compatible with aconv);
9773 * AxClass.axclass_tac lost the theory argument;
9775 * tuned current_goals_markers semantics: begin / end goal avoids
9776 printing empty lines;
9778 * removed prs and prs_fn hook, which was broken because it did not
9779 include \n in its semantics, forcing writeln to add one
9780 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9781 string -> unit if you really want to output text without newline;
9783 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9784 plain output, interface builders may have to enable 'isabelle_font'
9785 mode to get Isabelle font glyphs as before;
9787 * refined token_translation interface; INCOMPATIBILITY: output length
9788 now of type real instead of int;
9790 * theory loader actions may be traced via new ThyInfo.add_hook
9791 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9792 your own database of information attached to *whole* theories -- as
9793 opposed to intra-theory data slots offered via TheoryDataFun;
9795 * proper handling of dangling sort hypotheses (at last!);
9796 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9797 extra sort hypotheses that can be witnessed from the type signature;
9798 the force_strip_shyps flag is gone, any remaining shyps are simply
9799 left in the theorem (with a warning issued by strip_shyps_warning);
9803 New in Isabelle98-1 (October 1998)
9804 ----------------------------------
9806 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9808 * several changes of automated proof tools;
9810 * HOL: major changes to the inductive and datatype packages, including
9811 some minor incompatibilities of theory syntax;
9813 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9816 * HOL: removed duplicate thms in Arith:
9817 less_imp_add_less should be replaced by trans_less_add1
9818 le_imp_add_le should be replaced by trans_le_add1
9820 * HOL: unary minus is now overloaded (new type constraints may be
9823 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9824 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9825 now taken as an integer constant.
9827 * Pure: ML function 'theory_of' renamed to 'theory';
9833 1. Asm_full_simp_tac is now more aggressive.
9834 1. It will sometimes reorient premises if that increases their power to
9836 2. It does no longer proceed strictly from left to right but may also
9837 rotate premises to achieve further simplification.
9838 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9839 old Asm_full_simp_tac in that it does not rotate premises.
9840 2. The simplifier now knows a little bit about nat-arithmetic.
9842 * Classical reasoner: wrapper mechanism for the classical reasoner now
9843 allows for selected deletion of wrappers, by introduction of names for
9844 wrapper functionals. This implies that addbefore, addSbefore,
9845 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9846 and that adding two tactics with the same name overwrites the first
9847 one (emitting a warning).
9848 type wrapper = (int -> tactic) -> (int -> tactic)
9849 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9850 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9851 delWrapper, delSWrapper: claset * string -> claset
9852 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9854 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9855 semantics; addbefore now affects only the unsafe part of step_tac
9856 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9857 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9860 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9861 compWrapper; added safe wrapper (and access functions for it);
9863 * HOL/split_all_tac is now much faster and fails if there is nothing
9864 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9865 and the names of the automatically generated variables have changed.
9866 split_all_tac has moved within claset() from unsafe wrappers to safe
9867 wrappers, which means that !!-bound variables are split much more
9868 aggressively, and safe_tac and clarify_tac now split such variables.
9869 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9870 Note: the same holds for record_split_tac, which does the job of
9871 split_all_tac for record fields.
9873 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9874 permanently to the default simpset using Addsplits just like
9875 Addsimps. They can be removed via Delsplits just like
9876 Delsimps. Lower-case versions are also available.
9878 * HOL/Simplifier: The rule split_if is now part of the default
9879 simpset. This means that the simplifier will eliminate all occurrences
9880 of if-then-else in the conclusion of a goal. To prevent this, you can
9881 either remove split_if completely from the default simpset by
9882 `Delsplits [split_if]' or remove it in a specific call of the
9883 simplifier using `... delsplits [split_if]'. You can also add/delete
9884 other case splitting rules to/from the default simpset: every datatype
9885 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9886 t is the name of the datatype).
9888 * Classical reasoner / Simplifier combination: new force_tac (and
9889 derivatives Force_tac, force) combines rewriting and classical
9890 reasoning (and whatever other tools) similarly to auto_tac, but is
9891 aimed to solve the given subgoal completely.
9896 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9897 and `goalw': the theory is no longer needed as an explicit argument -
9898 the current theory context is used; assumptions are no longer returned
9899 at the ML-level unless one of them starts with ==> or !!; it is
9900 recommended to convert to these new commands using isatool fixgoal
9901 (backup your sources first!);
9903 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9904 the current theory context, and 'theory' to lookup stored theories;
9906 * new theory section 'locale' for declaring constants, assumptions and
9907 definitions that have local scope;
9909 * new theory section 'nonterminals' for purely syntactic types;
9911 * new theory section 'setup' for generic ML setup functions
9912 (e.g. package initialization);
9914 * the distribution now includes Isabelle icons: see
9915 lib/logo/isabelle-{small,tiny}.xpm;
9917 * isatool install - install binaries with absolute references to
9920 * isatool logo -- create instances of the Isabelle logo (as EPS);
9922 * print mode 'emacs' reserved for Isamode;
9924 * support multiple print (ast) translations per constant name;
9926 * theorems involving oracles are now printed with a suffixed [!];
9931 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9933 * HOL/inductive package reorganized and improved: now supports mutual
9939 oddI "n : EVEN ==> Suc n : ODD"
9940 evenI "n : ODD ==> Suc n : EVEN"
9942 new theorem list "elims" contains an elimination rule for each of the
9943 recursive sets; inductive definitions now handle disjunctive premises
9944 correctly (also ZF);
9946 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9947 "mutual_induct" no longer exists - the induction rule is always
9948 contained in "induct";
9951 * HOL/datatype package re-implemented and greatly improved: now
9952 supports mutually recursive datatypes such as
9955 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9956 | SUM ('a aexp) ('a aexp)
9957 | DIFF ('a aexp) ('a aexp)
9960 'a bexp = LESS ('a aexp) ('a aexp)
9961 | AND ('a bexp) ('a bexp)
9962 | OR ('a bexp) ('a bexp)
9964 as well as indirectly recursive datatypes such as
9967 ('a, 'b) term = Var 'a
9968 | App 'b ((('a, 'b) term) list)
9970 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9971 induction on mutually / indirectly recursive datatypes.
9973 Primrec equations are now stored in theory and can be accessed via
9974 <function_name>.simps.
9978 - Theories using datatypes must now have theory Datatype as an
9980 - The specific <typename>.induct_tac no longer exists - use the
9981 generic induct_tac instead.
9982 - natE has been renamed to nat.exhaust - use exhaust_tac
9983 instead of res_inst_tac ... natE. Note that the variable
9984 names in nat.exhaust differ from the names in natE, this
9985 may cause some "fragile" proofs to fail.
9986 - The theorems split_<typename>_case and split_<typename>_case_asm
9987 have been renamed to <typename>.split and <typename>.split_asm.
9988 - Since default sorts of type variables are now handled correctly,
9989 some datatype definitions may have to be annotated with explicit
9991 - Primrec definitions no longer require function name and type
9992 of recursive argument.
9994 Consider using isatool fixdatatype to adapt your theories and proof
9995 scripts to the new package (backup your sources first!).
9998 * HOL/record package: considerably improved implementation; now
9999 includes concrete syntax for record types, terms, updates; theorems
10000 for surjective pairing and splitting !!-bound record variables; proof
10001 support is as follows:
10003 1) standard conversions (selectors or updates applied to record
10004 constructor terms) are part of the standard simpset;
10006 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10007 made part of standard simpset and claset via addIffs;
10009 3) a tactic for record field splitting (record_split_tac) is part of
10010 the standard claset (addSWrapper);
10012 To get a better idea about these rules you may retrieve them via
10013 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10014 the name of your record type.
10016 The split tactic 3) conceptually simplifies by the following rule:
10018 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10020 Thus any record variable that is bound by meta-all will automatically
10021 blow up into some record constructor term, consequently the
10022 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10023 solve record problems automatically.
10026 * reorganized the main HOL image: HOL/Integ and String loaded by
10027 default; theory Main includes everything;
10029 * automatic simplification of integer sums and comparisons, using cancellation;
10031 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10033 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10035 * many new identities for unions, intersections, set difference, etc.;
10037 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10038 called split_if, split_split, split_sum_case and split_nat_case (to go
10039 with add/delsplits);
10041 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10042 (?x::unit) = (); this is made part of the default simpset, which COULD
10043 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10044 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10045 unit_abs_eta_conv is added in order to counter the effect of
10046 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10049 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10052 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10053 It and 'sym RS equals0D' are now in the default claset, giving automatic
10054 disjointness reasoning but breaking a few old proofs.
10056 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10057 to 'converse' from 'inverse' (for compatibility with ZF and some
10060 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10061 the well-founded relation;
10063 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10064 Compl A. The "Compl" syntax remains available as input syntax for this
10067 * HOL/Update: new theory of function updates:
10068 f(a:=b) == %x. if x=a then b else f x
10069 may also be iterated as in f(a:=b,c:=d,...);
10071 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10074 - new function list_update written xs[i:=v] that updates the i-th
10075 list position. May also be iterated as in xs[i:=a,j:=b,...].
10076 - new function `upt' written [i..j(] which generates the list
10077 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10078 bound write [i..j], which is a shorthand for [i..j+1(].
10079 - new lexicographic orderings and corresponding wellfoundedness theorems.
10082 - removed 'pred' (predecessor) function;
10083 - generalized some theorems about n-1;
10084 - many new laws about "div" and "mod";
10085 - new laws about greatest common divisors (see theory ex/Primes);
10087 * HOL/Relation: renamed the relational operator r^-1 "converse"
10088 instead of "inverse";
10090 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10091 of the multiset ordering;
10093 * directory HOL/Real: a construction of the reals using Dedekind cuts
10094 (not included by default);
10096 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10098 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10099 programs, i.e. different program variables may have different types.
10101 * calling (stac rew i) now fails if "rew" has no effect on the goal
10102 [previously, this check worked only if the rewrite rule was unconditional]
10103 Now rew can involve either definitions or equalities (either == or =).
10108 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10109 only the theorems proved on ZF.ML;
10111 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10112 It and 'sym RS equals0D' are now in the default claset, giving automatic
10113 disjointness reasoning but breaking a few old proofs.
10115 * ZF/Update: new theory of function updates
10116 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10117 may also be iterated as in f(a:=b,c:=d,...);
10119 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10121 * calling (stac rew i) now fails if "rew" has no effect on the goal
10122 [previously, this check worked only if the rewrite rule was unconditional]
10123 Now rew can involve either definitions or equalities (either == or =).
10125 * case_tac provided for compatibility with HOL
10126 (like the old excluded_middle_tac, but with subgoals swapped)
10129 *** Internal programming interfaces ***
10131 * Pure: several new basic modules made available for general use, see
10132 also src/Pure/README;
10134 * improved the theory data mechanism to support encapsulation (data
10135 kind name replaced by private Object.kind, acting as authorization
10136 key); new type-safe user interface via functor TheoryDataFun; generic
10137 print_data function becomes basically useless;
10139 * removed global_names compatibility flag -- all theory declarations
10140 are qualified by default;
10142 * module Pure/Syntax now offers quote / antiquote translation
10143 functions (useful for Hoare logic etc. with implicit dependencies);
10144 see HOL/ex/Antiquote for an example use;
10146 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10149 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10152 * Display.print_goals function moved to Locale.print_goals;
10154 * standard print function for goals supports current_goals_markers
10155 variable for marking begin of proof, end of proof, start of goal; the
10156 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10157 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10162 New in Isabelle98 (January 1998)
10163 --------------------------------
10165 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10167 * changed lexical syntax of terms / types: dots made part of long
10168 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10170 * simpset (and claset) reference variable replaced by functions
10171 simpset / simpset_ref;
10173 * no longer supports theory aliases (via merge) and non-trivial
10174 implicit merge of thms' signatures;
10176 * most internal names of constants changed due to qualified names;
10178 * changed Pure/Sequence interface (see Pure/seq.ML);
10181 *** General Changes ***
10183 * hierachically structured name spaces (for consts, types, axms, thms
10184 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10185 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10186 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10187 long_names for fully qualified output names; NOTE: ML programs
10188 (special tactics, packages etc.) referring to internal names may have
10189 to be adapted to cope with fully qualified names; in case of severe
10190 backward campatibility problems try setting 'global_names' at compile
10191 time to have enrything declared within a flat name space; one may also
10192 fine tune name declarations in theories via the 'global' and 'local'
10195 * reimplemented the implicit simpset and claset using the new anytype
10196 data filed in signatures; references simpset:simpset ref etc. are
10197 replaced by functions simpset:unit->simpset and
10198 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10199 to patch your ML files accordingly;
10201 * HTML output now includes theory graph data for display with Java
10202 applet or isatool browser; data generated automatically via isatool
10203 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10205 * defs may now be conditional; improved rewrite_goals_tac to handle
10206 conditional equations;
10208 * defs now admits additional type arguments, using TYPE('a) syntax;
10210 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10211 creates a new theory node; implicit merge of thms' signatures is
10212 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10213 transfer:theory->thm->thm in (rare) cases;
10215 * improved handling of draft signatures / theories; draft thms (and
10216 ctyps, cterms) are automatically promoted to real ones;
10218 * slightly changed interfaces for oracles: admit many per theory, named
10219 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10221 * print_goals: optional output of const types (set show_consts and
10224 * improved output of warnings (###) and errors (***);
10226 * subgoal_tac displays a warning if the new subgoal has type variables;
10228 * removed old README and Makefiles;
10230 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10232 * removed obsolete init_pps and init_database;
10234 * deleted the obsolete tactical STATE, which was declared by
10235 fun STATE tacfun st = tacfun st st;
10237 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10238 (which abbreviates $HOME);
10240 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10241 use isatool fixseq to adapt your ML programs (this works for fully
10242 qualified references to the Sequence structure only!);
10244 * use_thy no longer requires writable current directory; it always
10245 reloads .ML *and* .thy file, if either one is out of date;
10248 *** Classical Reasoner ***
10250 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10251 tactics that use classical reasoning to simplify a subgoal without
10252 splitting it into several subgoals;
10254 * Safe_tac: like safe_tac but uses the default claset;
10259 * added simplification meta rules:
10260 (asm_)(full_)simplify: simpset -> thm -> thm;
10262 * simplifier.ML no longer part of Pure -- has to be loaded by object
10265 * added prems argument to simplification procedures;
10267 * HOL, FOL, ZF: added infix function `addsplits':
10268 instead of `<simpset> setloop (split_tac <thms>)'
10269 you can simply write `<simpset> addsplits <thms>'
10274 * TYPE('a) syntax for type reflection terms;
10276 * no longer handles consts with name "" -- declare as 'syntax' instead;
10278 * pretty printer: changed order of mixfix annotation preference (again!);
10280 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10285 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10286 with `addloop' of the simplifier to faciliate case splitting in premises.
10288 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10290 * HOL/Auth: new protocol proofs including some for the Internet
10293 * HOL/Map: new theory of `maps' a la VDM;
10295 * HOL/simplifier: simplification procedures nat_cancel_sums for
10296 cancelling out common nat summands from =, <, <= (in)equalities, or
10297 differences; simplification procedures nat_cancel_factor for
10298 cancelling common factor from =, <, <= (in)equalities over natural
10299 sums; nat_cancel contains both kinds of procedures, it is installed by
10300 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10302 * HOL/simplifier: terms of the form
10303 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10305 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10306 and those of the form
10307 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10309 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10312 Each datatype `t' now comes with a theorem `split_t_case' of the form
10314 P(t_case f1 ... fn x) =
10315 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10317 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10320 and a theorem `split_t_case_asm' of the form
10322 P(t_case f1 ... fn x) =
10323 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10325 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10327 which can be added to a simpset via `addsplits'. The existing theorems
10328 expand_list_case and expand_option_case have been renamed to
10329 split_list_case and split_option_case.
10332 - `pred n' is automatically converted to `n-1'.
10333 Users are strongly encouraged not to use `pred' any longer,
10334 because it will disappear altogether at some point.
10335 - Users are strongly encouraged to write "0 < n" rather than
10336 "n ~= 0". Theorems and proof tools have been modified towards this
10340 the function "set_of_list" has been renamed "set" (and its theorems too);
10341 the function "nth" now takes its arguments in the reverse order and
10342 has acquired the infix notation "!" as in "xs!n".
10344 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10346 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10347 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10349 * HOL/record: extensible records with schematic structural subtyping
10350 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10351 still lacks various theorems and concrete record syntax;
10356 * removed "axioms" and "generated by" sections;
10358 * replaced "ops" section by extended "consts" section, which is capable of
10359 handling the continuous function space "->" directly;
10362 . proves theorems immediately and stores them in the theory,
10363 . creates hierachical name space,
10364 . now uses normal mixfix annotations (instead of cinfix...),
10365 . minor changes to some names and values (for consistency),
10366 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10367 . separator between mutual domain defs: changed "," to "and",
10368 . improved handling of sort constraints; now they have to
10369 appear on the left-hand side of the equations only;
10371 * fixed LAM <x,y,zs>.b syntax;
10373 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10374 adm (%x. P (t x)), where P is chainfinite and t continuous;
10379 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10380 with `addloop' of the simplifier to faciliate case splitting in premises.
10382 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10383 in HOL, they strip ALL and --> from proved theorems;
10387 New in Isabelle94-8 (May 1997)
10388 ------------------------------
10390 *** General Changes ***
10392 * new utilities to build / run / maintain Isabelle etc. (in parts
10393 still somewhat experimental); old Makefiles etc. still functional;
10395 * new 'Isabelle System Manual';
10397 * INSTALL text, together with ./configure and ./build scripts;
10399 * reimplemented type inference for greater efficiency, better error
10400 messages and clean internal interface;
10402 * prlim command for dealing with lots of subgoals (an easier way of
10403 setting goals_limit);
10408 * supports alternative (named) syntax tables (parser and pretty
10409 printer); internal interface is provided by add_modesyntax(_i);
10411 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10412 be used in conjunction with the Isabelle symbol font; uses the
10413 "symbols" syntax table;
10415 * added token_translation interface (may translate name tokens in
10416 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10417 the current print_mode); IMPORTANT: user print translation functions
10418 are responsible for marking newly introduced bounds
10419 (Syntax.mark_boundT);
10421 * token translations for modes "xterm" and "xterm_color" that display
10422 names in bold, underline etc. or colors (which requires a color
10425 * infixes may now be declared with names independent of their syntax;
10427 * added typed_print_translation (like print_translation, but may
10428 access type of constant);
10431 *** Classical Reasoner ***
10433 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10434 some limitations. Blast_tac...
10435 + ignores addss, addbefore, addafter; this restriction is intrinsic
10436 + ignores elimination rules that don't have the correct format
10437 (the conclusion MUST be a formula variable)
10438 + ignores types, which can make HOL proofs fail
10439 + rules must not require higher-order unification, e.g. apply_type in ZF
10440 [message "Function Var's argument not a bound variable" relates to this]
10441 + its proof strategy is more general but can actually be slower
10443 * substitution with equality assumptions no longer permutes other
10446 * minor changes in semantics of addafter (now called addaltern); renamed
10447 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10448 (and access functions for it);
10450 * improved combination of classical reasoner and simplifier:
10451 + functions for handling clasimpsets
10452 + improvement of addss: now the simplifier is called _after_ the
10454 + safe variant of addss called addSss: uses safe simplifications
10455 _during_ the safe steps. It is more complete as it allows multiple
10456 instantiations of unknowns (e.g. with slow_tac).
10460 * added interface for simplification procedures (functions that
10461 produce *proven* rewrite rules on the fly, depending on current
10464 * ordering on terms as parameter (used for ordered rewriting);
10466 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10468 * the solver is now split into a safe and an unsafe part.
10469 This should be invisible for the normal user, except that the
10470 functions setsolver and addsolver have been renamed to setSolver and
10471 addSolver; added safe_asm_full_simp_tac;
10476 * a generic induction tactic `induct_tac' which works for all datatypes and
10477 also for type `nat';
10479 * a generic case distinction tactic `exhaust_tac' which works for all
10480 datatypes and also for type `nat';
10482 * each datatype comes with a function `size';
10484 * patterns in case expressions allow tuple patterns as arguments to
10485 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10487 * primrec now also works with type nat;
10489 * recdef: a new declaration form, allows general recursive functions to be
10490 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10492 * the constant for negation has been renamed from "not" to "Not" to
10493 harmonize with FOL, ZF, LK, etc.;
10495 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10498 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10500 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10501 problems in commutative rings, using axiomatic type classes for + and *;
10503 * more examples in HOL/MiniML and HOL/Auth;
10505 * more default rewrite rules for quantifiers, union/intersection;
10507 * a new constant `arbitrary == @x.False';
10509 * HOLCF/IOA replaces old HOL/IOA;
10511 * HOLCF changes: derived all rules and arities
10512 + axiomatic type classes instead of classes
10513 + typedef instead of faking type definitions
10514 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10515 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10516 + eliminated the types void, one, tr
10517 + use unit lift and bool lift (with translations) instead of one and tr
10518 + eliminated blift from Lift3.thy (use Def instead of blift)
10519 all eliminated rules are derived as theorems --> no visible changes ;
10524 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10525 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10526 as ZF_cs addSIs [equalityI];
10530 New in Isabelle94-7 (November 96)
10531 ---------------------------------
10533 * allowing negative levels (as offsets) in prlev and choplev;
10535 * super-linear speedup for large simplifications;
10537 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10538 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10539 FAIL); can suppress it using the command Delsimps (ex_simps @
10540 all_simps); De Morgan laws are also now included, by default;
10542 * improved printing of ==> : ~:
10544 * new object-logic "Sequents" adds linear logic, while replacing LK
10545 and Modal (thanks to Sara Kalvala);
10547 * HOL/Auth: correctness proofs for authentication protocols;
10549 * HOL: new auto_tac combines rewriting and classical reasoning (many
10550 examples on HOL/Auth);
10552 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10553 the rewriter and classical reasoner simultaneously;
10555 * function uresult no longer returns theorems in "standard" format;
10556 regain previous version by: val uresult = standard o uresult;
10560 New in Isabelle94-6
10561 -------------------
10563 * oracles -- these establish an interface between Isabelle and trusted
10564 external reasoners, which may deliver results as theorems;
10566 * proof objects (in particular record all uses of oracles);
10568 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10570 * "constdefs" section in theory files;
10572 * "primrec" section (HOL) no longer requires names;
10574 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10578 New in Isabelle94-5
10579 -------------------
10581 * reduced space requirements;
10583 * automatic HTML generation from theories;
10585 * theory files no longer require "..." (quotes) around most types;
10587 * new examples, including two proofs of the Church-Rosser theorem;
10589 * non-curried (1994) version of HOL is no longer distributed;
10593 New in Isabelle94-4
10594 -------------------
10596 * greatly reduced space requirements;
10598 * theory files (.thy) no longer require \...\ escapes at line breaks;
10600 * searchable theorem database (see the section "Retrieving theorems" on
10601 page 8 of the Reference Manual);
10603 * new examples, including Grabczewski's monumental case study of the
10606 * The previous version of HOL renamed to Old_HOL;
10608 * The new version of HOL (previously called CHOL) uses a curried syntax
10609 for functions. Application looks like f a b instead of f(a,b);
10611 * Mutually recursive inductive definitions finally work in HOL;
10613 * In ZF, pattern-matching on tuples is now available in all abstractions and
10614 translates to the operator "split";
10618 New in Isabelle94-3
10619 -------------------
10621 * new infix operator, addss, allowing the classical reasoner to
10622 perform simplification at each step of its search. Example:
10623 fast_tac (cs addss ss)
10625 * a new logic, CHOL, the same as HOL, but with a curried syntax
10626 for functions. Application looks like f a b instead of f(a,b). Also pairs
10627 look like (a,b) instead of <a,b>;
10629 * PLEASE NOTE: CHOL will eventually replace HOL!
10631 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10632 It translates to the operator "split". A new theory of integers is available;
10634 * In ZF, integer numerals now denote two's-complement binary integers.
10635 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10637 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10638 of the Axiom of Choice;
10642 New in Isabelle94-2
10643 -------------------
10645 * Significantly faster resolution;
10647 * the different sections in a .thy file can now be mixed and repeated
10650 * Database of theorems for FOL, HOL and ZF. New
10651 commands including qed, qed_goal and bind_thm store theorems in the database.
10653 * Simple database queries: return a named theorem (get_thm) or all theorems of
10654 a given theory (thms_of), or find out what theory a theorem was proved in
10657 * Bugs fixed in the inductive definition and datatype packages;
10659 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10660 and HOL_dup_cs obsolete;
10662 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10665 * Simpler definition of function space in ZF;
10667 * new results about cardinal and ordinal arithmetic in ZF;
10669 * 'subtype' facility in HOL for introducing new types as subsets of existing
10672 :mode=isabelle-news:wrap=hard:maxLineLen=72: