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 * Former global reference trace_unify_fail is now available as
132 configuration option "unify_trace_failure" (global context only).
134 * Type theory is now immutable, without any special treatment of
135 drafts or linear updates (which could lead to "stale theory" errors in
136 the past). Discontinued obsolete operations like Theory.copy,
137 Theory.checkpoint, and the auxiliary type theory_ref. Minor
140 * System option "proofs" has been discontinued. Instead the global
141 state of Proofterm.proofs is persistently compiled into logic images
142 as required, notably HOL-Proofs. Users no longer need to change
143 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
145 * Syntax translation functions (print_translation etc.) always depend
146 on Proof.context. Discontinued former "(advanced)" option -- this is
147 now the default. Minor INCOMPATIBILITY.
149 * Target-sensitive commands 'interpretation' and 'sublocale'.
150 Particulary, 'interpretation' now allows for non-persistent
151 interpretation within "context ... begin ... end" blocks. See
152 "isar-ref" manual for details.
154 * Improved locales diagnostic command 'print_dependencies'.
156 * Discontinued obsolete 'axioms' command, which has been marked as
157 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
158 instead, while observing its uniform scope for polymorphism.
160 * Discontinued empty name bindings in 'axiomatization'.
163 * SELECT_GOAL now retains the syntactic context of the overall goal
164 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
170 * Improved support for ad hoc overloading of constants (see also
171 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
173 * Attibute 'code': 'code' now declares concrete and abstract code
174 equations uniformly. Use explicit 'code equation' and 'code abstract'
175 to distinguish both when desired.
178 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
180 - 'code_identifier' declares name hints for arbitrary identifiers in
181 generated code, subsuming 'code_modulename'.
182 See the isar-ref manual for syntax diagrams, and the HOL theories
186 - Various improvements to BNF-based (co)datatype package, including a
187 "primrec_new" command, a "datatype_new_compat" command, and
188 documentation. See "datatypes.pdf" for details.
193 - Renamed many generated theorems, including
194 map_comp' ~> map_comp
199 * Function package: For mutually recursive functions f and g, separate
200 cases rules f.cases and g.cases are generated instead of unusable
201 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
202 in the case that the unusable rule was used nevertheless.
204 * Function package: For each function f, new rules f.elims are
205 automatically generated, which eliminate equalities of the form "f x =
208 * New command "fun_cases" derives ad-hoc elimination rules for
209 function equations as simplified instances of f.elims, analogous to
210 inductive_cases. See HOL/ex/Fundefs.thy for some examples.
212 * Library/Polynomial.thy:
213 - Use lifting for primitive definitions.
214 - Explicit conversions from and to lists of coefficients, used for
216 - Replaced recursion operator poly_rec by fold_coeffs.
217 - Prefer pre-existing gcd operation for gcd.
219 poly_eq_iff ~> poly_eq_poly_eq_iff
221 expand_poly_eq ~> poly_eq_iff
224 * Reification and reflection:
225 - Reification is now directly available in HOL-Main in structure
227 - Reflection now handles multiple lists with variables also.
228 - The whole reflection stack has been decomposed into conversions.
231 * Stronger precedence of syntax for big intersection and union on sets,
232 in accordance with corresponding lattice operations. INCOMPATIBILITY.
234 * Nested case expressions are now translated in a separate check phase
235 rather than during parsing. The data for case combinators is separated
236 from the datatype package. The declaration attribute
237 "case_translation" can be used to register new case combinators:
239 declare [[case_translation case_combinator constructor1 ... constructorN]]
241 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
242 case_of_simps to convert function definitions between a list of
243 equations with patterns on the lhs and a single equation with case
244 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
246 * Notation "{p:A. P}" now allows tuple patterns as well.
248 * Revised devices for recursive definitions over finite sets:
249 - Only one fundamental fold combinator on finite set remains:
250 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
251 This is now identity on infinite sets.
252 - Locales ("mini packages") for fundamental definitions with
253 Finite_Set.fold: folding, folding_idem.
254 - Locales comm_monoid_set, semilattice_order_set and
255 semilattice_neutr_order_set for big operators on sets.
256 See theory Big_Operators for canonical examples.
257 Note that foundational constants comm_monoid_set.F and
258 semilattice_set.F correspond to former combinators fold_image
259 and fold1 respectively. These are now gone. You may use
260 those foundational constants as substitutes, but it is
261 preferable to interpret the above locales accordingly.
262 - Dropped class ab_semigroup_idem_mult (special case of lattice,
263 no longer needed in connection with Finite_Set.fold etc.)
265 card.union_inter ~> card_Un_Int [symmetric]
266 card.union_disjoint ~> card_Un_disjoint
269 * Locale hierarchy for abstract orderings and (semi)lattices.
271 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
273 * Discontinued obsolete src/HOL/IsaMakefile (considered legacy since
274 Isabelle2013). Use "isabelle build" to operate on Isabelle sessions.
276 * Numeric types mapped by default to target language numerals: natural
277 (replaces former code_numeral) and integer (replaces former code_int).
278 Conversions are available as integer_of_natural / natural_of_integer /
279 integer_of_nat / nat_of_integer (in HOL) and
280 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
281 ML). INCOMPATIBILITY.
283 * Discontinued theories Code_Integer and Efficient_Nat by a more
284 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
285 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
286 generation for details. INCOMPATIBILITY.
288 * Complete_Partial_Order.admissible is defined outside the type class
289 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
290 class predicate assumption or sort constraint when possible.
293 * Introduce type class "conditionally_complete_lattice": Like a
294 complete lattice but does not assume the existence of the top and
295 bottom elements. Allows to generalize some lemmas about reals and
296 extended reals. Removed SupInf and replaced it by the instantiation
297 of conditionally_complete_lattice for real. Renamed lemmas about
298 conditionally-complete lattice from Sup_... to cSup_... and from
299 Inf_... to cInf_... to avoid hidding of similar complete lattice
302 * Introduce type class linear_continuum as combination of
303 conditionally-complete lattices and inner dense linorders which have
304 more than one element. INCOMPATIBILITY.
306 * Introduced type classes order_top and order_bot. The old classes top
307 and bot only contain the syntax without assumptions.
308 INCOMPATIBILITY: Rename bot -> order_bot, top -> order_top
310 * Introduce type classes "no_top" and "no_bot" for orderings without
311 top and bottom elements.
313 * Split dense_linorder into inner_dense_order and no_top, no_bot.
315 * Complex_Main: Unify and move various concepts from
316 HOL-Multivariate_Analysis to HOL-Complex_Main.
318 - Introduce type class (lin)order_topology and linear_continuum_topology.
319 Allows to generalize theorems about limits and order.
320 Instances are reals and extended reals.
322 - continuous and continuos_on from Multivariate_Analysis:
323 "continuous" is the continuity of a function at a filter.
324 "isCont" is now an abbrevitation: "isCont x f == continuous (at _) f".
326 Generalized continuity lemmas from isCont to continuous on an arbitrary
329 - compact from Multivariate_Analysis. Use Bolzano's lemma
330 to prove compactness of closed intervals on reals. Continuous functions
331 attain infimum and supremum on compact sets. The inverse of a continuous
332 function is continuous, when the function is continuous on a compact set.
334 - connected from Multivariate_Analysis. Use it to prove the
335 intermediate value theorem. Show connectedness of intervals on
336 linear_continuum_topology).
338 - first_countable_topology from Multivariate_Analysis. Is used to
339 show equivalence of properties on the neighbourhood filter of x and on
340 all sequences converging to x.
342 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved theorems
343 from Library/FDERIV.thy to Deriv.thy and base the definition of DERIV on
344 FDERIV. Add variants of DERIV and FDERIV which are restricted to sets,
345 i.e. to represent derivatives from left or right.
347 - Removed the within-filter. It is replaced by the principal filter:
349 F within X = inf F (principal X)
351 - Introduce "at x within U" as a single constant, "at x" is now an
352 abbreviation for "at x within UNIV"
354 - Introduce named theorem collections tendsto_intros, continuous_intros,
355 continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or
356 FDERIV_intros) are also available as tendsto_eq_intros (or
357 FDERIV_eq_intros) where the right-hand side is replaced by a congruence
358 rule. This allows to apply them as intro rules and then proving
359 equivalence by the simplifier.
361 - Restructured theories in HOL-Complex_Main:
363 + Moved RealDef and RComplete into Real
365 + Introduced Topological_Spaces and moved theorems about
366 topological spaces, filters, limits and continuity to it
368 + Renamed RealVector to Real_Vector_Spaces
370 + Split Lim, SEQ, Series into Topological_Spaces, Real_Vector_Spaces, and
373 + Moved Ln and Log to Transcendental
375 + Moved theorems about continuity from Deriv to Topological_Spaces
377 - Remove various auxiliary lemmas.
381 * Consolidation of library theories on product orders:
383 Product_Lattice ~> Product_Order -- pointwise order on products
384 Product_ord ~> Product_Lexorder -- lexicographic order on products
391 isar_shrink ~> isar_compress
393 * Imperative-HOL: The MREC combinator is considered legacy and no
394 longer included by default. INCOMPATIBILITY, use partial_function
395 instead, or import theory Legacy_Mrec as a fallback.
397 * HOL-Algebra: Discontinued theories src/HOL/Algebra/abstract and
398 .../poly. Existing theories should be based on
399 src/HOL/Library/Polynomial instead. The latter provides integration
400 with HOL's type classes for rings. INCOMPATIBILITY.
405 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
406 tracing output in the command transaction context instead of physical
407 stdout. See also Toplevel.debug, Toplevel.debugging and
408 ML_Compiler.exn_trace.
410 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
411 "check_property" allows to check specifications of the form "ALL x y
412 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
413 Examples.thy in particular.
415 * More uniform naming of goal functions for skipped proofs:
417 Skip_Proof.prove ~> Goal.prove_sorry
418 Skip_Proof.prove_global ~> Goal.prove_sorry_global
420 * Antiquotation @{theory_context A} is similar to @{theory A}, but
421 presents the result as initial Proof.context.
423 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
424 operate on Proof.context instead of claset, for uniformity with addIs,
425 addEs, addDs etc. Note that claset_of and put_claset allow to manage
426 clasets separately from the context.
428 * Simplifier tactics and tools use proper Proof.context instead of
429 historic type simpset. Old-style declarations like addsimps,
430 addsimprocs etc. operate directly on Proof.context. Raw type simpset
431 retains its use as snapshot of the main Simplifier context, using
432 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
433 old tools by making them depend on (ctxt : Proof.context) instead of
434 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
436 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
437 INCOMPATIBILITY, use @{context} instead.
442 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
443 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
445 * Discontinued obsolete isabelle-process options -f and -u (former
446 administrative aliases of option -e). Minor INCOMPATIBILITY.
448 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
451 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
452 document formats: dvi.gz, ps, ps.gz -- the default document format is
455 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
456 specify global resources of the JVM process run by isabelle build.
458 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
459 to run Isabelle/Scala source files as standalone programs.
461 * Improved "isabelle keywords" tool (for old-style ProofGeneral
462 keyword tables): use Isabelle/Scala operations, which inspect outer
463 syntax without requiring to build sessions first.
467 New in Isabelle2013 (February 2013)
468 -----------------------------------
472 * Theorem status about oracles and unfinished/failed future proofs is
473 no longer printed by default, since it is incompatible with
474 incremental / parallel checking of the persistent document model. ML
475 function Thm.peek_status may be used to inspect a snapshot of the
476 ongoing evaluation process. Note that in batch mode --- notably
477 isabelle build --- the system ensures that future proofs of all
478 accessible theorems in the theory context are finished (as before).
480 * Configuration option show_markup controls direct inlining of markup
481 into the printed representation of formal entities --- notably type
482 and sort constraints. This enables Prover IDE users to retrieve that
483 information via tooltips in the output window, for example.
485 * Command 'ML_file' evaluates ML text from a file directly within the
486 theory, without any predeclaration via 'uses' in the theory header.
488 * Old command 'use' command and corresponding keyword 'uses' in the
489 theory header are legacy features and will be discontinued soon.
490 Tools that load their additional source files may imitate the
491 'ML_file' implementation, such that the system can take care of
492 dependencies properly.
494 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
495 is called fastforce / fast_force_tac already since Isabelle2011-1.
497 * Updated and extended "isar-ref" and "implementation" manual, reduced
498 remaining material in old "ref" manual.
500 * Improved support for auxiliary contexts that indicate block structure
501 for specifications. Nesting of "context fixes ... context assumes ..."
502 and "class ... context ...".
504 * Attribute "consumes" allows a negative value as well, which is
505 interpreted relatively to the total number of premises of the rule in
506 the target context. This form of declaration is stable when exported
507 from a nested 'context' with additional assumptions. It is the
508 preferred form for definitional packages, notably cases/rules produced
509 in HOL/inductive and HOL/function.
511 * More informative error messages for Isar proof commands involving
512 lazy enumerations (method applications etc.).
514 * Refined 'help' command to retrieve outer syntax commands according
515 to name patterns (with clickable results).
518 *** Prover IDE -- Isabelle/Scala/jEdit ***
520 * Parallel terminal proofs ('by') are enabled by default, likewise
521 proofs that are built into packages like 'datatype', 'function'. This
522 allows to "run ahead" checking the theory specifications on the
523 surface, while the prover is still crunching on internal
524 justifications. Unfinished / cancelled proofs are restarted as
525 required to complete full proof checking eventually.
527 * Improved output panel with tooltips, hyperlinks etc. based on the
528 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
529 tooltips leads to some window that supports the same recursively,
530 which can lead to stacks of tooltips as the semantic document content
531 is explored. ESCAPE closes the whole stack, individual windows may be
532 closed separately, or detached to become independent jEdit dockables.
534 * Improved support for commands that produce graph output: the text
535 message contains a clickable area to open a new instance of the graph
538 * More robust incremental parsing of outer syntax (partial comments,
539 malformed symbols). Changing the balance of open/close quotes and
540 comment delimiters works more conveniently with unfinished situations
541 that frequently occur in user interaction.
543 * More efficient painting and improved reactivity when editing large
544 files. More scalable management of formal document content.
546 * Smarter handling of tracing messages: prover process pauses after
547 certain number of messages per command transaction, with some user
548 dialog to stop or continue. This avoids swamping the front-end with
549 potentially infinite message streams.
551 * More plugin options and preferences, based on Isabelle/Scala. The
552 jEdit plugin option panel provides access to some Isabelle/Scala
553 options, including tuning parameters for editor reactivity and color
556 * Dockable window "Symbols" provides some editing support for Isabelle
559 * Dockable window "Monitor" shows ML runtime statistics. Note that
560 continuous display of the chart slows down the system.
562 * Improved editing support for control styles: subscript, superscript,
563 bold, reset of style -- operating on single symbols or text
564 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
566 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
567 adjust the main text area font size, and its derivatives for output,
568 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
569 need to be adapted to local keyboard layouts.
571 * More reactive completion popup by default: use \t (TAB) instead of
572 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
573 also "Plugin Options / SideKick / General / Code Completion Options".
575 * Implicit check and build dialog of the specified logic session
576 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
577 demand, without bundling big platform-dependent heap images in the
578 Isabelle distribution.
580 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
581 from Oracle provide better multi-platform experience. This version is
582 now bundled exclusively with Isabelle.
587 * Code generation for Haskell: restrict unqualified imports from
588 Haskell Prelude to a small set of fundamental operations.
590 * Command 'export_code': relative file names are interpreted
591 relatively to master directory of current theory rather than the
592 rather arbitrary current working directory. INCOMPATIBILITY.
594 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
595 use regular rule composition via "OF" / "THEN", or explicit proof
596 structure instead. Note that Isabelle/ML provides a variety of
597 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
598 with some care where this is really required.
600 * Command 'typ' supports an additional variant with explicit sort
601 constraint, to infer and check the most general type conforming to a
602 given sort. Example (in HOL):
604 typ "_ * _ * bool * unit" :: finite
606 * Command 'locale_deps' visualizes all locales and their relations as
614 - Added MaSh relevance filter based on machine-learning; see the
615 Sledgehammer manual for details.
616 - Polished Isar proofs generated with "isar_proofs" option.
617 - Rationalized type encodings ("type_enc" option).
618 - Renamed "kill_provers" subcommand to "kill_all".
620 isar_proof ~> isar_proofs
621 isar_shrink_factor ~> isar_shrink
622 max_relevant ~> max_facts
623 relevance_thresholds ~> fact_thresholds
625 * Quickcheck: added an optimisation for equality premises. It is
626 switched on by default, and can be switched off by setting the
627 configuration quickcheck_optimise_equality to false.
629 * Quotient: only one quotient can be defined by quotient_type
633 - generation of an abstraction function equation in lift_definition
635 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
637 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
640 * Preprocessing of the code generator rewrites set comprehensions into
641 pointfree expressions.
643 * The SMT solver Z3 has now by default a restricted set of directly
644 supported features. For the full set of features (div/mod, nonlinear
645 arithmetic, datatypes/records) with potential proof reconstruction
646 failures, enable the configuration option "z3_with_extensions". Minor
649 * Simplified 'typedef' specifications: historical options for implicit
650 set definition and alternative name have been discontinued. The
651 former behavior of "typedef (open) t = A" is now the default, but
652 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
655 * Removed constant "chars"; prefer "Enum.enum" on type "char"
656 directly. INCOMPATIBILITY.
658 * Moved operation product, sublists and n_lists from theory Enum to
659 List. INCOMPATIBILITY.
661 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
663 * Class "comm_monoid_diff" formalises properties of bounded
664 subtraction, with natural numbers and multisets as typical instances.
666 * Added combinator "Option.these" with type "'a option set => 'a set".
668 * Theory "Transitive_Closure": renamed lemmas
670 reflcl_tranclp -> reflclp_tranclp
671 rtranclp_reflcl -> rtranclp_reflclp
675 * Theory "Rings": renamed lemmas (in class semiring)
677 left_distrib ~> distrib_right
678 right_distrib ~> distrib_left
682 * Generalized the definition of limits:
684 - Introduced the predicate filterlim (LIM x F. f x :> G) which
685 expresses that when the input values x converge to F then the
686 output f x converges to G.
688 - Added filters for convergence to positive (at_top) and negative
691 - Moved infinity in the norm (at_infinity) from
692 Multivariate_Analysis to Complex_Main.
694 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
699 * Theory "Library/Option_ord" provides instantiation of option type to
700 lattice type classes.
702 * Theory "Library/Multiset": renamed
704 constant fold_mset ~> Multiset.fold
705 fact fold_mset_commute ~> fold_mset_comm
709 * Renamed theory Library/List_Prefix to Library/Sublist, with related
712 - Renamed constants (and related lemmas)
715 strict_prefix ~> prefix
717 - Replaced constant "postfix" by "suffixeq" with swapped argument
718 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
719 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
720 Renamed lemmas accordingly.
722 - Added constant "list_hembeq" for homeomorphic embedding on
723 lists. Added abbreviation "sublisteq" for special case
724 "list_hembeq (op =)".
726 - Theory Library/Sublist no longer provides "order" and "bot" type
727 class instances for the prefix order (merely corresponding locale
728 interpretations). The type class instances are now in theory
729 Library/Prefix_Order.
731 - The sublist relation of theory Library/Sublist_Order is now based
732 on "Sublist.sublisteq". Renamed lemmas accordingly:
734 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
735 le_list_append_mono ~> Sublist.list_hembeq_append_mono
736 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
737 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
738 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
739 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
740 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
741 le_list_drop_many ~> Sublist.sublisteq_drop_many
742 le_list_filter_left ~> Sublist.sublisteq_filter_left
743 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
744 le_list_rev_take_iff ~> Sublist.sublisteq_append
745 le_list_same_length ~> Sublist.sublisteq_same_length
746 le_list_take_many_iff ~> Sublist.sublisteq_append'
747 less_eq_list.drop ~> less_eq_list_drop
748 less_eq_list.induct ~> less_eq_list_induct
749 not_le_list_length ~> Sublist.not_sublisteq_length
753 * New theory Library/Countable_Set.
755 * Theory Library/Debug and Library/Parallel provide debugging and
756 parallel execution for code generated towards Isabelle/ML.
758 * Theory Library/FuncSet: Extended support for Pi and extensional and
759 introduce the extensional dependent function space "PiE". Replaced
760 extensional_funcset by an abbreviation, and renamed lemmas from
761 extensional_funcset to PiE as follows:
763 extensional_empty ~> PiE_empty
764 extensional_funcset_empty_domain ~> PiE_empty_domain
765 extensional_funcset_empty_range ~> PiE_empty_range
766 extensional_funcset_arb ~> PiE_arb
767 extensional_funcset_mem ~> PiE_mem
768 extensional_funcset_extend_domainI ~> PiE_fun_upd
769 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
770 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
771 card_extensional_funcset ~> card_PiE
772 finite_extensional_funcset ~> finite_PiE
776 * Theory Library/FinFun: theory of almost everywhere constant
777 functions (supersedes the AFP entry "Code Generation for Functions as
780 * Theory Library/Phantom: generic phantom type to make a type
781 parameter appear in a constant's type. This alternative to adding
782 TYPE('a) as another parameter avoids unnecessary closures in generated
785 * Theory Library/RBT_Impl: efficient construction of red-black trees
786 from sorted associative lists. Merging two trees with rbt_union may
787 return a structurally different tree than before. Potential
790 * Theory Library/IArray: immutable arrays with code generation.
792 * Theory Library/Finite_Lattice: theory of finite lattices.
794 * HOL/Multivariate_Analysis: replaced
796 "basis :: 'a::euclidean_space => nat => real"
797 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
799 on euclidean spaces by using the inner product "_ \<bullet> _" with
800 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
801 "SUM i : Basis. f i * r i".
803 With this change the following constants are also changed or removed:
805 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
806 a $$ i ~> inner a i (where i : Basis)
808 \<pi>, \<pi>' removed
810 Theorems about these constants where removed.
814 component_le_norm ~> Basis_le_norm
815 euclidean_eq ~> euclidean_eq_iff
816 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
817 euclidean_simps ~> inner_simps
818 independent_basis ~> independent_Basis
819 span_basis ~> span_Basis
820 in_span_basis ~> in_span_Basis
821 norm_bound_component_le ~> norm_boound_Basis_le
822 norm_bound_component_lt ~> norm_boound_Basis_lt
823 component_le_infnorm ~> Basis_le_infnorm
829 - Added simproc "measurable" to automatically prove measurability.
831 - Added induction rules for sigma sets with disjoint union
832 (sigma_sets_induct_disjoint) and for Borel-measurable functions
833 (borel_measurable_induct).
835 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
838 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
839 AFP entry "Ordinals_and_Cardinals").
841 * HOL/BNF: New (co)datatype package based on bounded natural functors
842 with support for mixed, nested recursion and interesting non-free
845 * HOL/Finite_Set and Relation: added new set and relation operations
846 expressed by Finite_Set.fold.
848 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
849 trees for the code generator.
851 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
853 possible INCOMPATIBILITY.
855 * HOL/Set: renamed Set.project -> Set.filter
859 *** Document preparation ***
861 * Dropped legacy antiquotations "term_style" and "thm_style", since
862 styles may be given as arguments to "term" and "thm" already.
863 Discontinued legacy styles "prem1" .. "prem19".
865 * Default LaTeX rendering for \<euro> is now based on eurosym package,
866 instead of slightly exotic babel/greek.
868 * Document variant NAME may use different LaTeX entry point
869 document/root_NAME.tex if that file exists, instead of the common
872 * Simplified custom document/build script, instead of old-style
873 document/IsaMakefile. Minor INCOMPATIBILITY.
878 * The default limit for maximum number of worker threads is now 8,
879 instead of 4, in correspondence to capabilities of contemporary
880 hardware and Poly/ML runtime system.
882 * Type Seq.results and related operations support embedded error
883 messages within lazy enumerations, and thus allow to provide
884 informative errors in the absence of any usable results.
886 * Renamed Position.str_of to Position.here to emphasize that this is a
887 formal device to inline positions into message text, but not
888 necessarily printing visible text.
893 * Advanced support for Isabelle sessions and build management, see
894 "system" manual for the chapter of that name, especially the "isabelle
895 build" tool and its examples. The "isabelle mkroot" tool prepares
896 session root directories for use with "isabelle build", similar to
897 former "isabelle mkdir" for "isabelle usedir". Note that this affects
898 document preparation as well. INCOMPATIBILITY, isabelle usedir /
899 mkdir / make are rendered obsolete.
901 * Discontinued obsolete Isabelle/build script, it is superseded by the
902 regular isabelle build tool. For example:
904 isabelle build -s -b HOL
906 * Discontinued obsolete "isabelle makeall".
908 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
909 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
910 provides some traditional targets that invoke "isabelle build". Note
911 that this is inefficient! Applications of Isabelle/HOL involving
912 "isabelle make" should be upgraded to use "isabelle build" directly.
914 * The "isabelle options" tool prints Isabelle system options, as
915 required for "isabelle build", for example.
917 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
918 Minor INCOMPATIBILITY in command-line options.
920 * The "isabelle install" tool has now a simpler command-line. Minor
923 * The "isabelle components" tool helps to resolve add-on components
924 that are not bundled, or referenced from a bare-bones repository
927 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
928 platform family: "linux", "macos", "windows".
930 * The ML system is configured as regular component, and no longer
931 picked up from some surrounding directory. Potential INCOMPATIBILITY
932 for home-made settings.
934 * Improved ML runtime statistics (heap, threads, future tasks etc.).
936 * Discontinued support for Poly/ML 5.2.1, which was the last version
937 without exception positions and advanced ML compiler/toplevel
940 * Discontinued special treatment of Proof General -- no longer guess
941 PROOFGENERAL_HOME based on accidental file-system layout. Minor
942 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
943 settings manually, or use a Proof General version that has been
944 bundled as Isabelle component.
948 New in Isabelle2012 (May 2012)
949 ------------------------------
953 * Prover IDE (PIDE) improvements:
955 - more robust Sledgehammer integration (as before the sledgehammer
956 command-line needs to be typed into the source buffer)
957 - markup for bound variables
958 - markup for types of term variables (displayed as tooltips)
959 - support for user-defined Isar commands within the running session
960 - improved support for Unicode outside original 16bit range
961 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
963 * Forward declaration of outer syntax keywords within the theory
964 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
965 commands to be used in the same theory where defined.
967 * Auxiliary contexts indicate block structure for specifications with
968 additional parameters and assumptions. Such unnamed contexts may be
969 nested within other targets, like 'theory', 'locale', 'class',
970 'instantiation' etc. Results from the local context are generalized
971 accordingly and applied to the enclosing target context. Example:
975 assumes xy: "x = y" and yz: "y = z"
978 lemma my_trans: "x = z" using xy yz by simp
984 The most basic application is to factor-out context elements of
985 several fixes/assumes/shows theorem statements, e.g. see
986 ~~/src/HOL/Isar_Examples/Group_Context.thy
988 Any other local theory specification element works within the "context
989 ... begin ... end" block as well.
991 * Bundled declarations associate attributed fact expressions with a
992 given name in the context. These may be later included in other
993 contexts. This allows to manage context extensions casually, without
994 the logical dependencies of locales and locale interpretation. See
995 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
997 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
998 declaration, and results are standardized before being stored. Thus
999 old-style "standard" after instantiation or composition of facts
1000 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1001 indices of schematic variables.
1003 * Rule attributes in local theory declarations (e.g. locale or class)
1004 are now statically evaluated: the resulting theorem is stored instead
1005 of the original expression. INCOMPATIBILITY in rare situations, where
1006 the historic accident of dynamic re-evaluation in interpretations
1009 * New tutorial "Programming and Proving in Isabelle/HOL"
1010 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1011 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1012 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1013 Logic" as the recommended beginners tutorial, but does not cover all
1014 of the material of that old tutorial.
1016 * Updated and extended reference manuals: "isar-ref",
1017 "implementation", "system"; reduced remaining material in old "ref"
1023 * Command 'definition' no longer exports the foundational "raw_def"
1024 into the user context. Minor INCOMPATIBILITY, may use the regular
1025 "def" result with attribute "abs_def" to imitate the old version.
1027 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1028 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1029 expand it. This also works for object-logic equality. (Formerly
1030 undocumented feature.)
1032 * Sort constraints are now propagated in simultaneous statements, just
1033 like type constraints. INCOMPATIBILITY in rare situations, where
1034 distinct sorts used to be assigned accidentally. For example:
1036 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1038 lemma "P (x::'a)" and "Q (y::'a::bar)"
1039 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1041 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1042 tolerant against multiple unifiers, as long as the final result is
1043 unique. (As before, rules are composed in canonical right-to-left
1044 order to accommodate newly introduced premises.)
1046 * Renamed some inner syntax categories:
1052 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1053 "num_position" etc. are mainly used instead (which also include
1054 position information via constraints).
1056 * Simplified configuration options for syntax ambiguity: see
1057 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1058 manual. Minor INCOMPATIBILITY.
1060 * Discontinued configuration option "syntax_positions": atomic terms
1061 in parse trees are always annotated by position constraints.
1063 * Old code generator for SML and its commands 'code_module',
1064 'code_library', 'consts_code', 'types_code' have been discontinued.
1065 Use commands of the generic code generator instead. INCOMPATIBILITY.
1067 * Redundant attribute "code_inline" has been discontinued. Use
1068 "code_unfold" instead. INCOMPATIBILITY.
1070 * Dropped attribute "code_unfold_post" in favor of the its dual
1071 "code_abbrev", which yields a common pattern in definitions like
1073 definition [code_abbrev]: "f = t"
1077 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1078 instead. INCOMPATIBILITY.
1080 * Discontinued old "prems" fact, which used to refer to the accidental
1081 collection of foundational premises in the context (already marked as
1082 legacy since Isabelle2011).
1087 * Type 'a set is now a proper type constructor (just as before
1088 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1089 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1090 sets separate, it is often sufficient to rephrase some set S that has
1091 been accidentally used as predicates by "%x. x : S", and some
1092 predicate P that has been accidentally used as set by "{x. P x}".
1093 Corresponding proofs in a first step should be pruned from any
1094 tinkering with former theorems mem_def and Collect_def as far as
1097 For developments which deliberately mix predicates and sets, a
1098 planning step is necessary to determine what should become a predicate
1099 and what a set. It can be helpful to carry out that step in
1100 Isabelle2011-1 before jumping right into the current release.
1102 * Code generation by default implements sets as container type rather
1103 than predicates. INCOMPATIBILITY.
1105 * New type synonym 'a rel = ('a * 'a) set
1107 * The representation of numerals has changed. Datatype "num"
1108 represents strictly positive binary numerals, along with functions
1109 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1110 positive and negated numeric literals, respectively. See also
1111 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1112 user theories may require adaptations as follows:
1114 - Theorems with number_ring or number_semiring constraints: These
1115 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1117 - Theories defining numeric types: Remove number, number_semiring,
1118 and number_ring instances. Defer all theorems about numerals until
1119 after classes one and semigroup_add have been instantiated.
1121 - Numeral-only simp rules: Replace each rule having a "number_of v"
1122 pattern with two copies, one for numeral and one for neg_numeral.
1124 - Theorems about subclasses of semiring_1 or ring_1: These classes
1125 automatically support numerals now, so more simp rules and
1126 simprocs may now apply within the proof.
1128 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1129 Redefine using other integer operations.
1131 * Transfer: New package intended to generalize the existing
1132 "descending" method and related theorem attributes from the Quotient
1133 package. (Not all functionality is implemented yet, but future
1134 development will focus on Transfer as an eventual replacement for the
1135 corresponding parts of the Quotient package.)
1137 - transfer_rule attribute: Maintains a collection of transfer rules,
1138 which relate constants at two different types. Transfer rules may
1139 relate different type instances of the same polymorphic constant,
1140 or they may relate an operation on a raw type to a corresponding
1141 operation on an abstract type (quotient or subtype). For example:
1143 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1144 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1146 - transfer method: Replaces a subgoal on abstract types with an
1147 equivalent subgoal on the corresponding raw types. Constants are
1148 replaced with corresponding ones according to the transfer rules.
1149 Goals are generalized over all free variables by default; this is
1150 necessary for variables whose types change, but can be overridden
1151 for specific variables with e.g. "transfer fixing: x y z". The
1152 variant transfer' method allows replacing a subgoal with one that
1153 is logically stronger (rather than equivalent).
1155 - relator_eq attribute: Collects identity laws for relators of
1156 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1157 transfer method uses these lemmas to infer transfer rules for
1158 non-polymorphic constants on the fly.
1160 - transfer_prover method: Assists with proving a transfer rule for a
1161 new constant, provided the constant is defined in terms of other
1162 constants that already have transfer rules. It should be applied
1163 after unfolding the constant definitions.
1165 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1166 from type nat to type int.
1168 * Lifting: New package intended to generalize the quotient_definition
1169 facility of the Quotient package; designed to work with Transfer.
1171 - lift_definition command: Defines operations on an abstract type in
1172 terms of a corresponding operation on a representation
1173 type. Example syntax:
1175 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1178 Users must discharge a respectfulness proof obligation when each
1179 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1180 the proof is discharged automatically.) The obligation is
1181 presented in a user-friendly, readable form; a respectfulness
1182 theorem in the standard format and a transfer rule are generated
1185 - Integration with code_abstype: For typedefs (e.g. subtypes
1186 corresponding to a datatype invariant, such as dlist),
1187 lift_definition generates a code certificate theorem and sets up
1188 code generation for each constant.
1190 - setup_lifting command: Sets up the Lifting package to work with a
1191 user-defined type. The user must provide either a quotient theorem
1192 or a type_definition theorem. The package configures transfer
1193 rules for equality and quantifiers on the type, and sets up the
1194 lift_definition command to work with the type.
1196 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1197 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1198 Word/Word.thy and Library/Float.thy.
1202 - The 'quotient_type' command now supports a 'morphisms' option with
1203 rep and abs functions, similar to typedef.
1205 - 'quotient_type' sets up new types to work with the Lifting and
1206 Transfer packages, as with 'setup_lifting'.
1208 - The 'quotient_definition' command now requires the user to prove a
1209 respectfulness property at the point where the constant is
1210 defined, similar to lift_definition; INCOMPATIBILITY.
1212 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1213 accordingly, INCOMPATIBILITY.
1215 * New diagnostic command 'find_unused_assms' to find potentially
1216 superfluous assumptions in theorems using Quickcheck.
1220 - Quickcheck returns variable assignments as counterexamples, which
1221 allows to reveal the underspecification of functions under test.
1222 For example, refuting "hd xs = x", it presents the variable
1223 assignment xs = [] and x = a1 as a counterexample, assuming that
1224 any property is false whenever "hd []" occurs in it.
1226 These counterexample are marked as potentially spurious, as
1227 Quickcheck also returns "xs = []" as a counterexample to the
1228 obvious theorem "hd xs = hd xs".
1230 After finding a potentially spurious counterexample, Quickcheck
1231 continues searching for genuine ones.
1233 By default, Quickcheck shows potentially spurious and genuine
1234 counterexamples. The option "genuine_only" sets quickcheck to only
1235 show genuine counterexamples.
1237 - The command 'quickcheck_generator' creates random and exhaustive
1238 value generators for a given type and operations.
1240 It generates values by using the operations as if they were
1241 constructors of that type.
1243 - Support for multisets.
1245 - Added "use_subtype" options.
1247 - Added "quickcheck_locale" configuration to specify how to process
1248 conjectures in a locale context.
1250 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1251 and affecting 'rat' and 'real'.
1254 - Integrated more tightly with SPASS, as described in the ITP 2012
1255 paper "More SPASS with Isabelle".
1256 - Made it try "smt" as a fallback if "metis" fails or times out.
1257 - Added support for the following provers: Alt-Ergo (via Why3 and
1258 TFF1), iProver, iProver-Eq.
1259 - Sped up the minimizer.
1260 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1261 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1262 - Renamed "sound" option to "strict".
1264 * Metis: Added possibility to specify lambda translations scheme as a
1265 parenthesized argument (e.g., "by (metis (lifting) ...)").
1267 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1269 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1271 * New "case_product" attribute to generate a case rule doing multiple
1272 case distinctions at the same time. E.g.
1274 list.exhaust [case_product nat.exhaust]
1276 produces a rule which can be used to perform case distinction on both
1279 * New "eventually_elim" method as a generalized variant of the
1280 eventually_elim* rules. Supports structured proofs.
1282 * Typedef with implicit set definition is considered legacy. Use
1283 "typedef (open)" form instead, which will eventually become the
1286 * Record: code generation can be switched off manually with
1288 declare [[record_coden = false]] -- "default true"
1290 * Datatype: type parameters allow explicit sort constraints.
1292 * Concrete syntax for case expressions includes constraints for source
1293 positions, and thus produces Prover IDE markup for its bindings.
1294 INCOMPATIBILITY for old-style syntax translations that augment the
1295 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1298 * Clarified attribute "mono_set": pure declaration without modifying
1299 the result of the fact expression.
1301 * More default pred/set conversions on a couple of relation operations
1302 and predicates. Added powers of predicate relations. Consolidation
1303 of some relation theorems:
1305 converse_def ~> converse_unfold
1306 rel_comp_def ~> relcomp_unfold
1307 symp_def ~> (modified, use symp_def and sym_def instead)
1308 transp_def ~> transp_trans
1309 Domain_def ~> Domain_unfold
1310 Range_def ~> Domain_converse [symmetric]
1312 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1314 See theory "Relation" for examples for making use of pred/set
1315 conversions by means of attributes "to_set" and "to_pred".
1319 * Renamed facts about the power operation on relations, i.e., relpow
1320 to match the constant's name:
1322 rel_pow_1 ~> relpow_1
1323 rel_pow_0_I ~> relpow_0_I
1324 rel_pow_Suc_I ~> relpow_Suc_I
1325 rel_pow_Suc_I2 ~> relpow_Suc_I2
1326 rel_pow_0_E ~> relpow_0_E
1327 rel_pow_Suc_E ~> relpow_Suc_E
1328 rel_pow_E ~> relpow_E
1329 rel_pow_Suc_D2 ~> relpow_Suc_D2
1330 rel_pow_Suc_E2 ~> relpow_Suc_E2
1331 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1332 rel_pow_E2 ~> relpow_E2
1333 rel_pow_add ~> relpow_add
1334 rel_pow_commute ~> relpow
1335 rel_pow_empty ~> relpow_empty:
1336 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1337 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1338 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1339 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1340 rel_pow_fun_conv ~> relpow_fun_conv
1341 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1342 rel_pow_finite_bounded ~> relpow_finite_bounded
1343 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1344 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1345 single_valued_rel_pow ~> single_valued_relpow
1349 * Theory Relation: Consolidated constant name for relation composition
1350 and corresponding theorem names:
1352 - Renamed constant rel_comp to relcomp.
1354 - Dropped abbreviation pred_comp. Use relcompp instead.
1358 rel_compI ~> relcompI
1359 rel_compEpair ~> relcompEpair
1360 rel_compE ~> relcompE
1361 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1362 rel_comp_empty1 ~> relcomp_empty1
1363 rel_comp_mono ~> relcomp_mono
1364 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1365 rel_comp_distrib ~> relcomp_distrib
1366 rel_comp_distrib2 ~> relcomp_distrib2
1367 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1368 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1369 single_valued_rel_comp ~> single_valued_relcomp
1370 rel_comp_def ~> relcomp_unfold
1371 converse_rel_comp ~> converse_relcomp
1372 pred_compI ~> relcomppI
1373 pred_compE ~> relcomppE
1374 pred_comp_bot1 ~> relcompp_bot1
1375 pred_comp_bot2 ~> relcompp_bot2
1376 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1377 pred_comp_mono ~> relcompp_mono
1378 pred_comp_distrib ~> relcompp_distrib
1379 pred_comp_distrib2 ~> relcompp_distrib2
1380 converse_pred_comp ~> converse_relcompp
1382 finite_rel_comp ~> finite_relcomp
1384 set_rel_comp ~> set_relcomp
1388 * Theory Divides: Discontinued redundant theorems about div and mod.
1389 INCOMPATIBILITY, use the corresponding generic theorems instead.
1391 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1392 zdiv_self ~> div_self
1393 zmod_self ~> mod_self
1396 zdiv_zmod_equality ~> div_mod_equality2
1397 zdiv_zmod_equality2 ~> div_mod_equality
1398 zmod_zdiv_trivial ~> mod_div_trivial
1399 zdiv_zminus_zminus ~> div_minus_minus
1400 zmod_zminus_zminus ~> mod_minus_minus
1401 zdiv_zminus2 ~> div_minus_right
1402 zmod_zminus2 ~> mod_minus_right
1403 zdiv_minus1_right ~> div_minus1_right
1404 zmod_minus1_right ~> mod_minus1_right
1405 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1406 zmod_zmult1_eq ~> mod_mult_right_eq
1407 zpower_zmod ~> power_mod
1408 zdvd_zmod ~> dvd_mod
1409 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1410 mod_mult_distrib ~> mult_mod_left
1411 mod_mult_distrib2 ~> mult_mod_right
1413 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1414 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1416 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1418 * Consolidated theorem names concerning fold combinators:
1420 inf_INFI_fold_inf ~> inf_INF_fold_inf
1421 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1422 INFI_fold_inf ~> INF_fold_inf
1423 SUPR_fold_sup ~> SUP_fold_sup
1424 union_set ~> union_set_fold
1425 minus_set ~> minus_set_fold
1426 INFI_set_fold ~> INF_set_fold
1427 SUPR_set_fold ~> SUP_set_fold
1428 INF_code ~> INF_set_foldr
1429 SUP_code ~> SUP_set_foldr
1430 foldr.simps ~> foldr.simps (in point-free formulation)
1431 foldr_fold_rev ~> foldr_conv_fold
1432 foldl_fold ~> foldl_conv_fold
1433 foldr_foldr ~> foldr_conv_foldl
1434 foldl_foldr ~> foldl_conv_foldr
1435 fold_set_remdups ~> fold_set_fold_remdups
1436 fold_set ~> fold_set_fold
1437 fold1_set ~> fold1_set_fold
1441 * Dropped rarely useful theorems concerning fold combinators:
1442 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1443 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1444 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1445 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1446 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1447 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1448 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1449 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1450 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1451 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1453 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1454 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1455 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1456 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1457 lemmas over fold rather than foldr, or make use of lemmas
1458 fold_conv_foldr and fold_rev.
1460 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1461 through option types.
1463 * "Transitive_Closure.ntrancl": bounded transitive closure on
1466 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1468 * Theory Int: Discontinued many legacy theorems specific to type int.
1469 INCOMPATIBILITY, use the corresponding generic theorems instead.
1471 zminus_zminus ~> minus_minus
1472 zminus_0 ~> minus_zero
1473 zminus_zadd_distrib ~> minus_add_distrib
1474 zadd_commute ~> add_commute
1475 zadd_assoc ~> add_assoc
1476 zadd_left_commute ~> add_left_commute
1479 zadd_0 ~> add_0_left
1480 zadd_0_right ~> add_0_right
1481 zadd_zminus_inverse2 ~> left_minus
1482 zmult_zminus ~> mult_minus_left
1483 zmult_commute ~> mult_commute
1484 zmult_assoc ~> mult_assoc
1485 zadd_zmult_distrib ~> left_distrib
1486 zadd_zmult_distrib2 ~> right_distrib
1487 zdiff_zmult_distrib ~> left_diff_distrib
1488 zdiff_zmult_distrib2 ~> right_diff_distrib
1489 zmult_1 ~> mult_1_left
1490 zmult_1_right ~> mult_1_right
1491 zle_refl ~> order_refl
1492 zle_trans ~> order_trans
1493 zle_antisym ~> order_antisym
1494 zle_linear ~> linorder_linear
1495 zless_linear ~> linorder_less_linear
1496 zadd_left_mono ~> add_left_mono
1497 zadd_strict_right_mono ~> add_strict_right_mono
1498 zadd_zless_mono ~> add_less_le_mono
1499 int_0_less_1 ~> zero_less_one
1500 int_0_neq_1 ~> zero_neq_one
1502 zpower_zadd_distrib ~> power_add
1503 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1504 zero_le_zpower_abs ~> zero_le_power_abs
1506 * Theory Deriv: Renamed
1508 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1510 * Theory Library/Multiset: Improved code generation of multisets.
1512 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1513 are expressed via type classes again. The special syntax
1514 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1515 setsum_set, which is now subsumed by Big_Operators.setsum.
1518 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1519 use theory HOL/Library/Nat_Bijection instead.
1521 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1522 trees is now inside a type class context. Names of affected
1523 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1524 theories working directly with raw red-black trees, adapt the names as
1528 bulkload -> rbt_bulkload
1529 del_from_left -> rbt_del_from_left
1530 del_from_right -> rbt_del_from_right
1532 delete -> rbt_delete
1534 insert -> rbt_insert
1535 insertw -> rbt_insert_with
1536 insert_with_key -> rbt_insert_with_key
1537 map_entry -> rbt_map_entry
1538 lookup -> rbt_lookup
1539 sorted -> rbt_sorted
1540 tree_greater -> rbt_greater
1541 tree_less -> rbt_less
1542 tree_less_symbol -> rbt_less_symbol
1544 union_with -> rbt_union_with
1545 union_with_key -> rbt_union_with_key
1548 balance_left_sorted -> balance_left_rbt_sorted
1549 balance_left_tree_greater -> balance_left_rbt_greater
1550 balance_left_tree_less -> balance_left_rbt_less
1551 balance_right_sorted -> balance_right_rbt_sorted
1552 balance_right_tree_greater -> balance_right_rbt_greater
1553 balance_right_tree_less -> balance_right_rbt_less
1554 balance_sorted -> balance_rbt_sorted
1555 balance_tree_greater -> balance_rbt_greater
1556 balance_tree_less -> balance_rbt_less
1557 bulkload_is_rbt -> rbt_bulkload_is_rbt
1558 combine_sorted -> combine_rbt_sorted
1559 combine_tree_greater -> combine_rbt_greater
1560 combine_tree_less -> combine_rbt_less
1561 delete_in_tree -> rbt_delete_in_tree
1562 delete_is_rbt -> rbt_delete_is_rbt
1563 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1564 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1565 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1566 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1567 del_in_tree -> rbt_del_in_tree
1568 del_inv1_inv2 -> rbt_del_inv1_inv2
1569 del_sorted -> rbt_del_rbt_sorted
1570 del_tree_greater -> rbt_del_rbt_greater
1571 del_tree_less -> rbt_del_rbt_less
1572 dom_lookup_Branch -> dom_rbt_lookup_Branch
1573 entries_lookup -> entries_rbt_lookup
1574 finite_dom_lookup -> finite_dom_rbt_lookup
1575 insert_sorted -> rbt_insert_rbt_sorted
1576 insertw_is_rbt -> rbt_insertw_is_rbt
1577 insertwk_is_rbt -> rbt_insertwk_is_rbt
1578 insertwk_sorted -> rbt_insertwk_rbt_sorted
1579 insertw_sorted -> rbt_insertw_rbt_sorted
1580 ins_sorted -> ins_rbt_sorted
1581 ins_tree_greater -> ins_rbt_greater
1582 ins_tree_less -> ins_rbt_less
1583 is_rbt_sorted -> is_rbt_rbt_sorted
1584 lookup_balance -> rbt_lookup_balance
1585 lookup_bulkload -> rbt_lookup_rbt_bulkload
1586 lookup_delete -> rbt_lookup_rbt_delete
1587 lookup_Empty -> rbt_lookup_Empty
1588 lookup_from_in_tree -> rbt_lookup_from_in_tree
1589 lookup_in_tree -> rbt_lookup_in_tree
1590 lookup_ins -> rbt_lookup_ins
1591 lookup_insert -> rbt_lookup_rbt_insert
1592 lookup_insertw -> rbt_lookup_rbt_insertw
1593 lookup_insertwk -> rbt_lookup_rbt_insertwk
1594 lookup_keys -> rbt_lookup_keys
1595 lookup_map -> rbt_lookup_map
1596 lookup_map_entry -> rbt_lookup_rbt_map_entry
1597 lookup_tree_greater -> rbt_lookup_rbt_greater
1598 lookup_tree_less -> rbt_lookup_rbt_less
1599 lookup_union -> rbt_lookup_rbt_union
1600 map_entry_color_of -> rbt_map_entry_color_of
1601 map_entry_inv1 -> rbt_map_entry_inv1
1602 map_entry_inv2 -> rbt_map_entry_inv2
1603 map_entry_is_rbt -> rbt_map_entry_is_rbt
1604 map_entry_sorted -> rbt_map_entry_rbt_sorted
1605 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1606 map_entry_tree_less -> rbt_map_entry_rbt_less
1607 map_tree_greater -> map_rbt_greater
1608 map_tree_less -> map_rbt_less
1609 map_sorted -> map_rbt_sorted
1610 paint_sorted -> paint_rbt_sorted
1611 paint_lookup -> paint_rbt_lookup
1612 paint_tree_greater -> paint_rbt_greater
1613 paint_tree_less -> paint_rbt_less
1614 sorted_entries -> rbt_sorted_entries
1615 tree_greater_eq_trans -> rbt_greater_eq_trans
1616 tree_greater_nit -> rbt_greater_nit
1617 tree_greater_prop -> rbt_greater_prop
1618 tree_greater_simps -> rbt_greater_simps
1619 tree_greater_trans -> rbt_greater_trans
1620 tree_less_eq_trans -> rbt_less_eq_trans
1621 tree_less_nit -> rbt_less_nit
1622 tree_less_prop -> rbt_less_prop
1623 tree_less_simps -> rbt_less_simps
1624 tree_less_trans -> rbt_less_trans
1625 tree_ord_props -> rbt_ord_props
1626 union_Branch -> rbt_union_Branch
1627 union_is_rbt -> rbt_union_is_rbt
1628 unionw_is_rbt -> rbt_unionw_is_rbt
1629 unionwk_is_rbt -> rbt_unionwk_is_rbt
1630 unionwk_sorted -> rbt_unionwk_rbt_sorted
1632 * Theory HOL/Library/Float: Floating point numbers are now defined as
1633 a subset of the real numbers. All operations are defined using the
1634 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1641 round_down -> float_round_down
1642 round_up -> float_round_up
1646 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1649 abs_float_def -> Float.compute_float_abs
1650 bitlen_ge0 -> bitlen_nonneg
1651 bitlen.simps -> Float.compute_bitlen
1652 float_components -> Float_mantissa_exponent
1653 float_divl.simps -> Float.compute_float_divl
1654 float_divr.simps -> Float.compute_float_divr
1655 float_eq_odd -> mult_powr_eq_mult_powr_iff
1656 float_power -> real_of_float_power
1657 lapprox_posrat_def -> Float.compute_lapprox_posrat
1658 lapprox_rat.simps -> Float.compute_lapprox_rat
1659 le_float_def' -> Float.compute_float_le
1660 le_float_def -> less_eq_float.rep_eq
1661 less_float_def' -> Float.compute_float_less
1662 less_float_def -> less_float.rep_eq
1663 normfloat_def -> Float.compute_normfloat
1664 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1665 normfloat -> normfloat_def
1666 normfloat_unique -> use normfloat_def
1667 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1668 one_float_def -> Float.compute_float_one
1669 plus_float_def -> Float.compute_float_plus
1670 rapprox_posrat_def -> Float.compute_rapprox_posrat
1671 rapprox_rat.simps -> Float.compute_rapprox_rat
1672 real_of_float_0 -> zero_float.rep_eq
1673 real_of_float_1 -> one_float.rep_eq
1674 real_of_float_abs -> abs_float.rep_eq
1675 real_of_float_add -> plus_float.rep_eq
1676 real_of_float_minus -> uminus_float.rep_eq
1677 real_of_float_mult -> times_float.rep_eq
1678 real_of_float_simp -> Float.rep_eq
1679 real_of_float_sub -> minus_float.rep_eq
1680 round_down.simps -> Float.compute_float_round_down
1681 round_up.simps -> Float.compute_float_round_up
1682 times_float_def -> Float.compute_float_times
1683 uminus_float_def -> Float.compute_float_uminus
1684 zero_float_def -> Float.compute_float_zero
1686 Lemmas not necessary anymore, use the transfer method:
1687 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1688 float_divr, float_le_simp, float_less1_mantissa_bound,
1689 float_less_simp, float_less_zero, float_le_zero,
1690 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1691 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1692 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1693 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1694 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1695 round_up, zero_le_float, zero_less_float
1697 * New theory HOL/Library/DAList provides an abstract type for
1698 association lists with distinct keys.
1700 * Session HOL/IMP: Added new theory of abstract interpretation of
1703 * Session HOL-Import: Re-implementation from scratch is faster,
1704 simpler, and more scalable. Requires a proof bundle, which is
1705 available as an external component. Discontinued old (and mostly
1706 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1708 * Session HOL-Word: Discontinued many redundant theorems specific to
1709 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1712 word_sub_alt ~> word_sub_wi
1713 word_add_alt ~> word_add_def
1714 word_mult_alt ~> word_mult_def
1715 word_minus_alt ~> word_minus_def
1716 word_0_alt ~> word_0_wi
1717 word_1_alt ~> word_1_wi
1718 word_add_0 ~> add_0_left
1719 word_add_0_right ~> add_0_right
1720 word_mult_1 ~> mult_1_left
1721 word_mult_1_right ~> mult_1_right
1722 word_add_commute ~> add_commute
1723 word_add_assoc ~> add_assoc
1724 word_add_left_commute ~> add_left_commute
1725 word_mult_commute ~> mult_commute
1726 word_mult_assoc ~> mult_assoc
1727 word_mult_left_commute ~> mult_left_commute
1728 word_left_distrib ~> left_distrib
1729 word_right_distrib ~> right_distrib
1730 word_left_minus ~> left_minus
1731 word_diff_0_right ~> diff_0_right
1732 word_diff_self ~> diff_self
1733 word_sub_def ~> diff_minus
1734 word_diff_minus ~> diff_minus
1735 word_add_ac ~> add_ac
1736 word_mult_ac ~> mult_ac
1737 word_plus_ac0 ~> add_0_left add_0_right add_ac
1738 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1739 word_order_trans ~> order_trans
1740 word_order_refl ~> order_refl
1741 word_order_antisym ~> order_antisym
1742 word_order_linear ~> linorder_linear
1743 lenw1_zero_neq_one ~> zero_neq_one
1744 word_number_of_eq ~> number_of_eq
1745 word_of_int_add_hom ~> wi_hom_add
1746 word_of_int_sub_hom ~> wi_hom_sub
1747 word_of_int_mult_hom ~> wi_hom_mult
1748 word_of_int_minus_hom ~> wi_hom_neg
1749 word_of_int_succ_hom ~> wi_hom_succ
1750 word_of_int_pred_hom ~> wi_hom_pred
1751 word_of_int_0_hom ~> word_0_wi
1752 word_of_int_1_hom ~> word_1_wi
1754 * Session HOL-Word: New proof method "word_bitwise" for splitting
1755 machine word equalities and inequalities into logical circuits,
1756 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1757 multiplication, shifting by constants, bitwise operators and numeric
1758 constants. Requires fixed-length word types, not 'a word. Solves
1759 many standard word identities outright and converts more into first
1760 order problems amenable to blast or similar. See also examples in
1761 HOL/Word/Examples/WordExamples.thy.
1763 * Session HOL-Probability: Introduced the type "'a measure" to
1764 represent measures, this replaces the records 'a algebra and 'a
1765 measure_space. The locales based on subset_class now have two
1766 locale-parameters the space \<Omega> and the set of measurable sets M.
1767 The product of probability spaces uses now the same constant as the
1768 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1769 measure". Most constants are defined now outside of locales and gain
1770 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1771 Measure space constructions for distributions and densities now got
1772 their own constants distr and density. Instead of using locales to
1773 describe measure spaces with a finite space, the measure count_space
1774 and point_measure is introduced. INCOMPATIBILITY.
1778 finite_measure.\<mu>' -> measure
1779 product_algebra_generator -> prod_algebra
1780 product_prob_space.emb -> prod_emb
1781 product_prob_space.infprod_algebra -> PiM
1784 completeable_measure_space
1785 finite_measure_space
1787 finite_product_finite_prob_space
1788 finite_product_sigma_algebra
1789 finite_sigma_algebra
1791 pair_finite_prob_space
1792 pair_finite_sigma_algebra
1795 product_sigma_algebra
1799 distribution -> use distr measure, or distributed predicate
1801 joint_distribution -> use distr measure, or distributed predicate
1802 pair_measure_generator
1803 product_prob_space.infprod_algebra -> use PiM
1806 Replacement theorems:
1807 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1808 finite_measure.empty_measure -> measure_empty
1809 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1810 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1811 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1812 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1813 finite_measure.finite_measure -> finite_measure.emeasure_finite
1814 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1815 finite_measure.positive_measure' -> measure_nonneg
1816 finite_measure.real_measure -> finite_measure.emeasure_real
1817 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1818 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1819 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1820 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1821 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1822 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1823 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1824 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1825 information_space.entropy_commute -> information_space.entropy_commute_simple
1826 information_space.entropy_eq -> information_space.entropy_simple_distributed
1827 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1828 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1829 information_space.entropy_uniform_max -> information_space.entropy_uniform
1830 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1831 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1832 information_space.KL_ge_0 -> information_space.KL_nonneg
1833 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1834 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1835 Int_stable_cuboids -> Int_stable_atLeastAtMost
1836 Int_stable_product_algebra_generator -> positive_integral
1837 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1838 measure_space.additive -> emeasure_additive
1839 measure_space.AE_iff_null_set -> AE_iff_null
1840 measure_space.almost_everywhere_def -> eventually_ae_filter
1841 measure_space.almost_everywhere_vimage -> AE_distrD
1842 measure_space.continuity_from_above -> INF_emeasure_decseq
1843 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1844 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1845 measure_space.continuity_from_below -> SUP_emeasure_incseq
1846 measure_space_density -> emeasure_density
1847 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1848 measure_space.integrable_vimage -> integrable_distr
1849 measure_space.integral_translated_density -> integral_density
1850 measure_space.integral_vimage -> integral_distr
1851 measure_space.measure_additive -> plus_emeasure
1852 measure_space.measure_compl -> emeasure_compl
1853 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1854 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1855 measure_space.measure_decseq -> decseq_emeasure
1856 measure_space.measure_Diff -> emeasure_Diff
1857 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1858 measure_space.measure_eq_0 -> emeasure_eq_0
1859 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1860 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1861 measure_space.measure_incseq -> incseq_emeasure
1862 measure_space.measure_insert -> emeasure_insert
1863 measure_space.measure_mono -> emeasure_mono
1864 measure_space.measure_not_negative -> emeasure_not_MInf
1865 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1866 measure_space.measure_setsum -> setsum_emeasure
1867 measure_space.measure_setsum_split -> setsum_emeasure_cover
1868 measure_space.measure_space_vimage -> emeasure_distr
1869 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1870 measure_space.measure_subadditive -> subadditive
1871 measure_space.measure_top -> emeasure_space
1872 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1873 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1874 measure_space.positive_integral_translated_density -> positive_integral_density
1875 measure_space.positive_integral_vimage -> positive_integral_distr
1876 measure_space.real_continuity_from_above -> Lim_measure_decseq
1877 measure_space.real_continuity_from_below -> Lim_measure_incseq
1878 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1879 measure_space.real_measure_Diff -> measure_Diff
1880 measure_space.real_measure_finite_Union -> measure_finite_Union
1881 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1882 measure_space.real_measure_subadditive -> measure_subadditive
1883 measure_space.real_measure_Union -> measure_Union
1884 measure_space.real_measure_UNION -> measure_UNION
1885 measure_space.simple_function_vimage -> simple_function_comp
1886 measure_space.simple_integral_vimage -> simple_integral_distr
1887 measure_space.simple_integral_vimage -> simple_integral_distr
1888 measure_unique_Int_stable -> measure_eqI_generator_eq
1889 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1890 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1891 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1892 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1893 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1894 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1895 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1896 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1897 pair_sigma_algebra.sets_swap -> sets_pair_swap
1898 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1899 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1900 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1901 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1902 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1903 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1904 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1905 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1906 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1907 prob_space.prob_space_vimage -> prob_space_distr
1908 prob_space.random_variable_restrict -> measurable_restrict
1909 prob_space_unique_Int_stable -> measure_eqI_prob_space
1910 product_algebraE -> prod_algebraE_all
1911 product_algebra_generator_der -> prod_algebra_eq_finite
1912 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1913 product_algebraI -> sets_PiM_I_finite
1914 product_measure_exists -> product_sigma_finite.sigma_finite
1915 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1916 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1917 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1918 product_prob_space.measurable_component -> measurable_component_singleton
1919 product_prob_space.measurable_emb -> measurable_prod_emb
1920 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1921 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1922 product_prob_space.measure_emb -> emeasure_prod_emb
1923 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1924 product_sigma_algebra.product_algebra_into_space -> space_closed
1925 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1926 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1927 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1928 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1929 sets_product_algebra -> sets_PiM
1930 sigma_algebra.measurable_sigma -> measurable_measure_of
1931 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1932 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1933 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1934 space_product_algebra -> space_PiM
1936 * Session HOL-TPTP: support to parse and import TPTP problems (all
1937 languages) into Isabelle/HOL.
1942 * New "case_product" attribute (see HOL).
1947 * Greater support for structured proofs involving induction or case
1950 * Much greater use of mathematical symbols.
1952 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1957 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1958 from a minor keyword introduced via theory header declaration.
1960 * Antiquotation @{command_spec "name"} produces the
1961 Outer_Syntax.command_spec from a major keyword introduced via theory
1962 header declaration; it can be passed to Outer_Syntax.command etc.
1964 * Local_Theory.define no longer hard-wires default theorem name
1965 "foo_def", but retains the binding as given. If that is Binding.empty
1966 / Attrib.empty_binding, the result is not registered as user-level
1967 fact. The Local_Theory.define_internal variant allows to specify a
1968 non-empty name (used for the foundation in the background theory),
1969 while omitting the fact binding in the user-context. Potential
1970 INCOMPATIBILITY for derived definitional packages: need to specify
1971 naming policy for primitive definitions more explicitly.
1973 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1974 conformance with similar operations in structure Term and Logic.
1976 * Antiquotation @{attributes [...]} embeds attribute source
1977 representation into the ML text, which is particularly useful with
1978 declarations like Local_Theory.note.
1980 * Structure Proof_Context follows standard naming scheme. Old
1981 ProofContext has been discontinued. INCOMPATIBILITY.
1983 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1984 change of semantics: update is applied to auxiliary local theory
1987 * Modernized some old-style infix operations:
1989 addeqcongs ~> Simplifier.add_eqcong
1990 deleqcongs ~> Simplifier.del_eqcong
1991 addcongs ~> Simplifier.add_cong
1992 delcongs ~> Simplifier.del_cong
1993 setmksimps ~> Simplifier.set_mksimps
1994 setmkcong ~> Simplifier.set_mkcong
1995 setmksym ~> Simplifier.set_mksym
1996 setmkeqTrue ~> Simplifier.set_mkeqTrue
1997 settermless ~> Simplifier.set_termless
1998 setsubgoaler ~> Simplifier.set_subgoaler
1999 addsplits ~> Splitter.add_split
2000 delsplits ~> Splitter.del_split
2005 * USER_HOME settings variable points to cross-platform user home
2006 directory, which coincides with HOME on POSIX systems only. Likewise,
2007 the Isabelle path specification "~" now expands to $USER_HOME, instead
2008 of former $HOME. A different default for USER_HOME may be set
2009 explicitly in shell environment, before Isabelle settings are
2010 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2011 the generic user home was intended.
2013 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2014 notation, which is useful for the jEdit file browser, for example.
2016 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2021 New in Isabelle2011-1 (October 2011)
2022 ------------------------------------
2026 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2027 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2029 - Management of multiple theory files directly from the editor
2030 buffer store -- bypassing the file-system (no requirement to save
2031 files for checking).
2033 - Markup of formal entities within the text buffer, with semantic
2034 highlighting, tooltips and hyperlinks to jump to defining source
2037 - Improved text rendering, with sub/superscripts in the source
2038 buffer (including support for copy/paste wrt. output panel, HTML
2039 theory output and other non-Isabelle text boxes).
2041 - Refined scheduling of proof checking and printing of results,
2042 based on interactive editor view. (Note: jEdit folding and
2043 narrowing allows to restrict buffer perspectives explicitly.)
2045 - Reduced CPU performance requirements, usable on machines with few
2048 - Reduced memory requirements due to pruning of unused document
2049 versions (garbage collection).
2051 See also ~~/src/Tools/jEdit/README.html for further information,
2052 including some remaining limitations.
2054 * Theory loader: source files are exclusively located via the master
2055 directory of each theory node (where the .thy file itself resides).
2056 The global load path (such as src/HOL/Library) has been discontinued.
2057 Note that the path element ~~ may be used to reference theories in the
2058 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2061 * Theory loader: source files are identified by content via SHA1
2062 digests. Discontinued former path/modtime identification and optional
2063 ISABELLE_FILE_IDENT plugin scripts.
2065 * Parallelization of nested Isar proofs is subject to
2066 Goal.parallel_proofs_threshold (default 100). See also isabelle
2069 * Name space: former unsynchronized references are now proper
2070 configuration options, with more conventional names:
2072 long_names ~> names_long
2073 short_names ~> names_short
2074 unique_names ~> names_unique
2076 Minor INCOMPATIBILITY, need to declare options in context like this:
2078 declare [[names_unique = false]]
2080 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2081 that the result needs to be unique, which means fact specifications
2082 may have to be refined after enriching a proof context.
2084 * Attribute "case_names" has been refined: the assumptions in each case
2085 can be named now by following the case name with [name1 name2 ...].
2087 * Isabelle/Isar reference manual has been updated and extended:
2088 - "Synopsis" provides a catalog of main Isar language concepts.
2089 - Formal references in syntax diagrams, via @{rail} antiquotation.
2090 - Updated material from classic "ref" manual, notably about
2091 "Classical Reasoner".
2096 * Class bot and top require underlying partial order rather than
2097 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2099 * Class complete_lattice: generalized a couple of lemmas from sets;
2100 generalized theorems INF_cong and SUP_cong. New type classes for
2101 complete boolean algebras and complete linear orders. Lemmas
2102 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2103 class complete_linorder.
2105 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2106 Sup_fun_def, Inf_apply, Sup_apply.
2108 Removed redundant lemmas (the right hand side gives hints how to
2109 replace them for (metis ...), or (simp only: ...) proofs):
2111 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2112 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2113 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2114 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2115 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2116 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2117 Inter_def ~> INF_def, image_def
2118 Union_def ~> SUP_def, image_def
2119 INT_eq ~> INF_def, and image_def
2120 UN_eq ~> SUP_def, and image_def
2121 INF_subset ~> INF_superset_mono [OF _ order_refl]
2123 More consistent and comprehensive names:
2125 INTER_eq_Inter_image ~> INF_def
2126 UNION_eq_Union_image ~> SUP_def
2129 INF_leI ~> INF_lower
2130 INF_leI2 ~> INF_lower2
2131 le_INFI ~> INF_greatest
2132 le_SUPI ~> SUP_upper
2133 le_SUPI2 ~> SUP_upper2
2134 SUP_leI ~> SUP_least
2135 INFI_bool_eq ~> INF_bool_eq
2136 SUPR_bool_eq ~> SUP_bool_eq
2137 INFI_apply ~> INF_apply
2138 SUPR_apply ~> SUP_apply
2139 INTER_def ~> INTER_eq
2140 UNION_def ~> UNION_eq
2144 * Renamed theory Complete_Lattice to Complete_Lattices.
2147 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2148 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2149 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2150 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2152 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2153 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2154 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2157 * Added syntactic classes "inf" and "sup" for the respective
2158 constants. INCOMPATIBILITY: Changes in the argument order of the
2159 (mostly internal) locale predicates for some derived classes.
2161 * Theorem collections ball_simps and bex_simps do not contain theorems
2162 referring to UNION any longer; these have been moved to collection
2163 UN_ball_bex_simps. INCOMPATIBILITY.
2165 * Theory Archimedean_Field: floor now is defined as parameter of a
2166 separate type class floor_ceiling.
2168 * Theory Finite_Set: more coherent development of fold_set locales:
2170 locale fun_left_comm ~> locale comp_fun_commute
2171 locale fun_left_comm_idem ~> locale comp_fun_idem
2173 Both use point-free characterization; interpretation proofs may need
2174 adjustment. INCOMPATIBILITY.
2176 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2177 accordance with standard mathematical terminology. INCOMPATIBILITY.
2179 * Theory Complex_Main: The locale interpretations for the
2180 bounded_linear and bounded_bilinear locales have been removed, in
2181 order to reduce the number of duplicate lemmas. Users must use the
2182 original names for distributivity theorems, potential INCOMPATIBILITY.
2184 divide.add ~> add_divide_distrib
2185 divide.diff ~> diff_divide_distrib
2186 divide.setsum ~> setsum_divide_distrib
2187 mult.add_right ~> right_distrib
2188 mult.diff_right ~> right_diff_distrib
2189 mult_right.setsum ~> setsum_right_distrib
2190 mult_left.diff ~> left_diff_distrib
2192 * Theory Complex_Main: Several redundant theorems have been removed or
2193 replaced by more general versions. INCOMPATIBILITY.
2195 real_diff_def ~> minus_real_def
2196 real_divide_def ~> divide_real_def
2197 real_less_def ~> less_le
2198 real_abs_def ~> abs_real_def
2199 real_sgn_def ~> sgn_real_def
2200 real_mult_commute ~> mult_commute
2201 real_mult_assoc ~> mult_assoc
2202 real_mult_1 ~> mult_1_left
2203 real_add_mult_distrib ~> left_distrib
2204 real_zero_not_eq_one ~> zero_neq_one
2205 real_mult_inverse_left ~> left_inverse
2206 INVERSE_ZERO ~> inverse_zero
2207 real_le_refl ~> order_refl
2208 real_le_antisym ~> order_antisym
2209 real_le_trans ~> order_trans
2210 real_le_linear ~> linear
2211 real_le_eq_diff ~> le_iff_diff_le_0
2212 real_add_left_mono ~> add_left_mono
2213 real_mult_order ~> mult_pos_pos
2214 real_mult_less_mono2 ~> mult_strict_left_mono
2215 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2216 real_0_le_divide_iff ~> zero_le_divide_iff
2217 realpow_two_disj ~> power2_eq_iff
2218 real_squared_diff_one_factored ~> square_diff_one_factored
2219 realpow_two_diff ~> square_diff_square_factored
2220 reals_complete2 ~> complete_real
2221 real_sum_squared_expand ~> power2_sum
2222 exp_ln_eq ~> ln_unique
2224 expi_zero ~> exp_zero
2225 lemma_DERIV_subst ~> DERIV_cong
2226 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2227 LIMSEQ_const ~> tendsto_const
2228 LIMSEQ_norm ~> tendsto_norm
2229 LIMSEQ_add ~> tendsto_add
2230 LIMSEQ_minus ~> tendsto_minus
2231 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2232 LIMSEQ_diff ~> tendsto_diff
2233 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2234 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2235 LIMSEQ_mult ~> tendsto_mult
2236 LIMSEQ_inverse ~> tendsto_inverse
2237 LIMSEQ_divide ~> tendsto_divide
2238 LIMSEQ_pow ~> tendsto_power
2239 LIMSEQ_setsum ~> tendsto_setsum
2240 LIMSEQ_setprod ~> tendsto_setprod
2241 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2242 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2243 LIMSEQ_imp_rabs ~> tendsto_rabs
2244 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2245 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2246 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2247 LIMSEQ_Complex ~> tendsto_Complex
2248 LIM_ident ~> tendsto_ident_at
2249 LIM_const ~> tendsto_const
2250 LIM_add ~> tendsto_add
2251 LIM_add_zero ~> tendsto_add_zero
2252 LIM_minus ~> tendsto_minus
2253 LIM_diff ~> tendsto_diff
2254 LIM_norm ~> tendsto_norm
2255 LIM_norm_zero ~> tendsto_norm_zero
2256 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2257 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2258 LIM_rabs ~> tendsto_rabs
2259 LIM_rabs_zero ~> tendsto_rabs_zero
2260 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2261 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2262 LIM_compose ~> tendsto_compose
2263 LIM_mult ~> tendsto_mult
2264 LIM_scaleR ~> tendsto_scaleR
2265 LIM_of_real ~> tendsto_of_real
2266 LIM_power ~> tendsto_power
2267 LIM_inverse ~> tendsto_inverse
2268 LIM_sgn ~> tendsto_sgn
2269 isCont_LIM_compose ~> isCont_tendsto_compose
2270 bounded_linear.LIM ~> bounded_linear.tendsto
2271 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2272 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2273 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2274 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2275 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2276 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2278 * Theory Complex_Main: The definition of infinite series was
2279 generalized. Now it is defined on the type class {topological_space,
2280 comm_monoid_add}. Hence it is useable also for extended real numbers.
2282 * Theory Complex_Main: The complex exponential function "expi" is now
2283 a type-constrained abbreviation for "exp :: complex => complex"; thus
2284 several polymorphic lemmas about "exp" are now applicable to "expi".
2288 - Theory Library/Code_Char_ord provides native ordering of
2289 characters in the target language.
2291 - Commands code_module and code_library are legacy, use export_code
2294 - Method "evaluation" is legacy, use method "eval" instead.
2296 - Legacy evaluator "SML" is deactivated by default. May be
2297 reactivated by the following theory command:
2299 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2301 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2303 * New proof method "induction" that gives induction hypotheses the
2304 name "IH", thus distinguishing them from further hypotheses that come
2305 from rule induction. The latter are still called "hyps". Method
2306 "induction" is a thin wrapper around "induct" and follows the same
2309 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2310 still available as a legacy feature for some time.
2313 - Added "need" and "total_consts" options.
2314 - Reintroduced "show_skolems" option by popular demand.
2315 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2319 - Use quasi-sound (and efficient) translations by default.
2320 - Added support for the following provers: E-ToFoF, LEO-II,
2321 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2322 - Automatically preplay and minimize proofs before showing them if
2323 this can be done within reasonable time.
2324 - sledgehammer available_provers ~> sledgehammer supported_provers.
2326 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2327 "max_mono_iters", and "max_new_mono_instances" options.
2328 - Removed "explicit_apply" and "full_types" options as well as "Full
2329 Types" Proof General menu item. INCOMPATIBILITY.
2332 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2333 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2337 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2338 "elim:" options. INCOMPATIBILITY.
2339 - Introduced 'try' that not only runs 'try_methods' but also
2340 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2343 - Added "eval" option to evaluate terms for the found counterexample
2344 (currently only supported by the default (exhaustive) tester).
2345 - Added post-processing of terms to obtain readable counterexamples
2346 (currently only supported by the default (exhaustive) tester).
2347 - New counterexample generator quickcheck[narrowing] enables
2348 narrowing-based testing. Requires the Glasgow Haskell compiler
2349 with its installation location defined in the Isabelle settings
2350 environment as ISABELLE_GHC.
2351 - Removed quickcheck tester "SML" based on the SML code generator
2352 (formly in HOL/Library).
2354 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2355 use 'partial_function' instead.
2357 * Theory Library/Extended_Reals replaces now the positive extended
2358 reals found in probability theory. This file is extended by
2359 Multivariate_Analysis/Extended_Real_Limits.
2361 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2362 from where it must be imported explicitly if it is really required.
2365 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2366 been moved here. INCOMPATIBILITY.
2368 * Theory Library/Saturated provides type of numbers with saturated
2371 * Theory Library/Product_Lattice defines a pointwise ordering for the
2372 product type 'a * 'b, and provides instance proofs for various order
2373 and lattice type classes.
2375 * Theory Library/Countable now provides the "countable_datatype" proof
2376 method for proving "countable" class instances for datatypes.
2378 * Theory Library/Cset_Monad allows do notation for computable sets
2379 (cset) via the generic monad ad-hoc overloading facility.
2381 * Library: Theories of common data structures are split into theories
2382 for implementation, an invariant-ensuring type, and connection to an
2383 abstract type. INCOMPATIBILITY.
2385 - RBT is split into RBT and RBT_Mapping.
2386 - AssocList is split and renamed into AList and AList_Mapping.
2387 - DList is split into DList_Impl, DList, and DList_Cset.
2388 - Cset is split into Cset and List_Cset.
2390 * Theory Library/Nat_Infinity has been renamed to
2391 Library/Extended_Nat, with name changes of the following types and
2394 type inat ~> type enat
2396 Infty ~> infinity (overloaded)
2400 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2401 been renamed accordingly. INCOMPATIBILITY.
2403 * Session Multivariate_Analysis: The euclidean_space type class now
2404 fixes a constant "Basis :: 'a set" consisting of the standard
2405 orthonormal basis for the type. Users now have the option of
2406 quantifying over this set instead of using the "basis" function, e.g.
2407 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2409 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2410 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2411 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2412 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2413 changed to match. Definition theorems for overloaded constants now use
2414 the standard "foo_vec_def" naming scheme. A few other theorems have
2415 been renamed as follows (INCOMPATIBILITY):
2417 Cart_eq ~> vec_eq_iff
2418 dist_nth_le_cart ~> dist_vec_nth_le
2419 tendsto_vector ~> vec_tendstoI
2420 Cauchy_vector ~> vec_CauchyI
2422 * Session Multivariate_Analysis: Several duplicate theorems have been
2423 removed, and other theorems have been renamed or replaced with more
2424 general versions. INCOMPATIBILITY.
2426 finite_choice ~> finite_set_choice
2427 eventually_conjI ~> eventually_conj
2428 eventually_and ~> eventually_conj_iff
2429 eventually_false ~> eventually_False
2430 setsum_norm ~> norm_setsum
2431 Lim_sequentially ~> LIMSEQ_def
2432 Lim_ident_at ~> LIM_ident
2433 Lim_const ~> tendsto_const
2434 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2435 Lim_neg ~> tendsto_minus
2436 Lim_add ~> tendsto_add
2437 Lim_sub ~> tendsto_diff
2438 Lim_mul ~> tendsto_scaleR
2439 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2440 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2441 Lim_linear ~> bounded_linear.tendsto
2442 Lim_component ~> tendsto_euclidean_component
2443 Lim_component_cart ~> tendsto_vec_nth
2444 Lim_inner ~> tendsto_inner [OF tendsto_const]
2445 dot_lsum ~> inner_setsum_left
2446 dot_rsum ~> inner_setsum_right
2447 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2448 continuous_neg ~> continuous_minus
2449 continuous_sub ~> continuous_diff
2450 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2451 continuous_mul ~> continuous_scaleR
2452 continuous_inv ~> continuous_inverse
2453 continuous_at_within_inv ~> continuous_at_within_inverse
2454 continuous_at_inv ~> continuous_at_inverse
2455 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2456 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2457 continuous_at_component ~> continuous_component [OF continuous_at_id]
2458 continuous_on_neg ~> continuous_on_minus
2459 continuous_on_sub ~> continuous_on_diff
2460 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2461 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2462 continuous_on_mul ~> continuous_on_scaleR
2463 continuous_on_mul_real ~> continuous_on_mult
2464 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2465 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2466 continuous_on_inverse ~> continuous_on_inv
2467 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2468 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2469 subset_interior ~> interior_mono
2470 subset_closure ~> closure_mono
2471 closure_univ ~> closure_UNIV
2472 real_arch_lt ~> reals_Archimedean2
2473 real_arch ~> reals_Archimedean3
2474 real_abs_norm ~> abs_norm_cancel
2475 real_abs_sub_norm ~> norm_triangle_ineq3
2476 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2478 * Session HOL-Probability:
2479 - Caratheodory's extension lemma is now proved for ring_of_sets.
2480 - Infinite products of probability measures are now available.
2481 - Sigma closure is independent, if the generator is independent
2482 - Use extended reals instead of positive extended
2483 reals. INCOMPATIBILITY.
2485 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2487 expand_fun_below ~> fun_below_iff
2488 below_fun_ext ~> fun_belowI
2489 expand_cfun_eq ~> cfun_eq_iff
2490 ext_cfun ~> cfun_eqI
2491 expand_cfun_below ~> cfun_below_iff
2492 below_cfun_ext ~> cfun_belowI
2493 monofun_fun_fun ~> fun_belowD
2494 monofun_fun_arg ~> monofunE
2495 monofun_lub_fun ~> adm_monofun [THEN admD]
2496 cont_lub_fun ~> adm_cont [THEN admD]
2497 cont2cont_Rep_CFun ~> cont2cont_APP
2498 cont_Rep_CFun_app ~> cont_APP_app
2499 cont_Rep_CFun_app_app ~> cont_APP_app_app
2500 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2501 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2502 contlub_cfun ~> lub_APP [symmetric]
2503 contlub_LAM ~> lub_LAM [symmetric]
2506 lift_distinct1 ~> lift.distinct(1)
2507 lift_distinct2 ~> lift.distinct(2)
2508 Def_not_UU ~> lift.distinct(2)
2509 Def_inject ~> lift.inject
2510 below_UU_iff ~> below_bottom_iff
2511 eq_UU_iff ~> eq_bottom_iff
2514 *** Document preparation ***
2516 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2517 isar-ref manual, both for description and actual application of the
2520 * Antiquotation @{value} evaluates the given term and presents its
2523 * Antiquotations: term style "isub" provides ad-hoc conversion of
2524 variables x1, y23 into subscripted form x\<^isub>1,
2525 y\<^isub>2\<^isub>3.
2527 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2528 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2530 * Localized \isabellestyle switch can be used within blocks or groups
2533 \isabellestyle{it} %preferred default
2534 {\isabellestylett @{text "typewriter stuff"}}
2536 * Discontinued special treatment of hard tabulators. Implicit
2537 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2543 * The inner syntax of sort/type/term/prop supports inlined YXML
2544 representations within quoted string tokens. By encoding logical
2545 entities via Term_XML (in ML or Scala) concrete syntax can be
2546 bypassed, which is particularly useful for producing bits of text
2547 under external program control.
2549 * Antiquotations for ML and document preparation are managed as theory
2550 data, which requires explicit setup.
2552 * Isabelle_Process.is_active allows tools to check if the official
2553 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2554 (better known as Proof General).
2556 * Structure Proof_Context follows standard naming scheme. Old
2557 ProofContext is still available for some time as legacy alias.
2559 * Structure Timing provides various operations for timing; supersedes
2560 former start_timing/end_timing etc.
2562 * Path.print is the official way to show file-system paths to users
2563 (including quotes etc.).
2565 * Inner syntax: identifiers in parse trees of generic categories
2566 "logic", "aprop", "idt" etc. carry position information (disguised as
2567 type constraints). Occasional INCOMPATIBILITY with non-compliant
2568 translations that choke on unexpected type constraints. Positions can
2569 be stripped in ML translations via Syntax.strip_positions /
2570 Syntax.strip_positions_ast, or via the syntax constant
2571 "_strip_positions" within parse trees. As last resort, positions can
2572 be disabled via the configuration option Syntax.positions, which is
2573 called "syntax_positions" in Isar attribute syntax.
2575 * Discontinued special status of various ML structures that contribute
2576 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2577 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2578 refer directly to Ast.Constant, Lexicon.is_identifier,
2579 Syntax_Trans.mk_binder_tr etc.
2581 * Typed print translation: discontinued show_sorts argument, which is
2582 already available via context of "advanced" translation.
2584 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2585 goal states; body tactic needs to address all subgoals uniformly.
2587 * Slightly more special eq_list/eq_set, with shortcut involving
2588 pointer equality (assumes that eq relation is reflexive).
2590 * Classical tactics use proper Proof.context instead of historic types
2591 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2592 operate directly on Proof.context. Raw type claset retains its use as
2593 snapshot of the classical context, which can be recovered via
2594 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2595 INCOMPATIBILITY, classical tactics and derived proof methods require
2596 proper Proof.context.
2601 * Discontinued support for Poly/ML 5.2, which was the last version
2602 without proper multithreading and TimeLimit implementation.
2604 * Discontinued old lib/scripts/polyml-platform, which has been
2605 obsolete since Isabelle2009-2.
2607 * Various optional external tools are referenced more robustly and
2608 uniformly by explicit Isabelle settings as follows:
2610 ISABELLE_CSDP (formerly CSDP_EXE)
2611 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2612 ISABELLE_OCAML (formerly EXEC_OCAML)
2613 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2614 ISABELLE_YAP (formerly EXEC_YAP)
2616 Note that automated detection from the file-system or search path has
2617 been discontinued. INCOMPATIBILITY.
2619 * Scala layer provides JVM method invocation service for static
2620 methods of type (String)String, see Invoke_Scala.method in ML. For
2623 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2625 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2626 this allows to pass structured values between ML and Scala.
2628 * The IsabelleText fonts includes some further glyphs to support the
2629 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2630 installed a local copy (which is normally *not* required) need to
2631 delete or update it from ~~/lib/fonts/.
2635 New in Isabelle2011 (January 2011)
2636 ----------------------------------
2640 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2641 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2642 useful tooltips and hyperlinks produced from its static analysis. The
2643 bundled component provides an executable Isabelle tool that can be run
2646 Isabelle2011/bin/isabelle jedit
2648 * Significantly improved Isabelle/Isar implementation manual.
2650 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2651 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2652 while the default heap location within that directory lacks that extra
2653 suffix. This isolates multiple Isabelle installations from each
2654 other, avoiding problems with old settings in new versions.
2655 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2657 * Source files are always encoded as UTF-8, instead of old-fashioned
2658 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2659 the following package declarations:
2661 \usepackage[utf8]{inputenc}
2662 \usepackage{textcomp}
2664 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2665 a Unicode character is treated as a single symbol, not a sequence of
2666 non-ASCII bytes as before. Since Isabelle/ML string literals may
2667 contain symbols without further backslash escapes, Unicode can now be
2668 used here as well. Recall that Symbol.explode in ML provides a
2669 consistent view on symbols, while raw explode (or String.explode)
2670 merely give a byte-oriented representation.
2672 * Theory loader: source files are primarily located via the master
2673 directory of each theory node (where the .thy file itself resides).
2674 The global load path is still partially available as legacy feature.
2675 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2676 explicit paths, relatively to the theory.
2678 * Special treatment of ML file names has been discontinued.
2679 Historically, optional extensions .ML or .sml were added on demand --
2680 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2681 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2683 * Various options that affect pretty printing etc. are now properly
2684 handled within the context via configuration options, instead of
2685 unsynchronized references or print modes. There are both ML Config.T
2686 entities and Isar declaration attributes to access these.
2688 ML (Config.T) Isar (attribute)
2690 eta_contract eta_contract
2691 show_brackets show_brackets
2692 show_sorts show_sorts
2693 show_types show_types
2694 show_question_marks show_question_marks
2695 show_consts show_consts
2696 show_abbrevs show_abbrevs
2698 Syntax.ast_trace syntax_ast_trace
2699 Syntax.ast_stat syntax_ast_stat
2700 Syntax.ambiguity_level syntax_ambiguity_level
2702 Goal_Display.goals_limit goals_limit
2703 Goal_Display.show_main_goal show_main_goal
2705 Method.rule_trace rule_trace
2707 Thy_Output.display thy_output_display
2708 Thy_Output.quotes thy_output_quotes
2709 Thy_Output.indent thy_output_indent
2710 Thy_Output.source thy_output_source
2711 Thy_Output.break thy_output_break
2713 Note that corresponding "..._default" references in ML may only be
2714 changed globally at the ROOT session setup, but *not* within a theory.
2715 The option "show_abbrevs" supersedes the former print mode
2716 "no_abbrevs" with inverted meaning.
2718 * More systematic naming of some configuration options.
2721 trace_simp ~> simp_trace
2722 debug_simp ~> simp_debug
2724 * Support for real valued configuration options, using simplistic
2725 floating-point notation that coincides with the inner syntax for
2728 * Support for real valued preferences (with approximative PGIP type):
2729 front-ends need to accept "pgint" values in float notation.
2732 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2735 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2740 * Command 'type_synonym' (with single argument) replaces somewhat
2741 outdated 'types', which is still available as legacy feature for some
2744 * Command 'nonterminal' (with 'and' separated list of arguments)
2745 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2747 * Command 'notepad' replaces former 'example_proof' for
2748 experimentation in Isar without any result. INCOMPATIBILITY.
2750 * Locale interpretation commands 'interpret' and 'sublocale' accept
2751 lists of equations to map definitions in a locale to appropriate
2752 entities in the context of the interpretation. The 'interpretation'
2753 command already provided this functionality.
2755 * Diagnostic command 'print_dependencies' prints the locale instances
2756 that would be activated if the specified expression was interpreted in
2757 the current context. Variant "print_dependencies!" assumes a context
2758 without interpretations.
2760 * Diagnostic command 'print_interps' prints interpretations in proofs
2761 in addition to interpretations in theories.
2763 * Discontinued obsolete 'global' and 'local' commands to manipulate
2764 the theory name space. Rare INCOMPATIBILITY. The ML functions
2765 Sign.root_path and Sign.local_path may be applied directly where this
2766 feature is still required for historical reasons.
2768 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2769 'definition' instead.
2771 * The "prems" fact, which refers to the accidental collection of
2772 foundational premises in the context, is now explicitly marked as
2773 legacy feature and will be discontinued soon. Consider using "assms"
2774 of the head statement or reference facts by explicit names.
2776 * Document antiquotations @{class} and @{type} print classes and type
2779 * Document antiquotation @{file} checks file/directory entries within
2780 the local file system.
2785 * Coercive subtyping: functions can be declared as coercions and type
2786 inference will add them as necessary upon input of a term. Theory
2787 Complex_Main declares real :: nat => real and real :: int => real as
2788 coercions. A coercion function f is declared like this:
2790 declare [[coercion f]]
2792 To lift coercions through type constructors (e.g. from nat => real to
2793 nat list => real list), map functions can be declared, e.g.
2795 declare [[coercion_map map]]
2797 Currently coercion inference is activated only in theories including
2798 real numbers, i.e. descendants of Complex_Main. This is controlled by
2799 the configuration option "coercion_enabled", e.g. it can be enabled in
2800 other theories like this:
2802 declare [[coercion_enabled]]
2804 * Command 'partial_function' provides basic support for recursive
2805 function definitions over complete partial orders. Concrete instances
2806 are provided for i) the option type, ii) tail recursion on arbitrary
2807 types, and iii) the heap monad of Imperative_HOL. See
2808 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2811 * Function package: f.psimps rules are no longer implicitly declared
2812 as [simp]. INCOMPATIBILITY.
2814 * Datatype package: theorems generated for executable equality (class
2815 "eq") carry proper names and are treated as default code equations.
2817 * Inductive package: now offers command 'inductive_simps' to
2818 automatically derive instantiated and simplified equations for
2819 inductive predicates, similar to 'inductive_cases'.
2821 * Command 'enriched_type' allows to register properties of the
2822 functorial structure of types.
2824 * Improved infrastructure for term evaluation using code generator
2825 techniques, in particular static evaluation conversions.
2827 * Code generator: Scala (2.8 or higher) has been added to the target
2830 * Code generator: globbing constant expressions "*" and "Theory.*"
2831 have been replaced by the more idiomatic "_" and "Theory._".
2834 * Code generator: export_code without explicit file declaration prints
2835 to standard output. INCOMPATIBILITY.
2837 * Code generator: do not print function definitions for case
2838 combinators any longer.
2840 * Code generator: simplification with rules determined with
2841 src/Tools/Code/code_simp.ML and method "code_simp".
2843 * Code generator for records: more idiomatic representation of record
2844 types. Warning: records are not covered by ancient SML code
2845 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2846 rep_datatype declaration helps to succeed then:
2850 rep_datatype foo_ext ...
2852 * Records: logical foundation type for records does not carry a
2853 '_type' suffix any longer (obsolete due to authentic syntax).
2856 * Quickcheck now by default uses exhaustive testing instead of random
2857 testing. Random testing can be invoked by "quickcheck [random]",
2858 exhaustive testing by "quickcheck [exhaustive]".
2860 * Quickcheck instantiates polymorphic types with small finite
2861 datatypes by default. This enables a simple execution mechanism to
2862 handle quantifiers and function equality over the finite datatypes.
2864 * Quickcheck random generator has been renamed from "code" to
2865 "random". INCOMPATIBILITY.
2867 * Quickcheck now has a configurable time limit which is set to 30
2868 seconds by default. This can be changed by adding [timeout = n] to the
2869 quickcheck command. The time limit for Auto Quickcheck is still set
2872 * Quickcheck in locales considers interpretations of that locale for
2873 counter example search.
2876 - Added "smt" and "remote_smt" provers based on the "smt" proof
2877 method. See the Sledgehammer manual for details ("isabelle doc
2880 sledgehammer atp_info ~> sledgehammer running_provers
2881 sledgehammer atp_kill ~> sledgehammer kill_provers
2882 sledgehammer available_atps ~> sledgehammer available_provers
2885 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2886 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2887 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2888 (and "ms" and "min" are no longer supported)
2893 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2894 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2896 - Added support for partial quotient types.
2897 - Added local versions of the "Nitpick.register_xxx" functions.
2898 - Added "whack" option.
2899 - Allow registration of quotient types as codatatypes.
2900 - Improved "merge_type_vars" option to merge more types.
2901 - Removed unsound "fast_descrs" option.
2902 - Added custom symmetry breaking for datatypes, making it possible to reach
2903 higher cardinalities.
2904 - Prevent the expansion of too large definitions.
2906 * Proof methods "metis" and "meson" now have configuration options
2907 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2908 to diagnose these tools. E.g.
2910 using [[metis_trace = true]]
2912 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2913 manually as command 'solve_direct'.
2915 * The default SMT solver Z3 must be enabled explicitly (due to
2916 licensing issues) by setting the environment variable
2917 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2918 commercial applications, the SMT solver CVC3 is provided as fall-back;
2919 changing the SMT solver is done via the configuration option
2922 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2923 i.e. "remote_cvc3" and "remote_z3".
2925 * Added basic SMT support for datatypes, records, and typedefs using
2926 the oracle mode (no proofs). Direct support of pairs has been dropped
2927 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2928 support for a similar behavior). Minor INCOMPATIBILITY.
2930 * Changed SMT configuration options:
2932 z3_proofs ~> smt_oracle (with inverted meaning)
2933 z3_trace_assms ~> smt_trace_used_facts
2946 * Boogie output files (.b2i files) need to be declared in the theory
2949 * Simplification procedure "list_to_set_comprehension" rewrites list
2950 comprehensions applied to List.set to set comprehensions. Occasional
2951 INCOMPATIBILITY, may be deactivated like this:
2953 declare [[simproc del: list_to_set_comprehension]]
2955 * Removed old version of primrec package. INCOMPATIBILITY.
2957 * Removed simplifier congruence rule of "prod_case", as has for long
2958 been the case with "split". INCOMPATIBILITY.
2960 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2962 * Removed [split_format ... and ... and ...] version of
2963 [split_format]. Potential INCOMPATIBILITY.
2965 * Predicate "sorted" now defined inductively, with nice induction
2966 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2968 * Constant "contents" renamed to "the_elem", to free the generic name
2969 contents for other uses. INCOMPATIBILITY.
2971 * Renamed class eq and constant eq (for code generation) to class
2972 equal and constant equal, plus renaming of related facts and various
2973 tuning. INCOMPATIBILITY.
2975 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2977 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2980 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2981 avoid confusion with finite sets. INCOMPATIBILITY.
2983 * Abandoned locales equiv, congruent and congruent2 for equivalence
2984 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2987 * Some previously unqualified names have been qualified:
2994 Trueprop ~> HOL.Trueprop
2999 op --> ~> HOL.implies
3011 Pair ~> Product_Type.Pair
3012 fst ~> Product_Type.fst
3013 snd ~> Product_Type.snd
3014 curry ~> Product_Type.curry
3016 Collect ~> Set.Collect
3020 * More canonical naming convention for some fundamental definitions:
3022 bot_bool_eq ~> bot_bool_def
3023 top_bool_eq ~> top_bool_def
3024 inf_bool_eq ~> inf_bool_def
3025 sup_bool_eq ~> sup_bool_def
3026 bot_fun_eq ~> bot_fun_def
3027 top_fun_eq ~> top_fun_def
3028 inf_fun_eq ~> inf_fun_def
3029 sup_fun_eq ~> sup_fun_def
3033 * More stylized fact names:
3035 expand_fun_eq ~> fun_eq_iff
3036 expand_set_eq ~> set_eq_iff
3038 nat_number ~> eval_nat_numeral
3042 * Refactoring of code-generation specific operations in theory List:
3048 mem_iff ~> member_def
3049 null_empty ~> null_def
3051 INCOMPATIBILITY. Note that these were not supposed to be used
3052 regularly unless for striking reasons; their main purpose was code
3055 Various operations from the Haskell prelude are used for generating
3058 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3059 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3060 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3062 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3063 "*" and "+" respectively. INCOMPATIBILITY.
3065 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3066 "Sum_Type.Plus" instead.
3068 * Constant "split" has been merged with constant "prod_case"; names of
3069 ML functions, facts etc. involving split have been retained so far,
3070 though. INCOMPATIBILITY.
3072 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3073 instead. INCOMPATIBILITY.
3075 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3078 * Former theory Library/Enum is now part of the HOL-Main image.
3079 INCOMPATIBILITY: all constants of the Enum theory now have to be
3080 referred to by its qualified name.
3083 nlists ~> Enum.nlists
3084 product ~> Enum.product
3086 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3087 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3090 * Theory Library/SetsAndFunctions has been split into
3091 Library/Function_Algebras and Library/Set_Algebras; canonical names
3092 for instance definitions for functions; various improvements.
3095 * Theory Library/Multiset provides stable quicksort implementation of
3098 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3101 * Session Multivariate_Analysis: introduced a type class for euclidean
3102 space. Most theorems are now stated in terms of euclidean spaces
3103 instead of finite cartesian products.
3106 real ^ 'n ~> 'a::real_vector
3107 ~> 'a::euclidean_space
3108 ~> 'a::ordered_euclidean_space
3109 (depends on your needs)
3113 \<chi> x. _ ~> \<chi>\<chi> x. _
3116 Also note that the indices are now natural numbers and not from some
3117 finite type. Finite cartesian products of euclidean spaces, products
3118 of euclidean spaces the real and complex numbers are instantiated to
3119 be euclidean_spaces. INCOMPATIBILITY.
3121 * Session Probability: introduced pextreal as positive extended real
3122 numbers. Use pextreal as value for measures. Introduce the
3123 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3124 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3125 the integral in Multivariate Analysis. INCOMPATIBILITY.
3127 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3130 * Session SPARK (with image HOL-SPARK) provides commands to load and
3131 prove verification conditions generated by the SPARK Ada program
3132 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3137 * Theorems for additive ring operations (locale abelian_monoid and
3138 descendants) are generated by interpretation from their multiplicative
3139 counterparts. Names (in particular theorem names) have the mandatory
3140 qualifier 'add'. Previous theorem names are redeclared for
3143 * Structure "int_ring" is now an abbreviation (previously a
3144 definition). This fits more natural with advanced interpretations.
3149 * The domain package now runs in definitional mode by default: The
3150 former command 'new_domain' is now called 'domain'. To use the domain
3151 package in its original axiomatic mode, use 'domain (unsafe)'.
3154 * The new class "domain" is now the default sort. Class "predomain"
3155 is an unpointed version of "domain". Theories can be updated by
3156 replacing sort annotations as shown below. INCOMPATIBILITY.
3158 'a::type ~> 'a::countable
3159 'a::cpo ~> 'a::predomain
3160 'a::pcpo ~> 'a::domain
3162 * The old type class "rep" has been superseded by class "domain".
3163 Accordingly, users of the definitional package must remove any
3164 "default_sort rep" declarations. INCOMPATIBILITY.
3166 * The domain package (definitional mode) now supports unpointed
3167 predomain argument types, as long as they are marked 'lazy'. (Strict
3168 arguments must be in class "domain".) For example, the following
3169 domain definition now works:
3171 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3173 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3174 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3175 'a option, and 'a list. Additionally, it configures fixrec and the
3176 domain package to work with these types. For example:
3178 fixrec isInl :: "('a + 'b) u -> tr"
3179 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3181 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3183 * The "(permissive)" option of fixrec has been replaced with a
3184 per-equation "(unchecked)" option. See
3185 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3187 * The "bifinite" class no longer fixes a constant "approx"; the class
3188 now just asserts that such a function exists. INCOMPATIBILITY.
3190 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3191 defines an embedding of type 'a defl into udom by default; instances
3192 of "bifinite" and "domain" classes are available in
3193 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3195 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3197 * The predicate "directed" has been removed. INCOMPATIBILITY.
3199 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3201 * The function "cprod_map" has been renamed to "prod_map".
3204 * The monadic bind operator on each powerdomain has new binder syntax
3205 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3206 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3208 * The infix syntax for binary union on each powerdomain has changed
3209 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3210 syntax. INCOMPATIBILITY.
3212 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3213 still supported as an input translation.
3215 * Renamed some theorems (the original names are also still available).
3217 expand_fun_below ~> fun_below_iff
3218 below_fun_ext ~> fun_belowI
3219 expand_cfun_eq ~> cfun_eq_iff
3220 ext_cfun ~> cfun_eqI
3221 expand_cfun_below ~> cfun_below_iff
3222 below_cfun_ext ~> cfun_belowI
3223 cont2cont_Rep_CFun ~> cont2cont_APP
3225 * The Abs and Rep functions for various types have changed names.
3226 Related theorem names have also changed to match. INCOMPATIBILITY.
3228 Rep_CFun ~> Rep_cfun
3229 Abs_CFun ~> Abs_cfun
3230 Rep_Sprod ~> Rep_sprod
3231 Abs_Sprod ~> Abs_sprod
3232 Rep_Ssum ~> Rep_ssum
3233 Abs_Ssum ~> Abs_ssum
3235 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3236 been renamed to *_bottom_iff. INCOMPATIBILITY.
3238 * Various changes to bisimulation/coinduction with domain package:
3240 - Definitions of "bisim" constants no longer mention definedness.
3241 - With mutual recursion, "bisim" predicate is now curried.
3242 - With mutual recursion, each type gets a separate coind theorem.
3243 - Variable names in bisim_def and coinduct rules have changed.
3247 * Case combinators generated by the domain package for type "foo" are
3248 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3250 * Several theorems have been renamed to more accurately reflect the
3251 names of constants and types involved. INCOMPATIBILITY.
3253 thelub_const ~> lub_const
3254 lub_const ~> is_lub_const
3256 is_lub_lub ~> is_lubD2
3258 unique_lub ~> is_lub_unique
3259 is_ub_lub ~> is_lub_rangeD1
3260 lub_bin_chain ~> is_lub_bin_chain
3261 lub_fun ~> is_lub_fun
3262 thelub_fun ~> lub_fun
3263 thelub_cfun ~> lub_cfun
3264 thelub_Pair ~> lub_Pair
3265 lub_cprod ~> is_lub_prod
3266 thelub_cprod ~> lub_prod
3267 minimal_cprod ~> minimal_prod
3268 inst_cprod_pcpo ~> inst_prod_pcpo
3270 compact_UU ~> compact_bottom
3271 deflation_UU ~> deflation_bottom
3272 finite_deflation_UU ~> finite_deflation_bottom
3274 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3276 sq_ord_less_eq_trans ~> below_eq_trans
3277 sq_ord_eq_less_trans ~> eq_below_trans
3278 refl_less ~> below_refl
3279 trans_less ~> below_trans
3280 antisym_less ~> below_antisym
3281 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3282 box_less ~> box_below
3283 rev_trans_less ~> rev_below_trans
3284 not_less2not_eq ~> not_below2not_eq
3285 less_UU_iff ~> below_UU_iff
3286 flat_less_iff ~> flat_below_iff
3287 adm_less ~> adm_below
3288 adm_not_less ~> adm_not_below
3289 adm_compact_not_less ~> adm_compact_not_below
3290 less_fun_def ~> below_fun_def
3291 expand_fun_less ~> fun_below_iff
3292 less_fun_ext ~> fun_belowI
3293 less_discr_def ~> below_discr_def
3294 discr_less_eq ~> discr_below_eq
3295 less_unit_def ~> below_unit_def
3296 less_cprod_def ~> below_prod_def
3297 prod_lessI ~> prod_belowI
3298 Pair_less_iff ~> Pair_below_iff
3299 fst_less_iff ~> fst_below_iff
3300 snd_less_iff ~> snd_below_iff
3301 expand_cfun_less ~> cfun_below_iff
3302 less_cfun_ext ~> cfun_belowI
3303 injection_less ~> injection_below
3304 less_up_def ~> below_up_def
3305 not_Iup_less ~> not_Iup_below
3306 Iup_less ~> Iup_below
3308 Def_inject_less_eq ~> Def_below_Def
3309 Def_less_is_eq ~> Def_below_iff
3310 spair_less_iff ~> spair_below_iff
3311 less_sprod ~> below_sprod
3312 spair_less ~> spair_below
3313 sfst_less_iff ~> sfst_below_iff
3314 ssnd_less_iff ~> ssnd_below_iff
3315 fix_least_less ~> fix_least_below
3316 dist_less_one ~> dist_below_one
3317 less_ONE ~> below_ONE
3318 ONE_less_iff ~> ONE_below_iff
3319 less_sinlD ~> below_sinlD
3320 less_sinrD ~> below_sinrD
3325 * All constant names are now qualified internally and use proper
3326 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3331 * Antiquotation @{assert} inlines a function bool -> unit that raises
3332 Fail if the argument is false. Due to inlining the source position of
3333 failed assertions is included in the error output.
3335 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3336 text is in practice always evaluated with a stable theory checkpoint.
3337 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3339 * Antiquotation @{theory A} refers to theory A from the ancestry of
3340 the current context, not any accidental theory loader state as before.
3341 Potential INCOMPATIBILITY, subtle change in semantics.
3343 * Syntax.pretty_priority (default 0) configures the required priority
3344 of pretty-printed output and thus affects insertion of parentheses.
3346 * Syntax.default_root (default "any") configures the inner syntax
3347 category (nonterminal symbol) for parsing of terms.
3349 * Former exception Library.UnequalLengths now coincides with
3350 ListPair.UnequalLengths.
3352 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3353 main functionality is provided by structure Simplifier.
3355 * Renamed raw "explode" function to "raw_explode" to emphasize its
3356 meaning. Note that internally to Isabelle, Symbol.explode is used in
3357 almost all situations.
3359 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3360 See implementation manual for further details on exceptions in
3363 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3366 * Renamed structure PureThy to Pure_Thy and moved most of its
3367 operations to structure Global_Theory, to emphasize that this is
3368 rarely-used global-only stuff.
3370 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3371 instead (or tracing for high-volume output).
3373 * Configuration option show_question_marks only affects regular pretty
3374 printing of types and terms, not raw Term.string_of_vname.
3376 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3377 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3378 @{thms} for most purposes.
3380 * ML structure Unsynchronized is never opened, not even in Isar
3381 interaction mode as before. Old Unsynchronized.set etc. have been
3382 discontinued -- use plain := instead. This should be *rare* anyway,
3383 since modern tools always work via official context data, notably
3384 configuration options.
3386 * Parallel and asynchronous execution requires special care concerning
3387 interrupts. Structure Exn provides some convenience functions that
3388 avoid working directly with raw Interrupt. User code must not absorb
3389 interrupts -- intermediate handling (for cleanup etc.) needs to be
3390 followed by re-raising of the original exception. Another common
3391 source of mistakes are "handle _" patterns, which make the meaning of
3392 the program subject to physical effects of the environment.
3396 New in Isabelle2009-2 (June 2010)
3397 ---------------------------------
3401 * Authentic syntax for *all* logical entities (type classes, type
3402 constructors, term constants): provides simple and robust
3403 correspondence between formal entities and concrete syntax. Within
3404 the parse tree / AST representations, "constants" are decorated by
3405 their category (class, type, const) and spelled out explicitly with
3406 their full internal name.
3408 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3409 and translations (translation rules and translation functions in ML).
3410 Some hints on upgrading:
3412 - Many existing uses of 'syntax' and 'translations' can be replaced
3413 by more modern 'type_notation', 'notation' and 'abbreviation',
3414 which are independent of this issue.
3416 - 'translations' require markup within the AST; the term syntax
3417 provides the following special forms:
3419 CONST c -- produces syntax version of constant c from context
3420 XCONST c -- literally c, checked as constant from context
3421 c -- literally c, if declared by 'syntax'
3423 Plain identifiers are treated as AST variables -- occasionally the
3424 system indicates accidental variables via the error "rhs contains
3427 Type classes and type constructors are marked according to their
3428 concrete syntax. Some old translations rules need to be written
3429 for the "type" category, using type constructor application
3430 instead of pseudo-term application of the default category
3433 - 'parse_translation' etc. in ML may use the following
3436 @{class_syntax c} -- type class c within parse tree / AST
3437 @{term_syntax c} -- type constructor c within parse tree / AST
3438 @{const_syntax c} -- ML version of "CONST c" above
3439 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3441 - Literal types within 'typed_print_translations', i.e. those *not*
3442 represented as pseudo-terms are represented verbatim. Use @{class
3443 c} or @{type_name c} here instead of the above syntax
3446 Note that old non-authentic syntax was based on unqualified base
3447 names, so all of the above "constant" names would coincide. Recall
3448 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3449 diagnose syntax problems.
3451 * Type constructors admit general mixfix syntax, not just infix.
3453 * Concrete syntax may be attached to local entities without a proof
3454 body, too. This works via regular mixfix annotations for 'fix',
3455 'def', 'obtain' etc. or via the explicit 'write' command, which is
3456 similar to the 'notation' command in theory specifications.
3458 * Discontinued unnamed infix syntax (legacy feature for many years) --
3459 need to specify constant name and syntax separately. Internal ML
3460 datatype constructors have been renamed from InfixName to Infix etc.
3461 Minor INCOMPATIBILITY.
3463 * Schematic theorem statements need to be explicitly markup as such,
3464 via commands 'schematic_lemma', 'schematic_theorem',
3465 'schematic_corollary'. Thus the relevance of the proof is made
3466 syntactically clear, which impacts performance in a parallel or
3467 asynchronous interactive environment. Minor INCOMPATIBILITY.
3469 * Use of cumulative prems via "!" in some proof methods has been
3470 discontinued (old legacy feature).
3472 * References 'trace_simp' and 'debug_simp' have been replaced by
3473 configuration options stored in the context. Enabling tracing (the
3474 case of debugging is similar) in proofs works via
3476 using [[trace_simp = true]]
3478 Tracing is then active for all invocations of the simplifier in
3479 subsequent goal refinement steps. Tracing may also still be enabled or
3480 disabled via the ProofGeneral settings menu.
3482 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3483 'hide_fact' replace the former 'hide' KIND command. Minor
3486 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3487 more efficient than combinations with -q1 or -q2.
3492 * Proofterms record type-class reasoning explicitly, using the
3493 "unconstrain" operation internally. This eliminates all sort
3494 constraints from a theorem and proof, introducing explicit
3495 OFCLASS-premises. On the proof term level, this operation is
3496 automatically applied at theorem boundaries, such that closed proofs
3497 are always free of sort constraints. INCOMPATIBILITY for tools that
3498 inspect proof terms.
3500 * Local theory specifications may depend on extra type variables that
3501 are not present in the result type -- arguments TYPE('a) :: 'a itself
3502 are added internally. For example:
3504 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3506 * Predicates of locales introduced by classes carry a mandatory
3507 "class" prefix. INCOMPATIBILITY.
3509 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3511 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3514 * Command 'code_reflect' allows to incorporate generated ML code into
3515 runtime environment; replaces immature code_datatype antiquotation.
3518 * Code generator: simple concept for abstract datatypes obeying
3521 * Code generator: details of internal data cache have no impact on the
3522 user space functionality any longer.
3524 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3525 subgoals. This is more appropriate for interpretations with 'where'.
3528 * Command 'example_proof' opens an empty proof body. This allows to
3529 experiment with Isar, without producing any persistent result.
3531 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3532 within a local theory context, with explicit checking of the
3533 constructors involved (in contrast to the raw 'syntax' versions).
3535 * Commands 'types' and 'typedecl' now work within a local theory
3536 context -- without introducing dependencies on parameters or
3537 assumptions, which is not possible in Isabelle/Pure.
3539 * Command 'defaultsort' has been renamed to 'default_sort', it works
3540 within a local theory context. Minor INCOMPATIBILITY.
3545 * Command 'typedef' now works within a local theory context -- without
3546 introducing dependencies on parameters or assumptions, which is not
3547 possible in Isabelle/Pure/HOL. Note that the logical environment may
3548 contain multiple interpretations of local typedefs (with different
3549 non-emptiness proofs), even in a global theory context.
3551 * New package for quotient types. Commands 'quotient_type' and
3552 'quotient_definition' may be used for defining types and constants by
3553 quotient constructions. An example is the type of integers created by
3554 quotienting pairs of natural numbers:
3557 intrel :: "(nat * nat) => (nat * nat) => bool"
3559 "intrel (x, y) (u, v) = (x + v = u + y)"
3561 quotient_type int = "nat * nat" / intrel
3562 by (auto simp add: equivp_def expand_fun_eq)
3565 "0::int" is "(0::nat, 0::nat)"
3567 The method "lifting" can be used to lift of theorems from the
3568 underlying "raw" type to the quotient type. The example
3569 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3570 construction and provides a reasoning infrastructure for finite sets.
3572 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3573 clash with new theory Quotient in Main HOL.
3575 * Moved the SMT binding into the main HOL session, eliminating
3576 separate HOL-SMT session.
3578 * List membership infix mem operation is only an input abbreviation.
3581 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3582 for future developements; former Library/Word.thy is still present in
3583 the AFP entry RSAPPS.
3585 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3586 longer shadowed. INCOMPATIBILITY.
3588 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3591 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3594 * Dropped normalizing_semiring etc; use the facts in semiring classes
3595 instead. INCOMPATIBILITY.
3597 * Dropped several real-specific versions of lemmas about floor and
3598 ceiling; use the generic lemmas from theory "Archimedean_Field"
3599 instead. INCOMPATIBILITY.
3601 floor_number_of_eq ~> floor_number_of
3602 le_floor_eq_number_of ~> number_of_le_floor
3603 le_floor_eq_zero ~> zero_le_floor
3604 le_floor_eq_one ~> one_le_floor
3605 floor_less_eq_number_of ~> floor_less_number_of
3606 floor_less_eq_zero ~> floor_less_zero
3607 floor_less_eq_one ~> floor_less_one
3608 less_floor_eq_number_of ~> number_of_less_floor
3609 less_floor_eq_zero ~> zero_less_floor
3610 less_floor_eq_one ~> one_less_floor
3611 floor_le_eq_number_of ~> floor_le_number_of
3612 floor_le_eq_zero ~> floor_le_zero
3613 floor_le_eq_one ~> floor_le_one
3614 floor_subtract_number_of ~> floor_diff_number_of
3615 floor_subtract_one ~> floor_diff_one
3616 ceiling_number_of_eq ~> ceiling_number_of
3617 ceiling_le_eq_number_of ~> ceiling_le_number_of
3618 ceiling_le_zero_eq ~> ceiling_le_zero
3619 ceiling_le_eq_one ~> ceiling_le_one
3620 less_ceiling_eq_number_of ~> number_of_less_ceiling
3621 less_ceiling_eq_zero ~> zero_less_ceiling
3622 less_ceiling_eq_one ~> one_less_ceiling
3623 ceiling_less_eq_number_of ~> ceiling_less_number_of
3624 ceiling_less_eq_zero ~> ceiling_less_zero
3625 ceiling_less_eq_one ~> ceiling_less_one
3626 le_ceiling_eq_number_of ~> number_of_le_ceiling
3627 le_ceiling_eq_zero ~> zero_le_ceiling
3628 le_ceiling_eq_one ~> one_le_ceiling
3629 ceiling_subtract_number_of ~> ceiling_diff_number_of
3630 ceiling_subtract_one ~> ceiling_diff_one
3632 * Theory "Finite_Set": various folding_XXX locales facilitate the
3633 application of the various fold combinators on finite sets.
3635 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3636 provides abstract red-black tree type which is backed by "RBT_Impl" as
3637 implementation. INCOMPATIBILTY.
3639 * Theory Library/Coinductive_List has been removed -- superseded by
3640 AFP/thys/Coinductive.
3642 * Theory PReal, including the type "preal" and related operations, has
3643 been removed. INCOMPATIBILITY.
3645 * Real: new development using Cauchy Sequences.
3647 * Split off theory "Big_Operators" containing setsum, setprod,
3648 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3650 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3651 "Int" etc. INCOMPATIBILITY.
3653 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3655 * New set of rules "ac_simps" provides combined assoc / commute
3656 rewrites for all interpretations of the appropriate generic locales.
3658 * Renamed theory "OrderedGroup" to "Groups" and split theory
3659 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3660 appropriate and more consistent names suitable for name prefixes
3661 within the HOL theories. INCOMPATIBILITY.
3663 * Some generic constants have been put to appropriate theories:
3664 - less_eq, less: Orderings
3665 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3666 - inverse, divide: Rings
3669 * More consistent naming of type classes involving orderings (and
3672 lower_semilattice ~> semilattice_inf
3673 upper_semilattice ~> semilattice_sup
3675 dense_linear_order ~> dense_linorder
3677 pordered_ab_group_add ~> ordered_ab_group_add
3678 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3679 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3680 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3681 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3682 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3683 pordered_cancel_semiring ~> ordered_cancel_semiring
3684 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3685 pordered_comm_ring ~> ordered_comm_ring
3686 pordered_comm_semiring ~> ordered_comm_semiring
3687 pordered_ring ~> ordered_ring
3688 pordered_ring_abs ~> ordered_ring_abs
3689 pordered_semiring ~> ordered_semiring
3691 ordered_ab_group_add ~> linordered_ab_group_add
3692 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3693 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3694 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3695 ordered_field ~> linordered_field
3696 ordered_field_no_lb ~> linordered_field_no_lb
3697 ordered_field_no_ub ~> linordered_field_no_ub
3698 ordered_field_dense_linear_order ~> dense_linordered_field
3699 ordered_idom ~> linordered_idom
3700 ordered_ring ~> linordered_ring
3701 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3702 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3703 ordered_ring_strict ~> linordered_ring_strict
3704 ordered_semidom ~> linordered_semidom
3705 ordered_semiring ~> linordered_semiring
3706 ordered_semiring_1 ~> linordered_semiring_1
3707 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3708 ordered_semiring_strict ~> linordered_semiring_strict
3710 The following slightly odd type classes have been moved to a
3711 separate theory Library/Lattice_Algebras:
3713 lordered_ab_group_add ~> lattice_ab_group_add
3714 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3715 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3716 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3717 lordered_ring ~> lattice_ring
3721 * Refined field classes:
3722 - classes division_ring_inverse_zero, field_inverse_zero,
3723 linordered_field_inverse_zero include rule inverse 0 = 0 --
3724 subsumes former division_by_zero class;
3725 - numerous lemmas have been ported from field to division_ring.
3728 * Refined algebra theorem collections:
3729 - dropped theorem group group_simps, use algebra_simps instead;
3730 - dropped theorem group ring_simps, use field_simps instead;
3731 - proper theorem collection field_simps subsumes former theorem
3732 groups field_eq_simps and field_simps;
3733 - dropped lemma eq_minus_self_iff which is a duplicate for
3737 * Theory Finite_Set and List: some lemmas have been generalized from
3740 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3741 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3742 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3743 union_Union_fold_union ~> sup_Sup_fold_sup
3744 Inter_fold_inter ~> Inf_fold_inf
3745 Union_fold_union ~> Sup_fold_sup
3746 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3747 union_UNION_fold_union ~> sup_SUPR_fold_sup
3748 INTER_fold_inter ~> INFI_fold_inf
3749 UNION_fold_union ~> SUPR_fold_sup
3751 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3752 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3753 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3754 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3755 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3756 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3758 * Reorganized theory Multiset: swapped notation of pointwise and
3761 - pointwise ordering is instance of class order with standard syntax
3763 - multiset ordering has syntax <=# and <#; partial order properties
3764 are provided by means of interpretation with prefix
3766 - less duplication, less historical organization of sections,
3767 conversion from associations lists to multisets, rudimentary code
3769 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3774 multiset_eq_conv_count_eq ~> multiset_ext_iff
3775 multi_count_ext ~> multiset_ext
3776 diff_union_inverse2 ~> diff_union_cancelR
3780 * Theory Permutation: replaced local "remove" by List.remove1.
3782 * Code generation: ML and OCaml code is decorated with signatures.
3784 * Theory List: added transpose.
3786 * Library/Nat_Bijection.thy is a collection of bijective functions
3787 between nat and other types, which supersedes the older libraries
3788 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3791 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3792 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3793 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3794 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3795 Countable.pair_encode ~> prod_encode
3796 NatIso.prod2nat ~> prod_encode
3797 NatIso.nat2prod ~> prod_decode
3798 NatIso.sum2nat ~> sum_encode
3799 NatIso.nat2sum ~> sum_decode
3800 NatIso.list2nat ~> list_encode
3801 NatIso.nat2list ~> list_decode
3802 NatIso.set2nat ~> set_encode
3803 NatIso.nat2set ~> set_decode
3806 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3807 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3808 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3809 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3810 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3811 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3812 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3813 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3814 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3815 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3816 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3817 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3818 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3821 - Renamed ATP commands:
3822 atp_info ~> sledgehammer running_atps
3823 atp_kill ~> sledgehammer kill_atps
3824 atp_messages ~> sledgehammer messages
3825 atp_minimize ~> sledgehammer minimize
3826 print_atps ~> sledgehammer available_atps
3828 - Added user's manual ("isabelle doc sledgehammer").
3829 - Added option syntax and "sledgehammer_params" to customize
3830 Sledgehammer's behavior. See the manual for details.
3831 - Modified the Isar proof reconstruction code so that it produces
3832 direct proofs rather than proofs by contradiction. (This feature
3833 is still experimental.)
3834 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3836 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3839 - Added and implemented "binary_ints" and "bits" options.
3840 - Added "std" option and implemented support for nonstandard models.
3841 - Added and implemented "finitize" option to improve the precision
3842 of infinite datatypes based on a monotonicity analysis.
3843 - Added support for quotient types.
3844 - Added support for "specification" and "ax_specification"
3846 - Added support for local definitions (for "function" and
3847 "termination" proofs).
3848 - Added support for term postprocessors.
3849 - Optimized "Multiset.multiset" and "FinFun.finfun".
3850 - Improved efficiency of "destroy_constrs" optimization.
3851 - Fixed soundness bugs related to "destroy_constrs" optimization and
3853 - Fixed soundness bug related to higher-order constructors.
3854 - Fixed soundness bug when "full_descrs" is enabled.
3855 - Improved precision of set constructs.
3856 - Added "atoms" option.
3857 - Added cache to speed up repeated Kodkod invocations on the same
3859 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3860 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3861 "SAT4J_Light". INCOMPATIBILITY.
3862 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3863 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3864 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3866 * Method "induct" now takes instantiations of the form t, where t is not
3867 a variable, as a shorthand for "x == t", where x is a fresh variable.
3868 If this is not intended, t has to be enclosed in parentheses.
3869 By default, the equalities generated by definitional instantiations
3870 are pre-simplified, which may cause parameters of inductive cases
3871 to disappear, or may even delete some of the inductive cases.
3872 Use "induct (no_simp)" instead of "induct" to restore the old
3873 behaviour. The (no_simp) option is also understood by the "cases"
3874 and "nominal_induct" methods, which now perform pre-simplification, too.
3880 * Variable names in lemmas generated by the domain package have
3881 changed; the naming scheme is now consistent with the HOL datatype
3882 package. Some proof scripts may be affected, INCOMPATIBILITY.
3884 * The domain package no longer defines the function "foo_copy" for
3885 recursive domain "foo". The reach lemma is now stated directly in
3886 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3887 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3889 * Most definedness lemmas generated by the domain package (previously
3890 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3891 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3892 Proofs that used definedness lemmas as intro rules may break,
3893 potential INCOMPATIBILITY.
3895 * Induction and casedist rules generated by the domain package now
3896 declare proper case_names (one called "bottom", and one named for each
3897 constructor). INCOMPATIBILITY.
3899 * For mutually-recursive domains, separate "reach" and "take_lemma"
3900 rules are generated for each domain, INCOMPATIBILITY.
3902 foo_bar.reach ~> foo.reach bar.reach
3903 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3905 * Some lemmas generated by the domain package have been renamed for
3906 consistency with the datatype package, INCOMPATIBILITY.
3908 foo.ind ~> foo.induct
3909 foo.finite_ind ~> foo.finite_induct
3910 foo.coind ~> foo.coinduct
3911 foo.casedist ~> foo.exhaust
3912 foo.exhaust ~> foo.nchotomy
3914 * For consistency with other definition packages, the fixrec package
3915 now generates qualified theorem names, INCOMPATIBILITY.
3917 foo_simps ~> foo.simps
3918 foo_unfold ~> foo.unfold
3919 foo_induct ~> foo.induct
3921 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3922 method and internal fixrec proofs now use the default simpset instead.
3925 * The "contlub" predicate has been removed. Proof scripts should use
3926 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3928 * The "admw" predicate has been removed, INCOMPATIBILITY.
3930 * The constants cpair, cfst, and csnd have been removed in favor of
3931 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3936 * Antiquotations for basic formal entities:
3938 @{class NAME} -- type class
3939 @{class_syntax NAME} -- syntax representation of the above
3941 @{type_name NAME} -- logical type
3942 @{type_abbrev NAME} -- type abbreviation
3943 @{nonterminal NAME} -- type of concrete syntactic category
3944 @{type_syntax NAME} -- syntax representation of any of the above
3946 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3947 @{const_abbrev NAME} -- abbreviated constant
3948 @{const_syntax NAME} -- syntax representation of any of the above
3950 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3951 syntax constant (cf. 'syntax' command).
3953 * Antiquotation @{make_string} inlines a function to print arbitrary
3954 values similar to the ML toplevel. The result is compiler dependent
3955 and may fall back on "?" in certain situations.
3957 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3958 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3959 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3960 not work with the asynchronous Isar document model.
3962 * Configuration options now admit dynamic default values, depending on
3963 the context or even global references.
3965 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3966 uses an efficient external library if available (for Poly/ML).
3968 * Renamed some important ML structures, while keeping the old names
3969 for some time as aliases within the structure Legacy:
3971 OuterKeyword ~> Keyword
3974 OuterSyntax ~> Outer_Syntax
3975 PrintMode ~> Print_Mode
3976 SpecParse ~> Parse_Spec
3979 ThyOutput ~> Thy_Output
3980 TypeInfer ~> Type_Infer
3982 Note that "open Legacy" simplifies porting of sources, but forgetting
3983 to remove it again will complicate porting again in the future.
3985 * Most operations that refer to a global context are named
3986 accordingly, e.g. Simplifier.global_context or
3987 ProofContext.init_global. There are some situations where a global
3988 context actually works, but under normal circumstances one needs to
3989 pass the proper local context through the code!
3991 * Discontinued old TheoryDataFun with its copy/init operation -- data
3992 needs to be pure. Functor Theory_Data_PP retains the traditional
3993 Pretty.pp argument to merge, which is absent in the standard
3994 Theory_Data version.
3996 * Sorts.certify_sort and derived "cert" operations for types and terms
3997 no longer minimize sorts. Thus certification at the boundary of the
3998 inference kernel becomes invariant under addition of class relations,
3999 which is an important monotonicity principle. Sorts are now minimized
4000 in the syntax layer only, at the boundary between the end-user and the
4001 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4002 explicitly in rare situations.
4004 * Renamed old-style Drule.standard to Drule.export_without_context, to
4005 emphasize that this is in no way a standard operation.
4008 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4009 usual for resolution. Rare INCOMPATIBILITY.
4011 * Renamed varify/unvarify operations to varify_global/unvarify_global
4012 to emphasize that these only work in a global situation (which is
4015 * Curried take and drop in library.ML; negative length is interpreted
4016 as infinity (as in chop). Subtle INCOMPATIBILITY.
4018 * Proof terms: type substitutions on proof constants now use canonical
4019 order of type variables. INCOMPATIBILITY for tools working with proof
4022 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4023 may no longer carry premises. User-level specifications are
4024 transformed accordingly by Thm.add_axiom/add_def.
4029 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4030 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4031 proof terms are enabled unconditionally in the new HOL-Proofs image.
4033 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4034 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4037 * Old lib/scripts/polyml-platform is superseded by the
4038 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4039 variant, even on a 64 bit machine. The following example setting
4040 prefers 64 bit if available:
4042 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4044 * The preliminary Isabelle/jEdit application demonstrates the emerging
4045 Isabelle/Scala layer for advanced prover interaction and integration.
4046 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4049 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4050 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4051 similar to the default assignment of the document preparation system
4052 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4053 provides some operations for direct access to the font without asking
4054 the user for manual installation.
4058 New in Isabelle2009-1 (December 2009)
4059 -------------------------------------
4063 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4064 one backslash should be used, even in ML sources.
4069 * Locale interpretation propagates mixins along the locale hierarchy.
4070 The currently only available mixins are the equations used to map
4071 local definitions to terms of the target domain of an interpretation.
4073 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4074 loc" to print all interpretations of locale "loc" in the theory.
4075 Interpretations in proofs are not shown.
4077 * Thoroughly revised locales tutorial. New section on conditional
4080 * On instantiation of classes, remaining undefined class parameters
4081 are formally declared. INCOMPATIBILITY.
4084 *** Document preparation ***
4086 * New generalized style concept for printing terms: @{foo (style) ...}
4087 instead of @{foo_style style ...} (old form is still retained for
4088 backward compatibility). Styles can be also applied for
4089 antiquotations prop, term_type and typeof.
4094 * New proof method "smt" for a combination of first-order logic with
4095 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4096 fixed-size bitvectors; there is also basic support for higher-order
4097 features (esp. lambda abstractions). It is an incomplete decision
4098 procedure based on external SMT solvers using the oracle mechanism;
4099 for the SMT solver Z3, this method is proof-producing. Certificates
4100 are provided to avoid calling the external solvers solely for
4101 re-checking proofs. Due to a remote SMT service there is no need for
4102 installing SMT solvers locally. See src/HOL/SMT.
4104 * New commands to load and prove verification conditions generated by
4105 the Boogie program verifier or derived systems (e.g. the Verifying C
4106 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4108 * New counterexample generator tool 'nitpick' based on the Kodkod
4109 relational model finder. See src/HOL/Tools/Nitpick and
4110 src/HOL/Nitpick_Examples.
4112 * New commands 'code_pred' and 'values' to invoke the predicate
4113 compiler and to enumerate values of inductive predicates.
4115 * A tabled implementation of the reflexive transitive closure.
4117 * New implementation of quickcheck uses generic code generator;
4118 default generators are provided for all suitable HOL types, records
4119 and datatypes. Old quickcheck can be re-activated importing theory
4120 Library/SML_Quickcheck.
4122 * New testing tool Mirabelle for automated proof tools. Applies
4123 several tools and tactics like sledgehammer, metis, or quickcheck, to
4124 every proof step in a theory. To be used in batch mode via the
4125 "mirabelle" utility.
4127 * New proof method "sos" (sum of squares) for nonlinear real
4128 arithmetic (originally due to John Harison). It requires theory
4129 Library/Sum_Of_Squares. It is not a complete decision procedure but
4130 works well in practice on quantifier-free real arithmetic with +, -,
4131 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4132 inequalities between polynomials. It makes use of external
4133 semidefinite programming solvers. Method "sos" generates a
4134 certificate that can be pasted into the proof thus avoiding the need
4135 to call an external tool every time the proof is checked. See
4136 src/HOL/Library/Sum_Of_Squares.
4138 * New method "linarith" invokes existing linear arithmetic decision
4141 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4143 * New Sledgehammer option "Full Types" in Proof General settings menu.
4144 Causes full type information to be output to the ATPs. This slows
4145 ATPs down considerably but eliminates a source of unsound "proofs"
4148 * New method "metisFT": A version of metis that uses full type
4149 information in order to avoid failures of proof reconstruction.
4151 * New evaluator "approximate" approximates an real valued term using
4152 the same method as the approximation method.
4154 * Method "approximate" now supports arithmetic expressions as
4155 boundaries of intervals and implements interval splitting and Taylor
4158 * ML antiquotation @{code_datatype} inserts definition of a datatype
4159 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4161 * New theory SupInf of the supremum and infimum operators for sets of
4164 * New theory Probability, which contains a development of measure
4165 theory, eventually leading to Lebesgue integration and probability.
4167 * Extended Multivariate Analysis to include derivation and Brouwer's
4170 * Reorganization of number theory, INCOMPATIBILITY:
4171 - new number theory development for nat and int, in theories Divides
4172 and GCD as well as in new session Number_Theory
4173 - some constants and facts now suffixed with _nat and _int
4175 - former session NumberTheory now named Old_Number_Theory, including
4176 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4177 - moved theory Pocklington from src/HOL/Library to
4178 src/HOL/Old_Number_Theory
4180 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4181 lcm of finite and infinite sets. It is shown that they form a complete
4184 * Class semiring_div requires superclass no_zero_divisors and proof of
4185 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4186 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4187 generalized to class semiring_div, subsuming former theorems
4188 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4189 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4192 * Refinements to lattice classes and sets:
4193 - less default intro/elim rules in locale variant, more default
4194 intro/elim rules in class variant: more uniformity
4195 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4197 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4199 - renamed ACI to inf_sup_aci
4200 - new class "boolean_algebra"
4201 - class "complete_lattice" moved to separate theory
4202 "Complete_Lattice"; corresponding constants (and abbreviations)
4203 renamed and with authentic syntax:
4204 Set.Inf ~> Complete_Lattice.Inf
4205 Set.Sup ~> Complete_Lattice.Sup
4206 Set.INFI ~> Complete_Lattice.INFI
4207 Set.SUPR ~> Complete_Lattice.SUPR
4208 Set.Inter ~> Complete_Lattice.Inter
4209 Set.Union ~> Complete_Lattice.Union
4210 Set.INTER ~> Complete_Lattice.INTER
4211 Set.UNION ~> Complete_Lattice.UNION
4212 - authentic syntax for
4215 - mere abbreviations:
4218 Set.inter (for inf, formerly Set.Int)
4219 Set.union (for sup, formerly Set.Un)
4220 Complete_Lattice.Inter (for Inf)
4221 Complete_Lattice.Union (for Sup)
4222 Complete_Lattice.INTER (for INFI)
4223 Complete_Lattice.UNION (for SUPR)
4224 - object-logic definitions as far as appropriate
4226 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4227 Un_subset_iff are explicitly deleted as default simp rules; then also
4228 their lattice counterparts le_inf_iff and le_sup_iff have to be
4229 deleted to achieve the desired effect.
4231 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4232 rules by default any longer; the same applies to min_max.inf_absorb1
4233 etc. INCOMPATIBILITY.
4235 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4236 pred_set_conv by default. INCOMPATIBILITY.
4238 * Power operations on relations and functions are now one dedicated
4239 constant "compow" with infix syntax "^^". Power operation on
4240 multiplicative monoids retains syntax "^" and is now defined generic
4241 in class power. INCOMPATIBILITY.
4243 * Relation composition "R O S" now has a more standard argument order:
4244 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4245 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4246 break, since the O_assoc rule was not rewritten like this. Fix using
4247 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4249 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4250 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4253 * Most rules produced by inductive and datatype package have mandatory
4254 prefixes. INCOMPATIBILITY.
4256 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4257 the attribute of the same name. Each of the theorems in the list
4258 DERIV_intros assumes composition with an additional function and
4259 matches a variable to the derivative, which has to be solved by the
4260 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4261 of most elementary terms. Former Maclauren.DERIV_tac and
4262 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4265 * Code generator attributes follow the usual underscore convention:
4266 code_unfold replaces code unfold
4267 code_post replaces code post
4272 sizechange -> size_change
4273 induct_scheme -> induction_schema
4276 * Discontinued abbreviation "arbitrary" of constant "undefined".
4277 INCOMPATIBILITY, use "undefined" directly.
4280 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4281 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4282 Suc_plus1 -> Suc_eq_plus1
4283 *anti_sym -> *antisym*
4284 vector_less_eq_def -> vector_le_def
4287 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4290 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4296 * Theory Representable defines a class "rep" of domains that are
4297 representable (via an ep-pair) in the universal domain type "udom".
4298 Instances are provided for all type constructors defined in HOLCF.
4300 * The 'new_domain' command is a purely definitional version of the
4301 domain package, for representable domains. Syntax is identical to the
4302 old domain package. The 'new_domain' package also supports indirect
4303 recursion using previously-defined type constructors. See
4304 src/HOLCF/ex/New_Domain.thy for examples.
4306 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4307 on the left-hand side of an equation, and then performs
4308 simplification. Rewriting is done using rules declared with the
4309 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4310 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4312 * The pattern-match compiler in 'fixrec' can now handle constructors
4313 with HOL function types. Pattern-match combinators for the Pair
4314 constructor are pre-configured.
4316 * The 'fixrec' package now produces better fixed-point induction rules
4317 for mutually-recursive definitions: Induction rules have conclusions
4318 of the form "P foo bar" instead of "P <foo, bar>".
4320 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4321 been renamed to "below". The name "below" now replaces "less" in many
4322 theorem names. (Legacy theorem names using "less" are still supported
4325 * The 'fixrec' package now supports "bottom patterns". Bottom
4326 patterns can be used to generate strictness rules, or to make
4327 functions more strict (much like the bang-patterns supported by the
4328 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4334 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4335 errors and run-time exceptions, including detailed source positions.
4337 * Structure Name_Space (formerly NameSpace) now manages uniquely
4338 identified entries, with some additional information such as source
4339 position, logical grouping etc.
4341 * Theory and context data is now introduced by the simplified and
4342 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4343 to be pure, but the old TheoryDataFun for mutable data (with explicit
4344 copy operation) is still available for some time.
4346 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4347 provides a high-level programming interface to synchronized state
4348 variables with atomic update. This works via pure function
4349 application within a critical section -- its runtime should be as
4350 short as possible; beware of deadlocks if critical code is nested,
4351 either directly or indirectly via other synchronized variables!
4353 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4354 wraps raw ML references, explicitly indicating their non-thread-safe
4355 behaviour. The Isar toplevel keeps this structure open, to
4356 accommodate Proof General as well as quick and dirty interactive
4357 experiments with references.
4359 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4360 parallel tactical reasoning.
4362 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4363 are similar to SUBPROOF, but are slightly more flexible: only the
4364 specified parts of the subgoal are imported into the context, and the
4365 body tactic may introduce new subgoals and schematic variables.
4367 * Old tactical METAHYPS, which does not observe the proof context, has
4368 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4369 or Subgoal.FOCUS etc.
4371 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4372 functors have their own ML name space there is no point to mark them
4373 separately.) Minor INCOMPATIBILITY.
4375 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4377 * Renamed several structures FooBar to Foo_Bar. Occasional,
4380 * Operations of structure Skip_Proof no longer require quick_and_dirty
4381 mode, which avoids critical setmp.
4383 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4384 combinators for "args". INCOMPATIBILITY, need to use simplified
4385 Attrib/Method.setup introduced in Isabelle2009.
4387 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4388 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4389 last resort. INCOMPATIBILITY.
4391 * Display.pretty_thm now requires a proper context (cf. former
4392 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4393 or even Display.pretty_thm_without_context as last resort.
4396 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4397 Syntax.pretty_typ/term directly, preferably with proper context
4398 instead of global theory.
4403 * Further fine tuning of parallel proof checking, scales up to 8 cores
4404 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4407 * Support for additional "Isabelle components" via etc/components, see
4408 also the system manual.
4410 * The isabelle makeall tool now operates on all components with
4411 IsaMakefile, not just hardwired "logics".
4413 * Removed "compress" option from isabelle-process and isabelle usedir;
4414 this is always enabled.
4416 * Discontinued support for Poly/ML 4.x versions.
4418 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4419 on a given logic image. This requires the lighttpd webserver and is
4420 currently supported on Linux only.
4424 New in Isabelle2009 (April 2009)
4425 --------------------------------
4429 * Simplified main Isabelle executables, with less surprises on
4430 case-insensitive file-systems (such as Mac OS).
4432 - The main Isabelle tool wrapper is now called "isabelle" instead of
4435 - The former "isabelle" alias for "isabelle-process" has been
4436 removed (should rarely occur to regular users).
4438 - The former "isabelle-interface" and its alias "Isabelle" have been
4439 removed (interfaces are now regular Isabelle tools).
4441 Within scripts and make files, the Isabelle environment variables
4442 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4443 respectively. (The latter are still available as legacy feature.)
4445 The old isabelle-interface wrapper could react in confusing ways if
4446 the interface was uninstalled or changed otherwise. Individual
4447 interface tool configuration is now more explicit, see also the
4448 Isabelle system manual. In particular, Proof General is now available
4449 via "isabelle emacs".
4451 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4452 purge installed copies of Isabelle executables and re-run "isabelle
4453 install -p ...", or use symlinks.
4455 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4456 old ~/isabelle, which was slightly non-standard and apt to cause
4457 surprises on case-insensitive file-systems (such as Mac OS).
4459 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4460 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4461 care is required when using older releases of Isabelle. Note that
4462 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4463 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4465 * Proofs of fully specified statements are run in parallel on
4466 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4467 a regular 4-core machine, if the initial heap space is made reasonably
4468 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4470 * The main reference manuals ("isar-ref", "implementation", and
4471 "system") have been updated and extended. Formally checked references
4472 as hyperlinks are now available uniformly.
4477 * Complete re-implementation of locales. INCOMPATIBILITY in several
4478 respects. The most important changes are listed below. See the
4479 Tutorial on Locales ("locales" manual) for details.
4481 - In locale expressions, instantiation replaces renaming. Parameters
4482 must be declared in a for clause. To aid compatibility with previous
4483 parameter inheritance, in locale declarations, parameters that are not
4484 'touched' (instantiation position "_" or omitted) are implicitly added
4485 with their syntax at the beginning of the for clause.
4487 - Syntax from abbreviations and definitions in locales is available in
4488 locale expressions and context elements. The latter is particularly
4489 useful in locale declarations.
4491 - More flexible mechanisms to qualify names generated by locale
4492 expressions. Qualifiers (prefixes) may be specified in locale
4493 expressions, and can be marked as mandatory (syntax: "name!:") or
4494 optional (syntax "name?:"). The default depends for plain "name:"
4495 depends on the situation where a locale expression is used: in
4496 commands 'locale' and 'sublocale' prefixes are optional, in
4497 'interpretation' and 'interpret' prefixes are mandatory. The old
4498 implicit qualifiers derived from the parameter names of a locale are
4499 no longer generated.
4501 - Command "sublocale l < e" replaces "interpretation l < e". The
4502 instantiation clause in "interpretation" and "interpret" (square
4503 brackets) is no longer available. Use locale expressions.
4505 - When converting proof scripts, mandatory qualifiers in
4506 'interpretation' and 'interpret' should be retained by default, even
4507 if this is an INCOMPATIBILITY compared to former behavior. In the
4508 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4509 in locale expressions range over a single locale instance only.
4511 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4512 In existing theorem specifications replace the includes element by the
4513 respective context elements of the included locale, omitting those
4514 that are already present in the theorem specification. Multiple
4515 assume elements of a locale should be replaced by a single one
4516 involving the locale predicate. In the proof body, declarations (most
4517 notably theorems) may be regained by interpreting the respective
4518 locales in the proof context as required (command "interpret").
4520 If using "includes" in replacement of a target solely because the
4521 parameter types in the theorem are not as general as in the target,
4522 consider declaring a new locale with additional type constraints on
4523 the parameters (context element "constrains").
4525 - Discontinued "locale (open)". INCOMPATIBILITY.
4527 - Locale interpretation commands no longer attempt to simplify goal.
4528 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4529 methods intro_locales and unfold_locales to clarify.
4531 - Locale interpretation commands no longer accept interpretation
4532 attributes. INCOMPATIBILITY.
4534 * Class declaration: so-called "base sort" must not be given in import
4535 list any longer, but is inferred from the specification. Particularly
4542 class foo = type + ...
4544 * Class target: global versions of theorems stemming do not carry a
4545 parameter prefix any longer. INCOMPATIBILITY.
4547 * Class 'instance' command no longer accepts attached definitions.
4548 INCOMPATIBILITY, use proper 'instantiation' target instead.
4550 * Recovered hiding of consts, which was accidentally broken in
4551 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4552 makes c inaccessible; consider using ``hide (open) const c'' instead.
4554 * Slightly more coherent Pure syntax, with updated documentation in
4555 isar-ref manual. Removed locales meta_term_syntax and
4556 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4557 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4558 directly in regular applications.
4560 * There is a new syntactic category "float_const" for signed decimal
4561 fractions (e.g. 123.45 or -123.45).
4563 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4564 interface with 'setup' command instead.
4566 * Command 'local_setup' is similar to 'setup', but operates on a local
4569 * The 'axiomatization' command now only works within a global theory
4570 context. INCOMPATIBILITY.
4572 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4573 hypotheses. Sorts required in the course of reasoning need to be
4574 covered by the constraints in the initial statement, completed by the
4575 type instance information of the background theory. Non-trivial sort
4576 hypotheses, which rarely occur in practice, may be specified via
4577 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4579 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4581 The result contains an implicit sort hypotheses as before --
4582 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4585 * Generalized Isar history, with support for linear undo, direct state
4588 * Changed defaults for unify configuration options:
4590 unify_trace_bound = 50 (formerly 25)
4591 unify_search_bound = 60 (formerly 30)
4593 * Different bookkeeping for code equations (INCOMPATIBILITY):
4595 a) On theory merge, the last set of code equations for a particular
4596 constant is taken (in accordance with the policy applied by other
4597 parts of the code generator framework).
4599 b) Code equations stemming from explicit declarations (e.g. code
4600 attribute) gain priority over default code equations stemming
4601 from definition, primrec, fun etc.
4603 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4605 * Unified theorem tables for both code generators. Thus [code
4606 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4608 * Command 'find_consts' searches for constants based on type and name
4611 find_consts "_ => bool"
4613 By default, matching is against subtypes, but it may be restricted to
4614 the whole type. Searching by name is possible. Multiple queries are
4615 conjunctive and queries may be negated by prefixing them with a
4618 find_consts strict: "_ => bool" name: "Int" -"int => int"
4620 * New 'find_theorems' criterion "solves" matches theorems that
4621 directly solve the current goal (modulo higher-order unification).
4623 * Auto solve feature for main theorem statements: whenever a new goal
4624 is stated, "find_theorems solves" is called; any theorems that could
4625 solve the lemma directly are listed as part of the goal state.
4626 Cf. associated options in Proof General Isabelle settings menu,
4627 enabled by default, with reasonable timeout for pathological cases of
4628 higher-order unification.
4631 *** Document preparation ***
4633 * Antiquotation @{lemma} now imitates a regular terminal proof,
4634 demanding keyword 'by' and supporting the full method expression
4635 syntax just like the Isar command 'by'.
4640 * Integrated main parts of former image HOL-Complex with HOL. Entry
4641 points Main and Complex_Main remain as before.
4643 * Logic image HOL-Plain provides a minimal HOL with the most important
4644 tools available (inductive, datatype, primrec, ...). This facilitates
4645 experimentation and tool development. Note that user applications
4646 (and library theories) should never refer to anything below theory
4649 * Logic image HOL-Main stops at theory Main, and thus facilitates
4650 experimentation due to shorter build times.
4652 * Logic image HOL-NSA contains theories of nonstandard analysis which
4653 were previously part of former HOL-Complex. Entry point Hyperreal
4654 remains valid, but theories formerly using Complex_Main should now use
4655 new entry point Hypercomplex.
4657 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4658 Posix processes. Avoids potentially expensive forking of the ML
4659 process. New thread-based implementation also works on non-Unix
4660 platforms (Cygwin). Provers are no longer hardwired, but defined
4661 within the theory via plain ML wrapper functions. Basic Sledgehammer
4662 commands are covered in the isar-ref manual.
4664 * Wrapper scripts for remote SystemOnTPTP service allows to use
4665 sledgehammer without local ATP installation (Vampire etc.). Other
4666 provers may be included via suitable ML wrappers, see also
4667 src/HOL/ATP_Linkup.thy.
4669 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4672 * The metis method no longer fails because the theorem is too trivial
4673 (contains the empty clause).
4675 * The metis method now fails in the usual manner, rather than raising
4676 an exception, if it determines that it cannot prove the theorem.
4678 * Method "coherent" implements a prover for coherent logic (see also
4679 src/Tools/coherent.ML).
4681 * Constants "undefined" and "default" replace "arbitrary". Usually
4682 "undefined" is the right choice to replace "arbitrary", though
4683 logically there is no difference. INCOMPATIBILITY.
4685 * Command "value" now integrates different evaluation mechanisms. The
4686 result of the first successful evaluation mechanism is printed. In
4687 square brackets a particular named evaluation mechanisms may be
4688 specified (currently, [SML], [code] or [nbe]). See further
4689 src/HOL/ex/Eval_Examples.thy.
4691 * Normalization by evaluation now allows non-leftlinear equations.
4692 Declare with attribute [code nbe].
4694 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4695 as the structured Isar versions "cases" and "induct", cf. the
4696 corresponding "cases" and "induct" attributes. Mutual induction rules
4697 are now presented as a list of individual projections
4698 (e.g. foo_bar.inducts for types foo and bar); the old format with
4699 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4700 rare situations a different rule is selected --- notably nested tuple
4701 elimination instead of former prod.exhaust: use explicit (case_tac t
4702 rule: prod.exhaust) here.
4704 * Attributes "cases", "induct", "coinduct" support "del" option.
4706 * Removed fact "case_split_thm", which duplicates "case_split".
4708 * The option datatype has been moved to a new theory Option. Renamed
4709 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4711 * New predicate "strict_mono" classifies strict functions on partial
4712 orders. With strict functions on linear orders, reasoning about
4713 (in)equalities is facilitated by theorems "strict_mono_eq",
4714 "strict_mono_less_eq" and "strict_mono_less".
4716 * Some set operations are now proper qualified constants with
4717 authentic syntax. INCOMPATIBILITY:
4728 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4731 * Auxiliary class "itself" has disappeared -- classes without any
4732 parameter are treated as expected by the 'class' command.
4734 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4736 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4737 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4739 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4740 method "approximation". It proves formulas on real values by using
4741 interval arithmetic. In the formulas are also the transcendental
4742 functions sin, cos, tan, atan, ln, exp and the constant pi are
4743 allowed. For examples see
4744 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4746 * Theory "Reflection" now resides in HOL/Library.
4748 * Entry point to Word library now simply named "Word".
4751 * Made source layout more coherent with logical distribution
4754 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4755 src/HOL/Library/Code_Message.thy ~> src/HOL/
4756 src/HOL/Library/GCD.thy ~> src/HOL/
4757 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4758 src/HOL/Library/Parity.thy ~> src/HOL/
4759 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4760 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4761 src/HOL/Real/Lubs.thy ~> src/HOL/
4762 src/HOL/Real/PReal.thy ~> src/HOL/
4763 src/HOL/Real/Rational.thy ~> src/HOL/
4764 src/HOL/Real/RComplete.thy ~> src/HOL/
4765 src/HOL/Real/RealDef.thy ~> src/HOL/
4766 src/HOL/Real/RealPow.thy ~> src/HOL/
4767 src/HOL/Real/Real.thy ~> src/HOL/
4768 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4769 src/HOL/Complex/Complex.thy ~> src/HOL/
4770 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4771 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4772 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4773 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4774 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4775 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4776 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4777 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4778 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4779 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4780 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4781 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4782 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4783 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4784 src/HOL/Real/Float ~> src/HOL/Library/
4785 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4786 src/HOL/Real/RealVector.thy ~> src/HOL/
4788 src/HOL/arith_data.ML ~> src/HOL/Tools
4789 src/HOL/hologic.ML ~> src/HOL/Tools
4790 src/HOL/simpdata.ML ~> src/HOL/Tools
4791 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4792 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4793 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4794 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4795 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4796 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4797 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4799 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4800 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4801 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4802 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4803 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4804 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4806 * If methods "eval" and "evaluation" encounter a structured proof
4807 state with !!/==>, only the conclusion is evaluated to True (if
4808 possible), avoiding strange error messages.
4810 * Method "sizechange" automates termination proofs using (a
4811 modification of) the size-change principle. Requires SAT solver. See
4812 src/HOL/ex/Termination.thy for examples.
4814 * Simplifier: simproc for let expressions now unfolds if bound
4815 variable occurs at most once in let expression body. INCOMPATIBILITY.
4817 * Method "arith": Linear arithmetic now ignores all inequalities when
4818 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4820 * New attribute "arith" for facts that should always be used
4821 automatically by arithmetic. It is intended to be used locally in
4824 assumes [arith]: "x > 0"
4826 Global usage is discouraged because of possible performance impact.
4828 * New classes "top" and "bot" with corresponding operations "top" and
4829 "bot" in theory Orderings; instantiation of class "complete_lattice"
4830 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4832 * Changed definition lemma "less_fun_def" in order to provide an
4833 instance for preorders on functions; use lemma "less_le" instead.
4836 * Theory Orderings: class "wellorder" moved here, with explicit
4837 induction rule "less_induct" as assumption. For instantiation of
4838 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4841 * Theory Orderings: added class "preorder" as superclass of "order".
4842 INCOMPATIBILITY: Instantiation proofs for order, linorder
4843 etc. slightly changed. Some theorems named order_class.* now named
4846 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4849 * Theory Finite_Set: added a new fold combinator of type
4851 ('a => 'b => 'b) => 'b => 'a set => 'b
4853 Occasionally this is more convenient than the old fold combinator
4854 which is now defined in terms of the new one and renamed to
4857 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4858 and "ring_simps" have been replaced by "algebra_simps" (which can be
4859 extended with further lemmas!). At the moment both still exist but
4860 the former will disappear at some point.
4862 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4863 class recpower. Type-specific simp rules for various recpower types
4864 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4866 rat_power_0 -> power_0
4867 rat_power_Suc -> power_Suc
4868 realpow_0 -> power_0
4869 realpow_Suc -> power_Suc
4870 complexpow_0 -> power_0
4871 complexpow_Suc -> power_Suc
4872 power_poly_0 -> power_0
4873 power_poly_Suc -> power_Suc
4875 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4876 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4877 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4878 of lemmas from Divides has been generalized from nat to class
4879 semiring_div. INCOMPATIBILITY. This involves the following theorem
4880 renames resulting from duplicate elimination:
4882 dvd_def_mod ~> dvd_eq_mod_eq_0
4883 zero_dvd_iff ~> dvd_0_left_iff
4884 dvd_0 ~> dvd_0_right
4885 DIVISION_BY_ZERO_DIV ~> div_by_0
4886 DIVISION_BY_ZERO_MOD ~> mod_by_0
4887 mult_div ~> div_mult_self2_is_id
4888 mult_mod ~> mod_mult_self2_is_0
4890 * Theory IntDiv: removed many lemmas that are instances of class-based
4891 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4892 rename old lemmas as follows:
4894 dvd_diff -> nat_dvd_diff
4895 dvd_zminus_iff -> dvd_minus_iff
4896 mod_add1_eq -> mod_add_eq
4897 mod_mult1_eq -> mod_mult_right_eq
4898 mod_mult1_eq' -> mod_mult_left_eq
4899 mod_mult_distrib_mod -> mod_mult_eq
4900 nat_mod_add_left_eq -> mod_add_left_eq
4901 nat_mod_add_right_eq -> mod_add_right_eq
4902 nat_mod_div_trivial -> mod_div_trivial
4903 nat_mod_mod_trivial -> mod_mod_trivial
4904 zdiv_zadd_self1 -> div_add_self1
4905 zdiv_zadd_self2 -> div_add_self2
4906 zdiv_zmult_self1 -> div_mult_self2_is_id
4907 zdiv_zmult_self2 -> div_mult_self1_is_id
4908 zdvd_triv_left -> dvd_triv_left
4909 zdvd_triv_right -> dvd_triv_right
4910 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4911 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4912 zmod_zadd_left_eq -> mod_add_left_eq
4913 zmod_zadd_right_eq -> mod_add_right_eq
4914 zmod_zadd_self1 -> mod_add_self1
4915 zmod_zadd_self2 -> mod_add_self2
4916 zmod_zadd1_eq -> mod_add_eq
4917 zmod_zdiff1_eq -> mod_diff_eq
4918 zmod_zdvd_zmod -> mod_mod_cancel
4919 zmod_zmod_cancel -> mod_mod_cancel
4920 zmod_zmult_self1 -> mod_mult_self2_is_0
4921 zmod_zmult_self2 -> mod_mult_self1_is_0
4924 zdvd_abs1 -> abs_dvd_iff
4925 zdvd_abs2 -> dvd_abs_iff
4926 zdvd_refl -> dvd_refl
4927 zdvd_trans -> dvd_trans
4928 zdvd_zadd -> dvd_add
4929 zdvd_zdiff -> dvd_diff
4930 zdvd_zminus_iff -> dvd_minus_iff
4931 zdvd_zminus2_iff -> minus_dvd_iff
4932 zdvd_zmultD -> dvd_mult_right
4933 zdvd_zmultD2 -> dvd_mult_left
4934 zdvd_zmult_mono -> mult_dvd_mono
4935 zdvd_0_right -> dvd_0_right
4936 zdvd_0_left -> dvd_0_left_iff
4937 zdvd_1_left -> one_dvd
4938 zminus_dvd_iff -> minus_dvd_iff
4940 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4942 * The real numbers offer decimal input syntax: 12.34 is translated
4943 into 1234/10^2. This translation is not reversed upon output.
4945 * Theory Library/Polynomial defines an abstract type 'a poly of
4946 univariate polynomials with coefficients of type 'a. In addition to
4947 the standard ring operations, it also supports div and mod. Code
4948 generation is also supported, using list-style constructors.
4950 * Theory Library/Inner_Product defines a class of real_inner for real
4951 inner product spaces, with an overloaded operation inner :: 'a => 'a
4952 => real. Class real_inner is a subclass of real_normed_vector from
4955 * Theory Library/Product_Vector provides instances for the product
4956 type 'a * 'b of several classes from RealVector and Inner_Product.
4957 Definitions of addition, subtraction, scalar multiplication, norms,
4958 and inner products are included.
4960 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4961 addition to the field operations, numerals and case syntax are also
4964 * Theory Library/Diagonalize provides constructive version of Cantor's
4965 first diagonalization argument.
4967 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4968 zlcm (for int); carried together from various gcd/lcm developements in
4969 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4970 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4971 may recover tupled syntax as follows:
4973 hide (open) const gcd
4974 abbreviation gcd where
4975 "gcd == (%(a, b). GCD.gcd a b)"
4977 GCD.gcd ("gcd '(_, _')")
4979 The same works for lcm, zgcd, zlcm.
4981 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4982 instantiations for algebraic structures. Removed some duplicate
4983 theorems. Changes in simp rules. INCOMPATIBILITY.
4985 * ML antiquotation @{code} takes a constant as argument and generates
4986 corresponding code in background and inserts name of the corresponding
4987 resulting ML value/function/datatype constructor binding in place.
4988 All occurrences of @{code} with a single ML block are generated
4989 simultaneously. Provides a generic and safe interface for
4990 instrumentalizing code generation. See
4991 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4992 In future you ought to refrain from ad-hoc compiling generated SML
4993 code on the ML toplevel. Note that (for technical reasons) @{code}
4994 cannot refer to constants for which user-defined serializations are
4995 set. Refer to the corresponding ML counterpart directly in that
4998 * Command 'rep_datatype': instead of theorem names the command now
4999 takes a list of terms denoting the constructors of the type to be
5000 represented as datatype. The characteristic theorems have to be
5001 proven. INCOMPATIBILITY. Also observe that the following theorems
5002 have disappeared in favour of existing ones:
5004 unit_induct ~> unit.induct
5005 prod_induct ~> prod.induct
5006 sum_induct ~> sum.induct
5007 Suc_Suc_eq ~> nat.inject
5008 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5013 * New locales for orders and lattices where the equivalence relation
5014 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5015 locales use a record structure with field eq for the equivalence.
5017 * New theory of factorial domains.
5019 * Units_l_inv and Units_r_inv are now simp rules by default.
5020 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5021 and/or r_inv will now also require deletion of these lemmas.
5023 * Renamed the following theorems, INCOMPATIBILITY:
5025 UpperD ~> Upper_memD
5026 LowerD ~> Lower_memD
5027 least_carrier ~> least_closed
5028 greatest_carrier ~> greatest_closed
5029 greatest_Lower_above ~> greatest_Lower_below
5030 one_zero ~> carrier_one_zero
5031 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5036 * Nominal datatypes can now contain type-variables.
5038 * Commands 'nominal_inductive' and 'equivariance' work with local
5041 * Nominal primrec can now works with local theory targets and its
5042 specification syntax now conforms to the general format as seen in
5045 * Method "perm_simp" honours the standard simplifier attributes
5046 (no_asm), (no_asm_use) etc.
5048 * The new predicate #* is defined like freshness, except that on the
5049 left hand side can be a set or list of atoms.
5051 * Experimental command 'nominal_inductive2' derives strong induction
5052 principles for inductive definitions. In contrast to
5053 'nominal_inductive', which can only deal with a fixed number of
5054 binders, it can deal with arbitrary expressions standing for sets of
5055 atoms to be avoided. The only inductive definition we have at the
5056 moment that needs this generalisation is the typing rule for Lets in
5059 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5060 -----------------------------------------------------------------
5061 Gamma |- Let x be t1 in t2 : T2
5063 In this rule one wants to avoid all the binders that are introduced by
5064 "close Gamma T1". We are looking for other examples where this
5065 feature might be useful. Please let us know.
5070 * Reimplemented the simplification procedure for proving continuity
5071 subgoals. The new simproc is extensible; users can declare additional
5072 continuity introduction rules with the attribute [cont2cont].
5074 * The continuity simproc now uses a different introduction rule for
5075 solving continuity subgoals on terms with lambda abstractions. In
5076 some rare cases the new simproc may fail to solve subgoals that the
5077 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5078 Potential INCOMPATIBILITY.
5080 * Command 'fixrec': specification syntax now conforms to the general
5081 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5082 examples. INCOMPATIBILITY.
5087 * Proof of Zorn's Lemma for partial orders.
5092 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5093 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5094 depends on multithreading, so timouts will not work before Poly/ML
5097 * High-level support for concurrent ML programming, see
5098 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5099 particularly convenient to organize independent functional
5100 computations. The concept of "synchronized variables" provides a
5101 higher-order interface for components with shared state, avoiding the
5102 delicate details of mutexes and condition variables. (Requires
5103 Poly/ML 5.2.1 or later.)
5105 * ML bindings produced via Isar commands are stored within the Isar
5106 context (theory or proof). Consequently, commands like 'use' and 'ML'
5107 become thread-safe and work with undo as expected (concerning
5108 top-level bindings, not side-effects on global references).
5109 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5110 compiler at runtime; really global bindings need to be given outside a
5111 theory. (Requires Poly/ML 5.2 or later.)
5113 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5114 context. Top-level ML bindings are stored within the proof context in
5115 a purely sequential fashion, disregarding the nested proof structure.
5116 ML bindings introduced by 'ML_prf' are discarded at the end of the
5117 proof. (Requires Poly/ML 5.2 or later.)
5119 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5120 and Method.setup, as well as Isar commands 'attribute_setup' and
5121 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5122 existing code accordingly, or use plain 'setup' together with old
5125 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5126 to 'a -> thm, while results are always tagged with an authentic oracle
5127 name. The Isar command 'oracle' is now polymorphic, no argument type
5128 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5129 accordingly. Note that extra performance may be gained by producing
5130 the cterm carefully, avoiding slow Thm.cterm_of.
5132 * Simplified interface for defining document antiquotations via
5133 ThyOutput.antiquotation, ThyOutput.output, and optionally
5134 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5135 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5138 * More systematic treatment of long names, abstract name bindings, and
5139 name space operations. Basic operations on qualified names have been
5140 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5141 Long_Name.append. Old type bstring has been mostly replaced by
5142 abstract type binding (see structure Binding), which supports precise
5143 qualification by packages and local theory targets, as well as proper
5144 tracking of source positions. INCOMPATIBILITY, need to wrap old
5145 bstring values into Binding.name, or better pass through abstract
5146 bindings everywhere. See further src/Pure/General/long_name.ML,
5147 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5149 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5150 LocalTheory.note etc.) now refer to the *full* internal name, not the
5151 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5153 * Disposed old type and term read functions (Sign.read_def_typ,
5154 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5155 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5156 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5157 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5158 resort for legacy applications.
5160 * Disposed old declarations, tactics, tactic combinators that refer to
5161 the simpset or claset of an implicit theory (such as Addsimps,
5162 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5163 embedded ML text, or local_simpset_of with a proper context passed as
5164 explicit runtime argument.
5166 * Rules and tactics that read instantiations (read_instantiate,
5167 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5168 context, which is required for parsing and type-checking. Moreover,
5169 the variables are specified as plain indexnames, not string encodings
5170 thereof. INCOMPATIBILITY.
5172 * Generic Toplevel.add_hook interface allows to analyze the result of
5173 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5174 for theorem dependency output of transactions resulting in a new
5177 * ML antiquotations: block-structured compilation context indicated by
5178 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5180 @{binding name} - basic name binding
5181 @{let ?pat = term} - term abbreviation (HO matching)
5182 @{note name = fact} - fact abbreviation
5183 @{thm fact} - singleton fact (with attributes)
5184 @{thms fact} - general fact (with attributes)
5185 @{lemma prop by method} - singleton goal
5186 @{lemma prop by meth1 meth2} - singleton goal
5187 @{lemma prop1 ... propN by method} - general goal
5188 @{lemma prop1 ... propN by meth1 meth2} - general goal
5189 @{lemma (open) ...} - open derivation
5194 * The Isabelle "emacs" tool provides a specific interface to invoke
5195 Proof General / Emacs, with more explicit failure if that is not
5196 installed (the old isabelle-interface script silently falls back on
5197 isabelle-process). The PROOFGENERAL_HOME setting determines the
5198 installation location of the Proof General distribution.
5200 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5201 the Isabelle process into a JVM/Scala application. See
5202 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5203 process wrapper has been discontinued.)
5205 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5207 * Various status messages (with exact source position information) are
5208 emitted, if proper markup print mode is enabled. This allows
5209 user-interface components to provide detailed feedback on internal
5214 New in Isabelle2008 (June 2008)
5215 -------------------------------
5219 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5220 and updated, with formally checked references as hyperlinks.
5222 * Theory loader: use_thy (and similar operations) no longer set the
5223 implicit ML context, which was occasionally hard to predict and in
5224 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5225 provides a proper context already.
5227 * Theory loader: old-style ML proof scripts being *attached* to a thy
5228 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5229 'use' within a theory file will do the job.
5231 * Name space merge now observes canonical order, i.e. the second space
5232 is inserted into the first one, while existing entries in the first
5233 space take precedence. INCOMPATIBILITY in rare situations, may try to
5234 swap theory imports.
5236 * Syntax: symbol \<chi> is now considered a letter. Potential
5237 INCOMPATIBILITY in identifier syntax etc.
5239 * Outer syntax: string tokens no longer admit escaped white space,
5240 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5241 white space without escapes.
5243 * Outer syntax: string tokens may contain arbitrary character codes
5244 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5250 * Context-dependent token translations. Default setup reverts locally
5251 fixed variables, and adds hilite markup for undeclared frees.
5253 * Unused theorems can be found using the new command 'unused_thms'.
5254 There are three ways of invoking it:
5257 Only finds unused theorems in the current theory.
5259 (2) unused_thms thy_1 ... thy_n -
5260 Finds unused theorems in the current theory and all of its ancestors,
5261 excluding the theories thy_1 ... thy_n and all of their ancestors.
5263 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5264 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5265 their ancestors, excluding the theories thy_1 ... thy_n and all of
5268 In order to increase the readability of the list produced by
5269 unused_thms, theorems that have been created by a particular instance
5270 of a theory command such as 'inductive' or 'function' are considered
5271 to belong to the same "group", meaning that if at least one theorem in
5272 this group is used, the other theorems in the same group are no longer
5273 reported as unused. Moreover, if all theorems in the group are
5274 unused, only one theorem in the group is displayed.
5276 Note that proof objects have to be switched on in order for
5277 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5278 usually the case when using Proof General with the default settings).
5280 * Authentic naming of facts disallows ad-hoc overwriting of previous
5281 theorems within the same name space. INCOMPATIBILITY, need to remove
5282 duplicate fact bindings, or even accidental fact duplications. Note
5283 that tools may maintain dynamically scoped facts systematically, using
5284 PureThy.add_thms_dynamic.
5286 * Command 'hide' now allows to hide from "fact" name space as well.
5288 * Eliminated destructive theorem database, simpset, claset, and
5289 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5290 update of theories within ML code.
5292 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5293 INCOMPATIBILITY, object-logics depending on former Pure require
5294 additional setup PureThy.old_appl_syntax_setup; object-logics
5295 depending on former CPure need to refer to Pure.
5297 * Commands 'use' and 'ML' are now purely functional, operating on
5298 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5299 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5302 * Command 'setup': discontinued implicit version with ML reference.
5304 * Instantiation target allows for simultaneous specification of class
5305 instance operations together with an instantiation proof.
5306 Type-checking phase allows to refer to class operations uniformly.
5307 See src/HOL/Complex/Complex.thy for an Isar example and
5308 src/HOL/Library/Eval.thy for an ML example.
5310 * Indexing of literal facts: be more serious about including only
5311 facts from the visible specification/proof context, but not the
5312 background context (locale etc.). Affects `prop` notation and method
5313 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5316 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5317 "(open)" option, which used to expose internal bound variables to the
5320 * Isar statements: removed obsolete case "rule_context".
5321 INCOMPATIBILITY, better use explicit fixes/assumes.
5323 * Locale proofs: default proof step now includes 'unfold_locales';
5324 hence 'proof' without argument may be used to unfold locale
5328 *** Document preparation ***
5330 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5331 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5332 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5333 spot); renamed link color from "darkblue" to "linkcolor" (default
5334 value unchanged, can be redefined via \definecolor); no longer sets
5335 "a4paper" option (unnecessary or even intrusive).
5337 * Antiquotation @{lemma A method} proves proposition A by the given
5338 method (either a method name or a method name plus (optional) method
5339 arguments in parentheses) and prints A just like @{prop A}.
5344 * New primrec package. Specification syntax conforms in style to
5345 definition/function/.... No separate induction rule is provided. The
5346 "primrec" command distinguishes old-style and new-style specifications
5347 by syntax. The former primrec package is now named OldPrimrecPackage.
5348 When adjusting theories, beware: constants stemming from new-style
5349 primrec specifications have authentic syntax.
5351 * Metis prover is now an order of magnitude faster, and also works
5352 with multithreading.
5354 * Metis: the maximum number of clauses that can be produced from a
5355 theorem is now given by the attribute max_clauses. Theorems that
5356 exceed this number are ignored, with a warning printed.
5358 * Sledgehammer no longer produces structured proofs by default. To
5359 enable, declare [[sledgehammer_full = true]]. Attributes
5360 reconstruction_modulus, reconstruction_sorts renamed
5361 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5363 * Method "induct_scheme" derives user-specified induction rules
5364 from well-founded induction and completeness of patterns. This factors
5365 out some operations that are done internally by the function package
5366 and makes them available separately. See
5367 src/HOL/ex/Induction_Scheme.thy for examples.
5369 * More flexible generation of measure functions for termination
5370 proofs: Measure functions can be declared by proving a rule of the
5371 form "is_measure f" and giving it the [measure_function] attribute.
5372 The "is_measure" predicate is logically meaningless (always true), and
5373 just guides the heuristic. To find suitable measure functions, the
5374 termination prover sets up the goal "is_measure ?f" of the appropriate
5375 type and generates all solutions by prolog-style backwards proof using
5378 This setup also deals with rules like
5380 "is_measure f ==> is_measure (list_size f)"
5382 which accommodates nested datatypes that recurse through lists.
5383 Similar rules are predeclared for products and option types.
5385 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5389 - Definitions of overloaded constants on sets have to be replaced by
5390 definitions on => and bool.
5392 - Some definitions of overloaded operators on sets can now be proved
5393 using the definitions of the operators on => and bool. Therefore,
5394 the following theorems have been renamed:
5396 subset_def -> subset_eq
5397 psubset_def -> psubset_eq
5398 set_diff_def -> set_diff_eq
5399 Compl_def -> Compl_eq
5400 Sup_set_def -> Sup_set_eq
5401 Inf_set_def -> Inf_set_eq
5402 sup_set_def -> sup_set_eq
5403 inf_set_def -> inf_set_eq
5405 - Due to the incompleteness of the HO unification algorithm, some
5406 rules such as subst may require manual instantiation, if some of
5407 the unknowns in the rule is a set.
5409 - Higher order unification and forward proofs:
5412 have "P (S::'a set)" <...>
5413 then have "EX S. P S" ..
5415 no longer works (due to the incompleteness of the HO unification
5416 algorithm) and must be replaced by the pattern
5423 - Calculational reasoning with subst (or similar rules):
5426 have "P (S::'a set)" <...>
5427 also have "S = T" <...>
5428 finally have "P T" .
5430 no longer works (for similar reasons as the previous example) and
5431 must be replaced by something like
5433 have "P (S::'a set)" <...>
5434 moreover have "S = T" <...>
5435 ultimately have "P T" by simp
5437 - Tactics or packages written in ML code:
5438 Code performing pattern matching on types via
5440 Type ("set", [T]) => ...
5442 must be rewritten. Moreover, functions like strip_type or
5443 binder_types no longer return the right value when applied to a
5446 T1 => ... => Tn => U => bool
5450 T1 => ... => Tn => U set
5452 * Merged theories Wellfounded_Recursion, Accessible_Part and
5453 Wellfounded_Relations to theory Wellfounded.
5455 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5457 * Class finite no longer treats UNIV as class parameter. Use class
5458 enum from theory Library/Enum instead to achieve a similar effect.
5461 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5462 and "Cons". INCOMPATIBILITY.
5464 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5465 Potential INCOMPATIBILITY.
5467 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5468 injective_fst_snd removed, use split_eta and prod_eqI instead.
5469 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5471 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5472 the same name in theory Orderings:
5482 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5483 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5484 and different variable names.
5486 * Library/Option_ord.thy: Canonical order on option type.
5488 * Library/RBT.thy: Red-black trees, an efficient implementation of
5491 * Library/Countable.thy: Type class for countable types.
5493 * Theory Int: The representation of numerals has changed. The infix
5494 operator BIT and the bit datatype with constructors B0 and B1 have
5495 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5496 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5497 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5500 * Theory Nat: definition of <= and < on natural numbers no longer
5501 depend on well-founded relations. INCOMPATIBILITY. Definitions
5502 le_def and less_def have disappeared. Consider lemmas not_less
5503 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5505 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5506 (whose purpose mainly is for various fold_set functionals) have been
5507 abandoned in favor of the existing algebraic classes
5508 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5509 lower_semilattice (resp. upper_semilattice) and linorder.
5512 * Theory Transitive_Closure: induct and cases rules now declare proper
5513 case_names ("base" and "step"). INCOMPATIBILITY.
5515 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5516 lattices. The form set-specific version is available as
5517 Inductive.lfp_ordinal_induct_set.
5519 * Renamed theorems "power.simps" to "power_int.simps".
5522 * Class semiring_div provides basic abstract properties of semirings
5523 with division and modulo operations. Subsumes former class dvd_mod.
5525 * Merged theories IntDef, Numeral and IntArith into unified theory
5526 Int. INCOMPATIBILITY.
5528 * Theory Library/Code_Index: type "index" now represents natural
5529 numbers rather than integers. INCOMPATIBILITY.
5531 * New class "uminus" with operation "uminus" (split of from class
5532 "minus" which now only has operation "minus", binary).
5535 * Constants "card", "internal_split", "option_map" now with authentic
5536 syntax. INCOMPATIBILITY.
5538 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5539 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5540 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5541 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5542 Sup_set_def, le_def, less_def, option_map_def now with object
5543 equality. INCOMPATIBILITY.
5545 * Records. Removed K_record, and replaced it by pure lambda term
5546 %x. c. The simplifier setup is now more robust against eta expansion.
5547 INCOMPATIBILITY: in cases explicitly referring to K_record.
5549 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5551 * Library/ListVector: new theory of arithmetic vector operations.
5553 * Library/Order_Relation: new theory of various orderings as sets of
5554 pairs. Defines preorders, partial orders, linear orders and
5555 well-orders on sets and on types.
5560 * Renamed some theories to allow to loading both ZF and HOL in the
5563 Datatype -> Datatype_ZF
5564 Inductive -> Inductive_ZF
5571 INCOMPATIBILITY: ZF theories that import individual theories below
5572 Main might need to be adapted. Regular theory Main is still
5573 available, as trivial extension of Main_ZF.
5578 * ML within Isar: antiquotation @{const name} or @{const
5579 name(typargs)} produces statically-checked Const term.
5581 * Functor NamedThmsFun: data is available to the user as dynamic fact
5582 (of the same name). Removed obsolete print command.
5584 * Removed obsolete "use_legacy_bindings" function.
5586 * The ``print mode'' is now a thread-local value derived from a global
5587 template (the former print_mode reference), thus access becomes
5588 non-critical. The global print_mode reference is for session
5589 management only; user-code should use print_mode_value,
5590 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5592 * Functions system/system_out provide a robust way to invoke external
5593 shell commands, with propagation of interrupts (requires Poly/ML
5594 5.2.1). Do not use OS.Process.system etc. from the basis library!
5599 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5600 in accordance with Proof General 3.7, which prefers GNU emacs.
5602 * isatool tty runs Isabelle process with plain tty interaction;
5603 optional line editor may be specified via ISABELLE_LINE_EDITOR
5604 setting, the default settings attempt to locate "ledit" and "rlwrap".
5606 * isatool browser now works with Cygwin as well, using general
5607 "javapath" function defined in Isabelle process environment.
5609 * YXML notation provides a simple and efficient alternative to
5610 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5611 isatool yxml as described in the Isabelle system manual.
5613 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5614 provides general wrapper for managing an Isabelle process in a robust
5615 fashion, with ``cooked'' output from stdin/stderr.
5617 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5618 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5620 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5621 way of changing the user's settings is via
5622 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5625 * Multithreading.max_threads := 0 refers to the number of actual CPU
5626 cores of the underlying machine, which is a good starting point for
5627 optimal performance tuning. The corresponding usedir option -M allows
5628 "max" as an alias for "0". WARNING: does not work on certain versions
5629 of Mac OS (with Poly/ML 5.1).
5631 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5632 adverse effect of Isabelle flooding interactive front-ends (notably
5633 ProofGeneral / XEmacs).
5637 New in Isabelle2007 (November 2007)
5638 -----------------------------------
5642 * More uniform information about legacy features, notably a
5643 warning/error of "Legacy feature: ...", depending on the state of the
5644 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5645 legacy features will disappear eventually.
5647 * Theory syntax: the header format ``theory A = B + C:'' has been
5648 discontinued in favour of ``theory A imports B C begin''. Use isatool
5649 fixheaders to convert existing theory files. INCOMPATIBILITY.
5651 * Theory syntax: the old non-Isar theory file format has been
5652 discontinued altogether. Note that ML proof scripts may still be used
5653 with Isar theories; migration is usually quite simple with the ML
5654 function use_legacy_bindings. INCOMPATIBILITY.
5656 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5657 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5660 * Theory loader: be more serious about observing the static theory
5661 header specifications (including optional directories), but not the
5662 accidental file locations of previously successful loads. The strict
5663 update policy of former update_thy is now already performed by
5664 use_thy, so the former has been removed; use_thys updates several
5665 theories simultaneously, just as 'imports' within a theory header
5666 specification, but without merging the results. Potential
5667 INCOMPATIBILITY: may need to refine theory headers and commands
5668 ROOT.ML which depend on load order.
5670 * Theory loader: optional support for content-based file
5671 identification, instead of the traditional scheme of full physical
5672 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5673 (cf. the system manual). The new scheme allows to work with
5674 non-finished theories in persistent session images, such that source
5675 files may be moved later on without requiring reloads.
5677 * Theory loader: old-style ML proof scripts being *attached* to a thy
5678 file (with the same base name as the theory) are considered a legacy
5679 feature, which will disappear eventually. Even now, the theory loader
5680 no longer maintains dependencies on such files.
5682 * Syntax: the scope for resolving ambiguities via type-inference is
5683 now limited to individual terms, instead of whole simultaneous
5684 specifications as before. This greatly reduces the complexity of the
5685 syntax module and improves flexibility by separating parsing and
5686 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5687 'fixes' etc.) are required in rare situations.
5689 * Syntax: constants introduced by new-style packages ('definition',
5690 'abbreviation' etc.) are passed through the syntax module in
5691 ``authentic mode''. This means that associated mixfix annotations
5692 really stick to such constants, independently of potential name space
5693 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5694 trees are represented slightly differently, may need to adapt syntax
5695 translations accordingly. Use CONST marker in 'translations' and
5696 @{const_syntax} antiquotation in 'parse_translation' etc.
5698 * Legacy goal package: reduced interface to the bare minimum required
5699 to keep existing proof scripts running. Most other user-level
5700 functions are now part of the OldGoals structure, which is *not* open
5701 by default (consider isatool expandshort before open OldGoals).
5702 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5703 these tend to cause confusion about the actual goal (!) context being
5704 used here, which is not necessarily the same as the_context().
5706 * Command 'find_theorems': supports "*" wild-card in "name:"
5707 criterion; "with_dups" option. Certain ProofGeneral versions might
5708 support a specific search form (see ProofGeneral/CHANGES).
5710 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5711 by default, which means that "prems" (and also "fixed variables") are
5712 suppressed from proof state output. Note that the ProofGeneral
5713 settings mechanism allows to change and save options persistently, but
5714 older versions of Isabelle will fail to start up if a negative prems
5717 * Local theory targets may be specified by non-nested blocks of
5718 ``context/locale/class ... begin'' followed by ``end''. The body may
5719 contain definitions, theorems etc., including any derived mechanism
5720 that has been implemented on top of these primitives. This concept
5721 generalizes the existing ``theorem (in ...)'' towards more versatility
5724 * Proof General interface: proper undo of final 'end' command;
5725 discontinued Isabelle/classic mode (ML proof scripts).
5728 *** Document preparation ***
5730 * Added antiquotation @{theory name} which prints the given name,
5731 after checking that it refers to a valid ancestor theory in the
5734 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5735 check the given source text as ML type/structure, printing verbatim.
5737 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5738 "c args == rhs" given in the current context. (Any number of
5739 arguments may be given on the LHS.)
5744 * The 'class' package offers a combination of axclass and locale to
5745 achieve Haskell-like type classes in Isabelle. Definitions and
5746 theorems within a class context produce both relative results (with
5747 implicit parameters according to the locale context), and polymorphic
5748 constants with qualified polymorphism (according to the class
5749 context). Within the body context of a 'class' target, a separate
5750 syntax layer ("user space type system") takes care of converting
5751 between global polymorphic consts and internal locale representation.
5752 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5753 "isatool doc classes" provides a tutorial.
5755 * Generic code generator framework allows to generate executable
5756 code for ML and Haskell (including Isabelle classes). A short usage
5759 internal compilation:
5760 export_code <list of constants (term syntax)> in SML
5761 writing SML code to a file:
5762 export_code <list of constants (term syntax)> in SML <filename>
5763 writing OCaml code to a file:
5764 export_code <list of constants (term syntax)> in OCaml <filename>
5765 writing Haskell code to a bunch of files:
5766 export_code <list of constants (term syntax)> in Haskell <filename>
5768 evaluating closed propositions to True/False using code generation:
5771 Reasonable default setup of framework in HOL.
5773 Theorem attributs for selecting and transforming function equations theorems:
5775 [code fun]: select a theorem as function equation for a specific constant
5776 [code fun del]: deselect a theorem as function equation for a specific constant
5777 [code inline]: select an equation theorem for unfolding (inlining) in place
5778 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5780 User-defined serializations (target in {SML, OCaml, Haskell}):
5782 code_const <and-list of constants (term syntax)>
5783 {(target) <and-list of const target syntax>}+
5785 code_type <and-list of type constructors>
5786 {(target) <and-list of type target syntax>}+
5788 code_instance <and-list of instances>
5790 where instance ::= <type constructor> :: <class>
5792 code_class <and_list of classes>
5793 {(target) <and-list of class target syntax>}+
5794 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5796 code_instance and code_class only are effective to target Haskell.
5798 For example usage see src/HOL/ex/Codegenerator.thy and
5799 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5800 generation from Isabelle/HOL theories is available via "isatool doc
5803 * Code generator: consts in 'consts_code' Isar commands are now
5804 referred to by usual term syntax (including optional type
5807 * Command 'no_translations' removes translation rules from theory
5810 * Overloaded definitions are now actually checked for acyclic
5811 dependencies. The overloading scheme is slightly more general than
5812 that of Haskell98, although Isabelle does not demand an exact
5813 correspondence to type class and instance declarations.
5814 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5815 exotic versions of overloading -- at the discretion of the user!
5817 Polymorphic constants are represented via type arguments, i.e. the
5818 instantiation that matches an instance against the most general
5819 declaration given in the signature. For example, with the declaration
5820 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5821 as c(nat). Overloading is essentially simultaneous structural
5822 recursion over such type arguments. Incomplete specification patterns
5823 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5824 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5825 Command 'print_theory' outputs the normalized system of recursive
5826 equations, see section "definitions".
5828 * Configuration options are maintained within the theory or proof
5829 context (with name and type bool/int/string), providing a very simple
5830 interface to a poor-man's version of general context data. Tools may
5831 declare options in ML (e.g. using Attrib.config_int) and then refer to
5832 these values using Config.get etc. Users may change options via an
5833 associated attribute of the same name. This form of context
5834 declaration works particularly well with commands 'declare' or
5835 'using', for example ``declare [[foo = 42]]''. Thus it has become
5836 very easy to avoid global references, which would not observe Isar
5837 toplevel undo/redo and fail to work with multithreading.
5839 Various global ML references of Pure and HOL have been turned into
5840 configuration options:
5842 Unify.search_bound unify_search_bound
5843 Unify.trace_bound unify_trace_bound
5844 Unify.trace_simp unify_trace_simp
5845 Unify.trace_types unify_trace_types
5846 Simplifier.simp_depth_limit simp_depth_limit
5847 Blast.depth_limit blast_depth_limit
5848 DatatypeProp.dtK datatype_distinctness_limit
5849 fast_arith_neq_limit fast_arith_neq_limit
5850 fast_arith_split_limit fast_arith_split_limit
5852 * Named collections of theorems may be easily installed as context
5853 data using the functor NamedThmsFun (see also
5854 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5855 attributes; there is also a toplevel print command. This facility is
5856 just a common case of general context data, which is the preferred way
5857 for anything more complex than just a list of facts in canonical
5860 * Isar: command 'declaration' augments a local theory by generic
5861 declaration functions written in ML. This enables arbitrary content
5862 being added to the context, depending on a morphism that tells the
5863 difference of the original declaration context wrt. the application
5864 context encountered later on.
5866 * Isar: proper interfaces for simplification procedures. Command
5867 'simproc_setup' declares named simprocs (with match patterns, and body
5868 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5869 context. ML antiquotation @{simproc name} retrieves named simprocs.
5871 * Isar: an extra pair of brackets around attribute declarations
5872 abbreviates a theorem reference involving an internal dummy fact,
5873 which will be ignored later --- only the effect of the attribute on
5874 the background context will persist. This form of in-place
5875 declarations is particularly useful with commands like 'declare' and
5876 'using', for example ``have A using [[simproc a]] by simp''.
5878 * Isar: method "assumption" (and implicit closing of subproofs) now
5879 takes simple non-atomic goal assumptions into account: after applying
5880 an assumption as a rule the resulting subgoals are solved by atomic
5881 assumption steps. This is particularly useful to finish 'obtain'
5882 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5883 without referring to the original premise "!!x. P x ==> thesis" in the
5884 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5887 * Isar: implicit use of prems from the Isar proof context is
5888 considered a legacy feature. Common applications like ``have A .''
5889 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5890 referencing facts explicitly here improves readability and
5891 maintainability of proof texts.
5893 * Isar: improper proof element 'guess' is like 'obtain', but derives
5894 the obtained context from the course of reasoning! For example:
5896 assume "EX x y. A x & B y" -- "any previous fact"
5897 then guess x and y by clarify
5899 This technique is potentially adventurous, depending on the facts and
5900 proof tools being involved here.
5902 * Isar: known facts from the proof context may be specified as literal
5903 propositions, using ASCII back-quote syntax. This works wherever
5904 named facts used to be allowed so far, in proof commands, proof
5905 methods, attributes etc. Literal facts are retrieved from the context
5906 according to unification of type and term parameters. For example,
5907 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5908 theorems in the current context, then these are valid literal facts:
5909 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5911 There is also a proof method "fact" which does the same composition
5912 for explicit goal states, e.g. the following proof texts coincide with
5913 certain special cases of literal facts:
5915 have "A" by fact == note `A`
5916 have "A ==> B" by fact == note `A ==> B`
5917 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5918 have "P a ==> Q a" by fact == note `P a ==> Q a`
5920 * Isar: ":" (colon) is no longer a symbolic identifier character in
5921 outer syntax. Thus symbolic identifiers may be used without
5922 additional white space in declarations like this: ``assume *: A''.
5924 * Isar: 'print_facts' prints all local facts of the current context,
5925 both named and unnamed ones.
5927 * Isar: 'def' now admits simultaneous definitions, e.g.:
5929 def x == "t" and y == "u"
5931 * Isar: added command 'unfolding', which is structurally similar to
5932 'using', but affects both the goal state and facts by unfolding given
5933 rewrite rules. Thus many occurrences of the 'unfold' method or
5934 'unfolded' attribute may be replaced by first-class proof text.
5936 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5937 and command 'unfolding' now all support object-level equalities
5938 (potentially conditional). The underlying notion of rewrite rule is
5939 analogous to the 'rule_format' attribute, but *not* that of the
5940 Simplifier (which is usually more generous).
5942 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5943 premises of a theorem by n. Useful in conjunction with drule.
5945 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5946 method expression within a sandbox consisting of the first N
5947 sub-goals, which need to exist. For example, ``simp_all [3]''
5948 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5949 simplifies all new goals that emerge from applying rule foo to the
5950 originally first one.
5952 * Isar: schematic goals are no longer restricted to higher-order
5953 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5956 * Isar: the conclusion of a long theorem statement is now either
5957 'shows' (a simultaneous conjunction, as before), or 'obtains'
5958 (essentially a disjunction of cases with local parameters and
5959 assumptions). The latter allows to express general elimination rules
5960 adequately; in this notation common elimination rules look like this:
5962 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5964 obtains x where "P x"
5966 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5970 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5976 The subsequent classical rules even refer to the formal "thesis"
5979 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5982 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5983 obtains "thesis ==> something"
5985 The actual proof of an 'obtains' statement is analogous to that of the
5986 Isar proof element 'obtain', only that there may be several cases.
5987 Optional case names may be specified in parentheses; these will be
5988 available both in the present proof and as annotations in the
5989 resulting rule, for later use with the 'cases' method (cf. attribute
5992 * Isar: the assumptions of a long theorem statement are available as
5993 "assms" fact in the proof context. This is more appropriate than the
5994 (historical) "prems", which refers to all assumptions of the current
5995 context, including those from the target locale, proof body etc.
5997 * Isar: 'print_statement' prints theorems from the current theory or
5998 proof context in long statement form, according to the syntax of a
6001 * Isar: 'obtain' takes an optional case name for the local context
6002 introduction rule (default "that").
6004 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6005 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6008 * Pure: syntax "CONST name" produces a fully internalized constant
6009 according to the current context. This is particularly useful for
6010 syntax translations that should refer to internal constant
6011 representations independently of name spaces.
6013 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6014 instead of "FOO ". This allows multiple binder declarations to coexist
6015 in the same context. INCOMPATIBILITY.
6017 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6018 primitive that also works in a locale context (both for constants and
6019 fixed variables). Type declaration and internal syntactic representation
6020 of given constants retrieved from the context. Likewise, the
6021 'no_notation' command allows to remove given syntax annotations from the
6024 * Isar/locales: new derived specification elements 'axiomatization',
6025 'definition', 'abbreviation', which support type-inference, admit
6026 object-level specifications (equality, equivalence). See also the
6027 isar-ref manual. Examples:
6030 eq (infix "===" 50) where
6031 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6033 definition "f x y = x + y + 1"
6034 definition g where "g x = f x x"
6037 neq (infix "=!=" 50) where
6038 "x =!= y == ~ (x === y)"
6040 These specifications may be also used in a locale context. Then the
6041 constants being introduced depend on certain fixed parameters, and the
6042 constant name is qualified by the locale base name. An internal
6043 abbreviation takes care for convenient input and output, making the
6044 parameters implicit and using the original short name. See also
6045 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6046 entities from a monomorphic theory.
6048 Presently, abbreviations are only available 'in' a target locale, but
6049 not inherited by general import expressions. Also note that
6050 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6051 'translations' in common applications. The "no_abbrevs" print mode
6052 prevents folding of abbreviations in term output.
6054 Concrete syntax is attached to specified constants in internal form,
6055 independently of name spaces. The parse tree representation is
6056 slightly different -- use 'notation' instead of raw 'syntax', and
6057 'translations' with explicit "CONST" markup to accommodate this.
6059 * Pure/Isar: unified syntax for new-style specification mechanisms
6060 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6061 full type inference and dummy patterns ("_"). For example:
6063 definition "K x _ = x"
6065 inductive conj for A B
6066 where "A ==> B ==> conj A B"
6068 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6069 the current context. Print mode "no_abbrevs" prevents inversion of
6070 abbreviations on output.
6072 * Isar/locales: improved parameter handling: use of locales "var" and
6073 "struct" no longer necessary; - parameter renamings are no longer
6074 required to be injective. For example, this allows to define
6075 endomorphisms as locale endom = homom mult mult h.
6077 * Isar/locales: changed the way locales with predicates are defined.
6078 Instead of accumulating the specification, the imported expression is
6079 now an interpretation. INCOMPATIBILITY: different normal form of
6080 locale expressions. In particular, in interpretations of locales with
6081 predicates, goals repesenting already interpreted fragments are not
6082 removed automatically. Use methods `intro_locales' and
6083 `unfold_locales'; see below.
6085 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6086 provide backward reasoning on locales predicates. The methods are
6087 aware of interpretations and discharge corresponding goals.
6088 `intro_locales' is less aggressive then `unfold_locales' and does not
6089 unfold predicates to assumptions.
6091 * Isar/locales: the order in which locale fragments are accumulated
6092 has changed. This enables to override declarations from fragments due
6093 to interpretations -- for example, unwanted simp rules.
6095 * Isar/locales: interpretation in theories and proof contexts has been
6096 extended. One may now specify (and prove) equations, which are
6097 unfolded in interpreted theorems. This is useful for replacing
6098 defined concepts (constants depending on locale parameters) by
6099 concepts already existing in the target context. Example:
6101 interpretation partial_order ["op <= :: [int, int] => bool"]
6102 where "partial_order.less (op <=) (x::int) y = (x < y)"
6104 Typically, the constant `partial_order.less' is created by a
6105 definition specification element in the context of locale
6108 * Method "induct": improved internal context management to support
6109 local fixes and defines on-the-fly. Thus explicit meta-level
6110 connectives !! and ==> are rarely required anymore in inductive goals
6111 (using object-logic connectives for this purpose has been long
6112 obsolete anyway). Common proof patterns are explained in
6113 src/HOL/Induct/Common_Patterns.thy, see also
6114 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6117 * Method "induct": improved handling of simultaneous goals. Instead of
6118 introducing object-level conjunction, the statement is now split into
6119 several conclusions, while the corresponding symbolic cases are nested
6120 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6121 see src/HOL/Induct/Common_Patterns.thy, for example.
6123 * Method "induct": mutual induction rules are now specified as a list
6124 of rule sharing the same induction cases. HOL packages usually provide
6125 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6126 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6127 mutual induction rules differently, i.e. like this:
6129 (induct rule: foo_bar.inducts)
6130 (induct set: foo bar)
6131 (induct pred: foo bar)
6132 (induct type: foo bar)
6134 The ML function ProjectRule.projections turns old-style rules into the
6137 * Method "coinduct": dual of induction, see
6138 src/HOL/Library/Coinductive_List.thy for various examples.
6140 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6141 considered a legacy feature.
6143 * Attribute "symmetric" produces result with standardized schematic
6144 variables (index 0). Potential INCOMPATIBILITY.
6146 * Simplifier: by default the simplifier trace only shows top level
6147 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6148 default. Thus there is less danger of being flooded by the trace. The
6149 trace indicates where parts have been suppressed.
6151 * Provers/classical: removed obsolete classical version of elim_format
6152 attribute; classical elim/dest rules are now treated uniformly when
6153 manipulating the claset.
6155 * Provers/classical: stricter checks to ensure that supplied intro,
6156 dest and elim rules are well-formed; dest and elim rules must have at
6159 * Provers/classical: attributes dest/elim/intro take an optional
6160 weight argument for the rule (just as the Pure versions). Weights are
6161 ignored by automated tools, but determine the search order of single
6164 * Syntax: input syntax now supports dummy variable binding "%_. b",
6165 where the body does not mention the bound variable. Note that dummy
6166 patterns implicitly depend on their context of bounds, which makes
6167 "{_. _}" match any set comprehension as expected. Potential
6168 INCOMPATIBILITY -- parse translations need to cope with syntactic
6169 constant "_idtdummy" in the binding position.
6171 * Syntax: removed obsolete syntactic constant "_K" and its associated
6172 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6173 for example "A -> B" => "Pi A (%_. B)".
6175 * Pure: 'class_deps' command visualizes the subclass relation, using
6176 the graph browser tool.
6178 * Pure: 'print_theory' now suppresses certain internal declarations by
6179 default; use '!' option for full details.
6184 * Method "metis" proves goals by applying the Metis general-purpose
6185 resolution prover (see also http://gilith.com/software/metis/).
6186 Examples are in the directory MetisExamples. WARNING: the
6187 Isabelle/HOL-Metis integration does not yet work properly with
6190 * Command 'sledgehammer' invokes external automatic theorem provers as
6191 background processes. It generates calls to the "metis" method if
6192 successful. These can be pasted into the proof. Users do not have to
6193 wait for the automatic provers to return. WARNING: does not really
6194 work with multi-threading.
6196 * New "auto_quickcheck" feature tests outermost goal statements for
6197 potential counter-examples. Controlled by ML references
6198 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6199 5000 milliseconds). Fails silently if statements is outside of
6200 executable fragment, or any other codgenerator problem occurs.
6202 * New constant "undefined" with axiom "undefined x = undefined".
6204 * Added class "HOL.eq", allowing for code generation with polymorphic
6207 * Some renaming of class constants due to canonical name prefixing in
6208 the new 'class' package:
6210 HOL.abs ~> HOL.abs_class.abs
6211 HOL.divide ~> HOL.divide_class.divide
6212 0 ~> HOL.zero_class.zero
6213 1 ~> HOL.one_class.one
6214 op + ~> HOL.plus_class.plus
6215 op - ~> HOL.minus_class.minus
6216 uminus ~> HOL.minus_class.uminus
6217 op * ~> HOL.times_class.times
6218 op < ~> HOL.ord_class.less
6219 op <= > HOL.ord_class.less_eq
6220 Nat.power ~> Power.power_class.power
6221 Nat.size ~> Nat.size_class.size
6222 Numeral.number_of ~> Numeral.number_class.number_of
6223 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6224 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6225 Orderings.min ~> Orderings.ord_class.min
6226 Orderings.max ~> Orderings.ord_class.max
6227 Divides.op div ~> Divides.div_class.div
6228 Divides.op mod ~> Divides.div_class.mod
6229 Divides.op dvd ~> Divides.div_class.dvd
6231 INCOMPATIBILITY. Adaptions may be required in the following cases:
6233 a) User-defined constants using any of the names "plus", "minus",
6234 "times", "less" or "less_eq". The standard syntax translations for
6235 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6238 b) Variables named "plus", "minus", "times", "less", "less_eq"
6239 INCOMPATIBILITY: use more specific names.
6241 c) Permutative equations (e.g. "a + b = b + a")
6242 Since the change of names also changes the order of terms, permutative
6243 rewrite rules may get applied in a different order. Experience shows
6244 that this is rarely the case (only two adaptions in the whole Isabelle
6245 distribution). INCOMPATIBILITY: rewrite proofs
6247 d) ML code directly refering to constant names
6248 This in general only affects hand-written proof tactics, simprocs and
6249 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6250 Consider using @{const_name} antiquotation.
6252 * New class "default" with associated constant "default".
6254 * Function "sgn" is now overloaded and available on int, real, complex
6255 (and other numeric types), using class "sgn". Two possible defs of
6256 sgn are given as equational assumptions in the classes sgn_if and
6257 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6260 * Locale "partial_order" now unified with class "order" (cf. theory
6261 Orderings), added parameter "less". INCOMPATIBILITY.
6263 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6264 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6265 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6267 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6268 changed order of proof goals in instance proofs.
6270 * The transitivity reasoner for partial and linear orders is set up
6271 for classes "order" and "linorder". Instances of the reasoner are available
6272 in all contexts importing or interpreting the corresponding locales.
6273 Method "order" invokes the reasoner separately; the reasoner
6274 is also integrated with the Simplifier as a solver. Diagnostic
6275 command 'print_orders' shows the available instances of the reasoner
6276 in the current context.
6278 * Localized monotonicity predicate in theory "Orderings"; integrated
6279 lemmas max_of_mono and min_of_mono with this predicate.
6282 * Formulation of theorem "dense" changed slightly due to integration
6283 with new class dense_linear_order.
6285 * Uniform lattice theory development in HOL.
6287 constants "meet" and "join" now named "inf" and "sup"
6288 constant "Meet" now named "Inf"
6290 classes "meet_semilorder" and "join_semilorder" now named
6291 "lower_semilattice" and "upper_semilattice"
6292 class "lorder" now named "lattice"
6293 class "comp_lat" now named "complete_lattice"
6295 Instantiation of lattice classes allows explicit definitions
6296 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6298 INCOMPATIBILITY. Theorem renames:
6300 meet_left_le ~> inf_le1
6301 meet_right_le ~> inf_le2
6302 join_left_le ~> sup_ge1
6303 join_right_le ~> sup_ge2
6304 meet_join_le ~> inf_sup_ord
6307 le_meet ~> le_inf_iff
6308 le_join ~> ge_sup_conv
6309 meet_idempotent ~> inf_idem
6310 join_idempotent ~> sup_idem
6311 meet_comm ~> inf_commute
6312 join_comm ~> sup_commute
6313 meet_leI1 ~> le_infI1
6314 meet_leI2 ~> le_infI2
6315 le_joinI1 ~> le_supI1
6316 le_joinI2 ~> le_supI2
6317 meet_assoc ~> inf_assoc
6318 join_assoc ~> sup_assoc
6319 meet_left_comm ~> inf_left_commute
6320 meet_left_idempotent ~> inf_left_idem
6321 join_left_comm ~> sup_left_commute
6322 join_left_idempotent ~> sup_left_idem
6325 le_def_meet ~> le_iff_inf
6326 le_def_join ~> le_iff_sup
6327 join_absorp2 ~> sup_absorb2
6328 join_absorp1 ~> sup_absorb1
6329 meet_absorp1 ~> inf_absorb1
6330 meet_absorp2 ~> inf_absorb2
6331 meet_join_absorp ~> inf_sup_absorb
6332 join_meet_absorp ~> sup_inf_absorb
6333 distrib_join_le ~> distrib_sup_le
6334 distrib_meet_le ~> distrib_inf_le
6336 add_meet_distrib_left ~> add_inf_distrib_left
6337 add_join_distrib_left ~> add_sup_distrib_left
6338 is_join_neg_meet ~> is_join_neg_inf
6339 is_meet_neg_join ~> is_meet_neg_sup
6340 add_meet_distrib_right ~> add_inf_distrib_right
6341 add_join_distrib_right ~> add_sup_distrib_right
6342 add_meet_join_distribs ~> add_sup_inf_distribs
6343 join_eq_neg_meet ~> sup_eq_neg_inf
6344 meet_eq_neg_join ~> inf_eq_neg_sup
6345 add_eq_meet_join ~> add_eq_inf_sup
6346 meet_0_imp_0 ~> inf_0_imp_0
6347 join_0_imp_0 ~> sup_0_imp_0
6348 meet_0_eq_0 ~> inf_0_eq_0
6349 join_0_eq_0 ~> sup_0_eq_0
6350 neg_meet_eq_join ~> neg_inf_eq_sup
6351 neg_join_eq_meet ~> neg_sup_eq_inf
6352 join_eq_if ~> sup_eq_if
6354 mono_meet ~> mono_inf
6355 mono_join ~> mono_sup
6356 meet_bool_eq ~> inf_bool_eq
6357 join_bool_eq ~> sup_bool_eq
6358 meet_fun_eq ~> inf_fun_eq
6359 join_fun_eq ~> sup_fun_eq
6360 meet_set_eq ~> inf_set_eq
6361 join_set_eq ~> sup_set_eq
6362 meet1_iff ~> inf1_iff
6363 meet2_iff ~> inf2_iff
6372 join1_iff ~> sup1_iff
6373 join2_iff ~> sup2_iff
6383 is_meet_Meet ~> is_meet_Inf
6384 Meet_bool_def ~> Inf_bool_def
6385 Meet_fun_def ~> Inf_fun_def
6386 Meet_greatest ~> Inf_greatest
6387 Meet_lower ~> Inf_lower
6388 Meet_set_def ~> Inf_set_def
6391 Sup_bool_eq ~> Sup_bool_def
6392 Sup_fun_eq ~> Sup_fun_def
6393 Sup_set_eq ~> Sup_set_def
6395 listsp_meetI ~> listsp_infI
6396 listsp_meet_eq ~> listsp_inf_eq
6401 * Added syntactic class "size"; overloaded constant "size" now has
6402 type "'a::size ==> bool"
6404 * Internal reorganisation of `size' of datatypes: size theorems
6405 "foo.size" are no longer subsumed by "foo.simps" (but are still
6406 simplification rules by default!); theorems "prod.size" now named
6409 * Class "div" now inherits from class "times" rather than "type".
6412 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6413 Linorder etc. have disappeared; operations defined in terms of
6414 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6416 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6418 * HOL-Word: New extensive library and type for generic, fixed size
6419 machine words, with arithmetic, bit-wise, shifting and rotating
6420 operations, reflection into int, nat, and bool lists, automation for
6421 linear arithmetic (by automatic reflection into nat or int), including
6422 lemmas on overflow and monotonicity. Instantiated to all appropriate
6423 arithmetic type classes, supporting automatic simplification of
6424 numerals on all operations.
6426 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6428 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6430 * Code generator library theories:
6431 - Code_Integer represents HOL integers by big integer literals in target
6433 - Code_Char represents HOL characters by character literals in target
6435 - Code_Char_chr like Code_Char, but also offers treatment of character
6436 codes; includes Code_Integer.
6437 - Executable_Set allows to generate code for finite sets using lists.
6438 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6440 - Executable_Real implements a subset of real numbers, namly those
6441 representable by rational numbers.
6442 - Efficient_Nat implements natural numbers by integers, which in general will
6443 result in higher efficency; pattern matching with 0/Suc is eliminated;
6444 includes Code_Integer.
6445 - Code_Index provides an additional datatype index which is mapped to
6446 target-language built-in integers.
6447 - Code_Message provides an additional datatype message_string which is isomorphic to
6448 strings; messages are mapped to target-language strings.
6450 * New package for inductive predicates
6452 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6455 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6456 for z_1 :: U_1 and ... and z_n :: U_m
6458 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6461 with full support for type-inference, rather than
6463 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6465 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6466 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6468 inductive "s z_1 ... z_m"
6470 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6473 For backward compatibility, there is a wrapper allowing inductive
6474 sets to be defined with the new package via
6477 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6478 for z_1 :: U_1 and ... and z_n :: U_m
6480 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6486 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6487 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6488 for z_1 :: U_1 and ... and z_n :: U_m
6490 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6491 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6494 if the additional syntax "p ..." is required.
6496 Numerous examples can be found in the subdirectories src/HOL/Auth,
6497 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6501 - Since declaration and definition of inductive sets or predicates
6502 is no longer separated, abbreviations involving the newly
6503 introduced sets or predicates must be specified together with the
6504 introduction rules after the 'where' keyword (see above), rather
6505 than before the actual inductive definition.
6507 - The variables in induction and elimination rules are now
6508 quantified in the order of their occurrence in the introduction
6509 rules, rather than in alphabetical order. Since this may break
6510 some proofs, these proofs either have to be repaired, e.g. by
6511 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6512 statements of the form
6514 case (rule_i a_i_1 ... a_i_{k_i})
6516 or the old order of quantification has to be restored by explicitly adding
6517 meta-level quantifiers in the introduction rules, i.e.
6519 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6521 - The format of the elimination rules is now
6523 p z_1 ... z_m x_1 ... x_n ==>
6524 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6529 (x_1, ..., x_n) : s z_1 ... z_m ==>
6530 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6533 for sets rather than
6535 x : s z_1 ... z_m ==>
6536 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6539 This may require terms in goals to be expanded to n-tuples
6540 (e.g. using case_tac or simplification with the split_paired_all
6541 rule) before the above elimination rule is applicable.
6543 - The elimination or case analysis rules for (mutually) inductive
6544 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6545 list of rules "p_1_..._p_k.elims" is no longer available.
6547 * New package "function"/"fun" for general recursive functions,
6548 supporting mutual and nested recursion, definitions in local contexts,
6549 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6550 for small examples, and the separate tutorial on the function
6551 package. The old recdef "package" is still available as before, but
6552 users are encouraged to use the new package.
6554 * Method "lexicographic_order" automatically synthesizes termination
6555 relations as lexicographic combinations of size measures.
6557 * Case-expressions allow arbitrary constructor-patterns (including
6558 "_") and take their order into account, like in functional
6559 programming. Internally, this is translated into nested
6560 case-expressions; missing cases are added and mapped to the predefined
6561 constant "undefined". In complicated cases printing may no longer show
6562 the original input but the internal form. Lambda-abstractions allow
6563 the same form of pattern matching: "% pat1 => e1 | ..." is an
6564 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6567 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6568 is an abbreviation for "of_nat :: nat => int". The simplification
6569 rules for "of_nat" have been changed to work like "int" did
6570 previously. Potential INCOMPATIBILITY:
6571 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6572 - of_nat_diff and of_nat_mult are no longer default simp rules
6574 * Method "algebra" solves polynomial equations over (semi)rings using
6575 Groebner bases. The (semi)ring structure is defined by locales and the
6576 tool setup depends on that generic context. Installing the method for
6577 a specific type involves instantiating the locale and possibly adding
6578 declarations for computation on the coefficients. The method is
6579 already instantiated for natural numbers and for the axiomatic class
6580 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6581 CALCULEMUS 2007 for the general principles underlying this
6582 architecture of context-aware proof-tools.
6584 * Method "ferrack" implements quantifier elimination over
6585 special-purpose dense linear orders using locales (analogous to
6586 "algebra"). The method is already installed for class
6587 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6590 * Former constant "List.op @" now named "List.append". Use ML
6591 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6592 circumvent possible incompatibilities when working on ML level.
6594 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6596 * New function listsum :: 'a list => 'a for arbitrary monoids.
6597 Special syntax: "SUM x <- xs. f x" (and latex variants)
6599 * New syntax for Haskell-like list comprehension (input only), eg.
6600 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6602 * The special syntax for function "filter" has changed from [x :
6603 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6604 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6606 * [a..b] is now defined for arbitrary linear orders. It used to be
6607 defined on nat only, as an abbreviation for [a..<Suc b]
6610 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6612 * New functions "sorted" and "sort" in src/HOL/List.thy.
6614 * New lemma collection field_simps (an extension of ring_simps) for
6615 manipulating (in)equations involving division. Multiplies with all
6616 denominators that can be proved to be non-zero (in equations) or
6617 positive/negative (in inequations).
6619 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6620 have been improved and renamed to ring_simps, group_simps and
6621 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6622 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6624 * Theory Library/Commutative_Ring: switched from recdef to function
6625 package; constants add, mul, pow now curried. Infix syntax for
6626 algebraic operations.
6628 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6631 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6634 * HOL/records: generalised field-update to take a function on the
6635 field rather than the new value: r(|A := x|) is translated to A_update
6636 (K x) r The K-combinator that is internally used is called K_record.
6637 INCOMPATIBILITY: Usage of the plain update functions has to be
6640 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6641 * x = 0, which are required for a semiring. Richer structures do not
6642 inherit from semiring_0 anymore, because this property is a theorem
6643 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6644 there is more to prove, but this is mostly trivial.
6646 * Class "recpower" is generalized to arbitrary monoids, not just
6647 commutative semirings. INCOMPATIBILITY: may need to incorporate
6648 commutativity or semiring properties additionally.
6650 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6651 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6652 better use 'abbreviation'.
6654 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6656 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6657 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6658 significant changes for setting up numeral syntax for types:
6659 - New constants Numeral.pred and Numeral.succ instead
6660 of former Numeral.bin_pred and Numeral.bin_succ.
6661 - Use integer operations instead of bin_add, bin_mult and so on.
6662 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6663 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6665 See src/HOL/Integ/IntArith.thy for an example setup.
6667 * Command 'normal_form' computes the normal form of a term that may
6668 contain free variables. For example ``normal_form "rev [a, b, c]"''
6669 produces ``[b, c, a]'' (without proof). This command is suitable for
6670 heavy-duty computations because the functions are compiled to ML
6671 first. Correspondingly, a method "normalization" is provided. See
6672 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6674 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6675 25 like -->); output depends on the "iff" print_mode, the default is
6676 "A = B" (with priority 50).
6678 * Relations less (<) and less_eq (<=) are also available on type bool.
6679 Modified syntax to disallow nesting without explicit parentheses,
6680 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6683 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6685 * Relation composition operator "op O" now has precedence 75 and binds
6686 stronger than union and intersection. INCOMPATIBILITY.
6688 * The old set interval syntax "{m..n(}" (and relatives) has been
6689 removed. Use "{m..<n}" (and relatives) instead.
6691 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6692 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6693 ``declare [[simproc del: neq]]''.
6695 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6698 * Theorem Cons_eq_map_conv no longer declared as "simp".
6700 * Theorem setsum_mult renamed to setsum_right_distrib.
6702 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6705 * Reimplemented methods "sat" and "satx", with several improvements:
6706 goals no longer need to be stated as "<prems> ==> False", equivalences
6707 (i.e. "=" on type bool) are handled, variable names of the form
6708 "lit_<n>" are no longer reserved, significant speedup.
6710 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6711 zChaff is still supported as well.
6713 * 'inductive' and 'datatype': provide projections of mutual rules,
6714 bundled as foo_bar.inducts;
6716 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6719 * Library: moved theory Accessible_Part to main HOL.
6721 * Library: added theory Coinductive_List of potentially infinite lists
6722 as greatest fixed-point.
6724 * Library: added theory AssocList which implements (finite) maps as
6727 * Method "evaluation" solves goals (i.e. a boolean expression)
6728 efficiently by compiling it to ML. The goal is "proved" (via an
6729 oracle) if it evaluates to True.
6731 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6732 also when invoked by the simplifier. This results in the Simplifier
6733 being more powerful on arithmetic goals. INCOMPATIBILITY.
6734 Configuration option fast_arith_split_limit=0 recovers the old
6737 * Support for hex (0x20) and binary (0b1001) numerals.
6739 * New method: reify eqs (t), where eqs are equations for an
6740 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6741 parameter, computes a term s::'b and a list xs::'a list and proves the
6742 theorem I xs s = t. This is also known as reification or quoting. The
6743 resulting theorem is applied to the subgoal to substitute t with I xs
6744 s. If t is omitted, the subgoal itself is reified.
6746 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6747 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6748 where f is supposed to be a computable function (in the sense of code
6749 generattion). The method uses reify to compute s and xs as above then
6750 applies corr_thm and uses normalization by evaluation to "prove" f s =
6751 r and finally gets the theorem t = r, which is again applied to the
6752 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6754 * Reflection: Automatic reification now handels binding, an example is
6755 available in src/HOL/ex/ReflectionEx.thy
6757 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6758 command 'statespace' that is similar to 'record', but introduces an
6759 abstract specification based on the locale infrastructure instead of
6760 HOL types. This leads to extra flexibility in composing state spaces,
6761 in particular multiple inheritance and renaming of components.
6766 * Hyperreal: Functions root and sqrt are now defined on negative real
6767 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6768 Nonnegativity side conditions have been removed from many lemmas, so
6769 that more subgoals may now be solved by simplification; potential
6772 * Real: new type classes formalize real normed vector spaces and
6773 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6774 and norm :: 'a => real.
6776 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6777 reals into other types. The overloaded constant Reals :: 'a set is now
6778 defined as range of_real; potential INCOMPATIBILITY.
6780 * Real: proper support for ML code generation, including 'quickcheck'.
6781 Reals are implemented as arbitrary precision rationals.
6783 * Hyperreal: Several constants that previously worked only for the
6784 reals have been generalized, so they now work over arbitrary vector
6785 spaces. Type annotations may need to be added in some cases; potential
6788 Infinitesimal :: ('a::real_normed_vector) star set
6789 HFinite :: ('a::real_normed_vector) star set
6790 HInfinite :: ('a::real_normed_vector) star set
6791 approx :: ('a::real_normed_vector) star => 'a star => bool
6792 monad :: ('a::real_normed_vector) star => 'a star set
6793 galaxy :: ('a::real_normed_vector) star => 'a star set
6794 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6795 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6796 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6797 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6798 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6799 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6800 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6801 sgn :: 'a::real_normed_vector => 'a
6802 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6804 * Complex: Some complex-specific constants are now abbreviations for
6805 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6806 hnorm. Other constants have been entirely removed in favor of the
6807 polymorphic versions (INCOMPATIBILITY):
6811 HInfinite <-- CInfinite
6812 Infinitesimal <-- CInfinitesimal
6815 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6816 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6817 (ns)deriv <-- (ns)cderiv
6822 * Formalisation of ideals and the quotient construction over rings.
6824 * Order and lattice theory no longer based on records.
6827 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6828 greatest_closed. INCOMPATIBILITY.
6830 * Method algebra is now set up via an attribute. For examples see
6831 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6832 of algebraic structures.
6834 * Renamed theory CRing to Ring.
6839 * Substantial, yet incomplete support for nominal datatypes (binding
6840 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6841 src/HOL/Nominal/Examples. Prospective users should consult
6842 http://isabelle.in.tum.de/nominal/
6847 * ML basics: just one true type int, which coincides with IntInf.int
6850 * ML within Isar: antiquotations allow to embed statically-checked
6851 formal entities in the source, referring to the context available at
6852 compile-time. For example:
6854 ML {* @{sort "{zero,one}"} *}
6855 ML {* @{typ "'a => 'b"} *}
6856 ML {* @{term "%x. x"} *}
6857 ML {* @{prop "x == y"} *}
6858 ML {* @{ctyp "'a => 'b"} *}
6859 ML {* @{cterm "%x. x"} *}
6860 ML {* @{cprop "x == y"} *}
6861 ML {* @{thm asm_rl} *}
6862 ML {* @{thms asm_rl} *}
6863 ML {* @{type_name c} *}
6864 ML {* @{type_syntax c} *}
6865 ML {* @{const_name c} *}
6866 ML {* @{const_syntax c} *}
6869 ML {* @{theory Pure} *}
6870 ML {* @{theory_ref} *}
6871 ML {* @{theory_ref Pure} *}
6874 ML {* @{clasimpset} *}
6876 The same works for sources being ``used'' within an Isar context.
6878 * ML in Isar: improved error reporting; extra verbosity with
6879 ML_Context.trace enabled.
6881 * Pure/General/table.ML: the join operations now works via exceptions
6882 DUP/SAME instead of type option. This is simpler in simple cases, and
6883 admits slightly more efficient complex applications.
6885 * Pure: 'advanced' translation functions (parse_translation etc.) now
6886 use Context.generic instead of just theory.
6888 * Pure: datatype Context.generic joins theory/Proof.context and
6889 provides some facilities for code that works in either kind of
6890 context, notably GenericDataFun for uniform theory and proof data.
6892 * Pure: simplified internal attribute type, which is now always
6893 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6894 local (Proof.context) attributes have been discontinued, while
6895 minimizing code duplication. Thm.rule_attribute and
6896 Thm.declaration_attribute build canonical attributes; see also structure
6897 Context for further operations on Context.generic, notably
6898 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6899 declarations and definitions.
6901 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6902 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6903 init only required for impure data. INCOMPATIBILITY: empty really need
6904 to be empty (no dependencies on theory content!)
6906 * Pure/kernel: consts certification ignores sort constraints given in
6907 signature declarations. (This information is not relevant to the
6908 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6909 potential INCOMPATIBILITY.
6911 * Pure: axiomatic type classes are now purely definitional, with
6912 explicit proofs of class axioms and super class relations performed
6913 internally. See Pure/axclass.ML for the main internal interfaces --
6914 notably AxClass.define_class supercedes AxClass.add_axclass, and
6915 AxClass.axiomatize_class/classrel/arity supersede
6916 Sign.add_classes/classrel/arities.
6918 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6919 global/local versions on theory vs. Proof.context have been
6920 discontinued; Attrib.syntax and Method.syntax have been adapted
6921 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6922 attributes, methods, etc.
6924 * Pure: several functions of signature "... -> theory -> theory * ..."
6925 have been reoriented to "... -> theory -> ... * theory" in order to
6926 allow natural usage in combination with the ||>, ||>>, |-> and
6927 fold_map combinators.
6929 * Pure: official theorem names (closed derivations) and additional
6930 comments (tags) are now strictly separate. Name hints -- which are
6931 maintained as tags -- may be attached any time without affecting the
6934 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6935 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6936 achieve the old behaviour.
6938 * Pure: the "Goal" constant is now called "prop", supporting a
6939 slightly more general idea of ``protecting'' meta-level rule
6942 * Pure: Logic.(un)varify only works in a global context, which is now
6943 enforced instead of silently assumed. INCOMPATIBILITY, may use
6944 Logic.legacy_(un)varify as temporary workaround.
6946 * Pure: structure Name provides scalable operations for generating
6947 internal variable names, notably Name.variants etc. This replaces
6948 some popular functions from term.ML:
6950 Term.variant -> Name.variant
6951 Term.variantlist -> Name.variant_list
6952 Term.invent_names -> Name.invent_list
6954 Note that low-level renaming rarely occurs in new code -- operations
6955 from structure Variable are used instead (see below).
6957 * Pure: structure Variable provides fundamental operations for proper
6958 treatment of fixed/schematic variables in a context. For example,
6959 Variable.import introduces fixes for schematics of given facts and
6960 Variable.export reverses the effect (up to renaming) -- this replaces
6961 various freeze_thaw operations.
6963 * Pure: structure Goal provides simple interfaces for
6964 init/conclude/finish and tactical prove operations (replacing former
6965 Tactic.prove). Goal.prove is the canonical way to prove results
6966 within a given context; Goal.prove_global is a degraded version for
6967 theory level goals, including a global Drule.standard. Note that
6968 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6969 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6970 in a locale context).
6972 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6973 and type checking (Syntax.check_term etc.), with common combinations
6974 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6975 which are considered legacy and await removal.
6977 * Pure/Syntax: generic interfaces for type unchecking
6978 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6979 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6980 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6981 available for convenience, but refer to the very same operations using
6982 a mere theory instead of a full context.
6984 * Isar: simplified treatment of user-level errors, using exception
6985 ERROR of string uniformly. Function error now merely raises ERROR,
6986 without any side effect on output channels. The Isar toplevel takes
6987 care of proper display of ERROR exceptions. ML code may use plain
6988 handle/can/try; cat_error may be used to concatenate errors like this:
6990 ... handle ERROR msg => cat_error msg "..."
6992 Toplevel ML code (run directly or through the Isar toplevel) may be
6993 embedded into the Isar toplevel with exception display/debug like
6996 Isar.toplevel (fn () => ...)
6998 INCOMPATIBILITY, removed special transform_error facilities, removed
6999 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7000 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7001 -- use plain ERROR instead.
7003 * Isar: theory setup now has type (theory -> theory), instead of a
7004 list. INCOMPATIBILITY, may use #> to compose setup functions.
7006 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7007 ProofContext.debug/verbose flags.
7009 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7010 theory before entering a proof state. Transactions now always see a
7011 quasi-functional intermediate checkpoint, both in interactive and
7014 * Isar: simplified interfaces for outer syntax. Renamed
7015 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7016 OuterSyntax.add_parsers -- this functionality is now included in
7017 OuterSyntax.command etc. INCOMPATIBILITY.
7019 * Simplifier: the simpset of a running simplification process now
7020 contains a proof context (cf. Simplifier.the_context), which is the
7021 very context that the initial simpset has been retrieved from (by
7022 simpset_of/local_simpset_of). Consequently, all plug-in components
7023 (solver, looper etc.) may depend on arbitrary proof data.
7025 * Simplifier.inherit_context inherits the proof context (plus the
7026 local bounds) of the current simplification process; any simproc
7027 etc. that calls the Simplifier recursively should do this! Removed
7028 former Simplifier.inherit_bounds, which is already included here --
7029 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7030 specify an explicit context using Simplifier.context/theory_context.
7032 * Simplifier/Classical Reasoner: more abstract interfaces
7033 change_simpset/claset for modifying the simpset/claset reference of a
7034 theory; raw versions simpset/claset_ref etc. have been discontinued --
7037 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7043 * settings: the default heap location within ISABELLE_HOME_USER now
7044 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7045 Isabelle installations.
7047 * isabelle-process: option -S (secure mode) disables some critical
7048 operations, notably runtime compilation and evaluation of ML source
7051 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7053 * Support for parallel execution, using native multicore support of
7054 Poly/ML 5.1. The theory loader exploits parallelism when processing
7055 independent theories, according to the given theory header
7056 specifications. The maximum number of worker threads is specified via
7057 usedir option -M or the "max-threads" setting in Proof General. A
7058 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7059 to 6 on a 8-core machine. User-code needs to observe certain
7060 guidelines for thread-safe programming, see appendix A in the Isar
7061 Implementation manual.
7065 New in Isabelle2005 (October 2005)
7066 ----------------------------------
7070 * Theory headers: the new header syntax for Isar theories is
7073 imports <theory1> ... <theoryN>
7074 uses <file1> ... <fileM>
7077 where the 'uses' part is optional. The previous syntax
7079 theory <name> = <theory1> + ... + <theoryN>:
7081 will disappear in the next release. Use isatool fixheaders to convert
7082 existing theory files. Note that there is no change in ancient
7083 non-Isar theories now, but these will disappear soon.
7085 * Theory loader: parent theories can now also be referred to via
7086 relative and absolute paths.
7088 * Command 'find_theorems' searches for a list of criteria instead of a
7089 list of constants. Known criteria are: intro, elim, dest, name:string,
7090 simp:term, and any term. Criteria can be preceded by '-' to select
7091 theorems that do not match. Intro, elim, dest select theorems that
7092 match the current goal, name:s selects theorems whose fully qualified
7093 name contain s, and simp:term selects all simplification rules whose
7094 lhs match term. Any other term is interpreted as pattern and selects
7095 all theorems matching the pattern. Available in ProofGeneral under
7096 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7098 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7100 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7101 matching the current goal as introduction rule and not having "HOL."
7102 in their name (i.e. not being defined in theory HOL).
7104 * Command 'thms_containing' has been discontinued in favour of
7105 'find_theorems'; INCOMPATIBILITY.
7107 * Communication with Proof General is now 8bit clean, which means that
7108 Unicode text in UTF-8 encoding may be used within theory texts (both
7109 formal and informal parts). Cf. option -U of the Isabelle Proof
7110 General interface. Here are some simple examples (cf. src/HOL/ex):
7112 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7113 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7115 * Improved efficiency of the Simplifier and, to a lesser degree, the
7116 Classical Reasoner. Typical big applications run around 2 times
7120 *** Document preparation ***
7122 * Commands 'display_drafts' and 'print_drafts' perform simple output
7123 of raw sources. Only those symbols that do not require additional
7124 LaTeX packages (depending on comments in isabellesym.sty) are
7125 displayed properly, everything else is left verbatim. isatool display
7126 and isatool print are used as front ends (these are subject to the
7127 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7129 * Command tags control specific markup of certain regions of text,
7130 notably folding and hiding. Predefined tags include "theory" (for
7131 theory begin and end), "proof" for proof commands, and "ML" for
7132 commands involving ML code; the additional tags "visible" and
7133 "invisible" are unused by default. Users may give explicit tag
7134 specifications in the text, e.g. ''by %invisible (auto)''. The
7135 interpretation of tags is determined by the LaTeX job during document
7136 preparation: see option -V of isatool usedir, or options -n and -t of
7137 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7140 Several document versions may be produced at the same time via isatool
7141 usedir (the generated index.html will link all of them). Typical
7142 specifications include ''-V document=theory,proof,ML'' to present
7143 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7144 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7145 these parts without any formal replacement text. The Isabelle site
7146 default settings produce ''document'' and ''outline'' versions as
7149 * Several new antiquotations:
7151 @{term_type term} prints a term with its type annotated;
7153 @{typeof term} prints the type of a term;
7155 @{const const} is the same as @{term const}, but checks that the
7156 argument is a known logical constant;
7158 @{term_style style term} and @{thm_style style thm} print a term or
7159 theorem applying a "style" to it
7163 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7164 definitions, equations, inequations etc., 'concl' printing only the
7165 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7166 to print the specified premise. TermStyle.add_style provides an ML
7167 interface for introducing further styles. See also the "LaTeX Sugar"
7168 document practical applications. The ML antiquotation prints
7169 type-checked ML expressions verbatim.
7171 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7172 and 'text' support optional locale specification '(in loc)', which
7173 specifies the default context for interpreting antiquotations. For
7174 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7176 * Option 'locale=NAME' of antiquotations specifies an alternative
7177 context interpreting the subsequent argument. For example: @{thm
7178 [locale=lattice] inf_assoc}.
7180 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7183 * Proper output of antiquotations for theory commands involving a
7184 proof context (such as 'locale' or 'theorem (in loc) ...').
7186 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7187 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7189 * isatool usedir: new option -C (default true) controls whether option
7190 -D should include a copy of the original document directory; -C false
7191 prevents unwanted effects such as copying of administrative CVS data.
7196 * Considerably improved version of 'constdefs' command. Now performs
7197 automatic type-inference of declared constants; additional support for
7198 local structure declarations (cf. locales and HOL records), see also
7199 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7200 sequential dependencies of definitions within a single 'constdefs'
7201 section; moreover, the declared name needs to be an identifier. If
7202 all fails, consider to fall back on 'consts' and 'defs' separately.
7204 * Improved indexed syntax and implicit structures. First of all,
7205 indexed syntax provides a notational device for subscripted
7206 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7207 expressions. Secondly, in a local context with structure
7208 declarations, number indexes \<^sub>n or the empty index (default
7209 number 1) refer to a certain fixed variable implicitly; option
7210 show_structs controls printing of implicit structures. Typical
7211 applications of these concepts involve record types and locales.
7213 * New command 'no_syntax' removes grammar declarations (and
7214 translations) resulting from the given syntax specification, which is
7215 interpreted in the same manner as for the 'syntax' command.
7217 * 'Advanced' translation functions (parse_translation etc.) may depend
7218 on the signature of the theory context being presently used for
7219 parsing/printing, see also isar-ref manual.
7221 * Improved 'oracle' command provides a type-safe interface to turn an
7222 ML expression of type theory -> T -> term into a primitive rule of
7223 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7224 is already included here); see also FOL/ex/IffExample.thy;
7227 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7228 before); "cI" is no longer bound, use "c.intro" instead.
7229 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7230 axclasses vs. locales.
7232 * Improved internal renaming of symbolic identifiers -- attach primes
7233 instead of base 26 numbers.
7235 * New flag show_question_marks controls printing of leading question
7236 marks in schematic variable names.
7238 * In schematic variable names, *any* symbol following \<^isub> or
7239 \<^isup> is now treated as part of the base name. For example, the
7240 following works without printing of awkward ".0" indexes:
7242 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7245 * Inner syntax includes (*(*nested*) comments*).
7247 * Pretty printer now supports unbreakable blocks, specified in mixfix
7248 annotations as "(00...)".
7250 * Clear separation of logical types and nonterminals, where the latter
7251 may only occur in 'syntax' specifications or type abbreviations.
7252 Before that distinction was only partially implemented via type class
7253 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7254 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7255 exotic syntax specifications may require further adaption
7256 (e.g. Cube/Cube.thy).
7258 * Removed obsolete type class "logic", use the top sort {} instead.
7259 Note that non-logical types should be declared as 'nonterminals'
7260 rather than 'types'. INCOMPATIBILITY for new object-logic
7263 * Attributes 'induct' and 'cases': type or set names may now be
7264 locally fixed variables as well.
7266 * Simplifier: can now control the depth to which conditional rewriting
7267 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7270 * Simplifier: simplification procedures may now take the current
7271 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7272 interface), which is very useful for calling the Simplifier
7273 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7274 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7275 low-level mk_simproc no longer applies Logic.varify internally, to
7276 allow for use in a context of fixed variables.
7278 * thin_tac now works even if the assumption being deleted contains !!
7279 or ==>. More generally, erule now works even if the major premise of
7280 the elimination rule contains !! or ==>.
7282 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7284 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7285 from Pure, which contains all common declarations already. Both
7286 theories are defined via plain Isabelle/Isar .thy files.
7287 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7288 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7289 use isatool fixcpure to adapt your theory and ML sources.
7291 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7292 selections of theorems in named facts via index ranges.
7294 * 'print_theorems': in theory mode, really print the difference
7295 wrt. the last state (works for interactive theory development only),
7296 in proof mode print all local facts (cf. 'print_facts');
7298 * 'hide': option '(open)' hides only base names.
7300 * More efficient treatment of intermediate checkpoints in interactive
7303 * Code generator is now invoked via code_module (incremental code
7304 generation) and code_library (modular code generation, ML structures
7305 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7306 must be quoted when used as identifiers.
7308 * New 'value' command for reading, evaluating and printing terms using
7309 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7310 quoted when used as identifier.
7315 * New commands for the interpretation of locale expressions in
7316 theories (1), locales (2) and proof contexts (3). These generate
7317 proof obligations from the expression specification. After the
7318 obligations have been discharged, theorems of the expression are added
7319 to the theory, target locale or proof context. The synopsis of the
7320 commands is a follows:
7322 (1) interpretation expr inst
7323 (2) interpretation target < expr
7324 (3) interpret expr inst
7326 Interpretation in theories and proof contexts require a parameter
7327 instantiation of terms from the current context. This is applied to
7328 specifications and theorems of the interpreted expression.
7329 Interpretation in locales only permits parameter renaming through the
7330 locale expression. Interpretation is smart in that interpretations
7331 that are active already do not occur in proof obligations, neither are
7332 instantiated theorems stored in duplicate. Use 'print_interps' to
7333 inspect active interpretations of a particular locale. For details,
7334 see the Isar Reference manual. Examples can be found in
7335 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7337 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7338 'interpret' instead.
7340 * New context element 'constrains' for adding type constraints to
7343 * Context expressions: renaming of parameters with syntax
7346 * Locale declaration: 'includes' disallowed.
7348 * Proper static binding of attribute syntax -- i.e. types / terms /
7349 facts mentioned as arguments are always those of the locale definition
7350 context, independently of the context of later invocations. Moreover,
7351 locale operations (renaming and type / term instantiation) are applied
7352 to attribute arguments as expected.
7354 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7355 actual attributes; rare situations may require Attrib.attribute to
7356 embed those attributes into Attrib.src that lack concrete syntax.
7357 Attribute implementations need to cooperate properly with the static
7358 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7359 Attrib.XXX_thm etc. already do the right thing without further
7360 intervention. Only unusual applications -- such as "where" or "of"
7361 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7362 on the context and the facts involved -- may have to assign parsed
7363 values to argument tokens explicitly.
7365 * Changed parameter management in theorem generation for long goal
7366 statements with 'includes'. INCOMPATIBILITY: produces a different
7367 theorem statement in rare situations.
7369 * Locale inspection command 'print_locale' omits notes elements. Use
7370 'print_locale!' to have them included in the output.
7375 * Provers/hypsubst.ML: improved version of the subst method, for
7376 single-step rewriting: it now works in bound variable contexts. New is
7377 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7378 rewrite a different subterm than the original subst method, which is
7379 still available as 'simplesubst'.
7381 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7384 * Provers/trancl.ML: new transitivity reasoner for transitive and
7385 reflexive-transitive closure of relations.
7387 * Provers/blast.ML: new reference depth_limit to make blast's depth
7388 limit (previously hard-coded with a value of 20) user-definable.
7390 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7391 is peformed already. Object-logics merely need to finish their
7392 initial simpset configuration as before. INCOMPATIBILITY.
7397 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7400 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7402 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7403 and x-symbol; use option '-m epsilon' to get it actually printed.
7404 Moreover, the mathematically important symbolic identifier \<epsilon>
7405 becomes available as variable, constant etc. INCOMPATIBILITY,
7407 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7408 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7409 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7410 support corresponding Isar calculations.
7412 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7415 * theory SetInterval: changed the syntax for open intervals:
7424 The old syntax is still supported but will disappear in the next
7425 release. For conversion use the following Emacs search and replace
7426 patterns (these are not perfect but work quite well):
7428 {)\([^\.]*\)\.\. -> {\1<\.\.}
7429 \.\.\([^(}]*\)(} -> \.\.<\1}
7431 * Theory Commutative_Ring (in Library): method comm_ring for proving
7432 equalities in commutative rings; method 'algebra' provides a generic
7435 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7436 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7437 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7440 Some new syntax forms are available:
7442 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7443 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7444 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7445 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7447 The latter form "\<Sum>x < k. e" used to be based on a separate
7448 function "Summation", which has been discontinued.
7450 * theory Finite_Set: in structured induction proofs, the insert case
7451 is now 'case (insert x F)' instead of the old counterintuitive 'case
7454 * The 'refute' command has been extended to support a much larger
7455 fragment of HOL, including axiomatic type classes, constdefs and
7456 typedefs, inductive datatypes and recursion.
7458 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7459 Requires zChaff with proof generation to be installed. See
7460 HOL/ex/SAT_Examples.thy for examples.
7462 * Datatype induction via method 'induct' now preserves the name of the
7463 induction variable. For example, when proving P(xs::'a list) by
7464 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7465 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7466 in unstructured proof scripts.
7468 * Reworked implementation of records. Improved scalability for
7469 records with many fields, avoiding performance problems for type
7470 inference. Records are no longer composed of nested field types, but
7471 of nested extension types. Therefore the record type only grows linear
7472 in the number of extensions and not in the number of fields. The
7473 top-level (users) view on records is preserved. Potential
7474 INCOMPATIBILITY only in strange cases, where the theory depends on the
7475 old record representation. The type generated for a record is called
7476 <record_name>_ext_type.
7478 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7479 proofs triggered by a record definition or a simproc (if
7480 quick_and_dirty is enabled). Definitions of large records can take
7483 New simproc record_upd_simproc for simplification of multiple record
7484 updates enabled by default. Moreover, trivial updates are also
7485 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7486 occasionally, since simplification is more powerful by default.
7488 * typedef: proper support for polymorphic sets, which contain extra
7489 type-variables in the term.
7491 * Simplifier: automatically reasons about transitivity chains
7492 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7493 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7494 old proofs break occasionally as simplification may now solve more
7495 goals than previously.
7497 * Simplifier: converts x <= y into x = y if assumption y <= x is
7498 present. Works for all partial orders (class "order"), in particular
7499 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7502 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7503 bound variable or a constant then the let is unfolded. Otherwise
7504 first a is simplified to b, and then f b is simplified to g. If
7505 possible we abstract b from g arriving at "let x = b in h x",
7506 otherwise we unfold the let and arrive at g. The simproc can be
7507 enabled/disabled by the reference use_let_simproc. Potential
7508 INCOMPATIBILITY since simplification is more powerful by default.
7510 * Classical reasoning: the meson method now accepts theorems as arguments.
7512 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7513 jobs to provide advice on the provability of subgoals.
7515 * Theory OrderedGroup and Ring_and_Field: various additions and
7516 improvements to faciliate calculations involving equalities and
7519 The following theorems have been eliminated or modified
7522 abs_eq now named abs_of_nonneg
7523 abs_of_ge_0 now named abs_of_nonneg
7524 abs_minus_eq now named abs_of_nonpos
7525 imp_abs_id now named abs_of_nonneg
7526 imp_abs_neg_id now named abs_of_nonpos
7527 mult_pos now named mult_pos_pos
7528 mult_pos_le now named mult_nonneg_nonneg
7529 mult_pos_neg_le now named mult_nonneg_nonpos
7530 mult_pos_neg2_le now named mult_nonneg_nonpos2
7531 mult_neg now named mult_neg_neg
7532 mult_neg_le now named mult_nonpos_nonpos
7534 * The following lemmas in Ring_and_Field have been added to the simplifier:
7537 not_square_less_zero
7539 The following lemmas have been deleted from Real/RealPow:
7549 * Theory Parity: added rules for simplifying exponents.
7553 The following theorems have been eliminated or modified
7556 list_all_Nil now named list_all.simps(1)
7557 list_all_Cons now named list_all.simps(2)
7558 list_all_conv now named list_all_iff
7559 set_mem_eq now named mem_iff
7561 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7562 asymptotic "big O" calculations. See the notes in BigO.thy.
7567 * Theory RealDef: better support for embedding natural numbers and
7568 integers in the reals.
7570 The following theorems have been eliminated or modified
7573 exp_ge_add_one_self now requires no hypotheses
7574 real_of_int_add reversed direction of equality (use [symmetric])
7575 real_of_int_minus reversed direction of equality (use [symmetric])
7576 real_of_int_diff reversed direction of equality (use [symmetric])
7577 real_of_int_mult reversed direction of equality (use [symmetric])
7579 * Theory RComplete: expanded support for floor and ceiling functions.
7581 * Theory Ln is new, with properties of the natural logarithm
7583 * Hyperreal: There is a new type constructor "star" for making
7584 nonstandard types. The old type names are now type synonyms:
7588 hcomplex = complex star
7590 * Hyperreal: Many groups of similarly-defined constants have been
7591 replaced by polymorphic versions (INCOMPATIBILITY):
7593 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7595 starset <-- starsetNat, starsetC
7596 *s* <-- *sNat*, *sc*
7597 starset_n <-- starsetNat_n, starsetC_n
7598 *sn* <-- *sNatn*, *scn*
7599 InternalSets <-- InternalNatSets, InternalCSets
7601 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7602 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7603 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7604 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7605 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7607 * Hyperreal: Many type-specific theorems have been removed in favor of
7608 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7610 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7611 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7612 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7613 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7614 right_minus <-- hypreal_add_minus
7615 left_minus <-- {hypreal,hcomplex}_add_minus_left
7616 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7617 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7618 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7619 mult_1_right <-- hcomplex_mult_one_right
7620 mult_zero_left <-- hcomplex_mult_zero_left
7621 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7622 right_distrib <-- hypnat_add_mult_distrib2
7623 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7624 right_inverse <-- hypreal_mult_inverse
7625 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7626 order_refl <-- {hypreal,hypnat}_le_refl
7627 order_trans <-- {hypreal,hypnat}_le_trans
7628 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7629 order_less_le <-- {hypreal,hypnat}_less_le
7630 linorder_linear <-- {hypreal,hypnat}_le_linear
7631 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7632 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7633 add_nonneg_nonneg <-- hypreal_le_add_order
7635 * Hyperreal: Separate theorems having to do with type-specific
7636 versions of constants have been merged into theorems that apply to the
7637 new polymorphic constants (INCOMPATIBILITY):
7639 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7640 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7641 STAR_Un <-- {STAR,NatStar,STARC}_Un
7642 STAR_Int <-- {STAR,NatStar,STARC}_Int
7643 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7644 STAR_subset <-- {STAR,NatStar,STARC}_subset
7645 STAR_mem <-- {STAR,NatStar,STARC}_mem
7646 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7647 STAR_diff <-- {STAR,STARC}_diff
7648 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7649 STARC_hcomplex_of_complex}_image_subset
7650 starset_n_Un <-- starset{Nat,C}_n_Un
7651 starset_n_Int <-- starset{Nat,C}_n_Int
7652 starset_n_Compl <-- starset{Nat,C}_n_Compl
7653 starset_n_diff <-- starset{Nat,C}_n_diff
7654 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7655 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7656 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7657 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7658 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7659 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7660 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7661 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7662 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7663 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7664 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7665 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7666 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7667 starfun_diff <-- starfun{C,RC,CR}_diff
7668 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7669 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7670 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7671 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7672 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7673 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7674 starfun_Id <-- starfunC_Id
7675 starfun_approx <-- starfun{Nat,CR}_approx
7676 starfun_capprox <-- starfun{C,RC}_capprox
7677 starfun_abs <-- starfunNat_rabs
7678 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7679 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7680 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7681 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7682 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7683 starfun_add_approx <-- starfunCR_add_approx
7684 starfun_inverse_inverse <-- starfunC_inverse_inverse
7685 starfun_divide <-- starfun{C,CR,RC}_divide
7686 starfun_n <-- starfun{Nat,C}_n
7687 starfun_n_mult <-- starfun{Nat,C}_n_mult
7688 starfun_n_add <-- starfun{Nat,C}_n_add
7689 starfun_n_add_minus <-- starfunNat_n_add_minus
7690 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7691 starfun_n_minus <-- starfun{Nat,C}_n_minus
7692 starfun_n_eq <-- starfun{Nat,C}_n_eq
7694 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7695 star_n_minus <-- {hypreal,hcomplex}_minus
7696 star_n_diff <-- {hypreal,hcomplex}_diff
7697 star_n_mult <-- {hypreal,hcomplex}_mult
7698 star_n_inverse <-- {hypreal,hcomplex}_inverse
7699 star_n_le <-- {hypreal,hypnat}_le
7700 star_n_less <-- {hypreal,hypnat}_less
7701 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7702 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7703 star_n_abs <-- hypreal_hrabs
7704 star_n_divide <-- hcomplex_divide
7706 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7707 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7708 star_of_diff <-- hypreal_of_real_diff
7709 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7710 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7711 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7712 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7713 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7714 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7715 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7716 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7717 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7718 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7719 star_of_number_of <-- {hypreal,hcomplex}_number_of
7720 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7721 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7722 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7723 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7724 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7725 star_of_power <-- hypreal_of_real_power
7726 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7728 * Hyperreal: new method "transfer" that implements the transfer
7729 principle of nonstandard analysis. With a subgoal that mentions
7730 nonstandard types like "'a star", the command "apply transfer"
7731 replaces it with an equivalent one that mentions only standard types.
7732 To be successful, all free variables must have standard types; non-
7733 standard variables must have explicit universal quantifiers.
7735 * Hyperreal: A theory of Taylor series.
7740 * Discontinued special version of 'constdefs' (which used to support
7741 continuous functions) in favor of the general Pure one with full
7744 * New simplification procedure for solving continuity conditions; it
7745 is much faster on terms with many nested lambda abstractions (cubic
7746 instead of exponential time).
7748 * New syntax for domain package: selector names are now optional.
7749 Parentheses should be omitted unless argument is lazy, for example:
7751 domain 'a stream = cons "'a" (lazy "'a stream")
7753 * New command 'fixrec' for defining recursive functions with pattern
7754 matching; defining multiple functions with mutual recursion is also
7755 supported. Patterns may include the constants cpair, spair, up, sinl,
7756 sinr, or any data constructor defined by the domain package. The given
7757 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7758 syntax and examples.
7760 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7761 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7762 but the proof obligation additionally includes an admissibility
7763 requirement. The packages generate instances of class cpo or pcpo,
7764 with continuity and strictness theorems for Rep and Abs.
7766 * HOLCF: Many theorems have been renamed according to a more standard naming
7767 scheme (INCOMPATIBILITY):
7769 foo_inject: "foo$x = foo$y ==> x = y"
7770 foo_eq: "(foo$x = foo$y) = (x = y)"
7771 foo_less: "(foo$x << foo$y) = (x << y)"
7772 foo_strict: "foo$UU = UU"
7773 foo_defined: "... ==> foo$x ~= UU"
7774 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7779 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7780 including the First Isomorphism Theorem (on quotienting by the kernel
7783 * ZF/Simplifier: install second copy of type solver that actually
7784 makes use of TC rules declared to Isar proof contexts (or locales);
7785 the old version is still required for ML proof scripts.
7790 * Converted to Isar theory format; use locales instead of axiomatic
7796 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7799 * Pure/library.ML no longer defines its own option datatype, but uses
7800 that of the SML basis, which has constructors NONE and SOME instead of
7801 None and Some, as well as exception Option.Option instead of OPTION.
7802 The functions the, if_none, is_some, is_none have been adapted
7803 accordingly, while Option.map replaces apsome.
7805 * Pure/library.ML: the exception LIST has been given up in favour of
7806 the standard exceptions Empty and Subscript, as well as
7807 Library.UnequalLengths. Function like Library.hd and Library.tl are
7808 superceded by the standard hd and tl functions etc.
7810 A number of basic list functions are no longer exported to the ML
7811 toplevel, as they are variants of predefined functions. The following
7812 suggests how one can translate existing code:
7814 rev_append xs ys = List.revAppend (xs, ys)
7815 nth_elem (i, xs) = List.nth (xs, i)
7816 last_elem xs = List.last xs
7817 flat xss = List.concat xss
7818 seq fs = List.app fs
7819 partition P xs = List.partition P xs
7820 mapfilter f xs = List.mapPartial f xs
7822 * Pure/library.ML: several combinators for linear functional
7823 transformations, notably reverse application and composition:
7826 (x, y) |-> f f #-> g
7828 * Pure/library.ML: introduced/changed precedence of infix operators:
7830 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7832 infix 3 o oo ooo oooo;
7833 infix 4 ~~ upto downto;
7835 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7838 * Pure/library.ML: natural list combinators fold, fold_rev, and
7839 fold_map support linear functional transformations and nesting. For
7842 fold f [x1, ..., xN] y =
7843 y |> f x1 |> ... |> f xN
7845 (fold o fold) f [xs1, ..., xsN] y =
7846 y |> fold f xs1 |> ... |> fold f xsN
7848 fold f [x1, ..., xN] =
7851 (fold o fold) f [xs1, ..., xsN] =
7852 fold f xs1 #> ... #> fold f xsN
7854 * Pure/library.ML: the following selectors on type 'a option are
7857 the: 'a option -> 'a (*partial*)
7858 these: 'a option -> 'a where 'a = 'b list
7859 the_default: 'a -> 'a option -> 'a
7860 the_list: 'a option -> 'a list
7862 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7863 basic operations for association lists, following natural argument
7864 order; moreover the explicit equality predicate passed here avoids
7865 potentially expensive polymorphic runtime equality checks.
7866 The old functions may be expressed as follows:
7868 assoc = uncurry (AList.lookup (op =))
7869 assocs = these oo AList.lookup (op =)
7870 overwrite = uncurry (AList.update (op =)) o swap
7872 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7874 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7875 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7877 replacing make_keylist and keyfilter (occassionally used)
7880 make_keylist = AList.make
7881 keyfilter = AList.find (op =)
7883 * eq_fst and eq_snd now take explicit equality parameter, thus
7884 avoiding eqtypes. Naive rewrites:
7886 eq_fst = eq_fst (op =)
7887 eq_snd = eq_snd (op =)
7889 * Removed deprecated apl and apr (rarely used).
7892 apl (n, op) =>>= curry op n
7893 apr (op, m) =>>= fn n => op (n, m)
7895 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7896 provides a reasonably efficient light-weight implementation of sets as
7899 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7900 few new operations; existing lookup and update are now curried to
7901 follow natural argument order (for use with fold etc.);
7902 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7904 * Pure/General: output via the Isabelle channels of
7905 writeln/warning/error etc. is now passed through Output.output, with a
7906 hook for arbitrary transformations depending on the print_mode
7907 (cf. Output.add_mode -- the first active mode that provides a output
7908 function wins). Already formatted output may be embedded into further
7909 text via Output.raw; the result of Pretty.string_of/str_of and derived
7910 functions (string_of_term/cterm/thm etc.) is already marked raw to
7911 accommodate easy composition of diagnostic messages etc. Programmers
7912 rarely need to care about Output.output or Output.raw at all, with
7913 some notable exceptions: Output.output is required when bypassing the
7914 standard channels (writeln etc.), or in token translations to produce
7915 properly formatted results; Output.raw is required when capturing
7916 already output material that will eventually be presented to the user
7917 a second time. For the default print mode, both Output.output and
7918 Output.raw have no effect.
7920 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7921 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7922 cumulative results are displayed at the end of a batch session.
7924 * Pure/General: File.sysify_path and File.quote_sysify path have been
7925 replaced by File.platform_path and File.shell_path (with appropriate
7926 hooks). This provides a clean interface for unusual systems where the
7927 internal and external process view of file names are different.
7929 * Pure: more efficient orders for basic syntactic entities: added
7930 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7931 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7932 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7933 orders now -- potential INCOMPATIBILITY for code that depends on a
7934 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7935 Library.sort_strings on result).
7937 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7938 fold_types traverse types/terms from left to right, observing natural
7939 argument order. Supercedes previous foldl_XXX versions, add_frees,
7940 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7942 * Pure: name spaces have been refined, with significant changes of the
7943 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7944 to extern(_table). The plain name entry path is superceded by a
7945 general 'naming' context, which also includes the 'policy' to produce
7946 a fully qualified name and external accesses of a fully qualified
7947 name; NameSpace.extend is superceded by context dependent
7948 Sign.declare_name. Several theory and proof context operations modify
7949 the naming context. Especially note Theory.restore_naming and
7950 ProofContext.restore_naming to get back to a sane state; note that
7951 Theory.add_path is no longer sufficient to recover from
7952 Theory.absolute_path in particular.
7954 * Pure: new flags short_names (default false) and unique_names
7955 (default true) for controlling output of qualified names. If
7956 short_names is set, names are printed unqualified. If unique_names is
7957 reset, the name prefix is reduced to the minimum required to achieve
7958 the original result when interning again, even if there is an overlap
7959 with earlier declarations.
7961 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7962 now 'extend', and 'merge' gets an additional Pretty.pp argument
7963 (useful for printing error messages). INCOMPATIBILITY.
7965 * Pure: major reorganization of the theory context. Type Sign.sg and
7966 Theory.theory are now identified, referring to the universal
7967 Context.theory (see Pure/context.ML). Actual signature and theory
7968 content is managed as theory data. The old code and interfaces were
7969 spread over many files and structures; the new arrangement introduces
7970 considerable INCOMPATIBILITY to gain more clarity:
7972 Context -- theory management operations (name, identity, inclusion,
7973 parents, ancestors, merge, etc.), plus generic theory data;
7975 Sign -- logical signature and syntax operations (declaring consts,
7976 types, etc.), plus certify/read for common entities;
7978 Theory -- logical theory operations (stating axioms, definitions,
7979 oracles), plus a copy of logical signature operations (consts,
7980 types, etc.); also a few basic management operations (Theory.copy,
7983 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7984 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7985 for convenience -- they merely return the theory.
7987 * Pure: type Type.tsig is superceded by theory in most interfaces.
7989 * Pure: the Isar proof context type is already defined early in Pure
7990 as Context.proof (note that ProofContext.context and Proof.context are
7991 aliases, where the latter is the preferred name). This enables other
7992 Isabelle components to refer to that type even before Isar is present.
7994 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7995 typeK, constK, axiomK, oracleK), but provide explicit operations for
7996 any of these kinds. For example, Sign.intern typeK is now
7997 Sign.intern_type, Theory.hide_space Sign.typeK is now
7998 Theory.hide_types. Also note that former
7999 Theory.hide_classes/types/consts are now
8000 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8001 internalize their arguments! INCOMPATIBILITY.
8003 * Pure: get_thm interface (of PureThy and ProofContext) expects
8004 datatype thmref (with constructors Name and NameSelection) instead of
8005 plain string -- INCOMPATIBILITY;
8007 * Pure: cases produced by proof methods specify options, where NONE
8008 means to remove case bindings -- INCOMPATIBILITY in
8011 * Pure: the following operations retrieve axioms or theorems from a
8012 theory node or theory hierarchy, respectively:
8014 Theory.axioms_of: theory -> (string * term) list
8015 Theory.all_axioms_of: theory -> (string * term) list
8016 PureThy.thms_of: theory -> (string * thm) list
8017 PureThy.all_thms_of: theory -> (string * thm) list
8019 * Pure: print_tac now outputs the goal through the trace channel.
8021 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8022 Reference Toplevel.debug (default false) controls detailed printing
8023 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8024 controls execution profiling -- set to 1 for time and 2 for space
8025 (both increase the runtime).
8027 * Isar session: The initial use of ROOT.ML is now always timed,
8028 i.e. the log will show the actual process times, in contrast to the
8029 elapsed wall-clock time that the outer shell wrapper produces.
8031 * Simplifier: improved handling of bound variables (nameless
8032 representation, avoid allocating new strings). Simprocs that invoke
8033 the Simplifier recursively should use Simplifier.inherit_bounds to
8034 avoid local name clashes. Failure to do so produces warnings
8035 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8036 for further details.
8038 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8039 bindings for all theorems stored within a given theory; this may help
8040 in porting non-Isar theories to Isar ones, while keeping ML proof
8041 scripts for the time being.
8043 * ML operator HTML.with_charset specifies the charset begin used for
8044 generated HTML files. For example:
8046 HTML.with_charset "utf-8" use_thy "Hebrew";
8047 HTML.with_charset "utf-8" use_thy "Chinese";
8052 * Allow symlinks to all proper Isabelle executables (Isabelle,
8053 isabelle, isatool etc.).
8055 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8056 isatool doc, isatool mkdir, display_drafts etc.).
8058 * isatool usedir: option -f allows specification of the ML file to be
8059 used by Isabelle; default is ROOT.ML.
8061 * New isatool version outputs the version identifier of the Isabelle
8062 distribution being used.
8064 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8065 (containing Boolean satisfiability problems) into Isabelle/HOL
8070 New in Isabelle2004 (April 2004)
8071 --------------------------------
8075 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8076 Replaces linorder.ML.
8078 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8079 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8080 (\<a>...\<z>), are now considered normal letters, and can therefore
8081 be used anywhere where an ASCII letter (a...zA...Z) has until
8082 now. COMPATIBILITY: This obviously changes the parsing of some
8083 terms, especially where a symbol has been used as a binder, say
8084 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8085 as an identifier. Fix it by inserting a space around former
8086 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8087 existing theory and ML files.
8089 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8091 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8092 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8093 a normal (but invisible) letter. For multiple letter subscripts repeat
8094 \<^isub> like this: x\<^isub>1\<^isub>2.
8096 * Pure: There are now sub-/superscripts that can span more than one
8097 character. Text between \<^bsub> and \<^esub> is set in subscript in
8098 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8099 superscript. The new control characters are not identifier parts.
8101 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8102 content of "..." to the latex file instead of \isacntrl... . The "..."
8103 may consist of any printable characters excluding the end bracket >.
8105 * Pure: Using new Isar command "finalconsts" (or the ML functions
8106 Theory.add_finals or Theory.add_finals_i) it is now possible to
8107 declare constants "final", which prevents their being given a definition
8108 later. It is useful for constants whose behaviour is fixed axiomatically
8109 rather than definitionally, such as the meta-logic connectives.
8111 * Pure: 'instance' now handles general arities with general sorts
8112 (i.e. intersections of classes),
8114 * Presentation: generated HTML now uses a CSS style sheet to make layout
8115 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8116 It can be changed to alter the colors/layout of generated pages.
8121 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8122 cut_tac, subgoal_tac and thin_tac:
8123 - Now understand static (Isar) contexts. As a consequence, users of Isar
8124 locales are no longer forced to write Isar proof scripts.
8125 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8127 - INCOMPATIBILITY: names of variables to be instantiated may no
8128 longer be enclosed in quotes. Instead, precede variable name with `?'.
8129 This is consistent with the instantiation attribute "where".
8131 * Attributes "where" and "of":
8132 - Now take type variables of instantiated theorem into account when reading
8133 the instantiation string. This fixes a bug that caused instantiated
8134 theorems to have too special types in some circumstances.
8135 - "where" permits explicit instantiations of type variables.
8137 * Calculation commands "moreover" and "also" no longer interfere with
8138 current facts ("this"), admitting arbitrary combinations with "then"
8142 - Goal statements involving the context element "includes" no longer
8143 generate theorems with internal delta predicates (those ending on
8144 "_axioms") in the premise.
8145 Resolve particular premise with <locale>.intro to obtain old form.
8146 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8147 specification and "includes" elements in goal statement.
8148 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8149 [intro?] and [elim?] (respectively) by default.
8150 - Experimental command for instantiation of locales in proof contexts:
8151 instantiate <label>[<attrs>]: <loc>
8152 Instantiates locale <loc> and adds all its theorems to the current context
8153 taking into account their attributes. Label and attrs are optional
8154 modifiers, like in theorem declarations. If present, names of
8155 instantiated theorems are qualified with <label>, and the attributes
8156 <attrs> are applied after any attributes these theorems might have already.
8157 If the locale has assumptions, a chained fact of the form
8158 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8159 are derived. The command does not support old-style locales declared
8160 with "locale (open)".
8161 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8163 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8169 * Proof import: new image HOL4 contains the imported library from
8170 the HOL4 system with about 2500 theorems. It is imported by
8171 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8172 can be used like any other Isabelle image. See
8173 HOL/Import/HOL/README for more information.
8176 - Much improved handling of linear and partial orders.
8177 Reasoners for linear and partial orders are set up for type classes
8178 "linorder" and "order" respectively, and are added to the default simpset
8179 as solvers. This means that the simplifier can build transitivity chains
8180 to solve goals from the assumptions.
8181 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8182 of blast or auto after simplification become unnecessary because the goal
8183 is solved by simplification already.
8185 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8186 all proved in axiomatic type classes for semirings, rings and fields.
8189 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8190 now formalized using the Ring_and_Field theory mentioned above.
8191 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8192 than before, because now they are set up once in a generic manner.
8193 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8194 Look for the general versions in Ring_and_Field (and Power if they concern
8197 * Type "rat" of the rational numbers is now available in HOL-Complex.
8200 - Record types are now by default printed with their type abbreviation
8201 instead of the list of all field types. This can be configured via
8202 the reference "print_record_type_abbr".
8203 - Simproc "record_upd_simproc" for simplification of multiple updates added
8204 (not enabled by default).
8205 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8206 EX x. x = sel r to True (not enabled by default).
8207 - Tactic "record_split_simp_tac" to split and simplify records added.
8209 * 'specification' command added, allowing for definition by
8210 specification. There is also an 'ax_specification' command that
8211 introduces the new constants axiomatically.
8213 * arith(_tac) is now able to generate counterexamples for reals as well.
8215 * HOL-Algebra: new locale "ring" for non-commutative rings.
8217 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8218 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8220 * HOL-Matrix: a first theory for matrices in HOL with an application of
8221 matrix theory to linear programming.
8223 * Unions and Intersections:
8224 The latex output syntax of UN and INT has been changed
8225 from "\Union x \in A. B" to "\Union_{x \in A} B"
8226 i.e. the index formulae has become a subscript.
8227 Similarly for "\Union x. B", and for \Inter instead of \Union.
8229 * Unions and Intersections over Intervals:
8230 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8231 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8232 like in normal math, and corresponding versions for < and for intersection.
8234 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8235 lexicographic dictonary ordering has been added as "lexord".
8237 * ML: the legacy theory structures Int and List have been removed. They had
8238 conflicted with ML Basis Library structures having the same names.
8240 * 'refute' command added to search for (finite) countermodels. Only works
8241 for a fragment of HOL. The installation of an external SAT solver is
8242 highly recommended. See "HOL/Refute.thy" for details.
8244 * 'quickcheck' command: Allows to find counterexamples by evaluating
8245 formulae under an assignment of free variables to random values.
8246 In contrast to 'refute', it can deal with inductive datatypes,
8247 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8253 * Streams now come with concatenation and are part of the HOLCF image
8257 New in Isabelle2003 (May 2003)
8258 ------------------------------
8262 * Provers/simplifier:
8264 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8265 Assumptions are now subject to complete mutual simplification,
8266 not just from left to right. The simplifier now preserves
8267 the order of assumptions.
8269 Potential INCOMPATIBILITY:
8271 -- simp sometimes diverges where the old version did
8272 not, e.g. invoking simp on the goal
8274 [| P (f x); y = x; f x = f y |] ==> Q
8276 now gives rise to the infinite reduction sequence
8278 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8280 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8283 -- Tactics combining classical reasoner and simplification (such as auto)
8284 are also affected by this change, because many of them rely on
8285 simp. They may sometimes diverge as well or yield a different numbers
8286 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8287 in case of problems. Sometimes subsequent calls to the classical
8288 reasoner will fail because a preceeding call to the simplifier too
8289 eagerly simplified the goal, e.g. deleted redundant premises.
8291 - The simplifier trace now shows the names of the applied rewrite rules
8293 - You can limit the number of recursive invocations of the simplifier
8294 during conditional rewriting (where the simplifie tries to solve the
8295 conditions before applying the rewrite rule):
8296 ML "simp_depth_limit := n"
8297 where n is an integer. Thus you can force termination where previously
8298 the simplifier would diverge.
8300 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8302 - No longer aborts on failed congruence proof. Instead, the
8303 congruence is ignored.
8305 * Pure: New generic framework for extracting programs from constructive
8306 proofs. See HOL/Extraction.thy for an example instantiation, as well
8307 as HOL/Extraction for some case studies.
8309 * Pure: The main goal of the proof state is no longer shown by default, only
8310 the subgoals. This behaviour is controlled by a new flag.
8311 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8312 (ML: Proof.show_main_goal).
8314 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8315 rules whose conclusion matches subgoal 1:
8316 PG menu: Isabelle/Isar -> Show me -> matching rules
8317 The rules are ordered by how closely they match the subgoal.
8318 In particular, rules that solve a subgoal outright are displayed first
8319 (or rather last, the way they are printed).
8320 (ML: ProofGeneral.print_intros())
8322 * Pure: New flag trace_unify_fail causes unification to print
8323 diagnostic information (PG: in trace buffer) when it fails. This is
8324 useful for figuring out why single step proofs like rule, erule or
8327 * Pure: Locale specifications now produce predicate definitions
8328 according to the body of text (covering assumptions modulo local
8329 definitions); predicate "loc_axioms" covers newly introduced text,
8330 while "loc" is cumulative wrt. all included locale expressions; the
8331 latter view is presented only on export into the global theory
8332 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8333 on the old view without predicates;
8335 * Pure: predefined locales "var" and "struct" are useful for sharing
8336 parameters (as in CASL, for example); just specify something like
8337 ``var x + var y + struct M'' as import;
8339 * Pure: improved thms_containing: proper indexing of facts instead of
8340 raw theorems; check validity of results wrt. current name space;
8341 include local facts of proof configuration (also covers active
8342 locales), cover fixed variables in index; may use "_" in term
8343 specification; an optional limit for the number of printed facts may
8344 be given (the default is 40);
8346 * Pure: disallow duplicate fact bindings within new-style theory files
8349 * Provers: improved induct method: assumptions introduced by case
8350 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8351 the goal statement); "foo" still refers to all facts collectively;
8353 * Provers: the function blast.overloaded has been removed: all constants
8354 are regarded as potentially overloaded, which improves robustness in exchange
8355 for slight decrease in efficiency;
8357 * Provers/linorder: New generic prover for transitivity reasoning over
8358 linear orders. Note: this prover is not efficient!
8360 * Isar: preview of problems to finish 'show' now produce an error
8361 rather than just a warning (in interactive mode);
8368 - Produces a counter example if it cannot prove a goal.
8369 Note that the counter example may be spurious if the goal is not a formula
8370 of quantifier-free linear arithmetic.
8371 In ProofGeneral the counter example appears in the trace buffer.
8373 - Knows about div k and mod k where k is a numeral of type nat or int.
8375 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8376 linear arithmetic fails. This takes account of quantifiers and divisibility.
8377 Presburger arithmetic can also be called explicitly via presburger(_tac).
8379 * simp's arithmetic capabilities have been enhanced a bit: it now
8380 takes ~= in premises into account (by performing a case split);
8382 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8383 are distributed over a sum of terms;
8385 * New tactic "trans_tac" and method "trans" instantiate
8386 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8389 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8390 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8392 * 'typedef' command has new option "open" to suppress the set
8395 * functions Min and Max on finite sets have been introduced (theory
8398 * attribute [symmetric] now works for relations as well; it turns
8399 (x,y) : R^-1 into (y,x) : R, and vice versa;
8401 * induct over a !!-quantified statement (say !!x1..xn):
8402 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8404 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8405 %x. None. Warning: empty_def now refers to the previously hidden definition
8408 * Algebra: formalization of classical algebra. Intended as base for
8409 any algebraic development in Isabelle. Currently covers group theory
8410 (up to Sylow's theorem) and ring theory (Universal Property of
8411 Univariate Polynomials). Contributions welcome;
8413 * GroupTheory: deleted, since its material has been moved to Algebra;
8415 * Complex: new directory of the complex numbers with numeric constants,
8416 nonstandard complex numbers, and some complex analysis, standard and
8417 nonstandard (Jacques Fleuriot);
8419 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8421 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8424 * Real/HahnBanach: updated and adapted to locales;
8426 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8429 * UNITY: added the Meier-Sanders theory of progress sets;
8431 * MicroJava: bytecode verifier and lightweight bytecode verifier
8432 as abstract algorithms, instantiated to the JVM;
8434 * Bali: Java source language formalization. Type system, operational
8435 semantics, axiomatic semantics. Supported language features:
8436 classes, interfaces, objects,virtual methods, static methods,
8437 static/instance fields, arrays, access modifiers, definite
8438 assignment, exceptions.
8443 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8446 * Main ZF: virtually all theories converted to new-style format;
8451 * Pure: Tactic.prove provides sane interface for internal proofs;
8452 omits the infamous "standard" operation, so this is more appropriate
8453 than prove_goalw_cterm in many situations (e.g. in simprocs);
8455 * Pure: improved error reporting of simprocs;
8457 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8461 *** Document preparation ***
8463 * uses \par instead of \\ for line breaks in theory text. This may
8464 shift some page breaks in large documents. To get the old behaviour
8465 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8467 * minimized dependencies of isabelle.sty and isabellesym.sty on
8470 * \<euro> now needs package babel/greek instead of marvosym (which
8473 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8478 New in Isabelle2002 (March 2002)
8479 --------------------------------
8481 *** Document preparation ***
8483 * greatly simplified document preparation setup, including more
8484 graceful interpretation of isatool usedir -i/-d/-D options, and more
8485 instructive isatool mkdir; users should basically be able to get
8486 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8487 users may run a separate document processing stage manually like this:
8488 "isatool usedir -D output HOL Test && isatool document Test/output";
8490 * theory dependency graph may now be incorporated into documents;
8491 isatool usedir -g true will produce session_graph.eps/.pdf for use
8492 with \includegraphics of LaTeX;
8494 * proper spacing of consecutive markup elements, especially text
8495 blocks after section headings;
8497 * support bold style (for single symbols only), input syntax is like
8498 this: "\<^bold>\<alpha>" or "\<^bold>A";
8500 * \<bullet> is now output as bold \cdot by default, which looks much
8501 better in printed text;
8503 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8504 note that these symbols are currently unavailable in Proof General /
8505 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8507 * isatool latex no longer depends on changed TEXINPUTS, instead
8508 isatool document copies the Isabelle style files to the target
8514 * Pure/Provers: improved proof by cases and induction;
8515 - 'case' command admits impromptu naming of parameters (such as
8517 - 'induct' method divinates rule instantiation from the inductive
8518 claim; no longer requires excessive ?P bindings for proper
8519 instantiation of cases;
8520 - 'induct' method properly enumerates all possibilities of set/type
8521 rules; as a consequence facts may be also passed through *type*
8522 rules without further ado;
8523 - 'induct' method now derives symbolic cases from the *rulified*
8524 rule (before it used to rulify cases stemming from the internal
8525 atomized version); this means that the context of a non-atomic
8526 statement becomes is included in the hypothesis, avoiding the
8527 slightly cumbersome show "PROP ?case" form;
8528 - 'induct' may now use elim-style induction rules without chaining
8529 facts, using ``missing'' premises from the goal state; this allows
8530 rules stemming from inductive sets to be applied in unstructured
8531 scripts, while still benefitting from proper handling of non-atomic
8532 statements; NB: major inductive premises need to be put first, all
8533 the rest of the goal is passed through the induction;
8534 - 'induct' proper support for mutual induction involving non-atomic
8535 rule statements (uses the new concept of simultaneous goals, see
8537 - append all possible rule selections, but only use the first
8538 success (no backtracking);
8539 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8540 - undeclared rule case names default to numbers 1, 2, 3, ...;
8541 - added 'print_induct_rules' (covered by help item in recent Proof
8543 - moved induct/cases attributes to Pure, methods to Provers;
8544 - generic method setup instantiated for FOL and HOL;
8546 * Pure: support multiple simultaneous goal statements, for example
8547 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8548 meta-level mechanism, this acts as if several individual goals had
8549 been stated separately; in particular common proof methods need to be
8550 repeated in order to cover all claims; note that a single elimination
8551 step is *not* sufficient to establish the two conjunctions, so this
8554 assume "A & B" then have A and B .. (*".." fails*)
8556 better use "obtain" in situations as above; alternative refer to
8557 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8559 * Pure: proper integration with ``locales''; unlike the original
8560 version by Florian Kammller, Isar locales package high-level proof
8561 contexts rather than raw logical ones (e.g. we admit to include
8562 attributes everywhere); operations on locales include merge and
8563 rename; support for implicit arguments (``structures''); simultaneous
8564 type-inference over imports and text; see also HOL/ex/Locales.thy for
8567 * Pure: the following commands have been ``localized'', supporting a
8568 target locale specification "(in name)": 'lemma', 'theorem',
8569 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8570 stored both within the locale and at the theory level (exported and
8571 qualified by the locale name);
8573 * Pure: theory goals may now be specified in ``long'' form, with
8574 ad-hoc contexts consisting of arbitrary locale elements. for example
8575 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8576 definitions may be given, too); the result is a meta-level rule with
8577 the context elements being discharged in the obvious way;
8579 * Pure: new proof command 'using' allows to augment currently used
8580 facts after a goal statement ('using' is syntactically analogous to
8581 'apply', but acts on the goal's facts only); this allows chained facts
8582 to be separated into parts given before and after a claim, as in
8583 ``from a and b have C using d and e <proof>'';
8585 * Pure: renamed "antecedent" case to "rule_context";
8587 * Pure: new 'judgment' command records explicit information about the
8588 object-logic embedding (used by several tools internally); no longer
8589 use hard-wired "Trueprop";
8591 * Pure: added 'corollary' command;
8593 * Pure: fixed 'token_translation' command;
8595 * Pure: removed obsolete 'exported' attribute;
8597 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8598 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8599 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8601 * Pure: method 'atomize' presents local goal premises as object-level
8602 statements (atomic meta-level propositions); setup controlled via
8603 rewrite rules declarations of 'atomize' attribute; example
8604 application: 'induct' method with proper rule statements in improper
8607 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8608 now consider the syntactic context of assumptions, giving a better
8609 chance to get type-inference of the arguments right (this is
8610 especially important for locales);
8612 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8615 * Pure/obtain: the formal conclusion "thesis", being marked as
8616 ``internal'', may no longer be reference directly in the text;
8617 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8620 * Pure: generic 'sym' attribute which declares a rule both as pure
8621 'elim?' and for the 'symmetric' operation;
8623 * Pure: marginal comments ``--'' may now occur just anywhere in the
8624 text; the fixed correlation with particular command syntax has been
8627 * Pure: new method 'rules' is particularly well-suited for proof
8628 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8629 but often produces more compact proof terms with less detours;
8631 * Pure/Provers/classical: simplified integration with pure rule
8632 attributes and methods; the classical "intro?/elim?/dest?"
8633 declarations coincide with the pure ones; the "rule" method no longer
8634 includes classically swapped intros; "intro" and "elim" methods no
8635 longer pick rules from the context; also got rid of ML declarations
8636 AddXIs/AddXEs/AddXDs; all of this has some potential for
8639 * Provers/classical: attribute 'swapped' produces classical inversions
8640 of introduction rules;
8642 * Provers/simplifier: 'simplified' attribute may refer to explicit
8643 rules instead of full simplifier context; 'iff' attribute handles
8646 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8648 * HOL: 'recdef' now fails on unfinished automated proofs, use
8649 "(permissive)" option to recover old behavior;
8651 * HOL: 'inductive' no longer features separate (collective) attributes
8652 for 'intros' (was found too confusing);
8654 * HOL: properly declared induction rules less_induct and
8660 * HOL: moved over to sane numeral syntax; the new policy is as
8663 - 0 and 1 are polymorphic constants, which are defined on any
8664 numeric type (nat, int, real etc.);
8666 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8667 binary representation internally;
8669 - type nat has special constructor Suc, and generally prefers Suc 0
8670 over 1::nat and Suc (Suc 0) over 2::nat;
8672 This change may cause significant problems of INCOMPATIBILITY; here
8673 are some hints on converting existing sources:
8675 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8676 entities, so expressions involving "-" (unary or binary minus) need
8677 to be spaced properly;
8679 - existing occurrences of "1" may need to be constraint "1::nat" or
8680 even replaced by Suc 0; similar for old "2";
8682 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8684 - remove all special provisions on numerals in proofs;
8686 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8687 representation (depends on bin_arith_simps in the default context);
8689 * HOL: symbolic syntax for x^2 (numeral 2);
8691 * HOL: the class of all HOL types is now called "type" rather than
8692 "term"; INCOMPATIBILITY, need to adapt references to this type class
8693 in axclass/classes, instance/arities, and (usually rare) occurrences
8694 in typings (of consts etc.); internally the class is called
8695 "HOL.type", ML programs should refer to HOLogic.typeS;
8697 * HOL/record package improvements:
8698 - new derived operations "fields" to build a partial record section,
8699 "extend" to promote a fixed record to a record scheme, and
8700 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8701 declared as simp by default;
8702 - shared operations ("more", "fields", etc.) now need to be always
8703 qualified) --- potential INCOMPATIBILITY;
8704 - removed "make_scheme" operations (use "make" with "extend") --
8706 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8707 - provides cases/induct rules for use with corresponding Isar
8708 methods (for concrete records, record schemes, concrete more
8709 parts, and schematic more parts -- in that order);
8710 - internal definitions directly based on a light-weight abstract
8711 theory of product types over typedef rather than datatype;
8713 * HOL: generic code generator for generating executable ML code from
8714 specifications; specific support for HOL constructs such as inductive
8715 datatypes and sets, as well as recursive functions; can be invoked
8716 via 'generate_code' theory section;
8718 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8720 * HOL: consolidated and renamed several theories. In particular:
8721 Ord.thy has been absorbed into HOL.thy
8722 String.thy has been absorbed into List.thy
8724 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8725 (beware of argument permutation!);
8727 * HOL: linorder_less_split superseded by linorder_cases;
8729 * HOL/List: "nodups" renamed to "distinct";
8731 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8732 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8733 - Ex_def has changed, now need to use some_eq_ex
8735 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8736 in this (rare) case use:
8738 delSWrapper "split_all_tac"
8739 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8741 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8744 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8745 Isabelle's type classes, ^ on functions and relations has too general
8746 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8747 necessary to attach explicit type constraints;
8749 * HOL/Relation: the prefix name of the infix "O" has been changed from
8750 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8751 renamed accordingly (eg "compI" -> "rel_compI").
8753 * HOL: syntax translations now work properly with numerals and records
8756 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8757 of "lam" -- INCOMPATIBILITY;
8759 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8760 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8761 renamed "Product_Type.unit";
8763 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8765 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8766 the "cases" method);
8768 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8771 * HOL/IMP: updated and converted to new-style theory format; several
8772 parts turned into readable document, with proper Isar proof texts and
8773 some explanations (by Gerwin Klein);
8775 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8777 * HOL-Hyperreal is now a logic image;
8782 * Isar: consts/constdefs supports mixfix syntax for continuous
8785 * Isar: domain package adapted to new-style theory format, e.g. see
8788 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8789 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8790 lift.induct_tac, always use UU instead of Undef;
8792 * HOLCF/IMP: updated and converted to new-style theory;
8797 * Isar: proper integration of logic-specific tools and packages,
8798 including theory commands '(co)inductive', '(co)datatype',
8799 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8800 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8802 * theory Main no longer includes AC; for the Axiom of Choice, base
8803 your theory on Main_ZFC;
8805 * the integer library now covers quotients and remainders, with many
8806 laws relating division to addition, multiplication, etc.;
8808 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8809 typeless version of the formalism;
8811 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8814 * ZF/Induct: new directory for examples of inductive definitions,
8815 including theory Multiset for multiset orderings; converted to
8816 new-style theory format;
8818 * ZF: many new theorems about lists, ordinals, etc.;
8823 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8824 variable proof controls level of detail: 0 = no proofs (only oracle
8825 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8826 also ref manual for further ML interfaces;
8828 * Pure/axclass: removed obsolete ML interface
8829 goal_subclass/goal_arity;
8831 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8832 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8833 separate tokens, so expressions involving minus need to be spaced
8836 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8837 rather than "infixl" or "infixr";
8839 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8840 sort constraint specifications in type inference; e.g. "x::_::foo"
8841 ensures that the type of "x" is of sort "foo" (but not necessarily a
8844 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8845 control output of nested => (types); the default behavior is
8848 * Pure/syntax: builtin parse translation for "_constify" turns valued
8849 tokens into AST constants;
8851 * Pure/syntax: prefer later declarations of translations and print
8852 translation functions; potential INCOMPATIBILITY: need to reverse
8853 multiple declarations for same syntax element constant;
8855 * Pure/show_hyps reset by default (in accordance to existing Isar
8858 * Provers/classical: renamed addaltern to addafter, addSaltern to
8861 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8864 * system: tested support for MacOS X; should be able to get Isabelle +
8865 Proof General to work in a plain Terminal after installing Poly/ML
8866 (e.g. from the Isabelle distribution area) and GNU bash alone
8867 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8868 support requires further installations, e.g. from
8869 http://fink.sourceforge.net/);
8871 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8873 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8874 of 40 MB), cf. ML_OPTIONS;
8876 * system: Proof General keywords specification is now part of the
8877 Isabelle distribution (see etc/isar-keywords.el);
8879 * system: support for persistent Proof General sessions (refrain from
8880 outdating all loaded theories on startup); user may create writable
8881 logic images like this: ``isabelle -q HOL Test'';
8883 * system: smart selection of Isabelle process versus Isabelle
8884 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8885 run both "isabelle" and "Isabelle" even if file names are badly
8886 damaged (executable inspects the case of the first letter of its own
8887 name); added separate "isabelle-process" and "isabelle-interface";
8889 * system: refrain from any attempt at filtering input streams; no
8890 longer support ``8bit'' encoding of old isabelle font, instead proper
8891 iso-latin characters may now be used; the related isatools
8892 "symbolinput" and "nonascii" have disappeared as well;
8894 * system: removed old "xterm" interface (the print modes "xterm" and
8895 "xterm_color" are still available for direct use in a suitable
8900 New in Isabelle99-2 (February 2001)
8901 -----------------------------------
8903 *** Overview of INCOMPATIBILITIES ***
8905 * HOL: please note that theories in the Library and elsewhere often use the
8906 new-style (Isar) format; to refer to their theorems in an ML script you must
8907 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8909 * HOL: inductive package no longer splits induction rule aggressively,
8910 but only as far as specified by the introductions given; the old
8911 format may be recovered via ML function complete_split_rule or attribute
8912 'split_rule (complete)';
8914 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8915 gfp_Tarski to gfp_unfold;
8917 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8919 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8920 relation); infix "^^" has been renamed "``"; infix "``" has been
8921 renamed "`"; "univalent" has been renamed "single_valued";
8923 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8926 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8928 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8930 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8931 consequence, it is no longer monotonic wrt. the local goal context
8932 (which is now passed through the inductive cases);
8934 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8935 \<gg> to \<ggreater>;
8938 *** Document preparation ***
8940 * \isabellestyle{NAME} selects version of Isabelle output (currently
8941 available: are "it" for near math-mode best-style output, "sl" for
8942 slanted text style, and "tt" for plain type-writer; if no
8943 \isabellestyle command is given, output is according to slanted
8946 * support sub/super scripts (for single symbols only), input syntax is
8947 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8949 * some more standard symbols; see Appendix A of the system manual for
8950 the complete list of symbols defined in isabellesym.sty;
8952 * improved isabelle style files; more abstract symbol implementation
8953 (should now use \isamath{...} and \isatext{...} in custom symbol
8956 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8957 state; Note that presentation of goal states does not conform to
8958 actual human-readable proof documents. Please do not include goal
8959 states into document output unless you really know what you are doing!
8961 * proper indentation of antiquoted output with proportional LaTeX
8964 * no_document ML operator temporarily disables LaTeX document
8967 * isatool unsymbolize tunes sources for plain ASCII communication;
8972 * Pure: Isar now suffers initial goal statements to contain unbound
8973 schematic variables (this does not conform to actual readable proof
8974 documents, due to unpredictable outcome and non-compositional proof
8975 checking); users who know what they are doing may use schematic goals
8976 for Prolog-style synthesis of proven results;
8978 * Pure: assumption method (an implicit finishing) now handles actual
8981 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8982 initial goal, declare "that" only as Pure intro (only for single
8983 steps); the "that" rule assumption may now be involved in implicit
8984 finishing, thus ".." becomes a feasible for trivial obtains;
8986 * Pure: default proof step now includes 'intro_classes'; thus trivial
8987 instance proofs may be performed by "..";
8989 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8992 * Pure: more robust selection of calculational rules;
8994 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8995 rule (as well as the assumption rule);
8997 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8998 lemmas, using the graph browser tool;
9000 * Pure: predict failure of "show" in interactive mode;
9002 * Pure: 'thms_containing' now takes actual terms as arguments;
9004 * HOL: improved method 'induct' --- now handles non-atomic goals
9005 (potential INCOMPATIBILITY); tuned error handling;
9007 * HOL: cases and induct rules now provide explicit hints about the
9008 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9009 any remaining facts are inserted into the goal verbatim;
9011 * HOL: local contexts (aka cases) may now contain term bindings as
9012 well; the 'cases' and 'induct' methods new provide a ?case binding for
9013 the result to be shown in each case;
9015 * HOL: added 'recdef_tc' command;
9017 * isatool convert assists in eliminating legacy ML scripts;
9022 * HOL/Library: a collection of generic theories to be used together
9023 with main HOL; the theory loader path already includes this directory
9024 by default; the following existing theories have been moved here:
9025 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9026 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9028 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9029 modelling and verification task performed in Isabelle/HOL +
9030 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9032 * HOL/Algebra: special summation operator SUM no longer exists, it has
9033 been replaced by setsum; infix 'assoc' now has priority 50 (like
9034 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9035 'domain', this makes the theory consistent with mathematical
9038 * HOL basics: added overloaded operations "inverse" and "divide"
9039 (infix "/"), syntax for generic "abs" operation, generic summation
9042 * HOL/typedef: simplified package, provide more useful rules (see also
9045 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9046 now expressed as a proper nested rule (old-style tactic scripts may
9047 require atomize_strip_tac to cope with non-atomic premises);
9049 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9050 to "split_conv" (old name still available for compatibility);
9052 * HOL: improved concrete syntax for strings (e.g. allows translation
9053 rules with string literals);
9055 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9056 and Fleuriot's mechanization of analysis, including the transcendental
9057 functions for the reals;
9059 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9064 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9065 "lam" is displayed as TWO lambda-symbols
9067 * CTT: theory Main now available, containing everything (that is, Bool
9073 * Pure: the Simplifier has been implemented properly as a derived rule
9074 outside of the actual kernel (at last!); the overall performance
9075 penalty in practical applications is about 50%, while reliability of
9076 the Isabelle inference kernel has been greatly improved;
9078 * print modes "brackets" and "no_brackets" control output of nested =>
9079 (types) and ==> (props); the default behaviour is "brackets";
9081 * Provers: fast_tac (and friends) now handle actual object-logic rules
9082 as assumptions as well;
9084 * system: support Poly/ML 4.0;
9086 * system: isatool install handles KDE version 1 or 2;
9090 New in Isabelle99-1 (October 2000)
9091 ----------------------------------
9093 *** Overview of INCOMPATIBILITIES ***
9095 * HOL: simplification of natural numbers is much changed; to partly
9096 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9097 issue the following ML commands:
9099 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9100 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9102 * HOL: simplification no longer dives into case-expressions; this is
9103 controlled by "t.weak_case_cong" for each datatype t;
9105 * HOL: nat_less_induct renamed to less_induct;
9107 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9108 fixsome to patch .thy and .ML sources automatically;
9110 select_equality -> some_equality
9111 select_eq_Ex -> some_eq_ex
9112 selectI2EX -> someI2_ex
9115 select1_equality -> some1_equality
9116 Eps_sym_eq -> some_sym_eq_trivial
9117 Eps_eq -> some_eq_trivial
9119 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9121 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9124 * HOL: the recursion equations generated by 'recdef' are now called
9125 f.simps instead of f.rules;
9127 * HOL: qed_spec_mp now also handles bounded ALL as well;
9129 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9130 sometimes be needed;
9132 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9134 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9136 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9137 product is now "<*>" instead of "Times"; the lexicographic product is
9138 now "<*lex*>" instead of "**";
9140 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9141 of main HOL, but was unused); better use HOL's datatype package;
9143 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9144 the old syntax may be recovered as follows:
9147 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9148 (infixl "\\<oplus>" 100)
9150 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9152 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9153 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9156 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9157 changed from A/r to A//r;
9159 * ZF: new treatment of arithmetic (nat & int) may break some old
9162 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9163 rulify -> rule_format, elimify -> elim_format, ...);
9165 * Isar/Provers: intro/elim/dest attributes changed; renamed
9166 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9167 should have to change intro!! to intro? only); replaced "delrule" by
9170 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9172 * Provers: strengthened force_tac by using new first_best_tac;
9174 * LaTeX document preparation: several changes of isabelle.sty (see
9178 *** Document preparation ***
9180 * formal comments (text blocks etc.) in new-style theories may now
9181 contain antiquotations of thm/prop/term/typ/text to be presented
9182 according to latex print mode; concrete syntax is like this:
9183 @{term[show_types] "f(x) = a + x"};
9185 * isatool mkdir provides easy setup of Isabelle session directories,
9186 including proper document sources;
9188 * generated LaTeX sources are now deleted after successful run
9189 (isatool document -c); may retain a copy somewhere else via -D option
9192 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9193 style files, achieving self-contained LaTeX sources and simplifying
9196 * old-style theories now produce (crude) LaTeX output as well;
9198 * browser info session directories are now self-contained (may be put
9199 on WWW server seperately); improved graphs of nested sessions; removed
9200 graph for 'all sessions';
9202 * several improvements in isabelle style files; \isabellestyle{it}
9203 produces fake math mode output; \isamarkupheader is now \section by
9204 default; see lib/texinputs/isabelle.sty etc.;
9209 * Isar/Pure: local results and corresponding term bindings are now
9210 subject to Hindley-Milner polymorphism (similar to ML); this
9211 accommodates incremental type-inference very nicely;
9213 * Isar/Pure: new derived language element 'obtain' supports
9214 generalized existence reasoning;
9216 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9217 support accumulation of results, without applying any rules yet;
9218 useful to collect intermediate results without explicit name
9219 references, and for use with transitivity rules with more than 2
9222 * Isar/Pure: scalable support for case-analysis type proofs: new
9223 'case' language element refers to local contexts symbolically, as
9224 produced by certain proof methods; internally, case names are attached
9225 to theorems as "tags";
9227 * Isar/Pure: theory command 'hide' removes declarations from
9228 class/type/const name spaces;
9230 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9231 indicate potential overloading;
9233 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9235 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9236 "{a,b,c}" instead of {a,b,c};
9238 * Isar/Pure now provides its own version of intro/elim/dest
9239 attributes; useful for building new logics, but beware of confusion
9240 with the version in Provers/classical;
9242 * Isar/Pure: the local context of (non-atomic) goals is provided via
9243 case name 'antecedent';
9245 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9246 to the current context is now done automatically);
9248 * Isar/Pure: theory command 'method_setup' provides a simple interface
9249 for definining proof methods in ML;
9251 * Isar/Provers: intro/elim/dest attributes changed; renamed
9252 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9253 most cases, one should have to change intro!! to intro? only);
9254 replaced "delrule" by "rule del";
9256 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9257 'symmetric' attribute (the latter supercedes [RS sym]);
9259 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9260 method modifier); 'simp' method: 'only:' modifier removes loopers as
9261 well (including splits);
9263 * Isar/Provers: Simplifier and Classical methods now support all kind
9264 of modifiers used in the past, including 'cong', 'iff', etc.
9266 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9267 of Simplifier and Classical reasoner);
9269 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9270 now support named cases; major packages (inductive, datatype, primrec,
9271 recdef) support case names and properly name parameters;
9273 * Isar/HOL: new transitivity rules for substitution in inequalities --
9274 monotonicity conditions are extracted to be proven at end of
9277 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9280 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9281 split_if split_if_asm; datatype package provides theorems foo.splits =
9282 foo.split foo.split_asm for each datatype;
9284 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9285 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9286 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9287 use "(cases (simplified))" method in proper proof texts);
9289 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9291 * Isar: names of theorems etc. may be natural numbers as well;
9293 * Isar: 'pr' command: optional arguments for goals_limit and
9294 ProofContext.prems_limit; no longer prints theory contexts, but only
9297 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9298 additional print modes to be specified; e.g. "pr(latex)" will print
9299 proof state according to the Isabelle LaTeX style;
9301 * Isar: improved support for emulating tactic scripts, including proof
9302 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9303 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9304 (for HOL datatypes);
9306 * Isar: simplified (more robust) goal selection of proof methods: 1st
9307 goal, all goals, or explicit goal specifier (tactic emulation); thus
9308 'proof method scripts' have to be in depth-first order;
9310 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9312 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9313 should instead use individual commands for printing items
9314 (print_commands, print_methods etc.);
9316 * Isar: added 'nothing' --- the empty list of theorems;
9321 * HOL/MicroJava: formalization of a fragment of Java, together with a
9322 corresponding virtual machine and a specification of its bytecode
9323 verifier and a lightweight bytecode verifier, including proofs of
9324 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9325 Cornelia Pusch (see also the homepage of project Bali at
9326 http://isabelle.in.tum.de/Bali/);
9328 * HOL/Algebra: new theory of rings and univariate polynomials, by
9331 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9332 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9335 * HOL/Lattice: fundamental concepts of lattice theory and order
9336 structures, including duals, properties of bounds versus algebraic
9337 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9338 Theorem for complete lattices etc.; may also serve as a demonstration
9339 for abstract algebraic reasoning using axiomatic type classes, and
9340 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9342 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9345 * HOL/IMPP: extension of IMP with local variables and mutually
9346 recursive procedures, by David von Oheimb;
9348 * HOL/Lambda: converted into new-style theory and document;
9350 * HOL/ex/Multiquote: example of multiple nested quotations and
9351 anti-quotations -- basically a generalized version of de-Bruijn
9352 representation; very useful in avoiding lifting of operations;
9354 * HOL/record: added general record equality rule to simpset; fixed
9355 select-update simplification procedure to handle extended records as
9356 well; admit "r" as field name;
9358 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9359 other numeric types and also as the identity of groups, rings, etc.;
9361 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9362 Types nat and int belong to this axclass;
9364 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9365 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9366 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9367 two terms #m*u and #n*u are replaced by #(m+n)*u
9368 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9369 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9370 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9372 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9373 powerful prover for predicate logic but knows nothing of clasets; see
9374 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9376 * HOL: new version of "case_tac" subsumes both boolean case split and
9377 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9378 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9380 * HOL: simplification no longer dives into case-expressions: only the
9381 selector expression is simplified, but not the remaining arms; to
9382 enable full simplification of case-expressions for datatype t, you may
9383 remove t.weak_case_cong from the simpset, either globally (Delcongs
9384 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9386 * HOL/recdef: the recursion equations generated by 'recdef' for
9387 function 'f' are now called f.simps instead of f.rules; if all
9388 termination conditions are proved automatically, these simplification
9389 rules are added to the simpset, as in primrec; rules may be named
9390 individually as well, resulting in a separate list of theorems for
9393 * HOL/While is a new theory that provides a while-combinator. It
9394 permits the definition of tail-recursive functions without the
9395 provision of a termination measure. The latter is necessary once the
9396 invariant proof rule for while is applied.
9398 * HOL: new (overloaded) notation for the set of elements below/above
9399 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9401 * HOL: theorems impI, allI, ballI bound as "strip";
9403 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9404 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9405 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9407 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9409 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9410 main HOL, but was unused);
9412 * HOL: fewer consts declared as global (e.g. have to refer to
9413 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9415 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9416 in case of overlap with user translations (e.g. judgements over
9417 tuples); (note that the underlying logical represenation is still
9423 * ZF: simplification automatically cancels common terms in arithmetic
9424 expressions over nat and int;
9426 * ZF: new treatment of nat to minimize type-checking: all operators
9427 coerce their operands to a natural number using the function natify,
9428 making the algebraic laws unconditional;
9430 * ZF: as above, for int: operators coerce their operands to an integer
9431 using the function intify;
9433 * ZF: the integer library now contains many of the usual laws for the
9434 orderings, including $<=, and monotonicity laws for $+ and $*;
9436 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9439 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9440 to the simplifier and classical reasoner simultaneously;
9445 * Provers: blast_tac now handles actual object-logic rules as
9446 assumptions; note that auto_tac uses blast_tac internally as well;
9448 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9449 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9451 * Provers: delrules now handles destruct rules as well (no longer need
9452 explicit make_elim);
9454 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9455 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9456 use instead the strong form,
9457 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9458 in HOL, FOL and ZF the function cla_make_elim will create such rules
9459 from destruct-rules;
9461 * Provers: Simplifier.easy_setup provides a fast path to basic
9462 Simplifier setup for new object-logics;
9464 * Pure: AST translation rules no longer require constant head on LHS;
9466 * Pure: improved name spaces: ambiguous output is qualified; support
9467 for hiding of names;
9469 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9470 XSYMBOL_HOME; no longer need to do manual configuration in most
9473 * system: compression of ML heaps images may now be controlled via -c
9474 option of isabelle and isatool usedir (currently only observed by
9477 * system: isatool installfonts may handle X-Symbol fonts as well (very
9478 useful for remote X11);
9480 * system: provide TAGS file for Isabelle sources;
9482 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9485 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9486 timing flag supersedes proof_timing and Toplevel.trace;
9488 * ML: new combinators |>> and |>>> for incremental transformations
9489 with secondary results (e.g. certain theory extensions):
9491 * ML: PureThy.add_defs gets additional argument to indicate potential
9492 overloading (usually false);
9494 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9499 New in Isabelle99 (October 1999)
9500 --------------------------------
9502 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9504 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9505 are no longer simplified. (This allows the simplifier to unfold recursive
9506 functional programs.) To restore the old behaviour, declare
9508 Delcongs [if_weak_cong];
9510 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9513 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9515 * HOL/datatype: mutual_induct_tac no longer exists --
9516 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9518 * HOL/typedef: fixed type inference for representing set; type
9519 arguments now have to occur explicitly on the rhs as type constraints;
9521 * ZF: The con_defs part of an inductive definition may no longer refer
9522 to constants declared in the same theory;
9524 * HOL, ZF: the function mk_cases, generated by the inductive
9525 definition package, has lost an argument. To simplify its result, it
9526 uses the default simpset instead of a supplied list of theorems.
9528 * HOL/List: the constructors of type list are now Nil and Cons;
9530 * Simplifier: the type of the infix ML functions
9531 setSSolver addSSolver setSolver addSolver
9532 is now simpset * solver -> simpset where `solver' is a new abstract type
9533 for packaging solvers. A solver is created via
9534 mk_solver: string -> (thm list -> int -> tactic) -> solver
9535 where the string argument is only a comment.
9540 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9541 decision procedure for linear arithmetic. Currently it is used for
9542 types `nat', `int', and `real' in HOL (see below); it can, should and
9543 will be instantiated for other types and logics as well.
9545 * The simplifier now accepts rewrite rules with flexible heads, eg
9546 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9547 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9553 * New Isabelle/Isar subsystem provides an alternative to traditional
9554 tactical theorem proving; together with the ProofGeneral/isar user
9555 interface it offers an interactive environment for developing human
9556 readable proof documents (Isar == Intelligible semi-automated
9557 reasoning); for further information see isatool doc isar-ref,
9558 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9560 * improved and simplified presentation of theories: better HTML markup
9561 (including colors), graph views in several sizes; isatool usedir now
9562 provides a proper interface for user theories (via -P option); actual
9563 document preparation based on (PDF)LaTeX is available as well (for
9564 new-style theories only); see isatool doc system for more information;
9566 * native support for Proof General, both for classic Isabelle and
9569 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9570 using the graph browser tool;
9572 * Isabelle manuals now also available as PDF;
9574 * theory loader rewritten from scratch (may not be fully
9575 bug-compatible); old loadpath variable has been replaced by show_path,
9576 add_path, del_path, reset_path functions; new operations such as
9577 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9580 * improved isatool install: option -k creates KDE application icon,
9581 option -p DIR installs standalone binaries;
9583 * added ML_PLATFORM setting (useful for cross-platform installations);
9584 more robust handling of platform specific ML images for SML/NJ;
9586 * the settings environment is now statically scoped, i.e. it is never
9587 created again in sub-processes invoked from isabelle, isatool, or
9590 * path element specification '~~' refers to '$ISABELLE_HOME';
9592 * in locales, the "assumes" and "defines" parts may be omitted if
9595 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9598 * new print_mode "HTML";
9600 * new flag show_tags controls display of tags of theorems (which are
9601 basically just comments that may be attached by some tools);
9603 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9604 mode and goal output format:
9606 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9608 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9610 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9611 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9613 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9615 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9617 * function bind_thms stores lists of theorems (cf. bind_thm);
9619 * new shorthand tactics ftac, eatac, datac, fatac;
9621 * qed (and friends) now accept "" as result name; in that case the
9622 theorem is not stored, but proper checks and presentation of the
9625 * theorem database now also indexes constants "Trueprop", "all",
9626 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9631 ** HOL arithmetic **
9633 * There are now decision procedures for linear arithmetic over nat and
9636 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9637 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9638 are treated as atomic; subformulae not involving type `nat' or `int'
9639 are ignored; quantified subformulae are ignored unless they are
9640 positive universal or negative existential. The tactic has to be
9641 invoked by hand and can be a little bit slow. In particular, the
9642 running time is exponential in the number of occurrences of `min' and
9643 `max', and `-' on `nat'.
9645 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9646 (negated) (in)equalities among the premises and the conclusion into
9647 account (i.e. no compound formulae) and does not know about `min' and
9648 `max', and `-' on `nat'. It is fast and is used automatically by the
9651 NB: At the moment, these decision procedures do not cope with mixed
9652 nat/int formulae where the two parts interact, such as `m < n ==>
9655 * HOL/Numeral provides a generic theory of numerals (encoded
9656 efficiently as bit strings); setup for types nat/int/real is in place;
9657 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9658 int, existing theories and proof scripts may require a few additional
9661 * integer division and remainder can now be performed on constant
9664 * many properties of integer multiplication, division and remainder
9667 * An interface to the Stanford Validity Checker (SVC) is available through the
9668 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9669 are proved automatically. SVC must be installed separately, and its results
9670 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9671 invocation of the underlying oracle). For SVC see
9672 http://verify.stanford.edu/SVC
9674 * IsaMakefile: the HOL-Real target now builds an actual image;
9679 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9680 (in Isabelle/Isar) -- by Gertrud Bauer;
9682 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9683 analysis for assembly languages with subtypes;
9685 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9686 -- avoids syntactic ambiguities and treats state, transition, and
9687 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9688 changed syntax and (many) tactics;
9690 * HOL/inductive: Now also handles more general introduction rules such
9691 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9692 theorems are now maintained within the theory (maintained via the
9695 * HOL/datatype: Now also handles arbitrarily branching datatypes
9696 (using function types) such as
9698 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9700 * HOL/record: record_simproc (part of the default simpset) takes care
9701 of selectors applied to updated records; record_split_tac is no longer
9702 part of the default claset; update_defs may now be removed from the
9703 simpset in many cases; COMPATIBILITY: old behavior achieved by
9705 claset_ref () := claset() addSWrapper record_split_wrapper;
9706 Delsimprocs [record_simproc]
9708 * HOL/typedef: fixed type inference for representing set; type
9709 arguments now have to occur explicitly on the rhs as type constraints;
9711 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9712 names rather than an ML expression;
9714 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9715 supplied later. Program schemes can be defined, such as
9716 "While B C s = (if B s then While B C (C s) else s)"
9717 where the well-founded relation can be chosen after B and C have been given.
9719 * HOL/List: the constructors of type list are now Nil and Cons;
9720 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9721 course, ML tools referring to List.list.op # etc. have to be adapted;
9723 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9724 disabled by default; run isabelle with option -m HOL to get back to
9725 the original Gordon/HOL-style output;
9727 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9728 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9730 * HOL basic syntax simplified (more orthogonal): all variants of
9731 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9732 Eps operator is provided as well: "SOME x. P[x]";
9734 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9736 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9737 thus available for user theories;
9739 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9740 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9743 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9744 several times and then mp;
9749 * the notation <<...>> is now available as a notation for sequences of
9752 * the simplifier is now installed
9754 * the axiom system has been generalized (thanks to Soren Heilmann)
9756 * the classical reasoner now has a default rule database
9761 * new primrec section allows primitive recursive functions to be given
9762 directly (as in HOL) over datatypes and the natural numbers;
9764 * new tactics induct_tac and exhaust_tac for induction (or case
9765 analysis) over datatypes and the natural numbers;
9767 * the datatype declaration of type T now defines the recursor T_rec;
9769 * simplification automatically does freeness reasoning for datatype
9772 * automatic type-inference, with AddTCs command to insert new
9773 type-checking rules;
9775 * datatype introduction rules are now added as Safe Introduction rules
9778 * the syntax "if P then x else y" is now available in addition to
9782 *** Internal programming interfaces ***
9784 * tuned simplifier trace output; new flag debug_simp;
9786 * structures Vartab / Termtab (instances of TableFun) offer efficient
9787 tables indexed by indexname_ord / term_ord (compatible with aconv);
9789 * AxClass.axclass_tac lost the theory argument;
9791 * tuned current_goals_markers semantics: begin / end goal avoids
9792 printing empty lines;
9794 * removed prs and prs_fn hook, which was broken because it did not
9795 include \n in its semantics, forcing writeln to add one
9796 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9797 string -> unit if you really want to output text without newline;
9799 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9800 plain output, interface builders may have to enable 'isabelle_font'
9801 mode to get Isabelle font glyphs as before;
9803 * refined token_translation interface; INCOMPATIBILITY: output length
9804 now of type real instead of int;
9806 * theory loader actions may be traced via new ThyInfo.add_hook
9807 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9808 your own database of information attached to *whole* theories -- as
9809 opposed to intra-theory data slots offered via TheoryDataFun;
9811 * proper handling of dangling sort hypotheses (at last!);
9812 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9813 extra sort hypotheses that can be witnessed from the type signature;
9814 the force_strip_shyps flag is gone, any remaining shyps are simply
9815 left in the theorem (with a warning issued by strip_shyps_warning);
9819 New in Isabelle98-1 (October 1998)
9820 ----------------------------------
9822 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9824 * several changes of automated proof tools;
9826 * HOL: major changes to the inductive and datatype packages, including
9827 some minor incompatibilities of theory syntax;
9829 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9832 * HOL: removed duplicate thms in Arith:
9833 less_imp_add_less should be replaced by trans_less_add1
9834 le_imp_add_le should be replaced by trans_le_add1
9836 * HOL: unary minus is now overloaded (new type constraints may be
9839 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9840 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9841 now taken as an integer constant.
9843 * Pure: ML function 'theory_of' renamed to 'theory';
9849 1. Asm_full_simp_tac is now more aggressive.
9850 1. It will sometimes reorient premises if that increases their power to
9852 2. It does no longer proceed strictly from left to right but may also
9853 rotate premises to achieve further simplification.
9854 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9855 old Asm_full_simp_tac in that it does not rotate premises.
9856 2. The simplifier now knows a little bit about nat-arithmetic.
9858 * Classical reasoner: wrapper mechanism for the classical reasoner now
9859 allows for selected deletion of wrappers, by introduction of names for
9860 wrapper functionals. This implies that addbefore, addSbefore,
9861 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9862 and that adding two tactics with the same name overwrites the first
9863 one (emitting a warning).
9864 type wrapper = (int -> tactic) -> (int -> tactic)
9865 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9866 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9867 delWrapper, delSWrapper: claset * string -> claset
9868 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9870 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9871 semantics; addbefore now affects only the unsafe part of step_tac
9872 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9873 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9876 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9877 compWrapper; added safe wrapper (and access functions for it);
9879 * HOL/split_all_tac is now much faster and fails if there is nothing
9880 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9881 and the names of the automatically generated variables have changed.
9882 split_all_tac has moved within claset() from unsafe wrappers to safe
9883 wrappers, which means that !!-bound variables are split much more
9884 aggressively, and safe_tac and clarify_tac now split such variables.
9885 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9886 Note: the same holds for record_split_tac, which does the job of
9887 split_all_tac for record fields.
9889 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9890 permanently to the default simpset using Addsplits just like
9891 Addsimps. They can be removed via Delsplits just like
9892 Delsimps. Lower-case versions are also available.
9894 * HOL/Simplifier: The rule split_if is now part of the default
9895 simpset. This means that the simplifier will eliminate all occurrences
9896 of if-then-else in the conclusion of a goal. To prevent this, you can
9897 either remove split_if completely from the default simpset by
9898 `Delsplits [split_if]' or remove it in a specific call of the
9899 simplifier using `... delsplits [split_if]'. You can also add/delete
9900 other case splitting rules to/from the default simpset: every datatype
9901 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9902 t is the name of the datatype).
9904 * Classical reasoner / Simplifier combination: new force_tac (and
9905 derivatives Force_tac, force) combines rewriting and classical
9906 reasoning (and whatever other tools) similarly to auto_tac, but is
9907 aimed to solve the given subgoal completely.
9912 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9913 and `goalw': the theory is no longer needed as an explicit argument -
9914 the current theory context is used; assumptions are no longer returned
9915 at the ML-level unless one of them starts with ==> or !!; it is
9916 recommended to convert to these new commands using isatool fixgoal
9917 (backup your sources first!);
9919 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9920 the current theory context, and 'theory' to lookup stored theories;
9922 * new theory section 'locale' for declaring constants, assumptions and
9923 definitions that have local scope;
9925 * new theory section 'nonterminals' for purely syntactic types;
9927 * new theory section 'setup' for generic ML setup functions
9928 (e.g. package initialization);
9930 * the distribution now includes Isabelle icons: see
9931 lib/logo/isabelle-{small,tiny}.xpm;
9933 * isatool install - install binaries with absolute references to
9936 * isatool logo -- create instances of the Isabelle logo (as EPS);
9938 * print mode 'emacs' reserved for Isamode;
9940 * support multiple print (ast) translations per constant name;
9942 * theorems involving oracles are now printed with a suffixed [!];
9947 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9949 * HOL/inductive package reorganized and improved: now supports mutual
9955 oddI "n : EVEN ==> Suc n : ODD"
9956 evenI "n : ODD ==> Suc n : EVEN"
9958 new theorem list "elims" contains an elimination rule for each of the
9959 recursive sets; inductive definitions now handle disjunctive premises
9960 correctly (also ZF);
9962 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9963 "mutual_induct" no longer exists - the induction rule is always
9964 contained in "induct";
9967 * HOL/datatype package re-implemented and greatly improved: now
9968 supports mutually recursive datatypes such as
9971 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9972 | SUM ('a aexp) ('a aexp)
9973 | DIFF ('a aexp) ('a aexp)
9976 'a bexp = LESS ('a aexp) ('a aexp)
9977 | AND ('a bexp) ('a bexp)
9978 | OR ('a bexp) ('a bexp)
9980 as well as indirectly recursive datatypes such as
9983 ('a, 'b) term = Var 'a
9984 | App 'b ((('a, 'b) term) list)
9986 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9987 induction on mutually / indirectly recursive datatypes.
9989 Primrec equations are now stored in theory and can be accessed via
9990 <function_name>.simps.
9994 - Theories using datatypes must now have theory Datatype as an
9996 - The specific <typename>.induct_tac no longer exists - use the
9997 generic induct_tac instead.
9998 - natE has been renamed to nat.exhaust - use exhaust_tac
9999 instead of res_inst_tac ... natE. Note that the variable
10000 names in nat.exhaust differ from the names in natE, this
10001 may cause some "fragile" proofs to fail.
10002 - The theorems split_<typename>_case and split_<typename>_case_asm
10003 have been renamed to <typename>.split and <typename>.split_asm.
10004 - Since default sorts of type variables are now handled correctly,
10005 some datatype definitions may have to be annotated with explicit
10007 - Primrec definitions no longer require function name and type
10008 of recursive argument.
10010 Consider using isatool fixdatatype to adapt your theories and proof
10011 scripts to the new package (backup your sources first!).
10014 * HOL/record package: considerably improved implementation; now
10015 includes concrete syntax for record types, terms, updates; theorems
10016 for surjective pairing and splitting !!-bound record variables; proof
10017 support is as follows:
10019 1) standard conversions (selectors or updates applied to record
10020 constructor terms) are part of the standard simpset;
10022 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10023 made part of standard simpset and claset via addIffs;
10025 3) a tactic for record field splitting (record_split_tac) is part of
10026 the standard claset (addSWrapper);
10028 To get a better idea about these rules you may retrieve them via
10029 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10030 the name of your record type.
10032 The split tactic 3) conceptually simplifies by the following rule:
10034 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10036 Thus any record variable that is bound by meta-all will automatically
10037 blow up into some record constructor term, consequently the
10038 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10039 solve record problems automatically.
10042 * reorganized the main HOL image: HOL/Integ and String loaded by
10043 default; theory Main includes everything;
10045 * automatic simplification of integer sums and comparisons, using cancellation;
10047 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10049 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10051 * many new identities for unions, intersections, set difference, etc.;
10053 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10054 called split_if, split_split, split_sum_case and split_nat_case (to go
10055 with add/delsplits);
10057 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10058 (?x::unit) = (); this is made part of the default simpset, which COULD
10059 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10060 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10061 unit_abs_eta_conv is added in order to counter the effect of
10062 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10065 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10068 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10069 It and 'sym RS equals0D' are now in the default claset, giving automatic
10070 disjointness reasoning but breaking a few old proofs.
10072 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10073 to 'converse' from 'inverse' (for compatibility with ZF and some
10076 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10077 the well-founded relation;
10079 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10080 Compl A. The "Compl" syntax remains available as input syntax for this
10083 * HOL/Update: new theory of function updates:
10084 f(a:=b) == %x. if x=a then b else f x
10085 may also be iterated as in f(a:=b,c:=d,...);
10087 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10090 - new function list_update written xs[i:=v] that updates the i-th
10091 list position. May also be iterated as in xs[i:=a,j:=b,...].
10092 - new function `upt' written [i..j(] which generates the list
10093 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10094 bound write [i..j], which is a shorthand for [i..j+1(].
10095 - new lexicographic orderings and corresponding wellfoundedness theorems.
10098 - removed 'pred' (predecessor) function;
10099 - generalized some theorems about n-1;
10100 - many new laws about "div" and "mod";
10101 - new laws about greatest common divisors (see theory ex/Primes);
10103 * HOL/Relation: renamed the relational operator r^-1 "converse"
10104 instead of "inverse";
10106 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10107 of the multiset ordering;
10109 * directory HOL/Real: a construction of the reals using Dedekind cuts
10110 (not included by default);
10112 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10114 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10115 programs, i.e. different program variables may have different types.
10117 * calling (stac rew i) now fails if "rew" has no effect on the goal
10118 [previously, this check worked only if the rewrite rule was unconditional]
10119 Now rew can involve either definitions or equalities (either == or =).
10124 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10125 only the theorems proved on ZF.ML;
10127 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10128 It and 'sym RS equals0D' are now in the default claset, giving automatic
10129 disjointness reasoning but breaking a few old proofs.
10131 * ZF/Update: new theory of function updates
10132 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10133 may also be iterated as in f(a:=b,c:=d,...);
10135 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10137 * calling (stac rew i) now fails if "rew" has no effect on the goal
10138 [previously, this check worked only if the rewrite rule was unconditional]
10139 Now rew can involve either definitions or equalities (either == or =).
10141 * case_tac provided for compatibility with HOL
10142 (like the old excluded_middle_tac, but with subgoals swapped)
10145 *** Internal programming interfaces ***
10147 * Pure: several new basic modules made available for general use, see
10148 also src/Pure/README;
10150 * improved the theory data mechanism to support encapsulation (data
10151 kind name replaced by private Object.kind, acting as authorization
10152 key); new type-safe user interface via functor TheoryDataFun; generic
10153 print_data function becomes basically useless;
10155 * removed global_names compatibility flag -- all theory declarations
10156 are qualified by default;
10158 * module Pure/Syntax now offers quote / antiquote translation
10159 functions (useful for Hoare logic etc. with implicit dependencies);
10160 see HOL/ex/Antiquote for an example use;
10162 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10165 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10168 * Display.print_goals function moved to Locale.print_goals;
10170 * standard print function for goals supports current_goals_markers
10171 variable for marking begin of proof, end of proof, start of goal; the
10172 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10173 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10178 New in Isabelle98 (January 1998)
10179 --------------------------------
10181 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10183 * changed lexical syntax of terms / types: dots made part of long
10184 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10186 * simpset (and claset) reference variable replaced by functions
10187 simpset / simpset_ref;
10189 * no longer supports theory aliases (via merge) and non-trivial
10190 implicit merge of thms' signatures;
10192 * most internal names of constants changed due to qualified names;
10194 * changed Pure/Sequence interface (see Pure/seq.ML);
10197 *** General Changes ***
10199 * hierachically structured name spaces (for consts, types, axms, thms
10200 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10201 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10202 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10203 long_names for fully qualified output names; NOTE: ML programs
10204 (special tactics, packages etc.) referring to internal names may have
10205 to be adapted to cope with fully qualified names; in case of severe
10206 backward campatibility problems try setting 'global_names' at compile
10207 time to have enrything declared within a flat name space; one may also
10208 fine tune name declarations in theories via the 'global' and 'local'
10211 * reimplemented the implicit simpset and claset using the new anytype
10212 data filed in signatures; references simpset:simpset ref etc. are
10213 replaced by functions simpset:unit->simpset and
10214 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10215 to patch your ML files accordingly;
10217 * HTML output now includes theory graph data for display with Java
10218 applet or isatool browser; data generated automatically via isatool
10219 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10221 * defs may now be conditional; improved rewrite_goals_tac to handle
10222 conditional equations;
10224 * defs now admits additional type arguments, using TYPE('a) syntax;
10226 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10227 creates a new theory node; implicit merge of thms' signatures is
10228 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10229 transfer:theory->thm->thm in (rare) cases;
10231 * improved handling of draft signatures / theories; draft thms (and
10232 ctyps, cterms) are automatically promoted to real ones;
10234 * slightly changed interfaces for oracles: admit many per theory, named
10235 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10237 * print_goals: optional output of const types (set show_consts and
10240 * improved output of warnings (###) and errors (***);
10242 * subgoal_tac displays a warning if the new subgoal has type variables;
10244 * removed old README and Makefiles;
10246 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10248 * removed obsolete init_pps and init_database;
10250 * deleted the obsolete tactical STATE, which was declared by
10251 fun STATE tacfun st = tacfun st st;
10253 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10254 (which abbreviates $HOME);
10256 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10257 use isatool fixseq to adapt your ML programs (this works for fully
10258 qualified references to the Sequence structure only!);
10260 * use_thy no longer requires writable current directory; it always
10261 reloads .ML *and* .thy file, if either one is out of date;
10264 *** Classical Reasoner ***
10266 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10267 tactics that use classical reasoning to simplify a subgoal without
10268 splitting it into several subgoals;
10270 * Safe_tac: like safe_tac but uses the default claset;
10275 * added simplification meta rules:
10276 (asm_)(full_)simplify: simpset -> thm -> thm;
10278 * simplifier.ML no longer part of Pure -- has to be loaded by object
10281 * added prems argument to simplification procedures;
10283 * HOL, FOL, ZF: added infix function `addsplits':
10284 instead of `<simpset> setloop (split_tac <thms>)'
10285 you can simply write `<simpset> addsplits <thms>'
10290 * TYPE('a) syntax for type reflection terms;
10292 * no longer handles consts with name "" -- declare as 'syntax' instead;
10294 * pretty printer: changed order of mixfix annotation preference (again!);
10296 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10301 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10302 with `addloop' of the simplifier to faciliate case splitting in premises.
10304 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10306 * HOL/Auth: new protocol proofs including some for the Internet
10309 * HOL/Map: new theory of `maps' a la VDM;
10311 * HOL/simplifier: simplification procedures nat_cancel_sums for
10312 cancelling out common nat summands from =, <, <= (in)equalities, or
10313 differences; simplification procedures nat_cancel_factor for
10314 cancelling common factor from =, <, <= (in)equalities over natural
10315 sums; nat_cancel contains both kinds of procedures, it is installed by
10316 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10318 * HOL/simplifier: terms of the form
10319 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10321 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10322 and those of the form
10323 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10325 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10328 Each datatype `t' now comes with a theorem `split_t_case' of the form
10330 P(t_case f1 ... fn x) =
10331 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10333 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10336 and a theorem `split_t_case_asm' of the form
10338 P(t_case f1 ... fn x) =
10339 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10341 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10343 which can be added to a simpset via `addsplits'. The existing theorems
10344 expand_list_case and expand_option_case have been renamed to
10345 split_list_case and split_option_case.
10348 - `pred n' is automatically converted to `n-1'.
10349 Users are strongly encouraged not to use `pred' any longer,
10350 because it will disappear altogether at some point.
10351 - Users are strongly encouraged to write "0 < n" rather than
10352 "n ~= 0". Theorems and proof tools have been modified towards this
10356 the function "set_of_list" has been renamed "set" (and its theorems too);
10357 the function "nth" now takes its arguments in the reverse order and
10358 has acquired the infix notation "!" as in "xs!n".
10360 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10362 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10363 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10365 * HOL/record: extensible records with schematic structural subtyping
10366 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10367 still lacks various theorems and concrete record syntax;
10372 * removed "axioms" and "generated by" sections;
10374 * replaced "ops" section by extended "consts" section, which is capable of
10375 handling the continuous function space "->" directly;
10378 . proves theorems immediately and stores them in the theory,
10379 . creates hierachical name space,
10380 . now uses normal mixfix annotations (instead of cinfix...),
10381 . minor changes to some names and values (for consistency),
10382 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10383 . separator between mutual domain defs: changed "," to "and",
10384 . improved handling of sort constraints; now they have to
10385 appear on the left-hand side of the equations only;
10387 * fixed LAM <x,y,zs>.b syntax;
10389 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10390 adm (%x. P (t x)), where P is chainfinite and t continuous;
10395 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10396 with `addloop' of the simplifier to faciliate case splitting in premises.
10398 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10399 in HOL, they strip ALL and --> from proved theorems;
10403 New in Isabelle94-8 (May 1997)
10404 ------------------------------
10406 *** General Changes ***
10408 * new utilities to build / run / maintain Isabelle etc. (in parts
10409 still somewhat experimental); old Makefiles etc. still functional;
10411 * new 'Isabelle System Manual';
10413 * INSTALL text, together with ./configure and ./build scripts;
10415 * reimplemented type inference for greater efficiency, better error
10416 messages and clean internal interface;
10418 * prlim command for dealing with lots of subgoals (an easier way of
10419 setting goals_limit);
10424 * supports alternative (named) syntax tables (parser and pretty
10425 printer); internal interface is provided by add_modesyntax(_i);
10427 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10428 be used in conjunction with the Isabelle symbol font; uses the
10429 "symbols" syntax table;
10431 * added token_translation interface (may translate name tokens in
10432 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10433 the current print_mode); IMPORTANT: user print translation functions
10434 are responsible for marking newly introduced bounds
10435 (Syntax.mark_boundT);
10437 * token translations for modes "xterm" and "xterm_color" that display
10438 names in bold, underline etc. or colors (which requires a color
10441 * infixes may now be declared with names independent of their syntax;
10443 * added typed_print_translation (like print_translation, but may
10444 access type of constant);
10447 *** Classical Reasoner ***
10449 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10450 some limitations. Blast_tac...
10451 + ignores addss, addbefore, addafter; this restriction is intrinsic
10452 + ignores elimination rules that don't have the correct format
10453 (the conclusion MUST be a formula variable)
10454 + ignores types, which can make HOL proofs fail
10455 + rules must not require higher-order unification, e.g. apply_type in ZF
10456 [message "Function Var's argument not a bound variable" relates to this]
10457 + its proof strategy is more general but can actually be slower
10459 * substitution with equality assumptions no longer permutes other
10462 * minor changes in semantics of addafter (now called addaltern); renamed
10463 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10464 (and access functions for it);
10466 * improved combination of classical reasoner and simplifier:
10467 + functions for handling clasimpsets
10468 + improvement of addss: now the simplifier is called _after_ the
10470 + safe variant of addss called addSss: uses safe simplifications
10471 _during_ the safe steps. It is more complete as it allows multiple
10472 instantiations of unknowns (e.g. with slow_tac).
10476 * added interface for simplification procedures (functions that
10477 produce *proven* rewrite rules on the fly, depending on current
10480 * ordering on terms as parameter (used for ordered rewriting);
10482 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10484 * the solver is now split into a safe and an unsafe part.
10485 This should be invisible for the normal user, except that the
10486 functions setsolver and addsolver have been renamed to setSolver and
10487 addSolver; added safe_asm_full_simp_tac;
10492 * a generic induction tactic `induct_tac' which works for all datatypes and
10493 also for type `nat';
10495 * a generic case distinction tactic `exhaust_tac' which works for all
10496 datatypes and also for type `nat';
10498 * each datatype comes with a function `size';
10500 * patterns in case expressions allow tuple patterns as arguments to
10501 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10503 * primrec now also works with type nat;
10505 * recdef: a new declaration form, allows general recursive functions to be
10506 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10508 * the constant for negation has been renamed from "not" to "Not" to
10509 harmonize with FOL, ZF, LK, etc.;
10511 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10514 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10516 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10517 problems in commutative rings, using axiomatic type classes for + and *;
10519 * more examples in HOL/MiniML and HOL/Auth;
10521 * more default rewrite rules for quantifiers, union/intersection;
10523 * a new constant `arbitrary == @x.False';
10525 * HOLCF/IOA replaces old HOL/IOA;
10527 * HOLCF changes: derived all rules and arities
10528 + axiomatic type classes instead of classes
10529 + typedef instead of faking type definitions
10530 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10531 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10532 + eliminated the types void, one, tr
10533 + use unit lift and bool lift (with translations) instead of one and tr
10534 + eliminated blift from Lift3.thy (use Def instead of blift)
10535 all eliminated rules are derived as theorems --> no visible changes ;
10540 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10541 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10542 as ZF_cs addSIs [equalityI];
10546 New in Isabelle94-7 (November 96)
10547 ---------------------------------
10549 * allowing negative levels (as offsets) in prlev and choplev;
10551 * super-linear speedup for large simplifications;
10553 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10554 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10555 FAIL); can suppress it using the command Delsimps (ex_simps @
10556 all_simps); De Morgan laws are also now included, by default;
10558 * improved printing of ==> : ~:
10560 * new object-logic "Sequents" adds linear logic, while replacing LK
10561 and Modal (thanks to Sara Kalvala);
10563 * HOL/Auth: correctness proofs for authentication protocols;
10565 * HOL: new auto_tac combines rewriting and classical reasoning (many
10566 examples on HOL/Auth);
10568 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10569 the rewriter and classical reasoner simultaneously;
10571 * function uresult no longer returns theorems in "standard" format;
10572 regain previous version by: val uresult = standard o uresult;
10576 New in Isabelle94-6
10577 -------------------
10579 * oracles -- these establish an interface between Isabelle and trusted
10580 external reasoners, which may deliver results as theorems;
10582 * proof objects (in particular record all uses of oracles);
10584 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10586 * "constdefs" section in theory files;
10588 * "primrec" section (HOL) no longer requires names;
10590 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10594 New in Isabelle94-5
10595 -------------------
10597 * reduced space requirements;
10599 * automatic HTML generation from theories;
10601 * theory files no longer require "..." (quotes) around most types;
10603 * new examples, including two proofs of the Church-Rosser theorem;
10605 * non-curried (1994) version of HOL is no longer distributed;
10609 New in Isabelle94-4
10610 -------------------
10612 * greatly reduced space requirements;
10614 * theory files (.thy) no longer require \...\ escapes at line breaks;
10616 * searchable theorem database (see the section "Retrieving theorems" on
10617 page 8 of the Reference Manual);
10619 * new examples, including Grabczewski's monumental case study of the
10622 * The previous version of HOL renamed to Old_HOL;
10624 * The new version of HOL (previously called CHOL) uses a curried syntax
10625 for functions. Application looks like f a b instead of f(a,b);
10627 * Mutually recursive inductive definitions finally work in HOL;
10629 * In ZF, pattern-matching on tuples is now available in all abstractions and
10630 translates to the operator "split";
10634 New in Isabelle94-3
10635 -------------------
10637 * new infix operator, addss, allowing the classical reasoner to
10638 perform simplification at each step of its search. Example:
10639 fast_tac (cs addss ss)
10641 * a new logic, CHOL, the same as HOL, but with a curried syntax
10642 for functions. Application looks like f a b instead of f(a,b). Also pairs
10643 look like (a,b) instead of <a,b>;
10645 * PLEASE NOTE: CHOL will eventually replace HOL!
10647 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10648 It translates to the operator "split". A new theory of integers is available;
10650 * In ZF, integer numerals now denote two's-complement binary integers.
10651 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10653 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10654 of the Axiom of Choice;
10658 New in Isabelle94-2
10659 -------------------
10661 * Significantly faster resolution;
10663 * the different sections in a .thy file can now be mixed and repeated
10666 * Database of theorems for FOL, HOL and ZF. New
10667 commands including qed, qed_goal and bind_thm store theorems in the database.
10669 * Simple database queries: return a named theorem (get_thm) or all theorems of
10670 a given theory (thms_of), or find out what theory a theorem was proved in
10673 * Bugs fixed in the inductive definition and datatype packages;
10675 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10676 and HOL_dup_cs obsolete;
10678 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10681 * Simpler definition of function space in ZF;
10683 * new results about cardinal and ordinal arithmetic in ZF;
10685 * 'subtype' facility in HOL for introducing new types as subsets of existing
10688 :mode=isabelle-news:wrap=hard:maxLineLen=72: